{"meta":{"query_hash":"038a4c4cc89e","filters":{"topic":"Coding theory and cryptography"},"cohort_total":1096,"direct_labels_cover":0,"predictions_cover":1096,"exported":1096,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/038a4c4cc89e","api":"https://metacan.xera.ac/api/v1/cohort?topic=Coding+theory+and+cryptography"},"results":[{"id":"W102471322","doi":"10.11575/prism/30585","title":"ASYMPTOTICALLY EFFICIENT ALGORITHMS FOR THE FROBENIUS FORM","year":2000,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Computation; Algorithm; Matrix (chemical analysis); Asymptotically optimal algorithm; Finite field; Matrix multiplication; Field (mathematics); Computational complexity theory; Invariant (physics); Discrete mathematics; Pure mathematics","score_opus":0.009492412432150656,"score_gpt":0.19100361902651192,"score_spread":0.18151120659436126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102471322","genre_codex":"methods","genre_gemma":"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.038276725,0.00014739501,0.95346534,0.00044020204,0.000052032363,0.00014905895,0.00011265786,0.0014551418,0.0059015015],"genre_scores_gemma":[0.2955447,0.00017190818,0.6937894,0.000124739,0.000103150756,0.00034081913,0.0004252626,0.0003039419,0.00919601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980835,0.00038447423,0.00010049611,0.00045550652,0.0006787267,0.0002972293],"domain_scores_gemma":[0.9978403,0.00080684,0.00020130568,0.00071452075,0.00034917588,0.00008792582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011072461,0.00079849403,0.00085571635,0.0011469207,0.0009937624,0.001560508,0.0016797554,0.00089960586,0.00813039],"category_scores_gemma":[0.006048141,0.00047812038,0.00081522414,0.00092832063,0.0015306963,0.0033104648,0.0022351514,0.001664841,0.0027258769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000532433,0.00019320297,0.000998281,0.00017973273,0.00004307074,0.00014363487,0.0004921719,0.08661079,0.021150969,0.5412529,0.010201214,0.3382016],"study_design_scores_gemma":[0.00018597419,0.00016794952,0.0002613066,0.000036641082,0.000016526616,0.00020785074,0.0001279146,0.552383,0.017813854,0.41986647,0.008879451,0.000052981188],"about_ca_topic_score_codex":0.0022147263,"about_ca_topic_score_gemma":0.0029471323,"teacher_disagreement_score":0.00813039,"about_ca_system_score_codex":0.0018081582,"about_ca_system_score_gemma":0.002878879,"threshold_uncertainty_score":0.02719891},"labels":[],"label_agreement":null},{"id":"W104545548","doi":"10.1007/978-1-4471-0673-9_10","title":"On the Linear Complexity of Generalised Legendre Sequence","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Legendre polynomials; Sequence (biology); Mathematics; Computer science; Mathematical analysis; Biology; Genetics","score_opus":0.14476162486024358,"score_gpt":0.2575739493118693,"score_spread":0.1128123244516257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104545548","genre_codex":"other","genre_gemma":"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.03959449,0.018964887,0.16265795,0.006238916,0.0017462599,0.000070145245,0.00038207739,0.0003483932,0.7699969],"genre_scores_gemma":[0.5704457,0.02282957,0.08813161,0.0022572249,0.005033392,0.0002373398,0.00071831007,0.00045742857,0.3098894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994172,0.00013875001,0.00002393651,0.00006936452,0.00028198765,0.0000687205],"domain_scores_gemma":[0.99884087,0.00078736217,0.000053429834,0.00014177311,0.00013676693,0.000039703868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005252951,0.00073204836,0.00072773336,0.0014914903,0.0008711262,0.0027053426,0.0008147493,0.0010042393,0.010037916],"category_scores_gemma":[0.002539207,0.0004309889,0.00055534625,0.0019200522,0.0031454796,0.0056526456,0.0011848825,0.003647456,0.0026287332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009276447,0.0000058613264,0.00002983593,0.000039687133,0.0000026077532,0.000021908036,0.0000726975,0.0010365662,0.00036563817,0.9840401,0.0038405734,0.010535291],"study_design_scores_gemma":[0.000003820948,0.000010003463,0.00006966286,0.00001916041,0.0000027407557,0.000084603336,0.000016910972,0.002180789,0.00044000914,0.9799243,0.017238824,0.000009139077],"about_ca_topic_score_codex":0.0007460383,"about_ca_topic_score_gemma":0.00067211,"teacher_disagreement_score":0.010037916,"about_ca_system_score_codex":0.0018439937,"about_ca_system_score_gemma":0.0008043365,"threshold_uncertainty_score":0.033580244},"labels":[],"label_agreement":null},{"id":"W1055513040","doi":"10.1007/s12095-015-0141-x","title":"Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; S-box; Nonlinear system; Differential cryptanalysis; Differential (mechanical device); Cryptography; Mathematics; Linear cryptanalysis; Permutation (music); Substitution (logic); Discrete mathematics; Stream cipher; Pure mathematics; Algorithm; Computer science; Physics; Quantum mechanics","score_opus":0.04080440793990234,"score_gpt":0.2805707567951725,"score_spread":0.23976634885527018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1055513040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.26660264,0.0013537192,0.6668167,0.0016552915,0.00044047897,0.00018479947,0.00051316014,0.00034571317,0.06208757],"genre_scores_gemma":[0.9352571,0.0006792951,0.05269962,0.00037874002,0.0007884506,0.00014719774,0.0002816063,0.00016786993,0.00960012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965139,0.0012302257,0.0002468473,0.00046436113,0.0011717298,0.00037286305],"domain_scores_gemma":[0.9808942,0.01207642,0.0011547515,0.001893116,0.0029527515,0.0010288798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043282313,0.0009465723,0.0011443747,0.004091212,0.0013399579,0.0028474175,0.001810978,0.0016103236,0.0052510346],"category_scores_gemma":[0.024666501,0.00044013,0.0008463895,0.0020118582,0.005021362,0.007414172,0.005390337,0.0026906878,0.0008330136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019560277,0.000027750735,0.0009111034,0.0000755516,0.000012654123,0.00014454639,0.00014200457,0.0048289173,0.0047963583,0.97634363,0.0007166468,0.011805311],"study_design_scores_gemma":[0.00003829425,0.00018485698,0.0011072834,0.000059552065,0.000028175831,0.00051076,0.000119407276,0.07202948,0.009601712,0.9119296,0.0043261945,0.00006467732],"about_ca_topic_score_codex":0.0003615773,"about_ca_topic_score_gemma":0.00024507,"teacher_disagreement_score":0.0052510346,"about_ca_system_score_codex":0.0014986928,"about_ca_system_score_gemma":0.0008283273,"threshold_uncertainty_score":0.02289015},"labels":[],"label_agreement":null},{"id":"W1153974305","doi":"","title":"The absorbant number of generalized de Bruijn digraphs","year":2015,"lang":"nl","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"De Bruijn sequence; Mathematics; Combinatorics","score_opus":0.020482688134634705,"score_gpt":0.26444522987266283,"score_spread":0.24396254173802812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1153974305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7527996,0.0010522148,0.105309084,0.0031439944,0.00032802063,0.0000749124,0.0006965704,0.00060141017,0.13599423],"genre_scores_gemma":[0.9632281,0.0006002328,0.013216205,0.0004202571,0.00037539302,0.0001110083,0.00042092134,0.00017170444,0.021456257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998809,0.0003440103,0.00005770472,0.0002229055,0.00029243567,0.0002739116],"domain_scores_gemma":[0.9934309,0.004316034,0.0005844259,0.0005922355,0.0002981004,0.0007782932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012358858,0.00096363685,0.0014037859,0.0033705058,0.002435299,0.005633085,0.0019421403,0.0017101452,0.009257407],"category_scores_gemma":[0.0057068975,0.0009938802,0.0008203936,0.00237574,0.0033332885,0.006424702,0.0021437337,0.0033644596,0.0011908057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011494181,0.000034813962,0.00025092842,0.000052424835,0.00001678125,0.00009146594,0.00020401736,0.0024640085,0.0017445997,0.9885915,0.0014375917,0.0049969917],"study_design_scores_gemma":[0.000034236138,0.000026692542,0.0003075754,0.000030525498,0.000027250979,0.00017342679,0.00006012275,0.014839243,0.0012834715,0.980112,0.0030816875,0.000023855226],"about_ca_topic_score_codex":0.0006052087,"about_ca_topic_score_gemma":0.0007115798,"teacher_disagreement_score":0.009257407,"about_ca_system_score_codex":0.0015613099,"about_ca_system_score_gemma":0.0007093692,"threshold_uncertainty_score":0.030969083},"labels":[],"label_agreement":null},{"id":"W118358129","doi":"","title":"A Diffie-Hellman-like Key Exchange Protocol Based on Multivariate Ore Polynomials.","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polynomial ring; Ring (chemistry); Polynomial; Diffie–Hellman key exchange; Extension (predicate logic); Protocol (science); Key exchange; Computer science; Euclidean geometry; Key (lock); Discrete mathematics; Commutative ring; Commutative property; Mathematics; Theoretical computer science; Public-key cryptography; Computer network; Computer security; Programming language; Encryption; Geometry; Chemistry","score_opus":0.05824747959151991,"score_gpt":0.20658063988747757,"score_spread":0.14833316029595767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118358129","genre_codex":"methods","genre_gemma":"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.030113848,0.00036537598,0.9553814,0.0010928515,0.00029295843,0.0003570004,0.00017860721,0.0004376756,0.011780374],"genre_scores_gemma":[0.6845903,0.0006757997,0.29632208,0.00059763825,0.00020790531,0.00043302312,0.0003152552,0.00007243254,0.01678545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984138,0.0005689709,0.000086365704,0.00026201492,0.0004853114,0.0001833826],"domain_scores_gemma":[0.9987803,0.00033032167,0.0001932804,0.00046498136,0.00011600027,0.000115229115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021621748,0.00037785634,0.00043831082,0.00047206087,0.0008378664,0.0010149422,0.0013197542,0.0010222786,0.0032650973],"category_scores_gemma":[0.0026858323,0.00023380501,0.0005463132,0.00058061857,0.0013780541,0.004613639,0.003087177,0.001974198,0.00075148465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003724701,0.00026261937,0.0006571865,0.00029437736,0.000060222825,0.0003591759,0.0003531659,0.0070705735,0.0335873,0.8945561,0.0049290773,0.057497725],"study_design_scores_gemma":[0.00035823823,0.000997572,0.0016303026,0.00010490223,0.00017597791,0.0027198244,0.00025845415,0.26476416,0.1011616,0.45718744,0.17039365,0.00024784447],"about_ca_topic_score_codex":0.0001723402,"about_ca_topic_score_gemma":0.0002138335,"teacher_disagreement_score":0.0032650973,"about_ca_system_score_codex":0.00066613866,"about_ca_system_score_gemma":0.0009407633,"threshold_uncertainty_score":0.0114347935},"labels":[],"label_agreement":null},{"id":"W11914327","doi":"10.1093/ije/31.1.240","title":"Some NP-Completeness Results on Partial Steiner Triple Systems and Parallel Classes.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Completeness (order theory); Steiner tree problem; Combinatorics; Steiner system; Discrete mathematics; Mathematical analysis","score_opus":0.01615037672060516,"score_gpt":0.2279742945901348,"score_spread":0.21182391786952964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11914327","genre_codex":"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.25230947,0.006211665,0.51198107,0.036380153,0.0012725536,0.00077026576,0.014151144,0.0016573335,0.17526636],"genre_scores_gemma":[0.82527244,0.00446431,0.1289726,0.0045359577,0.0019283595,0.00093962095,0.00928304,0.00054302934,0.024060752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976247,0.0005342469,0.00021359535,0.0005065962,0.00067347166,0.00044740454],"domain_scores_gemma":[0.9757868,0.019629557,0.0009938411,0.0017189903,0.0012156572,0.0006550962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024394614,0.0011466498,0.0014238891,0.0016412617,0.0035709927,0.0042373277,0.002417925,0.002145295,0.016999295],"category_scores_gemma":[0.016219556,0.0010326309,0.003114505,0.0033223585,0.003507,0.011010532,0.003585069,0.00614145,0.0016075929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033459387,0.00022155403,0.0020764414,0.0010880994,0.000206414,0.0007242417,0.0012217356,0.032839227,0.0020380076,0.87060875,0.050221935,0.03841895],"study_design_scores_gemma":[0.000057808244,0.000026631496,0.00037234448,0.000042947726,0.000041130137,0.0003149108,0.000176152,0.020057514,0.00032076344,0.97297466,0.0055932137,0.000021868836],"about_ca_topic_score_codex":0.003681852,"about_ca_topic_score_gemma":0.004226469,"teacher_disagreement_score":0.016999295,"about_ca_system_score_codex":0.0028364086,"about_ca_system_score_gemma":0.0018800659,"threshold_uncertainty_score":0.056868315},"labels":[],"label_agreement":null},{"id":"W12542839","doi":"10.1186/1472-6920-3-1","title":"Decoding Goppa Codes with MAGMA.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Magma; Algorithm; Geology; Geochemistry","score_opus":0.010724034832790583,"score_gpt":0.22322160053674717,"score_spread":0.2124975657039566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12542839","genre_codex":"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.045969214,0.0016258992,0.8866868,0.0033255364,0.0008756894,0.00020210775,0.0006168767,0.0024257868,0.058272064],"genre_scores_gemma":[0.71858066,0.0008131367,0.24511868,0.0012999614,0.00041888154,0.00023951085,0.0006733,0.00040787066,0.03244799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830306,0.00054297823,0.00008782811,0.00026589388,0.0004859643,0.00031431558],"domain_scores_gemma":[0.99714905,0.0009859515,0.00024374195,0.0011396206,0.00033680937,0.00014479099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015454913,0.00058689236,0.0006305712,0.001088932,0.0011322944,0.002481894,0.0009239136,0.001668617,0.005340155],"category_scores_gemma":[0.01113709,0.00032419068,0.0007383716,0.00093770714,0.0018256849,0.0032470466,0.003669023,0.0021399416,0.0035094435],"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.00038068657,0.000050264596,0.0010920431,0.00012276665,0.000054408833,0.00019066985,0.00032401262,0.010003162,0.0060323644,0.8704016,0.012181417,0.09916666],"study_design_scores_gemma":[0.000042289732,0.000045771823,0.00028305617,0.00006348501,0.000026259293,0.00021161548,0.000059569073,0.07034699,0.009312477,0.9051396,0.014434158,0.000034701032],"about_ca_topic_score_codex":0.0014807788,"about_ca_topic_score_gemma":0.002367707,"teacher_disagreement_score":0.005340155,"about_ca_system_score_codex":0.0011920575,"about_ca_system_score_gemma":0.0018600072,"threshold_uncertainty_score":0.017864585},"labels":[],"label_agreement":null},{"id":"W127787461","doi":"10.1007/978-3-642-35999-6_8","title":"Cryptographically Strong de Bruijn Sequences with Large Periods","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"De Bruijn sequence; Computer science; Combinatorics; Mathematics","score_opus":0.01049555853560011,"score_gpt":0.2268672857817493,"score_spread":0.2163717272461492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127787461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.20411952,0.0034900305,0.5711205,0.005642627,0.0015515833,0.00029029898,0.00060155767,0.0012003259,0.21198347],"genre_scores_gemma":[0.8500692,0.0020724952,0.0874274,0.00067778875,0.0010653874,0.0003537549,0.00036313233,0.00036581958,0.057605013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821764,0.0005480236,0.00010928242,0.00020164931,0.0006722208,0.0002511688],"domain_scores_gemma":[0.9944734,0.003071725,0.00051022676,0.0013205033,0.0003641915,0.00025990265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016822915,0.0008950146,0.00066823635,0.001304457,0.0012738567,0.0030283516,0.00079304597,0.0012685021,0.006975122],"category_scores_gemma":[0.007551775,0.0009183169,0.00046075566,0.0015487942,0.0028052083,0.005595149,0.0030204814,0.0037263155,0.0030166956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120669014,0.000022454946,0.00009150707,0.000099408346,0.000007694347,0.00007560137,0.00009702317,0.0028806748,0.0037502067,0.97026896,0.0021699532,0.020415874],"study_design_scores_gemma":[0.000036670368,0.000063208325,0.00009782532,0.000040752526,0.0000108027325,0.00026535292,0.000034795143,0.008661875,0.0069697355,0.970674,0.013121161,0.00002394806],"about_ca_topic_score_codex":0.000072641364,"about_ca_topic_score_gemma":0.00010857869,"teacher_disagreement_score":0.006975122,"about_ca_system_score_codex":0.0009066638,"about_ca_system_score_gemma":0.0010928286,"threshold_uncertainty_score":0.023334086},"labels":[],"label_agreement":null},{"id":"W1409037350","doi":"10.1007/978-3-642-36883-7_1","title":"DAFA - A Lightweight DES Augmented Finite Automaton Cryptosystem","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cryptosystem; Hybrid cryptosystem; Encryption; Computer science; Theoretical computer science; Finite-state machine; Timed automaton; Key (lock); Automaton; Algorithm; Computer network; Computer security","score_opus":0.020171387946917592,"score_gpt":0.2210664401697527,"score_spread":0.2008950522228351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1409037350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.106337816,0.0012627728,0.82203484,0.00126161,0.00086432445,0.0003414389,0.0010854362,0.020376205,0.046435542],"genre_scores_gemma":[0.7253605,0.0005010251,0.22458659,0.00039142685,0.00017237867,0.00024162151,0.0009022182,0.000524982,0.047319133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995859,0.00006558238,0.00003522149,0.0000815824,0.00015732936,0.000074294236],"domain_scores_gemma":[0.9996153,0.00008219097,0.000021896229,0.00016996617,0.00008282431,0.000027774726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028064623,0.0004300503,0.0004882607,0.0005113364,0.0006876483,0.001142721,0.0006096279,0.000644742,0.0086501455],"category_scores_gemma":[0.0007571371,0.00026246218,0.00047660494,0.00039766473,0.0005324419,0.0017441614,0.001200974,0.0009981014,0.0032394857],"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.0016544688,0.000317719,0.0011185816,0.000506712,0.00009513204,0.0005623755,0.00028625724,0.025279753,0.16760828,0.3531069,0.02960083,0.41986302],"study_design_scores_gemma":[0.00034048295,0.0007470686,0.0010462485,0.0001815439,0.00014880126,0.0016208354,0.00010410991,0.2680365,0.21007049,0.2967311,0.22082476,0.00014799894],"about_ca_topic_score_codex":0.00039124244,"about_ca_topic_score_gemma":0.00070721924,"teacher_disagreement_score":0.0086501455,"about_ca_system_score_codex":0.00072468974,"about_ca_system_score_gemma":0.00086761883,"threshold_uncertainty_score":0.028937638},"labels":[],"label_agreement":null},{"id":"W1480437861","doi":"10.1007/3-540-44706-7_8","title":"On the Interpolation Attacks on Block Ciphers","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lagrange polynomial; Polynomial interpolation; Interpolation (computer graphics); Polynomial; Discrete mathematics; Algebraic function; Matrix polynomial; Algebra over a field; Algebraic number; Linear interpolation; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.018221020170992308,"score_gpt":0.24229249926363322,"score_spread":0.2240714790926409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480437861","genre_codex":"methods","genre_gemma":"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.19745572,0.010431253,0.4685958,0.007046366,0.0012164623,0.00025568224,0.0005760199,0.00068892346,0.31373373],"genre_scores_gemma":[0.8891115,0.009202448,0.03899891,0.00063817966,0.0014035838,0.00019237598,0.000405767,0.00021952791,0.05982761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872524,0.0004049773,0.000048978312,0.00010548156,0.0004512221,0.00026410545],"domain_scores_gemma":[0.9970324,0.0019112774,0.0001906305,0.00060789724,0.00017738291,0.00008043287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015787128,0.0011296392,0.000987117,0.0016061501,0.0010692318,0.002089852,0.0008063894,0.001455765,0.007258217],"category_scores_gemma":[0.004719995,0.00062990864,0.00091005914,0.0015961697,0.0034304322,0.005778474,0.0025651143,0.0035670719,0.0014908066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026923761,0.000037001308,0.00018799613,0.000072798604,0.000017781616,0.000082382736,0.00012489394,0.014498732,0.0023763604,0.94557285,0.0044298135,0.032330148],"study_design_scores_gemma":[0.000040764462,0.000054649372,0.00017410005,0.0000554578,0.00001537573,0.00017155377,0.00003052957,0.03525443,0.002782164,0.9519494,0.0094510885,0.000020343654],"about_ca_topic_score_codex":0.00036462708,"about_ca_topic_score_gemma":0.00025508908,"teacher_disagreement_score":0.007258217,"about_ca_system_score_codex":0.0011539062,"about_ca_system_score_gemma":0.000673999,"threshold_uncertainty_score":0.024281144},"labels":[],"label_agreement":null},{"id":"W1482661747","doi":"10.1007/978-3-540-77224-8_2","title":"A Survey of Recent Attacks on the Filter Generator","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shift register; Generator (circuit theory); Self-shrinking generator; Stream cipher; Computer science; Boolean function; Linear feedback shift register; Filter (signal processing); Key (lock); Arithmetic; Computer hardware; Algorithm; Function (biology); Mathematics; Electrical engineering; Chip; Telecommunications; Engineering; Cryptography; Computer security; Voltage; Power (physics); Physics","score_opus":0.06693660021298899,"score_gpt":0.28198977806372466,"score_spread":0.2150531778507357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482661747","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041222267,0.24778615,0.5546862,0.012961646,0.0027835325,0.00032355863,0.00068322,0.0021756173,0.13737781],"genre_scores_gemma":[0.49330494,0.2744896,0.16816245,0.0058034128,0.0096150255,0.0005036287,0.0019021935,0.0006990752,0.045519676],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743634,0.00069507567,0.00017335924,0.00031491992,0.0011273943,0.00025289957],"domain_scores_gemma":[0.9962612,0.002202326,0.00024849336,0.00090306334,0.0003008112,0.000084067375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018604447,0.0016476451,0.0015419032,0.0027485918,0.0015033537,0.0031939978,0.0013776027,0.0026355945,0.005809369],"category_scores_gemma":[0.0048018093,0.0008496795,0.0010392888,0.0037406124,0.0019066518,0.0077749053,0.0022694159,0.0027811723,0.0033317173],"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.00039121218,0.00020410321,0.0019587527,0.0019502132,0.00021515306,0.00047905493,0.00022227595,0.016979802,0.0074435086,0.3032935,0.046210714,0.62065166],"study_design_scores_gemma":[0.00014549505,0.0004554413,0.00183591,0.0010495094,0.00030292541,0.006805262,0.000204884,0.082258254,0.021137474,0.55525565,0.33036336,0.00018578957],"about_ca_topic_score_codex":0.00026580266,"about_ca_topic_score_gemma":0.00028591047,"teacher_disagreement_score":0.005809369,"about_ca_system_score_codex":0.001037386,"about_ca_system_score_gemma":0.00056298805,"threshold_uncertainty_score":0.019434273},"labels":[],"label_agreement":null},{"id":"W1483070169","doi":"10.1002/9781118336816.ch4","title":"Irreducibility and Factorization","year":2012,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Irreducibility; Adjunction; Factorization; Mathematics; Pure mathematics; Algebra over a field; Combinatorics; Algorithm","score_opus":0.011500891406426758,"score_gpt":0.21948272758431406,"score_spread":0.2079818361778873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483070169","genre_codex":"other","genre_gemma":"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.04788259,0.01973868,0.08275144,0.0091777025,0.0018207603,0.000037143025,0.00035073422,0.00042632257,0.8378147],"genre_scores_gemma":[0.7970479,0.0151652675,0.01709451,0.0017448117,0.0035169292,0.000051462594,0.00046754538,0.00029941485,0.16461214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998919,0.0002650588,0.00006116263,0.00022512914,0.0003685151,0.00016110182],"domain_scores_gemma":[0.99913675,0.00040022007,0.00006916145,0.00016747683,0.00015473616,0.00007165309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011602378,0.00061442656,0.00054400036,0.0013190127,0.0015644856,0.0035955992,0.0004906347,0.0006532811,0.0154032335],"category_scores_gemma":[0.002253026,0.00027602815,0.00070853415,0.0013010708,0.005357957,0.007980176,0.0020927477,0.00338045,0.0026633497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004985922,0.0000039592787,0.00003007957,0.000016016067,9.20268e-7,0.000014797657,0.00013435945,0.00006630484,0.00014552377,0.992247,0.0013686275,0.0059675407],"study_design_scores_gemma":[0.000003061354,0.000006978166,0.00006153587,0.000017541988,0.0000016589843,0.000057666202,0.00005920161,0.00018645935,0.00027923862,0.9718473,0.027475238,0.000004070911],"about_ca_topic_score_codex":0.0010893232,"about_ca_topic_score_gemma":0.0005972215,"teacher_disagreement_score":0.0154032335,"about_ca_system_score_codex":0.0017193232,"about_ca_system_score_gemma":0.00076845405,"threshold_uncertainty_score":0.05152899},"labels":[],"label_agreement":null},{"id":"W1485412461","doi":"10.1090/conm/655/13230","title":"On the Greatest Prime Factor of Some Divisibility Sequences","year":2015,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Divisibility rule; Prime (order theory); Factor (programming language); Prime factor; Combinatorics; Pure mathematics; Computer science; Programming language","score_opus":0.05242042567602115,"score_gpt":0.2786193819061626,"score_spread":0.22619895623014144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485412461","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.21925415,0.0028972188,0.30776945,0.005361425,0.0012940296,0.00011641446,0.0014524864,0.001511922,0.46034285],"genre_scores_gemma":[0.80141485,0.002232809,0.07007107,0.0014006182,0.0012443743,0.00022140626,0.0013360276,0.0013149079,0.12076393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865913,0.00026202257,0.00008165692,0.00039975892,0.0003403738,0.00025703892],"domain_scores_gemma":[0.99680376,0.0018089148,0.00021936465,0.00030339693,0.00060826004,0.0002562792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015020403,0.0015733734,0.00091194094,0.0021063988,0.0022324433,0.0032703516,0.00080454117,0.0011362302,0.021750297],"category_scores_gemma":[0.006266392,0.0006442309,0.0013223926,0.0015505184,0.0037098848,0.007127065,0.0023920895,0.0041706185,0.007094793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014347986,0.000029764566,0.00032846123,0.000106114516,0.00001459387,0.00023613746,0.00049037195,0.0011160192,0.0013958105,0.9690242,0.006249119,0.020865956],"study_design_scores_gemma":[0.000020467813,0.0000379616,0.0002965637,0.00004954961,0.000013700194,0.0001496577,0.00012015854,0.0025617606,0.0015765866,0.9815103,0.013640544,0.0000228572],"about_ca_topic_score_codex":0.0020559535,"about_ca_topic_score_gemma":0.0018116288,"teacher_disagreement_score":0.021750297,"about_ca_system_score_codex":0.0025327925,"about_ca_system_score_gemma":0.00083339826,"threshold_uncertainty_score":0.07276201},"labels":[],"label_agreement":null},{"id":"W1485596561","doi":"10.1007/11561354_19","title":"Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; Scheduling (production processes); Wireless; Hermitian matrix; Computer network; Code (set theory); Telecommunications; Programming language; Mathematical optimization; Mathematics","score_opus":0.020788367603709813,"score_gpt":0.2660016171101031,"score_spread":0.2452132495063933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485596561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.038090806,0.010872101,0.92341864,0.0013355325,0.0009949094,0.00021619083,0.00014355492,0.00069333636,0.024234977],"genre_scores_gemma":[0.6171174,0.009086717,0.33588433,0.0005416757,0.0011730926,0.00049997156,0.00030661386,0.00025000307,0.03514022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.00027723165,0.000045713936,0.00007205178,0.00030411695,0.000084875],"domain_scores_gemma":[0.9980458,0.0010288514,0.0001371495,0.00038404873,0.00033772303,0.00006638172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015099655,0.00066409877,0.000630622,0.0007097746,0.0005915975,0.0011755745,0.0012826236,0.00085206394,0.0020938544],"category_scores_gemma":[0.0030882764,0.00035356937,0.00030830278,0.0012882481,0.0013559181,0.001809477,0.0010527746,0.0013491208,0.00045624087],"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.00031992176,0.00009554146,0.0002656758,0.00027057072,0.000045733836,0.00017350471,0.00032801655,0.07449612,0.015393135,0.7190245,0.010207952,0.17937931],"study_design_scores_gemma":[0.00009748703,0.00027407665,0.0003053277,0.0000836929,0.000048211597,0.00040135338,0.00012851215,0.4670078,0.011997644,0.47584033,0.04373459,0.000081105725],"about_ca_topic_score_codex":0.0007052903,"about_ca_topic_score_gemma":0.0011157144,"teacher_disagreement_score":0.0020938544,"about_ca_system_score_codex":0.0010559965,"about_ca_system_score_gemma":0.0011826415,"threshold_uncertainty_score":0.007985532},"labels":[],"label_agreement":null},{"id":"W1486394389","doi":"10.1016/j.disc.2014.03.002","title":"Semidefinite programming for permutation codes","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Permutation (music); Combinatorics; Permutation group; Conjugacy class; Upper and lower bounds; Order (exchange); Symmetric group; Discrete mathematics","score_opus":0.01757138752844671,"score_gpt":0.2605234870199942,"score_spread":0.2429520994915475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486394389","genre_codex":"methods","genre_gemma":"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.038495965,0.00075981603,0.9121329,0.002751647,0.00027127934,0.000108577515,0.0006515732,0.0002715154,0.04455677],"genre_scores_gemma":[0.6805896,0.0027394663,0.25156036,0.0018308546,0.0008973297,0.0009897099,0.0017380149,0.00061878114,0.059035912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984201,0.0007784172,0.00005043304,0.00023452367,0.00035795599,0.00015845514],"domain_scores_gemma":[0.99407876,0.0042602275,0.00035957398,0.00041928253,0.00057302136,0.00030925596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021790173,0.0016060392,0.0012099296,0.0007717906,0.00072001864,0.0029727013,0.0013470845,0.001300932,0.007841059],"category_scores_gemma":[0.008670049,0.0007378007,0.0007174579,0.0012932189,0.002393142,0.0037366713,0.0014907164,0.004245952,0.0012439372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006144685,0.000091541224,0.00013075862,0.00010513635,0.000018398314,0.00006234769,0.00009532434,0.037712194,0.0006305442,0.9402038,0.006969009,0.013919515],"study_design_scores_gemma":[0.000017563394,0.000027318978,0.00003592694,0.000015854557,0.0000036766978,0.000024662735,0.00001972285,0.11885994,0.0001768902,0.879323,0.0014847704,0.00001062671],"about_ca_topic_score_codex":0.0011258346,"about_ca_topic_score_gemma":0.0014652057,"teacher_disagreement_score":0.007841059,"about_ca_system_score_codex":0.0017005816,"about_ca_system_score_gemma":0.0018376224,"threshold_uncertainty_score":0.026230931},"labels":[],"label_agreement":null},{"id":"W1486886369","doi":"10.1109/mwscas.1993.343002","title":"An approach to double error correcting Reed-Solomon decoding without Chien search","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Berlekamp–Welch algorithm; Arithmetic; Code (set theory); Search algorithm; Sequential decoding; Symbol (formal); Theoretical computer science; Mathematics; Concatenated error correction code; Set (abstract data type); Block code","score_opus":0.07511058565965957,"score_gpt":0.29733168500230067,"score_spread":0.22222109934264112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486886369","genre_codex":"methods","genre_gemma":"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.001702386,0.0003965112,0.9927891,0.00011686895,0.0001340974,0.000047599744,0.00003081882,0.00056785555,0.0042149047],"genre_scores_gemma":[0.039541975,0.0007332629,0.9456629,0.0001762735,0.00009496809,0.00011543928,0.00014994976,0.00016829121,0.013356933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933904,0.00008493047,0.00003560942,0.00010239648,0.00038598978,0.000051990337],"domain_scores_gemma":[0.99954563,0.00012179087,0.000026683932,0.00008961516,0.0001968876,0.000019382413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003427029,0.0007724664,0.00056267047,0.0011959893,0.00084070186,0.0011762533,0.00087940675,0.00091505167,0.004707528],"category_scores_gemma":[0.0013734663,0.00035829673,0.0005924016,0.00073817174,0.00070890016,0.0011256434,0.0010265142,0.0013970401,0.00327014],"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.00014531697,0.00007279682,0.00039256996,0.00033732507,0.000062896004,0.0003829074,0.00023471711,0.044865843,0.06687263,0.23378326,0.008460084,0.6443897],"study_design_scores_gemma":[0.00007856995,0.00030912572,0.0003432991,0.0001685824,0.000069895155,0.0029483635,0.00009021827,0.5861682,0.10819856,0.1496305,0.15184465,0.0001499646],"about_ca_topic_score_codex":0.0014196959,"about_ca_topic_score_gemma":0.002087121,"teacher_disagreement_score":0.004707528,"about_ca_system_score_codex":0.0007329778,"about_ca_system_score_gemma":0.0015433179,"threshold_uncertainty_score":0.015748203},"labels":[],"label_agreement":null},{"id":"W1487285776","doi":"10.1007/3-540-44983-3_16","title":"On Welch-Gong Transformation Sequence Generators","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Transformation (genetics); Linear span; Golomb coding; Boolean function; Sequence (biology); Mathematics; Randomness; Discrete mathematics; Correlation attack; Pseudorandom number generator; Pseudorandom binary sequence; Combinatorics; Algorithm; Computer science; Binary number; Arithmetic; Cryptography; Statistics","score_opus":0.020299438594315204,"score_gpt":0.23967961475022667,"score_spread":0.21938017615591146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487285776","genre_codex":"methods","genre_gemma":"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.062471043,0.0017346365,0.7194067,0.0012777545,0.0013571722,0.00020538969,0.00036799224,0.0011630139,0.21201631],"genre_scores_gemma":[0.5871859,0.0025774885,0.16751805,0.0011005278,0.0010050274,0.00047598325,0.0010309034,0.001643033,0.2374631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994653,0.00017244522,0.000027230779,0.00008306934,0.00017173328,0.00008024849],"domain_scores_gemma":[0.9995047,0.00022557672,0.000036245423,0.00010522004,0.000083520645,0.000044743083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007201641,0.0012140053,0.0008311452,0.0019754865,0.0012206255,0.0013643722,0.000879833,0.0011743925,0.017160535],"category_scores_gemma":[0.001871792,0.00047118982,0.0008187597,0.0022178192,0.0017859559,0.0031041426,0.001980515,0.0023626261,0.005283912],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034037002,0.00001444177,0.00006159234,0.000023743267,0.000004098431,0.00006879271,0.00011802929,0.0012718999,0.001238005,0.9632758,0.002556737,0.031332776],"study_design_scores_gemma":[0.000009376748,0.000017341543,0.000046366753,0.0000113785145,0.0000038039932,0.00007660399,0.000021795979,0.004011281,0.0012860439,0.987058,0.007448451,0.000009630866],"about_ca_topic_score_codex":0.00042919477,"about_ca_topic_score_gemma":0.0005023264,"teacher_disagreement_score":0.017160535,"about_ca_system_score_codex":0.0006855005,"about_ca_system_score_gemma":0.00041026282,"threshold_uncertainty_score":0.057407737},"labels":[],"label_agreement":null},{"id":"W1490900877","doi":"10.1109/glocom.2001.966337","title":"Highly reliable data transmission using concatenated coding and hybrid-type I ARQ in DS-CDMA systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Convolutional code; Decoding methods; Retransmission; Algorithm; Hybrid automatic repeat request; Error detection and correction; Automatic repeat request; Viterbi decoder; Concatenated error correction code; Viterbi algorithm; Selective Repeat ARQ; Coding gain; Forward error correction; Transmission (telecommunications); Telecommunications; Block code","score_opus":0.07650628644300536,"score_gpt":0.25740373411247136,"score_spread":0.180897447669466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490900877","genre_codex":"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.69813323,0.0012197908,0.29460612,0.00018314399,0.000030066045,0.000042421478,0.00004259559,0.00025200163,0.0054906765],"genre_scores_gemma":[0.9838738,0.00015695662,0.01545542,0.00000891708,0.000011268139,0.000008906066,0.0000099084855,0.0000070161514,0.00046780257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989379,0.00043099758,0.00003322118,0.00007108032,0.00043178193,0.00009496091],"domain_scores_gemma":[0.9978848,0.0011205078,0.0003642533,0.0001513381,0.00043288915,0.00004622476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692925,0.00054669706,0.0004436173,0.00037842302,0.00033558425,0.00061027,0.0005272703,0.00047847556,0.00040982914],"category_scores_gemma":[0.002455712,0.00026499626,0.00019733097,0.0005835262,0.001015421,0.0007308233,0.00055209256,0.00030011978,0.00012055913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009978465,0.0000503461,0.0046452433,0.00019137394,0.00008875305,0.00071811926,0.00039959728,0.76694167,0.13135521,0.03280511,0.0004359605,0.06137074],"study_design_scores_gemma":[0.000019995095,0.00028713513,0.00090147404,0.000013630596,0.000036729856,0.00020411576,0.000043701013,0.9508784,0.04415089,0.002733673,0.00070241926,0.000027810498],"about_ca_topic_score_codex":0.001344724,"about_ca_topic_score_gemma":0.0020964635,"teacher_disagreement_score":0.001344724,"about_ca_system_score_codex":0.0007857962,"about_ca_system_score_gemma":0.0002921868,"threshold_uncertainty_score":0.005701363},"labels":[],"label_agreement":null},{"id":"W1491595969","doi":"10.1109/asap.1990.145465","title":"Array processing on finite polynomial rings","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Redundancy (engineering); Polynomial ring; Computer science; Testability; Computation; Overhead (engineering); Polynomial; Theoretical computer science; Computational complexity theory; Algorithm; Parallel computing; Mathematics","score_opus":0.021484041150828033,"score_gpt":0.21481304053629294,"score_spread":0.1933289993854649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491595969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.034303833,0.00052146986,0.94461006,0.00022429829,0.0001043078,0.00004385795,0.000105602485,0.0016084277,0.018478133],"genre_scores_gemma":[0.4893559,0.0011042731,0.48860216,0.0001703187,0.00020760731,0.00009727483,0.00031375673,0.00016715573,0.019981584],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997688,0.000049487837,0.000019765923,0.00004250066,0.00008519337,0.00003428351],"domain_scores_gemma":[0.9995776,0.00019073767,0.000032303564,0.00010518828,0.00008021121,0.000014061384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025286473,0.00032920728,0.00032436813,0.00047021106,0.00045304577,0.0010074471,0.0004954424,0.00035827694,0.006515125],"category_scores_gemma":[0.001105605,0.00016536792,0.00031570287,0.0006775561,0.00047765393,0.00149977,0.00062640075,0.00039952795,0.0022074308],"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.0005153146,0.000061587656,0.00044274525,0.00034959728,0.000042633714,0.00046490238,0.00042870865,0.1579033,0.13606803,0.2735719,0.009707791,0.42044342],"study_design_scores_gemma":[0.00006334596,0.00022325589,0.00029584754,0.000054890414,0.000020635067,0.0003753652,0.000120911434,0.7695927,0.095286086,0.10096536,0.03296331,0.000038307335],"about_ca_topic_score_codex":0.0007647342,"about_ca_topic_score_gemma":0.0010225245,"teacher_disagreement_score":0.006515125,"about_ca_system_score_codex":0.0004046149,"about_ca_system_score_gemma":0.00036509318,"threshold_uncertainty_score":0.021795213},"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":"W1498077172","doi":"10.1007/3-540-39799-x_34","title":"How to Construct Pseudo-random Permutations from Pseudo-random Functions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random permutation; Pseudorandom number generator; Permutation (music); Mathematics; Combinatorics; Pseudorandom permutation; Generator (circuit theory); Random function; Pseudorandom function family; Discrete mathematics; Invertible matrix; Pseudorandom generator; Algorithm; Random variable; Symmetric group; Pure mathematics; Physics","score_opus":0.018154682644453475,"score_gpt":0.24135369018950092,"score_spread":0.22319900754504746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498077172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.0055506164,0.00026623896,0.977768,0.0005935268,0.00030096923,0.00012953553,0.00015109529,0.00106458,0.014175503],"genre_scores_gemma":[0.12551086,0.0011351067,0.84390235,0.0006259852,0.00021625703,0.00041627034,0.0006369735,0.0013560454,0.026200067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868625,0.00035697193,0.00007446901,0.00017566611,0.00061038585,0.00009622422],"domain_scores_gemma":[0.998604,0.00060695567,0.000060071594,0.0004901342,0.00018232266,0.000056431498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010515322,0.0010849873,0.0008485456,0.0011755734,0.00094091776,0.0021123094,0.00091876456,0.0013893811,0.008572905],"category_scores_gemma":[0.005243573,0.0007914621,0.0014428454,0.001093769,0.0015157091,0.0043870537,0.0026678082,0.0027567674,0.0053802636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059740003,0.00004058519,0.00023200148,0.00024218779,0.000044244065,0.00017587723,0.00018068655,0.007648441,0.0065065552,0.83058417,0.007970756,0.1463147],"study_design_scores_gemma":[0.000027502145,0.000029524972,0.0001209265,0.000070577655,0.00002936273,0.0005235229,0.00004196209,0.028832272,0.0129442625,0.91681623,0.040520735,0.000043178447],"about_ca_topic_score_codex":0.00023738075,"about_ca_topic_score_gemma":0.00033021852,"teacher_disagreement_score":0.008572905,"about_ca_system_score_codex":0.00052932557,"about_ca_system_score_gemma":0.0006628771,"threshold_uncertainty_score":0.028679252},"labels":[],"label_agreement":null},{"id":"W1499185341","doi":"10.1109/ccece.2004.1347674","title":"Design of a high-speed (255,239) RS decoder using 0.18 μm CMOS","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Very-large-scale integration; Soft-decision decoder; CMOS; Decoding methods; Latency (audio); Parallel computing; Computer hardware; Electronic engineering; Algorithm; Embedded system; Engineering; Telecommunications","score_opus":0.052031596979778265,"score_gpt":0.2628484752812741,"score_spread":0.2108168783014958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499185341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.23264126,0.0014633856,0.7356188,0.00060182676,0.0003006902,0.0005578287,0.00045221025,0.0047052014,0.02365879],"genre_scores_gemma":[0.5611525,0.00058087194,0.42893612,0.00021678694,0.000079015415,0.00014816437,0.00024097723,0.000079167556,0.008566375],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998871,0.000011890466,0.000009038874,0.000026032614,0.000048652026,0.000017273489],"domain_scores_gemma":[0.99981993,0.00003855406,0.000031611067,0.000013279602,0.0000842576,0.000012409793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015447072,0.0002818193,0.00021318106,0.00029443734,0.00026015617,0.0004189642,0.00079420273,0.0003228653,0.0020229109],"category_scores_gemma":[0.0003182358,0.00017244178,0.00017010304,0.00020526313,0.00018463135,0.0003010988,0.0001718204,0.00022915729,0.0010261392],"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.00022880964,0.00009230033,0.0022412443,0.00032490352,0.000087706714,0.0005304739,0.0001708752,0.012091401,0.7826029,0.013400654,0.0040449393,0.18418373],"study_design_scores_gemma":[0.00018624653,0.0014003904,0.0026527287,0.00006110607,0.00017335765,0.0021570954,0.00009684335,0.117129326,0.80677265,0.0027717182,0.066543266,0.000055177992],"about_ca_topic_score_codex":0.0010536034,"about_ca_topic_score_gemma":0.0015108731,"teacher_disagreement_score":0.0020229109,"about_ca_system_score_codex":0.00045307644,"about_ca_system_score_gemma":0.0007035516,"threshold_uncertainty_score":0.0067673326},"labels":[],"label_agreement":null},{"id":"W1499326532","doi":"10.1007/0-387-34805-0_56","title":"Good S-Boxes Are Easy To Find","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bijection; Computer science; Cryptosystem; Independence (probability theory); Nonlinear system; Arithmetic; Algorithm; Theoretical computer science; Cryptography; Discrete mathematics; Mathematics; Statistics","score_opus":0.02246416249936636,"score_gpt":0.25627651318834527,"score_spread":0.2338123506889789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499326532","genre_codex":"other","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.03301976,0.008491172,0.30690894,0.0040296847,0.0020708884,0.00025330213,0.0014330064,0.0036833093,0.64010996],"genre_scores_gemma":[0.22928028,0.010216093,0.28665787,0.0016513666,0.0009616842,0.0004436001,0.0012911905,0.0037428348,0.465755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994294,0.00013170141,0.000032876625,0.00012531073,0.0002020956,0.0000786302],"domain_scores_gemma":[0.9989742,0.00043289023,0.00009215609,0.00026705442,0.00016026711,0.00007342295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007602162,0.0016165946,0.0014373872,0.0020065992,0.0014172365,0.0030823087,0.000694598,0.0015998031,0.049095735],"category_scores_gemma":[0.0030910508,0.0009196913,0.00073297124,0.001964164,0.0029041297,0.00758217,0.0026460926,0.0020538492,0.029615354],"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.000081914724,0.000021791773,0.00008758197,0.00032831982,0.000018087287,0.00007018656,0.00016607526,0.0008734505,0.0020269353,0.8892236,0.03230693,0.0747952],"study_design_scores_gemma":[0.00002772578,0.000037579506,0.00008221351,0.0001606059,0.000017403247,0.00032113996,0.00008606359,0.0008967737,0.0027328832,0.811836,0.18377227,0.000029394612],"about_ca_topic_score_codex":0.00014266714,"about_ca_topic_score_gemma":0.00022945354,"teacher_disagreement_score":0.049095735,"about_ca_system_score_codex":0.00059198594,"about_ca_system_score_gemma":0.00049547973,"threshold_uncertainty_score":0.16424161},"labels":[],"label_agreement":null},{"id":"W1503393710","doi":"10.1007/978-3-642-17517-6_25","title":"Computing Sparse Multiples of Polynomials","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplicative function; Degree (music); Multiple; Combinatorics; Finite field; Polynomial; Extension (predicate logic); Computational complexity theory; Constant (computer programming); Discrete mathematics; Mathematics; Time complexity; Field (mathematics); Order (exchange); Algorithm; Computer science; Arithmetic; Pure mathematics; Physics; Mathematical analysis","score_opus":0.018457738780916284,"score_gpt":0.24135644795938668,"score_spread":0.2228987091784704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503393710","genre_codex":"methods","genre_gemma":"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.16529812,0.0016583089,0.7715764,0.0021240863,0.00060497783,0.0000914336,0.000922921,0.0023355011,0.05538823],"genre_scores_gemma":[0.62284476,0.0013578702,0.33996302,0.00046909865,0.0007198497,0.00009001472,0.001978093,0.0005400214,0.03203736],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994173,0.00010634946,0.000026358655,0.00013681741,0.00022884522,0.00008429752],"domain_scores_gemma":[0.99844307,0.00079390267,0.00011418386,0.00034000826,0.00020210612,0.00010680025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004709382,0.0007687767,0.0010321903,0.0010423894,0.000673272,0.0016165029,0.0007674394,0.00060775405,0.012054432],"category_scores_gemma":[0.005115738,0.0005295769,0.0004369825,0.0019795322,0.0008026073,0.0033706774,0.002150194,0.0015499382,0.0028740335],"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.00058840815,0.000106197316,0.00160509,0.00044313836,0.00009510863,0.00032048544,0.00036225925,0.04445547,0.020507693,0.40345168,0.035271753,0.4927927],"study_design_scores_gemma":[0.00007415047,0.00014485967,0.0005600465,0.00008622663,0.000043732427,0.0005193401,0.00018223877,0.21469338,0.012212591,0.74523807,0.026210764,0.000034573197],"about_ca_topic_score_codex":0.00043532584,"about_ca_topic_score_gemma":0.0013628218,"teacher_disagreement_score":0.012054432,"about_ca_system_score_codex":0.0005464171,"about_ca_system_score_gemma":0.0004660848,"threshold_uncertainty_score":0.04032612},"labels":[],"label_agreement":null},{"id":"W1504604993","doi":"10.1109/isit.1993.748411","title":"A New Remainder Based Decoding Algorithm for Reed-Solomon Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Remainder; Berlekamp–Welch algorithm; Algorithm; Polynomial; Polynomial code; Decoding methods; Euclidean algorithm; Computation; List decoding; Computer science; Chinese remainder theorem; Mathematics; Sequential decoding; Arithmetic; Concatenated error correction code; Block code","score_opus":0.01713977745125817,"score_gpt":0.256591572027516,"score_spread":0.23945179457625781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504604993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.003489644,0.00021654328,0.9925882,0.000120009274,0.00011692088,0.00007329586,0.00006123718,0.0008491019,0.0024849586],"genre_scores_gemma":[0.04072161,0.00042022724,0.9487067,0.00012539802,0.00012953968,0.000110911,0.0002873418,0.00019142205,0.009306742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925953,0.00011504871,0.0000637756,0.00013476492,0.0003809423,0.00004592025],"domain_scores_gemma":[0.999553,0.000121088546,0.00003879076,0.00009473618,0.0001746864,0.000017582519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058067613,0.0007117263,0.00066109106,0.00092879974,0.00047288198,0.0009957834,0.0010354532,0.0008548342,0.0033858067],"category_scores_gemma":[0.0016347801,0.00033069044,0.0006003407,0.0006943409,0.0005110289,0.001807167,0.00089289376,0.0010952845,0.0031198408],"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.00030016818,0.00009456577,0.00046610687,0.0002712994,0.000059328617,0.00048788407,0.00027154814,0.067929044,0.076127045,0.18697512,0.0074810605,0.65953684],"study_design_scores_gemma":[0.00012922153,0.00033902796,0.0003476115,0.00008465177,0.000064450054,0.0017675802,0.00004787001,0.758008,0.07801031,0.076713815,0.084361464,0.00012600717],"about_ca_topic_score_codex":0.0006333463,"about_ca_topic_score_gemma":0.0009825999,"teacher_disagreement_score":0.0033858067,"about_ca_system_score_codex":0.0005728531,"about_ca_system_score_gemma":0.00093233166,"threshold_uncertainty_score":0.011326671},"labels":[],"label_agreement":null},{"id":"W1504958541","doi":"","title":"Irreducible cyclic codes of length 2pn.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.012311740047581175,"score_gpt":0.24737944442209656,"score_spread":0.23506770437451538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504958541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.54797494,0.0043371455,0.14583553,0.0035695715,0.001081063,0.00022981162,0.0036520963,0.0011793593,0.29214057],"genre_scores_gemma":[0.93649435,0.0012107866,0.015345751,0.00042539102,0.00032947087,0.000104331295,0.0014046,0.00009791545,0.044587296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998892,0.00020664975,0.00004667125,0.00012578403,0.00040451455,0.00032442462],"domain_scores_gemma":[0.9981667,0.00066343596,0.00028212272,0.00044074323,0.00027155035,0.00017540886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047022785,0.00053549436,0.00045773244,0.0011277916,0.0010830227,0.001261712,0.00046769658,0.0008320656,0.008796308],"category_scores_gemma":[0.0038052641,0.0002382158,0.00031601483,0.001445958,0.0010062337,0.00126942,0.001904149,0.0012495492,0.0021198883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003303518,0.00007996778,0.0012550327,0.00018742039,0.00002057526,0.00070806604,0.0003918848,0.0062333406,0.0094885975,0.9136129,0.011967562,0.05572436],"study_design_scores_gemma":[0.000052039308,0.00011413159,0.0016686195,0.00011546769,0.000021744454,0.0010204308,0.00013046611,0.018924333,0.008446657,0.921281,0.048173387,0.000051786723],"about_ca_topic_score_codex":0.00096551026,"about_ca_topic_score_gemma":0.0013547912,"teacher_disagreement_score":0.008796308,"about_ca_system_score_codex":0.0007592049,"about_ca_system_score_gemma":0.0014058815,"threshold_uncertainty_score":0.029426575},"labels":[],"label_agreement":null},{"id":"W1505242526","doi":"10.1007/3-540-45311-3_12","title":"Frameproof and IPP Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Computer science; Property (philosophy); Generalization; Class (philosophy); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Computer security; Artificial intelligence","score_opus":0.013638423814225266,"score_gpt":0.2320977954967139,"score_spread":0.21845937168248863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505242526","genre_codex":"other","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.022619834,0.008928151,0.4134243,0.006058409,0.0016618312,0.00011651295,0.0007428442,0.0010018048,0.5454462],"genre_scores_gemma":[0.56385684,0.015226938,0.13128942,0.0020876324,0.0029530644,0.0006000355,0.0013894017,0.0011232109,0.28147355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992562,0.00018423442,0.00003184137,0.00008943444,0.00032988234,0.00010845342],"domain_scores_gemma":[0.9989724,0.00052421656,0.00006519197,0.0002494994,0.00015177361,0.00003702897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006451482,0.000969104,0.0006610712,0.0014631246,0.0014923376,0.002661581,0.0007430653,0.0012544009,0.012487294],"category_scores_gemma":[0.0035266057,0.00048244535,0.0005412024,0.0021994957,0.0023294452,0.004607494,0.0014984737,0.0034348657,0.0042964555],"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.00001556817,0.000007066004,0.000017940312,0.000041423446,0.0000018512595,0.000022724837,0.00006208221,0.0006176721,0.00025563955,0.96528596,0.0074736476,0.026198624],"study_design_scores_gemma":[0.000006761972,0.0000070617134,0.000023350874,0.000025017736,0.0000038569437,0.000062836974,0.000012741779,0.0010554888,0.0005976894,0.9663277,0.031870913,0.0000066249386],"about_ca_topic_score_codex":0.00089679146,"about_ca_topic_score_gemma":0.00049004296,"teacher_disagreement_score":0.012487294,"about_ca_system_score_codex":0.0016875836,"about_ca_system_score_gemma":0.0011319639,"threshold_uncertainty_score":0.041774154},"labels":[],"label_agreement":null},{"id":"W1506034437","doi":"10.1007/11799313_24","title":"Upper Bounds on Algebraic Immunity of Boolean Power Functions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Boolean function; Combinatorics; Mathematics; Degree (music); Algebraic number; Upper and lower bounds; Inverse; Discrete mathematics; Cipher; Stream cipher; Function (biology); Algorithm; Cryptography; Computer science; Physics","score_opus":0.009893089772609848,"score_gpt":0.21856680517346075,"score_spread":0.2086737154008509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506034437","genre_codex":"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.22200534,0.008982959,0.37316763,0.010880541,0.0013701781,0.0002248444,0.001423236,0.001962972,0.37998235],"genre_scores_gemma":[0.92989975,0.005025161,0.036030635,0.0015101759,0.0039201514,0.0003906516,0.0011942054,0.0005265507,0.021502681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949587,0.00090559653,0.00020189138,0.00094796065,0.0017685057,0.0012174471],"domain_scores_gemma":[0.94831055,0.04209805,0.0013517501,0.0035404693,0.0021945506,0.0025046272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052301013,0.0022702343,0.0030340897,0.0059828875,0.0026949188,0.007269013,0.004882956,0.0026284256,0.017788528],"category_scores_gemma":[0.032762982,0.0013470857,0.0022947306,0.0035653284,0.008265678,0.017079113,0.0082715,0.010846611,0.0030595383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033844315,0.00017526346,0.0009052432,0.00026287412,0.000049916172,0.00011378146,0.00036008706,0.0075707096,0.0029822432,0.95732695,0.0064982874,0.023416223],"study_design_scores_gemma":[0.000029911562,0.000054686392,0.00045405433,0.00006489007,0.00005052048,0.00017322508,0.000055415723,0.018860515,0.0014900595,0.9751658,0.0035718973,0.000029077257],"about_ca_topic_score_codex":0.00040324315,"about_ca_topic_score_gemma":0.00050091377,"teacher_disagreement_score":0.017788528,"about_ca_system_score_codex":0.003373956,"about_ca_system_score_gemma":0.0012112252,"threshold_uncertainty_score":0.059508562},"labels":[],"label_agreement":null},{"id":"W1509953781","doi":"10.1109/tit.2015.2462846","title":"Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore; National Science Foundation","keywords":"Disjoint sets; Erasure code; Header; Block code; Mathematics; Discrete mathematics; Computer science; Repetition code; Coset; Linear code; Decoding methods; Algorithm; Statistics","score_opus":0.017193150510787302,"score_gpt":0.2138287944117505,"score_spread":0.19663564390096322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509953781","genre_codex":"methods","genre_gemma":"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.076371476,0.0015694713,0.8936607,0.0028886078,0.00012442109,0.0001008933,0.0001774076,0.0005243511,0.024582757],"genre_scores_gemma":[0.8931467,0.0014213985,0.10097082,0.00045496484,0.0002582789,0.00023625672,0.00013391461,0.00023739958,0.0031402844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911889,0.0038282324,0.00026854954,0.0010158642,0.00249302,0.0012053744],"domain_scores_gemma":[0.90514314,0.071370214,0.004398148,0.015058112,0.0031113434,0.00091895723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010809088,0.0016162982,0.0016777848,0.0021231822,0.0015957139,0.0034007195,0.0033012345,0.002277905,0.003353549],"category_scores_gemma":[0.09798345,0.0010266727,0.0009186306,0.0021274094,0.0057353564,0.010360453,0.0058329445,0.0049513956,0.00068437745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033189956,0.00014070341,0.0023375503,0.00023986283,0.00008411244,0.00028097306,0.0004279491,0.17008226,0.009274965,0.7692624,0.0020436675,0.045493707],"study_design_scores_gemma":[0.00004400803,0.0002154026,0.0006614,0.00012498902,0.000050913684,0.0008434028,0.00016188176,0.5181885,0.01306953,0.46429694,0.002280428,0.00006267025],"about_ca_topic_score_codex":0.00070574577,"about_ca_topic_score_gemma":0.00060676644,"teacher_disagreement_score":0.010809088,"about_ca_system_score_codex":0.0036863275,"about_ca_system_score_gemma":0.0018731743,"threshold_uncertainty_score":0.05716461},"labels":[],"label_agreement":null},{"id":"W1511609224","doi":"","title":"No maximal partial spread of size 115 in PG(3,11)","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009746909160056534,"score_gpt":0.2230698239956414,"score_spread":0.21332291483558488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511609224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.78215283,0.0011173532,0.05054933,0.006267545,0.00041730606,0.00019880613,0.003963931,0.0019343803,0.15339842],"genre_scores_gemma":[0.95664144,0.00038293758,0.011572337,0.0008191109,0.00020781017,0.0001854271,0.0023975032,0.00022512126,0.027568307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872005,0.00022334099,0.00007883198,0.0002964736,0.0003515782,0.00032975723],"domain_scores_gemma":[0.9962704,0.0019887637,0.00046898218,0.0005887476,0.00017228688,0.000510738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084700953,0.00090733136,0.0015636969,0.0010176683,0.0026302326,0.0036615212,0.0010145009,0.0019406705,0.02475028],"category_scores_gemma":[0.0039946223,0.0006630029,0.001167777,0.0013235209,0.0022481873,0.005284697,0.003022067,0.0025705062,0.0041058874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033306975,0.00019239323,0.0028028595,0.0004712136,0.00019715566,0.00075396005,0.0009765733,0.0037528032,0.029024817,0.8952325,0.019618848,0.043646112],"study_design_scores_gemma":[0.0005262096,0.00023697436,0.0021435563,0.00012835703,0.00015574423,0.0009177748,0.0003191408,0.0055767796,0.02100144,0.94262,0.026261197,0.000112824884],"about_ca_topic_score_codex":0.00071489037,"about_ca_topic_score_gemma":0.0005916928,"teacher_disagreement_score":0.02475028,"about_ca_system_score_codex":0.0014558958,"about_ca_system_score_gemma":0.001673033,"threshold_uncertainty_score":0.082798004},"labels":[],"label_agreement":null},{"id":"W1516924677","doi":"10.1007/978-3-540-68164-9_13","title":"An Adaptation of the NICE Cryptosystem to Real Quadratic Orders","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Nice; Cryptosystem; Computer science; Quadratic equation; Factorization; Quadratic residue; Adaptation (eye); Theoretical computer science; Arithmetic; Algorithm; Cryptography; Mathematics; Physics","score_opus":0.018174923402855103,"score_gpt":0.23764810164879216,"score_spread":0.21947317824593707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516924677","genre_codex":"methods","genre_gemma":"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.038461287,0.0016721601,0.82280797,0.002640812,0.0019800765,0.00028339546,0.00025006963,0.0026371,0.12926716],"genre_scores_gemma":[0.54010093,0.002992814,0.36572188,0.0010565895,0.0017236702,0.00022994642,0.00034173517,0.0012698218,0.08656265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904996,0.0002680274,0.00004790651,0.0001248723,0.0004050464,0.0001041633],"domain_scores_gemma":[0.99889684,0.0002468928,0.000052441137,0.00058029086,0.00014906372,0.00007446171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083258626,0.00050728756,0.0006576185,0.00072378037,0.0007311054,0.0015061802,0.0010036721,0.00069952145,0.0057919817],"category_scores_gemma":[0.0034045354,0.00040225143,0.0007813586,0.0010108482,0.0021672195,0.004116936,0.0025657082,0.00305243,0.0026350154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011887801,0.000045645997,0.00012570756,0.00009395258,0.000012860822,0.00010917039,0.00014164718,0.004540374,0.007248608,0.8952255,0.00842343,0.08391408],"study_design_scores_gemma":[0.00007409293,0.00014477682,0.00034197714,0.000046954123,0.000025338353,0.00072159094,0.000042813906,0.054801904,0.007423036,0.85029274,0.08600855,0.000076331824],"about_ca_topic_score_codex":0.00046360234,"about_ca_topic_score_gemma":0.0005156516,"teacher_disagreement_score":0.0057919817,"about_ca_system_score_codex":0.00074801804,"about_ca_system_score_gemma":0.0007120439,"threshold_uncertainty_score":0.019376159},"labels":[],"label_agreement":null},{"id":"W1517085700","doi":"10.1109/tit.2015.2463285","title":"On a Markov Lemma and Typical Sequences for Polish Alphabets","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Lemma (botany); Mathematics; Markov process; Computer science; Discrete mathematics; Algorithm; Combinatorics; Statistics","score_opus":0.018577101489721453,"score_gpt":0.24363570155091918,"score_spread":0.22505860006119774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517085700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.06701194,0.0007203,0.91349757,0.0013149941,0.00010997298,0.00005097701,0.0002039946,0.00019248782,0.016897721],"genre_scores_gemma":[0.8393968,0.0014460168,0.14780292,0.0010268268,0.00043850753,0.00031996818,0.00034967222,0.00020831768,0.0090110125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758506,0.0008391831,0.00015215184,0.0004985509,0.0006259395,0.00029919168],"domain_scores_gemma":[0.982192,0.013438453,0.0013470569,0.0009922585,0.0014416598,0.0005885195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032698293,0.0005743149,0.0008942624,0.0017840721,0.0012532318,0.0021386722,0.00097521103,0.0012470523,0.0041879313],"category_scores_gemma":[0.01592191,0.00042060085,0.0011748854,0.0016239724,0.004340125,0.00750788,0.0026327707,0.0026359027,0.0007646763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001758323,0.0000066269404,0.00014204267,0.000025626134,0.000005742976,0.00007636379,0.00011699744,0.0048393956,0.0007221913,0.99063104,0.00031167705,0.003104649],"study_design_scores_gemma":[0.000011745017,0.00003854835,0.00012587226,0.000023886689,0.000006697523,0.00016034111,0.00006828868,0.050304193,0.0012402189,0.94542027,0.0025756648,0.000024262039],"about_ca_topic_score_codex":0.00078097306,"about_ca_topic_score_gemma":0.0004723483,"teacher_disagreement_score":0.0041879313,"about_ca_system_score_codex":0.0014249309,"about_ca_system_score_gemma":0.0009459583,"threshold_uncertainty_score":0.017292738},"labels":[],"label_agreement":null},{"id":"W151888074","doi":"","title":"Binary codes from graphs on triples and permutation decoding.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Adjacency list; Adjacency matrix; Discrete mathematics; Binary number; Permutation (music); Decoding methods; Arithmetic; Algorithm; Graph","score_opus":0.009198161447047309,"score_gpt":0.21855478652794538,"score_spread":0.20935662508089808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151888074","genre_codex":"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.068925686,0.0011904467,0.7978863,0.0014722325,0.00053934957,0.00016335846,0.0007268814,0.0008097886,0.12828597],"genre_scores_gemma":[0.777393,0.0017366123,0.18481512,0.0009507396,0.0003387418,0.00028970986,0.0010029479,0.00040457907,0.033068627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991442,0.00027125355,0.000043904285,0.00009456305,0.00028560334,0.00016038887],"domain_scores_gemma":[0.9991085,0.0004202251,0.00009478258,0.00021400914,0.00010876975,0.000053757194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881234,0.00081143016,0.0004990739,0.0011821577,0.0011745319,0.0017493165,0.0007297425,0.0012501046,0.0048860316],"category_scores_gemma":[0.0030339875,0.0003485358,0.0007918578,0.0014141748,0.0015183467,0.0029688226,0.0020968725,0.0021014223,0.0020162899],"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.000025873469,0.000011214335,0.00006917855,0.000040588588,0.000005408024,0.00013574505,0.00010769885,0.0041543217,0.0015267809,0.9821761,0.0020241814,0.009722944],"study_design_scores_gemma":[0.000006826924,0.000011272076,0.000047019737,0.000023291912,0.0000044798885,0.00017444979,0.000031408432,0.018670605,0.0024650376,0.97270375,0.0058478797,0.000013954778],"about_ca_topic_score_codex":0.0013642125,"about_ca_topic_score_gemma":0.001647722,"teacher_disagreement_score":0.0048860316,"about_ca_system_score_codex":0.0009612257,"about_ca_system_score_gemma":0.0007565529,"threshold_uncertainty_score":0.016345382},"labels":[],"label_agreement":null},{"id":"W1520746258","doi":"10.1007/11863854_9","title":"Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Binary number; Ideal (ethics); Mathematics; Autocorrelation matrix; Complementary sequences; Pseudorandom binary sequence; Autocorrelation technique; Algorithm; Computer science; Discrete mathematics; Statistics; Arithmetic","score_opus":0.02488444683529998,"score_gpt":0.23091078610925872,"score_spread":0.20602633927395875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520746258","genre_codex":"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.75599617,0.00066789467,0.20629732,0.00035453084,0.00010006613,0.00004101273,0.0002622244,0.00034329455,0.035937544],"genre_scores_gemma":[0.9895286,0.00021266418,0.007649397,0.000052699103,0.00007975987,0.000021988291,0.00014840816,0.000047127578,0.0022592563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993691,0.00013711386,0.000032619362,0.00007568522,0.00025521262,0.00013027192],"domain_scores_gemma":[0.99460864,0.0030258752,0.00077974587,0.0004905088,0.000723855,0.00037141054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012039475,0.00052789133,0.00045593697,0.0015314267,0.00044790574,0.001584501,0.0005859539,0.0007766796,0.0030127503],"category_scores_gemma":[0.005836344,0.00034228936,0.00027370313,0.0013025104,0.0011674716,0.0014113811,0.000764614,0.0007707227,0.0004890544],"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.00076937664,0.00014440877,0.0039442545,0.00015192764,0.000045442404,0.0010398552,0.0005387199,0.036279917,0.080700584,0.8551011,0.0014390298,0.019845264],"study_design_scores_gemma":[0.00009959239,0.00032088935,0.007692184,0.00007001102,0.00004698305,0.0023856973,0.0002680016,0.6095904,0.031278007,0.3454991,0.0025849664,0.00016421123],"about_ca_topic_score_codex":0.00034156686,"about_ca_topic_score_gemma":0.00023990383,"teacher_disagreement_score":0.0030127503,"about_ca_system_score_codex":0.0006028383,"about_ca_system_score_gemma":0.0005419656,"threshold_uncertainty_score":0.010078669},"labels":[],"label_agreement":null},{"id":"W1527547811","doi":"10.1109/isit.1991.695092","title":"Hermitian Codes As GRS Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hermitian matrix; Computer science; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.010355568479633925,"score_gpt":0.24123007707653799,"score_spread":0.23087450859690406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527547811","genre_codex":"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.4022073,0.0062462,0.27708077,0.008538817,0.0028502492,0.0002444748,0.0011390037,0.0011916336,0.3005016],"genre_scores_gemma":[0.9044364,0.0014734183,0.023980064,0.0013845892,0.0012021258,0.00010255155,0.0002557085,0.00025252582,0.066912524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987953,0.00037062805,0.000056013436,0.0001496833,0.00043512392,0.00019338306],"domain_scores_gemma":[0.99819165,0.0006550262,0.00026727308,0.0003040066,0.0003433619,0.00023861547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008141292,0.0008216571,0.00080244517,0.0023528365,0.0010728984,0.0029958566,0.0007301853,0.0017529832,0.011009764],"category_scores_gemma":[0.0032687185,0.00050179614,0.00059119536,0.0020630616,0.0035883188,0.0032864877,0.002133237,0.0028345035,0.0021372705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013541811,0.000004380136,0.000036429028,0.00001194205,0.0000016959766,0.000028887074,0.0000619853,0.00039363807,0.00031684566,0.99541074,0.00079206383,0.0029278458],"study_design_scores_gemma":[0.00001034166,0.000012172584,0.00007714447,0.0000082773995,0.0000017978858,0.00008589058,0.00002114791,0.0020277959,0.00026871733,0.9946603,0.0028163807,0.0000100559955],"about_ca_topic_score_codex":0.00054465694,"about_ca_topic_score_gemma":0.0004149626,"teacher_disagreement_score":0.011009764,"about_ca_system_score_codex":0.0011793638,"about_ca_system_score_gemma":0.0007057028,"threshold_uncertainty_score":0.03683132},"labels":[],"label_agreement":null},{"id":"W1528404527","doi":"10.1109/itw.2015.7133088","title":"Encoding and decoding algorithms for LP-decodable multipermutation codes","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Computer science; Encoding (memory); Sequential decoding; List decoding; Berlekamp–Welch algorithm; Algorithm; Theoretical computer science; Concatenated error correction code; Block code; Artificial intelligence","score_opus":0.06587234443456226,"score_gpt":0.30018924134180824,"score_spread":0.234316896907246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528404527","genre_codex":"methods","genre_gemma":"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.015464111,0.00016561206,0.9804474,0.00019715329,0.000028224491,0.00005867692,0.00008874665,0.00032333122,0.0032267587],"genre_scores_gemma":[0.16324098,0.00034311973,0.8310035,0.0001503387,0.000033275224,0.00017641971,0.0003302163,0.00015344372,0.004568778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909616,0.00023718721,0.000074467185,0.00012856422,0.0003504303,0.00011331199],"domain_scores_gemma":[0.9972959,0.0013310318,0.00026361883,0.00038681968,0.0006561886,0.000066499386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001310612,0.0008102958,0.00064728595,0.00072965765,0.00060888816,0.0010837483,0.00092453265,0.0014739465,0.002544207],"category_scores_gemma":[0.005470852,0.00034481127,0.0006271731,0.0011383166,0.00092386035,0.0017014828,0.0010321131,0.001709718,0.00090822444],"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.00013793468,0.000088841014,0.0006479278,0.00014178001,0.000028015571,0.0001380879,0.00018892638,0.68531454,0.009422359,0.17221244,0.0028424175,0.12883683],"study_design_scores_gemma":[0.000023331007,0.000033655848,0.000058923422,0.00001685149,0.0000050387594,0.000077963094,0.000019026384,0.95956373,0.0068055093,0.0321968,0.0011842877,0.000014824306],"about_ca_topic_score_codex":0.001987305,"about_ca_topic_score_gemma":0.0029421397,"teacher_disagreement_score":0.002544207,"about_ca_system_score_codex":0.0013172382,"about_ca_system_score_gemma":0.0024393268,"threshold_uncertainty_score":0.009557247},"labels":[],"label_agreement":null},{"id":"W1528709073","doi":"10.1007/3-540-46416-6_30","title":"An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"S-box; Cryptosystem; Set (abstract data type); Differential (mechanical device); Computer science; Computer security; Relation (database); Theoretical computer science; Information security; Cryptography; Data mining; Engineering; Block cipher; Programming language","score_opus":0.028167212938885026,"score_gpt":0.2850306899984802,"score_spread":0.25686347705959517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528709073","genre_codex":"methods","genre_gemma":"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.03903657,0.0009155512,0.9082797,0.00072702765,0.00015092362,0.00020145201,0.00015743145,0.00037433655,0.050157048],"genre_scores_gemma":[0.63238364,0.0008988115,0.3537608,0.00045108228,0.0003100305,0.00033543364,0.00019275509,0.00017394437,0.011493438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592835,0.001354087,0.00033989886,0.0004975141,0.0016384267,0.0002416993],"domain_scores_gemma":[0.99034786,0.005444778,0.00087678083,0.0012088687,0.0018305244,0.00029116846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003922635,0.0011187589,0.0017990926,0.0035910357,0.0011239884,0.004110843,0.0011697815,0.002130851,0.004575797],"category_scores_gemma":[0.011554914,0.00047600223,0.001113129,0.0022199326,0.0029204462,0.004236923,0.001891672,0.0018096571,0.000919258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012796264,0.000047058216,0.00044525473,0.00020094695,0.000028429293,0.00011308118,0.00011626135,0.020572973,0.006946879,0.9172541,0.0022032892,0.051943764],"study_design_scores_gemma":[0.00004467757,0.000264314,0.00029294807,0.00011818452,0.000039588023,0.00034190094,0.000053591717,0.1509701,0.006349791,0.8329679,0.008504556,0.000052400716],"about_ca_topic_score_codex":0.00026140356,"about_ca_topic_score_gemma":0.00028739774,"teacher_disagreement_score":0.004575797,"about_ca_system_score_codex":0.0014121345,"about_ca_system_score_gemma":0.0010587197,"threshold_uncertainty_score":0.020745158},"labels":[],"label_agreement":null},{"id":"W1531836745","doi":"10.1002/0471219282.eot107","title":"High‐Rate Punctured Convolutional Codes","year":2003,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Coding (social sciences); Computer science; Algorithm; Mathematics; Statistics; Decoding methods","score_opus":0.008329646067091911,"score_gpt":0.2032129072808378,"score_spread":0.19488326121374588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531836745","genre_codex":"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.21107364,0.0036668703,0.7090574,0.00058327545,0.00024982964,0.00007888221,0.00034430288,0.0010075435,0.073938295],"genre_scores_gemma":[0.92700374,0.0016042218,0.061431896,0.00015938011,0.00012741936,0.000048916972,0.00020256174,0.00008653579,0.009335336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.0001206151,0.000036347185,0.00007401656,0.00040460395,0.000102889586],"domain_scores_gemma":[0.9988825,0.00038585666,0.00012147211,0.00026184684,0.00029305046,0.00005526514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046384567,0.0005268129,0.00039229842,0.0006389073,0.0003027681,0.001071324,0.00053598254,0.0005596205,0.0036711728],"category_scores_gemma":[0.00269121,0.00020971824,0.00029037727,0.00079476554,0.0007370671,0.0009917638,0.0012298826,0.0009818152,0.0012220617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037554814,0.00007197371,0.0012793416,0.0003759475,0.000058498652,0.0008075724,0.0002527502,0.12322543,0.090457544,0.6078143,0.004760823,0.17052023],"study_design_scores_gemma":[0.00006732356,0.00025381343,0.0017869609,0.00024200554,0.000055457596,0.0021514678,0.00006362163,0.51833504,0.13643746,0.3037621,0.03671999,0.00012481661],"about_ca_topic_score_codex":0.00047640913,"about_ca_topic_score_gemma":0.00030653752,"teacher_disagreement_score":0.0036711728,"about_ca_system_score_codex":0.0007099626,"about_ca_system_score_gemma":0.0004801713,"threshold_uncertainty_score":0.012281299},"labels":[],"label_agreement":null},{"id":"W1535558765","doi":"10.1016/j.laa.2015.06.020","title":"An asymptotic formula for the number of irreducible transformation shift registers","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Transformation (genetics); Irreducible element; Generalization; Shift register; Order (exchange); Irreducible polynomial; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis; Polynomial; Electronic circuit","score_opus":0.03171151025642087,"score_gpt":0.30243546588791015,"score_spread":0.27072395563148927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535558765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.22508542,0.0032454084,0.5970644,0.0055723037,0.00135285,0.00015379388,0.00064403476,0.0013282339,0.16555361],"genre_scores_gemma":[0.90723455,0.0014663988,0.060001347,0.0010607904,0.0016046668,0.0003958063,0.00048812246,0.00039363056,0.027354656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777335,0.00047866904,0.00013539477,0.00048441393,0.0007981089,0.00033007204],"domain_scores_gemma":[0.9926984,0.004659899,0.00046795918,0.0009533866,0.00078024366,0.00044017792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002576522,0.0011645284,0.0013407923,0.0032004002,0.0014152991,0.0037605818,0.0033243091,0.00242813,0.013301466],"category_scores_gemma":[0.019840453,0.0007453827,0.00093304255,0.0022063095,0.0047634416,0.012199493,0.003461543,0.0049671186,0.0022610205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009498619,0.000050254715,0.00044510709,0.00008960153,0.000011728922,0.0000668393,0.00009661037,0.0033474532,0.0021195651,0.9756275,0.0023367126,0.015713641],"study_design_scores_gemma":[0.00001958028,0.000030802872,0.00030123594,0.000050979743,0.000019663648,0.00019063598,0.000033127057,0.034878828,0.0016740415,0.96004367,0.002729038,0.000028438379],"about_ca_topic_score_codex":0.00042856374,"about_ca_topic_score_gemma":0.0005219845,"teacher_disagreement_score":0.013301466,"about_ca_system_score_codex":0.002640952,"about_ca_system_score_gemma":0.0013184877,"threshold_uncertainty_score":0.044497848},"labels":[],"label_agreement":null},{"id":"W1537812362","doi":"10.1007/978-1-4471-0673-9_13","title":"Linear Recursive Sequences over Elliptic Curves","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear feedback shift register; Mathematics; Sequence (biology); Binary number; Representation (politics); Elliptic curve; Shift register; Arithmetic; Pure mathematics; Computer science; Genetics; Law","score_opus":0.027434390022460356,"score_gpt":0.2326121520060971,"score_spread":0.20517776198363674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537812362","genre_codex":"other","genre_gemma":"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.02315711,0.01136653,0.20799349,0.0016383615,0.0011698673,0.00012333182,0.00024986,0.0009899905,0.7533116],"genre_scores_gemma":[0.17490874,0.014183291,0.058032792,0.0005440618,0.0010695858,0.0001631321,0.00041688717,0.0005030552,0.75017846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996853,0.00005510538,0.000015754116,0.00003621055,0.00017211838,0.00003557009],"domain_scores_gemma":[0.99964356,0.00016779748,0.000020882446,0.000068422145,0.00007854503,0.000020877924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035610102,0.00082028256,0.0004984739,0.0011005523,0.0006406982,0.0018234773,0.00050834136,0.00062480516,0.012386846],"category_scores_gemma":[0.0012196772,0.00041774384,0.00024077507,0.0017420854,0.0012082793,0.002845896,0.0007591173,0.0016307661,0.006316396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014173842,0.000022237253,0.000048104757,0.00014386226,0.0000034649202,0.000045751192,0.00032831592,0.0014991707,0.0020057505,0.83965445,0.013168436,0.14306638],"study_design_scores_gemma":[0.000015365295,0.00005213785,0.00017160698,0.0002079076,0.0000147539595,0.00036116916,0.00009223539,0.005067727,0.007902812,0.52793765,0.45814836,0.00002827895],"about_ca_topic_score_codex":0.00043546595,"about_ca_topic_score_gemma":0.00051773543,"teacher_disagreement_score":0.012386846,"about_ca_system_score_codex":0.0010312368,"about_ca_system_score_gemma":0.00072258123,"threshold_uncertainty_score":0.041438162},"labels":[],"label_agreement":null},{"id":"W1538513703","doi":"","title":"Selected Areas in Cryptography: 11th International Workshop, SAC 2004, Waterloo, Canada, August 9-10, 2004, Revised Selected Papers","year":2005,"lang":"en","type":"book","venue":"Medical Entomology and Zoology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Correlation attack; Block cipher; Differential cryptanalysis; Key schedule; Computer science; Linear cryptanalysis; Cryptanalysis; Stream cipher; Cryptography; Theoretical computer science; Mathematics; Algorithm","score_opus":0.006049000365403056,"score_gpt":0.21773451983032355,"score_spread":0.21168551946492048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538513703","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004643118,0.38856727,0.109281644,0.030064296,0.052646615,0.00080309634,0.0054512597,0.005178533,0.40336424],"genre_scores_gemma":[0.013979816,0.18521538,0.034935623,0.0018229763,0.0128418645,0.00025758223,0.005203775,0.0015829648,0.74416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977883,0.00030918687,0.00014132244,0.00041274246,0.0011051309,0.00024332434],"domain_scores_gemma":[0.9954092,0.00061193836,0.00011825961,0.00040774653,0.0028923901,0.000560447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031018532,0.003468686,0.0022269927,0.003669729,0.0018137471,0.006831828,0.0017224582,0.0018119575,0.13383482],"category_scores_gemma":[0.0040636887,0.0011999415,0.0009983359,0.006908296,0.0019878566,0.005487154,0.0019094469,0.0037092154,0.0750378],"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.00013137037,0.000056749133,0.00031786313,0.00053398113,0.000027388594,0.00008901859,0.00010386723,0.0011246487,0.0011844145,0.011344292,0.7905799,0.1945065],"study_design_scores_gemma":[0.000026527274,0.000045157085,0.0006183569,0.00040665147,0.000022785413,0.00025434833,0.00012476194,0.0028484853,0.00091180037,0.006630563,0.98808694,0.00002356142],"about_ca_topic_score_codex":0.03633499,"about_ca_topic_score_gemma":0.061007448,"teacher_disagreement_score":0.13383482,"about_ca_system_score_codex":0.007941645,"about_ca_system_score_gemma":0.008509299,"threshold_uncertainty_score":0.44772208},"labels":[],"label_agreement":null},{"id":"W1541343583","doi":"10.1090/s0002-9939-2010-10560-9","title":"The class number of $\\mathbb{Q}(\\sqrt{-p})$ and digits of $1/p$","year":2010,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Class (philosophy); Combinatorics; Mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.005581346167859151,"score_gpt":0.23487206151787754,"score_spread":0.22929071535001838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541343583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6118823,0.0016647213,0.056380313,0.004702106,0.0017909432,0.000081443395,0.0008854106,0.0006796562,0.32193315],"genre_scores_gemma":[0.93942386,0.00079356873,0.008060622,0.00044241388,0.0007673537,0.00011534629,0.00043026876,0.00040601142,0.049560554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992399,0.00008813408,0.00001999648,0.0001957581,0.00018583242,0.0002703214],"domain_scores_gemma":[0.99878925,0.00045356204,0.00017994859,0.00010116656,0.00016268632,0.0003134423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077475695,0.00084063306,0.0008676812,0.0027834624,0.0032571787,0.004354753,0.0013974779,0.0011229754,0.016854487],"category_scores_gemma":[0.0031878839,0.00039038665,0.0007132758,0.0014113373,0.0048588375,0.0033635949,0.0016101289,0.0032571245,0.003155008],"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.00012493126,0.0000339269,0.00085970515,0.000049087357,0.000009969659,0.000116945426,0.00028581594,0.0007991991,0.0017293909,0.9777404,0.0039622146,0.014288513],"study_design_scores_gemma":[0.000045320234,0.00008492505,0.0031392602,0.00013248005,0.000030921277,0.0005626291,0.0002468154,0.014976931,0.007537383,0.9434062,0.029735656,0.00010142643],"about_ca_topic_score_codex":0.0022748194,"about_ca_topic_score_gemma":0.0016911444,"teacher_disagreement_score":0.016854487,"about_ca_system_score_codex":0.002953587,"about_ca_system_score_gemma":0.0011050928,"threshold_uncertainty_score":0.056383908},"labels":[],"label_agreement":null},{"id":"W1542192939","doi":"10.1007/3-540-45311-3_20","title":"Cryptanalysis of Imai and Matsumoto Scheme B Asymmetric Cryptosystem","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Cryptanalysis; Public-key cryptography; Ciphertext; Computer science; Encryption; Scheme (mathematics); Theoretical computer science; Key (lock); Hybrid cryptosystem; Simple (philosophy); Cryptography; Mathematics; Algorithm; Computer security","score_opus":0.012103994265801641,"score_gpt":0.227014010747114,"score_spread":0.21491001648131236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542192939","genre_codex":"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.60294634,0.0024390128,0.31200108,0.001984178,0.0004943508,0.00028161283,0.00025300126,0.000750071,0.07885034],"genre_scores_gemma":[0.95404375,0.0005873604,0.03297824,0.000106287116,0.000097310076,0.00005732945,0.00011811757,0.000045684883,0.011965822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948114,0.000096431315,0.000026110516,0.0000575855,0.00024493647,0.00009385539],"domain_scores_gemma":[0.99976856,0.00006535397,0.000028193333,0.000071194605,0.00004309454,0.000023488015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324559,0.00038778948,0.00052644545,0.0006697742,0.0008915858,0.00069827127,0.0005149215,0.0007900372,0.0028940523],"category_scores_gemma":[0.00074404845,0.00023558868,0.00045938694,0.00076550996,0.0006342164,0.0011470984,0.00080867246,0.0009482779,0.00053745747],"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.0020912616,0.00028716016,0.0038483872,0.00042973747,0.00015348749,0.0028725564,0.0009829493,0.020229686,0.17254911,0.6222072,0.011612689,0.16273582],"study_design_scores_gemma":[0.00058547984,0.0009085181,0.007223775,0.00016632752,0.00029244137,0.0078178495,0.0003642523,0.27505213,0.32055014,0.32910204,0.0577172,0.00021980394],"about_ca_topic_score_codex":0.00023903324,"about_ca_topic_score_gemma":0.00023072859,"teacher_disagreement_score":0.0028940523,"about_ca_system_score_codex":0.0005001535,"about_ca_system_score_gemma":0.00055364944,"threshold_uncertainty_score":0.009681523},"labels":[],"label_agreement":null},{"id":"W1545910537","doi":"10.1109/cwit.2015.7255142","title":"A fast displacement-based Peterson decoder","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Toeplitz matrix; Factorization; Quadratic equation; Algorithm; Displacement (psychology); Sequence (biology); Computational complexity theory; Matrix (chemical analysis); Mathematics; Computer science; Matrix decomposition; Algebra over a field; Pure mathematics","score_opus":0.028703337663712882,"score_gpt":0.24774036208677777,"score_spread":0.21903702442306489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545910537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.008024179,0.00019788957,0.9857847,0.00011515759,0.000089847046,0.000060415507,0.000101817524,0.001423132,0.004202904],"genre_scores_gemma":[0.14425729,0.00029438076,0.8386389,0.00022098052,0.00007829141,0.00012647438,0.0003922377,0.00012671488,0.015864758],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995888,0.0000640137,0.000024601417,0.00007340713,0.0002063294,0.000042900683],"domain_scores_gemma":[0.9997228,0.000084062485,0.000016826421,0.00006283945,0.000093095565,0.000020395826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027445858,0.0005654339,0.00055220124,0.00042240418,0.0005310866,0.00083427824,0.0010856278,0.0007278315,0.0056249015],"category_scores_gemma":[0.0010492817,0.0002836545,0.00030416987,0.0006237389,0.00034956104,0.00094071345,0.0015230529,0.00078594335,0.0035870026],"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.00046123588,0.00008843862,0.0006878515,0.00024521365,0.000063131454,0.00038187174,0.0001605184,0.082742974,0.17086998,0.090747,0.009068654,0.64448315],"study_design_scores_gemma":[0.000109822315,0.00030026998,0.00030413823,0.00004373011,0.000048824208,0.0008762385,0.000057806046,0.82039183,0.12251563,0.026892642,0.028386453,0.00007254874],"about_ca_topic_score_codex":0.0010846385,"about_ca_topic_score_gemma":0.0027260582,"teacher_disagreement_score":0.0056249015,"about_ca_system_score_codex":0.00044381543,"about_ca_system_score_gemma":0.0015717653,"threshold_uncertainty_score":0.018817127},"labels":[],"label_agreement":null},{"id":"W1547899855","doi":"10.1007/3-540-44709-1_27","title":"Efficient Implementation of “Large” Stream Cipher Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Computer science; Bottleneck; Shift register; Boolean function; Key (lock); Block cipher; Algorithm; Cryptosystem; Parallel computing; Theoretical computer science; Arithmetic; Cryptography; Mathematics; Embedded system","score_opus":0.013045707623149126,"score_gpt":0.26455108258408533,"score_spread":0.2515053749609362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547899855","genre_codex":"methods","genre_gemma":"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.08645016,0.000627064,0.892806,0.00067835866,0.00024118634,0.00020263338,0.00024353973,0.0034974602,0.015253575],"genre_scores_gemma":[0.6928397,0.00042129282,0.29074037,0.0003183444,0.00019699383,0.00026852268,0.00047020754,0.00024649626,0.014498017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992787,0.00021080654,0.000063431195,0.000071543924,0.00026894512,0.00010660297],"domain_scores_gemma":[0.9988028,0.00048505803,0.00010077678,0.00040653071,0.00015984218,0.000045083492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065186154,0.000628259,0.0004901867,0.00044739456,0.00053445797,0.0013310424,0.001027754,0.00062869804,0.008443263],"category_scores_gemma":[0.0018660235,0.00045274766,0.00030368162,0.0004987909,0.00054700306,0.002562244,0.0011628667,0.0008891523,0.0018087993],"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.0017114067,0.00030428302,0.000755425,0.0005049105,0.00012126239,0.00037555097,0.00029984766,0.071600296,0.1833902,0.3396521,0.02172051,0.3795643],"study_design_scores_gemma":[0.0003808393,0.00048319183,0.00059976184,0.000079529316,0.0000903707,0.00043750185,0.000054325184,0.61081094,0.2029634,0.14721009,0.03683155,0.000058540558],"about_ca_topic_score_codex":0.00022258586,"about_ca_topic_score_gemma":0.00060242444,"teacher_disagreement_score":0.008443263,"about_ca_system_score_codex":0.0007200986,"about_ca_system_score_gemma":0.00079946325,"threshold_uncertainty_score":0.028245568},"labels":[],"label_agreement":null},{"id":"W1549861330","doi":"10.1007/3-540-44495-5_19","title":"On Efficient Normal Basis Multiplication","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Computer science; Normal basis; Cryptography; Finite field; Basis (linear algebra); Multiplication algorithm; Arithmetic; Field (mathematics); Class (philosophy); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Galois theory","score_opus":0.010359372274557686,"score_gpt":0.22187067641790617,"score_spread":0.21151130414334848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549861330","genre_codex":"methods","genre_gemma":"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.03275571,0.0045528635,0.5985794,0.0019345433,0.0014585011,0.00014573713,0.00028995675,0.0014057354,0.35887754],"genre_scores_gemma":[0.44887307,0.0074590435,0.22253652,0.0011025427,0.0016124283,0.00028366668,0.0009455962,0.0012536976,0.31593353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910563,0.0002298838,0.00003600723,0.000091177244,0.00041715952,0.00012015249],"domain_scores_gemma":[0.9995264,0.00016967428,0.000023138824,0.00017570794,0.00007726731,0.000027952623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712814,0.001395166,0.0010688723,0.0014770537,0.0008818671,0.0019755438,0.0009827169,0.0006887866,0.016734382],"category_scores_gemma":[0.0016580456,0.0005838917,0.0005540998,0.00230207,0.0019510179,0.0053433473,0.003047632,0.0023344173,0.0055027283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000497758,0.000033181746,0.00006915815,0.00006957862,0.00000808063,0.000035467674,0.00008665446,0.0018982152,0.0018469965,0.9036904,0.0076679727,0.08454461],"study_design_scores_gemma":[0.0000101156575,0.000019736714,0.0000743306,0.000029158737,0.00000745006,0.000119439246,0.000019345043,0.0076933717,0.0019808135,0.96466744,0.025366085,0.000012687369],"about_ca_topic_score_codex":0.0003885518,"about_ca_topic_score_gemma":0.00061382866,"teacher_disagreement_score":0.016734382,"about_ca_system_score_codex":0.0010037802,"about_ca_system_score_gemma":0.0005213818,"threshold_uncertainty_score":0.055982113},"labels":[],"label_agreement":null},{"id":"W1555131579","doi":"10.1109/tit.2004.838109","title":"A Mass Formula and Rank of&amp;lt;tex&amp;gt;$BBZ_4$&amp;lt;/tex&amp;gt;Cyclic Codes of Length&amp;lt;tex&amp;gt;$2^e$&amp;lt;/tex&amp;gt;","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rank (graph theory); Combinatorics; Mathematics","score_opus":0.017928381731327818,"score_gpt":0.24359312349006693,"score_spread":0.2256647417587391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555131579","genre_codex":"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.7904018,0.0018465503,0.12973988,0.001871923,0.00018509376,0.00006894203,0.00060223765,0.00022298822,0.07506056],"genre_scores_gemma":[0.977409,0.000490098,0.012911379,0.00010800981,0.0003494975,0.000048199272,0.00020099376,0.000054477623,0.008428338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954957,0.00010020442,0.00002051931,0.00007564519,0.00014131007,0.00011272273],"domain_scores_gemma":[0.99622834,0.0020105229,0.0006657187,0.00024349133,0.00050152844,0.00035038582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140443,0.00050590216,0.00037873068,0.0017800252,0.00073015015,0.001253833,0.0006051934,0.000569512,0.0054902844],"category_scores_gemma":[0.0050173257,0.00021904467,0.00026494774,0.0009799616,0.0020401457,0.0023190703,0.0010039045,0.0011820833,0.0009183423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001301258,0.00004843425,0.0029182823,0.00008767667,0.000010990529,0.00019348202,0.00051037595,0.004737598,0.007760896,0.95662254,0.0034869334,0.023492556],"study_design_scores_gemma":[0.000034563443,0.00021794037,0.0032684463,0.00007012136,0.000029383731,0.0010230995,0.00029608276,0.07789438,0.010235357,0.8977209,0.009131383,0.000078375],"about_ca_topic_score_codex":0.00039649828,"about_ca_topic_score_gemma":0.0004602811,"teacher_disagreement_score":0.0054902844,"about_ca_system_score_codex":0.000884161,"about_ca_system_score_gemma":0.00042811292,"threshold_uncertainty_score":0.018366814},"labels":[],"label_agreement":null},{"id":"W1555694369","doi":"10.1007/3-540-45067-x_43","title":"New Constructions for Resilient and Highly Nonlinear Boolean Functions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Boolean function; Correlation attack; Concatenation (mathematics); Block cipher; Boolean network; Hadamard transform; Construct (python library); Discrete mathematics; Bent function; Nonlinear system; Computer science; Algebraic number; Mathematics; Cryptography; Algorithm; Combinatorics","score_opus":0.012358944843393007,"score_gpt":0.22787206342381894,"score_spread":0.21551311858042593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555694369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.04176542,0.0018354183,0.84739935,0.0028967152,0.0009539412,0.00023257908,0.00042484183,0.0023259274,0.10216567],"genre_scores_gemma":[0.52329856,0.0030397133,0.3844061,0.0017667995,0.0011226847,0.00076883996,0.0007461943,0.0012245075,0.08362666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988728,0.0002250451,0.000079659316,0.00017268158,0.0004475194,0.00020233239],"domain_scores_gemma":[0.9986155,0.0006235706,0.00012014669,0.00039310928,0.00012286998,0.00012480703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012320493,0.0018551623,0.0008921271,0.0020563987,0.0018677659,0.0025175356,0.0016700275,0.0014719443,0.01069509],"category_scores_gemma":[0.0036033888,0.0010149751,0.0013778368,0.0013592493,0.003408884,0.0062212073,0.006286562,0.005375828,0.0026659563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066246306,0.000032951048,0.00007435363,0.00011613224,0.000013443655,0.00009780593,0.00015952872,0.0020293624,0.0059492523,0.9612254,0.004249438,0.025986047],"study_design_scores_gemma":[0.000036425194,0.00006310936,0.00011763133,0.000058487076,0.0000460329,0.00052831316,0.000060393053,0.015074229,0.013452163,0.94109476,0.029414926,0.00005353233],"about_ca_topic_score_codex":0.00018676707,"about_ca_topic_score_gemma":0.00041100464,"teacher_disagreement_score":0.01069509,"about_ca_system_score_codex":0.0017459565,"about_ca_system_score_gemma":0.00053102,"threshold_uncertainty_score":0.0357787},"labels":[],"label_agreement":null},{"id":"W1561267140","doi":"10.37236/1091","title":"The Number of Permutation Binomials over ${\\Bbb F}_{4p+1}$ where $p$ and $4p+1$ are Primes","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Combinatorics; Finite field; Monic polynomial; Partial permutation; Discrete mathematics; Hermite polynomials; Degree (music); Primality test; Cyclic permutation; Prime number; Symmetric group; Pure mathematics; Polynomial","score_opus":0.003212088831226066,"score_gpt":0.21892021866081637,"score_spread":0.2157081298295903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561267140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9072824,0.0004861742,0.053188585,0.0010771217,0.00017400052,0.00004685792,0.0004290284,0.00022253794,0.0370932],"genre_scores_gemma":[0.98715264,0.00049182057,0.006665682,0.00007906375,0.00014598979,0.00005722077,0.00021368722,0.000049705923,0.0051441486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993243,0.00012662818,0.00003243699,0.000106943255,0.00016739711,0.00024240413],"domain_scores_gemma":[0.9976908,0.0011593822,0.00039208922,0.00026878546,0.00020712453,0.00028173288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011091685,0.00039780917,0.00054067443,0.0012885475,0.0012743167,0.0014931891,0.00064936484,0.0005029958,0.0062144008],"category_scores_gemma":[0.0037988669,0.00028719997,0.0004324647,0.0007332213,0.0018947446,0.0027896385,0.0010744511,0.00082514907,0.0007820753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008142607,0.000109584485,0.013234124,0.0003206628,0.00007285261,0.0011287336,0.00057639263,0.012229815,0.037464004,0.85042995,0.0066933855,0.07692611],"study_design_scores_gemma":[0.00014462454,0.00032695325,0.016178228,0.00013896023,0.00018197577,0.005764223,0.00051434344,0.07245569,0.04562825,0.83065796,0.027842512,0.00016632947],"about_ca_topic_score_codex":0.00035217713,"about_ca_topic_score_gemma":0.00040548661,"teacher_disagreement_score":0.0062144008,"about_ca_system_score_codex":0.0006426932,"about_ca_system_score_gemma":0.0005542194,"threshold_uncertainty_score":0.020789266},"labels":[],"label_agreement":null},{"id":"W156263185","doi":"","title":"Double Circulant Self-Dual Codes over GF(5).","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Arithmetic; Discrete mathematics; Linguistics","score_opus":0.009382806470143452,"score_gpt":0.22474303220213468,"score_spread":0.21536022573199123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156263185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.46082288,0.0042708856,0.31124765,0.0027188312,0.0016450507,0.0002852844,0.0013944511,0.0012317165,0.2163833],"genre_scores_gemma":[0.9362323,0.0009372242,0.034609042,0.0005577924,0.0003480917,0.000117900665,0.0006405006,0.00009671773,0.026460424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929047,0.00013279743,0.000034762677,0.00009916896,0.00024725692,0.00019541116],"domain_scores_gemma":[0.9986418,0.00041634042,0.00023200829,0.00030066798,0.00023164482,0.00017755388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000486023,0.00047791487,0.00048702725,0.0016839019,0.0010248233,0.0017363516,0.00048288426,0.00075649086,0.006688845],"category_scores_gemma":[0.002552302,0.00022277141,0.00032283945,0.0011585447,0.00097249576,0.0014938327,0.0013386868,0.0011371684,0.0017065794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003756514,0.00013789821,0.00070942397,0.00019898098,0.000027688375,0.00055754854,0.0001825005,0.006020473,0.016238444,0.91528606,0.008405241,0.051859967],"study_design_scores_gemma":[0.0001864103,0.00026128878,0.0013451359,0.00032467497,0.000057496025,0.0020050097,0.00023449688,0.060650405,0.037954748,0.820608,0.07626793,0.00010445437],"about_ca_topic_score_codex":0.0006407947,"about_ca_topic_score_gemma":0.001154031,"teacher_disagreement_score":0.006688845,"about_ca_system_score_codex":0.0008115202,"about_ca_system_score_gemma":0.0011599936,"threshold_uncertainty_score":0.022376359},"labels":[],"label_agreement":null},{"id":"W1562845089","doi":"10.1007/978-3-540-77026-8_12","title":"A Graph Theoretic Analysis of Double Base Number Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematical proof; Base (topology); Integer (computer science); Mathematics; Representation (politics); Combinatorial proof; Discrete mathematics; Combinatorics; Graph; Integer sequence; Theoretical computer science; Computer science","score_opus":0.0200028941033581,"score_gpt":0.2568944548547386,"score_spread":0.23689156075138051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562845089","genre_codex":"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.3539763,0.0061715306,0.35209364,0.00503454,0.00087068847,0.00012910737,0.0008772772,0.0005214711,0.28032538],"genre_scores_gemma":[0.92686504,0.002374534,0.034909748,0.00044536186,0.000866636,0.00008481584,0.00038921152,0.00017646533,0.033888105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996879,0.00006953023,0.000011573239,0.00005688221,0.00012052614,0.000053640226],"domain_scores_gemma":[0.99877435,0.00058276235,0.0001663799,0.00015563192,0.00016276335,0.00015815935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038071148,0.0006059853,0.000567917,0.0029340687,0.0016058268,0.002522966,0.001181708,0.0008909086,0.008957841],"category_scores_gemma":[0.002418675,0.00035642044,0.0005164475,0.0026639844,0.0020662467,0.004032455,0.0011401464,0.002028585,0.0010138955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001200796,0.000009182673,0.000088137655,0.00002201093,0.0000028475174,0.000033969205,0.00007572521,0.002063475,0.00041445842,0.9919872,0.0013446521,0.0039463188],"study_design_scores_gemma":[0.0000040575205,0.000006803796,0.00012738089,0.000012408566,0.0000041013927,0.00006399745,0.000046952868,0.008486569,0.0002107901,0.9873563,0.0036745043,0.000006090444],"about_ca_topic_score_codex":0.00091564,"about_ca_topic_score_gemma":0.0007447529,"teacher_disagreement_score":0.008957841,"about_ca_system_score_codex":0.001365173,"about_ca_system_score_gemma":0.00049125875,"threshold_uncertainty_score":0.02996695},"labels":[],"label_agreement":null},{"id":"W1565645651","doi":"10.4230/lipics.ccc.2024.25","title":"Formulas For The Square Root Modulo p","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, San Diego; National Science Foundation","keywords":"Modulo; Primitive root modulo n; Finite field; Square (algebra); Square root; Mathematics; Prime (order theory); Combinatorics; Polynomial; Field (mathematics); Root (linguistics); Function (biology); Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.09650571339318634,"score_gpt":0.18335844820301458,"score_spread":0.08685273480982825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565645651","genre_codex":"methods","genre_gemma":"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.12557557,0.001799019,0.5670227,0.0026952215,0.0010472231,0.00016564374,0.00053832756,0.0009048841,0.30025148],"genre_scores_gemma":[0.7308109,0.0018179888,0.20325755,0.0007845051,0.0006074275,0.00023296969,0.00063046435,0.0007098256,0.06114843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994491,0.00009808565,0.000034632514,0.00008433075,0.0002465468,0.000087302265],"domain_scores_gemma":[0.99932206,0.00029407605,0.00005819295,0.0001172735,0.00016892828,0.00003955786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326747,0.0009002335,0.00043664686,0.001658205,0.0012170926,0.002402597,0.0010436062,0.0008588405,0.015666781],"category_scores_gemma":[0.004010177,0.00037147096,0.00060658134,0.0011720066,0.0015365975,0.0043353247,0.0015158578,0.0023606643,0.0037896945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002471421,0.000014987124,0.00018410294,0.000046294797,0.000003919825,0.00017062161,0.00020722381,0.0010002792,0.0015082347,0.9692918,0.0037070366,0.023840735],"study_design_scores_gemma":[0.00001289933,0.000023262146,0.00012922855,0.000045623932,0.00001090955,0.00038264785,0.000105849314,0.008615795,0.0032446438,0.9689042,0.018506072,0.000018947554],"about_ca_topic_score_codex":0.00059725594,"about_ca_topic_score_gemma":0.0011361836,"teacher_disagreement_score":0.015666781,"about_ca_system_score_codex":0.0012079432,"about_ca_system_score_gemma":0.0007150887,"threshold_uncertainty_score":0.052410603},"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":"W1569846140","doi":"10.1109/isccsp.2004.1296487","title":"The rank of /spl Zopf//sub 4/ cyclic codes of length 2/sup e/","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rank (graph theory); Combinatorics; Ring (chemistry); Mathematics; Block code; Discrete mathematics; Algorithm; Decoding methods","score_opus":0.008244199097920417,"score_gpt":0.21446776293390382,"score_spread":0.2062235638359834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569846140","genre_codex":"empirical","genre_gemma":"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.94459975,0.0010722836,0.037114013,0.00050831976,0.000056526856,0.00003092773,0.00031474914,0.00008419899,0.01621922],"genre_scores_gemma":[0.9893115,0.0006048601,0.0067684157,0.00004133103,0.000103519276,0.000018836949,0.0001625485,0.000027449452,0.0029614877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946994,0.00014302306,0.000023606219,0.000052632702,0.00016432488,0.00014648665],"domain_scores_gemma":[0.9956221,0.0023137557,0.0009936636,0.00023731109,0.0005138719,0.0003192852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063939794,0.00032260807,0.00034768705,0.0011389246,0.00046593134,0.0009888046,0.0003549065,0.00044966827,0.002283331],"category_scores_gemma":[0.004948918,0.00014752163,0.00019150377,0.00062787527,0.0011940013,0.001494012,0.0005848564,0.0006759289,0.0003401904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005869419,0.00010243035,0.013286556,0.0003420643,0.000035688732,0.00081142946,0.0010326282,0.041622035,0.029162902,0.85507745,0.0041359602,0.05380393],"study_design_scores_gemma":[0.0000731448,0.00064182346,0.011932901,0.00014329527,0.00004780855,0.0028324183,0.0011970075,0.25389472,0.035043005,0.67806274,0.015932327,0.00019883786],"about_ca_topic_score_codex":0.0004616318,"about_ca_topic_score_gemma":0.00046458046,"teacher_disagreement_score":0.002283331,"about_ca_system_score_codex":0.00038579886,"about_ca_system_score_gemma":0.00045739464,"threshold_uncertainty_score":0.007638514},"labels":[],"label_agreement":null},{"id":"W1570152307","doi":"10.1007/3-540-46513-8_6","title":"Modeling Linear Characteristics of Substitution-Permutation Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear cryptanalysis; Cryptanalysis; Bounding overwatch; Computer science; Permutation (music); Upper and lower bounds; Substitution (logic); Algorithm; Function (biology); Cryptography; Mathematics; Artificial intelligence","score_opus":0.014875678054176064,"score_gpt":0.23005850344491102,"score_spread":0.21518282539073497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570152307","genre_codex":"methods","genre_gemma":"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.23602049,0.00044116305,0.7398199,0.00097074657,0.000061864026,0.00008330417,0.0004891866,0.00034861578,0.02176471],"genre_scores_gemma":[0.9546663,0.00059319293,0.029258976,0.00010193108,0.00009488408,0.000096538155,0.0003270976,0.000093548544,0.01476762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996049,0.00014837344,0.00001127103,0.00009035404,0.00007007228,0.00007501201],"domain_scores_gemma":[0.99504787,0.0033681537,0.0006349715,0.00035760395,0.00038093107,0.0002104797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077902636,0.00047232036,0.0005248034,0.0009145213,0.00036006395,0.0014224247,0.001460872,0.001272984,0.004669533],"category_scores_gemma":[0.006795562,0.00047302057,0.00049446325,0.0012923498,0.0010656309,0.003410725,0.0009087923,0.0012378969,0.0006306881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006237468,0.000051410138,0.0016686849,0.000037561917,0.00002072041,0.000088338005,0.00011341603,0.5603258,0.0009995747,0.42385146,0.0011636706,0.011617075],"study_design_scores_gemma":[0.0000056996737,0.000013025052,0.00016401213,0.000004079018,0.0000058181345,0.000023517627,0.000022123231,0.8405073,0.00017195045,0.15860894,0.00046831268,0.0000051329584],"about_ca_topic_score_codex":0.003491458,"about_ca_topic_score_gemma":0.0033670173,"teacher_disagreement_score":0.004669533,"about_ca_system_score_codex":0.0015395933,"about_ca_system_score_gemma":0.0007880605,"threshold_uncertainty_score":0.015621185},"labels":[],"label_agreement":null},{"id":"W1570515303","doi":"10.1007/3-540-39568-7_8","title":"Computing Logarithms in GF (2n)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Base (topology); Integer (computer science); Mathematics; Finite field; Discrete mathematics; Generator (circuit theory); Combinatorics; Element (criminal law); Binary logarithm; Field (mathematics); Iterated logarithm; Pure mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.022858732874635253,"score_gpt":0.25914947474430594,"score_spread":0.2362907418696707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570515303","genre_codex":"methods","genre_gemma":"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.1255072,0.0054339096,0.6558136,0.004463512,0.0015892875,0.00027422493,0.0026800744,0.00766777,0.19657041],"genre_scores_gemma":[0.6499387,0.0028488704,0.27563733,0.0009464566,0.0009245735,0.00025948772,0.0033225452,0.0008988911,0.06522316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984719,0.0002715624,0.00009584377,0.00023518695,0.0006983694,0.00022711471],"domain_scores_gemma":[0.9982014,0.0007768296,0.0001150982,0.0005794869,0.00024206571,0.000085200416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011340178,0.0008765975,0.00087900297,0.0015445247,0.0010402452,0.0036074403,0.0009238176,0.0005337824,0.022279574],"category_scores_gemma":[0.006182343,0.00037419493,0.00058334076,0.0023368762,0.0012974988,0.005571719,0.002151761,0.0015939297,0.00948906],"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.00095826254,0.00026459838,0.002137014,0.00080305606,0.000089613306,0.0004277961,0.0007039745,0.021318309,0.020253407,0.31076536,0.060147587,0.582131],"study_design_scores_gemma":[0.00026422742,0.00027349728,0.0013640706,0.00042015107,0.00005837074,0.00094364845,0.00034139625,0.07011655,0.041437235,0.7830634,0.10162377,0.00009366366],"about_ca_topic_score_codex":0.00078119815,"about_ca_topic_score_gemma":0.0017956131,"teacher_disagreement_score":0.022279574,"about_ca_system_score_codex":0.00142403,"about_ca_system_score_gemma":0.0013662752,"threshold_uncertainty_score":0.07453257},"labels":[],"label_agreement":null},{"id":"W1572189866","doi":"10.1007/978-3-540-24633-6_5","title":"Mutual Irreducibility of Certain Polynomials","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Irreducibility; Word (group theory); Transformation (genetics); Computer science; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics; Genetics; Biology; Geometry","score_opus":0.018336448441338263,"score_gpt":0.2478270258690636,"score_spread":0.22949057742772533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572189866","genre_codex":"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.43899444,0.0020409664,0.19081125,0.0033311364,0.00035767557,0.00008639667,0.00040002697,0.00048644986,0.36349162],"genre_scores_gemma":[0.9710183,0.0006478262,0.00873361,0.00019480806,0.00028889338,0.000048235022,0.00012519018,0.00008315219,0.018859845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874437,0.00030317347,0.00004941229,0.00021696111,0.00038439655,0.00030155777],"domain_scores_gemma":[0.99657875,0.0020954097,0.00029220455,0.00061901816,0.0002024013,0.00021208904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014584804,0.0004068755,0.0006338155,0.0011885416,0.0020587964,0.0021524807,0.00072181766,0.00074263953,0.0061447658],"category_scores_gemma":[0.004442298,0.00042839054,0.0008953068,0.001198593,0.0044547934,0.005626046,0.002977043,0.0037504165,0.000564654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019861947,0.00000605008,0.000044496523,0.00001520104,0.0000018905673,0.000027442442,0.00018405325,0.00019154123,0.00038520907,0.99654335,0.0002687779,0.002312166],"study_design_scores_gemma":[0.000008906616,0.000018689976,0.00012192766,0.000010129238,0.000006419645,0.00014557343,0.00004857645,0.00096387987,0.0014889265,0.9927059,0.0044721626,0.000008902728],"about_ca_topic_score_codex":0.00020580244,"about_ca_topic_score_gemma":0.00022067198,"teacher_disagreement_score":0.0061447658,"about_ca_system_score_codex":0.001020759,"about_ca_system_score_gemma":0.00057999353,"threshold_uncertainty_score":0.020556271},"labels":[],"label_agreement":null},{"id":"W1573509053","doi":"10.1007/978-3-540-27800-9_13","title":"The Security of Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cryptosystem; The Imaginary; Quadratic equation; Class (philosophy); Mathematics; Arithmetic; Computer science; Discrete mathematics; Cryptography; Algorithm; Psychology; Artificial intelligence","score_opus":0.00688559336694569,"score_gpt":0.21907603396931785,"score_spread":0.21219044060237216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573509053","genre_codex":"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.5529053,0.004793994,0.2653692,0.009792406,0.0011492196,0.00020683861,0.0005079042,0.0010375247,0.16423765],"genre_scores_gemma":[0.977113,0.0007825611,0.011514641,0.00021146072,0.00036040865,0.00006871203,0.00011430885,0.00008245066,0.009752383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807703,0.000612432,0.00009512741,0.00026441526,0.0005913158,0.00035954537],"domain_scores_gemma":[0.99103725,0.0064466125,0.00044049052,0.0012927821,0.0003936483,0.00038916085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024853165,0.0007518127,0.0008771694,0.0013616185,0.0016056203,0.0054221917,0.0009247415,0.001627817,0.0062075923],"category_scores_gemma":[0.006719131,0.0006604468,0.0008855015,0.0007582801,0.0053820577,0.0091549,0.0020496342,0.0037681765,0.0009434444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018516759,0.000025402493,0.00013791466,0.000047010042,0.000011439346,0.000035508227,0.00020212124,0.002573983,0.002239068,0.9882258,0.0010634239,0.005253191],"study_design_scores_gemma":[0.000065011474,0.000053580407,0.00012612638,0.00003053394,0.000010723758,0.000092800066,0.000054860287,0.019873893,0.002607436,0.9735146,0.0035461073,0.0000242128],"about_ca_topic_score_codex":0.00032441082,"about_ca_topic_score_gemma":0.0001840771,"teacher_disagreement_score":0.0062075923,"about_ca_system_score_codex":0.0019677437,"about_ca_system_score_gemma":0.0008621669,"threshold_uncertainty_score":0.020766437},"labels":[],"label_agreement":null},{"id":"W1575500402","doi":"10.1109/ictrc.2015.7156413","title":"Hybrid ARQ with partial retransmission using turbo product codes","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hybrid automatic repeat request; Retransmission; Computer science; Turbo code; Additive white Gaussian noise; Error detection and correction; Algorithm; Automatic repeat request; Decoding methods; Turbo; Cyclic redundancy check; Throughput; Real-time computing; Channel (broadcasting); Network packet; Computer network; Telecommunications link; Wireless; Engineering; Telecommunications","score_opus":0.03939280953811133,"score_gpt":0.24973526432982543,"score_spread":0.2103424547917141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575500402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.11823425,0.0013743298,0.8750757,0.0001561314,0.00016702487,0.00012874705,0.00006884219,0.001806115,0.002988819],"genre_scores_gemma":[0.83025855,0.0003441391,0.16637945,0.00014473074,0.00012131019,0.00008317467,0.000095151656,0.000061827726,0.0025116662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864453,0.00044882394,0.00008699206,0.00017967595,0.0005179404,0.0001220297],"domain_scores_gemma":[0.9965873,0.0013965768,0.00033501352,0.0007452637,0.00084490364,0.0000909463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017186605,0.000717778,0.00090393116,0.0008226097,0.0005792958,0.00089009065,0.0013149618,0.0007291388,0.0010468379],"category_scores_gemma":[0.0027530445,0.00026803373,0.0005203409,0.00062342244,0.0007838655,0.0012605559,0.00092689344,0.0006437132,0.0005405054],"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.0018139888,0.00031770195,0.0041876393,0.0005492393,0.00044829183,0.0016016313,0.00068888464,0.17051026,0.21859227,0.044691417,0.0030419081,0.55355686],"study_design_scores_gemma":[0.00015569563,0.0014292034,0.0009822219,0.00004190875,0.0001619176,0.0020617284,0.000064740394,0.90706205,0.073586434,0.008153773,0.006152097,0.00014827776],"about_ca_topic_score_codex":0.0006513166,"about_ca_topic_score_gemma":0.000715929,"teacher_disagreement_score":0.0017186605,"about_ca_system_score_codex":0.00032334216,"about_ca_system_score_gemma":0.0005151262,"threshold_uncertainty_score":0.0090892315},"labels":[],"label_agreement":null},{"id":"W1577489686","doi":"10.1007/978-3-540-77404-4_4","title":"The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Autocorrelation; Complementary sequences; Sequence (biology); Pseudorandom binary sequence; Legendre polynomials; Binary number; Mathematics; Periodic sequence; Product (mathematics); Combinatorics; Statistics; Mathematical analysis; Arithmetic; Chemistry","score_opus":0.023019069819535592,"score_gpt":0.2633508461847912,"score_spread":0.24033177636525563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577489686","genre_codex":"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.5706676,0.004704751,0.24503908,0.0019298226,0.0013818593,0.00011528526,0.0005561516,0.0008579938,0.17474745],"genre_scores_gemma":[0.9315258,0.00087926467,0.037880536,0.00030770895,0.0004028136,0.00007015148,0.00023891559,0.00015895914,0.028535794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998066,0.00004113015,0.000013276284,0.00003693372,0.000061687875,0.00004043198],"domain_scores_gemma":[0.99929535,0.00030959508,0.00010795399,0.00011367946,0.00008421123,0.00008917563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035880227,0.00048676392,0.0004794919,0.0013216989,0.0006860907,0.0013475323,0.0004909872,0.0010966642,0.0058896784],"category_scores_gemma":[0.0027651202,0.00029038612,0.00026034203,0.0007702532,0.0012765779,0.0011045292,0.0007768535,0.0008856922,0.00095608574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022093124,0.000021194708,0.00033314415,0.00013301012,0.0000075254393,0.0004970901,0.00019156381,0.0045903027,0.016437698,0.9422797,0.0028481975,0.03243972],"study_design_scores_gemma":[0.00004949257,0.00011465807,0.0010384026,0.00009645513,0.000019252413,0.0012148009,0.0001079371,0.029525103,0.008810889,0.940755,0.018206846,0.00006121193],"about_ca_topic_score_codex":0.00046789012,"about_ca_topic_score_gemma":0.00047953712,"teacher_disagreement_score":0.0058896784,"about_ca_system_score_codex":0.0006303272,"about_ca_system_score_gemma":0.0006159883,"threshold_uncertainty_score":0.019702971},"labels":[],"label_agreement":null},{"id":"W1579458986","doi":"10.1006/jcta.2000.3159","title":"Orthogonal Frames in the Leech Lattice and a Type II Code over Z22","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Leech; Lattice (music); Basis (linear algebra); Mathematics; Orthogonal basis; Combinatorics; Code (set theory); Type (biology); Discrete mathematics; Pure mathematics; Computer science; Physics; Geometry; Programming language; Biology; Quantum mechanics","score_opus":0.011505245931273068,"score_gpt":0.2479558214037235,"score_spread":0.23645057547245044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579458986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.84257996,0.000667829,0.060530055,0.0027683899,0.000487681,0.00006369571,0.00042263436,0.00024646142,0.09223346],"genre_scores_gemma":[0.9684895,0.0002663568,0.01018299,0.00037098737,0.00028628696,0.00005471041,0.00018259045,0.00006553014,0.020100981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993498,0.00017435932,0.00002558653,0.000077032506,0.00015984722,0.00021333531],"domain_scores_gemma":[0.9989838,0.00029236244,0.00020056311,0.00011161485,0.00013005418,0.00028156742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068576937,0.00063803565,0.00074418465,0.0016462418,0.002319132,0.00323291,0.000757062,0.0014465945,0.004958604],"category_scores_gemma":[0.0015955763,0.00038255294,0.00052130874,0.0012395527,0.0030720457,0.0024676425,0.0015194432,0.0019692567,0.00065266783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010476567,0.000021639544,0.00019061632,0.000009628413,0.0000031962038,0.00015193013,0.00013197426,0.0008727313,0.0010891974,0.9943983,0.00085580384,0.0021700468],"study_design_scores_gemma":[0.00006455104,0.000043087988,0.00024769094,0.000013831611,0.0000054175594,0.00014406782,0.00018089669,0.007992251,0.00093467656,0.98786616,0.0024731332,0.000034325887],"about_ca_topic_score_codex":0.0025529808,"about_ca_topic_score_gemma":0.0025910817,"teacher_disagreement_score":0.004958604,"about_ca_system_score_codex":0.0013511016,"about_ca_system_score_gemma":0.0010818554,"threshold_uncertainty_score":0.016588151},"labels":[],"label_agreement":null},{"id":"W1580296010","doi":"10.1002/9780470724347.ch5","title":"Space‐Time Trellis Codes","year":2007,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Space–time trellis code; Trellis (graph); Block code; Code (set theory); Computer science; Convolutional code; Space time; Mathematics; Algorithm; Linear code; Theoretical computer science; Decoding methods; Engineering; Programming language","score_opus":0.008985799443707261,"score_gpt":0.22570541772169425,"score_spread":0.216719618277987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580296010","genre_codex":"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.017236857,0.016535794,0.51352537,0.001709397,0.0028485686,0.0004506219,0.0033762064,0.0028133565,0.4415039],"genre_scores_gemma":[0.14912602,0.030883892,0.19482116,0.0010050086,0.0017371865,0.00040088876,0.00619154,0.00086717587,0.6149671],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995499,0.00004340933,0.000023130675,0.00006515978,0.00027966013,0.000038762348],"domain_scores_gemma":[0.9995472,0.00011679961,0.00003145451,0.000079878395,0.00020744978,0.000017179378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024298367,0.0006067508,0.0005285451,0.0009090681,0.00051073846,0.0013578429,0.00064506615,0.00064083893,0.03414475],"category_scores_gemma":[0.001045709,0.00022638794,0.00037263913,0.0019739124,0.00048447074,0.0010688514,0.0004529253,0.00074158644,0.0143042235],"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.00015211415,0.000057467507,0.00027173612,0.0006815008,0.000023816814,0.00015301011,0.000205125,0.017676106,0.031846832,0.39805382,0.07430741,0.47657108],"study_design_scores_gemma":[0.000031973635,0.0001036693,0.0007670995,0.00023600008,0.000022881364,0.0005831529,0.00005338729,0.03145793,0.027462153,0.07832308,0.86089593,0.00006272732],"about_ca_topic_score_codex":0.0020581998,"about_ca_topic_score_gemma":0.0020466014,"teacher_disagreement_score":0.03414475,"about_ca_system_score_codex":0.0010787874,"about_ca_system_score_gemma":0.0010477563,"threshold_uncertainty_score":0.114225626},"labels":[],"label_agreement":null},{"id":"W1582873326","doi":"10.1090/conm/579","title":"Theory and Applications of Finite Fields","year":2012,"lang":"en","type":"book","venue":"Contemporary mathematics - American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.02218294791805391,"score_gpt":0.2545365056760358,"score_spread":0.2323535577579819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582873326","genre_codex":"other","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.0062287115,0.17948158,0.09908563,0.007989335,0.004670874,0.00008634647,0.00024557352,0.00037190958,0.70184004],"genre_scores_gemma":[0.27224594,0.22482884,0.14156657,0.0059401942,0.014332364,0.0005793612,0.0008127088,0.0004323335,0.33926162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991418,0.0002699713,0.000054012286,0.0001519365,0.0003109334,0.00007132682],"domain_scores_gemma":[0.99926096,0.00038206126,0.00003719102,0.00015671077,0.00010350494,0.000059613016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010462217,0.0009793903,0.00096185686,0.0026575776,0.0017532443,0.0035876776,0.0009568558,0.0014135662,0.018117504],"category_scores_gemma":[0.0026740741,0.00044580834,0.00086167495,0.0031231765,0.003940392,0.005198884,0.0025294013,0.0035299927,0.0063131354],"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.0000066370912,0.000010349944,0.00008155479,0.0001629792,0.000006181861,0.000054360316,0.00017194476,0.00058960204,0.00027246104,0.94001675,0.010158435,0.048468743],"study_design_scores_gemma":[0.000004616079,0.000014396476,0.0001186859,0.00017099785,0.0000039050524,0.00025083238,0.000046119272,0.0012682776,0.00017282173,0.7841624,0.21377936,0.0000075707544],"about_ca_topic_score_codex":0.0007980479,"about_ca_topic_score_gemma":0.00063328655,"teacher_disagreement_score":0.018117504,"about_ca_system_score_codex":0.0025837366,"about_ca_system_score_gemma":0.0011112526,"threshold_uncertainty_score":0.06060916},"labels":[],"label_agreement":null},{"id":"W1590232726","doi":"10.1109/sips.2002.1049692","title":"An assessment of VLSI and embedded software implementations for Reed-Solomon decoders","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Very-large-scale integration; Decoding methods; Computer science; Implementation; CMOS; Software; Focus (optics); Soft-decision decoder; Domain (mathematical analysis); Software implementation; Embedded system; Computer hardware; Parallel computing; Computer architecture; Telecommunications; Electronic engineering; Engineering; Operating system; Mathematics","score_opus":0.021169950523226986,"score_gpt":0.3719385247002031,"score_spread":0.3507685741769761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590232726","genre_codex":"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.68576354,0.00915033,0.2727544,0.0004961187,0.00012594537,0.000285148,0.00020108993,0.0016281282,0.029595356],"genre_scores_gemma":[0.8239531,0.0031754721,0.16359355,0.00016090545,0.000072199764,0.00010458332,0.00036687768,0.00024271286,0.00833067],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99876785,0.00034189544,0.00008033792,0.00008650838,0.0006481424,0.00007528604],"domain_scores_gemma":[0.99513996,0.00244783,0.0003167957,0.00032018172,0.0017066123,0.00006869434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095670443,0.00044261597,0.00019392042,0.0008267486,0.00013826357,0.00065079884,0.00068653317,0.00049637107,0.0027329312],"category_scores_gemma":[0.007973792,0.00020379701,0.00022303923,0.0007241174,0.00021524844,0.0010905962,0.0002181004,0.00027990044,0.00069538254],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001183634,0.0002166494,0.010266624,0.0011034288,0.00013241681,0.0002091795,0.00017169479,0.085517034,0.17343251,0.016713293,0.0013106759,0.70974284],"study_design_scores_gemma":[0.00036690116,0.011691468,0.022438059,0.0005047969,0.00045816114,0.0031258257,0.00040764853,0.33910277,0.53137267,0.007857901,0.082586005,0.000087785746],"about_ca_topic_score_codex":0.0005820475,"about_ca_topic_score_gemma":0.0009523795,"teacher_disagreement_score":0.0027329312,"about_ca_system_score_codex":0.0005419615,"about_ca_system_score_gemma":0.00048108323,"threshold_uncertainty_score":0.009142578},"labels":[],"label_agreement":null},{"id":"W1593375236","doi":"10.1007/11423461_22","title":"New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; TRACE (psycholinguistics); Discrete logarithm; Cryptosystem; Computer science; Linear feedback shift register; Cryptography; Algorithm; Tuple; Theoretical computer science; Logarithm; Arithmetic; Mathematics; Discrete mathematics; Public-key cryptography; Shift register; Encryption","score_opus":0.010743690716865094,"score_gpt":0.22239090092781358,"score_spread":0.21164721021094848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593375236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.030097255,0.0123896655,0.8601089,0.0077123474,0.0015401464,0.00012629054,0.00023482794,0.0011400036,0.08665053],"genre_scores_gemma":[0.5588539,0.0122132385,0.36574966,0.002033573,0.002759181,0.00027190955,0.00047263462,0.00037423402,0.05727167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886084,0.0002497198,0.00006983846,0.0001801344,0.0005466886,0.00009275486],"domain_scores_gemma":[0.99842644,0.00083771424,0.00011631935,0.0003831555,0.00017594731,0.0000604594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012958692,0.000607325,0.0006953401,0.0012265508,0.0007969387,0.0029922086,0.0013430013,0.0019511145,0.005773167],"category_scores_gemma":[0.004031367,0.00051747984,0.0005253632,0.0015994947,0.0029351765,0.0090256855,0.0024159108,0.0052584796,0.0013562869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008291579,0.0000730684,0.0000743029,0.00014041291,0.000011361353,0.00007574218,0.00008625669,0.0051084133,0.0029154674,0.87605447,0.005167683,0.11020986],"study_design_scores_gemma":[0.000030098581,0.00004109338,0.000037167003,0.00003555729,0.000006032964,0.00022876373,0.000018147954,0.026555268,0.0030117093,0.95702124,0.012998294,0.00001665882],"about_ca_topic_score_codex":0.0001347208,"about_ca_topic_score_gemma":0.0002387706,"teacher_disagreement_score":0.005773167,"about_ca_system_score_codex":0.0012466315,"about_ca_system_score_gemma":0.0007077246,"threshold_uncertainty_score":0.019313157},"labels":[],"label_agreement":null},{"id":"W1594587694","doi":"10.1007/3-540-45624-4_13","title":"Optimal Double Circulant Z4-Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Computer science; Theoretical computer science; Algorithm","score_opus":0.019987837981299827,"score_gpt":0.2410516356966528,"score_spread":0.22106379771535298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594587694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.24223074,0.0059362715,0.48654246,0.0028476578,0.0014226984,0.00023936627,0.0013031997,0.0014855838,0.25799206],"genre_scores_gemma":[0.7433921,0.0034933176,0.1727652,0.0009435759,0.00047005282,0.0003194077,0.00086456444,0.00064796564,0.07710385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922013,0.00014630432,0.000038775433,0.000099838166,0.00029539602,0.00019947372],"domain_scores_gemma":[0.9990575,0.0003317518,0.00010648661,0.00021692317,0.00018801911,0.00009929259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059381995,0.0010551262,0.00081200677,0.0013749753,0.0009094658,0.0017530425,0.00079465803,0.0011276916,0.010803875],"category_scores_gemma":[0.0028214387,0.0004946843,0.0005013587,0.001593394,0.0011493586,0.0017930816,0.0017609944,0.001439777,0.0024070505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003496566,0.000045223383,0.00018521669,0.00017926992,0.000021266742,0.00007699113,0.00006873209,0.018443577,0.008796438,0.883272,0.008242756,0.08031902],"study_design_scores_gemma":[0.00012972062,0.00011024648,0.00026070204,0.00012418997,0.000034637203,0.00024156155,0.000056054698,0.054754198,0.01406963,0.9041523,0.02600976,0.000057116144],"about_ca_topic_score_codex":0.00069425453,"about_ca_topic_score_gemma":0.0012629823,"teacher_disagreement_score":0.010803875,"about_ca_system_score_codex":0.0014675175,"about_ca_system_score_gemma":0.0016590204,"threshold_uncertainty_score":0.036142588},"labels":[],"label_agreement":null},{"id":"W1596162550","doi":"10.5539/jmr.v7n2p187","title":"The Weight and Nonlinearity of 2-rotation Symmetric Cubic Boolean Function","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Mathematics; Boolean function; Rotation (mathematics); Symmetric function; Invariant (physics); Nonlinear system; Combinatorics; Function (biology); Weight function; Pure mathematics; Mathematical analysis; Mathematical physics; Geometry; Quantum mechanics; Physics","score_opus":0.11785239494734996,"score_gpt":0.3654475783462523,"score_spread":0.24759518339890235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596162550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.73437476,0.001066279,0.14350097,0.0024414004,0.00035588318,0.0000760685,0.0003707553,0.00019327612,0.11762067],"genre_scores_gemma":[0.97471535,0.0006514839,0.011015885,0.00023278073,0.0002013973,0.00007522259,0.00010679802,0.000056890643,0.012944233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960595,0.000053250056,0.000016329821,0.000048410293,0.00017055513,0.00010551539],"domain_scores_gemma":[0.9995067,0.00017747378,0.000077272714,0.000061685554,0.00011896949,0.000057924062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003277983,0.0003199894,0.00032136607,0.0011279742,0.0007968594,0.0010684538,0.00051206944,0.00057924946,0.0037230174],"category_scores_gemma":[0.0021525985,0.00019879208,0.0003683371,0.00094646716,0.0018311692,0.0024102447,0.0012554653,0.0013809024,0.00054156414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037164868,0.000011940824,0.00044469602,0.000034441644,0.0000035268274,0.00012525787,0.00015643593,0.0021695625,0.0038355729,0.9806425,0.0010663222,0.01147269],"study_design_scores_gemma":[0.00001842993,0.000038858972,0.0010964128,0.000025222267,0.000010909233,0.00043716078,0.00010884839,0.037735812,0.0048004477,0.9485221,0.0071507334,0.00005508398],"about_ca_topic_score_codex":0.0019867974,"about_ca_topic_score_gemma":0.0017376447,"teacher_disagreement_score":0.0037230174,"about_ca_system_score_codex":0.0012386279,"about_ca_system_score_gemma":0.00080511905,"threshold_uncertainty_score":0.012454748},"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":"W1599558128","doi":"","title":"The WG Stream Cipher","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Affine cipher; Running key cipher; Cipher; Stream cipher attack; Keystream; Computer science; Transposition cipher; Two-square cipher; Block cipher mode of operation; Cryptography; Arithmetic; Algorithm; Mathematics; Theoretical computer science; CBC-MAC; Computer security; Encryption","score_opus":0.00714446427892813,"score_gpt":0.21473544862564034,"score_spread":0.20759098434671222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599558128","genre_codex":"methods","genre_gemma":"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.057882838,0.002715059,0.8726018,0.0011110137,0.001405488,0.00046595265,0.00050066714,0.0018358933,0.061481338],"genre_scores_gemma":[0.7075549,0.0035006932,0.24020211,0.0012723348,0.0007361451,0.00035493213,0.00083815044,0.000331849,0.045208853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994992,0.00012256808,0.00004662157,0.000088113324,0.00017747158,0.00006609038],"domain_scores_gemma":[0.9996749,0.000055893004,0.000052722527,0.00011840214,0.00006918002,0.000028831626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062235916,0.00055911695,0.00032797147,0.00048520922,0.0002715968,0.00083284255,0.000361051,0.000465734,0.0024967787],"category_scores_gemma":[0.00082136906,0.00018303312,0.00040924764,0.0004236127,0.00083752285,0.0018980977,0.00064772443,0.0009072864,0.0017491515],"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.00048630746,0.00006494347,0.0013262078,0.0003892757,0.00006532868,0.0008007424,0.00018748145,0.019711064,0.083114214,0.65928406,0.014872621,0.21969788],"study_design_scores_gemma":[0.00024256676,0.00074485206,0.0017961801,0.00013870343,0.00013479659,0.0040485132,0.00008059257,0.20158449,0.2556186,0.19995666,0.33555707,0.00009693787],"about_ca_topic_score_codex":0.0001511304,"about_ca_topic_score_gemma":0.00013247998,"teacher_disagreement_score":0.0024967787,"about_ca_system_score_codex":0.00034128575,"about_ca_system_score_gemma":0.0006024566,"threshold_uncertainty_score":0.008352578},"labels":[],"label_agreement":null},{"id":"W1604695990","doi":"10.1007/3-540-45624-4_12","title":"On Senary Simplex Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Simplex; Weight distribution; Orthogonality; Computer science; Block code; Linear code; Hierarchy; Binary number; Discrete mathematics; Mathematics; Combinatorics; Algorithm; Arithmetic; Decoding methods; Physics; Geometry","score_opus":0.01759614767029209,"score_gpt":0.24465608818497314,"score_spread":0.22705994051468106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604695990","genre_codex":"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.065078974,0.0033377893,0.22842902,0.0017230068,0.0013900012,0.00010854984,0.00049177866,0.0004099614,0.6990309],"genre_scores_gemma":[0.5702847,0.0069122016,0.08106422,0.0013982371,0.0009718114,0.00034716728,0.000839587,0.0008580795,0.33732402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995333,0.00012624393,0.000022273649,0.000052090774,0.00019600184,0.00007014635],"domain_scores_gemma":[0.9994906,0.00019382557,0.000038169066,0.000098086355,0.00012458091,0.00005465631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036554906,0.0008157709,0.00072484306,0.001597437,0.0015534001,0.0019794605,0.0006556792,0.0007801095,0.013413949],"category_scores_gemma":[0.0018386968,0.00040083416,0.0005912757,0.002398963,0.0019364064,0.002379828,0.0025051797,0.002938015,0.004276584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014316658,0.0000046831956,0.000034786543,0.000018860179,0.0000023122184,0.00001774178,0.0000630391,0.001052929,0.0002623785,0.9821655,0.0025346216,0.013828723],"study_design_scores_gemma":[0.0000043352493,0.000007635451,0.000041384777,0.000026530599,0.0000029056785,0.000065655215,0.00003455401,0.0032048314,0.00044030117,0.9794195,0.016743997,0.000008345779],"about_ca_topic_score_codex":0.0012758529,"about_ca_topic_score_gemma":0.0013245664,"teacher_disagreement_score":0.013413949,"about_ca_system_score_codex":0.0011515839,"about_ca_system_score_gemma":0.0008074486,"threshold_uncertainty_score":0.044874072},"labels":[],"label_agreement":null},{"id":"W1605083655","doi":"10.1007/11779360_29","title":"Realizations from Decimation Hadamard Transform for Special Classes of Binary Sequences with Two-Level Autocorrelation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hadamard transform; Autocorrelation; Decimation; Mathematics; Complementary sequences; Binary number; Pseudorandom binary sequence; Autocorrelation matrix; Sequence (biology); Quadratic residue; Autocorrelation technique; Discrete mathematics; Algorithm; Combinatorics; Computer science; Arithmetic; Statistics; Telecommunications; Mathematical analysis","score_opus":0.023116194565001393,"score_gpt":0.24891497706386684,"score_spread":0.22579878249886545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605083655","genre_codex":"methods","genre_gemma":"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.43543383,0.0013133524,0.4973445,0.0007927224,0.00033921844,0.00006039226,0.0003731026,0.00038103617,0.06396192],"genre_scores_gemma":[0.9463226,0.00046768534,0.041385446,0.0001459117,0.00023620558,0.000063314365,0.0003665548,0.00011818555,0.010894027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996044,0.000091646725,0.000025474921,0.00005687681,0.00013951422,0.0000820956],"domain_scores_gemma":[0.999046,0.00042094247,0.00011947279,0.00018259081,0.0001277598,0.000103145714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060189073,0.00053327356,0.00058107614,0.0008888036,0.00065532024,0.0015433576,0.00048203047,0.0011489678,0.0040522013],"category_scores_gemma":[0.0019997396,0.00035291808,0.00067486387,0.00060535205,0.0010416151,0.0012343933,0.00071557914,0.0014990881,0.0006827143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116048286,0.000022548536,0.00030031448,0.000061966304,0.000011666464,0.00038608076,0.00017642611,0.0059629106,0.013138669,0.96985763,0.00077257847,0.009193216],"study_design_scores_gemma":[0.00005421498,0.00007905358,0.001156836,0.000037907106,0.000017957935,0.0012185087,0.00008828658,0.14089094,0.010506622,0.84089863,0.0049751056,0.00007589932],"about_ca_topic_score_codex":0.00026609376,"about_ca_topic_score_gemma":0.00027378224,"teacher_disagreement_score":0.0040522013,"about_ca_system_score_codex":0.0005453019,"about_ca_system_score_gemma":0.00041185025,"threshold_uncertainty_score":0.013555944},"labels":[],"label_agreement":null},{"id":"W1606804863","doi":"10.1090/crmp/035/19","title":"Convex cones and SAGBI bases of permutation invariants","year":2004,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Invariant (physics); Regular polygon; Polynomial ring; Permutation (music); Ring (chemistry); Permutation group; Order (exchange); Polynomial; Pure mathematics; Geometry; Physics; Mathematical analysis; Chemistry; Mathematical physics","score_opus":0.01322399768692253,"score_gpt":0.2088755088114998,"score_spread":0.19565151112457727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606804863","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.05436839,0.040444903,0.11666851,0.0059005767,0.006097712,0.000045732733,0.0009956502,0.0009945721,0.7744839],"genre_scores_gemma":[0.43084985,0.026757073,0.05594022,0.0014861227,0.0070753326,0.00011236371,0.0026319192,0.0007905145,0.47435674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998915,0.000021812606,0.0000045855018,0.000020503478,0.000047325848,0.000014289375],"domain_scores_gemma":[0.9998692,0.00003634807,0.00001804641,0.000016714237,0.000032731034,0.00002687346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019161648,0.00079197023,0.00058375404,0.0014600188,0.00084085134,0.0030607427,0.0005050693,0.0004439644,0.020029206],"category_scores_gemma":[0.00044465388,0.00037274588,0.00042364217,0.0020940944,0.0009597309,0.0015484279,0.0006036035,0.0018005318,0.0038000203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000409889,0.00003940312,0.00012665038,0.000056647445,0.000012245472,0.00004284398,0.00011507194,0.0017635295,0.0011977154,0.90264446,0.03846873,0.055491768],"study_design_scores_gemma":[0.000007555299,0.000013019573,0.00032680505,0.000027944892,0.000007331106,0.000047909605,0.000058238933,0.0024345429,0.00040314763,0.9356089,0.061052646,0.000011857124],"about_ca_topic_score_codex":0.0010985291,"about_ca_topic_score_gemma":0.0016033998,"teacher_disagreement_score":0.020029206,"about_ca_system_score_codex":0.0010146453,"about_ca_system_score_gemma":0.00048607212,"threshold_uncertainty_score":0.06700438},"labels":[],"label_agreement":null},{"id":"W162262572","doi":"","title":"Subquadratic Multiplication Using Optimal Normal Bases","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Toeplitz matrix; Matrix multiplication; Multiplication (music); Mathematics; Multiplication algorithm; Binary number; Product (mathematics); Scheme (mathematics); Computational complexity theory; Algebra over a field; Matrix (chemical analysis); Computer science; Arithmetic; Algorithm; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.01449888554027283,"score_gpt":0.23049675273143308,"score_spread":0.21599786719116026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162262572","genre_codex":"methods","genre_gemma":"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.047267854,0.00036631397,0.9255953,0.0002550415,0.00014623276,0.000091956725,0.00009842953,0.00080203376,0.025376929],"genre_scores_gemma":[0.5909802,0.00065112667,0.3976334,0.00012720811,0.00018060429,0.00016389081,0.00027994663,0.00013455615,0.009849048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988689,0.00027605146,0.000075250435,0.00014565671,0.00043063582,0.00020343658],"domain_scores_gemma":[0.9991567,0.00025249785,0.00008250344,0.00028862516,0.00015057907,0.00006902156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008284758,0.00090702926,0.0007013508,0.0008788967,0.00069575774,0.0020359259,0.00088962214,0.00039866296,0.005204404],"category_scores_gemma":[0.0023460768,0.00025863372,0.0004343706,0.0010128181,0.0010846887,0.0030415661,0.0017277243,0.0012993297,0.0015956889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032768858,0.00009489514,0.00021716289,0.000099888966,0.000016858337,0.00007370438,0.000113524366,0.017866602,0.014620382,0.8290444,0.0034802624,0.13404462],"study_design_scores_gemma":[0.00009161731,0.00039095813,0.00015656433,0.000044336502,0.000023767927,0.0002803078,0.000067521265,0.31394348,0.03488595,0.6377064,0.0123405615,0.000068554225],"about_ca_topic_score_codex":0.00047175543,"about_ca_topic_score_gemma":0.0007729391,"teacher_disagreement_score":0.005204404,"about_ca_system_score_codex":0.00093905505,"about_ca_system_score_gemma":0.00095961284,"threshold_uncertainty_score":0.017410457},"labels":[],"label_agreement":null},{"id":"W1630586687","doi":"10.26421/qic13.3-4-4","title":"Reduction from non-injective hidden shift problem to injective hidden shift problem","year":2013,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Injective function; Reduction (mathematics); Bent molecular geometry; Simple (philosophy); Mathematics; Discrete mathematics; Computer science; Combinatorics; Geometry","score_opus":0.012470724546861066,"score_gpt":0.2453528538428424,"score_spread":0.23288212929598132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630586687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.22654283,0.00056029443,0.64999115,0.004670461,0.00036475988,0.00031386298,0.0005397438,0.00057846337,0.11643838],"genre_scores_gemma":[0.9224671,0.00056077586,0.05540054,0.0007529667,0.00035016405,0.00027014682,0.0007466398,0.00031388112,0.019137762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971506,0.00059544586,0.00018426747,0.00052289065,0.0010136828,0.0005331646],"domain_scores_gemma":[0.9961175,0.002008303,0.00018837622,0.0009880794,0.00041630593,0.00028152097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017457197,0.00071067305,0.00094431406,0.00075828336,0.0015835365,0.0034106567,0.0024897878,0.0020263137,0.009565595],"category_scores_gemma":[0.0065368,0.00043398197,0.00231348,0.0009509719,0.0036496697,0.008138278,0.00622756,0.006114331,0.0013233274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041864925,0.00005050924,0.00023346039,0.00008390383,0.000019652409,0.00014897116,0.0002860291,0.0035821884,0.0015238934,0.9841738,0.0018191106,0.008036664],"study_design_scores_gemma":[0.000019763049,0.00001577867,0.00011576617,0.000009890949,0.000015187113,0.00012839712,0.00013236163,0.01576636,0.0023203762,0.9792125,0.0022484155,0.000015246191],"about_ca_topic_score_codex":0.00082220417,"about_ca_topic_score_gemma":0.000595665,"teacher_disagreement_score":0.009565595,"about_ca_system_score_codex":0.0013133292,"about_ca_system_score_gemma":0.001332298,"threshold_uncertainty_score":0.032000065},"labels":[],"label_agreement":null},{"id":"W16323757","doi":"10.1021/es051382h","title":"On Generalized Schur Numbers for x1+x2+c = kx3.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Schur's theorem; Schur complement; Combinatorics; Pure mathematics; Orthogonal polynomials; Physics; Eigenvalues and eigenvectors","score_opus":0.012983303118572858,"score_gpt":0.2578665010753239,"score_spread":0.24488319795675104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16323757","genre_codex":"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.16971591,0.00816209,0.518434,0.0059402245,0.002335499,0.00050329696,0.004424161,0.0008366915,0.28964818],"genre_scores_gemma":[0.7714729,0.0066047246,0.11466273,0.0016381183,0.0016170669,0.0012478827,0.0033189077,0.0006279154,0.09880978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981665,0.00062678923,0.00010400908,0.00033453794,0.00042055963,0.0003477148],"domain_scores_gemma":[0.9943125,0.0029751528,0.0006582425,0.0004718661,0.0012671269,0.00031521945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030132013,0.0016954764,0.0011436075,0.0034843283,0.0016926844,0.0029754017,0.0016111104,0.0012947564,0.045545783],"category_scores_gemma":[0.0130876135,0.00045420835,0.0013348407,0.0025099039,0.003831617,0.0055655716,0.0023296725,0.0029298603,0.010960813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084618114,0.000034736677,0.00069546513,0.00016621023,0.000031303836,0.00017611828,0.00023180843,0.004694667,0.00046297003,0.9584139,0.010706255,0.024302019],"study_design_scores_gemma":[0.000027066924,0.000042187774,0.00078296283,0.00007363618,0.000013087848,0.00025991,0.00007044468,0.029136447,0.00038403124,0.9569037,0.012256281,0.00005032587],"about_ca_topic_score_codex":0.0030335316,"about_ca_topic_score_gemma":0.0026515988,"teacher_disagreement_score":0.045545783,"about_ca_system_score_codex":0.0014968758,"about_ca_system_score_gemma":0.0011698556,"threshold_uncertainty_score":0.15236586},"labels":[],"label_agreement":null},{"id":"W1633446687","doi":"10.1090/mcom/2978","title":"The self-power map and collecting all residue classes","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Exponential function; Natural number; Discrete mathematics; Function (biology); Upper and lower bounds; Prime (order theory); Prime power; Exponential sum; Mathematical analysis","score_opus":0.03210874508694974,"score_gpt":0.27754703364778655,"score_spread":0.2454382885608368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1633446687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.11085268,0.00087320263,0.66126275,0.001695786,0.0009549833,0.00015226318,0.0008143732,0.002465598,0.2209284],"genre_scores_gemma":[0.698864,0.0011354,0.17498223,0.0007792733,0.0013388338,0.00018297935,0.0013145434,0.0023790416,0.11902375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987104,0.00022546068,0.0000689583,0.00040221945,0.00036854984,0.00022445407],"domain_scores_gemma":[0.9987544,0.00031381086,0.00009630221,0.0003557232,0.0003367202,0.00014303847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011986359,0.0008460242,0.0007449591,0.0021249289,0.0020186084,0.003804843,0.0010553679,0.0006501839,0.013994945],"category_scores_gemma":[0.003290664,0.00045303215,0.00118208,0.0011205652,0.0033521103,0.0096330885,0.0035957634,0.002252055,0.0042473874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003350798,0.000019023497,0.00021006976,0.00003627851,0.000006683597,0.000080613376,0.00034739147,0.00036018356,0.0009738841,0.97118855,0.0040358054,0.02270809],"study_design_scores_gemma":[0.000011450632,0.000029125604,0.00025742225,0.000018350029,0.000009694836,0.00019033349,0.00013814056,0.002161233,0.0037198684,0.96412104,0.029324511,0.000018793933],"about_ca_topic_score_codex":0.0007445985,"about_ca_topic_score_gemma":0.0006405483,"teacher_disagreement_score":0.013994945,"about_ca_system_score_codex":0.0010256016,"about_ca_system_score_gemma":0.0009330724,"threshold_uncertainty_score":0.04681772},"labels":[],"label_agreement":null},{"id":"W1634602415","doi":"10.1109/isit.1993.748414","title":"On the minimum Code Length of s-step (T, U) Permutation Decodable Cyclic Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Permutation (music); Code (set theory); Computer science; Combinatorics; Cyclic code; Mathematics; Discrete mathematics; Algorithm; Concatenated error correction code; Block code; Decoding methods; Physics; Programming language","score_opus":0.015283925895714734,"score_gpt":0.24199640562207264,"score_spread":0.2267124797263579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634602415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.76767373,0.003643896,0.20046397,0.0049014343,0.00022677882,0.00016555836,0.0023202116,0.0009192025,0.019685311],"genre_scores_gemma":[0.9546398,0.0012425623,0.039281134,0.0002949996,0.00020961023,0.00021968178,0.0008785905,0.00026689074,0.0029667693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979589,0.0006905864,0.00013151416,0.00033597887,0.0005330602,0.00034994847],"domain_scores_gemma":[0.97800237,0.015951186,0.0018545385,0.0018623999,0.0016152874,0.0007141582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020207383,0.00076033943,0.0010596208,0.0011267005,0.0012344933,0.002187552,0.0014200622,0.002113203,0.0029226036],"category_scores_gemma":[0.018444058,0.0005872454,0.0004997813,0.001347035,0.0018708194,0.002645578,0.0017221334,0.0019159721,0.0004843719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005332523,0.00023800427,0.008088538,0.0013909352,0.00023591543,0.00086904975,0.0011655795,0.25232592,0.11671261,0.48577684,0.010660769,0.11720342],"study_design_scores_gemma":[0.0003562024,0.00061728305,0.0032561722,0.00038132153,0.00012676403,0.00071597064,0.00024278212,0.52204925,0.04398654,0.42397085,0.0041412986,0.00015555455],"about_ca_topic_score_codex":0.0010933705,"about_ca_topic_score_gemma":0.0016955797,"teacher_disagreement_score":0.0029226036,"about_ca_system_score_codex":0.0018909329,"about_ca_system_score_gemma":0.0029788043,"threshold_uncertainty_score":0.013719678},"labels":[],"label_agreement":null},{"id":"W1641456849","doi":"10.1090/s0002-9939-05-08220-1","title":"A generalized Lucas sequence and permutation binomials","year":2005,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Lucas sequence; Permutation (music); Mathematics; Combinatorics; Lucas number; Genetics; Biology; Fibonacci number; Philosophy; Fibonacci polynomials","score_opus":0.022731961736840427,"score_gpt":0.27101421068409604,"score_spread":0.24828224894725562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641456849","genre_codex":"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.24792233,0.0027325824,0.19137198,0.00388625,0.001791509,0.00013413375,0.0009010473,0.0009882535,0.55027187],"genre_scores_gemma":[0.78931,0.0019016635,0.05190602,0.0008273146,0.0007478964,0.00013205386,0.00074204296,0.00053893775,0.15389408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950147,0.00012513477,0.000024008581,0.00009774323,0.00014247022,0.000109143024],"domain_scores_gemma":[0.99933136,0.00025273618,0.00008179328,0.000077788805,0.00015804169,0.00009817084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006364468,0.00063184655,0.00058083446,0.0018733435,0.0014691553,0.0021160387,0.0005598107,0.0007100181,0.022436315],"category_scores_gemma":[0.0030621896,0.00035371433,0.00074586086,0.0015775573,0.0019287172,0.0025866134,0.001378719,0.0015480651,0.004712978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034753266,0.000007873658,0.00013908814,0.00004099648,0.0000032388466,0.00013720746,0.00014784282,0.0009043425,0.00059788645,0.98066,0.0036306295,0.013696116],"study_design_scores_gemma":[0.000024342931,0.00003089668,0.00031265634,0.000039691648,0.000007373554,0.00027761914,0.00011996726,0.005528632,0.00080575026,0.9625689,0.030259373,0.000024898354],"about_ca_topic_score_codex":0.0022005842,"about_ca_topic_score_gemma":0.0025441067,"teacher_disagreement_score":0.022436315,"about_ca_system_score_codex":0.0018664713,"about_ca_system_score_gemma":0.0009356585,"threshold_uncertainty_score":0.07505697},"labels":[],"label_agreement":null},{"id":"W1646201678","doi":"10.1007/978-3-642-30615-0_29","title":"The Density of Ternary Barker Sequences","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Aperiodic graph; Ternary operation; Autocorrelation; Sequence (biology); Computer science; Offset (computer science); Lattice (music); Arithmetic; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Statistics; Programming language; Physics","score_opus":0.014786015811448408,"score_gpt":0.22878428086090818,"score_spread":0.2139982650494598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646201678","genre_codex":"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.263297,0.014655977,0.3511783,0.00432453,0.0012146616,0.00008313048,0.0010692003,0.00057440717,0.36360273],"genre_scores_gemma":[0.922459,0.007808078,0.027800962,0.0005362323,0.0018234716,0.00019201139,0.0005021919,0.00020508138,0.038672924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993192,0.00018649166,0.000031676725,0.00008386772,0.00030401148,0.00007471987],"domain_scores_gemma":[0.99642545,0.0024399192,0.00024376165,0.00030506577,0.00040012092,0.00018573257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078096817,0.00043786145,0.000681973,0.0027402851,0.0009267168,0.0021651108,0.0008819948,0.001099153,0.01050789],"category_scores_gemma":[0.008448295,0.0005361905,0.00028722902,0.0022250663,0.0019833078,0.0035088614,0.0016497383,0.0014480368,0.0016638024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022798546,0.000006466373,0.00015229885,0.000051581694,0.0000036129034,0.000026087386,0.00008493709,0.0018001858,0.0007718473,0.9831186,0.0017343203,0.012227175],"study_design_scores_gemma":[0.00000771758,0.00001219378,0.00033937139,0.00004244965,0.000006619819,0.00022710774,0.00005163356,0.01087539,0.0009326952,0.98167,0.0058135004,0.000021226211],"about_ca_topic_score_codex":0.0005091611,"about_ca_topic_score_gemma":0.0002978988,"teacher_disagreement_score":0.01050789,"about_ca_system_score_codex":0.00089080154,"about_ca_system_score_gemma":0.00047245008,"threshold_uncertainty_score":0.035152376},"labels":[],"label_agreement":null},{"id":"W1667057730","doi":"10.3233/fi-2012-633","title":"Public-Key Cryptography Based on a Cubic Extension of the Lucas Functions","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Mount Royal University","funders":"","keywords":"Public-key cryptography; Key (lock); Key exchange; Cryptography; Extension (predicate logic); Computer science; Public key cryptosystem; Theoretical computer science; Computer security; Mathematics; Encryption; Programming language","score_opus":0.0386312350513452,"score_gpt":0.23051973436159862,"score_spread":0.19188849931025342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1667057730","genre_codex":"methods","genre_gemma":"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.07907886,0.00872155,0.5748799,0.004243547,0.0018995401,0.00034087256,0.0006877228,0.0012499854,0.32889798],"genre_scores_gemma":[0.8037981,0.0057848925,0.13247254,0.0006345622,0.0008275052,0.00026101607,0.00034078272,0.00024674332,0.055633865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.00010342867,0.000015791644,0.00005851471,0.00023037319,0.00007930611],"domain_scores_gemma":[0.99937326,0.00019369602,0.00007320653,0.0001367737,0.00016922121,0.000053936557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004958816,0.00046969633,0.0005085839,0.0011075923,0.0010416936,0.0013241633,0.0005646042,0.0006051055,0.0047553354],"category_scores_gemma":[0.0023275411,0.0002488308,0.00045052962,0.0015753869,0.0020431974,0.0018733026,0.0012845001,0.0020952686,0.0020262597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065423636,0.0000114132445,0.00006233408,0.000060614915,0.000003185027,0.000054921155,0.00007252905,0.0047546714,0.0016330106,0.97316724,0.003154881,0.016959852],"study_design_scores_gemma":[0.000056212968,0.00008342148,0.00020799089,0.000051852632,0.000008136123,0.00023836929,0.000039194056,0.041749433,0.002925324,0.8644271,0.09015358,0.00005935473],"about_ca_topic_score_codex":0.0022827033,"about_ca_topic_score_gemma":0.0019579132,"teacher_disagreement_score":0.0047553354,"about_ca_system_score_codex":0.0016333845,"about_ca_system_score_gemma":0.0017142083,"threshold_uncertainty_score":0.015908241},"labels":[],"label_agreement":null},{"id":"W167165370","doi":"","title":"New Linear Codes of Dimensions 5 and 6 over GF(8).","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; GF(2); Arithmetic; Discrete mathematics; Finite field","score_opus":0.013753463928825767,"score_gpt":0.22618413138596213,"score_spread":0.21243066745713637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167165370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.50423247,0.018683722,0.2280324,0.011586942,0.0073908716,0.00035609,0.0031202475,0.0033526777,0.22324471],"genre_scores_gemma":[0.7734008,0.004350634,0.14293852,0.002093954,0.001109701,0.000265263,0.0030079295,0.00030615556,0.07252709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991654,0.00012963718,0.00006728452,0.00011133171,0.00034298465,0.00018329328],"domain_scores_gemma":[0.99818015,0.00048832287,0.00031086348,0.00039835577,0.00034086904,0.00028147775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052842725,0.00039190854,0.0003704286,0.0012839816,0.0010176285,0.0017352443,0.0007142972,0.0009979041,0.00886121],"category_scores_gemma":[0.0026154858,0.0003505858,0.00058764854,0.0012132925,0.0011306739,0.002940179,0.001888973,0.0020606127,0.0021936574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007533816,0.00025928754,0.0014564486,0.00041043543,0.00006500984,0.0010809605,0.00071132823,0.006931755,0.02688297,0.75083864,0.03997924,0.17063053],"study_design_scores_gemma":[0.00034782797,0.00057514245,0.002766036,0.00043973478,0.00012069387,0.004841664,0.0004743516,0.04356513,0.046185754,0.6095221,0.29089263,0.00026899244],"about_ca_topic_score_codex":0.00051982515,"about_ca_topic_score_gemma":0.0015051349,"teacher_disagreement_score":0.00886121,"about_ca_system_score_codex":0.0009361209,"about_ca_system_score_gemma":0.0011140179,"threshold_uncertainty_score":0.029643714},"labels":[],"label_agreement":null},{"id":"W1688130520","doi":"10.1007/3-540-39568-7_21","title":"A Fast Pseudo Random Permutation Generator With Applications to Cryptology","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Permutation (music); Random permutation; Sequence (biology); Pseudorandom number generator; Cryptography; Random sequence; Generator (circuit theory); Random number generation; Computer science; Mathematics; Discrete mathematics; Algorithm; Combinatorics; Physics; Symmetric group","score_opus":0.015654088069899565,"score_gpt":0.25421091414589386,"score_spread":0.2385568260759943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1688130520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.0059341276,0.0008653653,0.9756377,0.00065616175,0.00055802264,0.00016882409,0.00014043337,0.0010443446,0.014995092],"genre_scores_gemma":[0.17483805,0.0018565449,0.76995337,0.00067192805,0.0015824871,0.00063132576,0.00046275678,0.00066752074,0.049336106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991111,0.0003284812,0.000041421612,0.000098655975,0.00036494515,0.000055385124],"domain_scores_gemma":[0.9983626,0.00088550616,0.00008151264,0.0004041781,0.00019555583,0.00007068183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010036688,0.0009784419,0.0008319411,0.0012504916,0.0008009768,0.0013365835,0.001013726,0.0014091226,0.008029779],"category_scores_gemma":[0.0033155885,0.0004444532,0.00067413657,0.0016478561,0.0013817449,0.0026036631,0.001968479,0.0017986197,0.0037221522],"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.00018353458,0.00006917679,0.00018730624,0.00013881159,0.000024138062,0.0003016832,0.00008947815,0.023101876,0.0076144896,0.7164926,0.013796122,0.23800075],"study_design_scores_gemma":[0.00012029435,0.00021462629,0.0001593079,0.000059836486,0.000037530124,0.001495831,0.000022787193,0.23717569,0.011570267,0.69051,0.058558274,0.00007562021],"about_ca_topic_score_codex":0.00016190602,"about_ca_topic_score_gemma":0.00025829044,"teacher_disagreement_score":0.008029779,"about_ca_system_score_codex":0.00048244488,"about_ca_system_score_gemma":0.0007804281,"threshold_uncertainty_score":0.026862323},"labels":[],"label_agreement":null},{"id":"W170607195","doi":"","title":"Aperiodic Perfect Maps from de Bruijn Sequences.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Aperiodic graph; De Bruijn sequence; Mathematics; Combinatorics","score_opus":0.013655785243458417,"score_gpt":0.21469496949299977,"score_spread":0.20103918424954134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170607195","genre_codex":"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.2460795,0.0077880365,0.25599232,0.003007437,0.0021458482,0.00019487375,0.0016919594,0.0009896605,0.48211032],"genre_scores_gemma":[0.87295645,0.0028020102,0.035520032,0.0006992637,0.00090636377,0.00013477149,0.0009061123,0.0003416266,0.08573332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991561,0.00018601063,0.00006231936,0.00015870098,0.00028422696,0.00015267788],"domain_scores_gemma":[0.9983157,0.0007962571,0.00025241767,0.0002861478,0.00018122436,0.00016825645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055722665,0.0006607692,0.00050196,0.002104183,0.0014667029,0.0028705865,0.00058299,0.0007956905,0.010726062],"category_scores_gemma":[0.0038863886,0.00049588253,0.00043702833,0.0013003281,0.0014626406,0.004300756,0.0024438784,0.0017395888,0.003210985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044349545,0.000018304869,0.00010802268,0.000055287146,0.000006956503,0.00015385085,0.00017908355,0.00084194285,0.0013628338,0.98248166,0.0025584823,0.012189329],"study_design_scores_gemma":[0.0000106028965,0.00001846959,0.0001207202,0.000038471102,0.0000063589446,0.00034886668,0.00007344506,0.001985989,0.0019071331,0.9711231,0.024350926,0.000015840043],"about_ca_topic_score_codex":0.00035832662,"about_ca_topic_score_gemma":0.00045853952,"teacher_disagreement_score":0.010726062,"about_ca_system_score_codex":0.00069984724,"about_ca_system_score_gemma":0.000612964,"threshold_uncertainty_score":0.035882235},"labels":[],"label_agreement":null},{"id":"W1714957475","doi":"10.1109/glocom.2001.965164","title":"A number theory based dual transmit antennas space-time code","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Coding gain; Space–time block code; Diversity gain; Constellation; Code (set theory); Block code; Diophantine approximation; Transmit diversity; Code rate; Space–time code; Constant-weight code; Computer science; Algebraic number theory; Mathematics; Coding (social sciences); Algebraic number; Algorithm; Discrete mathematics; Diophantine equation; Concatenated error correction code; Fading; Decoding methods; Physics; Statistics","score_opus":0.014672696548461312,"score_gpt":0.21193862730809934,"score_spread":0.19726593075963803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1714957475","genre_codex":"methods","genre_gemma":"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.10218725,0.00038393761,0.8672661,0.0004925674,0.00014713783,0.00007066817,0.00026876832,0.0004200034,0.028763566],"genre_scores_gemma":[0.72717494,0.00038006515,0.2601912,0.0002178195,0.00010579432,0.00010845748,0.00033725382,0.00006103568,0.011423489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00012154398,0.00002203184,0.00007290146,0.00027221226,0.000087460234],"domain_scores_gemma":[0.99914026,0.0002526165,0.0001327129,0.00016625461,0.00024344452,0.000064655425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030679363,0.00033021945,0.0003865908,0.00052445487,0.00041982037,0.00087765517,0.00053319684,0.00043782787,0.001816044],"category_scores_gemma":[0.001238746,0.00015398498,0.00025991394,0.0008793175,0.00086676155,0.0007085199,0.00092424505,0.0006678683,0.0007102729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003706142,0.000076935794,0.0009674103,0.00011674065,0.00002972451,0.00026649455,0.00016507295,0.21899462,0.044177976,0.6337131,0.0042218715,0.09689939],"study_design_scores_gemma":[0.00008644006,0.00022792237,0.000433512,0.000030683837,0.000026469113,0.00050434965,0.000028556275,0.8547849,0.027765835,0.09845034,0.017606536,0.00005440243],"about_ca_topic_score_codex":0.0010162033,"about_ca_topic_score_gemma":0.00095746503,"teacher_disagreement_score":0.001816044,"about_ca_system_score_codex":0.000740819,"about_ca_system_score_gemma":0.0008735966,"threshold_uncertainty_score":0.006075263},"labels":[],"label_agreement":null},{"id":"W1749437014","doi":"10.1007/s11425-013-4633-x","title":"Linear recurring sequences and subfield subcodes of cyclic codes","year":2013,"lang":"en","type":"article","venue":"Science China Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Finite field; Generator (circuit theory); TRACE (psycholinguistics); Sequence (biology); Discrete mathematics; Polynomial; Physics; Mathematical analysis","score_opus":0.012811184275334363,"score_gpt":0.24794942487591168,"score_spread":0.2351382406005773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749437014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.82860416,0.00082107086,0.10710618,0.0007823312,0.00020540108,0.00009656904,0.0004177645,0.00022835111,0.061738178],"genre_scores_gemma":[0.9522971,0.0006321655,0.017644688,0.00035907823,0.00030609316,0.0001109605,0.0004005181,0.00007644539,0.028172968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995183,0.00011525752,0.000029277913,0.00007812173,0.00014565319,0.00011346521],"domain_scores_gemma":[0.9985934,0.00056285434,0.000244606,0.00019548746,0.00024604582,0.00015752592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038192183,0.00039189175,0.0003736563,0.0014036982,0.0008737098,0.0011092902,0.000473661,0.00050584675,0.00424791],"category_scores_gemma":[0.0019424787,0.00023877108,0.00031575313,0.0013283335,0.0011675697,0.0010104207,0.00097079383,0.0010833766,0.0009528734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017716404,0.0000370898,0.00089699007,0.000039370065,0.000008671448,0.00025402856,0.0005175204,0.0021777453,0.008053609,0.9640147,0.0012908006,0.022532407],"study_design_scores_gemma":[0.000022615397,0.0000833442,0.0008521851,0.000022016427,0.000012430008,0.00041922502,0.00017081526,0.015308928,0.004847762,0.9724301,0.005806985,0.000023645016],"about_ca_topic_score_codex":0.0008180462,"about_ca_topic_score_gemma":0.00070144475,"teacher_disagreement_score":0.00424791,"about_ca_system_score_codex":0.00063156,"about_ca_system_score_gemma":0.0008553744,"threshold_uncertainty_score":0.014210641},"labels":[],"label_agreement":null},{"id":"W175177793","doi":"","title":"On the Structure of Optimal Linear Block Codes of Length a Multiple of 4 and d = 4.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Discrete mathematics","score_opus":0.009039251704525087,"score_gpt":0.22062445887223744,"score_spread":0.21158520716771237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175177793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7496208,0.0033814292,0.13138455,0.0045125103,0.00027332376,0.00015993873,0.002062635,0.000366197,0.10823861],"genre_scores_gemma":[0.94289494,0.0011120599,0.033775598,0.0007010708,0.00022324246,0.0001545621,0.0015337327,0.00015999793,0.019444898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996088,0.00011959961,0.000017912835,0.0000451367,0.0000983899,0.00011013588],"domain_scores_gemma":[0.9976342,0.0010555445,0.000517007,0.00030607588,0.0002795821,0.00020766002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003684386,0.00032766518,0.0005432741,0.0011206933,0.0009903787,0.0014067481,0.00068031735,0.00097425864,0.0047692386],"category_scores_gemma":[0.0034288578,0.00042707578,0.00028589246,0.0010379549,0.001239005,0.002209177,0.0012373963,0.0012891742,0.0010151907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036668332,0.00007643768,0.0008760979,0.00010708098,0.00001699888,0.00014817761,0.00023476437,0.0163042,0.004976683,0.9467988,0.0099674715,0.020126624],"study_design_scores_gemma":[0.00006179745,0.00008631133,0.0006873673,0.00004320424,0.000012949004,0.00013643413,0.000098253426,0.046026777,0.0018020809,0.94415367,0.006865117,0.000026100342],"about_ca_topic_score_codex":0.0008189849,"about_ca_topic_score_gemma":0.0014248495,"teacher_disagreement_score":0.0047692386,"about_ca_system_score_codex":0.0009080275,"about_ca_system_score_gemma":0.00094560697,"threshold_uncertainty_score":0.015954673},"labels":[],"label_agreement":null},{"id":"W1765342747","doi":"10.3968/j.sms.1923845220120201.015","title":"Image Encryption Using Novel Mappings over GF(2^n)","year":2011,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Encryption; Mathematics; Permutation (music); Image (mathematics); Transformation (genetics); Galois theory; Field (mathematics); Linear map; Pixel; Algorithm; Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence; Computer security","score_opus":0.22264554610467582,"score_gpt":0.36771581880290216,"score_spread":0.14507027269822634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765342747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.14964989,0.0012512116,0.83422434,0.00076335354,0.00029160496,0.00016462628,0.00007915234,0.0005586628,0.013017121],"genre_scores_gemma":[0.7930475,0.0011110541,0.19754076,0.00025854728,0.00024472954,0.00012849076,0.00012250856,0.00004178775,0.007504688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999764,0.000063428306,0.000018926436,0.00004535706,0.00007835466,0.0000299411],"domain_scores_gemma":[0.9996126,0.0001483518,0.000069120724,0.00009482426,0.000051879986,0.000023267843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030213658,0.00044179612,0.0002590881,0.00036704485,0.00027477514,0.0003868389,0.0002469384,0.00037890256,0.0010573112],"category_scores_gemma":[0.0008622187,0.00011930062,0.00041599333,0.00030124668,0.00062021305,0.0013741945,0.00056434463,0.0006046293,0.00035115678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054515334,0.00026418068,0.0016587935,0.0005261567,0.00009389991,0.0012487422,0.0007887535,0.031684387,0.32259706,0.33150432,0.0032790345,0.30580947],"study_design_scores_gemma":[0.000276145,0.0016526557,0.0033446483,0.00012336814,0.00012684887,0.010147822,0.00024189914,0.2637918,0.46354967,0.16697042,0.089601286,0.00017345899],"about_ca_topic_score_codex":0.00012297863,"about_ca_topic_score_gemma":0.00015155278,"teacher_disagreement_score":0.0010573112,"about_ca_system_score_codex":0.00027445127,"about_ca_system_score_gemma":0.00031226344,"threshold_uncertainty_score":0.0035369992},"labels":[],"label_agreement":null},{"id":"W1773531050","doi":"10.1142/s0219498814500819","title":"Repeated root constacyclic codes of length mp<sup>s</sup> over 𝔽<sub>p<sup>r</sup></sub> + u𝔽<sub>p<sup>r</sup></sub> + ⋯ + u<sup>e-1</sup>𝔽<sub>p<sup>r</sup></sub>","year":2014,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Physics; Duality (order theory); Mathematics","score_opus":0.009540668583239924,"score_gpt":0.2276470803804855,"score_spread":0.21810641179724558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773531050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7762646,0.001031467,0.12447413,0.00094790175,0.00031405417,0.00012380395,0.0005891122,0.00057692965,0.09567799],"genre_scores_gemma":[0.9523533,0.00036895552,0.025066458,0.0001943979,0.00014542452,0.000098243596,0.0003283164,0.00015805522,0.02128674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995844,0.0000669371,0.000029482686,0.000091811016,0.00012391218,0.00010348286],"domain_scores_gemma":[0.99858487,0.00049221644,0.00033813235,0.00022596915,0.00024813952,0.000110835776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003375275,0.00037888144,0.0004018237,0.0008788372,0.00083439075,0.0010741169,0.0006381545,0.0005666572,0.0059208195],"category_scores_gemma":[0.0022032629,0.00020269048,0.0003659633,0.00088917004,0.0012642094,0.001172139,0.0007821311,0.00092294044,0.0011079636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034447014,0.000076519835,0.001319392,0.00014345882,0.00002099897,0.0010543762,0.00067006197,0.008656511,0.023796905,0.9212722,0.0033177594,0.03932729],"study_design_scores_gemma":[0.00009537473,0.00042014217,0.0035443918,0.00015295792,0.00006133158,0.0022750988,0.00060640636,0.053462494,0.058104303,0.8526083,0.028547572,0.000121580575],"about_ca_topic_score_codex":0.0005438596,"about_ca_topic_score_gemma":0.0008175148,"teacher_disagreement_score":0.0059208195,"about_ca_system_score_codex":0.00080283644,"about_ca_system_score_gemma":0.0006777214,"threshold_uncertainty_score":0.01980716},"labels":[],"label_agreement":null},{"id":"W1786799192","doi":"10.1007/3-540-45325-3_28","title":"Generating Large Instances of the Gong-Harn Cryptosystem","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Computer science; Computer security; Cryptography","score_opus":0.01337517671546098,"score_gpt":0.2252701815759936,"score_spread":0.21189500486053262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1786799192","genre_codex":"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.6130458,0.00068653247,0.3064339,0.004825895,0.00023569471,0.00030560634,0.0011049772,0.0016675813,0.07169408],"genre_scores_gemma":[0.9380794,0.0002615291,0.054036368,0.00026681958,0.00012752147,0.00017326006,0.00073448056,0.00027495585,0.0060456553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816376,0.00063176546,0.00008123808,0.00024880364,0.0006274142,0.00024704053],"domain_scores_gemma":[0.99368405,0.004251003,0.00027826568,0.001363139,0.00020990195,0.00021361774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018563151,0.00060560455,0.0010244293,0.0007682325,0.0012151882,0.0024183253,0.0011820755,0.0015098145,0.005970706],"category_scores_gemma":[0.009687749,0.0005621382,0.00080055604,0.0012122004,0.0019415147,0.004477876,0.003035648,0.0031515502,0.0008726639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005653805,0.00022929804,0.001883229,0.00026035483,0.00008957151,0.00051968097,0.0005142769,0.09009004,0.0074124066,0.82589597,0.014867764,0.057672057],"study_design_scores_gemma":[0.00015439141,0.000045609777,0.00030693316,0.0000286906,0.000024806759,0.0002282876,0.00009470351,0.18748417,0.0038408493,0.80436105,0.0034084113,0.000022048232],"about_ca_topic_score_codex":0.0002798212,"about_ca_topic_score_gemma":0.0006451126,"teacher_disagreement_score":0.005970706,"about_ca_system_score_codex":0.001418362,"about_ca_system_score_gemma":0.0008502784,"threshold_uncertainty_score":0.019974053},"labels":[],"label_agreement":null},{"id":"W1796297130","doi":"10.1007/978-3-540-77224-8_36","title":"Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF(p,2)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"TRACE (psycholinguistics); Weight distribution; Mathematics; Galois theory; Binary number; Distribution (mathematics); Finite field; Construct (python library); Discrete mathematics; Field (mathematics); Arithmetic; Pure mathematics; Computer science; Mathematical analysis; Physics","score_opus":0.012430558016525216,"score_gpt":0.24924893176911564,"score_spread":0.23681837375259043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1796297130","genre_codex":"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.7675932,0.00060982816,0.20880581,0.0013187799,0.0001226126,0.00010683737,0.00072858983,0.0006072563,0.020107057],"genre_scores_gemma":[0.9826096,0.00035004408,0.00932012,0.00007501672,0.00013897405,0.00008706002,0.00048813352,0.00012840367,0.0068026544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874926,0.00034513883,0.00004623534,0.0001799256,0.00041490074,0.00026457416],"domain_scores_gemma":[0.99291223,0.003897295,0.0007012004,0.0010990624,0.00093867857,0.00045164354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00189071,0.000621846,0.00052936847,0.0021092822,0.00066903635,0.002383009,0.0012504697,0.0010623337,0.0044678836],"category_scores_gemma":[0.015387065,0.00042913933,0.00031556745,0.0019342878,0.0023717799,0.002945381,0.0013907526,0.0011422418,0.0007024181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010631367,0.00014157948,0.0056470465,0.00014525384,0.000040180883,0.0005734309,0.00071163155,0.038979765,0.022582533,0.880057,0.0032395911,0.04681879],"study_design_scores_gemma":[0.0001437304,0.00018615465,0.0036363571,0.00009451607,0.000020404192,0.0011480737,0.000263428,0.27927083,0.012254082,0.70042676,0.0024734347,0.00008223737],"about_ca_topic_score_codex":0.00043072825,"about_ca_topic_score_gemma":0.00033254054,"teacher_disagreement_score":0.0044678836,"about_ca_system_score_codex":0.0014081106,"about_ca_system_score_gemma":0.0010712546,"threshold_uncertainty_score":0.01494652},"labels":[],"label_agreement":null},{"id":"W180019437","doi":"10.1007/1-4020-7987-7_1","title":"Randomness and Discrepancy Transforms","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Construct (python library); Algorithm; Binary number; Property (philosophy); Nonlinear system; Computer science; Mathematics; Linear span; Theoretical computer science; Discrete mathematics; Arithmetic; Statistics","score_opus":0.010586050972330854,"score_gpt":0.2051184550469212,"score_spread":0.19453240407459033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180019437","genre_codex":"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.06930029,0.0032522387,0.8148305,0.0011443372,0.00058228057,0.0000674894,0.000116021656,0.00037169017,0.11033521],"genre_scores_gemma":[0.7039039,0.003257372,0.21720745,0.0008005649,0.0007807936,0.00016495118,0.00029378792,0.00036426273,0.07322696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999315,0.00016894094,0.000038484493,0.00013222317,0.0002963725,0.00004892248],"domain_scores_gemma":[0.9990909,0.00053921784,0.00005734899,0.00018519898,0.00008796543,0.0000392843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073786505,0.0003720348,0.00035904883,0.0006121542,0.00046417853,0.0012345003,0.0004252728,0.0006540496,0.003438099],"category_scores_gemma":[0.0023187888,0.00020690229,0.0003553178,0.00058547355,0.002107652,0.0026773035,0.0009972417,0.0018647291,0.0011461889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003472808,0.000010090028,0.000102731385,0.000035703037,0.0000030527547,0.00007445056,0.00010237909,0.0047154287,0.0050338935,0.960072,0.0007054416,0.029109953],"study_design_scores_gemma":[0.000018533092,0.00016290678,0.00021326933,0.00004419943,0.000006483146,0.00095075753,0.000064529115,0.039818283,0.0140560195,0.8944367,0.050194465,0.000033749162],"about_ca_topic_score_codex":0.00009186468,"about_ca_topic_score_gemma":0.00007226481,"teacher_disagreement_score":0.003438099,"about_ca_system_score_codex":0.00047026935,"about_ca_system_score_gemma":0.00038690402,"threshold_uncertainty_score":0.011501551},"labels":[],"label_agreement":null},{"id":"W1809690300","doi":"10.1007/s00145-001-0010-y","title":"Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Mathematics; Pseudorandom number generator; Block cipher; Hash function; Discrete mathematics; Random oracle; Key (lock); Decorrelation; Random function; Combinatorics; Random variable; Algorithm; Cryptography; Computer science; Encryption; Public-key cryptography; Statistics","score_opus":0.015516179908635358,"score_gpt":0.2484218251798251,"score_spread":0.23290564527118976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809690300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.10656305,0.0048887488,0.85015893,0.005913618,0.00033710542,0.00008893492,0.00046545354,0.00045434714,0.031129757],"genre_scores_gemma":[0.86740494,0.0029828532,0.112745926,0.0009041522,0.0013888737,0.000288707,0.00040921892,0.0001471927,0.013728146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943897,0.0028901882,0.00019972151,0.0006629093,0.0014398653,0.00041749777],"domain_scores_gemma":[0.95521116,0.035439007,0.0025309485,0.0042331163,0.0013692406,0.0012164732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058751726,0.0011239642,0.0015506536,0.0036709984,0.0018102214,0.004457425,0.0020351675,0.0022554917,0.0044814143],"category_scores_gemma":[0.03705792,0.0011567915,0.0012514956,0.0045811017,0.007968412,0.0102821365,0.0061184587,0.0056192954,0.0007322242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121899386,0.000021639207,0.0002844329,0.000045689387,0.000020561403,0.000044599168,0.00010555792,0.0041269013,0.00023894207,0.98422074,0.0009673034,0.009801797],"study_design_scores_gemma":[0.000023004013,0.000024376248,0.00015391591,0.000019319295,0.000011867861,0.00014223442,0.000035184683,0.02780909,0.00048859365,0.96964025,0.0016336732,0.000018457873],"about_ca_topic_score_codex":0.00029643517,"about_ca_topic_score_gemma":0.00026909533,"teacher_disagreement_score":0.0058751726,"about_ca_system_score_codex":0.001841522,"about_ca_system_score_gemma":0.0012774136,"threshold_uncertainty_score":0.031071246},"labels":[],"label_agreement":null},{"id":"W1824465360","doi":"10.1007/978-3-540-45238-6_16","title":"On Low Complexity Bit Parallel Polynomial Basis Multipliers","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Finite field; Polynomial basis; Mathematics; Irreducible polynomial; Verilog; Basis (linear algebra); Arithmetic; Polynomial; Finite field arithmetic; Discrete mathematics; Algebra over a field; Computer science; Field-programmable gate array; Pure mathematics; Matrix polynomial; Mathematical analysis; Computer hardware","score_opus":0.02197533117921908,"score_gpt":0.23651409616052138,"score_spread":0.2145387649813023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824465360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.046136234,0.0025715644,0.79201233,0.0019569476,0.001314301,0.00026278052,0.00049951894,0.0019228889,0.15332346],"genre_scores_gemma":[0.27932033,0.0034405682,0.55098915,0.0011975797,0.0010837881,0.00068231963,0.0010873915,0.0013265761,0.16087231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916255,0.00019497925,0.000040852334,0.00009008465,0.00041860525,0.000093030176],"domain_scores_gemma":[0.99902093,0.00049018895,0.000068454035,0.00026001048,0.00012043068,0.00003998917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007184586,0.0016662896,0.0007556147,0.0012814282,0.0010065045,0.0020240443,0.0012614531,0.00075557554,0.025400069],"category_scores_gemma":[0.0036515584,0.00067254255,0.000546284,0.0025193393,0.0010929367,0.004491066,0.002856647,0.0023602848,0.0070766434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005254284,0.00012165309,0.00029932708,0.00026702593,0.00003782456,0.0001266106,0.00011814299,0.02058754,0.011744282,0.6520695,0.025970004,0.28813273],"study_design_scores_gemma":[0.00012907051,0.000111129775,0.00023368397,0.00010290556,0.00004559357,0.00029984646,0.000051885487,0.08276483,0.011493101,0.8559548,0.048771646,0.000041376345],"about_ca_topic_score_codex":0.0005642895,"about_ca_topic_score_gemma":0.0016510362,"teacher_disagreement_score":0.025400069,"about_ca_system_score_codex":0.0010578245,"about_ca_system_score_gemma":0.0009070176,"threshold_uncertainty_score":0.084971726},"labels":[],"label_agreement":null},{"id":"W1829033653","doi":"10.22108/ijgt.2015.5813","title":"On group rings and some of their applications to combinatorics and symmetric cryptography","year":2015,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cryptography; Symmetric-key algorithm; Symmetric group; Combinatorics; Block cipher; Group (periodic table); Cryptanalysis; Representation theory of the symmetric group; Discrete mathematics; Encryption; Public-key cryptography; Computer science; Algorithm; Physics; Computer security","score_opus":0.17841363466608717,"score_gpt":0.4767955956942137,"score_spread":0.29838196102812653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829033653","genre_codex":"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.015417198,0.53669363,0.20543298,0.014872862,0.004016227,0.0001980092,0.0005363103,0.00033533367,0.2224974],"genre_scores_gemma":[0.11287041,0.7352501,0.07794624,0.005354225,0.026216693,0.0003030884,0.0005168536,0.00022050506,0.0413219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826366,0.00062189315,0.00012281825,0.00025188943,0.0005375225,0.00020224796],"domain_scores_gemma":[0.99774915,0.001514224,0.0002041543,0.0002298466,0.00019775919,0.00010488538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024216163,0.0020582264,0.0015408583,0.005601727,0.0022309697,0.0042524096,0.0015734237,0.0025790343,0.0077438983],"category_scores_gemma":[0.0034080741,0.0012021868,0.0017809268,0.013203332,0.0065057916,0.010144939,0.0027724272,0.0048289653,0.0025246416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025961275,0.0000918967,0.00038559723,0.0009928952,0.000031989,0.00028396997,0.0003682427,0.003771095,0.0010576237,0.9188953,0.014169551,0.059925865],"study_design_scores_gemma":[0.000010035454,0.000103289494,0.0007512202,0.0003524128,0.000020605146,0.0006637941,0.00013726269,0.0035556254,0.00045043023,0.8191298,0.17476647,0.000058987374],"about_ca_topic_score_codex":0.0015113545,"about_ca_topic_score_gemma":0.0014434528,"teacher_disagreement_score":0.0077438983,"about_ca_system_score_codex":0.0017023329,"about_ca_system_score_gemma":0.00078842253,"threshold_uncertainty_score":0.025905907},"labels":[],"label_agreement":null},{"id":"W1829145527","doi":"10.1109/ccece.2001.933651","title":"A new family of stream ciphers based on cascaded small s-boxes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Stream cipher; Computer science; Cascade; Block cipher; Stream cipher attack; Block size; RC4; Cryptography; Key schedule; S-box; Cipher; Arithmetic; Shift register; Parallel computing; Algorithm; Running key cipher; Transposition cipher; Theoretical computer science; Differential cryptanalysis; Encryption; Mathematics; Key (lock); Computer network; Operating system; Engineering; Telecommunications","score_opus":0.030319546314975142,"score_gpt":0.21202425837848124,"score_spread":0.1817047120635061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829145527","genre_codex":"methods","genre_gemma":"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.0773314,0.0015706479,0.905051,0.0004644343,0.00037392657,0.0004316521,0.0003193822,0.0014987191,0.012958908],"genre_scores_gemma":[0.575476,0.0026829476,0.39406544,0.0005646286,0.00030809952,0.0005338699,0.0006242203,0.0001937944,0.025550999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997342,0.000042545864,0.000024415847,0.00006058791,0.00010459751,0.00003357765],"domain_scores_gemma":[0.9996339,0.000082544255,0.00007566009,0.000087131084,0.00008655523,0.000034273817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003625149,0.00046402347,0.00049124286,0.00070647866,0.00041746738,0.0005563447,0.0005585076,0.00046885025,0.0021496753],"category_scores_gemma":[0.00076826295,0.00028150942,0.0007571937,0.00044292875,0.00069643673,0.0016668448,0.0004988113,0.0007742004,0.00085574493],"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.00091436325,0.00020172619,0.0021724715,0.00043701715,0.00013796175,0.0015196858,0.0002911548,0.07331522,0.24842462,0.4250525,0.010733807,0.23679945],"study_design_scores_gemma":[0.00035473323,0.001438148,0.0013106044,0.00009382985,0.00014519933,0.0036716396,0.000050832285,0.62105584,0.120035045,0.10196505,0.14975408,0.00012501421],"about_ca_topic_score_codex":0.00042240077,"about_ca_topic_score_gemma":0.0003969903,"teacher_disagreement_score":0.0021496753,"about_ca_system_score_codex":0.00037550982,"about_ca_system_score_gemma":0.00059748173,"threshold_uncertainty_score":0.00719136},"labels":[],"label_agreement":null},{"id":"W1829320485","doi":"10.1109/sips.2001.957334","title":"Efficient fault-tolerant arithmetic using a symmetrical modulus replication RNS","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Replication (statistics); Fault tolerance; Computer science; Modulus; Sample (material); Parallel computing; Arithmetic; Mathematics; Distributed computing; Physics; Statistics","score_opus":0.041599612315479435,"score_gpt":0.25311000752275215,"score_spread":0.21151039520727272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829320485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.28417122,0.0003718838,0.70427847,0.0005020845,0.00011803658,0.0001093157,0.000082299695,0.0013309576,0.009035738],"genre_scores_gemma":[0.9208876,0.00014566325,0.07649009,0.00009619741,0.000049889233,0.00004503735,0.000046492343,0.000050436698,0.0021886486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856704,0.00043913507,0.00011130133,0.00016312361,0.00054945174,0.00016993663],"domain_scores_gemma":[0.9963056,0.0009625001,0.0005613019,0.0018338987,0.00025989895,0.00007682612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016415603,0.0003410566,0.00058518903,0.00044031217,0.00043400243,0.00095673127,0.0011910537,0.00045752001,0.0023280536],"category_scores_gemma":[0.0048963963,0.00018772385,0.00032136578,0.00059693126,0.0010775339,0.0023032923,0.0012331794,0.0006081203,0.00064014125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016019819,0.000121046294,0.0013960946,0.0002556466,0.000065572225,0.00045944145,0.00041727448,0.120751075,0.17951992,0.5114486,0.003276239,0.18068707],"study_design_scores_gemma":[0.00018889215,0.00081161235,0.0005154565,0.00004522538,0.00007476178,0.0008446032,0.00011592922,0.67437774,0.20619456,0.106715776,0.010029624,0.00008570025],"about_ca_topic_score_codex":0.00028571836,"about_ca_topic_score_gemma":0.0003257062,"teacher_disagreement_score":0.0023280536,"about_ca_system_score_codex":0.00057148124,"about_ca_system_score_gemma":0.00061852945,"threshold_uncertainty_score":0.008681476},"labels":[],"label_agreement":null},{"id":"W183907894","doi":"10.1007/3-540-44987-6_25","title":"Hyper-bent Functions","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bent molecular geometry; Monomial; Affine transformation; Bijection; Class (philosophy); Bent function; Computer science; Boolean function; Affine variety; Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.017329643431957937,"score_gpt":0.226247697678485,"score_spread":0.20891805424652704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183907894","genre_codex":"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.055040523,0.0037947865,0.19099025,0.0016119285,0.0013125023,0.000056004177,0.00043146143,0.00063917227,0.7461235],"genre_scores_gemma":[0.40624472,0.0056968965,0.06680337,0.0010835122,0.0009683144,0.00012977129,0.00064882863,0.00085908954,0.5175655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997708,0.000039826726,0.000010972308,0.000036734426,0.00010674155,0.00003488682],"domain_scores_gemma":[0.9997589,0.000053163058,0.000020736483,0.00005819607,0.00006449254,0.00004448451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024862753,0.00075737445,0.0004493636,0.0016184364,0.0007229377,0.0017390663,0.00048322565,0.0005173913,0.019391075],"category_scores_gemma":[0.0007009175,0.00033829806,0.0003786859,0.0015848555,0.0010390264,0.0019247368,0.0011434217,0.0024018188,0.008142496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029200624,0.000015344709,0.00006325382,0.000054519776,0.000006305359,0.000036506663,0.000080466496,0.00052140007,0.0033266495,0.91796494,0.007985546,0.069915794],"study_design_scores_gemma":[0.000010118873,0.000037913673,0.0002672175,0.00004320143,0.000013074529,0.00040446807,0.000060408867,0.0035765497,0.0041391244,0.9054085,0.08601955,0.000020021062],"about_ca_topic_score_codex":0.00016914555,"about_ca_topic_score_gemma":0.00023148482,"teacher_disagreement_score":0.019391075,"about_ca_system_score_codex":0.00060231105,"about_ca_system_score_gemma":0.0002940808,"threshold_uncertainty_score":0.06486964},"labels":[],"label_agreement":null},{"id":"W184121975","doi":"","title":"Hamiltonian Circuits in Sparse Circulant Digraphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Electronic circuit; Hamiltonian (control theory); Combinatorics; Mathematical optimization; Electrical engineering; Engineering","score_opus":0.013120626392343388,"score_gpt":0.22291582229135112,"score_spread":0.20979519589900775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184121975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5122892,0.0033510777,0.25807524,0.003917205,0.00050687883,0.0002147344,0.0022122166,0.00069797976,0.21873546],"genre_scores_gemma":[0.9536738,0.0009217543,0.020112744,0.00058951246,0.00019001766,0.00009378332,0.0006367232,0.00006592473,0.02371582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996369,0.000108149085,0.000013791914,0.000058115762,0.00008864605,0.00009437115],"domain_scores_gemma":[0.9985531,0.0008330676,0.00018892852,0.00013455747,0.00012639537,0.00016396042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024766155,0.0003061917,0.00044299482,0.0010213358,0.0008493541,0.0016130389,0.0006319312,0.000891427,0.00859199],"category_scores_gemma":[0.002310231,0.00032498877,0.00028475432,0.00097057875,0.0009653967,0.0019070966,0.00081817055,0.001158094,0.0007943488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026579843,0.000022686037,0.00016478832,0.00006341147,0.000008522669,0.00009563411,0.00007692101,0.0030893495,0.0010702936,0.98110455,0.004508952,0.0097683165],"study_design_scores_gemma":[0.000022760645,0.000016814944,0.00023251219,0.000022296073,0.000009260324,0.00013785707,0.00005363506,0.01917335,0.0005635041,0.9745105,0.005247867,0.000009633732],"about_ca_topic_score_codex":0.0012968843,"about_ca_topic_score_gemma":0.00343537,"teacher_disagreement_score":0.00859199,"about_ca_system_score_codex":0.0010681623,"about_ca_system_score_gemma":0.0005329392,"threshold_uncertainty_score":0.028743029},"labels":[],"label_agreement":null},{"id":"W1857920410","doi":"10.1007/978-3-642-32512-0_29","title":"Spectral Norm of Symmetric Functions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Boolean function; Logarithm; Combinatorics; Norm (philosophy); Mathematics; Communication complexity; Discrete mathematics; Fourier transform; Parity (physics); Function (biology); Physics; Mathematical analysis; Quantum mechanics","score_opus":0.016332293128534237,"score_gpt":0.22401183056085874,"score_spread":0.2076795374323245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857920410","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061172724,0.010864364,0.3461713,0.00319135,0.002138471,0.00004082011,0.00048146647,0.0002567258,0.5756828],"genre_scores_gemma":[0.6737183,0.01523916,0.087808564,0.0011760767,0.0052623167,0.00023711623,0.0009063746,0.0005889141,0.21506318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952066,0.0001330164,0.000024131117,0.00007439588,0.00020527124,0.00004248723],"domain_scores_gemma":[0.99949324,0.00017313984,0.00004949506,0.00006852639,0.00015223816,0.000063334315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066072727,0.0007174104,0.0005113885,0.0016380722,0.0006561602,0.0024220243,0.000741004,0.000702165,0.0063704033],"category_scores_gemma":[0.0014254235,0.00024765634,0.0003672577,0.0011729538,0.0020536508,0.0027077931,0.0011243487,0.0022700538,0.0018992824],"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.00000639922,0.0000049856476,0.000017031321,0.00001739578,0.0000019391919,0.000005272054,0.0000316848,0.00033142883,0.000426749,0.98966545,0.0016825601,0.0078090625],"study_design_scores_gemma":[0.0000020687262,0.000007351939,0.000056902234,0.000009757299,0.000001624736,0.00003634893,0.000019576584,0.0019839648,0.000311036,0.9882712,0.009294967,0.00000518717],"about_ca_topic_score_codex":0.0002754458,"about_ca_topic_score_gemma":0.00023765817,"teacher_disagreement_score":0.0063704033,"about_ca_system_score_codex":0.0008310984,"about_ca_system_score_gemma":0.0005263479,"threshold_uncertainty_score":0.021311104},"labels":[],"label_agreement":null},{"id":"W1867085471","doi":"10.4153/cmb-2015-050-8","title":"Local Heuristics and an Exact Formula for Abelian Surfaces Over Finite Fields","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Simons Foundation","keywords":"Mathematics; Quartic function; Abelian group; Polynomial; Pure mathematics; Symplectic geometry; Finite field; Product (mathematics); Prime (order theory); Class (philosophy); Algebra over a field; Discrete mathematics; Combinatorics; Mathematical analysis; Geometry","score_opus":0.025712254963116802,"score_gpt":0.25366647337671167,"score_spread":0.22795421841359487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867085471","genre_codex":"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.8252168,0.00036063613,0.15100077,0.0005227568,0.000038545266,0.00003526694,0.00012909662,0.0003608821,0.022335203],"genre_scores_gemma":[0.9832949,0.00007500127,0.013178231,0.000041948864,0.000029047707,0.000015815649,0.00007303659,0.000039609306,0.0032523733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994043,0.000100507015,0.000030456335,0.00012368445,0.00021843298,0.00012265373],"domain_scores_gemma":[0.99866176,0.0005814219,0.00017730937,0.00023075622,0.0001876724,0.00016122799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009704803,0.000288147,0.00055896456,0.0021694761,0.0008432688,0.0020493143,0.0008689368,0.00051025744,0.005322172],"category_scores_gemma":[0.0044655325,0.00020030793,0.0003776284,0.0012217409,0.0025669192,0.0044133347,0.0016208157,0.0010094191,0.00043896478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007003323,0.000030327932,0.0034407454,0.000040265095,0.000007565378,0.00022241153,0.00043058197,0.0036974302,0.0021693308,0.974984,0.0005899111,0.01431736],"study_design_scores_gemma":[0.000020862817,0.00006718953,0.0017205632,0.000025389043,0.000019022407,0.0004382081,0.00033347023,0.05139033,0.004637962,0.93719494,0.004121182,0.000031007992],"about_ca_topic_score_codex":0.0008745873,"about_ca_topic_score_gemma":0.0008649226,"teacher_disagreement_score":0.005322172,"about_ca_system_score_codex":0.0015051845,"about_ca_system_score_gemma":0.0004402089,"threshold_uncertainty_score":0.017804384},"labels":[],"label_agreement":null},{"id":"W1889319641","doi":"10.1109/pacrim.2001.953712","title":"A high-speed baseband transceiver for wireless communications using QAM","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Baseband; Transceiver; Quadrature amplitude modulation; Wireless; Computer science; QAM; Electronic engineering; Electrical engineering; Telecommunications; Bandwidth (computing); Engineering; Bit error rate; Channel (broadcasting)","score_opus":0.06796149294477334,"score_gpt":0.26414185266375256,"score_spread":0.19618035971897924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889319641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.09740009,0.0009297252,0.88838077,0.0006213207,0.0005360644,0.00038723316,0.0001598309,0.0014630174,0.010122005],"genre_scores_gemma":[0.41705176,0.0008459015,0.5666588,0.0004857418,0.00026368845,0.0003484678,0.00018906734,0.00007896531,0.014077631],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986756,0.000023245071,0.000006906358,0.00002094521,0.00006409943,0.00001714102],"domain_scores_gemma":[0.99969804,0.000063233216,0.00004342388,0.000030776697,0.0001370511,0.000027500553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033635023,0.00030655068,0.00034231727,0.00036734118,0.0005219628,0.00038638595,0.00046859734,0.0006061777,0.002869361],"category_scores_gemma":[0.0006311791,0.0002058723,0.00018032538,0.00037585417,0.00028978678,0.0004871912,0.00026691446,0.000638323,0.0015799234],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015662803,0.000074807154,0.0007972279,0.00020886793,0.000031860174,0.00055769924,0.0002159701,0.0034807571,0.8740966,0.023341514,0.0033519284,0.09368609],"study_design_scores_gemma":[0.00023432025,0.0030639786,0.0026813208,0.00020227309,0.00019348234,0.005860426,0.000113479,0.08191838,0.7535113,0.0072875363,0.14480494,0.00012855632],"about_ca_topic_score_codex":0.00013001199,"about_ca_topic_score_gemma":0.00020258961,"teacher_disagreement_score":0.002869361,"about_ca_system_score_codex":0.00028534024,"about_ca_system_score_gemma":0.000380099,"threshold_uncertainty_score":0.00959897},"labels":[],"label_agreement":null},{"id":"W1898554878","doi":"10.1109/acssc.1988.754650","title":"RAM-JET: Towards The Removal Of Multiplicative Compleidty In Digital Signal Processingvlst Arclutectures","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Overhead (engineering); Adder; Digital signal processing; Pipeline (software); Very-large-scale integration; Parallel computing; Multiplication (music); Systolic array; Dot product; Binary number; Throughput; Computer hardware; Algorithm; Arithmetic; Embedded system; Mathematics; Latency (audio)","score_opus":0.021511491139839346,"score_gpt":0.2517597325450082,"score_spread":0.23024824140516886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898554878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04230162,0.0013630865,0.94355565,0.00033198204,0.00017304631,0.00006142491,0.000059860035,0.0019934145,0.010159954],"genre_scores_gemma":[0.26930627,0.0012745872,0.7106102,0.0005038819,0.00030712073,0.00015544037,0.00028707916,0.0003674184,0.017187987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973196,0.00005950482,0.000015214191,0.00005286435,0.00011165956,0.000028682676],"domain_scores_gemma":[0.99956733,0.00017072656,0.000033650835,0.00013818884,0.000065146436,0.000024910965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189686,0.000360834,0.00038517304,0.00045528964,0.00031350317,0.0006915244,0.0010102205,0.0003141111,0.0037570305],"category_scores_gemma":[0.0013596766,0.00020987028,0.0002728686,0.00048545972,0.000908475,0.0013352367,0.00077378924,0.0007846136,0.0015256222],"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.00040168947,0.00012013603,0.0006837417,0.00034996372,0.000039639937,0.00031992997,0.00024508426,0.018400095,0.11134459,0.27419457,0.006425325,0.58747524],"study_design_scores_gemma":[0.00018828663,0.0013531643,0.0009013227,0.00015877355,0.00007648985,0.00123706,0.00013534735,0.4589263,0.23157026,0.16831164,0.13706031,0.00008099891],"about_ca_topic_score_codex":0.00038877406,"about_ca_topic_score_gemma":0.0007398757,"teacher_disagreement_score":0.0037570305,"about_ca_system_score_codex":0.0002493119,"about_ca_system_score_gemma":0.0005693986,"threshold_uncertainty_score":0.012568533},"labels":[],"label_agreement":null},{"id":"W1901358321","doi":"10.3968/3904","title":"The Dual Space χ2 of Double Sequences","year":2013,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dual (grammatical number); Space (punctuation); Mathematics; Computer science; Linguistics; Philosophy","score_opus":0.07864559716688914,"score_gpt":0.34565065049331106,"score_spread":0.26700505332642194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901358321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7057228,0.0018609007,0.12903923,0.0034005293,0.00073371123,0.000043758766,0.0006018288,0.00021411249,0.15838313],"genre_scores_gemma":[0.9615948,0.00058359775,0.008517729,0.0005100945,0.00053249113,0.000045847533,0.000358271,0.00008534218,0.027771857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994547,0.00015411476,0.000020753672,0.00011458988,0.000130549,0.00012530744],"domain_scores_gemma":[0.99902153,0.0002596367,0.00016981612,0.00009510553,0.00015324909,0.00030056495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058254146,0.0006528028,0.00049492583,0.0028379748,0.001337473,0.0033570935,0.0005536323,0.00086617784,0.006931147],"category_scores_gemma":[0.0019369988,0.00027516656,0.00038288021,0.0011839309,0.0027174463,0.0041773478,0.0019044054,0.002010345,0.00076310977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067116554,0.000012142875,0.00015509399,0.000014797572,0.0000030792573,0.000044555643,0.000087067085,0.00036601225,0.0006293924,0.9947577,0.0005628332,0.0033001306],"study_design_scores_gemma":[0.000016605554,0.000027528025,0.0001816292,0.000014352844,0.0000033802087,0.00015498129,0.00009481925,0.0029296419,0.0006430774,0.99154186,0.0043786247,0.000013470652],"about_ca_topic_score_codex":0.00043703892,"about_ca_topic_score_gemma":0.00019184571,"teacher_disagreement_score":0.006931147,"about_ca_system_score_codex":0.00093013706,"about_ca_system_score_gemma":0.00051441794,"threshold_uncertainty_score":0.023187041},"labels":[],"label_agreement":null},{"id":"W1913698319","doi":"10.1109/icc.1988.13653","title":"Minimal complexity design of analytically described trellis codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Trellis (graph); Convolutional code; Space–time trellis code; Encoder; Algorithm; Computer science; Trellis modulation; Discrete mathematics; Mathematics; Block code; Theoretical computer science; Decoding methods; Linear code; Fading","score_opus":0.07646655268665453,"score_gpt":0.25999145298922127,"score_spread":0.18352490030256674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913698319","genre_codex":"methods","genre_gemma":"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.028837726,0.00025446617,0.962184,0.0001489532,0.000026965701,0.000114932416,0.00013046523,0.00038691045,0.007915603],"genre_scores_gemma":[0.47846946,0.00039238323,0.51551527,0.00014243268,0.000051256302,0.00042296576,0.00040031123,0.00018411533,0.0044217417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780554,0.0007522817,0.00018531419,0.0002091028,0.00080218667,0.00024558313],"domain_scores_gemma":[0.9965062,0.0018086509,0.0004690073,0.00035052968,0.00078140566,0.00008421036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011861953,0.00056735193,0.00057370384,0.000840042,0.00047788504,0.0010784037,0.00077148876,0.0006873882,0.0018850968],"category_scores_gemma":[0.006724505,0.00046477915,0.00048585067,0.0004967992,0.00091051875,0.0009278666,0.0007501806,0.0009165023,0.0006479334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036506908,0.000065840686,0.0007042024,0.00027766847,0.00004253914,0.00022510771,0.00029787945,0.31606713,0.07644853,0.487221,0.0026772143,0.11560778],"study_design_scores_gemma":[0.00013952436,0.00031956885,0.00026377672,0.00009033336,0.00003378777,0.00035597375,0.000057773887,0.75106144,0.09183424,0.14429866,0.011477569,0.00006744564],"about_ca_topic_score_codex":0.00073666126,"about_ca_topic_score_gemma":0.0009983806,"teacher_disagreement_score":0.0018850968,"about_ca_system_score_codex":0.0013850735,"about_ca_system_score_gemma":0.001558435,"threshold_uncertainty_score":0.010049462},"labels":[],"label_agreement":null},{"id":"W191626242","doi":"","title":"Some nonexistence results for 7-dimensional ternary linear codes.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ternary operation; Computer science; Programming language","score_opus":0.020473297060375723,"score_gpt":0.2560432509599951,"score_spread":0.23556995389961935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191626242","genre_codex":"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.21223524,0.022964658,0.28647047,0.018950261,0.0026373188,0.00027540931,0.0023868207,0.00094572647,0.45313412],"genre_scores_gemma":[0.84221,0.014850026,0.07270292,0.004923443,0.0033204476,0.0010023891,0.002513088,0.00043320513,0.05804452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654275,0.0007605769,0.00034784243,0.0005485092,0.0012678562,0.0005325246],"domain_scores_gemma":[0.9697276,0.024589201,0.0010566023,0.0015342218,0.0021837936,0.0009085925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045126406,0.0013920703,0.0017345268,0.003712383,0.0051629627,0.0060459855,0.0026496903,0.0028320435,0.016043805],"category_scores_gemma":[0.02487423,0.0014696738,0.0020078227,0.0034385598,0.0042517376,0.01318161,0.006993258,0.008177191,0.0052013528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017328832,0.00007600007,0.00074864377,0.00056927424,0.000055817858,0.0005473986,0.0005245511,0.0021073024,0.0024506992,0.96726394,0.010737024,0.01474622],"study_design_scores_gemma":[0.000036772995,0.00005186076,0.0003980239,0.00015382784,0.000059329905,0.0008736182,0.00022676597,0.0061267326,0.003211181,0.9738809,0.014923519,0.000057495028],"about_ca_topic_score_codex":0.00052002433,"about_ca_topic_score_gemma":0.0005282885,"teacher_disagreement_score":0.016043805,"about_ca_system_score_codex":0.0021673588,"about_ca_system_score_gemma":0.001362232,"threshold_uncertainty_score":0.053671896},"labels":[],"label_agreement":null},{"id":"W191763761","doi":"10.1007/s11856-000-1270-1","title":"On the statistical properties of Diffie-Hellman distributions","year":2000,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Multiplicative function; Combinatorics; Order (exchange); Distribution (mathematics); Exponential function; Upper and lower bounds; Prime power; Prime (order theory); Discrete mathematics; Function (biology); Prime number theorem; Prime number; Mathematical analysis","score_opus":0.023956393014792098,"score_gpt":0.2305802921217088,"score_spread":0.2066238991069167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191763761","genre_codex":"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.4386793,0.006762958,0.49101332,0.012730832,0.00070148346,0.00014657465,0.0010200606,0.00024766964,0.04869787],"genre_scores_gemma":[0.97238255,0.003797219,0.017639823,0.00072886684,0.0013086719,0.00015668893,0.00046356287,0.000111944,0.0034107347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954204,0.0021738554,0.00024956363,0.0005215194,0.0011938842,0.0004408189],"domain_scores_gemma":[0.8811418,0.09668958,0.0072664833,0.007448926,0.0050536874,0.0023995673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013378591,0.00088187074,0.0016863268,0.004648429,0.0020256494,0.005001364,0.002720755,0.0019959803,0.003306562],"category_scores_gemma":[0.06799958,0.0012365968,0.0009769263,0.003821696,0.008345552,0.014526642,0.003497002,0.0057200408,0.00047120155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005901508,0.000028740951,0.001023829,0.00004073903,0.000017853885,0.000068447596,0.00016678248,0.00479341,0.00040988205,0.98824614,0.0010358581,0.0041092513],"study_design_scores_gemma":[0.000018749364,0.000025163417,0.0006484877,0.000033403896,0.000011547369,0.00011950423,0.00006661493,0.04150245,0.0003267062,0.9562738,0.0009423943,0.000031081177],"about_ca_topic_score_codex":0.0009550096,"about_ca_topic_score_gemma":0.0005086622,"teacher_disagreement_score":0.013378591,"about_ca_system_score_codex":0.0029793452,"about_ca_system_score_gemma":0.0021147947,"threshold_uncertainty_score":0.070753574},"labels":[],"label_agreement":null},{"id":"W1917709139","doi":"10.48550/arxiv.1409.6961","title":"On the number of $N$-free elements with prescribed trace","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"TRACE (psycholinguistics); Mersenne prime; Combinatorics; Zero (linguistics); Mathematics; Order (exchange); Multiplicative function; Finite field; Integer (computer science); Prime (order theory); Discrete mathematics; Mathematical analysis","score_opus":0.04167147445291828,"score_gpt":0.17789897464457327,"score_spread":0.136227500191655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917709139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8514621,0.00069841987,0.1213283,0.0008567454,0.00016570702,0.00006909725,0.00022127871,0.00030517043,0.024893068],"genre_scores_gemma":[0.9720837,0.00032477773,0.020087464,0.00010725825,0.00012528728,0.000085958454,0.00013296516,0.00008103338,0.0069716447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896455,0.00020936865,0.00007439363,0.00023713514,0.00032176368,0.00019273363],"domain_scores_gemma":[0.99613166,0.0023226256,0.00038635117,0.00049939036,0.0002892698,0.0003706966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014050932,0.00047732575,0.000729779,0.0012389572,0.0012383307,0.0015842355,0.0014545753,0.00083541346,0.0040718894],"category_scores_gemma":[0.0057326755,0.00030331995,0.00057567353,0.0006258338,0.003266083,0.003227581,0.0019086411,0.0010385638,0.00052375544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051614264,0.00008756288,0.0060617244,0.00021860983,0.000043476102,0.00041003615,0.0005822778,0.009249614,0.019264976,0.9240833,0.0013007331,0.03818164],"study_design_scores_gemma":[0.00013098116,0.0002695961,0.00318604,0.000105019724,0.000064357075,0.0013246352,0.00025272716,0.069185056,0.03835275,0.8766949,0.010326783,0.00010710903],"about_ca_topic_score_codex":0.0003767704,"about_ca_topic_score_gemma":0.00040899566,"teacher_disagreement_score":0.0040718894,"about_ca_system_score_codex":0.0011036247,"about_ca_system_score_gemma":0.001121997,"threshold_uncertainty_score":0.013621807},"labels":[],"label_agreement":null},{"id":"W1941622581","doi":"10.1007/978-3-642-30615-0_1","title":"Odd Perfect Sequences and Sets of Spreading Sequences with Zero or Low Odd Periodic Correlation Zone","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interleaving; Generalization; Periodic sequence; Sequence (biology); Mathematics; Zero (linguistics); Correlation; Property (philosophy); Periodic function; Combinatorics; Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.01571456617777861,"score_gpt":0.23252073574837176,"score_spread":0.21680616957059315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941622581","genre_codex":"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.64788365,0.002561961,0.21343361,0.00043826352,0.00026479314,0.00009524334,0.0009642363,0.0002624753,0.13409582],"genre_scores_gemma":[0.9351076,0.0011773275,0.037097752,0.00016006189,0.00021630734,0.00016972006,0.0007989505,0.000099090066,0.025173154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956197,0.000086096225,0.000032867752,0.00008668679,0.0001611053,0.0000712854],"domain_scores_gemma":[0.9988158,0.0005410567,0.00016116307,0.0002328552,0.00012676003,0.0001223506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043515014,0.0005745372,0.0006004697,0.0016805945,0.001021046,0.0021838092,0.0008524789,0.0005465997,0.0026849792],"category_scores_gemma":[0.0020682013,0.0003795408,0.00048810296,0.0009929186,0.0020450533,0.0014776784,0.0014463189,0.0008046293,0.00040189366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105641884,0.000013323809,0.0004619289,0.00006931117,0.000012575427,0.00012991064,0.00017685056,0.0035172396,0.003993514,0.9813805,0.0006225193,0.009516719],"study_design_scores_gemma":[0.000021665926,0.000054763666,0.0009895177,0.000048406073,0.000019803543,0.00044178785,0.00012948678,0.019796688,0.004793571,0.9671458,0.0065288064,0.000029670826],"about_ca_topic_score_codex":0.0004112394,"about_ca_topic_score_gemma":0.00030671377,"teacher_disagreement_score":0.0026849792,"about_ca_system_score_codex":0.0006575465,"about_ca_system_score_gemma":0.00050704804,"threshold_uncertainty_score":0.008982182},"labels":[],"label_agreement":null},{"id":"W195192778","doi":"","title":"Equivalence Classes of Subsets of a Finite Field.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Equivalence (formal languages); Finite field; Pure mathematics; Discrete mathematics","score_opus":0.02134140187472002,"score_gpt":0.23663842764748919,"score_spread":0.21529702577276916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195192778","genre_codex":"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.40971133,0.0023926827,0.15618293,0.0055429717,0.0008848053,0.00023825771,0.0032166727,0.0007161122,0.42111424],"genre_scores_gemma":[0.94920075,0.0008902091,0.013637812,0.0003977197,0.0007690145,0.00016251649,0.0024781635,0.00011256309,0.032351334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975076,0.0007478588,0.00019754922,0.0004909833,0.0005716508,0.00048438515],"domain_scores_gemma":[0.9955723,0.0022337327,0.00044544594,0.00075163454,0.00041437178,0.0005825523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015040317,0.0005385358,0.0007669305,0.0036677383,0.0025186662,0.0046022465,0.0010672001,0.0011228514,0.017627222],"category_scores_gemma":[0.005494236,0.00039333777,0.0009547703,0.001963337,0.0037455345,0.010988223,0.0027755084,0.0027300138,0.0021463875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007196859,0.000042385163,0.00045604166,0.000028333465,0.00000898129,0.00009240077,0.00028690358,0.00017285997,0.00053190393,0.98600185,0.0023212624,0.009985105],"study_design_scores_gemma":[0.000021075626,0.000019056955,0.0005897417,0.000033310265,0.000009884658,0.00019674315,0.00017714156,0.0008667057,0.0007196153,0.9845883,0.012769715,0.000008841084],"about_ca_topic_score_codex":0.0005677942,"about_ca_topic_score_gemma":0.00041351453,"teacher_disagreement_score":0.017627222,"about_ca_system_score_codex":0.0014854055,"about_ca_system_score_gemma":0.00064596627,"threshold_uncertainty_score":0.0589689},"labels":[],"label_agreement":null},{"id":"W195230590","doi":"","title":"Some Nonbinary Power Residue Codes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Residue (chemistry); Biology","score_opus":0.007390091069230929,"score_gpt":0.2177016479665731,"score_spread":0.21031155689734216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195230590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4401048,0.00633067,0.1928265,0.0056050806,0.0012483079,0.00015892058,0.0010174516,0.00046386325,0.35224435],"genre_scores_gemma":[0.88999283,0.002184445,0.02824946,0.0007755021,0.0008951361,0.00011484861,0.00055559224,0.0001532813,0.07707896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991949,0.00017364933,0.00003942599,0.0001232748,0.0003062558,0.0001624982],"domain_scores_gemma":[0.99742967,0.0012526775,0.00032933528,0.00037387718,0.0003392065,0.00027518225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000867692,0.0005736202,0.00058739656,0.0019078545,0.0013963259,0.0021758387,0.00065897463,0.0010195067,0.011536831],"category_scores_gemma":[0.0048842444,0.00028930508,0.00048616892,0.0015264023,0.0016252626,0.0038031533,0.001627088,0.0024596446,0.0025466513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047074856,0.000022280909,0.00013609199,0.000033515556,0.000004610352,0.00013921267,0.00010408774,0.00059800927,0.00066121796,0.9862428,0.0023663559,0.009644682],"study_design_scores_gemma":[0.00001520276,0.00001929717,0.00018065839,0.000019390736,0.0000042940974,0.0002589345,0.000034766454,0.0046105734,0.0005168943,0.987523,0.006806689,0.000010274779],"about_ca_topic_score_codex":0.0004866338,"about_ca_topic_score_gemma":0.0005856189,"teacher_disagreement_score":0.011536831,"about_ca_system_score_codex":0.0011521555,"about_ca_system_score_gemma":0.0007687082,"threshold_uncertainty_score":0.038594544},"labels":[],"label_agreement":null},{"id":"W1952935518","doi":"10.1109/ccece.2000.849714","title":"A comparison of binary quasi-cyclic decoder implementations","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Decoding methods; Computer science; Binary number; Implementation; Software implementation; Binary code; Parallel computing; Algorithm; Software; Theoretical computer science; Arithmetic; Mathematics; Programming language","score_opus":0.0691039774980396,"score_gpt":0.34691746281167474,"score_spread":0.27781348531363514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952935518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.35985145,0.0035461737,0.59153235,0.00071303465,0.00055405457,0.0004667031,0.00068228616,0.0059108594,0.03674302],"genre_scores_gemma":[0.5772298,0.0019431914,0.40814254,0.00029399476,0.00008618827,0.00020214464,0.0009980376,0.00031432783,0.010789759],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990557,0.00020699903,0.000079908204,0.00007581851,0.0005025524,0.00007900346],"domain_scores_gemma":[0.9972765,0.0011129597,0.00012862266,0.00034625453,0.0010735937,0.00006200502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137038,0.00046879277,0.0004436401,0.0011745375,0.00039544847,0.0010236045,0.0010657117,0.0006518352,0.004429074],"category_scores_gemma":[0.0044864635,0.0002408639,0.00027976625,0.0011355722,0.0003098132,0.0009311718,0.0003051938,0.00040363023,0.00091535127],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019435333,0.00028233833,0.004041021,0.00085275836,0.000176623,0.00015291541,0.00022807308,0.08208698,0.06115691,0.07950538,0.005837563,0.7637359],"study_design_scores_gemma":[0.0007263037,0.002194529,0.0054831817,0.00022744444,0.00024521205,0.0016523394,0.00020756527,0.6745957,0.23482172,0.019503659,0.06017292,0.0001693856],"about_ca_topic_score_codex":0.0017461327,"about_ca_topic_score_gemma":0.0033802844,"teacher_disagreement_score":0.004429074,"about_ca_system_score_codex":0.0010143415,"about_ca_system_score_gemma":0.0015047623,"threshold_uncertainty_score":0.014816701},"labels":[],"label_agreement":null},{"id":"W1954084529","doi":"10.1109/isit.2015.7282495","title":"A modified KZ reduction algorithm","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reduction (mathematics); Computer science; Matrix (chemical analysis); Algorithm; Cryptography; Zhàng; Basis (linear algebra); Mathematics; Materials science","score_opus":0.038154335452357725,"score_gpt":0.24811471898646761,"score_spread":0.2099603835341099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954084529","genre_codex":"methods","genre_gemma":"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.0100117335,0.00033741363,0.97351843,0.0002770234,0.00024390596,0.000104710736,0.00018821511,0.0014174167,0.013901088],"genre_scores_gemma":[0.13579701,0.00044668766,0.8369123,0.00038271144,0.00019057743,0.00023721748,0.00081597466,0.0008927079,0.024324795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914694,0.00014306574,0.000044540757,0.00014156819,0.00041721974,0.00010663303],"domain_scores_gemma":[0.99956995,0.0000928889,0.000021983384,0.00011466968,0.00017859305,0.000021891727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004248759,0.0006951291,0.0008929031,0.0013724674,0.0009104324,0.0011897553,0.0011654333,0.00090133207,0.010845619],"category_scores_gemma":[0.0017033118,0.00030046652,0.00085751,0.00093756337,0.0008435996,0.0014534703,0.0016165591,0.0012987314,0.007273192],"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.000327393,0.0001119178,0.0005376918,0.00022837872,0.00006356507,0.00022549382,0.00019728334,0.049921237,0.031886406,0.28204378,0.019535176,0.6149217],"study_design_scores_gemma":[0.00017511148,0.00018250331,0.0007639599,0.0000743854,0.00006558575,0.0008566252,0.00011350969,0.577798,0.041636944,0.27530092,0.10288564,0.00014678796],"about_ca_topic_score_codex":0.0011259243,"about_ca_topic_score_gemma":0.0012049513,"teacher_disagreement_score":0.010845619,"about_ca_system_score_codex":0.0005804866,"about_ca_system_score_gemma":0.0011449514,"threshold_uncertainty_score":0.03628224},"labels":[],"label_agreement":null},{"id":"W1957179350","doi":"10.1109/ismvl.1993.289552","title":"Current-mode CMOS Galois field circuits","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Electronic circuit; Galois theory; CMOS; Field (mathematics); Computer science; Class (philosophy); Mode (computer interface); Mathematics; Electronic engineering; Electrical engineering; Discrete mathematics; Pure mathematics; Engineering; Artificial intelligence","score_opus":0.025878167016577216,"score_gpt":0.2523016721746787,"score_spread":0.22642350515810147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957179350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.07551717,0.002179753,0.7776836,0.00092419644,0.00038818925,0.00021047195,0.00049694546,0.0029973537,0.13960235],"genre_scores_gemma":[0.8162937,0.001839482,0.15350354,0.0005096984,0.00020325191,0.000118833115,0.0003098057,0.00012640904,0.02709537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996499,0.000054144417,0.000020740115,0.00006895139,0.00014827105,0.000058022488],"domain_scores_gemma":[0.999736,0.000075813005,0.00003414277,0.00004870567,0.00008605917,0.000019363248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000281958,0.0004213041,0.000193472,0.000623407,0.00038870052,0.0013607959,0.00076473603,0.00051374955,0.008548548],"category_scores_gemma":[0.0007922816,0.00015734232,0.0002678429,0.0004990463,0.0005140635,0.0015639956,0.00052630773,0.0005593984,0.0019708597],"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.00018461849,0.000058643524,0.00040674311,0.00022786266,0.000015172658,0.00014944018,0.00025291624,0.00867338,0.10942804,0.67445916,0.0057309256,0.2004131],"study_design_scores_gemma":[0.00013645185,0.00059345906,0.00057981885,0.00020895655,0.000066322966,0.0014994118,0.00017962728,0.12001956,0.33229172,0.38178307,0.1625359,0.00010571206],"about_ca_topic_score_codex":0.0002600937,"about_ca_topic_score_gemma":0.0003632961,"teacher_disagreement_score":0.008548548,"about_ca_system_score_codex":0.0007601746,"about_ca_system_score_gemma":0.00032588912,"threshold_uncertainty_score":0.028597772},"labels":[],"label_agreement":null},{"id":"W1964452015","doi":"10.1016/j.jsc.2015.03.001","title":"A simple and fast online power series multiplication and its analysis","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Multiplication (music); Mathematics; Multiplication algorithm; Simple (philosophy); Arithmetic; Field (mathematics); Series (stratigraphy); Constant (computer programming); Power analysis; Algorithm; Computer science; Combinatorics; Pure mathematics; Cryptography","score_opus":0.020161471587159207,"score_gpt":0.2764404523851909,"score_spread":0.2562789807980317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964452015","genre_codex":"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.057519592,0.00092745456,0.91315174,0.0009841677,0.00053763896,0.00013269979,0.00020820081,0.00094105204,0.025597455],"genre_scores_gemma":[0.7794503,0.0009192154,0.17920855,0.00056881964,0.0012028959,0.00025435415,0.00030386864,0.00056576915,0.037526198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989311,0.00021611917,0.000053024494,0.00018604343,0.00048602384,0.00012778105],"domain_scores_gemma":[0.99800116,0.0010306757,0.00011898803,0.00045003748,0.00026473426,0.00013445436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178447,0.0014562114,0.0012038522,0.0015990874,0.0011226587,0.0015814871,0.0014010266,0.0012377559,0.0114435945],"category_scores_gemma":[0.0056331838,0.00046160122,0.0012464556,0.0015211442,0.0020143124,0.0039269077,0.002417098,0.0025167023,0.0028372002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040566942,0.00021295049,0.0009536092,0.00022338357,0.00007004497,0.00079516246,0.00031410035,0.02772644,0.018386964,0.8281329,0.009464548,0.11331424],"study_design_scores_gemma":[0.000043710188,0.00012929861,0.0004512453,0.000036487254,0.000048135258,0.0009345143,0.00004222834,0.3769659,0.008103031,0.60620356,0.0069833137,0.000058532773],"about_ca_topic_score_codex":0.00033584458,"about_ca_topic_score_gemma":0.0004616543,"teacher_disagreement_score":0.0114435945,"about_ca_system_score_codex":0.00073515135,"about_ca_system_score_gemma":0.00089407794,"threshold_uncertainty_score":0.038282633},"labels":[],"label_agreement":null},{"id":"W1964481900","doi":"10.1016/j.ic.2006.01.004","title":"Aperiodic propagation criteria for Boolean functions","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Aperiodic graph; Computer science; Boolean function; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.011230163330921864,"score_gpt":0.24283167020348362,"score_spread":0.23160150687256176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964481900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.11397828,0.0016290307,0.79922616,0.0021195363,0.00034805242,0.00019381347,0.00031519574,0.00031643573,0.08187353],"genre_scores_gemma":[0.8563081,0.0021264208,0.10390006,0.0008024745,0.0010273122,0.0004082249,0.0005513394,0.0005097996,0.034366313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977386,0.000670764,0.00015644054,0.00026409124,0.0008698542,0.000300374],"domain_scores_gemma":[0.9805047,0.012805007,0.0012487938,0.0010752486,0.0030820477,0.0012841616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047453796,0.0012351549,0.0015447653,0.0056346664,0.0022530742,0.005104444,0.0022282454,0.002598522,0.009524456],"category_scores_gemma":[0.024052931,0.0007902959,0.0009344064,0.0027145168,0.0037711437,0.008792938,0.0025973,0.0035895377,0.0014177968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041131436,0.000012643766,0.000096623626,0.000034585377,0.0000057771454,0.00003968361,0.00007479273,0.0028359059,0.00077089935,0.99131835,0.0010124196,0.0037572284],"study_design_scores_gemma":[0.000016342547,0.000019407846,0.00009288399,0.000024223187,0.000007981731,0.00007970484,0.000040052055,0.04324646,0.0006755556,0.9541625,0.0016178105,0.00001698468],"about_ca_topic_score_codex":0.00076455966,"about_ca_topic_score_gemma":0.0005935644,"teacher_disagreement_score":0.009524456,"about_ca_system_score_codex":0.0026422408,"about_ca_system_score_gemma":0.0011173093,"threshold_uncertainty_score":0.031862497},"labels":[],"label_agreement":null},{"id":"W1965279733","doi":"10.3934/amc.2007.1.307","title":"The asymptotic behavior of N-adic complexity","year":2007,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; National Science Foundation","keywords":"Mathematics; Stream cipher; Sequence (biology); Ternary operation; Shift register; Set (abstract data type); Interval (graph theory); Binary number; Pseudorandom binary sequence; Linear feedback shift register; Discrete mathematics; Carry (investment); Arithmetic; Combinatorics; Algorithm; Cryptography; Computer science","score_opus":0.039815873919961234,"score_gpt":0.34066048356685463,"score_spread":0.3008446096468934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965279733","genre_codex":"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.8135696,0.0030606263,0.13392013,0.0036676307,0.0001479462,0.000046891215,0.00049983675,0.0005589318,0.04452849],"genre_scores_gemma":[0.9894571,0.00085593574,0.0060889735,0.00012140202,0.00019065643,0.000080695674,0.00021771115,0.00006701656,0.002920662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871886,0.00036384223,0.000053379154,0.00022711564,0.0004350819,0.00020187335],"domain_scores_gemma":[0.97761863,0.01657461,0.0018824106,0.0014155485,0.0015646073,0.0009443287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148247,0.000535861,0.00084148895,0.0030843914,0.001042825,0.0023275432,0.0013100199,0.0010864902,0.0042111403],"category_scores_gemma":[0.036718026,0.00049590855,0.00051499193,0.0012457584,0.0032403942,0.0052137016,0.002003235,0.0019112625,0.00039862728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002232431,0.00008689161,0.005900563,0.00024966177,0.00007406061,0.00033086992,0.0003387615,0.06139886,0.0070611034,0.9065215,0.0025163193,0.015298233],"study_design_scores_gemma":[0.000029416091,0.00009060941,0.00419845,0.00010908952,0.000029508616,0.0005436238,0.000115224684,0.37445387,0.0028923382,0.6155723,0.0019053376,0.000060283575],"about_ca_topic_score_codex":0.00088255294,"about_ca_topic_score_gemma":0.00075784087,"teacher_disagreement_score":0.0042111403,"about_ca_system_score_codex":0.002502987,"about_ca_system_score_gemma":0.00080733857,"threshold_uncertainty_score":0.018160582},"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":"W1966045745","doi":"10.1016/j.tcs.2005.11.044","title":"On linear complexity of sequences over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mtext>GF</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"","keywords":"Scroll; Mathematics; Algorithm; Computer science; Theology; Philosophy","score_opus":0.019594513761659143,"score_gpt":0.24566742363757352,"score_spread":0.22607290987591439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966045745","genre_codex":"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.34489563,0.007946135,0.36259177,0.029376639,0.00077000755,0.00022349143,0.0045366734,0.0010684793,0.24859113],"genre_scores_gemma":[0.9151179,0.0041760756,0.037457563,0.0015066094,0.0017577216,0.00042377293,0.0035419492,0.00042083894,0.035597593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744606,0.000693207,0.0001519717,0.0004223337,0.0008056633,0.00048070194],"domain_scores_gemma":[0.9712205,0.023011168,0.0018409663,0.0015185633,0.0015437516,0.0008649873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023934427,0.001115579,0.0010940431,0.003045493,0.0016433375,0.005446536,0.0013686422,0.0016683803,0.012286433],"category_scores_gemma":[0.019855043,0.0006177653,0.00089741155,0.0029658093,0.0031289998,0.012232054,0.0029972387,0.005712788,0.003020875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026055373,0.000066833905,0.0018061753,0.0002179187,0.00004383037,0.00015367789,0.000579537,0.011921968,0.0014312495,0.9419109,0.014120183,0.027487103],"study_design_scores_gemma":[0.000024331124,0.000043909193,0.000900548,0.00006230764,0.000017632074,0.00013714434,0.00006957206,0.036333684,0.0009453958,0.95789057,0.0035466882,0.000028216095],"about_ca_topic_score_codex":0.0030664473,"about_ca_topic_score_gemma":0.0030477815,"teacher_disagreement_score":0.012286433,"about_ca_system_score_codex":0.0045368206,"about_ca_system_score_gemma":0.0017082804,"threshold_uncertainty_score":0.04110217},"labels":[],"label_agreement":null},{"id":"W1966109782","doi":"10.1109/tit.2008.2008140","title":"On the Existence of $(10, 2, 7, 488)$ Resilient Functions","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Heuristic; Algebraic number; Degree (music); Computer science; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.011092172589970398,"score_gpt":0.2137632879363156,"score_spread":0.20267111534634522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966109782","genre_codex":"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.4881057,0.0011531934,0.3818992,0.0048254235,0.00020549455,0.00021730294,0.0011588943,0.001409214,0.12102555],"genre_scores_gemma":[0.7964118,0.0008490712,0.18977931,0.0006654532,0.000107095744,0.00029316335,0.0010272395,0.0002382008,0.010628716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.00020555251,0.000037702383,0.00013082557,0.00012001635,0.00016371517],"domain_scores_gemma":[0.9976706,0.0018016391,0.00014052847,0.00020319816,0.00011400144,0.00006997912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010428716,0.0010215202,0.00068967725,0.0019647288,0.0017837987,0.0015616518,0.00084872794,0.0014766263,0.013260978],"category_scores_gemma":[0.006579071,0.00049375015,0.0014306873,0.0013776296,0.0023522335,0.003281375,0.0022570223,0.002288018,0.0017993675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052616966,0.00014460631,0.0013451945,0.0004340991,0.000058419373,0.0006867519,0.00038987558,0.031620353,0.0074210917,0.8692203,0.009307202,0.07884578],"study_design_scores_gemma":[0.00017607064,0.0001902645,0.0008841133,0.00015622175,0.00009856804,0.0012600842,0.00031015248,0.07799722,0.014469551,0.88454145,0.01981248,0.00010388347],"about_ca_topic_score_codex":0.00063449785,"about_ca_topic_score_gemma":0.00066609925,"teacher_disagreement_score":0.013260978,"about_ca_system_score_codex":0.0013986776,"about_ca_system_score_gemma":0.0010203948,"threshold_uncertainty_score":0.044362426},"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":"W1966250211","doi":"10.1016/j.disc.2005.10.002","title":"Extensions of the Critical Theorem","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Matroid; Discrete mathematics; Combinatorics; Identity (music)","score_opus":0.015465550735839117,"score_gpt":0.26586045480771964,"score_spread":0.25039490407188053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966250211","genre_codex":"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.08702765,0.008253944,0.25537625,0.016468037,0.0031306548,0.000084340776,0.00066433876,0.0004841277,0.6285106],"genre_scores_gemma":[0.8706694,0.0050972938,0.031054081,0.0043313364,0.00652686,0.00020981718,0.00063854223,0.00034078816,0.08113186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990822,0.00028751494,0.000041146708,0.00023599189,0.00023266932,0.00012040695],"domain_scores_gemma":[0.99687874,0.0015159657,0.00026681717,0.00050178694,0.00053092954,0.00030571787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015633726,0.00091816776,0.000985304,0.0027030075,0.0020671722,0.0030947207,0.0011897796,0.001462841,0.013819376],"category_scores_gemma":[0.006982362,0.00038679005,0.0010852292,0.0014198669,0.004410905,0.008009175,0.0032157581,0.004125089,0.0016525367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007954319,0.000004679404,0.00003463208,0.000012025402,0.0000023098175,0.000015289072,0.000031791795,0.00011817742,0.000058878526,0.996664,0.0015568157,0.0014934795],"study_design_scores_gemma":[0.000008127099,0.000003574858,0.00004224714,0.000006680816,0.0000026660352,0.00003368364,0.000014692604,0.000685898,0.00006133776,0.9936487,0.00548927,0.000003250001],"about_ca_topic_score_codex":0.0008288433,"about_ca_topic_score_gemma":0.00048220533,"teacher_disagreement_score":0.013819376,"about_ca_system_score_codex":0.0019106742,"about_ca_system_score_gemma":0.0009149614,"threshold_uncertainty_score":0.046230376},"labels":[],"label_agreement":null},{"id":"W1966477666","doi":"10.1016/j.laa.2011.03.031","title":"The eigenstructure of finite field trigonometric transforms","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Finite field; Sine; Eigenvalues and eigenvectors; Discrete cosine transform; Trigonometric functions; Field (mathematics); Trigonometry; Sine and cosine transforms; Pure mathematics; Pythagorean trigonometric identity; Trigonometric substitution; Discrete sine transform; Differentiation of trigonometric functions; Algebra over a field; Mathematical analysis; Discrete mathematics; Fourier transform; Fourier analysis; Computer science; Fractional Fourier transform; Geometry","score_opus":0.016520453796969616,"score_gpt":0.2185858912432884,"score_spread":0.20206543744631877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966477666","genre_codex":"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.68195754,0.0022421787,0.19590876,0.0041212947,0.001267263,0.000047838545,0.00037403178,0.0005483812,0.1135327],"genre_scores_gemma":[0.9674113,0.0009124804,0.010149875,0.0005150109,0.00092006,0.000039786617,0.00019121375,0.0001922452,0.019667977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946076,0.00014457134,0.000030003952,0.00008849749,0.0001692249,0.00010701642],"domain_scores_gemma":[0.9988167,0.0004249379,0.00018527886,0.00020310108,0.00019417131,0.00017575742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011190488,0.0009048609,0.00091472827,0.0027235798,0.0012325506,0.0035699897,0.0010754869,0.001533985,0.0065850224],"category_scores_gemma":[0.0033813627,0.000536755,0.000511312,0.001929167,0.0037524444,0.004267981,0.0012883812,0.0023239949,0.0013725418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003676099,0.000019337589,0.000084496394,0.00000943079,0.0000027859742,0.000055442204,0.000121374054,0.0008544676,0.0012787444,0.99325526,0.00069388177,0.0035880052],"study_design_scores_gemma":[0.000008391488,0.000012272161,0.00011999173,0.0000056400145,0.0000025084569,0.00007165115,0.000050356804,0.0063831625,0.00032376085,0.9923437,0.0006633455,0.000015158924],"about_ca_topic_score_codex":0.00047936052,"about_ca_topic_score_gemma":0.0003113514,"teacher_disagreement_score":0.0065850224,"about_ca_system_score_codex":0.00077660853,"about_ca_system_score_gemma":0.00062867586,"threshold_uncertainty_score":0.022029102},"labels":[],"label_agreement":null},{"id":"W1967002960","doi":"10.1142/s1793042110003290","title":"MULTIPLICATIVE ORDER OF GAUSS PERIODS","year":2010,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Multiplicative function; Upper and lower bounds; Gauss; Order (exchange); Gauss sum; Pure mathematics; Mathematical analysis; Physics","score_opus":0.006283978535805887,"score_gpt":0.27889246631938786,"score_spread":0.272608487783582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967002960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6091842,0.002381535,0.17955586,0.0031127806,0.0008387197,0.000100973,0.0006305319,0.0005810489,0.20361426],"genre_scores_gemma":[0.96701235,0.0010271183,0.014722159,0.00036590738,0.0010412832,0.00008189178,0.00031698882,0.00014124163,0.015291012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.0002456849,0.000074187476,0.00023168325,0.0004334262,0.00039710014],"domain_scores_gemma":[0.9958139,0.002104842,0.0003829205,0.0005984988,0.0005991224,0.00050068286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013233067,0.0006882777,0.00066212105,0.0021439448,0.0011463598,0.0031094723,0.0007606348,0.0007011005,0.00865289],"category_scores_gemma":[0.005410948,0.00043428346,0.0007826236,0.0007681626,0.0021811437,0.0046019168,0.002413912,0.0026060047,0.00193867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013722456,0.000048581413,0.0013489351,0.00008812323,0.000015691645,0.00009529729,0.00025583242,0.0015578265,0.0060247295,0.9734245,0.0018950991,0.015108226],"study_design_scores_gemma":[0.000030316374,0.00012553463,0.001229388,0.000046861565,0.000034600605,0.0003707456,0.000089626534,0.00953613,0.008745376,0.96955824,0.01019533,0.00003779867],"about_ca_topic_score_codex":0.00022245367,"about_ca_topic_score_gemma":0.00025027813,"teacher_disagreement_score":0.00865289,"about_ca_system_score_codex":0.00072031404,"about_ca_system_score_gemma":0.0004798506,"threshold_uncertainty_score":0.028946817},"labels":[],"label_agreement":null},{"id":"W1967737635","doi":"10.1587/transfun.e95.a.567","title":"Oblivious Transfer Based on the McEliece Assumptions","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Ouro Preto; University of California, San Diego; Université de Montréal; Universiteit van Amsterdam; Universidade de Brasília","keywords":"McEliece cryptosystem; Generalization; Cryptosystem; Decoding methods; Oblivious transfer; Binary number; Reduction (mathematics); Mathematics; Matrix (chemical analysis); Transfer (computing); Computer science; Arithmetic; Theoretical computer science; Discrete mathematics; Algorithm; Cryptography; Parallel computing","score_opus":0.03781384633451661,"score_gpt":0.2701927737982126,"score_spread":0.23237892746369598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967737635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.035949823,0.00020607722,0.9243263,0.0017786456,0.00020005736,0.000551753,0.0002464322,0.0014739401,0.035266977],"genre_scores_gemma":[0.7937859,0.00033250215,0.17294505,0.0006582275,0.00017134004,0.0012160394,0.00029341815,0.00058041915,0.030016977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932181,0.0015373251,0.0003671276,0.0007375157,0.0028814322,0.0012585032],"domain_scores_gemma":[0.9867006,0.004539162,0.0010905869,0.0064329044,0.0008296234,0.0004071574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033334612,0.0010485622,0.0014313686,0.0012044527,0.002223592,0.003830354,0.004094806,0.0027738607,0.010829818],"category_scores_gemma":[0.014481676,0.0006826255,0.001409065,0.0014138194,0.0053178547,0.011027973,0.010603424,0.008409056,0.0031546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027470238,0.00011625775,0.00020158025,0.000100027275,0.000035321613,0.00015737339,0.0004683155,0.012680063,0.0072751897,0.9566935,0.0021116417,0.019886043],"study_design_scores_gemma":[0.00013278407,0.00016564866,0.00014262916,0.00006474904,0.000053234144,0.00031175662,0.00014122798,0.09633911,0.06683216,0.81917554,0.016531307,0.00010996372],"about_ca_topic_score_codex":0.00055916706,"about_ca_topic_score_gemma":0.00038506952,"teacher_disagreement_score":0.010829818,"about_ca_system_score_codex":0.002267812,"about_ca_system_score_gemma":0.0026640478,"threshold_uncertainty_score":0.036229312},"labels":[],"label_agreement":null},{"id":"W1967804748","doi":"10.1109/cwit.2013.6621620","title":"Translation schemes and LP bounds","year":2013,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Translation (biology); Scheme (mathematics); Extension (predicate logic); Computer science; Upper and lower bounds; Classification scheme; Class (philosophy); Linear programming; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence; Machine learning; Programming language","score_opus":0.010677007252253864,"score_gpt":0.19720084046783012,"score_spread":0.18652383321557625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967804748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.024238585,0.010182067,0.79310054,0.008372645,0.00077397976,0.00008527832,0.00060589926,0.00058408076,0.16205683],"genre_scores_gemma":[0.64826727,0.017127234,0.2662122,0.0069245338,0.0041462,0.0009626149,0.0022133891,0.0010786703,0.053067982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949949,0.0017316259,0.00034724787,0.0007494536,0.0014497376,0.000727007],"domain_scores_gemma":[0.98786247,0.008599029,0.00063538365,0.0016842167,0.0008837967,0.0003350976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044929422,0.0014558203,0.0009721271,0.0027893004,0.002000205,0.004798686,0.0020393548,0.0022825066,0.021068957],"category_scores_gemma":[0.015765246,0.0005357134,0.0017967382,0.0046674344,0.004404383,0.014646613,0.0057404893,0.007402727,0.0039437786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001739118,0.000015698308,0.000074297925,0.00007143411,0.0000057047446,0.000041499516,0.000090107365,0.002103573,0.0002613432,0.9873584,0.002245728,0.0077148695],"study_design_scores_gemma":[0.0000060064863,0.000017948036,0.00007450643,0.000057156358,0.000009128547,0.0000648123,0.00004333431,0.008307303,0.000548121,0.97864234,0.012217021,0.000012209907],"about_ca_topic_score_codex":0.0009126029,"about_ca_topic_score_gemma":0.00048664675,"teacher_disagreement_score":0.021068957,"about_ca_system_score_codex":0.0030074853,"about_ca_system_score_gemma":0.0009725884,"threshold_uncertainty_score":0.07048267},"labels":[],"label_agreement":null},{"id":"W1967990110","doi":"10.1016/s1071-5797(03)00040-6","title":"Low complexity normal bases in F2n","year":2003,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Arithmetic","score_opus":0.02155343808712097,"score_gpt":0.2275598749627338,"score_spread":0.20600643687561282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967990110","genre_codex":"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.6112727,0.0027081273,0.22345388,0.0061180037,0.0007745891,0.00013588046,0.0008448471,0.0005463927,0.15414552],"genre_scores_gemma":[0.9093075,0.0012118965,0.037884828,0.00052481226,0.00069003657,0.0001508269,0.00054297294,0.00015396488,0.049533162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860793,0.00037748105,0.00005503613,0.00016513414,0.0005090566,0.00028543425],"domain_scores_gemma":[0.9970337,0.0017854888,0.00026493374,0.00032503548,0.0002912013,0.00029959666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015130161,0.0010516869,0.0010223463,0.0023298033,0.0017625316,0.003637922,0.0012098079,0.0012074157,0.009331107],"category_scores_gemma":[0.005544724,0.00048309812,0.0005822257,0.0021021382,0.0030702266,0.0059692967,0.0022772038,0.0033297467,0.0016001924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019619417,0.00005832802,0.0002908926,0.00005250265,0.0000072912285,0.000077105855,0.00022876407,0.0029372263,0.0012290374,0.97836393,0.0020305817,0.014528142],"study_design_scores_gemma":[0.000034324737,0.000032432494,0.00015815857,0.000021066662,0.0000058786577,0.00011844818,0.00005703828,0.008961486,0.0010071974,0.9860184,0.0035662446,0.000019172856],"about_ca_topic_score_codex":0.0012520326,"about_ca_topic_score_gemma":0.0017951773,"teacher_disagreement_score":0.009331107,"about_ca_system_score_codex":0.0022393803,"about_ca_system_score_gemma":0.0010379896,"threshold_uncertainty_score":0.031215668},"labels":[],"label_agreement":null},{"id":"W1968759207","doi":"10.1016/j.jcta.2006.11.005","title":"Maximum distance separable codes and arcs in projective spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Projective test; Separable space; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.004965791969250566,"score_gpt":0.21562679224028844,"score_spread":0.21066100027103787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968759207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5190907,0.003330232,0.36602807,0.006225011,0.00032406987,0.000092135735,0.0010482165,0.00065430894,0.10320729],"genre_scores_gemma":[0.93301624,0.0019452818,0.0403325,0.00035779295,0.00040671203,0.00010815839,0.0005064201,0.00015381307,0.023172958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871075,0.00043301244,0.00006689237,0.00023046494,0.0003527511,0.00020607583],"domain_scores_gemma":[0.9911281,0.0064082565,0.00085795793,0.00065415754,0.0003803079,0.00057121424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010818858,0.00083077664,0.0009667465,0.0021745875,0.0018769152,0.004197976,0.0013517734,0.0016132877,0.0056888517],"category_scores_gemma":[0.009845816,0.0008782332,0.00061895256,0.0037371346,0.003978319,0.0074877185,0.0035964807,0.0042162524,0.0006835825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006788616,0.000016073465,0.00023360195,0.00003932177,0.000005289912,0.000036834026,0.0001599396,0.0039639515,0.00036216158,0.98837876,0.0009540081,0.0057821344],"study_design_scores_gemma":[0.000013581837,0.000013189201,0.0001432512,0.000015170083,0.0000062373188,0.00007276079,0.000060647933,0.009916791,0.00048742865,0.98735714,0.0019044667,0.000009385085],"about_ca_topic_score_codex":0.0008644171,"about_ca_topic_score_gemma":0.00088028365,"teacher_disagreement_score":0.0056888517,"about_ca_system_score_codex":0.0018991494,"about_ca_system_score_gemma":0.00079487124,"threshold_uncertainty_score":0.019031107},"labels":[],"label_agreement":null},{"id":"W1968809051","doi":"10.1145/384101.384111","title":"Computing all factorizations in ***","year":2001,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Factorization; Unique factorization domain; Discriminant; Multiplication (music); Prime (order theory); Time complexity; Mathematics; Factorization of polynomials; Prime factor; Polynomial; Domain (mathematical analysis); Dixon's factorization method; Combinatorics; Degree (music); Computational complexity theory; Discrete mathematics; Computer science; Algorithm; Matrix polynomial; Artificial intelligence","score_opus":0.024260265366140902,"score_gpt":0.26046708758365156,"score_spread":0.23620682221751066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968809051","genre_codex":"methods","genre_gemma":"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.077153996,0.0004542969,0.90815485,0.00034632455,0.00014202888,0.00018523705,0.0011703428,0.0036859256,0.008707134],"genre_scores_gemma":[0.35764602,0.00031974484,0.6259618,0.00010942773,0.0001103207,0.00016738236,0.0038600147,0.0009195965,0.010905659],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870455,0.00012268935,0.00011228199,0.0004462269,0.00033880302,0.00027540707],"domain_scores_gemma":[0.99790907,0.0006335229,0.0001558351,0.0006207232,0.0005848118,0.00009609526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249819,0.0012402968,0.0014310688,0.0011920723,0.001349237,0.0018613054,0.0008819989,0.00056792545,0.011035406],"category_scores_gemma":[0.004035296,0.00057403365,0.0012302651,0.0009288657,0.0009801997,0.005552989,0.0023372842,0.0014351159,0.005072309],"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.0011836,0.00024402198,0.0045179436,0.0005668178,0.00012824446,0.0004887708,0.0007950287,0.03474495,0.03449907,0.13907735,0.022467153,0.7612871],"study_design_scores_gemma":[0.00016337547,0.00037621593,0.002067651,0.000099964906,0.00012297276,0.00072876015,0.00056332967,0.24024956,0.06948565,0.634312,0.051663358,0.00016718173],"about_ca_topic_score_codex":0.002366284,"about_ca_topic_score_gemma":0.0031613263,"teacher_disagreement_score":0.011035406,"about_ca_system_score_codex":0.0008118505,"about_ca_system_score_gemma":0.0019285593,"threshold_uncertainty_score":0.03691715},"labels":[],"label_agreement":null},{"id":"W1969032791","doi":"10.1016/j.ffa.2005.08.004","title":"On Ritt's decomposition theorem in the case of finite fields","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Univariate; Generalization; Decomposition; Polynomial; Finite field; Factor theorem; Pure mathematics; Decomposition theorem; Discrete mathematics; Fundamental theorem; Mathematical analysis; Multivariate statistics; Statistics; Fixed-point theorem","score_opus":0.010888143069672264,"score_gpt":0.2522877109278614,"score_spread":0.24139956785818914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969032791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.087852314,0.013341261,0.52299523,0.011557728,0.002826356,0.000086409156,0.0006431444,0.00045109793,0.36024645],"genre_scores_gemma":[0.72846127,0.010263509,0.14201476,0.004524356,0.005270012,0.00022705621,0.0009151801,0.0006826058,0.10764127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989441,0.00037047724,0.00005721002,0.00016456268,0.0002992552,0.00016446147],"domain_scores_gemma":[0.9977695,0.0012430112,0.00017343354,0.0003502438,0.00029785928,0.00016607909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027380968,0.00092968077,0.0013304182,0.002452077,0.0015162114,0.0032032034,0.0014348085,0.0016946332,0.01062963],"category_scores_gemma":[0.0052292757,0.00063183,0.0017911505,0.0020659675,0.0042874445,0.0103567485,0.0027657,0.005397802,0.0022772462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015762613,0.000011296057,0.00004004147,0.00002189825,0.000004093838,0.000028530267,0.00007681751,0.0003256701,0.00016297074,0.9937097,0.0019679128,0.0036354482],"study_design_scores_gemma":[0.000007561519,0.0000067050405,0.000052863455,0.000015715717,0.0000037203538,0.00004891467,0.000027801188,0.0021707048,0.000106034626,0.99366117,0.0038917833,0.000006978139],"about_ca_topic_score_codex":0.0011510947,"about_ca_topic_score_gemma":0.0008657467,"teacher_disagreement_score":0.01062963,"about_ca_system_score_codex":0.0014910828,"about_ca_system_score_gemma":0.00074867374,"threshold_uncertainty_score":0.035559654},"labels":[],"label_agreement":null},{"id":"W1969105360","doi":"10.1016/s0019-3577(07)00013-4","title":"Distribution of matrices with restricted entries over finite fields","year":2007,"lang":"en","type":"article","venue":"Indagationes Mathematicae","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Finite field; Rank (graph theory); Prime (order theory); Distribution (mathematics); Field (mathematics); Combinatorics; Polynomial; Matrix (chemical analysis); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.009608625576830149,"score_gpt":0.23566452859488654,"score_spread":0.2260559030180564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969105360","genre_codex":"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.54517037,0.001252768,0.41969532,0.0040124184,0.00026865216,0.00013930653,0.0011765563,0.0010215983,0.027262948],"genre_scores_gemma":[0.9641801,0.0012063673,0.016481873,0.0003814053,0.0008065065,0.00020073514,0.00074228994,0.0002872797,0.015713403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708515,0.0010761998,0.000107610795,0.00048263796,0.00073794747,0.0005105746],"domain_scores_gemma":[0.9740613,0.01665684,0.002922072,0.002802341,0.001786777,0.0017706361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989989,0.0012118384,0.0014502053,0.0035567754,0.0014223956,0.003945986,0.0025223503,0.0017343459,0.00871108],"category_scores_gemma":[0.02653693,0.00097551633,0.0006864655,0.0028571142,0.004050006,0.006651369,0.002878552,0.0026069493,0.0016846474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030428485,0.00007344792,0.00091635046,0.00008522611,0.000020280539,0.00016119627,0.00027428698,0.0092665,0.0032063057,0.97539437,0.0022322151,0.008065461],"study_design_scores_gemma":[0.0000883777,0.00009217941,0.00071503967,0.00006250838,0.00001886086,0.00041218402,0.00009863515,0.06676758,0.0027815115,0.92708665,0.0018245105,0.000051942086],"about_ca_topic_score_codex":0.00051175716,"about_ca_topic_score_gemma":0.00031562432,"teacher_disagreement_score":0.00871108,"about_ca_system_score_codex":0.0014592981,"about_ca_system_score_gemma":0.0011835283,"threshold_uncertainty_score":0.029141426},"labels":[],"label_agreement":null},{"id":"W1969341770","doi":"10.1006/jsco.1999.0309","title":"Algorithms for Exponentiation in Finite Fields","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exponentiation; Mathematics; Normal basis; Finite field; Modular exponentiation; Multiplication (music); Division (mathematics); Basis (linear algebra); Polynomial; Polynomial basis; Combinatorics; Element (criminal law); Prime (order theory); Discrete mathematics; Arithmetic; Mathematical analysis; Geometry; Computer science","score_opus":0.01953647114672561,"score_gpt":0.2727223051112659,"score_spread":0.25318583396454025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969341770","genre_codex":"methods","genre_gemma":"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.041391976,0.0017047345,0.9355712,0.00186659,0.00036547193,0.00018512615,0.00052677066,0.0034912843,0.014896906],"genre_scores_gemma":[0.46025702,0.0013347545,0.5210101,0.0005770779,0.0004071412,0.00028822888,0.0013168373,0.00080800685,0.014000723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694866,0.00075591,0.0003893797,0.0005779119,0.0008590021,0.00046915203],"domain_scores_gemma":[0.98752314,0.0077117835,0.00042297383,0.003042658,0.0010343896,0.00026499716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027137527,0.0013914428,0.0014644511,0.0019577388,0.0017256924,0.0057166764,0.0024219411,0.0019009826,0.012743016],"category_scores_gemma":[0.014626319,0.0010037109,0.0014305332,0.003182033,0.0027033093,0.014097229,0.0042482344,0.0045280512,0.003847548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010017274,0.00025438165,0.0015857749,0.0004721462,0.0000977207,0.00013198241,0.0005888465,0.03045342,0.003535858,0.5754663,0.016083535,0.37032837],"study_design_scores_gemma":[0.00020195867,0.00006761234,0.00017586663,0.00009739222,0.000049783896,0.0001542406,0.00012729784,0.08162166,0.005555657,0.9024653,0.009448396,0.0000348819],"about_ca_topic_score_codex":0.0011113997,"about_ca_topic_score_gemma":0.0015877676,"teacher_disagreement_score":0.012743016,"about_ca_system_score_codex":0.0022376655,"about_ca_system_score_gemma":0.002327973,"threshold_uncertainty_score":0.04262966},"labels":[],"label_agreement":null},{"id":"W1969941659","doi":"10.1145/2755996.2756653","title":"Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Center for Hierarchical Manufacturing, National Science Foundation; National Science Foundation","keywords":"Integer (computer science); Mathematics; Multiplication (music); Univariate; Interpolation (computer graphics); Algorithm; Polynomial; Discrete mathematics; Computer science; Combinatorics; Multivariate statistics","score_opus":0.06220555721406493,"score_gpt":0.2792299283462728,"score_spread":0.21702437113220788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969941659","genre_codex":"methods","genre_gemma":"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.009823937,0.00013423934,0.9833814,0.00027479057,0.000096912736,0.000120354074,0.00024218655,0.0020362642,0.0038898876],"genre_scores_gemma":[0.25147662,0.0002357949,0.7363787,0.0003606625,0.00028460947,0.00056302216,0.0013215769,0.0008495954,0.008529369],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962953,0.0008717942,0.00029648552,0.0005884589,0.0014874251,0.00046060813],"domain_scores_gemma":[0.9943251,0.0023578198,0.0005250686,0.0018036324,0.0007974199,0.0001908979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001978643,0.0013324413,0.0011784834,0.0013440838,0.0011035106,0.002682576,0.0020043345,0.0010655285,0.011077837],"category_scores_gemma":[0.012362266,0.00058946665,0.0013111526,0.0021064288,0.0013990953,0.004987674,0.0039133863,0.0028445201,0.0037945653],"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.0014727283,0.0003913403,0.0014900472,0.0003900831,0.00011026234,0.00018703651,0.00026923654,0.098591104,0.01666773,0.40946195,0.017443469,0.45352507],"study_design_scores_gemma":[0.00018305049,0.00019698184,0.00025897156,0.000056040615,0.000041859756,0.00019369788,0.0000671334,0.57617974,0.024456399,0.38669723,0.011605257,0.000063612046],"about_ca_topic_score_codex":0.00078248116,"about_ca_topic_score_gemma":0.0014436411,"teacher_disagreement_score":0.011077837,"about_ca_system_score_codex":0.0015685398,"about_ca_system_score_gemma":0.0021412515,"threshold_uncertainty_score":0.03705913},"labels":[],"label_agreement":null},{"id":"W1971255859","doi":"10.1090/s0002-9947-09-04578-4","title":"Permutation binomials over finite fields","year":2009,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Mathematics; Permutation (music); Partial permutation; Generalized permutation matrix; Cyclic permutation; Finite field; Combinatorics; Discrete mathematics; Pure mathematics; Symmetric group","score_opus":0.01494183587803234,"score_gpt":0.26282765396283936,"score_spread":0.24788581808480703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971255859","genre_codex":"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.23231357,0.0016620815,0.32508722,0.004775901,0.0020429196,0.00012555091,0.0011260338,0.001491114,0.43137562],"genre_scores_gemma":[0.881398,0.0016176455,0.032704905,0.0011833993,0.0015340358,0.00018331547,0.0009089876,0.0005595294,0.07991013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986186,0.00030735476,0.000073907315,0.0002759065,0.00040109621,0.00032318817],"domain_scores_gemma":[0.9971077,0.0015435949,0.00029641387,0.0003371618,0.00048177826,0.00023337992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020205104,0.00081650383,0.00081154605,0.0014527964,0.0017033216,0.0028062796,0.00080765906,0.0007236666,0.022710444],"category_scores_gemma":[0.0077861045,0.00054874725,0.0012297168,0.0012083494,0.0026763908,0.005322281,0.0022688068,0.0028161698,0.0056988103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007108441,0.000024539491,0.0005847668,0.0000710535,0.000013784862,0.00028155695,0.00018507057,0.0008700557,0.0007355135,0.98060304,0.0061724614,0.010387074],"study_design_scores_gemma":[0.000038253413,0.00004203969,0.0005083052,0.000042502073,0.00002800335,0.0004694037,0.00009156988,0.008779531,0.0019336663,0.97402793,0.014015015,0.000023753693],"about_ca_topic_score_codex":0.0013137958,"about_ca_topic_score_gemma":0.0012141688,"teacher_disagreement_score":0.022710444,"about_ca_system_score_codex":0.0015001312,"about_ca_system_score_gemma":0.0010796917,"threshold_uncertainty_score":0.07597399},"labels":[],"label_agreement":null},{"id":"W1971882628","doi":"10.1142/s0129054111008738","title":"PERIODS ON TWO KINDS OF NONLINEAR FEEDBACK SHIFT REGISTERS WITH TIME VARYING FEEDBACK FUNCTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Shift register; Computer science; Control theory (sociology); Mathematics; Arithmetic; Artificial intelligence; Telecommunications; Control (management); Physics","score_opus":0.025460061474614406,"score_gpt":0.2705732151522423,"score_spread":0.2451131536776279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971882628","genre_codex":"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.8939945,0.0009949934,0.076933905,0.0003140293,0.00010178625,0.00003376254,0.00016832238,0.00017536007,0.027283419],"genre_scores_gemma":[0.9910591,0.00021361456,0.0065042386,0.000038967155,0.000025357063,0.000023730989,0.000044754615,0.000016252417,0.0020738621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984574,0.00002294039,0.000011338506,0.000033428725,0.00004278438,0.00004374914],"domain_scores_gemma":[0.9996952,0.00011543722,0.00008413011,0.000049992923,0.000026622592,0.000028664148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013603544,0.00021435242,0.0002287589,0.00047818714,0.00028506343,0.0006488263,0.00035398992,0.00042735637,0.001759297],"category_scores_gemma":[0.00067937654,0.00015228678,0.0002790023,0.00041185794,0.000693657,0.0008055001,0.00042034575,0.0004019578,0.00014978011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062213786,0.000041403036,0.001226422,0.00013788765,0.00003408031,0.00033685527,0.00039212004,0.016693853,0.06670915,0.8809725,0.000982351,0.031851154],"study_design_scores_gemma":[0.00022594447,0.0005535793,0.005423706,0.00008831133,0.0000999371,0.0017288921,0.00037383445,0.2682244,0.07876683,0.6262804,0.018100712,0.00013344575],"about_ca_topic_score_codex":0.00019247712,"about_ca_topic_score_gemma":0.00024952664,"teacher_disagreement_score":0.001759297,"about_ca_system_score_codex":0.00051673973,"about_ca_system_score_gemma":0.00024649993,"threshold_uncertainty_score":0.005885422},"labels":[],"label_agreement":null},{"id":"W1972160534","doi":"10.1007/3-540-39799-x_26","title":"An M3 Public-Key Encryption Scheme","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Key (lock); Public-key cryptography; Encryption; Scheme (mathematics); Computer security; Computer network; Mathematics","score_opus":0.015816510688001204,"score_gpt":0.26450771388122,"score_spread":0.2486912031932188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972160534","genre_codex":"methods","genre_gemma":"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.21435104,0.0020668176,0.5779933,0.005117465,0.00071440084,0.0008147346,0.005910908,0.004909413,0.18812197],"genre_scores_gemma":[0.88881826,0.0004963946,0.07135538,0.0008926598,0.00007531124,0.00027324053,0.0017363713,0.0001815845,0.036170833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.00010667002,0.000033536544,0.000064421576,0.00019000054,0.00016910525],"domain_scores_gemma":[0.99949145,0.00008677116,0.000063856016,0.00022840148,0.000083413994,0.00004613465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004939512,0.00043279628,0.00044156727,0.0003630764,0.0010040662,0.0011732196,0.00057401805,0.000913983,0.007460287],"category_scores_gemma":[0.00090880005,0.00017010047,0.0005389251,0.0009014257,0.00058902096,0.00128705,0.001499767,0.0010071588,0.00437204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002328577,0.00021794174,0.0011684927,0.00066638074,0.000071806666,0.0011574926,0.0004287132,0.0061559943,0.105962954,0.653672,0.04731475,0.1808549],"study_design_scores_gemma":[0.0005783801,0.0005745762,0.0026747724,0.00016924035,0.00011435124,0.003554984,0.00019652548,0.056256466,0.21161215,0.4246265,0.29948193,0.00016006004],"about_ca_topic_score_codex":0.0003951875,"about_ca_topic_score_gemma":0.00038842086,"teacher_disagreement_score":0.007460287,"about_ca_system_score_codex":0.0008711586,"about_ca_system_score_gemma":0.001034555,"threshold_uncertainty_score":0.02495718},"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":"W1974742228","doi":"10.48550/arxiv.1310.8369","title":"On the inverses of some classes of permutations of finite fields","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Permutation (music); Linear subspace; Bijection; Finite field; Inverse; Polynomial; Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis","score_opus":0.07526124733767775,"score_gpt":0.18317625787613456,"score_spread":0.10791501053845681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974742228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6751367,0.00058966904,0.23461354,0.0008349327,0.000085089094,0.000076307566,0.00014363421,0.00016969694,0.08835048],"genre_scores_gemma":[0.9651945,0.00051359367,0.02278365,0.00013398608,0.00015989626,0.000047880203,0.0002285806,0.000085971675,0.01085176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929464,0.00015181518,0.0000310509,0.00011406272,0.00021856841,0.00018979324],"domain_scores_gemma":[0.9988531,0.0005865743,0.00015229816,0.00016685527,0.00013470305,0.00010655919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078536395,0.00043260097,0.00038788503,0.0012329768,0.0014053013,0.0014565497,0.0004006002,0.000643785,0.004284683],"category_scores_gemma":[0.002631773,0.00024450774,0.0007649004,0.00066229526,0.002654328,0.003174502,0.0011089387,0.001994948,0.00050404016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030674895,0.00002785963,0.00042402605,0.000023508672,0.0000031800303,0.00012243926,0.00027883408,0.0023193602,0.0021523186,0.9884958,0.00033177625,0.005790203],"study_design_scores_gemma":[0.000012318223,0.00003479593,0.0004300294,0.000016176964,0.0000059464132,0.00027265173,0.00016597314,0.017603863,0.0025545477,0.97490036,0.003988905,0.000014500053],"about_ca_topic_score_codex":0.00064835534,"about_ca_topic_score_gemma":0.0005133225,"teacher_disagreement_score":0.004284683,"about_ca_system_score_codex":0.0008098859,"about_ca_system_score_gemma":0.00042421563,"threshold_uncertainty_score":0.014333665},"labels":[],"label_agreement":null},{"id":"W1975694774","doi":"10.1109/isbmsb.2010.5463166","title":"Geometric capacity studies for DTV transmitter identification using Kasami sequences","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Transmitter; Pseudorandom number generator; Interference (communication); Mathematics; SIGNAL (programming language); Transmission (telecommunications); Electronic engineering; Computer science; Topology (electrical circuits); Telecommunications; Algorithm; Engineering; Channel (broadcasting); Combinatorics","score_opus":0.09780511101685986,"score_gpt":0.32202154796440313,"score_spread":0.22421643694754329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975694774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4452056,0.0031377617,0.48746127,0.0010068692,0.00011129402,0.00011915762,0.000496208,0.00047351548,0.06198823],"genre_scores_gemma":[0.988277,0.0010832779,0.00844013,0.00008409975,0.00006763021,0.00007128984,0.00015203292,0.000048184338,0.0017763189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879164,0.00035471236,0.000036726524,0.000102639075,0.00040237402,0.00031209958],"domain_scores_gemma":[0.9830715,0.011997065,0.0018178541,0.0009801791,0.0017145338,0.00041893963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558769,0.0010101122,0.0007204229,0.003045348,0.00079020066,0.0013183408,0.0013537077,0.0007038909,0.005541712],"category_scores_gemma":[0.016035601,0.0004322483,0.00045431874,0.002157113,0.0022288552,0.0023877635,0.0019015961,0.00076777,0.0009117047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002933678,0.000065243934,0.0019715468,0.00025164997,0.000048179394,0.00042796263,0.0004463749,0.66769767,0.015959805,0.2911792,0.0018740325,0.019784853],"study_design_scores_gemma":[0.000013396706,0.000117258234,0.0011097627,0.00005590085,0.00003013687,0.00048291933,0.00021259103,0.9272813,0.00812171,0.060959797,0.001532631,0.00008260523],"about_ca_topic_score_codex":0.0022964769,"about_ca_topic_score_gemma":0.00095575606,"teacher_disagreement_score":0.005541712,"about_ca_system_score_codex":0.0016520678,"about_ca_system_score_gemma":0.0008028517,"threshold_uncertainty_score":0.018538892},"labels":[],"label_agreement":null},{"id":"W1976248130","doi":"10.1007/s00200-008-0058-0","title":"Maximal AMDS codes","year":2008,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.009820394412748035,"score_gpt":0.20382458648276036,"score_spread":0.19400419207001232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976248130","genre_codex":"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.25830096,0.0013829041,0.2009531,0.004046181,0.0010578992,0.00019029906,0.0022804993,0.0012981446,0.53049004],"genre_scores_gemma":[0.8774542,0.00053210126,0.026128648,0.00094846456,0.0006351808,0.00015409008,0.0011263698,0.0002822482,0.09273876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989642,0.00017768829,0.00006042116,0.00019863759,0.00033441407,0.00026469876],"domain_scores_gemma":[0.9986828,0.0003218727,0.00012560234,0.00034658198,0.00032832596,0.00019481577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067680614,0.0006623722,0.0007686349,0.0015202007,0.0020453853,0.0028135772,0.0008595613,0.00094307953,0.019729864],"category_scores_gemma":[0.003373427,0.0003136571,0.00080406095,0.0011429997,0.0020397215,0.002869739,0.0027800337,0.00222153,0.0042311153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042107156,0.000009460689,0.00011285301,0.000018969104,0.000003835588,0.00002323454,0.000046821326,0.00043964,0.00055986247,0.99079376,0.0021300046,0.0058193444],"study_design_scores_gemma":[0.000009601936,0.000010422723,0.00012960662,0.000013121712,0.0000045673546,0.00007610807,0.000028387181,0.0025255766,0.0012636791,0.98821133,0.007717849,0.000009735349],"about_ca_topic_score_codex":0.0010251553,"about_ca_topic_score_gemma":0.00089868146,"teacher_disagreement_score":0.019729864,"about_ca_system_score_codex":0.0014351262,"about_ca_system_score_gemma":0.0018418598,"threshold_uncertainty_score":0.066002905},"labels":[],"label_agreement":null},{"id":"W1976360479","doi":"10.1142/s1793042109002742","title":"BOUNDED STEP FUNCTIONS AND FACTORIAL RATIO SEQUENCES","year":2009,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Factorial; Bounded function; Quotient; Gravitational singularity; Sequence (biology); Factorial experiment; Square (algebra); Combinatorics; Upper and lower bounds; Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.011967821897041217,"score_gpt":0.26965936899694404,"score_spread":0.25769154709990283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976360479","genre_codex":"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.58764744,0.0013772559,0.368865,0.0006805256,0.0001370548,0.000054091553,0.00017184965,0.00037831615,0.04068854],"genre_scores_gemma":[0.9647191,0.00052024325,0.02810241,0.00012027963,0.00012580279,0.000051972846,0.00013639663,0.00010670077,0.006117151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991867,0.00018929827,0.000041848027,0.00014422507,0.00026511494,0.00017280191],"domain_scores_gemma":[0.9946063,0.0030391703,0.00083531,0.00034151867,0.00058324327,0.00059444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016486878,0.0007787755,0.0006003713,0.0024282339,0.0007761776,0.0020098581,0.0010902378,0.0009192861,0.0070377598],"category_scores_gemma":[0.013107583,0.00028414087,0.000681026,0.0010597738,0.0023159897,0.0030131596,0.0012622001,0.0016303206,0.00095210964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008296095,0.000032564407,0.0012394907,0.00007156456,0.0000111200225,0.00025438907,0.00014400916,0.0067774584,0.0062353085,0.9729469,0.0005791047,0.011625164],"study_design_scores_gemma":[0.000024989045,0.00012704314,0.00142272,0.00005586234,0.000024167399,0.0009663583,0.00015098,0.11332962,0.008441493,0.87196904,0.0034361433,0.000051552248],"about_ca_topic_score_codex":0.0003005728,"about_ca_topic_score_gemma":0.00022955071,"teacher_disagreement_score":0.0070377598,"about_ca_system_score_codex":0.0011230455,"about_ca_system_score_gemma":0.0004296659,"threshold_uncertainty_score":0.023543656},"labels":[],"label_agreement":null},{"id":"W1976832500","doi":"10.3934/amc.2013.7.475","title":"Correlation of binary sequence families derived from the multiplicative characters of finite fields","year":2013,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Multiplicative function; Combinatorics; Sequence (biology); Finite field; Binary number; Bounded function; Pseudorandom binary sequence; Mathematical analysis; Arithmetic","score_opus":0.030275667235170986,"score_gpt":0.29019393864652504,"score_spread":0.25991827141135404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976832500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5086446,0.0020856343,0.4609904,0.0006383379,0.00023777066,0.00012157574,0.00026942173,0.00053358765,0.026478635],"genre_scores_gemma":[0.9342532,0.0008024704,0.05941853,0.00021067857,0.00017224315,0.0001943151,0.00028307107,0.00009245582,0.0045730295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990489,0.00031817873,0.000047031994,0.000145677,0.00027838774,0.00016175107],"domain_scores_gemma":[0.99762934,0.0011258458,0.0004329191,0.00036464902,0.0002484661,0.00019884208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568656,0.0004436306,0.0004667295,0.0010545086,0.0011081715,0.0008194693,0.00054184324,0.00057052827,0.0027814987],"category_scores_gemma":[0.0039422372,0.00036408208,0.0004398863,0.0007929089,0.00093911676,0.002191563,0.0011508606,0.0009984153,0.0004800148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004827048,0.00008910011,0.0025852623,0.00026188578,0.000026757523,0.00058632536,0.0005154939,0.017440101,0.040603578,0.8685876,0.0031779273,0.06564313],"study_design_scores_gemma":[0.00012915999,0.00065586256,0.0033159044,0.00017274369,0.000070344926,0.0038353696,0.00028343356,0.25125238,0.09551289,0.6087876,0.03575669,0.00022765926],"about_ca_topic_score_codex":0.00013273983,"about_ca_topic_score_gemma":0.00015555533,"teacher_disagreement_score":0.0027814987,"about_ca_system_score_codex":0.00082065124,"about_ca_system_score_gemma":0.0006155643,"threshold_uncertainty_score":0.00930506},"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":"W1978031380","doi":"10.1080/10586458.2011.544565","title":"Spot-Based Generations for Meta-Fibonacci Sequences","year":2011,"lang":"en","type":"article","venue":"Experimental Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; IBM (Canada)","funders":"","keywords":"Fibonacci number; Partition (number theory); Sequence (biology); Mathematics; Class (philosophy); Chaotic; Combinatorics; Algorithm; Computer science; Artificial intelligence","score_opus":0.15471344021039327,"score_gpt":0.30160337816468596,"score_spread":0.1468899379542927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978031380","genre_codex":"methods","genre_gemma":"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.0901267,0.00041511017,0.89427984,0.00015985555,0.000085804924,0.00008863088,0.00007104841,0.0003242156,0.014448855],"genre_scores_gemma":[0.6585574,0.00048114796,0.328017,0.00021452148,0.00008458511,0.00020285069,0.00015163778,0.00020128168,0.012089612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971217,0.0000814356,0.000017985558,0.000056489112,0.00010151578,0.000030388705],"domain_scores_gemma":[0.99946314,0.0002456772,0.000070022405,0.00010735125,0.00008251969,0.000031204636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059222855,0.00035822982,0.00028297325,0.00087513746,0.0006547316,0.0005645609,0.00044345236,0.0005641607,0.0031286993],"category_scores_gemma":[0.001806933,0.00021232908,0.000404041,0.0005220255,0.001074254,0.0012234703,0.0006120073,0.00074370217,0.0008006884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008048272,0.000014650983,0.0004373519,0.00007749143,0.0000071659415,0.0001578028,0.00028663262,0.015374693,0.017959889,0.9106696,0.0009663717,0.053967733],"study_design_scores_gemma":[0.00002201393,0.00012723911,0.00042928132,0.000037706264,0.000009650865,0.00054756366,0.0000940937,0.20912941,0.021702647,0.75872386,0.009142944,0.000033605287],"about_ca_topic_score_codex":0.00020738025,"about_ca_topic_score_gemma":0.00031842216,"teacher_disagreement_score":0.0031286993,"about_ca_system_score_codex":0.0005519168,"about_ca_system_score_gemma":0.0002957825,"threshold_uncertainty_score":0.010466576},"labels":[],"label_agreement":null},{"id":"W1978143507","doi":"10.1007/s00200-008-0067-z","title":"Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity","year":2008,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear system; Upper and lower bounds; Bounded function; Mathematics; Class (philosophy); Combinatorics; Algebraic number; Degree (music); Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.00833267848137081,"score_gpt":0.20799081302570027,"score_spread":0.19965813454432946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978143507","genre_codex":"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.21092524,0.0016086907,0.67131466,0.0026480113,0.00043099737,0.00018300224,0.0008233252,0.0012767237,0.110789314],"genre_scores_gemma":[0.8924366,0.00068700523,0.08228227,0.0006761782,0.00025128157,0.0002912586,0.00034331778,0.0002586654,0.022773381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985678,0.00033280032,0.00006608676,0.00021521412,0.0004956247,0.00032239506],"domain_scores_gemma":[0.9976439,0.0010987722,0.00015554801,0.00057192007,0.00029731126,0.0002325321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018060602,0.0011025071,0.001565586,0.0011886876,0.0018171014,0.0027205648,0.0017049796,0.0017946657,0.011432369],"category_scores_gemma":[0.004664073,0.00058571214,0.0007543456,0.001337287,0.0028707557,0.0054094447,0.0054516112,0.0026337225,0.0020067014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021136021,0.000025552776,0.00016334021,0.00006731534,0.000016284737,0.000050222177,0.000067957604,0.009949827,0.004205284,0.9761755,0.002060431,0.0070068054],"study_design_scores_gemma":[0.000043335564,0.0000358689,0.00010193892,0.00003225765,0.0000245906,0.000085230924,0.0000337764,0.11003951,0.0056954105,0.8805395,0.0033327164,0.000035855013],"about_ca_topic_score_codex":0.000725716,"about_ca_topic_score_gemma":0.001064343,"teacher_disagreement_score":0.011432369,"about_ca_system_score_codex":0.0014808521,"about_ca_system_score_gemma":0.0015603631,"threshold_uncertainty_score":0.03824514},"labels":[],"label_agreement":null},{"id":"W1978418793","doi":"10.1016/j.aim.2008.04.001","title":"Poisson statistics via the Chinese Remainder Theorem","year":2008,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Modulo; Chinese remainder theorem; Mathematics; Poisson distribution; Remainder; Compound Poisson distribution; Coprime integers; Combinatorics; Modulo operation; Prime (order theory); Infinity; Primitive root modulo n; Poisson binomial distribution; Polynomial; Discrete mathematics; Compound Poisson process; Arithmetic; Poisson regression; Mathematical analysis; Statistics; Poisson process; Algorithm","score_opus":0.008861752692216352,"score_gpt":0.26104060375079174,"score_spread":0.2521788510585754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978418793","genre_codex":"methods","genre_gemma":"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.11006061,0.0061446438,0.7550121,0.008858735,0.0015816488,0.00010653327,0.0008994693,0.0006965795,0.11663962],"genre_scores_gemma":[0.84762686,0.0056520305,0.078496836,0.0023180032,0.0039664055,0.00031779349,0.0008080135,0.00061789225,0.060196172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974511,0.00092702126,0.00011067151,0.00030395784,0.00088222016,0.00032488976],"domain_scores_gemma":[0.99513215,0.0025999187,0.000479033,0.0007417715,0.0007733215,0.00027375593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042912634,0.001155428,0.0022056282,0.0028840702,0.0015591801,0.0035468608,0.0018576187,0.0016316513,0.006703111],"category_scores_gemma":[0.012185704,0.0007137069,0.0017764745,0.0023015835,0.0040235175,0.0063343276,0.003068442,0.0037951192,0.0021765088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014713027,0.00000521782,0.000094182185,0.000013971977,0.0000061969413,0.000031780713,0.000044925913,0.0014442763,0.00015607534,0.9951675,0.0009322014,0.002089062],"study_design_scores_gemma":[0.000014462157,0.000011239019,0.00012256217,0.0000126777595,0.000007735404,0.00006444606,0.000015239507,0.01996576,0.00026050946,0.9774745,0.0020288273,0.00002210174],"about_ca_topic_score_codex":0.0016131671,"about_ca_topic_score_gemma":0.00089904625,"teacher_disagreement_score":0.006703111,"about_ca_system_score_codex":0.002356865,"about_ca_system_score_gemma":0.0018626498,"threshold_uncertainty_score":0.022694647},"labels":[],"label_agreement":null},{"id":"W1978793076","doi":"10.1016/j.disc.2008.02.024","title":"A trace representation of binary Jacobi sequences","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; TRACE (psycholinguistics); Hadamard transform; Combinatorics; Binary number; Prime (order theory); Representation (politics); Discrete mathematics; Function (biology); Arithmetic; Mathematical analysis","score_opus":0.03788848420678235,"score_gpt":0.278392634844204,"score_spread":0.24050415063742167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978793076","genre_codex":"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.31510684,0.0014256188,0.46979702,0.0035199053,0.0017614303,0.0001469067,0.0005338186,0.0008165637,0.20689194],"genre_scores_gemma":[0.88956326,0.0008739553,0.038368594,0.0007460924,0.0010000516,0.00009816337,0.00035421466,0.0004124312,0.06858326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948585,0.00010296031,0.000028489332,0.000073313444,0.0001944345,0.000114881565],"domain_scores_gemma":[0.99919707,0.00020241081,0.00009679691,0.00014569375,0.00018181038,0.00017620708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073875766,0.00078161556,0.00066791545,0.0016820598,0.0013238713,0.0028856997,0.0011402565,0.0014523919,0.010659328],"category_scores_gemma":[0.002581987,0.00031698975,0.00058196654,0.0014424443,0.0020713776,0.0031790335,0.0016410031,0.002581199,0.0019515742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002221417,0.000016203438,0.000039184895,0.000011042021,0.0000015241002,0.000026529638,0.000093267285,0.0005538572,0.0007414995,0.9930687,0.0006926282,0.004733368],"study_design_scores_gemma":[0.00000933831,0.000026325133,0.000049838978,0.000011568349,0.0000020624532,0.0000597521,0.00003952504,0.008854595,0.00054138387,0.9879382,0.0024555142,0.000011948072],"about_ca_topic_score_codex":0.00079125626,"about_ca_topic_score_gemma":0.00043106737,"teacher_disagreement_score":0.010659328,"about_ca_system_score_codex":0.00095170236,"about_ca_system_score_gemma":0.000843934,"threshold_uncertainty_score":0.035659015},"labels":[],"label_agreement":null},{"id":"W1979595178","doi":"10.1007/s00607-009-0032-0","title":"Discrete logarithms for finite groups","year":2009,"lang":"en","type":"article","venue":"Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete logarithm; Multiset; Mathematics; Generalization; Cryptography; Logarithm; Abelian group; Prime (order theory); Cryptographic primitive; Group (periodic table); Finite group; Discrete mathematics; Cryptographic protocol; Finite field; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Algorithm; Public-key cryptography; Encryption; Mathematical analysis","score_opus":0.016501538301748064,"score_gpt":0.25995526874435926,"score_spread":0.2434537304426112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979595178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.15961404,0.041526772,0.42761725,0.06141252,0.005477074,0.00021816933,0.0017840636,0.0016808592,0.30066922],"genre_scores_gemma":[0.91751724,0.00830023,0.029189263,0.00224796,0.004546776,0.00028963492,0.0007480269,0.00023961732,0.036921237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761176,0.000752348,0.00011481015,0.00037165196,0.00085911126,0.00029032357],"domain_scores_gemma":[0.99465585,0.0034624296,0.00037442482,0.0007786036,0.0003927608,0.0003359493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023485369,0.0012900543,0.0018482165,0.0029377649,0.0026838675,0.0065070433,0.0015891773,0.0017229683,0.0082913],"category_scores_gemma":[0.0097840885,0.0007196097,0.0008575517,0.004504615,0.0065492936,0.011985478,0.003423763,0.008615865,0.0016612784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029275026,0.000015863683,0.00006475392,0.000040652023,0.000004840486,0.000024299285,0.00014465023,0.00067556166,0.000102076054,0.9909729,0.0026318233,0.0052932985],"study_design_scores_gemma":[0.000012497126,0.0000044164512,0.0000314821,0.000011138933,0.00000294173,0.000019061676,0.000018275716,0.001591272,0.000067410605,0.9955786,0.002657453,0.0000054209218],"about_ca_topic_score_codex":0.0016328559,"about_ca_topic_score_gemma":0.0009637259,"teacher_disagreement_score":0.0082913,"about_ca_system_score_codex":0.004719041,"about_ca_system_score_gemma":0.0017941572,"threshold_uncertainty_score":0.034239173},"labels":[],"label_agreement":null},{"id":"W1979827374","doi":"10.1109/82.959871","title":"A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan","funders":"","keywords":"Finite field; Multiplicative inverse; Latency (audio); Division (mathematics); Computer science; Inverse; Multiplicative function; Architecture; Arithmetic; Multiplication (music); Galois theory; Inversion (geology); Finite field arithmetic; Mathematics; Discrete mathematics; Parallel computing; Combinatorics; Telecommunications; Mathematical analysis","score_opus":0.02076734642915752,"score_gpt":0.23861013843088077,"score_spread":0.21784279200172324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979827374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.118746474,0.002196374,0.84206945,0.00076010113,0.00064949575,0.00045013014,0.0003180224,0.010831059,0.0239789],"genre_scores_gemma":[0.5898426,0.0006406674,0.39072755,0.00044219967,0.00019898759,0.0002930048,0.0006330374,0.00013758041,0.01708436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997712,0.000032457097,0.000018504701,0.00003661343,0.000087888686,0.00005341583],"domain_scores_gemma":[0.99971896,0.00006191031,0.00003651249,0.00004583139,0.00011462203,0.000022158765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002195067,0.0006041307,0.00034987627,0.00075309625,0.00065811543,0.00075686944,0.001332522,0.000531722,0.0063498905],"category_scores_gemma":[0.0004612518,0.00025266086,0.00034399965,0.0007804872,0.0003919252,0.0010572426,0.0005437891,0.0006292777,0.0020359773],"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.0010202256,0.00026885027,0.0019736975,0.0006495114,0.00012235003,0.0009065092,0.00034389886,0.013977224,0.36918864,0.030417746,0.02014397,0.5609875],"study_design_scores_gemma":[0.00070553814,0.0048497934,0.0037738367,0.00023006857,0.0005067234,0.004126874,0.00032148752,0.27183276,0.5829558,0.030493615,0.09995313,0.00025027854],"about_ca_topic_score_codex":0.0014202812,"about_ca_topic_score_gemma":0.00268253,"teacher_disagreement_score":0.0063498905,"about_ca_system_score_codex":0.0007178409,"about_ca_system_score_gemma":0.00085846084,"threshold_uncertainty_score":0.0212425},"labels":[],"label_agreement":null},{"id":"W1980470481","doi":"10.1007/s10801-012-0399-4","title":"On the permutation groups of cyclic codes","year":2012,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cyclic permutation; Sylow theorems; Combinatorics; Partial permutation; Permutation (music); Permutation group; Finite field; Bit-reversal permutation; Prime (order theory); Discrete mathematics; BCH code; Permutation graph; Symmetric group; Group (periodic table); Finite group; Algorithm; Decoding methods","score_opus":0.012770590631806958,"score_gpt":0.22774035244815669,"score_spread":0.21496976181634972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980470481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.667528,0.0033225988,0.09575915,0.006280788,0.00093812315,0.00013647937,0.0005091037,0.00024395112,0.22528182],"genre_scores_gemma":[0.9507737,0.0023972495,0.011175102,0.0008320358,0.0012604067,0.00010378347,0.0004510531,0.000115017276,0.03289168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991334,0.00026869963,0.000035829147,0.000097622295,0.00023925892,0.00022510339],"domain_scores_gemma":[0.9974437,0.0013729067,0.00031522362,0.00031724272,0.00025170462,0.0002992877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083910045,0.00090914476,0.00073204556,0.0025503885,0.001647024,0.0026082774,0.0009073128,0.0012672776,0.009046843],"category_scores_gemma":[0.0036428305,0.00046932042,0.00067786383,0.0021459626,0.0038738707,0.004038089,0.0030892352,0.0021233198,0.0011083384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000678619,0.000026640673,0.00028140348,0.00002350491,0.0000052809864,0.00011134728,0.00032256145,0.0021237894,0.0006570762,0.9870725,0.0015006302,0.007807491],"study_design_scores_gemma":[0.0000123839745,0.000016392745,0.00011852994,0.000012794777,0.0000034001896,0.00005050072,0.000060543098,0.0025424582,0.00020967811,0.99443215,0.002532318,0.000008902014],"about_ca_topic_score_codex":0.0014380628,"about_ca_topic_score_gemma":0.0013591128,"teacher_disagreement_score":0.009046843,"about_ca_system_score_codex":0.0011582772,"about_ca_system_score_gemma":0.0010422098,"threshold_uncertainty_score":0.030264735},"labels":[],"label_agreement":null},{"id":"W1980613467","doi":"10.1016/s0893-9659(99)00159-7","title":"New linear codes over GF(8)","year":2000,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Hamming code; Hamming distance; Minimum distance; Dimension (graph theory); Combinatorics; Linear code; Discrete mathematics; GF(2); Finite field; Block code; Algorithm; Decoding methods","score_opus":0.00933888417098147,"score_gpt":0.2142473338696172,"score_spread":0.20490844969863573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980613467","genre_codex":"methods","genre_gemma":"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.31837156,0.012868053,0.478461,0.0133906,0.015759747,0.0005880656,0.0028396358,0.0077119954,0.15000942],"genre_scores_gemma":[0.49630338,0.006128364,0.30749318,0.0033681437,0.0030934263,0.00054455025,0.00486403,0.0011595797,0.17704529],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992046,0.00008900458,0.000053569056,0.00013383971,0.00037679923,0.00014224302],"domain_scores_gemma":[0.99792045,0.000524014,0.00025592526,0.00038693496,0.0005433498,0.00036938672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057729555,0.0006702786,0.00048601744,0.0014938241,0.0010900467,0.0017627665,0.0009574796,0.0010418256,0.009949101],"category_scores_gemma":[0.002586461,0.0005012464,0.0006165175,0.0014026092,0.0010691116,0.0030497392,0.0020282334,0.002058198,0.0037233194],"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.001492393,0.0004664353,0.0027087438,0.0009603793,0.00012787252,0.0017021871,0.00097194046,0.0086308895,0.122227214,0.30253828,0.057897355,0.5002764],"study_design_scores_gemma":[0.0006430649,0.0007892247,0.0036009548,0.00045866222,0.00031139248,0.0076313433,0.00037321777,0.08064282,0.1947571,0.22781017,0.48254123,0.0004408937],"about_ca_topic_score_codex":0.0006759858,"about_ca_topic_score_gemma":0.0020154708,"teacher_disagreement_score":0.009949101,"about_ca_system_score_codex":0.001275509,"about_ca_system_score_gemma":0.0014374405,"threshold_uncertainty_score":0.033282995},"labels":[],"label_agreement":null},{"id":"W1980687521","doi":"10.1016/s0012-365x(01)00292-8","title":"On interleaved sequences over finite fields","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Sequence (biology); Combinatorics; Polynomial; Discrete mathematics; Field (mathematics); Mathematical analysis; Pure mathematics","score_opus":0.025723502834655305,"score_gpt":0.24486290502364497,"score_spread":0.21913940218898967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980687521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.23902552,0.0028181034,0.6722871,0.00233999,0.0007084259,0.00011402956,0.00032552908,0.0005199212,0.081861384],"genre_scores_gemma":[0.90254956,0.004246698,0.055358592,0.0007363317,0.0010106388,0.0001934151,0.0004784765,0.00027508318,0.035151236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810517,0.00055460085,0.00011554813,0.00020236748,0.00065592513,0.00036638565],"domain_scores_gemma":[0.9912952,0.005552389,0.0008971834,0.0012013932,0.00064483297,0.00040894432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020393364,0.0014874133,0.0012288035,0.0033806362,0.001874131,0.0029185142,0.0014398277,0.0017441466,0.0065942276],"category_scores_gemma":[0.00845261,0.0010004943,0.0008234708,0.004893384,0.0040053464,0.009417633,0.0045708064,0.0034980674,0.001037103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079771125,0.000023694793,0.0001529392,0.000034075725,0.0000061473424,0.000100037854,0.00016126972,0.006365516,0.00058538816,0.98390144,0.0006619907,0.007927772],"study_design_scores_gemma":[0.000010934827,0.000022727236,0.000056701414,0.000030456198,0.000007874933,0.00009187867,0.000034679426,0.015462142,0.0007118943,0.9815392,0.0020184675,0.000013125695],"about_ca_topic_score_codex":0.0010210011,"about_ca_topic_score_gemma":0.0008597837,"teacher_disagreement_score":0.0065942276,"about_ca_system_score_codex":0.001868801,"about_ca_system_score_gemma":0.001131538,"threshold_uncertainty_score":0.022059917},"labels":[],"label_agreement":null},{"id":"W1981011717","doi":"10.1016/s0020-0190(00)00103-4","title":"Computing the cycles in the perfect shuffle permutation","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Permutation (music); Computer science; Combinatorics; Theoretical computer science; Mathematics; Parallel computing; Algorithm","score_opus":0.007141469881151602,"score_gpt":0.2216170375375544,"score_spread":0.2144755676564028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981011717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.77669156,0.00079169724,0.18800457,0.0018343707,0.00024306688,0.000107087784,0.0005242822,0.0007379141,0.03106554],"genre_scores_gemma":[0.94572115,0.00035732804,0.04532021,0.00020510281,0.00007341544,0.000041986128,0.0003344508,0.00010634811,0.007839936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996146,0.0001115644,0.000022207796,0.00008001912,0.00007916867,0.000092538045],"domain_scores_gemma":[0.998976,0.00047144305,0.00010291054,0.0002165126,0.00011943297,0.00011368086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004924529,0.0003999241,0.00054103584,0.00082967815,0.0010022159,0.0023721275,0.00056846236,0.00093204214,0.003985829],"category_scores_gemma":[0.0033022827,0.00032625752,0.00037500414,0.000856644,0.0015462781,0.003162249,0.0011209063,0.0008228712,0.0007443946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010759581,0.00014174164,0.003670296,0.00019565101,0.000044283493,0.0002717107,0.000457077,0.09259355,0.011433761,0.71779,0.009132104,0.16319387],"study_design_scores_gemma":[0.000042292522,0.00008343175,0.00035950873,0.000026615497,0.000012304234,0.00006571618,0.00010082868,0.1138485,0.0063116057,0.874741,0.004383461,0.000024722707],"about_ca_topic_score_codex":0.0022746096,"about_ca_topic_score_gemma":0.0038454344,"teacher_disagreement_score":0.003985829,"about_ca_system_score_codex":0.0008444565,"about_ca_system_score_gemma":0.0014478886,"threshold_uncertainty_score":0.013333917},"labels":[],"label_agreement":null},{"id":"W1981209126","doi":"10.1016/j.dam.2006.06.004","title":"Formulas for cube roots in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si710.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scroll; Mathematics; Cube (algebra); Algorithm; Computer science; Database; Combinatorics; Theology","score_opus":0.017826701568944153,"score_gpt":0.23815581394651023,"score_spread":0.22032911237756608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981209126","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.023507213,0.0023322823,0.44447792,0.006057276,0.0020408144,0.00020444076,0.0055326256,0.0021952805,0.5136522],"genre_scores_gemma":[0.47097751,0.0042520184,0.2153534,0.0039523407,0.0014572707,0.00073248363,0.009167048,0.004161559,0.28994632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990522,0.00016701527,0.00007805195,0.00014379024,0.00037833172,0.00018057798],"domain_scores_gemma":[0.9982974,0.0007737216,0.00012171582,0.00018768749,0.00053859595,0.00008085035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126216,0.0009861384,0.0007915247,0.0018319966,0.0016246823,0.0044396035,0.001364939,0.0011771342,0.07799223],"category_scores_gemma":[0.006221976,0.0004811938,0.0010546016,0.0022845424,0.0015646026,0.008311879,0.0021416142,0.003997287,0.02971114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041630272,0.00001992834,0.0001596678,0.000085979045,0.000005552858,0.00011869523,0.0001570445,0.0006174843,0.000431521,0.9317012,0.04154472,0.025116645],"study_design_scores_gemma":[0.00002224711,0.000013599463,0.00016844094,0.00006305076,0.000010607264,0.00024102407,0.0001286352,0.0034989705,0.0014403128,0.94758445,0.04680307,0.00002558003],"about_ca_topic_score_codex":0.002767209,"about_ca_topic_score_gemma":0.0041478546,"teacher_disagreement_score":0.07799223,"about_ca_system_score_codex":0.0023198426,"about_ca_system_score_gemma":0.0013836103,"threshold_uncertainty_score":0.26090997},"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":"W1982654704","doi":"10.1016/j.ins.2014.07.026","title":"A general construction of binary interleaved sequences of period 4N with optimal autocorrelation","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Autocorrelation; Binary number; Autocorrelation technique; Pseudorandom binary sequence; Mathematics; Autocorrelation matrix; Complementary sequences; Period (music); Statistics; Algorithm; Physics; Arithmetic","score_opus":0.01000664072589551,"score_gpt":0.22704436950104015,"score_spread":0.21703772877514463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982654704","genre_codex":"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.09427846,0.0006501661,0.8649419,0.00042047392,0.00019941213,0.00019111368,0.00028086558,0.0005539981,0.038483646],"genre_scores_gemma":[0.5018986,0.00068592787,0.4848027,0.00020942694,0.00011385585,0.00020332959,0.00034803874,0.00015264611,0.011585478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995016,0.00010918573,0.000040096762,0.00008995869,0.00017133234,0.00008782486],"domain_scores_gemma":[0.9994413,0.00014358283,0.00007981122,0.0001948769,0.00007141743,0.00006903175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071111415,0.0007053663,0.0006145622,0.0009779433,0.0008304735,0.0010830082,0.00081278355,0.0009623317,0.0037783307],"category_scores_gemma":[0.0013663762,0.00057212956,0.000547317,0.0011588692,0.00094587356,0.00093744637,0.0013518964,0.0009813593,0.0010263538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028875557,0.00008373059,0.00071004295,0.00028326345,0.00002907358,0.00043356974,0.0002445463,0.017785152,0.07999642,0.8406161,0.0014869809,0.058042344],"study_design_scores_gemma":[0.00018905062,0.0004839744,0.0014883972,0.0002704795,0.000113062204,0.0023633044,0.00012161472,0.27798724,0.13444515,0.5289315,0.053391825,0.00021445913],"about_ca_topic_score_codex":0.0002510661,"about_ca_topic_score_gemma":0.0005273201,"teacher_disagreement_score":0.0037783307,"about_ca_system_score_codex":0.0007267479,"about_ca_system_score_gemma":0.0009802342,"threshold_uncertainty_score":0.012639821},"labels":[],"label_agreement":null},{"id":"W1983388978","doi":"10.1109/tit.2006.872862","title":"On the existence of (9,3,5,240) resilient functions","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Boolean function; Degree (music); Heuristic; Mathematics; Algebraic number; Variable (mathematics); Discrete mathematics; Algebra over a field; Computer science; Theoretical computer science; Mathematical optimization; Pure mathematics","score_opus":0.008200829568955056,"score_gpt":0.19622747674530677,"score_spread":0.1880266471763517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983388978","genre_codex":"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.74945176,0.0005659783,0.20156658,0.0013261866,0.000059507816,0.00010349989,0.00052415667,0.0007294497,0.045672983],"genre_scores_gemma":[0.92465794,0.00029294234,0.07195029,0.00015261146,0.000020443173,0.000097039614,0.00023778595,0.000054738983,0.0025362554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952686,0.00014143765,0.000025201281,0.00007531358,0.00009723324,0.0001338677],"domain_scores_gemma":[0.9978264,0.0016463561,0.00018591247,0.00017831725,0.00008732976,0.00007569677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009819729,0.00071380415,0.0006222412,0.0013268966,0.0013098551,0.0011889272,0.0007385348,0.0013335821,0.0066099367],"category_scores_gemma":[0.0054683257,0.0003990219,0.0009432799,0.001060101,0.0018011112,0.001886787,0.0016819927,0.0016776784,0.00071030675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009027552,0.00014415033,0.001449713,0.0004113422,0.000053617237,0.00092579005,0.00059796614,0.06279209,0.015965672,0.8583142,0.0035275128,0.05491518],"study_design_scores_gemma":[0.00027351207,0.0003884166,0.0012437514,0.00019629914,0.00011600431,0.0023056476,0.00035179532,0.16595767,0.036781248,0.77750415,0.014744924,0.00013653208],"about_ca_topic_score_codex":0.00028721587,"about_ca_topic_score_gemma":0.00027586555,"teacher_disagreement_score":0.0066099367,"about_ca_system_score_codex":0.00078640593,"about_ca_system_score_gemma":0.00054636446,"threshold_uncertainty_score":0.022112489},"labels":[],"label_agreement":null},{"id":"W1983551238","doi":"10.1007/s00200-007-0044-y","title":"The trace spectra of polynomial bases for $${\\mathbb{F}}_{2^{n}}$$","year":2007,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"TRACE (psycholinguistics); Polynomial; Mathematics; Combinatorics; Basis (linear algebra); Spectral line; Physics; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.0068226015167159254,"score_gpt":0.2261474540274668,"score_spread":0.21932485251075087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983551238","genre_codex":"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.5575421,0.00076563936,0.25559196,0.0037422462,0.0010450488,0.0001594755,0.00078435644,0.0008400647,0.17952912],"genre_scores_gemma":[0.93883383,0.00044773234,0.017564358,0.00056586845,0.0004623323,0.00012340606,0.00041769832,0.0004970922,0.04108767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990677,0.00018381167,0.00003492418,0.00014076015,0.0002996341,0.00027322772],"domain_scores_gemma":[0.9989427,0.00032169747,0.00013418263,0.00013178572,0.00020635202,0.0002632852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011357631,0.001120365,0.0008758231,0.002545122,0.0026182726,0.004572846,0.0019443118,0.0018384937,0.017424645],"category_scores_gemma":[0.0035197625,0.0005044261,0.0008043825,0.0013743686,0.0033942275,0.0049983556,0.0020707215,0.0031325999,0.0026162772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000418919,0.000027097789,0.000047582824,0.000009543449,0.0000024887977,0.000030274774,0.000112289476,0.00035423925,0.0010085497,0.9948953,0.0007563254,0.002714467],"study_design_scores_gemma":[0.000015309275,0.000015153037,0.00010460573,0.0000112032385,0.0000027718963,0.00007523123,0.00008146143,0.0050652553,0.0010048515,0.99223655,0.0013676345,0.000020084317],"about_ca_topic_score_codex":0.0013734186,"about_ca_topic_score_gemma":0.0011590901,"teacher_disagreement_score":0.017424645,"about_ca_system_score_codex":0.0016365772,"about_ca_system_score_gemma":0.0014247334,"threshold_uncertainty_score":0.058291256},"labels":[],"label_agreement":null},{"id":"W1983671061","doi":"10.1109/vetecf.2011.6092944","title":"Adaptive Reed-Solomon Coding in Eigen-MIMO with Non-Adaptive Modulation","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Link adaptation; Computer science; Codec; MIMO; Coding (social sciences); Adaptive coding; Decoding methods; Encoder; Coding gain; Spectral efficiency; Code rate; Algorithm; Quadrature amplitude modulation; Precoding; Electronic engineering; Bit error rate; Telecommunications; Channel (broadcasting); Mathematics; Fading; Data compression; Engineering; Statistics","score_opus":0.03460450987460366,"score_gpt":0.21335931859778726,"score_spread":0.1787548087231836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983671061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.11890727,0.0009988719,0.871643,0.00027412095,0.00008239439,0.0000692017,0.000051596508,0.00047639696,0.007497017],"genre_scores_gemma":[0.7866458,0.0005647969,0.20736997,0.00014487158,0.00006588203,0.000086988744,0.00006842257,0.00003886009,0.00501424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955505,0.00017833665,0.000016248974,0.000038555092,0.00013404535,0.000077723016],"domain_scores_gemma":[0.9995196,0.00021210051,0.000063253705,0.000081784194,0.00010573169,0.000017525981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025106,0.00034492635,0.00030024917,0.00031740285,0.00030688432,0.00040383212,0.000488287,0.00033628946,0.0006907765],"category_scores_gemma":[0.0009181691,0.00015696844,0.00022916449,0.00041973693,0.00070514844,0.00046004294,0.00055763527,0.00038391072,0.00028142432],"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.0007281409,0.00013055438,0.001955272,0.00026744418,0.00007352825,0.0011173432,0.0006360571,0.24828076,0.2511692,0.23652738,0.0027140828,0.25640023],"study_design_scores_gemma":[0.000042869247,0.0003075177,0.00086903124,0.00004281731,0.000031397954,0.00070421846,0.00005379126,0.8779464,0.07960218,0.03327077,0.0070704757,0.00005848717],"about_ca_topic_score_codex":0.0006519222,"about_ca_topic_score_gemma":0.0012796005,"teacher_disagreement_score":0.0006907765,"about_ca_system_score_codex":0.0003222002,"about_ca_system_score_gemma":0.00038974613,"threshold_uncertainty_score":0.0026575923},"labels":[],"label_agreement":null},{"id":"W1984035421","doi":"10.4153/cmb-2011-160-x","title":"Maximal Sets of Pairwise Orthogonal Vectors in Finite Fields","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Cardinality (data modeling); Pairwise comparison; Bilinear form; Combinatorics; Integer (computer science); Field (mathematics); Degenerate energy levels; Discrete mathematics; Pure mathematics; Statistics","score_opus":0.024997099397091393,"score_gpt":0.20283217604733456,"score_spread":0.17783507665024317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984035421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.962005,0.00031456948,0.02720449,0.00037699155,0.000029350347,0.000028617944,0.000670135,0.00007027272,0.009300469],"genre_scores_gemma":[0.9896147,0.00012812256,0.008571689,0.00003948683,0.000042279036,0.000049825714,0.00062252395,0.000014924482,0.00091643253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812585,0.0006026487,0.00018897181,0.00030431375,0.00044446063,0.0003338703],"domain_scores_gemma":[0.99243575,0.0047750254,0.0011527033,0.00051587855,0.00036883968,0.00075172505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019370366,0.00051215827,0.0009572123,0.0017990813,0.0019501537,0.0027572475,0.0009554469,0.0006536,0.0020793343],"category_scores_gemma":[0.0064278496,0.0007350375,0.0006532522,0.0009250014,0.002590155,0.0034413957,0.0025598807,0.0007951467,0.00021373955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017000488,0.0001733527,0.013771139,0.00044073816,0.00013377354,0.0007761206,0.0011296872,0.024193488,0.024760842,0.9135118,0.0018747305,0.017534215],"study_design_scores_gemma":[0.0001673068,0.00015997766,0.0043144035,0.00020135164,0.00006320783,0.0010649587,0.0009888494,0.03720914,0.024757419,0.92633384,0.004646115,0.00009332687],"about_ca_topic_score_codex":0.00033464018,"about_ca_topic_score_gemma":0.00030915253,"teacher_disagreement_score":0.0027572475,"about_ca_system_score_codex":0.00095293275,"about_ca_system_score_gemma":0.0007382899,"threshold_uncertainty_score":0.010244131},"labels":[],"label_agreement":null},{"id":"W1984081854","doi":"10.1017/s0963548311000101","title":"Lower Bounds for the Cop Number when the Robber is Fast","year":2011,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.04472043208422285,"score_gpt":0.24861083978108775,"score_spread":0.2038904076968649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984081854","genre_codex":"methods","genre_gemma":"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.2608509,0.005160426,0.48318118,0.007776014,0.00087573647,0.00035063832,0.0018303806,0.0016914787,0.23828319],"genre_scores_gemma":[0.89854944,0.0036173244,0.070498355,0.0010885692,0.0009057146,0.0006448266,0.0014083597,0.0011060955,0.022181382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961628,0.00062067725,0.00012980818,0.000981848,0.00072649214,0.0013783991],"domain_scores_gemma":[0.97704005,0.015682511,0.0014767761,0.0028380547,0.0009838585,0.001978804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443523,0.0021211335,0.0024451877,0.0029136243,0.0030591849,0.0055467417,0.005011554,0.002857913,0.017952215],"category_scores_gemma":[0.024161996,0.0012406205,0.0024257738,0.002374635,0.0052243047,0.015304529,0.004667162,0.006976787,0.0028363694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014164025,0.0004286306,0.0046014986,0.00070488645,0.0002115692,0.00092904334,0.00059071305,0.14718641,0.010998516,0.7621681,0.028071217,0.042692993],"study_design_scores_gemma":[0.00010599472,0.0001981281,0.0014312755,0.00016155609,0.00011935187,0.0007017583,0.00018509977,0.35485893,0.009537738,0.6201557,0.012404504,0.00013998685],"about_ca_topic_score_codex":0.0024170028,"about_ca_topic_score_gemma":0.0025889925,"teacher_disagreement_score":0.017952215,"about_ca_system_score_codex":0.0040121656,"about_ca_system_score_gemma":0.0016528717,"threshold_uncertainty_score":0.06005609},"labels":[],"label_agreement":null},{"id":"W1984205450","doi":"10.1109/isit.2007.4557331","title":"Some Open Problems on Quasi-Twisted and Related Code Constructions and Good Quaternary Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Construct (python library); Block code; Computer science; Linear code; Coding (social sciences); Code (set theory); Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; Programming language; Decoding methods; Set (abstract data type)","score_opus":0.020540217363204688,"score_gpt":0.26136904937987865,"score_spread":0.24082883201667396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984205450","genre_codex":"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.14743538,0.053132083,0.6543148,0.018978646,0.0021992256,0.00014242197,0.00076710497,0.00044581995,0.12258448],"genre_scores_gemma":[0.75219107,0.04622177,0.15765525,0.0046089343,0.0062168688,0.00031071584,0.0010048302,0.00040344556,0.031387113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985905,0.0004788815,0.000096935044,0.00026860257,0.0003604979,0.00020465469],"domain_scores_gemma":[0.996494,0.0021700822,0.00033649473,0.00043260606,0.0003969095,0.00016990291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002223225,0.0007577589,0.00088306016,0.0014337635,0.0020081438,0.002649001,0.0011126492,0.002148018,0.0054816813],"category_scores_gemma":[0.0059687984,0.00059661706,0.0011147589,0.0021834716,0.0046245465,0.009474022,0.0024594516,0.0046976097,0.0012621821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023266359,0.000018113655,0.00020048853,0.0001506639,0.000007827584,0.00009169479,0.00026034223,0.002623018,0.00068359735,0.9815414,0.0022747584,0.012124774],"study_design_scores_gemma":[0.0000068321565,0.000026429901,0.00012020273,0.000053094966,0.000007429105,0.00027108315,0.00011032305,0.0038744858,0.0006204557,0.9835892,0.011295428,0.000025132096],"about_ca_topic_score_codex":0.00071335025,"about_ca_topic_score_gemma":0.00042599768,"teacher_disagreement_score":0.0054816813,"about_ca_system_score_codex":0.0015467184,"about_ca_system_score_gemma":0.00085401273,"threshold_uncertainty_score":0.018338084},"labels":[],"label_agreement":null},{"id":"W1984848208","doi":"10.1007/s00022-010-0041-3","title":"On the non-existence of a projective (75, 4,12, 5) set in PG(3, 7)","year":2010,"lang":"en","type":"article","venue":"Journal of Geometry","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Projective test; Automorphism group; Set (abstract data type); Combinatorics; Existential quantification; Automorphism; Coding (social sciences); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.013771281312936295,"score_gpt":0.2497187881563516,"score_spread":0.2359475068434153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984848208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.87356836,0.00042873522,0.035241146,0.0077444324,0.00028870162,0.000052475334,0.00053360726,0.0003136646,0.08182897],"genre_scores_gemma":[0.98850095,0.0001275305,0.007678116,0.00028484745,0.000105439016,0.00003853213,0.00027754405,0.00004665719,0.0029404582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981494,0.00040210396,0.0001254608,0.00037297417,0.00042614125,0.00052408874],"domain_scores_gemma":[0.98281616,0.012266913,0.0013932796,0.0011780679,0.000728374,0.0016171994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023086942,0.0005462148,0.0015797473,0.0020893696,0.0074300217,0.0054536825,0.002698212,0.0031012474,0.009964072],"category_scores_gemma":[0.012192777,0.0012719404,0.0009776647,0.001664952,0.007242906,0.007421397,0.0069206697,0.004415778,0.0008491805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045553604,0.000039527924,0.002151364,0.00007875481,0.00003132097,0.0007023093,0.00085757865,0.0031754812,0.0015113542,0.9838891,0.002865929,0.0042417245],"study_design_scores_gemma":[0.00014301995,0.000094954354,0.0018254009,0.000076963064,0.00005331396,0.0007858877,0.00086052663,0.015431793,0.0027041414,0.9745222,0.0034087175,0.000093107825],"about_ca_topic_score_codex":0.0013456156,"about_ca_topic_score_gemma":0.0016885761,"teacher_disagreement_score":0.009964072,"about_ca_system_score_codex":0.001777366,"about_ca_system_score_gemma":0.0012948902,"threshold_uncertainty_score":0.033333182},"labels":[],"label_agreement":null},{"id":"W1985536357","doi":"10.1016/s0012-365x(00)00026-1","title":"Cyclic inequivalence of cascaded GMW-sequences","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Autocorrelation; Finite field; Discrete mathematics; Combinatorics; Integer (computer science); Statistics","score_opus":0.015459221939473657,"score_gpt":0.24904263574729807,"score_spread":0.2335834138078244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985536357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.81878406,0.00034970028,0.08412652,0.00057181454,0.00018579049,0.000066995206,0.00022394823,0.00019480074,0.095496364],"genre_scores_gemma":[0.97438204,0.00019829448,0.011399883,0.00020514723,0.00014602854,0.000064984495,0.00021303128,0.00005592086,0.013334769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935,0.0001218695,0.000034299126,0.00011676054,0.00019611155,0.00018098061],"domain_scores_gemma":[0.9985501,0.0006032641,0.00020675661,0.00021867693,0.00021472135,0.0002063697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354558,0.00041225168,0.00038106297,0.0014003842,0.0009215109,0.0013074677,0.0008141435,0.0010182463,0.009408758],"category_scores_gemma":[0.0024998588,0.00029940304,0.00038338074,0.0008459497,0.0011523734,0.0019770495,0.0013909129,0.0014919704,0.00075507164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107309526,0.00003400493,0.00033097,0.000024366418,0.0000051971056,0.00015229506,0.0001412233,0.0017731827,0.006621484,0.9794819,0.0007120226,0.010616094],"study_design_scores_gemma":[0.00003449976,0.00011560596,0.0011163519,0.000025618589,0.000012133398,0.00039278052,0.00010064117,0.02755195,0.0061516226,0.9605347,0.003933897,0.000030216715],"about_ca_topic_score_codex":0.00038547776,"about_ca_topic_score_gemma":0.00047182536,"teacher_disagreement_score":0.009408758,"about_ca_system_score_codex":0.0007897425,"about_ca_system_score_gemma":0.0004191983,"threshold_uncertainty_score":0.031475484},"labels":[],"label_agreement":null},{"id":"W1985780997","doi":"10.1007/s12095-015-0131-z","title":"Linear complexity profile and correlation measure of interleaved sequences","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Measure (data warehouse); Correlation; Linear correlation; Distance correlation; Statistics; Mathematics; Computer science; Data mining; Geometry","score_opus":0.09925557996039795,"score_gpt":0.2913021286730739,"score_spread":0.19204654871267596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985780997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4903485,0.0005585809,0.49667457,0.00049428234,0.000046946003,0.00006979282,0.00045161846,0.00028064448,0.01107494],"genre_scores_gemma":[0.9797187,0.00036756755,0.015990516,0.00008788022,0.0000822106,0.0000758127,0.0004219672,0.00007009789,0.0031852731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984566,0.000416013,0.00006304312,0.00025422542,0.0005531172,0.00025702623],"domain_scores_gemma":[0.98197305,0.010880536,0.002585638,0.0013535784,0.0022251543,0.0009819574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016557871,0.00067335926,0.0005854487,0.0026726972,0.00068572134,0.0019410731,0.00141002,0.0010593467,0.0027169408],"category_scores_gemma":[0.015538168,0.00051213556,0.0004222349,0.0021767209,0.0018208268,0.0033432883,0.0013242157,0.001408733,0.000512005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065101066,0.00022381138,0.0100262705,0.00017066763,0.00009257401,0.0007314207,0.00056887773,0.18036641,0.029872686,0.74458563,0.0017425071,0.030968247],"study_design_scores_gemma":[0.000021015434,0.00015466806,0.0044146255,0.00004700373,0.000031303978,0.0005663888,0.000118939686,0.800738,0.0088498,0.18414605,0.0008227252,0.00008949008],"about_ca_topic_score_codex":0.0010191983,"about_ca_topic_score_gemma":0.00078375125,"teacher_disagreement_score":0.0027169408,"about_ca_system_score_codex":0.0017913032,"about_ca_system_score_gemma":0.0015391485,"threshold_uncertainty_score":0.012996852},"labels":[],"label_agreement":null},{"id":"W1986190964","doi":"10.1145/2790282.2790287","title":"Optimizing and parallelizing the modular GCD algorithm","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Computer science; Computation; Parallel computing; Modular arithmetic; Algorithm; Polynomial; Theoretical computer science; Mathematics; Programming language","score_opus":0.028347683229368564,"score_gpt":0.2328361945423773,"score_spread":0.20448851131300874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986190964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.09627495,0.00040057962,0.8890462,0.00028027213,0.00013649762,0.00018342101,0.00009588799,0.0050755185,0.008506601],"genre_scores_gemma":[0.33214754,0.00022068263,0.66369605,0.00008466381,0.000076114666,0.00012418903,0.00023946489,0.0003407253,0.0030705514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999012,0.00018366371,0.00007522003,0.00021616615,0.00031348766,0.00019946852],"domain_scores_gemma":[0.99882454,0.00028962587,0.00010519487,0.00031835338,0.00039569766,0.00006663497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010479544,0.00088315946,0.0008186716,0.0008964681,0.0007036485,0.0011582125,0.0012892804,0.00046380408,0.0040446455],"category_scores_gemma":[0.0038163734,0.00027319972,0.0004554935,0.0015369516,0.0006430035,0.0018824771,0.0012129061,0.0006375041,0.001664517],"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.00089893665,0.00023742896,0.006545606,0.00036866454,0.00008775042,0.00034463115,0.00025481157,0.21682672,0.07555075,0.05425967,0.012215834,0.6324093],"study_design_scores_gemma":[0.00016039742,0.00020392235,0.0007414177,0.000025656442,0.000048917376,0.00019061094,0.00007328871,0.90243363,0.05647489,0.029761456,0.00985672,0.00002914718],"about_ca_topic_score_codex":0.0021103825,"about_ca_topic_score_gemma":0.0033833862,"teacher_disagreement_score":0.0040446455,"about_ca_system_score_codex":0.0010426303,"about_ca_system_score_gemma":0.0020111746,"threshold_uncertainty_score":0.013530731},"labels":[],"label_agreement":null},{"id":"W1986692294","doi":"10.1016/s0012-365x(02)00570-8","title":"Construction of new extremal self-dual codes","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.017297621776683324,"score_gpt":0.2378547598035444,"score_spread":0.22055713802686108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986692294","genre_codex":"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.58678293,0.0007367268,0.30532536,0.0015088439,0.0010727985,0.00021283903,0.00033178108,0.00080086803,0.103227854],"genre_scores_gemma":[0.85762817,0.00046124408,0.11217017,0.0005295479,0.00027200984,0.0001784141,0.0003690975,0.00029210272,0.028099176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948883,0.00011823488,0.00002881801,0.000084249616,0.00017907466,0.00010073133],"domain_scores_gemma":[0.9990515,0.00022099006,0.00010456058,0.0002158027,0.00017742273,0.00022963031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055764004,0.00047433766,0.00061838736,0.0019010955,0.0011939916,0.0016882377,0.00082646555,0.0010478726,0.004340329],"category_scores_gemma":[0.0017766434,0.0005061786,0.00068909815,0.00071667414,0.0012885727,0.0015434567,0.0026554517,0.001997895,0.0009641144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009125072,0.000047838206,0.00031677904,0.00005509616,0.000013395468,0.0001621935,0.0001694833,0.0016737247,0.0065429998,0.97565484,0.0012962851,0.013976074],"study_design_scores_gemma":[0.00010218387,0.00011393413,0.00044258492,0.000053163018,0.000036590467,0.0010226216,0.00013429268,0.035368618,0.016351689,0.9311912,0.015116432,0.00006679555],"about_ca_topic_score_codex":0.0000824124,"about_ca_topic_score_gemma":0.00014184244,"teacher_disagreement_score":0.004340329,"about_ca_system_score_codex":0.00054855295,"about_ca_system_score_gemma":0.0004709501,"threshold_uncertainty_score":0.014519811},"labels":[],"label_agreement":null},{"id":"W1987347588","doi":"10.1002/rsa.20494","title":"The solution space geometry of random linear equations","year":2013,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; National Science Foundation","keywords":"Sequence (biology); Mathematics; Sigma; Space (punctuation); Random variable; Parity (physics); Omega; Combinatorics; Cluster analysis; Discrete mathematics; Physics; Computer science; Quantum mechanics; Statistics","score_opus":0.01376655750895992,"score_gpt":0.24812262774930283,"score_spread":0.2343560702403429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987347588","genre_codex":"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.7987181,0.00073788466,0.18348597,0.001968184,0.000061383435,0.00012350344,0.00030983717,0.00022795383,0.014367124],"genre_scores_gemma":[0.9865955,0.00022384236,0.01034458,0.00012885225,0.000055847515,0.00007545208,0.0001768911,0.00002552325,0.0023734968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986663,0.00052149803,0.000055448916,0.0001924388,0.0003296169,0.00023466541],"domain_scores_gemma":[0.9959615,0.0022057227,0.00064231374,0.0003378425,0.0004858318,0.00036684435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012103728,0.0003238212,0.00077831437,0.0016070672,0.0010826116,0.0016545091,0.0009156583,0.0010196927,0.003623904],"category_scores_gemma":[0.008470372,0.00039055845,0.0005326492,0.00087356166,0.002513066,0.002523399,0.0017437795,0.001246299,0.0004046749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008147239,0.000020545256,0.00081163005,0.00005332913,0.000018963314,0.00011238333,0.00022965521,0.03597692,0.0016283223,0.9554639,0.000901361,0.0047014304],"study_design_scores_gemma":[0.000062647465,0.00006296859,0.0005936094,0.000022141858,0.000012209241,0.00012731776,0.0001089822,0.2872696,0.0015986054,0.70831466,0.0017950436,0.00003213803],"about_ca_topic_score_codex":0.0012739816,"about_ca_topic_score_gemma":0.0005095216,"teacher_disagreement_score":0.003623904,"about_ca_system_score_codex":0.0015107638,"about_ca_system_score_gemma":0.000628784,"threshold_uncertainty_score":0.0121231675},"labels":[],"label_agreement":null},{"id":"W1987443014","doi":"10.1007/s00026-011-0075-8","title":"2-Cell Embeddings with Prescribed Face Lengths and Genus","year":2010,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Graph; Embedding; Euler characteristic; Sequence (biology); Genus; Degree (music); Discrete mathematics; Physics","score_opus":0.014079248861447784,"score_gpt":0.2432337552056802,"score_spread":0.2291545063442324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987443014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.73753643,0.0006590713,0.115365006,0.0015512902,0.0004873569,0.000097009106,0.0005914958,0.0008094001,0.14290287],"genre_scores_gemma":[0.9280964,0.0006459127,0.029531695,0.00039255552,0.00019905597,0.00015548307,0.0004293094,0.00041436966,0.04013511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994425,0.00012029862,0.000033016404,0.000084366075,0.00015636018,0.00016348287],"domain_scores_gemma":[0.9987293,0.00046433593,0.00016964022,0.00025536394,0.00015954107,0.00022185028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042158918,0.0009877064,0.0008027656,0.0015106839,0.0016081126,0.0029193887,0.0011484387,0.0019268106,0.009795061],"category_scores_gemma":[0.0023390162,0.00073510193,0.0006212824,0.0010108651,0.002151464,0.004205188,0.0034607847,0.002470005,0.0023859276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021007165,0.00006998539,0.00082134764,0.00007357841,0.000012634362,0.00030808526,0.00053698395,0.0046737073,0.0064761047,0.9661423,0.0032026898,0.017472448],"study_design_scores_gemma":[0.000041587216,0.000052685402,0.00054552284,0.00003363977,0.000019003282,0.0002935598,0.0003179082,0.015943166,0.0038995566,0.97139806,0.007424096,0.000031208045],"about_ca_topic_score_codex":0.00051469484,"about_ca_topic_score_gemma":0.0008635613,"teacher_disagreement_score":0.009795061,"about_ca_system_score_codex":0.0008742178,"about_ca_system_score_gemma":0.00034842416,"threshold_uncertainty_score":0.032767773},"labels":[],"label_agreement":null},{"id":"W1988825410","doi":"10.1155/2013/625912","title":"On Maximum Lee Distance Codes","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Singleton; Algorithm; Combinatorics; Computer science; Mathematics","score_opus":0.011713277315717037,"score_gpt":0.23453029728225067,"score_spread":0.22281701996653364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988825410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.33166236,0.009823844,0.49605498,0.0022835112,0.0004575504,0.000105869556,0.0011933809,0.00074041315,0.15767808],"genre_scores_gemma":[0.9404122,0.0030357523,0.037992887,0.00048644212,0.0003654708,0.00014134945,0.00082316453,0.00016008713,0.016582567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980318,0.000403666,0.00011455853,0.00032023384,0.0006363929,0.0004933747],"domain_scores_gemma":[0.9902864,0.0059410604,0.00087685103,0.0012631064,0.0010143123,0.00061828643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017772382,0.0010269387,0.0010533193,0.0025443085,0.0012853874,0.0021745027,0.0017817612,0.0012507865,0.006367875],"category_scores_gemma":[0.01179764,0.00048626537,0.0007221496,0.0024215288,0.002354972,0.004467358,0.0034229464,0.0028277738,0.0017524743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057729986,0.000085696,0.0019019953,0.00046479006,0.00005658378,0.00043248458,0.00055190746,0.055927385,0.010968884,0.8710699,0.005965593,0.051997535],"study_design_scores_gemma":[0.00003558478,0.00019653911,0.0012650274,0.00017887277,0.00003707017,0.0007103653,0.0003078056,0.11575183,0.010697413,0.86160177,0.009097771,0.000119899065],"about_ca_topic_score_codex":0.000888534,"about_ca_topic_score_gemma":0.0014584549,"teacher_disagreement_score":0.006367875,"about_ca_system_score_codex":0.0019164545,"about_ca_system_score_gemma":0.0008888202,"threshold_uncertainty_score":0.02130264},"labels":[],"label_agreement":null},{"id":"W1989168989","doi":"10.1109/tit.2015.2389248","title":"On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences","keywords":"Code (set theory); Computer science; Algorithm; Programming language; Set (abstract data type)","score_opus":0.023123655678070294,"score_gpt":0.2397847676655345,"score_spread":0.2166611119874642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989168989","genre_codex":"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.6781539,0.001849826,0.24195741,0.0045136153,0.0003401668,0.00018512456,0.0014046703,0.0012141014,0.07038126],"genre_scores_gemma":[0.9523506,0.0010854702,0.026898758,0.0007670233,0.00048546508,0.00030055633,0.0013874713,0.00041124082,0.016313428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962463,0.0012961437,0.00015006973,0.00068686716,0.0007798047,0.00084080995],"domain_scores_gemma":[0.9538053,0.034567524,0.0028497516,0.0024244601,0.0031190699,0.0032339236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002810582,0.0012505386,0.0016831518,0.002896767,0.0027243567,0.0040990086,0.0019067308,0.0020213558,0.007745349],"category_scores_gemma":[0.045639705,0.0009809182,0.0011015707,0.0015606395,0.0056538144,0.0045291027,0.0054389373,0.003816658,0.0020264825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058671663,0.00012098799,0.0036772,0.00024343823,0.000052306754,0.000259088,0.0010968599,0.03021819,0.003100388,0.9300532,0.010349057,0.020242667],"study_design_scores_gemma":[0.00012497617,0.00016273142,0.0012700172,0.000115862735,0.00002634849,0.00036014253,0.00034100746,0.1099339,0.0016636655,0.8811684,0.004745493,0.00008739909],"about_ca_topic_score_codex":0.0030936867,"about_ca_topic_score_gemma":0.0021155565,"teacher_disagreement_score":0.007745349,"about_ca_system_score_codex":0.0030591383,"about_ca_system_score_gemma":0.0022447628,"threshold_uncertainty_score":0.025910795},"labels":[],"label_agreement":null},{"id":"W1989290453","doi":"10.1016/j.tcs.2010.12.012","title":"Optimization techniques for small matrix multiplication","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Mitacs; Canada Research Chairs","keywords":"Strassen algorithm; Matrix multiplication; Multiplication (music); Mathematics; Multiplication algorithm; Matrix (chemical analysis); Base (topology); Arithmetic; Algebra over a field; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.009235530333444139,"score_gpt":0.2618025722920485,"score_spread":0.25256704195860435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989290453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.005896274,0.00093953504,0.98095316,0.00049633783,0.0001587598,0.00004938646,0.00006252024,0.00032347394,0.011120595],"genre_scores_gemma":[0.26264197,0.0024603468,0.69786227,0.0005743762,0.0007639745,0.00052373717,0.00027728648,0.00083928026,0.034056805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990872,0.00030482074,0.000040446146,0.000105146806,0.00038076547,0.00008158744],"domain_scores_gemma":[0.99856156,0.0009117755,0.000103562386,0.00022373229,0.00014826,0.00005121637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085867266,0.0012249226,0.0009523433,0.0010297569,0.0006555976,0.0010089716,0.0012262751,0.00075023103,0.008909682],"category_scores_gemma":[0.004743511,0.00058087375,0.00068778265,0.0017722186,0.0012358503,0.002257002,0.00158764,0.0023949735,0.0023875001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030897264,0.00014202436,0.0002914512,0.00035410613,0.0000660059,0.00009345764,0.00017278768,0.10730152,0.0142612,0.56323624,0.016830936,0.29694128],"study_design_scores_gemma":[0.000066748245,0.00008954222,0.00020417309,0.000045047207,0.000029922205,0.0001077869,0.000026214131,0.49998432,0.0055906605,0.48130825,0.012518545,0.000028719838],"about_ca_topic_score_codex":0.00081823335,"about_ca_topic_score_gemma":0.001536024,"teacher_disagreement_score":0.008909682,"about_ca_system_score_codex":0.000771298,"about_ca_system_score_gemma":0.0007372943,"threshold_uncertainty_score":0.029805839},"labels":[],"label_agreement":null},{"id":"W1989463939","doi":"10.1109/itwitwn.2007.4318052","title":"Correlation of Multiple Bent Function Signal Sets","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bent molecular geometry; Hadamard transform; Function (biology); SIGNAL (programming language); Correlation function (quantum field theory); Bent function; Mathematics; Set (abstract data type); Correlation; TRACE (psycholinguistics); Mathematical analysis; Algorithm; Computer science; Geometry; Boolean function; Statistics; Spectral density; Engineering","score_opus":0.012738735259974517,"score_gpt":0.22265554441439867,"score_spread":0.20991680915442415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989463939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.39601013,0.00023808121,0.5891778,0.00016148387,0.0000764564,0.000044237677,0.00010722793,0.0004498421,0.013734657],"genre_scores_gemma":[0.89512753,0.0001469616,0.098776415,0.00008112531,0.000055100143,0.000059784757,0.00017980888,0.00010976977,0.0054636565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.00025563914,0.00006004868,0.00022121234,0.00038859498,0.00016864935],"domain_scores_gemma":[0.99799156,0.0007053825,0.00029123516,0.00049713254,0.00034608424,0.00016863292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007042905,0.00053920614,0.0006492006,0.0014009385,0.00073936896,0.0014399388,0.0006463083,0.00054466655,0.0025114515],"category_scores_gemma":[0.002369059,0.00044686155,0.0007036837,0.0009655222,0.0011706003,0.0013827131,0.0016013935,0.0010656173,0.000555651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077966327,0.000090509,0.001897418,0.00014594526,0.00006343083,0.0008607249,0.0003598435,0.021143693,0.21037985,0.7075143,0.0009931719,0.055771437],"study_design_scores_gemma":[0.00008444806,0.0007255243,0.0037663544,0.000066040746,0.00010824851,0.0024754559,0.00022575972,0.29219383,0.35843605,0.3298021,0.011940915,0.00017525315],"about_ca_topic_score_codex":0.00011932906,"about_ca_topic_score_gemma":0.00014425367,"teacher_disagreement_score":0.0025114515,"about_ca_system_score_codex":0.00054848706,"about_ca_system_score_gemma":0.00044341857,"threshold_uncertainty_score":0.008401632},"labels":[],"label_agreement":null},{"id":"W1990421674","doi":"10.1016/j.disc.2013.03.024","title":"Non-uniqueness of minimal superpermutations","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Guelph","keywords":"Uniqueness; Mathematics; Substring; Combinatorics; String (physics); Discrete mathematics; Computer science; Data structure; Mathematical analysis","score_opus":0.022879062862262132,"score_gpt":0.25911542624361955,"score_spread":0.23623636338135742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990421674","genre_codex":"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.71098006,0.0007019694,0.22101349,0.002755478,0.00037710217,0.0000831242,0.00043514936,0.0006207901,0.06303287],"genre_scores_gemma":[0.9677022,0.0002114587,0.021342797,0.0005457496,0.00020563784,0.00007950586,0.00029619955,0.0002829182,0.009333471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972428,0.00073865877,0.00019123981,0.0005673432,0.0006874775,0.00057240424],"domain_scores_gemma":[0.9806553,0.012187998,0.001095392,0.0031100593,0.0017699962,0.0011811588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027062704,0.00062394823,0.0015790835,0.0017809193,0.0035384358,0.003658188,0.002473336,0.0026416767,0.008507545],"category_scores_gemma":[0.02172511,0.0010335511,0.0016330633,0.0014380072,0.0047622253,0.00858853,0.0055731796,0.0052280333,0.0010726051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013646745,0.000035927293,0.000518038,0.00005856197,0.000016587812,0.0001634054,0.00024334175,0.0013878974,0.0015859947,0.99025667,0.001065965,0.004531252],"study_design_scores_gemma":[0.000012012738,0.000011956711,0.00010994558,0.00000912089,0.00000803848,0.00011684464,0.0000644805,0.00415965,0.00095516816,0.99407554,0.0004675241,0.000009693974],"about_ca_topic_score_codex":0.0003074765,"about_ca_topic_score_gemma":0.00040038984,"teacher_disagreement_score":0.008507545,"about_ca_system_score_codex":0.001052383,"about_ca_system_score_gemma":0.0014087101,"threshold_uncertainty_score":0.028460562},"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":"W1990777780","doi":"10.1016/j.ejc.2003.10.014","title":"Addendum to James Singer’s theorem on difference sets","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Addendum; Mathematics; Combinatorics; Calculus (dental); Discrete mathematics; Philosophy","score_opus":0.018173515733292876,"score_gpt":0.22998907846145933,"score_spread":0.21181556272816646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990777780","genre_codex":"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.016347032,0.011355944,0.17022394,0.09377461,0.14378932,0.0001534052,0.0023634494,0.0013114356,0.56068075],"genre_scores_gemma":[0.23772396,0.0142605435,0.06784486,0.021815822,0.11577871,0.00033093037,0.0044690706,0.0020735932,0.5357025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863476,0.00020093311,0.000074236144,0.00034086106,0.00059160736,0.00015744385],"domain_scores_gemma":[0.9955562,0.0015669488,0.00020857889,0.0008072372,0.0012985625,0.00056251144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342273,0.0018249116,0.0015753485,0.0029320703,0.0025695625,0.003835434,0.0028465376,0.0014455988,0.055792987],"category_scores_gemma":[0.0065186904,0.0006583498,0.002542337,0.0031292585,0.0024775844,0.008478883,0.006552422,0.0058691236,0.017037818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014158967,0.00010580251,0.0004636794,0.00042685284,0.00007914733,0.0002520617,0.00031821238,0.00068072014,0.001993109,0.7332698,0.20111835,0.061150726],"study_design_scores_gemma":[0.000022674949,0.00004410245,0.0006166145,0.00004097743,0.000088561734,0.0005406486,0.000076653516,0.001017381,0.0010347998,0.67555475,0.3209097,0.00005314183],"about_ca_topic_score_codex":0.00121954,"about_ca_topic_score_gemma":0.0016301303,"teacher_disagreement_score":0.055792987,"about_ca_system_score_codex":0.0019123253,"about_ca_system_score_gemma":0.0010720029,"threshold_uncertainty_score":0.18664616},"labels":[],"label_agreement":null},{"id":"W1991278353","doi":"10.1504/ijsn.2011.045227","title":"On the (in)security of two Joint Encryption and Error Correction schemes","year":2011,"lang":"en","type":"article","venue":"International Journal of Security and Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Vulnerability (computing); Block (permutation group theory); Cryptography; Decoding methods; Computer security; Theoretical computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.024728075717921395,"score_gpt":0.2484381630192168,"score_spread":0.2237100873012954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991278353","genre_codex":"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.23392521,0.0008726087,0.7562492,0.0008864754,0.00013188172,0.00011176017,0.000071185306,0.00032314926,0.007428493],"genre_scores_gemma":[0.9531675,0.00022958618,0.04480769,0.00009249663,0.000036371497,0.00003421106,0.000043579083,0.000013372812,0.0015751827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996727,0.00090539356,0.00020099287,0.00035797863,0.0011797673,0.0006287797],"domain_scores_gemma":[0.9948095,0.0018446489,0.00061986607,0.0020929538,0.0005115561,0.000121398196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025255352,0.00073800504,0.00070507184,0.0006812675,0.00084134657,0.0013347804,0.00079650525,0.0012210004,0.0013427212],"category_scores_gemma":[0.0064943307,0.0003446256,0.0005008381,0.000720032,0.0019276609,0.0028314886,0.0023992006,0.0016300038,0.0002948736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015321819,0.00022934294,0.005340017,0.00030622643,0.0002151488,0.0007731475,0.0007934317,0.14206748,0.10258012,0.6061802,0.002049024,0.13793367],"study_design_scores_gemma":[0.00011038451,0.0007191559,0.0014904839,0.00009011049,0.00011868297,0.0012303161,0.000118014344,0.7662633,0.12166533,0.100362465,0.007722016,0.00010962467],"about_ca_topic_score_codex":0.00047446677,"about_ca_topic_score_gemma":0.00033671694,"teacher_disagreement_score":0.0025255352,"about_ca_system_score_codex":0.00078437966,"about_ca_system_score_gemma":0.0010803991,"threshold_uncertainty_score":0.013356507},"labels":[],"label_agreement":null},{"id":"W1991405149","doi":"10.1090/s0025-5718-00-01246-1","title":"A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Algebraic function; Algebraic number; Rational function; Function field of an algebraic variety; Polynomial; Logarithm; Newton polygon; Function (biology); Real algebraic geometry; Field (mathematics); Algebraic surface; Singular point of an algebraic variety; Algebraic extension; Power series; Algebraic element; Upper and lower bounds; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.026861764522192456,"score_gpt":0.2551159990401332,"score_spread":0.22825423451794075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991405149","genre_codex":"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.08315648,0.00060834835,0.8978396,0.00154643,0.0001576987,0.00023128823,0.00025212584,0.0020128035,0.014195158],"genre_scores_gemma":[0.5884463,0.0007640465,0.39763027,0.0006216496,0.00036123992,0.0005269802,0.0010068002,0.0010344462,0.009608228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940154,0.0010469013,0.00033546958,0.00093410217,0.002570705,0.0010975346],"domain_scores_gemma":[0.979602,0.01397655,0.0007434299,0.004104678,0.0011733677,0.00040004266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037234223,0.0015159856,0.0017307188,0.0013523722,0.0016479447,0.0050691934,0.003867945,0.0016611749,0.0100403335],"category_scores_gemma":[0.016043955,0.0006455812,0.0024455262,0.0017643571,0.0043064915,0.016186226,0.003956065,0.005271176,0.0020602765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032966235,0.00029827235,0.0035912357,0.00076608895,0.00023846081,0.00037270502,0.0006639368,0.19515568,0.03860526,0.5913899,0.007518997,0.15810277],"study_design_scores_gemma":[0.00016787366,0.0001840376,0.00060838467,0.000060851085,0.00011425455,0.00017783405,0.00009149268,0.6207934,0.02591597,0.34670442,0.0051023737,0.00007908675],"about_ca_topic_score_codex":0.002414175,"about_ca_topic_score_gemma":0.003214699,"teacher_disagreement_score":0.0100403335,"about_ca_system_score_codex":0.0032996235,"about_ca_system_score_gemma":0.0034102108,"threshold_uncertainty_score":0.03358829},"labels":[],"label_agreement":null},{"id":"W1991749034","doi":"10.1007/bf01237471","title":"The Lunelli-Sce hyperoval inPG(2, 16)","year":2000,"lang":"en","type":"article","venue":"Journal of Geometry","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Conic section; Mathematical proof; Intersection (aeronautics); Automorphism; Group (periodic table); Plane (geometry); Combinatorics; Pure mathematics; Algebra over a field; Geometry","score_opus":0.00620122086169886,"score_gpt":0.21129248506419535,"score_spread":0.2050912642024965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991749034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.452696,0.0019814502,0.117810614,0.011138846,0.001614679,0.00033206583,0.0027855844,0.0010803514,0.41056043],"genre_scores_gemma":[0.86519164,0.0007531936,0.025613498,0.0015018345,0.0005905793,0.00017940164,0.001964204,0.00047405894,0.10373164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912375,0.0002161291,0.000039243096,0.00013354496,0.00019878302,0.00028861975],"domain_scores_gemma":[0.9991906,0.00019191693,0.00013077591,0.000105253406,0.00011026003,0.0002711684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007463095,0.0015884935,0.0016518586,0.0033874356,0.0058620865,0.0062972647,0.0016051664,0.0025922945,0.027845275],"category_scores_gemma":[0.0026867776,0.00072103244,0.0009675901,0.0022331073,0.0040151547,0.004104082,0.0042109885,0.0039682984,0.0035023335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028652773,0.000027333901,0.0003550283,0.00006389281,0.000017590777,0.00035822322,0.00018365847,0.0016193226,0.00082398683,0.9796848,0.0074640843,0.009115538],"study_design_scores_gemma":[0.00007348195,0.0000328484,0.0003489685,0.000046904508,0.000013898837,0.00053921517,0.0002212465,0.0062830863,0.0011437109,0.980821,0.010452201,0.000023378976],"about_ca_topic_score_codex":0.001774339,"about_ca_topic_score_gemma":0.0016538878,"teacher_disagreement_score":0.027845275,"about_ca_system_score_codex":0.0019858794,"about_ca_system_score_gemma":0.0010716374,"threshold_uncertainty_score":0.09315169},"labels":[],"label_agreement":null},{"id":"W1992704551","doi":"10.1016/j.ffa.2007.11.001","title":"Near bent functions on a hyperplane","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Hyperplane; Bent molecular geometry; Mathematics; TRACE (psycholinguistics); Combinatorics; Function (biology); Bent function; Boolean function; Discrete mathematics","score_opus":0.016561114137719136,"score_gpt":0.20230978912080855,"score_spread":0.18574867498308942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992704551","genre_codex":"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.77098525,0.0010615954,0.1464185,0.0016634524,0.0004237653,0.000061701925,0.00035047584,0.00028886268,0.07874641],"genre_scores_gemma":[0.92919564,0.0008127835,0.021315226,0.00035751934,0.00040432622,0.00006757276,0.00029943348,0.00015805785,0.047389567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995838,0.00009679716,0.00001625713,0.000067543035,0.0001411996,0.00009451817],"domain_scores_gemma":[0.999046,0.00034535618,0.00018162884,0.0001108989,0.00012243017,0.00019364977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005793938,0.0009448274,0.0008932264,0.0028167712,0.0015326557,0.0019343097,0.0010026676,0.0012761318,0.006377603],"category_scores_gemma":[0.0021008644,0.0005613217,0.00051179354,0.0014058395,0.0020099117,0.0034785515,0.0022565394,0.0028299463,0.0012081163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001353339,0.000051537125,0.000352859,0.0000397879,0.000011397772,0.000111762165,0.00017565126,0.0036286998,0.0031148652,0.9822597,0.0012963396,0.0088221235],"study_design_scores_gemma":[0.00003300451,0.00006297493,0.00044345995,0.000029860743,0.000009401208,0.00029343498,0.00014752515,0.018747887,0.0014181783,0.9754735,0.0033148653,0.000025893854],"about_ca_topic_score_codex":0.0005550367,"about_ca_topic_score_gemma":0.0004533179,"teacher_disagreement_score":0.006377603,"about_ca_system_score_codex":0.0012654195,"about_ca_system_score_gemma":0.00038840604,"threshold_uncertainty_score":0.021335244},"labels":[],"label_agreement":null},{"id":"W1993611337","doi":"10.4028/www.scientific.net/amm.490-491.1436","title":"An Efficient Stream Cipher WG-16 and its Application for Securing 4G-LTE Networks","year":2014,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Computer science; Cipher; Block cipher; Computer network; Keystream; LTE Advanced; Cryptography; Computer security; Block cipher mode of operation; Stream cipher attack; Encryption; Telecommunications link","score_opus":0.006250283241257533,"score_gpt":0.21058576065736245,"score_spread":0.20433547741610492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993611337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4323881,0.0019153774,0.5500384,0.00048731972,0.00017378437,0.00026229475,0.00031841564,0.00075438514,0.013661909],"genre_scores_gemma":[0.90824676,0.000873895,0.08602956,0.000054407425,0.000039318656,0.00006069992,0.00019875765,0.00004503167,0.004451604],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973077,0.000064464526,0.00002594359,0.00002726868,0.00012449123,0.000026986252],"domain_scores_gemma":[0.9994092,0.00020593635,0.00011494497,0.00012776494,0.00011929086,0.000022827522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353084,0.00040128687,0.00028072062,0.00036737218,0.00019760644,0.00047294886,0.0002306384,0.00031925624,0.0008818493],"category_scores_gemma":[0.0011086457,0.00013263394,0.00028295358,0.00032335232,0.00047815594,0.0007519235,0.00037584308,0.00032951817,0.00035912497],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009193912,0.00020483132,0.0037287425,0.00045897433,0.00006731932,0.00091452134,0.00023994334,0.15351033,0.51107097,0.17685664,0.0028680293,0.14916034],"study_design_scores_gemma":[0.0000782249,0.000698707,0.0012495776,0.000060322556,0.000045600602,0.0011707357,0.00004737012,0.56751853,0.39118978,0.021459017,0.016441207,0.000040891868],"about_ca_topic_score_codex":0.0002267085,"about_ca_topic_score_gemma":0.0001591471,"teacher_disagreement_score":0.0008818493,"about_ca_system_score_codex":0.00030949432,"about_ca_system_score_gemma":0.00041890788,"threshold_uncertainty_score":0.0029500723},"labels":[],"label_agreement":null},{"id":"W1993844643","doi":"10.1090/s0025-5718-03-01559-x","title":"The arithmetic of certain cubic function fields","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Ideal (ethics); Jacobian matrix and determinant; Ideal class group; Arithmetic; Arithmetic function; Algebraic number theory; Cryptography; Function field; Field (mathematics); Class (philosophy); Class field theory; Algebraic number; Function (biology); Discrete mathematics; Pure mathematics; Algebra over a field; Algorithm; Applied mathematics; Mathematical analysis; Computer science; Law","score_opus":0.01313094937652154,"score_gpt":0.23349545416482226,"score_spread":0.22036450478830072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993844643","genre_codex":"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.4755397,0.0019432902,0.12930009,0.0020055221,0.00056096126,0.00007604299,0.0009259353,0.0007010304,0.38894743],"genre_scores_gemma":[0.94463104,0.00087284995,0.01723669,0.00031402256,0.00041366907,0.00005013979,0.00064928294,0.00021790992,0.035614386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.000075602286,0.000028693144,0.00010221703,0.00021778078,0.00016050553],"domain_scores_gemma":[0.99908864,0.0003478011,0.000121350815,0.00011418645,0.00024587926,0.000082213504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006540128,0.00044601256,0.00037532282,0.0016115843,0.0016371803,0.0020464766,0.00058994716,0.00047742293,0.012417065],"category_scores_gemma":[0.0029472653,0.0002153252,0.0005948376,0.0018112133,0.002426322,0.003656982,0.0013370309,0.0014429525,0.0021218958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049378974,0.0000088599445,0.0003460309,0.00006731134,0.0000039810325,0.00009740127,0.0002650319,0.0011956627,0.0005926932,0.9817908,0.0020659314,0.0135169355],"study_design_scores_gemma":[0.000026781783,0.000044678403,0.0012193993,0.000048890633,0.000012069355,0.0003570976,0.00029210016,0.0067234305,0.0022994163,0.9587891,0.030150224,0.0000367935],"about_ca_topic_score_codex":0.0037611842,"about_ca_topic_score_gemma":0.0021243233,"teacher_disagreement_score":0.012417065,"about_ca_system_score_codex":0.002025074,"about_ca_system_score_gemma":0.0009373727,"threshold_uncertainty_score":0.04153925},"labels":[],"label_agreement":null},{"id":"W1994036294","doi":"10.14569/ijacsa.2014.050533","title":"Solving for the RC4 stream cipher state register using a genetic algorithm","year":2014,"lang":"en","type":"article","venue":"International Journal of Advanced Computer Science and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; RC4; Stream cipher; Keystream; Algorithm; Cryptanalysis; Permutation (music); Transposition cipher; Cipher; Encryption; Genetic algorithm; Running key cipher; Cryptography; Theoretical computer science; Computer security; Machine learning","score_opus":0.013266659436945338,"score_gpt":0.2829219701691825,"score_spread":0.2696553107322372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994036294","genre_codex":"methods","genre_gemma":"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.12005313,0.0001258933,0.8680565,0.00049818883,0.00004118553,0.00015294985,0.0000723343,0.00069852866,0.010301319],"genre_scores_gemma":[0.43742764,0.00014025663,0.55485994,0.00009957358,0.000022209584,0.00015042676,0.00013358795,0.000086932065,0.007079491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997919,0.000045164732,0.000010145366,0.0000412348,0.00007038238,0.000041181673],"domain_scores_gemma":[0.99957675,0.0002569117,0.00004059069,0.000032227435,0.00007932589,0.000014096469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046453398,0.00043579235,0.0004022806,0.00057322095,0.0005935186,0.00074789434,0.0006105635,0.0011486296,0.0043134387],"category_scores_gemma":[0.0020691522,0.0002791481,0.00053457613,0.00047268026,0.00051018957,0.0006889048,0.00038208056,0.0007046161,0.0005677408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059808423,0.000046294714,0.0010050391,0.00004785582,0.000022525368,0.00013703268,0.000102883314,0.9082428,0.005106744,0.021524517,0.0010518978,0.06265262],"study_design_scores_gemma":[0.000022307831,0.000032547316,0.000116989395,0.0000066938806,0.000010505835,0.000035928566,0.000035452224,0.990408,0.0024616832,0.005678007,0.0011855767,0.000006308056],"about_ca_topic_score_codex":0.007448528,"about_ca_topic_score_gemma":0.0063042655,"teacher_disagreement_score":0.007448528,"about_ca_system_score_codex":0.000817343,"about_ca_system_score_gemma":0.0022073605,"threshold_uncertainty_score":0.014810324},"labels":[],"label_agreement":null},{"id":"W1994156427","doi":"10.1016/j.disc.2009.04.002","title":"Research problems on Gray codes and universal cycles","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gray code; Gray (unit); Mathematics; De Bruijn sequence; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.039846901217051485,"score_gpt":0.30825031101059897,"score_spread":0.2684034097935475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994156427","genre_codex":"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.27946204,0.065813266,0.25013047,0.073994905,0.0048464485,0.00013873307,0.0019801655,0.0004792505,0.3231547],"genre_scores_gemma":[0.81943417,0.039155956,0.033508644,0.0058573005,0.008511982,0.00025310199,0.0013595066,0.00036863683,0.09155071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00029558808,0.000042132444,0.0002738816,0.00019418316,0.00015756971],"domain_scores_gemma":[0.99507326,0.0034816642,0.0003222927,0.00043229817,0.00041958274,0.00027085235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012845608,0.0012454665,0.0016042709,0.0035691098,0.0030951577,0.0042894725,0.0018604455,0.0030512419,0.0137717],"category_scores_gemma":[0.008117388,0.00085743895,0.0011276535,0.0070753032,0.0069418885,0.01159921,0.0031902576,0.0054270383,0.001507168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001082486,0.0000065903314,0.000057997713,0.000042098054,0.000003734295,0.00001132386,0.00007880102,0.00052786595,0.000055362285,0.99245363,0.002253223,0.0044985707],"study_design_scores_gemma":[0.0000039853558,0.0000028294462,0.000030925454,0.000011659658,0.0000026876203,0.000015773832,0.000030641924,0.0005626871,0.00004139653,0.99578923,0.0035047312,0.0000034356538],"about_ca_topic_score_codex":0.002324874,"about_ca_topic_score_gemma":0.0015134094,"teacher_disagreement_score":0.0137717,"about_ca_system_score_codex":0.003725004,"about_ca_system_score_gemma":0.0017153273,"threshold_uncertainty_score":0.046070993},"labels":[],"label_agreement":null},{"id":"W1994268719","doi":"10.1016/s0012-365x(02)00520-4","title":"On self-dual codes over some prime fields","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Prime (order theory); Combinatorics; Discrete mathematics; Separable space; Minimum distance; Block code; Linear code; Finite field; Algorithm; Decoding methods","score_opus":0.011533567343500301,"score_gpt":0.24152224109198725,"score_spread":0.22998867374848694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994268719","genre_codex":"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.66092616,0.0023404872,0.15681925,0.0076121176,0.0010127793,0.00012261474,0.00060848147,0.00030488582,0.17025317],"genre_scores_gemma":[0.9486635,0.001657924,0.011525177,0.0007987978,0.00092093414,0.00009620673,0.00037061915,0.00012812042,0.035838854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989409,0.00027126432,0.000045314013,0.00015283827,0.00032219765,0.0002674079],"domain_scores_gemma":[0.9961733,0.0020482372,0.0005247209,0.00039079532,0.00041991464,0.00044294313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013772137,0.001173118,0.0010512057,0.0037008794,0.00298231,0.0031081364,0.000983744,0.0017580597,0.0055738376],"category_scores_gemma":[0.004876408,0.00075570226,0.0009670993,0.0028386253,0.0044634384,0.0062891394,0.0039894106,0.0035172713,0.00079409714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039719183,0.000013793901,0.00011344839,0.000017835931,0.0000029608373,0.00006128766,0.00014615488,0.0005766414,0.00023984202,0.9967602,0.00053163496,0.0014963981],"study_design_scores_gemma":[0.000013013565,0.000013296483,0.00007434701,0.000014974408,0.0000053513404,0.00010847291,0.000047234582,0.0021525847,0.00030181522,0.9959287,0.0013312222,0.000008900797],"about_ca_topic_score_codex":0.0007674189,"about_ca_topic_score_gemma":0.0005977021,"teacher_disagreement_score":0.0055738376,"about_ca_system_score_codex":0.0019480814,"about_ca_system_score_gemma":0.0010586915,"threshold_uncertainty_score":0.01864636},"labels":[],"label_agreement":null},{"id":"W1996830797","doi":"10.1016/j.jpaa.2006.08.006","title":"On the Wronskian combinants of binary forms","year":2006,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of British Columbia","funders":"University of British Columbia","keywords":"Wronskian; Mathematics; Grassmannian; Binary number; Invariant (physics); Pure mathematics; Corollary; Sequence (biology); Polynomial; Discrete mathematics; Mathematical analysis; Mathematical physics; Arithmetic","score_opus":0.007565681681731881,"score_gpt":0.20299056051534597,"score_spread":0.1954248788336141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996830797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.53193414,0.0026527308,0.23214312,0.0030580417,0.001170611,0.0001943488,0.0004374404,0.00033698394,0.22807261],"genre_scores_gemma":[0.89674824,0.0016664137,0.037030093,0.0008619424,0.000809891,0.0001810538,0.0004730319,0.00028365865,0.061945688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979424,0.0006648029,0.00017249407,0.00029900187,0.0005648144,0.000356468],"domain_scores_gemma":[0.99725085,0.0014540823,0.0003637387,0.0003706133,0.00033728383,0.0002233711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024307938,0.0013254649,0.0014493266,0.0036047897,0.0028361226,0.0046685026,0.0016083262,0.0015831015,0.0084796725],"category_scores_gemma":[0.006302826,0.0010916579,0.0014334434,0.0032763786,0.0045843096,0.008623579,0.004088435,0.0035432342,0.0016825276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042084408,0.000012863509,0.00022682699,0.000021294274,0.000011791169,0.00008934514,0.00023577032,0.00062404707,0.0004500073,0.99347174,0.00081674225,0.0039974656],"study_design_scores_gemma":[0.000009204614,0.00001109613,0.000126617,0.000016237482,0.000011708432,0.00010059114,0.00007258075,0.0028467046,0.00029849057,0.99410325,0.0023894312,0.000014044076],"about_ca_topic_score_codex":0.0011457016,"about_ca_topic_score_gemma":0.0016951954,"teacher_disagreement_score":0.0084796725,"about_ca_system_score_codex":0.001375031,"about_ca_system_score_gemma":0.0008486296,"threshold_uncertainty_score":0.0283674},"labels":[],"label_agreement":null},{"id":"W1998347421","doi":"10.4064/aa140-4-5","title":"Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin–Shapiro sequences","year":2009,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Sequence (biology); Autocorrelation; Combinatorics; Alphabet; Discrete mathematics; Statistics","score_opus":0.02151816095719357,"score_gpt":0.27013935555273366,"score_spread":0.2486211945955401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998347421","genre_codex":"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.44557425,0.0031563004,0.50087243,0.0019928743,0.00015846019,0.000066737484,0.00036371103,0.00043434926,0.047380857],"genre_scores_gemma":[0.97046024,0.0010799994,0.025136322,0.0002463944,0.00026621015,0.00012757017,0.0002181924,0.00008364675,0.0023814568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808997,0.0005559269,0.00007864623,0.00029753614,0.00059887447,0.0003790519],"domain_scores_gemma":[0.974568,0.01875559,0.0021748452,0.0016254015,0.0014271935,0.0014488684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003470397,0.0012826754,0.0011856142,0.0022518944,0.0010321519,0.0024682342,0.0022573434,0.0010715179,0.0032083963],"category_scores_gemma":[0.020129489,0.00055145565,0.0006488907,0.001990078,0.0049670106,0.0040748664,0.0034851776,0.0031695627,0.0006174298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002696686,0.00006861329,0.0016712304,0.0001555259,0.000036052472,0.00035386407,0.000290259,0.033778623,0.005602212,0.94724023,0.0010502831,0.009483369],"study_design_scores_gemma":[0.00007328574,0.00017061575,0.0017114676,0.00016196643,0.00005228298,0.00048881886,0.00014060672,0.28704235,0.007500796,0.6999387,0.0026101856,0.00010892823],"about_ca_topic_score_codex":0.000566527,"about_ca_topic_score_gemma":0.0005136416,"teacher_disagreement_score":0.003470397,"about_ca_system_score_codex":0.0025684263,"about_ca_system_score_gemma":0.0015083877,"threshold_uncertainty_score":0.018635333},"labels":[],"label_agreement":null},{"id":"W1998634522","doi":"10.1155/ijmms.2005.2631","title":"On some permutation polynomials over finite fields","year":2005,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science","score_opus":0.02046431334987847,"score_gpt":0.2977287348421196,"score_spread":0.2772644214922411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998634522","genre_codex":"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.7200502,0.0015250912,0.13913827,0.0019732572,0.00035435767,0.000106809974,0.00038962177,0.00039309086,0.13606934],"genre_scores_gemma":[0.9519236,0.0014675803,0.017357526,0.00027838163,0.0004012369,0.00010025093,0.00024488306,0.000097450684,0.028129045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995408,0.00011319746,0.000014403923,0.0000430892,0.000121125406,0.00016729657],"domain_scores_gemma":[0.9996401,0.00015127097,0.000075539436,0.00004059609,0.00004249531,0.00004995414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055535714,0.0008294971,0.00049605034,0.0009952921,0.0015210066,0.0013185191,0.00046934836,0.0006980843,0.004778296],"category_scores_gemma":[0.001363754,0.0002956542,0.00054577005,0.0014275938,0.0019134614,0.002151847,0.0008228214,0.0011308661,0.0010144472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055385408,0.000029264571,0.00029294912,0.000030236293,0.000004465049,0.00040534145,0.00026965613,0.0042847656,0.0017820742,0.98595077,0.0008737867,0.0060213823],"study_design_scores_gemma":[0.000032929893,0.00006295959,0.00046026194,0.000025692972,0.000007020566,0.00032762226,0.00008887603,0.020018762,0.0013472316,0.9710708,0.0065347017,0.000023159904],"about_ca_topic_score_codex":0.0012589061,"about_ca_topic_score_gemma":0.0010524768,"teacher_disagreement_score":0.004778296,"about_ca_system_score_codex":0.0010245373,"about_ca_system_score_gemma":0.00054231053,"threshold_uncertainty_score":0.015985012},"labels":[],"label_agreement":null},{"id":"W1998762286","doi":"10.1090/s0025-5718-2012-02591-9","title":"Tabulation of cubic function fields via polynomial binary cubic forms","year":2012,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algorithm; Type (biology); Annotation; Artificial intelligence; Computer science; Mathematics; Biology","score_opus":0.019360540611317284,"score_gpt":0.2518147950766555,"score_spread":0.2324542544653382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998762286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.023528833,0.000566866,0.83060247,0.00054665015,0.0006983698,0.0003047898,0.010628242,0.053887594,0.079236224],"genre_scores_gemma":[0.23422976,0.0010670158,0.62624097,0.0006777703,0.00034596905,0.0006005946,0.021746544,0.03774645,0.077344954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875987,0.00017459142,0.00014201114,0.00021603947,0.00050122343,0.00020627177],"domain_scores_gemma":[0.99822456,0.0005485225,0.00009617423,0.0005363176,0.0005328005,0.00006171279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011306814,0.0013347988,0.0010012815,0.0025142843,0.0013480963,0.0034694492,0.0017147616,0.0007335627,0.07073755],"category_scores_gemma":[0.0061929347,0.0007273019,0.0017626028,0.003624727,0.0010944621,0.005085108,0.002955932,0.001880039,0.027751602],"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.000606963,0.00012235659,0.0016658128,0.0012266696,0.000049992468,0.0004585273,0.0009675377,0.010118476,0.010074578,0.32137913,0.15059973,0.5027303],"study_design_scores_gemma":[0.00019107647,0.00013725038,0.0007754709,0.00030332452,0.000070563976,0.0005392168,0.00060359796,0.049215008,0.041423462,0.32811463,0.57844484,0.00018154064],"about_ca_topic_score_codex":0.005319179,"about_ca_topic_score_gemma":0.0055632307,"teacher_disagreement_score":0.07073755,"about_ca_system_score_codex":0.0015305454,"about_ca_system_score_gemma":0.0015169862,"threshold_uncertainty_score":0.23664063},"labels":[],"label_agreement":null},{"id":"W1999879389","doi":"10.1109/bsc.2010.5472985","title":"New transmission-decoding schemes based on Reed-Solomon codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Computer science; Reed–Solomon error correction; Erasure; Code word; List decoding; Sequential decoding; Algorithm; Transmission (telecommunications); Transmitter; Fountain code; Luby transform code; Block code; Theoretical computer science; Concatenated error correction code; Telecommunications","score_opus":0.009335214823427812,"score_gpt":0.23482049400859198,"score_spread":0.22548527918516417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999879389","genre_codex":"methods","genre_gemma":"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.028370088,0.0028536762,0.9632178,0.00022315679,0.00035449312,0.00020178752,0.00012503775,0.0008633671,0.0037906019],"genre_scores_gemma":[0.2875095,0.002000736,0.7018883,0.00018696913,0.0002640794,0.0002582708,0.00022330947,0.000088742716,0.0075799916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991716,0.00019478939,0.00008721081,0.000105727755,0.00036698568,0.000073684954],"domain_scores_gemma":[0.9991277,0.000254252,0.00015483232,0.00019027347,0.00023147943,0.000041582203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083941635,0.00084417127,0.00082027004,0.00094372575,0.00065788784,0.0007047286,0.0011171731,0.00088578166,0.0013144843],"category_scores_gemma":[0.0017774607,0.00032402133,0.00047971983,0.0008030426,0.0006485704,0.0016020834,0.000982583,0.0010868857,0.0008954206],"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.0007704516,0.00024996733,0.0012344477,0.0010149686,0.00018419363,0.0007383755,0.0006375669,0.05427907,0.24217653,0.1651042,0.0050913035,0.528519],"study_design_scores_gemma":[0.0002677105,0.0008701195,0.00091919897,0.0001854221,0.00020724644,0.003427252,0.00008126157,0.6605619,0.23404974,0.04374272,0.055429984,0.0002573619],"about_ca_topic_score_codex":0.00028215078,"about_ca_topic_score_gemma":0.0005441393,"teacher_disagreement_score":0.0013144843,"about_ca_system_score_codex":0.00048578423,"about_ca_system_score_gemma":0.0005608823,"threshold_uncertainty_score":0.0044392943},"labels":[],"label_agreement":null},{"id":"W2000061862","doi":"10.1016/j.ffa.2011.09.003","title":"A generalization of the Hansen–Mullen conjecture on irreducible polynomials over finite fields","year":2011,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Conjecture; Finite field; Generalization; Degree (music); Field (mathematics); Combinatorics; TRACE (psycholinguistics); Order (exchange); Pure mathematics; Constant (computer programming); Zero (linguistics); Prime (order theory); Discrete mathematics; Mathematical analysis","score_opus":0.02334978394381537,"score_gpt":0.22113503908946147,"score_spread":0.1977852551456461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000061862","genre_codex":"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.5292748,0.0062103136,0.16598366,0.028958736,0.004001219,0.00015041225,0.0011577402,0.00074142835,0.2635216],"genre_scores_gemma":[0.9594697,0.0023491117,0.013725887,0.0020207914,0.0033479163,0.000062343126,0.00058121857,0.000089271336,0.018353853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979499,0.00053894037,0.00010145374,0.0005061612,0.00047889276,0.00042474872],"domain_scores_gemma":[0.99391717,0.002941714,0.000653765,0.0014237034,0.000582922,0.00048071006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003116054,0.00094923296,0.0022100906,0.002904076,0.0028738545,0.0039014437,0.0020439064,0.0031822568,0.008776818],"category_scores_gemma":[0.010556455,0.00067451474,0.0016883968,0.0033947984,0.0077958573,0.013756585,0.0040953932,0.006335538,0.0010763576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006885926,0.000034863242,0.00039500845,0.00006427749,0.000012230146,0.00011879933,0.00022882863,0.00220568,0.000303306,0.9879923,0.003521738,0.005054095],"study_design_scores_gemma":[0.00001417951,0.0000096504245,0.00017239455,0.000017893974,0.00000495002,0.00005329341,0.00004960391,0.0039876583,0.00011386653,0.99382883,0.0017352303,0.00001250246],"about_ca_topic_score_codex":0.002671655,"about_ca_topic_score_gemma":0.0018467903,"teacher_disagreement_score":0.008776818,"about_ca_system_score_codex":0.002321428,"about_ca_system_score_gemma":0.0014192124,"threshold_uncertainty_score":0.029361367},"labels":[],"label_agreement":null},{"id":"W2000470138","doi":"10.1016/j.ffa.2008.12.003","title":"On inverse permutation polynomials","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Inverse; Finite field; Polynomial; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01837467303147693,"score_gpt":0.2194095155721322,"score_spread":0.20103484254065526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000470138","genre_codex":"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.1548726,0.010094415,0.23613349,0.008486418,0.003961536,0.000083033905,0.00033174185,0.00027258974,0.5857642],"genre_scores_gemma":[0.7621694,0.010081601,0.03659538,0.0021591808,0.005373901,0.000120815734,0.0005501132,0.00029808562,0.18265152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999255,0.00021851182,0.00002499376,0.00013786588,0.00022176075,0.00014175643],"domain_scores_gemma":[0.99875975,0.00068903394,0.000112475755,0.00015677039,0.00017421218,0.000107739215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010206884,0.0013885146,0.001097629,0.0031485704,0.0016380971,0.0025922577,0.0009936616,0.001471359,0.010441455],"category_scores_gemma":[0.0038666169,0.0006783217,0.0009936477,0.0030966836,0.004228147,0.0065969587,0.0027186638,0.0048445635,0.0018549265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013018838,0.0000091114825,0.000036371417,0.000015472127,0.000001925823,0.000018979314,0.000075616015,0.00040486865,0.00015839137,0.99290997,0.0011093682,0.0052469275],"study_design_scores_gemma":[0.0000047053604,0.000008084361,0.000054784152,0.000013596714,0.000003731637,0.000058990783,0.00002420439,0.0014089674,0.0001693497,0.9916706,0.006575823,0.000007309591],"about_ca_topic_score_codex":0.0007565143,"about_ca_topic_score_gemma":0.00059558445,"teacher_disagreement_score":0.010441455,"about_ca_system_score_codex":0.0016760118,"about_ca_system_score_gemma":0.0007084801,"threshold_uncertainty_score":0.03493011},"labels":[],"label_agreement":null},{"id":"W2000760108","doi":"10.1016/j.jsc.2011.12.009","title":"Efficient algorithms for order basis computation","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Basis (linear algebra); Order (exchange); Degree (music); Computation; Algorithm; Matrix (chemical analysis); Row; Field (mathematics); Exponent; Matrix multiplication; Normal basis; Row and column spaces; Combinatorics; Discrete mathematics; Computer science; Pure mathematics; Geometry; Galois theory","score_opus":0.04028607635485304,"score_gpt":0.2782715342282155,"score_spread":0.23798545787336245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000760108","genre_codex":"methods","genre_gemma":"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.023412481,0.0008682473,0.9499494,0.00088257814,0.00030824472,0.0001542358,0.00033971103,0.0022852551,0.021799834],"genre_scores_gemma":[0.31549928,0.0009934308,0.66350716,0.00040158717,0.0003054906,0.0004659493,0.0011428029,0.00092940684,0.016754983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822193,0.00044632872,0.00011015796,0.00021495786,0.0007202539,0.00028632375],"domain_scores_gemma":[0.9967518,0.0015115336,0.000100442645,0.0011259287,0.0003907691,0.00011961133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013336437,0.0012428476,0.0015661974,0.0019488308,0.0015173286,0.0035361852,0.0020682428,0.0013974992,0.012163683],"category_scores_gemma":[0.007990655,0.0008329275,0.0012212557,0.0031854757,0.0018441657,0.0053559877,0.0035219805,0.0041347886,0.0041535054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035621936,0.00018761506,0.00043244835,0.00017395298,0.00004902196,0.000051408097,0.00024170564,0.02542833,0.0030066115,0.6816602,0.01458367,0.2738288],"study_design_scores_gemma":[0.00009584886,0.000036512378,0.00008740431,0.000027315278,0.000022095352,0.000041197905,0.000045504436,0.107681945,0.0021851235,0.88333225,0.0064249686,0.0000198703],"about_ca_topic_score_codex":0.0017496137,"about_ca_topic_score_gemma":0.0034935575,"teacher_disagreement_score":0.012163683,"about_ca_system_score_codex":0.0019060331,"about_ca_system_score_gemma":0.002072537,"threshold_uncertainty_score":0.040691555},"labels":[],"label_agreement":null},{"id":"W2000812989","doi":"10.1049/ip-com:20050493","title":"Improved tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN and block fading channels","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Mathematics; Fading; Additive white Gaussian noise; Decoding methods; Algorithm; Block code; Bounding overwatch; Combinatorics; Topology (electrical circuits); Computer science; Statistics; White noise; Mathematical analysis","score_opus":0.036291317200137244,"score_gpt":0.2669017111565289,"score_spread":0.23061039395639166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000812989","genre_codex":"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.033341195,0.0014335731,0.95691895,0.00048371998,0.000104484156,0.000028542949,0.00013765405,0.00039631646,0.0071555097],"genre_scores_gemma":[0.80333936,0.0027461718,0.18513574,0.00030291,0.00034130536,0.00016547585,0.0004994351,0.00027683013,0.007192778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973822,0.0009351866,0.00011068634,0.00022060881,0.0010533293,0.00029799223],"domain_scores_gemma":[0.98765355,0.009107553,0.00052779866,0.00094803417,0.0014965201,0.0002664018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033814972,0.0014110699,0.00123158,0.0020471457,0.0005347135,0.0016334039,0.0012995469,0.0010638346,0.002891453],"category_scores_gemma":[0.017675757,0.00039476127,0.0006281865,0.0021818308,0.0025987506,0.0030101847,0.0022706403,0.0020437702,0.00091741874],"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.00068467204,0.000052768708,0.0017703231,0.0002725772,0.000088602676,0.00023619868,0.00025996627,0.6659887,0.0095318295,0.2177672,0.0038930788,0.09945418],"study_design_scores_gemma":[0.000013000722,0.0000790319,0.0004779092,0.000030765594,0.000014722395,0.00006508233,0.000024768304,0.9221783,0.005377353,0.070375964,0.0013342538,0.000028781651],"about_ca_topic_score_codex":0.002428436,"about_ca_topic_score_gemma":0.0017590524,"teacher_disagreement_score":0.0033814972,"about_ca_system_score_codex":0.0017376737,"about_ca_system_score_gemma":0.0014034269,"threshold_uncertainty_score":0.017883241},"labels":[],"label_agreement":null},{"id":"W2000840326","doi":"10.1090/s0025-5718-05-01769-2","title":"Minimality and other properties of the width-𝑤 nonadjacent form","year":2005,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence","score_opus":0.03504730502769028,"score_gpt":0.24502691892162096,"score_spread":0.20997961389393066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000840326","genre_codex":"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.16913587,0.0016554764,0.46438885,0.0037097079,0.00079563784,0.00022563979,0.0029390047,0.0021717348,0.35497805],"genre_scores_gemma":[0.75519526,0.0007710156,0.13330667,0.0010626785,0.0005895429,0.00037292088,0.0035351599,0.0013661567,0.10380048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847716,0.00023713702,0.00015520208,0.00053736754,0.00040278974,0.00019029797],"domain_scores_gemma":[0.9980799,0.0007415256,0.00015808226,0.00032808146,0.0005511849,0.00014110823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982694,0.0006374473,0.00066419435,0.0011147785,0.0022599201,0.003561353,0.0014558675,0.0008602812,0.016603686],"category_scores_gemma":[0.0052502,0.00088873896,0.0015059228,0.0012032876,0.002142496,0.006163104,0.002553096,0.0020892771,0.003820353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120630764,0.00003788275,0.0006571212,0.00016033326,0.000032116168,0.00025230963,0.0007655647,0.00068129745,0.0024434046,0.96734804,0.005783293,0.021717949],"study_design_scores_gemma":[0.000033610562,0.000046736106,0.00062522525,0.000056189645,0.000051129744,0.0004254768,0.0003517209,0.0030294934,0.0040951627,0.9480346,0.043215144,0.000035390472],"about_ca_topic_score_codex":0.0021996074,"about_ca_topic_score_gemma":0.0027480638,"teacher_disagreement_score":0.016603686,"about_ca_system_score_codex":0.0011829078,"about_ca_system_score_gemma":0.00079029513,"threshold_uncertainty_score":0.055544853},"labels":[],"label_agreement":null},{"id":"W2001572656","doi":"10.1145/1358183.1358185","title":"Irreducible polynomials and barker sequences","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Computing and Communication Foundations","keywords":"Mathematics; Irreducibility; Combinatorics; Sequence (biology); Conjecture; Prime (order theory); Modulo; Integer (computer science); Discrete mathematics; Polynomial; Degree (music); Pure mathematics","score_opus":0.038182062635979064,"score_gpt":0.30782306990029473,"score_spread":0.26964100726431567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001572656","genre_codex":"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.75409496,0.006223131,0.09251738,0.0038780363,0.00050984405,0.0000598962,0.00033974825,0.0003374129,0.14203946],"genre_scores_gemma":[0.97431743,0.001568984,0.010376446,0.0003302734,0.00041005618,0.000022950258,0.00020290757,0.000031946278,0.012739101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993037,0.00012323145,0.000037118556,0.0001537232,0.00020402906,0.00017813491],"domain_scores_gemma":[0.9982286,0.00082387,0.00036756074,0.00019066436,0.00016607948,0.00022319809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008445164,0.00033884743,0.00041994423,0.001391315,0.0016006975,0.0011581215,0.0003630809,0.0005253101,0.00475275],"category_scores_gemma":[0.004098,0.00020378456,0.00045465276,0.0009890675,0.0034737645,0.0032887738,0.0017692703,0.002085097,0.0006086668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005415552,0.000020205258,0.00050966477,0.00004315629,0.000003295333,0.0001290588,0.00051214645,0.0007553509,0.0011246831,0.9846784,0.0009293115,0.011240607],"study_design_scores_gemma":[0.000011139273,0.00004000728,0.0005449671,0.000025977608,0.000005984544,0.00027349664,0.0001559394,0.001894139,0.0012866197,0.9874072,0.008339571,0.0000149292555],"about_ca_topic_score_codex":0.0007057048,"about_ca_topic_score_gemma":0.00058175804,"teacher_disagreement_score":0.00475275,"about_ca_system_score_codex":0.0008981468,"about_ca_system_score_gemma":0.0005034735,"threshold_uncertainty_score":0.015899539},"labels":[],"label_agreement":null},{"id":"W2003148723","doi":"10.1145/1838599.1838614","title":"Abstract only","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplicative function; Finite field; Univariate; Mathematics; Binomial (polynomial); Constant (computer programming); Order (exchange); Degree (music); Polynomial; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Statistics; Multivariate statistics; Mathematical analysis","score_opus":0.027788230282145096,"score_gpt":0.29051167572209324,"score_spread":0.26272344543994813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003148723","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065402593,0.0023308173,0.03266095,0.020107815,0.0106834695,0.0002470681,0.0068652313,0.0049630986,0.9156014],"genre_scores_gemma":[0.063754275,0.0016667733,0.007829579,0.0045506097,0.0023206074,0.000109036926,0.0064379573,0.0014083493,0.91192275],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897337,0.0001391395,0.000043773372,0.00033351828,0.00035674882,0.00015339933],"domain_scores_gemma":[0.997349,0.00033396887,0.00014509859,0.00094417954,0.00066000025,0.0005677636],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00072833116,0.00066851405,0.0009680548,0.00091340614,0.0019560421,0.0045797406,0.0015506055,0.0017756865,0.5639569],"category_scores_gemma":[0.004331216,0.00033832583,0.00079368224,0.0015007299,0.00097188534,0.004308923,0.0039642826,0.002173034,0.50011367],"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.00026559824,0.00013247108,0.0009699183,0.00035520407,0.000025469615,0.00039696187,0.00019879398,0.00094480737,0.003064126,0.09569269,0.7086151,0.18933885],"study_design_scores_gemma":[0.000029950981,0.000055124394,0.0006201305,0.00010864977,0.000014039457,0.0003982796,0.00011461234,0.0016556176,0.0018426514,0.03344253,0.9616985,0.000019863168],"about_ca_topic_score_codex":0.0016505388,"about_ca_topic_score_gemma":0.002766142,"teacher_disagreement_score":0.43604308,"about_ca_system_score_codex":0.0013101521,"about_ca_system_score_gemma":0.0013471716,"threshold_uncertainty_score":0.62196255},"labels":[],"label_agreement":null},{"id":"W2003290576","doi":"10.4310/atmp.2011.v15.n6.a7","title":"Codes and supersymmetry in one dimension","year":2011,"lang":"en","type":"article","venue":"Advances in Theoretical and Mathematical Physics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Central Florida; U.S. Department of Energy; National Science Foundation","keywords":"Dimension (graph theory); Topology (electrical circuits); Enumeration; Code (set theory); Computation","score_opus":0.014491706537410855,"score_gpt":0.23449860894627372,"score_spread":0.22000690240886286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003290576","genre_codex":"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.9563366,0.00038986796,0.013853493,0.00020967123,0.00003484161,0.000010658681,0.0001621393,0.00007604057,0.028926658],"genre_scores_gemma":[0.9925247,0.00016729494,0.0049845953,0.00003932148,0.000020572166,0.000008619325,0.00008496428,0.000017198246,0.002152764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982506,0.000041288426,0.000012950762,0.000033413628,0.00004710495,0.000040185776],"domain_scores_gemma":[0.99943596,0.00016151895,0.00012747418,0.00008942069,0.000084850784,0.00010074051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022367277,0.0002266616,0.0002499779,0.0011845817,0.0008781562,0.0011310929,0.0002058674,0.0003433028,0.0023096236],"category_scores_gemma":[0.0008370588,0.00013663643,0.00023872076,0.0005581144,0.0013717788,0.0014047239,0.0007545174,0.00046739395,0.0003143846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000740115,0.00002060068,0.0022331076,0.000052987238,0.000007697252,0.00030952442,0.00043967002,0.0037886405,0.006275766,0.97630376,0.0005996161,0.009894662],"study_design_scores_gemma":[0.000011654307,0.000035601723,0.001065862,0.000027062726,0.000006467758,0.00030153088,0.00017101657,0.0074698934,0.0024112214,0.98548836,0.0029921192,0.000019122988],"about_ca_topic_score_codex":0.000618793,"about_ca_topic_score_gemma":0.0008164642,"teacher_disagreement_score":0.0023096236,"about_ca_system_score_codex":0.00043052263,"about_ca_system_score_gemma":0.00027326692,"threshold_uncertainty_score":0.007726431},"labels":[],"label_agreement":null},{"id":"W2004251193","doi":"10.1016/j.jda.2012.04.006","title":"Quasi-cyclic codes over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math> and enumeration of defining polynomials","year":2012,"lang":"lv","type":"article","venue":"Journal of Discrete Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hamming distance; Mathematics; Circulant matrix; Hamming code; Combinatorics; Minimum distance; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code","score_opus":0.018735499125186666,"score_gpt":0.2489108541747267,"score_spread":0.23017535504954004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004251193","genre_codex":"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.2849333,0.0011640826,0.45050743,0.003853684,0.0006641746,0.00033146288,0.006559671,0.002482437,0.24950376],"genre_scores_gemma":[0.81739813,0.0012702745,0.08204087,0.00078558445,0.00054757344,0.00027961488,0.004787903,0.00085017626,0.09203982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999086,0.00026422556,0.0000712522,0.00013432698,0.00023831437,0.00020590842],"domain_scores_gemma":[0.9968003,0.0015423407,0.00036671574,0.00053406,0.0005596986,0.00019688421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091101945,0.00040792936,0.00030105747,0.0010074625,0.0008718445,0.0017933472,0.0005057407,0.00048516947,0.014254947],"category_scores_gemma":[0.004422649,0.00030457322,0.000314378,0.0014500205,0.0008932086,0.002067002,0.0011730688,0.001056082,0.0045980695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018321376,0.000053296993,0.00069004565,0.000107634965,0.0000068412023,0.00016400027,0.00034334307,0.003067693,0.0042504054,0.9225018,0.01733289,0.05129882],"study_design_scores_gemma":[0.000094956915,0.00013694257,0.0016649818,0.00014574888,0.000020566702,0.0008133726,0.00018695298,0.023871085,0.01437598,0.86904013,0.0895603,0.0000889747],"about_ca_topic_score_codex":0.0019792467,"about_ca_topic_score_gemma":0.0024499143,"teacher_disagreement_score":0.014254947,"about_ca_system_score_codex":0.0010214535,"about_ca_system_score_gemma":0.0014569313,"threshold_uncertainty_score":0.04768759},"labels":[],"label_agreement":null},{"id":"W2004773548","doi":"10.1016/j.ffa.2005.05.008","title":"On the structure of uniform one-factorizations from starters in finite fields","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Factorization; Graph; Complete graph; Integer (computer science); Combinatorics; Construct (python library); Discrete mathematics; Existential quantification; Computer science; Algorithm","score_opus":0.012452315119829494,"score_gpt":0.20865475686960527,"score_spread":0.19620244174977577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004773548","genre_codex":"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.6384713,0.0019670434,0.26341105,0.0025639795,0.00054383615,0.00013853103,0.0006497387,0.0007883431,0.091466285],"genre_scores_gemma":[0.9418683,0.00079357927,0.029550942,0.0004808493,0.0004426065,0.00009144845,0.0005714582,0.00019393805,0.026006887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992668,0.00016948224,0.000045206663,0.00014224618,0.0001464006,0.00022994037],"domain_scores_gemma":[0.99621767,0.0019062875,0.0005218054,0.0004096655,0.0004471945,0.00049734145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015280108,0.0007605133,0.0011322637,0.0022019236,0.002964128,0.0031351591,0.00119615,0.0014117769,0.0069963275],"category_scores_gemma":[0.004914079,0.0006082562,0.0009066754,0.0015304959,0.00451287,0.007987315,0.0024978847,0.0028457255,0.0013159134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051860578,0.000014958425,0.000108716406,0.000019943187,0.00000211398,0.00005178664,0.00028965145,0.00043112956,0.00040893417,0.99522626,0.0005507654,0.0028438359],"study_design_scores_gemma":[0.000014087271,0.000020877158,0.00007065426,0.000014382102,0.00000335545,0.000045916542,0.00006368573,0.0015033999,0.00026639935,0.9968451,0.0011408031,0.000011403618],"about_ca_topic_score_codex":0.00093497505,"about_ca_topic_score_gemma":0.000874849,"teacher_disagreement_score":0.0069963275,"about_ca_system_score_codex":0.001220883,"about_ca_system_score_gemma":0.00084320735,"threshold_uncertainty_score":0.023405075},"labels":[],"label_agreement":null},{"id":"W2006138621","doi":"10.1090/s0025-5718-03-01576-x","title":"A complete description of Golay pairs for lengths up to 100","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Mathematics; Combinatorics; Autocorrelation; Binary number; Complementary sequences; Algorithm; Discrete mathematics; Arithmetic; Statistics","score_opus":0.05357796670888526,"score_gpt":0.27789686899951727,"score_spread":0.224318902290632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006138621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.002688526,0.021520223,0.6661278,0.003022598,0.0042431736,0.00040083207,0.0068033175,0.011672222,0.28352126],"genre_scores_gemma":[0.08028163,0.023330877,0.6312187,0.008224489,0.003877051,0.0021637212,0.015809665,0.018983638,0.21611033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778676,0.0003986665,0.00024948127,0.00042513618,0.0009170497,0.00022292895],"domain_scores_gemma":[0.9990532,0.00028227363,0.000060619437,0.00022219266,0.0003345172,0.000047213976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014014703,0.002891835,0.0014559812,0.0037345847,0.0023295882,0.0040447856,0.0025206555,0.0016069892,0.08632122],"category_scores_gemma":[0.0054839044,0.0012530247,0.002309796,0.0056117657,0.0016787618,0.0061561596,0.0027205055,0.004333007,0.10276023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001192956,0.00006942317,0.00016526642,0.00070300145,0.000038505877,0.00032630077,0.00029729947,0.0018822188,0.0036400873,0.6369852,0.16734767,0.18842578],"study_design_scores_gemma":[0.000020981637,0.00005038165,0.00014419059,0.00012130803,0.000009721163,0.0006567814,0.000057960897,0.002181482,0.0023801571,0.2859841,0.70831484,0.000078084],"about_ca_topic_score_codex":0.0024078041,"about_ca_topic_score_gemma":0.0022283238,"teacher_disagreement_score":0.08632122,"about_ca_system_score_codex":0.0017476518,"about_ca_system_score_gemma":0.0013704892,"threshold_uncertainty_score":0.28877324},"labels":[],"label_agreement":null},{"id":"W2006913132","doi":"10.1007/s00224-013-9486-8","title":"The Coolest Way to Generate Binary Strings","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Binary number; Mathematics; Order (exchange); String (physics); Discrete mathematics; Type (biology); Arithmetic","score_opus":0.012509218171598212,"score_gpt":0.2153810577082891,"score_spread":0.20287183953669088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006913132","genre_codex":"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.037998497,0.0020264662,0.88763905,0.0058561466,0.002326572,0.00025353825,0.0008073543,0.0027589551,0.060333356],"genre_scores_gemma":[0.4689147,0.0015980025,0.43870538,0.0041897926,0.0013326228,0.0008748176,0.0013235807,0.0032317224,0.07982937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971777,0.0009555341,0.00013901647,0.00046230105,0.0009709094,0.00029455058],"domain_scores_gemma":[0.99574274,0.0014291839,0.00017264026,0.0017821635,0.0006602734,0.0002130542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015278471,0.0010436971,0.0010219251,0.0014007745,0.0019948275,0.0042830375,0.00160044,0.0020420775,0.016960884],"category_scores_gemma":[0.011776771,0.00075498567,0.0011645849,0.0009416384,0.0029700228,0.006777338,0.004402344,0.0041174483,0.0076235253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043435872,0.000076563876,0.000521063,0.00036914487,0.000078901285,0.00011917807,0.0005260593,0.004168249,0.012734892,0.84012353,0.023912765,0.11693543],"study_design_scores_gemma":[0.00005826642,0.00009508744,0.00017996975,0.00015003802,0.000050012175,0.00027665176,0.000088373556,0.014678692,0.01139692,0.9296115,0.043352302,0.00006226941],"about_ca_topic_score_codex":0.00030285848,"about_ca_topic_score_gemma":0.00041380204,"teacher_disagreement_score":0.016960884,"about_ca_system_score_codex":0.0008718744,"about_ca_system_score_gemma":0.0010654791,"threshold_uncertainty_score":0.056739807},"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":"W2007194092","doi":"10.4236/jis.2013.41001","title":"Frequency Hopping Spread Spectrum Security Improvement with Encrypted Spreading Codes in a Partial Band Noise Jamming Environment","year":2013,"lang":"en","type":"article","venue":"Journal of Information Security","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Iran Telecommunication Research Center; Federation for the Humanities and Social Sciences","keywords":"Frequency-hopping spread spectrum; Spread spectrum; Computer science; Encryption; Jamming; Interference (communication); Code (set theory); Noise (video); Computer network; Vulnerability (computing); Telecommunications; Computer security; Code division multiple access; Channel (broadcasting)","score_opus":0.004401177650393814,"score_gpt":0.18768612030615933,"score_spread":0.1832849426557655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007194092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.61286825,0.00029554951,0.38462555,0.00012134408,0.000019744373,0.000023187784,0.000013135891,0.00013744447,0.0018957761],"genre_scores_gemma":[0.97778124,0.00009190528,0.021825936,0.0000068263466,0.0000049517253,0.000004172671,0.0000048481256,0.0000043777036,0.00027591985],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972135,0.00010206032,0.000012940975,0.000028332213,0.000101425365,0.000033778917],"domain_scores_gemma":[0.9994356,0.00027991447,0.000091104695,0.000084808686,0.00009285622,0.000015742073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915971,0.00023228761,0.000191449,0.00031122824,0.00015714005,0.00027467142,0.00015878648,0.00026676056,0.0002586512],"category_scores_gemma":[0.0012123476,0.00008572178,0.00017010825,0.00024666826,0.0003966149,0.0005618931,0.00031065464,0.0001905123,0.00006260091],"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.00074001803,0.00011519971,0.0068247453,0.00018382512,0.00010420586,0.00076888595,0.00041618434,0.28085086,0.5168256,0.04555064,0.00045337068,0.14716652],"study_design_scores_gemma":[0.000018241824,0.0003434029,0.0016552564,0.0000133970125,0.000037519356,0.00052671955,0.000060570354,0.8512791,0.13884835,0.006418135,0.00078006595,0.000019294052],"about_ca_topic_score_codex":0.0001697453,"about_ca_topic_score_gemma":0.00016522116,"teacher_disagreement_score":0.00031122824,"about_ca_system_score_codex":0.00016659018,"about_ca_system_score_gemma":0.00019901853,"threshold_uncertainty_score":0.001542151},"labels":[],"label_agreement":null},{"id":"W2007520294","doi":"10.1007/s10878-008-9194-5","title":"Periodic complementary binary sequences and Combinatorial Optimization algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Formalism (music); Autocorrelation; Combinatorial optimization; Theory of computation; Algorithm; Binary number; Mathematics; Optimization problem; Computer science; Theoretical computer science","score_opus":0.01615915097400654,"score_gpt":0.2401402947344964,"score_spread":0.2239811437604899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007520294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.08014039,0.0055722627,0.8329415,0.0034654178,0.00067471596,0.00012767827,0.00018028857,0.00022253643,0.07667523],"genre_scores_gemma":[0.7118748,0.0057774554,0.24047919,0.0010351785,0.0011506125,0.000490014,0.00041557688,0.00019073658,0.038586397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988439,0.000589796,0.000044012642,0.00013277923,0.00030184913,0.00008762314],"domain_scores_gemma":[0.99411595,0.0048995344,0.00031637977,0.00029627318,0.00025398325,0.00011787866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021074403,0.00094827655,0.0012824544,0.0017859312,0.00093921344,0.0025865273,0.0014959964,0.0019527883,0.0062958533],"category_scores_gemma":[0.012994166,0.0007807423,0.0008025722,0.0029000153,0.002793177,0.0033168208,0.0017421427,0.0026704548,0.00058728235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005124057,0.000045172837,0.0001712351,0.000066791894,0.000023693818,0.000026912188,0.000043061493,0.07065205,0.00022763826,0.8991262,0.0025333203,0.027032826],"study_design_scores_gemma":[0.000024347106,0.000018827715,0.00006247576,0.000020938236,0.000007683019,0.000032015905,0.00001388315,0.19106174,0.00015278757,0.806999,0.0015971067,0.000009038471],"about_ca_topic_score_codex":0.0009142508,"about_ca_topic_score_gemma":0.0009107149,"teacher_disagreement_score":0.0062958533,"about_ca_system_score_codex":0.0015829967,"about_ca_system_score_gemma":0.0013289207,"threshold_uncertainty_score":0.021061778},"labels":[],"label_agreement":null},{"id":"W2009069065","doi":"10.1016/j.dam.2015.03.001","title":"Charm bracelets and their application to the construction of periodic Golay pairs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Modulo; Binary Golay code; Combinatorics; Ring of integers; Charm (quantum number); Discrete mathematics; Arithmetic; Algorithm; Algebraic number field; Particle physics; Physics","score_opus":0.013737063935454489,"score_gpt":0.22188586029084437,"score_spread":0.20814879635538988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009069065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.3771126,0.0027685717,0.43284115,0.003244821,0.0021141726,0.00031616376,0.00035927392,0.0011420626,0.18010116],"genre_scores_gemma":[0.8592815,0.0010950483,0.10727367,0.0006560303,0.00041560276,0.00032551144,0.00022882853,0.00037582006,0.03034815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.0002403091,0.000028171917,0.000072846255,0.00017318194,0.000122066216],"domain_scores_gemma":[0.99912196,0.00039148287,0.00008061574,0.0001657186,0.000098845776,0.00014133695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086278614,0.00071567803,0.00082121097,0.0029718324,0.0026618985,0.0023760102,0.0012191671,0.0016524484,0.007139256],"category_scores_gemma":[0.004616066,0.0006055012,0.0007270572,0.0020928723,0.0031869914,0.0019845436,0.003528894,0.0028204112,0.0015770346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003484196,0.000015824926,0.00008838143,0.000029577375,0.0000030990038,0.0000667865,0.000119249125,0.0011096399,0.00086875015,0.98729867,0.0011015964,0.0092636105],"study_design_scores_gemma":[0.000024820465,0.000033590448,0.000090365014,0.000032806132,0.0000043878963,0.00017147792,0.000084646505,0.010288505,0.0016662895,0.9802626,0.0073139076,0.000026728258],"about_ca_topic_score_codex":0.0005242135,"about_ca_topic_score_gemma":0.000579896,"teacher_disagreement_score":0.007139256,"about_ca_system_score_codex":0.0010881299,"about_ca_system_score_gemma":0.0008340592,"threshold_uncertainty_score":0.023883224},"labels":[],"label_agreement":null},{"id":"W2009435168","doi":"10.1016/j.aim.2009.01.001","title":"Counting hyperelliptic curves","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Hyperelliptic curve; Genus; Hyperelliptic curve cryptography; Integer (computer science); Product (mathematics); Twist; Finite field; Combinatorics; Pure mathematics; Discrete mathematics; Geometry; Botany","score_opus":0.010168322270105104,"score_gpt":0.2613373034918693,"score_spread":0.2511689812217642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009435168","genre_codex":"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.42038947,0.003578669,0.21221179,0.008575468,0.0017107445,0.0001796563,0.0008975233,0.00092080265,0.35153577],"genre_scores_gemma":[0.8532377,0.0024472454,0.047927175,0.0010577531,0.001631196,0.00018997576,0.0011213489,0.00058697915,0.09180067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997979,0.0003860564,0.00011703416,0.00035284812,0.0008619075,0.0003031128],"domain_scores_gemma":[0.9969086,0.0010361349,0.000417308,0.0005505244,0.00058702077,0.0005004037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014069893,0.001527439,0.0014891161,0.0069819815,0.0026631674,0.005717598,0.002608095,0.0026135996,0.016549947],"category_scores_gemma":[0.008521006,0.0007819277,0.0008207212,0.0058886367,0.0040884637,0.011298754,0.004590021,0.0045087547,0.002393617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004101206,0.00001203737,0.00025084484,0.000057724636,0.000006396451,0.000043944456,0.0001247047,0.00074295583,0.00066362566,0.9856719,0.002813198,0.009571724],"study_design_scores_gemma":[0.00000783735,0.0000078900475,0.00017774622,0.000024787758,0.000009089171,0.00015695671,0.0000541715,0.003920797,0.000770226,0.990266,0.004591373,0.000013050403],"about_ca_topic_score_codex":0.00087242,"about_ca_topic_score_gemma":0.0005372531,"teacher_disagreement_score":0.016549947,"about_ca_system_score_codex":0.0023488107,"about_ca_system_score_gemma":0.00074032106,"threshold_uncertainty_score":0.055365086},"labels":[],"label_agreement":null},{"id":"W2009890571","doi":"10.3934/amc.2010.4.485","title":"Efficient list decoding of a class of algebraic-geometry codes","year":2010,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; List decoding; Algebraic number; Interpolation (computer graphics); Class (philosophy); Decoding methods; Block code; Algebraic geometry; Algebra over a field; Hermitian matrix; Discrete mathematics; Algorithm; Concatenated error correction code; Geometry; Computer science; Pure mathematics; Image (mathematics); Mathematical analysis","score_opus":0.015261916361586416,"score_gpt":0.30217363692952365,"score_spread":0.28691172056793723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009890571","genre_codex":"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.13436083,0.00028167528,0.85512143,0.00055897527,0.00004114197,0.00013286048,0.00033311162,0.0004532971,0.008716586],"genre_scores_gemma":[0.7187616,0.000622592,0.2720011,0.00023768481,0.0002357479,0.00024631308,0.0009036201,0.00010186941,0.0068894317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988783,0.00032298284,0.000046248897,0.00014691002,0.00039592918,0.00020964748],"domain_scores_gemma":[0.9974711,0.0013443056,0.00034023714,0.00038983836,0.00035570143,0.00009891018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010352456,0.0005408113,0.00077849015,0.0010043504,0.00077978394,0.0013756474,0.001181839,0.0009388068,0.0022723577],"category_scores_gemma":[0.0050977645,0.00019267175,0.00042044173,0.0013120407,0.0010703539,0.0022821168,0.0015600697,0.0010728263,0.0006724794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003427023,0.000110005734,0.0016517165,0.00018218828,0.00003742921,0.00048812912,0.00028756764,0.23609743,0.014440116,0.63879377,0.0036636493,0.10390531],"study_design_scores_gemma":[0.00003938063,0.0001467353,0.00028054015,0.000016953025,0.000011838438,0.00030822094,0.0000622882,0.76170456,0.013430138,0.21984954,0.004119428,0.00003039097],"about_ca_topic_score_codex":0.00067771657,"about_ca_topic_score_gemma":0.0007695789,"teacher_disagreement_score":0.0022723577,"about_ca_system_score_codex":0.001093005,"about_ca_system_score_gemma":0.0015053786,"threshold_uncertainty_score":0.007930279},"labels":[],"label_agreement":null},{"id":"W2011044835","doi":"10.1142/s1793042108001249","title":"ON SOME CLASSES OF PERMUTATION POLYNOMIALS","year":2008,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Combinatorics; Finite field; Cyclic permutation; Class (philosophy); Prime (order theory); Discrete mathematics; Symmetric group","score_opus":0.016238615781079935,"score_gpt":0.2759407172787741,"score_spread":0.2597021014976942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011044835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7663584,0.0012430998,0.10756381,0.0023837388,0.00020952357,0.00013785361,0.0006877434,0.00024151667,0.12117445],"genre_scores_gemma":[0.97693527,0.0007359978,0.01128432,0.00026683492,0.00040749402,0.00007804971,0.0005255088,0.000065533175,0.009701015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986966,0.00023810385,0.000047972484,0.00028171204,0.0003220399,0.00041358316],"domain_scores_gemma":[0.9968272,0.001712203,0.0005181529,0.0003761096,0.0002140512,0.00035236595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011844316,0.000603295,0.0005669773,0.0020109478,0.0019461819,0.0026460371,0.00073077594,0.0011595245,0.007799845],"category_scores_gemma":[0.0050858194,0.00034595153,0.0010403864,0.0017179815,0.0025200022,0.004166939,0.0013806322,0.0017744269,0.0007513905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000966346,0.000051551968,0.0015454947,0.00004877906,0.000009547758,0.00013722279,0.00021191203,0.0021148757,0.001729786,0.9790229,0.0019088935,0.0131223425],"study_design_scores_gemma":[0.000053114123,0.0001138362,0.0018734208,0.00003737017,0.000018073462,0.0007102008,0.00016066465,0.02368372,0.0020010911,0.9586136,0.012709288,0.000025627523],"about_ca_topic_score_codex":0.00083429564,"about_ca_topic_score_gemma":0.00041773092,"teacher_disagreement_score":0.007799845,"about_ca_system_score_codex":0.0016000911,"about_ca_system_score_gemma":0.0005758788,"threshold_uncertainty_score":0.026093066},"labels":[],"label_agreement":null},{"id":"W2011798878","doi":"10.1006/ffta.2001.0332","title":"Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions","year":2002,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Divisibility rule; Mathematics; Boolean function; Correlation; Nonlinear system; Property (philosophy); Mathematical proof; Algebraic number; Domain (mathematical analysis); Discrete mathematics; Mathematical analysis","score_opus":0.009731903311448296,"score_gpt":0.19865844804746582,"score_spread":0.18892654473601753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011798878","genre_codex":"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.49411184,0.0010891109,0.46446148,0.0015369988,0.00013607636,0.000054356442,0.00019716313,0.00022956109,0.03818339],"genre_scores_gemma":[0.9854116,0.00039664275,0.008918418,0.00016633711,0.00014104441,0.000034729524,0.000078883524,0.000033548873,0.0048187934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995577,0.0001635273,0.000012415629,0.000054508655,0.00012903323,0.00008278107],"domain_scores_gemma":[0.9961759,0.0024633268,0.00043866903,0.00027478495,0.00041175235,0.00023561416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013130846,0.0004936476,0.00054173346,0.0020576564,0.00053270714,0.001481207,0.0007828048,0.0007264602,0.004080112],"category_scores_gemma":[0.0070549413,0.00023186718,0.0004106743,0.00080822676,0.00217221,0.0021691602,0.0009863249,0.001182295,0.00029644792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007774969,0.000035960402,0.00036820606,0.000033656517,0.000011152918,0.000054981043,0.000079093916,0.023070583,0.0022020214,0.96621835,0.00090323394,0.0069450345],"study_design_scores_gemma":[0.000019369672,0.00003249832,0.00046573768,0.00002046526,0.000009508294,0.00013836724,0.00008620068,0.281619,0.0015504296,0.71489745,0.001140136,0.000020817934],"about_ca_topic_score_codex":0.00048880297,"about_ca_topic_score_gemma":0.00027642737,"teacher_disagreement_score":0.004080112,"about_ca_system_score_codex":0.0010357132,"about_ca_system_score_gemma":0.0005328255,"threshold_uncertainty_score":0.013649344},"labels":[],"label_agreement":null},{"id":"W2011959959","doi":"10.1016/s0166-218x(02)00440-7","title":"Higher weights and graded rings for binary self-dual codes","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Binary number; Combinatorics; Discrete mathematics; Arithmetic; Linguistics","score_opus":0.014709663999998299,"score_gpt":0.23082972422446046,"score_spread":0.21612006022446217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011959959","genre_codex":"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.80845815,0.0012453102,0.10045893,0.002652096,0.00057163683,0.00007712845,0.000274059,0.00022846303,0.08603419],"genre_scores_gemma":[0.96951854,0.00052397273,0.009689489,0.0003154966,0.000580126,0.000056399836,0.00013693435,0.00007341257,0.019105611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900216,0.00023421123,0.000056913,0.00017764709,0.00027074284,0.00025833846],"domain_scores_gemma":[0.99765426,0.0008532362,0.00043803063,0.0003079242,0.00025361642,0.0004930545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017596354,0.00090419035,0.0009855791,0.003328095,0.0026907336,0.00416413,0.0011912034,0.0012613324,0.005768697],"category_scores_gemma":[0.0037947658,0.0006446274,0.00083731936,0.0017685093,0.004507702,0.0060440977,0.0032085138,0.0026577017,0.00084797974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003679425,0.00001441557,0.00014781773,0.000012231629,0.000003431641,0.000035489724,0.00015191466,0.00031245244,0.0004615788,0.99692625,0.0002674153,0.0016301034],"study_design_scores_gemma":[0.000014974817,0.000012094924,0.00016181642,0.0000071105787,0.000007345996,0.000060245005,0.000043367243,0.0014435917,0.00036865633,0.99683386,0.0010330885,0.000013806938],"about_ca_topic_score_codex":0.0010031966,"about_ca_topic_score_gemma":0.001148889,"teacher_disagreement_score":0.005768697,"about_ca_system_score_codex":0.0017787243,"about_ca_system_score_gemma":0.0007102655,"threshold_uncertainty_score":0.019298196},"labels":[],"label_agreement":null},{"id":"W2012962223","doi":"10.5539/jmr.v4n3p13","title":"Analysis of Algebraic Immunity for Balanced Boolean Function On 4-Variable","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebraic function; Boolean function; Complete Boolean algebra; Algebraic number; Two-element Boolean algebra; Real algebraic geometry; Boolean algebra; Variable (mathematics); Parity function; Boolean expression; Function field of an algebraic variety; Discrete mathematics; Dimension of an algebraic variety; Algebra over a field; Pure mathematics; Algebra representation","score_opus":0.09904088756082084,"score_gpt":0.377189389838313,"score_spread":0.27814850227749216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012962223","genre_codex":"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.7198252,0.00035447287,0.2602442,0.00030941595,0.000025168212,0.000044664954,0.00016265875,0.00015313739,0.018881062],"genre_scores_gemma":[0.991351,0.00014673223,0.006926344,0.000035523633,0.00002530348,0.000024425819,0.000074539625,0.000013132055,0.0014030428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962413,0.00006613237,0.000015037857,0.000060585517,0.00011991003,0.00011422314],"domain_scores_gemma":[0.9989594,0.0005850534,0.00015714996,0.00007817752,0.00015557733,0.000064674554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048416603,0.00029204114,0.0002554335,0.0011085612,0.000302586,0.0007573961,0.0002947106,0.00028529318,0.0035581347],"category_scores_gemma":[0.0021224106,0.000094941424,0.0003551524,0.00044329197,0.00078931823,0.0017013152,0.00042818376,0.00048334335,0.00024760253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036300797,0.000092309485,0.005765642,0.00013255652,0.000046105757,0.0003154587,0.0002922286,0.06916449,0.060089476,0.82043934,0.0013641781,0.04193528],"study_design_scores_gemma":[0.000038996153,0.00031060068,0.005529998,0.000033235247,0.00005083375,0.00082822144,0.00020521376,0.5155113,0.03586328,0.4366386,0.0049375626,0.000052223142],"about_ca_topic_score_codex":0.00028865074,"about_ca_topic_score_gemma":0.00019510946,"teacher_disagreement_score":0.0035581347,"about_ca_system_score_codex":0.00056352303,"about_ca_system_score_gemma":0.0003089289,"threshold_uncertainty_score":0.011903107},"labels":[],"label_agreement":null},{"id":"W2013392609","doi":"10.1023/b:vlsi.0000047274.68702.8d","title":"Towards a VLSI Architecture for Interpolation-Based Soft-Decision Reed-Solomon Decoders","year":2004,"lang":"en","type":"article","venue":"The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Very-large-scale integration; Reed–Solomon error correction; Interpolation (computer graphics); Computer science; Parallel computing; Soft-decision decoder; Arithmetic; Algorithm; Decoding methods; Mathematics; Linear code; Embedded system; Artificial intelligence; Block code","score_opus":0.011656878434417484,"score_gpt":0.2669418569395721,"score_spread":0.25528497850515464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013392609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.050572775,0.0009271129,0.9376427,0.0004279031,0.00019934007,0.0001434658,0.00013658447,0.003752486,0.0061976193],"genre_scores_gemma":[0.33122298,0.0006564239,0.6575284,0.00040337225,0.00017041457,0.00012552,0.00047676224,0.00014257042,0.009273568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997148,0.000049083825,0.000024594667,0.000043430322,0.00012463749,0.00004341864],"domain_scores_gemma":[0.9995351,0.00011561858,0.000044589477,0.000071882314,0.00020260908,0.000030322964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046549385,0.00045967186,0.00040686986,0.00069441664,0.0004424894,0.0009153821,0.0018681687,0.0006809527,0.004103363],"category_scores_gemma":[0.00091499026,0.00034973887,0.00033243943,0.00054278685,0.0002738937,0.0008069275,0.000586995,0.00082437607,0.0018681564],"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.0011158219,0.00025274302,0.0017494204,0.00057050295,0.00014746883,0.0003997086,0.00031948584,0.050941516,0.41928995,0.060030203,0.008652227,0.45653105],"study_design_scores_gemma":[0.00021658921,0.0017284794,0.0012781464,0.00016316332,0.00019934266,0.00068895513,0.0000880363,0.59395903,0.33245555,0.02124787,0.047870126,0.00010477066],"about_ca_topic_score_codex":0.0012333961,"about_ca_topic_score_gemma":0.0030424758,"teacher_disagreement_score":0.004103363,"about_ca_system_score_codex":0.0006608832,"about_ca_system_score_gemma":0.00090217544,"threshold_uncertainty_score":0.0137271285},"labels":[],"label_agreement":null},{"id":"W2013961570","doi":"10.1109/icecs.2012.6463517","title":"Power efficiency of digit level polynomial basis finite field multipliers in GF(2&lt;sup&gt;283&lt;/sup&gt;)","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Finite field; Very-large-scale integration; Elliptic curve cryptography; GF(2); Multiplier (economics); Critical path method; Computer science; Field (mathematics); Arithmetic; Mathematics; Algorithm; Discrete mathematics; Embedded system; Engineering; Encryption; Public-key cryptography; Pure mathematics","score_opus":0.01825211037285644,"score_gpt":0.23125414793581772,"score_spread":0.2130020375629613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013961570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9086452,0.00089369155,0.074000545,0.00022520343,0.000060912393,0.000049262395,0.0002591018,0.0005308125,0.015335243],"genre_scores_gemma":[0.9711812,0.00029953875,0.024598582,0.000042047104,0.000009923576,0.000022455511,0.00019488143,0.000039809853,0.003611622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997702,0.00007115257,0.000015360245,0.00003570046,0.00006595245,0.00004165444],"domain_scores_gemma":[0.999196,0.0005153204,0.00007568322,0.00006468641,0.00013308827,0.0000153305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039964737,0.0002515132,0.00017187906,0.00045307318,0.00018788698,0.00041637025,0.00046962782,0.00024713625,0.0039728903],"category_scores_gemma":[0.0015951624,0.00009767897,0.00020338468,0.00068308203,0.0001903086,0.00082435843,0.00013940127,0.00015636864,0.000562892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029759307,0.0003640983,0.014575131,0.0008038684,0.0002531329,0.0005230874,0.0003073158,0.4074787,0.2754155,0.037106615,0.0045769294,0.25561973],"study_design_scores_gemma":[0.00020341152,0.0022089707,0.0052325237,0.00007666555,0.00012231509,0.00050303945,0.00013618401,0.65922916,0.31550223,0.007587724,0.009150416,0.000047308647],"about_ca_topic_score_codex":0.00047544963,"about_ca_topic_score_gemma":0.00088553276,"teacher_disagreement_score":0.0039728903,"about_ca_system_score_codex":0.00054969237,"about_ca_system_score_gemma":0.00039326635,"threshold_uncertainty_score":0.013290644},"labels":[],"label_agreement":null},{"id":"W2014166022","doi":"10.1109/itw.2011.6089369","title":"Ambiguity and deficiency of permutations from finite fields","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Ambiguity; Bijection; Abelian group; Combinatorics; Discrete mathematics; Mathematics; Computer science; Programming language","score_opus":0.034021544359147594,"score_gpt":0.21763785217321058,"score_spread":0.183616307814063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014166022","genre_codex":"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.6591977,0.001521347,0.29666254,0.0017364329,0.0002725712,0.000103852704,0.0003488364,0.0001743156,0.03998235],"genre_scores_gemma":[0.9607354,0.00069068454,0.030113976,0.00015020609,0.00028598294,0.00006890256,0.0002233968,0.00006823426,0.0076632365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712545,0.0008041909,0.00024146742,0.00050270103,0.0008773234,0.0004488701],"domain_scores_gemma":[0.9937976,0.0032504913,0.00083288946,0.000792973,0.0006952893,0.0006307326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032782913,0.00079852296,0.0008297251,0.0026935146,0.0012741673,0.0028484033,0.00092557975,0.00088342326,0.0033265846],"category_scores_gemma":[0.012948659,0.0003929364,0.0010194965,0.0013018729,0.004854602,0.007350703,0.0033537927,0.001962954,0.00064454076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006828961,0.000017259388,0.00087259326,0.000052257798,0.0000050151198,0.00015563269,0.00048630394,0.001880983,0.0016653606,0.9876724,0.00027010535,0.00685365],"study_design_scores_gemma":[0.000014110683,0.000055778506,0.00041061532,0.000026384612,0.000007815746,0.00042804345,0.00025431404,0.007856071,0.0013730532,0.98660827,0.0029380387,0.000027655293],"about_ca_topic_score_codex":0.0005112055,"about_ca_topic_score_gemma":0.0002484164,"teacher_disagreement_score":0.0033265846,"about_ca_system_score_codex":0.0014496744,"about_ca_system_score_gemma":0.0010315139,"threshold_uncertainty_score":0.017337441},"labels":[],"label_agreement":null},{"id":"W2015875314","doi":"10.1007/s12095-013-0082-1","title":"A simple combinatorial treatment of constructions and threshold gaps of ramp schemes","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Code (set theory); Mathematical proof; Dual (grammatical number); Minimum distance; Mathematics; Nonlinear system; Algorithm; Computer science; Combinatorial design; Linear code; Discrete mathematics; Block code; Geometry; Decoding methods; Physics","score_opus":0.01868826974391217,"score_gpt":0.25166845567538865,"score_spread":0.23298018593147649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015875314","genre_codex":"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.0664344,0.001600738,0.66849625,0.0040244083,0.0005840942,0.00021704557,0.0005974201,0.00064566644,0.25739995],"genre_scores_gemma":[0.7744679,0.0022239082,0.17059962,0.0014374345,0.00063768495,0.00063527364,0.00063911144,0.00058267696,0.04877639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874014,0.0003364565,0.00009169656,0.00019170732,0.00041047332,0.00022952897],"domain_scores_gemma":[0.9983144,0.0008420943,0.00013448719,0.00048975,0.00012724081,0.000092106464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013288383,0.0011921682,0.0009850726,0.0016379951,0.0020226836,0.003615271,0.0026006808,0.0021354042,0.01535699],"category_scores_gemma":[0.0045470786,0.00067477836,0.0015198432,0.0024706563,0.0034333186,0.009640196,0.0038749694,0.005930687,0.002694783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008839681,0.00000763708,0.000020417878,0.000018021465,0.0000012005736,0.000019579247,0.00004865387,0.00057457417,0.00025061055,0.996363,0.00062101014,0.002066515],"study_design_scores_gemma":[0.0000068503127,0.000012586827,0.000043620024,0.000020153131,0.000005110611,0.000106975276,0.00003539117,0.0043008933,0.00043833285,0.99082994,0.004191794,0.000008268163],"about_ca_topic_score_codex":0.00026985633,"about_ca_topic_score_gemma":0.00023977898,"teacher_disagreement_score":0.01535699,"about_ca_system_score_codex":0.0012088444,"about_ca_system_score_gemma":0.00070405763,"threshold_uncertainty_score":0.051374257},"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":"W2017008783","doi":"10.1016/j.jcta.2010.05.006","title":"Symmetric bilinear forms over finite fields of even characteristic","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Bilinear form; Rank (graph theory); Combinatorics; Vector space; Finite field; Space (punctuation); Set (abstract data type); Bilinear interpolation; Distribution (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Computer science","score_opus":0.006065735391801461,"score_gpt":0.2239817132919832,"score_spread":0.21791597790018172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017008783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.77763516,0.0013967967,0.08988648,0.004876099,0.0010298636,0.00018413528,0.00082082977,0.00053014903,0.12364053],"genre_scores_gemma":[0.97637683,0.000648211,0.0050785127,0.00023474563,0.00041746808,0.00005690952,0.00018085774,0.00008412992,0.016922249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832183,0.0003492569,0.000099511264,0.0002380204,0.0004361022,0.00055530504],"domain_scores_gemma":[0.9962691,0.0016711628,0.0005649034,0.0005999052,0.00033780508,0.00055715203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018211605,0.0014880104,0.0015335309,0.0027043032,0.0026017334,0.005236315,0.0010010136,0.001092639,0.011220448],"category_scores_gemma":[0.0041070906,0.00095295184,0.0007530801,0.003196086,0.004477357,0.009950891,0.003668664,0.0033868544,0.0018096779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001655214,0.000074792275,0.0005481734,0.000049574137,0.000010161534,0.00014856471,0.00042390559,0.0009483848,0.0011816163,0.9863511,0.0012331061,0.008865218],"study_design_scores_gemma":[0.000052688785,0.000050803515,0.00022461399,0.000024195051,0.000016675274,0.00023840861,0.00013291108,0.0023761883,0.0014354711,0.99161035,0.0038102076,0.000027348584],"about_ca_topic_score_codex":0.0004235297,"about_ca_topic_score_gemma":0.00044930557,"teacher_disagreement_score":0.011220448,"about_ca_system_score_codex":0.002192895,"about_ca_system_score_gemma":0.002039018,"threshold_uncertainty_score":0.037536144},"labels":[],"label_agreement":null},{"id":"W2017533742","doi":"10.1109/tc.2012.95","title":"Multiway Splitting Method for Toeplitz Matrix Vector Product","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Toeplitz matrix; Mathematics; Generalization; Matrix (chemical analysis); Matrix multiplication; Levinson recursion; Product (mathematics); Integer (computer science); Combinatorics; Computational complexity theory; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.024640510700493345,"score_gpt":0.2999153595971561,"score_spread":0.27527484889666276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017533742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.02071228,0.00021396318,0.9712833,0.00006705833,0.00005938931,0.00003827338,0.000044598626,0.0003566796,0.007224413],"genre_scores_gemma":[0.2905809,0.00034795597,0.69803965,0.00011050768,0.00006578671,0.0001549735,0.00022247313,0.0003084014,0.010169335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996823,0.000052549087,0.000023654668,0.000043116266,0.00015522647,0.00004315477],"domain_scores_gemma":[0.9996462,0.000089211535,0.000020958594,0.00008535231,0.00013231696,0.000025966889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040437642,0.000489704,0.0003769371,0.0009404424,0.0004634559,0.0006772869,0.0007555655,0.00041287448,0.0062906174],"category_scores_gemma":[0.001140124,0.00019942618,0.00042691277,0.00080416637,0.000590503,0.0017583728,0.0009495613,0.0009003467,0.0018198548],"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.00014202509,0.00008032987,0.0006240213,0.00016165033,0.00002820879,0.0003044217,0.00042335448,0.030554326,0.04192627,0.5393978,0.005415755,0.38094187],"study_design_scores_gemma":[0.00003513548,0.0001619869,0.00029850946,0.000039938754,0.000021975962,0.0003509203,0.00010376627,0.6779017,0.03599,0.26829323,0.016765393,0.00003757821],"about_ca_topic_score_codex":0.00074065523,"about_ca_topic_score_gemma":0.0014863937,"teacher_disagreement_score":0.0062906174,"about_ca_system_score_codex":0.0004779814,"about_ca_system_score_gemma":0.0005263815,"threshold_uncertainty_score":0.021044195},"labels":[],"label_agreement":null},{"id":"W2018066889","doi":"10.1007/s10958-012-1054-2","title":"Skew linear recurring sequences of maximal period over galois rings","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Order (exchange); Sequence (biology); Ring (chemistry); Rank (graph theory); Dimension (graph theory); Skew; Discrete mathematics; Physics","score_opus":0.032937257832583604,"score_gpt":0.29383372801603536,"score_spread":0.26089647018345175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018066889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8913913,0.0006328422,0.08098127,0.0003683522,0.00019796567,0.00005232373,0.00025626138,0.00046709835,0.025652613],"genre_scores_gemma":[0.98120075,0.00029628305,0.00901283,0.000116494666,0.000161493,0.000043020114,0.00017416022,0.00009188125,0.00890299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994862,0.00012409207,0.000042141917,0.000074299154,0.0001214745,0.00015165297],"domain_scores_gemma":[0.99844813,0.00058368035,0.0003131073,0.00019766347,0.00018659797,0.00027070058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077802,0.000513129,0.0005481502,0.0012777457,0.0009382469,0.0019267943,0.00044327843,0.0005359399,0.005010218],"category_scores_gemma":[0.0024093152,0.00033182988,0.0004018942,0.0012371123,0.0009172855,0.0018679944,0.0011469536,0.0008847387,0.000694987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058797246,0.00009009415,0.0024628728,0.00008156111,0.000022502947,0.0005841247,0.0005953463,0.0031397825,0.012627899,0.94736177,0.001159648,0.031286437],"study_design_scores_gemma":[0.00012288957,0.0003911377,0.0025950354,0.00006765056,0.000055671564,0.001208948,0.00030709137,0.022515945,0.012193028,0.9504834,0.0099953925,0.000063725885],"about_ca_topic_score_codex":0.00016982075,"about_ca_topic_score_gemma":0.00026202016,"teacher_disagreement_score":0.005010218,"about_ca_system_score_codex":0.00083952834,"about_ca_system_score_gemma":0.0005949507,"threshold_uncertainty_score":0.016760826},"labels":[],"label_agreement":null},{"id":"W2018206679","doi":"10.1145/2576802.2576817","title":"A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Divisor (algebraic geometry); Mathematics; Greatest common divisor; Combinatorics; Algorithm; Statistics","score_opus":0.038761719089005574,"score_gpt":0.2948750600822716,"score_spread":0.25611334099326605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018206679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.05081044,0.00076932483,0.9273412,0.0007590086,0.00035736212,0.0003490998,0.0006433708,0.005500527,0.013469662],"genre_scores_gemma":[0.22435606,0.0003950361,0.75731516,0.00021534286,0.00029565202,0.00042142748,0.00196364,0.00045234352,0.014585284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993523,0.0000885794,0.000051545954,0.00018007115,0.00020789252,0.00011956755],"domain_scores_gemma":[0.9990061,0.00031389718,0.000061278435,0.00031792454,0.0001984562,0.00010233776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072164804,0.0013975931,0.0011022341,0.0018731563,0.0014242559,0.0015650935,0.001585106,0.0008117425,0.016056372],"category_scores_gemma":[0.0024064388,0.000542612,0.0009857424,0.0024441017,0.0007740197,0.0024350837,0.002487445,0.0013542282,0.004912489],"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.0011817026,0.00042999262,0.0018596153,0.00029352633,0.00013737795,0.00029526284,0.00021803916,0.03938744,0.027336715,0.032619532,0.02804046,0.8682004],"study_design_scores_gemma":[0.001347009,0.0007185959,0.0019386193,0.00006657754,0.00018404188,0.00089064636,0.0002467666,0.7857496,0.03883918,0.13994281,0.029971141,0.00010503225],"about_ca_topic_score_codex":0.0040476047,"about_ca_topic_score_gemma":0.009743439,"teacher_disagreement_score":0.016056372,"about_ca_system_score_codex":0.0010888879,"about_ca_system_score_gemma":0.0026395796,"threshold_uncertainty_score":0.053713858},"labels":[],"label_agreement":null},{"id":"W2019616249","doi":"10.1109/tit.2011.2176914","title":"Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Modulo; Mathematics; Binary number; Notation; Polynomial; Discrete mathematics; Cryptography; Exponential function; Coding theory; Number theory; Primitive root modulo n; Combinatorics; Arithmetic; Algorithm; Mathematical analysis","score_opus":0.007425260864609705,"score_gpt":0.20348652576179313,"score_spread":0.19606126489718342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019616249","genre_codex":"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.8413232,0.0016794694,0.07412651,0.00093311904,0.00027833477,0.0000545299,0.0006897457,0.00034169303,0.08057341],"genre_scores_gemma":[0.98134494,0.00083134836,0.0095931515,0.000082010374,0.000118690186,0.000035000132,0.00032711244,0.000091834474,0.007575883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949515,0.00007011625,0.000027938106,0.00008527913,0.00020769137,0.00011384107],"domain_scores_gemma":[0.99897015,0.00050798495,0.00022629276,0.00010511874,0.00010976886,0.00008063685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575909,0.000567979,0.00041010347,0.0022726064,0.00057737395,0.0016612839,0.0005209121,0.00029341312,0.0055222316],"category_scores_gemma":[0.005247011,0.0002155487,0.0003141003,0.001745851,0.0016473118,0.0028423974,0.0011617319,0.0011179455,0.0013308611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030059504,0.000089498164,0.00385968,0.00020116068,0.00002463393,0.00060909084,0.00048605117,0.015835293,0.010266076,0.9076905,0.004440944,0.056196418],"study_design_scores_gemma":[0.000036365975,0.000055319862,0.0030280382,0.00012785195,0.000025251382,0.0008954685,0.00022389552,0.035340495,0.022546915,0.92650604,0.011132702,0.00008158159],"about_ca_topic_score_codex":0.0006744511,"about_ca_topic_score_gemma":0.00078469544,"teacher_disagreement_score":0.0055222316,"about_ca_system_score_codex":0.0010371647,"about_ca_system_score_gemma":0.0008050262,"threshold_uncertainty_score":0.018473685},"labels":[],"label_agreement":null},{"id":"W2020012988","doi":"10.3934/amc.2013.7.103","title":"Generalizations of Verheul's theorem to asymmetric pairings","year":2013,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Discrete mathematics; Crystallography; Crystal structure","score_opus":0.016959126994329065,"score_gpt":0.2840770749925573,"score_spread":0.26711794799822824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020012988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.07841565,0.0024390474,0.71362644,0.010599889,0.001185874,0.0003362008,0.0008898467,0.0007725097,0.19173458],"genre_scores_gemma":[0.80423754,0.003539926,0.14371222,0.0026460139,0.0013877614,0.00072721986,0.0008706331,0.000462276,0.042416334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99310726,0.001811244,0.0003492716,0.0011700551,0.0021293121,0.0014328476],"domain_scores_gemma":[0.9909859,0.0042987606,0.0004542416,0.0031353317,0.0008361087,0.0002897028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062321774,0.0014620571,0.0013502417,0.0019850158,0.0029803198,0.0032812033,0.0029848658,0.0020803527,0.012770514],"category_scores_gemma":[0.013472845,0.00083432,0.0024989578,0.0021324109,0.0054869014,0.016667385,0.008649488,0.006118016,0.002140839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031308733,0.000021643575,0.00011343365,0.00005186892,0.000008281143,0.00005978588,0.00010124805,0.0019612806,0.00043327667,0.98775697,0.0019417853,0.007519056],"study_design_scores_gemma":[0.000019484032,0.000015888365,0.00010238943,0.000018388411,0.000008052707,0.000087472145,0.000031544616,0.009092169,0.0014767706,0.9820467,0.007082718,0.00001836941],"about_ca_topic_score_codex":0.0018480741,"about_ca_topic_score_gemma":0.0011550912,"teacher_disagreement_score":0.012770514,"about_ca_system_score_codex":0.003753302,"about_ca_system_score_gemma":0.0020176875,"threshold_uncertainty_score":0.04272157},"labels":[],"label_agreement":null},{"id":"W2020692437","doi":"10.1016/s0012-365x(02)00622-2","title":"Optimal linear rate 12 codes over F5 and F7","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Separable space; Discrete mathematics; Linear code; Minimum distance; Block code; Algorithm; Decoding methods; Mathematical analysis","score_opus":0.01614580043218577,"score_gpt":0.2490812867798957,"score_spread":0.2329354863477099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020692437","genre_codex":"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.44540408,0.006641141,0.38268936,0.00834157,0.0008091773,0.00043686244,0.0037347712,0.0021420077,0.1498009],"genre_scores_gemma":[0.8731193,0.0020226054,0.09776341,0.0009954815,0.00034944553,0.00032494217,0.001095645,0.00033226178,0.023996968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652344,0.0010202393,0.00017855666,0.0003306387,0.00086016924,0.0010869384],"domain_scores_gemma":[0.9950955,0.0027188493,0.0005376639,0.00073265063,0.0006196422,0.00029570318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023879418,0.0014861228,0.0012718823,0.0014409869,0.0016796404,0.0028632637,0.0014083774,0.0021118543,0.011460139],"category_scores_gemma":[0.0075018248,0.0006081379,0.0007872423,0.0017095185,0.0018191393,0.0026392983,0.0028241528,0.0018909655,0.0024132035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022989481,0.00018370444,0.0010796477,0.00033503067,0.00009485784,0.0002445083,0.0004631119,0.047343772,0.009665613,0.7856429,0.016538115,0.13610981],"study_design_scores_gemma":[0.00047251562,0.00050048484,0.0009084863,0.00034974396,0.00013485369,0.0005185626,0.00034833327,0.1369913,0.020952145,0.8147846,0.023865394,0.00017363876],"about_ca_topic_score_codex":0.0021250856,"about_ca_topic_score_gemma":0.0028295293,"teacher_disagreement_score":0.011460139,"about_ca_system_score_codex":0.0029337048,"about_ca_system_score_gemma":0.0035686367,"threshold_uncertainty_score":0.038337946},"labels":[],"label_agreement":null},{"id":"W2020806681","doi":"10.1090/s0025-5718-00-01247-3","title":"Irreducibility testing over local fields","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Irreducibility; Irreducible polynomial; Laurent series; Polynomial ring; Laurent polynomial; Field (mathematics); Minimal polynomial (linear algebra); Finite field; Polynomial; Rational number; Bivariate analysis; Ring (chemistry); Pure mathematics; Rational function; Discrete mathematics; Series (stratigraphy); Algebra over a field; Square-free polynomial; Matrix polynomial; Mathematical analysis; Statistics","score_opus":0.024501179995209718,"score_gpt":0.26311842031686306,"score_spread":0.23861724032165332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020806681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.42587987,0.0005618567,0.5209339,0.0010945181,0.00024801528,0.00017238567,0.0010007053,0.006633731,0.043475058],"genre_scores_gemma":[0.94315434,0.0002196855,0.04730497,0.00015259576,0.00016040105,0.00005669618,0.0010060143,0.0005820756,0.007363142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963128,0.0007368953,0.00026782943,0.0009776605,0.0011237458,0.00058102957],"domain_scores_gemma":[0.9899928,0.006328833,0.0006024593,0.001650884,0.0009959751,0.00042906188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030362746,0.0008383108,0.0010342031,0.002302569,0.0011694568,0.0025885762,0.0015628507,0.0006317893,0.01255324],"category_scores_gemma":[0.012663376,0.00044314007,0.001448783,0.0015530052,0.0041403393,0.008053298,0.00409866,0.0024055156,0.0019096624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012590752,0.000311525,0.014347129,0.00072104024,0.000097973345,0.001551264,0.002184735,0.016075542,0.019186346,0.691408,0.0061774706,0.24667996],"study_design_scores_gemma":[0.00006508909,0.00023066712,0.0019833425,0.00012877332,0.00007948845,0.0006257112,0.0007739183,0.041479804,0.04908766,0.8925536,0.012912085,0.00007981699],"about_ca_topic_score_codex":0.0011278823,"about_ca_topic_score_gemma":0.0010178146,"teacher_disagreement_score":0.01255324,"about_ca_system_score_codex":0.0011767807,"about_ca_system_score_gemma":0.0008306678,"threshold_uncertainty_score":0.04199481},"labels":[],"label_agreement":null},{"id":"W2021947009","doi":"10.1007/s00200-012-0170-z","title":"Cryptanalysis of a key exchange protocol based on the endomorphisms ring End $${(\\mathbb{Z}_{p} \\times \\mathbb{Z}_{p^2})}$$","year":2012,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Endomorphism; Key exchange; Mathematics; Polynomial ring; Ring (chemistry); Combinatorics; Polynomial; Cryptanalysis; Discrete mathematics; Homogeneous; Endomorphism ring; Algorithm; Computer science; Public-key cryptography; Mathematical analysis; Cryptography","score_opus":0.011929259732617716,"score_gpt":0.2280390128712923,"score_spread":0.2161097531386746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021947009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.34464532,0.0004097926,0.6248935,0.0030364185,0.00040536578,0.0003467125,0.0002520985,0.0014913086,0.024519516],"genre_scores_gemma":[0.96620643,0.00011047562,0.02771784,0.00019839696,0.00005363637,0.00007498874,0.00007528461,0.000058474187,0.0055044373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997843,0.00059807,0.00011868745,0.0003483817,0.0007080352,0.00038382979],"domain_scores_gemma":[0.99828076,0.0008361546,0.0001761219,0.00045297266,0.00015379698,0.00010023215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019864219,0.0006130379,0.0008670998,0.0007211331,0.0010927301,0.0019817755,0.0010661717,0.0015894028,0.0035483844],"category_scores_gemma":[0.0031939005,0.0003923001,0.0010230133,0.00059074163,0.0020952118,0.0033558672,0.0021160569,0.0018389855,0.0006295206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015299317,0.00026576457,0.0015673831,0.0001289664,0.00017879074,0.0010594345,0.00039001077,0.038700007,0.033147153,0.8898333,0.0034527131,0.029746631],"study_design_scores_gemma":[0.00042742127,0.0005578034,0.0011751547,0.00005544747,0.00021291341,0.0012406481,0.00011034189,0.4921772,0.067817844,0.4291295,0.0069611007,0.00013463954],"about_ca_topic_score_codex":0.00038581048,"about_ca_topic_score_gemma":0.00032550067,"teacher_disagreement_score":0.0035483844,"about_ca_system_score_codex":0.0012137705,"about_ca_system_score_gemma":0.0018425717,"threshold_uncertainty_score":0.011870503},"labels":[],"label_agreement":null},{"id":"W2022705034","doi":"10.1155/2007/23408","title":"On Polynomials of the Form<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"E1\"><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mi>r</mml:mi></mml:msup><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>q</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>/</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>","year":2007,"lang":"lv","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science","score_opus":0.02183615666117088,"score_gpt":0.2576651709614648,"score_spread":0.2358290143002939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022705034","genre_codex":"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.040068913,0.00421642,0.48217374,0.006302287,0.0032175304,0.00028303263,0.0053958315,0.0032243496,0.4551179],"genre_scores_gemma":[0.48318413,0.008115916,0.13338888,0.0036495854,0.0032184294,0.00047073286,0.014149586,0.005914257,0.34790847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997689,0.00052226917,0.000106405365,0.0003796659,0.0007238933,0.00057862385],"domain_scores_gemma":[0.9969674,0.0014974045,0.0002407068,0.00038544592,0.00075934903,0.00014978531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002182596,0.0018379014,0.0009789584,0.0022663653,0.0018464159,0.003756718,0.0012367943,0.0008812378,0.094518915],"category_scores_gemma":[0.009353681,0.0007291006,0.0020174216,0.002992651,0.002235978,0.006661515,0.0035303026,0.0035878634,0.03915093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005124512,0.00012864747,0.0010242093,0.0005812252,0.00005738839,0.0004439284,0.0011037219,0.008854748,0.0029285657,0.75572884,0.13190036,0.09673584],"study_design_scores_gemma":[0.0001831319,0.00014222204,0.0014028146,0.00029132934,0.000071737784,0.00045642967,0.0005269392,0.02521796,0.0041172137,0.79628086,0.17121433,0.00009503766],"about_ca_topic_score_codex":0.0118240975,"about_ca_topic_score_gemma":0.014819899,"teacher_disagreement_score":0.094518915,"about_ca_system_score_codex":0.0029479421,"about_ca_system_score_gemma":0.0016980255,"threshold_uncertainty_score":0.31619728},"labels":[],"label_agreement":null},{"id":"W2022989647","doi":"10.1016/j.camwa.2007.04.028","title":"A new high dynamic range moduli set with efficient reverse converter","year":2007,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Adder; Chinese remainder theorem; Moduli; Residue number system; Modulo; Mathematics; Converters; Arithmetic; Binary number; Digital signal processing; Discrete mathematics; Computer science; Computer hardware; Voltage; Electrical engineering","score_opus":0.007711190744757583,"score_gpt":0.22308248098698208,"score_spread":0.21537129024222448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022989647","genre_codex":"methods","genre_gemma":"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.21560524,0.0023441454,0.6654157,0.0013360296,0.00087456097,0.00021739335,0.0008876168,0.0033747812,0.1099446],"genre_scores_gemma":[0.662925,0.0011439157,0.29558286,0.00062137534,0.00039152484,0.0002353893,0.0011699719,0.00046831014,0.037461616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993204,0.0000831681,0.00006298247,0.00017226998,0.00028218684,0.000078915946],"domain_scores_gemma":[0.99968684,0.000059364455,0.00003766032,0.0001298982,0.000050026654,0.000036202175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037993942,0.0007736665,0.0010359831,0.0014578161,0.0012804498,0.0021152818,0.0010689186,0.0009262396,0.008258906],"category_scores_gemma":[0.00057806994,0.00043526964,0.0006117451,0.0013363608,0.0009114206,0.0042815837,0.0026091759,0.0011077188,0.0028384929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000830169,0.0002258582,0.00071524305,0.00052280247,0.000085074265,0.0006982629,0.00034642225,0.010050441,0.13666947,0.60151654,0.012897893,0.23544186],"study_design_scores_gemma":[0.00034389636,0.0006311039,0.0008770474,0.00017417785,0.00023553151,0.0040102536,0.00018660387,0.09444019,0.21433753,0.5470474,0.13739865,0.00031764325],"about_ca_topic_score_codex":0.00008978544,"about_ca_topic_score_gemma":0.00013851351,"teacher_disagreement_score":0.008258906,"about_ca_system_score_codex":0.0004928269,"about_ca_system_score_gemma":0.0004912599,"threshold_uncertainty_score":0.02762878},"labels":[],"label_agreement":null},{"id":"W2023200896","doi":"10.1006/jsco.2001.0493","title":"Factoring Polynomials Over Local Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Factoring; Divisor (algebraic geometry); Prime factor; Irreducible polynomial; Basis (linear algebra); Prime (order theory); Factorization of polynomials; Polynomial; Greatest common divisor; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.015358704786723486,"score_gpt":0.26642591801028304,"score_spread":0.25106721322355957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023200896","genre_codex":"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.571907,0.0021376817,0.34123477,0.0027153168,0.0006983603,0.00012584573,0.00040374306,0.0015458555,0.0792315],"genre_scores_gemma":[0.9482533,0.0011312434,0.02717228,0.00022933341,0.00039396988,0.00003528034,0.00019006824,0.00030370415,0.022290763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999315,0.00013738235,0.000029669873,0.00011764457,0.00018826425,0.00021206276],"domain_scores_gemma":[0.9981396,0.0008259843,0.00017994185,0.00047723632,0.00021253529,0.00016476921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009500436,0.00092610327,0.0010699888,0.0014767086,0.0013736946,0.0022328184,0.0005718382,0.0006469567,0.009590221],"category_scores_gemma":[0.0039845705,0.0004922574,0.0007654469,0.0019031932,0.0030680879,0.005118914,0.0024913717,0.0021865324,0.0018668942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002990083,0.00007294291,0.0005863674,0.00010900474,0.000024747285,0.00016543496,0.0005654792,0.005180953,0.0041500605,0.93515265,0.0034634848,0.05022996],"study_design_scores_gemma":[0.000048158337,0.000079085745,0.00019880183,0.000038556183,0.000027071452,0.00017059728,0.00012686217,0.009774014,0.0037669947,0.9780748,0.00766853,0.00002654202],"about_ca_topic_score_codex":0.0010602312,"about_ca_topic_score_gemma":0.0014120317,"teacher_disagreement_score":0.009590221,"about_ca_system_score_codex":0.0011809916,"about_ca_system_score_gemma":0.00076192204,"threshold_uncertainty_score":0.03208244},"labels":[],"label_agreement":null},{"id":"W2023845030","doi":"10.1090/s0002-9939-06-08611-4","title":"Sequences of consecutive smooth polynomials over a finite field","year":2006,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Mathematics; Field (mathematics); Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.008015191550753458,"score_gpt":0.23347816049446432,"score_spread":0.22546296894371087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023845030","genre_codex":"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.36482474,0.0015546973,0.46010032,0.0033576596,0.0014657452,0.00016300881,0.0018095049,0.0032320304,0.16349225],"genre_scores_gemma":[0.8269603,0.0012555501,0.09746073,0.00068158825,0.000510006,0.00020999703,0.002048909,0.0013703938,0.06950256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880373,0.00020914237,0.000055594384,0.00025635952,0.0004351824,0.00023992681],"domain_scores_gemma":[0.9973023,0.0010900393,0.00027301683,0.00031876983,0.000746995,0.00026891383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008977401,0.0010955308,0.00056053203,0.0017389555,0.0019703244,0.0018801526,0.00089539075,0.000769334,0.016457822],"category_scores_gemma":[0.0061565298,0.0005413938,0.0010354172,0.0016151305,0.0018563662,0.003873488,0.0022550926,0.0022499368,0.003452698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026805478,0.00009474793,0.0016983335,0.00033556155,0.00004301644,0.0011144595,0.0009424992,0.0026482358,0.008436158,0.92878944,0.009653488,0.045975912],"study_design_scores_gemma":[0.00015384081,0.00023442738,0.0048651164,0.00027027988,0.00008841871,0.00203441,0.000995576,0.024463903,0.022626713,0.8575559,0.08655824,0.00015306521],"about_ca_topic_score_codex":0.0019403009,"about_ca_topic_score_gemma":0.0026276081,"teacher_disagreement_score":0.016457822,"about_ca_system_score_codex":0.0017273411,"about_ca_system_score_gemma":0.00085307454,"threshold_uncertainty_score":0.05505693},"labels":[],"label_agreement":null},{"id":"W2026608328","doi":"10.5555/1756384.1756394","title":"Prime decompositions of regular prefix codes","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix code; Prefix; Prime (order theory); Computer science; Automaton; Decomposition; Code (set theory); Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Linear code; Combinatorics; Block code; Programming language; Decoding methods","score_opus":0.03602243854098058,"score_gpt":0.33652188973629704,"score_spread":0.30049945119531646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026608328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4589841,0.00066846696,0.4686506,0.0010488873,0.00033003144,0.00016579758,0.000587642,0.00077367504,0.06879069],"genre_scores_gemma":[0.85940206,0.00053798256,0.1023566,0.0003954719,0.00022886498,0.00019770043,0.0008948232,0.00045047433,0.03553604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993273,0.0001463383,0.000051506537,0.00011807708,0.0001842326,0.00017267285],"domain_scores_gemma":[0.99796814,0.0008803933,0.00018697734,0.00035560012,0.00032014563,0.0002886895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009419193,0.00047609047,0.00068838237,0.0015647999,0.0012514067,0.002392285,0.0005874147,0.0007054227,0.008816199],"category_scores_gemma":[0.0033895853,0.0005613404,0.00083062146,0.0009585863,0.0016990822,0.002808382,0.001934842,0.0015738118,0.001397382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008556152,0.000021108737,0.0001866696,0.000020757292,0.000005011608,0.000056156136,0.00019076731,0.0022794611,0.0015355097,0.9851022,0.0011236799,0.0093931435],"study_design_scores_gemma":[0.000016217931,0.000023533867,0.0001094523,0.000011527653,0.000007680611,0.000069992304,0.000060520284,0.012017833,0.0013460778,0.983275,0.0030519562,0.000010150733],"about_ca_topic_score_codex":0.0006686886,"about_ca_topic_score_gemma":0.0007718299,"teacher_disagreement_score":0.008816199,"about_ca_system_score_codex":0.0010113255,"about_ca_system_score_gemma":0.00089283806,"threshold_uncertainty_score":0.029493153},"labels":[],"label_agreement":null},{"id":"W2026640529","doi":"10.2748/tmj/1309952085","title":"On Oda's strong factorization conjecture","year":2011,"lang":"en","type":"article","venue":"Tohoku Mathematical Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Conjecture; Mathematics; Factorization; Sequence (biology); Decomposition; Pure mathematics; Combinatorics; Algorithm","score_opus":0.03626312718531713,"score_gpt":0.24117101254655554,"score_spread":0.2049078853612384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026640529","genre_codex":"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.4615863,0.002612885,0.3465202,0.008721249,0.0011802202,0.00027295406,0.0013486766,0.002122265,0.17563522],"genre_scores_gemma":[0.9271826,0.00082678994,0.050895575,0.0009357729,0.0003920047,0.00013835006,0.0011769818,0.00018255677,0.01826929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844676,0.00022051575,0.00009032789,0.0004819606,0.00038210835,0.00037835457],"domain_scores_gemma":[0.9979113,0.0008752968,0.000107205924,0.0005833799,0.00029680217,0.00022603908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019855383,0.0006626112,0.0009664835,0.0010238952,0.0028754317,0.0030124006,0.00088972476,0.0011245534,0.011429616],"category_scores_gemma":[0.00586864,0.00046578233,0.0013011612,0.001027729,0.0043394244,0.007993316,0.0038401776,0.002982361,0.002132155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038414815,0.00008462454,0.0018284917,0.00012417808,0.000014322877,0.00022904457,0.0006711417,0.0045992676,0.0021756068,0.954485,0.006496082,0.028908009],"study_design_scores_gemma":[0.000051921106,0.000073555464,0.0007508999,0.000060261085,0.000030192368,0.00021847078,0.00039421767,0.019061567,0.0026746192,0.95948887,0.017158324,0.00003707027],"about_ca_topic_score_codex":0.0028031387,"about_ca_topic_score_gemma":0.0022988445,"teacher_disagreement_score":0.011429616,"about_ca_system_score_codex":0.0014257256,"about_ca_system_score_gemma":0.001313755,"threshold_uncertainty_score":0.038235843},"labels":[],"label_agreement":null},{"id":"W2027233581","doi":"10.1016/j.ffa.2013.07.004","title":"Existence and properties of k -normal elements over finite fields","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Element (criminal law); Prime (order theory); Divisor (algebraic geometry); Degree (music); Combinatorics; Basis (linear algebra); Discrete mathematics; Geometry; Physics","score_opus":0.017728857083650736,"score_gpt":0.21196420681937672,"score_spread":0.19423534973572598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027233581","genre_codex":"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.8730884,0.0015626583,0.07620736,0.0021693117,0.00012595681,0.00005144848,0.00034492288,0.00021334589,0.046236657],"genre_scores_gemma":[0.979014,0.00096369535,0.009906713,0.00012442117,0.00023631217,0.00004197311,0.000300542,0.00005174769,0.009360672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988944,0.00023581952,0.000102485705,0.00022972189,0.00027540035,0.0002621168],"domain_scores_gemma":[0.9903104,0.0061267354,0.0010177854,0.0005878856,0.00096273154,0.0009946115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017269317,0.0006069943,0.0008918895,0.0026732665,0.0016934338,0.004627556,0.0012342164,0.0011498355,0.0038358422],"category_scores_gemma":[0.009166958,0.0007726034,0.00070468494,0.002173154,0.0057740347,0.0091381455,0.0026525308,0.002857743,0.0006784439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018861999,0.00007181137,0.0017149978,0.00006641928,0.000014692576,0.00011655469,0.0007981621,0.001190604,0.002587476,0.98747534,0.0004476686,0.005327705],"study_design_scores_gemma":[0.00004448608,0.000062319865,0.00057229196,0.00004264892,0.000017660897,0.0004089604,0.00043073064,0.0048604105,0.0026091905,0.9884808,0.0024403587,0.000030004003],"about_ca_topic_score_codex":0.00060511264,"about_ca_topic_score_gemma":0.00041428357,"teacher_disagreement_score":0.004627556,"about_ca_system_score_codex":0.0016996291,"about_ca_system_score_gemma":0.0008834259,"threshold_uncertainty_score":0.012832224},"labels":[],"label_agreement":null},{"id":"W2027498302","doi":"10.1109/isit.2012.6284696","title":"An algorithm for list decoding number field codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Field (mathematics); Berlekamp–Welch algorithm; Sequential decoding; Concatenated error correction code; Mathematics; Block code","score_opus":0.01894112619763092,"score_gpt":0.29846814453240456,"score_spread":0.2795270183347736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027498302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.0073626894,0.00026105673,0.9776233,0.00059810985,0.00020729368,0.00023824544,0.0004772192,0.005228829,0.008003278],"genre_scores_gemma":[0.10243792,0.0003631942,0.87941307,0.0005386091,0.00023321564,0.0005026924,0.0022700871,0.0009390465,0.013302086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824727,0.0002734421,0.00015077062,0.000241575,0.0008321753,0.0002547378],"domain_scores_gemma":[0.99764013,0.0007357142,0.00013674746,0.00052649825,0.00084515684,0.00011581039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007829372,0.0010192028,0.00090616633,0.0018588293,0.0011530069,0.0022816795,0.0013842317,0.0015493998,0.0109647885],"category_scores_gemma":[0.0043896637,0.00044437274,0.00071887433,0.0020100963,0.00081673614,0.0026866996,0.0028746077,0.0020254385,0.008931186],"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.00045602387,0.00023967841,0.0012648492,0.0004613151,0.00007156141,0.0004084017,0.00051486,0.032107886,0.02552934,0.1497883,0.037696984,0.75146073],"study_design_scores_gemma":[0.00043664806,0.00058659975,0.0007520971,0.00021725253,0.00013537303,0.0013209764,0.00026625546,0.4321401,0.08094376,0.38001373,0.10295959,0.00022762507],"about_ca_topic_score_codex":0.0016357009,"about_ca_topic_score_gemma":0.002046161,"teacher_disagreement_score":0.0109647885,"about_ca_system_score_codex":0.0014529506,"about_ca_system_score_gemma":0.002206995,"threshold_uncertainty_score":0.036680818},"labels":[],"label_agreement":null},{"id":"W2028343756","doi":"10.1016/j.ffa.2008.07.002","title":"On ternary Kloosterman sums modulo 12","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Mathematics; Modulo; Ternary operation; Class (philosophy); Combinatorics; Discrete mathematics; Characterization (materials science); Arithmetic; Computer science","score_opus":0.01683112379226085,"score_gpt":0.2086362918083391,"score_spread":0.19180516801607825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028343756","genre_codex":"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.3790501,0.008778095,0.11783904,0.0061324793,0.004044047,0.00015818187,0.00057833764,0.0005829265,0.48283675],"genre_scores_gemma":[0.85599834,0.0039000972,0.019236686,0.0014177399,0.0018200104,0.0001444769,0.00029940566,0.00027111467,0.116912104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988147,0.00030569057,0.00007732356,0.00014437542,0.00034483083,0.00031315745],"domain_scores_gemma":[0.99868745,0.00073170045,0.00017535666,0.00013677332,0.00013909634,0.00012970844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013546809,0.0015072103,0.0015208125,0.0034769333,0.0034766512,0.0041862475,0.0011548304,0.0015591133,0.015160125],"category_scores_gemma":[0.0039242045,0.00064846594,0.00087592413,0.004130483,0.004137562,0.006376437,0.0038431992,0.0029000344,0.0029705907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039144114,0.000017111008,0.000060267233,0.000043879143,0.000005046518,0.000063142055,0.00023325128,0.00042601323,0.00038699343,0.9888226,0.0016444813,0.008258048],"study_design_scores_gemma":[0.000009596574,0.000012412343,0.000073763964,0.000034468074,0.000009160496,0.00012549324,0.0000671699,0.0010996313,0.000648253,0.991719,0.0061846534,0.000016347974],"about_ca_topic_score_codex":0.0006063398,"about_ca_topic_score_gemma":0.0009224654,"teacher_disagreement_score":0.015160125,"about_ca_system_score_codex":0.0021992172,"about_ca_system_score_gemma":0.0012334725,"threshold_uncertainty_score":0.050715625},"labels":[],"label_agreement":null},{"id":"W2028643223","doi":"10.1007/s12095-013-0089-7","title":"Resilience to distinguishing attacks on WG-7 cipher and their generalizations","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Stream cipher attack; Computer science; Cipher; Cryptography; Correlation attack; Transposition cipher; Resilience (materials science); Computer security; Theoretical computer science; Arithmetic; Running key cipher; Mathematics; Encryption","score_opus":0.020968303989266152,"score_gpt":0.252730133834662,"score_spread":0.2317618298453958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028643223","genre_codex":"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.7461624,0.0010709447,0.22655086,0.0017216213,0.00020450025,0.00012619565,0.00042725506,0.0010774191,0.02265877],"genre_scores_gemma":[0.9880503,0.0003379676,0.008090019,0.00009645601,0.00009740844,0.000034636352,0.00013773088,0.000054949127,0.0031006078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802375,0.00041447722,0.000108582666,0.00028849317,0.0006057953,0.0005588853],"domain_scores_gemma":[0.99258465,0.0027195907,0.0012694204,0.002619682,0.00046415074,0.00034250302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017216196,0.0007593467,0.0009852636,0.0017312726,0.0009647259,0.0014706979,0.00086112216,0.0012887727,0.0020789723],"category_scores_gemma":[0.0063731926,0.0003623245,0.0010583416,0.0011194209,0.001972117,0.0035586045,0.0028864352,0.002426652,0.00062319817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013168125,0.00014996128,0.0025720075,0.00014500106,0.000104263796,0.0006197601,0.0006795373,0.09052191,0.033573605,0.8284194,0.004381558,0.03751604],"study_design_scores_gemma":[0.000087231216,0.00028468075,0.0017396327,0.000063790874,0.00010574171,0.0010347437,0.00023142567,0.3472266,0.028414978,0.6161,0.0046124305,0.000098739074],"about_ca_topic_score_codex":0.0003791602,"about_ca_topic_score_gemma":0.00026518933,"teacher_disagreement_score":0.0020789723,"about_ca_system_score_codex":0.00094646815,"about_ca_system_score_gemma":0.0009446222,"threshold_uncertainty_score":0.0091049075},"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":"W2028982966","doi":"10.1090/s0025-5718-2012-02625-1","title":"Squaring in cyclotomic subgroups","year":2012,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Mathematics; Multiplicative group; Exponent; Computation; Pairing; Multiplicative function; Arithmetic; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.016872427647273036,"score_gpt":0.2551459051146664,"score_spread":0.23827347746739336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028982966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.23866864,0.00067842664,0.7448301,0.0005648565,0.0002477728,0.000185694,0.00012905887,0.0014662677,0.013229095],"genre_scores_gemma":[0.72538286,0.0004100336,0.2680147,0.00025506408,0.00021782254,0.00009218931,0.00022022272,0.00021157434,0.0051956237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996093,0.000058121255,0.000038547114,0.00007185325,0.00017016058,0.00005207591],"domain_scores_gemma":[0.9992378,0.00025868023,0.00010756989,0.00023379085,0.00011994877,0.00004220222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043370549,0.00040901598,0.00041560887,0.0007533004,0.0004942441,0.00087362947,0.0006090518,0.000507796,0.0037791403],"category_scores_gemma":[0.0026920815,0.0001554643,0.00049140345,0.00076687755,0.0009636906,0.002355661,0.0012590663,0.0009719515,0.000692515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047078077,0.00013519016,0.0015577507,0.0002547072,0.00004059195,0.0004796412,0.0005739932,0.021525713,0.08074823,0.4949564,0.0042317733,0.39502525],"study_design_scores_gemma":[0.000149283,0.0008962184,0.000986343,0.00010866609,0.00008748245,0.0015186201,0.0002832013,0.23165062,0.13158903,0.5970373,0.035585225,0.0001080837],"about_ca_topic_score_codex":0.00020698951,"about_ca_topic_score_gemma":0.0003422791,"teacher_disagreement_score":0.0037791403,"about_ca_system_score_codex":0.00044664243,"about_ca_system_score_gemma":0.0002985297,"threshold_uncertainty_score":0.012642503},"labels":[],"label_agreement":null},{"id":"W2029378260","doi":"10.1109/tit.2003.814487","title":"Linear transformation shift registers","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shift register; Primitive polynomial; Transformation (genetics); Linear feedback shift register; Enumeration; Linear map; Order (exchange); Computer science; Algorithm; Mathematics; Discrete mathematics; Arithmetic; Finite field; Combinatorics; Biology; Pure mathematics; Genetics","score_opus":0.011209562116979564,"score_gpt":0.22122789059540562,"score_spread":0.21001832847842605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029378260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.036392286,0.002787866,0.8858837,0.0007469658,0.0005299049,0.00035010852,0.0005780246,0.005593731,0.06713752],"genre_scores_gemma":[0.6447849,0.002161541,0.29261714,0.0009792492,0.00040626744,0.00034533307,0.0009911443,0.00036958136,0.05734484],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993649,0.000096971366,0.00004601014,0.00016580189,0.00023198705,0.00009439056],"domain_scores_gemma":[0.99945897,0.00012717124,0.000072114955,0.0001752919,0.0001438422,0.000022710703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031787282,0.00053895585,0.0003815699,0.00060189125,0.0005329542,0.0010854764,0.0007109275,0.0005449067,0.013381337],"category_scores_gemma":[0.0013142651,0.0002592062,0.00051243056,0.0007874952,0.00078294287,0.0019233824,0.0010857577,0.0009994064,0.005762615],"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.0005574672,0.00011995582,0.00049685943,0.0005744577,0.000040700663,0.00035911187,0.00029134468,0.010800006,0.093109526,0.41759202,0.01006211,0.46599644],"study_design_scores_gemma":[0.0002357979,0.0010332969,0.00074570946,0.00018257003,0.00012228113,0.0019774642,0.00014893801,0.07427359,0.26046455,0.37725043,0.28343028,0.00013500465],"about_ca_topic_score_codex":0.00025004012,"about_ca_topic_score_gemma":0.00036615613,"teacher_disagreement_score":0.013381337,"about_ca_system_score_codex":0.00053157477,"about_ca_system_score_gemma":0.00057115156,"threshold_uncertainty_score":0.044764996},"labels":[],"label_agreement":null},{"id":"W2030638761","doi":"10.1145/1576702.1576731","title":"On factorization of multivariate polynomials over algebraic number and function fields","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Factorization; Algebraic number; Factorization of polynomials; Mathematics; Algebra over a field; Multivariate statistics; Algebraic function; Difference polynomials; Function (biology); Finite field; Pure mathematics; Discrete mathematics; Polynomial; Algorithm; Orthogonal polynomials; Statistics; Mathematical analysis; Matrix polynomial","score_opus":0.00914723466052212,"score_gpt":0.2399271721599932,"score_spread":0.2307799374994711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030638761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.038631894,0.0005868958,0.9519127,0.00036734407,0.000060722978,0.0001735213,0.00028727402,0.002940317,0.0050393185],"genre_scores_gemma":[0.19920366,0.0005906434,0.7901147,0.00015062818,0.00009469771,0.00019864575,0.0015142779,0.00036432286,0.007768475],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985856,0.00025108768,0.000086639375,0.00030235323,0.00041136082,0.00036299383],"domain_scores_gemma":[0.99831367,0.00069876865,0.00015250797,0.0005047585,0.00023551281,0.000094812545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013590908,0.001381693,0.0012274758,0.0012181903,0.0011332657,0.0020938963,0.0013057609,0.0009321839,0.008293198],"category_scores_gemma":[0.0040115197,0.00045823515,0.0011566503,0.0018901387,0.0013534881,0.0051684813,0.0030781003,0.001515909,0.0037826514],"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.0012624188,0.0003469267,0.0030398292,0.000507141,0.00011356558,0.00054843666,0.00082907436,0.064784504,0.023575846,0.168741,0.021051776,0.71519953],"study_design_scores_gemma":[0.00037239902,0.00048954645,0.0012107536,0.00019289699,0.00011557258,0.0011463235,0.00048802217,0.48934418,0.036489077,0.4374024,0.03261158,0.00013722894],"about_ca_topic_score_codex":0.0031579817,"about_ca_topic_score_gemma":0.0039085513,"teacher_disagreement_score":0.008293198,"about_ca_system_score_codex":0.001330844,"about_ca_system_score_gemma":0.0017199748,"threshold_uncertainty_score":0.027743578},"labels":[],"label_agreement":null},{"id":"W2031833962","doi":"10.1016/j.dam.2006.11.007","title":"Generalized hyper-bent functions over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mtext>GF</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bent molecular geometry; Mathematics; Quadratic equation; Function (biology); Quadratic function; Combinatorics; Scroll; Algorithm; Discrete mathematics; Geometry; Theology","score_opus":0.019055043462171014,"score_gpt":0.24291491727254108,"score_spread":0.22385987381037006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031833962","genre_codex":"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.20428304,0.0025943022,0.5243695,0.0036367273,0.0012394186,0.0002414184,0.005936644,0.0041900272,0.2535089],"genre_scores_gemma":[0.73291963,0.0032734703,0.12276963,0.0017064861,0.0008722335,0.00029354743,0.0044339076,0.0018387696,0.13189238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939024,0.00014359615,0.00005597661,0.00011676256,0.00017810668,0.000115283656],"domain_scores_gemma":[0.9989905,0.0002460885,0.00011886417,0.00028384532,0.00027614407,0.00008459567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006574644,0.0009901603,0.0005739084,0.0016070871,0.0006262583,0.002453273,0.0006573626,0.0006091714,0.023330623],"category_scores_gemma":[0.0022400026,0.0004273299,0.00067723583,0.0023022592,0.0009078922,0.0027562066,0.0013158765,0.0019022829,0.011052358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005202174,0.000068609945,0.0004983515,0.00028189964,0.000043107408,0.00047529594,0.0004420726,0.005581914,0.013344697,0.81307906,0.02842315,0.13724156],"study_design_scores_gemma":[0.00014014338,0.00021561004,0.0016571148,0.00020719318,0.00006636789,0.0013196006,0.00028529356,0.028516706,0.01939218,0.80949295,0.13856725,0.00013959728],"about_ca_topic_score_codex":0.001141109,"about_ca_topic_score_gemma":0.0013738025,"teacher_disagreement_score":0.023330623,"about_ca_system_score_codex":0.0011659496,"about_ca_system_score_gemma":0.0006919245,"threshold_uncertainty_score":0.078048706},"labels":[],"label_agreement":null},{"id":"W2032009701","doi":"10.1016/j.ffa.2008.12.001","title":"On permutation polynomials of prescribed shape","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Permutation (music); Monomial; Combinatorics; Cyclic permutation; Discrete mathematics; Symmetric group","score_opus":0.01871378267860119,"score_gpt":0.22158749130205907,"score_spread":0.20287370862345788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032009701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.38440594,0.0031312052,0.39390814,0.0047627576,0.0013828094,0.00012672617,0.0005198751,0.00041802827,0.21134453],"genre_scores_gemma":[0.91027486,0.0031902434,0.032984074,0.00069699925,0.0012682156,0.0001270435,0.0003127627,0.0002304301,0.05091536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908817,0.00031151026,0.000026810554,0.00011018639,0.000271296,0.00019205689],"domain_scores_gemma":[0.9971944,0.001720923,0.00034224443,0.0003111892,0.00023456391,0.00019665537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011681736,0.0013136176,0.0011802224,0.002230129,0.0016263548,0.0023610361,0.0012506823,0.0017912826,0.006864659],"category_scores_gemma":[0.006197837,0.00064341177,0.0008316395,0.0029766494,0.0053821523,0.0050556767,0.002783972,0.0030033293,0.0012511463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021278693,0.0000071094382,0.000038859867,0.000012817925,0.0000012390469,0.00002672443,0.00007459768,0.0010858967,0.00020473778,0.9947948,0.00050996523,0.0032221065],"study_design_scores_gemma":[0.0000084661515,0.000008949333,0.000037655434,0.000010149233,0.0000019619727,0.00004679435,0.00002808072,0.0043440806,0.00015171262,0.99395436,0.0014000133,0.0000076541355],"about_ca_topic_score_codex":0.0010581354,"about_ca_topic_score_gemma":0.00093576463,"teacher_disagreement_score":0.006864659,"about_ca_system_score_codex":0.0017961441,"about_ca_system_score_gemma":0.0010335821,"threshold_uncertainty_score":0.022964597},"labels":[],"label_agreement":null},{"id":"W2033410192","doi":"10.4153/cmb-2007-007-2","title":"Polynomials for Kloosterman Sums","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kloosterman sum; Modulo; Multiplicative function; Finite field; Multiplicative inverse; Combinatorics; Polynomial; Factorization; Integer (computer science); Quadratic residue; Discrete mathematics; Inverse; Mathematical analysis; Algorithm","score_opus":0.012777083185492638,"score_gpt":0.2359168955431471,"score_spread":0.22313981235765445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033410192","genre_codex":"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.61502457,0.002940018,0.20550561,0.0026215077,0.00071497133,0.0001295529,0.0007253504,0.00056045415,0.17177787],"genre_scores_gemma":[0.9451678,0.0011913722,0.027454318,0.00026858025,0.00054432516,0.000074114774,0.00032196514,0.00013103044,0.024846489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992742,0.000118143784,0.00003753386,0.0001229836,0.00027210946,0.00017512149],"domain_scores_gemma":[0.9991596,0.0003619059,0.00014781242,0.00009883479,0.00012313476,0.00010866375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086676073,0.0006417472,0.0004974313,0.0018042052,0.0012020138,0.0019058797,0.000575195,0.0005294517,0.008986312],"category_scores_gemma":[0.0041699335,0.00026712375,0.0007034457,0.0012774088,0.0022055106,0.0032664381,0.0011191203,0.0017193306,0.0016948493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049409562,0.000014057465,0.0002680919,0.000053942684,0.0000042929837,0.00011936749,0.00023210607,0.0016922493,0.0011661075,0.9852541,0.0010078129,0.010138509],"study_design_scores_gemma":[0.000014632046,0.000030576233,0.0004244772,0.000037681537,0.0000068211793,0.00022179009,0.00008108115,0.006763645,0.0014885186,0.98419523,0.00671479,0.00002076908],"about_ca_topic_score_codex":0.0009289051,"about_ca_topic_score_gemma":0.0010491502,"teacher_disagreement_score":0.008986312,"about_ca_system_score_codex":0.0016284976,"about_ca_system_score_gemma":0.0008481357,"threshold_uncertainty_score":0.030062258},"labels":[],"label_agreement":null},{"id":"W2035855915","doi":"10.1016/j.laa.2008.09.003","title":"An application of lattice basis reduction to polynomial identities for algebraic structures","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Universidade de São Paulo; University of Saskatchewan","keywords":"Mathematics; Hermite polynomials; Gröbner basis; Lattice reduction; Lattice (music); Algebraic number; Basis (linear algebra); Degree (music); Combinatorics; Reduction (mathematics); Pure mathematics; Commutative property; Matrix (chemical analysis); Degree of a polynomial; Row; Polynomial; Discrete mathematics; Algebra over a field; Mathematical analysis; Geometry; Computer science; Statistics","score_opus":0.0152494029441316,"score_gpt":0.2670228281900699,"score_spread":0.2517734252459383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035855915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.05523375,0.0028676353,0.7440302,0.0044173915,0.0017880184,0.00014714693,0.00020145175,0.0007867417,0.1905277],"genre_scores_gemma":[0.61754066,0.0035623175,0.31490627,0.0015061025,0.002132749,0.0002124032,0.00037429854,0.00062587345,0.059139304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992386,0.00027864118,0.000035134788,0.00009996111,0.00025512965,0.00009253262],"domain_scores_gemma":[0.9992835,0.000372236,0.000034419558,0.000130266,0.000111730995,0.00006785363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836477,0.0006744804,0.0012193084,0.0016705714,0.0017170421,0.0026346508,0.0012948613,0.0010711628,0.0067039463],"category_scores_gemma":[0.0030397621,0.00054429885,0.0014679659,0.0018909052,0.0031387617,0.0039291712,0.003446651,0.0038370136,0.0016864986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022836452,0.000045851462,0.00008339902,0.000039650004,0.000007843678,0.000056715304,0.00016931933,0.0012753322,0.00090608676,0.9776593,0.0026066757,0.017127063],"study_design_scores_gemma":[0.000012099801,0.000012337626,0.00004770027,0.000010584861,0.000006802972,0.00007701492,0.000038966442,0.010455316,0.0006580798,0.9825188,0.0061499197,0.000012373068],"about_ca_topic_score_codex":0.0012937839,"about_ca_topic_score_gemma":0.0014323723,"teacher_disagreement_score":0.0067039463,"about_ca_system_score_codex":0.0011171615,"about_ca_system_score_gemma":0.00096270174,"threshold_uncertainty_score":0.022426903},"labels":[],"label_agreement":null},{"id":"W2036466669","doi":"10.1109/tit.2014.2361347","title":"Prefactor Reduction of the Guruswami–Sudan Interpolation Step","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Interpolation (computer graphics); Univariate; Polynomial; Monomial; Applied mathematics; Modulo; Projection (relational algebra); Reduction (mathematics); Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Mathematical analysis; Multivariate statistics","score_opus":0.006828599215914099,"score_gpt":0.2012428588132299,"score_spread":0.19441425959731579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036466669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.068936825,0.00051916856,0.91358435,0.00031630142,0.00011723395,0.00013882486,0.00017392589,0.0012407746,0.014972667],"genre_scores_gemma":[0.41241965,0.0005398778,0.57826865,0.00018715308,0.00008624003,0.0001521377,0.00043219005,0.00025296494,0.00766111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916077,0.00020860489,0.000042809497,0.0000842378,0.00039279315,0.00011077348],"domain_scores_gemma":[0.99872714,0.0005396971,0.00008230172,0.00038975268,0.00021277848,0.000048391543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008458372,0.00093556364,0.0005907011,0.00068534276,0.0006082269,0.0006764044,0.0008570048,0.00041973492,0.004474969],"category_scores_gemma":[0.0033824216,0.00023101959,0.0006298372,0.00076300465,0.000695031,0.0011858704,0.001586221,0.0015077781,0.001651111],"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.0011247076,0.00020172475,0.0017190706,0.00045579753,0.00006081678,0.00089699106,0.00040371565,0.08506229,0.11191632,0.33092034,0.0059245583,0.4613136],"study_design_scores_gemma":[0.000085089705,0.00046741933,0.00084973144,0.0001138878,0.00007040662,0.0010539155,0.00012775938,0.6506918,0.18302734,0.14109989,0.022307975,0.000104741404],"about_ca_topic_score_codex":0.0008480578,"about_ca_topic_score_gemma":0.0016748275,"teacher_disagreement_score":0.004474969,"about_ca_system_score_codex":0.0005365052,"about_ca_system_score_gemma":0.0015759298,"threshold_uncertainty_score":0.014970243},"labels":[],"label_agreement":null},{"id":"W2037565534","doi":"10.1016/j.jcta.2012.05.003","title":"Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Integer (computer science); Prime (order theory); Coprime integers; Discrete mathematics; Prime power; Sequence (biology); Character (mathematics); Binary number; Arithmetic","score_opus":0.015578767243669647,"score_gpt":0.24843029463459676,"score_spread":0.23285152739092713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037565534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7407388,0.002075244,0.12458292,0.014666697,0.0012971754,0.000059644066,0.00035787481,0.00047272214,0.11574895],"genre_scores_gemma":[0.98258305,0.00040770858,0.007741286,0.0009863916,0.00078055065,0.000052016043,0.00014320512,0.000073986346,0.0072318166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969387,0.0008250598,0.00016963073,0.000478593,0.00081957097,0.0007685505],"domain_scores_gemma":[0.9911028,0.0050112074,0.0008027974,0.0012837012,0.0007112662,0.001088189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055879825,0.00096594123,0.002251015,0.0028225887,0.004879433,0.006205837,0.0019323573,0.0032028062,0.00557193],"category_scores_gemma":[0.018851932,0.001097676,0.0017851669,0.0025673574,0.010413581,0.010118383,0.0066055013,0.0067050923,0.00081028196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003910248,0.00001967907,0.0003693845,0.000016039303,0.000007725567,0.000092050075,0.00014355268,0.00071066886,0.00018999675,0.9955485,0.0012358308,0.0016274315],"study_design_scores_gemma":[0.000014369029,0.000009491471,0.00015168784,0.000010500943,0.000007618542,0.00008617989,0.000034995333,0.0027737657,0.00020368933,0.9960179,0.0006713448,0.000018500907],"about_ca_topic_score_codex":0.0010532461,"about_ca_topic_score_gemma":0.00081056997,"teacher_disagreement_score":0.006205837,"about_ca_system_score_codex":0.002062709,"about_ca_system_score_gemma":0.0014738932,"threshold_uncertainty_score":0.0295524},"labels":[],"label_agreement":null},{"id":"W2038133289","doi":"10.1109/ccece.2010.5575253","title":"Retimed two-step CRC computation on FPGA","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Western University","funders":"","keywords":"Retiming; Field-programmable gate array; Computer science; Cyclic redundancy check; Computation; Parallel computing; Redundancy (engineering); Architecture; Critical path method; Gate array; Reconfigurable computing; Algorithm; Computer architecture; Embedded system; Engineering","score_opus":0.01017250073737118,"score_gpt":0.25162253981354843,"score_spread":0.24145003907617724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038133289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2581821,0.0010050712,0.7247972,0.0003498426,0.0002584653,0.00017189968,0.00017292026,0.006854647,0.008207765],"genre_scores_gemma":[0.62591594,0.00022673784,0.36725992,0.00016440246,0.000039292572,0.00006887451,0.00013870746,0.000059652328,0.0061263815],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996525,0.00006706178,0.000021361058,0.00006507852,0.00013575357,0.00005825529],"domain_scores_gemma":[0.9994795,0.00010647847,0.000047872923,0.0001804255,0.00015670678,0.000029090888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002988039,0.00046252576,0.00036233006,0.0008317525,0.0003687694,0.00045744152,0.0010205616,0.00038923597,0.0025317208],"category_scores_gemma":[0.000751764,0.00025424268,0.000292091,0.00054178585,0.00026090883,0.0007085635,0.00040888457,0.00047576425,0.0005665967],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016452739,0.00017529231,0.0012386049,0.00032985627,0.00008106899,0.000820658,0.00028032303,0.05069971,0.31873718,0.024827976,0.0056269597,0.5955371],"study_design_scores_gemma":[0.0003243281,0.0019766784,0.0029192106,0.000091165886,0.00013283255,0.0018159808,0.00009400734,0.57112986,0.39057574,0.0073266113,0.023464251,0.00014938055],"about_ca_topic_score_codex":0.002888853,"about_ca_topic_score_gemma":0.0064131604,"teacher_disagreement_score":0.002888853,"about_ca_system_score_codex":0.0008667703,"about_ca_system_score_gemma":0.0011430336,"threshold_uncertainty_score":0.008469403},"labels":[],"label_agreement":null},{"id":"W2040499330","doi":"10.5539/jmr.v7n2p18","title":"The Distribution of Zeros of Quadratic Forms over Finite Fields","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Finite field; Prime (order theory); Distribution (mathematics); Field (mathematics); Type (biology); Mathematical analysis; Pure mathematics","score_opus":0.12018099274955318,"score_gpt":0.3836044058321988,"score_spread":0.2634234130826456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040499330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9690316,0.00030010674,0.01531,0.00061517366,0.00003699046,0.000017032375,0.0002589338,0.00016866234,0.01426151],"genre_scores_gemma":[0.99380565,0.00016538918,0.0015496338,0.000041303036,0.00009171768,0.000036424473,0.00029281384,0.00005540927,0.0039617145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992818,0.00017794526,0.000024742872,0.0001247332,0.00018018093,0.00021053154],"domain_scores_gemma":[0.996157,0.0018110818,0.0005536855,0.00029254868,0.00043935422,0.00074631046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015062906,0.0005957848,0.00052841415,0.0027657566,0.0010489618,0.0025487733,0.0013977069,0.00076776376,0.006321897],"category_scores_gemma":[0.007349088,0.000515069,0.0002920726,0.0010548232,0.0032868737,0.00316907,0.0014666645,0.0011490356,0.0008773027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012156174,0.00017628651,0.011378913,0.0001761766,0.000033033917,0.0005848289,0.0010142184,0.012178425,0.019929828,0.93346745,0.0038242803,0.016020976],"study_design_scores_gemma":[0.00029795995,0.0004019177,0.018983,0.00027489435,0.00004847114,0.0010812393,0.0011572303,0.1566186,0.016933482,0.7976222,0.006372973,0.00020810022],"about_ca_topic_score_codex":0.00082112604,"about_ca_topic_score_gemma":0.00045002057,"teacher_disagreement_score":0.006321897,"about_ca_system_score_codex":0.0017223974,"about_ca_system_score_gemma":0.00050654827,"threshold_uncertainty_score":0.02114886},"labels":[],"label_agreement":null},{"id":"W2042316519","doi":"10.1006/ffta.2000.0294","title":"Intersections of Hyperconics in Projective Planes of Even Order","year":2001,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Projective plane; Projective test; Lift (data mining); Equivalence relation; Pure mathematics; Finite field; Order (exchange); Equivalence (formal languages); Intersection (aeronautics); Complete intersection; Combinatorics; Discrete mathematics; Geometry; Computer science","score_opus":0.012984920197248366,"score_gpt":0.22919723159603048,"score_spread":0.2162123113987821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042316519","genre_codex":"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.8528519,0.0013496339,0.052720264,0.0013734492,0.00017688934,0.00005548913,0.0005572579,0.00027236028,0.090642735],"genre_scores_gemma":[0.9710055,0.000662866,0.011525547,0.00011822966,0.00017273992,0.000063888605,0.00051092973,0.00012782164,0.015812524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988913,0.00032264684,0.00006281353,0.00015293976,0.00029397986,0.00027625545],"domain_scores_gemma":[0.9969285,0.0014250687,0.00078042696,0.00016530606,0.00029075047,0.0004098663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008885433,0.000910432,0.0010054853,0.0059257555,0.0036358747,0.006285001,0.0012897754,0.0018095606,0.008907418],"category_scores_gemma":[0.0035444465,0.0011703041,0.0006917867,0.0055271913,0.0034250878,0.0066408017,0.002721464,0.0030842477,0.0008333863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008398658,0.000021708962,0.00073950255,0.000018417077,0.000007104032,0.00018395021,0.00027235513,0.001265215,0.00051901076,0.99283504,0.0008466201,0.003207217],"study_design_scores_gemma":[0.000031566902,0.000036363923,0.0012074471,0.000039067156,0.000019368512,0.0003915311,0.00066302554,0.009140199,0.0018317655,0.98280233,0.0038065498,0.000030883508],"about_ca_topic_score_codex":0.0016834361,"about_ca_topic_score_gemma":0.0020753606,"teacher_disagreement_score":0.008907418,"about_ca_system_score_codex":0.002090549,"about_ca_system_score_gemma":0.0006186473,"threshold_uncertainty_score":0.02979827},"labels":[],"label_agreement":null},{"id":"W2043217677","doi":"10.1007/s00373-010-0980-3","title":"Characterizations of Bent and Almost Bent Function on $${\\mathbb{Z}_p^2}$$","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Centre de Recherches Mathématiques","keywords":"Bent molecular geometry; Combinatorics; Bent function; Mathematics; Permutation group; Degenerate energy levels; Graph; Function (biology); Exponential function; Discrete mathematics; Permutation (music); Boolean function; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.004398247008042404,"score_gpt":0.18300560634441182,"score_spread":0.17860735933636943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043217677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.72741103,0.0008896578,0.13252532,0.0032799426,0.000307837,0.00011395425,0.0012238987,0.000647113,0.13360126],"genre_scores_gemma":[0.9598181,0.00059330266,0.010607623,0.0008645186,0.0004729231,0.00014510727,0.0012349349,0.00036826404,0.025895229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986155,0.00023103181,0.00006650037,0.00030007082,0.00041390152,0.0003729386],"domain_scores_gemma":[0.99570256,0.0017663104,0.0007800588,0.00039215517,0.00055172417,0.00080720766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890592,0.0015551153,0.0011579077,0.0035114735,0.0020470377,0.0049795024,0.0020098658,0.002201975,0.011687467],"category_scores_gemma":[0.0048727603,0.0009205175,0.0012043857,0.0026784306,0.0033091577,0.007155034,0.0032820704,0.0038810628,0.0014496166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008291169,0.000029441222,0.0003323446,0.000026046686,0.0000074691798,0.000066940935,0.00022033398,0.0007647021,0.0014128034,0.9923564,0.0012290122,0.0034714928],"study_design_scores_gemma":[0.000020613503,0.000040605744,0.00072964665,0.00002514024,0.000016471562,0.0003034831,0.00015233348,0.009412845,0.001165175,0.9844588,0.0036346707,0.000040261246],"about_ca_topic_score_codex":0.00089035573,"about_ca_topic_score_gemma":0.000768219,"teacher_disagreement_score":0.011687467,"about_ca_system_score_codex":0.0022533133,"about_ca_system_score_gemma":0.0007876022,"threshold_uncertainty_score":0.03909844},"labels":[],"label_agreement":null},{"id":"W2043309691","doi":"10.1049/ip-com:20000663","title":"Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes","year":2000,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tanner graph; Decoding methods; List decoding; Coset; Sequential decoding; Block code; Linear code; Mathematics; Hamming code; Concatenated error correction code; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.018493884401176233,"score_gpt":0.2588540239813282,"score_spread":0.24036013958015195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043309691","genre_codex":"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.010212677,0.00039420172,0.9845538,0.00011075103,0.000033312877,0.000036717698,0.00014431274,0.00022794875,0.004286285],"genre_scores_gemma":[0.45162234,0.0022963125,0.534004,0.0002374539,0.0001730623,0.00025462965,0.00086429133,0.00023102331,0.010316793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992034,0.00033658496,0.000046421643,0.00012064581,0.0002166534,0.000076298114],"domain_scores_gemma":[0.9987754,0.0007453983,0.00013614233,0.00016185892,0.00015418814,0.000027001555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006207124,0.0005534817,0.00041557717,0.0011528895,0.00035318953,0.0009182237,0.00070422445,0.0007541408,0.0016818686],"category_scores_gemma":[0.0039336337,0.00035375933,0.0005170844,0.0015133714,0.00087270007,0.0010890082,0.00059925934,0.00073741423,0.00081045524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010533137,0.000028579096,0.00045546502,0.00018501893,0.000032907672,0.00022805929,0.00020075591,0.3071072,0.010683879,0.5743527,0.0019970937,0.10462304],"study_design_scores_gemma":[0.000014519356,0.000040745756,0.00026103493,0.00003637749,0.000012870345,0.00015484758,0.000022843851,0.5672937,0.007372652,0.41944057,0.005312602,0.000037224178],"about_ca_topic_score_codex":0.0017872194,"about_ca_topic_score_gemma":0.0017469641,"teacher_disagreement_score":0.0017872194,"about_ca_system_score_codex":0.00069529406,"about_ca_system_score_gemma":0.000820299,"threshold_uncertainty_score":0.0056263804},"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":"W2043992837","doi":"10.1016/j.ffa.2008.01.003","title":"Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Enumeration; Kronecker delta; Finite field; Class (philosophy); Combinatorics; Elliptic curve; Field (mathematics); Pure mathematics; Discrete mathematics","score_opus":0.016508143454731904,"score_gpt":0.21830942351021673,"score_spread":0.20180128005548484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043992837","genre_codex":"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.7380045,0.0016018532,0.16852121,0.002686771,0.0002862131,0.000075793476,0.00044018545,0.00033486425,0.08804864],"genre_scores_gemma":[0.95821667,0.00092219614,0.023133053,0.000151401,0.0002523599,0.000049020597,0.00035287393,0.00008636677,0.016836103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988218,0.00031426037,0.00006137303,0.00015385041,0.00036872597,0.00027997047],"domain_scores_gemma":[0.9976132,0.0013121339,0.00032987146,0.00030117005,0.00022471609,0.00021883959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243133,0.0013239471,0.0011126546,0.0027280853,0.002105552,0.0045005265,0.0014497946,0.0015745095,0.004964197],"category_scores_gemma":[0.00700428,0.00066555577,0.00072555285,0.0041814577,0.0047351685,0.005800863,0.003201628,0.0036012563,0.0007774967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005956723,0.000024094781,0.000311183,0.000033127704,0.000004075603,0.000109809145,0.0003269079,0.0015561739,0.0007025938,0.989726,0.0005541642,0.0065922127],"study_design_scores_gemma":[0.000018378922,0.000011553343,0.00017953715,0.000030971234,0.000008485374,0.00016287195,0.000112539456,0.0072661494,0.00096886564,0.98888934,0.0023335437,0.000017761251],"about_ca_topic_score_codex":0.0009243935,"about_ca_topic_score_gemma":0.0009975495,"teacher_disagreement_score":0.004964197,"about_ca_system_score_codex":0.002045621,"about_ca_system_score_gemma":0.0011700373,"threshold_uncertainty_score":0.016606927},"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":"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":"W2048600387","doi":"10.1504/ijwmc.2005.008054","title":"The editing generator and its cryptanalysis","year":2005,"lang":"en","type":"article","venue":"International Journal of Wireless and Mobile Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stream cipher; Self-shrinking generator; Generator (circuit theory); Cryptanalysis; Shift register; Randomness; Random number generation; Correlation attack; Algorithm; Cryptography; Sequence (biology); Theoretical computer science; Mathematics; Electrical engineering; Telecommunications; Statistics","score_opus":0.0071705195215215215,"score_gpt":0.24902696795747517,"score_spread":0.24185644843595364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048600387","genre_codex":"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.1544867,0.0008463311,0.8171774,0.0019655472,0.0003206272,0.00012697226,0.00013453202,0.00095935544,0.023982555],"genre_scores_gemma":[0.91993445,0.00041725326,0.071444,0.00027831213,0.00019365441,0.00008357298,0.000101238424,0.00011047647,0.007437021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896073,0.0003004358,0.000039899875,0.00015436888,0.00043565984,0.000108901564],"domain_scores_gemma":[0.99858236,0.00074377697,0.00011558033,0.00042624518,0.0000959354,0.00003606836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007924689,0.0003882478,0.00031713728,0.00051083264,0.00032243467,0.00078314316,0.00045302632,0.00066171883,0.0018426409],"category_scores_gemma":[0.0031339223,0.00017838097,0.00038754373,0.00032025002,0.0014391978,0.0018066285,0.00094220473,0.0013058841,0.0004621192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027439056,0.000042352647,0.0007585985,0.00007375832,0.000023249115,0.00050349795,0.00018971637,0.032496262,0.021159265,0.8764241,0.001987462,0.06606748],"study_design_scores_gemma":[0.00011165638,0.00032386242,0.00060352637,0.00004863979,0.00004158367,0.002444599,0.000041551284,0.36796618,0.07844352,0.52394927,0.02594616,0.00007950242],"about_ca_topic_score_codex":0.00015846855,"about_ca_topic_score_gemma":0.00007630799,"teacher_disagreement_score":0.0018426409,"about_ca_system_score_codex":0.00050241285,"about_ca_system_score_gemma":0.00046569423,"threshold_uncertainty_score":0.0061642528},"labels":[],"label_agreement":null},{"id":"W2048643528","doi":"10.1142/s1793042111004587","title":"SOME FOURTH-ORDER LINEAR DIVISIBILITY SEQUENCES","year":2011,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Divisibility rule; Mathematics; Order (exchange); Class (philosophy); Combinatorics; Pure mathematics; Discrete mathematics; Computer science","score_opus":0.03145186301017809,"score_gpt":0.28481356452991613,"score_spread":0.253361701519738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048643528","genre_codex":"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.75887555,0.0011449385,0.1505709,0.0017992986,0.00023992444,0.000086035,0.00029770637,0.0004129018,0.086572744],"genre_scores_gemma":[0.94160485,0.00054226036,0.027128432,0.00034273916,0.00021265497,0.00010772401,0.00023083082,0.00009812471,0.029732382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994437,0.00010214794,0.000044452598,0.000110332454,0.00017844555,0.000120933364],"domain_scores_gemma":[0.9974624,0.0010495443,0.000460635,0.0003385666,0.00039597397,0.0002928622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224197,0.00047499372,0.00039526288,0.0018477767,0.0012117057,0.0015674044,0.0006501792,0.0009533491,0.006246493],"category_scores_gemma":[0.004419266,0.00035110422,0.0005433301,0.00086415315,0.00196708,0.0027019521,0.0012862479,0.0021839484,0.0011270371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010344652,0.000044706838,0.0016239166,0.000095724405,0.000009063518,0.00047702077,0.0005767299,0.0047076,0.006180989,0.96410817,0.00096536806,0.021107195],"study_design_scores_gemma":[0.000026047368,0.0000949389,0.0007354316,0.00004751232,0.000008300275,0.00055732793,0.00018279598,0.01777516,0.0058134785,0.9657287,0.008994701,0.000035612855],"about_ca_topic_score_codex":0.00041811416,"about_ca_topic_score_gemma":0.00034630494,"teacher_disagreement_score":0.006246493,"about_ca_system_score_codex":0.0013741127,"about_ca_system_score_gemma":0.00049223745,"threshold_uncertainty_score":0.020896673},"labels":[],"label_agreement":null},{"id":"W2049009474","doi":"10.1016/j.tcs.2005.04.011","title":"Results on multiples of primitive polynomials and their products over GF(2)","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Primitive polynomial; Multiple; Mathematics; Cryptosystem; Cryptography; GF(2); Discrete mathematics; Degree (music); Arithmetic; Polynomial; Connection (principal bundle); Combinatorics; Finite field; Algorithm; Physics","score_opus":0.012278168014508201,"score_gpt":0.23608899362235822,"score_spread":0.22381082560785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049009474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.37274948,0.020153055,0.26007026,0.0074351607,0.0017809406,0.00015747278,0.00092578016,0.0014653474,0.33526245],"genre_scores_gemma":[0.8996207,0.010584645,0.037758034,0.0010322491,0.0024703366,0.00013022502,0.00093009905,0.00047047684,0.04700319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997894,0.00037013082,0.00011893758,0.0003955462,0.0006836189,0.00053771655],"domain_scores_gemma":[0.9923781,0.0044911,0.0010016079,0.0012575107,0.00048156583,0.0003899755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017473018,0.0017978624,0.0017000791,0.0037303322,0.0024917675,0.0037383616,0.0014941343,0.0011720267,0.013879578],"category_scores_gemma":[0.008807736,0.0009708007,0.0012563649,0.0067901155,0.004283255,0.013584176,0.0036907305,0.004437863,0.0035606457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010258281,0.00017698722,0.0013522999,0.0006735168,0.000084280575,0.00059444504,0.0008545698,0.006738056,0.005138009,0.90233123,0.009764903,0.07126594],"study_design_scores_gemma":[0.000052181305,0.00017475172,0.0006562008,0.00015233079,0.00011064991,0.0012918169,0.00024208969,0.009304427,0.0059476984,0.9594108,0.022591265,0.00006582691],"about_ca_topic_score_codex":0.00059139205,"about_ca_topic_score_gemma":0.0007551339,"teacher_disagreement_score":0.013879578,"about_ca_system_score_codex":0.0016552772,"about_ca_system_score_gemma":0.0010340357,"threshold_uncertainty_score":0.04643178},"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":"W2051279135","doi":"10.1142/s1793042115500803","title":"Construction of all cubic function fields of a given square-free discriminant","year":2015,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discriminant; Square (algebra); Mathematics; Cubic function; Finite field; Function (biology); Polynomial; Quadratic equation; Discriminant function analysis; Field (mathematics); Degree (music); Function field; Algebraic number field; Quadratic function; Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Statistics; Geometry; Computer science; Artificial intelligence","score_opus":0.02506257259099395,"score_gpt":0.2749664585732548,"score_spread":0.24990388598226085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051279135","genre_codex":"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.53831184,0.00027735994,0.41294578,0.0010285957,0.00010710315,0.0004978601,0.0016135159,0.0018241582,0.043393802],"genre_scores_gemma":[0.64624375,0.00015808988,0.33819512,0.00015271973,0.000054277563,0.0002558182,0.00236942,0.00026833892,0.012302434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999684,0.00003492593,0.000020597734,0.0000559271,0.00011648286,0.000088175184],"domain_scores_gemma":[0.9991002,0.00021678436,0.000072931114,0.00023725716,0.00022707866,0.00014571617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000433983,0.0003635835,0.00048566086,0.0013468799,0.0011505493,0.00086374406,0.0006519023,0.00035371011,0.005601281],"category_scores_gemma":[0.0020766458,0.00029157405,0.0006170404,0.0009979383,0.0009279586,0.0012225093,0.0019702597,0.0011592491,0.0010379866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007106079,0.00023263365,0.011487095,0.0006327708,0.000027704817,0.0007054734,0.001244041,0.017695015,0.049854565,0.592893,0.016947275,0.3075699],"study_design_scores_gemma":[0.00036472213,0.00050043233,0.0073542413,0.00011646674,0.00007307456,0.0019282073,0.00085238676,0.16900945,0.06914921,0.68226373,0.06827191,0.00011616812],"about_ca_topic_score_codex":0.001280535,"about_ca_topic_score_gemma":0.0016757955,"teacher_disagreement_score":0.005601281,"about_ca_system_score_codex":0.00091253023,"about_ca_system_score_gemma":0.0015900916,"threshold_uncertainty_score":0.01873815},"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":"W2052167619","doi":"10.1016/j.ffa.2011.04.002","title":"On coefficients of polynomials over finite fields","year":2011,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Polynomial; Permutation (music); Finite field; Recurrence relation; Upper and lower bounds; Field (mathematics); Combinatorics; Reciprocal polynomial; Relation (database); Matrix polynomial; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.022104913291018904,"score_gpt":0.22909185618093028,"score_spread":0.20698694288991137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052167619","genre_codex":"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.50719917,0.030420847,0.23445308,0.009270223,0.002878134,0.000111648566,0.0008110685,0.000277233,0.21457857],"genre_scores_gemma":[0.91811466,0.018293655,0.02214604,0.0005328055,0.0035628083,0.0001005954,0.0005901966,0.0001603829,0.036498763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869627,0.00040759408,0.000049880233,0.0001421552,0.00042956517,0.00027454703],"domain_scores_gemma":[0.9953069,0.0032355573,0.00044898264,0.00024609306,0.0004354815,0.0003269984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019003547,0.0019505519,0.0014961845,0.00461767,0.0015672275,0.003452275,0.0013002724,0.001280626,0.005505837],"category_scores_gemma":[0.009109525,0.00083121884,0.00074668793,0.005333574,0.005143633,0.006957325,0.0026998252,0.0040703462,0.0011353212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060655988,0.00002664132,0.00027396157,0.000076335185,0.0000073894466,0.00010953015,0.00033410988,0.0026088625,0.0006553315,0.98640394,0.0015200368,0.007923173],"study_design_scores_gemma":[0.000022235987,0.000015781532,0.00023107474,0.00006481797,0.000010596036,0.00010720557,0.00008366642,0.0077879326,0.00032444304,0.98738027,0.003955048,0.000016865184],"about_ca_topic_score_codex":0.0022639313,"about_ca_topic_score_gemma":0.0020287412,"teacher_disagreement_score":0.005505837,"about_ca_system_score_codex":0.0023923728,"about_ca_system_score_gemma":0.0009739719,"threshold_uncertainty_score":0.018418849},"labels":[],"label_agreement":null},{"id":"W2053024959","doi":"10.1109/tit.2004.842778","title":"Polyphase Sequences With Low Autocorrelation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polyphase system; Maxima and minima; Autocorrelation; Mathematics; Sequence (biology); Autocorrelation matrix; Complementary sequences; Base (topology); Algorithm; Energy (signal processing); Combinatorics; Discrete mathematics; Mathematical analysis; Statistics; Physics","score_opus":0.0054742164771853724,"score_gpt":0.2073840663128367,"score_spread":0.20190984983565133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053024959","genre_codex":"methods","genre_gemma":"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.060074706,0.0020063093,0.91837025,0.00040629547,0.00020926468,0.0001045491,0.0004631909,0.0011464314,0.017218992],"genre_scores_gemma":[0.344537,0.0013968848,0.638388,0.00031689604,0.00024041906,0.00016596337,0.0007969756,0.00034866927,0.013809214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914753,0.00012590527,0.000076780336,0.00021847352,0.00033587197,0.00009539142],"domain_scores_gemma":[0.9975231,0.0010744375,0.00037753623,0.0004687225,0.00046098672,0.00009508722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667087,0.00062058226,0.0005886562,0.0016740167,0.0010063867,0.0017193322,0.0005291437,0.0007850163,0.0055516856],"category_scores_gemma":[0.0057974122,0.00026610898,0.000474597,0.0021444112,0.0015114408,0.0022593162,0.0007419169,0.001090622,0.0029469752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035844397,0.00006429759,0.0022538141,0.0004522604,0.00003223603,0.00072477246,0.00053378765,0.01782326,0.081003025,0.51157224,0.005694531,0.37948734],"study_design_scores_gemma":[0.00007118573,0.00040635114,0.004294169,0.00022545157,0.00007783451,0.00416129,0.00034203223,0.15410972,0.15232575,0.56835526,0.11544962,0.00018134211],"about_ca_topic_score_codex":0.00029165187,"about_ca_topic_score_gemma":0.00031995645,"teacher_disagreement_score":0.0055516856,"about_ca_system_score_codex":0.00044472973,"about_ca_system_score_gemma":0.0005256211,"threshold_uncertainty_score":0.01857227},"labels":[],"label_agreement":null},{"id":"W2053450537","doi":"10.1002/jcd.20046","title":"Orthogonal designs, self‐dual codes, and the Leech lattice","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Dual (grammatical number); Orthogonal array; Circulant matrix; Lattice (music); Hadamard transform; Ternary operation; Hadamard matrix; Combinatorial design; Binary number; Combinatorics; Construct (python library); Discrete mathematics; Arithmetic; Computer science; Physics","score_opus":0.02016573371690598,"score_gpt":0.24760062650780465,"score_spread":0.22743489279089868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053450537","genre_codex":"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.63199335,0.0011173807,0.31864783,0.00088532973,0.00026258285,0.000092599534,0.00014307177,0.00026464002,0.046593264],"genre_scores_gemma":[0.9303219,0.00043312256,0.06085805,0.00022972055,0.00008990772,0.00006727878,0.00006696946,0.00003095938,0.007902065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944013,0.00020361428,0.000033477427,0.00006013141,0.00016798299,0.00009458952],"domain_scores_gemma":[0.9990646,0.0002748752,0.00020170343,0.00018447719,0.00016350587,0.000110785644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204524,0.00026459433,0.00028266478,0.00079912925,0.0006633356,0.0008547312,0.00025838945,0.00037094826,0.0017006608],"category_scores_gemma":[0.0013761944,0.00023905285,0.00025788049,0.00051449146,0.0015573329,0.0009288546,0.0008370257,0.0006990413,0.00029978092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022136948,0.000065177854,0.0008783902,0.00005161138,0.000011775409,0.00015312115,0.00018744593,0.009348811,0.011879288,0.94229215,0.0010039436,0.033906933],"study_design_scores_gemma":[0.00009618229,0.0003176237,0.0005032786,0.000042056774,0.000015020968,0.0005116738,0.00015584883,0.05590621,0.029136019,0.8994088,0.013852279,0.000055078883],"about_ca_topic_score_codex":0.00031773985,"about_ca_topic_score_gemma":0.0005121927,"teacher_disagreement_score":0.0017006608,"about_ca_system_score_codex":0.00058620836,"about_ca_system_score_gemma":0.0006467051,"threshold_uncertainty_score":0.005689323},"labels":[],"label_agreement":null},{"id":"W2053608075","doi":"10.1006/eujc.2000.0417","title":"Existence and Non-existence of -systems of Polar Spaces","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Symplectic geometry; Order (exchange); Polar; Translation (biology); Pure mathematics; Physics; Quantum mechanics","score_opus":0.01614616424244786,"score_gpt":0.21845512575912612,"score_spread":0.20230896151667827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053608075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.70226026,0.0013166831,0.25208628,0.0017275135,0.00022877642,0.00007279182,0.00048251526,0.00023000543,0.04159521],"genre_scores_gemma":[0.9702252,0.000437551,0.0215797,0.00014946614,0.00011964466,0.0000617775,0.00039620925,0.000055655746,0.00697474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981072,0.00063364,0.00012913483,0.00040099636,0.00027088597,0.0004580741],"domain_scores_gemma":[0.98981386,0.006345909,0.0009852949,0.00083824457,0.00087324594,0.0011434052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018305472,0.0007286102,0.0010939128,0.0014339356,0.002438668,0.0058349078,0.0013859556,0.0016075347,0.007615791],"category_scores_gemma":[0.007990742,0.0012278067,0.0011101924,0.0010859356,0.0051067304,0.007286442,0.0068393066,0.003432839,0.0008742573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011693892,0.000021122432,0.00072354963,0.00006320684,0.000016527409,0.00009097213,0.00029459907,0.0014591091,0.0011321238,0.9932215,0.0005287928,0.0023316864],"study_design_scores_gemma":[0.000042665975,0.000035489018,0.00035051053,0.000019069743,0.0000150389105,0.00020752203,0.00025845578,0.009542586,0.0013984173,0.9867931,0.0013153882,0.00002166289],"about_ca_topic_score_codex":0.00033860718,"about_ca_topic_score_gemma":0.00027792258,"teacher_disagreement_score":0.007615791,"about_ca_system_score_codex":0.0009057179,"about_ca_system_score_gemma":0.0007550447,"threshold_uncertainty_score":0.02547741},"labels":[],"label_agreement":null},{"id":"W2054084041","doi":"10.1007/s00453-001-0047-1","title":"Exact Largest and Smallest Size of Components","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Combinatorics; Permutation (music); Mathematics; Theory of computation; Component (thermodynamics); Golomb coding; Discrete mathematics; Physics; Algorithm; Computer science","score_opus":0.012833348501846852,"score_gpt":0.2197760636205042,"score_spread":0.20694271511865733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054084041","genre_codex":"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.42266995,0.0050983615,0.47632763,0.009217457,0.00075659493,0.000168064,0.0031960644,0.0017780449,0.08078792],"genre_scores_gemma":[0.9271283,0.0014844204,0.05455784,0.0009209134,0.00066117436,0.00017692703,0.0011292902,0.00091835693,0.013022847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966748,0.0007272545,0.00017214146,0.0009512943,0.0008640232,0.0006105308],"domain_scores_gemma":[0.96424913,0.024492055,0.0017583136,0.0060758567,0.0018793006,0.0015452661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026712485,0.0014384408,0.002205799,0.0026138967,0.002222783,0.006866314,0.0036697062,0.002897325,0.013547161],"category_scores_gemma":[0.03668066,0.0015454266,0.0015261881,0.0026154397,0.0057585617,0.018650662,0.0047204434,0.0047043543,0.0017732396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004968505,0.000048814592,0.0015883548,0.00025892214,0.000043996257,0.000081652914,0.00044000812,0.011757834,0.00211009,0.9566828,0.007637573,0.018853128],"study_design_scores_gemma":[0.000021355512,0.000012392812,0.00038153317,0.000022158009,0.000025697858,0.0000829556,0.00006478246,0.010482541,0.0011997308,0.9860444,0.0016453037,0.00001710673],"about_ca_topic_score_codex":0.0010065885,"about_ca_topic_score_gemma":0.0012698427,"teacher_disagreement_score":0.013547161,"about_ca_system_score_codex":0.002366284,"about_ca_system_score_gemma":0.0019239482,"threshold_uncertainty_score":0.045319736},"labels":[],"label_agreement":null},{"id":"W2055296824","doi":"10.1007/s12095-009-0012-4","title":"A new distinguishing and key recovery attack on NGG stream cipher","year":2009,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Keystream; Stream cipher attack; Computer science; RC4; Key (lock); Computer security; Encryption; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.036578378121658095,"score_gpt":0.282026855152945,"score_spread":0.24544847703128692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055296824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.31451297,0.0016584331,0.64315885,0.0027091594,0.00095077854,0.00036774584,0.00029036152,0.002760736,0.033590905],"genre_scores_gemma":[0.92869854,0.0004971227,0.060142606,0.00035080445,0.00023578302,0.000073350086,0.00018111417,0.00007408213,0.009746566],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873465,0.0002307623,0.0000720359,0.00020422542,0.0005160996,0.00024223544],"domain_scores_gemma":[0.99908745,0.00027560073,0.000114034294,0.00033911428,0.000102529855,0.00008133823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000657706,0.00079723576,0.0009080739,0.0008579796,0.0008082611,0.0010615587,0.00082108966,0.0013369565,0.0026134392],"category_scores_gemma":[0.0013083229,0.00035575998,0.00075947045,0.0006891152,0.0009925498,0.0025572984,0.0018942072,0.0014602509,0.00089236733],"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.0029933292,0.00053261063,0.003368369,0.00051609497,0.00024922212,0.0028203896,0.0006075277,0.03749557,0.3413297,0.32874689,0.014551923,0.26678833],"study_design_scores_gemma":[0.00036121436,0.00084800064,0.0025517568,0.000108962195,0.00032398797,0.006767008,0.00014350265,0.558982,0.28474298,0.1143426,0.030668989,0.00015896343],"about_ca_topic_score_codex":0.00018890998,"about_ca_topic_score_gemma":0.00018388344,"teacher_disagreement_score":0.0026134392,"about_ca_system_score_codex":0.00063601905,"about_ca_system_score_gemma":0.00063123717,"threshold_uncertainty_score":0.00874275},"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":"W2055862451","doi":"10.1016/j.ins.2007.12.002","title":"WG: A family of stream ciphers with designed randomness properties","year":2007,"lang":"en","type":"article","venue":"Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Correlation attack; Keystream; Randomness; Stream cipher attack; Computer science; Ideal (ethics); Cryptography; Randomness tests; Block cipher mode of operation; Theoretical computer science; Differential cryptanalysis; Algorithm; Mathematics; Statistics; Computer security","score_opus":0.02459415622454515,"score_gpt":0.23235201959109733,"score_spread":0.2077578633665522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055862451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.10659434,0.002213022,0.8619236,0.0008486025,0.0005091836,0.0005352963,0.0010302064,0.0053574266,0.020988407],"genre_scores_gemma":[0.7443077,0.0024781178,0.22355272,0.0008909457,0.00028569446,0.00070211355,0.0014827438,0.00088448543,0.025415499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992755,0.00020649088,0.000051118073,0.000115591865,0.00023355275,0.00011773757],"domain_scores_gemma":[0.9987828,0.0002587499,0.00019252277,0.00050523895,0.0001395726,0.00012110953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012756962,0.0011783644,0.000697023,0.0008060318,0.0005115055,0.0012799504,0.0007444545,0.0008764347,0.0016018912],"category_scores_gemma":[0.0023169112,0.00032943903,0.0008022185,0.00088950986,0.0009852537,0.0018479087,0.0012827269,0.0015145887,0.0013532921],"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.0015671,0.00027368354,0.002481427,0.0007039834,0.00024190235,0.00072718,0.0003299916,0.04503926,0.09088428,0.5476194,0.029101891,0.2810299],"study_design_scores_gemma":[0.0003869435,0.001228851,0.002365513,0.0002227648,0.0002780174,0.003893923,0.00009362863,0.26232293,0.15676059,0.43991056,0.13234928,0.00018696774],"about_ca_topic_score_codex":0.000102037484,"about_ca_topic_score_gemma":0.00009929002,"teacher_disagreement_score":0.0016018912,"about_ca_system_score_codex":0.00040531348,"about_ca_system_score_gemma":0.00074977824,"threshold_uncertainty_score":0.0067466497},"labels":[],"label_agreement":null},{"id":"W2057126853","doi":"10.1080/0161-110591893780","title":"THE PUBLIC KEY COVERT CHANNEL","year":2005,"lang":"en","type":"article","venue":"Cryptologia","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Cryptosystem; Key (lock); Computer science; Channel (broadcasting); Public-key cryptography; Computer security; Covert channel; Public key cryptosystem; Cryptography; Covert; Computer network; Encryption","score_opus":0.017580543319137762,"score_gpt":0.22927304074713029,"score_spread":0.2116924974279925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057126853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.21609229,0.0029128215,0.46299434,0.016907495,0.0009984195,0.000187818,0.00059768296,0.0009970074,0.29831216],"genre_scores_gemma":[0.973892,0.0011374971,0.009987024,0.0005044201,0.00056401826,0.00010645004,0.000097068165,0.00006992244,0.013641578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977202,0.0006171259,0.0000509778,0.000280966,0.0009081403,0.00042262743],"domain_scores_gemma":[0.9929039,0.004260947,0.0005597083,0.0015146639,0.0005146994,0.00024613534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013868336,0.00032692382,0.00054107397,0.0009131861,0.0018374196,0.0031712912,0.00060475577,0.0017653593,0.012484907],"category_scores_gemma":[0.007783055,0.00033130703,0.00037964253,0.0009031202,0.00545441,0.007152409,0.0034962264,0.002825003,0.0014520371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058260284,0.000011916053,0.00017075936,0.00002824512,0.000004730851,0.00020354996,0.00015977627,0.0015690252,0.0013225741,0.9870597,0.0017460427,0.007665434],"study_design_scores_gemma":[0.000025819856,0.000041449315,0.00021859999,0.000048406324,0.00001205216,0.0005971876,0.00008729232,0.012634001,0.0047915294,0.9607635,0.020756477,0.000023607045],"about_ca_topic_score_codex":0.00037551715,"about_ca_topic_score_gemma":0.00020586918,"teacher_disagreement_score":0.012484907,"about_ca_system_score_codex":0.0016168462,"about_ca_system_score_gemma":0.0009088823,"threshold_uncertainty_score":0.041766167},"labels":[],"label_agreement":null},{"id":"W2059355032","doi":"10.4236/ojdm.2012.24032","title":"A Note on Hamiltonian Circulant Digraphs of Outdegree Three","year":2012,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Connection (principal bundle); Integer (computer science); Hamiltonian (control theory); Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.04059337117785439,"score_gpt":0.29666614932892066,"score_spread":0.25607277815106627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059355032","genre_codex":"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.60786223,0.001689333,0.29030785,0.0011549032,0.00030298962,0.00013066179,0.00047751042,0.0004285361,0.09764605],"genre_scores_gemma":[0.9480541,0.00076149177,0.041907124,0.00033007408,0.000079848076,0.000051057803,0.00017785761,0.00005219015,0.008586201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999124,0.000026540403,0.0000038560765,0.000015451587,0.000021181397,0.000020592639],"domain_scores_gemma":[0.99949646,0.00022936787,0.000059578804,0.000071881936,0.000045588957,0.00009702224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017204236,0.0003265911,0.00027624166,0.0006710456,0.0007123917,0.0005883984,0.0005035873,0.0003783357,0.0024017685],"category_scores_gemma":[0.0008286794,0.00019507801,0.00032814758,0.0006324614,0.00075719267,0.00046448215,0.00070105575,0.0007073167,0.00021635606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003363926,0.00003250085,0.0007472622,0.00009471325,0.000011136414,0.00040253857,0.00027540306,0.007873967,0.0057382733,0.9678583,0.0016653944,0.015266772],"study_design_scores_gemma":[0.00004327326,0.0000977503,0.0009296823,0.00005549237,0.000022291699,0.00034773815,0.0000917928,0.0402324,0.0045662434,0.94018567,0.013393184,0.000034530145],"about_ca_topic_score_codex":0.0020503358,"about_ca_topic_score_gemma":0.003706485,"teacher_disagreement_score":0.0024017685,"about_ca_system_score_codex":0.00051360583,"about_ca_system_score_gemma":0.00034983526,"threshold_uncertainty_score":0.008034706},"labels":[],"label_agreement":null},{"id":"W2059530475","doi":"10.1107/s0108767302011637","title":"A revised proof of the metric properties of optimally superimposed vector sets","year":2002,"lang":"en","type":"article","venue":"Acta Crystallographica Section A Foundations of Crystallography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Metric (unit); Mathematics; Superposition principle; Square (algebra); Square root; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Engineering","score_opus":0.02396950355655137,"score_gpt":0.22466196599218105,"score_spread":0.2006924624356297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059530475","genre_codex":"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.008962354,0.003668813,0.93125695,0.0114489915,0.0102465125,0.00013616236,0.0014724354,0.00077296095,0.032034907],"genre_scores_gemma":[0.3635381,0.0070937374,0.5816005,0.009521187,0.008998052,0.0007755582,0.0025173957,0.001953494,0.024002025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887639,0.003159655,0.0011151017,0.0017222223,0.004627274,0.0006118665],"domain_scores_gemma":[0.9740674,0.009840803,0.0016876573,0.0056653684,0.007836085,0.0009026662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008277812,0.0023613553,0.0022218484,0.0031637931,0.0017673655,0.003622057,0.0033571466,0.0034316317,0.018235145],"category_scores_gemma":[0.046494123,0.0012665306,0.0025980426,0.0037824141,0.0052549965,0.012715833,0.007314367,0.009998616,0.0069622197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011005158,0.000036944806,0.00022027818,0.00045403096,0.00007115921,0.00031549647,0.00020256627,0.005326446,0.0047520096,0.9124242,0.030574553,0.04551227],"study_design_scores_gemma":[0.000049067734,0.00014282283,0.00041767836,0.00012275635,0.00005202294,0.0008185517,0.00006113996,0.024079278,0.005602301,0.91381174,0.054657836,0.00018485467],"about_ca_topic_score_codex":0.0008535274,"about_ca_topic_score_gemma":0.000566887,"teacher_disagreement_score":0.018235145,"about_ca_system_score_codex":0.0021837095,"about_ca_system_score_gemma":0.0017647375,"threshold_uncertainty_score":0.06100267},"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":"W2061027724","doi":"10.1137/s0895480103428053","title":"Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Aperiodic graph; Alphabet; Finite field; Ring (chemistry); Physics","score_opus":0.016314807711336768,"score_gpt":0.25113689835429853,"score_spread":0.23482209064296178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061027724","genre_codex":"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.6847871,0.0006735949,0.26419714,0.0006911633,0.00014471165,0.00011847085,0.00060791284,0.0005935727,0.0481863],"genre_scores_gemma":[0.9459757,0.00037310904,0.044302355,0.00018882297,0.00018983863,0.00017403932,0.0005667096,0.00022835819,0.0080011645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975623,0.00045977984,0.00026239085,0.00057643134,0.0005355985,0.0006036143],"domain_scores_gemma":[0.99174315,0.004478459,0.0011346694,0.0012672893,0.00080909854,0.0005671775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002657129,0.00050748925,0.0009864818,0.0025149216,0.0017576071,0.005743713,0.0017202899,0.0012961081,0.0044334643],"category_scores_gemma":[0.013458864,0.00048030983,0.0010056314,0.0028677052,0.0032561724,0.0077489745,0.0021100934,0.00173365,0.00047720363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016485417,0.000028410956,0.0015559363,0.00006434914,0.00000913988,0.00008647941,0.0003711905,0.0036716228,0.0023980606,0.97839487,0.00083431846,0.012420727],"study_design_scores_gemma":[0.00002608842,0.00007251167,0.0013202649,0.000072689116,0.000041893913,0.00032369973,0.00020015462,0.04581371,0.0120417215,0.93592024,0.004113584,0.000053516538],"about_ca_topic_score_codex":0.00092607207,"about_ca_topic_score_gemma":0.00061263546,"teacher_disagreement_score":0.005743713,"about_ca_system_score_codex":0.0029588563,"about_ca_system_score_gemma":0.0010461675,"threshold_uncertainty_score":0.021468043},"labels":[],"label_agreement":null},{"id":"W2061184672","doi":"10.4153/cmb-2007-039-2","title":"Discriminants of Complex Multiplication Fields of Elliptic Curves over Finite Fields","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología; Canadian Mathematical Society","keywords":"Mathematics; Endomorphism ring; Endomorphism; Discriminant; Elliptic curve; Complex multiplication; Finite field; Algebraic number field; Pure mathematics; Quadratic equation; Prime (order theory); Supersingular elliptic curve; Twists of curves; Schoof's algorithm; Multiplication (music); Field (mathematics); Discrete mathematics; Combinatorics; Quarter period; Geometry","score_opus":0.025636364531189813,"score_gpt":0.25585230432310774,"score_spread":0.23021593979191793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061184672","genre_codex":"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.9760433,0.00046905683,0.010287287,0.00046282483,0.000044850967,0.00002508879,0.00021364167,0.00008548899,0.012368571],"genre_scores_gemma":[0.9957866,0.00014786731,0.001960902,0.000020550233,0.00007550725,0.000016099048,0.00012606973,0.000012807843,0.0018536168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993857,0.0000910727,0.00004443069,0.000111123925,0.00023962675,0.00012807826],"domain_scores_gemma":[0.99602085,0.0017462553,0.00068759057,0.00026013135,0.0003619433,0.0009232225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012238502,0.00049234915,0.000548912,0.0033677456,0.0010046901,0.002069102,0.00052885985,0.0003670141,0.0040377015],"category_scores_gemma":[0.008127738,0.0003715457,0.00022152218,0.0009345916,0.002569994,0.002563853,0.0014410047,0.00092850067,0.00048741672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016329195,0.00022015849,0.057109,0.00030119604,0.000036303038,0.0012727205,0.0011006308,0.014816825,0.031400096,0.8467034,0.0029866325,0.04242019],"study_design_scores_gemma":[0.00035124214,0.00031341988,0.04544339,0.00016202072,0.000056428413,0.0033267403,0.0006766371,0.07908312,0.019297136,0.83895326,0.012232543,0.000104000464],"about_ca_topic_score_codex":0.00044598512,"about_ca_topic_score_gemma":0.0004136245,"teacher_disagreement_score":0.0040377015,"about_ca_system_score_codex":0.0017726852,"about_ca_system_score_gemma":0.00046203836,"threshold_uncertainty_score":0.013507485},"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":"W2061818608","doi":"10.1016/j.ffa.2012.02.001","title":"Dickson polynomials over finite fields","year":2012,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Finite field; Permutation (music); Discrete orthogonal polynomials; Factorization; Difference polynomials; Classical orthogonal polynomials; Orthogonal polynomials; Algebra over a field; Wilson polynomials; Pure mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.014979619080014842,"score_gpt":0.23719349820474817,"score_spread":0.22221387912473334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061818608","genre_codex":"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.61685634,0.024248648,0.124021955,0.007719481,0.0013004841,0.000053282834,0.00048619037,0.0003488811,0.22496477],"genre_scores_gemma":[0.96243584,0.004776078,0.007309751,0.0002954001,0.00087372283,0.000019697047,0.00011485609,0.0000344206,0.024140216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967706,0.000096709584,0.000014326395,0.000053464315,0.00008318303,0.00007530486],"domain_scores_gemma":[0.9988493,0.000656239,0.0001748835,0.00008278317,0.00009973347,0.00013701757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072233065,0.0006352957,0.0006310145,0.003143063,0.0010963357,0.0019873835,0.00050760026,0.0007340631,0.0058453227],"category_scores_gemma":[0.0025250644,0.00041313548,0.0003297092,0.0031617247,0.0026965134,0.0031483038,0.0013037521,0.001960365,0.00057041517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022989903,0.0000123973805,0.00015545626,0.000024540637,0.0000027561996,0.000032595723,0.000111108064,0.0007065955,0.0003529534,0.9924582,0.0006490509,0.0054712906],"study_design_scores_gemma":[0.000015117067,0.000018309629,0.0003161975,0.000024878138,0.000008467743,0.00012460395,0.000102589205,0.004303701,0.000488037,0.9865731,0.008008049,0.000016989994],"about_ca_topic_score_codex":0.0010564654,"about_ca_topic_score_gemma":0.0010390948,"teacher_disagreement_score":0.0058453227,"about_ca_system_score_codex":0.0018154554,"about_ca_system_score_gemma":0.0005809629,"threshold_uncertainty_score":0.019554496},"labels":[],"label_agreement":null},{"id":"W2063944845","doi":"10.1016/j.ejc.2003.07.006","title":"On the spectrum of non-Denniston maximal arcs in PG(2,2h)","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Order (exchange); Degree (music); Type (biology); Spectrum (functional analysis); Projective plane; Discrete mathematics; Geometry; Crystallography; Physics","score_opus":0.010738151867189577,"score_gpt":0.20260787323156165,"score_spread":0.19186972136437208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063944845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8949759,0.0005229428,0.025598092,0.0009877305,0.00006107955,0.00002205307,0.00033089242,0.00017970025,0.07732163],"genre_scores_gemma":[0.9882234,0.00024456752,0.003723362,0.00009659775,0.00007080175,0.000023018669,0.00016118528,0.00005006543,0.0074070916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965024,0.00007395764,0.000015017054,0.0000659546,0.000090971786,0.00010384737],"domain_scores_gemma":[0.9985746,0.00083217793,0.00017126962,0.00006677885,0.00008342009,0.0002716831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000523914,0.0005419907,0.0005502386,0.0024374225,0.0022635874,0.0025104436,0.00076993357,0.00080111204,0.00992244],"category_scores_gemma":[0.0016742822,0.00036718557,0.00032666212,0.0012835725,0.002313762,0.0023226035,0.0014747145,0.0011065281,0.0006541462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035816588,0.000050745195,0.0010887088,0.000050847215,0.000009401879,0.00035684212,0.0005966827,0.0032211144,0.0040119677,0.98102796,0.0013499106,0.007877666],"study_design_scores_gemma":[0.00005390491,0.000028147339,0.0011559905,0.000038409355,0.00001071206,0.00023403483,0.00029832625,0.012827372,0.002028517,0.9811767,0.0021302258,0.000017561319],"about_ca_topic_score_codex":0.0012451386,"about_ca_topic_score_gemma":0.0011879746,"teacher_disagreement_score":0.00992244,"about_ca_system_score_codex":0.0011961659,"about_ca_system_score_gemma":0.0005323965,"threshold_uncertainty_score":0.033193886},"labels":[],"label_agreement":null},{"id":"W2064133253","doi":"10.1515/integers-2012-0047","title":"Some Monoapparitic Fourth Order Linear Divisibility Sequences","year":2012,"lang":"en","type":"article","venue":"Integers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Divisibility rule; Mathematics; Order (exchange); Combinatorics; Pure mathematics","score_opus":0.02458390484429954,"score_gpt":0.26971433175797566,"score_spread":0.24513042691367612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064133253","genre_codex":"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.7898662,0.0010050538,0.05792538,0.0016788248,0.0002214537,0.000064089436,0.000335035,0.00020188603,0.14870214],"genre_scores_gemma":[0.9641387,0.00030934217,0.0088647,0.0002590237,0.00010209002,0.00006863053,0.00017725324,0.00003851711,0.02604186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956757,0.00010233397,0.000031620966,0.00006319867,0.00013197209,0.000103322556],"domain_scores_gemma":[0.99793446,0.001080182,0.0002658332,0.0001888664,0.00033434664,0.0001961747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053213927,0.00050936185,0.00030701896,0.0015245918,0.0011299798,0.0018896188,0.00048554008,0.00073575514,0.008922226],"category_scores_gemma":[0.003199723,0.00027011862,0.00027947407,0.0010011194,0.0013762002,0.0017539756,0.0011226754,0.001651518,0.0009846147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027218382,0.000045257413,0.00088858715,0.00008826358,0.00000674925,0.0004925807,0.00046535354,0.0026383894,0.006384936,0.9709348,0.0015043996,0.016278418],"study_design_scores_gemma":[0.00007579388,0.00012455786,0.0010745912,0.00008429454,0.000015051515,0.0008327121,0.0003183458,0.016144248,0.011957429,0.9533286,0.015999055,0.000045343662],"about_ca_topic_score_codex":0.00037903953,"about_ca_topic_score_gemma":0.00040959014,"teacher_disagreement_score":0.008922226,"about_ca_system_score_codex":0.0014036368,"about_ca_system_score_gemma":0.00065384887,"threshold_uncertainty_score":0.0298478},"labels":[],"label_agreement":null},{"id":"W2064578779","doi":"10.1145/345542.345639","title":"On the design and implementation of Brown's algorithm over the integers and number fields","year":2000,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Implementation; Bivariate analysis; Maple; Heuristic; Computer science; Modular design; Algorithm design; Mathematics; Artificial intelligence; Machine learning","score_opus":0.011895997333376582,"score_gpt":0.25646104485301513,"score_spread":0.24456504751963853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064578779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04508645,0.00045820422,0.9469473,0.0002538881,0.00006952562,0.00018303451,0.000038855735,0.0022564724,0.0047063557],"genre_scores_gemma":[0.27177703,0.00032107564,0.7244387,0.00017986508,0.000087350316,0.00025908946,0.0001549786,0.00024564148,0.0025361646],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952087,0.0020061543,0.00037413594,0.000640294,0.0013070689,0.00046365408],"domain_scores_gemma":[0.98975945,0.0038212044,0.0008432585,0.0028524755,0.0024170398,0.00030668112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00443776,0.0006973689,0.0009968398,0.0017423192,0.00093746686,0.0018207117,0.0018116202,0.0006923322,0.0026159212],"category_scores_gemma":[0.018435556,0.0006247456,0.0004432609,0.002965048,0.0019260681,0.004025987,0.0016716684,0.0012358433,0.0013079272],"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.0011593038,0.00026148348,0.0062551326,0.00037967853,0.00009899478,0.00025842845,0.0005586592,0.09632905,0.031150693,0.36686265,0.008687506,0.48799843],"study_design_scores_gemma":[0.0004823722,0.0010817662,0.0014719212,0.00015778703,0.00011298557,0.00079092104,0.00024936695,0.7413274,0.07428683,0.14406607,0.035842117,0.00013047578],"about_ca_topic_score_codex":0.0017864106,"about_ca_topic_score_gemma":0.0013809017,"teacher_disagreement_score":0.00443776,"about_ca_system_score_codex":0.0016003759,"about_ca_system_score_gemma":0.0029216157,"threshold_uncertainty_score":0.023469388},"labels":[],"label_agreement":null},{"id":"W2064619631","doi":"10.1090/s0025-5718-05-01758-8","title":"Point counting on Picard curves in large characteristic","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Cardinality (data modeling); Finite field; Jacobian matrix and determinant; Prime (order theory); Field (mathematics); Discrete mathematics; Point (geometry); Combinatorics; Pure mathematics; Applied mathematics; Geometry","score_opus":0.013230538641358442,"score_gpt":0.2572968505043444,"score_spread":0.24406631186298597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064619631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.25850907,0.00048722135,0.71707326,0.00060001505,0.00009499676,0.00016648775,0.00070925953,0.0036325117,0.018727185],"genre_scores_gemma":[0.774015,0.00039862577,0.21373338,0.0000822432,0.00019637904,0.00017681,0.0016170818,0.000794532,0.008985985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979487,0.00030739093,0.00012196631,0.00048613938,0.0008222467,0.0003136011],"domain_scores_gemma":[0.99523807,0.0023850428,0.00036455705,0.0010045007,0.0006670432,0.00034075862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738098,0.00106277,0.0012406737,0.004093146,0.0009875322,0.00344259,0.0016848905,0.0007880361,0.006832421],"category_scores_gemma":[0.013795553,0.00039277348,0.0010119317,0.0024555472,0.0022420804,0.006258187,0.0030243895,0.0017171205,0.0019491257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051446963,0.00009725728,0.011581532,0.00036731586,0.00008458349,0.00042924492,0.0007751908,0.069258705,0.007271415,0.7069178,0.0071539083,0.19554849],"study_design_scores_gemma":[0.000055369284,0.00008206793,0.001859128,0.000051888786,0.00003137379,0.00029052712,0.00012191232,0.3481417,0.013917067,0.6298924,0.0054920483,0.00006448697],"about_ca_topic_score_codex":0.002580688,"about_ca_topic_score_gemma":0.0018241233,"teacher_disagreement_score":0.006832421,"about_ca_system_score_codex":0.0021652768,"about_ca_system_score_gemma":0.0011263175,"threshold_uncertainty_score":0.022856712},"labels":[],"label_agreement":null},{"id":"W2064998746","doi":"10.1515/jmc-2012-0002","title":"Finding discrete logarithms with a set orbit distinguisher","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Logarithm; Orbit (dynamics); Set (abstract data type); Discrete logarithm; Mathematics; Arithmetic; Computer science; Mathematical analysis; Computer security; Programming language; Public-key cryptography","score_opus":0.028690374475523445,"score_gpt":0.2826695385318816,"score_spread":0.2539791640563581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064998746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.45362765,0.00040896365,0.53303707,0.002122559,0.00011924491,0.0001627246,0.00025770513,0.0012666499,0.008997411],"genre_scores_gemma":[0.8490161,0.00012374096,0.14748584,0.00017377797,0.000076847304,0.00007971804,0.0002055182,0.000088167486,0.0027504326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972166,0.00045543196,0.00024083999,0.0006880724,0.0010070443,0.00039201594],"domain_scores_gemma":[0.9741976,0.018665547,0.0016723379,0.0037013323,0.0008433256,0.00091979105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003149045,0.00059640926,0.0012524651,0.0012809767,0.0016842121,0.0034813872,0.0014143129,0.0016724516,0.0031811208],"category_scores_gemma":[0.016419303,0.0005175119,0.0012554886,0.0013707099,0.0035470156,0.008118924,0.004667417,0.0040481505,0.00066558656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039495267,0.0007811175,0.015589608,0.00059004367,0.0002899123,0.00070690975,0.0017383596,0.14581375,0.05360271,0.6160353,0.0052115386,0.15569127],"study_design_scores_gemma":[0.00026599213,0.00052921864,0.001110065,0.00006760722,0.00012284446,0.00045183764,0.00022496293,0.440871,0.05811724,0.49382854,0.0043106014,0.00010005745],"about_ca_topic_score_codex":0.0005397036,"about_ca_topic_score_gemma":0.00048524165,"teacher_disagreement_score":0.0034813872,"about_ca_system_score_codex":0.0024493285,"about_ca_system_score_gemma":0.0020277472,"threshold_uncertainty_score":0.017771244},"labels":[],"label_agreement":null},{"id":"W2065463697","doi":"10.1016/j.tcs.2004.02.005","title":"The number of binary words avoiding abelian fourth powers grows exponentially","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponential growth; Binary number; Abelian group; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.00792064906453805,"score_gpt":0.24223702468757136,"score_spread":0.2343163756230333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065463697","genre_codex":"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.7242743,0.002857546,0.12878352,0.011260673,0.0015514191,0.0001522728,0.0012636197,0.0017135689,0.12814307],"genre_scores_gemma":[0.9088398,0.0023889914,0.034128714,0.0016938999,0.0015232448,0.00046231732,0.0014100581,0.0006598692,0.048893005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980882,0.00042074407,0.00010165629,0.0003684007,0.0006754609,0.00034554157],"domain_scores_gemma":[0.97977865,0.01500271,0.0012876551,0.001943339,0.0012728433,0.0007147007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001322591,0.001103703,0.0016988396,0.0022066578,0.001807412,0.0045036785,0.0022923367,0.003242249,0.011479961],"category_scores_gemma":[0.015620419,0.0010575227,0.0010401079,0.0015316001,0.003775661,0.011379355,0.0030152847,0.004097389,0.0032943757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006176686,0.00015805388,0.0023355654,0.00063135935,0.00008008658,0.00038878265,0.00036699002,0.007691692,0.022371667,0.91221166,0.011397649,0.041748956],"study_design_scores_gemma":[0.00010126104,0.00008781834,0.0017790748,0.00012456936,0.00007811618,0.0012710182,0.00015690197,0.03723992,0.015332913,0.92981935,0.013937827,0.00007121465],"about_ca_topic_score_codex":0.00016304317,"about_ca_topic_score_gemma":0.00019768352,"teacher_disagreement_score":0.011479961,"about_ca_system_score_codex":0.0010752871,"about_ca_system_score_gemma":0.0007775394,"threshold_uncertainty_score":0.038404346},"labels":[],"label_agreement":null},{"id":"W2065483996","doi":"10.1515/jmc.2009.016","title":"On the density of some special primes","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Arithmetic","score_opus":0.016047903562670104,"score_gpt":0.2496530297266319,"score_spread":0.23360512616396178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065483996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8628313,0.0012350625,0.1061771,0.001955937,0.00011198198,0.000044153865,0.00019230794,0.00022434864,0.027227802],"genre_scores_gemma":[0.99591017,0.00019936413,0.0028136414,0.000086307766,0.000108179054,0.00002675026,0.00003827036,0.000016162307,0.00080110435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983809,0.00060030835,0.000054157746,0.00025260416,0.000517278,0.00019484511],"domain_scores_gemma":[0.9891529,0.00786961,0.0009717063,0.00064163056,0.00072069565,0.00064342417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025025571,0.00035446932,0.0011141001,0.0027448223,0.00160306,0.0023837879,0.00081444153,0.0008356084,0.0030737824],"category_scores_gemma":[0.017490406,0.0004885163,0.0005242017,0.0010581571,0.0059723337,0.0033402215,0.0028624798,0.0014734069,0.00021669111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001193984,0.00002036863,0.0019187935,0.00007807201,0.000017889437,0.0002770642,0.0002732465,0.004278154,0.0029932484,0.9853983,0.0007577151,0.0038677813],"study_design_scores_gemma":[0.00005462308,0.00013542674,0.0030552945,0.00007353908,0.000043820033,0.0016667873,0.00030690973,0.05533648,0.0057983417,0.92982256,0.0036517286,0.000054493736],"about_ca_topic_score_codex":0.00033401515,"about_ca_topic_score_gemma":0.00016571234,"teacher_disagreement_score":0.0030737824,"about_ca_system_score_codex":0.0011517154,"about_ca_system_score_gemma":0.00036983742,"threshold_uncertainty_score":0.013234973},"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":"W2065586216","doi":"10.1007/s12095-013-0091-0","title":"Optimal parameters for the WG stream cipher family","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Cipher; Mathematics; Transformation (genetics); Exponent; Finite field; Degree (music); Discrete mathematics; Algebraic number; Sequence (biology); Transposition cipher; Algorithm; Combinatorics; Cryptography; Computer science; Mathematical analysis; Physics","score_opus":0.0336229700315679,"score_gpt":0.25574630739844845,"score_spread":0.22212333736688056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065586216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.19671318,0.0019764723,0.74509186,0.0026764749,0.00024435626,0.00023566188,0.0009793593,0.0005665057,0.051516186],"genre_scores_gemma":[0.89439535,0.0016216168,0.09095939,0.00044657322,0.00018477415,0.00040275446,0.00056006847,0.000286201,0.01114327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.00052216527,0.00008027322,0.00017025374,0.00034727226,0.00018167908],"domain_scores_gemma":[0.9981274,0.00086367736,0.0002537534,0.0004231037,0.00020031206,0.00013178094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020727422,0.00094237574,0.0007334918,0.0012356791,0.0006984444,0.0019836333,0.00080410205,0.0013249196,0.0049919332],"category_scores_gemma":[0.0071786526,0.00040289387,0.00053282315,0.00090728595,0.001548826,0.003879603,0.0018357473,0.0017401495,0.0013414354],"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.00064969104,0.000072980256,0.0006622081,0.00010089994,0.00004572008,0.000100951525,0.00016779562,0.07475011,0.007831215,0.85553175,0.0056548505,0.054431655],"study_design_scores_gemma":[0.00013468128,0.00010593246,0.0003208114,0.00009368123,0.00003298436,0.00019736655,0.0000662945,0.19995134,0.0059515024,0.7863379,0.006762903,0.00004461103],"about_ca_topic_score_codex":0.00032750375,"about_ca_topic_score_gemma":0.00042091354,"teacher_disagreement_score":0.0049919332,"about_ca_system_score_codex":0.001344284,"about_ca_system_score_gemma":0.0017498228,"threshold_uncertainty_score":0.016699612},"labels":[],"label_agreement":null},{"id":"W2066106400","doi":"10.1016/j.jcta.2013.01.010","title":"Advances in the merit factor problem for binary sequences","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Binary number; Skew; Conjecture; Figure of merit; Aperiodic graph; Combinatorics; Complementary sequences; Binary Golay code; Pseudorandom binary sequence; Autocorrelation; Discrete mathematics; Algorithm; Statistics; Computer science; Arithmetic","score_opus":0.010201449082750266,"score_gpt":0.24430902632471282,"score_spread":0.23410757724196257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066106400","genre_codex":"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.19492188,0.03627871,0.55285186,0.033076502,0.0029927942,0.00013241889,0.0006673949,0.00047169795,0.17860682],"genre_scores_gemma":[0.7407066,0.022417793,0.18922658,0.0016941914,0.007993495,0.00017191288,0.000714446,0.000451864,0.03662311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.000539401,0.00007434345,0.0003083496,0.0005058609,0.00021295255],"domain_scores_gemma":[0.9893321,0.008399495,0.00044883747,0.00080152013,0.00066691404,0.0003511437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038428232,0.0012222072,0.002237095,0.002168085,0.0015677402,0.0043287245,0.0022154779,0.003361578,0.0062978077],"category_scores_gemma":[0.021522501,0.0006921646,0.0010597873,0.0033711193,0.0037584421,0.01074852,0.0024535062,0.0058939788,0.0012319665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015588189,0.00005021457,0.00030928114,0.00015243814,0.000013612251,0.000052752297,0.000113089176,0.010601299,0.0006484187,0.9439059,0.0070034657,0.0369936],"study_design_scores_gemma":[0.000030733976,0.00002591931,0.0001103969,0.000039513183,0.000009565739,0.00007101792,0.000036497604,0.038954634,0.00031225875,0.95299697,0.0073970277,0.000015456035],"about_ca_topic_score_codex":0.0015043233,"about_ca_topic_score_gemma":0.001245689,"teacher_disagreement_score":0.0062978077,"about_ca_system_score_codex":0.0033457044,"about_ca_system_score_gemma":0.0016813332,"threshold_uncertainty_score":0.024274826},"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":"W2067182672","doi":"10.1016/j.jcta.2008.01.009","title":"A bound on the size of separating hash families","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Hash function; Upper and lower bounds; Perfect hash function; Collision resistance; Mathematics; Double hashing; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Hash table; Computer security","score_opus":0.014942243950462786,"score_gpt":0.22755504918899902,"score_spread":0.21261280523853623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067182672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4635905,0.0070375414,0.3825158,0.032385264,0.0014105511,0.00066758896,0.008011056,0.0057046693,0.09867699],"genre_scores_gemma":[0.8937762,0.0031156468,0.07309836,0.0029904875,0.0021558346,0.0007192748,0.0035454072,0.0016761547,0.018922593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98883563,0.0028417092,0.0005804352,0.0020741217,0.0036559151,0.0020121832],"domain_scores_gemma":[0.8155756,0.14677525,0.0042173523,0.02367195,0.0041000247,0.0056597446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009476398,0.0027516638,0.005011038,0.002992382,0.0043196976,0.01038927,0.008009379,0.007275058,0.021908175],"category_scores_gemma":[0.08348447,0.003606633,0.0036307406,0.0041007763,0.008424032,0.03299,0.013364822,0.010734059,0.0040930156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008554377,0.0011005637,0.009308026,0.0015877639,0.00058790337,0.00072595617,0.0017417426,0.10290237,0.03632971,0.6835085,0.048569698,0.105083354],"study_design_scores_gemma":[0.0005335941,0.00036816977,0.0016718137,0.0002035416,0.000324705,0.0007546019,0.00023813406,0.18103154,0.0125914,0.79405856,0.008037274,0.00018662235],"about_ca_topic_score_codex":0.0009388904,"about_ca_topic_score_gemma":0.0009104282,"teacher_disagreement_score":0.021908175,"about_ca_system_score_codex":0.005698424,"about_ca_system_score_gemma":0.004540442,"threshold_uncertainty_score":0.07329011},"labels":[],"label_agreement":null},{"id":"W2068228420","doi":"10.1145/2016567.2016582","title":"Root lifting techniques and applications to list decoding","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Root (linguistics); Series (stratigraphy); Mathematics; Decoding methods; Polynomial; Root-finding algorithm; Algorithm; Discrete mathematics; Algebra over a field; Applied mathematics; Computer science; Combinatorics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.05913432196443307,"score_gpt":0.30342949215306286,"score_spread":0.24429517018862978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068228420","genre_codex":"methods","genre_gemma":"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.019051734,0.00041594522,0.96881837,0.000510532,0.0001372249,0.00005780263,0.0000572989,0.0008269957,0.010124159],"genre_scores_gemma":[0.2495137,0.0015746997,0.7244535,0.00034801132,0.00034378664,0.00015714907,0.00023860711,0.0005305236,0.022840066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994153,0.00015405622,0.00003475512,0.00006713839,0.00023929653,0.00008938814],"domain_scores_gemma":[0.9993105,0.00031732372,0.000048835092,0.00019337858,0.000099633944,0.000030360565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062727294,0.0007780908,0.0007349177,0.0012595226,0.00080399786,0.0012456373,0.0010107085,0.00093162974,0.0066661295],"category_scores_gemma":[0.0033737493,0.00036849317,0.00090478634,0.0013939675,0.0013213545,0.0019172865,0.0028083634,0.0022864377,0.0030774625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012850823,0.00009260834,0.00038597186,0.00015456589,0.00002851641,0.00023078927,0.0005086566,0.048801538,0.019724276,0.61675286,0.004740755,0.30845088],"study_design_scores_gemma":[0.000057683254,0.000114516275,0.00019683407,0.0000627917,0.000029778777,0.0004168913,0.000117306656,0.40346158,0.0240359,0.5493813,0.022067014,0.000058343398],"about_ca_topic_score_codex":0.00070986926,"about_ca_topic_score_gemma":0.0009909794,"teacher_disagreement_score":0.0066661295,"about_ca_system_score_codex":0.0006205243,"about_ca_system_score_gemma":0.00065271696,"threshold_uncertainty_score":0.022300422},"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":"W2069444685","doi":"10.1016/s1071-5797(03)00007-8","title":"Homogeneous weights and exponential sums","year":2003,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Sanitarium Association; National Science Foundation","keywords":"Mathematics; Homogeneous; Exponential function; Exponential sum; Algebraic number; Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Mathematical analysis","score_opus":0.008421389931006997,"score_gpt":0.19568288219313698,"score_spread":0.18726149226212999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069444685","genre_codex":"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.5266592,0.011869398,0.14553793,0.010265,0.0019634953,0.00006930492,0.0004005723,0.00039848583,0.30283657],"genre_scores_gemma":[0.9163818,0.0038965642,0.008094582,0.00073747325,0.0022339541,0.000073694515,0.00021054987,0.00012802347,0.06824335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00024091525,0.000040795592,0.00014109023,0.00023794484,0.0001524675],"domain_scores_gemma":[0.9977047,0.0012708066,0.00028216458,0.00024164225,0.00023524795,0.00026550677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014983024,0.001139395,0.0013585376,0.0036065835,0.0021327143,0.0040057683,0.0013140598,0.0013681855,0.008687559],"category_scores_gemma":[0.0057013533,0.00065772637,0.00064870086,0.004478392,0.004464977,0.007954376,0.0027874107,0.0032004807,0.0011882207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011507983,0.00001192667,0.000067261615,0.000014301921,0.0000030183194,0.000016239075,0.00007844295,0.00024571057,0.00013718515,0.99588615,0.00063761167,0.0028906357],"study_design_scores_gemma":[0.0000044399594,0.0000035016512,0.00006079001,0.000006326495,0.0000043397513,0.00003568739,0.000022631886,0.0009143258,0.00012031235,0.9974437,0.0013788263,0.000005305039],"about_ca_topic_score_codex":0.00073738565,"about_ca_topic_score_gemma":0.0006236034,"teacher_disagreement_score":0.008687559,"about_ca_system_score_codex":0.0019228067,"about_ca_system_score_gemma":0.0006737878,"threshold_uncertainty_score":0.029062748},"labels":[],"label_agreement":null},{"id":"W2069800452","doi":"10.1109/isit.2003.1228421","title":"Two-tuple-balance of nonbinary sequences with ideal two-level autocorrelation","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Tuple; Ideal (ethics); Balance (ability); Computer science; Mathematics; Statistics; Algorithm; Discrete mathematics; Psychology","score_opus":0.02106402537035717,"score_gpt":0.24937327713575305,"score_spread":0.22830925176539588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069800452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.33724067,0.00047103743,0.63504374,0.00019224834,0.00011720801,0.000055169283,0.0001734169,0.00035708706,0.02634955],"genre_scores_gemma":[0.9618345,0.00016542156,0.03429042,0.00007720665,0.00005975811,0.0000335568,0.00011923712,0.000029743089,0.0033901783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996234,0.000049150065,0.000028085205,0.000076791854,0.00013404466,0.00008849434],"domain_scores_gemma":[0.99946994,0.00011636477,0.00013191339,0.00009705299,0.00011667047,0.000068072164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040168487,0.00027314475,0.00027131624,0.00044588058,0.0004681884,0.00075070665,0.000334518,0.00035546895,0.002764681],"category_scores_gemma":[0.0014221484,0.00015508097,0.0001796134,0.00054412894,0.000609541,0.0015469055,0.000549058,0.00038904825,0.00056913437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000599325,0.000051183135,0.001580471,0.00014433281,0.00001480548,0.0005737378,0.00029778722,0.016799884,0.1517405,0.74379194,0.0012182216,0.08318785],"study_design_scores_gemma":[0.000100087076,0.00070326065,0.0031605517,0.000054338667,0.000035704034,0.0022982846,0.0002786788,0.25114807,0.19950995,0.51852405,0.024076644,0.00011040344],"about_ca_topic_score_codex":0.0003756473,"about_ca_topic_score_gemma":0.00030663222,"teacher_disagreement_score":0.002764681,"about_ca_system_score_codex":0.00037192772,"about_ca_system_score_gemma":0.0003706464,"threshold_uncertainty_score":0.0092487335},"labels":[],"label_agreement":null},{"id":"W2070033202","doi":"10.1016/j.ffa.2014.12.003","title":"A probabilistic approach to value sets of polynomials over finite fields","year":2015,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Coset; Polynomial; Discrete mathematics; Distribution (mathematics); Combinatorics; Random variable; Infinity; Expected value; Value (mathematics); Random field; Finite set; Order (exchange); Statistics; Mathematical analysis","score_opus":0.030584535267437006,"score_gpt":0.252485138880437,"score_spread":0.22190060361299999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070033202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.018396128,0.001592976,0.9655534,0.002874448,0.00018234826,0.000057258112,0.0002876469,0.00011866137,0.010937178],"genre_scores_gemma":[0.72676545,0.004701734,0.24345708,0.0013644047,0.00347189,0.00046454708,0.0007246769,0.00030510747,0.018745044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98729867,0.005169913,0.00065733236,0.0015801777,0.0043292698,0.00096453674],"domain_scores_gemma":[0.94845366,0.041073777,0.002467852,0.0041294666,0.002552952,0.0013222859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010717063,0.001611108,0.0029434746,0.0065361126,0.0036750955,0.010375513,0.0068240194,0.0033661455,0.0055329734],"category_scores_gemma":[0.04168387,0.0025604481,0.0041802507,0.006835518,0.012963142,0.023353174,0.0075469585,0.008834806,0.00072321226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006566731,0.0000060799143,0.000064742984,0.000016666905,0.000005981934,0.000012814069,0.000055306362,0.0030984317,0.000057102417,0.99525744,0.00016781237,0.0012510597],"study_design_scores_gemma":[0.000004028386,0.000004521373,0.000031011306,0.000013062056,0.0000054982797,0.00002104749,0.000014690155,0.01850196,0.00006503389,0.98070234,0.0006272053,0.0000094787265],"about_ca_topic_score_codex":0.0025577974,"about_ca_topic_score_gemma":0.0019987007,"teacher_disagreement_score":0.010717063,"about_ca_system_score_codex":0.006764783,"about_ca_system_score_gemma":0.0030315293,"threshold_uncertainty_score":0.056677938},"labels":[],"label_agreement":null},{"id":"W2070485142","doi":"10.4153/cmb-2001-024-7","title":"The Zeta Function of a Pair of Quadratic Forms","year":2001,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Riemann zeta function; Invertible matrix; Function field; Function (biology); Pure mathematics; Field (mathematics); Order (exchange); Quadratic equation; Finite field; Arithmetic zeta function; Combinatorics; Geometry","score_opus":0.009286211904377853,"score_gpt":0.1928825936783488,"score_spread":0.18359638177397097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070485142","genre_codex":"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.97014666,0.00021143537,0.017664663,0.00027324766,0.00012397645,0.000026599891,0.000060400496,0.00007160851,0.011421464],"genre_scores_gemma":[0.9963303,0.00006662471,0.0013335561,0.000024213914,0.000037531547,0.000012334889,0.000059336635,0.000014373632,0.0021216806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912196,0.0001862693,0.000039254588,0.00009755453,0.00035043366,0.00020454403],"domain_scores_gemma":[0.9983907,0.00043443817,0.0002424642,0.000114272865,0.00028588725,0.0005323421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014736981,0.00067725003,0.000764794,0.0034840382,0.0016037195,0.003183281,0.0006718478,0.0010124085,0.003243915],"category_scores_gemma":[0.005161523,0.00025065092,0.00046568294,0.0010830996,0.0030831865,0.003000856,0.0017572715,0.00083155354,0.0006529677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093625457,0.00013153945,0.0139246,0.00014639033,0.000078317345,0.0029271268,0.0011024543,0.009535404,0.019666806,0.9328933,0.0024656486,0.016192064],"study_design_scores_gemma":[0.00015955932,0.00047679996,0.009648623,0.0001499872,0.000087494685,0.002367114,0.001511374,0.08282734,0.018729422,0.87608176,0.0077834977,0.0001771733],"about_ca_topic_score_codex":0.00058878807,"about_ca_topic_score_gemma":0.00031843974,"teacher_disagreement_score":0.0034840382,"about_ca_system_score_codex":0.0012372449,"about_ca_system_score_gemma":0.0005035671,"threshold_uncertainty_score":0.010851979},"labels":[],"label_agreement":null},{"id":"W2070626323","doi":"10.1007/s13389-012-0035-1","title":"Sequential multiplier with sub-linear gate complexity","year":2012,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplier (economics); Finite field; Mathematics; Binary number; Arithmetic; Time complexity; Computational complexity theory; Algorithm; Computer science; Discrete mathematics","score_opus":0.020973259563839622,"score_gpt":0.2258844092521239,"score_spread":0.20491114968828428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070626323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.13245201,0.0007687789,0.8123995,0.0016781604,0.000293202,0.00033482644,0.00048211517,0.0017564527,0.04983505],"genre_scores_gemma":[0.77197134,0.00048163062,0.19761342,0.00062039064,0.00034230592,0.00035775776,0.0004058783,0.00015859106,0.028048681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904436,0.00022227674,0.0000658523,0.00018528574,0.00032881874,0.00015341549],"domain_scores_gemma":[0.99841297,0.0007534126,0.00014499927,0.0003843474,0.00023442136,0.000069847636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065444113,0.000763663,0.00063570845,0.0005949728,0.00073270896,0.0014601197,0.0009859162,0.0006284769,0.009512605],"category_scores_gemma":[0.002118764,0.00040515276,0.0005218628,0.0009572971,0.0009164054,0.0024326073,0.0015668028,0.0012882885,0.0015258315],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013723121,0.00022192288,0.0010003349,0.000480813,0.00010850607,0.00041450173,0.00018826663,0.05636655,0.06103846,0.68472064,0.011157739,0.18292992],"study_design_scores_gemma":[0.00034329042,0.0009490198,0.0005303386,0.000082874736,0.00019390805,0.00083548034,0.00004705786,0.3737643,0.08153076,0.5135476,0.028096816,0.00007857003],"about_ca_topic_score_codex":0.00055206334,"about_ca_topic_score_gemma":0.0016181383,"teacher_disagreement_score":0.009512605,"about_ca_system_score_codex":0.0011181937,"about_ca_system_score_gemma":0.0025683395,"threshold_uncertainty_score":0.0318228},"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":"W2071347182","doi":"10.1016/j.dam.2012.08.013","title":"Cyclotomic orthomorphisms of finite fields","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Prime (order theory); Cyclotomic field; Finite field; Cyclotomic polynomial; Index (typography); Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Mathematical analysis; Polynomial","score_opus":0.014880436468860397,"score_gpt":0.23108414275738287,"score_spread":0.21620370628852248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071347182","genre_codex":"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.7199364,0.0016256438,0.060635295,0.0025675357,0.0012593705,0.00008119788,0.0004727941,0.0002759329,0.21314575],"genre_scores_gemma":[0.9582635,0.0008702911,0.0065204054,0.00057663996,0.0006682341,0.000051683186,0.00022890934,0.00007555485,0.032744855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996338,0.00007787233,0.000017652204,0.00006560122,0.0000895478,0.00011562272],"domain_scores_gemma":[0.9995264,0.00016366743,0.00008337172,0.000078284356,0.000052480846,0.000095794494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037138246,0.00044797728,0.00048259666,0.0013329941,0.0010056065,0.0013742029,0.0003042673,0.00054352253,0.006734201],"category_scores_gemma":[0.0009355337,0.0002154509,0.00040723098,0.0008080189,0.0018192312,0.0017395177,0.001060932,0.0015339464,0.0006338466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000682375,0.000021782598,0.0001658207,0.000015878235,0.0000033501428,0.000081507686,0.00012649548,0.00039750367,0.0015854912,0.98987854,0.0010077576,0.0066475356],"study_design_scores_gemma":[0.000036912705,0.000037323072,0.0004905991,0.000012150424,0.0000064225223,0.00016953825,0.00009207918,0.0014847786,0.0012614672,0.9898318,0.006566328,0.000010547787],"about_ca_topic_score_codex":0.00047602446,"about_ca_topic_score_gemma":0.00043858145,"teacher_disagreement_score":0.006734201,"about_ca_system_score_codex":0.00064969604,"about_ca_system_score_gemma":0.00042908106,"threshold_uncertainty_score":0.022528112},"labels":[],"label_agreement":null},{"id":"W2071480454","doi":"10.5539/jmr.v6n1p100","title":"The Array Structure of Modified Jacobi Sequences","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hubei Provincial Department of Education","keywords":"Mathematics; Autocorrelation; Prime (order theory); Jacobi method; Prime number; Pure mathematics; Combinatorics; Mathematical analysis; Statistics","score_opus":0.06546345803917124,"score_gpt":0.35396414771880813,"score_spread":0.2885006896796369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071480454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.31135026,0.0011967465,0.657981,0.00028034934,0.00026653995,0.00007725689,0.00030780514,0.0005666959,0.027973428],"genre_scores_gemma":[0.8868098,0.0005372367,0.098932475,0.00018301162,0.00020751664,0.00008338531,0.00031548468,0.00010231657,0.012828785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966455,0.000058412203,0.00002228724,0.00007400378,0.00012672,0.000054064512],"domain_scores_gemma":[0.998978,0.00020550267,0.00020578822,0.00014953218,0.00038204633,0.00007910422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018738174,0.00033827053,0.00028340874,0.0009981357,0.0003449913,0.0005522912,0.00044358533,0.00042451173,0.0028382784],"category_scores_gemma":[0.0017439075,0.00023418984,0.00019543472,0.0008642849,0.0005020653,0.0010341918,0.0003655508,0.00048178746,0.00065109105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039101837,0.00004987253,0.0028188666,0.00020889226,0.00004112097,0.0006935535,0.00048091498,0.054714747,0.18976547,0.6263041,0.0028046481,0.121726744],"study_design_scores_gemma":[0.000058597092,0.0005569753,0.0050864983,0.000054264878,0.000040700113,0.0018425599,0.0002062659,0.53140455,0.08233659,0.34987792,0.02832367,0.00021136327],"about_ca_topic_score_codex":0.00038126102,"about_ca_topic_score_gemma":0.00032792083,"teacher_disagreement_score":0.0028382784,"about_ca_system_score_codex":0.0003348013,"about_ca_system_score_gemma":0.00033381363,"threshold_uncertainty_score":0.00949502},"labels":[],"label_agreement":null},{"id":"W2071813582","doi":"10.1109/cwit.2013.6621585","title":"On selection of optimal parameters for the WG stream cipher family","year":2013,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Selection (genetic algorithm); Cipher; Randomness; Transformation (genetics); Extension (predicate logic); Computer science; Cryptography; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Encryption; Statistics; Programming language; Computer security","score_opus":0.016735014606985274,"score_gpt":0.22876195506026276,"score_spread":0.21202694045327747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071813582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.117222786,0.0030271905,0.85851705,0.00036574813,0.00009509606,0.00018302891,0.00014012717,0.0003393624,0.020109603],"genre_scores_gemma":[0.76278794,0.002572204,0.23099402,0.00014604582,0.0001297881,0.00037929157,0.0002271596,0.0002629028,0.0025007317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837035,0.0007013751,0.00013536731,0.00021893428,0.00045820905,0.000115788556],"domain_scores_gemma":[0.99714357,0.0017624545,0.00040736928,0.0003274356,0.0002872497,0.0000718621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022415314,0.0009870294,0.00070149585,0.001473388,0.0005623909,0.000938991,0.00042744805,0.000644828,0.0016228642],"category_scores_gemma":[0.009475396,0.00036649575,0.00039494215,0.0008410513,0.0011926891,0.002217608,0.0009770334,0.0011130997,0.00069774245],"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.0012051715,0.0001291344,0.0036462925,0.0006031431,0.00011027137,0.0005904274,0.00046361034,0.22698006,0.122123696,0.4172036,0.0034984348,0.22344612],"study_design_scores_gemma":[0.0002223799,0.0006023502,0.001421571,0.0003610875,0.00009927917,0.001191471,0.0003057295,0.5357325,0.17568256,0.261899,0.022329606,0.00015255455],"about_ca_topic_score_codex":0.00010550701,"about_ca_topic_score_gemma":0.00014404529,"teacher_disagreement_score":0.0022415314,"about_ca_system_score_codex":0.00057245,"about_ca_system_score_gemma":0.0005971287,"threshold_uncertainty_score":0.011854529},"labels":[],"label_agreement":null},{"id":"W2072057413","doi":"10.1145/2220336.2220343","title":"An Efficient Finite Field Multiplier Using Redundant Representation","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Computer science; Application-specific integrated circuit; Finite field; Representation (politics); CMOS; Binary number; Algorithm; Arithmetic; Computer engineering; Electronic engineering; Computer hardware; Mathematics; Discrete mathematics","score_opus":0.041535145269996805,"score_gpt":0.31572095571479125,"score_spread":0.27418581044479445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072057413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.15375587,0.00104497,0.82764757,0.00031582697,0.0003024286,0.00013602436,0.00021225853,0.0023263283,0.0142588075],"genre_scores_gemma":[0.5990831,0.00036990593,0.39173594,0.00012567987,0.000102142905,0.000084012696,0.00028031433,0.00004900964,0.008169906],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998945,0.000017504823,0.000009733131,0.000022140244,0.000036954374,0.000019158975],"domain_scores_gemma":[0.9998839,0.0000186566,0.000022476655,0.000023764318,0.000042305976,0.000008792463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000124741,0.00038467292,0.00034345072,0.00046901588,0.0003157197,0.00039393688,0.0006345502,0.00033487985,0.0032012095],"category_scores_gemma":[0.00026384866,0.00017569112,0.00029615074,0.00045105815,0.000174848,0.0005725567,0.0002343292,0.00028448133,0.00081739953],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004419826,0.00009414683,0.00049889623,0.0004166852,0.00007201244,0.00058024976,0.00010469228,0.0126871355,0.59485424,0.04499648,0.0041674045,0.3410861],"study_design_scores_gemma":[0.0002606922,0.0026761077,0.0017014326,0.00012094583,0.00027798803,0.004089058,0.00007930096,0.27882215,0.62664133,0.017315032,0.06788882,0.00012710845],"about_ca_topic_score_codex":0.00018585431,"about_ca_topic_score_gemma":0.0004522732,"teacher_disagreement_score":0.0032012095,"about_ca_system_score_codex":0.00023328794,"about_ca_system_score_gemma":0.00042346652,"threshold_uncertainty_score":0.010709107},"labels":[],"label_agreement":null},{"id":"W2072113533","doi":"10.3934/amc.2012.6.347","title":"Cycle structure of permutation functions over finite fields and their applications","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Permutation (music); Inverse; Finite field; Order (exchange); Function (biology); Field (mathematics); Pure mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.012029016746072835,"score_gpt":0.27961477844150046,"score_spread":0.26758576169542764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072113533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.33726558,0.005180029,0.57428986,0.00068648875,0.0003399909,0.00010896961,0.00012744285,0.00036497726,0.08163662],"genre_scores_gemma":[0.8953882,0.0033120958,0.081942864,0.00017179968,0.0002752038,0.00009064196,0.0001499098,0.00013122085,0.018538192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997061,0.00006808591,0.000018326227,0.000053208532,0.00009363983,0.000060586786],"domain_scores_gemma":[0.9994036,0.0002638718,0.0000792562,0.000088539535,0.00010798164,0.00005682391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041385685,0.00038855954,0.00027853853,0.001143461,0.00073658855,0.0008024536,0.00037317164,0.00058243435,0.0027751694],"category_scores_gemma":[0.0018544287,0.00023817923,0.00032203007,0.0006803553,0.0010828474,0.00149273,0.0007219294,0.000894498,0.0005929922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041645995,0.00002708959,0.00033469163,0.00005915297,0.000005175072,0.0001250321,0.00021750551,0.00623433,0.003477872,0.9499106,0.00043062723,0.039136335],"study_design_scores_gemma":[0.000013506893,0.00008862916,0.0002880587,0.000053520384,0.000010734223,0.00038566,0.00008205696,0.03940114,0.008807383,0.93407303,0.016765397,0.0000309905],"about_ca_topic_score_codex":0.0004776389,"about_ca_topic_score_gemma":0.00035249977,"teacher_disagreement_score":0.0027751694,"about_ca_system_score_codex":0.0006561777,"about_ca_system_score_gemma":0.00048038812,"threshold_uncertainty_score":0.009283841},"labels":[],"label_agreement":null},{"id":"W2072234772","doi":"10.4153/cmb-2007-020-0","title":"Every Real Algebraic Integer Is a Difference of Two Mahler Measures","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Integer (computer science); Degree (music); Algebraic number; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.016980680062264723,"score_gpt":0.23810430518128378,"score_spread":0.22112362511901906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072234772","genre_codex":"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.82433724,0.0005858281,0.14008042,0.0012259205,0.0002521002,0.000031759362,0.00016337978,0.0002472074,0.033076175],"genre_scores_gemma":[0.984735,0.000112552945,0.012521475,0.00018310992,0.00012348454,0.000018838746,0.00006088859,0.000025615538,0.0022190653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981109,0.00036210092,0.00012945813,0.0003749149,0.00069755653,0.00032498562],"domain_scores_gemma":[0.9967874,0.001378598,0.0007072033,0.0003683015,0.0004621091,0.00029637152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001619689,0.0003843309,0.00047383513,0.0015195357,0.000685011,0.0034683908,0.0007066877,0.0007205386,0.002901804],"category_scores_gemma":[0.004917529,0.00023934318,0.00065732124,0.0008402718,0.003353265,0.0062898546,0.0015750584,0.0016939581,0.00040536412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110110224,0.000017929906,0.00073657907,0.000027530157,0.000010788276,0.00011680053,0.00025154103,0.0012376268,0.00440036,0.98843676,0.00023298513,0.0044209603],"study_design_scores_gemma":[0.00006842555,0.00025491643,0.0017255377,0.000046873403,0.00003066923,0.00078722,0.0003074697,0.028252665,0.010644907,0.94902784,0.008741335,0.000112245456],"about_ca_topic_score_codex":0.0003402269,"about_ca_topic_score_gemma":0.00024151977,"teacher_disagreement_score":0.0034683908,"about_ca_system_score_codex":0.0015144099,"about_ca_system_score_gemma":0.00041521818,"threshold_uncertainty_score":0.010987818},"labels":[],"label_agreement":null},{"id":"W2072285126","doi":"10.1109/tit.2013.2243496","title":"New Polyphase Sequence Families With Low Correlation Derived From the Weil Bound of Exponential Sums","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Sequence (biology); Combinatorics; Mathematics; Discrete mathematics; Biology","score_opus":0.007841506769423124,"score_gpt":0.19821105641457804,"score_spread":0.1903695496451549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072285126","genre_codex":"methods","genre_gemma":"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.24925233,0.0014807545,0.7028505,0.00068533473,0.00030615536,0.00012939854,0.00033174932,0.00060802244,0.044355813],"genre_scores_gemma":[0.84975976,0.0013698876,0.13556495,0.00047088228,0.0004948742,0.00031362573,0.0004248417,0.0003771647,0.011224109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997943,0.000513208,0.00011186324,0.00039160645,0.00076682394,0.00027352854],"domain_scores_gemma":[0.9935061,0.0036768839,0.00081879005,0.0009208652,0.0007086584,0.00036874923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018174585,0.00065449387,0.00076873857,0.0019163341,0.0018177051,0.001961768,0.0007523969,0.0011575255,0.0048928945],"category_scores_gemma":[0.011018818,0.00073734147,0.0007752122,0.0015331528,0.0017830373,0.004713602,0.0020589982,0.0023309938,0.0010180857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001616914,0.000046035173,0.0010162569,0.00013292748,0.000017046812,0.000412008,0.00048327498,0.006522471,0.015094117,0.9359561,0.0018306314,0.03832724],"study_design_scores_gemma":[0.000062787025,0.00028402195,0.0013783079,0.00012599601,0.000048786518,0.0025646319,0.00029360468,0.082132705,0.0379004,0.8464324,0.028605158,0.00017113393],"about_ca_topic_score_codex":0.00022264976,"about_ca_topic_score_gemma":0.00023894667,"teacher_disagreement_score":0.0048928945,"about_ca_system_score_codex":0.0012073324,"about_ca_system_score_gemma":0.0007946706,"threshold_uncertainty_score":0.01636833},"labels":[],"label_agreement":null},{"id":"W2072368099","doi":"10.1049/iet-com.2012.0491","title":"Convolutional doubly orthogonal codes over <i>GF</i> ( <i>q</i> )","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"GF(2); Convolutional code; Computer science; Mathematics; Combinatorics; Algorithm; Finite field; Decoding methods","score_opus":0.021424821267185524,"score_gpt":0.2547704431675885,"score_spread":0.23334562190040298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072368099","genre_codex":"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.5488085,0.00108337,0.42329192,0.0003262586,0.000119200806,0.00009821147,0.0006299778,0.00053919584,0.025103282],"genre_scores_gemma":[0.9555819,0.00049307576,0.040540338,0.00006674962,0.000020518793,0.00003790927,0.00017451838,0.00002322316,0.0030617935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997712,0.000029362644,0.000015993559,0.000029836077,0.00009188757,0.00006174514],"domain_scores_gemma":[0.99944276,0.00017204824,0.000146192,0.00011644531,0.00009868091,0.000023953566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024457093,0.00024852707,0.0002175494,0.00043153646,0.00027000817,0.0004718245,0.00027791035,0.00022163393,0.001045018],"category_scores_gemma":[0.0011724852,0.000079006015,0.00015966251,0.00055370433,0.00042239673,0.00051313074,0.00043149863,0.00034186264,0.00022660823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004679778,0.00013140547,0.004511407,0.00036476264,0.000048476642,0.000504974,0.0004380137,0.06413525,0.2378246,0.48142406,0.0022860933,0.20786294],"study_design_scores_gemma":[0.00010484063,0.0005470176,0.0060370695,0.00019068723,0.00007380471,0.0017314063,0.00015447567,0.40044096,0.40684158,0.14920187,0.03455938,0.00011680357],"about_ca_topic_score_codex":0.0013289555,"about_ca_topic_score_gemma":0.0015457665,"teacher_disagreement_score":0.0013289555,"about_ca_system_score_codex":0.00052948605,"about_ca_system_score_gemma":0.00077404844,"threshold_uncertainty_score":0.0038416982},"labels":[],"label_agreement":null},{"id":"W2074001034","doi":"10.1080/09720529.2006.10698064","title":"Some generalizations of Rédei’s theorem","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Mathematical Sciences and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Projective plane; Transversal (combinatorics); Combinatorics; Plane (geometry); Affine plane (incidence geometry); Affine transformation; Line (geometry); Order (exchange); Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.01071572952666049,"score_gpt":0.24236119864046185,"score_spread":0.23164546911380135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074001034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.3574986,0.0026101118,0.4373096,0.0033934985,0.00049659394,0.00012571264,0.0013368347,0.00076169457,0.19646735],"genre_scores_gemma":[0.8772275,0.0014932054,0.090798184,0.0010893927,0.00065190345,0.00016446115,0.00072339096,0.00018140931,0.027670525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756706,0.00040063108,0.00017637487,0.00082008797,0.0006266718,0.0004092205],"domain_scores_gemma":[0.9908751,0.0043448634,0.0008107189,0.002151567,0.0011706796,0.00064705283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003479813,0.0005700676,0.0009914412,0.0023820025,0.0018459237,0.0023353791,0.0016922429,0.0008311222,0.007938441],"category_scores_gemma":[0.0091631785,0.00065016554,0.0016018676,0.002011676,0.0028424112,0.00645906,0.0035384072,0.0036500252,0.001240559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010279143,0.00003095101,0.0018598273,0.00006779549,0.000019483861,0.00017168322,0.00028914175,0.0036979308,0.0010478274,0.9658961,0.0036815892,0.023134826],"study_design_scores_gemma":[0.000040109055,0.00009302433,0.0015582554,0.000041424584,0.00003995128,0.0007129095,0.00017623615,0.024885977,0.0027768854,0.94094515,0.028699618,0.00003040594],"about_ca_topic_score_codex":0.0013196762,"about_ca_topic_score_gemma":0.0007628658,"teacher_disagreement_score":0.007938441,"about_ca_system_score_codex":0.0017620416,"about_ca_system_score_gemma":0.000543435,"threshold_uncertainty_score":0.02655673},"labels":[],"label_agreement":null},{"id":"W2074881723","doi":"10.1016/j.jcta.2010.11.005","title":"Relatively prime polynomials and nonsingular Hankel matrices over finite fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Invertible matrix; Hankel matrix; Coprime integers; Monic polynomial; Finite field; Rank (graph theory); Prime (order theory); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Polynomial; Mathematical analysis","score_opus":0.005469718997047604,"score_gpt":0.22236128612609604,"score_spread":0.21689156712904845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074881723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8308273,0.0020347794,0.092129394,0.0034048208,0.00051278167,0.00007415791,0.0003113328,0.00026072038,0.07044478],"genre_scores_gemma":[0.9781001,0.0008224187,0.005659551,0.0002520385,0.00064546964,0.000026144737,0.00011113776,0.000035233836,0.0143479565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927706,0.00020475125,0.000027399696,0.00011795949,0.00020833075,0.00016449747],"domain_scores_gemma":[0.9974439,0.0013582704,0.0005232605,0.00025516836,0.00017664902,0.00024267685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008864627,0.00080414605,0.000809948,0.0015354698,0.0016333518,0.0028306637,0.0006816552,0.0010840648,0.00746313],"category_scores_gemma":[0.0034763026,0.00059458363,0.00045979983,0.0019075386,0.0032139092,0.0052435156,0.0014880458,0.0028554124,0.0009163805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008678375,0.000044181477,0.00023590201,0.0000252765,0.0000057484344,0.00018692468,0.00026661542,0.0012184662,0.0011195085,0.99184024,0.00068093254,0.0042894324],"study_design_scores_gemma":[0.000026185098,0.000034899,0.00024494977,0.000008353655,0.000006619841,0.00020396798,0.00009463752,0.0044257874,0.000795638,0.99272025,0.0014218478,0.000016802838],"about_ca_topic_score_codex":0.00053655275,"about_ca_topic_score_gemma":0.00062738714,"teacher_disagreement_score":0.00746313,"about_ca_system_score_codex":0.0010825564,"about_ca_system_score_gemma":0.00072516984,"threshold_uncertainty_score":0.024966657},"labels":[],"label_agreement":null},{"id":"W2075501204","doi":"10.1109/mwscas.2010.5548774","title":"Efficient VLSI implementation of a finite field multiplier using reordered normal basis","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"NIST; Multiplier (economics); Clock rate; Very-large-scale integration; Finite field; Computer science; Elliptic curve cryptography; Normal basis; Domino logic; Cryptography; Arithmetic; Parallel computing; CMOS; Application-specific integrated circuit; Public-key cryptography; Computer hardware; Embedded system; Chip; Logic synthesis; Electronic engineering; Logic gate; Mathematics; Algorithm; Engineering; Galois theory; Discrete mathematics; Encryption; Logic family","score_opus":0.013073163427114945,"score_gpt":0.2767760127203315,"score_spread":0.2637028492932165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075501204","genre_codex":"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.1474505,0.00074226985,0.8347154,0.00030058192,0.0002578424,0.00014687663,0.00013816875,0.0031290094,0.013119241],"genre_scores_gemma":[0.44905025,0.00043212122,0.54169536,0.000094224895,0.00006218532,0.000094997515,0.0002807986,0.000059689537,0.008230392],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999884,0.000020708916,0.000009920586,0.00001791295,0.000047278394,0.000020143949],"domain_scores_gemma":[0.999821,0.000039412378,0.000021958771,0.000029370662,0.0000736217,0.000014648705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017378922,0.00035610984,0.0002759876,0.00043072645,0.00032147087,0.00041435522,0.0007888279,0.00028254246,0.0036721672],"category_scores_gemma":[0.00029659068,0.00016150899,0.00020515354,0.00043092648,0.00022304604,0.0007698892,0.00023181015,0.00039136925,0.00089254626],"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.00040907497,0.00017790866,0.00068367366,0.0003001738,0.00007045035,0.0005327794,0.00017657585,0.015378515,0.5087248,0.040777516,0.00535321,0.42741534],"study_design_scores_gemma":[0.00030655388,0.002819426,0.0014829965,0.00008194116,0.00012944188,0.0030311607,0.00013998005,0.37147462,0.5256562,0.016789475,0.07797111,0.00011705926],"about_ca_topic_score_codex":0.0005244334,"about_ca_topic_score_gemma":0.0015202289,"teacher_disagreement_score":0.0036721672,"about_ca_system_score_codex":0.00038708662,"about_ca_system_score_gemma":0.00052526407,"threshold_uncertainty_score":0.012284577},"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":"W2078353038","doi":"10.1090/s0025-5718-01-01352-7","title":"Smooth ideals in hyperelliptic function fields","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Mathematical proof; Hyperelliptic curve cryptography; Hyperelliptic curve; Logarithm; Genus; Finite field; Discrete logarithm; Function (biology); Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis; Computer science; Geometry","score_opus":0.019933701301037207,"score_gpt":0.2488137992355454,"score_spread":0.2288800979345082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078353038","genre_codex":"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.62223625,0.0012298647,0.34343144,0.0029717048,0.00011712736,0.00030016733,0.00034966873,0.0019322117,0.027431458],"genre_scores_gemma":[0.9156591,0.00075766613,0.07438552,0.00013331822,0.00020176654,0.0000940719,0.0006023085,0.00014641149,0.008019809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930096,0.00016033619,0.000028933475,0.000111774294,0.00025076172,0.00014718526],"domain_scores_gemma":[0.9978078,0.001268039,0.00017995805,0.00030665015,0.00018656456,0.00025101105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243776,0.00048873265,0.00082305504,0.0015604144,0.001323122,0.0024728077,0.0009975187,0.00055322004,0.0049317125],"category_scores_gemma":[0.005132789,0.0004847398,0.000749714,0.0010720622,0.0030190614,0.0051070717,0.0029999884,0.0018100645,0.001097308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048152942,0.00018598478,0.003443842,0.0004372287,0.00003081287,0.0003927021,0.0011975893,0.025872646,0.008456051,0.8743017,0.00513648,0.08006349],"study_design_scores_gemma":[0.000097325275,0.000084805346,0.0008533224,0.000035148478,0.000023057222,0.00021680727,0.0003342149,0.10892124,0.0123951165,0.8703532,0.0066558835,0.000029841878],"about_ca_topic_score_codex":0.000898899,"about_ca_topic_score_gemma":0.0012029043,"teacher_disagreement_score":0.0049317125,"about_ca_system_score_codex":0.001577079,"about_ca_system_score_gemma":0.0007194644,"threshold_uncertainty_score":0.016498268},"labels":[],"label_agreement":null},{"id":"W2078476935","doi":"10.1007/s00200-014-0219-2","title":"VSH and multiplicative modular relations between small primes with polynomial exponents","year":2014,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicative function; Mathematics; Combinatorics; Polynomial; Prime (order theory); Order (exchange); Multiplicative number theory; Discrete mathematics; Hash function; Prime factor; Computer science","score_opus":0.007021612000770943,"score_gpt":0.19120881623314898,"score_spread":0.18418720423237803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078476935","genre_codex":"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.43198502,0.0031103406,0.3583911,0.0061780224,0.0017943706,0.00015161639,0.00045444898,0.00076499593,0.1971701],"genre_scores_gemma":[0.94909143,0.000602127,0.019968912,0.0006649599,0.0013743892,0.000074374344,0.00013005614,0.00014410571,0.027949654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984794,0.0004833073,0.00008566793,0.00029496825,0.00039891337,0.00025769556],"domain_scores_gemma":[0.9975942,0.0011639382,0.000328755,0.00043532345,0.00021986233,0.0002579205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016527788,0.00081380963,0.001007894,0.0020428756,0.0019514896,0.0029965448,0.0011826588,0.0009197219,0.0100394655],"category_scores_gemma":[0.005270293,0.0005323254,0.0009613764,0.0016609756,0.004828115,0.008263516,0.0033403598,0.0033878153,0.0015526977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017792072,0.000006558941,0.000035198147,0.000011336606,0.000002377896,0.00001996717,0.00008221536,0.00015151469,0.00028358796,0.9970305,0.00034158435,0.002017358],"study_design_scores_gemma":[0.000009010389,0.0000130172975,0.00005614933,0.0000058004034,0.0000039865404,0.000058469537,0.000029490837,0.0009963795,0.0004083054,0.9966581,0.0017541196,0.0000071599134],"about_ca_topic_score_codex":0.0002471068,"about_ca_topic_score_gemma":0.00022963125,"teacher_disagreement_score":0.0100394655,"about_ca_system_score_codex":0.0011158622,"about_ca_system_score_gemma":0.00069940946,"threshold_uncertainty_score":0.03358543},"labels":[],"label_agreement":null},{"id":"W2078609456","doi":"10.1007/s00373-007-0731-2","title":"Extremal Ternary Self-Dual Codes Constructed from Negacirculant Matrices","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"University of Lethbridge","keywords":"Ternary operation; Dual (grammatical number); Mathematics; Combinatorics; Construct (python library); Discrete mathematics; Computer science","score_opus":0.0070924533394057885,"score_gpt":0.20372241116566261,"score_spread":0.19662995782625683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078609456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.788127,0.00055755256,0.13557652,0.0012303219,0.00034103575,0.00009132053,0.00047893642,0.0005546027,0.07304265],"genre_scores_gemma":[0.96706825,0.00020539596,0.022319572,0.00027154057,0.000126238,0.00006579679,0.00023803227,0.00011904592,0.009586121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00019563832,0.000042932654,0.000108294684,0.00023415711,0.0001664975],"domain_scores_gemma":[0.9980015,0.00091875286,0.0002808547,0.00030460395,0.0002532696,0.00024098565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181331,0.0005781193,0.00070492737,0.0023729028,0.0016775747,0.002633264,0.00083246845,0.0016149845,0.0050849314],"category_scores_gemma":[0.0037418674,0.0004954982,0.00048325074,0.0011290164,0.0017524995,0.0018066431,0.0018394995,0.0017780504,0.0007987755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019853136,0.000043611133,0.00048088687,0.00005245068,0.000009649729,0.00021008363,0.00017169696,0.003606547,0.006600241,0.9791606,0.0013977794,0.008067857],"study_design_scores_gemma":[0.000066870096,0.000050870483,0.000570769,0.000059677073,0.000026417372,0.0007628685,0.00015305958,0.04683028,0.0123052355,0.9355597,0.0035591696,0.00005518238],"about_ca_topic_score_codex":0.00037231686,"about_ca_topic_score_gemma":0.00072012155,"teacher_disagreement_score":0.0050849314,"about_ca_system_score_codex":0.00097619917,"about_ca_system_score_gemma":0.0007390495,"threshold_uncertainty_score":0.017010808},"labels":[],"label_agreement":null},{"id":"W2078667442","doi":"10.1109/isit.2014.6875148","title":"On the proof of Lin's conjecture","year":2014,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Chinese Academy of Sciences; Beijing Center for Mathematics and Information Interdisciplinary Sciences; National Natural Science Foundation of China","keywords":"Conjecture; Monomial; TRACE (psycholinguistics); Hadamard transform; Mathematics; Ternary operation; Combinatorics; Discrete mathematics; Product (mathematics); Simple (philosophy); Computer science","score_opus":0.008055384397416153,"score_gpt":0.1992979623490291,"score_spread":0.19124257795161295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078667442","genre_codex":"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.258325,0.004268829,0.27559304,0.040697664,0.0034241844,0.00014334652,0.000808284,0.0013626193,0.415377],"genre_scores_gemma":[0.9337384,0.0012579827,0.035371125,0.0041589136,0.0013737365,0.00012317483,0.0003533263,0.0001291706,0.023494031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988079,0.00030862007,0.00004063117,0.00021520222,0.0003904997,0.00023712803],"domain_scores_gemma":[0.996879,0.0018963532,0.00017816391,0.00032488772,0.00053041446,0.00019131668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017280147,0.0005674301,0.0006532441,0.0013452978,0.0019357012,0.0016479754,0.0008765407,0.0012610129,0.008963935],"category_scores_gemma":[0.008573278,0.00032591616,0.0006722631,0.0013387557,0.0031977226,0.0041469424,0.0030496002,0.003177355,0.0014055349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006281452,0.000027876062,0.00036485077,0.000041242572,0.000006877886,0.0001405437,0.00027706398,0.0010997091,0.00078180834,0.9808671,0.0077072987,0.008622751],"study_design_scores_gemma":[0.000022738333,0.000025950561,0.0002027328,0.000035993588,0.0000054860457,0.00012029334,0.00006536064,0.007775675,0.0012573064,0.97668636,0.013784975,0.000017045775],"about_ca_topic_score_codex":0.0013162625,"about_ca_topic_score_gemma":0.0010761049,"teacher_disagreement_score":0.008963935,"about_ca_system_score_codex":0.002006686,"about_ca_system_score_gemma":0.0012775061,"threshold_uncertainty_score":0.029987395},"labels":[],"label_agreement":null},{"id":"W2078894142","doi":"10.2168/lmcs-9(3:7)2013","title":"Universal codes of the natural numbers","year":2013,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Natural number; Set (abstract data type); Code (set theory); Sequence (biology); Construct (python library); Binary code; Code word; Linear code","score_opus":0.029789167219217805,"score_gpt":0.32768735026735263,"score_spread":0.2978981830481348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078894142","genre_codex":"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.48130146,0.0015446905,0.44989088,0.0015307859,0.000271534,0.000092409195,0.00057785667,0.0005912308,0.06419907],"genre_scores_gemma":[0.8981006,0.0004335719,0.09121215,0.00035320653,0.00017441856,0.00012684007,0.00025772327,0.000091673144,0.009249789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985637,0.00024269086,0.000068490146,0.00033706948,0.00056778407,0.00022033408],"domain_scores_gemma":[0.99754447,0.00086961116,0.00028629266,0.00047854413,0.0005691487,0.00025182657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087214,0.00021961099,0.00040791207,0.000935237,0.000910688,0.0013156333,0.00043464958,0.00041608693,0.001933569],"category_scores_gemma":[0.004584214,0.00019519392,0.000450695,0.00062865816,0.0031787253,0.0024208343,0.0016992149,0.001529243,0.00023935686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030798892,0.0000075150206,0.00026352017,0.000025205425,0.000003902685,0.000029390667,0.00017805297,0.0021565997,0.0028596406,0.9857706,0.00053961313,0.008135155],"study_design_scores_gemma":[0.000015471544,0.000044255143,0.0006501785,0.000028945915,0.000007819226,0.00010897978,0.00009800929,0.015689392,0.0039270287,0.96971726,0.009683531,0.000029011304],"about_ca_topic_score_codex":0.0015765723,"about_ca_topic_score_gemma":0.0015522814,"teacher_disagreement_score":0.001933569,"about_ca_system_score_codex":0.0012032303,"about_ca_system_score_gemma":0.00094995083,"threshold_uncertainty_score":0.008730054},"labels":[],"label_agreement":null},{"id":"W2080481349","doi":"10.1145/1015047.1015054","title":"Towards fault-tolerant cryptographic computations over finite fields","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Finite field; Cryptosystem; Cryptography; Multiplier (economics); Fault tolerance; Computation; Theoretical computer science; Realization (probability); Computer engineering; Algorithm; Distributed computing; Mathematics; Discrete mathematics","score_opus":0.018730309335290966,"score_gpt":0.26137289428814875,"score_spread":0.2426425849528578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080481349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.049769253,0.0013435973,0.9408568,0.0013531336,0.00019225423,0.000060827897,0.000029346975,0.0003611537,0.0060335305],"genre_scores_gemma":[0.49313858,0.0047291666,0.49485496,0.000652845,0.00050775154,0.0001323111,0.0001336883,0.0000846867,0.0057660923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991122,0.00022473332,0.000057439764,0.00010379505,0.0004229268,0.00007891237],"domain_scores_gemma":[0.99782443,0.0009611823,0.00029751795,0.00045459578,0.00037887317,0.00008350151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013247619,0.00086723495,0.0005409925,0.0012187719,0.00058881217,0.0016362758,0.0013264896,0.0015349692,0.0013480387],"category_scores_gemma":[0.0039324006,0.0004317136,0.0005231071,0.0010113611,0.0018386303,0.003322194,0.0014720648,0.0026357898,0.00074552547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002819362,0.00015303044,0.0007349497,0.000534131,0.000038140595,0.00053744944,0.00050919794,0.096511,0.043722074,0.7397001,0.0026465168,0.11463153],"study_design_scores_gemma":[0.00006594637,0.0002481732,0.00013833363,0.00009945903,0.000032572243,0.0006808852,0.00016674325,0.3810479,0.030461172,0.57033753,0.016682405,0.00003887635],"about_ca_topic_score_codex":0.00028325102,"about_ca_topic_score_gemma":0.0002856233,"teacher_disagreement_score":0.0016362758,"about_ca_system_score_codex":0.0006730128,"about_ca_system_score_gemma":0.00080928806,"threshold_uncertainty_score":0.007006049},"labels":[],"label_agreement":null},{"id":"W2080805739","doi":"10.1109/icccas.2006.285197","title":"Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Finite field; Computer science; Arithmetic; Bit (key); Computational complexity theory; Polynomial basis; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics","score_opus":0.027785353112241177,"score_gpt":0.24597585686653964,"score_spread":0.21819050375429846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080805739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.12077393,0.0019985447,0.8544839,0.0006242853,0.0002511302,0.0002261801,0.00020580443,0.000769342,0.020666907],"genre_scores_gemma":[0.60882616,0.00251378,0.37348172,0.00028633635,0.00041954225,0.00032195347,0.0004791654,0.00012988437,0.013541415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997615,0.000043713506,0.000014564617,0.000044414006,0.00009937318,0.000036391568],"domain_scores_gemma":[0.99959165,0.00018267329,0.00006283061,0.000082063474,0.00005821542,0.00002250116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033430028,0.00056521833,0.0004724721,0.00069273147,0.00064589456,0.0006115329,0.00052452635,0.00037478114,0.0037033346],"category_scores_gemma":[0.0008772083,0.00020806871,0.0005084104,0.00066933833,0.0004626296,0.0014790412,0.00053854357,0.0010439905,0.00070261885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011494905,0.00023692995,0.0013678607,0.0011387843,0.00012794902,0.00064759,0.00021773422,0.03946442,0.18296534,0.44121543,0.007276437,0.32419214],"study_design_scores_gemma":[0.00064662163,0.0011785922,0.001598488,0.0001788181,0.00023811407,0.0035393543,0.00008483362,0.37235555,0.18849124,0.35724354,0.07428004,0.00016489762],"about_ca_topic_score_codex":0.000167833,"about_ca_topic_score_gemma":0.0002908236,"teacher_disagreement_score":0.0037033346,"about_ca_system_score_codex":0.0004342712,"about_ca_system_score_gemma":0.0005857534,"threshold_uncertainty_score":0.012388885},"labels":[],"label_agreement":null},{"id":"W2081149247","doi":"10.1016/s0893-9659(03)00073-9","title":"The post correspondence problem over a unary alphabet","year":2003,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Unary operation; Mathematics; Alphabet; Logarithm; Combinatorics; Representation (politics); Discrete mathematics; Mathematical analysis","score_opus":0.006986649179844907,"score_gpt":0.2045186240475634,"score_spread":0.1975319748677185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081149247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.31888133,0.0026811548,0.4129772,0.038257875,0.001846313,0.00019715154,0.0019143878,0.0011734313,0.2220713],"genre_scores_gemma":[0.8734144,0.0019478444,0.05788012,0.0021970167,0.002306259,0.0002272178,0.0014984439,0.00070250005,0.059826165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976636,0.0008230292,0.00016540555,0.0005335081,0.0004033553,0.0004109532],"domain_scores_gemma":[0.98953503,0.007590038,0.0005671189,0.0014775154,0.00045704644,0.0003731909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025970112,0.0006957531,0.0020972816,0.00089049316,0.0033543396,0.0074670543,0.0020549167,0.00429889,0.017747376],"category_scores_gemma":[0.009449304,0.0008914529,0.001254294,0.002281139,0.0036158604,0.018730622,0.00325972,0.006079383,0.0028776543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019588057,0.00007214233,0.0001722027,0.000104941544,0.000010349222,0.0001366498,0.0001522248,0.0029000973,0.00038827024,0.97682524,0.006582728,0.012459301],"study_design_scores_gemma":[0.000027915316,0.0000144621235,0.00004135693,0.000011763019,0.0000067712253,0.000074022166,0.00006134302,0.0057468074,0.00064660184,0.99096,0.002399999,0.000008914998],"about_ca_topic_score_codex":0.00057650515,"about_ca_topic_score_gemma":0.00042917597,"teacher_disagreement_score":0.017747376,"about_ca_system_score_codex":0.0017119836,"about_ca_system_score_gemma":0.0025718524,"threshold_uncertainty_score":0.059370875},"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":"W2081993715","doi":"10.1016/j.disc.2006.01.005","title":"Generating indecomposable permutations","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Indecomposable module; Mathematics; Combinatorics; Permutation (music); Transposition (logic); Parity of a permutation; Discrete mathematics; Cyclic permutation; Symmetric group; Geometry","score_opus":0.011048546643465667,"score_gpt":0.23843785035046883,"score_spread":0.22738930370700317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081993715","genre_codex":"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.4673188,0.0007670841,0.310994,0.0029230607,0.0010810678,0.00026776138,0.0005135008,0.00089562585,0.21523908],"genre_scores_gemma":[0.8754671,0.0006659541,0.04027896,0.00057906203,0.0005544801,0.00022860855,0.0006386468,0.0004573311,0.08112978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987814,0.00036650978,0.00005575854,0.0001695748,0.000396927,0.00022979734],"domain_scores_gemma":[0.9974936,0.0013501196,0.00022036114,0.0005536393,0.00017209681,0.00021028111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010527977,0.0012815057,0.0008848816,0.0016229508,0.0018347453,0.0031902927,0.0015155965,0.0018013127,0.012377802],"category_scores_gemma":[0.0036634542,0.0007075962,0.0011144844,0.0017417023,0.001928262,0.0043501984,0.0031580941,0.0032615827,0.0031584364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055905195,0.00007182663,0.00019319628,0.00003368781,0.000006475361,0.00017948978,0.00019099993,0.0013246048,0.0020898485,0.9831902,0.0012088733,0.01145491],"study_design_scores_gemma":[0.000020563966,0.00002227553,0.0000710344,0.000011557363,0.000007395216,0.0001968391,0.000035937635,0.0048026373,0.0025528697,0.98963344,0.002633903,0.000011519488],"about_ca_topic_score_codex":0.00010396857,"about_ca_topic_score_gemma":0.00018383103,"teacher_disagreement_score":0.012377802,"about_ca_system_score_codex":0.00085426174,"about_ca_system_score_gemma":0.0007717667,"threshold_uncertainty_score":0.041407883},"labels":[],"label_agreement":null},{"id":"W2082176354","doi":"10.1016/j.ffa.2005.10.005","title":"On the distribution of irreducible trinomials over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi mathvariant=\"double-struck\">F</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Mathematics; Scroll; Distribution (mathematics); Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.018506604844418028,"score_gpt":0.23416834247077928,"score_spread":0.21566173762636126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082176354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.57376856,0.002700186,0.35599273,0.007150917,0.00044313568,0.00018497359,0.002985012,0.001191378,0.055582967],"genre_scores_gemma":[0.9637389,0.0024261407,0.013893716,0.00044041176,0.00096892624,0.00035778974,0.0021507426,0.00046119204,0.015562071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962752,0.0017099646,0.00013364168,0.0005178052,0.00067754835,0.0006859085],"domain_scores_gemma":[0.9425206,0.044575747,0.0033163133,0.003877263,0.0032363816,0.0024736866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010161189,0.0011423804,0.001805713,0.0054644835,0.0019302717,0.004644925,0.0025739144,0.0015550642,0.016182262],"category_scores_gemma":[0.04936036,0.0011077136,0.00092495343,0.0033642615,0.0073523833,0.009444597,0.0033644438,0.00465839,0.0027478822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036024855,0.000073031646,0.003140694,0.00013649378,0.000028147912,0.00016407644,0.00046503337,0.012141561,0.0008412014,0.96293277,0.006788763,0.012928149],"study_design_scores_gemma":[0.000106958985,0.00009192547,0.0032445756,0.00028535537,0.000028523606,0.00031977554,0.0002736667,0.11514597,0.0013129051,0.8763113,0.0027613011,0.00011774087],"about_ca_topic_score_codex":0.002510133,"about_ca_topic_score_gemma":0.001965288,"teacher_disagreement_score":0.016182262,"about_ca_system_score_codex":0.003400865,"about_ca_system_score_gemma":0.0020983028,"threshold_uncertainty_score":0.054135084},"labels":[],"label_agreement":null},{"id":"W2083140175","doi":"10.1007/s00026-005-0248-4","title":"Collinear Points in Permutations","year":2005,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Transversal (combinatorics); Prime (order theory); Upper and lower bounds; Intersection (aeronautics); Discrete geometry; Discrete mathematics","score_opus":0.03988005282922381,"score_gpt":0.3060809598074195,"score_spread":0.2662009069781957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083140175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.41804692,0.0036901266,0.23181942,0.006896686,0.0018032655,0.00017575538,0.00066433434,0.00066574995,0.33623776],"genre_scores_gemma":[0.89908135,0.0021836697,0.026422046,0.00073293544,0.0013523826,0.00018052974,0.0003880112,0.00028192173,0.06937722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853003,0.00043429868,0.00008129285,0.00022979363,0.0004544428,0.0002701265],"domain_scores_gemma":[0.99734795,0.0013083579,0.0003969834,0.00041466215,0.00029143784,0.00024063201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884038,0.0009908534,0.0014468589,0.003534603,0.0036695735,0.005628092,0.0010319493,0.002082277,0.011668156],"category_scores_gemma":[0.0050465846,0.00089736027,0.0010649688,0.005580727,0.0047348225,0.0062401295,0.0046550217,0.0050195064,0.0029073486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025734396,0.0000079521815,0.00009038376,0.000015272564,0.0000032768107,0.000054844157,0.00014060992,0.00035814932,0.00017965958,0.9940509,0.00096412696,0.0041090515],"study_design_scores_gemma":[0.000007655842,0.0000070855476,0.00003998979,0.000008482418,0.0000040002433,0.00006825887,0.00004634205,0.00085026823,0.00017800745,0.9958127,0.0029717041,0.0000054639263],"about_ca_topic_score_codex":0.00064813445,"about_ca_topic_score_gemma":0.0006380663,"teacher_disagreement_score":0.011668156,"about_ca_system_score_codex":0.0015252343,"about_ca_system_score_gemma":0.0008496435,"threshold_uncertainty_score":0.03903383},"labels":[],"label_agreement":null},{"id":"W2083423194","doi":"10.1016/j.jnt.2005.12.005","title":"Diophantine m-tuples for linear polynomials II. Equal degrees","year":2006,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Mathematics; Diophantine equation; Tuple; Diophantine set; Pure mathematics; Algebra over a field; Discrete mathematics; Combinatorics","score_opus":0.01407572093753825,"score_gpt":0.26076576612163654,"score_spread":0.2466900451840983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083423194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.19429633,0.015505206,0.41935626,0.0074130762,0.0021232478,0.00022611978,0.0013211797,0.00046492484,0.3592937],"genre_scores_gemma":[0.91231227,0.0039567836,0.034682315,0.0012538449,0.0012456046,0.00019278922,0.00046931783,0.00016676768,0.045720395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867034,0.0002845831,0.000091742804,0.00026499614,0.00037325142,0.00031511986],"domain_scores_gemma":[0.99814117,0.00099665,0.00022715924,0.00028497208,0.00016085361,0.00018919182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017447477,0.0011289949,0.0012682859,0.0021288889,0.0024202564,0.005111423,0.0013480606,0.0011397842,0.008841795],"category_scores_gemma":[0.0049239965,0.0007226652,0.0010428628,0.0026026394,0.0037828025,0.0054602763,0.003132643,0.0051813447,0.00294404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006862568,0.000015786209,0.000103507315,0.000056017914,0.0000044143894,0.00004090369,0.00018730942,0.00057368336,0.00043582238,0.98819494,0.0014536483,0.008865394],"study_design_scores_gemma":[0.000016054379,0.000017356106,0.00013518787,0.000026477703,0.000009817907,0.00011946193,0.00004860942,0.0018566551,0.0005388298,0.99263716,0.004580416,0.0000138513315],"about_ca_topic_score_codex":0.0006472878,"about_ca_topic_score_gemma":0.000589463,"teacher_disagreement_score":0.008841795,"about_ca_system_score_codex":0.0026830353,"about_ca_system_score_gemma":0.0008959494,"threshold_uncertainty_score":0.029578686},"labels":[],"label_agreement":null},{"id":"W2085192447","doi":"10.1515/form.2011.051","title":"Almost prime values of the order of elliptic curves over finite fields","year":2010,"lang":"en","type":"article","venue":"Forum Mathematicum","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Order (exchange); Mathematics; Combinatorics; Prime (order theory); Conjecture","score_opus":0.00694300099726095,"score_gpt":0.22648826274479472,"score_spread":0.21954526174753378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085192447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.81212384,0.001533775,0.035071515,0.0034722195,0.0004708307,0.000054199438,0.00050964556,0.0005222123,0.14624183],"genre_scores_gemma":[0.9786107,0.0004204009,0.004116489,0.00018325112,0.0003574979,0.000023413922,0.00022794098,0.00008632683,0.015974106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905545,0.0001917512,0.00003853964,0.00014849298,0.0003255039,0.00024021373],"domain_scores_gemma":[0.99761105,0.00087519374,0.0003071463,0.00038068744,0.00031820172,0.0005076099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010409767,0.0006644059,0.000713471,0.0015907548,0.001336056,0.0033802073,0.00048107273,0.00067336956,0.010473894],"category_scores_gemma":[0.0041466337,0.00038424518,0.0005708285,0.00074611005,0.0026873336,0.0034372758,0.0017028109,0.00194711,0.0020273216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006423925,0.00009843312,0.0016991985,0.0001033944,0.000021769796,0.00048445398,0.0003599022,0.0033740285,0.0036238248,0.96946275,0.0042350623,0.015894683],"study_design_scores_gemma":[0.000079247846,0.00010813524,0.0014485813,0.000055730816,0.00002271041,0.00046460357,0.00016411392,0.006677374,0.0038621027,0.9772151,0.009864792,0.00003756023],"about_ca_topic_score_codex":0.00057711045,"about_ca_topic_score_gemma":0.00057715306,"teacher_disagreement_score":0.010473894,"about_ca_system_score_codex":0.0018564457,"about_ca_system_score_gemma":0.0007440112,"threshold_uncertainty_score":0.03503871},"labels":[],"label_agreement":null},{"id":"W2085842155","doi":"10.46298/dmtcs.396","title":"Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Czech; Library science; Mathematics; Humanities; Art; Computer science; Philosophy; Linguistics","score_opus":0.009133353797061221,"score_gpt":0.2545103635625403,"score_spread":0.24537700976547908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085842155","genre_codex":"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.0006230874,0.021942837,0.0027761061,0.062904105,0.7532823,0.00022308073,0.0018628531,0.0009167448,0.15546893],"genre_scores_gemma":[0.0030813743,0.011178747,0.0011219432,0.014282575,0.24199402,0.00016303385,0.0024181937,0.0012059169,0.72455424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845636,0.00020615009,0.00009578508,0.00032368372,0.00073616486,0.0001818713],"domain_scores_gemma":[0.9943768,0.0012244539,0.0004040355,0.0003204351,0.0023132176,0.0013611681],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014927783,0.0016666229,0.0018588675,0.0028050186,0.0026459328,0.007987236,0.0014984217,0.0031928108,0.34897825],"category_scores_gemma":[0.0053091445,0.00063198234,0.0014142906,0.002011012,0.0011681714,0.004336389,0.0022137845,0.004854141,0.23987791],"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.000014186567,0.0000065094887,0.000021076688,0.000057295,0.0000025583,0.000013213589,0.00001376711,0.000012828785,0.00012638791,0.0006914235,0.992388,0.0066528786],"study_design_scores_gemma":[0.0000051109087,0.000013310934,0.00022965994,0.00007346459,0.0000033381816,0.000032436095,0.000029301002,0.00003547251,0.00007383903,0.0007064131,0.99879175,0.0000059412328],"about_ca_topic_score_codex":0.0016864672,"about_ca_topic_score_gemma":0.0025206928,"teacher_disagreement_score":0.34897825,"about_ca_system_score_codex":0.0030637109,"about_ca_system_score_gemma":0.0020920448,"threshold_uncertainty_score":0.92860353},"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":"W2086525836","doi":"10.4153/cmb-2004-057-4","title":"A Generalization of the Erdös-Kac Theorem and its Applications","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Generalization; Function field; Order (exchange); Context (archaeology); Finite field; Field (mathematics); Pure mathematics; Function (biology); Algebra over a field; Discrete mathematics; Mathematical analysis","score_opus":0.007531701196936816,"score_gpt":0.19411902001791623,"score_spread":0.1865873188209794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086525836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.0946076,0.010837575,0.6082789,0.011787092,0.0033587923,0.00014914994,0.0010438149,0.00074044813,0.26919666],"genre_scores_gemma":[0.84136814,0.012350431,0.10916818,0.0033345097,0.0044388804,0.00019920108,0.00047161937,0.00021595252,0.028452942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785256,0.0004782758,0.00017751326,0.00059825083,0.00066373526,0.00022964935],"domain_scores_gemma":[0.99647224,0.0011412677,0.0003952483,0.00078613136,0.00095423096,0.00025097167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039581438,0.0007806888,0.0016512517,0.0036277298,0.0022359756,0.0031984763,0.0017795094,0.0020493397,0.005466549],"category_scores_gemma":[0.0066374396,0.00043412801,0.0013033523,0.0032734522,0.0073596016,0.008716936,0.004559073,0.00500792,0.00135133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064942396,0.000005919222,0.0000852292,0.00002448555,0.000003886792,0.000047814676,0.000049498263,0.00071689603,0.00016263199,0.9936511,0.0011484023,0.004097601],"study_design_scores_gemma":[0.000007040436,0.000009883401,0.0001370075,0.000019328352,0.0000055271234,0.00016722869,0.000038108832,0.0028468557,0.00023049866,0.98417884,0.012344648,0.000015199076],"about_ca_topic_score_codex":0.0019422623,"about_ca_topic_score_gemma":0.00084368716,"teacher_disagreement_score":0.005466549,"about_ca_system_score_codex":0.0025254283,"about_ca_system_score_gemma":0.0013101401,"threshold_uncertainty_score":0.020932972},"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":"W2087377210","doi":"10.1007/s00145-001-0018-3","title":"New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups","year":2002,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"ElGamal encryption; Discrete logarithm; Cryptosystem; Signature (topology); Key (lock); ElGamal signature scheme; Mathematics; Public-key cryptography; Permutation (music); Hybrid cryptosystem; Theoretical computer science; Computer science; Cryptography; Discrete mathematics; Blind signature; Algorithm; Encryption; Computer security","score_opus":0.1943988686853836,"score_gpt":0.24220270297843846,"score_spread":0.04780383429305485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087377210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.012342716,0.0004335371,0.98211503,0.00051908457,0.00009197449,0.00007771672,0.000017748212,0.00043771704,0.003964404],"genre_scores_gemma":[0.22475523,0.0010174415,0.7665882,0.0004024907,0.00022450372,0.00031365565,0.00006803781,0.00029568165,0.006334623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974929,0.0007436127,0.00019866989,0.00035442822,0.000977342,0.00023299121],"domain_scores_gemma":[0.9949705,0.0024956854,0.00027209887,0.0016854923,0.0004327336,0.00014353338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034377445,0.0012936402,0.0011995038,0.001934309,0.0018627191,0.0035338441,0.0026554249,0.0020346234,0.0037014103],"category_scores_gemma":[0.006253029,0.001418343,0.0018962836,0.0013468985,0.0060405266,0.0156843,0.0036294316,0.0050314018,0.001251032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016399095,0.00012852171,0.00026159684,0.00031864172,0.00005452825,0.00008976455,0.00057823217,0.015357176,0.009886484,0.9112817,0.0013328829,0.060546506],"study_design_scores_gemma":[0.00011138256,0.00014300247,0.00005377275,0.00007805124,0.000092848626,0.00024560862,0.00012628653,0.1079869,0.01757189,0.8602276,0.013296224,0.00006646765],"about_ca_topic_score_codex":0.0002117783,"about_ca_topic_score_gemma":0.00052276615,"teacher_disagreement_score":0.0037014103,"about_ca_system_score_codex":0.0014286607,"about_ca_system_score_gemma":0.0009385778,"threshold_uncertainty_score":0.018180728},"labels":[],"label_agreement":null},{"id":"W2087541534","doi":"10.1109/tit.2009.2013041","title":"Quaternary Constant-Amplitude Codes for Multicode CDMA","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code (set theory); Constant (computer programming); Binary number; Computer science; Algorithm; Discrete mathematics; Mathematics; Programming language; Arithmetic","score_opus":0.013698900849824938,"score_gpt":0.24874483659826382,"score_spread":0.23504593574843888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087541534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.029018622,0.0053964774,0.92269474,0.001071073,0.001638626,0.00016671773,0.00032786757,0.0007630317,0.038922805],"genre_scores_gemma":[0.5073515,0.0062476336,0.4439849,0.001285764,0.0015504698,0.00039211902,0.00096781435,0.0002774009,0.037942424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925727,0.00018914831,0.00004466474,0.00011193667,0.0003234707,0.0000735557],"domain_scores_gemma":[0.9988979,0.00029234568,0.0001295854,0.00020565107,0.00041766308,0.00005689463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678508,0.00042870367,0.00026990083,0.00076274545,0.00074831746,0.0012572088,0.00050155446,0.0009309896,0.0042830436],"category_scores_gemma":[0.0028477965,0.00018262936,0.00029634082,0.0014315596,0.0008086074,0.0009325373,0.00076679647,0.0010925615,0.0018190814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030785624,0.00008597023,0.0006077079,0.0003343539,0.000019592184,0.0003387903,0.00038186568,0.038439274,0.039596535,0.6526041,0.016538661,0.25074533],"study_design_scores_gemma":[0.00009121106,0.00052852865,0.0010234569,0.00034627196,0.00005439822,0.0015395597,0.00013470984,0.42540124,0.057742722,0.23400761,0.27896014,0.00017009069],"about_ca_topic_score_codex":0.001593127,"about_ca_topic_score_gemma":0.0019616932,"teacher_disagreement_score":0.0042830436,"about_ca_system_score_codex":0.0009287547,"about_ca_system_score_gemma":0.0010704166,"threshold_uncertainty_score":0.014328182},"labels":[],"label_agreement":null},{"id":"W2088257228","doi":"10.1587/transfun.e95.a.909","title":"On the Codeword Length Distribution of T-Codes","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Code word; Mathematics; Code (set theory); Equivalence (formal languages); Limit (mathematics); Discrete mathematics; Combinatorics; Distribution (mathematics); Algorithm; Computer science; Decoding methods; Mathematical analysis","score_opus":0.02969416751035482,"score_gpt":0.27120473244634813,"score_spread":0.24151056493599332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088257228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4594589,0.002627831,0.5256147,0.00065946055,0.00008920301,0.00006207468,0.00046364206,0.00029776475,0.01072644],"genre_scores_gemma":[0.95080817,0.0024347,0.04165676,0.00016372152,0.00023189612,0.00015244857,0.0006453792,0.00021670017,0.0036901424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853384,0.00033682422,0.00008253745,0.00034152175,0.0005061645,0.00019919459],"domain_scores_gemma":[0.98540187,0.009834593,0.0013436328,0.0010619947,0.0019666408,0.0003912942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018396054,0.0005186924,0.00068452815,0.0023799886,0.0006785923,0.0014633748,0.0013168713,0.0007874528,0.001899464],"category_scores_gemma":[0.01899472,0.00039895266,0.0004183442,0.0019389625,0.0018982774,0.0031848336,0.001255534,0.001396923,0.00046281086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038508838,0.000077435776,0.0072084563,0.00031762506,0.00007019832,0.00040218674,0.00076538295,0.15383849,0.032118514,0.7532755,0.0017538479,0.04978721],"study_design_scores_gemma":[0.000030301067,0.0001765696,0.003372406,0.000107036474,0.000027518932,0.0006643793,0.00016852537,0.6232105,0.010680843,0.35791913,0.0035371946,0.00010560088],"about_ca_topic_score_codex":0.00083672634,"about_ca_topic_score_gemma":0.00049370405,"teacher_disagreement_score":0.0023799886,"about_ca_system_score_codex":0.0014241523,"about_ca_system_score_gemma":0.0007676833,"threshold_uncertainty_score":0.010332942},"labels":[],"label_agreement":null},{"id":"W2088513464","doi":"10.1109/iscc.2013.6754985","title":"Cryptanalysis of the Toorani-Falahati Hill Ciphers","year":2013,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ciphertext; Computer science; Cryptanalysis; Plaintext; Transposition cipher; Cipher; Stream cipher; Block cipher; Theoretical computer science; Computer security; Cryptography; Encryption; Running key cipher","score_opus":0.003927824373186536,"score_gpt":0.1626031683274933,"score_spread":0.15867534395430677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088513464","genre_codex":"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.476991,0.004044334,0.4072634,0.0032616048,0.00078927836,0.00058996596,0.00048383637,0.00061849126,0.10595806],"genre_scores_gemma":[0.9378457,0.0008864397,0.050413024,0.0003361005,0.00010845066,0.0001518999,0.00014868655,0.000047636786,0.010062031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858236,0.00033086177,0.00007554843,0.00013888541,0.0005842077,0.00028812134],"domain_scores_gemma":[0.99842215,0.00068570656,0.00022808337,0.00040057374,0.00018473009,0.00007881027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013095028,0.0003825134,0.0006410766,0.00086905685,0.00094822916,0.0011695442,0.0008928053,0.0008796192,0.0022811193],"category_scores_gemma":[0.0041723857,0.0002866247,0.00077644986,0.0007775557,0.0016421457,0.0021764175,0.0013834152,0.0014930996,0.00054726953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045129677,0.00007583671,0.0017348488,0.00012765918,0.0000764041,0.0007646927,0.00059684337,0.0283191,0.018951818,0.89742494,0.004807948,0.046668645],"study_design_scores_gemma":[0.0002957285,0.00054528797,0.0048500346,0.00019808977,0.000099252,0.0030175715,0.0002869592,0.3474484,0.07195102,0.51634616,0.054762755,0.00019862303],"about_ca_topic_score_codex":0.0011194694,"about_ca_topic_score_gemma":0.0009998374,"teacher_disagreement_score":0.0022811193,"about_ca_system_score_codex":0.0013248577,"about_ca_system_score_gemma":0.0011698629,"threshold_uncertainty_score":0.00961262},"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":"W2089281124","doi":"10.1016/j.aeue.2011.03.017","title":"Two-dimensional multiplicative arrays over Zq−1 and girth-6 q-ary QC-LDPC codes based on quadratic-residues modulo p&lt;q","year":2011,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Modulo; Quadratic residue; Low-density parity-check code; Multiplicative function; Mathematics; Combinatorics; Primitive root modulo n; Quadratic equation; Discrete mathematics; Prime (order theory); Algorithm; Decoding methods","score_opus":0.023259450018773224,"score_gpt":0.2767721636522026,"score_spread":0.25351271363342937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089281124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5632923,0.0015811033,0.37154642,0.0022373686,0.00031757157,0.00018455695,0.00063591223,0.0009959644,0.0592088],"genre_scores_gemma":[0.95375955,0.0004587765,0.03690082,0.00020742968,0.000089196015,0.000083598585,0.00014886865,0.00006066755,0.008291093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992661,0.00021008418,0.00004207955,0.000100881145,0.00026776092,0.00011315631],"domain_scores_gemma":[0.998536,0.0007028914,0.0002596643,0.00023492698,0.00017781736,0.00008877063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005015169,0.00056746387,0.00051222614,0.0008502569,0.0007655501,0.001830582,0.0006130534,0.0008628306,0.0042530517],"category_scores_gemma":[0.0025048722,0.00032258563,0.00035044344,0.0009574891,0.0013541257,0.0013593548,0.0011384218,0.000905711,0.0008171386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048674823,0.00007769736,0.0009024711,0.0001472304,0.000035404173,0.00038506038,0.00031253416,0.030617561,0.026251677,0.92081743,0.001601371,0.018364767],"study_design_scores_gemma":[0.00023690247,0.00032072165,0.0015749616,0.0001782132,0.000081371414,0.0011813806,0.00020690884,0.39845282,0.0640696,0.5182479,0.015249262,0.0001999923],"about_ca_topic_score_codex":0.001022986,"about_ca_topic_score_gemma":0.0013142575,"teacher_disagreement_score":0.0042530517,"about_ca_system_score_codex":0.0009317674,"about_ca_system_score_gemma":0.0011386718,"threshold_uncertainty_score":0.014227927},"labels":[],"label_agreement":null},{"id":"W2089291152","doi":"10.1007/bf02887093","title":"Notes onq-ary interleaved sequences","year":2000,"lang":"en","type":"article","venue":"Chinese Science Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Polynomial; Component (thermodynamics); Distribution (mathematics); Discrete mathematics; Mathematical analysis; Physics; Biology","score_opus":0.006764618958314849,"score_gpt":0.23517626023926586,"score_spread":0.228411641280951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089291152","genre_codex":"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.0478081,0.017245153,0.6247868,0.0062973313,0.010103207,0.00023285723,0.0011346115,0.00060396094,0.291788],"genre_scores_gemma":[0.5342293,0.029297993,0.16610445,0.003398907,0.010338639,0.00064456294,0.0023720774,0.0007627758,0.25285128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879265,0.00025586967,0.0001129951,0.00015776846,0.00054369704,0.00013707031],"domain_scores_gemma":[0.9978879,0.0011072272,0.00012245396,0.00047192318,0.00030053555,0.000110104935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016584757,0.0023302343,0.0010209029,0.003083802,0.001435263,0.0018917982,0.0014239373,0.0012641979,0.019131362],"category_scores_gemma":[0.0040076715,0.0008182302,0.0008512164,0.006692978,0.0027694849,0.0036518879,0.0025662917,0.0035577286,0.0044795577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013065217,0.000039524588,0.00020051502,0.00017990032,0.000023097136,0.00024672828,0.00021677307,0.0036750466,0.0036338854,0.924761,0.007888862,0.059003934],"study_design_scores_gemma":[0.00003431016,0.00012546498,0.00048644756,0.00010970156,0.000034783727,0.0006222453,0.000051612056,0.015543411,0.004017043,0.92395705,0.05496355,0.000054461023],"about_ca_topic_score_codex":0.0010898764,"about_ca_topic_score_gemma":0.0012559795,"teacher_disagreement_score":0.019131362,"about_ca_system_score_codex":0.0017157887,"about_ca_system_score_gemma":0.0011522066,"threshold_uncertainty_score":0.064000785},"labels":[],"label_agreement":null},{"id":"W2090210240","doi":"10.1109/tcsi.2002.800836","title":"Low complexity parallel multiplier in F(q/sup n/) over F/sub q/","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Multiplier (economics); Mathematics; Multiplication (music); Basis (linear algebra); Polynomial basis; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.03393996360662456,"score_gpt":0.241864641180011,"score_spread":0.20792467757338645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090210240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.14376125,0.002231681,0.81046355,0.00064276176,0.00031703096,0.00016609184,0.00014827347,0.0009795238,0.041289803],"genre_scores_gemma":[0.6229934,0.0020925116,0.34591883,0.00028236245,0.00033465688,0.00020900444,0.00024338253,0.00009504243,0.027830804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983454,0.000032394397,0.000011579884,0.00003223455,0.00005689978,0.000032364358],"domain_scores_gemma":[0.99981016,0.00008764553,0.000025864247,0.00003400216,0.000034499757,0.000007878384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022409201,0.00060156494,0.0003757562,0.00024437328,0.00049482554,0.0006857357,0.00032124447,0.0002899407,0.004951873],"category_scores_gemma":[0.00064316497,0.00013959441,0.00031268498,0.00043049818,0.00037719158,0.0012842397,0.00040429106,0.00057863496,0.001088833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011121188,0.00016471167,0.00093684864,0.0007045612,0.00007036262,0.0010605573,0.00025423148,0.037537362,0.1513116,0.45820433,0.0069953115,0.34164798],"study_design_scores_gemma":[0.00020023732,0.0016334456,0.0011724172,0.00013514614,0.0001625924,0.0038766298,0.00020034716,0.2839702,0.2677671,0.34583908,0.09495693,0.00008576586],"about_ca_topic_score_codex":0.00028636577,"about_ca_topic_score_gemma":0.0007351741,"teacher_disagreement_score":0.004951873,"about_ca_system_score_codex":0.0003829702,"about_ca_system_score_gemma":0.0004390399,"threshold_uncertainty_score":0.01656562},"labels":[],"label_agreement":null},{"id":"W2090331763","doi":"10.1109/tit.2006.876251","title":"Constructions of quadratic bent functions in polynomial forms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bent molecular geometry; Combinatorics; Mathematics; Bent function; Boolean function; Polynomial; Quadratic equation; Degree (music); Discrete mathematics; Sigma; Geometry; Physics; Mathematical analysis","score_opus":0.004477564958067519,"score_gpt":0.1895377663441877,"score_spread":0.18506020138612017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090331763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.27983508,0.00059951574,0.6498947,0.0004552058,0.00021914666,0.00018072351,0.00029681562,0.0005706033,0.06794822],"genre_scores_gemma":[0.6786042,0.0007568069,0.2907777,0.0002569259,0.000102055295,0.0001447414,0.00049796724,0.00027487683,0.028584635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994313,0.00016394662,0.000036513822,0.00008331611,0.00016973274,0.000115116774],"domain_scores_gemma":[0.99939036,0.00019333226,0.000063463216,0.00013538651,0.00016374882,0.00005368996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039122137,0.00060502184,0.00046819908,0.00086081127,0.00093794713,0.0014532808,0.00061002985,0.00049572944,0.0041370275],"category_scores_gemma":[0.0013796778,0.0003776118,0.0006770965,0.00115003,0.00093579415,0.0015392964,0.00101663,0.001408091,0.0014147796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029745797,0.00010394018,0.0009521378,0.00028456355,0.000027394084,0.00047613998,0.0011713546,0.010541437,0.04390226,0.81281656,0.002995239,0.12643151],"study_design_scores_gemma":[0.00007254416,0.00062766083,0.0017025742,0.0001499762,0.00006714762,0.0031059482,0.000745247,0.085036986,0.08304962,0.73411274,0.09116835,0.00016120171],"about_ca_topic_score_codex":0.0003281973,"about_ca_topic_score_gemma":0.000586497,"teacher_disagreement_score":0.0041370275,"about_ca_system_score_codex":0.0005828722,"about_ca_system_score_gemma":0.00043781433,"threshold_uncertainty_score":0.013839781},"labels":[],"label_agreement":null},{"id":"W2091416417","doi":"10.1142/s1793042109002602","title":"A GENERALIZATION OF ROTH'S THEOREM IN FUNCTION FIELDS","year":2009,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Generalization; Degree (music); Finite field; Polynomial; Ring (chemistry); Zero (linguistics); Polynomial ring; Field (mathematics); Discrete mathematics; Function field; Function (biology); Pure mathematics; Mathematical analysis","score_opus":0.008158623682477266,"score_gpt":0.25729639132960014,"score_spread":0.24913776764712287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091416417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04965758,0.00543298,0.7891898,0.007877099,0.0029860453,0.00024838487,0.0017535933,0.0012931902,0.14156123],"genre_scores_gemma":[0.61146086,0.007706785,0.31813326,0.0060614888,0.004683482,0.0005431414,0.001201309,0.0008997844,0.049309902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959484,0.00097611826,0.00024314354,0.0014016371,0.000945867,0.00048484368],"domain_scores_gemma":[0.9931277,0.0035603864,0.0005777846,0.0016738262,0.00074725476,0.00031303015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082346145,0.0015830458,0.0028261745,0.0039632507,0.002435239,0.0035278276,0.0040331692,0.0023060904,0.008175157],"category_scores_gemma":[0.013074648,0.00076733774,0.0037331972,0.0035865086,0.0059925336,0.016415678,0.0048501506,0.005701356,0.0026779058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040235525,0.000013736867,0.00018867842,0.00010148932,0.000021296762,0.00010836202,0.0001186277,0.0013637625,0.00054797,0.98405313,0.0044948794,0.008947894],"study_design_scores_gemma":[0.000034744156,0.00005700076,0.0003077039,0.000052529795,0.00004240096,0.00043402726,0.00005125631,0.009624299,0.001048721,0.9696778,0.018625772,0.000043713797],"about_ca_topic_score_codex":0.0011984742,"about_ca_topic_score_gemma":0.0006504789,"teacher_disagreement_score":0.0082346145,"about_ca_system_score_codex":0.0026183608,"about_ca_system_score_gemma":0.0015543633,"threshold_uncertainty_score":0.04354936},"labels":[],"label_agreement":null},{"id":"W2092375161","doi":"10.1006/jcta.2001.3218","title":"New Maximal Arcs in Desarguesian Planes","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Conic section; Combinatorics; Arc (geometry); Mathematics; Projective plane; Order (exchange); Enumeration; Construct (python library); Discrete mathematics; Geometry; Computer science","score_opus":0.011824715899154022,"score_gpt":0.20682386458745025,"score_spread":0.19499914868829624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092375161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5760765,0.0017700349,0.11666159,0.002853653,0.0006319502,0.00014131698,0.0010663718,0.0007102318,0.30008838],"genre_scores_gemma":[0.8881231,0.0011081122,0.0516452,0.00035703467,0.00030322038,0.00007726204,0.0006883349,0.00031897912,0.057378784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999567,0.00009624224,0.00003042146,0.00010313672,0.00010011036,0.000103160535],"domain_scores_gemma":[0.9988782,0.0005229555,0.00014656437,0.0001252379,0.000110468536,0.00021656057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660973,0.00063919084,0.0006561086,0.0016789648,0.002256551,0.0034726092,0.0010960125,0.001221239,0.011162036],"category_scores_gemma":[0.0026736213,0.00068779313,0.00068095466,0.0016836678,0.0022341763,0.004216213,0.0019664716,0.0031097666,0.0012445683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013013599,0.000025943307,0.00040978187,0.00005362102,0.0000081651215,0.00014393794,0.00027716233,0.0012318308,0.0012494781,0.9835789,0.0019267778,0.010964251],"study_design_scores_gemma":[0.000039435163,0.000023685605,0.00039024805,0.000028776418,0.000020235851,0.0002747781,0.0002763871,0.0043126736,0.0024209828,0.97187984,0.020315573,0.000017495275],"about_ca_topic_score_codex":0.0009386748,"about_ca_topic_score_gemma":0.0014552217,"teacher_disagreement_score":0.011162036,"about_ca_system_score_codex":0.0015883542,"about_ca_system_score_gemma":0.0005293236,"threshold_uncertainty_score":0.03734076},"labels":[],"label_agreement":null},{"id":"W2093149070","doi":"10.1112/jlms/jds052","title":"Representation of powers by polynomials and the language of powers","year":2012,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Sums of powers; Order (exchange); Representation (politics); Constant (computer programming); Field (mathematics); Power (physics); Expressive power; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Physics; Law","score_opus":0.009880160828598022,"score_gpt":0.25945103169598127,"score_spread":0.24957087086738325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093149070","genre_codex":"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.23198363,0.0021001848,0.70504624,0.00636423,0.00023962825,0.00018293069,0.0009237192,0.000776694,0.05238275],"genre_scores_gemma":[0.8657521,0.0008716168,0.12020955,0.00079646026,0.0003618703,0.00022597902,0.0008135128,0.00030231662,0.010666616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934284,0.0024616162,0.0005274332,0.0012359906,0.0013094377,0.0010370079],"domain_scores_gemma":[0.98036754,0.013628024,0.0013613383,0.002542574,0.0014359893,0.0006645981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005108293,0.0006985309,0.0012203598,0.0020572746,0.00202644,0.008155404,0.0026866805,0.0014515263,0.0056724385],"category_scores_gemma":[0.01999306,0.0010388651,0.0018787009,0.00271649,0.008577976,0.020308085,0.004470073,0.0050877356,0.0011012161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069565496,0.00001910546,0.00024585874,0.000045633653,0.0000058757187,0.00008926757,0.00082586415,0.002243686,0.00057101046,0.99123,0.00055346685,0.0041006166],"study_design_scores_gemma":[0.000020091293,0.000015248978,0.000048951522,0.000025590063,0.000008772282,0.000072987794,0.00014709291,0.011720473,0.0007215776,0.9838298,0.0033784283,0.000011063714],"about_ca_topic_score_codex":0.0018268498,"about_ca_topic_score_gemma":0.0011459171,"teacher_disagreement_score":0.008155404,"about_ca_system_score_codex":0.0032088447,"about_ca_system_score_gemma":0.0017189451,"threshold_uncertainty_score":0.027015567},"labels":[],"label_agreement":null},{"id":"W2093848341","doi":"10.4153/cmb-2006-020-5","title":"Another Proof of Totaro's Theorem on <i>E</i><sub>8</sub>-Torsors","year":2006,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Universität Bielefeld; Canadian Mathematical Society","keywords":"Mathematics; Extension (predicate logic); Separable space; Field (mathematics); Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Computer science; Programming language","score_opus":0.0061523046732652195,"score_gpt":0.17696891690655228,"score_spread":0.17081661223328706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093848341","genre_codex":"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.15475932,0.007010695,0.26541474,0.012013003,0.0057021556,0.00014181537,0.0015494546,0.0017541145,0.55165464],"genre_scores_gemma":[0.8761647,0.003625486,0.051960997,0.0032997038,0.0018163138,0.0001436161,0.0007870785,0.0005118131,0.06169028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966335,0.0000317934,0.00001999679,0.00006340813,0.00012232743,0.00009899068],"domain_scores_gemma":[0.99918884,0.00027517587,0.0000843976,0.0001010135,0.00022990687,0.000120648554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044268326,0.0008054375,0.000484725,0.0013541223,0.0013229084,0.0011805603,0.0006759768,0.0006259477,0.015056171],"category_scores_gemma":[0.0013303421,0.0003146872,0.0013358952,0.00079951005,0.0023318313,0.0034306897,0.0022836397,0.0027690202,0.0015448374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059013717,0.000028871023,0.00027226604,0.00014472964,0.000017584794,0.00045049647,0.0005153966,0.0004999012,0.0043151425,0.9618529,0.013758038,0.018085578],"study_design_scores_gemma":[0.000050412073,0.00009901099,0.0018714886,0.0000908634,0.000036206093,0.0013809839,0.00020764949,0.0018016374,0.005990203,0.8952572,0.093173586,0.000040805866],"about_ca_topic_score_codex":0.00118012,"about_ca_topic_score_gemma":0.0008345259,"teacher_disagreement_score":0.015056171,"about_ca_system_score_codex":0.0008486486,"about_ca_system_score_gemma":0.00053160137,"threshold_uncertainty_score":0.05036789},"labels":[],"label_agreement":null},{"id":"W2094280216","doi":"10.4153/cmb-2004-023-6","title":"Ramification des séries formelles","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramification; Combinatorics; Integer (computer science); Prime (order theory); Prime number; Ring of integers; Ring (chemistry); Discrete mathematics; Algebraic number field","score_opus":0.011905888536334078,"score_gpt":0.20024039846573785,"score_spread":0.18833450992940376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094280216","genre_codex":"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.7899658,0.0016371849,0.09055897,0.0014410471,0.0006396272,0.00012164373,0.00046061704,0.0012471864,0.11392805],"genre_scores_gemma":[0.92735267,0.0014934095,0.026014445,0.00023405242,0.0004523546,0.00013619829,0.0006368773,0.00021337559,0.043466642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850047,0.00036270855,0.00006312675,0.0002785299,0.0004967605,0.0002984655],"domain_scores_gemma":[0.99862003,0.00047860004,0.0002464737,0.00019772655,0.000240055,0.00021706549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001722272,0.0015108449,0.0010422614,0.003280762,0.002778279,0.004890738,0.0005874696,0.0012294439,0.009445061],"category_scores_gemma":[0.004953532,0.0006134678,0.0009619691,0.0014861291,0.0045649414,0.0036644137,0.0018924483,0.005417213,0.0024084582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002634366,0.00012775266,0.0013740915,0.00007018142,0.000024434372,0.0008088185,0.0011868748,0.0053091343,0.0061107846,0.9501581,0.002411217,0.03215514],"study_design_scores_gemma":[0.00020473507,0.00046816305,0.0028000758,0.00015354273,0.00005633206,0.0024962968,0.0016473588,0.048595093,0.03121573,0.8232021,0.08902691,0.00013367824],"about_ca_topic_score_codex":0.0033784648,"about_ca_topic_score_gemma":0.0018789558,"teacher_disagreement_score":0.009445061,"about_ca_system_score_codex":0.0034947742,"about_ca_system_score_gemma":0.0008205477,"threshold_uncertainty_score":0.0315969},"labels":[],"label_agreement":null},{"id":"W2094348308","doi":"10.1016/j.dam.2013.10.029","title":"The intersection spectrum of hooked Skolem sequences and applications","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Intersection (aeronautics); Mathematics; Sequence (biology); Combinatorics; Order (exchange); Integer (computer science); Spectrum (functional analysis); Integer sequence; Discrete mathematics; Computer science; Generating function; Physics","score_opus":0.006822453473603833,"score_gpt":0.2100070667718314,"score_spread":0.20318461329822757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094348308","genre_codex":"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.73203164,0.0033759447,0.13810547,0.0021421525,0.00040270548,0.000039108083,0.0002762289,0.00041220488,0.123214565],"genre_scores_gemma":[0.975223,0.0009657505,0.010690772,0.0001969313,0.00042160958,0.00004363725,0.000176103,0.00010107518,0.012181076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993824,0.00013299406,0.000037057067,0.000117217285,0.0001862873,0.00014402856],"domain_scores_gemma":[0.9982876,0.00068487367,0.00025548137,0.00015884227,0.00026737273,0.00034579652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008293687,0.00075204845,0.000980835,0.0054235347,0.0019444932,0.0031983668,0.0013737608,0.0014299095,0.007196482],"category_scores_gemma":[0.0034254151,0.00045974084,0.0007368785,0.002848807,0.003349344,0.004082841,0.0031067408,0.0025452843,0.0011741224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005703236,0.00002154565,0.00021112012,0.000023725497,0.000005837335,0.000070797425,0.00016532397,0.00078973564,0.00087723264,0.991918,0.00056142587,0.0052981954],"study_design_scores_gemma":[0.000014278933,0.000020272946,0.0002722577,0.000022939637,0.000007242024,0.00016620793,0.00011541426,0.0072114007,0.0006103423,0.98991525,0.0016260784,0.000018378663],"about_ca_topic_score_codex":0.00044657625,"about_ca_topic_score_gemma":0.0002598468,"teacher_disagreement_score":0.007196482,"about_ca_system_score_codex":0.0013632085,"about_ca_system_score_gemma":0.00053113437,"threshold_uncertainty_score":0.024074674},"labels":[],"label_agreement":null},{"id":"W2094454765","doi":"10.1007/s12215-014-0165-7","title":"Even perfect numbers among generalized Fibonacci sequences","year":2014,"lang":"it","type":"article","venue":"Rendiconti del Circolo Matematico di Palermo Series 2","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia","keywords":"Fibonacci number; Combinatorics; Integer (computer science); Mathematics; Sequence (biology); Sigma; Pisano period; Perfect power; Lucas number; Fibonacci polynomials; Discrete mathematics; Physics; Computer science; Chemistry; Quantum mechanics","score_opus":0.01181070156895635,"score_gpt":0.22535459422680737,"score_spread":0.213543892657851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094454765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6622582,0.004671185,0.12920274,0.0030456218,0.0011165219,0.00011273342,0.0004450666,0.00043914333,0.19870876],"genre_scores_gemma":[0.9597047,0.0012248865,0.017122589,0.00049908966,0.0006987271,0.0001276955,0.0001697771,0.00007001209,0.020382613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992767,0.00019272104,0.00004177834,0.00013244501,0.00019695198,0.00015946158],"domain_scores_gemma":[0.9988697,0.00062204286,0.00014438517,0.00014454829,0.00009847565,0.00012074685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087648514,0.00090293604,0.0007690368,0.0026605874,0.0017158231,0.002937505,0.00068046,0.0013121158,0.005698286],"category_scores_gemma":[0.0035773763,0.0005253314,0.00056020246,0.0021288139,0.0023631735,0.0025092664,0.0016560401,0.0015553655,0.0009566411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044030552,0.0000059959693,0.00018349076,0.000030626416,0.000005536757,0.0001289424,0.00015946147,0.0008268751,0.0009481349,0.9911432,0.00082490675,0.005698885],"study_design_scores_gemma":[0.000026154394,0.000029744806,0.00031215887,0.000032484204,0.000013278414,0.0002932889,0.00005775041,0.0030247627,0.001175772,0.98845273,0.006561108,0.00002072243],"about_ca_topic_score_codex":0.000490032,"about_ca_topic_score_gemma":0.00052432914,"teacher_disagreement_score":0.005698286,"about_ca_system_score_codex":0.0011396289,"about_ca_system_score_gemma":0.0009209811,"threshold_uncertainty_score":0.019062698},"labels":[],"label_agreement":null},{"id":"W2095026990","doi":"10.1109/tit.2015.2416068","title":"Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Interpolation (computer graphics); Polynomial; List decoding; Algorithm; Decoding methods; Mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Computer science; Artificial intelligence; Pure mathematics","score_opus":0.01921276658745393,"score_gpt":0.23838268054384007,"score_spread":0.21916991395638613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095026990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.009598136,0.0001485575,0.984959,0.00019654243,0.000050215942,0.00007224099,0.00007690688,0.0018563881,0.0030419615],"genre_scores_gemma":[0.109694004,0.00017715344,0.8837689,0.00011501086,0.00010931775,0.00021590035,0.00051051605,0.00048510404,0.004924058],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997451,0.00058205123,0.00014834276,0.00039913997,0.001028175,0.00039120883],"domain_scores_gemma":[0.9959478,0.0019344287,0.0002857003,0.0010740305,0.00061695976,0.00014126087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018513051,0.0015030539,0.0013144942,0.0017834225,0.0010565781,0.001857486,0.0022472858,0.0010351801,0.012198051],"category_scores_gemma":[0.00831968,0.00069983624,0.0018686756,0.0024786864,0.0010342653,0.0045108907,0.0036891794,0.0035157339,0.0041929516],"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.00068620464,0.0002846091,0.001141978,0.00031308047,0.000101014804,0.00015919724,0.0004186063,0.13450818,0.0119726,0.21705359,0.009669601,0.6236913],"study_design_scores_gemma":[0.00013926609,0.000113998954,0.0002356432,0.00003884679,0.000031628304,0.00016046499,0.0001349157,0.82148135,0.009960681,0.15911885,0.008537509,0.000046696103],"about_ca_topic_score_codex":0.0027516806,"about_ca_topic_score_gemma":0.004844653,"teacher_disagreement_score":0.012198051,"about_ca_system_score_codex":0.0017043053,"about_ca_system_score_gemma":0.0030957812,"threshold_uncertainty_score":0.04080659},"labels":[],"label_agreement":null},{"id":"W2096776883","doi":"10.1016/j.ffa.2013.02.005","title":"Cyclotomy and permutation polynomials of large indices","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Mathematics; Discrete orthogonal polynomials; Finite field; Permutation graph; Difference polynomials; Partial permutation; Construct (python library); Cyclic permutation; Combinatorics; Classical orthogonal polynomials; Random permutation; Bit-reversal permutation; Discrete mathematics; Algebra over a field; Orthogonal polynomials; Pure mathematics; Symmetric group; Computer science","score_opus":0.006411509416715652,"score_gpt":0.2189252886992095,"score_spread":0.21251377928249385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096776883","genre_codex":"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.5943659,0.009029286,0.15860334,0.0101909675,0.0017654592,0.00009514583,0.00052866986,0.00039377605,0.22502746],"genre_scores_gemma":[0.9613106,0.0024092116,0.012789877,0.0005388872,0.0016139111,0.000074950585,0.00012387184,0.00007011727,0.021068525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995357,0.0001457495,0.000013895232,0.00007136072,0.00013681353,0.000096484684],"domain_scores_gemma":[0.9979741,0.001178513,0.00033652497,0.00023240084,0.00012250636,0.00015587217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071112154,0.0007526352,0.0007815377,0.0022368268,0.0013150532,0.0020285859,0.00078516104,0.0012486207,0.0070315604],"category_scores_gemma":[0.0043055406,0.0003718323,0.00046924455,0.0026543483,0.0046209437,0.003844797,0.0013329389,0.0029967984,0.00065834913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001928367,0.000011900419,0.00007162827,0.00001563845,0.000001617797,0.000034823235,0.000057958776,0.00064040703,0.00032986794,0.994371,0.00080247625,0.00364347],"study_design_scores_gemma":[0.000009067427,0.000009787457,0.000095791074,0.0000072367775,0.0000020759278,0.000070335474,0.00002297248,0.0026670445,0.00021376397,0.99539465,0.0015002528,0.0000070011874],"about_ca_topic_score_codex":0.00055447855,"about_ca_topic_score_gemma":0.00060834025,"teacher_disagreement_score":0.0070315604,"about_ca_system_score_codex":0.0013628165,"about_ca_system_score_gemma":0.00077248743,"threshold_uncertainty_score":0.023522913},"labels":[],"label_agreement":null},{"id":"W2097068816","doi":"10.1142/s1793042109002638","title":"GAUSSIAN LAWS ON DRINFELD MODULES","year":2009,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Automorphism; Finite field; Combinatorics; Conjecture; Ideal (ethics); Polynomial ring; Rank (graph theory); Discrete mathematics; Commutative ring; Polynomial; Commutative property","score_opus":0.009838271542811661,"score_gpt":0.27216425060165284,"score_spread":0.2623259790588412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097068816","genre_codex":"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.86480343,0.00055741594,0.07690015,0.00092766044,0.00007627452,0.00006205607,0.0003427331,0.00034599437,0.055984315],"genre_scores_gemma":[0.9815778,0.0003214794,0.0066871773,0.0001440921,0.0002024925,0.000046773705,0.00018408865,0.00003731323,0.010798801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843305,0.00025389163,0.000068744885,0.0003053058,0.0004873513,0.0004515631],"domain_scores_gemma":[0.9948778,0.0023017444,0.0008460271,0.00051155896,0.0007171232,0.0007456532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017944673,0.00039824098,0.00077827915,0.0025970617,0.0011610797,0.0020382197,0.00074083667,0.0007023595,0.004522849],"category_scores_gemma":[0.00653898,0.00044424826,0.00069027074,0.001272064,0.004192245,0.003964774,0.0017491298,0.0013129915,0.0007200609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044529945,0.000029534931,0.0011209608,0.000018132592,0.00000438296,0.0000916861,0.00035149962,0.00093474664,0.0010257278,0.99209166,0.00058923237,0.0036979942],"study_design_scores_gemma":[0.000063756954,0.00008566037,0.0022312922,0.00003131147,0.0000149582,0.00038927287,0.0001665575,0.020292256,0.0029949974,0.9684245,0.005265094,0.000040383024],"about_ca_topic_score_codex":0.0023220994,"about_ca_topic_score_gemma":0.0012135642,"teacher_disagreement_score":0.004522849,"about_ca_system_score_codex":0.0019643651,"about_ca_system_score_gemma":0.0006885119,"threshold_uncertainty_score":0.01513046},"labels":[],"label_agreement":null},{"id":"W2097094277","doi":"10.1007/s12190-016-1045-4","title":"Simplex and MacDonald codes over $$R_{q}$$ R q","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Simplex; Homogeneous; Combinatorics; Ring (chemistry); RADIUS; Computer science","score_opus":0.011784166309943214,"score_gpt":0.2316921247849474,"score_spread":0.2199079584750042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097094277","genre_codex":"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.58780736,0.0013472922,0.24716571,0.0049187453,0.0012251522,0.00027171,0.0019665142,0.0015694074,0.15372807],"genre_scores_gemma":[0.90513086,0.00076919264,0.028587038,0.0006784843,0.00045963237,0.00022967489,0.0005206311,0.00047665907,0.063147776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853814,0.0002893692,0.00008619748,0.00021168179,0.00053737394,0.00033731977],"domain_scores_gemma":[0.9979911,0.00069594424,0.0003118604,0.0002826976,0.00041447967,0.00030396236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008671548,0.0007783652,0.0012062173,0.0019449309,0.0016277838,0.0036432906,0.0010879962,0.0013292056,0.013003796],"category_scores_gemma":[0.0047020083,0.00044964146,0.0008422583,0.0019463948,0.0026185738,0.002697242,0.0029084522,0.0023409685,0.0030517958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107730375,0.000015619873,0.00012427688,0.000023228775,0.000008487608,0.00009862194,0.000105374704,0.001290503,0.0011783177,0.98801196,0.0020051526,0.007030811],"study_design_scores_gemma":[0.000032588076,0.000026675825,0.00017155545,0.000019355728,0.000008525837,0.00016197423,0.000062613355,0.009108301,0.001524715,0.98301584,0.005824908,0.000043032793],"about_ca_topic_score_codex":0.0031296187,"about_ca_topic_score_gemma":0.0016519717,"teacher_disagreement_score":0.013003796,"about_ca_system_score_codex":0.0017108627,"about_ca_system_score_gemma":0.0018570333,"threshold_uncertainty_score":0.043502033},"labels":[],"label_agreement":null},{"id":"W2097803721","doi":"10.1109/isspa.2012.6310593","title":"On efficient decoding for the Fuzzy Vault scheme","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Decoding methods; Computer science; Soft-decision decoder; Fuzzy logic; Code (set theory); Algorithm; Computer engineering; Scheme (mathematics); Vault (architecture); Theoretical computer science; Artificial intelligence; Mathematics; Engineering; Set (abstract data type)","score_opus":0.024857893444362813,"score_gpt":0.26438229250235673,"score_spread":0.23952439905799391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097803721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.06687807,0.0008031283,0.91772866,0.00040314006,0.00013340956,0.00012279955,0.00010524759,0.00045133167,0.013374193],"genre_scores_gemma":[0.6365069,0.0012970375,0.3480533,0.0002808942,0.00015468508,0.00015598812,0.00029500088,0.00010337448,0.013152742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878675,0.00032767665,0.000070540715,0.00010883723,0.00053535815,0.0001709636],"domain_scores_gemma":[0.9982205,0.0009610632,0.00013405863,0.00033362472,0.00031385198,0.00003683696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876636,0.00067126885,0.00060862995,0.0011494248,0.00072844606,0.0011516984,0.00060117664,0.0010432514,0.00258924],"category_scores_gemma":[0.0049502165,0.00020467486,0.00048227038,0.0010006574,0.0010012158,0.0016994423,0.0012605397,0.0011415764,0.00086584775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064322824,0.00005870631,0.0007313505,0.00020775576,0.0000428164,0.0003562153,0.00038745577,0.21088262,0.046424977,0.5933436,0.003512659,0.14340864],"study_design_scores_gemma":[0.000063312604,0.00021352545,0.00024005477,0.00008646745,0.000028510512,0.0005365608,0.00005494434,0.8441404,0.04664289,0.09903057,0.008891309,0.00007145906],"about_ca_topic_score_codex":0.0014325421,"about_ca_topic_score_gemma":0.0014287055,"teacher_disagreement_score":0.00258924,"about_ca_system_score_codex":0.0010338057,"about_ca_system_score_gemma":0.0013965892,"threshold_uncertainty_score":0.008661807},"labels":[],"label_agreement":null},{"id":"W2098125062","doi":"10.1109/isit.2009.5205272","title":"Fast encoding and decoding of Gabidulin codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Encoding (memory); List decoding; Sequential decoding; Error detection and correction","score_opus":0.010587789019119503,"score_gpt":0.23299700316376384,"score_spread":0.22240921414464435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098125062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04267825,0.00068624486,0.9497441,0.00023691246,0.00010100276,0.00007579273,0.00012852534,0.0007014275,0.005647772],"genre_scores_gemma":[0.322489,0.0010829209,0.66862506,0.00016918316,0.000110949,0.00013483583,0.00042351044,0.0001510464,0.006813522],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990101,0.00023221938,0.000070291404,0.000103556544,0.0004361041,0.00014767605],"domain_scores_gemma":[0.9987866,0.0004426681,0.00012922051,0.00021440977,0.00037163426,0.000055541343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079868955,0.0007221503,0.00066921464,0.0011837172,0.00063138094,0.0014719001,0.00074317015,0.00082443544,0.0012843473],"category_scores_gemma":[0.0031962104,0.0002492178,0.0004511672,0.0010154335,0.0006578947,0.0014112828,0.0014719723,0.0010648926,0.0010765755],"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.000556159,0.00006631302,0.0010056505,0.0002485042,0.00004463086,0.00044517507,0.0005866646,0.08784335,0.06789884,0.3431255,0.0044907075,0.4936885],"study_design_scores_gemma":[0.000091208945,0.0002430416,0.0004581817,0.00009796926,0.000033865734,0.0010684269,0.00014876259,0.6984303,0.12545896,0.15263249,0.021246344,0.000090564],"about_ca_topic_score_codex":0.0010247588,"about_ca_topic_score_gemma":0.0013515578,"teacher_disagreement_score":0.0014719001,"about_ca_system_score_codex":0.00070423784,"about_ca_system_score_gemma":0.0012917393,"threshold_uncertainty_score":0.005109668},"labels":[],"label_agreement":null},{"id":"W2098684813","doi":"10.1007/s10801-009-0170-7","title":"Bounds for codes and designs in complex subspaces","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Calgary","keywords":"Linear subspace; Mathematics; Association scheme; Grassmannian; Combinatorics; Dimension (graph theory); Code (set theory); Set (abstract data type); Discrete mathematics; Finite set; Upper and lower bounds; Pure mathematics; Computer science","score_opus":0.031133890459105334,"score_gpt":0.2749133560179146,"score_spread":0.24377946555880928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098684813","genre_codex":"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.1314601,0.013077312,0.68596506,0.012392291,0.0009996267,0.00025339675,0.0024215896,0.0015882817,0.15184242],"genre_scores_gemma":[0.81748974,0.010516534,0.12594463,0.0029773552,0.002409547,0.0012062367,0.0023272715,0.0010876944,0.03604107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908393,0.0022994853,0.0004996829,0.0011696107,0.0032683103,0.0019236561],"domain_scores_gemma":[0.9387436,0.0462609,0.0028775353,0.004663897,0.0042230426,0.003231011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008154293,0.004358776,0.003869821,0.009045561,0.0045765876,0.0144429775,0.0049095037,0.0044098077,0.016660336],"category_scores_gemma":[0.046514187,0.0023361335,0.0023265579,0.009030148,0.008790876,0.021852067,0.012662701,0.011860317,0.0046107364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023901023,0.000074119336,0.00048295065,0.00020118275,0.000044682696,0.000055783057,0.0004576001,0.010154603,0.00090159546,0.9651106,0.0056031942,0.016674705],"study_design_scores_gemma":[0.000021913658,0.00003176936,0.0001278263,0.000108723616,0.000034867237,0.000062805986,0.000074092095,0.01622383,0.0006907813,0.97871196,0.0038740728,0.00003738016],"about_ca_topic_score_codex":0.0021996996,"about_ca_topic_score_gemma":0.003151409,"teacher_disagreement_score":0.016660336,"about_ca_system_score_codex":0.0074709887,"about_ca_system_score_gemma":0.0031806838,"threshold_uncertainty_score":0.055734336},"labels":[],"label_agreement":null},{"id":"W2101113454","doi":"10.1109/ares.2012.32","title":"On the Weak State in GGHN-like Ciphers","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Stream cipher; RC4; Permutation (music); Markov chain; Computer science; Table (database); Ciphertext; State (computer science); Plaintext; Algorithm; Theoretical computer science; Discrete mathematics; Cryptography; Mathematics; Encryption; Data mining; Machine learning","score_opus":0.016109916377884257,"score_gpt":0.22394062154513228,"score_spread":0.20783070516724803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101113454","genre_codex":"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.47129413,0.0010967026,0.5111285,0.0009467087,0.00009434159,0.00013817982,0.00025342524,0.00042388157,0.01462418],"genre_scores_gemma":[0.9508076,0.00065290317,0.045024104,0.00014364638,0.00006357647,0.00009830571,0.00013029255,0.00007704133,0.00300248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967823,0.0016385395,0.00015062376,0.00034939294,0.00064630824,0.0004328057],"domain_scores_gemma":[0.9769573,0.016234854,0.0021556139,0.002913004,0.0011438465,0.0005953075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050230967,0.0006634883,0.0006971895,0.0011380939,0.00091477536,0.0020155867,0.0008476676,0.0014084118,0.0020953882],"category_scores_gemma":[0.022238443,0.00047024226,0.00059428904,0.0010156367,0.004685719,0.0066573583,0.0016698772,0.002267499,0.00055826333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067091425,0.00010392706,0.0025154704,0.00011319454,0.000026701187,0.00010249072,0.00032216695,0.2316755,0.0080195675,0.73894566,0.0010274752,0.01647693],"study_design_scores_gemma":[0.000046586385,0.00032791705,0.0007187568,0.000050361905,0.000021556934,0.00012378971,0.00009106101,0.6072756,0.0091775395,0.3806365,0.0014876008,0.000042748117],"about_ca_topic_score_codex":0.0011107514,"about_ca_topic_score_gemma":0.0007950106,"teacher_disagreement_score":0.0050230967,"about_ca_system_score_codex":0.0018258683,"about_ca_system_score_gemma":0.0016604869,"threshold_uncertainty_score":0.026564956},"labels":[],"label_agreement":null},{"id":"W2102086743","doi":"10.1109/18.959281","title":"Algorithms to enumerate codewords for DC/sup 2/-constrained channels","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Enumeration; Computer science; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.014081156210546595,"score_gpt":0.2420030752528459,"score_spread":0.2279219190422993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102086743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.0063064503,0.00018273098,0.9896058,0.00008743798,0.00005109018,0.0001607062,0.00021555932,0.0007616754,0.0026286473],"genre_scores_gemma":[0.04903811,0.00029823364,0.94597924,0.00009088893,0.000048239363,0.000513182,0.0006455171,0.00020707927,0.0031795122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998522,0.00032005057,0.00016460172,0.00017277442,0.0006466877,0.00017388655],"domain_scores_gemma":[0.9954424,0.0023969677,0.0003637865,0.0006456709,0.0010403596,0.00011080693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012538771,0.0011650476,0.00090140855,0.0026082117,0.0011463134,0.001759389,0.0014265615,0.0010571687,0.0072214114],"category_scores_gemma":[0.009582352,0.0005116657,0.0006285662,0.0023297977,0.0009195704,0.00344039,0.0020764195,0.0014783808,0.0027245628],"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.00031647182,0.00014472137,0.0014987957,0.0003985039,0.000059783597,0.00015176623,0.0003058231,0.09166501,0.016279979,0.2856273,0.01043937,0.5931124],"study_design_scores_gemma":[0.000105824576,0.00013367011,0.00035001317,0.00010010702,0.00003136482,0.00042991672,0.00013693307,0.6921481,0.021138608,0.26787212,0.017467937,0.00008538478],"about_ca_topic_score_codex":0.0015712049,"about_ca_topic_score_gemma":0.0026820938,"teacher_disagreement_score":0.0072214114,"about_ca_system_score_codex":0.0010264296,"about_ca_system_score_gemma":0.0022559466,"threshold_uncertainty_score":0.024158001},"labels":[],"label_agreement":null},{"id":"W2102564119","doi":"10.1109/92.974900","title":"Efficient exponentiation using weakly dual basis","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Finite field; Polynomial basis; Basis (linear algebra); Mathematics; Modular exponentiation; Polynomial; Normal basis; Dual (grammatical number); Square (algebra); Topology (electrical circuits); Computer science; Discrete mathematics; Public-key cryptography; Combinatorics; Encryption; Galois theory; Mathematical analysis; Geometry","score_opus":0.019418815746947517,"score_gpt":0.240251609791976,"score_spread":0.22083279404502848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102564119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.23613589,0.00065225794,0.75195074,0.00015158864,0.00013372014,0.00010296959,0.000086766166,0.001684974,0.009101176],"genre_scores_gemma":[0.7750001,0.00029875134,0.21753082,0.000075892945,0.000050646322,0.00007202112,0.0002446296,0.000057640304,0.0066694645],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998264,0.000031291085,0.000017523638,0.000029019619,0.00006718644,0.00002857374],"domain_scores_gemma":[0.99974495,0.000041416442,0.000031447267,0.00009256397,0.00006638202,0.000023230388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021702836,0.00031716604,0.00032018835,0.00051010423,0.00034036057,0.0005575295,0.0006111448,0.00019049013,0.00208155],"category_scores_gemma":[0.00043647498,0.00019807198,0.00019832673,0.00042710998,0.00034119046,0.0011230091,0.0007564606,0.0005006646,0.00089766737],"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.00088113843,0.0001415234,0.0013557513,0.00023337314,0.000044574164,0.00033152773,0.00020455444,0.012196279,0.5029502,0.082534604,0.002779506,0.39634705],"study_design_scores_gemma":[0.0002632336,0.0019480926,0.0015406748,0.00007394446,0.00011577083,0.0016772863,0.00014379912,0.3193545,0.554486,0.059629325,0.060666036,0.00010137658],"about_ca_topic_score_codex":0.00015195187,"about_ca_topic_score_gemma":0.00032774953,"teacher_disagreement_score":0.00208155,"about_ca_system_score_codex":0.00025103212,"about_ca_system_score_gemma":0.00033019585,"threshold_uncertainty_score":0.006963432},"labels":[],"label_agreement":null},{"id":"W2104443771","doi":"10.1007/978-3-642-15874-2_17","title":"Appended m-Sequences with Merit Factor Greater than 3.34","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Figure of merit; Sequence (biology); Pseudorandom binary sequence; Binary number; Conjecture; Rotation (mathematics); Legendre polynomials; Fraction (chemistry); Factor (programming language); Mathematics; Combinatorics; Algorithm; Computer science; Arithmetic; Geometry; Mathematical analysis","score_opus":0.016252238362898595,"score_gpt":0.22415227324000536,"score_spread":0.20790003487710676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104443771","genre_codex":"other","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.06776297,0.00707013,0.37018073,0.005995574,0.028198818,0.00067125954,0.0073348526,0.0060783653,0.5067074],"genre_scores_gemma":[0.27546445,0.0034117629,0.24135822,0.0026546775,0.0026073875,0.00071631017,0.008442894,0.0019111909,0.46343306],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999522,0.00008418438,0.00005066958,0.00008442799,0.0001544372,0.00010440729],"domain_scores_gemma":[0.99883884,0.00023268076,0.00010090572,0.000312945,0.0003778619,0.00013691687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038537872,0.0008698857,0.00091565744,0.0012063277,0.0012378172,0.0012657878,0.00091195485,0.0016151789,0.074409865],"category_scores_gemma":[0.0037868891,0.00033259887,0.0006158694,0.0010939211,0.0006018718,0.0016225205,0.0017022475,0.0019717717,0.045909073],"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.0017974579,0.00017669502,0.0006246331,0.0012849947,0.000057805737,0.0020707713,0.00036231335,0.003367256,0.088071935,0.2901016,0.18254276,0.42954183],"study_design_scores_gemma":[0.000099315206,0.0003658847,0.00077753566,0.00042228898,0.00003927137,0.0026770765,0.00010630506,0.005496929,0.05786287,0.23046997,0.7016012,0.00008131422],"about_ca_topic_score_codex":0.00024242137,"about_ca_topic_score_gemma":0.00036584993,"teacher_disagreement_score":0.074409865,"about_ca_system_score_codex":0.00054676016,"about_ca_system_score_gemma":0.0006308985,"threshold_uncertainty_score":0.2489258},"labels":[],"label_agreement":null},{"id":"W2105512769","doi":"10.1109/tit.2010.2044062","title":"On the Construction of Skew Quasi-Cyclic Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Yildiz Teknik Üniversitesi; Ohio State University","keywords":"Ring (chemistry); Skew; Polynomial ring; Computer science; Combinatorics; Algorithm; Discrete mathematics; Polynomial; Mathematics; Telecommunications","score_opus":0.006696594448420201,"score_gpt":0.2075444106367516,"score_spread":0.20084781618833142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105512769","genre_codex":"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.45842275,0.0021313694,0.44859284,0.0009132265,0.000522202,0.00009681319,0.00030044932,0.00030384425,0.08871649],"genre_scores_gemma":[0.9219827,0.0010593556,0.057424337,0.0003328883,0.00035352743,0.000074236916,0.00025913655,0.000114277354,0.01839952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999275,0.00018322529,0.00002676922,0.00010960599,0.00026173922,0.0001436159],"domain_scores_gemma":[0.9988809,0.00032767098,0.00017433071,0.00021463993,0.00028521483,0.00011728547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059890305,0.00029616174,0.00027406143,0.0009640198,0.0009262423,0.00072720647,0.0004196285,0.0004685357,0.0036735563],"category_scores_gemma":[0.001563039,0.0002012809,0.00046148885,0.00069344783,0.0017443947,0.0012950617,0.0012020442,0.0008342862,0.00059270655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003234324,0.0000129181435,0.00043954517,0.000052330914,0.0000048604634,0.00011562628,0.00020270723,0.0041998816,0.0026732741,0.9820286,0.0007460736,0.009491953],"study_design_scores_gemma":[0.000027012393,0.00014922605,0.00080148,0.000058032892,0.000015476715,0.0008241151,0.00017352027,0.057241578,0.009939755,0.90670973,0.024000619,0.000059469192],"about_ca_topic_score_codex":0.0009342195,"about_ca_topic_score_gemma":0.0005638161,"teacher_disagreement_score":0.0036735563,"about_ca_system_score_codex":0.00067978166,"about_ca_system_score_gemma":0.00063848397,"threshold_uncertainty_score":0.012289286},"labels":[],"label_agreement":null},{"id":"W2106235749","doi":"10.1109/tit.2010.2079590","title":"Multiplicative Characters, the Weil Bound, and Polyphase Sequence Families With Low Correlation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Lakehead University","funders":"","keywords":"Polyphase system; Multiplicative function; Sequence (biology); Mathematics; Correlation; Complementary sequences; Discrete mathematics; Combinatorics; Algorithm; Computer science; Physics; Mathematical analysis; Biology; Genetics","score_opus":0.005572041426733712,"score_gpt":0.2070042543238948,"score_spread":0.2014322128971611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106235749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.41572568,0.0015575258,0.5481444,0.0006401551,0.00012183238,0.00007849528,0.0002871033,0.00031361723,0.03313125],"genre_scores_gemma":[0.91499585,0.0007885161,0.07823672,0.00020390484,0.00013941404,0.00011977279,0.00022801047,0.00007782512,0.0052099996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889475,0.00029030358,0.00006713504,0.00023603719,0.00033732856,0.00017445219],"domain_scores_gemma":[0.99680954,0.0016616167,0.0006104369,0.0004860927,0.0002641908,0.00016819192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009635184,0.00051375,0.00045346678,0.0013368452,0.0011960929,0.00097354146,0.0004363554,0.0007723239,0.0027084101],"category_scores_gemma":[0.0057688826,0.00038851454,0.00046084615,0.0011331431,0.0016081884,0.0028915727,0.0011489656,0.0011970572,0.00060045085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016442091,0.000030074001,0.0011476281,0.00011148068,0.000014984213,0.00046724876,0.00034608942,0.01097165,0.015734466,0.92743725,0.001035778,0.042538922],"study_design_scores_gemma":[0.000030396901,0.00038904915,0.0019130905,0.00010934993,0.00003464265,0.0024317591,0.00025602776,0.07679713,0.051691655,0.8437943,0.022443864,0.000108760854],"about_ca_topic_score_codex":0.0002069753,"about_ca_topic_score_gemma":0.00019416187,"teacher_disagreement_score":0.0027084101,"about_ca_system_score_codex":0.00068253314,"about_ca_system_score_gemma":0.00046867906,"threshold_uncertainty_score":0.009060502},"labels":[],"label_agreement":null},{"id":"W2106623697","doi":"10.1109/focs.2007.30","title":"Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Electronic circuit; Fan-out; Power (physics); Fan-in; Electrical engineering; Computer science; Geology; Engineering; Physics","score_opus":0.010412350139043418,"score_gpt":0.23382142748156962,"score_spread":0.22340907734252619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106623697","genre_codex":"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.24997632,0.0012441003,0.71132773,0.0050591403,0.00020470054,0.00017722402,0.00092996017,0.0018769917,0.029203847],"genre_scores_gemma":[0.9323422,0.00057036505,0.058392692,0.0012498175,0.00017018903,0.00030086524,0.00050447736,0.00039339633,0.006076173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512047,0.0012077593,0.00016431563,0.0010425623,0.0013305455,0.001134325],"domain_scores_gemma":[0.97072875,0.022277415,0.0015979527,0.0035210156,0.00090578507,0.00096905854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041645253,0.0016399053,0.0019875218,0.0011527725,0.0015148866,0.004327627,0.003390426,0.0018772734,0.0073060174],"category_scores_gemma":[0.019181358,0.0010637251,0.003294961,0.0010174772,0.004147882,0.008396799,0.0048373295,0.0073025185,0.0010584323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017027666,0.00025878815,0.003690512,0.00050365756,0.00016557812,0.00039042303,0.0005700682,0.1646785,0.017820708,0.7718863,0.00559817,0.032734532],"study_design_scores_gemma":[0.00016065032,0.00016584873,0.00044030635,0.000079228885,0.00007896487,0.00017185826,0.000049329963,0.40033242,0.0104113035,0.58429646,0.003752701,0.000060976567],"about_ca_topic_score_codex":0.0018136961,"about_ca_topic_score_gemma":0.0014989275,"teacher_disagreement_score":0.0073060174,"about_ca_system_score_codex":0.0039026004,"about_ca_system_score_gemma":0.0022471843,"threshold_uncertainty_score":0.028315485},"labels":[],"label_agreement":null},{"id":"W2106641903","doi":"10.1109/tc.2007.1047","title":"Comb Architectures for Finite Field Multiplication in F(2^m)","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Normal basis; Finite field; Basis (linear algebra); Critical path method; Multiplier (economics); Binary number; Field-programmable gate array; Computer science; Adder; Polynomial basis; Algorithm; Multiplication (music); Field (mathematics); Path (computing); Representation (politics); Mathematics; Arithmetic; Parallel computing; Discrete mathematics; Computer hardware; Latency (audio); Combinatorics; Galois theory","score_opus":0.01617108888284695,"score_gpt":0.2593328631153665,"score_spread":0.24316177423251956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106641903","genre_codex":"methods","genre_gemma":"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.12085512,0.0009227357,0.86574334,0.0002101952,0.00021199534,0.00014607723,0.00010751571,0.0009985857,0.010804409],"genre_scores_gemma":[0.4236603,0.00046579813,0.5675986,0.00012196197,0.00013292044,0.00013781105,0.00017496741,0.00004366516,0.0076639396],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999106,0.000023079034,0.0000074698555,0.000014095167,0.000034563294,0.0000101979085],"domain_scores_gemma":[0.9997495,0.00006902155,0.000052879295,0.000044788754,0.00006933308,0.000014415368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025791491,0.00035708142,0.00021509887,0.0005864699,0.0003125321,0.00037072168,0.00044118962,0.00028276345,0.0034497003],"category_scores_gemma":[0.0006855861,0.00012579358,0.00020739566,0.00042581154,0.00025333793,0.0008205481,0.00029301504,0.0003349798,0.0008190181],"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.000711957,0.00018369265,0.0010661385,0.00040316695,0.00005898727,0.0005396634,0.00017778872,0.016161706,0.14551027,0.120726354,0.005310237,0.7091501],"study_design_scores_gemma":[0.00040606345,0.002174568,0.002682507,0.00016764694,0.00012820099,0.0031925952,0.0001649331,0.5772177,0.24496068,0.08376845,0.08499052,0.00014603403],"about_ca_topic_score_codex":0.0001712396,"about_ca_topic_score_gemma":0.00058264757,"teacher_disagreement_score":0.0034497003,"about_ca_system_score_codex":0.0002365155,"about_ca_system_score_gemma":0.00031755902,"threshold_uncertainty_score":0.011540413},"labels":[],"label_agreement":null},{"id":"W2106689698","doi":"10.1109/ccece.1999.807163","title":"Extended properties of high-order spectral-null words","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Null (SQL); Order (exchange); Mathematics; Word (group theory); Code (set theory); Redundancy (engineering); Combinatorics; Discrete mathematics; Algorithm; Computer science","score_opus":0.014494799207080827,"score_gpt":0.2051408220551718,"score_spread":0.19064602284809098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106689698","genre_codex":"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.8208903,0.00044222572,0.16481689,0.00018867035,0.000041040024,0.00003512228,0.0003635199,0.00016582769,0.0130564375],"genre_scores_gemma":[0.97925264,0.00014985685,0.018067457,0.00006531812,0.000057876867,0.00004592698,0.00024874724,0.000038459417,0.0020736903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946207,0.0001077755,0.00006797121,0.000083016486,0.00020328599,0.00007602831],"domain_scores_gemma":[0.9936752,0.0029540379,0.0010593459,0.0008943642,0.0011344965,0.00028265623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004633558,0.00027755715,0.00035702426,0.0007873947,0.0004948119,0.00075467204,0.0003839715,0.00044933,0.0021938018],"category_scores_gemma":[0.0051184525,0.000219459,0.000260378,0.0004967838,0.0012730034,0.0014972342,0.00062294345,0.00062938,0.00049868465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005986643,0.00007181529,0.006048371,0.00027163408,0.000027750357,0.0010968167,0.00088990206,0.033518504,0.122812554,0.7918193,0.0011135541,0.041731093],"study_design_scores_gemma":[0.00006552661,0.00046056267,0.00443375,0.000075904696,0.000028937973,0.0026647497,0.0003060684,0.18889329,0.071809724,0.7210741,0.010096516,0.000090908776],"about_ca_topic_score_codex":0.0001732026,"about_ca_topic_score_gemma":0.0001551354,"teacher_disagreement_score":0.0021938018,"about_ca_system_score_codex":0.00040318028,"about_ca_system_score_gemma":0.0003332591,"threshold_uncertainty_score":0.0073390007},"labels":[],"label_agreement":null},{"id":"W2106824622","doi":"10.1007/978-3-540-85912-3_5","title":"A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Pseudorandom number generator; Randomness; Pseudorandom binary sequence; Binary number; Computer science; Algorithm; Order (exchange); Function (biology); Period (music); Mathematics; Discrete mathematics; Combinatorics; Statistics; Arithmetic; Physics","score_opus":0.03315556871134891,"score_gpt":0.23189349797111103,"score_spread":0.19873792925976214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106824622","genre_codex":"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.5141841,0.004042934,0.38693306,0.0014635193,0.0002821216,0.0001331087,0.0002866014,0.00023330435,0.09244126],"genre_scores_gemma":[0.9621831,0.0022998324,0.023621578,0.00020646643,0.0004893055,0.000090362686,0.00021447439,0.00010596071,0.010788956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845123,0.0005714208,0.000080953316,0.0001780636,0.0005796338,0.00013868758],"domain_scores_gemma":[0.9834379,0.013163447,0.0010109956,0.001278782,0.0007736801,0.00033519874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019366662,0.0006634656,0.0007430423,0.0017182187,0.0007647054,0.0024879186,0.00091949897,0.00093192223,0.003422766],"category_scores_gemma":[0.013653722,0.00045205292,0.0009130334,0.0016309198,0.0027948776,0.0045136325,0.0010753506,0.0022256041,0.00043284454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045610304,0.000028558536,0.00048776285,0.000063582935,0.000009796151,0.00011519752,0.00020547562,0.0051030656,0.0018289731,0.98473847,0.00036043525,0.0070131025],"study_design_scores_gemma":[0.00003587576,0.00023248346,0.0012635549,0.000082129205,0.00003921468,0.0009052669,0.00015571747,0.069571905,0.003867234,0.9191986,0.00460942,0.000038641003],"about_ca_topic_score_codex":0.00027966464,"about_ca_topic_score_gemma":0.00021951654,"teacher_disagreement_score":0.003422766,"about_ca_system_score_codex":0.00084396097,"about_ca_system_score_gemma":0.000746056,"threshold_uncertainty_score":0.011450291},"labels":[],"label_agreement":null},{"id":"W2107014706","doi":"10.1109/arith.1997.614897","title":"Algorithms for multi-exponentiation based on complex arithmetic","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Modular exponentiation; Exponentiation; Modular arithmetic; Computer science; Cryptography; Arithmetic; Binary number; Modular design; Algorithm; Theoretical computer science; Parallel computing; Public-key cryptography; Mathematics; Encryption; Computer security","score_opus":0.13065980796550095,"score_gpt":0.2909043719107428,"score_spread":0.16024456394524186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107014706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.004954364,0.0009766677,0.99026173,0.00015697206,0.0002687439,0.00010245274,0.000038465674,0.00054560986,0.0026950017],"genre_scores_gemma":[0.14359602,0.0018357876,0.8486273,0.00026022206,0.00033861957,0.00024343097,0.00027887843,0.0002608313,0.004558907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811673,0.00035032423,0.00027635152,0.0003380685,0.00073241605,0.00018605668],"domain_scores_gemma":[0.9970084,0.0010655002,0.00028362736,0.0009544739,0.00060725916,0.000080860234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015197775,0.0011152342,0.0009459719,0.0016562499,0.00077347737,0.0025038954,0.0020534191,0.0010209929,0.00546644],"category_scores_gemma":[0.0057832208,0.00045492372,0.0008707623,0.0012925541,0.0012479959,0.0070775845,0.0021459605,0.0026340943,0.0029293688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042876677,0.00013643168,0.0007018037,0.00066775957,0.00008389935,0.00020056931,0.000318312,0.019341854,0.022696204,0.5522737,0.0053195627,0.39783126],"study_design_scores_gemma":[0.00031239763,0.00043027537,0.0007275532,0.00030101722,0.00014494598,0.0020861723,0.00016052168,0.27486855,0.08771062,0.52026576,0.11275869,0.00023344201],"about_ca_topic_score_codex":0.00013401777,"about_ca_topic_score_gemma":0.00019317892,"teacher_disagreement_score":0.00546644,"about_ca_system_score_codex":0.00068964605,"about_ca_system_score_gemma":0.0006127067,"threshold_uncertainty_score":0.018287063},"labels":[],"label_agreement":null},{"id":"W2107744299","doi":"10.1109/18.825842","title":"On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cyclic code; Golomb coding; BCH code; Autocorrelation; Sequence (biology); Mathematics; Code (set theory); Polynomial code; Ideal (ethics); Pseudorandom binary sequence; Binary number; Constant-weight code; Linear code; TRACE (psycholinguistics); Discrete mathematics; Error detection and correction; Algorithm; Decoding methods; Computer science; Block code; Arithmetic; Statistics","score_opus":0.012212847674001232,"score_gpt":0.24045029843727897,"score_spread":0.22823745076327773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107744299","genre_codex":"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.7798539,0.0011726775,0.18440017,0.0024892532,0.00022626088,0.000056375222,0.00021785502,0.00024592123,0.031337548],"genre_scores_gemma":[0.9795115,0.00041995122,0.016817322,0.00018593851,0.00010314787,0.000017128372,0.00011115206,0.00001968863,0.0028141716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994924,0.00009523098,0.000021178781,0.00007857196,0.00019596897,0.000116527306],"domain_scores_gemma":[0.998041,0.00087621243,0.00033925474,0.0002493048,0.00033612223,0.00015818179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008206849,0.00028804457,0.0003539329,0.0009667529,0.0009167779,0.00075289566,0.00046181513,0.00069966784,0.0014670019],"category_scores_gemma":[0.0043067224,0.00015743748,0.00023919692,0.00069012376,0.002150188,0.001235069,0.0007714498,0.00075444666,0.00023298185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016232708,0.000022352877,0.0016487747,0.00005600669,0.000004742909,0.0007015945,0.00031476872,0.011136216,0.007464565,0.96677923,0.000800026,0.010909294],"study_design_scores_gemma":[0.000032532887,0.00014957965,0.0009329303,0.000054545344,0.000010537797,0.0015137208,0.00021805636,0.09949637,0.015839584,0.87345546,0.008227981,0.00006855136],"about_ca_topic_score_codex":0.0013438163,"about_ca_topic_score_gemma":0.0008564207,"teacher_disagreement_score":0.0014670019,"about_ca_system_score_codex":0.0008693467,"about_ca_system_score_gemma":0.0009141994,"threshold_uncertainty_score":0.006307602},"labels":[],"label_agreement":null},{"id":"W2107864588","doi":"10.1109/isit.2002.1023453","title":"A new family of Gold-like sequences","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complementary sequences; Sequence (biology); Gold code; Cryptography; Primitive polynomial; Mathematics; Combinatorics; Prime (order theory); Computation; Discrete mathematics; Polynomial; Finite field; Computer science; Algorithm; Code division multiple access; Spread spectrum; Telecommunications","score_opus":0.017533162429569496,"score_gpt":0.22660663739877243,"score_spread":0.20907347496920292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107864588","genre_codex":"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.62633413,0.0023825911,0.30364886,0.0011530113,0.00053377636,0.00017444271,0.0005361267,0.0006864755,0.06455051],"genre_scores_gemma":[0.89710087,0.0010228289,0.07643194,0.0007729816,0.00030442837,0.00012628677,0.000628239,0.000105579165,0.023506837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954045,0.000078419056,0.000028360468,0.00013668936,0.00014674409,0.00006936051],"domain_scores_gemma":[0.9986946,0.0003196611,0.00025516932,0.00020016744,0.00030977806,0.00022069864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040372356,0.00040178697,0.000396322,0.0010818472,0.0009637622,0.0009571963,0.0004041978,0.0006189204,0.0025410627],"category_scores_gemma":[0.0027098078,0.00019284654,0.00034572204,0.00072538236,0.0011758814,0.0017628293,0.0008405914,0.0009262952,0.00056609523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038949054,0.00007642814,0.006588682,0.00021326228,0.00003568926,0.0025305545,0.0012415858,0.011253932,0.06798585,0.80629903,0.0065620188,0.09682344],"study_design_scores_gemma":[0.000100521844,0.0007985504,0.0052460963,0.00022717092,0.00006206327,0.016993146,0.0008039163,0.11256932,0.05141468,0.66506064,0.14655077,0.00017309666],"about_ca_topic_score_codex":0.0002973574,"about_ca_topic_score_gemma":0.00026744968,"teacher_disagreement_score":0.0025410627,"about_ca_system_score_codex":0.00050451094,"about_ca_system_score_gemma":0.00046215465,"threshold_uncertainty_score":0.008500695},"labels":[],"label_agreement":null},{"id":"W2108998869","doi":"10.1109/tit.2010.2050793","title":"New Construction of $M$-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Lakehead University","funders":"","keywords":"Computer science","score_opus":0.005039821469258623,"score_gpt":0.19509263527872006,"score_spread":0.19005281380946143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108998869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.32364616,0.0012402927,0.5396895,0.0009444049,0.00061723543,0.00016827002,0.00072809967,0.0012419582,0.13172409],"genre_scores_gemma":[0.803003,0.00086215755,0.14924368,0.00048613982,0.0003842812,0.00035756998,0.0012641167,0.00061472115,0.04378435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950564,0.00015374637,0.000035393918,0.00009882566,0.00012406525,0.00008234011],"domain_scores_gemma":[0.9991736,0.000251641,0.000120203746,0.00012860229,0.00017141926,0.0001545715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006686772,0.0006255821,0.0005815967,0.0018775477,0.0010771444,0.0011131051,0.000779927,0.000619771,0.007736058],"category_scores_gemma":[0.0022280696,0.0005361392,0.00077801594,0.0008167345,0.0010476401,0.001665993,0.0019195636,0.0015136631,0.0024685864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016936865,0.00006113277,0.00087024225,0.00015583847,0.000017256583,0.0004359454,0.0005057193,0.0034374793,0.014197897,0.9200199,0.0057754433,0.054353863],"study_design_scores_gemma":[0.00009359805,0.0003004091,0.0016767912,0.0001244357,0.00003623904,0.0014703339,0.00029479808,0.054715812,0.017326577,0.87508893,0.048787374,0.0000845871],"about_ca_topic_score_codex":0.00029458618,"about_ca_topic_score_gemma":0.00042557594,"teacher_disagreement_score":0.007736058,"about_ca_system_score_codex":0.0009403882,"about_ca_system_score_gemma":0.00056955003,"threshold_uncertainty_score":0.025879681},"labels":[],"label_agreement":null},{"id":"W2109407938","doi":"10.1145/1040034.1040041","title":"ANTS VI","year":2004,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Presentation (obstetrics); Library science; Web site; Computer science; Operations research; World Wide Web; Engineering; The Internet","score_opus":0.01385975470012481,"score_gpt":0.22700332419816113,"score_spread":0.2131435694980363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109407938","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022026736,0.006300708,0.0378801,0.013442009,0.040517677,0.00046747393,0.007606634,0.008900136,0.8826826],"genre_scores_gemma":[0.013292857,0.004839765,0.023005413,0.0027930252,0.0072399424,0.00032685974,0.014049096,0.0032811165,0.93117195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978169,0.0003300465,0.00013633883,0.00033158294,0.0011962096,0.0001889652],"domain_scores_gemma":[0.99672204,0.00028423034,0.00020108449,0.00047778632,0.0013706802,0.0009441683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001520481,0.0011639628,0.0007640884,0.0022388743,0.0016689872,0.0066147,0.0020281612,0.0017607246,0.3368947],"category_scores_gemma":[0.005540309,0.00053517596,0.0010769289,0.0016770143,0.00046870523,0.0030195694,0.003638285,0.002286279,0.32514712],"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.00008645016,0.000031564017,0.00015619387,0.00017647038,0.000011603131,0.000055478948,0.00005411636,0.00055752025,0.0011934111,0.016188726,0.8763129,0.10517556],"study_design_scores_gemma":[0.000006586252,0.000016701359,0.00010292044,0.00003802675,0.0000033098934,0.000075972486,0.000018968865,0.00035079522,0.00027130515,0.0045524915,0.99455667,0.0000062546474],"about_ca_topic_score_codex":0.0008087904,"about_ca_topic_score_gemma":0.0013538181,"teacher_disagreement_score":0.3368947,"about_ca_system_score_codex":0.0013480464,"about_ca_system_score_gemma":0.0020450708,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2109539366","doi":"10.1109/tc.2007.70845","title":"Low Complexity Normal Elements over Finite Fields of Characteristic Two","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Computation; Computational complexity theory; Constructive; Finite field; Binary number; Degree (music); Algorithm; Extension (predicate logic); Distribution (mathematics); Discrete mathematics; Computer science; Arithmetic","score_opus":0.02901359929829447,"score_gpt":0.24706651915260894,"score_spread":0.21805291985431446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109539366","genre_codex":"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.8515811,0.00028235724,0.13732333,0.000563305,0.000025700008,0.0001078147,0.0005401131,0.00065851625,0.008917711],"genre_scores_gemma":[0.950478,0.00015984014,0.045885094,0.000082491424,0.00005075213,0.00007569087,0.0005944417,0.00011463202,0.0025590698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997741,0.00044045274,0.00015006543,0.0004219677,0.0008118506,0.00043458544],"domain_scores_gemma":[0.9793075,0.013903024,0.0018077516,0.003407552,0.0010298216,0.0005443661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130086,0.00052275,0.00069266476,0.0011799302,0.00064918975,0.0019038635,0.0008678627,0.00051527476,0.004237847],"category_scores_gemma":[0.013556812,0.00037842285,0.0006429979,0.0010720898,0.0018612443,0.005607898,0.0013462577,0.00120431,0.00057266204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038648054,0.0005169906,0.03630684,0.000730384,0.0001290405,0.00048122692,0.0008770954,0.30480236,0.0634308,0.43029487,0.005682089,0.15288351],"study_design_scores_gemma":[0.00014059358,0.00042389534,0.0042121275,0.000048952246,0.000038813705,0.00092784956,0.00019805723,0.40631554,0.034629915,0.5481342,0.00485362,0.000076436045],"about_ca_topic_score_codex":0.00063062704,"about_ca_topic_score_gemma":0.0010560744,"teacher_disagreement_score":0.004237847,"about_ca_system_score_codex":0.0015006526,"about_ca_system_score_gemma":0.0012851218,"threshold_uncertainty_score":0.014177084},"labels":[],"label_agreement":null},{"id":"W2110262961","doi":"10.1109/istel.2010.5734050","title":"Iterative soft decoding of Reed-Solomon codes using information correction","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; List decoding; Sequential decoding; Berlekamp–Welch algorithm; Computer science; Belief propagation; Parity-check matrix; Algorithm; Concatenated error correction code; Low-density parity-check code; Binary symmetric channel; Serial concatenated convolutional codes; Theoretical computer science; Arithmetic; Mathematics; Block code","score_opus":0.010901301754637825,"score_gpt":0.24339835382119604,"score_spread":0.2324970520665582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110262961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.012009062,0.0002902242,0.9859243,0.00008181982,0.00006525665,0.000038469603,0.00002719638,0.00046794067,0.0010957879],"genre_scores_gemma":[0.26898792,0.0004916776,0.7251209,0.0001130315,0.000087154345,0.00013851855,0.00012739355,0.00010291783,0.0048304982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990741,0.00020971156,0.00005412149,0.000093570736,0.0005032806,0.00006519376],"domain_scores_gemma":[0.99838865,0.00072010077,0.00019029617,0.00021171369,0.00043672445,0.00005253927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005629704,0.000759807,0.0006692191,0.00093036663,0.00045654151,0.0006983013,0.0009184779,0.00078313536,0.00085870345],"category_scores_gemma":[0.0026314713,0.00033155573,0.00059070333,0.0005503123,0.00068560534,0.00076803274,0.000911362,0.00096853916,0.0005180291],"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.00042392162,0.0001125556,0.0013802317,0.0004070757,0.00017660581,0.0005248715,0.00038541196,0.14934738,0.15111767,0.044967785,0.0024766258,0.64868],"study_design_scores_gemma":[0.000053869568,0.00019915735,0.00045658145,0.00003937087,0.000049122344,0.0005868621,0.000023172814,0.8625378,0.11952077,0.011355422,0.005105018,0.000072813826],"about_ca_topic_score_codex":0.0009255119,"about_ca_topic_score_gemma":0.0011216844,"teacher_disagreement_score":0.00093036663,"about_ca_system_score_codex":0.0005137831,"about_ca_system_score_gemma":0.0010221618,"threshold_uncertainty_score":0.003727734},"labels":[],"label_agreement":null},{"id":"W2110711133","doi":"10.1109/tc.2005.35","title":"A class of unidirectional bit serial systolic architectures for multiplicative inversion and division over GF(2/sup m/)","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Mathematics; Multiplicative inverse; GF(2); Division (mathematics); Cryptography; Multiplicative function; Discrete mathematics; Galois theory; Dimension (graph theory); Polynomial; Finite field arithmetic; Arithmetic; Polynomial basis; Inversion (geology); Primitive polynomial; Inverse; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.011705015567760393,"score_gpt":0.236284639021819,"score_spread":0.22457962345405863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110711133","genre_codex":"methods","genre_gemma":"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.2769316,0.0026740714,0.6776179,0.00033325312,0.0003564254,0.00029236107,0.00045765445,0.004461374,0.03687537],"genre_scores_gemma":[0.73916036,0.0013429513,0.24076976,0.00023683916,0.00013400441,0.00023905093,0.0006583475,0.000095532,0.0173632],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998603,0.000020390016,0.0000109876255,0.000028046674,0.000050428298,0.000029929222],"domain_scores_gemma":[0.99983335,0.000027321303,0.000030968302,0.000037154594,0.000050806982,0.000020365058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017405771,0.0004313779,0.00027846498,0.00040129395,0.00032160606,0.0005634167,0.00048718022,0.0002527987,0.0026111433],"category_scores_gemma":[0.0003527287,0.00013847667,0.00027788282,0.00037966025,0.000323674,0.0006111393,0.00035750927,0.00042227414,0.0007289581],"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.0005491384,0.00018990533,0.0021356875,0.0004051182,0.000068005735,0.00054926303,0.00021806044,0.027160946,0.18965115,0.12407511,0.008805714,0.64619195],"study_design_scores_gemma":[0.0003351628,0.002737273,0.0050459425,0.00029133394,0.00023777643,0.004602171,0.0002622442,0.36585772,0.32086524,0.10264714,0.19697295,0.00014513041],"about_ca_topic_score_codex":0.00022963915,"about_ca_topic_score_gemma":0.00052226486,"teacher_disagreement_score":0.0026111433,"about_ca_system_score_codex":0.00029844177,"about_ca_system_score_gemma":0.0004887776,"threshold_uncertainty_score":0.00873512},"labels":[],"label_agreement":null},{"id":"W2110869001","doi":"","title":"CIRI-CIRI POLINOMIAL PERMUTASI ATAS FINITE FIELD","year":2013,"lang":"id","type":"article","venue":"UG Jurnal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.014003708633881696,"score_gpt":0.22950422603424603,"score_spread":0.21550051740036433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110869001","genre_codex":"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.118818924,0.007038271,0.41684666,0.006767077,0.0037742916,0.0005625008,0.0028062318,0.0029014738,0.44048455],"genre_scores_gemma":[0.7084562,0.0051492834,0.12757196,0.0019111439,0.0018713588,0.00052493793,0.0023783597,0.00051090535,0.15162595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987031,0.00027625187,0.00009060944,0.00030729288,0.0004240464,0.00019867015],"domain_scores_gemma":[0.9978745,0.00055260287,0.00020618721,0.00069284375,0.00058405416,0.000089837515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012347514,0.000512828,0.00041862504,0.0011767094,0.0011517215,0.0019197892,0.00045525862,0.000525378,0.017605297],"category_scores_gemma":[0.0031807036,0.00023126311,0.00044924606,0.0013864633,0.0015859848,0.002313829,0.0011500234,0.0014528269,0.0066014067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005746137,0.00013616224,0.0025640957,0.0005045107,0.00004288206,0.00059302466,0.00075993675,0.0030885306,0.04312219,0.61246735,0.03231595,0.30383083],"study_design_scores_gemma":[0.00011736114,0.00062558765,0.0036242856,0.0002728364,0.00008392751,0.0031823362,0.000592951,0.012348399,0.081626244,0.32314202,0.5742715,0.0001125288],"about_ca_topic_score_codex":0.0007866908,"about_ca_topic_score_gemma":0.00077910064,"teacher_disagreement_score":0.017605297,"about_ca_system_score_codex":0.0011575542,"about_ca_system_score_gemma":0.0015709006,"threshold_uncertainty_score":0.058895588},"labels":[],"label_agreement":null},{"id":"W2111124108","doi":"10.1109/iscas.2008.4541418","title":"The application of lattice-reduction to the K-Best algorithm for near-optimal MIMO detection","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lattice reduction; Scalability; Computer science; Reduction (mathematics); MIMO; A priori and a posteriori; Algorithm; Very-large-scale integration; Lattice (music); Computational complexity theory; Communication complexity; Sorting; Random access; Parallel computing; Theoretical computer science; Mathematics; Channel (broadcasting); Telecommunications","score_opus":0.015574177502245027,"score_gpt":0.24457235455965437,"score_spread":0.22899817705740935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111124108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.010221201,0.00014882293,0.98547757,0.0001177201,0.000048413516,0.000029680145,0.000030087076,0.0005545211,0.0033719207],"genre_scores_gemma":[0.19611152,0.00013359798,0.8011283,0.000081601946,0.00003645277,0.00006029185,0.00007847913,0.00005059557,0.0023192083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959093,0.00014534876,0.000018811295,0.00004985897,0.0001502895,0.00004474908],"domain_scores_gemma":[0.9996561,0.00014116417,0.000030500578,0.00008880396,0.000062010346,0.00002146438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039110036,0.0003959987,0.00067878986,0.00043552238,0.0004988111,0.0007299686,0.0007833891,0.000462006,0.0024912402],"category_scores_gemma":[0.0011630268,0.00022109383,0.00041706543,0.0005813811,0.0006313951,0.00077893096,0.0008405229,0.0007643277,0.0011652147],"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.00043176883,0.00020489245,0.0006925779,0.00026154984,0.00008799356,0.00031298373,0.0001795108,0.19994962,0.09568813,0.15395615,0.007033812,0.541201],"study_design_scores_gemma":[0.00004972731,0.00015598723,0.00014577026,0.000014095828,0.000013513436,0.00041490735,0.000031550986,0.9225341,0.03641574,0.034007616,0.0061750365,0.00004188426],"about_ca_topic_score_codex":0.0007240208,"about_ca_topic_score_gemma":0.001495607,"teacher_disagreement_score":0.0024912402,"about_ca_system_score_codex":0.00043144537,"about_ca_system_score_gemma":0.0009872717,"threshold_uncertainty_score":0.008334041},"labels":[],"label_agreement":null},{"id":"W2111124811","doi":"10.1109/ecctd.2009.5274961","title":"High speed VLSI implementation of a finite field multiplier using redundant representation","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Computer science; Electronic engineering; Finite field; Clock rate; CMOS; Domino logic; Logic synthesis; Integrated circuit design; Arithmetic; Logic gate; Embedded system; Mathematics; Algorithm; Logic family; Engineering","score_opus":0.029720815596601054,"score_gpt":0.32270169311479024,"score_spread":0.2929808775181892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111124811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.27771977,0.0010612374,0.7039311,0.00036337713,0.0002946264,0.0001764591,0.00023193606,0.0034045852,0.012816914],"genre_scores_gemma":[0.65168333,0.00040048826,0.3407486,0.00012990461,0.000098873345,0.000094309806,0.00030193446,0.000048235986,0.0064943302],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991524,0.000015834295,0.000008075344,0.00001574398,0.000029492334,0.000015653524],"domain_scores_gemma":[0.99986506,0.000033909142,0.000025195364,0.000024502226,0.00004095973,0.000010388162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017313243,0.00030857566,0.00024351131,0.0003999845,0.00029851007,0.00033220657,0.00058340747,0.0002623006,0.004054211],"category_scores_gemma":[0.00031979117,0.00015781683,0.00024357004,0.00032026682,0.00016284507,0.0005136441,0.00016621937,0.00027296224,0.000722418],"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.0005069391,0.00013702852,0.0009418856,0.00034082806,0.000104837214,0.0009099268,0.00017110493,0.010212826,0.6839908,0.020405812,0.0037041355,0.27857396],"study_design_scores_gemma":[0.0004688956,0.0046698498,0.003756929,0.00014115933,0.0003802679,0.006355685,0.00012882204,0.21198343,0.69044155,0.010771458,0.07074347,0.00015851214],"about_ca_topic_score_codex":0.0002556881,"about_ca_topic_score_gemma":0.0005593029,"teacher_disagreement_score":0.004054211,"about_ca_system_score_codex":0.00025585416,"about_ca_system_score_gemma":0.00029474797,"threshold_uncertainty_score":0.013562739},"labels":[],"label_agreement":null},{"id":"W2111916081","doi":"10.1109/isit.1994.394851","title":"Fast parallel algorithms for decoding Reed-Solomon codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Berlekamp–Welch algorithm; Remainder; Parallel algorithm; Reed–Solomon error correction; List decoding; Parallel computing; Arithmetic; Sequential decoding; Mathematics; Concatenated error correction code; Block code","score_opus":0.047405293368868215,"score_gpt":0.26151064668241397,"score_spread":0.21410535331354574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111916081","genre_codex":"methods","genre_gemma":"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.0072023124,0.0010713438,0.9810688,0.000242377,0.00020180561,0.00011610603,0.00018780024,0.002447874,0.007461584],"genre_scores_gemma":[0.07615686,0.0017851578,0.90570825,0.00014918567,0.0002451483,0.0004210002,0.0009386907,0.0004500624,0.014145712],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989606,0.00018420855,0.000077736666,0.00014895514,0.00052292144,0.000105530766],"domain_scores_gemma":[0.9989999,0.00036144935,0.00007591623,0.00017360914,0.00035792482,0.0000313138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008045151,0.0013253663,0.0007136743,0.0012872043,0.000843811,0.0015683747,0.0011084687,0.0009496577,0.008747295],"category_scores_gemma":[0.0032343916,0.00060163287,0.00068236433,0.001499543,0.0006119743,0.002300583,0.0011396642,0.0012912946,0.004931544],"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.00040991625,0.00011563713,0.00048206383,0.00041703793,0.00006487855,0.00017957365,0.00025440883,0.119469896,0.01962455,0.1255159,0.019458158,0.71400803],"study_design_scores_gemma":[0.0003317712,0.0002491977,0.00039271492,0.00010940227,0.00007291203,0.0005303469,0.00010586463,0.67387617,0.041166376,0.21237141,0.07069575,0.00009797604],"about_ca_topic_score_codex":0.0015305862,"about_ca_topic_score_gemma":0.0022894647,"teacher_disagreement_score":0.008747295,"about_ca_system_score_codex":0.0010611224,"about_ca_system_score_gemma":0.0013318984,"threshold_uncertainty_score":0.029262662},"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":"W2112574687","doi":"10.1007/3-540-46416-6_31","title":"Enumerating Nondegenerate Permutations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Combinatorics; Mathematics; Cryptosystem; Block (permutation group theory); Discrete mathematics; Physics; Cryptography; Algorithm","score_opus":0.0248043449733415,"score_gpt":0.2623609242255619,"score_spread":0.2375565792522204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112574687","genre_codex":"methods","genre_gemma":"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.08131703,0.0037764683,0.7106573,0.0018576209,0.0008321809,0.00020758157,0.0016096281,0.0023935838,0.19734865],"genre_scores_gemma":[0.29092073,0.0049349885,0.525627,0.0009183765,0.00052584126,0.00044530083,0.005019438,0.0013597944,0.17024864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883217,0.0002479599,0.00008776369,0.00019413693,0.0005046196,0.00013332545],"domain_scores_gemma":[0.9976399,0.0012763444,0.00009119913,0.0006762053,0.00024591992,0.00007036457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095913804,0.001165576,0.0011178566,0.0024207018,0.0014231035,0.0030322832,0.0020250925,0.001269547,0.013139178],"category_scores_gemma":[0.004486938,0.0007848436,0.0010717926,0.0038275388,0.0017665034,0.0064984704,0.003254336,0.0035513954,0.0052036433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000805856,0.000071004855,0.00050857454,0.00033838846,0.000021462365,0.00009961418,0.0003205735,0.0049822847,0.0035871747,0.7209526,0.012564369,0.25647345],"study_design_scores_gemma":[0.00001045667,0.000017436969,0.00014476856,0.00008288573,0.000015246088,0.00020597907,0.00004541079,0.00685404,0.00266983,0.9666844,0.023254836,0.000014790929],"about_ca_topic_score_codex":0.00045718168,"about_ca_topic_score_gemma":0.001123504,"teacher_disagreement_score":0.013139178,"about_ca_system_score_codex":0.0013165546,"about_ca_system_score_gemma":0.0012857199,"threshold_uncertainty_score":0.04395497},"labels":[],"label_agreement":null},{"id":"W2112729878","doi":"10.1109/isit.2010.5513718","title":"A new class of ternary and quaternary sequences with two-level autocorrelation","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Hadamard transform; Autocorrelation; Golomb coding; Decimation; Complementary sequences; Pseudorandom number generator; Mathematics; Combinatorics; Algorithm; Computer science; Statistics; Artificial intelligence; Telecommunications","score_opus":0.014802321738436082,"score_gpt":0.23544762081390372,"score_spread":0.22064529907546765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112729878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.35203287,0.0067273495,0.5773395,0.0008706883,0.0010784504,0.0002802668,0.0010593059,0.0011946126,0.059417114],"genre_scores_gemma":[0.84475195,0.0017983102,0.12540244,0.000651681,0.0006204593,0.00022596148,0.0011341872,0.00013858627,0.025276437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995834,0.000046171073,0.000028991157,0.00009873538,0.00015687828,0.00008582001],"domain_scores_gemma":[0.99915814,0.0001746324,0.0001833776,0.00016408887,0.00022526293,0.00009448964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028245413,0.00039436447,0.0004299638,0.0010359244,0.0007029638,0.0007705887,0.00038041797,0.0006374834,0.0026984352],"category_scores_gemma":[0.0013826124,0.00014360218,0.000387521,0.00095437834,0.00065085746,0.0010150094,0.0004911527,0.00069172547,0.0009003746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076835003,0.00016913425,0.0035581905,0.00045433623,0.000037329686,0.0015949935,0.00058892736,0.01573702,0.18672772,0.49958318,0.00970466,0.28107616],"study_design_scores_gemma":[0.00026143814,0.0013133329,0.0075195353,0.00023630413,0.000098778466,0.010776832,0.00028889783,0.26411718,0.15670276,0.25332206,0.30506265,0.00030027734],"about_ca_topic_score_codex":0.00040538283,"about_ca_topic_score_gemma":0.0003741197,"teacher_disagreement_score":0.0026984352,"about_ca_system_score_codex":0.0004570022,"about_ca_system_score_gemma":0.0006460715,"threshold_uncertainty_score":0.009027123},"labels":[],"label_agreement":null},{"id":"W2113594177","doi":"10.1109/tit.2009.2032818","title":"${\\BBZ}_4$-Valued Quadratic Forms and Quaternary Sequence Families","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sequence (biology); Algorithm; Computer science; Combinatorics; Mathematics; Biology; Genetics","score_opus":0.01237484903717348,"score_gpt":0.2342085310195714,"score_spread":0.22183368198239792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113594177","genre_codex":"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.5309478,0.0010663698,0.37433338,0.0010468,0.0003923124,0.00008175302,0.0005538282,0.0003102647,0.091267474],"genre_scores_gemma":[0.92650485,0.000657443,0.045589246,0.0003071287,0.000288521,0.00008392365,0.00043450354,0.00017424827,0.025960106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994758,0.00014028096,0.000024346997,0.00009610002,0.0001641498,0.00009933502],"domain_scores_gemma":[0.99914646,0.0002406736,0.00017850581,0.00009315892,0.00024400713,0.00009705545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006751431,0.0004510502,0.00037397598,0.0017138346,0.0009890368,0.0012678619,0.00052621594,0.0005408085,0.009608494],"category_scores_gemma":[0.0022988282,0.00018687198,0.00034308783,0.0012634986,0.0014135324,0.0023306345,0.00076827605,0.00087311055,0.0018395256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056675384,0.00001770589,0.00053834065,0.000043564647,0.000004327279,0.000090733425,0.0001767258,0.0033434397,0.0014681234,0.96880543,0.0020696523,0.023385305],"study_design_scores_gemma":[0.000011025668,0.00006298521,0.0008958998,0.000031732387,0.000004999463,0.00049902126,0.00017950825,0.031432852,0.0020428773,0.9499181,0.014880566,0.000040425177],"about_ca_topic_score_codex":0.0007023354,"about_ca_topic_score_gemma":0.00053266756,"teacher_disagreement_score":0.009608494,"about_ca_system_score_codex":0.00076951477,"about_ca_system_score_gemma":0.00039272048,"threshold_uncertainty_score":0.032143652},"labels":[],"label_agreement":null},{"id":"W2113785162","doi":"10.1109/iscas.1990.112396","title":"Improved cellular structures for bit-steered ROM finite ring systolic arrays","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Pipeline (software); Computation; Computer science; Spice; Ring (chemistry); Logic gate; Latency (audio); Parallel computing; Bit (key); CMOS; Word (group theory); Computer hardware; Algorithm; Computational science; Electronic engineering; Mathematics; Engineering","score_opus":0.021173163959831754,"score_gpt":0.21029382068510596,"score_spread":0.1891206567252742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113785162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.0631579,0.0005887543,0.91223603,0.00026425286,0.00023734143,0.0000810487,0.00013708421,0.0011400377,0.022157399],"genre_scores_gemma":[0.409054,0.0006669191,0.56832176,0.00018299588,0.00011256708,0.00017326428,0.00024067535,0.000105490944,0.021142285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998104,0.000053342483,0.000015542806,0.000024006475,0.00007368553,0.000023147782],"domain_scores_gemma":[0.9996432,0.000085009,0.000039407434,0.000100171186,0.00011335231,0.000018860206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016978868,0.000248016,0.00022815663,0.00031841092,0.00030408957,0.00074476,0.0006525792,0.00032335942,0.0045734737],"category_scores_gemma":[0.0009645811,0.00012108462,0.00020049386,0.0004182136,0.00038287873,0.0006822603,0.0004795678,0.00038988047,0.0016867202],"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.00030594235,0.000066797,0.0003970115,0.00018179952,0.000019341951,0.00029783562,0.00024473135,0.09114284,0.09636385,0.5452016,0.0044041756,0.261374],"study_design_scores_gemma":[0.00011464192,0.00094754016,0.00050886604,0.00010228243,0.000052756488,0.00076580804,0.0001975027,0.58141166,0.12079073,0.13298437,0.16203783,0.000085958774],"about_ca_topic_score_codex":0.0008178026,"about_ca_topic_score_gemma":0.0018407125,"teacher_disagreement_score":0.0045734737,"about_ca_system_score_codex":0.0005950516,"about_ca_system_score_gemma":0.0003759411,"threshold_uncertainty_score":0.015299737},"labels":[],"label_agreement":null},{"id":"W2114064510","doi":"10.1109/pacrim.2011.6033011","title":"Multicarrier error correction using T-codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Code word; Computer science; Code (set theory); Algorithm; Error detection and correction; Transmission (telecommunications); Forward error correction; Variable (mathematics); Domain (mathematical analysis); Decoding methods; Discrete mathematics; Theoretical computer science; Mathematics; Telecommunications; Programming language","score_opus":0.07120405676965574,"score_gpt":0.2644219022569285,"score_spread":0.19321784548727278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114064510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.023653664,0.0020656402,0.96551794,0.00036486803,0.00020774094,0.00008787258,0.00007525565,0.00045174581,0.0075753187],"genre_scores_gemma":[0.665284,0.0040132618,0.32198983,0.00032307737,0.00024974532,0.00019907086,0.0001606451,0.000102767764,0.0076776547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832875,0.0004938671,0.000097235126,0.00024763407,0.0005959817,0.00023646723],"domain_scores_gemma":[0.99789834,0.0007691303,0.00031263096,0.00043464484,0.0005294364,0.000055709188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008786429,0.000754926,0.00069178606,0.0009572119,0.0007229287,0.0011662202,0.0011649899,0.0011423129,0.0013941547],"category_scores_gemma":[0.0043933815,0.0002080929,0.0007395116,0.0016531085,0.001170409,0.0017684123,0.0013465355,0.00087751506,0.00083954347],"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.00058935664,0.000087608896,0.0012976517,0.00072293833,0.00014577003,0.00077461015,0.0004760634,0.38271356,0.03954271,0.39196905,0.0030643817,0.17861623],"study_design_scores_gemma":[0.00007947067,0.00022192931,0.00027533236,0.00014245012,0.000054167886,0.00065726583,0.00007327349,0.87731373,0.030519404,0.075750954,0.014830761,0.00008128586],"about_ca_topic_score_codex":0.0036807118,"about_ca_topic_score_gemma":0.0024239179,"teacher_disagreement_score":0.0036807118,"about_ca_system_score_codex":0.0010791266,"about_ca_system_score_gemma":0.001648523,"threshold_uncertainty_score":0.007829666},"labels":[],"label_agreement":null},{"id":"W2114412781","doi":"10.1016/j.jsc.2011.08.006","title":"Detecting lacunary perfect powers and computing their roots","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Polynomial; Integer (computer science); Combinatorics; Computation; Randomized algorithm; Representation (politics); Conjecture; Discrete mathematics; Algorithm; Mathematical analysis; Computer science","score_opus":0.021891256590385367,"score_gpt":0.23571256640937882,"score_spread":0.21382130981899344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114412781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.73376817,0.000833373,0.24641304,0.0014937407,0.00017936587,0.000115548384,0.0003809208,0.0009871688,0.015828548],"genre_scores_gemma":[0.96327347,0.00012712358,0.033482097,0.000110618384,0.000056448363,0.000021761412,0.00014197506,0.00010680191,0.0026796611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977647,0.000440878,0.00017137208,0.00048537855,0.00071508967,0.00042252944],"domain_scores_gemma":[0.9887944,0.0067775827,0.0009789171,0.002050871,0.00092005526,0.00047824657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017222671,0.0007999296,0.0011676007,0.002103402,0.0013150739,0.002968436,0.0013648096,0.0013391007,0.004425051],"category_scores_gemma":[0.02206278,0.00063097547,0.0005266477,0.0014707331,0.0037680476,0.007533742,0.0038006161,0.0018437499,0.0009731241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031911933,0.00024784528,0.021265056,0.00053629786,0.00015103826,0.0015033423,0.0025025448,0.028220365,0.04406044,0.624843,0.00598906,0.26748976],"study_design_scores_gemma":[0.00011191512,0.00021011721,0.0012517301,0.00007370871,0.00005698517,0.0005624358,0.0006494568,0.061385397,0.02334451,0.9082269,0.004075486,0.000051289906],"about_ca_topic_score_codex":0.0006179284,"about_ca_topic_score_gemma":0.0010055983,"teacher_disagreement_score":0.004425051,"about_ca_system_score_codex":0.0009423515,"about_ca_system_score_gemma":0.0010324533,"threshold_uncertainty_score":0.01480329},"labels":[],"label_agreement":null},{"id":"W2115470417","doi":"10.1109/acssc.2004.1399512","title":"A family of rate 1/2 modified binary block repetition codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Block code; Linear code; Concatenated error correction code; Hamming code; Mathematics; Algorithm; Decoding methods; Encoder; Block (permutation group theory); Binary number; Discrete mathematics; Computer science; Arithmetic; Combinatorics; Statistics","score_opus":0.0173814297407639,"score_gpt":0.23082777630645654,"score_spread":0.21344634656569264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115470417","genre_codex":"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.18384197,0.001950555,0.8011069,0.000337247,0.00011892527,0.00014404913,0.0003538234,0.00067375856,0.011472715],"genre_scores_gemma":[0.70294476,0.0013224954,0.2852249,0.00022530016,0.00013152487,0.0002941872,0.00048750723,0.00010646486,0.009262778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995134,0.00012723664,0.000029186302,0.00008428327,0.00018301784,0.000062836705],"domain_scores_gemma":[0.9989247,0.00024577772,0.0002813465,0.00021837167,0.0002669042,0.000062945284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004796864,0.00040409318,0.00035185076,0.00057982194,0.00031280812,0.0004009727,0.00056864036,0.00041809943,0.0010831305],"category_scores_gemma":[0.0020924679,0.00020226576,0.00037414534,0.00046897714,0.00049047155,0.0007088275,0.00042438187,0.00055180636,0.00046060325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062531023,0.00009156656,0.003342915,0.00037029508,0.000107415515,0.0011250959,0.00039829384,0.19744404,0.15982464,0.37318748,0.004565882,0.25891715],"study_design_scores_gemma":[0.00011305283,0.0008206675,0.0021998517,0.00008833193,0.00009091704,0.0037195624,0.00005771284,0.77387875,0.085646145,0.07571204,0.05751803,0.00015494681],"about_ca_topic_score_codex":0.00037117308,"about_ca_topic_score_gemma":0.00035745132,"teacher_disagreement_score":0.0010831305,"about_ca_system_score_codex":0.00036962502,"about_ca_system_score_gemma":0.0005317562,"threshold_uncertainty_score":0.003623426},"labels":[],"label_agreement":null},{"id":"W2115938507","doi":"10.1109/tit.2007.915972","title":"Guided Scrambling Polynomials for Periodic Quotient Relationship Patterns","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scrambling; Quotient; Encoder; Code word; Mathematics; Discrete mathematics; Coding (social sciences); Unit interval; Algorithm; Computer science; Arithmetic; Combinatorics; Decoding methods; Statistics","score_opus":0.03989844807251743,"score_gpt":0.25606012661305605,"score_spread":0.2161616785405386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115938507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.1253633,0.0004912256,0.8511146,0.0002012008,0.00006434003,0.00009260856,0.00012167746,0.00019847063,0.022352712],"genre_scores_gemma":[0.81093293,0.00083998725,0.17745939,0.00014409063,0.00007625823,0.00008622313,0.0001618765,0.000098806384,0.01020045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974054,0.000058460893,0.000011359433,0.000035664863,0.00011078809,0.00004315539],"domain_scores_gemma":[0.99952877,0.00015897788,0.00009765104,0.00009133634,0.00009744257,0.000025821311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002418018,0.0003438367,0.00019552195,0.00037100716,0.00021897577,0.00040804388,0.0003431462,0.00036777847,0.0024536594],"category_scores_gemma":[0.001678288,0.00013506398,0.00027969957,0.000494107,0.00061387924,0.0005755981,0.00041544248,0.0004983088,0.00083740475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010514669,0.000041106985,0.0004692504,0.00016077483,0.000011290791,0.000625427,0.00032735252,0.054893717,0.07285456,0.7756642,0.0024191942,0.09242788],"study_design_scores_gemma":[0.0000416426,0.00017937002,0.0008717126,0.00006184696,0.000015713827,0.0016699979,0.00013569031,0.66705835,0.038466237,0.27483898,0.016590731,0.00006976923],"about_ca_topic_score_codex":0.0006046094,"about_ca_topic_score_gemma":0.0007699868,"teacher_disagreement_score":0.0024536594,"about_ca_system_score_codex":0.00029962833,"about_ca_system_score_gemma":0.00041630017,"threshold_uncertainty_score":0.008208275},"labels":[],"label_agreement":null},{"id":"W2116143063","doi":"","title":"The LLL algorithm using fast givens","year":2011,"lang":"en","type":"article","venue":"IEEE Asia-Pacific Conference on Synthetic Aperture Radar","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lattice reduction; Basis (linear algebra); Lattice (music); Lattice problem; Reduction (mathematics); Algorithm; Time complexity; Mathematics; Cryptography; Polynomial; Computer science; Discrete mathematics; Statistics","score_opus":0.040448986740992635,"score_gpt":0.23656863290330082,"score_spread":0.1961196461623082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116143063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.0074591106,0.0008019812,0.96642715,0.0008367538,0.00023645995,0.00024287608,0.00055234757,0.006311579,0.017131774],"genre_scores_gemma":[0.14912497,0.00057972904,0.82752186,0.0005449162,0.00023596999,0.0005964626,0.0019862205,0.0008412819,0.018568693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969001,0.0007340405,0.0002611366,0.0005788015,0.001095719,0.00043026646],"domain_scores_gemma":[0.99616015,0.0010913837,0.0002761488,0.0014036864,0.000918071,0.00015063645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017552368,0.00093655,0.0014298141,0.0021224702,0.0012555777,0.0032610819,0.0020673748,0.0015423894,0.021350777],"category_scores_gemma":[0.009602222,0.0005376829,0.00079756364,0.0030200076,0.0014592897,0.0047279494,0.003634776,0.0020398176,0.010199957],"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.00066477986,0.00018331701,0.0008419508,0.0005012096,0.000035776473,0.00015501693,0.00020322349,0.049025055,0.006524649,0.21928252,0.030228024,0.6923544],"study_design_scores_gemma":[0.0003366711,0.00026925947,0.000333811,0.00024098404,0.000040024916,0.0005015495,0.00013938955,0.51492023,0.01696956,0.3699785,0.09616446,0.000105584135],"about_ca_topic_score_codex":0.0021001648,"about_ca_topic_score_gemma":0.0020629026,"teacher_disagreement_score":0.021350777,"about_ca_system_score_codex":0.0020998358,"about_ca_system_score_gemma":0.0025971048,"threshold_uncertainty_score":0.07142544},"labels":[],"label_agreement":null},{"id":"W2116408881","doi":"10.1145/2517300.2517305","title":"Efficient hardware implementation of the stream cipher WG-16 with composite field arithmetic","year":2013,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stream cipher; Field-programmable gate array; Arithmetic; Cryptography; Cipher; Field (mathematics); Parallel computing; Algorithm; Computer hardware; Mathematics; Encryption","score_opus":0.006045410193124273,"score_gpt":0.22410263957398222,"score_spread":0.21805722938085795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116408881","genre_codex":"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.43014282,0.00056887313,0.5484874,0.00022416376,0.0001440314,0.0003073991,0.0003444546,0.0037515278,0.016029404],"genre_scores_gemma":[0.86498046,0.0001883135,0.13050349,0.00005756601,0.00003458049,0.00009673933,0.00046660786,0.00006084956,0.0036114028],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982554,0.0000276011,0.000020930633,0.000024821536,0.00006223268,0.000038870596],"domain_scores_gemma":[0.9998355,0.00003275719,0.000029182067,0.00005221686,0.000037395694,0.000012874008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024012008,0.00047498193,0.00032319574,0.0005357009,0.00024869345,0.00045647623,0.0005211473,0.00020408597,0.0028128857],"category_scores_gemma":[0.00040243802,0.0001848369,0.0003426111,0.00045875084,0.00029561506,0.00091517944,0.00038566193,0.00034686353,0.0007521306],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001673809,0.0002661689,0.0034980036,0.00054880435,0.00010398215,0.000990048,0.00025753162,0.07307738,0.5020439,0.06727742,0.0066199736,0.34364304],"study_design_scores_gemma":[0.00041065077,0.0020951,0.003364282,0.00007462362,0.00011365123,0.0013206953,0.00009000341,0.44588387,0.49578917,0.017547194,0.033240028,0.00007075776],"about_ca_topic_score_codex":0.00038780426,"about_ca_topic_score_gemma":0.0005691409,"teacher_disagreement_score":0.0028128857,"about_ca_system_score_codex":0.0003938875,"about_ca_system_score_gemma":0.00080825604,"threshold_uncertainty_score":0.009410083},"labels":[],"label_agreement":null},{"id":"W2117718425","doi":"10.1109/isit.2003.1228268","title":"Highly nonlinear s-boxes with reduced bound on maximum correlation (extended abstract)","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correlation attack; Upper and lower bounds; Stream cipher; Mathematics; Hadamard transform; Nonlinear system; Combinatorics; Algebraic number; Function (biology); Order (exchange); Discrete mathematics; Cryptography; Algorithm; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.01173066988507863,"score_gpt":0.22883528884066212,"score_spread":0.2171046189555835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117718425","genre_codex":"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.37453732,0.0007625661,0.60569036,0.00076680526,0.00006944696,0.000078985366,0.00014619222,0.00032090154,0.017627336],"genre_scores_gemma":[0.9498392,0.00032623732,0.046060245,0.0001418231,0.0000594648,0.00007925538,0.00005365183,0.000029435076,0.003410715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992461,0.00020707285,0.000044718887,0.00011564525,0.00026032366,0.00012627918],"domain_scores_gemma":[0.99792767,0.0011086434,0.00032125352,0.0003496241,0.00020212283,0.00009071029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094774546,0.0005990843,0.0005882927,0.00041211434,0.00044767992,0.0010974105,0.00055540237,0.000949973,0.00272951],"category_scores_gemma":[0.0024629743,0.00031642366,0.0005147014,0.00039177146,0.0019901737,0.0018102662,0.0011942778,0.0012427783,0.0005283429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006482519,0.00008052018,0.0013172744,0.00024491115,0.0000650597,0.00053413375,0.00021832305,0.1501697,0.086148836,0.73805606,0.0012049386,0.021312034],"study_design_scores_gemma":[0.00010980525,0.0002890035,0.00065540953,0.000053417312,0.000048093858,0.00046662,0.000048589958,0.5899635,0.08750631,0.31593838,0.004847733,0.00007316141],"about_ca_topic_score_codex":0.00028995125,"about_ca_topic_score_gemma":0.00022972828,"teacher_disagreement_score":0.00272951,"about_ca_system_score_codex":0.000870129,"about_ca_system_score_gemma":0.00047175656,"threshold_uncertainty_score":0.009131134},"labels":[],"label_agreement":null},{"id":"W2118738916","doi":"10.1155/s111086570220414x","title":"Low-Complexity Versatile Finite Field Multiplier in Normal Basis","year":2002,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Lethbridge","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Computer science; Pipeline (software); Finite field; Basis (linear algebra); Arithmetic; Computational science; Computer hardware; Computer architecture; Mathematics; Embedded system; Discrete mathematics","score_opus":0.027146521306878724,"score_gpt":0.268918607304453,"score_spread":0.24177208599757427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118738916","genre_codex":"methods","genre_gemma":"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.08828315,0.0007165964,0.8917197,0.00025204316,0.00018544662,0.00010299221,0.00016153147,0.0014000068,0.017178517],"genre_scores_gemma":[0.5793024,0.00050246704,0.40593752,0.00013716877,0.00011521087,0.00011004806,0.00029681847,0.000076060096,0.013522324],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986005,0.00003187854,0.000009108547,0.000030130574,0.000045427438,0.000023451306],"domain_scores_gemma":[0.9998528,0.000031699656,0.00002062083,0.000028266679,0.000050869738,0.000015741287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021759691,0.00038334882,0.0003737803,0.00042687717,0.000391276,0.00046287506,0.0006360763,0.00032579375,0.0052122525],"category_scores_gemma":[0.00040737833,0.00019860035,0.00026669112,0.00061424036,0.00024202162,0.0009225458,0.00040990242,0.0005008641,0.0013416857],"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.00083085743,0.00010724326,0.00078944094,0.00044962353,0.000068615394,0.0006688053,0.0002070987,0.021636574,0.42976812,0.15827139,0.00855108,0.3786512],"study_design_scores_gemma":[0.00029072163,0.002923846,0.0015188566,0.00014162413,0.00018230513,0.0047885245,0.00014075307,0.32989433,0.44065836,0.098078914,0.12118168,0.00020011954],"about_ca_topic_score_codex":0.00022839037,"about_ca_topic_score_gemma":0.00046054224,"teacher_disagreement_score":0.0052122525,"about_ca_system_score_codex":0.000323201,"about_ca_system_score_gemma":0.00040797621,"threshold_uncertainty_score":0.017436683},"labels":[],"label_agreement":null},{"id":"W2118962918","doi":"10.1016/s0012-365x(03)00280-2","title":"Splitting systems and separating systems","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016749313579064496,"score_gpt":0.24829603083223578,"score_spread":0.23154671725317127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118962918","genre_codex":"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.3087342,0.00540189,0.28321654,0.00708862,0.0012555926,0.00008775695,0.0005216465,0.00043648094,0.39325723],"genre_scores_gemma":[0.89697385,0.0021629396,0.026394386,0.0011079691,0.0008230222,0.000091525384,0.00051254866,0.00018813042,0.071745686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996406,0.00009238085,0.000018134693,0.00007841255,0.00010460707,0.000065909946],"domain_scores_gemma":[0.9992679,0.00028591038,0.00009199454,0.00015186862,0.00010758821,0.00009481596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005531813,0.00051850977,0.0005701567,0.0010864395,0.0018796675,0.0020369715,0.0006073991,0.0012205999,0.011759393],"category_scores_gemma":[0.0018064341,0.00041032812,0.00047648977,0.0011787416,0.002757195,0.004851046,0.00225088,0.0029855429,0.0014785898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006785651,0.0000031196537,0.000027104757,0.000007571716,0.0000013354056,0.0000062782988,0.000059030343,0.00018549983,0.00020545318,0.9969427,0.0006871533,0.0018679281],"study_design_scores_gemma":[0.0000024044257,0.0000021505787,0.000029644309,0.0000024834299,0.0000011488713,0.000017908786,0.000019950288,0.0007026588,0.00010951144,0.9971113,0.0019987652,0.0000020188254],"about_ca_topic_score_codex":0.00044096238,"about_ca_topic_score_gemma":0.0003398792,"teacher_disagreement_score":0.011759393,"about_ca_system_score_codex":0.00078855135,"about_ca_system_score_gemma":0.00045733422,"threshold_uncertainty_score":0.039339125},"labels":[],"label_agreement":null},{"id":"W2119112132","doi":"10.1109/isit.2003.1228394","title":"Trace representation of binary e-th residue sequences of period p","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Period (music); Residue (chemistry); Binary number; TRACE (psycholinguistics); Representation (politics); Mathematics; Computer science; Chemistry; Arithmetic; Art; Philosophy; Political science; Organic chemistry","score_opus":0.02266298923944488,"score_gpt":0.26754272573814025,"score_spread":0.24487973649869538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119112132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7283183,0.00037634163,0.22129166,0.0009521657,0.00038245594,0.0000704731,0.0003188668,0.00064934965,0.0476404],"genre_scores_gemma":[0.9725136,0.0002167798,0.01151036,0.00013125157,0.00017463788,0.000032211516,0.00021688319,0.00012334567,0.015080903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997131,0.000054545686,0.000015927439,0.000040523544,0.00009528871,0.00008046989],"domain_scores_gemma":[0.9993518,0.00018234437,0.00011776385,0.000115403076,0.00012437011,0.00010828014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003914754,0.0005455428,0.00035270027,0.0013506339,0.0006545731,0.0017216507,0.0006471654,0.00096873933,0.0067379973],"category_scores_gemma":[0.0021053366,0.00014538657,0.0003250061,0.0008171121,0.0008367036,0.0016685288,0.00075234455,0.0010891743,0.0008661655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037402278,0.00008707258,0.00039170944,0.00004144201,0.000008200014,0.00029961485,0.00030673758,0.0036765796,0.013455387,0.9539771,0.0012144748,0.026167523],"study_design_scores_gemma":[0.00007459342,0.0002668541,0.0006909157,0.000047916583,0.000014457038,0.0005630986,0.00019451705,0.079226285,0.011599807,0.9017771,0.00549576,0.000048839338],"about_ca_topic_score_codex":0.00039040524,"about_ca_topic_score_gemma":0.00023897013,"teacher_disagreement_score":0.0067379973,"about_ca_system_score_codex":0.00056962087,"about_ca_system_score_gemma":0.00052388257,"threshold_uncertainty_score":0.022540867},"labels":[],"label_agreement":null},{"id":"W2119258844","doi":"10.1109/tit.2005.853326","title":"Toward a General Correlation Theorem","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Modulo; Mathematics; Discrete mathematics; S-box; Algebra over a field; Computer science; Algorithm; Pure mathematics; Block cipher","score_opus":0.011220516436408423,"score_gpt":0.2151863566428308,"score_spread":0.2039658402064224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119258844","genre_codex":"methods","genre_gemma":"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.02247616,0.0028417562,0.8975022,0.0071178246,0.000863561,0.00007501134,0.00020866093,0.00031227554,0.06860269],"genre_scores_gemma":[0.60394335,0.0061598597,0.3388615,0.007559431,0.0034092641,0.00050631026,0.00041072405,0.0005008704,0.03864861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572563,0.0014202808,0.00016156054,0.0008785709,0.0014136283,0.00040041533],"domain_scores_gemma":[0.99265105,0.0042126067,0.00045966555,0.0010899617,0.0013409646,0.0002456811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073782266,0.00094695063,0.0012560944,0.0022767836,0.0016684129,0.0029314975,0.0016442076,0.0022221876,0.0044892756],"category_scores_gemma":[0.016489388,0.00068118895,0.0013490514,0.002079953,0.0070037288,0.009117785,0.004210985,0.0057417005,0.0015180099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009584017,0.000006522351,0.000098484794,0.00001512409,0.0000041031303,0.000025990019,0.00003638926,0.0010095201,0.00018501718,0.9937981,0.001243052,0.0035681964],"study_design_scores_gemma":[0.000019017521,0.000033018154,0.00011348287,0.000032606727,0.000008244759,0.00013301508,0.000025022819,0.018805798,0.0008668041,0.9674693,0.012472443,0.000021219827],"about_ca_topic_score_codex":0.0011661062,"about_ca_topic_score_gemma":0.00044338833,"teacher_disagreement_score":0.0073782266,"about_ca_system_score_codex":0.0027061726,"about_ca_system_score_gemma":0.002510133,"threshold_uncertainty_score":0.03902024},"labels":[],"label_agreement":null},{"id":"W2119343098","doi":"10.1109/pacrim.2007.4313290","title":"When Can Interleaving Be Avoided for Reed-Solomon Coded Binary Markov Channels?","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Interleaving; Decoding methods; Markov chain; Algorithm; Code word; Channel (broadcasting); Binary number; Markov process; Computer science; Additive white Gaussian noise; Binary symmetric channel; Mathematics; Noise (video); Discrete mathematics; Low-density parity-check code; Arithmetic; Telecommunications; Statistics; Artificial intelligence","score_opus":0.02265834991264076,"score_gpt":0.2566265819012277,"score_spread":0.23396823198858696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119343098","genre_codex":"methods","genre_gemma":"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.35955033,0.0026906673,0.6216174,0.0016883657,0.00023715511,0.000095349234,0.00013290896,0.00088773353,0.013100073],"genre_scores_gemma":[0.97162974,0.0007480768,0.026422797,0.00012890353,0.00007882436,0.00003738057,0.000038658225,0.00006395486,0.00085164775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763465,0.0007969503,0.000119647644,0.00020772488,0.00065315934,0.0005878795],"domain_scores_gemma":[0.985407,0.00991046,0.0018074806,0.0016958201,0.000864141,0.00031514527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003438872,0.0008892755,0.000994891,0.0006082959,0.0009681803,0.0017077358,0.000988497,0.0016171217,0.00109154],"category_scores_gemma":[0.030538036,0.00072899216,0.0002662917,0.0006185362,0.002298814,0.0045546414,0.0015181943,0.0014014903,0.00041868028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025426638,0.00021954645,0.009446836,0.00042358902,0.00011599455,0.0016314212,0.0006902422,0.42586893,0.03458692,0.37180698,0.002124469,0.15054247],"study_design_scores_gemma":[0.00008060947,0.00030671043,0.0010160652,0.0001502735,0.000059095746,0.00089821324,0.00028385047,0.66420716,0.034895565,0.29532424,0.0026818826,0.000096306285],"about_ca_topic_score_codex":0.0011369896,"about_ca_topic_score_gemma":0.0019462975,"teacher_disagreement_score":0.003438872,"about_ca_system_score_codex":0.0010686473,"about_ca_system_score_gemma":0.0012763882,"threshold_uncertainty_score":0.018186748},"labels":[],"label_agreement":null},{"id":"W2119561941","doi":"10.1109/tcomm.2014.022314.120896","title":"Asymptotical Analysis of Several Multiple Description Scenarios with L≥ 3 Descriptions","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Erasure; Algorithm; Computer science; Lattice (music); Code (set theory); Mathematics; Theoretical computer science","score_opus":0.02844989013748888,"score_gpt":0.2391577841428268,"score_spread":0.2107078940053379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119561941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4495017,0.0034403137,0.5138914,0.001679928,0.00010476156,0.00017031064,0.0003304881,0.0008285745,0.030052485],"genre_scores_gemma":[0.97210354,0.00059955526,0.025178414,0.00013898376,0.00004775881,0.00006348985,0.00015651496,0.000068506335,0.0016431881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971245,0.0010435551,0.00007722768,0.00024387613,0.0009398085,0.00057102676],"domain_scores_gemma":[0.9738235,0.020588227,0.0018124196,0.0015112596,0.0018342859,0.0004302918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049395883,0.00090920884,0.00091428176,0.0015355473,0.0008967325,0.0013427838,0.001460235,0.0013798514,0.0029751149],"category_scores_gemma":[0.02497492,0.0004469393,0.0007441924,0.00084463274,0.0019544864,0.0030396872,0.0023282375,0.0016454502,0.0004023101],"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.0007534082,0.00019533487,0.0035448112,0.00040028166,0.000109293665,0.0005559523,0.00027443533,0.82961226,0.012405576,0.12107542,0.0016527688,0.029420411],"study_design_scores_gemma":[0.000021785949,0.00017225553,0.00055391627,0.000038239472,0.000022591239,0.00029823865,0.00007183494,0.98030865,0.004689921,0.013199534,0.00057975843,0.00004316791],"about_ca_topic_score_codex":0.0019642706,"about_ca_topic_score_gemma":0.0014979288,"teacher_disagreement_score":0.0049395883,"about_ca_system_score_codex":0.002650754,"about_ca_system_score_gemma":0.0014518553,"threshold_uncertainty_score":0.026123345},"labels":[],"label_agreement":null},{"id":"W2119936466","doi":"10.1016/j.ffa.2010.10.002","title":"On constructing permutations of finite fields","year":2010,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of British Columbia; University of Lethbridge","funders":"","keywords":"Permutation (music); Mathematics; Combinatorics; Finite field; Set (abstract data type); Cyclic permutation; Permutation graph; Partial permutation; Discrete mathematics; Algebra over a field; Pure mathematics; Symmetric group; Computer science","score_opus":0.009601733691645173,"score_gpt":0.22736804589570872,"score_spread":0.21776631220406356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119936466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.19292194,0.0027794354,0.7060495,0.0033160676,0.0008536288,0.00016826879,0.00022594677,0.0008479168,0.09283743],"genre_scores_gemma":[0.71515983,0.0033975963,0.24517171,0.0008450731,0.00061377214,0.00019150367,0.00049990247,0.0005489072,0.033571776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984701,0.0007456072,0.000086737564,0.00015705203,0.00028989138,0.00025052336],"domain_scores_gemma":[0.99636346,0.0024395494,0.00017061844,0.00065072364,0.00019828565,0.00017749328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002511565,0.0009991575,0.0010816648,0.00221204,0.002480334,0.0032912302,0.0012488479,0.0015515204,0.004599545],"category_scores_gemma":[0.006610682,0.0008464919,0.0015578342,0.0030134046,0.0058585526,0.008475043,0.003682749,0.0033645958,0.0009659856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002862393,0.000019483725,0.00015788239,0.000034970613,0.0000040676464,0.000049044247,0.00029460806,0.0015341201,0.00046401203,0.9832008,0.00081880967,0.013393786],"study_design_scores_gemma":[0.000007706899,0.000010714838,0.00003852392,0.000017803726,0.000003937501,0.000046387508,0.00006083397,0.0027675102,0.0005425841,0.99277365,0.003720718,0.000009581354],"about_ca_topic_score_codex":0.00091198744,"about_ca_topic_score_gemma":0.0011797914,"teacher_disagreement_score":0.004599545,"about_ca_system_score_codex":0.001530374,"about_ca_system_score_gemma":0.0011372074,"threshold_uncertainty_score":0.015386999},"labels":[],"label_agreement":null},{"id":"W2120095615","doi":"10.1109/isit.2004.1365219","title":"Bounds on the minimum distances of a class of q-ary images of q/sup m/-ary irreducible cyclic codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Code word; Finite field; Upper and lower bounds; Characterization (materials science); Mathematics; Discrete mathematics; Code (set theory); Physics; Decoding methods; Algorithm; Mathematical analysis; Computer science","score_opus":0.014176793379500164,"score_gpt":0.2358233241332501,"score_spread":0.22164653075374993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120095615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9559179,0.0006423003,0.03344245,0.0007805326,0.000029749297,0.000032625107,0.0004342715,0.00012892937,0.008591277],"genre_scores_gemma":[0.9862644,0.0003177615,0.01096445,0.00007009526,0.00007196448,0.00006172366,0.00045589393,0.00005042093,0.001743203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986683,0.00022985,0.000092869566,0.00029697127,0.00037580123,0.00033617154],"domain_scores_gemma":[0.9905297,0.0056325276,0.0012424812,0.0011515778,0.00055155705,0.00089216675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010219851,0.0005564083,0.0008646647,0.0010736878,0.001352313,0.0019679966,0.0014804404,0.00088173046,0.0025347257],"category_scores_gemma":[0.012232111,0.0004546833,0.00045605042,0.0007060421,0.0016374501,0.0022765344,0.0016902294,0.001873529,0.00038431518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004569356,0.00044029567,0.038471997,0.0005885697,0.00017572675,0.0008186605,0.001510018,0.13556896,0.07275353,0.6076669,0.006986239,0.1304498],"study_design_scores_gemma":[0.0003488787,0.00090191734,0.017206624,0.0001337267,0.00011124268,0.0027330096,0.00067080697,0.37224823,0.06246833,0.531189,0.0118569555,0.00013127858],"about_ca_topic_score_codex":0.00054049486,"about_ca_topic_score_gemma":0.0005145462,"teacher_disagreement_score":0.0025347257,"about_ca_system_score_codex":0.0017341444,"about_ca_system_score_gemma":0.00071378786,"threshold_uncertainty_score":0.012582123},"labels":[],"label_agreement":null},{"id":"W2120749565","doi":"10.1006/jagm.2001.1158","title":"The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Factorization of polynomials; Factorization; Finite field; Mathematics; Polynomial; Factoring; Degree (music); Square-free polynomial; Algorithm; Singularity; Algebra over a field; Discrete mathematics; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.016552816498077758,"score_gpt":0.25349352498912764,"score_spread":0.23694070849104987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120749565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.23566574,0.0025345462,0.70319796,0.007465903,0.00034029907,0.00025584074,0.0012208599,0.0011434553,0.048175428],"genre_scores_gemma":[0.87326473,0.0018457415,0.09531848,0.001166293,0.0013581217,0.00020530105,0.0018542622,0.0005822322,0.02440485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950901,0.0010797129,0.0002273287,0.0009974953,0.0016644798,0.0009408124],"domain_scores_gemma":[0.9815166,0.012523522,0.0010473188,0.002208649,0.0019927428,0.0007112286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004292123,0.0016444502,0.0026313674,0.0023129277,0.0032989273,0.0072909654,0.0033179529,0.0032728035,0.0093358075],"category_scores_gemma":[0.021573674,0.0012718097,0.002823535,0.003236883,0.0053153834,0.019862553,0.003341193,0.0058738585,0.0021498615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000624633,0.00023701003,0.0013498663,0.00026425705,0.00008821216,0.00011347219,0.00037943127,0.037992526,0.0018298557,0.910264,0.009173687,0.037682973],"study_design_scores_gemma":[0.000051064188,0.00006279181,0.00020906047,0.000041710136,0.00003262263,0.00009863393,0.000052627787,0.06675082,0.0011705084,0.92921454,0.0022860032,0.00002963457],"about_ca_topic_score_codex":0.0017097294,"about_ca_topic_score_gemma":0.0014164641,"teacher_disagreement_score":0.0093358075,"about_ca_system_score_codex":0.003731107,"about_ca_system_score_gemma":0.0056381356,"threshold_uncertainty_score":0.031231403},"labels":[],"label_agreement":null},{"id":"W2121122045","doi":"10.1109/ccece.2003.1226223","title":"Soft Reed-Solomon decoding for concatenated codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec; Institut National de la Recherche Scientifique","funders":"","keywords":"Decoding methods; Convolutional code; Sequential decoding; Concatenated error correction code; Algorithm; Serial concatenated convolutional codes; Computer science; List decoding; Additive white Gaussian noise; Reed–Solomon error correction; Turbo code; Block Error Rate; Block code; Channel (broadcasting); Telecommunications","score_opus":0.02030091934969145,"score_gpt":0.25498024080667375,"score_spread":0.2346793214569823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121122045","genre_codex":"methods","genre_gemma":"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.16042578,0.0022670785,0.8306517,0.0002706128,0.000054262404,0.00004743298,0.000072630304,0.00044134172,0.0057691513],"genre_scores_gemma":[0.8876004,0.0011359203,0.10920745,0.00005046096,0.00006752964,0.000055409906,0.00007575297,0.00008867947,0.0017183565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984818,0.0006063809,0.00006483107,0.000067868415,0.0007094066,0.00006971868],"domain_scores_gemma":[0.9951448,0.0035997864,0.00038311927,0.00044308038,0.0003880054,0.000041092408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012839772,0.0004982138,0.0005332878,0.00070129405,0.00034313378,0.00096587464,0.00037700645,0.0006802723,0.00065401185],"category_scores_gemma":[0.010294479,0.0002512814,0.00039803106,0.0006135073,0.0010402882,0.00092298497,0.0005912128,0.000491177,0.00032924308],"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.00019974395,0.00001789794,0.001269949,0.00019939737,0.000057276957,0.00019269442,0.00018852063,0.8692439,0.017117288,0.07212394,0.000332451,0.03905699],"study_design_scores_gemma":[0.00001007885,0.00006071495,0.00029851246,0.000024301,0.000014784635,0.00014854543,0.00001384459,0.96173227,0.011004127,0.025845462,0.00083311816,0.000014247426],"about_ca_topic_score_codex":0.0008466319,"about_ca_topic_score_gemma":0.00065389375,"teacher_disagreement_score":0.0012839772,"about_ca_system_score_codex":0.00094443915,"about_ca_system_score_gemma":0.00070247625,"threshold_uncertainty_score":0.0068523884},"labels":[],"label_agreement":null},{"id":"W2121484689","doi":"10.1109/tcomm.2013.13.120317","title":"Grobner Bases for Lattices and an Algebraic Decoding Algorithm","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gröbner basis; Decoding methods; Algebraic number; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Algebra over a field; Mathematics; Theoretical computer science; Block code; Computation; Concatenated error correction code; Pure mathematics","score_opus":0.04023690450236831,"score_gpt":0.2959592228082651,"score_spread":0.25572231830589676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121484689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.013323596,0.0003750055,0.96914274,0.00055256614,0.00010115965,0.00007265841,0.00016075763,0.00043550425,0.01583611],"genre_scores_gemma":[0.1950358,0.0006412897,0.7940247,0.00036287992,0.00025359835,0.00023376905,0.00051828526,0.00021509193,0.008714502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981212,0.00057824526,0.00012288529,0.00025054833,0.0007423814,0.00018469448],"domain_scores_gemma":[0.9987091,0.00061340805,0.0001116129,0.00023907522,0.00027599256,0.000050940223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012558922,0.00066499115,0.00064981094,0.0013578455,0.00071713154,0.0018791462,0.000829911,0.0008072793,0.0034844342],"category_scores_gemma":[0.0045625106,0.00032685712,0.00060979184,0.0014865722,0.0016315605,0.0029440108,0.0017021374,0.0023972667,0.0019122707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057865727,0.000048644433,0.00013411064,0.00006690664,0.000008358224,0.00004387523,0.00011785733,0.027276497,0.0033746213,0.89350945,0.0020437597,0.07331802],"study_design_scores_gemma":[0.00003922992,0.000059882244,0.00006331506,0.000048389484,0.00000717155,0.0001352023,0.000043578268,0.168087,0.007295199,0.8103591,0.0138256615,0.00003619766],"about_ca_topic_score_codex":0.0007672288,"about_ca_topic_score_gemma":0.00080920476,"teacher_disagreement_score":0.0034844342,"about_ca_system_score_codex":0.0011415575,"about_ca_system_score_gemma":0.0012628194,"threshold_uncertainty_score":0.011656582},"labels":[],"label_agreement":null},{"id":"W2122036794","doi":"10.1109/isit.2012.6284659","title":"New constructions of codes for asymmetric channels via concatenation","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Linear code; Concatenation (mathematics); Block code; Concatenated error correction code; Reed–Muller code; Mathematics; Expander code; Discrete mathematics; Computer science; Algorithm; Combinatorics; Decoding methods","score_opus":0.020538111533601817,"score_gpt":0.25498831020990187,"score_spread":0.23445019867630004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122036794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.035163905,0.0011137758,0.9459975,0.00040327111,0.00026662133,0.00008980968,0.00016514542,0.00072872103,0.016071275],"genre_scores_gemma":[0.47592136,0.0014828224,0.50673854,0.000524237,0.00039742657,0.0003809643,0.00041274683,0.00042713227,0.013714743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838364,0.000417986,0.00013858908,0.0002013834,0.0006433768,0.00021509646],"domain_scores_gemma":[0.99682534,0.001129457,0.00046749873,0.00087385916,0.00052458653,0.00017927252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009569916,0.0008498143,0.00073990424,0.0012739659,0.0011676246,0.0014123647,0.00096554746,0.00092662626,0.0023300713],"category_scores_gemma":[0.0037266253,0.00042631026,0.0007979205,0.0013053108,0.001869559,0.0023442518,0.0030921618,0.0021903524,0.0010462647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017405515,0.00005567308,0.00065219344,0.00027576278,0.000047361234,0.00024413668,0.0004697134,0.03697683,0.024780415,0.8260295,0.0031259956,0.107168436],"study_design_scores_gemma":[0.000066895016,0.00025905506,0.0005023417,0.00017289222,0.0001011407,0.0012993749,0.00015729695,0.30172214,0.098812215,0.53808236,0.058626052,0.00019823249],"about_ca_topic_score_codex":0.0003303076,"about_ca_topic_score_gemma":0.0005134142,"teacher_disagreement_score":0.0023300713,"about_ca_system_score_codex":0.000818647,"about_ca_system_score_gemma":0.0011569335,"threshold_uncertainty_score":0.007794857},"labels":[],"label_agreement":null},{"id":"W2122046957","doi":"10.1109/isit.1993.748605","title":"On the Construction and Dimensionality of Linear Block Code Trellises","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Trellis (graph); Space–time trellis code; Mathematics; Upper and lower bounds; Trellis quantization; Isomorphism (crystallography); Dimension (graph theory); Combinatorics; Convolutional code; Discrete mathematics; Algorithm; Linear code; Decoding methods; Block code; Computer science; Mathematical analysis","score_opus":0.015294478001681966,"score_gpt":0.22936406798184034,"score_spread":0.21406958998015838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122046957","genre_codex":"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.015751773,0.0022063479,0.970891,0.00026043164,0.000057267975,0.00008961888,0.00034312092,0.00034848572,0.01005187],"genre_scores_gemma":[0.35155204,0.005833991,0.6304952,0.00022612663,0.0004731483,0.00077211607,0.0014364528,0.0004446284,0.008766315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980415,0.0006442373,0.00015352042,0.00025702943,0.0007568569,0.00014694355],"domain_scores_gemma":[0.9948078,0.0031945484,0.0004584952,0.0008739538,0.00057240756,0.000092873175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352278,0.00062248233,0.00071279815,0.0013193701,0.00064185885,0.0011926589,0.000862944,0.0007460571,0.002387501],"category_scores_gemma":[0.007194142,0.0007048884,0.00061721064,0.0013666085,0.0017622547,0.002015535,0.001279547,0.0018427549,0.00085276697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001712868,0.00003899819,0.0010146839,0.00041629898,0.000032000873,0.0001369261,0.0002702293,0.15907927,0.019808557,0.69966376,0.0040515736,0.1153164],"study_design_scores_gemma":[0.000051499384,0.0002329077,0.0015551224,0.00017138179,0.000036683425,0.000685552,0.000059177542,0.354604,0.0322217,0.58424675,0.026029196,0.000106001135],"about_ca_topic_score_codex":0.000894749,"about_ca_topic_score_gemma":0.0008076109,"teacher_disagreement_score":0.002387501,"about_ca_system_score_codex":0.0016075738,"about_ca_system_score_gemma":0.0007773689,"threshold_uncertainty_score":0.0116637945},"labels":[],"label_agreement":null},{"id":"W2122414545","doi":"10.1109/isit.1991.695140","title":"A Neural Network Implementation Of A Permutation Decoder For Binary Cyclic Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Code word; Decoding methods; Permutation (music); Computer science; Parity-check matrix; Algorithm; Artificial neural network; Hopfield network; Binary number; Word (group theory); Theoretical computer science; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.01692470651120803,"score_gpt":0.3032888610210897,"score_spread":0.2863641545098817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122414545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.066464186,0.00020982137,0.9170773,0.00035606773,0.00014214727,0.000096644704,0.00008022189,0.00097605365,0.014597557],"genre_scores_gemma":[0.70030206,0.00017530227,0.28873098,0.00014665602,0.00004168081,0.00012956811,0.000091898575,0.000047785783,0.0103341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989164,0.000022761178,0.00000507702,0.00002029776,0.000041183263,0.00001887803],"domain_scores_gemma":[0.9998752,0.000044179134,0.000010712396,0.00001980947,0.000040842624,0.000009141998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024854366,0.00025423054,0.00019814943,0.00016095738,0.00026391607,0.00043092112,0.00085803395,0.00073936506,0.0034169396],"category_scores_gemma":[0.00070477393,0.00012743857,0.00017694598,0.00023237513,0.00035623545,0.0006373601,0.00027247163,0.0005184754,0.0005871408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015892072,0.000128105,0.0008549061,0.00011304752,0.000048039285,0.00030255454,0.000089817186,0.760851,0.04035017,0.05080647,0.0015407423,0.14475615],"study_design_scores_gemma":[0.000008176959,0.0000477435,0.00008333064,0.0000042213305,0.0000056175413,0.000039271155,0.000004035688,0.991384,0.004703034,0.0026239601,0.0010910148,0.000005550305],"about_ca_topic_score_codex":0.004625367,"about_ca_topic_score_gemma":0.0066882907,"teacher_disagreement_score":0.004625367,"about_ca_system_score_codex":0.0005828075,"about_ca_system_score_gemma":0.00088054664,"threshold_uncertainty_score":0.01143074},"labels":[],"label_agreement":null},{"id":"W2122501450","doi":"10.1109/lcomm.2005.1576588","title":"A family of low-complexity binary linear codes for bluetooth and BLAST signaling applications","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bluetooth; Computer network; Theoretical computer science; Telecommunications; Wireless","score_opus":0.04715343231336983,"score_gpt":0.2871259003855308,"score_spread":0.239972468072161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122501450","genre_codex":"methods","genre_gemma":"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.05144148,0.0017535045,0.9296285,0.0004584487,0.00012291227,0.00012462291,0.0002751654,0.00058238185,0.015612861],"genre_scores_gemma":[0.38772964,0.0022684063,0.5877425,0.00037079267,0.00015061954,0.000397432,0.00066910137,0.0001997638,0.020471733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967873,0.0000689008,0.000017073604,0.000041692438,0.00015780244,0.000035920464],"domain_scores_gemma":[0.99915206,0.0002948105,0.00014613676,0.00014031513,0.00021419366,0.000052546464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036927828,0.00051222835,0.00030533032,0.00068279664,0.0006176617,0.0005198588,0.00040385962,0.00064147235,0.0020897633],"category_scores_gemma":[0.0020876583,0.0001842506,0.00037905955,0.0006139173,0.00053061725,0.0005356049,0.00044988113,0.0010307953,0.0011913424],"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.00030505258,0.00011943844,0.0012073108,0.00029575548,0.00003394678,0.00047390745,0.00028525817,0.08889736,0.11189343,0.45998645,0.007258283,0.32924396],"study_design_scores_gemma":[0.00012389239,0.00074622425,0.0015576317,0.0002173413,0.00006642463,0.0034629225,0.00008154535,0.52233404,0.113059,0.23781261,0.12036924,0.00016920746],"about_ca_topic_score_codex":0.00058945117,"about_ca_topic_score_gemma":0.0008161511,"teacher_disagreement_score":0.0020897633,"about_ca_system_score_codex":0.00040894133,"about_ca_system_score_gemma":0.00063460914,"threshold_uncertainty_score":0.006990969},"labels":[],"label_agreement":null},{"id":"W2122840332","doi":"10.1007/3-540-36400-5_37","title":"Error Detection in Polynomial Basis Multipliers over Binary Extension Fields","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Computer science; Polynomial basis; Finite field arithmetic; Multiplier (economics); Binary number; Normal basis; Arithmetic; Multiplication (music); Error detection and correction; Basis (linear algebra); Polynomial; Algorithm; Cryptography; Theoretical computer science; Galois theory; Mathematics; Discrete mathematics","score_opus":0.01494533657790721,"score_gpt":0.2364174286268894,"score_spread":0.2214720920489822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122840332","genre_codex":"methods","genre_gemma":"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.16793591,0.001559049,0.8143275,0.0014237679,0.00028143366,0.000105521365,0.00015950477,0.00081649027,0.013390823],"genre_scores_gemma":[0.8330745,0.0010455329,0.1493127,0.00025118858,0.00030574563,0.00010388641,0.0002068088,0.00009224089,0.0156073505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757856,0.0007124256,0.00012720536,0.00033936623,0.00087579637,0.00036651903],"domain_scores_gemma":[0.9915733,0.0057004797,0.00086414773,0.0008876811,0.0008113249,0.00016303668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028361508,0.00083569204,0.0010879185,0.0013113692,0.00089525816,0.0022121714,0.0010292958,0.0013964536,0.0022397905],"category_scores_gemma":[0.013946619,0.000640108,0.00036887947,0.0016999543,0.0012812976,0.0033134776,0.0022605688,0.0016270161,0.00060255424],"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.0017595289,0.0002101179,0.003641443,0.0004582548,0.00008919422,0.00048522718,0.0005422644,0.10222538,0.024837375,0.55313766,0.0073190196,0.3052945],"study_design_scores_gemma":[0.00011707471,0.00021111466,0.0005691627,0.00013035568,0.00003959376,0.0005458202,0.00008994905,0.51703775,0.024967628,0.4525035,0.003738184,0.000049845614],"about_ca_topic_score_codex":0.00044833974,"about_ca_topic_score_gemma":0.00046065205,"teacher_disagreement_score":0.0028361508,"about_ca_system_score_codex":0.0010504898,"about_ca_system_score_gemma":0.0010850235,"threshold_uncertainty_score":0.014999211},"labels":[],"label_agreement":null},{"id":"W2122914962","doi":"10.1109/asap.2005.6","title":"A Fault-Tolerant Modulus Replication Complex FIR Filter","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Residue number system; Fault tolerance; Replication (statistics); Computer science; Computation; Overhead (engineering); Finite impulse response; Throughput; Parallel computing; Wireless; Algorithm; Distributed computing; Mathematics; Telecommunications","score_opus":0.021306216229149404,"score_gpt":0.238544440937397,"score_spread":0.21723822470824758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122914962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.16651596,0.00058963354,0.82273936,0.0004644601,0.00031668687,0.00007776237,0.00007793164,0.0025429584,0.0066752457],"genre_scores_gemma":[0.78023046,0.00020397041,0.21191108,0.00017780285,0.00009848344,0.000028604913,0.00007859464,0.000041153457,0.007229789],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998349,0.000019391351,0.0000092331375,0.000038853465,0.00007658567,0.000021043434],"domain_scores_gemma":[0.999814,0.00003723468,0.00003108612,0.000052886284,0.000048722195,0.000016104106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019840446,0.00022260475,0.00024875702,0.00022516825,0.00036174245,0.0004681098,0.00071619416,0.00046957034,0.0026473198],"category_scores_gemma":[0.00040642,0.00012237257,0.00015739648,0.00019777608,0.00025842348,0.00062570826,0.00019571761,0.00033789952,0.00069729076],"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.0005452567,0.00009932685,0.00088397955,0.00015845236,0.000050585048,0.0005099774,0.00011752474,0.025615107,0.7109404,0.023441406,0.0023390069,0.23529889],"study_design_scores_gemma":[0.00017566871,0.0011602192,0.0019072334,0.000033323526,0.00009576726,0.0017543047,0.00004475672,0.47974625,0.47832498,0.005391118,0.03130734,0.00005904108],"about_ca_topic_score_codex":0.00057756936,"about_ca_topic_score_gemma":0.00093957764,"teacher_disagreement_score":0.0026473198,"about_ca_system_score_codex":0.00035241156,"about_ca_system_score_gemma":0.00035098608,"threshold_uncertainty_score":0.008856118},"labels":[],"label_agreement":null},{"id":"W2123050863","doi":"10.1109/isit.1994.394887","title":"(T, U) mapping matrices: properties and applications in permutation decoding","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Permutation (music); Connection (principal bundle); Computer science; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Physics","score_opus":0.042343635931223214,"score_gpt":0.21696875205476643,"score_spread":0.1746251161235432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123050863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.031387765,0.00038046355,0.9427541,0.00030648377,0.00013311936,0.00013019895,0.00017722347,0.00084805384,0.023882551],"genre_scores_gemma":[0.4929062,0.00086507306,0.48915944,0.00028462187,0.00024404438,0.00038846218,0.00034111933,0.00041059044,0.015400354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994393,0.00020944657,0.000050288032,0.000072005576,0.00017010293,0.000058759597],"domain_scores_gemma":[0.99717015,0.0013247409,0.00043057677,0.0004258245,0.000552696,0.00009601458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006028851,0.0005053595,0.00022424356,0.0010778784,0.00059962756,0.0017929478,0.0003998179,0.0009162758,0.005432727],"category_scores_gemma":[0.0063723414,0.0002531303,0.00031877813,0.0015394276,0.0010187683,0.002023063,0.0007309166,0.00095457706,0.0027986413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022334862,0.00004776492,0.00071724737,0.00012929988,0.000014753582,0.000473041,0.00047740308,0.025010722,0.025902793,0.7285637,0.0052170586,0.2132228],"study_design_scores_gemma":[0.000044989436,0.00030845698,0.00041890357,0.000081304366,0.000015289492,0.002776785,0.0002437866,0.26299998,0.062045243,0.64563125,0.025353221,0.00008077158],"about_ca_topic_score_codex":0.0005726841,"about_ca_topic_score_gemma":0.00045581404,"teacher_disagreement_score":0.005432727,"about_ca_system_score_codex":0.00041425627,"about_ca_system_score_gemma":0.0005304807,"threshold_uncertainty_score":0.01817429},"labels":[],"label_agreement":null},{"id":"W2124932533","doi":"10.1109/cwit.2011.5872122","title":"Multivariate interpolation decoding of heterogeneous Interleaved Reed-Solomon codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"List decoding; Decoding methods; Reed–Solomon error correction; Code word; Algorithm; Interpolation (computer graphics); Error detection and correction; Berlekamp–Welch algorithm; Computer science; Sequential decoding; Dimension (graph theory); Mathematics; Concatenated error correction code; Block code; Combinatorics; Telecommunications","score_opus":0.04057246284310645,"score_gpt":0.24834742504535232,"score_spread":0.20777496220224587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124932533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.016026665,0.00007364398,0.98247313,0.00003868328,0.000012605021,0.00002397805,0.000026059519,0.00013399811,0.001191146],"genre_scores_gemma":[0.5046709,0.0003580668,0.4915425,0.00005746792,0.00005215406,0.00011233639,0.00021285645,0.00009211662,0.0029016538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989911,0.00023706684,0.00005048455,0.000101163074,0.00048825654,0.00013196719],"domain_scores_gemma":[0.99835485,0.00068330613,0.00027933138,0.0002903975,0.0003370887,0.000055004344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011486362,0.0007572994,0.0007158561,0.0008817565,0.00045652172,0.00073075225,0.00097659,0.0006265703,0.00094966486],"category_scores_gemma":[0.0035716407,0.0002460972,0.0007034021,0.0010768017,0.00068607373,0.0009449445,0.001037603,0.0009533632,0.00050567003],"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.00018627403,0.00005714809,0.0012081309,0.000079877056,0.000058519836,0.00021912639,0.00015899666,0.7635936,0.01888835,0.11774471,0.0008252053,0.09698008],"study_design_scores_gemma":[0.0000068554327,0.000041032887,0.00013240842,0.0000072292646,0.0000087187855,0.000069032496,0.000009480104,0.976775,0.009488269,0.012621049,0.00082777365,0.000013187201],"about_ca_topic_score_codex":0.0014816251,"about_ca_topic_score_gemma":0.0015995967,"teacher_disagreement_score":0.0014816251,"about_ca_system_score_codex":0.0011150759,"about_ca_system_score_gemma":0.0012242835,"threshold_uncertainty_score":0.008090436},"labels":[],"label_agreement":null},{"id":"W2127451403","doi":"10.1109/icwc.1992.200720","title":"A performance comparison of some combining schemes for finite-buffer ARQ systems in a Rayleigh-fading channel","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Automatic repeat request; Rayleigh fading; Computer science; Fading; Selective Repeat ARQ; Channel (broadcasting); Throughput; Decoding methods; Algorithm; Hybrid automatic repeat request; Selection (genetic algorithm); Computer network; Wireless; Telecommunications link; Telecommunications; Artificial intelligence","score_opus":0.03902344120105891,"score_gpt":0.26845910294561337,"score_spread":0.22943566174455446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127451403","genre_codex":"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.34591457,0.005987944,0.63468385,0.00042490312,0.00016111608,0.0003599447,0.00021678863,0.0019084095,0.01034251],"genre_scores_gemma":[0.85769624,0.0012404976,0.13893889,0.00009249157,0.00009185445,0.0001071933,0.00013435875,0.00005961076,0.0016389098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966055,0.0015750792,0.00018114713,0.00024530134,0.0010415643,0.00035136405],"domain_scores_gemma":[0.9861857,0.010361564,0.0006209147,0.0009390977,0.0016688417,0.00022382324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005279105,0.0016557833,0.0014283838,0.0016653531,0.0012904187,0.0021443989,0.001476551,0.0011953816,0.00293792],"category_scores_gemma":[0.010799299,0.0005374495,0.00071585027,0.0018353454,0.0010191697,0.0017025094,0.0016596967,0.00090241263,0.00055985874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008822937,0.00042301047,0.007501534,0.0008318124,0.0011334936,0.0005308607,0.0012311159,0.46544743,0.071868524,0.03495716,0.0023065093,0.40494564],"study_design_scores_gemma":[0.00021512715,0.0024311235,0.0014700474,0.00007400739,0.00040312693,0.00063957635,0.00020541518,0.94646263,0.038117014,0.007842156,0.0019871464,0.0001527001],"about_ca_topic_score_codex":0.0014905625,"about_ca_topic_score_gemma":0.0014816801,"teacher_disagreement_score":0.005279105,"about_ca_system_score_codex":0.0013598566,"about_ca_system_score_gemma":0.00082297664,"threshold_uncertainty_score":0.027918935},"labels":[],"label_agreement":null},{"id":"W2127532366","doi":"10.1109/dasc.2006.9","title":"A Parallel GNFS Integrated with the Block Wiedemann's Algorithm for Integer Factorization","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Integer factorization; Algorithm; Computer science; Factorization; Cryptosystem; Block (permutation group theory); Integer (computer science); Field (mathematics); Parallel computing; Mathematics; Public-key cryptography; Cryptography; Encryption; Combinatorics","score_opus":0.007591969086953684,"score_gpt":0.20356709492611497,"score_spread":0.19597512583916127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127532366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.06985425,0.00050095445,0.90975,0.00026182472,0.00025015677,0.00025608955,0.00029532085,0.0077672526,0.011064208],"genre_scores_gemma":[0.16784562,0.00022916195,0.822795,0.00007333144,0.00005761886,0.00016677818,0.00061266683,0.0003161951,0.007903631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993968,0.00009355089,0.00003658963,0.000105222425,0.0002871346,0.00008072548],"domain_scores_gemma":[0.9996226,0.0000643211,0.000027100363,0.000121577774,0.00013672381,0.000027770902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005323559,0.00062717433,0.0007325292,0.0011184029,0.0005771844,0.00048756774,0.00082464755,0.00044148878,0.0056199883],"category_scores_gemma":[0.0010992188,0.00029578333,0.000546006,0.001190808,0.00043538664,0.0014810327,0.00057190383,0.00069321453,0.0017601246],"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.0014377086,0.00037390823,0.0027940955,0.00031252942,0.00014682197,0.000334926,0.0002662205,0.08295885,0.12012667,0.046300903,0.013078128,0.7318692],"study_design_scores_gemma":[0.00061140046,0.0008946011,0.0019223725,0.00006449296,0.00009553829,0.0009951617,0.00008933712,0.6952118,0.19659568,0.023374809,0.08003088,0.00011387491],"about_ca_topic_score_codex":0.003836132,"about_ca_topic_score_gemma":0.0034820857,"teacher_disagreement_score":0.0056199883,"about_ca_system_score_codex":0.0006093775,"about_ca_system_score_gemma":0.001203842,"threshold_uncertainty_score":0.018800795},"labels":[],"label_agreement":null},{"id":"W2127589484","doi":"10.1109/pacrim.1991.160713","title":"An expanded set of design criteria for substitution boxes and their use in strengthening DES-like cryptosystems","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cryptosystem; Substitution (logic); Set (abstract data type); Computer science; S-box; Cryptography; Theoretical computer science; Computer security; Arithmetic; Mathematics; Programming language","score_opus":0.10134192146709614,"score_gpt":0.2805634637302241,"score_spread":0.17922154226312798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127589484","genre_codex":"methods","genre_gemma":"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.010747304,0.0013743206,0.96717083,0.00066120696,0.00026041837,0.00031345594,0.00010385691,0.0006374646,0.018731186],"genre_scores_gemma":[0.17787975,0.002093789,0.8029568,0.0005493525,0.0002529032,0.00071795133,0.00020335011,0.00034780428,0.014998378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941307,0.002150969,0.0007875511,0.00054983416,0.0020881854,0.00029282388],"domain_scores_gemma":[0.9944115,0.00230146,0.00048803404,0.000904253,0.0017162865,0.00017850734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051794252,0.0013219123,0.0010237596,0.002143639,0.0013055719,0.0029952528,0.0012590776,0.0019466635,0.0050956733],"category_scores_gemma":[0.008820025,0.0007975784,0.0014328429,0.0013210978,0.0038163809,0.00400296,0.0020382805,0.0029364536,0.0022278521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025063014,0.000047933834,0.00023743241,0.00052395766,0.00002574498,0.00030510672,0.00045964614,0.015638402,0.025132297,0.85093826,0.003694407,0.10274608],"study_design_scores_gemma":[0.00013515244,0.000651826,0.0003174301,0.0006175005,0.00010138711,0.0011672417,0.00019755466,0.08131275,0.082706116,0.64823556,0.18433486,0.00022271718],"about_ca_topic_score_codex":0.00069254567,"about_ca_topic_score_gemma":0.0008077006,"teacher_disagreement_score":0.0051794252,"about_ca_system_score_codex":0.0013539038,"about_ca_system_score_gemma":0.0016929037,"threshold_uncertainty_score":0.027391732},"labels":[],"label_agreement":null},{"id":"W2129568979","doi":"10.1109/tit.2010.2040888","title":"Optimal Frequency-Hopping Sequences With New Parameters","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Prime (order theory); Combinatorics; Algorithm; Discrete mathematics; Computer science; Mathematics","score_opus":0.009472739349772318,"score_gpt":0.2108607350587515,"score_spread":0.20138799570897917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129568979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.053223226,0.0014520582,0.93034726,0.00073855434,0.00039069747,0.00018488386,0.0003880441,0.0006096404,0.01266562],"genre_scores_gemma":[0.59368485,0.0011801095,0.3934727,0.00032439583,0.0003776374,0.0004358056,0.00066833885,0.0001993027,0.009656786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808085,0.000655364,0.00014619465,0.00034725582,0.0005057884,0.00026450903],"domain_scores_gemma":[0.99448794,0.003588921,0.00034954562,0.00066685013,0.00068060204,0.00022622297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017846462,0.0013238764,0.0009969919,0.0014291396,0.00060622854,0.0012871106,0.0011026296,0.0016436802,0.005116338],"category_scores_gemma":[0.01539103,0.0006538735,0.0004915689,0.0013300406,0.0010274681,0.0026512735,0.0015141807,0.0017022274,0.0014759115],"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.0012398106,0.00023747254,0.0011899967,0.00047275476,0.00010643989,0.00034158074,0.0003768732,0.582265,0.01587321,0.15134618,0.006667569,0.239883],"study_design_scores_gemma":[0.00013507358,0.00017824715,0.0003703641,0.00010839048,0.00004329853,0.0002853286,0.000077058816,0.9217916,0.004505952,0.066853076,0.0055870144,0.00006457888],"about_ca_topic_score_codex":0.0013264549,"about_ca_topic_score_gemma":0.0019965398,"teacher_disagreement_score":0.005116338,"about_ca_system_score_codex":0.0010857343,"about_ca_system_score_gemma":0.002002381,"threshold_uncertainty_score":0.017115891},"labels":[],"label_agreement":null},{"id":"W2130780608","doi":"10.1145/1390768.1390785","title":"On lacunary polynomial perfect powers","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Polynomial; Norm (philosophy); Stable polynomial; Conjecture; Combinatorics; Discrete mathematics; Representation (politics); Square-free polynomial; Matrix polynomial; Mathematical analysis","score_opus":0.012723261084678198,"score_gpt":0.20945864178894605,"score_spread":0.19673538070426785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130780608","genre_codex":"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.3458049,0.0008116565,0.61719114,0.0021656642,0.00014159922,0.00018087358,0.0004327142,0.0015462317,0.031725183],"genre_scores_gemma":[0.9051705,0.00035763803,0.08563049,0.00029558098,0.0001278944,0.00005118174,0.00032985437,0.00016705155,0.007869838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835026,0.00035484013,0.00009020735,0.00038498378,0.0004199995,0.00039969626],"domain_scores_gemma":[0.99532664,0.0028253542,0.0003934648,0.00079831906,0.00041076352,0.0002454489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016863637,0.0005635711,0.0009978423,0.00095983694,0.0013312623,0.0019749722,0.00075542426,0.00092615496,0.0065049906],"category_scores_gemma":[0.012815819,0.0003575595,0.000737547,0.0012714844,0.003690287,0.0059605716,0.0024122417,0.0017154,0.0016670291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013113016,0.00013761058,0.0044082026,0.0003943649,0.00004099176,0.0013170354,0.0016295199,0.0927868,0.013285362,0.7173459,0.008223704,0.15911926],"study_design_scores_gemma":[0.00010518195,0.00015254748,0.0004155919,0.00007361142,0.000022808428,0.00046063028,0.00045566447,0.20500137,0.0142104225,0.7696658,0.009397494,0.00003891395],"about_ca_topic_score_codex":0.0023538622,"about_ca_topic_score_gemma":0.0017813051,"teacher_disagreement_score":0.0065049906,"about_ca_system_score_codex":0.0011278206,"about_ca_system_score_gemma":0.0010539317,"threshold_uncertainty_score":0.021761358},"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":"W2131972975","doi":"10.1016/j.dam.2006.04.025","title":"Two-tuple balance of non-binary sequences with ideal two-level autocorrelation","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sequence (biology); Conjecture; Combinatorics; Autocorrelation; Prime (order theory); Ideal (ethics); Finite field; Tuple; Binary number; Discrete mathematics; Period (music); Pseudorandom binary sequence; Function (biology); Arithmetic; Statistics","score_opus":0.01195315731277429,"score_gpt":0.23859496720282278,"score_spread":0.22664180989004848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131972975","genre_codex":"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.5826954,0.0006319536,0.35845327,0.0006892356,0.00031506986,0.00010768243,0.00030393392,0.00066781597,0.056135654],"genre_scores_gemma":[0.96606886,0.00017821569,0.022417884,0.00014142136,0.00015298412,0.00008257095,0.00020713246,0.00009468918,0.010656232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868375,0.00026596256,0.00008892087,0.00021076342,0.00040935713,0.0003413324],"domain_scores_gemma":[0.9978467,0.0006688937,0.0003264719,0.00030633388,0.0004260232,0.00042560656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244,0.0005110995,0.00084243965,0.0015593813,0.001544718,0.0031177609,0.0007916726,0.0010863878,0.006153272],"category_scores_gemma":[0.0047155465,0.00031666175,0.00043549231,0.001024407,0.0018328067,0.0033252335,0.0017582765,0.0009886897,0.0012864107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034624452,0.00004078172,0.0004342117,0.00003856234,0.000009568563,0.00018506516,0.00017292761,0.0036048258,0.008871719,0.9758838,0.0009643363,0.009447932],"study_design_scores_gemma":[0.00006026309,0.00014081341,0.00049359334,0.000026319165,0.000016014523,0.000295774,0.00012209569,0.059534922,0.010548169,0.9248529,0.003865272,0.00004394083],"about_ca_topic_score_codex":0.00037632274,"about_ca_topic_score_gemma":0.00024337784,"teacher_disagreement_score":0.006153272,"about_ca_system_score_codex":0.0010691335,"about_ca_system_score_gemma":0.00089387863,"threshold_uncertainty_score":0.020584762},"labels":[],"label_agreement":null},{"id":"W2132052310","doi":"10.37236/839","title":"Compression of Root Systems and the $E$-Sequence","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Root (linguistics); Mathematics; Sequence (biology); Root system; Pure mathematics; Discrete mathematics; Combinatorics; Algebra over a field; Botany; Biology","score_opus":0.013622498070892204,"score_gpt":0.2218310289784053,"score_spread":0.2082085309075131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132052310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8151796,0.0014556716,0.09796152,0.0016103277,0.00020719566,0.000049555292,0.00021502221,0.00031900214,0.083002135],"genre_scores_gemma":[0.97548836,0.0006670767,0.012623268,0.0001481975,0.00014906896,0.000035037923,0.00021005358,0.000047499172,0.010631282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997267,0.00006235864,0.000014227358,0.000039486797,0.00007621245,0.000081077684],"domain_scores_gemma":[0.99914217,0.00042339735,0.00015837491,0.00009680581,0.0000858539,0.00009327568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026518328,0.00036094277,0.0003051609,0.0009920176,0.00074038,0.0013014409,0.00044168092,0.0007784494,0.0077440445],"category_scores_gemma":[0.0024809453,0.00017315654,0.0002196985,0.00086504215,0.0014203753,0.0029038936,0.0014381792,0.0012282904,0.00083593297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012252848,0.000042776497,0.00078862853,0.00006036078,0.000006019766,0.00051209045,0.00030937378,0.0036785307,0.004522858,0.96056956,0.0015245834,0.027862687],"study_design_scores_gemma":[0.000039514918,0.0001310832,0.001190139,0.000045578392,0.000009361337,0.0011728351,0.0003537893,0.023713145,0.010231953,0.9542648,0.008811146,0.0000366977],"about_ca_topic_score_codex":0.0002479025,"about_ca_topic_score_gemma":0.0001659772,"teacher_disagreement_score":0.0077440445,"about_ca_system_score_codex":0.00038724788,"about_ca_system_score_gemma":0.00020940734,"threshold_uncertainty_score":0.025906384},"labels":[],"label_agreement":null},{"id":"W2132246788","doi":"10.1081/agb-120023130","title":"The 2-Power Degree Subfields of the Splitting Fields of Polynomials with Frobenius Galois Groups","year":2003,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Okanagan University College; Okanagan College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Trinomial; Galois group; Degree (music); Quintic function; Complement (music); Combinatorics; Finite field; Order (exchange); Group (periodic table); Polynomial; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.0268525358548795,"score_gpt":0.25085330576690107,"score_spread":0.22400076991202156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132246788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9642187,0.00027257987,0.018230263,0.00030876888,0.00003932563,0.000030536303,0.000056966743,0.000058835067,0.016784113],"genre_scores_gemma":[0.9901309,0.00014010047,0.003993242,0.00003630931,0.000058945272,0.000018594106,0.000051214836,0.00001175163,0.005558899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998235,0.000037766255,0.000008541187,0.000021624015,0.000045576267,0.00006302842],"domain_scores_gemma":[0.9995751,0.000114936855,0.00008212828,0.000038618276,0.000061476756,0.00012774605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047854308,0.00036508412,0.00027112308,0.0010345544,0.0008954318,0.0009280448,0.00025522776,0.00025866972,0.0039044728],"category_scores_gemma":[0.00093386753,0.00026617164,0.00038688423,0.00052589376,0.0014035272,0.002105666,0.0008804003,0.0007004788,0.00044788248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029327418,0.000081496015,0.003525419,0.00006997619,0.000013739711,0.0008911653,0.0018685916,0.0046632825,0.0150074335,0.95204395,0.0010669108,0.020474754],"study_design_scores_gemma":[0.00010198262,0.00018113255,0.0035094898,0.000047220034,0.000016894659,0.00088219356,0.00069384964,0.014539843,0.01077478,0.958626,0.0105958525,0.00003083663],"about_ca_topic_score_codex":0.0010244177,"about_ca_topic_score_gemma":0.0010736263,"teacher_disagreement_score":0.0039044728,"about_ca_system_score_codex":0.00084212463,"about_ca_system_score_gemma":0.00046643507,"threshold_uncertainty_score":0.013061702},"labels":[],"label_agreement":null},{"id":"W2132252040","doi":"10.1109/icc.2008.842","title":"Soft Decision Decoding of Reed-Solomon Codes Using Sphere Decoding","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Code word; List decoding; Code (set theory); Set (abstract data type); Symbol (formal); Mathematics; Computer science; Algorithm; RADIUS; Discrete mathematics; Combinatorics; Arithmetic; Concatenated error correction code; Block code","score_opus":0.03967255677975378,"score_gpt":0.2681964337958218,"score_spread":0.22852387701606802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132252040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.0058100238,0.00031648722,0.9917184,0.00006185959,0.000051452902,0.00003922746,0.00005216676,0.00051455136,0.0014358213],"genre_scores_gemma":[0.19043955,0.0007816474,0.8022924,0.00013286453,0.00010792522,0.00015415275,0.0003329047,0.00015027895,0.0056083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986393,0.00037098632,0.00009277852,0.00012328065,0.0006832319,0.00009048336],"domain_scores_gemma":[0.998408,0.000718697,0.00013883587,0.00023896873,0.000441267,0.000054293672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924428,0.0008001076,0.000859742,0.0009199691,0.00038802263,0.0008755383,0.0007315173,0.00060487597,0.0012607247],"category_scores_gemma":[0.0026441943,0.00031767078,0.00058539456,0.0007875676,0.00061432115,0.00089224096,0.0009590289,0.0009808111,0.001092637],"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.0004601607,0.0001052073,0.001082454,0.00037946884,0.00012743396,0.00047340192,0.00030728354,0.20163512,0.10296615,0.061241765,0.0046896706,0.62653196],"study_design_scores_gemma":[0.000044734803,0.00014957805,0.00030697483,0.000035814166,0.000023598957,0.0003745449,0.000024705329,0.91985816,0.057546187,0.014262932,0.0073183374,0.00005440319],"about_ca_topic_score_codex":0.0016193852,"about_ca_topic_score_gemma":0.0015541472,"teacher_disagreement_score":0.0016193852,"about_ca_system_score_codex":0.0005955824,"about_ca_system_score_gemma":0.0012550085,"threshold_uncertainty_score":0.004321277},"labels":[],"label_agreement":null},{"id":"W2132519869","doi":"10.1109/ccece.1993.332413","title":"On the spectral characteristics of continuous guided scrambling line codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Scrambling; Code (set theory); Symbol (formal); Computer science; Algorithm; Limit (mathematics); Sequence (biology); Mathematics; Discrete mathematics","score_opus":0.03891504634099112,"score_gpt":0.24139616256430554,"score_spread":0.20248111622331444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132519869","genre_codex":"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.37864864,0.0021233738,0.5955792,0.00023819233,0.000039198214,0.000040192004,0.00013303538,0.00029412183,0.022904053],"genre_scores_gemma":[0.9635606,0.001183683,0.032487154,0.000037590402,0.00005429189,0.00002815971,0.0001234763,0.0000643611,0.002460642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996525,0.00009948864,0.000006864913,0.00003230663,0.00016590007,0.00004284846],"domain_scores_gemma":[0.99767333,0.0016131331,0.0001991317,0.00012649666,0.00033846483,0.000049435712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005032945,0.00034327465,0.00024202322,0.0010955062,0.00022180179,0.00067609636,0.0003310778,0.0003353538,0.0012340413],"category_scores_gemma":[0.0040161447,0.0001942263,0.00018178865,0.00080750126,0.001145252,0.0009861323,0.00041757105,0.00055163755,0.0004362086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002464319,0.000050278748,0.0017295656,0.00019114205,0.000022734275,0.0003673117,0.0004796486,0.34022436,0.048734255,0.5438297,0.0013713341,0.06275329],"study_design_scores_gemma":[0.000008812348,0.00007393584,0.0009343354,0.00004089902,0.000006471436,0.000280158,0.000074702846,0.88967127,0.011512816,0.09540714,0.00195402,0.00003544014],"about_ca_topic_score_codex":0.00072029314,"about_ca_topic_score_gemma":0.00030901848,"teacher_disagreement_score":0.0012340413,"about_ca_system_score_codex":0.0005168188,"about_ca_system_score_gemma":0.00027511932,"threshold_uncertainty_score":0.004128337},"labels":[],"label_agreement":null},{"id":"W2132805517","doi":"10.1109/newcas.2004.1359100","title":"Design of reconfigurable general finite field multiplier in GF[2/sup m/]","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Multiplier (economics); Finite field; Very-large-scale integration; Computer science; Mathematics; Arithmetic; Embedded system; Discrete mathematics","score_opus":0.03683872581728505,"score_gpt":0.2530160978105393,"score_spread":0.21617737199325426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132805517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2851764,0.002774806,0.68487835,0.00048061428,0.0004979011,0.00039871654,0.00030259424,0.0027754572,0.022715157],"genre_scores_gemma":[0.7024614,0.0007160535,0.28882313,0.000198458,0.00010874072,0.00013953906,0.00036999193,0.00007487352,0.007107837],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998909,0.000024676678,0.000007795162,0.000030078276,0.000022412727,0.000024155184],"domain_scores_gemma":[0.9998971,0.000017400112,0.000025244492,0.000018016905,0.000030948107,0.000011202538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013394149,0.0004415336,0.00039740134,0.00042448685,0.00041268146,0.0003134371,0.0007814927,0.00037171485,0.00268017],"category_scores_gemma":[0.00026539093,0.00016809245,0.0003184112,0.0004513171,0.00018167864,0.00044826284,0.00023593125,0.0002892728,0.00076827244],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012516087,0.00012655558,0.0015471171,0.00082446646,0.00021566378,0.001334402,0.00021540582,0.026487354,0.52553153,0.025622861,0.006342049,0.41050103],"study_design_scores_gemma":[0.0008424766,0.0046952707,0.004737307,0.00025332795,0.00049571774,0.009387573,0.00024108465,0.2101064,0.6382884,0.021149628,0.10955435,0.00024845396],"about_ca_topic_score_codex":0.00031223695,"about_ca_topic_score_gemma":0.000697017,"teacher_disagreement_score":0.00268017,"about_ca_system_score_codex":0.00023931806,"about_ca_system_score_gemma":0.0003376947,"threshold_uncertainty_score":0.008966088},"labels":[],"label_agreement":null},{"id":"W2132902317","doi":"10.1109/tc.2007.1024","title":"Comments on \"Five, Six, and Seven-Term Karatsuba-Like Formulae","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Modulo; Term (time); Multiplication (music); Arithmetic; Remainder; Chinese remainder theorem; Mathematics; Discrete mathematics; Computer science; Algebra over a field; Combinatorics; Pure mathematics; Physics","score_opus":0.013942774073868616,"score_gpt":0.2435503478042002,"score_spread":0.22960757373033158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132902317","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033714296,0.004662329,0.012812066,0.757304,0.1587971,0.00011768298,0.00086534466,0.0011937633,0.060876273],"genre_scores_gemma":[0.069172814,0.00782351,0.011459134,0.652553,0.10398422,0.00034030236,0.00063165044,0.0010192596,0.15301609],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99496514,0.0011633573,0.00051794265,0.00063889957,0.002213835,0.0005007368],"domain_scores_gemma":[0.9853881,0.0070895823,0.0008647725,0.0009795381,0.005255187,0.00042284257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050228224,0.001253286,0.00072981237,0.0011096115,0.00400885,0.0021200336,0.00393934,0.007738558,0.035088636],"category_scores_gemma":[0.02275746,0.00063755875,0.0013978767,0.001174881,0.004457133,0.0064638047,0.002409219,0.0124251945,0.013750668],"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.00011195892,0.000016425072,0.00016475518,0.00021838052,0.000011919994,0.00048294512,0.0005039204,0.00026705198,0.0006942938,0.06512462,0.92362124,0.0087825125],"study_design_scores_gemma":[0.000019225383,0.000036682824,0.00039952534,0.00018546237,0.000012461007,0.00032089278,0.00025545305,0.0004180125,0.0013824374,0.026083473,0.97083515,0.000051197232],"about_ca_topic_score_codex":0.008650783,"about_ca_topic_score_gemma":0.005660786,"teacher_disagreement_score":0.035088636,"about_ca_system_score_codex":0.0039986656,"about_ca_system_score_gemma":0.0020093475,"threshold_uncertainty_score":0.11738318},"labels":[],"label_agreement":null},{"id":"W2133073742","doi":"10.1109/ccece.2002.1015280","title":"High-speed forward error correction IP blocks for system-on-chip design","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Encoder; Convolutional code; Field-programmable gate array; Error detection and correction; Computer hardware; Transceiver; System on a chip; Forward error correction; Chip; Decoding methods; CMOS; Code (set theory); VHDL; Embedded system; Hardware description language; Wireless; Electronic engineering; Algorithm; Telecommunications; Engineering","score_opus":0.027646817563178494,"score_gpt":0.2399748808083369,"score_spread":0.2123280632451584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133073742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.020308718,0.0006383934,0.9582248,0.00017299225,0.00018485558,0.000548847,0.0002649538,0.0050097015,0.0146469455],"genre_scores_gemma":[0.43124077,0.000601872,0.55347574,0.00032867817,0.00013773031,0.0007808023,0.00092807144,0.00035456117,0.012151839],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997334,0.00005678929,0.00002008732,0.000025695701,0.00011855256,0.000045379984],"domain_scores_gemma":[0.99939656,0.00016191603,0.000052802334,0.00008833338,0.0002800493,0.000020278387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907923,0.00052344654,0.00026220232,0.00037987714,0.00029537868,0.00058988197,0.0008019242,0.00038449143,0.008414473],"category_scores_gemma":[0.001106077,0.00021369144,0.00018622221,0.0003355428,0.00021292998,0.00053891045,0.0002307079,0.00062622665,0.0027046595],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006099019,0.00018949658,0.0014426674,0.001302617,0.00011105137,0.0005972165,0.0002507127,0.06560671,0.2702536,0.06977529,0.028584132,0.56127656],"study_design_scores_gemma":[0.000375238,0.001712348,0.0017887398,0.0001790228,0.00021273964,0.0011543351,0.00007831555,0.32334906,0.48585936,0.01534562,0.16988684,0.000058259757],"about_ca_topic_score_codex":0.00058123487,"about_ca_topic_score_gemma":0.0009308743,"teacher_disagreement_score":0.008414473,"about_ca_system_score_codex":0.00040080285,"about_ca_system_score_gemma":0.0007673889,"threshold_uncertainty_score":0.028149247},"labels":[],"label_agreement":null},{"id":"W2133099611","doi":"10.1109/isit.2003.1228395","title":"Trace representation of binary jacobi sequences","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"TRACE (psycholinguistics); Hadamard transform; Binary number; Representation (politics); Mathematics; Prime (order theory); Combinatorics; Function (biology); Pure mathematics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.025383987361052823,"score_gpt":0.27011243461976603,"score_spread":0.2447284472587132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133099611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.72310305,0.00095447124,0.2012501,0.0007153682,0.0003905849,0.000073695424,0.0003598288,0.0003719562,0.072780974],"genre_scores_gemma":[0.9686659,0.0004249559,0.01847813,0.00011999449,0.00020168867,0.000037184473,0.00023378809,0.000094510826,0.011743866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969316,0.0000470132,0.000014209037,0.00004917553,0.0001098194,0.00008661742],"domain_scores_gemma":[0.9994604,0.00015997425,0.000098145334,0.000074185504,0.00011740321,0.00008992985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035995737,0.00045473402,0.00031307095,0.0016865932,0.00061529095,0.0014779296,0.00048269215,0.00065837486,0.00601111],"category_scores_gemma":[0.0023220466,0.00014560507,0.00029336696,0.0008605825,0.0010073992,0.0016790959,0.00067020964,0.0007757221,0.001044803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013654468,0.000057781595,0.0004456603,0.000054975128,0.00000411567,0.00016919988,0.0002859045,0.003984152,0.010186461,0.9517532,0.001118368,0.031803705],"study_design_scores_gemma":[0.000031408184,0.00011902951,0.00054972543,0.000057990554,0.0000075171083,0.0005097568,0.00016021343,0.06569054,0.015309396,0.91052383,0.0069958535,0.00004476114],"about_ca_topic_score_codex":0.0003806603,"about_ca_topic_score_gemma":0.00020090817,"teacher_disagreement_score":0.00601111,"about_ca_system_score_codex":0.00058977323,"about_ca_system_score_gemma":0.0005185352,"threshold_uncertainty_score":0.020109117},"labels":[],"label_agreement":null},{"id":"W2133220743","doi":"10.1112/blms/bdu033","title":"Abelian surfaces over finite fields with prescribed groups","year":2014,"lang":"en","type":"preprint","venue":"Bulletin of the London Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Abelian group; Combinatorics; Congruence relation; Mathematics; Prime power; Prime (order theory); Order (exchange); Field (mathematics); Group (periodic table); Discrete mathematics; Physics; Pure mathematics; Quantum mechanics","score_opus":0.010976767766208942,"score_gpt":0.2151733370883539,"score_spread":0.20419656932214497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133220743","genre_codex":"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.8701602,0.00053118315,0.067576975,0.00096201454,0.000086195854,0.000090537054,0.00017355822,0.00035171176,0.060067575],"genre_scores_gemma":[0.9836332,0.0002528279,0.009546085,0.00005739938,0.000100885474,0.00007022498,0.00018921006,0.00003806468,0.006112239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998971,0.00023669655,0.00007501594,0.00013054456,0.000364347,0.00022233569],"domain_scores_gemma":[0.99889106,0.00042551724,0.00021207794,0.00019671382,0.00011952057,0.00015514488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077932037,0.0005751235,0.000506119,0.0015316796,0.0014806258,0.0024839905,0.00053878466,0.00082955207,0.0038404965],"category_scores_gemma":[0.0033425128,0.00029620723,0.00046779844,0.001016934,0.0032149528,0.0033339476,0.0023900182,0.0010028635,0.0006448925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011257732,0.000031353673,0.0014643256,0.000036719593,0.000006785617,0.00031370707,0.00057005486,0.0020550569,0.0048314407,0.9822589,0.0005586178,0.0077604754],"study_design_scores_gemma":[0.00006446594,0.000068164576,0.0014009223,0.000027696722,0.000012708449,0.00052677596,0.00041886762,0.011616923,0.0057643456,0.97187257,0.008206006,0.000020637255],"about_ca_topic_score_codex":0.000611289,"about_ca_topic_score_gemma":0.00041594612,"teacher_disagreement_score":0.0038404965,"about_ca_system_score_codex":0.0012137422,"about_ca_system_score_gemma":0.00057515583,"threshold_uncertainty_score":0.012847781},"labels":[],"label_agreement":null},{"id":"W2133384197","doi":"10.1186/s13662-015-0402-1","title":"Factorizations for difference operators","year":2015,"lang":"en","type":"article","venue":"Advances in Difference Equations","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"University Research Council, DePaul University","keywords":"Mathematics; Partial differential equation; Ordinary differential equation; Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Differential equation","score_opus":0.04857355432760668,"score_gpt":0.30982209543809897,"score_spread":0.2612485411104923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133384197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04630101,0.0050161686,0.831155,0.0032765286,0.002000688,0.00015312797,0.00085762894,0.00034144553,0.110898405],"genre_scores_gemma":[0.7400717,0.0053658662,0.17954607,0.0018331583,0.002114174,0.00032518056,0.0011786941,0.00040394615,0.06916112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887174,0.00027036385,0.00007481873,0.00021963348,0.00036911032,0.00019428723],"domain_scores_gemma":[0.9981148,0.0008705735,0.00023579353,0.00024106452,0.00034971337,0.00018801447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014624622,0.0007540955,0.0007213318,0.0017454537,0.0009953788,0.002429113,0.0007585204,0.0013085471,0.01965289],"category_scores_gemma":[0.005883068,0.00032615117,0.0013054818,0.0009661714,0.002338008,0.0040118992,0.0019682082,0.0027006483,0.0037082147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012849788,0.000006713242,0.00006366116,0.000036875008,0.0000037748591,0.000042237833,0.0000901427,0.0006113045,0.00045267004,0.99044716,0.0018831849,0.006349394],"study_design_scores_gemma":[0.000006582706,0.00001549766,0.00008664699,0.00001893717,0.0000027849655,0.00011661684,0.0000380128,0.009883298,0.00019529348,0.9836143,0.0060127354,0.000009339314],"about_ca_topic_score_codex":0.0008087049,"about_ca_topic_score_gemma":0.0005907994,"teacher_disagreement_score":0.01965289,"about_ca_system_score_codex":0.0010706354,"about_ca_system_score_gemma":0.0007045232,"threshold_uncertainty_score":0.06574553},"labels":[],"label_agreement":null},{"id":"W2133591184","doi":"10.1109/cwit.2007.375724","title":"A Minimum Distance Bound for 1-Generator Quasi-Cyclic Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Generator (circuit theory); Algorithm; Computer science; Combinatorics; Mathematics; Physics","score_opus":0.01701784666429795,"score_gpt":0.26366443389470573,"score_spread":0.24664658723040778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133591184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.28421178,0.011850289,0.5151038,0.017333994,0.0012305956,0.00039029986,0.0060785,0.0027680523,0.16103269],"genre_scores_gemma":[0.84581256,0.0037458034,0.114982255,0.0022580393,0.0011073124,0.00081572286,0.0042239754,0.0006880424,0.02636627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99471635,0.0010741418,0.00020398691,0.0008881964,0.00210384,0.001013508],"domain_scores_gemma":[0.9768225,0.016098581,0.0010886573,0.0027864708,0.0019681824,0.0012355571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030647088,0.0014881854,0.0017479258,0.002350666,0.0022232737,0.0044022026,0.0034312147,0.0028591007,0.01304122],"category_scores_gemma":[0.024056697,0.00083078496,0.00084209134,0.00238739,0.0021482746,0.005407128,0.005056442,0.0043805228,0.0044839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020328877,0.00028889728,0.0031208408,0.00100491,0.000119134806,0.00042768955,0.00086742453,0.0890385,0.015638337,0.73532826,0.035838865,0.116294205],"study_design_scores_gemma":[0.00023266039,0.0005003944,0.0013209276,0.00033406212,0.00007855864,0.0008046799,0.0002506188,0.17017943,0.0091712065,0.79818004,0.01881176,0.00013565912],"about_ca_topic_score_codex":0.0015695497,"about_ca_topic_score_gemma":0.0019955349,"teacher_disagreement_score":0.01304122,"about_ca_system_score_codex":0.0040770266,"about_ca_system_score_gemma":0.0033369102,"threshold_uncertainty_score":0.043627262},"labels":[],"label_agreement":null},{"id":"W2133612207","doi":"10.1109/isit.2008.4595290","title":"Hyperbent functions, Kloosterman sums and Dickson polynomials","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Kloosterman sum; Monomial; Bent molecular geometry; TRACE (psycholinguistics); Mathematics; Class (philosophy); Zero (linguistics); Discrete mathematics; Point (geometry); Pure mathematics; Bent function; Combinatorics; Boolean function; Computer science; Artificial intelligence","score_opus":0.015110043568258688,"score_gpt":0.19495548663895348,"score_spread":0.1798454430706948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133612207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8446379,0.00419933,0.07930017,0.0007234032,0.00015505824,0.000025629239,0.00014732078,0.00012332942,0.07068793],"genre_scores_gemma":[0.9770198,0.0017175699,0.009674054,0.000118634656,0.00013430728,0.000015450618,0.00011835136,0.000038602884,0.011163146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997559,0.000035096735,0.00001243148,0.000035842786,0.00007356875,0.000087243505],"domain_scores_gemma":[0.99968123,0.00009918087,0.000073020725,0.00003692592,0.000046759116,0.00006289871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785656,0.0005156703,0.00027989698,0.001873273,0.00082195044,0.0011182379,0.0002623839,0.00042454328,0.002030298],"category_scores_gemma":[0.000862298,0.00015827313,0.00025582148,0.0011646859,0.002030041,0.0020525693,0.00082874496,0.00083840627,0.00048638173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006007037,0.000014363779,0.0008525371,0.000043878907,0.0000053075937,0.0001778932,0.00020585142,0.0023272096,0.003370467,0.9721825,0.0007651139,0.019994734],"study_design_scores_gemma":[0.000009298911,0.000056787325,0.001750694,0.00003632836,0.000008648242,0.0009955148,0.00026992403,0.0136418715,0.004217155,0.9678441,0.011133767,0.000035966263],"about_ca_topic_score_codex":0.00060524244,"about_ca_topic_score_gemma":0.0006049668,"teacher_disagreement_score":0.002030298,"about_ca_system_score_codex":0.0006692947,"about_ca_system_score_gemma":0.00029905527,"threshold_uncertainty_score":0.0067919493},"labels":[],"label_agreement":null},{"id":"W2134831983","doi":"10.1109/glocom.1993.318191","title":"Performance evaluation of partial erasure decoding for non-binary block codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); University of Victoria","funders":"","keywords":"Decoding methods; Erasure; Erasure code; List decoding; Computer science; Algorithm; Binary number; Code (set theory); Upper and lower bounds; Sequential decoding; Binary code; Mathematics; Arithmetic; Block code; Concatenated error correction code","score_opus":0.05298843826562864,"score_gpt":0.2768273245894315,"score_spread":0.22383888632380283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134831983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6573089,0.0031510333,0.31808904,0.00039792768,0.00008791822,0.000108206856,0.00048546013,0.002309024,0.018062487],"genre_scores_gemma":[0.9624758,0.00045944913,0.03518275,0.000036026122,0.000018710096,0.000036535494,0.0003502761,0.000077094155,0.0013633036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768794,0.00085544004,0.00008304397,0.000113421294,0.0010554948,0.00020465875],"domain_scores_gemma":[0.9912582,0.0055002444,0.00041031782,0.0007471153,0.0019435848,0.00014046463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018209126,0.00056769,0.0006348006,0.000665232,0.00038389824,0.00075967814,0.0005389706,0.00064669404,0.0021387648],"category_scores_gemma":[0.011348991,0.0001648498,0.00023875444,0.0008058555,0.0005528171,0.0010441273,0.0007703016,0.00030776128,0.0004184812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002161419,0.00007181677,0.006063712,0.00037170848,0.00015267686,0.00017342149,0.00016035074,0.7690149,0.041561615,0.024801869,0.0015278568,0.15393874],"study_design_scores_gemma":[0.000017651282,0.0005460728,0.0015366268,0.000018213315,0.000023143191,0.00022020769,0.000024700726,0.96058255,0.032730587,0.003281919,0.0009920357,0.000026356553],"about_ca_topic_score_codex":0.0018771564,"about_ca_topic_score_gemma":0.0017174393,"teacher_disagreement_score":0.0021387648,"about_ca_system_score_codex":0.00090542797,"about_ca_system_score_gemma":0.0008688995,"threshold_uncertainty_score":0.009629965},"labels":[],"label_agreement":null},{"id":"W2135125006","doi":"10.1109/asap.2007.4429981","title":"Run-Time Error Detection in Polynomial Basis Multiplication Using Linear Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Error detection and correction; Algorithm; Multiplication (music); Multiplier (economics); Overhead (engineering); Coding (social sciences); Cryptography; Very-large-scale integration; Polynomial; Arithmetic; Theoretical computer science; Mathematics; Embedded system","score_opus":0.02201343657687921,"score_gpt":0.2733461848330555,"score_spread":0.2513327482561763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135125006","genre_codex":"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.51560533,0.0006458143,0.48086986,0.00017353921,0.000033370266,0.000056241133,0.000024042072,0.001004757,0.0015870797],"genre_scores_gemma":[0.94755876,0.00013061176,0.05142196,0.000027927545,0.000014761298,0.000024250661,0.000018719062,0.000032618893,0.0007703545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997045,0.000999407,0.00011835322,0.00030294582,0.0011854611,0.00034883153],"domain_scores_gemma":[0.9911739,0.005528255,0.001463019,0.0010803512,0.0006730699,0.000081412305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002469506,0.0005703021,0.00066333724,0.000686972,0.0004937424,0.0009209342,0.00068816583,0.00070569234,0.0007615617],"category_scores_gemma":[0.010957329,0.00025113003,0.00031105767,0.00076180225,0.0011217699,0.0017699769,0.0006753574,0.0006754491,0.00022176627],"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.002873456,0.00033260256,0.007632596,0.00043101102,0.00016325498,0.00093795324,0.00059643446,0.57345784,0.13975625,0.070334874,0.0008247548,0.20265898],"study_design_scores_gemma":[0.000052581687,0.0004639404,0.00054757576,0.000023193126,0.000033676162,0.00034695244,0.000036112164,0.8955937,0.0911661,0.011064737,0.0006376611,0.00003382316],"about_ca_topic_score_codex":0.000855026,"about_ca_topic_score_gemma":0.0007490955,"teacher_disagreement_score":0.002469506,"about_ca_system_score_codex":0.0007560844,"about_ca_system_score_gemma":0.00081361004,"threshold_uncertainty_score":0.0130601525},"labels":[],"label_agreement":null},{"id":"W2135574494","doi":"10.1109/cec.2006.1688376","title":"Cryptanalysis of Simple Substitution Ciphers Using Particle Swarm Optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Particle swarm optimization; Simple (philosophy); Cryptanalysis; Substitution (logic); Computer science; Differential cryptanalysis; S-box; Multi-swarm optimization; Algorithm; Linear cryptanalysis; Cryptography; Block cipher","score_opus":0.015780392814333803,"score_gpt":0.23491693762307495,"score_spread":0.21913654480874115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135574494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.30477038,0.00040522416,0.69077814,0.00025689026,0.00007237331,0.00013044575,0.000035157784,0.00033151745,0.0032198848],"genre_scores_gemma":[0.8762829,0.00026594062,0.122291945,0.00003143245,0.000020361567,0.000044389046,0.000031069805,0.000018538198,0.0010134412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939525,0.0002207903,0.000036037458,0.00005453099,0.00024873434,0.000044659835],"domain_scores_gemma":[0.9985442,0.0008933694,0.00020305264,0.00021323978,0.000116047195,0.000030101886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009035252,0.0005080657,0.00064554246,0.00053889194,0.00032747656,0.00049117237,0.0003438121,0.0005088535,0.00068183],"category_scores_gemma":[0.002631341,0.00017562429,0.00048760048,0.0004835441,0.00097126426,0.00088917126,0.00044056156,0.000546897,0.00017005052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079372455,0.0002583319,0.003726662,0.0002816194,0.0002867721,0.0003953807,0.00020525238,0.6588463,0.0851024,0.069347285,0.0009304419,0.17982578],"study_design_scores_gemma":[0.000034081997,0.00014540604,0.00035851917,0.0000053762924,0.000013972464,0.00007848085,0.000007722445,0.9750044,0.018040607,0.005870217,0.0004342712,0.000006927903],"about_ca_topic_score_codex":0.00053050014,"about_ca_topic_score_gemma":0.0004415624,"teacher_disagreement_score":0.0009035252,"about_ca_system_score_codex":0.0002750383,"about_ca_system_score_gemma":0.00039208643,"threshold_uncertainty_score":0.004778385},"labels":[],"label_agreement":null},{"id":"W2136017419","doi":"10.1109/tit.2008.928999","title":"New Binary Sequences With Optimal Autocorrelation Magnitude","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Lakehead University","funders":"","keywords":"Autocorrelation; Binary number; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Statistics; Arithmetic","score_opus":0.010572955385884828,"score_gpt":0.20558574709073885,"score_spread":0.19501279170485403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136017419","genre_codex":"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.5444265,0.0015247032,0.40706247,0.0009292411,0.0006283834,0.00016707767,0.0008703905,0.00090237387,0.043488856],"genre_scores_gemma":[0.7526487,0.00050981296,0.22537744,0.00024029873,0.00012609769,0.00014485104,0.00094820274,0.00012892488,0.019875644],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.00006890923,0.000039804887,0.00006414685,0.00016568122,0.00007863799],"domain_scores_gemma":[0.99913555,0.00022443422,0.00016663337,0.00014092485,0.00025085823,0.00008159527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035188248,0.00042846386,0.00039613727,0.0008976759,0.0003793314,0.0008758078,0.00035507302,0.00059105025,0.004688524],"category_scores_gemma":[0.002258379,0.00024278359,0.00023372586,0.00073980767,0.00042053012,0.0011145236,0.00059674296,0.0004947138,0.0011502665],"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.0014760608,0.00019374375,0.0025920824,0.0004488125,0.000055422926,0.0008269743,0.00032504014,0.038367637,0.27660188,0.32028237,0.0064485893,0.35238138],"study_design_scores_gemma":[0.00036748132,0.0009046875,0.003841345,0.00018844799,0.00013906101,0.002775063,0.000257002,0.36008635,0.4087806,0.1417663,0.080676384,0.00021721322],"about_ca_topic_score_codex":0.0002927523,"about_ca_topic_score_gemma":0.0006165495,"teacher_disagreement_score":0.004688524,"about_ca_system_score_codex":0.0007762186,"about_ca_system_score_gemma":0.00060894183,"threshold_uncertainty_score":0.015684724},"labels":[],"label_agreement":null},{"id":"W2136633702","doi":"10.1109/isit.2011.6033971","title":"Density and bounds for Grassmannian codes with chordal distance","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Grassmannian; Cardinality (data modeling); Hamming distance; Combinatorics; Minimum distance; Mathematics; Generalization; Upper and lower bounds; Hamming code; Code (set theory); RADIUS; Discrete mathematics; Hamming bound; Chordal graph; Decoding methods; Computer science; Algorithm; Block code; Mathematical analysis","score_opus":0.019060088395175593,"score_gpt":0.20713922864880618,"score_spread":0.1880791402536306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136633702","genre_codex":"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.4985057,0.005543406,0.46346235,0.0019649914,0.00013305152,0.00011470797,0.00089499704,0.00043484435,0.028945941],"genre_scores_gemma":[0.96545523,0.0022692252,0.02725645,0.00018293933,0.00023040482,0.0001655598,0.000490818,0.00012937908,0.0038200098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975745,0.0005648898,0.0000974525,0.0003800909,0.00088015856,0.00050293753],"domain_scores_gemma":[0.98113936,0.01310815,0.001767267,0.0014612359,0.0014132588,0.0011107754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020910704,0.0009706796,0.0011446091,0.002415375,0.0014476025,0.0022662308,0.002320984,0.0012774123,0.0038722407],"category_scores_gemma":[0.025416877,0.0005809961,0.0006547974,0.0023260445,0.0033807117,0.006005645,0.0039784587,0.0020894264,0.0006312934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033236635,0.00006801499,0.0040154285,0.00027474322,0.000051239553,0.0002296634,0.00068427384,0.09142537,0.004751487,0.87720144,0.0025397006,0.018426355],"study_design_scores_gemma":[0.000027135326,0.00011674004,0.0021773386,0.000105722225,0.000030448056,0.0004735548,0.00028048528,0.38398114,0.0065830653,0.60254693,0.0035948383,0.00008268971],"about_ca_topic_score_codex":0.0026387195,"about_ca_topic_score_gemma":0.0013265876,"teacher_disagreement_score":0.0038722407,"about_ca_system_score_codex":0.0030278494,"about_ca_system_score_gemma":0.00090617326,"threshold_uncertainty_score":0.021968722},"labels":[],"label_agreement":null},{"id":"W2137543927","doi":"10.1109/tit.2013.2257918","title":"Upper Bounds on Matching Families in &lt;formula formulatype=\"inline\"&gt; &lt;tex Notation=\"TeX\"&gt;$\\BBZ_{pq}^{n}$&lt;/tex&gt;&lt;/formula&gt;","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Matching (statistics); Combinatorics; Upper and lower bounds; Modulo; Discrete mathematics; Mathematics; Statistics; Mathematical analysis","score_opus":0.007942866790031734,"score_gpt":0.21923461337938616,"score_spread":0.21129174658935443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137543927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.12844212,0.012214411,0.6659974,0.016841907,0.00102496,0.0009814643,0.0101560885,0.012354849,0.1519868],"genre_scores_gemma":[0.56898314,0.009987773,0.33256534,0.006557404,0.0025987052,0.0025888258,0.014228318,0.007784233,0.05470628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.982509,0.0032533973,0.0009359554,0.00353222,0.005238968,0.004530463],"domain_scores_gemma":[0.88614494,0.09101685,0.0035485073,0.012492325,0.003840007,0.002957325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009264397,0.004569496,0.0043446445,0.0031277821,0.0052805897,0.008270612,0.008327426,0.0045086904,0.047611747],"category_scores_gemma":[0.05628968,0.0022203857,0.0044417307,0.0057991417,0.0049186745,0.03752693,0.012210909,0.009773497,0.017318498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004204891,0.0013686003,0.007955834,0.0032847002,0.00048619317,0.0011554847,0.002169057,0.11032418,0.028377738,0.4847441,0.11972317,0.23620611],"study_design_scores_gemma":[0.00032247292,0.00039172612,0.0016036879,0.00049754017,0.0004168408,0.0015125003,0.00047210988,0.25430116,0.027269844,0.66481805,0.048130948,0.00026300128],"about_ca_topic_score_codex":0.0037576142,"about_ca_topic_score_gemma":0.0053978534,"teacher_disagreement_score":0.047611747,"about_ca_system_score_codex":0.007991056,"about_ca_system_score_gemma":0.005921086,"threshold_uncertainty_score":0.15927714},"labels":[],"label_agreement":null},{"id":"W2139020064","doi":"10.1109/ccece.2003.1226390","title":"Reed-Solomon encoder &amp; decoder design, simulation and synthesis","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Encoder; Computer science; Reed–Solomon error correction; Decoding methods; Error detection and correction; Soft-decision decoder; Computer hardware; Forward error correction; Bit error rate; Complex programmable logic device; Block (permutation group theory); Wireless; Transmission (telecommunications); Embedded system; Block code; Algorithm; Concatenated error correction code; Telecommunications","score_opus":0.04210580553516231,"score_gpt":0.27345639281737877,"score_spread":0.23135058728221647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139020064","genre_codex":"methods","genre_gemma":"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.015584854,0.00069297233,0.9635298,0.00018986246,0.00013664199,0.00021156664,0.00037281422,0.003397424,0.015884101],"genre_scores_gemma":[0.33329138,0.0016051198,0.64086425,0.00012244242,0.00006621507,0.00043128594,0.000745959,0.00034128624,0.022532016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965286,0.00006334491,0.000029041212,0.000031810054,0.00019317678,0.000029683411],"domain_scores_gemma":[0.9996966,0.000108077904,0.000027415332,0.00003982233,0.000120261735,0.000007864218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062457,0.0003614584,0.0002827222,0.00039877015,0.00020643802,0.0005607145,0.00048808506,0.00030320892,0.0034553425],"category_scores_gemma":[0.0008422241,0.00020283528,0.00020508001,0.00023863862,0.00019556018,0.00039540062,0.00018462255,0.00037595685,0.002021957],"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.00035039036,0.00010697289,0.0017048448,0.001436134,0.00008886719,0.0004665476,0.00035136126,0.16450007,0.23465165,0.09660942,0.008610754,0.49112296],"study_design_scores_gemma":[0.00010637275,0.0005643625,0.0007724433,0.00015466209,0.00007107786,0.00088850426,0.00005519361,0.38830978,0.4584063,0.01499818,0.13561976,0.00005327183],"about_ca_topic_score_codex":0.0007118169,"about_ca_topic_score_gemma":0.000736538,"teacher_disagreement_score":0.0034553425,"about_ca_system_score_codex":0.0003264775,"about_ca_system_score_gemma":0.0006600523,"threshold_uncertainty_score":0.011559248},"labels":[],"label_agreement":null},{"id":"W2139208616","doi":"10.5555/510378.510477","title":"A new class of linear feedback shift register generators","year":2000,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Shift register; Generator (circuit theory); Finite field; Linear congruential generator; Randomness; Polynomial; Nonlinear system; Linear feedback shift register; Class (philosophy); Computer science; Mathematics; Discrete mathematics; Telecommunications; Mathematical analysis; Power (physics); Electrical engineering; Artificial intelligence; Engineering","score_opus":0.02978063360897829,"score_gpt":0.2667799408689723,"score_spread":0.236999307259994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139208616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.065038614,0.0015493025,0.9017473,0.00052908226,0.00044522693,0.00020106474,0.00026184326,0.002096261,0.028131267],"genre_scores_gemma":[0.7575971,0.0013231633,0.2081169,0.00055800116,0.0007574702,0.00038205608,0.00056265824,0.00025231251,0.030450309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960965,0.00005888417,0.000023832643,0.000095848445,0.00015134226,0.000060498383],"domain_scores_gemma":[0.9995857,0.000114192066,0.000063045474,0.000111203415,0.000081229315,0.000044627344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033083296,0.00043910896,0.00040473952,0.0007104229,0.00039170723,0.0008408192,0.00068216183,0.00049136626,0.004547547],"category_scores_gemma":[0.0010380652,0.00020309673,0.00037750925,0.0004370781,0.000555821,0.0015810393,0.00075524725,0.00081200746,0.0011042877],"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.00026663393,0.000119685166,0.0009380378,0.00020772978,0.00004446807,0.0006026485,0.00018667257,0.01885553,0.08238477,0.65336984,0.007222432,0.23580158],"study_design_scores_gemma":[0.0002739261,0.00059874565,0.00095969345,0.000087782624,0.000071023955,0.002930858,0.000056937253,0.34511566,0.076102,0.43761775,0.13605587,0.00012972899],"about_ca_topic_score_codex":0.000101383106,"about_ca_topic_score_gemma":0.00014217499,"teacher_disagreement_score":0.004547547,"about_ca_system_score_codex":0.00031936128,"about_ca_system_score_gemma":0.0003390675,"threshold_uncertainty_score":0.015213013},"labels":[],"label_agreement":null},{"id":"W2139563752","doi":"10.1016/s0012-365x(03)00158-4","title":"On the iteration of certain quadratic maps over GF(p)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic equation; GF(2); Combinatorics; Discrete mathematics; Finite field","score_opus":0.015836492332065445,"score_gpt":0.2384164064629816,"score_spread":0.22257991413091616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139563752","genre_codex":"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.5911467,0.00042309493,0.30130744,0.0010688914,0.00023673277,0.00016579177,0.00020089718,0.0004539999,0.10499643],"genre_scores_gemma":[0.93146604,0.00034429698,0.039763495,0.00017206321,0.00022777896,0.00013395109,0.00026007867,0.00019289032,0.02743941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824834,0.0005183379,0.00007079125,0.00019653552,0.00049192226,0.00047409232],"domain_scores_gemma":[0.9967528,0.0019582612,0.00032900163,0.0003215084,0.00038929546,0.0002491201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013607226,0.00059604045,0.0006896835,0.0010040638,0.0015044564,0.0023451073,0.00073406094,0.0009814668,0.006581309],"category_scores_gemma":[0.0058207484,0.0003252485,0.0008013998,0.0009774049,0.0026297884,0.0031193767,0.0018756462,0.001835916,0.0011021994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004552948,0.000082646606,0.0009423079,0.00005545203,0.000017002214,0.00023725588,0.0007144945,0.015261969,0.0036994314,0.96271783,0.0014889193,0.014327478],"study_design_scores_gemma":[0.0000674877,0.00016764119,0.0005160148,0.00003760891,0.000016774859,0.00030171298,0.00018366467,0.12016889,0.009579275,0.86475223,0.0041635423,0.000045105906],"about_ca_topic_score_codex":0.0009523142,"about_ca_topic_score_gemma":0.00084048806,"teacher_disagreement_score":0.006581309,"about_ca_system_score_codex":0.0010303844,"about_ca_system_score_gemma":0.0009559314,"threshold_uncertainty_score":0.022016644},"labels":[],"label_agreement":null},{"id":"W2139812902","doi":"10.48550/arxiv.1510.06999","title":"On a problem of Sidon for polynomials over finite fields","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Omega; Combinatorics; Conjecture; Physics; Integer (computer science); Polynomial; Mathematics; Mathematical analysis; Quantum mechanics","score_opus":0.08083855480742418,"score_gpt":0.20205503985040998,"score_spread":0.12121648504298581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139812902","genre_codex":"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.30098903,0.0069516804,0.27598563,0.14477785,0.0057770982,0.00024922422,0.0014511342,0.0012996271,0.2625187],"genre_scores_gemma":[0.81904036,0.0029290272,0.06885036,0.010074227,0.0037453184,0.00025887144,0.0014715537,0.00080717116,0.092822984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964881,0.0011716319,0.00018193669,0.0007490217,0.00053410104,0.00087516947],"domain_scores_gemma":[0.98900115,0.008318852,0.0004219023,0.0008679875,0.0007077805,0.00068224664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004576318,0.0011940269,0.0025799358,0.0022815024,0.0064698528,0.004346445,0.0021223521,0.0053518717,0.014129392],"category_scores_gemma":[0.025413144,0.00086826977,0.0026502097,0.0031245158,0.0063675367,0.016346399,0.006125608,0.0071163257,0.002273533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020423405,0.00006920943,0.00087390974,0.000103473234,0.000019442565,0.00014655828,0.0005243621,0.0023503415,0.00032094537,0.964981,0.017200036,0.013206395],"study_design_scores_gemma":[0.00006543415,0.000044657125,0.00029058018,0.000045238845,0.000016441352,0.000105775456,0.00028212328,0.014780851,0.00037594617,0.96653426,0.017423026,0.000035647794],"about_ca_topic_score_codex":0.0063805985,"about_ca_topic_score_gemma":0.0048061116,"teacher_disagreement_score":0.014129392,"about_ca_system_score_codex":0.0069377185,"about_ca_system_score_gemma":0.0031183003,"threshold_uncertainty_score":0.050336838},"labels":[],"label_agreement":null},{"id":"W2141324117","doi":"10.1016/j.disc.2015.05.025","title":"Generalized de Bruijn words for primitive words and powers","year":2015,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Word (group theory); Alphabet; Mathematics; Order (exchange); Upper and lower bounds; Combinatorics on words; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.03411923224235038,"score_gpt":0.2946641922986173,"score_spread":0.2605449600562669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141324117","genre_codex":"methods","genre_gemma":"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.2764235,0.007518003,0.3547751,0.00978165,0.0025890137,0.0002289237,0.0012112305,0.00069612946,0.34677655],"genre_scores_gemma":[0.8724216,0.0025584332,0.04662768,0.0013949693,0.0021067248,0.00026360326,0.00049188716,0.0003565032,0.07377847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998251,0.0005645431,0.00010526269,0.00036370856,0.0004444524,0.0002708661],"domain_scores_gemma":[0.9978083,0.0010514404,0.00026823403,0.0004335612,0.00025098963,0.00018747518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011701136,0.0013159603,0.0013348929,0.003166048,0.0025779523,0.0062248698,0.0012992277,0.0020885337,0.012925594],"category_scores_gemma":[0.004845796,0.00086954806,0.00091915426,0.0036250683,0.0063407025,0.009217222,0.003464161,0.004678051,0.0030087626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010468427,0.0000035106261,0.00002016682,0.000013249482,0.0000014925213,0.000023832064,0.000092536044,0.00015898827,0.00017024692,0.9971765,0.00057491334,0.0017541476],"study_design_scores_gemma":[0.0000035743853,0.000002042523,0.000014307784,0.000006663911,0.0000016392282,0.000036173387,0.000022673174,0.0005176565,0.00011748635,0.9967174,0.0025559664,0.00000437565],"about_ca_topic_score_codex":0.00059115706,"about_ca_topic_score_gemma":0.000533189,"teacher_disagreement_score":0.012925594,"about_ca_system_score_codex":0.0018649573,"about_ca_system_score_gemma":0.0007875819,"threshold_uncertainty_score":0.043240428},"labels":[],"label_agreement":null},{"id":"W2141337917","doi":"10.1109/glocom.1993.318116","title":"Unicity distance of linear and non-linear pseudonoise sequence generators for direct-sequence spread spectrum systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Pseudorandom noise; Plaintext; Cryptosystem; Sequence (biology); Mathematics; Cryptography; Code (set theory); Spread spectrum; Discrete mathematics; Ciphertext; Function (biology); Shift register; Algorithm; Combinatorics; Computer science; Encryption; Code division multiple access; Telecommunications; Computer network; Biology","score_opus":0.037596086758551535,"score_gpt":0.2530975084620982,"score_spread":0.2155014217035467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141337917","genre_codex":"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.6233186,0.002686667,0.35411632,0.00046197485,0.00006958914,0.000105386265,0.00018801166,0.00040957323,0.01864378],"genre_scores_gemma":[0.9704564,0.00047414654,0.026843267,0.000037902264,0.000028795008,0.000039025723,0.00012227583,0.00003454353,0.0019635553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855906,0.00049419404,0.0001029243,0.00014668769,0.0005690841,0.00012793316],"domain_scores_gemma":[0.98384655,0.0121043855,0.0013921863,0.0010753662,0.0012500357,0.0003315131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016971721,0.00037606223,0.0003502382,0.0014085397,0.0005169942,0.0012418323,0.00038749902,0.00052433315,0.0018475886],"category_scores_gemma":[0.015769642,0.00025704148,0.0001377757,0.00089370017,0.0010238352,0.0020802468,0.001145209,0.00060933805,0.0003797227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022168173,0.0001555059,0.0067524663,0.00042921244,0.00005553529,0.0005609235,0.001334596,0.3007819,0.056311205,0.45913446,0.0021445767,0.17012289],"study_design_scores_gemma":[0.00006929419,0.0010595452,0.003598194,0.000075706135,0.000037457605,0.0020238836,0.00026592225,0.7976452,0.044575136,0.14546014,0.0050753923,0.000114205744],"about_ca_topic_score_codex":0.00042536628,"about_ca_topic_score_gemma":0.0004165374,"teacher_disagreement_score":0.0018475886,"about_ca_system_score_codex":0.0011377361,"about_ca_system_score_gemma":0.00066078024,"threshold_uncertainty_score":0.008975565},"labels":[],"label_agreement":null},{"id":"W2141363069","doi":"10.1145/1277548.1277590","title":"Faster algorithms for the characteristic polynomial","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field (mathematics); Polynomial; Algorithm; Time complexity; Matrix (chemical analysis); Computational complexity theory; Computer science; Discrete mathematics; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.024563613840982063,"score_gpt":0.26749654145927426,"score_spread":0.2429329276182922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141363069","genre_codex":"methods","genre_gemma":"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.019412545,0.0006177328,0.9671783,0.0008864925,0.0002622054,0.00017185013,0.00018507612,0.005695219,0.0055906223],"genre_scores_gemma":[0.27217972,0.0005705365,0.71239513,0.00048106821,0.0004613954,0.00045473492,0.0009238875,0.000959789,0.011573776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955016,0.0008414323,0.00017851633,0.001220672,0.0016431233,0.0006146905],"domain_scores_gemma":[0.9925039,0.0029319138,0.0006006681,0.002845022,0.000877065,0.00024143948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022277154,0.0016731635,0.0016537705,0.0022256477,0.0012424823,0.0028429313,0.0028913238,0.0019748784,0.019602071],"category_scores_gemma":[0.010762756,0.00083510973,0.0016392244,0.0022453705,0.0015355283,0.009691102,0.0033234672,0.0036442168,0.004932735],"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.0011350682,0.0004940467,0.0015079835,0.00046887458,0.00016906501,0.0002176991,0.00034591855,0.10054576,0.035871822,0.3748383,0.031467568,0.452938],"study_design_scores_gemma":[0.00065251865,0.00027784388,0.00055798906,0.00007048199,0.00006504224,0.0003525804,0.000084882624,0.674496,0.016192213,0.2860394,0.021096501,0.00011451261],"about_ca_topic_score_codex":0.0033953877,"about_ca_topic_score_gemma":0.004572616,"teacher_disagreement_score":0.019602071,"about_ca_system_score_codex":0.002826544,"about_ca_system_score_gemma":0.00311978,"threshold_uncertainty_score":0.06557542},"labels":[],"label_agreement":null},{"id":"W2141750148","doi":"10.1109/ccece.1998.682777","title":"Differential-like cryptanalysis of a class of substitution-permutation networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Differential cryptanalysis; Linear cryptanalysis; Higher-order differential cryptanalysis; Block cipher; Permutation (music); Computer science; Substitution (logic); Differential (mechanical device); Cryptanalysis; Boomerang attack; Class (philosophy); Impossible differential cryptanalysis; Theoretical computer science; Algorithm; Mathematics; Cryptography; Artificial intelligence; Engineering; Physics","score_opus":0.013799964398430127,"score_gpt":0.20778171277029392,"score_spread":0.1939817483718638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141750148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.35501096,0.0003937847,0.6184198,0.0009787341,0.0001231399,0.00019981155,0.00012498462,0.0005130714,0.024235642],"genre_scores_gemma":[0.9464577,0.00021390614,0.050266847,0.00015687436,0.000036135305,0.000081043014,0.00006908113,0.000024208764,0.0026942762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991683,0.0002550127,0.000036329828,0.00012127256,0.00027428573,0.00014480525],"domain_scores_gemma":[0.9982827,0.0008523715,0.00020930756,0.0004300764,0.00015151672,0.00007404568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078619126,0.00038156807,0.0003720522,0.0005522041,0.00069249084,0.0006995048,0.0005582875,0.00080206525,0.0017179186],"category_scores_gemma":[0.0026461945,0.00020208415,0.00037828845,0.0005272341,0.0013410476,0.0021078035,0.0011396848,0.0012607048,0.00029629533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000570548,0.00013335243,0.0030628676,0.00013649643,0.00008426763,0.0010183697,0.00034377337,0.07100269,0.08285711,0.734388,0.0032788932,0.10312369],"study_design_scores_gemma":[0.000070923146,0.0003768879,0.0010130677,0.000036630936,0.000045348883,0.0019540011,0.00009273706,0.60531336,0.08130457,0.29421565,0.015532726,0.000044145036],"about_ca_topic_score_codex":0.00024951072,"about_ca_topic_score_gemma":0.00027605816,"teacher_disagreement_score":0.0017179186,"about_ca_system_score_codex":0.00073899596,"about_ca_system_score_gemma":0.0005093689,"threshold_uncertainty_score":0.0057470202},"labels":[],"label_agreement":null},{"id":"W2142061932","doi":"10.1112/s1461157013000223","title":"Wieferich pairs and Barker sequences, II","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Simon Fraser University; Western Canada Research Grid; Compute Canada; Simons Foundation","keywords":"Circulant matrix; Sequence (biology); Prime (order theory); Hadamard transform; Computation; Matrix (chemical analysis); Hadamard matrix; Multiple","score_opus":0.011219062029175237,"score_gpt":0.23235483853112363,"score_spread":0.22113577650194838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142061932","genre_codex":"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.7564403,0.0016431292,0.12253796,0.0019767992,0.0006494356,0.0001739876,0.0006622238,0.0006952976,0.1152208],"genre_scores_gemma":[0.93218523,0.0005230344,0.051336527,0.0003261664,0.00022699164,0.000084531166,0.0005876793,0.00009377596,0.014636031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991848,0.00017462205,0.000057743335,0.00016269114,0.0002290046,0.00019107701],"domain_scores_gemma":[0.9982942,0.0008510168,0.00030039682,0.0002647582,0.00012230444,0.0001673881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365873,0.0006156664,0.0006904921,0.0015973464,0.0018244643,0.0019988262,0.0006158861,0.0011325076,0.015574682],"category_scores_gemma":[0.00551378,0.00036150252,0.00049118925,0.0013654012,0.0015551457,0.0029840174,0.0012705565,0.0018658707,0.002403731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006634666,0.000118681404,0.001887434,0.00017951298,0.000016468412,0.0005945626,0.00042560213,0.0060394458,0.0148076415,0.92363447,0.0049827094,0.046649996],"study_design_scores_gemma":[0.000106890955,0.00033409562,0.0010878661,0.00009991002,0.000027867185,0.00092714856,0.00037683218,0.018602317,0.028567646,0.92796606,0.021832753,0.00007072611],"about_ca_topic_score_codex":0.0004227498,"about_ca_topic_score_gemma":0.0005607373,"teacher_disagreement_score":0.015574682,"about_ca_system_score_codex":0.00087036827,"about_ca_system_score_gemma":0.000833704,"threshold_uncertainty_score":0.052102566},"labels":[],"label_agreement":null},{"id":"W2142080379","doi":"10.1109/asap.1995.522931","title":"An array processor for inner product computations using a Fermat number ALU","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Fermat's Last Theorem; Computation; Product (mathematics); Ring (chemistry); Computer science; Polynomial; Moduli; Parallel computing; Polynomial ring; Computational complexity theory; Mathematics; Computational science; Algorithm; Discrete mathematics; Physics; Geometry; Mathematical analysis","score_opus":0.04894018998387789,"score_gpt":0.2960886673696947,"score_spread":0.2471484773858168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142080379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.11497039,0.0009403169,0.84212226,0.00039909157,0.00024964413,0.00013942296,0.00018685646,0.007111012,0.033881027],"genre_scores_gemma":[0.40505496,0.00047896328,0.57753354,0.0002672495,0.0001532459,0.00017766157,0.00042272615,0.000252492,0.01565912],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997733,0.00004311213,0.000019553701,0.00004602499,0.0000773476,0.00004061703],"domain_scores_gemma":[0.9996661,0.00011667778,0.000026121748,0.00008217093,0.000088717316,0.00002030956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002545114,0.0004509683,0.00048806248,0.0006112555,0.0008521654,0.0010063048,0.001485049,0.00048234142,0.008760618],"category_scores_gemma":[0.00079587474,0.0002803101,0.0003940783,0.00090090366,0.0005845248,0.0020593002,0.00084731705,0.00072176737,0.003642109],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013844284,0.00028163425,0.0019939493,0.00043384402,0.000095125455,0.00043763322,0.0006033584,0.033140723,0.19654456,0.17381115,0.017061828,0.5742118],"study_design_scores_gemma":[0.00024075524,0.002007307,0.00092839194,0.000114627044,0.00020035479,0.0010236616,0.00034085644,0.43372396,0.3377103,0.07747936,0.14607807,0.0001523904],"about_ca_topic_score_codex":0.00066588575,"about_ca_topic_score_gemma":0.0009020938,"teacher_disagreement_score":0.008760618,"about_ca_system_score_codex":0.00052409456,"about_ca_system_score_gemma":0.00057637383,"threshold_uncertainty_score":0.029307246},"labels":[],"label_agreement":null},{"id":"W2143019587","doi":"10.1109/tit.2002.804044","title":"New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Mathematics; Linear span; Sequence (biology); Quadratic equation; Binary number; Span (engineering); Discrete mathematics; Algorithm; Combinatorics; Statistics; Arithmetic; Engineering","score_opus":0.016014499892090993,"score_gpt":0.23097149485726928,"score_spread":0.21495699496517828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143019587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.10463452,0.0014401174,0.8846711,0.00030261066,0.00015853222,0.00017912957,0.0001997898,0.0009777433,0.0074364943],"genre_scores_gemma":[0.5475333,0.00087038364,0.4440228,0.00031977816,0.0002769379,0.00056655955,0.00057011185,0.000114948016,0.005725141],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931943,0.00017831483,0.00007660278,0.00011807851,0.00021794773,0.00008957805],"domain_scores_gemma":[0.9987192,0.0004032693,0.0002654948,0.0002235492,0.00032165524,0.00006684167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074017263,0.0006999669,0.0004532702,0.00071670354,0.0006640314,0.00053847046,0.00078881707,0.00047279266,0.0028477288],"category_scores_gemma":[0.0021268043,0.00029314889,0.00035173172,0.00080889714,0.0004952533,0.0012700375,0.00071121915,0.0006534592,0.0008709224],"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.0019213533,0.00022573417,0.002061558,0.000685561,0.00012599748,0.0009414532,0.0005813222,0.037588656,0.21241249,0.14423735,0.0068123764,0.5924061],"study_design_scores_gemma":[0.0006858656,0.0042792163,0.0031584299,0.00045333098,0.00031735067,0.005955861,0.0003133649,0.34910378,0.3913013,0.13418716,0.11001098,0.00023338727],"about_ca_topic_score_codex":0.00028879143,"about_ca_topic_score_gemma":0.0005532609,"teacher_disagreement_score":0.0028477288,"about_ca_system_score_codex":0.00067484623,"about_ca_system_score_gemma":0.0004236868,"threshold_uncertainty_score":0.00952661},"labels":[],"label_agreement":null},{"id":"W2143563649","doi":"10.1145/1837210.1837233","title":"Parallel sparse polynomial interpolation over finite fields","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Finite field; Interpolation (computer graphics); Polynomial; Polynomial interpolation; Probabilistic logic; Mathematics; Zero (linguistics); Field (mathematics); Algorithm; Computer science; Applied mathematics; Discrete mathematics; Pure mathematics; Linear interpolation; Mathematical analysis; Artificial intelligence; Statistics","score_opus":0.011980715784398358,"score_gpt":0.23437907440278627,"score_spread":0.22239835861838791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143563649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.016526671,0.000057295678,0.9800142,0.00013420584,0.00002896413,0.00004350798,0.00006692873,0.0012663173,0.0018619181],"genre_scores_gemma":[0.40074408,0.00013837649,0.5932562,0.00012627026,0.00007657517,0.000152396,0.00036490167,0.00024208747,0.0048990566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873036,0.0002232315,0.00007609947,0.00025961426,0.0005418722,0.00016884855],"domain_scores_gemma":[0.998064,0.0006859504,0.00017655903,0.0007133891,0.0002769865,0.00008310126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013696242,0.0005925775,0.0009335157,0.00072667206,0.0008723763,0.0010150399,0.0014044732,0.0007535546,0.00495277],"category_scores_gemma":[0.004684263,0.00037199454,0.00079805887,0.0012141903,0.0010876573,0.0026787913,0.0029436874,0.0014097724,0.0015598335],"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.0013835594,0.00023440488,0.002295402,0.00021346798,0.00007998319,0.0002484978,0.00028839416,0.25621742,0.026487717,0.26582673,0.0048942477,0.44183013],"study_design_scores_gemma":[0.00008368432,0.00014652724,0.00019022365,0.000016615248,0.000020629517,0.00015528918,0.00003127809,0.857546,0.024854103,0.1112716,0.005655535,0.000028526212],"about_ca_topic_score_codex":0.0012198979,"about_ca_topic_score_gemma":0.001698212,"teacher_disagreement_score":0.00495277,"about_ca_system_score_codex":0.00074263377,"about_ca_system_score_gemma":0.0013883903,"threshold_uncertainty_score":0.016568601},"labels":[],"label_agreement":null},{"id":"W2144302285","doi":"10.1109/newcas.2012.6328942","title":"Stochastic chase decoder for reed-solomon codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Field-programmable gate array; Soft-decision decoder; Coding gain; Coding (social sciences); Code (set theory); Reed–Solomon error correction; Parallel computing; Algorithm; Computer hardware; Concatenated error correction code; Mathematics; Programming language; Block code","score_opus":0.0375525481023082,"score_gpt":0.28780112929294377,"score_spread":0.2502485811906356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144302285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.028354662,0.0005854946,0.96194214,0.00023072773,0.00009589632,0.00010730358,0.00014369162,0.0014458532,0.007094187],"genre_scores_gemma":[0.5373763,0.00073325477,0.4487236,0.0003953646,0.00013715865,0.00019169008,0.00047282386,0.00012911433,0.011840778],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938667,0.00012885046,0.000033007473,0.000054621138,0.00034534186,0.00005144754],"domain_scores_gemma":[0.99943966,0.0002376152,0.000059414,0.00006974431,0.00017021447,0.000023303608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033252724,0.00040822133,0.0003231323,0.00045907084,0.0002982128,0.00058608234,0.00051198335,0.000522899,0.002391483],"category_scores_gemma":[0.001357236,0.00019411596,0.0002520639,0.0003959204,0.00031868913,0.0004638645,0.0004633945,0.00058583746,0.0012846525],"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.0007571106,0.00015887708,0.0016339994,0.00057643437,0.00015643242,0.00056114496,0.00017579885,0.11391091,0.385256,0.1371224,0.006920211,0.3527707],"study_design_scores_gemma":[0.00013326229,0.00052056107,0.0009313563,0.000074769196,0.000062872874,0.0013940638,0.000027036953,0.63034207,0.3192698,0.0145894755,0.032573808,0.000080947844],"about_ca_topic_score_codex":0.00077602227,"about_ca_topic_score_gemma":0.0015238305,"teacher_disagreement_score":0.002391483,"about_ca_system_score_codex":0.00040732473,"about_ca_system_score_gemma":0.00082728337,"threshold_uncertainty_score":0.008000314},"labels":[],"label_agreement":null},{"id":"W2144323841","doi":"10.1109/tit.2011.2159478","title":"Two New Measures for Permutations: Ambiguity and Deficiency","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Abelian group; Ambiguity; Combinatorics; Multiplicative function; Function (biology); Inverse; Mathematics; Discrete mathematics; Finite field; Computer science","score_opus":0.030470348110095424,"score_gpt":0.24476481365843122,"score_spread":0.2142944655483358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144323841","genre_codex":"methods","genre_gemma":"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.092948586,0.002339801,0.8775239,0.0017570028,0.0002726887,0.00015000961,0.00034120659,0.00028248632,0.024384338],"genre_scores_gemma":[0.67158514,0.0021083816,0.31294227,0.0006727526,0.00070904335,0.0006329215,0.00048565507,0.00044199746,0.010421964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98984843,0.0030916245,0.00081199955,0.0018780804,0.0032977436,0.0010722607],"domain_scores_gemma":[0.97456384,0.016211707,0.0023903789,0.003474518,0.0020280282,0.0013315625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008293476,0.0022376955,0.0018090077,0.00542951,0.0018985856,0.006522252,0.002872841,0.0025304987,0.005535771],"category_scores_gemma":[0.045141645,0.0010688107,0.001560239,0.0028330472,0.0074208034,0.017176492,0.005435642,0.004263197,0.0011672681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013961237,0.000047138525,0.0012449212,0.00015736521,0.00002654143,0.0000965141,0.00028495648,0.015889565,0.0038619672,0.9512625,0.0010551221,0.025933882],"study_design_scores_gemma":[0.000030265444,0.00022335451,0.0006966916,0.000099123165,0.000026981923,0.00046288423,0.00023704057,0.057477344,0.0040782657,0.9269976,0.009603766,0.00006668328],"about_ca_topic_score_codex":0.0005776318,"about_ca_topic_score_gemma":0.00041429538,"teacher_disagreement_score":0.008293476,"about_ca_system_score_codex":0.0038339894,"about_ca_system_score_gemma":0.0017612206,"threshold_uncertainty_score":0.043860614},"labels":[],"label_agreement":null},{"id":"W2144706139","doi":"10.1109/isit.2004.1365583","title":"On the zeta functions of two towers of function fields","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Jacobian matrix and determinant; Hyperelliptic curve cryptography; Discrete logarithm; Mathematics; Finite field; Abelian group; Riemann zeta function; Elliptic curve; Hyperelliptic curve; Pure mathematics; Function (biology); Elliptic function; Logarithm; Discrete mathematics; Applied mathematics; Mathematical analysis; Elliptic curve cryptography; Computer science; Public-key cryptography","score_opus":0.015073378452901581,"score_gpt":0.2230687911632948,"score_spread":0.20799541271039323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144706139","genre_codex":"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.95921123,0.00031320663,0.02413336,0.000825977,0.00006861399,0.000039401657,0.00008673654,0.00009222831,0.015229285],"genre_scores_gemma":[0.99368346,0.00016431573,0.0031766023,0.000040602943,0.00013033624,0.000032469812,0.00010787584,0.000021306856,0.0026431575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942964,0.00014966201,0.00002396959,0.00007087009,0.00016697453,0.00015898593],"domain_scores_gemma":[0.99541265,0.002869311,0.0005036792,0.00022518515,0.00027573272,0.0007134039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019308921,0.00077000476,0.0008627643,0.003307282,0.001579894,0.0025285485,0.00084253354,0.00090741174,0.00356103],"category_scores_gemma":[0.008800829,0.00038538093,0.0007285845,0.0007990496,0.005269841,0.00450494,0.0021036211,0.0015151232,0.00038134263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003547574,0.00009489794,0.0042055044,0.00008015036,0.000019103398,0.0007189403,0.00076639804,0.011955788,0.0047758454,0.9670656,0.001030441,0.008932743],"study_design_scores_gemma":[0.000105542706,0.00011839288,0.002873751,0.000049841055,0.000022366617,0.00039491177,0.00037365736,0.09377191,0.003341682,0.8973249,0.0015625954,0.00006044196],"about_ca_topic_score_codex":0.0008927266,"about_ca_topic_score_gemma":0.000375995,"teacher_disagreement_score":0.00356103,"about_ca_system_score_codex":0.0016407555,"about_ca_system_score_gemma":0.00059352536,"threshold_uncertainty_score":0.011912823},"labels":[],"label_agreement":null},{"id":"W2145728281","doi":"10.1109/ftcs.1991.146689","title":"Burst and unidirectional error detecting codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Minimum distance; Upper and lower bounds; Computer science; Combinatorics; Probability of error; Discrete mathematics; Algorithm; Mathematics","score_opus":0.027856236012454683,"score_gpt":0.22538321749012133,"score_spread":0.19752698147766665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145728281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.19799732,0.001571689,0.7823189,0.00044667625,0.00015612322,0.00014912039,0.00064056105,0.00045880215,0.016260833],"genre_scores_gemma":[0.80351037,0.000984172,0.18498373,0.0003142823,0.00012376904,0.00022769737,0.0005329186,0.00009447541,0.009228576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990115,0.00019930185,0.00008453874,0.00016685182,0.00034180866,0.00019599707],"domain_scores_gemma":[0.9970921,0.0011354691,0.0005020006,0.0005301137,0.00057693414,0.00016331369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075708295,0.00052170444,0.00041032542,0.0011416173,0.00061934796,0.0012502867,0.00063629885,0.00073510193,0.0020673631],"category_scores_gemma":[0.0047771106,0.00029120565,0.00020149924,0.0012000134,0.0008289456,0.0011882043,0.001832609,0.0009775124,0.00064886315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018708394,0.000093735216,0.0041106474,0.00035212276,0.000041377385,0.0002707598,0.00046741805,0.06466985,0.050311856,0.64436376,0.004495276,0.22895238],"study_design_scores_gemma":[0.00025765947,0.0004973318,0.0020453294,0.00019892388,0.000067369605,0.00086060725,0.00021159653,0.42921123,0.08404917,0.45854542,0.023939753,0.00011561463],"about_ca_topic_score_codex":0.0008323241,"about_ca_topic_score_gemma":0.0006196706,"teacher_disagreement_score":0.0020673631,"about_ca_system_score_codex":0.0006483896,"about_ca_system_score_gemma":0.00081278244,"threshold_uncertainty_score":0.0069159865},"labels":[],"label_agreement":null},{"id":"W2146559163","doi":"10.1109/ccece.2000.849662","title":"A low-power reduced-area ROM architecture for cryptographic algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Scalability; Read-only memory; Control logic; Block cipher; Overhead (engineering); Computer hardware; Embedded system; Parallel computing; Cryptography; Algorithm; Operating system","score_opus":0.01816150721499426,"score_gpt":0.22279859053301904,"score_spread":0.20463708331802477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146559163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.05548433,0.0024963254,0.9154595,0.00044444084,0.00029255165,0.00024373586,0.00017086795,0.0041931113,0.02121512],"genre_scores_gemma":[0.3213592,0.0015741488,0.64665264,0.00044859256,0.00032409126,0.00018907824,0.0005865555,0.0002795631,0.02858619],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979824,0.000030139747,0.000014103816,0.000033710294,0.00010512454,0.000018715302],"domain_scores_gemma":[0.999813,0.000037527898,0.000031377956,0.000051574196,0.00005298791,0.000013479939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024342285,0.00037689254,0.0002777573,0.00045056868,0.0003074243,0.0004604742,0.0013376666,0.0004546896,0.005482726],"category_scores_gemma":[0.000495288,0.00019298706,0.00029513604,0.00034608148,0.00026155365,0.001272301,0.00032636392,0.00053789694,0.0033402357],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042111767,0.00016252774,0.0004985056,0.00063530554,0.000059064623,0.000535521,0.000104252314,0.0101475455,0.40833843,0.035007842,0.008737052,0.5353528],"study_design_scores_gemma":[0.000517553,0.0030502125,0.0020608099,0.00019060403,0.00027536842,0.00635036,0.00006333948,0.24600342,0.49882433,0.02200152,0.2205176,0.00014488792],"about_ca_topic_score_codex":0.0001815929,"about_ca_topic_score_gemma":0.00049855135,"teacher_disagreement_score":0.005482726,"about_ca_system_score_codex":0.00028595352,"about_ca_system_score_gemma":0.00035271372,"threshold_uncertainty_score":0.018341541},"labels":[],"label_agreement":null},{"id":"W2146782192","doi":"10.1016/j.laa.2012.04.049","title":"Is every matrix similar to a polynomial in a companion matrix?","year":2012,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Monic polynomial; Matrix (chemical analysis); Degree (music); Rank (graph theory); Finite field; Field (mathematics); Integer (computer science); Polynomial ring; Discrete mathematics; Polynomial; Pure mathematics; Physics; Mathematical analysis","score_opus":0.021878967935034084,"score_gpt":0.2993224730417016,"score_spread":0.27744350510666754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146782192","genre_codex":"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.6717476,0.00148824,0.21718986,0.011730582,0.001572618,0.00011877776,0.0006170445,0.00054773834,0.0949876],"genre_scores_gemma":[0.9691125,0.00044543977,0.01288325,0.0016660854,0.000990651,0.000027489777,0.00025524286,0.000092457114,0.014526867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991959,0.00016841508,0.000023227552,0.00026992642,0.00020598568,0.00013656136],"domain_scores_gemma":[0.99724245,0.0007954694,0.0005884271,0.0006248297,0.00048682862,0.00026194824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994322,0.00032204692,0.000616222,0.00084431167,0.0014523289,0.0019571465,0.00076831965,0.0018102102,0.0054646367],"category_scores_gemma":[0.0062195854,0.0003205937,0.0006021747,0.0012371524,0.0027933111,0.0052186726,0.00082525046,0.0017418019,0.0012279904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017879179,0.00005181029,0.0008151439,0.00007598187,0.000033593533,0.00022233308,0.0003999168,0.0013029039,0.0035038735,0.9743687,0.0052171727,0.013829783],"study_design_scores_gemma":[0.000024392493,0.000063636384,0.0009202309,0.000016387594,0.000018696632,0.00069084985,0.0003186429,0.006941046,0.0018159779,0.9781456,0.011008299,0.00003614499],"about_ca_topic_score_codex":0.0008530912,"about_ca_topic_score_gemma":0.0004888901,"teacher_disagreement_score":0.0054646367,"about_ca_system_score_codex":0.00053899264,"about_ca_system_score_gemma":0.0005139435,"threshold_uncertainty_score":0.018281043},"labels":[],"label_agreement":null},{"id":"W2146949677","doi":"10.1006/eujc.2000.0409","title":"Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity Theory","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monodromy; Symmetric group; Combinatorics; Conjecture; Alternating group; Group (periodic table); Permutation group; Permutation (music); Combinatorial proof; Generating function; Series (stratigraphy); Holomorphic function; Partition (number theory); Pure mathematics","score_opus":0.010295371457462905,"score_gpt":0.20785636947065797,"score_spread":0.19756099801319507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146949677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7326434,0.004465487,0.1123961,0.006182958,0.0005660449,0.00008622724,0.00036397422,0.00015110192,0.14314474],"genre_scores_gemma":[0.97855604,0.0010751102,0.009335994,0.00024639867,0.0005465686,0.00003145066,0.00014360661,0.00002515285,0.010039682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937314,0.00016558912,0.00004600683,0.00011488657,0.00019126546,0.00010921471],"domain_scores_gemma":[0.99846435,0.0006479696,0.00032851566,0.0001900206,0.00014596894,0.0002232887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008987157,0.000544412,0.00074678793,0.0019001295,0.0023989643,0.0040722415,0.00080044696,0.0012574543,0.0044476283],"category_scores_gemma":[0.0035859207,0.00043730627,0.0007634014,0.0014772563,0.0051814057,0.007163654,0.0017930954,0.0017093648,0.00044361773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014539077,0.000010029672,0.00012292672,0.000012821273,0.0000022499705,0.00004395021,0.00015467804,0.0004429667,0.00021796735,0.99699616,0.0004138633,0.0015678375],"study_design_scores_gemma":[0.0000062234685,0.0000068811682,0.00006418492,0.000004158292,0.0000019969518,0.000056587596,0.000064056985,0.0010008825,0.00005186192,0.9980198,0.00071951805,0.0000037238874],"about_ca_topic_score_codex":0.0013419566,"about_ca_topic_score_gemma":0.0014627242,"teacher_disagreement_score":0.0044476283,"about_ca_system_score_codex":0.0012800217,"about_ca_system_score_gemma":0.00082256075,"threshold_uncertainty_score":0.014878809},"labels":[],"label_agreement":null},{"id":"W2146987189","doi":"10.1109/itw.2007.4313068","title":"On Codes of Bounded Trellis Complexity","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Trellis (graph); Matroid; Discrete mathematics; Permutation (music); Combinatorics; Bounded function; Time complexity; Mathematics; Computer science; Decoding methods; Algorithm","score_opus":0.03367316908111371,"score_gpt":0.27080077291437127,"score_spread":0.23712760383325757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146987189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2105977,0.0017260665,0.74748135,0.0022031222,0.00013474641,0.00011605935,0.00061591325,0.00059756567,0.0365275],"genre_scores_gemma":[0.88908786,0.0011990654,0.09460495,0.00045365075,0.00036890636,0.00024159219,0.00063178205,0.00022726829,0.013184916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770844,0.000530099,0.000089201276,0.00035870855,0.0008727902,0.00044080292],"domain_scores_gemma":[0.9897153,0.0065764086,0.00074753474,0.0014122047,0.0011580231,0.00039053342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011687786,0.00052663893,0.0006639906,0.0012269099,0.0013128389,0.002271894,0.0010797365,0.001387545,0.0040098685],"category_scores_gemma":[0.010863788,0.00048745226,0.0007377583,0.0012146437,0.0025356696,0.004843959,0.0017369617,0.002523231,0.000848861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011518356,0.00002438388,0.00038668572,0.000057772126,0.000007771091,0.00009457489,0.0002478057,0.029688135,0.0033296763,0.95309764,0.001292939,0.011657433],"study_design_scores_gemma":[0.000029460356,0.00008182059,0.00025013805,0.000036024532,0.000007068476,0.0001676603,0.000055327793,0.13587366,0.0044499957,0.8545655,0.004453755,0.00002963628],"about_ca_topic_score_codex":0.0018018725,"about_ca_topic_score_gemma":0.0015178198,"teacher_disagreement_score":0.0040098685,"about_ca_system_score_codex":0.0023621193,"about_ca_system_score_gemma":0.0015241911,"threshold_uncertainty_score":0.017138422},"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":"W2147369663","doi":"10.1109/newcas.2005.1496735","title":"Feasibility of a Digital Design Flow of an-Asynchronous BCJR/MAP Convolutional Channel Decoder","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Turbo code; Convolutional code; BCJR algorithm; Computer science; Serial concatenated convolutional codes; Asynchronous communication; Turbo equalizer; Difference-map algorithm; Soft-decision decoder; Concatenated error correction code; Electronic engineering; Decoding methods; Algorithm; Block code; Telecommunications; Engineering","score_opus":0.03525774947029374,"score_gpt":0.25929542986882625,"score_spread":0.2240376803985325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147369663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.023410391,0.00012233474,0.9618461,0.00034220854,0.000110670204,0.00016383443,0.00012446831,0.0009150167,0.012964937],"genre_scores_gemma":[0.5461988,0.0001833893,0.4459065,0.0002731791,0.00012360181,0.00017138432,0.0001616049,0.000068532245,0.006913022],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994795,0.00012215257,0.000038278362,0.00007923516,0.00023910978,0.000041770003],"domain_scores_gemma":[0.99881434,0.00042817538,0.00009513115,0.00020315484,0.00042061834,0.00003858616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008438974,0.00037948854,0.00019499043,0.00027813064,0.0005096161,0.00080834806,0.0005845808,0.00059634243,0.0036724252],"category_scores_gemma":[0.0026712194,0.00016547943,0.0002285738,0.00018536072,0.00038813383,0.000873935,0.00027397048,0.0005454087,0.0010539924],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011560931,0.00031579312,0.0024497842,0.0004759366,0.000078803634,0.0005845573,0.00027861152,0.12373984,0.20792888,0.27854362,0.005319986,0.37912804],"study_design_scores_gemma":[0.00027551915,0.0009873611,0.0007044299,0.000062639905,0.00009614119,0.0007888213,0.00004742488,0.73708963,0.17665522,0.047426946,0.035816915,0.000048878544],"about_ca_topic_score_codex":0.00063036627,"about_ca_topic_score_gemma":0.00090603984,"teacher_disagreement_score":0.0036724252,"about_ca_system_score_codex":0.0003741045,"about_ca_system_score_gemma":0.001270755,"threshold_uncertainty_score":0.012285471},"labels":[],"label_agreement":null},{"id":"W2147622371","doi":"10.1109/isit.1993.748412","title":"Inverterless Cauchy Cells for a Systolic Reed-Solomon Encoder","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Encoder; Finite field; Arithmetic; Parallel computing; Computer science; Discrete mathematics; Mathematics; Algorithm","score_opus":0.011227250045338503,"score_gpt":0.22403007111996656,"score_spread":0.21280282107462806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147622371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.31656113,0.0009277654,0.64067614,0.0004957888,0.00022379198,0.00019110569,0.0003207094,0.001128909,0.039474644],"genre_scores_gemma":[0.8410854,0.00034427264,0.15181275,0.000113784285,0.000060281178,0.000069531525,0.00020108392,0.000026563323,0.006286369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998934,0.00001904686,0.000010625406,0.000014374061,0.000047989404,0.000014528373],"domain_scores_gemma":[0.99983,0.000059926173,0.00002605656,0.00002802147,0.000045707668,0.000010269264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010042343,0.00024908833,0.00014431628,0.00023025455,0.00024674542,0.00049715827,0.00038592707,0.00027555297,0.0023234223],"category_scores_gemma":[0.00040667385,0.000081690756,0.00015028469,0.00023737192,0.00028989263,0.0004891199,0.00026855452,0.00029940647,0.00056691974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006640926,0.0001774067,0.0016093352,0.00039166972,0.000029856035,0.0011930907,0.0002823893,0.09762615,0.28377673,0.38449055,0.00510528,0.22465344],"study_design_scores_gemma":[0.00012013291,0.0014021506,0.0009272061,0.00009030101,0.000060548962,0.0009320396,0.0000915991,0.6264802,0.23429398,0.088434085,0.047109894,0.00005787952],"about_ca_topic_score_codex":0.0004979052,"about_ca_topic_score_gemma":0.0010747137,"teacher_disagreement_score":0.0023234223,"about_ca_system_score_codex":0.00043187616,"about_ca_system_score_gemma":0.00039238425,"threshold_uncertainty_score":0.0077726245},"labels":[],"label_agreement":null},{"id":"W2148201159","doi":"10.1007/s12095-010-0019-x","title":"Asymptotic enumeration of correlation-immune boolean functions","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Parity function; Function (biology); Discrete mathematics; Maximum satisfiability problem; Boolean data type; Order (exchange); Boolean expression","score_opus":0.008518214191220884,"score_gpt":0.22122794436111445,"score_spread":0.21270973016989356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148201159","genre_codex":"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.44973132,0.0014806736,0.4163318,0.0037705,0.00029509893,0.000090959256,0.000559165,0.000710398,0.12703013],"genre_scores_gemma":[0.94721454,0.00067395566,0.032769065,0.00081076234,0.00038159016,0.00018544991,0.0006428275,0.0001860939,0.017135806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979317,0.0008046738,0.00007291295,0.00018646268,0.0006591338,0.00034509256],"domain_scores_gemma":[0.9898414,0.0070868824,0.0006024927,0.00087294506,0.0010664584,0.0005297523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00231409,0.0007501314,0.0013852523,0.0022646936,0.0012113404,0.0034559583,0.0021041678,0.0018465047,0.007627238],"category_scores_gemma":[0.019915879,0.00056693837,0.00079745153,0.0018239599,0.0025353706,0.0042924206,0.0027484335,0.0031014185,0.0009792486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000995523,0.000061437,0.0006311819,0.00007051221,0.000012746254,0.000047927108,0.00007443015,0.0092247585,0.0012743071,0.97558767,0.00286299,0.010052547],"study_design_scores_gemma":[0.000025884194,0.000024508881,0.00030789335,0.000029794968,0.000012224123,0.00014063527,0.000028413915,0.10846563,0.0010330519,0.88868266,0.0012346827,0.000014628601],"about_ca_topic_score_codex":0.00055631844,"about_ca_topic_score_gemma":0.0008341864,"teacher_disagreement_score":0.007627238,"about_ca_system_score_codex":0.0024503423,"about_ca_system_score_gemma":0.0014380661,"threshold_uncertainty_score":0.025515676},"labels":[],"label_agreement":null},{"id":"W2148367244","doi":"10.1145/2442829.2442844","title":"A polynomial time algorithm for computing the HNF of a module over the integers of a number field","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Calgary Laboratory Services","funders":"","keywords":"Modulo; Field (mathematics); Hermite polynomials; Ring of integers; Algorithm; Polynomial ring; Mathematics; Polynomial; Discrete mathematics; Ring (chemistry); Time complexity; Modular design; Algebraic number field; Computer science; Pure mathematics","score_opus":0.00950673958228829,"score_gpt":0.24907717271117355,"score_spread":0.23957043312888526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148367244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.060874213,0.00030124298,0.9263214,0.000593562,0.00015393412,0.00026335538,0.00037307185,0.004595891,0.006523413],"genre_scores_gemma":[0.31746522,0.00016706133,0.6738364,0.0002374879,0.00019293446,0.0002347981,0.0012770604,0.00032443,0.0062645706],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989525,0.00015811638,0.00007450812,0.0003279364,0.00029826508,0.0001885193],"domain_scores_gemma":[0.9981894,0.00074557465,0.00014132734,0.00063703686,0.00018272939,0.000103910534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012730482,0.00096806407,0.0009799214,0.0012217922,0.00076505245,0.0017241307,0.0018166257,0.0010586723,0.0062517375],"category_scores_gemma":[0.0033369814,0.00031492696,0.001348052,0.0010347934,0.0010920303,0.003405817,0.002211233,0.0014780675,0.0021284807],"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.00083618285,0.00066654483,0.006117703,0.00058552495,0.00024871618,0.00027614515,0.0005823432,0.03862522,0.04111573,0.15727891,0.016087404,0.7375796],"study_design_scores_gemma":[0.00055471435,0.001053808,0.0033115596,0.00009167651,0.0002784681,0.00096381805,0.00041258722,0.5373148,0.05625186,0.3753084,0.024264995,0.0001932604],"about_ca_topic_score_codex":0.0014808422,"about_ca_topic_score_gemma":0.0032116843,"teacher_disagreement_score":0.0062517375,"about_ca_system_score_codex":0.0012870909,"about_ca_system_score_gemma":0.0027876706,"threshold_uncertainty_score":0.020914078},"labels":[],"label_agreement":null},{"id":"W2148399495","doi":"10.1080/00927870701866648","title":"Simple Formulae for the Number of Quadrics and Symmetric Forms of Modules Over Local Rings","year":2008,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simple (philosophy); Algebraic number; Interpretation (philosophy); Type (biology); Representation (politics); Algebra over a field; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.03419347623983653,"score_gpt":0.2976487704496305,"score_spread":0.26345529420979397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148399495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.17987706,0.006423348,0.5945677,0.0032614374,0.0026947446,0.00029964914,0.0015243765,0.00072203256,0.21062963],"genre_scores_gemma":[0.79648745,0.003815497,0.16274989,0.0007595165,0.0026940207,0.0004979874,0.0008138605,0.00040641875,0.03177541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998154,0.00035754262,0.00018802221,0.00033361808,0.0008062136,0.00016053],"domain_scores_gemma":[0.99535394,0.0023342434,0.00063738733,0.00050143624,0.0007988268,0.0003741995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023594925,0.0013363569,0.0016124072,0.0061789686,0.0014334132,0.0037398734,0.0031262345,0.0017492173,0.011705923],"category_scores_gemma":[0.011501837,0.00060868124,0.0013353316,0.0031182263,0.0049584326,0.011139948,0.0024378584,0.0039117364,0.0024440389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003093316,0.00002631206,0.00047586748,0.00013368294,0.000010112655,0.000093421186,0.0001622975,0.0008453265,0.0015379543,0.981645,0.0026467985,0.012392278],"study_design_scores_gemma":[0.000010984296,0.000022844017,0.00050263264,0.00003239731,0.000016130942,0.0003730564,0.000052014537,0.0057596103,0.001048778,0.98776895,0.0043841507,0.00002838438],"about_ca_topic_score_codex":0.0002788385,"about_ca_topic_score_gemma":0.0004311214,"teacher_disagreement_score":0.011705923,"about_ca_system_score_codex":0.0019677288,"about_ca_system_score_gemma":0.00069341116,"threshold_uncertainty_score":0.03916025},"labels":[],"label_agreement":null},{"id":"W2148496593","doi":"10.1145/1576702.1576753","title":"Efficient computation of order bases","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Dimension (graph theory); Computation; Field (mathematics); Order (exchange); Matrix (chemical analysis); Mathematics; Combinatorics; Basis (linear algebra); Power series; Polynomial; Matrix multiplication; Discrete mathematics; Series (stratigraphy); Algorithm; Pure mathematics; Mathematical analysis; Physics; Geometry","score_opus":0.010243818345754472,"score_gpt":0.23992381607057991,"score_spread":0.22967999772482545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148496593","genre_codex":"methods","genre_gemma":"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.050380517,0.00020160749,0.93779814,0.000240397,0.00010021343,0.00014177851,0.00031780664,0.0025823324,0.008237145],"genre_scores_gemma":[0.29565358,0.00022051962,0.6938463,0.00011679686,0.00008136863,0.00019049124,0.0012569618,0.0006108007,0.008023121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989299,0.00014650013,0.000064616106,0.00014791917,0.00048302184,0.00022797206],"domain_scores_gemma":[0.99848,0.0005506087,0.00008133329,0.00048310158,0.00032137646,0.00008356928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237663,0.00078831776,0.0011225336,0.0013341397,0.0010329059,0.0016156666,0.001148121,0.0006013577,0.008974668],"category_scores_gemma":[0.0038973705,0.00040398247,0.0009822691,0.0011317601,0.0007929398,0.0030277744,0.0022007015,0.0014383121,0.0035352947],"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.0006908933,0.00031920892,0.0024683112,0.00046098576,0.000087295,0.0003626897,0.0005648945,0.06929439,0.03700917,0.2888687,0.020170486,0.5797029],"study_design_scores_gemma":[0.00014383397,0.00021828811,0.00056358136,0.000059520004,0.000036027104,0.00039498214,0.00026683309,0.522641,0.047431514,0.40849715,0.019681102,0.0000662259],"about_ca_topic_score_codex":0.0012958322,"about_ca_topic_score_gemma":0.0021273233,"teacher_disagreement_score":0.008974668,"about_ca_system_score_codex":0.00088652427,"about_ca_system_score_gemma":0.0017712582,"threshold_uncertainty_score":0.030023277},"labels":[],"label_agreement":null},{"id":"W2148632144","doi":"10.1109/wescan.1988.27670","title":"Applications of forward error coding in mobile communication systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Victoria; Concordia University","funders":"","keywords":"Decoding methods; Computer science; Coding (social sciences); Error detection and correction; Power consumption; Mobile telephony; Communications system; Microprocessor; Theoretical computer science; Real-time computing; Computer engineering; Algorithm; Computer network; Embedded system; Power (physics); Mobile radio; Mathematics; Statistics","score_opus":0.015556260295329975,"score_gpt":0.26144755990866314,"score_spread":0.24589129961333317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148632144","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01852213,0.04733667,0.78742754,0.0030559127,0.0015449704,0.00015376977,0.00019062805,0.0009809589,0.14078738],"genre_scores_gemma":[0.60711026,0.08303238,0.24246058,0.0009819285,0.002021571,0.00018706462,0.00032848687,0.00013897406,0.063738644],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995858,0.00009856645,0.000021967573,0.00004350198,0.00020097068,0.000049238763],"domain_scores_gemma":[0.99934274,0.0003393841,0.00004582581,0.00007316926,0.00017900155,0.000019791407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032331565,0.0005181392,0.00037817738,0.0008138092,0.0005324929,0.00090324663,0.00036962522,0.0011803331,0.0057012076],"category_scores_gemma":[0.001718527,0.00018896261,0.00028219327,0.0010503713,0.0005592843,0.00078548444,0.00076663826,0.00074642076,0.0017604529],"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.0000745158,0.000059955295,0.0009752541,0.0007605898,0.000036722187,0.0007980961,0.00034558927,0.09762113,0.024130475,0.37647054,0.015411292,0.48331586],"study_design_scores_gemma":[0.000033525543,0.0003005021,0.0011851445,0.0005965126,0.000057260368,0.0031414435,0.0002062155,0.3053973,0.030366046,0.33524463,0.323361,0.00011046524],"about_ca_topic_score_codex":0.0010961682,"about_ca_topic_score_gemma":0.00084479415,"teacher_disagreement_score":0.0057012076,"about_ca_system_score_codex":0.00052128633,"about_ca_system_score_gemma":0.00048926374,"threshold_uncertainty_score":0.019072473},"labels":[],"label_agreement":null},{"id":"W2149059289","doi":"10.1109/acssc.1990.523456","title":"The Modulus Replication RNS (MRRNS): A Comparative Study","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chinese remainder theorem; Redundancy (engineering); Computer science; Computation; Algorithm; Finite field; Residue number system; Binary number; Computational complexity theory; Theoretical computer science; Polynomial; Parallel computing; Arithmetic; Mathematics; Discrete mathematics","score_opus":0.03441153603012465,"score_gpt":0.30529478174305025,"score_spread":0.2708832457129256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149059289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.20505907,0.042082194,0.6088183,0.001634604,0.00081485003,0.0004658785,0.00021165663,0.0027622045,0.1381513],"genre_scores_gemma":[0.5945837,0.0151700135,0.37054834,0.00022549227,0.00052426074,0.000087040455,0.00020988887,0.00032732115,0.018323956],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99740016,0.0007019218,0.0001985732,0.00022503779,0.0013403748,0.00013403216],"domain_scores_gemma":[0.9943528,0.0018986901,0.0006484884,0.001889506,0.0010946213,0.00011592776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027463536,0.000386708,0.00062889967,0.002006627,0.0003861906,0.0011040773,0.0014420769,0.00039176064,0.005530156],"category_scores_gemma":[0.006707526,0.00023785833,0.00049814564,0.0020476454,0.000949416,0.0030620294,0.0008606448,0.00051156065,0.0014877362],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008957772,0.00009707739,0.0012517597,0.0008624782,0.000059776514,0.00020479031,0.00031459078,0.015987474,0.025001785,0.0851973,0.002565888,0.8675613],"study_design_scores_gemma":[0.00035665027,0.0073359427,0.0069111227,0.0007828935,0.00037928036,0.010387829,0.001331555,0.34899208,0.23287651,0.042903356,0.34748,0.0002628454],"about_ca_topic_score_codex":0.00047329703,"about_ca_topic_score_gemma":0.0004651073,"teacher_disagreement_score":0.005530156,"about_ca_system_score_codex":0.0008176998,"about_ca_system_score_gemma":0.0007960219,"threshold_uncertainty_score":0.018500209},"labels":[],"label_agreement":null},{"id":"W2149489229","doi":"10.37236/1720","title":"Binary Gray Codes with Long Bit Runs","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Gray code; Combinatorics; Subsequence; Hamming distance; Binary number; Hamming code; Gray (unit); Discrete mathematics; Arithmetic; Algorithm; Block code; Decoding methods","score_opus":0.005235754770155271,"score_gpt":0.2027874407928435,"score_spread":0.19755168602268822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149489229","genre_codex":"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.6456358,0.0018145513,0.3052533,0.001312905,0.00020432302,0.00011412901,0.0003458349,0.0008518401,0.04446732],"genre_scores_gemma":[0.9387666,0.0005959772,0.048865747,0.00036167656,0.00010934817,0.00017363354,0.00026859646,0.00011625131,0.01074224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992632,0.000116050156,0.00004140098,0.00012976838,0.00023840735,0.0002110996],"domain_scores_gemma":[0.9978841,0.0008138415,0.00043032656,0.00044596707,0.00022681699,0.00019892871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174204,0.0004760664,0.00040156677,0.00058623013,0.00083770393,0.0011584156,0.0006568685,0.0008621501,0.003877177],"category_scores_gemma":[0.0037923455,0.00030676206,0.0003168683,0.000942884,0.0015042408,0.0020101785,0.0020978365,0.0011036284,0.0010073982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005886378,0.00008524435,0.0021270288,0.00016654498,0.00002501957,0.0010404654,0.000607669,0.03877694,0.03831413,0.8472122,0.00425422,0.0668019],"study_design_scores_gemma":[0.00012399272,0.00029089925,0.0013927654,0.00011504751,0.000048401642,0.0011638673,0.00019368506,0.16541491,0.044774786,0.7605476,0.025841609,0.000092363516],"about_ca_topic_score_codex":0.0012988237,"about_ca_topic_score_gemma":0.0011493104,"teacher_disagreement_score":0.003877177,"about_ca_system_score_codex":0.00084557047,"about_ca_system_score_gemma":0.0008950339,"threshold_uncertainty_score":0.012970388},"labels":[],"label_agreement":null},{"id":"W2149698442","doi":"10.37236/1013","title":"Nonexistence of Permutation Binomials of Certain Shapes","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Permutation (music); Prime (order theory); Discrete mathematics","score_opus":0.008703562126573168,"score_gpt":0.24210384104737448,"score_spread":0.2334002789208013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149698442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8346424,0.00034991204,0.070768155,0.0022769268,0.0002944069,0.000073323376,0.00037922547,0.00048885564,0.0907268],"genre_scores_gemma":[0.9752237,0.0002465033,0.011622435,0.0003186554,0.00025232058,0.00008788105,0.00036683655,0.00014858844,0.011733264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982728,0.00032668977,0.0000836039,0.00043679835,0.00045812078,0.00042184608],"domain_scores_gemma":[0.99376327,0.0036552104,0.00067404937,0.00072609674,0.000487389,0.0006940503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015029209,0.00055058196,0.0011041295,0.0011490914,0.003103691,0.0034592163,0.0012588366,0.0014215661,0.0071608424],"category_scores_gemma":[0.015717106,0.0014175314,0.0010554071,0.0008778969,0.003953901,0.004342316,0.0032803363,0.0027828803,0.001223034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025355225,0.000044096338,0.002440502,0.0000810329,0.00002691902,0.000936944,0.0004176636,0.0015205529,0.0048908894,0.9804161,0.002987228,0.005984467],"study_design_scores_gemma":[0.00017631173,0.00008494599,0.0018195852,0.000052056846,0.0000462076,0.0029225666,0.00035115913,0.023469927,0.006417609,0.9555365,0.009057031,0.00006618427],"about_ca_topic_score_codex":0.00047434535,"about_ca_topic_score_gemma":0.0005141106,"teacher_disagreement_score":0.0071608424,"about_ca_system_score_codex":0.0009551389,"about_ca_system_score_gemma":0.00077533454,"threshold_uncertainty_score":0.023955405},"labels":[],"label_agreement":null},{"id":"W2149963403","doi":"10.1017/s0004972713000208","title":"ON PERMUTATION BINOMIALS OVER FINITE FIELDS","year":2013,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Finite field; Binomial (polynomial); Gaussian binomial coefficient; Permutation (music); Partial permutation; Binomial coefficient; Cyclic permutation; Generalized permutation matrix; Divisor (algebraic geometry)","score_opus":0.017067199966747364,"score_gpt":0.23927560724547778,"score_spread":0.22220840727873042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149963403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5849833,0.0018849456,0.24147192,0.0024445464,0.0007714789,0.00012710727,0.00027448207,0.00046309177,0.16757917],"genre_scores_gemma":[0.96618193,0.001272866,0.016391924,0.00038339273,0.0006383593,0.00008266176,0.00020070371,0.000121769066,0.014726396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873024,0.00039595543,0.000058661375,0.00012212657,0.00036392742,0.00032896682],"domain_scores_gemma":[0.9980361,0.0012131782,0.00018768846,0.00022070334,0.0001811057,0.00016122182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018668381,0.00048671145,0.0006031751,0.0014085108,0.0015913532,0.0016125806,0.00040690132,0.0005625217,0.0060883244],"category_scores_gemma":[0.0050444016,0.00040696087,0.0005919038,0.0013152016,0.0030099743,0.0035277691,0.0018275905,0.0016884401,0.0012898091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009287526,0.000024973164,0.0003695842,0.00003647002,0.0000045088505,0.00033022993,0.00026342817,0.0023439105,0.0019640713,0.98273385,0.001670636,0.010165543],"study_design_scores_gemma":[0.000029306464,0.000033664783,0.00029575822,0.000032948254,0.000008093568,0.00028992712,0.00007136384,0.010376014,0.0017085819,0.98070014,0.0064382795,0.000015865959],"about_ca_topic_score_codex":0.00077147735,"about_ca_topic_score_gemma":0.0007009937,"teacher_disagreement_score":0.0060883244,"about_ca_system_score_codex":0.0011272964,"about_ca_system_score_gemma":0.0006805459,"threshold_uncertainty_score":0.020367444},"labels":[],"label_agreement":null},{"id":"W2150671712","doi":"10.1109/tip.2009.2032943","title":"Unequal Erasure Protection Technique for Scalable Multistreams","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CMC Microsystems (Canada); McMaster University","funders":"","keywords":"Scalability; Computer science; Network packet; Erasure; Algorithm; Redundancy (engineering); Theoretical computer science; Computer network; Programming language; Database","score_opus":0.01848128859747372,"score_gpt":0.26328938766746834,"score_spread":0.24480809906999462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150671712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.055482928,0.00053735124,0.9418896,0.00013039977,0.000048486345,0.000029261913,0.000028187054,0.0003528182,0.0015009723],"genre_scores_gemma":[0.73606956,0.0003353312,0.26187307,0.00009288078,0.000052697094,0.00004526574,0.00007722215,0.000036544985,0.0014173997],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996207,0.00010583197,0.000027187185,0.000049206395,0.00015213985,0.00004494021],"domain_scores_gemma":[0.99926287,0.00033683237,0.000099627,0.00019565622,0.000082221486,0.000022843189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061507046,0.00041060618,0.0004602517,0.0003697699,0.0003225315,0.00035285886,0.00060887943,0.00042225604,0.00092878967],"category_scores_gemma":[0.0016689182,0.00017008782,0.00029502576,0.0003433841,0.00046202447,0.0011101009,0.0010219344,0.0006242745,0.00019547477],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006864071,0.00010080519,0.0014041102,0.00028253053,0.00008905177,0.0005789437,0.00041747617,0.13519143,0.25589326,0.061193988,0.0020166652,0.54214525],"study_design_scores_gemma":[0.00006744234,0.0003679952,0.0006559679,0.00003768815,0.000041994077,0.00069981924,0.00006621722,0.8106732,0.16113278,0.019868927,0.0063500484,0.000037962516],"about_ca_topic_score_codex":0.00023884165,"about_ca_topic_score_gemma":0.0002841899,"teacher_disagreement_score":0.00092878967,"about_ca_system_score_codex":0.000240219,"about_ca_system_score_gemma":0.0003038745,"threshold_uncertainty_score":0.003252864},"labels":[],"label_agreement":null},{"id":"W2150776556","doi":"10.1090/fic/060/06","title":"Biased statistics for traces of cyclic 𝑝-fold covers over finite fields","year":2011,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; National Science Foundation","keywords":"Fold (higher-order function); Mathematics; Affine transformation; Endomorphism; Statistics; TRACE (psycholinguistics); Pure mathematics; Computer science; Philosophy","score_opus":0.025707629409017742,"score_gpt":0.25124153442752983,"score_spread":0.2255339050185121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150776556","genre_codex":"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.91838527,0.00043412668,0.07531093,0.00055669254,0.000047611982,0.000028221357,0.00045741018,0.00014975255,0.004630024],"genre_scores_gemma":[0.9942747,0.00035703587,0.0029468187,0.000060581446,0.00018887008,0.000043930715,0.00040661116,0.00006685309,0.0016545936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985411,0.00034871968,0.00007018681,0.00028160532,0.00045656212,0.00030173807],"domain_scores_gemma":[0.98754334,0.006371229,0.0025744152,0.0014240632,0.000946735,0.0011402374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019404818,0.0005209652,0.0010090047,0.0030449964,0.0008730794,0.0024966185,0.0011890664,0.001242289,0.0031541188],"category_scores_gemma":[0.021047892,0.000432702,0.000494898,0.0014699894,0.003411683,0.004593362,0.0016517454,0.0014416676,0.0003415001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000281174,0.0000619963,0.013650671,0.00010516378,0.0000445923,0.000485628,0.00045963124,0.030478086,0.01197199,0.93241256,0.0010692062,0.008979237],"study_design_scores_gemma":[0.00004409545,0.000148396,0.010598933,0.000076854485,0.000026860604,0.00063929835,0.00019123965,0.1842178,0.0066535496,0.79587173,0.0013926077,0.00013865494],"about_ca_topic_score_codex":0.0007248099,"about_ca_topic_score_gemma":0.00067110383,"teacher_disagreement_score":0.0031541188,"about_ca_system_score_codex":0.0017235974,"about_ca_system_score_gemma":0.00066775054,"threshold_uncertainty_score":0.0125056505},"labels":[],"label_agreement":null},{"id":"W2150782829","doi":"10.1109/tc.2007.19","title":"A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational complexity theory; Polynomial basis; Multiplier (economics); Mathematics; Discrete mathematics; Matrix multiplication; Toeplitz matrix; Polynomial; Time complexity; Computer science; Algorithm; Combinatorics; Pure mathematics","score_opus":0.04373998678267655,"score_gpt":0.27502531965156407,"score_spread":0.23128533286888753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150782829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.010098481,0.00029010934,0.9795101,0.00013786889,0.00011203511,0.00011086205,0.000055246917,0.000651601,0.009033665],"genre_scores_gemma":[0.12359435,0.0005314335,0.86436784,0.00018645234,0.00015658185,0.00028611821,0.00018454954,0.00011516348,0.010577495],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995473,0.000099107834,0.000045102122,0.00008517677,0.00017489077,0.000048306458],"domain_scores_gemma":[0.9995627,0.00010427562,0.000053667172,0.00012634134,0.00012979092,0.000023264682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045649317,0.00093513407,0.00047617237,0.0009960172,0.00071571517,0.0012211947,0.0012338925,0.00038673237,0.008535557],"category_scores_gemma":[0.0010953278,0.00036245858,0.00056017336,0.001286363,0.00055981387,0.0020363932,0.0010188755,0.0011618254,0.0024525425],"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.00040632472,0.00018286251,0.00031055245,0.00033484725,0.000060680908,0.00015482161,0.0002127113,0.02704395,0.081868425,0.40213823,0.008117145,0.47916934],"study_design_scores_gemma":[0.00028810132,0.0013432499,0.00039398673,0.00010317231,0.0001398705,0.0011041578,0.00010399201,0.49225155,0.16554962,0.22281662,0.115778,0.0001277278],"about_ca_topic_score_codex":0.0005356963,"about_ca_topic_score_gemma":0.0013242698,"teacher_disagreement_score":0.008535557,"about_ca_system_score_codex":0.00081098214,"about_ca_system_score_gemma":0.0010853068,"threshold_uncertainty_score":0.02855432},"labels":[],"label_agreement":null},{"id":"W2152528368","doi":"10.1109/isit.1997.613276","title":"Generalized concatenated codes with quasi-cyclic codes as outer code","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Concatenated error correction code; Linear code; Serial concatenated convolutional codes; Block code; Computer science; Turbo code; Tornado code; BCJR algorithm; Decoding methods; Algorithm; Theoretical computer science","score_opus":0.024080563638900186,"score_gpt":0.23802361947279935,"score_spread":0.21394305583389917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152528368","genre_codex":"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.29763418,0.002853428,0.67372745,0.00083393004,0.0005730659,0.00020741083,0.0007479708,0.0006521603,0.022770453],"genre_scores_gemma":[0.864981,0.0012777305,0.12315468,0.00029163467,0.0002506715,0.00013556647,0.0003590272,0.00009481844,0.009454936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993222,0.00020026897,0.000044996345,0.00008108175,0.00023796869,0.00011347995],"domain_scores_gemma":[0.99859744,0.00039514012,0.00023178059,0.0003805144,0.0003169111,0.0000782104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048002056,0.0006265339,0.00050455064,0.00051086675,0.00044716665,0.0010158936,0.00046963143,0.0009004123,0.0014546292],"category_scores_gemma":[0.0019314232,0.00021261859,0.00050984876,0.000954563,0.0011312556,0.0010482416,0.0009374477,0.0007763647,0.0004938935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085724174,0.00006994591,0.002127995,0.00046205093,0.00013806802,0.0020583565,0.0006303471,0.23764177,0.09571232,0.5902983,0.0033887,0.06661494],"study_design_scores_gemma":[0.00008761291,0.000601216,0.0020917675,0.00014555249,0.00020889258,0.0019481824,0.000118322285,0.6535569,0.0806521,0.22898299,0.031447325,0.00015915385],"about_ca_topic_score_codex":0.0011601235,"about_ca_topic_score_gemma":0.0016930946,"teacher_disagreement_score":0.0014546292,"about_ca_system_score_codex":0.0006959179,"about_ca_system_score_gemma":0.0008317679,"threshold_uncertainty_score":0.0050492287},"labels":[],"label_agreement":null},{"id":"W2152724910","doi":"10.1016/j.jsc.2010.06.021","title":"On the De Boer–Pellikaan method for computing minimum distance","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Connection (principal bundle); Ideal (ethics); Code (set theory); Projective test; Minimum distance; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Combinatorics; Geometry; Law; Computer science; Programming language","score_opus":0.013182069695073288,"score_gpt":0.2990532433500757,"score_spread":0.2858711736550024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152724910","genre_codex":"methods","genre_gemma":"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.009035482,0.0006137834,0.9805283,0.0003979597,0.00019155507,0.000052933774,0.00007266728,0.00033652803,0.008770661],"genre_scores_gemma":[0.13194248,0.0008461079,0.8534581,0.00032010107,0.00017785691,0.00023636708,0.00023843459,0.000478608,0.012301943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991591,0.00031904457,0.000043748205,0.00012532224,0.00028283254,0.000069998896],"domain_scores_gemma":[0.99861,0.0008377069,0.000053261832,0.00020896686,0.00023557284,0.00005446643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015911548,0.0009508477,0.0011511538,0.0023178922,0.0011907547,0.0013814094,0.0023975018,0.0012605008,0.008430359],"category_scores_gemma":[0.00810059,0.00047795955,0.0010534835,0.002536941,0.0022026603,0.0033538837,0.0026989037,0.0029482518,0.0023692201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027831848,0.000075501324,0.00051734934,0.00028062044,0.00007188368,0.000079553334,0.0002506844,0.079585835,0.0058807554,0.59596574,0.007325286,0.30968845],"study_design_scores_gemma":[0.00006990168,0.00007370848,0.00023868159,0.00005126231,0.000030004618,0.000095793985,0.000057287783,0.41899297,0.004065031,0.5634351,0.01283458,0.000055752702],"about_ca_topic_score_codex":0.0030458956,"about_ca_topic_score_gemma":0.004375765,"teacher_disagreement_score":0.008430359,"about_ca_system_score_codex":0.0012904229,"about_ca_system_score_gemma":0.0016011144,"threshold_uncertainty_score":0.028202355},"labels":[],"label_agreement":null},{"id":"W2152982916","doi":"10.1109/sips.2005.1579965","title":"SIMD implementation of interpolation in algebraic soft-decision Reed-Solomon decoding","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"SIMD; Computer science; Parallel computing; Reed–Solomon error correction; Speedup; Decoding methods; Interpolation (computer graphics); Algorithm; Block code; Concatenated error correction code; Frame (networking)","score_opus":0.007531925662421875,"score_gpt":0.2684136274788836,"score_spread":0.2608817018164617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152982916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.07781282,0.00023834949,0.90759015,0.00015149896,0.00008248206,0.00008355085,0.00010494626,0.0023834074,0.011552713],"genre_scores_gemma":[0.5022757,0.00013175953,0.4930799,0.00010985858,0.000031400054,0.000091937014,0.00020286687,0.00010187472,0.0039747106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951804,0.00012352667,0.00003242707,0.00006092637,0.00020738892,0.00005762916],"domain_scores_gemma":[0.9993699,0.00019823805,0.000057232875,0.00019400059,0.00015824522,0.00002246866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048405273,0.00032739821,0.00034025963,0.0005082151,0.0003950977,0.00059372315,0.000802207,0.000273044,0.0041780975],"category_scores_gemma":[0.0015605757,0.00019761246,0.0002919014,0.00063631614,0.00044393158,0.0007548123,0.00067212665,0.00045082666,0.0011027823],"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.0016112529,0.00024471185,0.0038175583,0.00039212807,0.000097098455,0.00045639777,0.00034211754,0.10355246,0.15259288,0.1576837,0.0050270045,0.57418275],"study_design_scores_gemma":[0.00011552194,0.0003996249,0.0006470138,0.000032548214,0.000032047268,0.0005125986,0.00005225283,0.7427476,0.21747664,0.019898728,0.018048441,0.000037030055],"about_ca_topic_score_codex":0.00064494385,"about_ca_topic_score_gemma":0.0010422484,"teacher_disagreement_score":0.0041780975,"about_ca_system_score_codex":0.0005460258,"about_ca_system_score_gemma":0.0006867524,"threshold_uncertainty_score":0.01397717},"labels":[],"label_agreement":null},{"id":"W2153149491","doi":"10.1109/cwit.2007.375726","title":"On Decoding Binary Quasi-Perfect Codes Over Markov Noise Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Hamming code; Binary symmetric channel; Linear code; Block code; Algorithm; Hamming distance; Hamming bound; Markov chain; Computer science; Sequential decoding; Hamming weight; Mathematics; Binary code; Binary number; Low-density parity-check code; Statistics; Arithmetic","score_opus":0.012718783682532988,"score_gpt":0.25663382338157664,"score_spread":0.24391503969904366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153149491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.18591073,0.00054114865,0.8086553,0.0007428089,0.000055968518,0.00004801433,0.00011380203,0.00014478581,0.003787343],"genre_scores_gemma":[0.94050914,0.00089459226,0.055638924,0.00015295725,0.000086031396,0.00007592345,0.00012664769,0.000053504733,0.0024622753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977998,0.00112845,0.00007782478,0.00017205051,0.00048456076,0.00033727422],"domain_scores_gemma":[0.9872799,0.010850103,0.0007706219,0.00041406503,0.0005452295,0.00013998497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023709408,0.000761328,0.0009350005,0.0006171354,0.00061518594,0.0011999415,0.00084744144,0.0012540318,0.00097302906],"category_scores_gemma":[0.013424857,0.00044745745,0.00035078137,0.001246983,0.0030335707,0.002947952,0.0015485701,0.0011301107,0.00025544275],"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.0003337343,0.00003467593,0.0008572204,0.00015181658,0.000024078878,0.00026020568,0.00025245218,0.7622347,0.0053889914,0.21913216,0.0005403034,0.010789542],"study_design_scores_gemma":[0.000029323515,0.000052435495,0.00013787879,0.0000143946845,0.000005332331,0.00006927468,0.000029198109,0.92623615,0.0018346277,0.0714318,0.00014413899,0.000015378724],"about_ca_topic_score_codex":0.002473089,"about_ca_topic_score_gemma":0.0015012044,"teacher_disagreement_score":0.002473089,"about_ca_system_score_codex":0.0012642432,"about_ca_system_score_gemma":0.0013908354,"threshold_uncertainty_score":0.01253885},"labels":[],"label_agreement":null},{"id":"W2153763450","doi":"10.1093/qmath/has026","title":"VALUE SETS OF POLYNOMIAL MAPS OVER FINITE FIELDS","year":2012,"lang":"en","type":"article","venue":"The Quarterly Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cardinality (data modeling); Mathematics; Univariate; Finite field; Polynomial; Value (mathematics); Set (abstract data type); Field (mathematics); Finite set; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science; Statistics; Multivariate statistics","score_opus":0.01633911009885555,"score_gpt":0.2519146443295315,"score_spread":0.23557553423067593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153763450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5443783,0.0035595752,0.4070769,0.003615239,0.000302609,0.00015765495,0.0023038776,0.00069051434,0.037915394],"genre_scores_gemma":[0.95449066,0.0017183213,0.03789895,0.00023545414,0.0006490467,0.00021520424,0.0011163387,0.00018676987,0.003489199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921827,0.0020527865,0.00050406624,0.0012238733,0.0026169822,0.0014195188],"domain_scores_gemma":[0.9192673,0.066526346,0.0039007866,0.004623384,0.0025645948,0.0031175804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00636818,0.0013507934,0.0025842574,0.0038609202,0.003080892,0.008170414,0.0033024822,0.0015674625,0.0043196403],"category_scores_gemma":[0.039595053,0.0012962592,0.0022818607,0.00322312,0.0050502853,0.016985675,0.006176703,0.005299245,0.0006664765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009891131,0.00016618491,0.0045321216,0.00035337877,0.00015227924,0.00041003193,0.00086562865,0.033545785,0.0053385706,0.92540854,0.0026325863,0.025605876],"study_design_scores_gemma":[0.00004304048,0.00006109007,0.00068340066,0.00010908195,0.000075253876,0.0003419548,0.00013718943,0.07089582,0.0050441,0.9198369,0.0027128186,0.000059262275],"about_ca_topic_score_codex":0.00046981813,"about_ca_topic_score_gemma":0.00038485831,"teacher_disagreement_score":0.008170414,"about_ca_system_score_codex":0.0031222901,"about_ca_system_score_gemma":0.0014382428,"threshold_uncertainty_score":0.03367853},"labels":[],"label_agreement":null},{"id":"W2154006376","doi":"10.1109/tit.2006.871062","title":"A new binary sequence family with low correlation and large size","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Binary number; Integer (computer science); Physics; Correlation; Sequence (biology); Mathematics; Arithmetic; Geometry; Chemistry","score_opus":0.005060276466135727,"score_gpt":0.19318052446566364,"score_spread":0.18812024799952792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154006376","genre_codex":"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.5852212,0.0014518659,0.37609375,0.00043431952,0.0001542586,0.00009773653,0.00063245447,0.0009279184,0.03498644],"genre_scores_gemma":[0.8318835,0.00075578457,0.15131669,0.00021015469,0.0000794624,0.00016009957,0.0010404489,0.00014100471,0.014412872],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996803,0.000062964726,0.000023321494,0.00009013511,0.000090885376,0.000052306183],"domain_scores_gemma":[0.9993193,0.00018112062,0.00010869087,0.00012953627,0.00017125586,0.000090085734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000245242,0.00025759815,0.0003370815,0.00061716273,0.0006619425,0.0004273743,0.00030183143,0.00031077312,0.0019821273],"category_scores_gemma":[0.0010806894,0.0001925208,0.00038460433,0.00061834964,0.0004225137,0.0007212372,0.000524129,0.0004267331,0.00041499085],"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.00077926804,0.00015634262,0.0072437436,0.00046589988,0.000064665655,0.001927417,0.0008673104,0.027578197,0.3686444,0.3081181,0.009147711,0.27500695],"study_design_scores_gemma":[0.00014021847,0.0010308992,0.011149858,0.00018007669,0.00012492728,0.0096185235,0.0003769041,0.39245766,0.30795416,0.12676069,0.14998792,0.0002181654],"about_ca_topic_score_codex":0.0004349948,"about_ca_topic_score_gemma":0.0003664758,"teacher_disagreement_score":0.0019821273,"about_ca_system_score_codex":0.00047455495,"about_ca_system_score_gemma":0.0005324777,"threshold_uncertainty_score":0.006630838},"labels":[],"label_agreement":null},{"id":"W2154252189","doi":"10.1017/s0305004105008947","title":"Incomplete exponential sums and Diffie–Hellman triples","year":2006,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplicative function; Mathematics; Exponential function; Combinatorics; Integer (computer science); Order (exchange); Modulo; Prime (order theory); Distribution (mathematics); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.010405627194020287,"score_gpt":0.1960286202560741,"score_spread":0.18562299306205382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154252189","genre_codex":"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.31411445,0.0011208782,0.6761274,0.00095263193,0.00006944217,0.000055728262,0.00039776575,0.0002197486,0.0069420254],"genre_scores_gemma":[0.9491727,0.0010179721,0.046161365,0.00021235885,0.00026569527,0.00016568502,0.0005321185,0.00007607347,0.0023960476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701893,0.0010947587,0.00013752548,0.00070209935,0.0007841838,0.0002625452],"domain_scores_gemma":[0.9639951,0.02656539,0.0029172574,0.0044674147,0.0013579865,0.00069690053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063594654,0.0007120784,0.001035175,0.0021877864,0.0010190159,0.0023680506,0.0017277801,0.0009392318,0.0021639192],"category_scores_gemma":[0.046218336,0.00066294824,0.00046352303,0.0019032566,0.0035299873,0.010651843,0.0026655304,0.0019639165,0.00039934044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002420735,0.000056905184,0.007022773,0.00011372004,0.00007217795,0.00023793602,0.00037978851,0.06142974,0.002783597,0.89585674,0.0012484975,0.030556086],"study_design_scores_gemma":[0.000016626786,0.000060141923,0.0016430791,0.000046334455,0.000017582266,0.00028911434,0.0001360001,0.1716398,0.003445538,0.8210337,0.0016322527,0.000039883915],"about_ca_topic_score_codex":0.00038659797,"about_ca_topic_score_gemma":0.00022180115,"teacher_disagreement_score":0.0063594654,"about_ca_system_score_codex":0.001391319,"about_ca_system_score_gemma":0.0005857892,"threshold_uncertainty_score":0.033632517},"labels":[],"label_agreement":null},{"id":"W2154346619","doi":"10.1109/ccece.2006.277417","title":"Reducing Packet Loss in CBC Secured VoIP using Interleaved Encryption","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Voice over IP; Computer network; Block cipher; Encryption; Quality of service; Network packet; Ciphertext; Block size; Block (permutation group theory); Block cipher mode of operation; Key schedule; Key (lock); Computer security; Mathematics; The Internet; Operating system","score_opus":0.013921607741118084,"score_gpt":0.23743037516642054,"score_spread":0.22350876742530246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154346619","genre_codex":"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.37612268,0.00086513837,0.6180797,0.0002038812,0.000059734724,0.00009323035,0.00004013541,0.00086600357,0.0036694119],"genre_scores_gemma":[0.95943964,0.000209595,0.039456777,0.00003607353,0.000020383313,0.00002584319,0.00004382027,0.00003779298,0.0007301314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933654,0.00012516258,0.000051479412,0.000081781545,0.00030985303,0.00009516873],"domain_scores_gemma":[0.99769175,0.0010132247,0.00033721386,0.000579677,0.00031110842,0.000067039095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011872,0.0005818729,0.00047593185,0.000689811,0.00038942767,0.0007398366,0.00090137887,0.00044349546,0.00084100233],"category_scores_gemma":[0.0033359083,0.00023797971,0.00023797403,0.00053176406,0.00065560295,0.0018746555,0.0010912503,0.00081598776,0.00028232328],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022216968,0.0004164905,0.008916521,0.0002776066,0.00010710713,0.0009098412,0.0003905904,0.1733038,0.4867279,0.019834334,0.0010519614,0.30584222],"study_design_scores_gemma":[0.000082523715,0.00091274845,0.0028520213,0.000040095532,0.00008850623,0.0012882465,0.00013448116,0.7157216,0.26747715,0.008187758,0.0031694307,0.000045363664],"about_ca_topic_score_codex":0.0005238044,"about_ca_topic_score_gemma":0.00038515122,"teacher_disagreement_score":0.001011872,"about_ca_system_score_codex":0.00040702778,"about_ca_system_score_gemma":0.00032433102,"threshold_uncertainty_score":0.0053513646},"labels":[],"label_agreement":null},{"id":"W2154757782","doi":"10.1109/iscas.2008.4542158","title":"A high speed word level finite field multiplier using reordered normal basis","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Computer science; Finite field; Very-large-scale integration; Basis (linear algebra); Permutation (music); Critical path method; Word (group theory); Adder; Word length; Architecture; Arithmetic; Algorithm; Mathematics; Discrete mathematics; Embedded system; Engineering","score_opus":0.0625180271145517,"score_gpt":0.24756020241453203,"score_spread":0.18504217529998032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154757782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.25655925,0.00063892227,0.7204213,0.00032193074,0.00038646872,0.00017058996,0.00015872795,0.0019986324,0.019344198],"genre_scores_gemma":[0.6402017,0.00029609367,0.3467528,0.0001458195,0.00009440871,0.00006841296,0.00023310681,0.00006663979,0.012141018],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999199,0.000014533207,0.0000062494028,0.00001729151,0.000026702604,0.000015375428],"domain_scores_gemma":[0.99988496,0.00001952685,0.000018469604,0.000020957323,0.000043832708,0.000012250977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012320693,0.00028100688,0.00024614178,0.0003509963,0.00027769373,0.0003757811,0.00036173966,0.0003345598,0.0026676748],"category_scores_gemma":[0.00027695711,0.000117188334,0.00021043977,0.00035763675,0.00022164303,0.00059449807,0.00020020254,0.0003474894,0.00085132703],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064844766,0.00013864905,0.0010597158,0.00025309378,0.000064438944,0.00083405187,0.00015763823,0.01011129,0.5598703,0.064708106,0.0039894576,0.35816485],"study_design_scores_gemma":[0.00032142943,0.0043947273,0.0037466097,0.00010507186,0.00018590475,0.007426311,0.00017875574,0.18425651,0.65796524,0.045540247,0.095682636,0.00019664614],"about_ca_topic_score_codex":0.0002066996,"about_ca_topic_score_gemma":0.00054378365,"teacher_disagreement_score":0.0026676748,"about_ca_system_score_codex":0.00019587947,"about_ca_system_score_gemma":0.00035482683,"threshold_uncertainty_score":0.008924246},"labels":[],"label_agreement":null},{"id":"W2154926368","doi":"10.1016/j.disc.2008.12.027","title":"Error-correcting codes from permutation groups","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Engineering and Physical Sciences Research Council; Government of the United Kingdom; GCHQ","keywords":"Mathematics; Conjecture; Permutation (music); Permutation group; Permutation graph; Combinatorics; Symmetric group; Discrete mathematics; Decoding methods; Construct (python library); Partial permutation; Cyclic permutation; Graph; Algorithm; Computer science","score_opus":0.01787885720311226,"score_gpt":0.2609267653700013,"score_spread":0.24304790816688904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154926368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.17316434,0.0056478893,0.72795504,0.0068548736,0.0015745818,0.00029211008,0.0009033951,0.0015594516,0.082048394],"genre_scores_gemma":[0.88361764,0.004849905,0.074267395,0.00093871914,0.0011504005,0.00022504563,0.00075049483,0.00033585785,0.03386464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988882,0.00023221497,0.000055975815,0.00013572419,0.0005548015,0.00013310627],"domain_scores_gemma":[0.99631566,0.0018534426,0.00041463962,0.0008430502,0.0004691856,0.00010407228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080957153,0.0009490602,0.0007365068,0.0018764382,0.000959724,0.0019902901,0.00095647166,0.0016662483,0.0039509684],"category_scores_gemma":[0.006473483,0.0004501154,0.0005080819,0.0021602435,0.0018661798,0.0030898592,0.0021189475,0.0024521507,0.0011227914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100954654,0.000031494277,0.0002848509,0.00013974695,0.000017104894,0.00020841068,0.00025689308,0.012870901,0.0041258885,0.9333095,0.0033934682,0.045260888],"study_design_scores_gemma":[0.000024140518,0.000032943793,0.00014401188,0.00003961917,0.000013466972,0.0002742834,0.000026591291,0.020947088,0.0058197714,0.9639574,0.008695292,0.00002533379],"about_ca_topic_score_codex":0.0005254651,"about_ca_topic_score_gemma":0.00037863592,"teacher_disagreement_score":0.0039509684,"about_ca_system_score_codex":0.0009236214,"about_ca_system_score_gemma":0.0012447466,"threshold_uncertainty_score":0.01321733},"labels":[],"label_agreement":null},{"id":"W2156237015","doi":"10.1109/tit.2011.2111110","title":"Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multiplicative function; Mathematics","score_opus":0.012477722220665894,"score_gpt":0.19537316860760717,"score_spread":0.18289544638694127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156237015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2711621,0.0011087679,0.66382414,0.0014474865,0.00031322023,0.00014772466,0.0010680768,0.0018487688,0.05907978],"genre_scores_gemma":[0.8526892,0.00088503433,0.11718382,0.0009727015,0.0005485938,0.0004058354,0.0016261073,0.0007275613,0.024961213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760723,0.0006925343,0.00013756136,0.000567,0.00068939937,0.00030625067],"domain_scores_gemma":[0.99032146,0.004871544,0.0012093543,0.0014196944,0.0015159453,0.0006620114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017280006,0.0007231103,0.000719339,0.0024242292,0.0017301588,0.0018108021,0.00072036695,0.0010149514,0.005985951],"category_scores_gemma":[0.013273488,0.00081611105,0.0012539498,0.001538467,0.0016111417,0.0022002168,0.001818279,0.0020516708,0.0031270462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043432953,0.0000914856,0.0022313136,0.0002452357,0.000045567485,0.0014536117,0.000996084,0.011046853,0.01800102,0.9005197,0.008078078,0.056856707],"study_design_scores_gemma":[0.00010382858,0.00030270914,0.0026100175,0.00020102161,0.00009065793,0.0040715756,0.00034013737,0.114534825,0.02744243,0.808197,0.041927077,0.00017865088],"about_ca_topic_score_codex":0.000733533,"about_ca_topic_score_gemma":0.0006133424,"teacher_disagreement_score":0.005985951,"about_ca_system_score_codex":0.0016886991,"about_ca_system_score_gemma":0.0013632223,"threshold_uncertainty_score":0.020024955},"labels":[],"label_agreement":null},{"id":"W2156362874","doi":"10.1109/bsc.2006.1644571","title":"A Lower Bound on the Minimum Distance of a 1-Generator Quasi-Cyclic Code","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Generator (circuit theory); Algorithm; Combinatorics; Physics; Computer science; Mathematics","score_opus":0.012776166007441428,"score_gpt":0.2217417485311823,"score_spread":0.20896558252374087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156362874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.497732,0.005579843,0.3757693,0.010844609,0.00082161295,0.00028106288,0.0066881566,0.0023301458,0.09995332],"genre_scores_gemma":[0.8722396,0.0015859292,0.102909684,0.0011342104,0.0005791671,0.0004969195,0.0039890753,0.0005092259,0.016556218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962525,0.0007415047,0.00017771841,0.00075259723,0.0013792623,0.0006964383],"domain_scores_gemma":[0.98063517,0.01335132,0.0010709028,0.0021206709,0.0016001238,0.0012218296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015493075,0.0011102284,0.0013910559,0.0014424305,0.0015983019,0.0024547917,0.0030138919,0.002382951,0.010210201],"category_scores_gemma":[0.01843624,0.0006122817,0.00076386245,0.0014610786,0.001650003,0.0034640785,0.0030090872,0.0030101244,0.0035788722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052417223,0.0005148364,0.00883272,0.0019033469,0.00024668715,0.0012121702,0.0010917468,0.13060383,0.06043682,0.59369516,0.036120426,0.16010065],"study_design_scores_gemma":[0.00042944512,0.0011870213,0.0038319454,0.0004090274,0.0001416311,0.002816562,0.0003167309,0.31006598,0.034385733,0.62162745,0.024556104,0.00023244947],"about_ca_topic_score_codex":0.0013002321,"about_ca_topic_score_gemma":0.0016134337,"teacher_disagreement_score":0.010210201,"about_ca_system_score_codex":0.002372686,"about_ca_system_score_gemma":0.0026111705,"threshold_uncertainty_score":0.0341565},"labels":[],"label_agreement":null},{"id":"W2157055070","doi":"10.1002/ett.1523","title":"Collaborative algebraic decoding of interleaved Reed–Solomon codes","year":2011,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"List decoding; Concatenated error correction code; Reed–Solomon error correction; Serial concatenated convolutional codes; Sequential decoding; Berlekamp–Welch algorithm; Decoding methods; Linear code; Algorithm; Mathematics; Block code; Computer science","score_opus":0.02428618657381141,"score_gpt":0.2586574155446826,"score_spread":0.23437122897087118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157055070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.022674365,0.0001147419,0.9751022,0.00005755796,0.000021045667,0.00004090375,0.00002868263,0.00015367067,0.0018068219],"genre_scores_gemma":[0.55583584,0.00030420767,0.4402776,0.00007846603,0.00006180722,0.000116554234,0.00017451435,0.00007555235,0.003075486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695635,0.0007224823,0.00020316675,0.00034737523,0.0014805491,0.00029007668],"domain_scores_gemma":[0.9940089,0.002581813,0.0009971091,0.0010672392,0.0012101834,0.00013476681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019464515,0.0009095017,0.0010216214,0.0010251981,0.0006374032,0.0013105772,0.0013861939,0.0008930707,0.0009555831],"category_scores_gemma":[0.008558254,0.00034627327,0.0009081331,0.001136661,0.0012932929,0.0013351401,0.0020995631,0.0011076813,0.0005947828],"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.0004285929,0.00009540517,0.0020645543,0.00018583762,0.00016238923,0.00051964406,0.0003582982,0.64293087,0.035697263,0.18674912,0.0009493318,0.12985869],"study_design_scores_gemma":[0.000022470165,0.000090150046,0.00020058903,0.000021298667,0.000029153307,0.00022923219,0.000021533251,0.95000666,0.027087986,0.020741608,0.0015229726,0.00002640892],"about_ca_topic_score_codex":0.001146166,"about_ca_topic_score_gemma":0.0012525546,"teacher_disagreement_score":0.0019464515,"about_ca_system_score_codex":0.0010597152,"about_ca_system_score_gemma":0.0014561116,"threshold_uncertainty_score":0.010293901},"labels":[],"label_agreement":null},{"id":"W2159333237","doi":"10.1109/icc.2009.5198625","title":"A Low Complexity Iterative Technique for Soft Decision Decoding of Reed-Solomon Codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Belief propagation; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Parity-check matrix; Algorithm; Computer science; Factor graph; Low-density parity-check code; Tanner graph; Linear code; Binary number; Block code; Concatenated error correction code; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.03075280943614378,"score_gpt":0.29663398448263273,"score_spread":0.26588117504648895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159333237","genre_codex":"methods","genre_gemma":"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.0028264471,0.00018659588,0.99591774,0.000045017834,0.000030322599,0.000025665877,0.000017704819,0.0002811855,0.0006694326],"genre_scores_gemma":[0.10485549,0.00042115015,0.89154315,0.000074211974,0.000059576305,0.0001423587,0.0001127705,0.00008508201,0.0027061761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901366,0.00021073152,0.0000524909,0.00009430764,0.00056823005,0.00006054736],"domain_scores_gemma":[0.99891794,0.0005065371,0.00011319739,0.00014394529,0.00027845718,0.000039972543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005741636,0.0008977481,0.0007020707,0.0010060789,0.00046465176,0.00060498493,0.0010283422,0.0007244877,0.0014333377],"category_scores_gemma":[0.0024994656,0.00040463707,0.0007311086,0.0006679918,0.00065059104,0.0008028284,0.0010486386,0.0013457105,0.0010153803],"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.00027256805,0.00009723608,0.00092486443,0.0004418901,0.00016906857,0.00043892302,0.0004013809,0.10141394,0.13168724,0.05642315,0.0028715672,0.7048581],"study_design_scores_gemma":[0.000054336346,0.00018855455,0.00041373333,0.000049925973,0.00005512584,0.00074861693,0.000028109702,0.889528,0.08477565,0.01607167,0.008007419,0.00007895125],"about_ca_topic_score_codex":0.0009658111,"about_ca_topic_score_gemma":0.0011944239,"teacher_disagreement_score":0.0014333377,"about_ca_system_score_codex":0.00054795435,"about_ca_system_score_gemma":0.0010222368,"threshold_uncertainty_score":0.004795015},"labels":[],"label_agreement":null},{"id":"W2159478385","doi":"10.1109/tcomm.2004.833044","title":"High-Order Spectral-Null Multimode Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scrambling; Multi-mode optical fiber; Coding (social sciences); Null (SQL); Algorithm; Mathematics; Computer science; Concatenated error correction code; Block code; Decoding methods; Telecommunications; Optical fiber; Statistics","score_opus":0.024820448395127773,"score_gpt":0.26444082072791125,"score_spread":0.2396203723327835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159478385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.16934933,0.0013007977,0.8060825,0.00033878497,0.0002649672,0.00006410709,0.00023735294,0.00049183064,0.021870313],"genre_scores_gemma":[0.7384917,0.0013361208,0.24393424,0.00027849653,0.00022897952,0.00012576392,0.00033613574,0.00009298675,0.01517561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971384,0.00004622521,0.000015355015,0.000043279077,0.0001349416,0.00004629906],"domain_scores_gemma":[0.9990859,0.00024905914,0.00012847761,0.0001646774,0.00030670024,0.000065163826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026421418,0.00034927108,0.00029137894,0.00079085067,0.0003226696,0.0005854465,0.00034498586,0.0004553504,0.0011994884],"category_scores_gemma":[0.0011411563,0.000119552285,0.00019863331,0.00046026052,0.0006128845,0.0006994138,0.00044293868,0.0005803848,0.0004461184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030156987,0.0000617335,0.0016863889,0.00016320687,0.000022971377,0.00034243465,0.00022678013,0.021707615,0.15662237,0.6529126,0.002412392,0.16353986],"study_design_scores_gemma":[0.00006906166,0.0003511541,0.0019434553,0.000088562745,0.000030523042,0.0025234919,0.00008184773,0.41539064,0.232319,0.2942868,0.05275431,0.00016117473],"about_ca_topic_score_codex":0.0002818013,"about_ca_topic_score_gemma":0.00033292372,"teacher_disagreement_score":0.0011994884,"about_ca_system_score_codex":0.00037975347,"about_ca_system_score_gemma":0.0004956838,"threshold_uncertainty_score":0.0040126443},"labels":[],"label_agreement":null},{"id":"W2159864227","doi":"10.1109/isit.2008.4595423","title":"New results on periodic sequences with large k-error linear complexity","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Average-case complexity; Structural complexity theory; Computational complexity theory; PH; Time complexity; Complexity class; Sequence (biology); Combinatorics; Algorithm; Discrete mathematics; Quantum complexity theory","score_opus":0.06331512143643958,"score_gpt":0.2705075409069949,"score_spread":0.20719241947055533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159864227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.43429053,0.0041996115,0.45955944,0.0027701408,0.00035918847,0.00011108908,0.00053511624,0.0004800486,0.09769477],"genre_scores_gemma":[0.9405629,0.0014205807,0.04962635,0.00035123358,0.000703296,0.00009564465,0.00021934489,0.00007844753,0.0069422857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986909,0.0002950293,0.00008069492,0.00022991178,0.00050044234,0.00020289507],"domain_scores_gemma":[0.98772395,0.008376925,0.0011401481,0.0013172175,0.0008462427,0.0005955393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015096895,0.00067254313,0.0006530331,0.0021779092,0.00096084026,0.0015313915,0.0007195765,0.00086628925,0.0034367563],"category_scores_gemma":[0.011279541,0.000463744,0.00049828744,0.0011443126,0.002503781,0.005365222,0.0023424805,0.002171812,0.0004754519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023400168,0.00007419596,0.002535905,0.00022996885,0.00003254738,0.0005277672,0.00042893807,0.036711756,0.011215502,0.91357875,0.0020616546,0.03236907],"study_design_scores_gemma":[0.00002709233,0.00016520724,0.0017546142,0.0000624631,0.000026590296,0.00076661306,0.00012776494,0.12786756,0.008055544,0.85614055,0.0049423245,0.000063719745],"about_ca_topic_score_codex":0.00027491665,"about_ca_topic_score_gemma":0.00025900904,"teacher_disagreement_score":0.0034367563,"about_ca_system_score_codex":0.00089323457,"about_ca_system_score_gemma":0.0006482274,"threshold_uncertainty_score":0.01149708},"labels":[],"label_agreement":null},{"id":"W2160095768","doi":"10.1109/glocom.2003.1258202","title":"Application of reed-solomon codes with erasure decoding to type-II hybrid ARQ transmission","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hybrid automatic repeat request; Computer science; Reed–Solomon error correction; Erasure; Decoding methods; Automatic repeat request; Selective Repeat ARQ; Error detection and correction; Algorithm; Code rate; Erasure code; Concatenated error correction code; Block code; Transmission (telecommunications); Telecommunications","score_opus":0.007956282967644801,"score_gpt":0.2252405716604495,"score_spread":0.2172842886928047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160095768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.16450627,0.0006826355,0.82858765,0.00020296089,0.00013139128,0.0001609551,0.000043057124,0.000647284,0.0050378423],"genre_scores_gemma":[0.8165643,0.00032512058,0.18113531,0.00008722623,0.000079281446,0.00008691658,0.00003791651,0.000041495427,0.0016424663],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991002,0.00037949343,0.000064627806,0.00007554487,0.00032112005,0.000058964783],"domain_scores_gemma":[0.9969506,0.0013447028,0.0003557787,0.0007825396,0.0005039929,0.00006220761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012301748,0.00054220564,0.0004015128,0.0005933557,0.00030754684,0.00062992726,0.0007106067,0.00046649,0.000620315],"category_scores_gemma":[0.0037635074,0.00021218033,0.00034614716,0.00035853387,0.0008142061,0.0006626576,0.000812182,0.00047453956,0.00022917347],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011066814,0.00018430447,0.0049044127,0.00041816712,0.00031526043,0.001652811,0.00069707324,0.1991296,0.39342618,0.12576576,0.0011604549,0.27123928],"study_design_scores_gemma":[0.000084929634,0.0010612393,0.0010339066,0.000047161404,0.00007978248,0.0018015536,0.000075815544,0.7389125,0.22348954,0.027014242,0.0063323495,0.00006696278],"about_ca_topic_score_codex":0.00019190536,"about_ca_topic_score_gemma":0.00022909592,"teacher_disagreement_score":0.0012301748,"about_ca_system_score_codex":0.00023865887,"about_ca_system_score_gemma":0.0002465091,"threshold_uncertainty_score":0.0065059066},"labels":[],"label_agreement":null},{"id":"W2160227782","doi":"10.1145/2465506.2465956","title":"Fast algorithms for <i>l</i> -adic towers over finite fields","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Finite field; Closure (psychology); Algorithm; Computer science; Field (mathematics); Work (physics); Mathematics; Algebra over a field; Theoretical computer science; Discrete mathematics; Pure mathematics; Engineering; Mechanical engineering","score_opus":0.025011288093148565,"score_gpt":0.2605562789935025,"score_spread":0.2355449909003539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160227782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.054681465,0.00085387187,0.9118719,0.0012225751,0.00030118195,0.00028855095,0.0009986736,0.009132917,0.020648854],"genre_scores_gemma":[0.3799009,0.0005595145,0.6034695,0.00034849785,0.00024480693,0.00035646994,0.0026490295,0.0017977795,0.010673547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977064,0.00043073934,0.00019849023,0.0004708172,0.0006919347,0.0005015555],"domain_scores_gemma":[0.9915175,0.004349808,0.000558023,0.0023269635,0.0008756341,0.0003720916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021858602,0.0017110688,0.0017040937,0.003058952,0.0023605544,0.005802667,0.0036023003,0.0019062645,0.020706499],"category_scores_gemma":[0.010235725,0.0012801565,0.0023885553,0.0027737012,0.0021968747,0.011857076,0.005754239,0.004117679,0.0072784275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010593794,0.00026356778,0.0036150028,0.0010546672,0.00014793663,0.00038578385,0.0013063239,0.047895074,0.015914442,0.5291314,0.033750903,0.36547557],"study_design_scores_gemma":[0.00025909508,0.00013187839,0.0004630482,0.00015697163,0.00005443528,0.00033125843,0.00032849956,0.19014801,0.016885635,0.7772476,0.013900982,0.00009261812],"about_ca_topic_score_codex":0.0016739117,"about_ca_topic_score_gemma":0.0033859564,"teacher_disagreement_score":0.020706499,"about_ca_system_score_codex":0.0036939916,"about_ca_system_score_gemma":0.002398194,"threshold_uncertainty_score":0.069270134},"labels":[],"label_agreement":null},{"id":"W2160860009","doi":"10.1109/tit.2007.911265","title":"New Nonbinary Self-Dual Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dual (grammatical number); Circulant matrix; Code (set theory); Construct (python library); Computer science; Minimum distance; Mathematics; Discrete mathematics; Combinatorics; Programming language","score_opus":0.010026629562084466,"score_gpt":0.20623723997782367,"score_spread":0.1962106104157392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160860009","genre_codex":"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.58914274,0.000714429,0.35808304,0.00073153793,0.00050323916,0.00013165642,0.0004341392,0.0005478156,0.04971144],"genre_scores_gemma":[0.81484395,0.00037810983,0.1513,0.00045670968,0.0001546253,0.00019851897,0.00064310397,0.0001887006,0.031836253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994665,0.000100869336,0.000031094176,0.00009546983,0.00022420239,0.00008187974],"domain_scores_gemma":[0.9985696,0.0003051455,0.00018773132,0.00027416844,0.00044620497,0.00021713861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044504978,0.0003808667,0.0003771896,0.0013413318,0.00074795855,0.00088625617,0.00052878197,0.00077633886,0.0036518986],"category_scores_gemma":[0.0017627403,0.00030943504,0.00036884236,0.0007595989,0.000803273,0.0009926627,0.0013576044,0.0009874898,0.00083671557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027941854,0.00016814403,0.0014952639,0.0001699728,0.000033890978,0.00034163418,0.0003024374,0.014264165,0.04790012,0.87283176,0.0047834343,0.057429876],"study_design_scores_gemma":[0.00018136961,0.00038307218,0.0025632414,0.00012217187,0.000058604506,0.0021957837,0.00021478035,0.3235004,0.089530915,0.53873444,0.04234443,0.00017084423],"about_ca_topic_score_codex":0.0002993151,"about_ca_topic_score_gemma":0.0005295845,"teacher_disagreement_score":0.0036518986,"about_ca_system_score_codex":0.00066065806,"about_ca_system_score_gemma":0.00074850675,"threshold_uncertainty_score":0.012216806},"labels":[],"label_agreement":null},{"id":"W2160893622","doi":"10.1016/j.disc.2003.10.027","title":"Binary optimal linear rate 1/2 codes","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Automorphism group; Linear code; Minimum distance; Discrete mathematics; Binary number; Code (set theory); Binary code; Automorphism; Block code; Decoding methods; Algorithm; Arithmetic","score_opus":0.017284274332645698,"score_gpt":0.255960872085661,"score_spread":0.23867659775301528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160893622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.10672932,0.0077984845,0.67814475,0.011303606,0.0022030373,0.0003461786,0.0024959352,0.0018101084,0.18916847],"genre_scores_gemma":[0.7708863,0.0045823143,0.151077,0.0027661668,0.0014744997,0.0007041925,0.0009878952,0.00068316044,0.0668386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687874,0.0009545082,0.0001745638,0.00034827428,0.0009958011,0.000648075],"domain_scores_gemma":[0.99647,0.0017057591,0.00037746615,0.0006759236,0.00058216683,0.00018868818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018020674,0.0014528676,0.0012101589,0.0016831582,0.0011938512,0.0030212237,0.0013513615,0.0024090058,0.01254993],"category_scores_gemma":[0.008878532,0.0008229825,0.0005988134,0.0024227202,0.001626374,0.0033762276,0.003027367,0.0023398774,0.0031189036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064339954,0.000094073825,0.00038375036,0.0002817996,0.00003932771,0.00010598229,0.00015613413,0.03235385,0.008023974,0.86413664,0.014215795,0.07956535],"study_design_scores_gemma":[0.00021057995,0.00014119534,0.0003207888,0.00021276558,0.00005130648,0.00033167808,0.00008111414,0.12786175,0.01011933,0.84374344,0.016831933,0.00009404453],"about_ca_topic_score_codex":0.00073223043,"about_ca_topic_score_gemma":0.00096396374,"teacher_disagreement_score":0.01254993,"about_ca_system_score_codex":0.0022147652,"about_ca_system_score_gemma":0.0025804588,"threshold_uncertainty_score":0.041983724},"labels":[],"label_agreement":null},{"id":"W2161136434","doi":"10.1109/isit.1995.550338","title":"Spectral properties and information leakage of multi-output Boolean functions","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Boolean function; Leakage (economics); Cryptography; Boolean network; Function (biology); Mathematics; Information leakage; Discrete mathematics; Boolean expression; Computer science; Algorithm","score_opus":0.037809060189052446,"score_gpt":0.19117109994573644,"score_spread":0.153362039756684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161136434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.1903565,0.0006094494,0.7957985,0.00044413755,0.00005275157,0.00004244889,0.0000881687,0.00015963706,0.012448523],"genre_scores_gemma":[0.9724883,0.00035831615,0.025519045,0.000113430906,0.00005852737,0.000051650917,0.000048762206,0.000039735067,0.001322213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984084,0.00038736957,0.00012344672,0.00020457618,0.0006776497,0.00019859997],"domain_scores_gemma":[0.99504846,0.0029076382,0.0007559442,0.00060681376,0.0005470417,0.00013401207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015871775,0.00047277825,0.0005535012,0.0013640157,0.00051548035,0.0016823834,0.0005586439,0.00066149817,0.0016798739],"category_scores_gemma":[0.0064419317,0.00025356992,0.00054353237,0.0009036392,0.0021009722,0.0042775404,0.0014203117,0.0010099717,0.00035617317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031011508,0.00006219941,0.00094676454,0.00017859756,0.000033719203,0.00038940422,0.00034695453,0.05013505,0.03494949,0.872681,0.0003684907,0.039598204],"study_design_scores_gemma":[0.00002722061,0.00016502666,0.0005643662,0.00005837341,0.000027433685,0.0008358907,0.00011892762,0.2679509,0.037485357,0.6906327,0.0020811362,0.000052713254],"about_ca_topic_score_codex":0.00009230144,"about_ca_topic_score_gemma":0.00006008574,"teacher_disagreement_score":0.0016823834,"about_ca_system_score_codex":0.00072545843,"about_ca_system_score_gemma":0.00032999067,"threshold_uncertainty_score":0.008393943},"labels":[],"label_agreement":null},{"id":"W2161786270","doi":"10.1016/j.disc.2004.10.001","title":"Erratum to “Construction of new extremal self-dual codes” [Discrete Mathematics 263 (2003) 81–91]","year":2004,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Combinatorics","score_opus":0.016396793248745076,"score_gpt":0.24953170746511466,"score_spread":0.2331349142163696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161786270","genre_codex":"editorial","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.0010190918,0.0027296224,0.0056269267,0.06005994,0.9024553,0.00008977391,0.0015368937,0.0006796596,0.025802838],"genre_scores_gemma":[0.035893448,0.016243175,0.03244322,0.112979084,0.19522807,0.00049608405,0.008986028,0.0028910083,0.5948399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974573,0.0003801606,0.00038390743,0.00031634886,0.0012368927,0.00022541499],"domain_scores_gemma":[0.99432087,0.0012847747,0.00037876578,0.00059011305,0.0031003612,0.00032522803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018660243,0.0025728154,0.002689676,0.003917383,0.005258704,0.0031593195,0.005195097,0.006201586,0.046905246],"category_scores_gemma":[0.020595077,0.0013954957,0.0016559999,0.0028461246,0.002550198,0.003972287,0.0017193904,0.008174507,0.022970729],"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.000101586724,0.000022791615,0.000056626468,0.00020105178,0.00002275606,0.00022982019,0.000033270735,0.0001684241,0.00026714912,0.0072118742,0.9822453,0.009439302],"study_design_scores_gemma":[0.00010504557,0.00012826416,0.0010470381,0.0003176979,0.00011006613,0.0007609571,0.0001168733,0.0015197784,0.0027573039,0.02602249,0.9669652,0.00014929702],"about_ca_topic_score_codex":0.0049311295,"about_ca_topic_score_gemma":0.007295888,"teacher_disagreement_score":0.046905246,"about_ca_system_score_codex":0.0035121976,"about_ca_system_score_gemma":0.0026891641,"threshold_uncertainty_score":0.1569137},"labels":[],"label_agreement":null},{"id":"W2162057952","doi":"10.1109/itw.2005.1531856","title":"The multivariate merit factor of a Boolean function","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Univariate; Asymptote; Boolean function; Multivariate statistics; Mathematics; Figure of merit; Quadratic equation; Function (biology); Multivariate analysis; Metric (unit); Value (mathematics); Statistics; Discrete mathematics; Computer science; Mathematical analysis; Engineering","score_opus":0.012129266420942161,"score_gpt":0.2263809565451967,"score_spread":0.21425169012425452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162057952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.3565714,0.0018823443,0.5960979,0.0010722437,0.00021673522,0.000038988866,0.00016178911,0.00049995835,0.043458693],"genre_scores_gemma":[0.9433621,0.000695115,0.049243744,0.00008243119,0.00017397675,0.00003859598,0.00006435354,0.000112847294,0.0062267235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992526,0.00017698588,0.000037616577,0.00009727714,0.0003151695,0.00012027288],"domain_scores_gemma":[0.9981281,0.0008490352,0.00024479232,0.00021826602,0.00038305417,0.000176854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012285021,0.00041462705,0.0005606461,0.0017771213,0.0007199535,0.0019495961,0.0004447643,0.000767186,0.0033109996],"category_scores_gemma":[0.006358492,0.0001816691,0.0003827317,0.0011035033,0.0019392413,0.0032352295,0.00095108064,0.0012238689,0.000617293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011515594,0.000010645376,0.000582792,0.000055072614,0.00000851721,0.00006044196,0.00008817769,0.0116112605,0.008401673,0.9384641,0.0009847265,0.03961739],"study_design_scores_gemma":[0.000015996106,0.00015366246,0.0011718795,0.00005178465,0.000023522107,0.00053817616,0.0000684314,0.11055491,0.009361401,0.8674805,0.010495323,0.000084362684],"about_ca_topic_score_codex":0.0003914346,"about_ca_topic_score_gemma":0.00034772052,"teacher_disagreement_score":0.0033109996,"about_ca_system_score_codex":0.0011957119,"about_ca_system_score_gemma":0.0005980463,"threshold_uncertainty_score":0.01107645},"labels":[],"label_agreement":null},{"id":"W2163023576","doi":"10.1109/pacrim.1989.48388","title":"The least complex parallel Massey-Omura multiplier and its LCA and VLSI designs","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Representation (politics); Polynomial; Computer science; Arithmetic; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Embedded system; Mathematical analysis","score_opus":0.04863150669127425,"score_gpt":0.24670657792527573,"score_spread":0.19807507123400148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163023576","genre_codex":"methods","genre_gemma":"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.07489022,0.0075987866,0.8157302,0.0014312454,0.00039781164,0.00016098401,0.000120484794,0.0005555514,0.09911471],"genre_scores_gemma":[0.5067426,0.007253994,0.4445278,0.0006315905,0.0006267531,0.0002103324,0.00011441398,0.000086451146,0.03980608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998671,0.00003261863,0.0000082524275,0.000023160532,0.00005387502,0.000015052116],"domain_scores_gemma":[0.99983704,0.000059766673,0.00003377252,0.000021058855,0.000039918577,0.0000084313415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018966821,0.0003093374,0.00019567787,0.0007447916,0.00041298682,0.0006965014,0.00033050354,0.00044717005,0.004188361],"category_scores_gemma":[0.0008412817,0.00015745113,0.00025325897,0.0009770148,0.0004499674,0.0008762367,0.00028523497,0.0004630907,0.0010119423],"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.00027397837,0.00005138983,0.00078520156,0.00033021712,0.000034127625,0.00053197815,0.00027580507,0.019704629,0.053255584,0.6224888,0.006505379,0.29576287],"study_design_scores_gemma":[0.00010612424,0.0009960883,0.002545901,0.00026562694,0.00014106123,0.006166645,0.00025889196,0.19975458,0.11114194,0.38834545,0.29016447,0.000113223105],"about_ca_topic_score_codex":0.0005016649,"about_ca_topic_score_gemma":0.00092485204,"teacher_disagreement_score":0.004188361,"about_ca_system_score_codex":0.0006100147,"about_ca_system_score_gemma":0.00051510095,"threshold_uncertainty_score":0.014011443},"labels":[],"label_agreement":null},{"id":"W2163288567","doi":"10.1016/j.disc.2009.12.006","title":"The number of irreducible polynomials of degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si115.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si116.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math> with given trace and constant terms","year":2010,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Degree (music); Combinatorics; TRACE (psycholinguistics); Constant (computer programming); Discrete mathematics; Physics; Computer science","score_opus":0.01869653219332097,"score_gpt":0.24817503262386428,"score_spread":0.22947850043054333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163288567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7108335,0.0012834824,0.101464264,0.0063188598,0.0008232776,0.00018114015,0.0074717826,0.0014858443,0.17013776],"genre_scores_gemma":[0.9391728,0.00080752734,0.0125796655,0.00023942575,0.0004212011,0.00007925871,0.00309807,0.00029438917,0.04330769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977062,0.00034811272,0.00012217936,0.00042339324,0.00069456716,0.0007055555],"domain_scores_gemma":[0.99155957,0.0037111458,0.0008880583,0.0012971052,0.0014100705,0.0011340558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017820192,0.0006650017,0.0008464451,0.0022351046,0.002216395,0.0037296645,0.0013578766,0.0010188838,0.020663943],"category_scores_gemma":[0.012177567,0.0003363342,0.00072828046,0.001805835,0.0028550907,0.0041207797,0.0020014218,0.002151066,0.00459654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018872502,0.0002825627,0.01211555,0.0007215556,0.00011961244,0.0007381816,0.0010577054,0.009773038,0.017728003,0.79955703,0.0330783,0.12294111],"study_design_scores_gemma":[0.00024077884,0.00043441533,0.01478721,0.00026539856,0.00021272013,0.0038592867,0.0007497102,0.038476992,0.053508837,0.8216524,0.06559657,0.00021565128],"about_ca_topic_score_codex":0.0013634085,"about_ca_topic_score_gemma":0.0012980328,"teacher_disagreement_score":0.020663943,"about_ca_system_score_codex":0.0018405407,"about_ca_system_score_gemma":0.0022143049,"threshold_uncertainty_score":0.0691278},"labels":[],"label_agreement":null},{"id":"W2163581636","doi":"10.1109/arith.2003.1207676","title":"A unidirectional bit serial systolic architecture for double-basis division over GF(2/sup m/)","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Division (mathematics); Verilog; Finite field; Galois theory; GF(2); Computer science; Cryptography; Parallel computing; Basis (linear algebra); Arithmetic; Dimension (graph theory); Computer hardware; Field-programmable gate array; Mathematics; Discrete mathematics; Algorithm; Combinatorics","score_opus":0.01374058181408562,"score_gpt":0.24190304157134102,"score_spread":0.2281624597572554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163581636","genre_codex":"methods","genre_gemma":"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.13683362,0.00068807934,0.83301497,0.00036514248,0.00037448737,0.00019620733,0.00033087152,0.0057525104,0.02244415],"genre_scores_gemma":[0.57025045,0.00040618982,0.4170123,0.0002549657,0.000082335144,0.00013691302,0.00047693253,0.000096035255,0.011283944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999219,0.00001565963,0.000008236054,0.000012663005,0.000027590311,0.000013979983],"domain_scores_gemma":[0.9998497,0.000026771791,0.000022642835,0.000023182936,0.00006296555,0.000014766976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001698481,0.00027514505,0.00016864936,0.00033399859,0.00025599496,0.0004441407,0.00055646483,0.00025938888,0.003538515],"category_scores_gemma":[0.0002739219,0.000095431016,0.00018123139,0.00039875763,0.00018078678,0.00032459243,0.00020540193,0.00026330233,0.0013927898],"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.0006480578,0.00015160642,0.0014431621,0.00036018254,0.000042901524,0.0005183691,0.0001640243,0.019799931,0.3923279,0.04398427,0.008607355,0.53195226],"study_design_scores_gemma":[0.000378893,0.0038382225,0.0026166954,0.00017723386,0.00023388756,0.0027987994,0.00015455399,0.31759983,0.53847533,0.021831106,0.11179144,0.00010387541],"about_ca_topic_score_codex":0.00047649044,"about_ca_topic_score_gemma":0.00095974596,"teacher_disagreement_score":0.003538515,"about_ca_system_score_codex":0.00025928332,"about_ca_system_score_gemma":0.00051894935,"threshold_uncertainty_score":0.011837542},"labels":[],"label_agreement":null},{"id":"W2163934701","doi":"10.1109/tit.2006.876253","title":"Algebraic immunity for cryptographically significant Boolean functions: analysis and construction","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":241,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Boolean function; Mathematics; Hamming weight; Cryptography; Algebraic function; Discrete mathematics; Boolean expression; Algebraic number; Hamming distance; Symmetric function; Addition theorem; Degree (music); Function (biology); Hamming code; Algorithm","score_opus":0.004967897182034475,"score_gpt":0.19394458703232492,"score_spread":0.18897668985029045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163934701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.33203566,0.00045806574,0.64719975,0.00074596115,0.000048709207,0.000101766265,0.00011862107,0.00037818978,0.018913234],"genre_scores_gemma":[0.92545223,0.0004321377,0.07010528,0.00010595445,0.000094065625,0.00009754403,0.00014190677,0.00006183292,0.0035090726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992643,0.00016137266,0.000046797864,0.00009923959,0.0003065459,0.00012173998],"domain_scores_gemma":[0.99800414,0.0011521602,0.00022870216,0.00034825987,0.00017930029,0.00008754262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000783768,0.0004325665,0.00038204127,0.0011314594,0.00064069545,0.001309413,0.00055406673,0.0005843689,0.0019007437],"category_scores_gemma":[0.003748247,0.00025354672,0.00086336385,0.0006509883,0.0024555053,0.0019796574,0.0016166022,0.0015650041,0.000427491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011072488,0.00006068531,0.0020730298,0.00012086199,0.00002233923,0.00014024808,0.00029676623,0.020935249,0.021865215,0.92124444,0.00069490937,0.032435477],"study_design_scores_gemma":[0.00003283626,0.00026030708,0.002259564,0.00005153149,0.0000762995,0.0012086814,0.00012590292,0.28299674,0.06348609,0.6390426,0.010400354,0.00005900209],"about_ca_topic_score_codex":0.00013109954,"about_ca_topic_score_gemma":0.00010974881,"teacher_disagreement_score":0.0019007437,"about_ca_system_score_codex":0.0008465948,"about_ca_system_score_gemma":0.00035444126,"threshold_uncertainty_score":0.006358564},"labels":[],"label_agreement":null},{"id":"W2164324071","doi":"10.1109/bsc.2006.1644587","title":"Quadratic Bent Functions of Polynomial Forms and their Applications to Bent Sequences","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Computer science; Mathematics","score_opus":0.009744861985308707,"score_gpt":0.2181534547826079,"score_spread":0.20840859279729917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164324071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.11622595,0.0015036879,0.8116072,0.0007413586,0.0005034773,0.00013817372,0.00034751583,0.000500739,0.06843192],"genre_scores_gemma":[0.57588124,0.0030401798,0.36184198,0.0007375159,0.0011076105,0.00027825797,0.0014198582,0.00053582614,0.055157546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844545,0.000411136,0.00013101618,0.00031182717,0.00044980607,0.00025071914],"domain_scores_gemma":[0.99813807,0.0007730833,0.00020396976,0.00022997764,0.00047470815,0.00018014299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003381,0.0010868307,0.00072150404,0.002693558,0.0013543809,0.002226839,0.0010322458,0.0009077603,0.008517728],"category_scores_gemma":[0.0052618007,0.00059027364,0.0011652163,0.002959114,0.0019487073,0.003532778,0.0021753637,0.0024666884,0.0027802864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012527347,0.00006300973,0.00061547256,0.00020081704,0.000016467757,0.0001844517,0.00055119063,0.0065154424,0.004756985,0.90468407,0.0023145024,0.079972334],"study_design_scores_gemma":[0.000023670511,0.00018220182,0.000800849,0.00012684075,0.000024535699,0.0007448566,0.00030252058,0.044373874,0.005978026,0.91516775,0.032192856,0.00008199418],"about_ca_topic_score_codex":0.0012040249,"about_ca_topic_score_gemma":0.0012898669,"teacher_disagreement_score":0.008517728,"about_ca_system_score_codex":0.0012576783,"about_ca_system_score_gemma":0.0006199846,"threshold_uncertainty_score":0.028494716},"labels":[],"label_agreement":null},{"id":"W2164380903","doi":"10.1007/3-540-36159-6_30","title":"Message Authentication Codes with Error Correcting Capabilities","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Authentication (law); Message authentication code; Computer security; Computer network; Cryptography","score_opus":0.017450033132082515,"score_gpt":0.22968309769738973,"score_spread":0.21223306456530722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164380903","genre_codex":"methods","genre_gemma":"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.03271602,0.00617091,0.8250306,0.0020170498,0.0013744123,0.00028632142,0.00041766628,0.0025404936,0.12944649],"genre_scores_gemma":[0.5784612,0.007604791,0.26009828,0.00091609807,0.0011778523,0.0006111203,0.0005260064,0.0005593753,0.15004526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893016,0.00021995383,0.00006475209,0.000108700464,0.0005146287,0.000161666],"domain_scores_gemma":[0.9966276,0.001473347,0.00031490414,0.0008547151,0.0006450707,0.000084165134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081035524,0.0011362701,0.00062508095,0.0020096295,0.0011358351,0.002182433,0.0008568921,0.0018216694,0.0077943676],"category_scores_gemma":[0.0041788695,0.00051212194,0.00053940224,0.002318017,0.0016929093,0.0027427294,0.0018563865,0.0022289124,0.00390849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010307035,0.000029497472,0.00016257793,0.00032205938,0.000016524757,0.00019528597,0.00029274132,0.010174167,0.008468973,0.83758944,0.009646388,0.13299933],"study_design_scores_gemma":[0.00006118388,0.00021480318,0.0003051561,0.00047014924,0.00007484612,0.001645872,0.000101202495,0.06269939,0.060300335,0.6987153,0.17529836,0.00011337677],"about_ca_topic_score_codex":0.00046442394,"about_ca_topic_score_gemma":0.000429383,"teacher_disagreement_score":0.0077943676,"about_ca_system_score_codex":0.00088464975,"about_ca_system_score_gemma":0.0013051125,"threshold_uncertainty_score":0.026074827},"labels":[],"label_agreement":null},{"id":"W2164604678","doi":"10.1109/18.887870","title":"Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"BCH code; Coset; Mathematics; Minimum distance; Reed–Solomon error correction; Discrete mathematics; Dimension (graph theory); Block code; Linear code; Combinatorics; Decoding methods; Algorithm","score_opus":0.008859276577574706,"score_gpt":0.24117491621440465,"score_spread":0.23231563963682994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164604678","genre_codex":"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.5611381,0.003210253,0.343878,0.0024411897,0.00044876378,0.00014092014,0.0005875967,0.00031390516,0.087841295],"genre_scores_gemma":[0.93675035,0.0011195742,0.055139795,0.00022549223,0.00032443472,0.0001814769,0.00031040862,0.00007965798,0.005868832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993892,0.0002028167,0.000033609944,0.00010725601,0.00017355329,0.000093582836],"domain_scores_gemma":[0.9981944,0.0009305808,0.00030461774,0.00018200507,0.00021236906,0.00017595674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006584301,0.00046812385,0.0007964434,0.0016362406,0.001402481,0.0014670052,0.00044008935,0.0008714973,0.0032754927],"category_scores_gemma":[0.0055878577,0.00027749073,0.00047156593,0.001885671,0.0016584694,0.0017383496,0.0014835177,0.0016091081,0.00057980424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005279989,0.000018316303,0.00046935992,0.000048520433,0.00000650703,0.00008236022,0.00015433179,0.007969973,0.0017826551,0.9765459,0.0013787738,0.011490609],"study_design_scores_gemma":[0.000024296909,0.00005368163,0.00035015104,0.000032567503,0.0000068181007,0.00028404515,0.00012830811,0.035645932,0.0028265743,0.95421195,0.006405316,0.00003036074],"about_ca_topic_score_codex":0.00032114986,"about_ca_topic_score_gemma":0.00031406136,"teacher_disagreement_score":0.0032754927,"about_ca_system_score_codex":0.0008239355,"about_ca_system_score_gemma":0.00047066173,"threshold_uncertainty_score":0.010957599},"labels":[],"label_agreement":null},{"id":"W2165199953","doi":"10.1109/arith.1993.378110","title":"Integer mapping architectures for the polynomial ring engine","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computation; Ring (chemistry); Computer science; Polynomial; Adder; Very-large-scale integration; Parallel computing; Integer (computer science); Construct (python library); Computational science; Theoretical computer science; Algorithm; Mathematics; Programming language; Embedded system","score_opus":0.02637814232108617,"score_gpt":0.2130629802508729,"score_spread":0.1866848379297867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165199953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.06815794,0.0007203181,0.8986799,0.00024919916,0.00014228953,0.000109135246,0.0001774783,0.0025086615,0.029255018],"genre_scores_gemma":[0.44187012,0.0007068665,0.53845704,0.000192016,0.00009439819,0.000114757255,0.00052536494,0.00017230587,0.01786703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998498,0.000030762647,0.00001766358,0.000025940346,0.000052268926,0.00002353275],"domain_scores_gemma":[0.9998266,0.000047205987,0.000018581999,0.000048511665,0.000048000613,0.000011094276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030484542,0.00028618972,0.000184991,0.00040022077,0.0003368253,0.0007510172,0.000640115,0.00025681147,0.005983786],"category_scores_gemma":[0.00050225627,0.00015701828,0.00027296747,0.00041576655,0.00033886457,0.0014448212,0.00047680284,0.00046549385,0.0015417],"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.0003134652,0.000100520636,0.00034422654,0.00021126124,0.000020370924,0.00025098232,0.00021559428,0.027013138,0.10763918,0.57458985,0.005309659,0.28399175],"study_design_scores_gemma":[0.00017561471,0.00095518824,0.0009858118,0.00010391753,0.000078358265,0.0011550318,0.00013535807,0.2860698,0.27742964,0.2640584,0.16874617,0.00010676931],"about_ca_topic_score_codex":0.00036433837,"about_ca_topic_score_gemma":0.0006254099,"teacher_disagreement_score":0.005983786,"about_ca_system_score_codex":0.00041943954,"about_ca_system_score_gemma":0.00049184257,"threshold_uncertainty_score":0.020017803},"labels":[],"label_agreement":null},{"id":"W2165602610","doi":"10.1007/978-3-642-12200-2_35","title":"Ambiguity and Deficiency in Costas Arrays and APN Permutations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Ambiguity; Upper and lower bounds; Abelian group; Permutation group; Combinatorics; Computer science; Mathematics; Discrete mathematics","score_opus":0.012580546011538355,"score_gpt":0.23460573121406253,"score_spread":0.22202518520252418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165602610","genre_codex":"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.39944157,0.0033010656,0.24104959,0.0054753246,0.0011690146,0.00012362425,0.00064449065,0.00044676958,0.34834853],"genre_scores_gemma":[0.9108433,0.0012263802,0.03917457,0.00047141055,0.00053611776,0.00010792377,0.00022296715,0.00016082313,0.04725658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989214,0.00035036315,0.00007260635,0.00013878517,0.00036659857,0.00015017939],"domain_scores_gemma":[0.99695694,0.0016533302,0.0002861898,0.00056261296,0.00034432355,0.00019660387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198174,0.0005956148,0.00077644875,0.0017999902,0.0016342027,0.0030916356,0.0007717222,0.0014319433,0.0067888997],"category_scores_gemma":[0.008328616,0.00052697334,0.0005459207,0.002324468,0.0039466834,0.0039503756,0.0020213856,0.002407119,0.0014448225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047352714,0.000007631867,0.00014677367,0.0000181621,0.0000014341631,0.00006618453,0.00011725578,0.0007983406,0.00048038154,0.9898102,0.00094172393,0.0075645833],"study_design_scores_gemma":[0.000009394367,0.000009384858,0.00006670252,0.000008541327,0.0000019687363,0.00018086913,0.00004866801,0.0021407465,0.00027818867,0.99447364,0.0027746959,0.000007156358],"about_ca_topic_score_codex":0.0003647286,"about_ca_topic_score_gemma":0.00030077834,"teacher_disagreement_score":0.0067888997,"about_ca_system_score_codex":0.00097313576,"about_ca_system_score_gemma":0.00081035297,"threshold_uncertainty_score":0.022711158},"labels":[],"label_agreement":null},{"id":"W2166905766","doi":"10.1109/tit.2007.911261","title":"Affine Reflection Group Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Decoding methods; Correctness; Rank (graph theory); Mathematics; Affine transformation; Reflection (computer programming); Dimension (graph theory); Affine plane (incidence geometry); Affine space; Affine hull; Group (periodic table); Affine group; Homogeneous space; Vector space; Affine coordinate system; Affine combination; Combinatorics; Discrete mathematics; Algorithm; Computer science; Pure mathematics; Geometry","score_opus":0.015213679010986246,"score_gpt":0.2250112200735565,"score_spread":0.20979754106257026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166905766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.050589982,0.00035208726,0.8995603,0.00050892687,0.00020091001,0.00023056248,0.00034353483,0.0009608108,0.047252875],"genre_scores_gemma":[0.59482765,0.00062597875,0.37512285,0.00043213074,0.00026606352,0.0003401911,0.00090157444,0.00034808053,0.027135609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988279,0.00023253889,0.000063507876,0.00021347619,0.00043692326,0.0002257652],"domain_scores_gemma":[0.99873227,0.00027239512,0.00014080941,0.00045063093,0.00029656742,0.00010731275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053559494,0.0005960095,0.00058584445,0.0008499225,0.00079746137,0.0013014928,0.001008826,0.00078122906,0.008022051],"category_scores_gemma":[0.0023599202,0.00027771623,0.00086988905,0.000772295,0.001364026,0.0016959695,0.0024389985,0.0015740388,0.0033181724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013929314,0.000048888334,0.00044000006,0.00008335655,0.000018676037,0.00025731706,0.00025925887,0.018304829,0.01158365,0.88555074,0.003546255,0.07976775],"study_design_scores_gemma":[0.00012767255,0.00040346564,0.0003841451,0.000070319664,0.000031977186,0.0010483812,0.00015964931,0.14283055,0.034745656,0.77260673,0.047491405,0.00009993972],"about_ca_topic_score_codex":0.00043748663,"about_ca_topic_score_gemma":0.00048710828,"teacher_disagreement_score":0.008022051,"about_ca_system_score_codex":0.0005050941,"about_ca_system_score_gemma":0.000995404,"threshold_uncertainty_score":0.026836395},"labels":[],"label_agreement":null},{"id":"W2167340446","doi":"10.1109/tcomm.2011.121410.090612","title":"Efficient Iterative Techniques for Soft Decision Decoding of Reed-Solomon Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Belief propagation; Sequential decoding; List decoding; Parity-check matrix; Berlekamp–Welch algorithm; Algorithm; Computer science; Low-density parity-check code; Binary number; Concatenated error correction code; Binary symmetric channel; Theoretical computer science; Mathematics; Block code; Arithmetic","score_opus":0.025563512691039552,"score_gpt":0.3060731576643248,"score_spread":0.28050964497328523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167340446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.00241316,0.00029418553,0.9962478,0.000040958625,0.000023827948,0.000029744488,0.000017998393,0.0002454587,0.000686773],"genre_scores_gemma":[0.069906,0.0006970785,0.9265738,0.00005879856,0.00005121654,0.00018248858,0.000112238435,0.000080422615,0.0023380588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852246,0.000386452,0.00009055651,0.0001077131,0.0007962349,0.00009654862],"domain_scores_gemma":[0.99821377,0.00093878136,0.0001926549,0.00019489667,0.0004134151,0.00004647936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009052826,0.001195393,0.00077732676,0.0014431071,0.0004392377,0.0007545005,0.0013155557,0.0008111959,0.0016162882],"category_scores_gemma":[0.0038601332,0.000555808,0.00085628446,0.0010317999,0.00070396473,0.0011025796,0.0013429852,0.0016297712,0.0010966486],"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.00031503534,0.00010622875,0.0008559061,0.000604529,0.00017797739,0.0003201829,0.00058560364,0.14739199,0.07159094,0.08753776,0.0028502208,0.6876636],"study_design_scores_gemma":[0.0000618118,0.0001388759,0.0003235632,0.000067907065,0.000043972606,0.00046397734,0.00003785152,0.9118726,0.053402398,0.026712323,0.0068094414,0.00006526561],"about_ca_topic_score_codex":0.00089054153,"about_ca_topic_score_gemma":0.0014009192,"teacher_disagreement_score":0.0016162882,"about_ca_system_score_codex":0.0006951556,"about_ca_system_score_gemma":0.001033048,"threshold_uncertainty_score":0.0054070354},"labels":[],"label_agreement":null},{"id":"W2167845685","doi":"10.1109/tc.2015.2401024","title":"Comments on “Low-Latency Digit-Serial Systolic Double Basis Multiplier over $GF(2^{m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach”","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toeplitz matrix; Arithmetic; Matrix multiplication; Multiplier (economics); Computer science; Multiplication (music); Numerical digit; Latency (audio); Parallel computing; GF(2); Basis (linear algebra); Mathematics; Algorithm; Discrete mathematics; Combinatorics; Finite field; Pure mathematics; Telecommunications","score_opus":0.0468885360226933,"score_gpt":0.2719314946344938,"score_spread":0.2250429586118005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167845685","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00887535,0.0029728103,0.02063874,0.7934556,0.14186727,0.00022076507,0.0009048886,0.0018501168,0.029214516],"genre_scores_gemma":[0.081587814,0.0030645425,0.015198347,0.7868863,0.048744917,0.00034775113,0.00035903568,0.0005975714,0.06321385],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954466,0.00068194553,0.00065778114,0.0007362027,0.0019840049,0.0004934376],"domain_scores_gemma":[0.9882245,0.003321773,0.000941633,0.00067249767,0.0065374947,0.00030206834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002813818,0.0010405648,0.0006327641,0.00060568965,0.0025355504,0.0015114761,0.002736869,0.01452095,0.009133488],"category_scores_gemma":[0.019572953,0.0007276249,0.0014005511,0.0005837804,0.0026127943,0.002291604,0.0011650017,0.010876699,0.0099483365],"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.00054848485,0.000057319096,0.0010500577,0.00041111733,0.00006197294,0.0018344542,0.0005110857,0.0014497997,0.0070273215,0.022367535,0.9484597,0.016221225],"study_design_scores_gemma":[0.0001399849,0.00028990224,0.0026499326,0.00039097204,0.00011073105,0.0012800893,0.00042855155,0.0033373034,0.015789514,0.014690251,0.9606748,0.00021800755],"about_ca_topic_score_codex":0.00893635,"about_ca_topic_score_gemma":0.009282412,"teacher_disagreement_score":0.01452095,"about_ca_system_score_codex":0.0033528542,"about_ca_system_score_gemma":0.0027794854,"threshold_uncertainty_score":0.030554533},"labels":[],"label_agreement":null},{"id":"W2167854544","doi":"10.1007/s00037-010-0294-0","title":"Interpolation of Shifted-Lacunary Polynomials","year":2010,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Combinatorics; Interpolation (computer graphics); Polynomial; Logarithm; Degree (music); Modulo; Discrete mathematics; Prime (order theory); Exponent; Representation (politics); Rational function; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.031052942470248285,"score_gpt":0.2759480848059405,"score_spread":0.24489514233569223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167854544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.34218895,0.0011926438,0.6090126,0.0010883095,0.00031810842,0.0000669947,0.00022671623,0.00033081087,0.045574773],"genre_scores_gemma":[0.91487724,0.0006666459,0.07030604,0.00021432742,0.0002693408,0.000046567373,0.00019177733,0.00011101581,0.01331697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998922,0.00032360345,0.000041603584,0.00015801763,0.00033920887,0.00021557993],"domain_scores_gemma":[0.99700385,0.0015626668,0.0002714071,0.00059186196,0.00035480218,0.00021543351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014273843,0.0005489178,0.0007509374,0.0013162079,0.0007847355,0.0015499907,0.001214992,0.00071390864,0.0053801127],"category_scores_gemma":[0.0086807115,0.0003012398,0.0006143141,0.0014660577,0.0023701547,0.0031104346,0.0022772592,0.0025065716,0.0008288559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001755259,0.000020632962,0.0002307819,0.00003883885,0.0000060111634,0.000052603864,0.00009814368,0.011362712,0.0021120498,0.969302,0.00066483126,0.015935754],"study_design_scores_gemma":[0.000024737981,0.000047020298,0.0001711609,0.00001972329,0.0000079270885,0.00008006901,0.00003829974,0.08461506,0.0029840814,0.90884936,0.0031426935,0.000019903704],"about_ca_topic_score_codex":0.0009208302,"about_ca_topic_score_gemma":0.0009128503,"teacher_disagreement_score":0.0053801127,"about_ca_system_score_codex":0.0016297245,"about_ca_system_score_gemma":0.0009201729,"threshold_uncertainty_score":0.017998278},"labels":[],"label_agreement":null},{"id":"W2168099167","doi":"10.1109/isit.1998.708704","title":"On Tanner graphs of lattices and codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tanner graph; Lambda; Quotient; Abelian group; Combinatorics; Decoding methods; Mathematics; Discrete mathematics; Lattice (music); Graph; Computational complexity theory; Block code; Computer science; Linear code; Algorithm; Physics","score_opus":0.017687294540916706,"score_gpt":0.21515438995446354,"score_spread":0.19746709541354684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168099167","genre_codex":"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.13694975,0.0012077935,0.8374101,0.0011841904,0.000104735955,0.00020993539,0.0007015236,0.0005308596,0.0217012],"genre_scores_gemma":[0.5220125,0.0023595612,0.4474102,0.0005007676,0.0001867016,0.00038242538,0.0013243337,0.00038203938,0.02544155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938357,0.00023428208,0.000025953977,0.00014509012,0.00012864685,0.00008242267],"domain_scores_gemma":[0.9980679,0.0012596422,0.00019289754,0.0002361569,0.00016334992,0.00008005166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043758005,0.00053382333,0.00060868333,0.0007639181,0.00090091606,0.0010611048,0.00063588633,0.0007314971,0.005166226],"category_scores_gemma":[0.0028843635,0.00039436296,0.0005933639,0.001254503,0.001442495,0.0021539703,0.0008869429,0.0015667948,0.00078511285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014631842,0.00008894233,0.00057670486,0.00030811198,0.00003322569,0.00025250667,0.00048815485,0.17613448,0.01062924,0.760274,0.004080762,0.046987575],"study_design_scores_gemma":[0.000027673923,0.00004341479,0.0002630388,0.000027915776,0.000011752862,0.0001433416,0.00009559288,0.16104078,0.0029887836,0.82760406,0.007735979,0.000017697785],"about_ca_topic_score_codex":0.00231292,"about_ca_topic_score_gemma":0.0031715143,"teacher_disagreement_score":0.005166226,"about_ca_system_score_codex":0.0011867061,"about_ca_system_score_gemma":0.0007803689,"threshold_uncertainty_score":0.017282784},"labels":[],"label_agreement":null},{"id":"W2168888523","doi":"10.1109/tit.2004.838341","title":"Binary Sequences With Merit Factor Greater Than&amp;lt;tex&amp;gt;$6.34$&amp;lt;/tex&amp;gt;","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Binary number; Figure of merit; Value (mathematics); Mathematics; Combinatorics; Construct (python library); Statistics; Physics; Computer science; Arithmetic","score_opus":0.021632181448261484,"score_gpt":0.2330094041940499,"score_spread":0.2113772227457884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168888523","genre_codex":"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.59519154,0.003719941,0.32219812,0.004056732,0.0004788273,0.0001178087,0.0005409662,0.00081702165,0.07287907],"genre_scores_gemma":[0.88396287,0.0008952636,0.10388251,0.00040253453,0.00017861441,0.00012436375,0.00040627283,0.00014803957,0.009999477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.0002087586,0.00005816981,0.00010699352,0.00025248667,0.00013064402],"domain_scores_gemma":[0.9944938,0.0034223136,0.0005301844,0.0006154148,0.0006583845,0.0002798932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015629051,0.0003867972,0.0005412669,0.001039723,0.0010711735,0.001033527,0.00045567783,0.0012245505,0.0066555864],"category_scores_gemma":[0.011294174,0.0002247517,0.00038163157,0.00088838924,0.0011466236,0.0022563664,0.0008034793,0.0015417088,0.0020692674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011192078,0.00012230988,0.003527976,0.00038274258,0.0000335677,0.000556338,0.00044266268,0.019756159,0.07666548,0.728747,0.004948664,0.16369791],"study_design_scores_gemma":[0.00015106474,0.00085882354,0.0036905305,0.00034182644,0.00005425939,0.0040467507,0.0002740939,0.12756222,0.08730537,0.7167318,0.058866046,0.00011717301],"about_ca_topic_score_codex":0.00026651676,"about_ca_topic_score_gemma":0.00041331115,"teacher_disagreement_score":0.0066555864,"about_ca_system_score_codex":0.00092141255,"about_ca_system_score_gemma":0.00088840537,"threshold_uncertainty_score":0.022265136},"labels":[],"label_agreement":null},{"id":"W2169200909","doi":"10.3233/fi-2011-390","title":"K-Comma Codes and Their Generalizations","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Arithmetic; Algebra over a field; Pure mathematics","score_opus":0.033601372998993635,"score_gpt":0.20600116697538332,"score_spread":0.1723997939763897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169200909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.26835582,0.00770148,0.61474156,0.0017997549,0.00056429685,0.00015072669,0.0013831636,0.00066998356,0.10463312],"genre_scores_gemma":[0.85389006,0.0044272956,0.12016644,0.000932976,0.0010437198,0.0002942016,0.0009232993,0.00026992772,0.018052215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981427,0.00024655098,0.0001430204,0.0005105552,0.00064936595,0.0003077825],"domain_scores_gemma":[0.99400914,0.0023106958,0.0010238086,0.0010099874,0.0012275315,0.00041891568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091617624,0.00053901086,0.0005493022,0.0027499057,0.002067785,0.001593284,0.000723549,0.001054691,0.0027563416],"category_scores_gemma":[0.006638446,0.00037350922,0.0007888396,0.002575733,0.002620744,0.0040108324,0.002057314,0.002128977,0.00090302253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003835015,0.000015588936,0.0007344791,0.00008090462,0.0000088353345,0.00016035195,0.00046696357,0.00399021,0.0016596974,0.97396415,0.0011190773,0.017761536],"study_design_scores_gemma":[0.000008544954,0.000039523486,0.0007075303,0.00006284311,0.000010536606,0.0007146375,0.0002136752,0.02025121,0.0018114934,0.9532792,0.022859488,0.000041316267],"about_ca_topic_score_codex":0.0021494012,"about_ca_topic_score_gemma":0.0011444199,"teacher_disagreement_score":0.0027563416,"about_ca_system_score_codex":0.0015125609,"about_ca_system_score_gemma":0.0012428724,"threshold_uncertainty_score":0.010974407},"labels":[],"label_agreement":null},{"id":"W2169627913","doi":"10.1016/j.ffa.2006.09.004","title":"On the parity of the number of irreducible factors of self-reciprocal polynomials over finite fields","year":2006,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monomial; Mathematics; Reciprocal; Parity (physics); Finite field; Polynomial; Pure mathematics; Irreducible polynomial; Binary number; Discrete mathematics; Combinatorics; Arithmetic; Mathematical analysis; Matrix polynomial","score_opus":0.012331227929558845,"score_gpt":0.23025769904817706,"score_spread":0.2179264711186182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169627913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9393675,0.0009973441,0.030990718,0.0032607482,0.0004649427,0.000029934263,0.00036447513,0.00022250466,0.024301877],"genre_scores_gemma":[0.99475443,0.00031184996,0.0023974765,0.000113894144,0.00046385013,0.000027875472,0.00014128308,0.00005682899,0.0017323857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971559,0.001019584,0.00016628654,0.00046186853,0.000660715,0.0005356326],"domain_scores_gemma":[0.97338796,0.018659122,0.002620004,0.002045518,0.0014983052,0.0017891368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054222276,0.0009615458,0.0014807823,0.0033332964,0.0017508803,0.0050211614,0.0024098803,0.0021890127,0.005410276],"category_scores_gemma":[0.028446602,0.0007507506,0.0007397326,0.0016826174,0.008705922,0.007706662,0.0024523898,0.0027081976,0.0006399064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020164072,0.00022385025,0.007190966,0.00019906767,0.00007176845,0.0006054028,0.00075259444,0.009108674,0.010062796,0.94565314,0.003028233,0.021087205],"study_design_scores_gemma":[0.00014913685,0.00013283444,0.002398606,0.00008449206,0.00005665003,0.00062811177,0.00021644967,0.041697852,0.004404193,0.9487902,0.0013485359,0.00009308833],"about_ca_topic_score_codex":0.00052109634,"about_ca_topic_score_gemma":0.0003300328,"teacher_disagreement_score":0.0054222276,"about_ca_system_score_codex":0.0014236654,"about_ca_system_score_gemma":0.0010333857,"threshold_uncertainty_score":0.028675854},"labels":[],"label_agreement":null},{"id":"W2170368342","doi":"10.1006/jsco.1999.1002","title":"Factoring Polynomials Over Finite Fields: A Survey","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Factoring; Mathematics; Univariate; Finite field; Factorization; Factorization of polynomials; Algebra over a field; Pure mathematics; Discrete mathematics; Algorithm; Polynomial; Multivariate statistics; Statistics; Mathematical analysis","score_opus":0.03254854062645635,"score_gpt":0.28498527948146896,"score_spread":0.2524367388550126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170368342","genre_codex":"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.040601987,0.602387,0.3161567,0.003132272,0.0006356542,0.00014557292,0.00036340446,0.0008870501,0.03569032],"genre_scores_gemma":[0.20857824,0.61794144,0.16093507,0.0009254709,0.0029585764,0.000100315934,0.0010681463,0.00028374058,0.0072090738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985341,0.00027199014,0.00012972785,0.00034671102,0.0005225082,0.00019487648],"domain_scores_gemma":[0.9965917,0.0020784005,0.00020109903,0.000697277,0.00032771533,0.00010381112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002463404,0.0010918233,0.0017662764,0.0034264144,0.0008313424,0.0028101145,0.0015508832,0.0011897405,0.0043653552],"category_scores_gemma":[0.0055897185,0.0009484528,0.0010734939,0.00676102,0.0021320293,0.01137678,0.0020897125,0.002158538,0.0017938311],"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.00015282768,0.0001408386,0.0018743475,0.002052854,0.000046843583,0.00008436051,0.00030501024,0.0057396204,0.0018885968,0.20321067,0.008174085,0.77633005],"study_design_scores_gemma":[0.00011453092,0.00043944028,0.0018694932,0.001665639,0.00008726791,0.0028750736,0.00040206974,0.03027548,0.00825587,0.6770169,0.27689672,0.00010144904],"about_ca_topic_score_codex":0.00078880956,"about_ca_topic_score_gemma":0.0007378345,"teacher_disagreement_score":0.0043653552,"about_ca_system_score_codex":0.0010907036,"about_ca_system_score_gemma":0.0013081396,"threshold_uncertainty_score":0.014603555},"labels":[],"label_agreement":null},{"id":"W2170617647","doi":"10.1109/ccece.2005.1557343","title":"Phase coded nonlinear asymmetric chirp modulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Chirp; Modulation (music); Continuous phase modulation; Electronic engineering; Coding (social sciences); Telecommunications; Algorithm; Mathematics; Physics; Engineering; Acoustics; Optics; Statistics","score_opus":0.011936654878130719,"score_gpt":0.25106864555927993,"score_spread":0.2391319906811492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170617647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.18880333,0.0028210485,0.75538254,0.0009257142,0.00037193214,0.00010243751,0.00021156513,0.00046573835,0.050915703],"genre_scores_gemma":[0.8575457,0.0010710291,0.13039461,0.00041564007,0.0002216283,0.00008098152,0.00014656658,0.00002925534,0.010094666],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985635,0.000020775044,0.000004143984,0.000018995597,0.00008229512,0.000017435712],"domain_scores_gemma":[0.9996307,0.0001546257,0.000057443707,0.00005640909,0.00007906921,0.000021719476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012282557,0.00022604933,0.0001761116,0.00029861167,0.00019757969,0.00036653312,0.00034360582,0.00047717404,0.0018372542],"category_scores_gemma":[0.0007479168,0.000076397104,0.00007492528,0.00045137343,0.00043343144,0.00049553026,0.00033112548,0.0005288749,0.0004473295],"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.00059652654,0.00009317377,0.0014630478,0.00031806357,0.000027009813,0.00097188796,0.00015282923,0.037327632,0.3381786,0.22347064,0.0043443553,0.39305612],"study_design_scores_gemma":[0.00007571855,0.00046151233,0.0024896024,0.00009078049,0.00003117522,0.0035432603,0.000048727776,0.6822426,0.20746328,0.049411632,0.054072797,0.00006886597],"about_ca_topic_score_codex":0.00015056884,"about_ca_topic_score_gemma":0.0002316935,"teacher_disagreement_score":0.0018372542,"about_ca_system_score_codex":0.00023878041,"about_ca_system_score_gemma":0.00017000738,"threshold_uncertainty_score":0.006146252},"labels":[],"label_agreement":null},{"id":"W2171404777","doi":"10.1109/isit.2006.261604","title":"Crosscorrelation of q-ary Power Residue Sequences of Period p","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Period (music); Discrete mathematics; Residue (chemistry); Physics; Mathematical analysis; Biology","score_opus":0.005439197043131822,"score_gpt":0.20807768464164716,"score_spread":0.20263848759851535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171404777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6050803,0.0017185844,0.3658216,0.0008242144,0.00015421174,0.00005564476,0.00039355096,0.00039323763,0.025558636],"genre_scores_gemma":[0.9741882,0.00068604853,0.021669822,0.00012618669,0.00015666761,0.000047895523,0.00020641033,0.000037084494,0.002881664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894875,0.00017618547,0.00004786384,0.00019866691,0.00039529195,0.00023332036],"domain_scores_gemma":[0.99423873,0.0033815282,0.001081506,0.0006017622,0.0004904836,0.00020603124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001335467,0.0006052191,0.0005376565,0.0014612491,0.00056733785,0.0014224612,0.00062044035,0.00062495406,0.002391995],"category_scores_gemma":[0.009804681,0.00032505352,0.00031086468,0.0014009352,0.0011330784,0.0019350243,0.0011706577,0.00082747574,0.0005659906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013780192,0.00017825182,0.011696699,0.00041899015,0.0001553799,0.0024317978,0.0005981312,0.12002369,0.096493416,0.6423974,0.003676271,0.12055203],"study_design_scores_gemma":[0.00008463227,0.00041353668,0.010421549,0.0001550597,0.00007709884,0.0030921425,0.00023808311,0.70197433,0.062306967,0.21417385,0.006980508,0.00008227033],"about_ca_topic_score_codex":0.0003848906,"about_ca_topic_score_gemma":0.00041295143,"teacher_disagreement_score":0.002391995,"about_ca_system_score_codex":0.0010211987,"about_ca_system_score_gemma":0.00097050297,"threshold_uncertainty_score":0.008002043},"labels":[],"label_agreement":null},{"id":"W2171816248","doi":"10.1112/s0025579300015734","title":"Character sums with exponential functions","year":2000,"lang":"en","type":"article","venue":"Mathematika","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Muscular Dystrophy Canada; University of Toronto","funders":"","keywords":"Mathematics; Modulo; Integer (computer science); Multiplicative function; Combinatorics; Primitive root modulo n; Character (mathematics); Prime (order theory); Exponential function; Sequence (biology); Discrete mathematics; Integer sequence; Multiplicative inverse; Multiplicative group; Inverse; Generating function","score_opus":0.005717826797967586,"score_gpt":0.1764861520601498,"score_spread":0.17076832526218222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171816248","genre_codex":"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.2558498,0.0065266737,0.4768032,0.0027359892,0.0012566847,0.00011413755,0.0004668952,0.00095590623,0.25529063],"genre_scores_gemma":[0.90170825,0.0037601406,0.045711286,0.0006140381,0.002128503,0.0002268217,0.0005822612,0.00040225036,0.044866443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978411,0.00047531878,0.00019450183,0.0003866213,0.0006350598,0.00046737213],"domain_scores_gemma":[0.9955996,0.0023624918,0.00047380535,0.00056757336,0.0006356893,0.0003608098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018174743,0.0016493441,0.0011345893,0.0040087583,0.0018781985,0.00537211,0.0011981718,0.001267105,0.010557351],"category_scores_gemma":[0.013665497,0.0006572357,0.0010485592,0.0028158203,0.0026683742,0.011130181,0.004370425,0.0028896965,0.0033179543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069518144,0.000028244176,0.0004621651,0.00008387529,0.000012561134,0.00012753876,0.00017623426,0.0034190419,0.00088750373,0.974817,0.0017626024,0.018153695],"study_design_scores_gemma":[0.000007298661,0.000028959163,0.00026641757,0.000058726113,0.00001996482,0.00040070328,0.00006853714,0.019258313,0.0018500735,0.9683908,0.0096242605,0.000025990756],"about_ca_topic_score_codex":0.00026296792,"about_ca_topic_score_gemma":0.00019414241,"teacher_disagreement_score":0.010557351,"about_ca_system_score_codex":0.0011021465,"about_ca_system_score_gemma":0.00058410544,"threshold_uncertainty_score":0.03531784},"labels":[],"label_agreement":null},{"id":"W2172054125","doi":"10.1016/j.ffa.2012.09.003","title":"MDS and self-dual codes over rings","year":2012,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dual (grammatical number); Ideal (ethics); Principal ideal; Principal (computer security); Chain (unit); Mathematics; Ring (chemistry); Series (stratigraphy); Power (physics); Pure mathematics; Discrete mathematics; Algebra over a field; Computer science; Combinatorics; Physics; Law; Chemistry; Prime (order theory)","score_opus":0.013861690699695112,"score_gpt":0.23410461596485257,"score_spread":0.22024292526515746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172054125","genre_codex":"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.61524385,0.014019435,0.26465774,0.010866085,0.0011377045,0.00007842558,0.0007071792,0.00028926996,0.09300036],"genre_scores_gemma":[0.96606946,0.0029790492,0.015049814,0.00043055054,0.001298512,0.000060188948,0.00016605933,0.000042702017,0.013903705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897885,0.0003685259,0.00005366934,0.00015798068,0.00029858173,0.00014242926],"domain_scores_gemma":[0.9964353,0.002103556,0.00054880977,0.00038115642,0.00027058495,0.00026063426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171583,0.0006840097,0.0007798909,0.003064343,0.0014244865,0.002657823,0.0006605089,0.0013403773,0.0036170115],"category_scores_gemma":[0.0049482463,0.00062222604,0.00060515536,0.0021744715,0.0038741543,0.0043182992,0.0022485564,0.0025780236,0.00040715528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025626485,0.000011235278,0.00016385262,0.000018941142,0.000002875574,0.000029657755,0.00012155213,0.0013254316,0.00021833176,0.99435884,0.00048154668,0.0032421867],"study_design_scores_gemma":[0.000009358632,0.000009616825,0.00007850277,0.000015928284,0.000004002513,0.00008613206,0.000046056895,0.005976103,0.00029488938,0.9913127,0.0021567964,0.000009858504],"about_ca_topic_score_codex":0.00053844065,"about_ca_topic_score_gemma":0.0004086243,"teacher_disagreement_score":0.0036170115,"about_ca_system_score_codex":0.0016220261,"about_ca_system_score_gemma":0.00085864775,"threshold_uncertainty_score":0.01210016},"labels":[],"label_agreement":null},{"id":"W2173617107","doi":"","title":"Computing in Algebraic Closures of Finite Fields","year":2015,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Finite field; Mathematics; Extension (predicate logic); Construct (python library); Algebra over a field; Prime (order theory); Computation; Algebraic closure; Polynomial; Field (mathematics); Linear algebra; Algebraic number; Closure (psychology); Degree (music); Discrete mathematics; Computer science; Algorithm; Pure mathematics; Combinatorics","score_opus":0.10972654161549157,"score_gpt":0.30848342311086757,"score_spread":0.19875688149537601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173617107","genre_codex":"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.102582864,0.00036875164,0.8869965,0.0003369453,0.00011061705,0.00014699856,0.00024043667,0.0023083305,0.0069085644],"genre_scores_gemma":[0.5469334,0.00040599558,0.44665527,0.00011142392,0.00014811345,0.00015682407,0.00074494345,0.00032075876,0.00452318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847835,0.00027331169,0.00014428153,0.00033352856,0.0004874222,0.0002830963],"domain_scores_gemma":[0.996942,0.0016756351,0.0002628466,0.0006215314,0.000301335,0.00019652762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017309766,0.00089124736,0.0009543583,0.0014250707,0.0015550562,0.0030261355,0.0013403038,0.00062124955,0.0041851997],"category_scores_gemma":[0.0061086193,0.000516738,0.0015020152,0.0015202782,0.002708687,0.009858812,0.003157165,0.002072266,0.0011057219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003965771,0.00024445666,0.0028573547,0.00048812066,0.000052891115,0.00035587273,0.0014794137,0.021125419,0.011794904,0.8047647,0.0030584286,0.15338181],"study_design_scores_gemma":[0.000071533075,0.00015021104,0.00037670718,0.0001017234,0.000037864873,0.00028030513,0.00037637106,0.08457948,0.019168865,0.8805729,0.0142374635,0.00004657481],"about_ca_topic_score_codex":0.0009812261,"about_ca_topic_score_gemma":0.0011470759,"teacher_disagreement_score":0.0041851997,"about_ca_system_score_codex":0.001313299,"about_ca_system_score_gemma":0.001146729,"threshold_uncertainty_score":0.014000893},"labels":[],"label_agreement":null},{"id":"W2181210596","doi":"10.1016/j.disc.2015.10.040","title":"Constructing new covering arrays from LFSR sequences over finite fields","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Linear feedback shift register; Mathematics; Finite field; Combinatorics; Discrete mathematics; Arithmetic; Shift register; Computer science; Telecommunications","score_opus":0.03939350846225521,"score_gpt":0.26092098253967705,"score_spread":0.22152747407742185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181210596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.22907351,0.00063512434,0.7474291,0.0004918115,0.0004583096,0.000109034176,0.00033709203,0.0030189326,0.018447174],"genre_scores_gemma":[0.7086297,0.00062065513,0.2804183,0.00035158667,0.0003103786,0.00019651031,0.0009597514,0.00062305934,0.0078899665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929917,0.00017934744,0.00006625239,0.000112482,0.00019385868,0.0001489613],"domain_scores_gemma":[0.9982146,0.000809693,0.00018334425,0.00046952872,0.00020200631,0.00012073017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050321495,0.0006108918,0.00069491356,0.0009490842,0.0006192145,0.00137461,0.0006178318,0.00082670373,0.0036487353],"category_scores_gemma":[0.0029782096,0.00042278145,0.0005323082,0.0011148269,0.0006904063,0.002364752,0.0016065899,0.001251439,0.0014368992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060340005,0.00019507261,0.0018016518,0.00043353683,0.000057516,0.00076656265,0.00090594206,0.031116387,0.09903844,0.54439175,0.008184533,0.31250522],"study_design_scores_gemma":[0.00012602305,0.00050874165,0.0008758878,0.00016017215,0.000082726714,0.001464085,0.0004186746,0.18735445,0.13797909,0.62125605,0.049640115,0.00013401569],"about_ca_topic_score_codex":0.00010700372,"about_ca_topic_score_gemma":0.00018514541,"teacher_disagreement_score":0.0036487353,"about_ca_system_score_codex":0.0004434568,"about_ca_system_score_gemma":0.00040858903,"threshold_uncertainty_score":0.012206197},"labels":[],"label_agreement":null},{"id":"W2184118886","doi":"10.4208/aamm.09-m0989","title":"On Higher Order Pyramidal Finite Elements","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics and Mechanics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Piecewise; Mathematics; Ansatz; Basis function; Convergence (economics); Quadratic equation; Polynomial; Basis (linear algebra); Finite element method; Order (exchange); Space (punctuation); Quadratic function; Element (criminal law); Mathematical analysis; Pure mathematics; Geometry; Physics; Mathematical physics; Computer science","score_opus":0.017533442501791945,"score_gpt":0.23635642702847687,"score_spread":0.21882298452668492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184118886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.16152056,0.00013107073,0.8201229,0.00012119692,0.000031017516,0.000021906082,0.000049786904,0.00012827672,0.017873403],"genre_scores_gemma":[0.8458186,0.00020623356,0.14435394,0.000065750704,0.00002934992,0.000052874366,0.00010133553,0.000085019026,0.0092868535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995189,0.00010099292,0.000021748487,0.00005357717,0.0002498412,0.000054883767],"domain_scores_gemma":[0.9992279,0.00039558136,0.000065965476,0.00014235695,0.00012857774,0.000039674043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964894,0.00028689977,0.0004570004,0.00042625683,0.00027521563,0.00059552625,0.0004805514,0.00042678684,0.002452663],"category_scores_gemma":[0.002389295,0.00017812978,0.00044856334,0.00026692034,0.0016282442,0.0008376054,0.0011575939,0.0009270643,0.0005299253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008375095,0.000023907998,0.0006662003,0.000070527996,0.000012129743,0.00011780247,0.00012329296,0.1727166,0.014848895,0.78660023,0.00042331772,0.024313282],"study_design_scores_gemma":[0.000017170783,0.00005962766,0.0002446901,0.000027527005,0.0000054567363,0.00012350685,0.00003864805,0.74664646,0.006903203,0.24150978,0.0044117766,0.00001215782],"about_ca_topic_score_codex":0.00094022654,"about_ca_topic_score_gemma":0.00080471183,"teacher_disagreement_score":0.002452663,"about_ca_system_score_codex":0.00050001976,"about_ca_system_score_gemma":0.00035297207,"threshold_uncertainty_score":0.008204997},"labels":[],"label_agreement":null},{"id":"W2185417891","doi":"10.1109/itict.2006.358286","title":"A High-Speed, Fully-Pipelined VLSI Architecture for Real-Time AES","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Field-programmable gate array; Architecture; Throughput; Encryption; Computer hardware; Embedded system; Computer architecture; Parallel computing; Arithmetic; Computer network; Operating system","score_opus":0.005962963814217241,"score_gpt":0.20799913870486728,"score_spread":0.20203617489065004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185417891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.08257974,0.0012798689,0.9002153,0.00038949886,0.00021767191,0.00018166419,0.00022999945,0.003403616,0.011502607],"genre_scores_gemma":[0.5090631,0.0005679298,0.4817596,0.0001587952,0.00007699923,0.00009720276,0.00035193312,0.0000584923,0.007865859],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989593,0.000017270677,0.000009179493,0.000021730148,0.0000417379,0.000014155701],"domain_scores_gemma":[0.9999163,0.000012522653,0.000013139983,0.000016888298,0.000033823806,0.0000073493975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013896383,0.0003198753,0.00017631592,0.00032029982,0.00022798656,0.00034528263,0.0006535954,0.0002763889,0.0037570016],"category_scores_gemma":[0.00023139831,0.0002195377,0.00024207399,0.00028389986,0.00014313328,0.0006957591,0.0002060357,0.00028731392,0.0008418875],"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.0004674435,0.00011510453,0.0006872754,0.00040979736,0.00007810715,0.00042593898,0.00011841521,0.025115682,0.5666393,0.026346754,0.0091925,0.3704037],"study_design_scores_gemma":[0.00041828485,0.0039018344,0.0034847716,0.00010153791,0.00022300867,0.003794191,0.00006698943,0.56783193,0.31274465,0.013322249,0.093955725,0.00015477987],"about_ca_topic_score_codex":0.00052967103,"about_ca_topic_score_gemma":0.0013164531,"teacher_disagreement_score":0.0037570016,"about_ca_system_score_codex":0.0003053556,"about_ca_system_score_gemma":0.0005220322,"threshold_uncertainty_score":0.012568414},"labels":[],"label_agreement":null},{"id":"W2187726805","doi":"10.1007/s11432-013-4900-z","title":"On the Walsh spectrum of a family of quadratic APN functions with five terms","year":2013,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Bracken; Quadratic equation; Mathematics; Combinatorics; Polynomial; Spectrum (functional analysis); Quadratic function; Type (biology); Function (biology); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.010447461242570639,"score_gpt":0.21776792569238676,"score_spread":0.2073204644498161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187726805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7930271,0.0009901098,0.17005375,0.0006883281,0.00014240398,0.000040796076,0.00015707311,0.00010968043,0.034790803],"genre_scores_gemma":[0.9807005,0.00035591226,0.013634141,0.00007917632,0.00008536886,0.00003997359,0.000113174334,0.000028499044,0.004963383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956876,0.00014219705,0.000019932771,0.000061973595,0.0001304825,0.00007671548],"domain_scores_gemma":[0.9991737,0.00042815544,0.00010626748,0.00007934141,0.000110859466,0.00010163785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058372586,0.0005846792,0.00035423602,0.0014756859,0.0008272377,0.00081606786,0.00048375956,0.0005445827,0.0029208532],"category_scores_gemma":[0.0019953705,0.0002308045,0.00048667061,0.000865606,0.001282485,0.00090420723,0.000774455,0.0009038058,0.000365953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035557925,0.00005712662,0.0014704023,0.000098547935,0.00002898036,0.00085632835,0.0004896671,0.011657065,0.019482918,0.93116474,0.0015842362,0.032754496],"study_design_scores_gemma":[0.00010383998,0.00021832995,0.003194116,0.00012253298,0.000047343234,0.0024650826,0.00036724858,0.20613077,0.0068651224,0.76960963,0.010770124,0.0001058628],"about_ca_topic_score_codex":0.0005853759,"about_ca_topic_score_gemma":0.00024592856,"teacher_disagreement_score":0.0029208532,"about_ca_system_score_codex":0.00048954086,"about_ca_system_score_gemma":0.00043584846,"threshold_uncertainty_score":0.009771287},"labels":[],"label_agreement":null},{"id":"W2189617332","doi":"10.1080/09728600.2005.12088791","title":"Extremal Self-Dual Codes over Z6, Z8 and Z10","year":2005,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Unimodular matrix; Combinatorics; Circulant matrix; Euclidean geometry; Dual (grammatical number); Construct (python library); Euclidean distance; Discrete mathematics; Computer science; Geometry","score_opus":0.006310433316867672,"score_gpt":0.23179990769262696,"score_spread":0.22548947437575928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189617332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8878733,0.00068192324,0.0923995,0.00025768313,0.00006902086,0.0000305958,0.00028787012,0.0001065274,0.018293608],"genre_scores_gemma":[0.9757776,0.00032454368,0.02035067,0.000041826977,0.0000408051,0.000027141412,0.0001975338,0.000038556453,0.0032013115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947613,0.000069212394,0.000033242628,0.00009447473,0.0001657756,0.00016120396],"domain_scores_gemma":[0.99774724,0.00083630247,0.00063547585,0.00022983213,0.0002516223,0.0002994516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005010066,0.00043464563,0.00035525297,0.0009693437,0.0007584637,0.0012545295,0.000619219,0.00036251455,0.0029794176],"category_scores_gemma":[0.0029338386,0.00022643177,0.0002588481,0.0004997908,0.0010094128,0.0017361871,0.0011741029,0.0010122079,0.00056341995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082214084,0.0000874907,0.0058534923,0.00023884194,0.000043986496,0.00035186292,0.0002770644,0.02073899,0.03905925,0.8836986,0.0012530342,0.047575217],"study_design_scores_gemma":[0.000086823806,0.0004884648,0.0052772663,0.00014719479,0.00007778963,0.0018617805,0.00053178926,0.088110015,0.12450303,0.76245487,0.016314015,0.0001468685],"about_ca_topic_score_codex":0.0002385988,"about_ca_topic_score_gemma":0.00057019776,"teacher_disagreement_score":0.0029794176,"about_ca_system_score_codex":0.00063071185,"about_ca_system_score_gemma":0.00038874944,"threshold_uncertainty_score":0.009967208},"labels":[],"label_agreement":null},{"id":"W2202618705","doi":"10.1109/tit.2015.2401567","title":"New Constructions of Codes for Asymmetric Channels via Concatenation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Concatenation (mathematics); Linear code; Block code; Ternary operation; Reed–Muller code; Expander code; Construct (python library); Binary number","score_opus":0.018501015907497177,"score_gpt":0.23904405395493267,"score_spread":0.2205430380474355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202618705","genre_codex":"methods","genre_gemma":"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.029899605,0.001063938,0.95148546,0.00038805715,0.00033266837,0.00010131918,0.00018607124,0.0006511405,0.015891835],"genre_scores_gemma":[0.4078657,0.0016625852,0.5736661,0.00051252637,0.0005145971,0.00044082006,0.0004241404,0.0004502202,0.014463297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853516,0.00036044046,0.00012548824,0.00017108033,0.00062129274,0.0001866461],"domain_scores_gemma":[0.9971107,0.0010219559,0.00043531484,0.00073959,0.00050067034,0.00019172796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088690576,0.00088492373,0.0007614557,0.0012427671,0.001216235,0.0014202021,0.0009395893,0.00094059604,0.0025706089],"category_scores_gemma":[0.0035860671,0.00039832242,0.0007758345,0.0012379881,0.0018399031,0.0022404299,0.003252332,0.0022865804,0.0010814818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017076582,0.00005636879,0.0005733021,0.0002867026,0.00004369164,0.00029759388,0.0004631668,0.033474248,0.02587229,0.8368178,0.0034285085,0.09851556],"study_design_scores_gemma":[0.0000743685,0.00024961706,0.00046101186,0.00019394975,0.000101222875,0.0015495981,0.00016844348,0.3142325,0.09969226,0.5130647,0.06999817,0.0002141634],"about_ca_topic_score_codex":0.00033181408,"about_ca_topic_score_gemma":0.00046793005,"teacher_disagreement_score":0.0025706089,"about_ca_system_score_codex":0.00078270107,"about_ca_system_score_gemma":0.0011721769,"threshold_uncertainty_score":0.00859952},"labels":[],"label_agreement":null},{"id":"W2205827828","doi":"","title":"Near ML Performance for Linear Block Codes Using an Iterative Vector SISO Decoder","year":2006,"lang":"en","type":"article","venue":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Code word; Decoding methods; Algorithm; Parity-check matrix; BCH code; Mathematics; Binary number; Block code; Computer science; Arithmetic","score_opus":0.029415761844090386,"score_gpt":0.27146625306088795,"score_spread":0.24205049121679756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205827828","genre_codex":"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.12398647,0.00072204263,0.86458874,0.00032293008,0.000053441403,0.0000645788,0.00012247007,0.0016155699,0.00852387],"genre_scores_gemma":[0.8109016,0.00030842004,0.18451351,0.00016052955,0.000035945257,0.000068066736,0.00021147587,0.00011317955,0.003687311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985336,0.0004979025,0.000071051356,0.00012629038,0.0006324934,0.00013859707],"domain_scores_gemma":[0.9959776,0.0028605636,0.0002360332,0.0003188459,0.00054229755,0.00006474721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014630152,0.0008000607,0.00087811437,0.000559788,0.00037701687,0.0008998986,0.0005663265,0.0010873403,0.001908395],"category_scores_gemma":[0.0061969617,0.00025849073,0.00027462273,0.0005986887,0.00065482483,0.0011735309,0.0007274145,0.00076601165,0.0010362659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018557942,0.00020697103,0.00469706,0.00033499795,0.00018564747,0.00036760827,0.0003889993,0.6831232,0.083475195,0.034316435,0.0018003756,0.18924773],"study_design_scores_gemma":[0.00003304445,0.00020079406,0.00043863832,0.000016383185,0.000019402834,0.0001782593,0.000019974426,0.9706972,0.022655373,0.0048780446,0.00083668303,0.00002620096],"about_ca_topic_score_codex":0.0013738112,"about_ca_topic_score_gemma":0.0017538571,"teacher_disagreement_score":0.001908395,"about_ca_system_score_codex":0.0007189572,"about_ca_system_score_gemma":0.0009462576,"threshold_uncertainty_score":0.0077372193},"labels":[],"label_agreement":null},{"id":"W2219863946","doi":"10.1142/s0129054118500089","title":"On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash function; Universal hashing; Hash chain; Cryptography; Perfect hash function; Integer (computer science); Secrecy; Information-theoretic security; Double hashing","score_opus":0.01575639365929202,"score_gpt":0.28787025731881577,"score_spread":0.2721138636595237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219863946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.18074508,0.002979674,0.7737795,0.0030570999,0.00022623791,0.00020089708,0.00035991444,0.00044871774,0.03820282],"genre_scores_gemma":[0.84929883,0.0027633265,0.13475184,0.000678002,0.0006699225,0.0003347551,0.00040554206,0.00015428141,0.01094341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967271,0.0010153034,0.00020608786,0.00070015166,0.00092118065,0.00043012574],"domain_scores_gemma":[0.98967534,0.0067007733,0.00080520735,0.001362127,0.00085069926,0.0006058588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036274455,0.0009834967,0.0014710566,0.0020752333,0.0024739949,0.0019705747,0.0011099803,0.0016015002,0.0041023386],"category_scores_gemma":[0.014967249,0.00060658366,0.0018807361,0.002911388,0.006011731,0.0073107225,0.006060922,0.0034768526,0.00075819483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007106168,0.00002843103,0.00039626198,0.0000716808,0.000010475783,0.00012407593,0.00038019987,0.009355797,0.0015269723,0.97544765,0.00071556255,0.011871835],"study_design_scores_gemma":[0.00003129353,0.000102312915,0.0002570185,0.000048448026,0.000023840259,0.00034201657,0.00009933214,0.06051446,0.0020522897,0.93073785,0.0057389284,0.00005215824],"about_ca_topic_score_codex":0.0012714736,"about_ca_topic_score_gemma":0.0004805404,"teacher_disagreement_score":0.0041023386,"about_ca_system_score_codex":0.0022026235,"about_ca_system_score_gemma":0.0013249062,"threshold_uncertainty_score":0.019183993},"labels":[],"label_agreement":null},{"id":"W2237691421","doi":"","title":"Efficient Architecture and Implementation for NTRU Based Systems","year":2015,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"University of Windsor","keywords":"NTRU; Homomorphic encryption; Computer science; Cryptosystem; Adder; Systolic array; Modular design; Encryption; Parallel computing; Arithmetic; Theoretical computer science; Computer engineering; Algorithm; Latency (audio); Embedded system; Cryptography; Mathematics; Very-large-scale integration; Computer network","score_opus":0.02352955738986186,"score_gpt":0.2387419038935747,"score_spread":0.21521234650371282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237691421","genre_codex":"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.058710627,0.0008685134,0.9213948,0.00026760352,0.00013522987,0.00018761026,0.00010418787,0.0025974498,0.015733926],"genre_scores_gemma":[0.58479947,0.00073514454,0.39992636,0.00012382765,0.00007004193,0.00019489446,0.00033126274,0.00008318495,0.013735822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997161,0.000050974082,0.000025135765,0.00004162769,0.00012427803,0.00004184936],"domain_scores_gemma":[0.9997738,0.000033261917,0.000028968432,0.00006645469,0.000085644366,0.000011886103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025122057,0.00034648986,0.00027845328,0.00040210172,0.00039875915,0.00071720674,0.0008372384,0.00037513682,0.0049168384],"category_scores_gemma":[0.00042320948,0.00017782328,0.00027284207,0.0003460104,0.00022014158,0.00097401225,0.00039837445,0.00042089063,0.0017015267],"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.0005879498,0.00018274374,0.0014276134,0.00057138776,0.00009988181,0.00060612813,0.0003825536,0.07581155,0.31737307,0.10034998,0.009250988,0.49335623],"study_design_scores_gemma":[0.00016332655,0.0010611793,0.0015123073,0.000092963,0.00009730887,0.00095651345,0.00014398927,0.65423185,0.247307,0.018173395,0.07619745,0.00006260478],"about_ca_topic_score_codex":0.0008130248,"about_ca_topic_score_gemma":0.0016598388,"teacher_disagreement_score":0.0049168384,"about_ca_system_score_codex":0.0005954454,"about_ca_system_score_gemma":0.0007098293,"threshold_uncertainty_score":0.016448498},"labels":[],"label_agreement":null},{"id":"W2237821232","doi":"10.2140/pjm.2015.279.155","title":"Essential dimension and error-correcting codes","year":2015,"lang":"en","type":"article","venue":"Pacific Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Dimension (graph theory); Pure mathematics","score_opus":0.029056162931955294,"score_gpt":0.2606997635452739,"score_spread":0.23164360061331862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237821232","genre_codex":"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.87916267,0.0023830156,0.088424586,0.00076187844,0.000103263876,0.000021247872,0.00042008003,0.000158298,0.028565006],"genre_scores_gemma":[0.99350715,0.0003081434,0.00456123,0.000046649806,0.000052609095,0.000011855997,0.00012607561,0.00001711822,0.0013691874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992399,0.00015000708,0.000030629573,0.00011253359,0.00023015578,0.00023676975],"domain_scores_gemma":[0.997244,0.0013409468,0.00044376252,0.0003170897,0.0003072269,0.00034705637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000593599,0.00033147482,0.00045839243,0.0015111738,0.0006241472,0.0011921489,0.00068207015,0.00038065363,0.0018847819],"category_scores_gemma":[0.003701062,0.00018116209,0.00034404654,0.0007000504,0.0022650796,0.002171185,0.0018862698,0.0009956511,0.00024120449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018644825,0.000044599827,0.0061628404,0.00010733004,0.00003114077,0.00019912742,0.0004959396,0.015148619,0.005621984,0.9578087,0.0013994565,0.012793807],"study_design_scores_gemma":[0.00001551376,0.00006273589,0.0027912979,0.000061458966,0.000012516965,0.00031689132,0.00019830023,0.055587698,0.0053875684,0.93244207,0.0030874466,0.000036524005],"about_ca_topic_score_codex":0.0006941566,"about_ca_topic_score_gemma":0.00047384214,"teacher_disagreement_score":0.0018847819,"about_ca_system_score_codex":0.0009446294,"about_ca_system_score_gemma":0.00051055127,"threshold_uncertainty_score":0.006853819},"labels":[],"label_agreement":null},{"id":"W2240587687","doi":"","title":"Some Good Cyclic and Quasi-Twisted Z 4 -Linear Codes.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.021172871303082177,"score_gpt":0.22937721576246728,"score_spread":0.2082043444593851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240587687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.73154134,0.0025960666,0.06269498,0.0034580023,0.0004689791,0.00009479657,0.001138191,0.0004268778,0.19758074],"genre_scores_gemma":[0.9626292,0.00069901237,0.009166984,0.00032125448,0.0002051152,0.00005395453,0.00032026766,0.000076272176,0.02652797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994172,0.00013773696,0.000024407966,0.000062648774,0.00017062474,0.00018737819],"domain_scores_gemma":[0.9986161,0.000568225,0.0002554341,0.00019010641,0.00017448554,0.00019555511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005711543,0.00050856284,0.00032742787,0.0014435868,0.0010766427,0.0017653856,0.0004670991,0.00078918587,0.007335604],"category_scores_gemma":[0.0023303218,0.00036351228,0.00050533155,0.0011480345,0.0017778169,0.0017124669,0.0017507226,0.0013329408,0.0013492942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116646,0.000016041035,0.00053397374,0.00004461767,0.000009314844,0.0002534372,0.000244995,0.0017761416,0.0017374852,0.98388934,0.0025213,0.008856599],"study_design_scores_gemma":[0.000037621397,0.00004201936,0.0007566143,0.00003490131,0.000015579564,0.00045456365,0.0001419822,0.006737308,0.002104388,0.9803208,0.009325372,0.000028729632],"about_ca_topic_score_codex":0.0010408955,"about_ca_topic_score_gemma":0.0011787118,"teacher_disagreement_score":0.007335604,"about_ca_system_score_codex":0.0011041636,"about_ca_system_score_gemma":0.00083007675,"threshold_uncertainty_score":0.024540067},"labels":[],"label_agreement":null},{"id":"W2242376712","doi":"10.1117/12.734195","title":"On matrix-vector product based sub-quadratic arithmetic complexity schemes for field multiplication","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Mathematics; Polynomial basis; Matrix multiplication; Polynomial; Finite field; Multiplication (music); Polynomial matrix; Basis (linear algebra); Field (mathematics); Toeplitz matrix; Discrete mathematics; Matrix (chemical analysis); Irreducible polynomial; Field extension; Matrix polynomial; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.01629122406793056,"score_gpt":0.2520449906508605,"score_spread":0.23575376658292993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242376712","genre_codex":"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.053145558,0.0005290708,0.93073064,0.00035797988,0.00011555853,0.00023306583,0.00009763836,0.000515018,0.014275523],"genre_scores_gemma":[0.47980696,0.00081288826,0.50427395,0.00022397982,0.00021105188,0.0003571027,0.00028074428,0.00013827221,0.013895054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856156,0.00039441924,0.00009582304,0.00016906395,0.0006053745,0.00017369125],"domain_scores_gemma":[0.9982571,0.00076314306,0.00015014279,0.0004744226,0.00029318276,0.00006195445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013791905,0.00060415233,0.00057305675,0.00083037344,0.00073959236,0.0016155082,0.0010713775,0.00052708486,0.0049207476],"category_scores_gemma":[0.0034324867,0.00027600734,0.0005013009,0.001503522,0.0013004445,0.0031970383,0.0018758124,0.0022160406,0.0013905156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004390685,0.00015031945,0.000261426,0.00016490858,0.000022065553,0.00009375709,0.0002830219,0.03694943,0.026176482,0.79676175,0.0036335047,0.13506424],"study_design_scores_gemma":[0.00019481956,0.0006980254,0.00040980242,0.0000715821,0.000045435478,0.00049829856,0.000080119375,0.5274742,0.05809302,0.38726896,0.025032528,0.00013306379],"about_ca_topic_score_codex":0.0008374858,"about_ca_topic_score_gemma":0.0010414103,"teacher_disagreement_score":0.0049207476,"about_ca_system_score_codex":0.001403135,"about_ca_system_score_gemma":0.0013632169,"threshold_uncertainty_score":0.016461551},"labels":[],"label_agreement":null},{"id":"W2243098549","doi":"10.1109/tcomm.2015.2502952","title":"A New Class of Rateless Codes Based on Reed–Solomon Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Overhead (engineering); Online codes; Block code; Notation; Computer science; Class (philosophy); Raptor code; Discrete mathematics; Luby transform code; Coding (social sciences); Fountain code; Algorithm; Mathematics; Decoding methods; Theoretical computer science; Linear code; Arithmetic; Programming language; Statistics; Artificial intelligence","score_opus":0.06090656670449825,"score_gpt":0.2920649838029278,"score_spread":0.23115841709842955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243098549","genre_codex":"methods","genre_gemma":"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.03205207,0.005605845,0.9498566,0.00054416934,0.00040842395,0.00018670606,0.00019091651,0.00095166214,0.010203678],"genre_scores_gemma":[0.50772536,0.00897515,0.46002787,0.0012814761,0.0010951357,0.0006595512,0.00074634014,0.0002913071,0.019197851],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991209,0.00015120537,0.00006548714,0.0001959234,0.00036220127,0.00010433236],"domain_scores_gemma":[0.99827504,0.00056679174,0.00031013731,0.00034501808,0.0004048612,0.00009817526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000790087,0.00093761605,0.00079279323,0.0016383249,0.0006066238,0.0009649258,0.0010726409,0.00092704175,0.0010090268],"category_scores_gemma":[0.0024391273,0.00031103694,0.0008409475,0.00082000706,0.0009332996,0.0021553126,0.0010389403,0.0016245254,0.00078388536],"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.00064836204,0.0002528113,0.002351987,0.0007451425,0.00017009245,0.00078747893,0.00041552505,0.074461475,0.11518201,0.29965588,0.0097338995,0.49559534],"study_design_scores_gemma":[0.0002297665,0.0009950094,0.001697212,0.00018058659,0.00016843312,0.004225622,0.00008201325,0.6778828,0.09510495,0.0689876,0.15017042,0.0002755605],"about_ca_topic_score_codex":0.00065109506,"about_ca_topic_score_gemma":0.00057879824,"teacher_disagreement_score":0.0016383249,"about_ca_system_score_codex":0.00047914122,"about_ca_system_score_gemma":0.0009144002,"threshold_uncertainty_score":0.0041784644},"labels":[],"label_agreement":null},{"id":"W2253579863","doi":"10.1145/2930889.2930928","title":"Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interpolation (computer graphics); Computation; Univariate; Bilinear interpolation; Degree (music); Polynomial; Logarithm; Exponent; Notation; Nearest-neighbor interpolation","score_opus":0.01655662104108781,"score_gpt":0.25371881437530563,"score_spread":0.2371621933342178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253579863","genre_codex":"methods","genre_gemma":"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.12058494,0.00010623373,0.87276816,0.00022945108,0.000049258702,0.00008342892,0.00021320497,0.0008779885,0.0050873575],"genre_scores_gemma":[0.47855854,0.00012592982,0.5167628,0.00009456593,0.00004836763,0.00014714728,0.0007328485,0.00025085453,0.003279052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953115,0.00010588408,0.00002586761,0.000061041625,0.00019110333,0.00008500961],"domain_scores_gemma":[0.9992273,0.00028931248,0.00006657963,0.00018252122,0.00016534232,0.0000690034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007976544,0.0006490162,0.0009417156,0.0009225431,0.00058641343,0.00093069597,0.0008812409,0.00056533277,0.004119895],"category_scores_gemma":[0.003965126,0.00028174193,0.0006028943,0.0008531709,0.0007216522,0.0018604118,0.002083857,0.00122599,0.0012655841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007965097,0.00020437701,0.0020948702,0.00028815266,0.00005528355,0.00027391603,0.00049078366,0.1508924,0.029535418,0.4525188,0.0073281825,0.35552132],"study_design_scores_gemma":[0.000076171076,0.00014090844,0.0002205451,0.00003149455,0.00001273188,0.00010125858,0.00013897054,0.63376105,0.01660831,0.34540212,0.0034735682,0.00003298741],"about_ca_topic_score_codex":0.0005814922,"about_ca_topic_score_gemma":0.0009981343,"teacher_disagreement_score":0.004119895,"about_ca_system_score_codex":0.0005337279,"about_ca_system_score_gemma":0.0010938034,"threshold_uncertainty_score":0.013782442},"labels":[],"label_agreement":null},{"id":"W2256656669","doi":"10.1109/9780470546345.ch11","title":"Matching Viterbi Decoders and Reed-Solomon Decoders in a Concatenated System","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Viterbi decoder; Viterbi algorithm; Computer science; Soft output Viterbi algorithm; Convolutional code; Reed–Solomon error correction; Iterative Viterbi decoding; Matching (statistics); Concatenated error correction code; Speech recognition; Decoding methods; Algorithm; Mathematics; Sequential decoding; Statistics; Block code","score_opus":0.010024451949206327,"score_gpt":0.20342753340788897,"score_spread":0.19340308145868265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256656669","genre_codex":"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.012438904,0.0059582903,0.8767179,0.000632877,0.00077567296,0.00023346275,0.00024836982,0.002860972,0.1001336],"genre_scores_gemma":[0.15049961,0.0068924082,0.54690325,0.0005415356,0.0004369627,0.00026767096,0.00091923797,0.0009364855,0.29260284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993882,0.00010955736,0.000040417373,0.000110569956,0.00029793903,0.00005331584],"domain_scores_gemma":[0.9995875,0.00017479726,0.000022440376,0.00007920533,0.00012417235,0.000011968965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004902586,0.00067925,0.0005986037,0.0006987056,0.00051567546,0.0017049707,0.0012922862,0.0012933958,0.012008272],"category_scores_gemma":[0.0017342147,0.0007377192,0.00057249254,0.0014788518,0.0006458477,0.0017438701,0.00083577447,0.0012630112,0.007782547],"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.00021821346,0.00007097696,0.00036564932,0.000511708,0.00008640692,0.0002491375,0.0005028422,0.09213977,0.028819814,0.40234333,0.019999696,0.45469254],"study_design_scores_gemma":[0.0000686755,0.0002366323,0.00055041484,0.00030523218,0.000106653446,0.000681829,0.00010345412,0.39608416,0.088480145,0.22259031,0.29066566,0.0001267521],"about_ca_topic_score_codex":0.0017272581,"about_ca_topic_score_gemma":0.00202168,"teacher_disagreement_score":0.012008272,"about_ca_system_score_codex":0.0015681932,"about_ca_system_score_gemma":0.0014045187,"threshold_uncertainty_score":0.040171683},"labels":[],"label_agreement":null},{"id":"W2262701818","doi":"10.26421/qic14.9-10-6","title":"Polynomial time quantum algorithms for certain bivariate hidden polynomial problems","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bivariate analysis; Mathematics; Diagonal; Polynomial; Oracle; Time complexity; Quantum algorithm; Quantum computer; Quantum; Quadratic equation; Discrete mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.014882703486504776,"score_gpt":0.24132494968426194,"score_spread":0.22644224619775716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262701818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.038854454,0.00027536222,0.9507304,0.001009676,0.00007095484,0.000101367565,0.00010421633,0.00059339183,0.008260178],"genre_scores_gemma":[0.476541,0.00052818155,0.5153707,0.00029296865,0.00018235884,0.0002470449,0.00037465701,0.00027420637,0.006188917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987919,0.00034606096,0.000061477695,0.00022375637,0.00033705027,0.00023985624],"domain_scores_gemma":[0.9970797,0.0018989812,0.00019574646,0.00052699295,0.00017584994,0.00012276878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011881822,0.00062397437,0.00094030885,0.00069899735,0.00093899865,0.0017665372,0.0016645287,0.0012510117,0.006472756],"category_scores_gemma":[0.005426025,0.00042424112,0.00096612715,0.0012444953,0.0017297422,0.0041611395,0.0032378312,0.0032338675,0.0008209892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021182676,0.00015057124,0.0004268568,0.00021281753,0.000053422245,0.000093415605,0.00025703714,0.09100637,0.0052013653,0.80509263,0.0057441476,0.091549456],"study_design_scores_gemma":[0.00011697407,0.000034288234,0.00012557447,0.000013375117,0.00001927542,0.000068015266,0.000054607306,0.4425467,0.0035661506,0.55067796,0.0027575123,0.000019665755],"about_ca_topic_score_codex":0.0008912376,"about_ca_topic_score_gemma":0.0016194624,"teacher_disagreement_score":0.006472756,"about_ca_system_score_codex":0.0014020717,"about_ca_system_score_gemma":0.0014784188,"threshold_uncertainty_score":0.021653533},"labels":[],"label_agreement":null},{"id":"W2275630553","doi":"10.1016/j.ffa.2014.04.002","title":"Roots and coefficients of polynomials over finite fields","year":2014,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Finite field; Polynomial; Field (mathematics); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.00916860328750755,"score_gpt":0.22305209950568508,"score_spread":0.21388349621817754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275630553","genre_codex":"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.6565156,0.023258554,0.18879634,0.0058780285,0.0014210152,0.00008248964,0.00064492313,0.00035976685,0.12304323],"genre_scores_gemma":[0.94627213,0.0075671007,0.01676941,0.00022034282,0.0013390013,0.000049495004,0.00026478685,0.000106018066,0.027411696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993093,0.00019585105,0.0000319463,0.000097427954,0.00023925382,0.00012632838],"domain_scores_gemma":[0.9967374,0.0021834814,0.00046070555,0.00014944772,0.00023680038,0.00023217175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010109494,0.0010666823,0.0011146733,0.0030567863,0.0010529717,0.0034124723,0.0010302886,0.0011670542,0.005948542],"category_scores_gemma":[0.008039151,0.0007119305,0.0004957143,0.0031681964,0.00372246,0.00452014,0.00152217,0.003342319,0.0012166917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010078066,0.0000416643,0.00049734395,0.000111196925,0.000010896493,0.00018259029,0.00048026876,0.0034153082,0.0018373172,0.9764189,0.0015714477,0.015332187],"study_design_scores_gemma":[0.000030231888,0.000021775044,0.00036984019,0.00006514618,0.000011414634,0.00021876257,0.00012754127,0.008641305,0.0007528513,0.98594254,0.0037949365,0.000023727764],"about_ca_topic_score_codex":0.0010522617,"about_ca_topic_score_gemma":0.001005459,"teacher_disagreement_score":0.005948542,"about_ca_system_score_codex":0.001384014,"about_ca_system_score_gemma":0.0007388365,"threshold_uncertainty_score":0.019899845},"labels":[],"label_agreement":null},{"id":"W2279041755","doi":"","title":"PARTIAL SPREADS AND HYPERBENT FUNCTIONS IN ODD CHARACTERISTIC","year":2011,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Bent molecular geometry; Bent function; Finite field; Monomial; Mathematics; Bijection; Dimension (graph theory); Coding theory; Pure mathematics; TRACE (psycholinguistics); Boolean function; Discrete mathematics","score_opus":0.013015796143920934,"score_gpt":0.1984063041030562,"score_spread":0.18539050795913528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279041755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.76128185,0.002029472,0.14831468,0.0011063477,0.00012520951,0.000045126777,0.00014109672,0.0001356285,0.08682048],"genre_scores_gemma":[0.96662104,0.0014188684,0.013259767,0.000111858266,0.00008058516,0.000039634986,0.000088134795,0.00004116362,0.018338952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977523,0.000046489953,0.00001041541,0.0000319458,0.00006174197,0.00007418221],"domain_scores_gemma":[0.99954706,0.00018964629,0.00008264547,0.00006642447,0.000057870355,0.000056187368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038636258,0.0004733688,0.00026255404,0.00085372303,0.0006533409,0.0012545664,0.00028760632,0.00040050666,0.0023437813],"category_scores_gemma":[0.0011844469,0.00015978725,0.00034813135,0.0007386066,0.0020689424,0.0025706626,0.0007989256,0.0011210073,0.0003840824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003131603,0.000011513177,0.00055353256,0.000025425152,0.0000039512133,0.00011193759,0.000248244,0.0029336812,0.00255693,0.983008,0.0003850808,0.010130378],"study_design_scores_gemma":[0.000011419913,0.0000904702,0.0006449984,0.000030023086,0.000008192613,0.00042935988,0.00023839819,0.015275842,0.0039383527,0.96716845,0.0121484315,0.000015983262],"about_ca_topic_score_codex":0.00045436117,"about_ca_topic_score_gemma":0.0003565834,"teacher_disagreement_score":0.0023437813,"about_ca_system_score_codex":0.0007430504,"about_ca_system_score_gemma":0.0004746122,"threshold_uncertainty_score":0.007840693},"labels":[],"label_agreement":null},{"id":"W2281656048","doi":"10.2140/jsag.2024.14.1","title":"Schur indices in GAP: wedderga 4.7+","year":2024,"lang":"en","type":"article","venue":"Journal of Software for Algebra and Geometry","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of St Andrews","keywords":"Quaternion; Abelian group; Implementation; Mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.012250126306855331,"score_gpt":0.2540045014615915,"score_spread":0.24175437515473616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281656048","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027949704,0.001172663,0.5426017,0.0005088841,0.0005568085,0.0003789424,0.012665134,0.3650274,0.049138755],"genre_scores_gemma":[0.22674721,0.0007331089,0.6107914,0.00096423307,0.00018046873,0.0017010946,0.027229806,0.10365839,0.02799427],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873346,0.00022701676,0.00009469389,0.00027553935,0.0004400436,0.00022934735],"domain_scores_gemma":[0.99848866,0.000529646,0.0000890954,0.0005654805,0.00025191542,0.00007518142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016458123,0.0016371016,0.0013515939,0.0018722115,0.00073960505,0.002860145,0.003165398,0.0014583264,0.048675556],"category_scores_gemma":[0.0073044966,0.001435077,0.0014700475,0.0016190283,0.0008946924,0.004830721,0.0039668777,0.001728728,0.026597032],"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.0021451248,0.00046565733,0.0052350946,0.0016864366,0.00029215417,0.0003798128,0.0012451942,0.01629083,0.008923018,0.24344,0.30951962,0.4103771],"study_design_scores_gemma":[0.00067776174,0.0002223178,0.0016377396,0.0004812421,0.00013066162,0.0004436802,0.0002522785,0.15933327,0.04051048,0.39162508,0.40447763,0.00020783297],"about_ca_topic_score_codex":0.0020712477,"about_ca_topic_score_gemma":0.0028199472,"teacher_disagreement_score":0.048675556,"about_ca_system_score_codex":0.001404544,"about_ca_system_score_gemma":0.0015622706,"threshold_uncertainty_score":0.16283602},"labels":[],"label_agreement":null},{"id":"W2284443012","doi":"10.1007/s12095-016-0208-3","title":"Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences","year":2016,"lang":"en","type":"preprint","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Character (mathematics); Autocorrelation; Stream cipher; Cipher; Algorithm; Cryptography; Binary number; Mathematics; Sequence (biology); Computer science; Discrete mathematics; Arithmetic; Statistics; Encryption","score_opus":0.02833204586572379,"score_gpt":0.2651129283421842,"score_spread":0.2367808824764604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284443012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7683336,0.0015091281,0.077682324,0.0022230218,0.00041306953,0.0000809787,0.0007188989,0.0002505613,0.14878839],"genre_scores_gemma":[0.9772914,0.00035048544,0.006496829,0.00023503545,0.00017998397,0.00006514995,0.0003282746,0.00005503999,0.014997964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993051,0.0002147358,0.00004847869,0.00009640752,0.00017122648,0.00016406276],"domain_scores_gemma":[0.99813485,0.0007798615,0.00030176117,0.0001708605,0.00033817312,0.0002744529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007801444,0.00061472383,0.0003949461,0.002470474,0.0012855418,0.0023513539,0.0007296403,0.0012096582,0.007193526],"category_scores_gemma":[0.0053107343,0.00024845006,0.00024446205,0.0017039566,0.0018301253,0.0022711125,0.0011518411,0.001656246,0.0013834476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017650031,0.000024524781,0.0005795159,0.000040695428,0.000005893547,0.00014120644,0.00028972822,0.0018441635,0.0024221533,0.98143595,0.0012380119,0.0118015995],"study_design_scores_gemma":[0.000033044103,0.000059709,0.0010781883,0.00006761491,0.000011780003,0.0003928355,0.00020049671,0.0135952085,0.0067414576,0.971377,0.006393073,0.00004949143],"about_ca_topic_score_codex":0.0004202582,"about_ca_topic_score_gemma":0.00036688865,"teacher_disagreement_score":0.007193526,"about_ca_system_score_codex":0.001233351,"about_ca_system_score_gemma":0.0008175545,"threshold_uncertainty_score":0.02406478},"labels":[],"label_agreement":null},{"id":"W22855264","doi":"10.1007/978-1-4615-0304-0_4","title":"Trace Representation of Hall’s Sextic Residue Sequences of Period P ≡ 7 (mod 8)","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Residue (chemistry); Conjecture; TRACE (psycholinguistics); Period (music); Hadamard transform; Mod; Mathematics; Representation (politics); Combinatorics; Physics; Chemistry; Mathematical analysis; Philosophy; Political science; Linguistics","score_opus":0.029561239920331994,"score_gpt":0.2522196155980865,"score_spread":0.22265837567775448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22855264","genre_codex":"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.48308396,0.00093810674,0.14071296,0.00193417,0.0012032038,0.000121318306,0.00034614681,0.000876251,0.37078393],"genre_scores_gemma":[0.895452,0.00047267505,0.014498415,0.00034138915,0.00053062296,0.00006525836,0.00023250855,0.00026789043,0.088139184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972266,0.000046650322,0.000011947294,0.000037465932,0.000100702535,0.000080643505],"domain_scores_gemma":[0.9997086,0.000079559795,0.000037905334,0.000056495857,0.00005915365,0.00005833628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037277397,0.00068206724,0.00055045343,0.0016408056,0.0012897017,0.0024420016,0.00082408584,0.0009539056,0.012296372],"category_scores_gemma":[0.0013585931,0.00025598495,0.00047019334,0.0012737475,0.0017463454,0.0026519822,0.0009426241,0.0017359358,0.0016961149],"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.000053055956,0.000026223606,0.00006099858,0.000016261625,0.000002763331,0.00007556596,0.00021525176,0.000490858,0.0013932082,0.9849665,0.0013012893,0.011398068],"study_design_scores_gemma":[0.000023668232,0.000050849674,0.00012424648,0.0000143007965,0.000004914577,0.00016280757,0.00010016835,0.0045182775,0.0020644143,0.98546207,0.007456093,0.000018043142],"about_ca_topic_score_codex":0.000578614,"about_ca_topic_score_gemma":0.0004656106,"teacher_disagreement_score":0.012296372,"about_ca_system_score_codex":0.0009648592,"about_ca_system_score_gemma":0.00060906314,"threshold_uncertainty_score":0.04113549},"labels":[],"label_agreement":null},{"id":"W2288543394","doi":"10.1007/s12190-015-0964-9","title":"On some classes of linear codes over $${\\mathbb {Z}}_{2}{\\mathbb {Z}}_{4}$$ Z 2 Z 4 and their covering radii","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Simplex; Combinatorics; Binary number; Binary code; Theory of computation; Type (biology); Discrete mathematics; Upper and lower bounds; Algorithm; Arithmetic; Mathematical analysis","score_opus":0.011452824401838126,"score_gpt":0.22489385348864702,"score_spread":0.2134410290868089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288543394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.75578177,0.0038467196,0.06081722,0.0057343207,0.0003281776,0.0001498094,0.001227324,0.0009057715,0.17120887],"genre_scores_gemma":[0.96916324,0.0016658484,0.009778819,0.000658132,0.00048675845,0.00021287503,0.0008219428,0.00032194928,0.016890442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806756,0.00054846663,0.00007926884,0.00032905125,0.00048075887,0.0004949375],"domain_scores_gemma":[0.99230254,0.005085523,0.00090594374,0.00049062393,0.0003813798,0.0008339588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013320614,0.0016814444,0.001602568,0.003292707,0.002892455,0.004554371,0.0021899857,0.0025623122,0.0101627195],"category_scores_gemma":[0.010558346,0.00092791044,0.0011372588,0.0016278225,0.0037982785,0.004360471,0.0036409548,0.0035422712,0.0019811192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017376308,0.00002526111,0.00051418133,0.0000701131,0.0000184066,0.00009827404,0.00041083503,0.0026603572,0.0013433507,0.9858759,0.0032952656,0.0055142525],"study_design_scores_gemma":[0.000103980616,0.00008296789,0.0016728189,0.000085667714,0.00004897772,0.00070989854,0.00034974836,0.0304914,0.0024588753,0.95602816,0.007898669,0.00006879539],"about_ca_topic_score_codex":0.0013078033,"about_ca_topic_score_gemma":0.00072833634,"teacher_disagreement_score":0.0101627195,"about_ca_system_score_codex":0.0026257394,"about_ca_system_score_gemma":0.00092677766,"threshold_uncertainty_score":0.033997655},"labels":[],"label_agreement":null},{"id":"W2288806573","doi":"10.1109/acssc.2015.7421165","title":"Low power design of a word-level finite field multiplier using Reordered Normal Basis","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Domino logic; Dissipation; CMOS; Computer science; Electronic engineering; Transistor; Integrated circuit design; Logic synthesis; Logic gate; Engineering; Voltage; Electrical engineering; Logic family","score_opus":0.08395138455365822,"score_gpt":0.26526578803928746,"score_spread":0.18131440348562924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288806573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.21971881,0.0005405585,0.7642085,0.00033004183,0.000117450974,0.0001679828,0.00015858914,0.0017235707,0.013034537],"genre_scores_gemma":[0.76014036,0.0001977491,0.23279008,0.000116228315,0.000039683608,0.00010260713,0.00016040594,0.000069608184,0.0063833077],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998925,0.000020695983,0.000007531214,0.000022213208,0.000036302565,0.000020760466],"domain_scores_gemma":[0.9998553,0.00002706712,0.000027315518,0.000016714452,0.00006078382,0.00001279541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012292892,0.0003786655,0.00027101763,0.00034084503,0.0003652352,0.0004745561,0.00068833446,0.00027388093,0.0026244572],"category_scores_gemma":[0.00021029817,0.00015676233,0.00021389856,0.00031338242,0.0001894656,0.00047629452,0.0001981292,0.0002762256,0.00062002626],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056451204,0.00016780828,0.0010382609,0.00035687804,0.00009709091,0.0007053319,0.00022071452,0.033948526,0.70827466,0.030369064,0.0033974538,0.22085975],"study_design_scores_gemma":[0.00031746126,0.0033614559,0.002167718,0.00009202105,0.00015359872,0.0024688873,0.0001689412,0.5002221,0.43374047,0.013024261,0.04414902,0.00013412128],"about_ca_topic_score_codex":0.000723669,"about_ca_topic_score_gemma":0.0015618252,"teacher_disagreement_score":0.0026244572,"about_ca_system_score_codex":0.0005111159,"about_ca_system_score_gemma":0.0005404866,"threshold_uncertainty_score":0.008779645},"labels":[],"label_agreement":null},{"id":"W2289857173","doi":"10.1007/978-3-319-17296-5_27","title":"An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm","year":2015,"lang":"en","type":"book-chapter","venue":"CIM series in mathematical sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Extension (predicate logic); Minimum weight; Sequence (biology); Mathematics; Discrete mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.03635427763897129,"score_gpt":0.27348795480432964,"score_spread":0.23713367716535835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289857173","genre_codex":"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.012083991,0.0009237234,0.95343155,0.0004864503,0.0005050761,0.00015304089,0.00018320403,0.0007964352,0.03143659],"genre_scores_gemma":[0.09128405,0.0013925043,0.87394506,0.0003540395,0.00040673718,0.00022452201,0.0004907165,0.00049945863,0.03140294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991641,0.00015316517,0.000062001345,0.00019781069,0.00033662148,0.000086265005],"domain_scores_gemma":[0.99926645,0.00016890986,0.00005919858,0.00028102542,0.00018117424,0.000043173364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009727325,0.00072983745,0.0010295013,0.0016105445,0.0009909114,0.0016228596,0.002952297,0.0012612399,0.008113618],"category_scores_gemma":[0.0041429135,0.0004487295,0.0010970728,0.002946,0.0007290412,0.0035807553,0.0021929648,0.0023153003,0.004096969],"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.0002555638,0.00024553947,0.00041322244,0.00022895726,0.00007664692,0.000065753055,0.00011503793,0.03857487,0.009561655,0.39798906,0.014418814,0.5380548],"study_design_scores_gemma":[0.00010056042,0.00015832964,0.0005141632,0.000097766446,0.000078979574,0.00030852837,0.000035455698,0.4369648,0.009009444,0.48689106,0.06577243,0.000068458045],"about_ca_topic_score_codex":0.0010477484,"about_ca_topic_score_gemma":0.0014380813,"teacher_disagreement_score":0.008113618,"about_ca_system_score_codex":0.0006755318,"about_ca_system_score_gemma":0.0013845309,"threshold_uncertainty_score":0.027142763},"labels":[],"label_agreement":null},{"id":"W2289924220","doi":"10.1016/j.aim.2017.02.012","title":"Normalizers of primitive permutation groups","year":2017,"lang":"en","type":"preprint","venue":"Advances in Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Research, Innovation and Economic Development, California State Polytechnic University, Pomona; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Mount Allison University; London Mathematical Society; National Science Foundation","keywords":"Primitive permutation group; Mathematics; Combinatorics; Permutation group; Permutation (music); Galois group; Group (periodic table); Sequence (biology); Discrete mathematics; Cyclic permutation; Symmetric group; Physics; Biology; Genetics","score_opus":0.01827990261158398,"score_gpt":0.3022645525345919,"score_spread":0.2839846499230079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289924220","genre_codex":"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.595812,0.0014251142,0.18426979,0.00433834,0.0019123916,0.00012216944,0.0007502924,0.0010580333,0.21031183],"genre_scores_gemma":[0.93499875,0.0006666274,0.016458228,0.0006056933,0.0017299422,0.00013252761,0.0005141757,0.0003197018,0.044574328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984428,0.00037988246,0.00007434684,0.00035647774,0.00047490018,0.00027157675],"domain_scores_gemma":[0.9976151,0.0007433134,0.00042490396,0.00039408242,0.00031588486,0.0005067065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010759942,0.0008400452,0.00090966735,0.0023507578,0.00204649,0.003575536,0.0009483737,0.00096995384,0.008189614],"category_scores_gemma":[0.004821416,0.0004881374,0.00067512924,0.0014119262,0.0045496994,0.0040892833,0.003059934,0.0029800197,0.0016341149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031260257,0.000011976808,0.00012863065,0.000008371133,0.0000031184102,0.00003248606,0.00011145683,0.00031403548,0.000668882,0.99411064,0.0007199328,0.00385921],"study_design_scores_gemma":[0.000009973945,0.000011620072,0.000098040386,0.0000040521904,0.0000028780296,0.000046929254,0.00003349395,0.0011310609,0.00046546917,0.9960588,0.0021312996,0.0000065009986],"about_ca_topic_score_codex":0.00069667766,"about_ca_topic_score_gemma":0.0006763748,"teacher_disagreement_score":0.008189614,"about_ca_system_score_codex":0.0016484878,"about_ca_system_score_gemma":0.001146273,"threshold_uncertainty_score":0.027396977},"labels":[],"label_agreement":null},{"id":"W2294545534","doi":"","title":"Quaternary quasi-cyclic codes with even length components","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quaternary; Mathematics; Geology; Paleontology","score_opus":0.02518241983312978,"score_gpt":0.22015279862893525,"score_spread":0.19497037879580548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294545534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.54437435,0.003528494,0.32732597,0.0039060798,0.0012557384,0.00029123988,0.001472048,0.00096525036,0.116880916],"genre_scores_gemma":[0.923545,0.0014343162,0.042830516,0.0010561994,0.0006462295,0.00022149956,0.00049761985,0.00019319203,0.029575365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882513,0.00030760048,0.00009467269,0.00014644384,0.0003639101,0.00026233093],"domain_scores_gemma":[0.996657,0.0013352218,0.0005325171,0.00064739067,0.00056546903,0.00026243014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010277824,0.0008258259,0.00076945976,0.0017592191,0.0017610966,0.0029812101,0.00066059356,0.0012176742,0.007079951],"category_scores_gemma":[0.0033294363,0.00050221436,0.0005556441,0.0021344796,0.0019401661,0.0022558803,0.0017477684,0.0015948389,0.0020367864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023963778,0.00003568504,0.00049859384,0.00009073904,0.000011489008,0.00022207874,0.00023072724,0.001616498,0.011314971,0.9647836,0.0020871435,0.018868815],"study_design_scores_gemma":[0.000087929984,0.00019256661,0.000947171,0.00010098331,0.00004497093,0.0009436756,0.00015941102,0.018587805,0.01700453,0.9402454,0.021595014,0.00009054175],"about_ca_topic_score_codex":0.0004883387,"about_ca_topic_score_gemma":0.0005920722,"teacher_disagreement_score":0.007079951,"about_ca_system_score_codex":0.0012586879,"about_ca_system_score_gemma":0.0017341098,"threshold_uncertainty_score":0.0236848},"labels":[],"label_agreement":null},{"id":"W2299317473","doi":"10.14288/1.0065096","title":"On the construction, dimensionality, and decoding of linear block code trellises","year":2008,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Computer science; Code (set theory); Algorithm; Arithmetic; Mathematics; Programming language; Set (abstract data type)","score_opus":0.013916270494697593,"score_gpt":0.174035312746915,"score_spread":0.1601190422522174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299317473","genre_codex":"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.02062945,0.00072317355,0.9706826,0.00022607301,0.000035939338,0.00007523132,0.00023488735,0.00028762288,0.007105018],"genre_scores_gemma":[0.2676041,0.0023094877,0.7197091,0.00015688407,0.00011922757,0.00042594422,0.0013537745,0.00036604496,0.007955474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980659,0.0006833765,0.00015155217,0.00028228582,0.00068324676,0.00013358894],"domain_scores_gemma":[0.9944449,0.0035699673,0.00043926926,0.0007957018,0.0006594763,0.00009071514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014434796,0.000507781,0.0009074589,0.000868484,0.0006308724,0.0013682266,0.0008236086,0.0008623929,0.0017856983],"category_scores_gemma":[0.008280807,0.0006748343,0.00085118593,0.0010225883,0.0018579564,0.0019645921,0.0013869961,0.0018926781,0.0008045515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000176997,0.00004648359,0.0012901395,0.0003221546,0.000036296595,0.0001518354,0.0004178041,0.3750581,0.02782203,0.47697517,0.0025385667,0.1151644],"study_design_scores_gemma":[0.000036402445,0.00016949896,0.0012158406,0.00013190135,0.000025202495,0.00030444446,0.00006915459,0.7014763,0.035787005,0.24898835,0.0117137125,0.00008226459],"about_ca_topic_score_codex":0.001634159,"about_ca_topic_score_gemma":0.0014849756,"teacher_disagreement_score":0.0017856983,"about_ca_system_score_codex":0.0016599883,"about_ca_system_score_gemma":0.0010791626,"threshold_uncertainty_score":0.012044132},"labels":[],"label_agreement":null},{"id":"W2313290072","doi":"10.1142/9789812703118_0009","title":"Worst-Case Redundancy of Solid Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Computer science; Redundancy (engineering)","score_opus":0.014410964426658983,"score_gpt":0.2592484445163404,"score_spread":0.2448374800896814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313290072","genre_codex":"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.48239452,0.0029685327,0.43346518,0.0059066783,0.00038529828,0.000117188814,0.0013229594,0.0009044089,0.07253533],"genre_scores_gemma":[0.9730886,0.0007316631,0.019844837,0.00030818404,0.00027998377,0.000086350905,0.00034379525,0.00013262441,0.005183889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912198,0.0030342112,0.000371047,0.0008374586,0.0029505093,0.0015870029],"domain_scores_gemma":[0.96765566,0.021435153,0.0023429962,0.0053868257,0.0023754411,0.0008039309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057162014,0.0011427505,0.0016909207,0.0020362176,0.0018384606,0.0045734453,0.002356401,0.0028757064,0.0048019965],"category_scores_gemma":[0.032424886,0.0009772219,0.00079038175,0.0018288568,0.0037033698,0.0051877857,0.0033299257,0.002449531,0.0014187976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013051273,0.00007956455,0.0011893241,0.00030807394,0.000082067105,0.0006616265,0.00036892414,0.117188066,0.007913473,0.8419376,0.0068711224,0.02209508],"study_design_scores_gemma":[0.000052553853,0.00008019775,0.00022707866,0.00007202151,0.000038750335,0.00063980545,0.00009096587,0.12478821,0.0037880875,0.8682882,0.0018915392,0.00004258417],"about_ca_topic_score_codex":0.0004433161,"about_ca_topic_score_gemma":0.00048016195,"teacher_disagreement_score":0.0057162014,"about_ca_system_score_codex":0.0017208101,"about_ca_system_score_gemma":0.0021195314,"threshold_uncertainty_score":0.030230522},"labels":[],"label_agreement":null},{"id":"W2313609681","doi":"10.4153/cmb-2009-009-2","title":"A SAGBI Basis For 𝔽[<i>V</i><sub>2</sub> ⊕ <i>V</i><sub>2</sub> ⊕ <i>V</i><sub>3</sub>]<i><sup>C<sub>p</sub></sup></i>","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Indecomposable module; Order (exchange); Prime (order theory); Basis (linear algebra); Field (mathematics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.010120282510581542,"score_gpt":0.20231169813766037,"score_spread":0.19219141562707884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313609681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8098594,0.00040653965,0.08486476,0.0011360713,0.00024241285,0.00013925445,0.0005830856,0.00038018945,0.102388255],"genre_scores_gemma":[0.9596296,0.00019001153,0.018199787,0.00019432283,0.000069350484,0.000080520564,0.00053843297,0.00010138684,0.020996636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982077,0.00003473803,0.0000057214347,0.000019146639,0.00005616937,0.00006350926],"domain_scores_gemma":[0.99980134,0.000034552533,0.000023823211,0.000028538685,0.00005315822,0.000058615966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032723628,0.00030816763,0.00033646374,0.0007543561,0.0010580558,0.0012876262,0.0004112053,0.00046654933,0.0077568283],"category_scores_gemma":[0.00047526477,0.00018236904,0.0002827451,0.0005029416,0.00094817404,0.0007965019,0.0010667564,0.0009950778,0.0021919361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014119959,0.00008371298,0.00056586915,0.00004266651,0.0000070723318,0.00017515737,0.000525426,0.0017807857,0.014656806,0.9545447,0.0042028027,0.023273708],"study_design_scores_gemma":[0.00007001111,0.00021621346,0.0017195819,0.000043968634,0.000016813456,0.00036628108,0.00083050004,0.016943661,0.019515764,0.92421573,0.036004312,0.00005713956],"about_ca_topic_score_codex":0.00087327947,"about_ca_topic_score_gemma":0.0009905254,"teacher_disagreement_score":0.0077568283,"about_ca_system_score_codex":0.00066661055,"about_ca_system_score_gemma":0.0008863862,"threshold_uncertainty_score":0.02594918},"labels":[],"label_agreement":null},{"id":"W2316194124","doi":"10.4153/cjm-2013-014-9","title":"Multidimensional Vinogradov-type Estimates in Function Fields","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Type (biology); Polynomial; Finite field; Function (biology); Field (mathematics); Ring (chemistry); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.015307846626546388,"score_gpt":0.21049611704891052,"score_spread":0.19518827042236414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316194124","genre_codex":"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.3882408,0.0028751458,0.50819695,0.0021643492,0.00044280128,0.00007258898,0.00039617612,0.00036353376,0.09724764],"genre_scores_gemma":[0.96084374,0.0010595727,0.027511846,0.00019423444,0.00029473173,0.000054696804,0.00015170666,0.000078118115,0.009811242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883443,0.0002697799,0.0000682359,0.0001852816,0.00045008818,0.00019225273],"domain_scores_gemma":[0.9966826,0.0014113957,0.00045766006,0.00034892294,0.00076416944,0.0003352415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026972124,0.00062640733,0.0007071233,0.004420038,0.0010290899,0.0018784424,0.0013245562,0.0006419252,0.004745925],"category_scores_gemma":[0.009712021,0.00034639574,0.00082798174,0.0013000532,0.0027388886,0.004543387,0.0038605735,0.0028578462,0.00059244985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024582829,0.000012691186,0.00083626586,0.000040292678,0.000009981721,0.000085814856,0.00017219824,0.0018300381,0.0017223733,0.9904219,0.00065538834,0.0041884817],"study_design_scores_gemma":[0.000013719462,0.000056898574,0.0021851999,0.0000707674,0.000026504742,0.00033900616,0.00023503018,0.05295069,0.004856574,0.93331957,0.005894624,0.000051557246],"about_ca_topic_score_codex":0.0015219606,"about_ca_topic_score_gemma":0.00089687825,"teacher_disagreement_score":0.004745925,"about_ca_system_score_codex":0.0018626011,"about_ca_system_score_gemma":0.0005717823,"threshold_uncertainty_score":0.01587671},"labels":[],"label_agreement":null},{"id":"W2341519381","doi":"","title":"Trace Function Representation of a New Class of Sextic Residue Sequences of Period p≡ 7(mod 8)","year":2007,"lang":"en","type":"article","venue":"Jisuanji gongcheng","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"TRACE (psycholinguistics); Residue (chemistry); Period (music); Mod; Sequence (biology); Mathematics; Representation (politics); Prime (order theory); Computer science; Pure mathematics; Combinatorics; Discrete mathematics; Physics; Chemistry","score_opus":0.030085592985416184,"score_gpt":0.28649338792517265,"score_spread":0.25640779493975646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341519381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.88245636,0.0005793681,0.09132549,0.00033991036,0.0002306403,0.000056565696,0.00016407993,0.0002196784,0.024627995],"genre_scores_gemma":[0.9792838,0.00026969198,0.013573976,0.000073469426,0.00013151988,0.00003631926,0.00022884338,0.000035871555,0.0063664345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999764,0.00002952541,0.000014677598,0.000050734463,0.0000734034,0.00006760909],"domain_scores_gemma":[0.9996357,0.00009399505,0.000078056204,0.00006158335,0.000065348584,0.000065377884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019127148,0.00033716217,0.00035575018,0.0012226991,0.00080666994,0.0008190489,0.00043539391,0.0005459717,0.0035128351],"category_scores_gemma":[0.00087198825,0.00013594388,0.0004569451,0.0006000598,0.00076075544,0.0014850837,0.00043224337,0.0008019594,0.00037466345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003966314,0.00014515349,0.0023584084,0.00014678919,0.000024194764,0.0014023477,0.0006993083,0.0074348077,0.052871283,0.83137447,0.0017928311,0.10135378],"study_design_scores_gemma":[0.00016132968,0.0008395311,0.003242903,0.00008470626,0.00004971074,0.003981227,0.0005157289,0.09781151,0.069396615,0.7949409,0.028814003,0.00016180286],"about_ca_topic_score_codex":0.00025587028,"about_ca_topic_score_gemma":0.00017933789,"teacher_disagreement_score":0.0035128351,"about_ca_system_score_codex":0.0004891679,"about_ca_system_score_gemma":0.00042897265,"threshold_uncertainty_score":0.011751592},"labels":[],"label_agreement":null},{"id":"W2348839133","doi":"","title":"A Fast Cryptanalysis of the Generalized Self-shrinking Sequences","year":2004,"lang":"en","type":"article","venue":"Journal of Electronics Information & Technology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Euler's totient function; Cryptanalysis; Linear feedback shift register; Algorithm; Mathematics; Euler's formula; Time complexity; Polynomial; Linear cryptanalysis; Discrete mathematics; Computer science; Shift register; Arithmetic; Cryptography; Mathematical analysis","score_opus":0.0045039401192205,"score_gpt":0.20962901545799206,"score_spread":0.20512507533877156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2348839133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.103328966,0.0002659807,0.8908925,0.0002387321,0.00007202992,0.00009829337,0.00004972077,0.0007713881,0.0042824517],"genre_scores_gemma":[0.61672115,0.00030559808,0.37638488,0.00011113371,0.000081196275,0.0001276212,0.000172536,0.00008806354,0.006007829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994456,0.00014209846,0.000028041863,0.00009475499,0.00020977634,0.00007965796],"domain_scores_gemma":[0.99941695,0.00024077686,0.00006828435,0.0001563672,0.00008952471,0.000028160823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063603936,0.0007995943,0.00067009404,0.00067824445,0.0003761522,0.0005672473,0.0005267911,0.0005451368,0.0015574514],"category_scores_gemma":[0.0014625633,0.00030365528,0.00066748395,0.0005124161,0.0009257972,0.0012052848,0.0010171541,0.0011316711,0.00041146332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072713447,0.000086859895,0.0014561001,0.00028200907,0.00016699285,0.0004952662,0.00047938022,0.11618432,0.11707921,0.4016605,0.0027829024,0.35859942],"study_design_scores_gemma":[0.00015133398,0.00046760452,0.0009623636,0.000081599326,0.000079554164,0.0010931008,0.00007390145,0.6889569,0.12993796,0.16920264,0.008915339,0.00007761737],"about_ca_topic_score_codex":0.00027448373,"about_ca_topic_score_gemma":0.00026380288,"teacher_disagreement_score":0.0015574514,"about_ca_system_score_codex":0.0004709319,"about_ca_system_score_gemma":0.00060893805,"threshold_uncertainty_score":0.005210161},"labels":[],"label_agreement":null},{"id":"W2349480802","doi":"","title":"On the Avalanche Characteristics of the Boolean Function","year":2004,"lang":"en","type":"article","venue":"Dianzi xuebao","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Boolean function; Dimension (graph theory); Mathematics; Discrete mathematics; Degree (music); Function (biology); Set (abstract data type); Parity function; Class (philosophy); Space (punctuation); Combinatorics; Independence (probability theory); Vector-valued function; Boolean expression; Pure mathematics; Computer science; Physics; Artificial intelligence; Statistics","score_opus":0.008415222041752646,"score_gpt":0.18099641575339462,"score_spread":0.17258119371164196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2349480802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8820629,0.0020526145,0.0813829,0.00057406933,0.000061812425,0.000054358785,0.0002339737,0.00011342815,0.033463925],"genre_scores_gemma":[0.99178046,0.0006400231,0.0051236968,0.000055948283,0.000042913154,0.000037017096,0.00013208856,0.000018252045,0.0021696184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964297,0.00006945924,0.000017612463,0.000049515693,0.00012833758,0.00009203793],"domain_scores_gemma":[0.99739397,0.0016505928,0.00034018228,0.0001421084,0.00031521815,0.00015796216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000670066,0.00024791906,0.00033365327,0.0017078349,0.00054113485,0.0013595452,0.00035547404,0.00038276854,0.0016587006],"category_scores_gemma":[0.0050493293,0.00018380332,0.00021692987,0.001105146,0.00082100835,0.002341959,0.00071024214,0.00079708954,0.00020556513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008148407,0.000113675196,0.008247906,0.00016857302,0.000039974097,0.00038804626,0.0005368725,0.031624045,0.035017468,0.8501961,0.0026433691,0.07020907],"study_design_scores_gemma":[0.00007848488,0.00046786177,0.00792591,0.00010585001,0.000050085528,0.0021886881,0.00034197394,0.31668648,0.031321496,0.6313431,0.009393976,0.00009611786],"about_ca_topic_score_codex":0.0004576792,"about_ca_topic_score_gemma":0.00027813623,"teacher_disagreement_score":0.0017078349,"about_ca_system_score_codex":0.0007373882,"about_ca_system_score_gemma":0.00035493376,"threshold_uncertainty_score":0.005548954},"labels":[],"label_agreement":null},{"id":"W2356387445","doi":"","title":"The Algorithm of High-Radix Transforms for Reed Solomon Codes Over Fermat Primes","year":2000,"lang":"en","type":"article","venue":"Wuhan University Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Radix (gastropod); Fast Fourier transform; Split-radix FFT algorithm; Arithmetic; Rader's FFT algorithm; Algorithm; Decoding methods; Code (set theory); Reed–Solomon error correction; Mathematics; Prime-factor FFT algorithm; Cooley–Tukey FFT algorithm; Fermat number; Computer science; Fermat's Last Theorem; Discrete mathematics; Linear code; Fourier transform; Block code; Fourier analysis; Fractional Fourier transform","score_opus":0.005408295875339046,"score_gpt":0.18868057816124098,"score_spread":0.18327228228590192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2356387445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.008151929,0.00032334714,0.98208,0.00023298216,0.00018436137,0.00010382856,0.000077561424,0.0011613972,0.007684593],"genre_scores_gemma":[0.10099983,0.0005855611,0.8857674,0.00022458959,0.00019654416,0.00020140626,0.0004727571,0.0004266545,0.011125316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994116,0.000119302866,0.000048064452,0.00008566871,0.000272955,0.00006252105],"domain_scores_gemma":[0.9994672,0.00022134655,0.000049465787,0.00011755414,0.00012636387,0.000018077024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006166679,0.00071474287,0.00045182245,0.0010898235,0.0006084838,0.0010353753,0.00073766155,0.00081336,0.00389908],"category_scores_gemma":[0.0021622726,0.0002977895,0.00061535893,0.0008519199,0.0012234556,0.0017789165,0.00090228027,0.0016198817,0.0037492227],"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.00029698084,0.00006287585,0.0005195266,0.0002706397,0.000044054996,0.00036120665,0.00047704525,0.018319838,0.048804205,0.33819047,0.010269042,0.5823841],"study_design_scores_gemma":[0.00023089293,0.0007210088,0.00086816825,0.0002035778,0.000076746735,0.0031389045,0.00019949884,0.23666875,0.20164354,0.40162235,0.15441105,0.00021553281],"about_ca_topic_score_codex":0.0004036785,"about_ca_topic_score_gemma":0.00044738452,"teacher_disagreement_score":0.00389908,"about_ca_system_score_codex":0.0005355789,"about_ca_system_score_gemma":0.0009286418,"threshold_uncertainty_score":0.013043702},"labels":[],"label_agreement":null},{"id":"W2372168189","doi":"","title":"On the XOR Branch Numbers of the Transformations About Modulo 2~n Addition and Modulo 2 Addition","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Modulo; Finite field; XOR gate; Cipher; Primitive root modulo n; Mathematics; Discrete mathematics; Computer science; Differential cryptanalysis; Field (mathematics); Cryptanalysis; Cryptography; Arithmetic; Algorithm; Pure mathematics; Logic gate","score_opus":0.015365844412023388,"score_gpt":0.18289789819338081,"score_spread":0.16753205378135744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2372168189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.32429495,0.0031068318,0.5470374,0.0012230733,0.0007066545,0.00011682891,0.00022951822,0.0002453595,0.12303943],"genre_scores_gemma":[0.88399434,0.002455042,0.09713436,0.00029637938,0.0005825088,0.00009233924,0.00017631853,0.000092127615,0.015176585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996358,0.00010070599,0.000025137006,0.00007425325,0.00011971662,0.00004434934],"domain_scores_gemma":[0.9994387,0.00027731832,0.00009134771,0.00005986754,0.00010222451,0.000030498859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041070816,0.00036291324,0.00022612025,0.0009206632,0.0005553076,0.00093211053,0.00024118174,0.000310424,0.0037689],"category_scores_gemma":[0.0019506968,0.000126345,0.0003009404,0.00084053766,0.0014346999,0.003132445,0.0006308702,0.0010732266,0.0006563613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012243634,0.00002422297,0.0005927304,0.00007570939,0.000006592991,0.00013567922,0.00025838008,0.006915715,0.009120981,0.9174688,0.0013452915,0.063933425],"study_design_scores_gemma":[0.000030161727,0.00019986712,0.00091986015,0.000073557516,0.000020256713,0.0006772834,0.00015316848,0.05805045,0.020471731,0.889269,0.030076545,0.00005814341],"about_ca_topic_score_codex":0.00028864937,"about_ca_topic_score_gemma":0.00027114584,"teacher_disagreement_score":0.0037689,"about_ca_system_score_codex":0.00042701737,"about_ca_system_score_gemma":0.0004107348,"threshold_uncertainty_score":0.0126081705},"labels":[],"label_agreement":null},{"id":"W2376869599","doi":"","title":"Research on the [56,28,12] Binary Codes with an Automorphism Order 7","year":2005,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Binary number; Equivalence (formal languages); Dual (grammatical number); Linear code; Block code; Order (exchange); Expander code; Automorphism; Binary code; Theoretical computer science; Discrete mathematics; Algorithm; Arithmetic; Mathematics; Decoding methods","score_opus":0.04079122127969027,"score_gpt":0.30921771762233136,"score_spread":0.2684264963426411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2376869599","genre_codex":"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.6869918,0.011920594,0.124803916,0.0025488483,0.0012835154,0.00014364062,0.0006094523,0.00023155012,0.1714667],"genre_scores_gemma":[0.9038564,0.008137914,0.052425932,0.00059000804,0.0005045928,0.00006528785,0.0009857923,0.00012108251,0.033312988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992731,0.00015010379,0.000055199092,0.00012851664,0.00027706407,0.00011603006],"domain_scores_gemma":[0.9980724,0.0006989653,0.0002967278,0.00031704607,0.00050478615,0.000110043606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006658432,0.00038428986,0.00041854783,0.0019668785,0.0008970739,0.00069063366,0.0002887961,0.00041364916,0.0039341156],"category_scores_gemma":[0.0028216024,0.00019508172,0.0005235107,0.0010904475,0.0012112459,0.0019715512,0.00063952414,0.0012637164,0.0009127451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020492548,0.00009151237,0.0030933106,0.00044166946,0.00004023391,0.00023748298,0.00077854714,0.0040697306,0.010714675,0.8423235,0.0033116983,0.13469271],"study_design_scores_gemma":[0.00004862193,0.00055384485,0.0060391757,0.00031511372,0.00011035332,0.002953211,0.00063780474,0.011889121,0.039238628,0.7340189,0.20405358,0.00014168066],"about_ca_topic_score_codex":0.000652772,"about_ca_topic_score_gemma":0.00059656444,"teacher_disagreement_score":0.0039341156,"about_ca_system_score_codex":0.000796372,"about_ca_system_score_gemma":0.0011180813,"threshold_uncertainty_score":0.013160944},"labels":[],"label_agreement":null},{"id":"W2382655367","doi":"","title":"Linear complexity of Whiteman-generalized cyclotomic sequence with order four","year":2011,"lang":"en","type":"article","venue":"Jisuanji yingyong yanjiu","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Alberta Paraplegic Foundation","funders":"","keywords":"Sequence (biology); Order (exchange); Computer science; Set (abstract data type); Class (philosophy); Algorithm; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence; Genetics; Biology","score_opus":0.146317956135932,"score_gpt":0.27790318012427695,"score_spread":0.13158522398834496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2382655367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9246225,0.00030458852,0.06398591,0.00043314256,0.000054330034,0.00004438104,0.0002203737,0.00010220142,0.01023263],"genre_scores_gemma":[0.9880397,0.00014490631,0.008632656,0.000059408096,0.000044346252,0.000031836793,0.00022018145,0.00001289392,0.0028140466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995285,0.00006666439,0.000033436932,0.00010054309,0.0001333291,0.00013747487],"domain_scores_gemma":[0.9990933,0.0003297811,0.00021875645,0.00011251374,0.00015042383,0.000095220275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020372609,0.00029391958,0.000340891,0.00086463586,0.000535279,0.0006900056,0.00027116342,0.00038597785,0.0020979154],"category_scores_gemma":[0.0011958526,0.00015068949,0.00033100048,0.0006091717,0.0007708748,0.0013048433,0.0005733206,0.0007959002,0.00019131452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009429751,0.000116655116,0.0067923414,0.00027343628,0.00005844407,0.0014371456,0.00089238066,0.06861433,0.10607839,0.73886305,0.0024602988,0.0734707],"study_design_scores_gemma":[0.00022120951,0.0008345852,0.008235168,0.00007410035,0.0000633942,0.0024828939,0.00037934078,0.24377568,0.096154824,0.62994593,0.017638708,0.00019409508],"about_ca_topic_score_codex":0.0008815747,"about_ca_topic_score_gemma":0.00072604977,"teacher_disagreement_score":0.0020979154,"about_ca_system_score_codex":0.00092693086,"about_ca_system_score_gemma":0.0009245983,"threshold_uncertainty_score":0.0070182085},"labels":[],"label_agreement":null},{"id":"W2392237044","doi":"10.1109/lcomm.2016.2540625","title":"A Secure Code Based Cryptosystem via Random Insertions, Deletions, and Errors","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cryptosystem; Hybrid cryptosystem; Goldwasser–Micali cryptosystem; Paillier cryptosystem; Computer science; Plaintext; Plaintext-aware encryption; Code word; Key encapsulation; Theoretical computer science; Key (lock); Public-key cryptography; Deterministic encryption; Threshold cryptosystem; Code (set theory); Cryptography; Key size; Decoding methods; Symmetric-key algorithm; Encryption; Algorithm; Computer security; Public key cryptosystem","score_opus":0.019223036240413736,"score_gpt":0.24071628676366347,"score_spread":0.22149325052324972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392237044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.053315643,0.0005794695,0.9387757,0.00071110204,0.00027361736,0.00014189289,0.00012113464,0.0007800277,0.00530146],"genre_scores_gemma":[0.7011445,0.00093967427,0.28919983,0.00028691426,0.00023493516,0.0002636509,0.00019229273,0.00018942637,0.0075487136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979563,0.00031201763,0.0001036202,0.00028655923,0.0011540806,0.00018739677],"domain_scores_gemma":[0.9976714,0.00080402754,0.00038124112,0.0006424992,0.00039476127,0.000106056614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009673467,0.00056125456,0.0006758313,0.000854991,0.0009329395,0.0012616364,0.0009031313,0.0010532321,0.0011913906],"category_scores_gemma":[0.0032787262,0.00031767835,0.00044145656,0.0009596495,0.00193096,0.0027566615,0.0016037212,0.0015136313,0.000605121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004910168,0.00013552592,0.00089700735,0.00034903645,0.000063475694,0.0009896022,0.0003387623,0.06516193,0.08641053,0.74943745,0.0031186317,0.09260699],"study_design_scores_gemma":[0.00032814953,0.0007471588,0.00058777025,0.00016310587,0.00014111518,0.0036109244,0.00010337044,0.5232189,0.2262555,0.19062878,0.0539485,0.0002667298],"about_ca_topic_score_codex":0.0004570063,"about_ca_topic_score_gemma":0.00030376212,"teacher_disagreement_score":0.0012616364,"about_ca_system_score_codex":0.0007410926,"about_ca_system_score_gemma":0.0017169775,"threshold_uncertainty_score":0.005377054},"labels":[],"label_agreement":null},{"id":"W2392885651","doi":"10.1016/j.ffa.2017.01.006","title":"A note on inverses of cyclotomic mapping permutation polynomials over finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Permutation (music); Finite field; Cyclotomic polynomial; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Polynomial","score_opus":0.02258834622883974,"score_gpt":0.2630967104058184,"score_spread":0.24050836417697866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392885651","genre_codex":"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.20269331,0.013651262,0.30060774,0.009108699,0.009642132,0.000117543656,0.0003919933,0.0006015177,0.46318585],"genre_scores_gemma":[0.8302307,0.012497027,0.0670929,0.002160101,0.006977714,0.000081842525,0.00038028945,0.00029822288,0.08028122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.000088775436,0.000026918931,0.0000982587,0.00015380049,0.00007783778],"domain_scores_gemma":[0.99880826,0.0007724199,0.00007211235,0.00015614221,0.000118824806,0.00007222591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073104067,0.00088226626,0.0006384106,0.0016106119,0.0012545593,0.0023004857,0.00067931117,0.001158142,0.005054955],"category_scores_gemma":[0.002974846,0.00041312192,0.0009604041,0.0015871003,0.0027569602,0.003655405,0.0015942613,0.004685432,0.0008685788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038256527,0.000025603462,0.00011937807,0.000052360232,0.000003736598,0.00017489016,0.00019459604,0.00080719223,0.0014089906,0.9804559,0.0025958896,0.014123275],"study_design_scores_gemma":[0.000008613849,0.000045329485,0.00019557151,0.000025727464,0.0000076111255,0.00042314935,0.000067087254,0.0028274774,0.001972806,0.97212124,0.022285283,0.000020159774],"about_ca_topic_score_codex":0.0006610895,"about_ca_topic_score_gemma":0.0005689055,"teacher_disagreement_score":0.005054955,"about_ca_system_score_codex":0.00083734165,"about_ca_system_score_gemma":0.0005942029,"threshold_uncertainty_score":0.016910493},"labels":[],"label_agreement":null},{"id":"W2393284108","doi":"","title":"The Decision of the Linearity for the Binary Image of One Special Quarter Code","year":2008,"lang":"en","type":"article","venue":"Journal of Kashgar Teachers College","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Linearity; Code (set theory); Image (mathematics); Binary number; Quarter (Canadian coin); Mathematics; Computer science; Algorithm; Arithmetic; Computer vision; Programming language; History; Physics; Set (abstract data type)","score_opus":0.022490469602254804,"score_gpt":0.24970726972771054,"score_spread":0.22721680012545573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393284108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.82563376,0.00021302175,0.14044261,0.002537181,0.000087609405,0.00007583784,0.00033899886,0.00016357386,0.03050747],"genre_scores_gemma":[0.9866796,0.00010003658,0.008436757,0.00019217512,0.00006996505,0.00003915412,0.00021508474,0.000027094975,0.004240067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989145,0.00016817749,0.00005577799,0.0002511895,0.0002083064,0.00040214765],"domain_scores_gemma":[0.99590284,0.0022865918,0.0004344269,0.00032928458,0.0006319916,0.00041492283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087455934,0.0002414042,0.00045811528,0.00055828807,0.0009065925,0.0022088995,0.00051956926,0.0009396099,0.0043240744],"category_scores_gemma":[0.0049715326,0.00032816757,0.00046745723,0.0003006966,0.0024643054,0.0028788229,0.0018285408,0.0022130504,0.00058516394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017026286,0.00014159747,0.0094402,0.00033604115,0.000043464548,0.0012556391,0.0013809364,0.0075514405,0.06480671,0.8710683,0.0027806212,0.03949241],"study_design_scores_gemma":[0.00022808342,0.00086262764,0.005767881,0.00013845229,0.00007022472,0.0025261645,0.0015457162,0.09810344,0.15023024,0.73353153,0.006777286,0.00021843595],"about_ca_topic_score_codex":0.00077090046,"about_ca_topic_score_gemma":0.00043114377,"teacher_disagreement_score":0.0043240744,"about_ca_system_score_codex":0.000911069,"about_ca_system_score_gemma":0.0013145136,"threshold_uncertainty_score":0.014465511},"labels":[],"label_agreement":null},{"id":"W2395020125","doi":"","title":"Quasi-Twisted Codes over F 11 .","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.02143000357924769,"score_gpt":0.2298188217612,"score_spread":0.20838881818195232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395020125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.55905914,0.0025543575,0.21845008,0.0032893606,0.0011754017,0.00011013519,0.0015214123,0.00070862914,0.21313144],"genre_scores_gemma":[0.955379,0.0007450755,0.013171755,0.00036036986,0.00028365338,0.000043811233,0.000409365,0.00009691771,0.029509986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898905,0.00024827357,0.000050386323,0.00012105347,0.00028130534,0.0003099397],"domain_scores_gemma":[0.9981343,0.0006621657,0.00026816406,0.0004234364,0.00025800898,0.0002539394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000906586,0.00046582185,0.0004292369,0.001289445,0.0010509243,0.001958434,0.0005107513,0.00075876294,0.009907746],"category_scores_gemma":[0.0029237655,0.0002446094,0.00047184672,0.001010144,0.0017796346,0.0031128132,0.0021663741,0.0017728659,0.00198195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013572577,0.00002287107,0.0005196404,0.00005105701,0.000008055375,0.00020700328,0.00021221273,0.0012173307,0.0020350139,0.97756267,0.0028025925,0.0152259115],"study_design_scores_gemma":[0.000029648343,0.000065283515,0.00072826946,0.00006235233,0.000015066804,0.0005504883,0.00014202758,0.0070927637,0.0031441713,0.9745156,0.013620048,0.00003423802],"about_ca_topic_score_codex":0.0006289698,"about_ca_topic_score_gemma":0.00061702094,"teacher_disagreement_score":0.009907746,"about_ca_system_score_codex":0.0009396623,"about_ca_system_score_gemma":0.00072550646,"threshold_uncertainty_score":0.033144712},"labels":[],"label_agreement":null},{"id":"W2395599031","doi":"","title":"De Bruijn Sequences Revisited.","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"De Bruijn sequence; Combinatorics; Sequence (biology); Alphabet; Mathematics; Order (exchange); Word (group theory); Word length; Integer (computer science); Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.03425965544637269,"score_gpt":0.23280256328710497,"score_spread":0.19854290784073228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395599031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.36367577,0.012514735,0.43667683,0.0063113053,0.0013727271,0.00030977247,0.0014391231,0.0006598806,0.17703979],"genre_scores_gemma":[0.8042226,0.0028411963,0.13903277,0.00091643276,0.000768068,0.00028145377,0.0008256241,0.0001995434,0.05091232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808466,0.0003659165,0.00014710946,0.00051832927,0.0006341788,0.00024988654],"domain_scores_gemma":[0.9963309,0.001786746,0.00043779516,0.00069914584,0.00053851213,0.00020693257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578759,0.00055029395,0.0005159321,0.0012441142,0.0019511953,0.0018161936,0.0007697718,0.0010780919,0.008693367],"category_scores_gemma":[0.0055426033,0.0004085308,0.00048039426,0.0018155099,0.0024226382,0.0046817004,0.0016205119,0.0018088794,0.001819006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013020614,0.000035270255,0.0006917937,0.00019430713,0.000007532322,0.00017992112,0.00043651712,0.002940998,0.006588742,0.9338905,0.0023175955,0.052586537],"study_design_scores_gemma":[0.000023003016,0.0000795021,0.0008415992,0.000098906676,0.00001249565,0.0012966391,0.00020424361,0.020128164,0.011719109,0.9119327,0.053636048,0.00002775146],"about_ca_topic_score_codex":0.0007898302,"about_ca_topic_score_gemma":0.0010973127,"teacher_disagreement_score":0.008693367,"about_ca_system_score_codex":0.0016734161,"about_ca_system_score_gemma":0.0010790295,"threshold_uncertainty_score":0.029082239},"labels":[],"label_agreement":null},{"id":"W2395673640","doi":"","title":"Feedback Number of Generalized Kautz Digraphs GK(2, n).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.008347526522832854,"score_gpt":0.2317459165341247,"score_spread":0.22339839001129186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395673640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8719683,0.0007382327,0.049154464,0.0024265253,0.00016340798,0.00010086687,0.0026105465,0.0007114829,0.07212612],"genre_scores_gemma":[0.9856631,0.00015143513,0.0041340254,0.00021067378,0.000055501147,0.00005741398,0.00046879437,0.000039820658,0.009219276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999514,0.00011777218,0.000018938435,0.00010808269,0.000104559906,0.00013665199],"domain_scores_gemma":[0.9975108,0.0013132296,0.00030958414,0.00023418452,0.00023846158,0.0003937993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044503657,0.00034772465,0.00054841413,0.00081519235,0.001224673,0.0017471727,0.0008329215,0.0008022945,0.010220365],"category_scores_gemma":[0.003527362,0.00024968825,0.00026496945,0.0005964621,0.001025737,0.0025913294,0.0009441629,0.0008978567,0.0008975014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000633436,0.000086167216,0.0016095471,0.00027322245,0.000032521883,0.00023021857,0.00033549644,0.013523867,0.007723132,0.9440507,0.010336764,0.02116475],"study_design_scores_gemma":[0.00015904335,0.000100122925,0.0018697962,0.00006790497,0.00004188398,0.00037993045,0.00018123332,0.04580529,0.005211139,0.9380034,0.008127281,0.000052988995],"about_ca_topic_score_codex":0.0012825845,"about_ca_topic_score_gemma":0.0023131894,"teacher_disagreement_score":0.010220365,"about_ca_system_score_codex":0.0015428894,"about_ca_system_score_gemma":0.0011272571,"threshold_uncertainty_score":0.034190595},"labels":[],"label_agreement":null},{"id":"W2397001187","doi":"","title":"Unsolvable Block-Transitive Automorphism Groups of 2-(v, 31, 1) Designs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Automorphism; Block (permutation group theory); Automorphism group; Pure mathematics; Combinatorics","score_opus":0.011688458019668297,"score_gpt":0.21346335886833115,"score_spread":0.20177490084866284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397001187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.69777673,0.0008866823,0.13936095,0.0013132896,0.00029839267,0.00024664594,0.001473728,0.0009504429,0.1576931],"genre_scores_gemma":[0.9525454,0.00022376757,0.019273484,0.00026689758,0.00006344423,0.00015480781,0.00080253015,0.00014739245,0.02652229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987264,0.0003810907,0.00007203743,0.00016232506,0.0003193395,0.00033879463],"domain_scores_gemma":[0.99760157,0.0009981825,0.00042853772,0.0005965509,0.00022545124,0.00014971099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070562074,0.0005620921,0.00048669797,0.0006783938,0.001309698,0.001998652,0.00068933854,0.0011038634,0.010524675],"category_scores_gemma":[0.003305563,0.0004937398,0.0006192715,0.0004765549,0.0013484451,0.002189088,0.0015438154,0.0011088516,0.002304705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004617787,0.000076808836,0.00077463663,0.00011236117,0.00002933373,0.00032173708,0.0005146292,0.0073831095,0.007946695,0.9561396,0.005361623,0.020877695],"study_design_scores_gemma":[0.000097911216,0.00008930813,0.000364932,0.000052083138,0.000023533563,0.00024399275,0.00015294921,0.015727064,0.0064904345,0.9673492,0.009379705,0.000028986695],"about_ca_topic_score_codex":0.0010924522,"about_ca_topic_score_gemma":0.0016315916,"teacher_disagreement_score":0.010524675,"about_ca_system_score_codex":0.0009410227,"about_ca_system_score_gemma":0.0013026213,"threshold_uncertainty_score":0.035208523},"labels":[],"label_agreement":null},{"id":"W2397286050","doi":"","title":"A New Construction of Multisender Authentication Codes with Simultaneous Model from Singular Symplectic Geometry over Finite Fields.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Geometry; Finite geometry; Pure mathematics; Discrete mathematics","score_opus":0.014897913783867345,"score_gpt":0.2313137153047273,"score_spread":0.21641580152085996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397286050","genre_codex":"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.22785681,0.00072821986,0.6739981,0.0019262196,0.0006494389,0.00024554567,0.00049500697,0.0013181278,0.09278256],"genre_scores_gemma":[0.9154501,0.00030217296,0.06814988,0.00035847002,0.00015698325,0.00012169797,0.0002748007,0.00018570959,0.015000203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914753,0.00017820323,0.00005260163,0.00015562934,0.00027828966,0.0001876985],"domain_scores_gemma":[0.9986199,0.00029288346,0.00016230762,0.00052971364,0.00015122039,0.00024402373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061192294,0.0005955552,0.0007005078,0.0010844516,0.0015091226,0.0018876655,0.001005777,0.0013150615,0.006185625],"category_scores_gemma":[0.0017932694,0.00049671374,0.0008980574,0.0007769083,0.0023266731,0.004009996,0.005431833,0.002359729,0.0015635852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037838967,0.000022557562,0.00015333027,0.000031300697,0.000006028475,0.00015587074,0.0001709603,0.0013114252,0.0022504404,0.989553,0.0013266245,0.004980733],"study_design_scores_gemma":[0.000038347112,0.0000691994,0.00014647907,0.00003724948,0.000018303537,0.0004874131,0.00010957318,0.02973077,0.004630287,0.95599526,0.008698343,0.000038845563],"about_ca_topic_score_codex":0.000348291,"about_ca_topic_score_gemma":0.00049235154,"teacher_disagreement_score":0.006185625,"about_ca_system_score_codex":0.00065873604,"about_ca_system_score_gemma":0.000959943,"threshold_uncertainty_score":0.020692945},"labels":[],"label_agreement":null},{"id":"W2397365124","doi":"","title":"On some important classes of row-cyclic array codes.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.01814946058551173,"score_gpt":0.24532041511584582,"score_spread":0.2271709545303341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397365124","genre_codex":"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.16322355,0.015632803,0.2761962,0.011550107,0.0020092996,0.00035467633,0.0031039114,0.0007239651,0.5272055],"genre_scores_gemma":[0.8239598,0.016386395,0.06359365,0.0057672714,0.004259589,0.00067261554,0.002854421,0.0004328602,0.08207341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987035,0.000294873,0.000057804038,0.00019842634,0.0004212641,0.0003241024],"domain_scores_gemma":[0.9959908,0.002354398,0.00042046414,0.00051862496,0.0004059915,0.00030978167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009858232,0.0009536325,0.00077518896,0.0037469245,0.0023233392,0.002964259,0.0011596002,0.0020334125,0.0136691285],"category_scores_gemma":[0.0066355728,0.00042444014,0.0009195923,0.003939078,0.0028548695,0.0049338792,0.0024483476,0.003442153,0.0026730723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019355111,0.000021113015,0.00017586137,0.000062585576,0.0000068450313,0.00009481401,0.00009841839,0.0011423449,0.00038947325,0.9818939,0.007259773,0.008835611],"study_design_scores_gemma":[0.000013480303,0.000015652106,0.00015663165,0.000047822326,0.0000068833256,0.00029987373,0.000050374354,0.00555745,0.00028954208,0.98043686,0.013110789,0.000014691726],"about_ca_topic_score_codex":0.0012491846,"about_ca_topic_score_gemma":0.0012791996,"teacher_disagreement_score":0.0136691285,"about_ca_system_score_codex":0.0015799128,"about_ca_system_score_gemma":0.0009885809,"threshold_uncertainty_score":0.04572779},"labels":[],"label_agreement":null},{"id":"W2398708703","doi":"","title":"A Class of Optimal Quaternary Codes.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Quaternary; Computer science; Artificial intelligence; Geology; Paleontology","score_opus":0.008590512753979802,"score_gpt":0.22932575634966754,"score_spread":0.22073524359568775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398708703","genre_codex":"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.3164453,0.008476161,0.330694,0.0039982405,0.0014081217,0.00033631158,0.0032973532,0.00085250125,0.3344921],"genre_scores_gemma":[0.9253769,0.0028456824,0.035208806,0.0010451977,0.000530184,0.00021163627,0.0012795244,0.0001631146,0.0333391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.00013226844,0.000045737608,0.00013018948,0.00030134793,0.00017740097],"domain_scores_gemma":[0.99874204,0.00035759277,0.00021701233,0.00027359772,0.0002606757,0.00014917328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062829244,0.00056558155,0.0007187949,0.0014819573,0.0010961499,0.0026014983,0.00054054975,0.0011706627,0.00783844],"category_scores_gemma":[0.0037076229,0.00026690733,0.00047726574,0.001279703,0.0012166105,0.0018395756,0.0013567655,0.0013427358,0.0017226993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008139409,0.000035501114,0.00037865978,0.00007152312,0.000010156196,0.00010433403,0.000059505703,0.0032170292,0.0021752722,0.96554714,0.006286995,0.022032524],"study_design_scores_gemma":[0.00005257427,0.00005805732,0.00045237565,0.000061924,0.000015354697,0.00061608833,0.00006444047,0.026277473,0.0021420086,0.9359624,0.034269836,0.00002741788],"about_ca_topic_score_codex":0.00047940412,"about_ca_topic_score_gemma":0.0004782596,"teacher_disagreement_score":0.00783844,"about_ca_system_score_codex":0.0010607435,"about_ca_system_score_gemma":0.0011556359,"threshold_uncertainty_score":0.02622217},"labels":[],"label_agreement":null},{"id":"W2399198710","doi":"","title":"A note on B-T unitals in PG(2, q 2 ).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00832955309734428,"score_gpt":0.23864861226549516,"score_spread":0.23031905916815087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399198710","genre_codex":"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.050466865,0.014488404,0.15991366,0.021223133,0.018701274,0.00013518616,0.00065091165,0.001826987,0.73259354],"genre_scores_gemma":[0.67811716,0.013619734,0.101352915,0.009719968,0.0063579176,0.0002979103,0.0005820065,0.00085351884,0.18909894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995578,0.00012244197,0.000029715626,0.00006122107,0.0001222716,0.00010654817],"domain_scores_gemma":[0.99930584,0.0003073124,0.00006021537,0.000119698445,0.00008532219,0.00012163399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054323016,0.0005944366,0.0006429974,0.001397498,0.0026793173,0.0026339542,0.0012409277,0.0015807925,0.019026097],"category_scores_gemma":[0.0020824652,0.00033801794,0.0006148911,0.0021029345,0.0022941772,0.00453226,0.0028319384,0.003719637,0.0057987724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010672962,0.000026266978,0.00012383911,0.00010972793,0.000007481406,0.00045758035,0.00022378839,0.0004583186,0.0012503813,0.92168295,0.036389194,0.039163742],"study_design_scores_gemma":[0.000019932415,0.000059963564,0.00027183376,0.00007013902,0.000010425264,0.0005459295,0.00015684144,0.0012804641,0.001699209,0.8459213,0.14993156,0.0000322961],"about_ca_topic_score_codex":0.0015839715,"about_ca_topic_score_gemma":0.0023150248,"teacher_disagreement_score":0.019026097,"about_ca_system_score_codex":0.0008489317,"about_ca_system_score_gemma":0.0006131431,"threshold_uncertainty_score":0.06364864},"labels":[],"label_agreement":null},{"id":"W2399318769","doi":"","title":"Partial permutation decoding of some binary codes from graphs on triples.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Binary number; Decoding methods; Discrete mathematics; Arithmetic; Algorithm","score_opus":0.014593370501067508,"score_gpt":0.2449338908685824,"score_spread":0.23034052036751487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399318769","genre_codex":"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.43943602,0.0010114524,0.46402964,0.002960607,0.00046858622,0.00029141747,0.0028815165,0.00100103,0.087919876],"genre_scores_gemma":[0.9296385,0.0004745161,0.050759826,0.00038717056,0.00015205867,0.00012846137,0.001320025,0.00023710229,0.016902402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991617,0.00024377454,0.00004534781,0.000111785586,0.00024131507,0.00019602783],"domain_scores_gemma":[0.9978568,0.0010572723,0.00020373733,0.0004156697,0.00033425746,0.00013222049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006262342,0.0004906207,0.00053199066,0.0008364963,0.0012583775,0.0016084082,0.00055672345,0.0010348448,0.0037660222],"category_scores_gemma":[0.00541142,0.00032258994,0.00064886996,0.0011595925,0.0011563743,0.001818382,0.0012798955,0.0014228908,0.000964821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002700652,0.000058681002,0.00071561313,0.00013124975,0.000030975043,0.0006170454,0.00043033023,0.015156275,0.008710631,0.9334016,0.008124139,0.032353412],"study_design_scores_gemma":[0.00003120464,0.00004955469,0.0004152445,0.000042986943,0.000021917718,0.00042540685,0.00011226863,0.071890496,0.009590582,0.91224784,0.0051414203,0.000030976746],"about_ca_topic_score_codex":0.0017502168,"about_ca_topic_score_gemma":0.001639265,"teacher_disagreement_score":0.0037660222,"about_ca_system_score_codex":0.0009217352,"about_ca_system_score_gemma":0.0013180388,"threshold_uncertainty_score":0.012598634},"labels":[],"label_agreement":null},{"id":"W2399524571","doi":"","title":"Cross recurrence relations for r-Lah numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Combinatorics","score_opus":0.01372081933889435,"score_gpt":0.2596190871288584,"score_spread":0.24589826778996404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399524571","genre_codex":"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.16367234,0.0070311646,0.3352685,0.0043992097,0.0019920205,0.0001635132,0.0011643957,0.0012794943,0.48502943],"genre_scores_gemma":[0.8870441,0.0019947393,0.041043047,0.0015186,0.0010952762,0.00020706175,0.00073464325,0.0003575984,0.06600493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990134,0.00018957669,0.000083093255,0.00019196325,0.00031547202,0.00020639163],"domain_scores_gemma":[0.99795306,0.00084925717,0.00031884795,0.00028259977,0.0004322426,0.00016408284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779296,0.0005764837,0.0004882784,0.003073277,0.0014491576,0.0028060072,0.0007008043,0.0009801824,0.017510928],"category_scores_gemma":[0.006348188,0.00032249952,0.0005653196,0.0017876024,0.0015224657,0.0045411293,0.0018866982,0.0021137292,0.0055488725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018685421,0.000009925125,0.00018264545,0.000033572294,0.000003964025,0.00007685727,0.00013682591,0.00036861596,0.00068536843,0.9842091,0.0037049253,0.010569499],"study_design_scores_gemma":[0.000009328285,0.000020848538,0.00027351896,0.000028367613,0.000008131388,0.00026011895,0.00006385696,0.004388758,0.0012765183,0.98127216,0.012376317,0.000022139417],"about_ca_topic_score_codex":0.0006918355,"about_ca_topic_score_gemma":0.0010495621,"teacher_disagreement_score":0.017510928,"about_ca_system_score_codex":0.0012461565,"about_ca_system_score_gemma":0.0005002555,"threshold_uncertainty_score":0.058579862},"labels":[],"label_agreement":null},{"id":"W2399684368","doi":"","title":"Some ternary codes invariant under the group M c L: 2.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ternary operation; Invariant (physics); Group (periodic table); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical physics; Physics; Computer science; Programming language; Quantum mechanics","score_opus":0.015866921290328014,"score_gpt":0.23044727431546969,"score_spread":0.21458035302514167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399684368","genre_codex":"empirical","genre_gemma":"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.59608805,0.0014792252,0.11210292,0.0034103016,0.00087876787,0.00022388693,0.0031002434,0.000914314,0.2818023],"genre_scores_gemma":[0.9514967,0.00031386648,0.01455973,0.00052173197,0.00027337178,0.0001506235,0.00085836934,0.00013207652,0.03169362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992805,0.00011710099,0.00004428515,0.00009183188,0.00022432682,0.0002419247],"domain_scores_gemma":[0.9987645,0.00042472244,0.00027662475,0.00016105002,0.00021863444,0.000154612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004470639,0.00045014283,0.00032624754,0.0015217048,0.0014569944,0.0022149708,0.00047247417,0.0011222161,0.009738256],"category_scores_gemma":[0.002091377,0.00022091114,0.0005074844,0.00097511587,0.001355993,0.0010807769,0.0012909214,0.0011388302,0.0018163534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020096092,0.00003953458,0.000471061,0.000060286715,0.000008973391,0.00039013263,0.00030103457,0.0014137168,0.003641718,0.971982,0.006676159,0.014814467],"study_design_scores_gemma":[0.000095568685,0.00006923345,0.0011473328,0.00006536901,0.000023439954,0.0006508836,0.00018977268,0.012850328,0.009268211,0.9466036,0.028978027,0.000058228066],"about_ca_topic_score_codex":0.0012394447,"about_ca_topic_score_gemma":0.0011032767,"teacher_disagreement_score":0.009738256,"about_ca_system_score_codex":0.0014829272,"about_ca_system_score_gemma":0.0011982853,"threshold_uncertainty_score":0.032577753},"labels":[],"label_agreement":null},{"id":"W2399866138","doi":"","title":"On the Nonexistence of q-ary Linear Codes Attaining the Griesmer Bound.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.017822214905014656,"score_gpt":0.2465012744620836,"score_spread":0.22867905955706896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399866138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4832756,0.0066193882,0.26922926,0.015927749,0.0008730245,0.00014172606,0.0010416252,0.0011218359,0.22176972],"genre_scores_gemma":[0.9599671,0.0017219123,0.025842084,0.0015660085,0.00046644246,0.00020019319,0.00037935143,0.00020249448,0.009654526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965822,0.00105982,0.00015881367,0.0005279818,0.0009357675,0.00073534425],"domain_scores_gemma":[0.9547454,0.03882629,0.0015589014,0.002603458,0.0011772346,0.0010887334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004164798,0.00068692653,0.0015292561,0.001771737,0.002851189,0.004594278,0.0019483226,0.003420717,0.0061058006],"category_scores_gemma":[0.04073566,0.0012099376,0.0008450236,0.0012961784,0.006183509,0.00934724,0.006191608,0.0062605864,0.0022581737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015555636,0.0000320247,0.00048068335,0.00008155303,0.000019768533,0.00016287109,0.0001975437,0.0029157978,0.0017916915,0.9856068,0.0038447443,0.004710931],"study_design_scores_gemma":[0.000037588467,0.000033390388,0.00017710138,0.000038992857,0.000011353479,0.0003027925,0.0000640949,0.0076078554,0.0012714566,0.98854953,0.0018817686,0.000024146442],"about_ca_topic_score_codex":0.0005162671,"about_ca_topic_score_gemma":0.00049685815,"teacher_disagreement_score":0.0061058006,"about_ca_system_score_codex":0.0010493386,"about_ca_system_score_gemma":0.001140294,"threshold_uncertainty_score":0.022025824},"labels":[],"label_agreement":null},{"id":"W2400913317","doi":"","title":"Polyadic codes of prime power length II.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Prime power; Power (physics); Discrete mathematics; Combinatorics; Physics","score_opus":0.006262531670610861,"score_gpt":0.2108940216835395,"score_spread":0.20463149001292863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400913317","genre_codex":"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.1790922,0.011584459,0.31049606,0.0073581557,0.002861002,0.00027276255,0.0037700366,0.0016737502,0.4828916],"genre_scores_gemma":[0.89669293,0.002942096,0.024292678,0.0011763374,0.00090095686,0.00020125469,0.0010129344,0.00020471722,0.07257624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856573,0.00026349927,0.00006882323,0.00025075127,0.00047264562,0.0003784881],"domain_scores_gemma":[0.9963554,0.0014883294,0.00046141614,0.00083529245,0.0004810637,0.0003784792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061064557,0.0005826459,0.000750358,0.0010803188,0.0017477277,0.0034098236,0.0006009097,0.001012219,0.012218131],"category_scores_gemma":[0.0056840447,0.0003140449,0.00039219763,0.0017609793,0.0019249218,0.0032321266,0.0021262395,0.0028983115,0.0039051531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014856279,0.00002870487,0.00029610848,0.000093850664,0.000008376473,0.00012158262,0.00017964188,0.0018293945,0.0018679596,0.9644413,0.013032397,0.017951977],"study_design_scores_gemma":[0.000037647056,0.000085270716,0.00054565165,0.00010755611,0.000019508509,0.00048351972,0.00015890987,0.009826832,0.0035589968,0.9272166,0.05791596,0.000043646825],"about_ca_topic_score_codex":0.0009404464,"about_ca_topic_score_gemma":0.0008110606,"teacher_disagreement_score":0.012218131,"about_ca_system_score_codex":0.0012309854,"about_ca_system_score_gemma":0.0013044091,"threshold_uncertainty_score":0.040873647},"labels":[],"label_agreement":null},{"id":"W2401164932","doi":"","title":"The Commuting Graph of the Quaternion Algebra over Residue Classes of Integers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternion; Residue (chemistry); Quaternion algebra; Graph; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Division algebra; Filtered algebra; Geometry; Chemistry; Organic chemistry","score_opus":0.00715967029032019,"score_gpt":0.2261953475328709,"score_spread":0.2190356772425507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401164932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.50677544,0.0021468147,0.14928204,0.003756898,0.0013896163,0.00012056851,0.001243906,0.00074581325,0.3345389],"genre_scores_gemma":[0.95050544,0.0008158362,0.012151891,0.0005545795,0.00045363477,0.000055697972,0.00048668258,0.0001975921,0.034778535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995622,0.000116947034,0.000020396186,0.00009213791,0.00011005074,0.00009821816],"domain_scores_gemma":[0.99919504,0.00023656929,0.00016475903,0.00010553137,0.00014676404,0.0001514276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048631008,0.00042164925,0.0005285411,0.0016471306,0.0013510294,0.0020882376,0.0006326516,0.00068718183,0.014014533],"category_scores_gemma":[0.0017574489,0.00024596794,0.00033856282,0.001055097,0.0017458309,0.003890452,0.00094538747,0.0012225668,0.0023303519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028752487,0.0000140739,0.0001490487,0.000018029072,0.00000351714,0.00006411128,0.00010960823,0.00029621783,0.00064175273,0.9905822,0.0019984199,0.0060941745],"study_design_scores_gemma":[0.000011156039,0.000012423689,0.00021486825,0.000009345636,0.0000036537529,0.00009458339,0.000070503294,0.001964843,0.0004768802,0.99154985,0.005583071,0.000008832917],"about_ca_topic_score_codex":0.0014404085,"about_ca_topic_score_gemma":0.0014973576,"teacher_disagreement_score":0.014014533,"about_ca_system_score_codex":0.0007514152,"about_ca_system_score_gemma":0.0006152513,"threshold_uncertainty_score":0.046883285},"labels":[],"label_agreement":null},{"id":"W2401383348","doi":"10.55016/ojs/cdm.v20i2.62715","title":"Reversed Dickson polynomials of the (k+1)-th kind over finite fields, II","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Finite field; Combinatorics; Permutation (music); Mathematics; Prime (order theory); Generalization; Polynomial; Algebraic number; Discrete mathematics; Physics","score_opus":0.007535830103252515,"score_gpt":0.26938227219524385,"score_spread":0.2618464420919913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401383348","genre_codex":"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.928141,0.0005505866,0.031813078,0.00055990205,0.00016942862,0.000024339703,0.00016619024,0.00009815282,0.038477324],"genre_scores_gemma":[0.9889538,0.0002606209,0.0048083803,0.0000628435,0.000060300015,0.000009971774,0.00010649977,0.000017869994,0.005719723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997634,0.0000368439,0.000009566058,0.000039445185,0.00004718108,0.00010352676],"domain_scores_gemma":[0.9996276,0.000115679686,0.000087784436,0.000058646372,0.000045742276,0.00006449913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002773757,0.00022166246,0.00016738009,0.0005948251,0.0005782204,0.00083171716,0.00027331512,0.00028439102,0.00275487],"category_scores_gemma":[0.0011868388,0.00013831804,0.00030433954,0.0004407825,0.000918296,0.00097479863,0.00044216745,0.0006460888,0.0003313197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024794077,0.000052669053,0.003254761,0.00008080046,0.000012017869,0.00041129888,0.0002321783,0.006931878,0.02241876,0.9460977,0.001933011,0.018326975],"study_design_scores_gemma":[0.00009019113,0.0005012762,0.010923666,0.0000771634,0.00005762783,0.0029809154,0.0006372152,0.11895357,0.057397366,0.77557015,0.03266273,0.00014808233],"about_ca_topic_score_codex":0.0010393471,"about_ca_topic_score_gemma":0.0009311599,"teacher_disagreement_score":0.00275487,"about_ca_system_score_codex":0.0007450496,"about_ca_system_score_gemma":0.00056570093,"threshold_uncertainty_score":0.009215951},"labels":[],"label_agreement":null},{"id":"W2401573281","doi":"","title":"SMT-LIB Sequences and Regular Expressions.","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.01387313523128612,"score_gpt":0.22706727035515772,"score_spread":0.21319413512387161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401573281","genre_codex":"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.06142148,0.0059717703,0.73486906,0.008295542,0.0012350535,0.00021502381,0.0025361443,0.0029227359,0.18253325],"genre_scores_gemma":[0.7066972,0.0035508168,0.21337593,0.0034872885,0.0012022039,0.00055476034,0.0034962432,0.00096435903,0.066671155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972051,0.0009783747,0.00022615437,0.00037356062,0.0008359079,0.00038094333],"domain_scores_gemma":[0.9958289,0.0018592513,0.00042309827,0.00104185,0.00064443384,0.00020244582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001962334,0.000612467,0.00068089366,0.0016541375,0.0012172514,0.0025840374,0.0011068617,0.0011313505,0.009011686],"category_scores_gemma":[0.009710751,0.00040817657,0.0006347044,0.002086967,0.0023084558,0.0050975834,0.0026362739,0.0033677055,0.0046460247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012039853,0.000023945715,0.0002385631,0.00008461712,0.000009595588,0.00010115211,0.0001563203,0.0013261905,0.000993502,0.9592448,0.007713575,0.029987285],"study_design_scores_gemma":[0.000016090886,0.000030245286,0.00010403022,0.000064579974,0.000008316272,0.00021894241,0.00005208796,0.0072054486,0.0019508553,0.9714605,0.018873213,0.000015634496],"about_ca_topic_score_codex":0.0006894026,"about_ca_topic_score_gemma":0.0008781562,"teacher_disagreement_score":0.009011686,"about_ca_system_score_codex":0.0014446712,"about_ca_system_score_gemma":0.001534964,"threshold_uncertainty_score":0.030147076},"labels":[],"label_agreement":null},{"id":"W2401651790","doi":"","title":"Three Constructions of Authentication Codes from Power Function over Finite Fields with Perfect Secrecy.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Secrecy; Mathematics; Finite field; Function (biology); Authentication (law); Power (physics); Discrete mathematics; Computer security; Computer science; Physics; Quantum mechanics; Cell biology","score_opus":0.008987900367935085,"score_gpt":0.21028665324216422,"score_spread":0.20129875287422913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401651790","genre_codex":"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.058600597,0.0016873559,0.83431345,0.0050692344,0.0008383943,0.00061122584,0.00077209837,0.0020756375,0.096032016],"genre_scores_gemma":[0.6610909,0.001538066,0.30345523,0.0011110104,0.00038436305,0.0006640812,0.000783549,0.0004421921,0.030530619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969131,0.0008401564,0.00023395248,0.00026303207,0.0010231222,0.00072657136],"domain_scores_gemma":[0.99153113,0.003231524,0.0006014217,0.0030414837,0.00087219535,0.00072225864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031022087,0.0012225064,0.0011199734,0.002140856,0.0031257921,0.005062332,0.0023353603,0.0033851087,0.007924487],"category_scores_gemma":[0.011674437,0.0007222091,0.002367341,0.0025256851,0.005283286,0.006462005,0.0084857,0.0038259951,0.0030435638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009884552,0.000051277002,0.00028589243,0.00010702364,0.000017625998,0.00015392632,0.0003489975,0.0026397419,0.0011369158,0.97531134,0.002940882,0.016907515],"study_design_scores_gemma":[0.00006999009,0.00008477497,0.00021622027,0.00015321586,0.000054818418,0.0007245232,0.00017238747,0.024348754,0.007881843,0.9461474,0.020054407,0.000091583206],"about_ca_topic_score_codex":0.00080946815,"about_ca_topic_score_gemma":0.0009124476,"teacher_disagreement_score":0.007924487,"about_ca_system_score_codex":0.002516239,"about_ca_system_score_gemma":0.0032617983,"threshold_uncertainty_score":0.02651006},"labels":[],"label_agreement":null},{"id":"W2402289345","doi":"","title":"Lower bounds for quaternary covering codes.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternary; Combinatorics; Geology; Paleontology","score_opus":0.023112464159223516,"score_gpt":0.23306696475913471,"score_spread":0.2099545005999112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402289345","genre_codex":"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.10799076,0.02477089,0.44599038,0.013085319,0.0028883573,0.00028171705,0.004602503,0.001968478,0.3984216],"genre_scores_gemma":[0.84317523,0.014385495,0.08797739,0.0033318389,0.0025953585,0.00080566626,0.004437508,0.0010698168,0.042221677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966305,0.0006315433,0.00014020628,0.00033284308,0.0013996802,0.00086525216],"domain_scores_gemma":[0.98404074,0.010759433,0.00081447244,0.0019250215,0.0016638372,0.00079647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031892555,0.0023369507,0.0017354252,0.0050038537,0.0026167973,0.0067846477,0.0026738758,0.0023090753,0.018355077],"category_scores_gemma":[0.024251271,0.00076734176,0.0012053383,0.005347771,0.002706731,0.008168941,0.0054970896,0.005279696,0.0061488408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019752234,0.000086457025,0.0006466986,0.00033285824,0.00004172583,0.000120359,0.00027045576,0.014245868,0.0022800355,0.91988117,0.026179798,0.035717074],"study_design_scores_gemma":[0.00002798957,0.000052092106,0.00035696235,0.00019111372,0.00004501846,0.00027515285,0.00008376656,0.04089577,0.002022364,0.9372853,0.018725356,0.000039033865],"about_ca_topic_score_codex":0.0015838223,"about_ca_topic_score_gemma":0.0024762119,"teacher_disagreement_score":0.018355077,"about_ca_system_score_codex":0.004729745,"about_ca_system_score_gemma":0.0022102862,"threshold_uncertainty_score":0.06140381},"labels":[],"label_agreement":null},{"id":"W2402809063","doi":"","title":"Cyclic and Negacyclic codes of length 2 m over finite fields.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017466509688733475,"score_gpt":0.2408639349457849,"score_spread":0.22339742525705142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402809063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.70435786,0.004639206,0.07894668,0.00535137,0.00068580185,0.00014072309,0.0017400857,0.00043210865,0.20370607],"genre_scores_gemma":[0.9740074,0.00061667856,0.00720707,0.00034608174,0.0003397446,0.00006115106,0.00038631042,0.000040048115,0.01699552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989367,0.00028017227,0.000059241276,0.00016341839,0.00029963764,0.0002609486],"domain_scores_gemma":[0.99476385,0.0028352588,0.00080092094,0.0007898879,0.00044057856,0.00036955017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007877537,0.0004162228,0.00050078606,0.0012144048,0.001229356,0.0017133378,0.0006032978,0.0010987697,0.006368399],"category_scores_gemma":[0.006569479,0.0003418175,0.00032948016,0.0010740351,0.0021649327,0.0021460513,0.0016858034,0.0013744556,0.00081217114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003291037,0.00007854171,0.0016943932,0.00010327263,0.00001525481,0.0006033858,0.00039132524,0.0061381403,0.0037385253,0.96357507,0.0064883544,0.016844628],"study_design_scores_gemma":[0.00007913768,0.00011012282,0.0016522937,0.000102364604,0.000019556834,0.00087737426,0.00020037468,0.02232593,0.003616959,0.95484596,0.016122123,0.0000478896],"about_ca_topic_score_codex":0.0012282904,"about_ca_topic_score_gemma":0.0018268027,"teacher_disagreement_score":0.006368399,"about_ca_system_score_codex":0.0011712963,"about_ca_system_score_gemma":0.0016479329,"threshold_uncertainty_score":0.021304429},"labels":[],"label_agreement":null},{"id":"W2402992158","doi":"","title":"Decoding of Blockwise-Burst Errors in Row-Cyclic Array Codes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Burst error; Algorithm; Arithmetic","score_opus":0.010168663790176925,"score_gpt":0.22999640153959613,"score_spread":0.21982773774941922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402992158","genre_codex":"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.23320764,0.0018141906,0.7373224,0.0019498044,0.00048395808,0.00012414702,0.00095428835,0.0007962944,0.02334738],"genre_scores_gemma":[0.8971248,0.0012043309,0.0813433,0.0004911571,0.00025918963,0.00014576832,0.0008507425,0.00016427808,0.018416338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845815,0.00057471206,0.00009360236,0.00012811874,0.00049520837,0.0002502348],"domain_scores_gemma":[0.9937475,0.0037258489,0.00074819184,0.00088060106,0.0007376692,0.0001601897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011844649,0.0006247158,0.0007025767,0.000775289,0.0005710685,0.0015980827,0.00075717206,0.0012731319,0.0025309825],"category_scores_gemma":[0.010202677,0.0004192099,0.00030025002,0.0011600013,0.0010768074,0.0020591277,0.0018469002,0.0012027685,0.0011842902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011219524,0.000099007884,0.0030714257,0.00034472306,0.000089058034,0.00067805464,0.0005271379,0.121659,0.029624185,0.73254085,0.008974682,0.10126985],"study_design_scores_gemma":[0.00006841525,0.00012951433,0.00058747275,0.00011313973,0.000028722901,0.0004720841,0.00012830208,0.49800557,0.016026895,0.4801934,0.00419937,0.000047130878],"about_ca_topic_score_codex":0.0009884293,"about_ca_topic_score_gemma":0.0015708429,"teacher_disagreement_score":0.0025309825,"about_ca_system_score_codex":0.00080944184,"about_ca_system_score_gemma":0.0014713395,"threshold_uncertainty_score":0.008467019},"labels":[],"label_agreement":null},{"id":"W2404051240","doi":"","title":"A New Construction of Multisender Authentication Codes from Symplectic Geometry over Finite Fields.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Authentication (law); Geometry; Finite geometry; Pure mathematics; Discrete mathematics; Computer science; Computer security","score_opus":0.012724433974006313,"score_gpt":0.2380994169142365,"score_spread":0.22537498294023017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404051240","genre_codex":"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.19365354,0.001145215,0.7131717,0.0023518072,0.0009838216,0.00026860568,0.00065111247,0.0012619371,0.0865123],"genre_scores_gemma":[0.87283283,0.00063129124,0.104290076,0.0005114759,0.00030285137,0.00017056604,0.00042278593,0.00024154328,0.020596476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991241,0.00019223936,0.000061511055,0.00014687376,0.0003210114,0.00015434335],"domain_scores_gemma":[0.9981394,0.0005243524,0.00021053325,0.00065237546,0.00020279597,0.00027066565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006977112,0.0005413899,0.0006684331,0.0013771594,0.0013386938,0.0017399739,0.00093457784,0.0011440841,0.007341749],"category_scores_gemma":[0.0023923728,0.0004557797,0.0007034819,0.0010000255,0.002171278,0.0039676465,0.0054993164,0.0024720586,0.0018873195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000509379,0.00002883068,0.00019332048,0.000055428194,0.000006887143,0.00018072648,0.00021281016,0.001554838,0.0030970196,0.9796998,0.0022673183,0.01265213],"study_design_scores_gemma":[0.000044393404,0.00007826018,0.00021596502,0.000048291546,0.000015158887,0.00062840624,0.00009529264,0.022242146,0.0048153563,0.95684147,0.014932984,0.000042353655],"about_ca_topic_score_codex":0.00020383742,"about_ca_topic_score_gemma":0.0003546217,"teacher_disagreement_score":0.007341749,"about_ca_system_score_codex":0.0006021033,"about_ca_system_score_gemma":0.00078478706,"threshold_uncertainty_score":0.02456057},"labels":[],"label_agreement":null},{"id":"W2404171455","doi":"","title":"Codes from embeddings of the strong product of triangular graphs and K 2 and certain induced subgraphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.013755864142924078,"score_gpt":0.23026023959278832,"score_spread":0.21650437544986426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404171455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.72130084,0.00074456923,0.18137248,0.0014422053,0.00025465965,0.00010473986,0.0019253762,0.0006536678,0.0922015],"genre_scores_gemma":[0.9712994,0.00023267038,0.0151485065,0.0002088255,0.00009353864,0.000061138606,0.0010263553,0.000103086386,0.011826433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955124,0.0001018458,0.000026900498,0.000089394845,0.000121923105,0.00010865825],"domain_scores_gemma":[0.9979522,0.0008631618,0.0004611795,0.0003444509,0.00019710592,0.00018173891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025113625,0.00041119233,0.00028519146,0.0006557991,0.00072577444,0.0015003906,0.0005969154,0.0009329057,0.006007359],"category_scores_gemma":[0.00287883,0.00030411303,0.00043149287,0.00079067284,0.0010890943,0.0023384797,0.0017233668,0.0012625878,0.0007780044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024963054,0.000046420024,0.0010260191,0.000101882375,0.00001742548,0.0003602159,0.0005095999,0.008428349,0.004687369,0.96285594,0.00563134,0.016085848],"study_design_scores_gemma":[0.000035358913,0.000040447325,0.00075826043,0.00003304654,0.000014944546,0.00028931512,0.00017810236,0.025230514,0.0030795452,0.96480477,0.005511044,0.000024653775],"about_ca_topic_score_codex":0.001250316,"about_ca_topic_score_gemma":0.0018336689,"teacher_disagreement_score":0.006007359,"about_ca_system_score_codex":0.0006488953,"about_ca_system_score_gemma":0.0004977403,"threshold_uncertainty_score":0.02009666},"labels":[],"label_agreement":null},{"id":"W2404868863","doi":"","title":"Self-dual Codes and Cyclic Codes over F p + vF p .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Linguistics; Philosophy","score_opus":0.006912133094755612,"score_gpt":0.2196881174003381,"score_spread":0.2127759843055825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404868863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5634988,0.005310616,0.14704266,0.004501844,0.0009546659,0.00008624231,0.0008890834,0.00034887285,0.27736717],"genre_scores_gemma":[0.96050304,0.0012931334,0.010265193,0.0003982457,0.0005501716,0.00004496148,0.00034135027,0.00005707738,0.026546752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992557,0.00018811542,0.000035474743,0.00009871204,0.0002442019,0.00017771371],"domain_scores_gemma":[0.99841833,0.00061087136,0.00034696236,0.00022840116,0.00020583972,0.00018966063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053575984,0.00041903486,0.00036374698,0.0020881789,0.0011294311,0.0021511589,0.0005263717,0.000975218,0.005726124],"category_scores_gemma":[0.0026577534,0.00027603604,0.00046367594,0.001315436,0.0020464796,0.0026758781,0.0022150245,0.0015571143,0.00095197896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003987859,0.000014604081,0.00024628997,0.000028268501,0.0000044351905,0.0001227861,0.000102030295,0.0006694923,0.00067349273,0.9908262,0.0014252425,0.0058471365],"study_design_scores_gemma":[0.000014026035,0.0000191094,0.00033532895,0.000029621277,0.000006323597,0.00040901324,0.000085814245,0.005030539,0.00091355195,0.9858133,0.0073280097,0.000015290872],"about_ca_topic_score_codex":0.0009062868,"about_ca_topic_score_gemma":0.00082642375,"teacher_disagreement_score":0.005726124,"about_ca_system_score_codex":0.0009865974,"about_ca_system_score_gemma":0.0007660091,"threshold_uncertainty_score":0.0191558},"labels":[],"label_agreement":null},{"id":"W2404878880","doi":"10.48550/arxiv.1212.3849","title":"Every locally characterized affine-invariant property is testable","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Affine transformation; Invariant (physics); Bounded function; Discrete mathematics; Linear subspace; Property testing; Combinatorics; Inverse; Pure mathematics","score_opus":0.05273397533382641,"score_gpt":0.16332131999734845,"score_spread":0.11058734466352203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404878880","genre_codex":"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.71445817,0.00019883491,0.27004373,0.0017431933,0.000056522593,0.00015050455,0.001191237,0.0021470382,0.010010665],"genre_scores_gemma":[0.9877093,0.000048814913,0.010474192,0.00014490524,0.000037639238,0.00006903677,0.00055303524,0.000063080464,0.00090003107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959668,0.00044187554,0.00022570752,0.0015162705,0.0010888663,0.0007605427],"domain_scores_gemma":[0.97018653,0.019550208,0.00272716,0.0048516328,0.0015308423,0.0011537174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017931209,0.00056641124,0.0010437558,0.0006821563,0.00091515196,0.0024472054,0.0013261865,0.0010083282,0.0031602506],"category_scores_gemma":[0.016617356,0.000345726,0.0014483795,0.0008604328,0.005043717,0.0060849576,0.00245489,0.0025117097,0.00049270457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030804465,0.00072673894,0.04767615,0.00071292865,0.00042004103,0.0024641103,0.0026726755,0.102047354,0.102066524,0.6176834,0.0052792206,0.115170486],"study_design_scores_gemma":[0.00030619287,0.0009373059,0.0069422447,0.000060290648,0.0002112339,0.0013903511,0.00065944437,0.18709326,0.09368157,0.7024722,0.006088696,0.00015715051],"about_ca_topic_score_codex":0.00097566645,"about_ca_topic_score_gemma":0.0005861396,"teacher_disagreement_score":0.0031602506,"about_ca_system_score_codex":0.0017949509,"about_ca_system_score_gemma":0.0013456439,"threshold_uncertainty_score":0.013023317},"labels":[],"label_agreement":null},{"id":"W2405745185","doi":"","title":"A self-orthogonal doubly-even code invariant under M c L.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Combinatorics; Pure mathematics; Mathematical physics","score_opus":0.01297457008147015,"score_gpt":0.23292094683837236,"score_spread":0.2199463767569022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405745185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7689699,0.00051938486,0.083076745,0.0018652548,0.0007352877,0.00009128929,0.0012291523,0.00084136985,0.1426716],"genre_scores_gemma":[0.9793128,0.000102753,0.0072024018,0.0003059224,0.00011077768,0.000029867688,0.00030480095,0.000065886714,0.012564817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.00005182255,0.000017422746,0.000079079124,0.0001302748,0.00014178343],"domain_scores_gemma":[0.99910873,0.00020215756,0.0001996934,0.00017766588,0.00014238383,0.00016935947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023373569,0.0002772559,0.0002591187,0.0007843482,0.00096539897,0.001252162,0.00037965682,0.00080136163,0.004191851],"category_scores_gemma":[0.001195868,0.00014319363,0.00029698142,0.00045547044,0.0009966603,0.0008504458,0.0014808289,0.00074040226,0.0011146915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004109356,0.00011085261,0.0019075547,0.000084828775,0.000020790721,0.0015432949,0.00040728608,0.002286075,0.025823569,0.92723185,0.009078729,0.031094247],"study_design_scores_gemma":[0.00017785252,0.00025592255,0.0036986484,0.000097533055,0.000052859814,0.002833327,0.00032587114,0.037257534,0.039469287,0.87948567,0.03621554,0.00012990902],"about_ca_topic_score_codex":0.00066339504,"about_ca_topic_score_gemma":0.0005700296,"teacher_disagreement_score":0.004191851,"about_ca_system_score_codex":0.000511284,"about_ca_system_score_gemma":0.00087595,"threshold_uncertainty_score":0.014023125},"labels":[],"label_agreement":null},{"id":"W2405774736","doi":"","title":"The digraphs from finite fields.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Pure mathematics; Combinatorics","score_opus":0.017489910646369483,"score_gpt":0.20540920711880778,"score_spread":0.1879192964724383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405774736","genre_codex":"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.10874925,0.015770528,0.3551097,0.014411819,0.001722643,0.00017624383,0.0043692067,0.0009286884,0.49876198],"genre_scores_gemma":[0.7920356,0.010590785,0.06342013,0.0029868635,0.0013254941,0.00030137107,0.0030247301,0.0003657239,0.12594925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993849,0.00020124306,0.0000436003,0.00013940908,0.00013137025,0.00009941318],"domain_scores_gemma":[0.99809116,0.0010230228,0.00017036586,0.00033228096,0.00018561666,0.00019756398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006223667,0.0005909867,0.00066513,0.0027374574,0.002096237,0.003493891,0.0008192612,0.001225331,0.014592825],"category_scores_gemma":[0.003736714,0.0005295756,0.00057196297,0.00220731,0.0023486107,0.008488229,0.0026827394,0.0028340816,0.0034216582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009692863,0.0000063753005,0.0000504739,0.000033179436,0.0000029804105,0.000034973316,0.000071132716,0.00026356595,0.00011811006,0.9904522,0.002851305,0.0061059706],"study_design_scores_gemma":[0.000004686826,0.000003388958,0.000051827723,0.000021219928,0.0000027454278,0.00007502226,0.000026681755,0.0006225466,0.000110934845,0.98593485,0.013141577,0.000004562921],"about_ca_topic_score_codex":0.0011062435,"about_ca_topic_score_gemma":0.0013201087,"teacher_disagreement_score":0.014592825,"about_ca_system_score_codex":0.0016630889,"about_ca_system_score_gemma":0.00096080545,"threshold_uncertainty_score":0.048817873},"labels":[],"label_agreement":null},{"id":"W2406073954","doi":"","title":"Lattices Generated by Subspaces under Symplectic Group over a Finite Field.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Symplectic geometry; Mathematics; Pure mathematics; Group (periodic table); Symplectic group; Field (mathematics); Finite field; Combinatorics; Physics; Quantum mechanics","score_opus":0.008412945792830077,"score_gpt":0.23048592114800145,"score_spread":0.22207297535517137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406073954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.77720606,0.0010599527,0.0934733,0.0027563581,0.00038457775,0.00011810155,0.000991196,0.00038226933,0.12362824],"genre_scores_gemma":[0.97424805,0.00031945025,0.009796989,0.00017409003,0.00028847903,0.00005785829,0.00038977605,0.00006132538,0.014663907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989592,0.0003187548,0.00005269981,0.00011647647,0.00030319704,0.0002496727],"domain_scores_gemma":[0.998365,0.00054937147,0.0003499362,0.00018577598,0.00016198601,0.00038794032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007933321,0.00036559784,0.0005069437,0.0013875344,0.0013223422,0.0023245402,0.00056270376,0.0004970168,0.0076836613],"category_scores_gemma":[0.0017153706,0.00029577178,0.00052484515,0.00077698386,0.002206243,0.0035710502,0.0024030246,0.0013080885,0.001119918],"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.00011041306,0.00003099298,0.00037722645,0.000029963088,0.000007696353,0.00016020269,0.00031575444,0.00088785536,0.0014730048,0.9904975,0.0013593595,0.0047499207],"study_design_scores_gemma":[0.00006462897,0.00005590702,0.00037248465,0.000022803777,0.000008261659,0.00031691193,0.00026325515,0.0056168465,0.0017956877,0.98548,0.005984524,0.000018527391],"about_ca_topic_score_codex":0.0004380324,"about_ca_topic_score_gemma":0.0004643168,"teacher_disagreement_score":0.0076836613,"about_ca_system_score_codex":0.0007656847,"about_ca_system_score_gemma":0.0008128285,"threshold_uncertainty_score":0.025704443},"labels":[],"label_agreement":null},{"id":"W2406442302","doi":"","title":"Two Constructions of Multireceiver Authentication Codes from Symplectic Geometry over Finite Fields.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Geometry; Pure mathematics; Discrete mathematics","score_opus":0.018435253564025006,"score_gpt":0.23745136593627753,"score_spread":0.21901611237225252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406442302","genre_codex":"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.096826956,0.0017814878,0.78319204,0.0044467407,0.0012651624,0.0004339618,0.00075707235,0.0012650907,0.11003148],"genre_scores_gemma":[0.7777076,0.0011569217,0.18188776,0.00092939823,0.00038996933,0.0003723076,0.00063276297,0.0003637806,0.0365596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826163,0.00045024036,0.000131315,0.00023241283,0.00056299695,0.00036147996],"domain_scores_gemma":[0.99602723,0.0012046596,0.00036693312,0.0015525722,0.0003950665,0.00045366836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723452,0.00077933446,0.00080413494,0.0017904864,0.0017312684,0.002848796,0.0014393369,0.002336466,0.009059878],"category_scores_gemma":[0.0050912197,0.00065325847,0.00104599,0.0013964556,0.0030206696,0.005358381,0.00680138,0.0036148364,0.0026250875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043364864,0.000031892654,0.00012715472,0.000046209847,0.0000054324,0.00014225546,0.0002888347,0.0009639913,0.0010425549,0.98561376,0.0019909753,0.009703683],"study_design_scores_gemma":[0.00005253113,0.00007063007,0.00021708795,0.00008063708,0.000016809567,0.0007023565,0.00017171711,0.015525916,0.004690507,0.9622396,0.016168535,0.00006354533],"about_ca_topic_score_codex":0.00031809052,"about_ca_topic_score_gemma":0.0005450639,"teacher_disagreement_score":0.009059878,"about_ca_system_score_codex":0.0010705374,"about_ca_system_score_gemma":0.0013454395,"threshold_uncertainty_score":0.030308306},"labels":[],"label_agreement":null},{"id":"W2406936419","doi":"","title":"External Difference Families over GF(q 2k ).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.00790448847446348,"score_gpt":0.21598888469067273,"score_spread":0.20808439621620925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406936419","genre_codex":"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.34144706,0.001713297,0.39114112,0.003170936,0.0008046278,0.00025331273,0.0023427093,0.001863435,0.2572635],"genre_scores_gemma":[0.91466165,0.0007358415,0.034665015,0.0007054925,0.0003053737,0.00020720396,0.0013410328,0.00031388478,0.04706447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983908,0.00043689122,0.00008933748,0.00024782927,0.00045521915,0.0003798844],"domain_scores_gemma":[0.9975389,0.0009905157,0.00029531555,0.0006522778,0.00033911286,0.0001838857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134087,0.00055913744,0.0006360327,0.001521202,0.0014341049,0.0019759068,0.0008096625,0.0006310669,0.02100558],"category_scores_gemma":[0.004229109,0.0002874934,0.00057879003,0.001572409,0.0015767268,0.0037780632,0.002924348,0.0016458797,0.005075607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008086387,0.000135516,0.001420618,0.00020865828,0.000034530636,0.0003942174,0.00038645952,0.0033087535,0.008493632,0.9190125,0.009140599,0.0566559],"study_design_scores_gemma":[0.00029060716,0.00021865875,0.0012911225,0.00024485166,0.00006650672,0.0017426673,0.00037027898,0.017252803,0.03074036,0.87246627,0.07521735,0.000098665376],"about_ca_topic_score_codex":0.00031045923,"about_ca_topic_score_gemma":0.0003771488,"teacher_disagreement_score":0.02100558,"about_ca_system_score_codex":0.000992799,"about_ca_system_score_gemma":0.00079695653,"threshold_uncertainty_score":0.07027066},"labels":[],"label_agreement":null},{"id":"W2406936546","doi":"","title":"On Vertex-Robust Identifying Codes of Level Three.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.03658330796721529,"score_gpt":0.2541426917889521,"score_spread":0.2175593838217368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406936546","genre_codex":"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.35772085,0.0016971224,0.43599412,0.0026421992,0.0005335152,0.00013745675,0.0012523931,0.0012083263,0.19881403],"genre_scores_gemma":[0.9313839,0.0008414347,0.042994644,0.00067749043,0.00022761253,0.00010635295,0.00069033314,0.00026659574,0.022811713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870574,0.00032255985,0.000059957743,0.00014819375,0.0004513725,0.00031215756],"domain_scores_gemma":[0.99511355,0.0023421056,0.00072148634,0.0010143962,0.00047983017,0.00032860218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008865492,0.00054823275,0.0006239955,0.0016139223,0.0014063811,0.0021110384,0.0010008767,0.0013647928,0.005424226],"category_scores_gemma":[0.006961887,0.0003421463,0.0005793262,0.0013206803,0.0025443921,0.0030395298,0.003114647,0.0025226658,0.0019891378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007041584,0.000017719962,0.00030934287,0.000036114743,0.0000071987147,0.00008921206,0.00012110609,0.0051382696,0.0011029165,0.98096704,0.0026631427,0.009477466],"study_design_scores_gemma":[0.000009510284,0.000018138539,0.00014169572,0.000025643627,0.000006198111,0.00010907687,0.00005323384,0.016797027,0.0010793998,0.9790055,0.0027379184,0.000016582686],"about_ca_topic_score_codex":0.0012153919,"about_ca_topic_score_gemma":0.0011223038,"teacher_disagreement_score":0.005424226,"about_ca_system_score_codex":0.0010880926,"about_ca_system_score_gemma":0.0009019356,"threshold_uncertainty_score":0.01814586},"labels":[],"label_agreement":null},{"id":"W2407306632","doi":"","title":"Some results on transverse Steiner quadruple systems of type g t u 1 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Transverse plane; Combinatorics; Mathematical analysis; Pure mathematics; Structural engineering; Geology; Engineering","score_opus":0.029344809867676774,"score_gpt":0.24558135880408888,"score_spread":0.21623654893641212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407306632","genre_codex":"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.33842358,0.0029397223,0.1405901,0.003108066,0.0014911334,0.00013521806,0.0020866387,0.0005377749,0.5106877],"genre_scores_gemma":[0.9035871,0.002360164,0.028540157,0.00092294184,0.00075617665,0.00013070303,0.0018896614,0.00021531456,0.06159773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967027,0.0000777213,0.000023216428,0.000050969415,0.000091932015,0.000085885025],"domain_scores_gemma":[0.9991171,0.00032034854,0.00018968804,0.0001261353,0.00011155226,0.00013509119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044009814,0.00056696945,0.00046396197,0.0020447935,0.001856779,0.0017907958,0.0006274122,0.0010410269,0.023026513],"category_scores_gemma":[0.0016273073,0.0004076481,0.0006348445,0.0018934456,0.0011626375,0.002650037,0.001893267,0.0016422075,0.0032032446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046992867,0.000023063594,0.0004058918,0.00010783634,0.000010369635,0.0002614102,0.00017315603,0.0017800517,0.0016519082,0.97785336,0.007997345,0.009688455],"study_design_scores_gemma":[0.000016353473,0.000054892662,0.000535561,0.000047126778,0.000014267997,0.00043486146,0.00020861119,0.0054994375,0.0010629288,0.9769359,0.0151677895,0.000022302253],"about_ca_topic_score_codex":0.0004910993,"about_ca_topic_score_gemma":0.000644429,"teacher_disagreement_score":0.023026513,"about_ca_system_score_codex":0.00065340754,"about_ca_system_score_gemma":0.00038604793,"threshold_uncertainty_score":0.077031374},"labels":[],"label_agreement":null},{"id":"W2407691524","doi":"","title":"A Note on Set Families and Codes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.01383771580167542,"score_gpt":0.2441813027448969,"score_spread":0.2303435869432215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407691524","genre_codex":"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.00868791,0.15987702,0.15702781,0.1512237,0.05848476,0.00008266341,0.0013845807,0.0005667209,0.46266487],"genre_scores_gemma":[0.25686833,0.23126662,0.16541174,0.06342418,0.09545969,0.00044941614,0.0017464194,0.0010117332,0.18436188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855024,0.0005473907,0.00006971076,0.00018016873,0.00052632863,0.00012600112],"domain_scores_gemma":[0.99044245,0.0076133534,0.00017341705,0.0008591954,0.0006135926,0.00029789095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021707108,0.00085335545,0.0011309448,0.0028301924,0.003163948,0.003779214,0.0017521332,0.0026095307,0.012707658],"category_scores_gemma":[0.008310935,0.0005342252,0.001234046,0.0040923897,0.006373766,0.013526193,0.0038084881,0.008246691,0.0036654407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023146897,0.00001835721,0.00013273252,0.00017026167,0.000015529897,0.00013907607,0.00016996251,0.00045119526,0.00026560063,0.8759826,0.105370365,0.017261192],"study_design_scores_gemma":[0.000004357528,0.000014402496,0.00014034912,0.00009273361,0.000006065837,0.00019125744,0.000079936646,0.00049517275,0.00013422305,0.83977836,0.15905021,0.0000130045],"about_ca_topic_score_codex":0.002417987,"about_ca_topic_score_gemma":0.0034321882,"teacher_disagreement_score":0.012707658,"about_ca_system_score_codex":0.002059551,"about_ca_system_score_gemma":0.0013632261,"threshold_uncertainty_score":0.042511344},"labels":[],"label_agreement":null},{"id":"W2407759797","doi":"","title":"An alternative a pproach to the classification of the regular near hexagons with parameters (s, t, t 2 ) = (2, 11, 1).","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Uniqueness; Addendum; Binary Golay code; Ternary Golay code; Mathematics; Ternary operation; Characterization (materials science); Code (set theory); Section (typography); Combinatorics; Elementary proof; Discrete mathematics; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Programming language; Linear code; Law","score_opus":0.030475987556596498,"score_gpt":0.24732872936238037,"score_spread":0.21685274180578387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407759797","genre_codex":"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.031588994,0.0077973446,0.78147846,0.00670349,0.0047479225,0.00023857859,0.0005392707,0.00043070805,0.1664752],"genre_scores_gemma":[0.4658148,0.007501507,0.41118717,0.009155787,0.005369848,0.0005238669,0.0012531568,0.0003791273,0.098814726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822754,0.00047685887,0.00008463237,0.00057325314,0.0004978439,0.00013989481],"domain_scores_gemma":[0.9978866,0.00059633306,0.00025959985,0.0005131738,0.0005671545,0.00017707901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014258525,0.00091497676,0.0010179286,0.0029806772,0.0022283886,0.003988914,0.002200223,0.0027713769,0.009196065],"category_scores_gemma":[0.004363925,0.0004946037,0.0008500281,0.002431388,0.004265382,0.005838671,0.00380004,0.004860325,0.0038125103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040885665,0.00003157869,0.00035977122,0.00022811916,0.00001605494,0.00019387843,0.00035067112,0.000581822,0.0016564137,0.972021,0.007064497,0.01745525],"study_design_scores_gemma":[0.000023995644,0.00016784576,0.0004347477,0.0001612686,0.000017294526,0.0011709329,0.00040089563,0.006528885,0.002333597,0.88630575,0.102408536,0.000046115045],"about_ca_topic_score_codex":0.0004545429,"about_ca_topic_score_gemma":0.00057654444,"teacher_disagreement_score":0.009196065,"about_ca_system_score_codex":0.0009783007,"about_ca_system_score_gemma":0.000775721,"threshold_uncertainty_score":0.030763924},"labels":[],"label_agreement":null},{"id":"W2407946072","doi":"","title":"Construction of Authentication Codes with Arbitration from Singular Symplectic Geometry.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Arbitration; Geometry; Authentication (law); Computer science; Computer security; Law","score_opus":0.013167111322832261,"score_gpt":0.22219339557439616,"score_spread":0.2090262842515639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407946072","genre_codex":"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.26550153,0.0006279806,0.6318546,0.0017895646,0.0006163673,0.00028036034,0.0005114433,0.00096375943,0.097854465],"genre_scores_gemma":[0.9358819,0.00023219029,0.048873063,0.0002661344,0.00011761681,0.000115942064,0.00024545804,0.00015795452,0.014109779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898976,0.00028060432,0.000064788,0.00012538767,0.00032383966,0.00021562418],"domain_scores_gemma":[0.99815744,0.00058925216,0.00021313911,0.0005797983,0.00020320891,0.00025718164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008310062,0.0005468232,0.00067099987,0.0011760702,0.0016070749,0.0016672021,0.0008202251,0.0012637133,0.0058692214],"category_scores_gemma":[0.0033225226,0.000408341,0.0007436834,0.0008541527,0.0027423762,0.0028289063,0.00526377,0.0020702877,0.0016370128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046873178,0.000019228552,0.00015483492,0.00002913157,0.0000054729344,0.0001501874,0.0001865597,0.0016456177,0.0017067044,0.98819077,0.0014719609,0.006392608],"study_design_scores_gemma":[0.000030312394,0.000040496914,0.00012584489,0.000023474635,0.000008992103,0.00024976008,0.00007255163,0.017461905,0.0026104418,0.97434324,0.005010605,0.00002235198],"about_ca_topic_score_codex":0.0003416284,"about_ca_topic_score_gemma":0.00038968708,"teacher_disagreement_score":0.0058692214,"about_ca_system_score_codex":0.00057285227,"about_ca_system_score_gemma":0.0010295783,"threshold_uncertainty_score":0.019634485},"labels":[],"label_agreement":null},{"id":"W2407994100","doi":"","title":"Extended Binary Linear Codes from Legendre Sequences.","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Legendre polynomials; Circulant matrix; Dimension (graph theory); Code (set theory); Binary number; Class (philosophy); Linear code; Combinatorics; Discrete mathematics; Algorithm; Arithmetic; Block code; Mathematical analysis; Computer science; Decoding methods","score_opus":0.042127991172726274,"score_gpt":0.24057544816841164,"score_spread":0.19844745699568536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407994100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.17655598,0.0038144102,0.7050677,0.0010017977,0.0013306681,0.0002319871,0.0005264227,0.0008066832,0.110664375],"genre_scores_gemma":[0.692204,0.0021006553,0.2677145,0.0006512543,0.00049630785,0.00027641482,0.0007807639,0.00019895956,0.03557713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.00012219207,0.000020920992,0.00005868198,0.00017763417,0.00008975127],"domain_scores_gemma":[0.9992723,0.00016555095,0.00014507494,0.00016184295,0.00014454311,0.000110706846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035183685,0.0005374636,0.00032971016,0.0011468623,0.00071900897,0.00080375874,0.00041309712,0.0007025763,0.0032754242],"category_scores_gemma":[0.0014445529,0.00023169657,0.00044425967,0.0007315156,0.0010178152,0.0010321342,0.0013695387,0.0013131866,0.0014056105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018708911,0.000039420294,0.00040049225,0.0001451151,0.000013738742,0.0003212341,0.00022459241,0.006890874,0.035637934,0.8933815,0.0027167299,0.060041398],"study_design_scores_gemma":[0.00007738157,0.0004638,0.0012072673,0.00018749974,0.000029168608,0.0029419833,0.00013690251,0.074258685,0.074946105,0.75049317,0.095073216,0.00018479468],"about_ca_topic_score_codex":0.00030217867,"about_ca_topic_score_gemma":0.0004785759,"teacher_disagreement_score":0.0032754242,"about_ca_system_score_codex":0.0004713053,"about_ca_system_score_gemma":0.0004925583,"threshold_uncertainty_score":0.01095736},"labels":[],"label_agreement":null},{"id":"W2408040767","doi":"","title":"A New Construction of Authentication Code with Arbitration from (2v+2+e)-dimensional Singular Pseudo-Symplectic Space.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Arbitration; Space (punctuation); Code (set theory); Authentication (law); Pure mathematics; Computer science; Computer security; Programming language; Law; Political science","score_opus":0.009213695797496143,"score_gpt":0.21617221121582117,"score_spread":0.20695851541832502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408040767","genre_codex":"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.30202916,0.000647624,0.6256478,0.0012287395,0.00075292075,0.00019459105,0.00044507833,0.00095955195,0.068094485],"genre_scores_gemma":[0.9229321,0.00022574935,0.061460987,0.00024983505,0.00012261751,0.000105946834,0.00021131583,0.00012801841,0.014563511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957746,0.0000929036,0.000028095543,0.00006776287,0.00013751005,0.00009620516],"domain_scores_gemma":[0.9994629,0.000091110924,0.000059849866,0.00017200249,0.0000878393,0.00012632851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030384987,0.00034638995,0.00041408787,0.0007394514,0.001147859,0.0009928175,0.0005277988,0.0007989408,0.0045093643],"category_scores_gemma":[0.0009368816,0.00021189547,0.00052362494,0.0005752701,0.0013667698,0.001462119,0.002816032,0.0010735344,0.00092164736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087849585,0.000029221668,0.0002762127,0.000063774336,0.0000096764725,0.00033085817,0.00024170885,0.0020478002,0.010959333,0.96892405,0.0021109825,0.014918509],"study_design_scores_gemma":[0.00008330173,0.00018685528,0.00053532055,0.000045369696,0.000028610513,0.0012423729,0.00012150861,0.06379176,0.01718402,0.89655197,0.020138279,0.00009065613],"about_ca_topic_score_codex":0.00025534193,"about_ca_topic_score_gemma":0.00026190074,"teacher_disagreement_score":0.0045093643,"about_ca_system_score_codex":0.00030142223,"about_ca_system_score_gemma":0.0005976395,"threshold_uncertainty_score":0.01508534},"labels":[],"label_agreement":null},{"id":"W2408505849","doi":"","title":"Linear Codes over Finite Chain Rings.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chain (unit); Combinatorics; Physics","score_opus":0.008299404830640298,"score_gpt":0.23027268935407647,"score_spread":0.22197328452343618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408505849","genre_codex":"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.28181309,0.012399575,0.37818834,0.00722601,0.0015293673,0.0002106944,0.0019956129,0.0014435885,0.3151937],"genre_scores_gemma":[0.93248427,0.0035090423,0.02249188,0.00055161386,0.0007142631,0.000089949346,0.0006305103,0.00011729773,0.039411172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987336,0.00036564056,0.000067853434,0.00016756545,0.00039667753,0.0002686267],"domain_scores_gemma":[0.9968334,0.0015447281,0.000409667,0.00059759757,0.00034222042,0.0002725059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009772344,0.00045783323,0.0005163254,0.0013195473,0.0012708397,0.002426353,0.00060524995,0.00086605566,0.008201679],"category_scores_gemma":[0.0038766041,0.00030739824,0.0003774655,0.0015927304,0.0021978156,0.0047433847,0.0022648317,0.0018615908,0.0023934257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058246693,0.000022889686,0.00023350929,0.00007140374,0.0000072098096,0.000065794455,0.00012854881,0.0012925565,0.0010578448,0.9829062,0.003140496,0.01101534],"study_design_scores_gemma":[0.000020539803,0.000041691852,0.00018110806,0.0000723582,0.00001222023,0.00018433346,0.00009148416,0.0068050832,0.0027744225,0.97180474,0.017991748,0.00002021581],"about_ca_topic_score_codex":0.00075249147,"about_ca_topic_score_gemma":0.0007864839,"teacher_disagreement_score":0.008201679,"about_ca_system_score_codex":0.0011202951,"about_ca_system_score_gemma":0.0011470814,"threshold_uncertainty_score":0.027437389},"labels":[],"label_agreement":null},{"id":"W2408564972","doi":"","title":"The Cubic Mapping Graph of the Residue Classes of Integers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Residue (chemistry); Combinatorics; Coxeter graph; Graph; Discrete mathematics; Line graph; Voltage graph; Chemistry; Organic chemistry","score_opus":0.008461089982739612,"score_gpt":0.21446173894352819,"score_spread":0.20600064896078857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408564972","genre_codex":"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.43566996,0.0013533683,0.06305046,0.0046118377,0.0007105322,0.00010252452,0.0017924081,0.00064907025,0.49205986],"genre_scores_gemma":[0.9411803,0.0006593209,0.00975042,0.0005239828,0.00024567128,0.000054523192,0.00076704624,0.00016917281,0.04664953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996972,0.00006123942,0.000008269442,0.000058136622,0.0000834872,0.00009163522],"domain_scores_gemma":[0.9992873,0.00024467538,0.00010973922,0.00012251253,0.00011288902,0.00012285652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022475065,0.0003494496,0.00041764407,0.0017057696,0.0015721096,0.0023614326,0.000641638,0.0006701624,0.017393308],"category_scores_gemma":[0.0020833523,0.00021746561,0.00029606943,0.0011597439,0.0017545526,0.0026586044,0.0012440053,0.0017937707,0.002157423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043181786,0.0000141586615,0.00024544232,0.000030603805,0.000003502483,0.00007057746,0.000117355085,0.00074655213,0.00064797024,0.9784742,0.005128155,0.014478435],"study_design_scores_gemma":[0.000015612137,0.0000099257595,0.0005664953,0.000015068598,0.0000043832174,0.00011579543,0.00012005848,0.0041650715,0.0005658425,0.9818571,0.01255437,0.00001027741],"about_ca_topic_score_codex":0.005437501,"about_ca_topic_score_gemma":0.00485964,"teacher_disagreement_score":0.017393308,"about_ca_system_score_codex":0.0012386941,"about_ca_system_score_gemma":0.00094061537,"threshold_uncertainty_score":0.05818647},"labels":[],"label_agreement":null},{"id":"W2412425389","doi":"10.48550/arxiv.1604.06878","title":"On the performance of optimal double circulant even codes","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Dual (grammatical number); Decoding methods; Mathematics; Weight distribution; Bounded function; Minimum weight; Combinatorics; Minimum distance; Discrete mathematics; Algorithm; Physics; Mathematical analysis","score_opus":0.0579139264674636,"score_gpt":0.17644874557363305,"score_spread":0.11853481910616945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412425389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9539817,0.0013114,0.031422798,0.00066995673,0.000071114366,0.00003232047,0.00028065557,0.00024702618,0.011983006],"genre_scores_gemma":[0.9957125,0.00026018056,0.0033318028,0.000055360993,0.000022630536,0.000015017374,0.00012485935,0.000034174966,0.0004435078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969897,0.0008995843,0.00011323194,0.00028682,0.00095446245,0.00075610116],"domain_scores_gemma":[0.98412204,0.011068606,0.0013034918,0.00138944,0.0013672942,0.00074911927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003234109,0.0011306572,0.0011808432,0.0012406931,0.0009210329,0.0020160011,0.00088284013,0.0011057752,0.0017514611],"category_scores_gemma":[0.025490304,0.00034218022,0.0002361527,0.0010062227,0.0019087482,0.0019157378,0.002440087,0.0009404589,0.00033501012],"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.0035402228,0.00023233471,0.013267475,0.0003220633,0.00018699408,0.00040774417,0.0002720687,0.7576864,0.044668302,0.12915772,0.003103027,0.047155697],"study_design_scores_gemma":[0.00011042684,0.0006239126,0.0027122963,0.00011357354,0.000057079167,0.00038605073,0.00018267112,0.88964003,0.03400626,0.07098497,0.0010716143,0.00011102961],"about_ca_topic_score_codex":0.0011411976,"about_ca_topic_score_gemma":0.0011623374,"teacher_disagreement_score":0.003234109,"about_ca_system_score_codex":0.0015992023,"about_ca_system_score_gemma":0.001817296,"threshold_uncertainty_score":0.017103791},"labels":[],"label_agreement":null},{"id":"W245240986","doi":"","title":"Quantum Generalized Reed-Solomon codes concatenated with random rate one inner stabilizer codes asymptotically attain the Quantum Gilbert-Varshamov bound","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum convolutional code; Linear code; Concatenated error correction code; Block code; Mathematics; Discrete mathematics; Reed–Solomon error correction; Physics; Algorithm; Decoding methods","score_opus":0.04632656506599503,"score_gpt":0.1938842783798743,"score_spread":0.14755771331387926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W245240986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7996389,0.0015233484,0.1753307,0.0011725373,0.00006865866,0.000036839185,0.00013015476,0.0007659351,0.021332972],"genre_scores_gemma":[0.9895656,0.00013240635,0.008842788,0.000054508873,0.00001529307,0.000016420532,0.000033996916,0.000035047004,0.0013038809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998678,0.00036742858,0.000036184203,0.0001650607,0.00041996536,0.00033330018],"domain_scores_gemma":[0.992568,0.00459346,0.0009013663,0.00090653705,0.00072782993,0.00030286235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016446845,0.0005328584,0.0004831453,0.0008550627,0.0010316422,0.0012059371,0.0006200026,0.0011978631,0.0019602561],"category_scores_gemma":[0.008525778,0.00041944612,0.00035381922,0.00046899996,0.0022604181,0.0017022192,0.0018787142,0.00103993,0.00043888946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074776483,0.00009965046,0.0071449117,0.00023500949,0.00008913224,0.00027780555,0.0006961827,0.28322175,0.066551745,0.6075406,0.002190915,0.031204449],"study_design_scores_gemma":[0.00006216396,0.00042218817,0.004083708,0.000121989084,0.00004657842,0.0003654422,0.0001870113,0.65968233,0.09344516,0.23651649,0.0049415124,0.00012540029],"about_ca_topic_score_codex":0.0014077754,"about_ca_topic_score_gemma":0.0017138893,"teacher_disagreement_score":0.0019602561,"about_ca_system_score_codex":0.0018214873,"about_ca_system_score_gemma":0.00081724057,"threshold_uncertainty_score":0.0132158995},"labels":[],"label_agreement":null},{"id":"W2460746400","doi":"10.1017/cbo9780511546907.002","title":"Historical Introduction","year":2005,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Lucas sequence; Sequence (biology); Pseudorandom number generator; Mathematics; Combinatorics; Pseudorandom binary sequence; Hadamard transform; Lucas number; Arithmetic; Algebra over a field; Genealogy; History; Algorithm; Binary number; Pure mathematics; Fibonacci polynomials; Mathematical analysis; Orthogonal polynomials; Biology","score_opus":0.016376964127753874,"score_gpt":0.17567393401157894,"score_spread":0.15929696988382505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460746400","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009928253,0.032532167,0.0016493616,0.009839175,0.010526127,0.000047813348,0.0013352123,0.0002498238,0.9428275],"genre_scores_gemma":[0.017408425,0.027507622,0.0013234202,0.005566563,0.0061152126,0.000078906945,0.0019448928,0.00035911633,0.9396959],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989366,0.00019666331,0.00006138255,0.00030430485,0.0003657505,0.00013539837],"domain_scores_gemma":[0.9989862,0.00023281675,0.000068723246,0.00016995527,0.00039263052,0.00014971948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095842,0.0009062238,0.00057143334,0.0027095194,0.0030753172,0.0053696847,0.0013680911,0.0019763354,0.21719716],"category_scores_gemma":[0.003507838,0.00029702307,0.00042935353,0.0032256823,0.002373604,0.005714641,0.0025970605,0.0028426799,0.10780017],"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.000046680652,0.000025156402,0.00029429654,0.00036240785,0.0000054962898,0.00011373996,0.0012407214,0.00011662949,0.0001838814,0.27500513,0.5967758,0.12583004],"study_design_scores_gemma":[5.267099e-7,0.0000027565377,0.00007426476,0.00009408479,4.9295375e-7,0.00004105195,0.000064121894,0.0000077934155,0.000019005733,0.0025838972,0.99711037,0.0000016398525],"about_ca_topic_score_codex":0.0037152483,"about_ca_topic_score_gemma":0.004238068,"teacher_disagreement_score":0.21719716,"about_ca_system_score_codex":0.004046342,"about_ca_system_score_gemma":0.0018990464,"threshold_uncertainty_score":0.7265969},"labels":[],"label_agreement":null},{"id":"W2463179629","doi":"10.1007/978-3-319-30927-9_18","title":"Enhancement of GSM Stream Cipher Security Using Variable Taps Mechanism and Nonlinear Combination Functions on Linear Feedback Shift Registers","year":2016,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Stream cipher; Stream cipher attack; Computer science; Correlation attack; GSM; Cipher; Shift register; Brute-force attack; Encryption; Affine cipher; Wireless; Embedded system; Computer hardware; Computer network; Chip; CBC-MAC; Telecommunications","score_opus":0.02223892483837167,"score_gpt":0.22860404869823636,"score_spread":0.2063651238598647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463179629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.20678964,0.004403454,0.697073,0.00056631834,0.00043929153,0.00019584956,0.00014968436,0.0019447163,0.0884381],"genre_scores_gemma":[0.879113,0.0022684168,0.08855513,0.00012783894,0.00016711866,0.000052561554,0.00013251364,0.00013683212,0.02944651],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999018,0.00002227264,0.00000520642,0.000015421803,0.00003812873,0.000017115079],"domain_scores_gemma":[0.9999336,0.000020983003,0.000007059548,0.000016254431,0.000018978197,0.0000031776756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110139976,0.00051160966,0.0002778595,0.00032587047,0.00018707843,0.00043131562,0.00031766805,0.00031496753,0.0034953856],"category_scores_gemma":[0.00021831282,0.00015231526,0.0004137671,0.0002978667,0.00029940475,0.00085898075,0.00038933544,0.00054312556,0.00093502854],"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.0006063787,0.0000872459,0.0006186098,0.00045009752,0.00006725452,0.00045212382,0.00018235948,0.01717936,0.55287474,0.1493021,0.0038316965,0.27434817],"study_design_scores_gemma":[0.00010322744,0.0009509929,0.001686727,0.00013430644,0.00022441123,0.0026979204,0.000070397284,0.28046432,0.59846115,0.052227285,0.062898144,0.000081072685],"about_ca_topic_score_codex":0.00011553795,"about_ca_topic_score_gemma":0.00016854312,"teacher_disagreement_score":0.0034953856,"about_ca_system_score_codex":0.000235808,"about_ca_system_score_gemma":0.00021721343,"threshold_uncertainty_score":0.011693239},"labels":[],"label_agreement":null},{"id":"W2464210557","doi":"10.1109/lcomm.2016.2587698","title":"Ternary Convolutional Codes for Ternary Phase Shift Keying","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Ternary operation; Binary number; Keying; Notation; Convolutional code; Mathematics; Combinatorics; Discrete mathematics; Algorithm; Computer science; Arithmetic; Decoding methods; Telecommunications","score_opus":0.04351049413457335,"score_gpt":0.3080357761184908,"score_spread":0.26452528198391745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464210557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.03315064,0.005697355,0.8953229,0.0008444564,0.00078804296,0.00017857348,0.0006198334,0.0007479721,0.06265026],"genre_scores_gemma":[0.6524518,0.0066690324,0.3083664,0.0008639633,0.0004248547,0.00032445733,0.0012722003,0.0002310082,0.029396351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939597,0.00008832633,0.00003657742,0.000082526814,0.00029558217,0.00010100843],"domain_scores_gemma":[0.99948776,0.00015549078,0.000061152365,0.00010161009,0.00017329684,0.000020727774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035400005,0.00050087745,0.0003137663,0.0006220227,0.00043564843,0.0009278401,0.0005124953,0.000684099,0.0051077893],"category_scores_gemma":[0.0020203884,0.00018496101,0.00037395352,0.0011255972,0.0005548029,0.00077631924,0.00071052066,0.00082023523,0.0014871733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015185661,0.00003562143,0.00038507336,0.00046474548,0.00003130151,0.00032268363,0.00013184074,0.04104053,0.033023704,0.7630358,0.0076317717,0.1537451],"study_design_scores_gemma":[0.00004631591,0.00013953155,0.00090975885,0.0002523214,0.000082833605,0.0010265663,0.000046092635,0.51405895,0.08395131,0.26189017,0.13749713,0.00009905814],"about_ca_topic_score_codex":0.0026488262,"about_ca_topic_score_gemma":0.0027058509,"teacher_disagreement_score":0.0051077893,"about_ca_system_score_codex":0.0016290047,"about_ca_system_score_gemma":0.001384196,"threshold_uncertainty_score":0.01708728},"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":"W2475918252","doi":"10.1109/isit.1991.695198","title":"Burst And Unidirectional Error Detecting Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Upper and lower bounds; Minimum distance; Burst error; Computer science; Error detection and correction; Algorithm; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.016092920704553742,"score_gpt":0.24017987902856905,"score_spread":0.22408695832401532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475918252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2093218,0.0027570585,0.75223035,0.00093484257,0.00026542047,0.00010201774,0.00076510134,0.0005489967,0.033074412],"genre_scores_gemma":[0.8453578,0.0011965237,0.1380139,0.00039627595,0.00014142043,0.00013102147,0.00047226605,0.00009266038,0.01419822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952257,0.00009887485,0.00003567552,0.00008697942,0.00015467609,0.00010126053],"domain_scores_gemma":[0.9985952,0.00060887245,0.00021685753,0.00023501777,0.00026835216,0.00007571616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043421867,0.00044182705,0.00031067475,0.0008301214,0.0005317025,0.001175701,0.00040126964,0.0006297391,0.004022041],"category_scores_gemma":[0.0030946836,0.00019186932,0.00017593872,0.0009992493,0.000885178,0.0010220897,0.0012244468,0.0009400719,0.00088217505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009874654,0.000055627515,0.0029528625,0.00027190166,0.000026839185,0.00034092806,0.0003538493,0.03722449,0.0319142,0.7128358,0.0067342976,0.20630169],"study_design_scores_gemma":[0.00015126752,0.0003516582,0.0024694335,0.00019224145,0.000033902033,0.0009691777,0.00018528134,0.3317947,0.056297496,0.5734951,0.033968702,0.00009104126],"about_ca_topic_score_codex":0.0010877657,"about_ca_topic_score_gemma":0.00074456906,"teacher_disagreement_score":0.004022041,"about_ca_system_score_codex":0.0007107919,"about_ca_system_score_gemma":0.00043633228,"threshold_uncertainty_score":0.013455033},"labels":[],"label_agreement":null},{"id":"W2477064046","doi":"","title":"Equations over finite fields","year":2013,"lang":"en","type":"book","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics","score_opus":0.018603007480891432,"score_gpt":0.2252885695491036,"score_spread":0.20668556206821215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477064046","genre_codex":"other","genre_gemma":"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.004171926,0.016045308,0.026692998,0.0032667825,0.0022975295,0.000050969076,0.00043275277,0.00023964334,0.946802],"genre_scores_gemma":[0.053573232,0.02389481,0.011520481,0.0010024388,0.0025485468,0.000099796474,0.00095482776,0.00028380286,0.90612197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997322,0.000039317354,0.000011993392,0.000030789666,0.00016054726,0.000025092892],"domain_scores_gemma":[0.99983156,0.00006158608,0.000012426908,0.00003393311,0.000042755506,0.00001771799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024986756,0.00098467,0.0005303528,0.0011563028,0.00070651696,0.0016770501,0.00053210807,0.00041963052,0.03117198],"category_scores_gemma":[0.00079083414,0.00034932804,0.0003968492,0.0018060498,0.0014335554,0.0028208096,0.0010355914,0.002247612,0.011423465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010641308,0.00002663532,0.00008376169,0.00015420055,0.0000068911954,0.00003528142,0.00021145087,0.0010478079,0.0006174478,0.7672002,0.11710245,0.11350331],"study_design_scores_gemma":[0.000009647176,0.000010363519,0.00013119676,0.00010775702,0.0000068983463,0.00010709765,0.00003965006,0.0014068057,0.0005046659,0.47660556,0.5210611,0.000009304534],"about_ca_topic_score_codex":0.0012538496,"about_ca_topic_score_gemma":0.0016246168,"teacher_disagreement_score":0.03117198,"about_ca_system_score_codex":0.0016772418,"about_ca_system_score_gemma":0.0011427025,"threshold_uncertainty_score":0.10428065},"labels":[],"label_agreement":null},{"id":"W2480990550","doi":"10.1109/tvlsi.2016.2585980","title":"Low-Power Design for a Digit-Serial Polynomial Basis Finite Field Multiplier Using Factoring Technique","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Application-specific integrated circuit; Multiplier (economics); Finite field; CMOS; Adder; Factoring; Computer science; Arithmetic; Integrated circuit design; Standard cell; Mathematics; Algorithm; Computer hardware; Embedded system; Integrated circuit; Electronic engineering; Engineering; Discrete mathematics","score_opus":0.026242531316206776,"score_gpt":0.2524753020851617,"score_spread":0.22623277076895495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480990550","genre_codex":"methods","genre_gemma":"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.1390028,0.0010350526,0.84313065,0.00037893883,0.00018471068,0.00024046833,0.00018033122,0.0018799764,0.013967128],"genre_scores_gemma":[0.60121375,0.0006857437,0.3893261,0.000249525,0.00009878721,0.00013843001,0.00023176795,0.00008436256,0.007971554],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998627,0.000022142578,0.000013982927,0.000039187158,0.00004296411,0.000019103067],"domain_scores_gemma":[0.99984205,0.00003598974,0.00004029172,0.000017692002,0.000056281668,0.000007687471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014133706,0.0006000544,0.0002745167,0.00035120582,0.00043357676,0.00043680426,0.0006434114,0.00030680856,0.003378765],"category_scores_gemma":[0.00032047057,0.00018650616,0.00036475257,0.0005211177,0.00017562194,0.000586381,0.00015222769,0.00030884967,0.0007404488],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056560425,0.00014426919,0.0013475515,0.0006608227,0.0001361764,0.00062439253,0.0002605986,0.018662393,0.6240727,0.017940868,0.004894008,0.33069065],"study_design_scores_gemma":[0.0003903263,0.0041519045,0.0024826934,0.00014412726,0.00046085287,0.004522496,0.00017803113,0.27881762,0.6260631,0.00815747,0.074513435,0.00011792709],"about_ca_topic_score_codex":0.0005980985,"about_ca_topic_score_gemma":0.0015353989,"teacher_disagreement_score":0.003378765,"about_ca_system_score_codex":0.0004274038,"about_ca_system_score_gemma":0.00055201753,"threshold_uncertainty_score":0.011303127},"labels":[],"label_agreement":null},{"id":"W2481688892","doi":"10.1017/cco9781139696456.016","title":"Index bounds for value sets of polynomials over finite fields","year":2014,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Index (typography); Value (mathematics); Combinatorics; Discrete mathematics; Statistics; Computer science","score_opus":0.011613955384744655,"score_gpt":0.2516021101276953,"score_spread":0.23998815474295063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481688892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.21222089,0.008597173,0.6235174,0.009603946,0.0008374941,0.00027022048,0.0025769759,0.0011150811,0.14126079],"genre_scores_gemma":[0.8963996,0.0053830077,0.07140942,0.0012796528,0.0017635337,0.0004991949,0.0025402417,0.0008326793,0.019892689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894097,0.001731742,0.00051052123,0.0012207187,0.005028327,0.0020991142],"domain_scores_gemma":[0.951543,0.03530003,0.0024718042,0.0050171344,0.0030977686,0.0025702377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007979633,0.0019882899,0.0035164289,0.006157,0.0044298563,0.013458167,0.006146102,0.0023507422,0.008709531],"category_scores_gemma":[0.04300371,0.0014621232,0.0021360137,0.007734316,0.0063157496,0.025848124,0.009413421,0.009238636,0.0020978525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003059053,0.000087951375,0.0007724672,0.00014201952,0.000032326327,0.00006104462,0.00038664378,0.008030137,0.0011913863,0.96888924,0.0035555998,0.016545344],"study_design_scores_gemma":[0.000017283508,0.000021102027,0.00017094151,0.000063467334,0.000025929688,0.000044028366,0.00005472077,0.019825315,0.00094536075,0.9766465,0.0021649408,0.000020517236],"about_ca_topic_score_codex":0.001307355,"about_ca_topic_score_gemma":0.0013662629,"teacher_disagreement_score":0.013458167,"about_ca_system_score_codex":0.009526088,"about_ca_system_score_gemma":0.003273919,"threshold_uncertainty_score":0.06911695},"labels":[],"label_agreement":null},{"id":"W2494427850","doi":"10.1016/j.jnt.2016.06.013","title":"On the addition of squares of units modulo n","year":2016,"lang":"en","type":"preprint","venue":"Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Ring (chemistry); Arithmetic; Chemistry","score_opus":0.023088353609455135,"score_gpt":0.2486681475493973,"score_spread":0.22557979393994218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494427850","genre_codex":"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.42483073,0.0030462442,0.32801586,0.0046874364,0.0035272927,0.00013910516,0.00032682347,0.0005211064,0.23490548],"genre_scores_gemma":[0.90892917,0.0016974837,0.049726665,0.0011517778,0.0016817602,0.00008545994,0.000265105,0.00019675039,0.036265813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998798,0.00039988925,0.00007131642,0.00021757178,0.00034647604,0.00016665764],"domain_scores_gemma":[0.99627644,0.002329231,0.00035737926,0.00039352418,0.00035721262,0.00028619636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013700154,0.0011457672,0.0009440693,0.001650164,0.0015243276,0.0024573538,0.0014884257,0.0009821684,0.008716673],"category_scores_gemma":[0.008285543,0.00056286843,0.00062935357,0.0015753928,0.004555091,0.0049524107,0.003946642,0.0021844069,0.001706226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037411987,0.000046983158,0.0007805356,0.00013164179,0.000020793666,0.00035082723,0.00043743258,0.007538477,0.0024540895,0.9423111,0.006132334,0.039421733],"study_design_scores_gemma":[0.000022526157,0.00005616075,0.00026186995,0.000033388926,0.0000125593915,0.00023626661,0.00008332895,0.011770546,0.0012222169,0.98066676,0.0056125093,0.00002189386],"about_ca_topic_score_codex":0.0007342376,"about_ca_topic_score_gemma":0.0012605451,"teacher_disagreement_score":0.008716673,"about_ca_system_score_codex":0.0007316895,"about_ca_system_score_gemma":0.0007727359,"threshold_uncertainty_score":0.029160202},"labels":[],"label_agreement":null},{"id":"W2497076220","doi":"10.1090/fim/020/40","title":"Kloosterman sums and Selberg’s conjecture","year":2009,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"","keywords":"Kloosterman sum; Conjecture; Mathematics; Selberg trace formula; Pure mathematics; Riemann hypothesis","score_opus":0.009663095765218184,"score_gpt":0.21854811873724242,"score_spread":0.20888502297202424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497076220","genre_codex":"other","genre_gemma":"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.10222554,0.009279264,0.033696968,0.01746987,0.001999385,0.000037894828,0.00031209333,0.00027387196,0.8347051],"genre_scores_gemma":[0.81348103,0.004228131,0.008636845,0.0025425693,0.0020139022,0.00010620147,0.00028645888,0.00015393858,0.16855095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937063,0.00014611427,0.000030113672,0.000094053685,0.00023044748,0.00012868666],"domain_scores_gemma":[0.99932635,0.00035976598,0.00005046346,0.00011544251,0.00010129396,0.000046641348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089049607,0.00067512115,0.0008240364,0.0015644588,0.0025135106,0.0033481077,0.0009336851,0.0015882705,0.009001438],"category_scores_gemma":[0.0028271165,0.00044043097,0.0005700117,0.0021478238,0.0046864287,0.007781552,0.002282398,0.003583737,0.0024582166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014464934,0.000009343058,0.00004531011,0.000016450113,0.000002788592,0.000016513077,0.00009564427,0.0002395593,0.0000718743,0.9914315,0.0035275237,0.0045289765],"study_design_scores_gemma":[0.000003722424,0.0000013970864,0.000028225271,0.000006977569,0.0000019853344,0.000019411362,0.000020827696,0.00020934184,0.00008239391,0.99378186,0.005840966,0.000002827928],"about_ca_topic_score_codex":0.0010122331,"about_ca_topic_score_gemma":0.0009682278,"teacher_disagreement_score":0.009001438,"about_ca_system_score_codex":0.002396031,"about_ca_system_score_gemma":0.0009949427,"threshold_uncertainty_score":0.030112803},"labels":[],"label_agreement":null},{"id":"W2504337894","doi":"10.1002/sec.1456","title":"Two new message authentication codes based on APN functions and stream ciphers","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Message authentication code; Authentication (law); Stream cipher; Code (set theory); Data Authentication Algorithm; CBC-MAC; Theoretical computer science; Computer security; Hash-based message authentication code; Block cipher; Computer network; Authentication protocol; Cryptography; Programming language","score_opus":0.01103032498939654,"score_gpt":0.2337092692993262,"score_spread":0.22267894430992966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504337894","genre_codex":"methods","genre_gemma":"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.093853995,0.00084975676,0.8957073,0.0006022736,0.00025414565,0.00030687204,0.00015581223,0.0009937439,0.0072762268],"genre_scores_gemma":[0.631577,0.00054278784,0.3592593,0.00021425063,0.0001051866,0.00034489323,0.00021464165,0.00009211491,0.007649836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984073,0.0004792971,0.00013828817,0.00017663692,0.0006063351,0.00019223211],"domain_scores_gemma":[0.9969387,0.0009859977,0.00055506855,0.00075337925,0.0005999582,0.00016690261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011783246,0.00069101184,0.00064818666,0.0011524007,0.0006289267,0.0009740522,0.0009460192,0.0010943548,0.0020598979],"category_scores_gemma":[0.003680477,0.00033430566,0.00063139596,0.00090386096,0.0013611361,0.0021496895,0.0017193126,0.0013026269,0.0007429651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015696343,0.00022602506,0.0026970194,0.0007135993,0.00013517904,0.00081952283,0.00076533464,0.06780046,0.11830277,0.5505783,0.004874058,0.251518],"study_design_scores_gemma":[0.0003305891,0.0007701612,0.0016399571,0.00017563651,0.00011271318,0.0023031314,0.00010768448,0.6625992,0.19520092,0.09576446,0.040814295,0.00018120921],"about_ca_topic_score_codex":0.0004930233,"about_ca_topic_score_gemma":0.000347632,"teacher_disagreement_score":0.0020598979,"about_ca_system_score_codex":0.000891328,"about_ca_system_score_gemma":0.0013622774,"threshold_uncertainty_score":0.006891072},"labels":[],"label_agreement":null},{"id":"W2504616652","doi":"10.4018/978-1-59904-168-1.ch002","title":"Wireless Web Security Using a Neural Network-Based Cipher","year":2007,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cipher; Computer network; Computer security; Encryption","score_opus":0.029279138037962633,"score_gpt":0.257678022246668,"score_spread":0.22839888420870538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504616652","genre_codex":"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.026140362,0.00697571,0.8525894,0.0013539847,0.0005748782,0.00023443355,0.0001780954,0.0008335598,0.11111948],"genre_scores_gemma":[0.38427958,0.016950013,0.4190397,0.00061728084,0.0004872896,0.00044232802,0.0004538181,0.00021958043,0.1775104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982136,0.000033460445,0.000016365773,0.00002561521,0.000089616544,0.000013653631],"domain_scores_gemma":[0.99986887,0.00005142266,0.000016781154,0.000026738675,0.00003105085,0.0000050904596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022787029,0.00045765802,0.00026125408,0.00040868952,0.00026354493,0.0009842536,0.00044244088,0.0006328,0.0050702137],"category_scores_gemma":[0.00050248613,0.00017323118,0.0003707492,0.0004323157,0.0006470266,0.0017119632,0.00048762647,0.00087644137,0.0019095787],"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.00012060068,0.00008320252,0.00022559038,0.00044132644,0.000044740587,0.0003825555,0.00016098497,0.03908426,0.05532748,0.6229776,0.014379378,0.2667723],"study_design_scores_gemma":[0.0000721277,0.00027631453,0.00058542436,0.0002748635,0.00006712259,0.0016634245,0.000058869085,0.54994047,0.07020204,0.1746731,0.20212163,0.00006464142],"about_ca_topic_score_codex":0.00043954808,"about_ca_topic_score_gemma":0.0004455566,"teacher_disagreement_score":0.0050702137,"about_ca_system_score_codex":0.00053670263,"about_ca_system_score_gemma":0.0005985533,"threshold_uncertainty_score":0.016961515},"labels":[],"label_agreement":null},{"id":"W2506540977","doi":"10.11606/d.45.2016.tde-05102015-225032","title":"Idempotentes centrais primitivos em algumas álgebras de grupos","year":2016,"lang":"pt","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Idempotence; Mathematics; Abelian group; Group (periodic table); Simple (philosophy); Nilpotent; Dimension (graph theory); Subject (documents); Algebra over a field; Pure mathematics; Combinatorics; Computer science; Library science; Epistemology","score_opus":0.011795673180954843,"score_gpt":0.2505804127538334,"score_spread":0.23878473957287857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506540977","genre_codex":"methods","genre_gemma":"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.2766055,0.0030019758,0.6280344,0.00084238994,0.00041657442,0.00017948572,0.00036685006,0.00048259142,0.09007025],"genre_scores_gemma":[0.8051682,0.0019648194,0.15878612,0.00040745857,0.00045082803,0.00025116754,0.00033089932,0.00029819203,0.032342367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760544,0.00051459414,0.0001771159,0.0004122542,0.0009785389,0.0003120415],"domain_scores_gemma":[0.99604696,0.0014574496,0.00042839008,0.00066784775,0.0011061108,0.00029317045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022165098,0.0006672538,0.0007753873,0.0025436408,0.002583751,0.003662398,0.0015338332,0.0009799475,0.006700473],"category_scores_gemma":[0.006306303,0.00049538695,0.0010622841,0.0018717457,0.0032464403,0.0066621844,0.0027265355,0.0028037173,0.0014856594],"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.000065860964,0.000030447023,0.0008645162,0.00012807263,0.000018176897,0.00017856318,0.0007201427,0.0014689685,0.0038723047,0.97968286,0.0006869524,0.012283111],"study_design_scores_gemma":[0.00002314542,0.000081393984,0.0007252727,0.00009564204,0.000040880423,0.0009955472,0.0005998266,0.014799817,0.013267122,0.94524467,0.024080127,0.000046582438],"about_ca_topic_score_codex":0.0006011712,"about_ca_topic_score_gemma":0.0007288199,"teacher_disagreement_score":0.006700473,"about_ca_system_score_codex":0.0019074052,"about_ca_system_score_gemma":0.0008787203,"threshold_uncertainty_score":0.02241534},"labels":[],"label_agreement":null},{"id":"W2509864339","doi":"10.1109/isit.2016.7541347","title":"On vectorial bent functions with Dillon-type exponents","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bent molecular geometry; Monomial; Bent function; Mathematics; Domain (mathematical analysis); Algebraic number; Type (biology); Degree (music); Boolean function; Pure mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.009656603842348767,"score_gpt":0.19766322552817187,"score_spread":0.1880066216858231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509864339","genre_codex":"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.79535717,0.0016935937,0.14306705,0.00074371306,0.00018061054,0.00005229696,0.00014371212,0.00013770179,0.058624197],"genre_scores_gemma":[0.9696754,0.0013721726,0.01726684,0.0001344567,0.0001666237,0.000044380573,0.0001427097,0.0000748754,0.0111226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996973,0.000077722885,0.000015879368,0.000040773015,0.000065158514,0.00010320882],"domain_scores_gemma":[0.99928004,0.00033297608,0.00015109568,0.00006864944,0.00008726686,0.000080008205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044612502,0.0011274301,0.000455401,0.001428696,0.0010959886,0.0012892123,0.0004445361,0.00068843056,0.0032508424],"category_scores_gemma":[0.0020509183,0.0003459723,0.00050875626,0.0009414941,0.0021077644,0.0025498983,0.0013134422,0.0014815715,0.0010452374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011393156,0.000058433176,0.0011612023,0.00012422474,0.0000093254785,0.00046730117,0.00044534623,0.008514084,0.009560302,0.96603906,0.0010045891,0.012502176],"study_design_scores_gemma":[0.000041414,0.00020181293,0.0010043856,0.00011008046,0.000019500749,0.0009424966,0.00034909978,0.06006087,0.009895037,0.9204255,0.006891327,0.00005850897],"about_ca_topic_score_codex":0.00034655957,"about_ca_topic_score_gemma":0.00032989128,"teacher_disagreement_score":0.0032508424,"about_ca_system_score_codex":0.0005518895,"about_ca_system_score_gemma":0.0002392681,"threshold_uncertainty_score":0.010875106},"labels":[],"label_agreement":null},{"id":"W2513122423","doi":"10.1145/3055282.3055291","title":"Black box linear algebra","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Preconditioner; Matrix (chemical analysis); Computation; Algebra over a field; Linear algebra; Discrete mathematics; Algorithm; Applied mathematics; Pure mathematics; Iterative method","score_opus":0.050840463047151535,"score_gpt":0.31764888645870837,"score_spread":0.26680842341155686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513122423","genre_codex":"methods","genre_gemma":"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.00631467,0.0030377756,0.88455266,0.0028888371,0.0013128467,0.0001097714,0.00059078494,0.0009033719,0.10028925],"genre_scores_gemma":[0.26153722,0.0051569534,0.5756717,0.002616266,0.0018796425,0.00069179706,0.0011682358,0.0008630352,0.15041515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896884,0.0003203227,0.000041696578,0.00022692869,0.0003625188,0.00007973713],"domain_scores_gemma":[0.999169,0.0002890733,0.0000420674,0.00027551153,0.0001855214,0.00003881478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135898,0.0008184937,0.0010351918,0.00079051056,0.0010473861,0.0019485608,0.0008786739,0.000808389,0.02900848],"category_scores_gemma":[0.0027673813,0.00045349836,0.00088154944,0.0012891766,0.0018557397,0.0032410505,0.0019389578,0.0032025215,0.010692578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038516668,0.000017430983,0.00011097704,0.00009220241,0.000017907916,0.000032091986,0.00009515573,0.004378551,0.00086615817,0.93998367,0.012773795,0.041593548],"study_design_scores_gemma":[0.000019287852,0.000018998513,0.000054582943,0.00003440068,0.0000047778676,0.00003225942,0.00001595899,0.030447483,0.00074282015,0.92722815,0.041392192,0.000009084083],"about_ca_topic_score_codex":0.00082198874,"about_ca_topic_score_gemma":0.0010222095,"teacher_disagreement_score":0.02900848,"about_ca_system_score_codex":0.0010264971,"about_ca_system_score_gemma":0.000953992,"threshold_uncertainty_score":0.09704304},"labels":[],"label_agreement":null},{"id":"W2516281809","doi":"10.1017/cbo9781139195768.007","title":"Bifix codes","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Object (grammar); Computer science; Mathematics; Artificial intelligence","score_opus":0.018890302355487193,"score_gpt":0.18794733945916545,"score_spread":0.16905703710367825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516281809","genre_codex":"other","genre_gemma":"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.031838316,0.011477547,0.25362498,0.002833239,0.0014361436,0.000109375156,0.0009836286,0.0006760538,0.69702077],"genre_scores_gemma":[0.44350666,0.016598959,0.13613386,0.0022735433,0.0012333035,0.00021545439,0.0011678297,0.0005633834,0.39830709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995938,0.000053906548,0.000015792144,0.00006715928,0.00018500951,0.00008428539],"domain_scores_gemma":[0.9994836,0.00020912313,0.000030858668,0.00007804827,0.00015507756,0.000043258755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004258608,0.0004253701,0.0003283306,0.0013059115,0.0012050426,0.0017347812,0.00041495904,0.0006978202,0.015327981],"category_scores_gemma":[0.0014615121,0.0001876451,0.0003277792,0.0013856989,0.001370743,0.002867295,0.0010917505,0.0016770764,0.0044162474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017767677,0.000004529403,0.00004780066,0.000053481584,0.0000016665509,0.000022556662,0.00010469179,0.00038945806,0.0008937159,0.9554013,0.0058847535,0.037178177],"study_design_scores_gemma":[0.000007658438,0.00004159398,0.00022782982,0.00013165548,0.000006888399,0.0005036271,0.00010055731,0.0034027349,0.0044236807,0.7373326,0.25379694,0.00002417674],"about_ca_topic_score_codex":0.0010476715,"about_ca_topic_score_gemma":0.00070789125,"teacher_disagreement_score":0.015327981,"about_ca_system_score_codex":0.001372825,"about_ca_system_score_gemma":0.00091969036,"threshold_uncertainty_score":0.05127722},"labels":[],"label_agreement":null},{"id":"W2518633271","doi":"10.1109/tit.2016.2595778","title":"The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Cayley graph; Ramanujan's sum; Modulo; Abelian group; Conjecture; Ring of integers; Vertex-transitive graph; Prime number; Gaussian integer","score_opus":0.007879767939820391,"score_gpt":0.2004266449231333,"score_spread":0.1925468769833129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518633271","genre_codex":"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.8617394,0.0004648165,0.060801256,0.001196715,0.00019498312,0.000092281996,0.0007619083,0.0003351081,0.07441356],"genre_scores_gemma":[0.96717227,0.0004090231,0.012830527,0.00034054913,0.000104571845,0.000068051515,0.0005785019,0.000062106556,0.018434403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967456,0.000063277635,0.000014918468,0.00007136159,0.00008001689,0.00009601295],"domain_scores_gemma":[0.9992754,0.000193995,0.00017125567,0.000091920505,0.0001457684,0.00012161555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025411908,0.00031388324,0.00026871718,0.0010006331,0.0010248896,0.0010932325,0.0004195751,0.0005079139,0.005095736],"category_scores_gemma":[0.0011209121,0.00030194942,0.00040567954,0.00072652946,0.0010457768,0.00113174,0.0006438436,0.0008610807,0.00085600873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009748083,0.000040882805,0.0012174789,0.00006774474,0.000017558978,0.00037620522,0.00033030577,0.0050024996,0.0056659216,0.96999365,0.002891038,0.01429916],"study_design_scores_gemma":[0.00004872277,0.00008441235,0.0024777881,0.000031226762,0.000017703529,0.00055369164,0.00038489164,0.026257323,0.0041809846,0.9527529,0.013153781,0.00005669583],"about_ca_topic_score_codex":0.0021914388,"about_ca_topic_score_gemma":0.0024526126,"teacher_disagreement_score":0.005095736,"about_ca_system_score_codex":0.00072668697,"about_ca_system_score_gemma":0.00080797507,"threshold_uncertainty_score":0.017046988},"labels":[],"label_agreement":null},{"id":"W2522333197","doi":"10.1016/j.jalgebra.2016.09.005","title":"Normal supercharacter theories and their supercharacters","year":2016,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Unipotent; Character (mathematics); Pure mathematics; Geometry","score_opus":0.006979465219030541,"score_gpt":0.19479759248630035,"score_spread":0.18781812726726982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522333197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.54468185,0.0033223156,0.13405082,0.006344298,0.0024171697,0.00011498364,0.00047688198,0.00074844336,0.30784318],"genre_scores_gemma":[0.948904,0.0008825886,0.008747461,0.0007483613,0.0011392444,0.00008312081,0.00025006343,0.00021961617,0.039025676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872416,0.00034029002,0.00007023028,0.00017354831,0.00038674095,0.00030499257],"domain_scores_gemma":[0.9970022,0.00090429676,0.00029624236,0.0005227684,0.00064563565,0.0006288073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017327005,0.0011120929,0.001567123,0.0051398207,0.004782443,0.0059316005,0.0020762298,0.0021209407,0.01297383],"category_scores_gemma":[0.0051343623,0.0009143592,0.0010874221,0.0030432614,0.008832253,0.0098548,0.0039546746,0.00458173,0.0023451517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013003191,0.000011148437,0.00005255651,0.000006586115,0.0000021282422,0.000021282067,0.00011450717,0.00011877964,0.00007533716,0.99814105,0.00049074326,0.0009527275],"study_design_scores_gemma":[0.0000033538256,0.0000033243891,0.000023536732,0.0000036090994,0.0000013467968,0.000027261143,0.000037469283,0.00057469856,0.000045887045,0.99870276,0.0005716975,0.000005112842],"about_ca_topic_score_codex":0.0012488514,"about_ca_topic_score_gemma":0.00087018503,"teacher_disagreement_score":0.01297383,"about_ca_system_score_codex":0.0017432916,"about_ca_system_score_gemma":0.0013483783,"threshold_uncertainty_score":0.04340172},"labels":[],"label_agreement":null},{"id":"W2522783957","doi":"10.1007/978-3-319-46298-1_25","title":"A New Adaptable Construction of Modulo Addition with Scalable Security for Stream Ciphers","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Stream cipher; Computer science; Modulo; S-box; Theoretical computer science; Cryptanalysis; Cryptography; Probabilistic logic; Scalability; Advanced Encryption Standard; Polynomial; Differential cryptanalysis; Algorithm; Block cipher; Discrete mathematics; Mathematics; Database","score_opus":0.009222008055489535,"score_gpt":0.2080644522710631,"score_spread":0.19884244421557357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522783957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.03264606,0.00063449726,0.9477684,0.0003564149,0.00042109957,0.0002038638,0.00018399741,0.001745088,0.016040536],"genre_scores_gemma":[0.3744929,0.0010165077,0.60239166,0.00041720597,0.000549778,0.0004260424,0.0005585322,0.0005300467,0.019617332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989611,0.00018949788,0.00009566868,0.00019038911,0.00042901456,0.0001343089],"domain_scores_gemma":[0.99926275,0.00021325186,0.000060515693,0.00031524125,0.00009131787,0.000056876237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008139826,0.0012211138,0.0010478427,0.0011676262,0.0008456877,0.0016159281,0.0014270445,0.00072579936,0.005160289],"category_scores_gemma":[0.0019638033,0.00057426677,0.0011794891,0.00106061,0.0013746036,0.0031478174,0.0046181697,0.002288645,0.001727897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037375107,0.00014106477,0.00039943238,0.00025079114,0.00007500078,0.0003601248,0.00024315102,0.019260982,0.052865893,0.7071698,0.008148918,0.21071124],"study_design_scores_gemma":[0.00020437896,0.00043540343,0.00039690503,0.000106568616,0.00015452395,0.0009789158,0.00007059235,0.18729457,0.06232574,0.69534665,0.05257303,0.00011268841],"about_ca_topic_score_codex":0.0001648627,"about_ca_topic_score_gemma":0.0002947196,"teacher_disagreement_score":0.005160289,"about_ca_system_score_codex":0.0005867536,"about_ca_system_score_gemma":0.00069179793,"threshold_uncertainty_score":0.017262936},"labels":[],"label_agreement":null},{"id":"W2523739031","doi":"10.4064/aa8228-5-2016","title":"On the structure of long unsplittable minimal zero-sum sequences","year":2016,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Combinatorics; Zero (linguistics); Abelian group; Order (exchange); Discrete mathematics","score_opus":0.011380642454377522,"score_gpt":0.22125090047260387,"score_spread":0.20987025801822634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523739031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.97796977,0.0003095799,0.011054947,0.0002016572,0.000021740025,0.000012687534,0.00012230473,0.000058414942,0.010248887],"genre_scores_gemma":[0.99024326,0.00022580779,0.0044414503,0.00005098623,0.000049045833,0.0000277086,0.00023984359,0.000029781128,0.00469227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998473,0.00002650084,0.0000098813025,0.000025214362,0.00004234091,0.000048704078],"domain_scores_gemma":[0.99915266,0.0003248765,0.00024127652,0.000057233097,0.00009941937,0.00012450613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023246485,0.00041007614,0.00027498507,0.0011822049,0.0007780504,0.0010828597,0.00048851,0.00042389546,0.0031816894],"category_scores_gemma":[0.0011441583,0.00019799985,0.00019126873,0.0007322343,0.0012035382,0.0016981256,0.0008740616,0.0006850538,0.0005818157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006234968,0.00011079952,0.0030129955,0.00017494046,0.000015887692,0.0008149111,0.0016697703,0.0064434754,0.038800504,0.9178381,0.0011492752,0.029345853],"study_design_scores_gemma":[0.000054246506,0.00023162563,0.0028764543,0.00006342887,0.000022693153,0.0005380539,0.0005731893,0.015965715,0.018538842,0.9562782,0.0048040994,0.000053495965],"about_ca_topic_score_codex":0.00030440863,"about_ca_topic_score_gemma":0.00033567575,"teacher_disagreement_score":0.0031816894,"about_ca_system_score_codex":0.00042389304,"about_ca_system_score_gemma":0.00027774693,"threshold_uncertainty_score":0.01064384},"labels":[],"label_agreement":null},{"id":"W2527601443","doi":"10.1007/978-3-319-30976-7_8","title":"Kneser–Hecke-Operators for Codes over Finite Chain Rings","year":2016,"lang":"en","type":"book-chapter","venue":"Association for Women in Mathematics series","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"King's University College","funders":"","keywords":"Chain (unit); Prime (order theory); Mathematics; Pure mathematics; Operator (biology); Set (abstract data type); Finite field; Discrete mathematics; Combinatorics; Physics; Computer science; Quantum mechanics; Chemistry","score_opus":0.01231474716306036,"score_gpt":0.22832508417942346,"score_spread":0.2160103370163631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527601443","genre_codex":"other","genre_gemma":"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.05336561,0.024027819,0.113543816,0.0056449072,0.0030764134,0.000082537415,0.00055078807,0.0005765591,0.7991315],"genre_scores_gemma":[0.589996,0.022472369,0.05321091,0.0016706173,0.0048911725,0.00019729648,0.0008824785,0.0005319101,0.3261473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934846,0.00014855622,0.0000362961,0.000090786954,0.00027332272,0.00010253796],"domain_scores_gemma":[0.9994665,0.00024251376,0.000042244013,0.00009888165,0.00009205802,0.000057732355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007104645,0.0009139738,0.00051503856,0.0020991776,0.0019173878,0.0034613328,0.0007202091,0.0012579323,0.01098885],"category_scores_gemma":[0.0018537458,0.0004168496,0.00060135167,0.0023515173,0.0034340315,0.005058923,0.0017204144,0.0040841503,0.0031761397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005499863,0.000007968335,0.000023202683,0.000034632878,0.0000021196906,0.000015484056,0.00015499695,0.00014752848,0.0002342769,0.9887561,0.0033804325,0.0072377296],"study_design_scores_gemma":[0.00000313926,0.0000057519655,0.000048869562,0.00001905286,0.000001921826,0.000059212416,0.000036937614,0.0003742531,0.00018872788,0.97772753,0.021526333,0.000008397682],"about_ca_topic_score_codex":0.0006115781,"about_ca_topic_score_gemma":0.00065262744,"teacher_disagreement_score":0.01098885,"about_ca_system_score_codex":0.001666833,"about_ca_system_score_gemma":0.0011187898,"threshold_uncertainty_score":0.036761403},"labels":[],"label_agreement":null},{"id":"W2527744876","doi":"10.1016/j.dam.2016.09.009","title":"Compositional inverses and complete mappings over finite fields","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bijection, injection and surjection; Mathematics; Permutation (music); TRACE (psycholinguistics); Class (philosophy); Linear subspace; Combinatorics; Discrete mathematics; Inverse; Kernel (algebra); Trace class; Bijection; Algebra over a field; Pure mathematics; Hilbert space; Computer science","score_opus":0.01648350929686105,"score_gpt":0.21993622258225462,"score_spread":0.20345271328539358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527744876","genre_codex":"methods","genre_gemma":"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.23708473,0.0026494393,0.6654269,0.002921151,0.0005061515,0.00012136937,0.00035237416,0.00043708956,0.09050071],"genre_scores_gemma":[0.86841947,0.002006962,0.09386134,0.0009053341,0.0006089869,0.00017336868,0.00046389364,0.00028867554,0.033271857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768746,0.0006539291,0.00017008498,0.0004830769,0.00071639253,0.00028908436],"domain_scores_gemma":[0.99543023,0.0027669668,0.000374639,0.0006738356,0.0004852225,0.00026911646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022955397,0.00086541637,0.001037688,0.0022870295,0.0021548078,0.004186285,0.00095410243,0.0018710811,0.005796407],"category_scores_gemma":[0.008142743,0.0009248053,0.001811734,0.0018341264,0.005927424,0.013383748,0.0042407494,0.00452482,0.0008414756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001593803,0.000008426978,0.000041140465,0.00001874225,0.0000032958908,0.00003605205,0.00014588582,0.0003696981,0.00020721943,0.996512,0.0001483922,0.0024932795],"study_design_scores_gemma":[0.000005210545,0.0000060945454,0.000024813522,0.000006803731,0.0000036699842,0.000052244803,0.000044323904,0.0011149539,0.0003012149,0.997329,0.0011066145,0.0000051355883],"about_ca_topic_score_codex":0.00074782263,"about_ca_topic_score_gemma":0.0006037431,"teacher_disagreement_score":0.005796407,"about_ca_system_score_codex":0.0014151225,"about_ca_system_score_gemma":0.0009681045,"threshold_uncertainty_score":0.019390881},"labels":[],"label_agreement":null},{"id":"W2535290256","doi":"10.1109/tit.2018.2823326","title":"Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond; University of Toronto","keywords":"Finite field; Secret sharing; Mathematics; Algebraic number; Algebraic geometry; Construct (python library); Computer science; Discrete mathematics; Field (mathematics); Theoretical computer science; Topology (electrical circuits); Cryptography; Algorithm; Geometry; Combinatorics; Computer network; Pure mathematics","score_opus":0.008154257861510495,"score_gpt":0.22425740015464313,"score_spread":0.21610314229313263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535290256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.25281155,0.00050370896,0.7331549,0.000513609,0.000064903994,0.00024817258,0.00029140542,0.00052952825,0.011882229],"genre_scores_gemma":[0.90133435,0.00029902547,0.09563488,0.000088825094,0.000044675824,0.00013863009,0.00016016857,0.000040896517,0.0022584428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965624,0.0009099258,0.00025556382,0.00043399096,0.0013117597,0.00052637485],"domain_scores_gemma":[0.993536,0.0022954198,0.0011301718,0.002184535,0.00051067467,0.0003432473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017100396,0.00056942116,0.0009978509,0.0007764121,0.0008104429,0.0014308986,0.0010956028,0.00078773947,0.0011938228],"category_scores_gemma":[0.0067665684,0.00031672907,0.00078953186,0.0010763223,0.0024925617,0.0052389456,0.004036105,0.0018093196,0.0003904408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033140028,0.00007320217,0.0005335327,0.00016933672,0.000032988515,0.000121955185,0.00046962412,0.04883503,0.028389685,0.89640546,0.0005900028,0.02404785],"study_design_scores_gemma":[0.00016183662,0.0006595391,0.00087873323,0.000097525946,0.00007721908,0.00073355995,0.00016800572,0.29464105,0.089226194,0.5986398,0.014547965,0.00016860988],"about_ca_topic_score_codex":0.0003417139,"about_ca_topic_score_gemma":0.0002440317,"teacher_disagreement_score":0.0017100396,"about_ca_system_score_codex":0.0014472187,"about_ca_system_score_gemma":0.0015178004,"threshold_uncertainty_score":0.010500312},"labels":[],"label_agreement":null},{"id":"W254188420","doi":"10.1007/978-3-540-24654-1_20","title":"Additive Autocorrelation of Resilient Boolean Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Boolean function; Function (biology); Transformation (genetics); Nonlinear system; Algebraic number; Dual (grammatical number); Mathematics; Computer science; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.011021309562656836,"score_gpt":0.22364868040168678,"score_spread":0.21262737083902994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W254188420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.39842802,0.0023563465,0.47936141,0.0009808798,0.00050095,0.00006145455,0.00027891746,0.0011658149,0.11686626],"genre_scores_gemma":[0.9639417,0.00070245337,0.01758636,0.00018947052,0.00033286045,0.000041909003,0.00013282096,0.000116868294,0.016955521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903214,0.00020784017,0.000043182426,0.00014214363,0.00038600081,0.00018866832],"domain_scores_gemma":[0.99729913,0.0014637314,0.00031430778,0.00042098959,0.00027414726,0.00022766697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063349935,0.00069442624,0.0007424385,0.0015707054,0.0006496948,0.0016229401,0.000933156,0.00077510474,0.0047247508],"category_scores_gemma":[0.0052608647,0.00045767552,0.00055304344,0.0011731605,0.001540688,0.0017061861,0.0015863109,0.0017445674,0.00068399205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111644054,0.00002922874,0.00029304335,0.00005957411,0.000014566608,0.00015678394,0.00013235686,0.012207952,0.0050951014,0.9587869,0.0014032432,0.02170955],"study_design_scores_gemma":[0.00002087575,0.00006844699,0.0004891052,0.000029577981,0.000023465373,0.00040213935,0.00004955922,0.065925464,0.004529339,0.9249564,0.0034676914,0.0000379501],"about_ca_topic_score_codex":0.0005115226,"about_ca_topic_score_gemma":0.0005751262,"teacher_disagreement_score":0.0047247508,"about_ca_system_score_codex":0.0010507226,"about_ca_system_score_gemma":0.00054473354,"threshold_uncertainty_score":0.01580584},"labels":[],"label_agreement":null},{"id":"W2545228891","doi":"10.1109/milcom.1990.117389","title":"On the weight distributions of m-sequences in AWGN","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Additive white Gaussian noise; Mathematics; Gaussian; Decimation; Statistics; Merge (version control); Algorithm; Discrete mathematics; Combinatorics; White noise; Computer science; Telecommunications; Physics","score_opus":0.021146027848582872,"score_gpt":0.21144000811550884,"score_spread":0.19029398026692596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545228891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.791656,0.0003113946,0.19802512,0.00020315638,0.000027046857,0.00005947322,0.0001563163,0.00038310626,0.009178308],"genre_scores_gemma":[0.9865219,0.00014552992,0.012213279,0.000036007066,0.00000830312,0.00002234896,0.00012767463,0.000047217145,0.0008776896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.00028128532,0.000022891823,0.00006214316,0.00038103806,0.000114569855],"domain_scores_gemma":[0.99057204,0.007072014,0.0005866826,0.0005818966,0.0010646568,0.00012277217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017668045,0.0005392349,0.00031752302,0.00095832144,0.0003543855,0.00055786705,0.00039656216,0.0005627276,0.0012393869],"category_scores_gemma":[0.014071908,0.00023658315,0.0003248094,0.0010301081,0.0008767738,0.0013635526,0.0004551538,0.00045123554,0.00023960962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022291389,0.000038670853,0.0036556046,0.000052152485,0.00002774191,0.00019945622,0.0000967828,0.9480214,0.011425753,0.02132339,0.00031524344,0.014620842],"study_design_scores_gemma":[0.0000081051085,0.000055707696,0.0011128117,0.000010040596,0.000006214272,0.00013202123,0.0000278041,0.9878982,0.005905741,0.0046141683,0.00021603517,0.00001321048],"about_ca_topic_score_codex":0.0013783888,"about_ca_topic_score_gemma":0.0010624137,"teacher_disagreement_score":0.0017668045,"about_ca_system_score_codex":0.00087179465,"about_ca_system_score_gemma":0.00041202066,"threshold_uncertainty_score":0.0093438625},"labels":[],"label_agreement":null},{"id":"W2546840736","doi":"10.1109/itw2.2006.323689","title":"Interleaved Construction of Binary Sequences with Optimal Autocorrelation Magnitude","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Binary number; Combinatorics; Magnitude (astronomy); Mathematics; Algorithm; Computer science; Discrete mathematics; Statistics; Physics; Arithmetic","score_opus":0.005295139646072724,"score_gpt":0.19367686286974772,"score_spread":0.188381723223675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546840736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.39886582,0.00032743465,0.58505976,0.00025327117,0.00010957406,0.000078761645,0.00019720623,0.0003970069,0.014711162],"genre_scores_gemma":[0.8545521,0.00015766166,0.13937709,0.000096338415,0.000044029566,0.00008405927,0.0002562496,0.00005713275,0.0053754193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939775,0.00014964495,0.000040873372,0.00008794774,0.00019997075,0.00012383662],"domain_scores_gemma":[0.9986192,0.00038891606,0.00026636187,0.00032424324,0.00027992195,0.00012147832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047640188,0.0003408538,0.00036003476,0.0008768423,0.00035415028,0.0006657864,0.00038331773,0.00045428085,0.002009251],"category_scores_gemma":[0.0023353137,0.0003200504,0.00027796868,0.0006992105,0.00054350175,0.0008056582,0.0008980729,0.0005279019,0.00056251016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014197628,0.00020725318,0.0031011004,0.00020418249,0.00006534267,0.0008170642,0.000462028,0.07828713,0.21832184,0.4474388,0.0023995554,0.24727592],"study_design_scores_gemma":[0.00018374436,0.0005660426,0.0029893778,0.0000911391,0.000080111284,0.0014069861,0.00012821295,0.58075315,0.22776893,0.1670197,0.018892758,0.00011988947],"about_ca_topic_score_codex":0.00027090913,"about_ca_topic_score_gemma":0.00044721845,"teacher_disagreement_score":0.002009251,"about_ca_system_score_codex":0.0005945598,"about_ca_system_score_gemma":0.0006479943,"threshold_uncertainty_score":0.006721616},"labels":[],"label_agreement":null},{"id":"W2551168410","doi":"10.1016/j.disc.2016.09.008","title":"A simple shift rule for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml13\" display=\"inline\" overflow=\"scroll\" altimg=\"si13.gif\"><mml:mi>k</mml:mi></mml:math>-ary de Bruijn sequences","year":2016,"lang":"nl","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; De Bruijn sequence; Mathematics; Sequence (biology); Combinatorics; Order (exchange); Amortized analysis; String (physics); Simple (philosophy); Discrete mathematics; Algorithm; Data structure; Computer science","score_opus":0.020056188282154667,"score_gpt":0.25692419384793713,"score_spread":0.23686800556578247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551168410","genre_codex":"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.012339521,0.0010113929,0.6849144,0.0027233253,0.009967345,0.0009095651,0.006812691,0.021965194,0.25935647],"genre_scores_gemma":[0.17857598,0.0016871139,0.49673185,0.0031277747,0.001763641,0.0012396527,0.00856228,0.023664402,0.28464732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981962,0.0002552208,0.00026824823,0.00048914336,0.0005237286,0.00026751249],"domain_scores_gemma":[0.9972007,0.0008246519,0.00010335549,0.0008047196,0.00093950704,0.00012707643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014513244,0.0013176786,0.0009059772,0.0016186198,0.0020515986,0.002718912,0.0015948329,0.0014140885,0.100483015],"category_scores_gemma":[0.006692081,0.00082514307,0.001148999,0.0013354422,0.0014295413,0.0045449724,0.002467842,0.002749797,0.08598724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081456796,0.0001771718,0.00059661374,0.0009407666,0.000055032415,0.0009018952,0.00090065197,0.0009978678,0.03662106,0.4345169,0.2250355,0.29844198],"study_design_scores_gemma":[0.00007325002,0.00008811606,0.0003158829,0.00018903783,0.000031913674,0.00076558284,0.00023265317,0.0022144867,0.045125324,0.17439227,0.77645826,0.000113165064],"about_ca_topic_score_codex":0.0013701302,"about_ca_topic_score_gemma":0.0021266819,"teacher_disagreement_score":0.100483015,"about_ca_system_score_codex":0.00078479084,"about_ca_system_score_gemma":0.0013095926,"threshold_uncertainty_score":0.33614916},"labels":[],"label_agreement":null},{"id":"W2560133215","doi":"10.1216/rmj-2016-46-5-1587","title":"The number of irreducible polynomials with the first two prescribed coefficients over a finite field","year":2016,"lang":"en","type":"article","venue":"Rocky Mountain Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monic polynomial; Finite field; Irreducible polynomial; Field (mathematics); Degree (music); Discrete orthogonal polynomials; Base (topology); Difference polynomials; Combinatorics; Orthogonal polynomials; Pure mathematics; Quadratic equation; Discrete mathematics; Algebra over a field; Polynomial; Mathematical analysis; Matrix polynomial; Geometry","score_opus":0.010651027634308148,"score_gpt":0.2543227377251943,"score_spread":0.24367171009088617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560133215","genre_codex":"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.94314355,0.00070698385,0.033973366,0.0007337891,0.0001567278,0.00004262207,0.00048022112,0.0001496353,0.020613108],"genre_scores_gemma":[0.9895455,0.00060563086,0.005568139,0.000054556545,0.00012917396,0.000041464,0.00028796712,0.000027953494,0.003739523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855477,0.00025267707,0.00010306393,0.00027029245,0.00042373012,0.00039545682],"domain_scores_gemma":[0.9949319,0.0027006527,0.00074869726,0.00054196024,0.0004845727,0.00059210445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016462966,0.00055440806,0.0007546792,0.0021697537,0.00090342097,0.0018902646,0.0011298507,0.00090466696,0.0030220943],"category_scores_gemma":[0.007197971,0.00029377194,0.00050770916,0.0010264819,0.0030392131,0.0035132943,0.0013168983,0.0010838773,0.00036116302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014056449,0.0002941434,0.021083802,0.00068916066,0.00013457634,0.00092481996,0.0008769281,0.025745142,0.042166084,0.8343249,0.004206209,0.06814867],"study_design_scores_gemma":[0.00023025637,0.00058259664,0.02309194,0.00031378225,0.00019722104,0.0039896253,0.00057792506,0.098608136,0.061957784,0.79198366,0.018241754,0.00022523652],"about_ca_topic_score_codex":0.00040989008,"about_ca_topic_score_gemma":0.00035377438,"teacher_disagreement_score":0.0030220943,"about_ca_system_score_codex":0.0011317494,"about_ca_system_score_gemma":0.0009103592,"threshold_uncertainty_score":0.010109961},"labels":[],"label_agreement":null},{"id":"W2560190413","doi":"10.1007/978-3-319-69453-5","title":"Selected Areas in Cryptography – SAC 2016","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Cryptography; Computer security","score_opus":0.010671932868329733,"score_gpt":0.2361436477429395,"score_spread":0.22547171487460976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560190413","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024311799,0.11570018,0.026785452,0.006827777,0.048505824,0.00033549368,0.0022272666,0.0017080931,0.7954788],"genre_scores_gemma":[0.019537138,0.09870433,0.011501175,0.0011067209,0.039633464,0.00025125488,0.003189205,0.0010111261,0.8250656],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984743,0.00021922492,0.00007786305,0.00023038863,0.00087987434,0.000118374344],"domain_scores_gemma":[0.99788386,0.00037535065,0.00015138689,0.00037103784,0.000739197,0.00047906546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013111557,0.0031084483,0.0020424887,0.004522389,0.0015868585,0.004771324,0.001244496,0.0014041448,0.08627817],"category_scores_gemma":[0.0025409395,0.00078618573,0.0010651813,0.006370008,0.0011001927,0.004989442,0.0024518473,0.004228085,0.09468836],"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.000063284606,0.00007246605,0.0001772981,0.00071002246,0.000025952784,0.000036668574,0.000032474753,0.0018922488,0.00075452117,0.04199645,0.67048734,0.28375128],"study_design_scores_gemma":[0.0000147188,0.000058995927,0.0006439391,0.00039969443,0.000020304757,0.00019372323,0.000021977428,0.002044431,0.00081974943,0.025997872,0.96976566,0.000018957331],"about_ca_topic_score_codex":0.0011286045,"about_ca_topic_score_gemma":0.0020979603,"teacher_disagreement_score":0.08627817,"about_ca_system_score_codex":0.0034861036,"about_ca_system_score_gemma":0.004354817,"threshold_uncertainty_score":0.28862923},"labels":[],"label_agreement":null},{"id":"W2561596263","doi":"10.82308/22604","title":"Two mathematical security aspects of the RSA cryptosystem : signature padding schemes and key generation with a backdoor","year":2008,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Padding; Cryptosystem; Backdoor; Correctness; Computer science; Theoretical computer science; Cryptography; Key (lock); Mathematics; Discrete mathematics; Algorithm; Computer security","score_opus":0.015601072044488786,"score_gpt":0.20781668010864351,"score_spread":0.19221560806415472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561596263","genre_codex":"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.010128483,0.005111282,0.94948715,0.0032168478,0.00080658763,0.00013352664,0.00010370532,0.00032100946,0.030691426],"genre_scores_gemma":[0.31216696,0.015982471,0.64156604,0.0014977503,0.0038861542,0.00036193413,0.00034684708,0.00044713254,0.023744741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965833,0.00087487843,0.00032553903,0.0006045539,0.0013139708,0.00029787284],"domain_scores_gemma":[0.99593204,0.0019362605,0.00047348556,0.001338956,0.00022160543,0.000097639306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028027268,0.0014548302,0.0010326835,0.002371515,0.00146192,0.004721306,0.0016341405,0.0018427741,0.005152892],"category_scores_gemma":[0.0062226276,0.0010773481,0.0022245285,0.002460005,0.00834262,0.015045046,0.0037026745,0.0071559623,0.0021862274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059367627,0.000056836056,0.00017988987,0.0002926988,0.000016968539,0.00015630056,0.00021680638,0.0030223369,0.0032658207,0.9490432,0.0012354379,0.042454265],"study_design_scores_gemma":[0.000052642365,0.00018969469,0.0003962436,0.00016327211,0.000054335946,0.0019246369,0.0001192935,0.02153777,0.029409777,0.86690193,0.07913802,0.00011222352],"about_ca_topic_score_codex":0.0003093902,"about_ca_topic_score_gemma":0.00020216683,"teacher_disagreement_score":0.005152892,"about_ca_system_score_codex":0.0018003988,"about_ca_system_score_gemma":0.0019607441,"threshold_uncertainty_score":0.01723808},"labels":[],"label_agreement":null},{"id":"W2566607440","doi":"10.1090/mcom/3247","title":"An analog of the prime number theorem for finite fields via truncated polylogarithm expansions","year":2016,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polylogarithm; Mathematics; Monic polynomial; Asymptotic expansion; Asymptotic analysis; Riemann zeta function; Bell polynomials; Function (biology); Prime (order theory); Generating function; Asymptotic formula; Analytic number theory; Applied mathematics; Integer (computer science); Pure mathematics; Mathematical analysis; Combinatorics; Polynomial; Prime zeta function; Arithmetic zeta function","score_opus":0.015230427623292483,"score_gpt":0.26658078482223646,"score_spread":0.251350357198944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566607440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.028286258,0.0010233775,0.9325307,0.0004354112,0.0004154206,0.000049021637,0.00010021552,0.0005373599,0.036622286],"genre_scores_gemma":[0.66829073,0.0032066281,0.29946896,0.0007154244,0.0009789115,0.00021234059,0.00030988918,0.0005135299,0.026303578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946016,0.00012378873,0.000026554979,0.000057635938,0.00027496569,0.00005682935],"domain_scores_gemma":[0.9984328,0.00085476204,0.000112534086,0.00027885495,0.0002655303,0.000055494667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010140114,0.00085821346,0.000607774,0.0020139557,0.00059621,0.0014798004,0.0010423543,0.0007120859,0.0058269827],"category_scores_gemma":[0.008351244,0.00021886158,0.00055496686,0.0012487657,0.0017658964,0.0033250407,0.0010523234,0.0025901957,0.002331381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052216503,0.000030674022,0.00037856688,0.00014503572,0.000008315458,0.00017596217,0.00014466372,0.028745778,0.0053362995,0.91095614,0.0029163228,0.051110003],"study_design_scores_gemma":[0.000008376186,0.000048188984,0.00023246968,0.00007306533,0.000009470766,0.0004226921,0.000052669908,0.25814736,0.0043717623,0.7281201,0.008490422,0.000023378398],"about_ca_topic_score_codex":0.00062141975,"about_ca_topic_score_gemma":0.000692321,"teacher_disagreement_score":0.0058269827,"about_ca_system_score_codex":0.0010265367,"about_ca_system_score_gemma":0.00054308,"threshold_uncertainty_score":0.019493163},"labels":[],"label_agreement":null},{"id":"W2571232930","doi":"10.1016/j.ffa.2016.11.015","title":"Lee weights of cyclic self-dual codes over Galois rings of characteristic p2","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; Ministry of Education","keywords":"Mathematics; Dual (grammatical number); Pure mathematics","score_opus":0.010565505448550283,"score_gpt":0.23184939417082684,"score_spread":0.22128388872227656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571232930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9396581,0.00041337105,0.033746243,0.00053492805,0.00017311623,0.000033537013,0.00019158877,0.00016912696,0.025079995],"genre_scores_gemma":[0.9850249,0.00027382607,0.0031126984,0.00010651997,0.00018849893,0.000039707153,0.00012463283,0.00007059608,0.011058678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994361,0.00013768834,0.000029346505,0.000074793636,0.00014734575,0.00017471162],"domain_scores_gemma":[0.99816954,0.00062293676,0.0004624739,0.00015329622,0.00016758923,0.00042413073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008224154,0.000973727,0.0006868329,0.0046020956,0.0014653011,0.002644915,0.0008744627,0.0009503848,0.006065235],"category_scores_gemma":[0.0028267603,0.0005776693,0.0004919303,0.0022950266,0.0024609424,0.0034116001,0.002183939,0.0014221728,0.00081903604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002546812,0.000084070045,0.0017911268,0.000045059613,0.00002314066,0.0002115646,0.00047379392,0.002840689,0.0037111861,0.97923905,0.00096817146,0.010357497],"study_design_scores_gemma":[0.00005939956,0.00008660605,0.0017994795,0.000043097505,0.000029391878,0.0002720523,0.00026262083,0.01822286,0.003278784,0.97327584,0.0026151377,0.00005469066],"about_ca_topic_score_codex":0.00064351474,"about_ca_topic_score_gemma":0.0010491102,"teacher_disagreement_score":0.006065235,"about_ca_system_score_codex":0.0010978836,"about_ca_system_score_gemma":0.0005718635,"threshold_uncertainty_score":0.020290256},"labels":[],"label_agreement":null},{"id":"W2574055986","doi":"","title":"On locating-dominating codes in the infinite king grid.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Grid; Geometry","score_opus":0.012978371822295554,"score_gpt":0.23708129340028522,"score_spread":0.22410292157798967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574055986","genre_codex":"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.40637696,0.0024003258,0.46318135,0.0044888402,0.0004556527,0.00015978092,0.0010231938,0.000667499,0.121246375],"genre_scores_gemma":[0.9330535,0.0012354783,0.040272687,0.0005719407,0.00015714274,0.00015342572,0.0004678216,0.00014731284,0.023940774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988199,0.00040894662,0.000059051432,0.00015305635,0.00024817968,0.0003108916],"domain_scores_gemma":[0.99260545,0.0046485355,0.00055937306,0.0011435766,0.0005381439,0.00050496776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689808,0.0004579454,0.0009510634,0.0012970052,0.0018725824,0.0025178576,0.0015445543,0.001335755,0.0059462753],"category_scores_gemma":[0.010422243,0.00041000167,0.0004798465,0.0017320894,0.0028706614,0.0049874727,0.003763105,0.0022239115,0.0016548054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012707963,0.000028291877,0.0004956151,0.000066016066,0.000012272372,0.00011710631,0.00027526877,0.021541702,0.00079266325,0.9617208,0.004895464,0.009927691],"study_design_scores_gemma":[0.000035883026,0.000021238306,0.00014910226,0.000032575732,0.000008398562,0.00014437352,0.00017373102,0.049741983,0.0006105402,0.9456337,0.0034314732,0.000016955502],"about_ca_topic_score_codex":0.002176145,"about_ca_topic_score_gemma":0.0025754867,"teacher_disagreement_score":0.0059462753,"about_ca_system_score_codex":0.0017613407,"about_ca_system_score_gemma":0.0013358442,"threshold_uncertainty_score":0.019892275},"labels":[],"label_agreement":null},{"id":"W2574354056","doi":"10.21700/ijcis.2016.127","title":"Stream Cipher with Space-Time Block Code","year":2016,"lang":"en","type":"article","venue":"International Journal of Computing and Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stream cipher; Block cipher; CBC-MAC; Computer science; Transposition cipher; Block (permutation group theory); Code (set theory); Stream cipher attack; Arithmetic; Parallel computing; Algorithm; Mathematics; Programming language; Cryptography; Computer security; Running key cipher; Cipher; Encryption; Combinatorics","score_opus":0.007954300909816695,"score_gpt":0.2482061534531479,"score_spread":0.2402518525433312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574354056","genre_codex":"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.10925295,0.002551967,0.85059094,0.0016851136,0.0010940655,0.00042416085,0.0008873068,0.0016557915,0.031857636],"genre_scores_gemma":[0.8608442,0.0018437702,0.11366274,0.00048791207,0.0005669317,0.00026076927,0.0006923283,0.00012585531,0.02151547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992617,0.00016264722,0.00005715141,0.000099494806,0.00029906954,0.00011991206],"domain_scores_gemma":[0.99917114,0.00021526817,0.000124332,0.00021815389,0.00021935783,0.000051701772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056489196,0.0006418928,0.00058519264,0.0008130446,0.00058531365,0.0011186359,0.00041078002,0.00080192846,0.003273815],"category_scores_gemma":[0.0018105522,0.0002241606,0.000493501,0.0010619143,0.00070515356,0.0014258852,0.0010327726,0.0010408167,0.0014221253],"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.0022705565,0.0002487703,0.0016808939,0.0006561936,0.00017153245,0.0011703225,0.00027625385,0.08299171,0.16276059,0.55658126,0.016097195,0.17509472],"study_design_scores_gemma":[0.00049340253,0.0012316174,0.0014876231,0.00019033911,0.0002391277,0.0025827591,0.00006903975,0.58382946,0.16659893,0.19010453,0.053027272,0.00014589327],"about_ca_topic_score_codex":0.00062270986,"about_ca_topic_score_gemma":0.0005038139,"teacher_disagreement_score":0.003273815,"about_ca_system_score_codex":0.0005479353,"about_ca_system_score_gemma":0.0015701528,"threshold_uncertainty_score":0.010951996},"labels":[],"label_agreement":null},{"id":"W2576980341","doi":"","title":"The weight distributions of some binary cyclic codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Arithmetic","score_opus":0.007962786466257624,"score_gpt":0.220176913721359,"score_spread":0.2122141272551014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576980341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.78749686,0.0013135665,0.13055085,0.0032773523,0.0002269346,0.000101544574,0.0017335737,0.00028058983,0.075018734],"genre_scores_gemma":[0.9786592,0.00080594514,0.006790989,0.00025447892,0.00029660546,0.00012769672,0.00055842,0.00010262227,0.012403927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988788,0.0003272724,0.00004107576,0.00013132679,0.0003624942,0.00025910966],"domain_scores_gemma":[0.99462104,0.003009466,0.00074085116,0.0004991971,0.00063688733,0.0004926482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328817,0.0006403603,0.00041995465,0.0029000083,0.00088754785,0.0021111348,0.0011164485,0.0010516649,0.006990116],"category_scores_gemma":[0.011462987,0.00044662796,0.00041741127,0.0020697794,0.002173126,0.0027499148,0.0016260783,0.0015871389,0.0010088221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008102225,0.000022848166,0.00061758043,0.000034161432,0.000009440216,0.000070985654,0.0001508894,0.0039461832,0.0015074292,0.98448724,0.001823385,0.007248817],"study_design_scores_gemma":[0.00003477331,0.000025798336,0.0008808595,0.00003938048,0.000009777453,0.00018196434,0.000077397184,0.037272207,0.0013237298,0.9569847,0.0031390542,0.000030394156],"about_ca_topic_score_codex":0.00096905004,"about_ca_topic_score_gemma":0.000669323,"teacher_disagreement_score":0.006990116,"about_ca_system_score_codex":0.0014677249,"about_ca_system_score_gemma":0.00083099987,"threshold_uncertainty_score":0.023384213},"labels":[],"label_agreement":null},{"id":"W2577240032","doi":"","title":"On the weight distributions of some q-ary cyclic codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00941256638059285,"score_gpt":0.21472464694898438,"score_spread":0.20531208056839154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577240032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.785374,0.0015690873,0.15617113,0.0039343173,0.0002142712,0.000089913294,0.0011408002,0.0002439551,0.051262524],"genre_scores_gemma":[0.9815965,0.00110483,0.0073944777,0.00031895118,0.0003563113,0.00014339025,0.0004315084,0.000097453725,0.008556469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986772,0.00043684343,0.000044058757,0.00015079875,0.0003659084,0.00032511176],"domain_scores_gemma":[0.9911623,0.0058099814,0.0009886948,0.00066001806,0.00071127526,0.0006677144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021097248,0.0007687679,0.000694186,0.0029965704,0.0013030147,0.0023832675,0.0014472578,0.0011625455,0.005767693],"category_scores_gemma":[0.014734843,0.00057166023,0.00048619305,0.0022661854,0.0034397969,0.0040454064,0.0023138092,0.0023193704,0.0009369668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008728351,0.00002635657,0.0007013945,0.000032245167,0.000009388318,0.000069200796,0.00018463949,0.004758905,0.0011715393,0.98573446,0.001639713,0.0055848123],"study_design_scores_gemma":[0.000035529345,0.000025102749,0.0006205159,0.0000439683,0.000008074643,0.00015024035,0.00009659922,0.03566026,0.00072757434,0.9609297,0.0016744179,0.000027963735],"about_ca_topic_score_codex":0.001129472,"about_ca_topic_score_gemma":0.0007904898,"teacher_disagreement_score":0.005767693,"about_ca_system_score_codex":0.0015571172,"about_ca_system_score_gemma":0.0009904847,"threshold_uncertainty_score":0.019294918},"labels":[],"label_agreement":null},{"id":"W2577529735","doi":"","title":"A new class of 2-fold perfect 4-splitting authentication codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fold (higher-order function); Class (philosophy); Authentication (law); Discrete mathematics; Combinatorics; Computer science; Computer security; Programming language; Artificial intelligence","score_opus":0.010592016452183836,"score_gpt":0.22818995684599572,"score_spread":0.2175979403938119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577529735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5356807,0.001778348,0.2545354,0.0022113714,0.0009086301,0.00036474894,0.0018258914,0.0018950575,0.20079976],"genre_scores_gemma":[0.94390017,0.00050820474,0.026522446,0.00049878977,0.00021419961,0.00017471297,0.0008225414,0.00013747148,0.02722134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992428,0.00012400482,0.00005040181,0.0001420901,0.00024054605,0.00020023741],"domain_scores_gemma":[0.998362,0.0004349281,0.00027271174,0.00050872116,0.00018130346,0.00024046445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005255791,0.0005482704,0.0005049302,0.0013580932,0.001396981,0.0018152713,0.000674534,0.0012212784,0.011622422],"category_scores_gemma":[0.0021463986,0.00032146994,0.0006645819,0.0010677761,0.0016578039,0.002618798,0.0023098665,0.0015307086,0.002487185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026328067,0.00005913737,0.001017489,0.00010999249,0.000020318239,0.00044200255,0.0003280852,0.0044033146,0.009276747,0.9345045,0.0076817023,0.041893344],"study_design_scores_gemma":[0.00007805723,0.00012179043,0.0010208072,0.00006858825,0.000025707843,0.001547267,0.00015401187,0.02631228,0.0070724864,0.92781156,0.03571906,0.00006840325],"about_ca_topic_score_codex":0.0004796197,"about_ca_topic_score_gemma":0.00046560413,"teacher_disagreement_score":0.011622422,"about_ca_system_score_codex":0.00069174945,"about_ca_system_score_gemma":0.0010401714,"threshold_uncertainty_score":0.038880885},"labels":[],"label_agreement":null},{"id":"W2582163805","doi":"10.1049/iet-com.2016.0303","title":"Code‐based security with random interleaving","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Interleaving; Code (set theory); Programming language; Theoretical computer science; Operating system","score_opus":0.03582894615192945,"score_gpt":0.2998896858542459,"score_spread":0.26406073970231647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582163805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.074432686,0.0012000741,0.9017668,0.0008027625,0.00017961774,0.00012766951,0.00009535269,0.00072553166,0.020669516],"genre_scores_gemma":[0.9199627,0.000903855,0.073718496,0.0002078568,0.0001467594,0.00016447391,0.00012002579,0.00011777951,0.0046580676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646974,0.0009171713,0.0001682233,0.0003522495,0.0016149491,0.0004777041],"domain_scores_gemma":[0.994361,0.0025997527,0.000589871,0.0016976793,0.0006016583,0.00015003678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017815899,0.00062716054,0.0008327164,0.0011627361,0.00083729415,0.0019520965,0.0009381125,0.0012176359,0.0025242895],"category_scores_gemma":[0.0059802453,0.00037915856,0.00055687124,0.0012070616,0.002436757,0.0045747044,0.0031666292,0.002228765,0.0009931845],"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.00047460414,0.00007884466,0.00055645214,0.0002215574,0.00007416122,0.0003499967,0.00022565872,0.050246686,0.024792805,0.8694322,0.001401008,0.052145932],"study_design_scores_gemma":[0.00014909994,0.00024922105,0.00033055304,0.00012402775,0.00007510791,0.0010729557,0.00007903165,0.37110987,0.075971045,0.5338806,0.016837293,0.00012121462],"about_ca_topic_score_codex":0.0003211088,"about_ca_topic_score_gemma":0.00016522717,"teacher_disagreement_score":0.0025242895,"about_ca_system_score_codex":0.0010059725,"about_ca_system_score_gemma":0.0013663417,"threshold_uncertainty_score":0.009422004},"labels":[],"label_agreement":null},{"id":"W2582439668","doi":"10.48550/arxiv.1701.05705","title":"Construction and nonexistence of strong external difference families","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lambda; Algebraic number; Scope (computer science); Mathematics; Range (aeronautics); Character (mathematics); Construct (python library); Combinatorics; Pure mathematics; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.06656221915557264,"score_gpt":0.1883878140078955,"score_spread":0.12182559485232286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582439668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.63770026,0.00022467649,0.31843722,0.000813682,0.00008676932,0.00010814725,0.00047338358,0.00032702083,0.041828927],"genre_scores_gemma":[0.9564397,0.00011932223,0.037283216,0.00014972728,0.000050129212,0.0001713524,0.00042291908,0.00007136603,0.005292227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980223,0.00043023063,0.00014111986,0.00039596602,0.00067891134,0.0003315307],"domain_scores_gemma":[0.9944859,0.0029176006,0.00052219507,0.00097465224,0.00069105555,0.00040862898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001325244,0.0004102728,0.0005744671,0.0009511259,0.0016151443,0.0016503637,0.00080528593,0.00096333574,0.003512745],"category_scores_gemma":[0.009083222,0.00045423862,0.0006594405,0.00057173544,0.002955953,0.0030726576,0.0040487233,0.002068485,0.00061151426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001042538,0.000037250196,0.0023168824,0.000050264443,0.000013126489,0.00027183327,0.0003900976,0.0052728886,0.006897452,0.9709428,0.0011050724,0.012597969],"study_design_scores_gemma":[0.000051388113,0.00009432324,0.0008063756,0.00004096642,0.000015989619,0.0009294821,0.00031111398,0.037786245,0.013655819,0.9324819,0.013774938,0.0000513521],"about_ca_topic_score_codex":0.00015380786,"about_ca_topic_score_gemma":0.0001345906,"teacher_disagreement_score":0.003512745,"about_ca_system_score_codex":0.0009137962,"about_ca_system_score_gemma":0.00053371245,"threshold_uncertainty_score":0.011751294},"labels":[],"label_agreement":null},{"id":"W2583679202","doi":"10.4230/lipics.aofa.2018.30","title":"Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Modulo; Mathematics; Product (mathematics); Combinatorics; Set (abstract data type); Discrete mathematics; Heuristic; Finite set; Mathematical analysis; Mathematical optimization; Geometry; Computer science","score_opus":0.013656057012199144,"score_gpt":0.24707481273719306,"score_spread":0.23341875572499393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583679202","genre_codex":"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.8999165,0.0004170555,0.08898829,0.00041632034,0.000043413438,0.00007684432,0.00030947564,0.00026370975,0.009568239],"genre_scores_gemma":[0.98530465,0.0001521634,0.011645169,0.000039087627,0.000036868594,0.000104267274,0.00017609903,0.00006188617,0.0024797106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990921,0.00034908234,0.000048241793,0.0001640536,0.00014178525,0.00020479223],"domain_scores_gemma":[0.9883111,0.007906383,0.0018147015,0.00085929676,0.00039915703,0.0007093195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023457254,0.00035684442,0.00047188386,0.0015167479,0.0006840798,0.0017763095,0.0009467283,0.00063921424,0.004448734],"category_scores_gemma":[0.021097181,0.00047494684,0.0005519897,0.00068778364,0.0021271624,0.0023181129,0.0009893671,0.00076264626,0.00031943314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094846595,0.00009951081,0.014718154,0.0001892595,0.000069886126,0.00048628697,0.00059018313,0.27843875,0.009713647,0.6738032,0.0025328065,0.018409926],"study_design_scores_gemma":[0.000093060604,0.00015556283,0.0042408328,0.000051684267,0.000024600731,0.00036121736,0.0001586808,0.73437506,0.0049511488,0.25367326,0.0018760693,0.000038740196],"about_ca_topic_score_codex":0.00091007166,"about_ca_topic_score_gemma":0.00088074134,"teacher_disagreement_score":0.004448734,"about_ca_system_score_codex":0.001804669,"about_ca_system_score_gemma":0.00079820724,"threshold_uncertainty_score":0.014882505},"labels":[],"label_agreement":null},{"id":"W2587862547","doi":"10.3934/amc.2017002","title":"New almost perfect, odd perfect, and perfect sequences from difference balanced functions with &lt;i&gt;d&lt;/i&gt;-form property","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Perfect power; Interleaving; Combinatorics; Complementary sequences; Property (philosophy); QAM; Discrete mathematics; Algorithm; Quadrature amplitude modulation; Decoding methods","score_opus":0.021027546917038314,"score_gpt":0.26668051688441313,"score_spread":0.24565296996737482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587862547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.20695464,0.0013355239,0.7648592,0.000479584,0.00044238853,0.00012478427,0.0004841453,0.0003212784,0.024998395],"genre_scores_gemma":[0.7549753,0.0011424485,0.23184142,0.00032389027,0.0001648791,0.00016173076,0.0007416195,0.00008800312,0.010560673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970204,0.000070969974,0.0000293705,0.000060489027,0.00009321863,0.00004401132],"domain_scores_gemma":[0.99959224,0.00010933254,0.00007924447,0.000070949245,0.00010048316,0.00004780368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036734767,0.0006131536,0.0003374786,0.0007332507,0.0003939226,0.0006220129,0.0003434617,0.00053233886,0.002367724],"category_scores_gemma":[0.0013170501,0.00024497256,0.00033504146,0.00074492174,0.0006975065,0.001209846,0.00071052107,0.0007265658,0.00054017454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004094505,0.000052683874,0.001182803,0.0003709226,0.00003509998,0.00044674653,0.00036623504,0.012812015,0.11481926,0.72874737,0.0019133862,0.13884415],"study_design_scores_gemma":[0.00015906236,0.0009219508,0.00266253,0.0001903268,0.000110707595,0.004278041,0.0003243517,0.16203187,0.20260373,0.570913,0.05561364,0.00019062053],"about_ca_topic_score_codex":0.00023041641,"about_ca_topic_score_gemma":0.00025087062,"teacher_disagreement_score":0.002367724,"about_ca_system_score_codex":0.0003770255,"about_ca_system_score_gemma":0.00068226684,"threshold_uncertainty_score":0.007920861},"labels":[],"label_agreement":null},{"id":"W2590834615","doi":"10.1109/tit.2017.2780233","title":"Some Results on the Existence of $t$ -All-or-Nothing Transforms Over Arbitrary Alphabets","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Tuple; Integer (computer science); Mathematics; Bijection; Nothing; Alphabet; Combinatorics; Discrete mathematics; Literal (mathematical logic); Algorithm; Computer science","score_opus":0.03565162858536676,"score_gpt":0.2716290594767765,"score_spread":0.23597743089140977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590834615","genre_codex":"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.51796514,0.003634666,0.3646256,0.0026465615,0.00027223234,0.00010349322,0.00051053596,0.00071380637,0.10952791],"genre_scores_gemma":[0.94365966,0.00137118,0.045442376,0.00052655244,0.000271062,0.000119215816,0.00036849434,0.00016705155,0.008074304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988537,0.00022816412,0.000113390415,0.00027378753,0.0002500278,0.00028100176],"domain_scores_gemma":[0.99271774,0.0052682245,0.00070037,0.0007627594,0.000286412,0.0002645576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013833031,0.00053293386,0.00067126506,0.0011385016,0.001229964,0.0020519157,0.00071064936,0.0011814755,0.0053472007],"category_scores_gemma":[0.008800372,0.000500708,0.0011117683,0.0011662968,0.0030353463,0.005386731,0.0020041952,0.0028015396,0.0008102449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002501745,0.000078360754,0.0010638272,0.00020388758,0.000015466776,0.00033864685,0.00056050776,0.007884855,0.012319516,0.9522179,0.0013109605,0.023756083],"study_design_scores_gemma":[0.000048260074,0.00024822916,0.00080289226,0.00009065971,0.00004552075,0.0011258449,0.00036347465,0.036840264,0.03040395,0.920947,0.009021994,0.00006195612],"about_ca_topic_score_codex":0.0001960641,"about_ca_topic_score_gemma":0.00012905449,"teacher_disagreement_score":0.0053472007,"about_ca_system_score_codex":0.00083005574,"about_ca_system_score_gemma":0.0006099543,"threshold_uncertainty_score":0.017888129},"labels":[],"label_agreement":null},{"id":"W2591853747","doi":"10.1109/cjece.2016.2638962","title":"New Systolic Array Architecture for Finite Field Inversion","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"King Abdulaziz City for Science and Technology","keywords":"Architecture; Inversion (geology); Ranging; Systolic array; Application-specific integrated circuit; Power consumption; Computer science; Euclidean geometry; Finite field; Parallel computing; Algorithm; Computer engineering; Power (physics); Mathematics; Embedded system; Discrete mathematics; Telecommunications; Very-large-scale integration; Geometry","score_opus":0.0070217334734645745,"score_gpt":0.1827183458549758,"score_spread":0.1756966123815112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591853747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.0447538,0.0009818093,0.9373071,0.00023683929,0.00030754163,0.00007499857,0.000101102036,0.0017623405,0.014474418],"genre_scores_gemma":[0.3695735,0.00091496954,0.61474836,0.00030995408,0.00026934067,0.00013340809,0.00051398,0.000073470765,0.01346297],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998443,0.000029048877,0.000015050912,0.000026229063,0.000064662425,0.00002062921],"domain_scores_gemma":[0.99984217,0.000025109106,0.000018931001,0.000021540196,0.00007939403,0.000012836529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018616256,0.00031644836,0.00024166466,0.0004496818,0.00027619055,0.00044260922,0.00087408157,0.0003503083,0.002940765],"category_scores_gemma":[0.00029955778,0.00014952327,0.0003124713,0.0005503034,0.00021574814,0.0007146012,0.0003314906,0.00040986587,0.0011987773],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003748859,0.00015451893,0.0013928992,0.0003317705,0.00009806781,0.0005154779,0.00016536457,0.038361825,0.3425255,0.059275355,0.008227633,0.5485767],"study_design_scores_gemma":[0.00026314234,0.0023315924,0.0021622414,0.000117099975,0.00020258132,0.0028428147,0.00012019562,0.57001555,0.23498037,0.02234977,0.16450183,0.000112838956],"about_ca_topic_score_codex":0.00042954326,"about_ca_topic_score_gemma":0.0010278677,"teacher_disagreement_score":0.002940765,"about_ca_system_score_codex":0.00035522165,"about_ca_system_score_gemma":0.00066381367,"threshold_uncertainty_score":0.009837866},"labels":[],"label_agreement":null},{"id":"W2592025126","doi":"10.1109/tc.2017.2676763","title":"Efficient Composited de Bruijn Sequence Generators","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; Cisco Systems","keywords":"De Bruijn sequence; Sequence (biology); Computer science; Application-specific integrated circuit; Algorithm; Stream cipher; Parallel computing; Discrete mathematics; Mathematics; Cryptography; Computer hardware","score_opus":0.026515201882527626,"score_gpt":0.26316942932266646,"score_spread":0.23665422744013884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592025126","genre_codex":"methods","genre_gemma":"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.13549137,0.0011339068,0.82979375,0.00039622383,0.00034184978,0.0004750133,0.0006070176,0.0055357628,0.026225049],"genre_scores_gemma":[0.59510106,0.0002464835,0.38212025,0.00017817794,0.0000885231,0.0002849829,0.0010150023,0.00018913062,0.02077637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.00013355303,0.000076792574,0.00018162238,0.00039578605,0.00014364376],"domain_scores_gemma":[0.9992811,0.00022810767,0.00007181643,0.00016292221,0.00019513298,0.000060918082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003898305,0.0005395115,0.0006011798,0.00060318713,0.00042611625,0.00079769694,0.000934674,0.0005326061,0.006363661],"category_scores_gemma":[0.0015301578,0.0002986578,0.00031100193,0.0005855257,0.00041730402,0.0012735412,0.0010698604,0.00067754864,0.0021409916],"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.0022423433,0.0003528712,0.0015521249,0.00062475627,0.000073666,0.00079423137,0.00032707443,0.061209865,0.25607425,0.10535723,0.014436423,0.5569551],"study_design_scores_gemma":[0.0005469968,0.0009819615,0.0013946482,0.00008664193,0.0000614698,0.001581138,0.00009132746,0.5441895,0.34173355,0.040068004,0.069151886,0.00011285183],"about_ca_topic_score_codex":0.0005189565,"about_ca_topic_score_gemma":0.001088192,"teacher_disagreement_score":0.006363661,"about_ca_system_score_codex":0.00073780393,"about_ca_system_score_gemma":0.0010608116,"threshold_uncertainty_score":0.021288574},"labels":[],"label_agreement":null},{"id":"W2592036444","doi":"","title":"On The Extended Lee Weights Modulo 2e Of Linear Codes Over Z 2s .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Mathematics; Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.01572812407434099,"score_gpt":0.2523891981314223,"score_spread":0.2366610740570813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592036444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.78188837,0.0020359266,0.068415344,0.0021332258,0.00078858266,0.00007431055,0.0005491875,0.0002175023,0.1438977],"genre_scores_gemma":[0.96502686,0.0011491205,0.0080069285,0.00036549964,0.00050789956,0.00006404042,0.0003044172,0.00011343964,0.024461811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993748,0.00014013403,0.000028362421,0.00006883585,0.00018480058,0.00020316824],"domain_scores_gemma":[0.9987602,0.00042935042,0.00029744842,0.00017027777,0.00012927984,0.00021349634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007338525,0.0008743006,0.0006216078,0.0027989047,0.0014561496,0.002053722,0.0007640925,0.0009245886,0.0077583333],"category_scores_gemma":[0.0029740625,0.00039980284,0.0004900432,0.001697585,0.0028886427,0.004098763,0.0024717988,0.0020722738,0.0015350225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011030616,0.000039097733,0.00059851207,0.00005589495,0.000010791705,0.00020257743,0.00024825515,0.0023036383,0.0016779883,0.98171806,0.0017658742,0.011269102],"study_design_scores_gemma":[0.000024189363,0.000031135143,0.0005357323,0.00004528098,0.000007096951,0.00019115416,0.000106684114,0.006040889,0.0010078883,0.9885582,0.0034276794,0.000024078152],"about_ca_topic_score_codex":0.00086933933,"about_ca_topic_score_gemma":0.0011557466,"teacher_disagreement_score":0.0077583333,"about_ca_system_score_codex":0.00085740915,"about_ca_system_score_gemma":0.00061738334,"threshold_uncertainty_score":0.025954187},"labels":[],"label_agreement":null},{"id":"W2592298307","doi":"","title":"Complexity evaluation of sova based algorithms for decoding of block codes on a sectionalized trellis","year":2002,"lang":"en","type":"article","venue":"International Symposium on Antenna Technology and Applied Electromagnetics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Trellis (graph); Algorithm; Decoding methods; Soft-decision decoder; Computer science; Viterbi decoder; Convolutional code; Viterbi algorithm; Space–time trellis code; Code (set theory); Block (permutation group theory); Block code; Concatenated error correction code; Mathematics; Set (abstract data type)","score_opus":0.03971983485582078,"score_gpt":0.27656002404918595,"score_spread":0.23684018919336516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592298307","genre_codex":"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.13689886,0.0011578334,0.8522069,0.00031967767,0.0000904713,0.00016134854,0.0002347885,0.0009314607,0.007998683],"genre_scores_gemma":[0.6626138,0.0007876916,0.33183384,0.00015369733,0.00010670138,0.000351719,0.00090037077,0.00033577753,0.0029164501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974241,0.00084252126,0.00012800876,0.00022730629,0.0011117071,0.0002662299],"domain_scores_gemma":[0.9877509,0.008815274,0.00064828916,0.00087398314,0.0017159362,0.00019549706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018473925,0.0010664845,0.0009081058,0.0012962371,0.00048249846,0.0015291957,0.001246432,0.0010105483,0.0020767022],"category_scores_gemma":[0.01338351,0.00038625833,0.0008784889,0.0010354276,0.0009319955,0.0019404606,0.0011569567,0.0012943274,0.00046647261],"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.0006377631,0.00006903141,0.0016848071,0.00019004296,0.000096291646,0.000056653924,0.00009719877,0.9024792,0.009421206,0.02980935,0.0012180086,0.054240495],"study_design_scores_gemma":[0.0000079399515,0.00006722961,0.00018244218,0.0000072003095,0.0000066272796,0.000016924063,0.0000098439195,0.99351174,0.0019760514,0.004019425,0.00018846885,0.000006233322],"about_ca_topic_score_codex":0.0031030923,"about_ca_topic_score_gemma":0.0031490687,"teacher_disagreement_score":0.0031030923,"about_ca_system_score_codex":0.0028483854,"about_ca_system_score_gemma":0.0027803686,"threshold_uncertainty_score":0.0206666},"labels":[],"label_agreement":null},{"id":"W2593294883","doi":"10.1090/surv/210/12","title":"Denis-Mordell-Lang conjecture","year":2016,"lang":"en","type":"book-chapter","venue":"Mathematical surveys and monographs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Pure mathematics","score_opus":0.017302824789876062,"score_gpt":0.2177017726850823,"score_spread":0.20039894789520624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593294883","genre_codex":"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.05322762,0.010339843,0.0742149,0.07677801,0.005087498,0.00007031575,0.002067595,0.0007093618,0.77750486],"genre_scores_gemma":[0.70303464,0.013141929,0.02857533,0.019054407,0.006217837,0.0004328235,0.0026335148,0.0005116724,0.22639786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987948,0.00024295569,0.000055771307,0.00029729935,0.00039573282,0.00021345385],"domain_scores_gemma":[0.9976399,0.0011354273,0.0001185096,0.0005141572,0.00044229126,0.0001497549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001594492,0.00086358027,0.0014222926,0.001635219,0.002701658,0.004213451,0.0010961863,0.0027619202,0.013620099],"category_scores_gemma":[0.0075569157,0.0004952538,0.00088411843,0.0016439157,0.004706246,0.0077591627,0.00342159,0.005731684,0.0075099305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025197081,0.000012603991,0.00017603092,0.00004173787,0.0000056738354,0.000030523086,0.00011228266,0.00031029864,0.00010398184,0.97153664,0.01877238,0.008872661],"study_design_scores_gemma":[0.000006701833,0.0000029228202,0.000083956984,0.00002348719,0.0000043981213,0.00003479129,0.000034041466,0.00067752926,0.0001198335,0.97911674,0.019889751,0.0000058683604],"about_ca_topic_score_codex":0.0018924888,"about_ca_topic_score_gemma":0.001769037,"teacher_disagreement_score":0.013620099,"about_ca_system_score_codex":0.0026147123,"about_ca_system_score_gemma":0.0020312655,"threshold_uncertainty_score":0.045563817},"labels":[],"label_agreement":null},{"id":"W2596944507","doi":"10.5539/jmr.v9n2p56","title":"The Cardinality of the Set of Zeros of Homogeneous Linear Recurring Sequences over Finite Fields","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cardinality (data modeling); Finite field; Combinatorics; Upper and lower bounds; Homogeneous; Order (exchange); Finite set; Discrete mathematics; Degree (music); Homogeneous polynomial; Polynomial; Mathematical analysis; Matrix polynomial","score_opus":0.15299439491424796,"score_gpt":0.41425802827489294,"score_spread":0.26126363336064495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596944507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9713776,0.0002415079,0.02182497,0.00026334787,0.000020749265,0.000018035716,0.0012006097,0.000088662804,0.004964548],"genre_scores_gemma":[0.9936679,0.0002689348,0.0043637487,0.000030050684,0.000065311906,0.000047306665,0.00070830196,0.000031776188,0.0008166632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848336,0.00035556158,0.00014271981,0.0002957962,0.00034953438,0.000372946],"domain_scores_gemma":[0.9870042,0.008585378,0.0019284217,0.0009404976,0.0006716173,0.0008698144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014148463,0.00051760365,0.0008961329,0.002285521,0.0011023832,0.0023992164,0.0011079299,0.00066720985,0.002482495],"category_scores_gemma":[0.009513836,0.00044230066,0.0005452795,0.0010062376,0.002044701,0.002909156,0.0016614326,0.00097450835,0.0003186007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004205045,0.0004368888,0.057320233,0.00091552554,0.0003013399,0.0023662718,0.002016581,0.10639036,0.116416536,0.6567151,0.00431053,0.04860563],"study_design_scores_gemma":[0.00018120401,0.0004861421,0.024422282,0.00041722078,0.00018530752,0.0029313925,0.0009694376,0.34582052,0.08040586,0.538491,0.0054028924,0.00028666333],"about_ca_topic_score_codex":0.00044808508,"about_ca_topic_score_gemma":0.0002723433,"teacher_disagreement_score":0.002482495,"about_ca_system_score_codex":0.0010948277,"about_ca_system_score_gemma":0.00078449916,"threshold_uncertainty_score":0.008304775},"labels":[],"label_agreement":null},{"id":"W2605666455","doi":"10.1016/j.ffa.2017.03.010","title":"A note on character sums in finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Fondation Mathématique Jacques Hadamard","keywords":"Character (mathematics); Mathematics; Finite field; Combinatorics; Pure mathematics; Algebra over a field; Discrete mathematics; Geometry","score_opus":0.01970817639311891,"score_gpt":0.257624574949498,"score_spread":0.23791639855637906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605666455","genre_codex":"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.101128146,0.06544522,0.24777292,0.055935774,0.040668197,0.0000982098,0.00080860796,0.0008810382,0.4872619],"genre_scores_gemma":[0.71564126,0.03664697,0.049935155,0.0106943995,0.05904817,0.0002403553,0.0006384973,0.0007214593,0.12643385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998437,0.0005369522,0.00012525258,0.0002517362,0.00045502844,0.00019406456],"domain_scores_gemma":[0.9954596,0.0033834889,0.0001532169,0.00036699726,0.00034188078,0.0002947728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019678476,0.0017095617,0.0022125905,0.00440367,0.00399367,0.005571544,0.0018433268,0.0027412,0.0065042297],"category_scores_gemma":[0.0065206056,0.00078043813,0.0014604478,0.00516791,0.0063653197,0.016124964,0.005146577,0.008554451,0.0013614355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021882726,0.000018461897,0.00008612243,0.00007430486,0.000007916153,0.000088353816,0.00014898201,0.00039802847,0.00033336418,0.9856592,0.0062078536,0.0069555338],"study_design_scores_gemma":[0.00000376183,0.000011826263,0.00008327218,0.00002640761,0.000007935198,0.00009678202,0.00003354296,0.0008051808,0.00020817123,0.979722,0.018988624,0.0000124979815],"about_ca_topic_score_codex":0.00067846134,"about_ca_topic_score_gemma":0.0007846835,"teacher_disagreement_score":0.0065042297,"about_ca_system_score_codex":0.0020619722,"about_ca_system_score_gemma":0.00079027744,"threshold_uncertainty_score":0.021758854},"labels":[],"label_agreement":null},{"id":"W2611888257","doi":"10.1090/mcom/3363","title":"Computing isomorphisms and embeddings of finite fields","year":2018,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Isomorphism (crystallography); Embedding; Factorization; Mathematics; Field (mathematics); Polynomial; Algebra over a field; Code (set theory); Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Computer science; Programming language; Mathematical analysis","score_opus":0.014111342457953875,"score_gpt":0.2583754253024896,"score_spread":0.2442640828445357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611888257","genre_codex":"methods","genre_gemma":"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.34038463,0.0020126202,0.58092546,0.002472382,0.00052483083,0.00014438637,0.0038133366,0.0066600568,0.06306227],"genre_scores_gemma":[0.8276234,0.0009996298,0.14206031,0.00030840392,0.00033819897,0.00012251231,0.006153422,0.0011720621,0.021222008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666995,0.0007998693,0.00031847777,0.00087804394,0.0007868034,0.0005467936],"domain_scores_gemma":[0.99504787,0.0026440143,0.00036106855,0.0009840582,0.00066581066,0.00029717232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173887,0.0009877594,0.00081323914,0.0028948204,0.0013970461,0.0051633352,0.0012656256,0.0011258804,0.0140377395],"category_scores_gemma":[0.010843763,0.00089079264,0.0015674946,0.0028210606,0.0028171623,0.01369018,0.0047602053,0.002402269,0.0035337396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030662314,0.00015089044,0.004439178,0.00036967546,0.000065067776,0.000378249,0.0021963036,0.006210955,0.0027411273,0.85771537,0.010464867,0.11496172],"study_design_scores_gemma":[0.000027434782,0.000050548337,0.0007889404,0.000071740214,0.000029258368,0.00016320097,0.00075651647,0.009313617,0.0029038184,0.9731636,0.012702592,0.000028684743],"about_ca_topic_score_codex":0.0023110216,"about_ca_topic_score_gemma":0.0029004235,"teacher_disagreement_score":0.0140377395,"about_ca_system_score_codex":0.0023395868,"about_ca_system_score_gemma":0.00093794527,"threshold_uncertainty_score":0.04696089},"labels":[],"label_agreement":null},{"id":"W2612667250","doi":"10.1007/s12095-018-0300-y","title":"A lower bound on the 2-adic complexity of the modified Jacobi sequence","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Mathematics; Gauss; Upper and lower bounds; Combinatorics; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.10689209376763982,"score_gpt":0.29245332446002376,"score_spread":0.18556123069238395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612667250","genre_codex":"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.35503697,0.009395515,0.3593788,0.016456341,0.0022111773,0.00023052975,0.0019866873,0.00076971756,0.2545343],"genre_scores_gemma":[0.90895957,0.0030418162,0.045923375,0.0014955674,0.0020299826,0.00035415578,0.0010322029,0.00030833625,0.03685495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827456,0.00033739864,0.00008703534,0.00025297597,0.00074388605,0.00030412496],"domain_scores_gemma":[0.99011153,0.0069661904,0.0005207143,0.0011505099,0.00065146026,0.00059958093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015931157,0.001525166,0.0014183356,0.0025171104,0.00146857,0.003468882,0.0026073323,0.0023395892,0.01264206],"category_scores_gemma":[0.011974562,0.0006000727,0.00096124725,0.0020921105,0.0030847052,0.008008095,0.0035455802,0.0054847025,0.002278785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025782973,0.00007360729,0.0006850882,0.00020064008,0.000028701754,0.00015145657,0.0002041076,0.017873053,0.005322168,0.9514889,0.006022088,0.017692303],"study_design_scores_gemma":[0.000029218887,0.00006500391,0.00050992315,0.000053442818,0.000018852272,0.00018973525,0.00003773694,0.059922818,0.0023439948,0.93158054,0.0052064764,0.00004229857],"about_ca_topic_score_codex":0.00067721517,"about_ca_topic_score_gemma":0.0007618215,"teacher_disagreement_score":0.01264206,"about_ca_system_score_codex":0.0025829438,"about_ca_system_score_gemma":0.0016743907,"threshold_uncertainty_score":0.04229188},"labels":[],"label_agreement":null},{"id":"W2612757204","doi":"10.3934/amc.2017034","title":"Cycle structure of iterating Redei functions","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Quadratic equation; Prime (order theory); Reciprocity law; Exponentiation; Reciprocity (cultural anthropology); Pure mathematics; Mathematical analysis; Mathematical physics; Combinatorics; Geometry","score_opus":0.019119330575086114,"score_gpt":0.31570619899013586,"score_spread":0.2965868684150497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612757204","genre_codex":"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.89300334,0.000305151,0.08638277,0.00017487371,0.000033408385,0.00004642207,0.00016451461,0.00018427959,0.019705283],"genre_scores_gemma":[0.97981197,0.00017664554,0.008081636,0.000032751857,0.000030571093,0.000046428475,0.00016372495,0.00006224488,0.011594077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.000043063774,0.00001788813,0.000049597118,0.00007475284,0.00011467956],"domain_scores_gemma":[0.99853754,0.0005085328,0.00022122652,0.0002177093,0.00028583416,0.00022918802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049070746,0.00034939064,0.00044583998,0.0017436543,0.0011959597,0.001526478,0.000638963,0.0006254075,0.00427275],"category_scores_gemma":[0.0024978989,0.0003452175,0.00049391115,0.0006854116,0.0018856819,0.0022443752,0.0013758759,0.00093911804,0.0006438485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020931111,0.000030471887,0.0029621006,0.000043662785,0.000009104338,0.00032708107,0.0010839865,0.0077885715,0.004784907,0.97105634,0.0006069833,0.011097464],"study_design_scores_gemma":[0.0000358227,0.00013430267,0.0025414678,0.000054111148,0.00002096188,0.00041261475,0.0005571928,0.08208049,0.00975203,0.8979328,0.0064161858,0.0000619269],"about_ca_topic_score_codex":0.0010968612,"about_ca_topic_score_gemma":0.00072154764,"teacher_disagreement_score":0.00427275,"about_ca_system_score_codex":0.0009284918,"about_ca_system_score_gemma":0.00039171713,"threshold_uncertainty_score":0.01429379},"labels":[],"label_agreement":null},{"id":"W2612896625","doi":"10.5539/jmr.v9n3p8","title":"Quadratic form Approach for the Number of Zeros of Homogeneous Linear Recurring Sequences over Finite Fields","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cardinality (data modeling); Finite field; Sequence (biology); Homogeneous; Combinatorics; Order (exchange); Homogeneous polynomial; Finite set; Quadratic equation; Degree (music); Polynomial; Discrete mathematics; Field (mathematics); Pure mathematics; Mathematical analysis; Matrix polynomial; Geometry","score_opus":0.15525263400656467,"score_gpt":0.4206935265602448,"score_spread":0.2654408925536801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612896625","genre_codex":"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.910309,0.00063679414,0.07620155,0.00051080674,0.00007843013,0.000032854452,0.00033135523,0.000116475574,0.011782738],"genre_scores_gemma":[0.982932,0.00039320008,0.0114578605,0.00005382694,0.00020630592,0.000059334616,0.00027320877,0.00003541468,0.004588786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894255,0.00022177368,0.00007345361,0.00026326958,0.00027461527,0.00022433717],"domain_scores_gemma":[0.994495,0.003180099,0.0007697355,0.0004057215,0.0005225852,0.000626895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001330747,0.0006365715,0.0007524216,0.004374342,0.0010674838,0.001553006,0.0013055787,0.00065584725,0.0046431986],"category_scores_gemma":[0.0061919745,0.00030829545,0.00050022115,0.0014889651,0.002710933,0.0040544225,0.0017543064,0.001163398,0.00049215724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076421344,0.00024096745,0.0142893195,0.00041306426,0.00007347824,0.0010045214,0.00144546,0.02458519,0.02421373,0.8971922,0.0016154548,0.034162447],"study_design_scores_gemma":[0.00007155216,0.00038710402,0.0066656847,0.00012243098,0.000081168655,0.0015748353,0.0005216434,0.17346297,0.015528702,0.79506016,0.0063791447,0.00014466592],"about_ca_topic_score_codex":0.00043081882,"about_ca_topic_score_gemma":0.00028175267,"teacher_disagreement_score":0.0046431986,"about_ca_system_score_codex":0.0011293531,"about_ca_system_score_gemma":0.00039457995,"threshold_uncertainty_score":0.01553303},"labels":[],"label_agreement":null},{"id":"W2619009655","doi":"10.1007/978-3-319-59250-3_1","title":"The Two-Point Fano and Ideal Binary Clutters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fano plane; Ideal (ethics); Combinatorics; Binary number; Physics; Clutter; Mathematics; Pure mathematics; Computer science; Arithmetic; Telecommunications; Philosophy","score_opus":0.013322530168720365,"score_gpt":0.24383165557086064,"score_spread":0.23050912540214027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619009655","genre_codex":"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.12852778,0.006642941,0.12044686,0.0038788307,0.0012067095,0.00006121232,0.00048233249,0.0003958558,0.7383574],"genre_scores_gemma":[0.86391,0.0033136494,0.022287235,0.00092803803,0.0014347904,0.00008391448,0.0003748395,0.0002461738,0.10742134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940217,0.000141131,0.000022949838,0.000113583024,0.00019603278,0.000124113],"domain_scores_gemma":[0.9993299,0.00026740337,0.00006481439,0.00011153146,0.000107648986,0.000118681484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007690137,0.0008721499,0.0007889114,0.0027899714,0.0023238633,0.0033882486,0.00074032147,0.0011929941,0.0118041625],"category_scores_gemma":[0.0027984455,0.00044992962,0.00059817167,0.0017435895,0.004535923,0.0050579174,0.0020341084,0.0023341828,0.0017366118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012261167,0.0000030179763,0.000026641334,0.0000092573955,0.0000010461046,0.00001237055,0.00004434533,0.00016989754,0.00008866701,0.99500966,0.00133112,0.0032918495],"study_design_scores_gemma":[0.000006421498,0.0000051066054,0.00006082515,0.0000123362315,0.0000020479897,0.000089054025,0.000031121665,0.00087413396,0.00014794087,0.98982215,0.008940335,0.000008569148],"about_ca_topic_score_codex":0.0008859514,"about_ca_topic_score_gemma":0.000516907,"teacher_disagreement_score":0.0118041625,"about_ca_system_score_codex":0.0013176303,"about_ca_system_score_gemma":0.0005229241,"threshold_uncertainty_score":0.039488852},"labels":[],"label_agreement":null},{"id":"W2624155812","doi":"10.1007/s12095-017-0233-x","title":"The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Shandong Province","keywords":"Autocorrelation; Pseudorandom binary sequence; Mathematics; Binary number; Sequence (biology); Complementary sequences; Class (philosophy); Distribution (mathematics); Stream cipher; Autocorrelation matrix; Combinatorics; Discrete mathematics; Time complexity; Algorithm; Cryptography; Computer science; Statistics; Arithmetic; Mathematical analysis","score_opus":0.03889153615739618,"score_gpt":0.2767834628078698,"score_spread":0.23789192665047362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624155812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.886413,0.0010802869,0.09672494,0.0011713232,0.000060179882,0.000041435924,0.00046430225,0.00017129649,0.013873224],"genre_scores_gemma":[0.99302626,0.0003443709,0.0043206457,0.000094725125,0.00012109324,0.00003672098,0.0001771206,0.00003199015,0.0018470795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858826,0.00035740546,0.00007135171,0.00023084777,0.00044473822,0.00030740703],"domain_scores_gemma":[0.98861116,0.0077711865,0.0015503062,0.00076853967,0.00067256996,0.00062614173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016500768,0.0008566126,0.0010523123,0.0028174717,0.0011414858,0.003320472,0.0014221002,0.0014881486,0.0026932636],"category_scores_gemma":[0.012738145,0.00057621585,0.0005378787,0.0019633332,0.002993714,0.0041985363,0.0015167639,0.0016939427,0.00033807257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032366536,0.00011014086,0.0031594418,0.00011443132,0.000038321392,0.00035608726,0.00034697974,0.052440744,0.0060385955,0.923467,0.0013053054,0.01229926],"study_design_scores_gemma":[0.000059869413,0.000091523405,0.0024397338,0.000043781274,0.000020499292,0.0004796728,0.0001135864,0.21944472,0.0024417965,0.77387446,0.00092641875,0.0000639524],"about_ca_topic_score_codex":0.0009273391,"about_ca_topic_score_gemma":0.0008524168,"teacher_disagreement_score":0.003320472,"about_ca_system_score_codex":0.0021179353,"about_ca_system_score_gemma":0.001752773,"threshold_uncertainty_score":0.015366733},"labels":[],"label_agreement":null},{"id":"W2634535468","doi":"10.1017/s0305004119000100","title":"Chebyshev’s bias for analytic<i>L</i>-functions","year":2019,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Logarithm; Chebyshev filter; Chebyshev equation; Dirichlet distribution; Pure mathematics; Prime (order theory); Independence (probability theory); Chebyshev polynomials; Discrete mathematics; Combinatorics; Mathematical analysis; Statistics; Orthogonal polynomials","score_opus":0.027308256757302043,"score_gpt":0.23471868974642648,"score_spread":0.20741043298912443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2634535468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8122531,0.0007120954,0.15654168,0.0017329805,0.00008795851,0.000043155873,0.00016901543,0.00017671529,0.028283427],"genre_scores_gemma":[0.9932446,0.00019636571,0.0042345137,0.00015200471,0.000092454036,0.000027805572,0.000046357094,0.00003646346,0.0019694357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989046,0.00035518614,0.000044009863,0.00018248367,0.00029056982,0.0002231791],"domain_scores_gemma":[0.99202794,0.0048520695,0.0009326818,0.0008152151,0.00086685683,0.0005052805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003741277,0.00035241645,0.00085544854,0.0021279096,0.00092416804,0.0020805122,0.00079726346,0.0007854084,0.004139142],"category_scores_gemma":[0.015162687,0.0003016965,0.0005420679,0.00088829274,0.004541727,0.0036342544,0.0018115832,0.0017545768,0.00039616108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007652579,0.000013441129,0.00224101,0.00003173105,0.000008370673,0.00006743575,0.00014247057,0.0021417174,0.002801805,0.9883295,0.00046942013,0.0036765146],"study_design_scores_gemma":[0.000033921984,0.00006399519,0.0026434145,0.000044389093,0.000012652435,0.0003629574,0.00013617835,0.059437882,0.0059805443,0.9287799,0.0024605028,0.00004367349],"about_ca_topic_score_codex":0.00058306666,"about_ca_topic_score_gemma":0.00014960855,"teacher_disagreement_score":0.004139142,"about_ca_system_score_codex":0.0020541854,"about_ca_system_score_gemma":0.0005330505,"threshold_uncertainty_score":0.019786},"labels":[],"label_agreement":null},{"id":"W2635647965","doi":"10.1093/imrn/rnz217","title":"The Image Size of Iterated Rational Maps over Finite Fields","year":2019,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Iterated function; Mathematics; Finite field; Image (mathematics); Modulo; Prime (order theory); Combinatorics; Discrete mathematics; Degree (music); Rational function; Number theory; Field (mathematics); Algebraic number field; Connection (principal bundle); Pure mathematics; Mathematical analysis; Geometry; Physics","score_opus":0.06299207860439189,"score_gpt":0.38053121133398315,"score_spread":0.3175391327295913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2635647965","genre_codex":"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.986585,0.00015540057,0.007646572,0.00025134193,0.000011729193,0.000011121573,0.00009037211,0.00008576062,0.005162563],"genre_scores_gemma":[0.99769634,0.0001077868,0.0012882496,0.000016413805,0.00002671429,0.000017495482,0.00008749126,0.000021718088,0.00073774444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992071,0.00015443684,0.000035531113,0.00016414605,0.0002624007,0.00017646092],"domain_scores_gemma":[0.98960936,0.0074280063,0.0009494782,0.00068681844,0.000589807,0.000736484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013400824,0.00032908964,0.0006925189,0.0022508479,0.00077351206,0.002665893,0.001145275,0.0006594738,0.0034744178],"category_scores_gemma":[0.012816242,0.00043454746,0.00040486667,0.0005357195,0.0026045907,0.0034615546,0.0013923814,0.00093751913,0.0002119114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017182943,0.0003895324,0.03778898,0.00039017154,0.00014628905,0.0011936766,0.0018763002,0.056284573,0.064564414,0.7988591,0.0025064298,0.034282327],"study_design_scores_gemma":[0.00015638697,0.000389234,0.030236097,0.00018517429,0.00017809997,0.001719185,0.0010221406,0.3673449,0.07926295,0.51603186,0.0033289283,0.00014506046],"about_ca_topic_score_codex":0.00090973097,"about_ca_topic_score_gemma":0.00046558792,"teacher_disagreement_score":0.0034744178,"about_ca_system_score_codex":0.0018580217,"about_ca_system_score_gemma":0.0005484748,"threshold_uncertainty_score":0.013480961},"labels":[],"label_agreement":null},{"id":"W26459003","doi":"10.1016/j.bbagen.2015.10.003","title":"Double-Change Circular Covering Designs: Constructions And Applications","year":2014,"lang":"en","type":"article","venue":"Biochimica et Biophysica Acta","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Architectural engineering; Arithmetic; Geography; Engineering drawing; Mathematics; Engineering","score_opus":0.03365512668181491,"score_gpt":0.24889415553739289,"score_spread":0.21523902885557797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26459003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.13131036,0.013874488,0.8135937,0.000566034,0.00055926555,0.00019890194,0.0002744789,0.0008750367,0.038747735],"genre_scores_gemma":[0.6969314,0.008711031,0.28406718,0.00024229877,0.00023106314,0.00028913718,0.0002718933,0.00017631176,0.009079696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.00013904186,0.000034326775,0.000111108166,0.00013475538,0.00006125691],"domain_scores_gemma":[0.9993425,0.0002527373,0.00013099003,0.00015625896,0.000077420955,0.000040004677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054496276,0.00056880736,0.00037161863,0.0009916116,0.00050986314,0.0007184093,0.00050361874,0.0006093149,0.0022758197],"category_scores_gemma":[0.0013470748,0.00028162028,0.00050380046,0.0009842039,0.0009095503,0.00096848694,0.00078751816,0.0007346001,0.0008975492],"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.00032855826,0.0000809497,0.00091333006,0.0010866054,0.00004260891,0.0005564847,0.00046887956,0.017844168,0.09387013,0.5108635,0.0033752327,0.3705695],"study_design_scores_gemma":[0.00012826298,0.0018868636,0.0019100988,0.0004511007,0.0001313808,0.0063241026,0.00024857585,0.099667,0.25656635,0.39754418,0.2349049,0.00023715771],"about_ca_topic_score_codex":0.000121660974,"about_ca_topic_score_gemma":0.00010441974,"teacher_disagreement_score":0.0022758197,"about_ca_system_score_codex":0.00046194633,"about_ca_system_score_gemma":0.00022662335,"threshold_uncertainty_score":0.0076134205},"labels":[],"label_agreement":null},{"id":"W2725281740","doi":"10.5539/jmr.v9n4p23","title":"Sign of Permutations Induced by Anick and Nagata-Anick Automorphisms over Finite Fields","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Mathematics; Automorphism; Sign (mathematics); Finite field; Prime (order theory); Combinatorics; Inner automorphism; Automorphism group; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.131082758862121,"score_gpt":0.4011813500062456,"score_spread":0.2700985911441246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725281740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9247661,0.00023449103,0.04342825,0.0003776848,0.0003135731,0.00006374222,0.0001309348,0.000106002895,0.03057925],"genre_scores_gemma":[0.986901,0.0003025226,0.0061573135,0.00009411632,0.00013001027,0.00004768919,0.00016867988,0.000055637665,0.006142926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899477,0.00024570286,0.00007558663,0.000139958,0.00030442447,0.00023956863],"domain_scores_gemma":[0.9971693,0.0008003571,0.0007805905,0.00035014495,0.00049307436,0.00040652748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087931886,0.0003386643,0.0004384404,0.0012248555,0.0009721224,0.0015910737,0.00034248637,0.0006267877,0.0027438866],"category_scores_gemma":[0.004346268,0.00021634057,0.000598499,0.00059230335,0.0020702325,0.0029161465,0.0011852534,0.0011134476,0.0003763459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047497236,0.00009943606,0.008043237,0.00009131329,0.00002490215,0.00097052625,0.0006330352,0.0033151153,0.028699158,0.9362917,0.0008728287,0.020483777],"study_design_scores_gemma":[0.00012579963,0.00044454596,0.007024853,0.000071962175,0.000066125496,0.001758241,0.0007060352,0.017299617,0.033593982,0.9277319,0.011052863,0.00012408172],"about_ca_topic_score_codex":0.00034778102,"about_ca_topic_score_gemma":0.00030635874,"teacher_disagreement_score":0.0027438866,"about_ca_system_score_codex":0.00050340034,"about_ca_system_score_gemma":0.0007455432,"threshold_uncertainty_score":0.0091792345},"labels":[],"label_agreement":null},{"id":"W2730685951","doi":"","title":"Architectures matérielles pour le décodage des codes polaires","year":2011,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Physics; Humanities; Computer science; Philosophy","score_opus":0.028100078602222692,"score_gpt":0.22655887871947694,"score_spread":0.19845880011725425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730685951","genre_codex":"methods","genre_gemma":"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.0810745,0.0015150578,0.881796,0.0020254205,0.00037399272,0.00012444925,0.00010037919,0.0014029102,0.031587254],"genre_scores_gemma":[0.7672557,0.0017592906,0.19272535,0.0007594135,0.00030441195,0.00037102922,0.00015666573,0.0003082486,0.036359955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990877,0.00024047383,0.000043160868,0.0001207352,0.00039846514,0.000109482135],"domain_scores_gemma":[0.99824166,0.0009195881,0.00014514857,0.0002732534,0.00033562086,0.00008470972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226042,0.0008881501,0.00063195283,0.0008967248,0.00078889215,0.0024351918,0.00085525087,0.0016086103,0.0058686426],"category_scores_gemma":[0.003469848,0.0004913004,0.0004499515,0.00058197987,0.001586944,0.0019555143,0.001362607,0.002142397,0.0016373354],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045555443,0.00008451545,0.0005203384,0.00018778811,0.000059785947,0.00013374526,0.00026078336,0.12825853,0.0504565,0.75328714,0.0033784928,0.0629169],"study_design_scores_gemma":[0.000098434786,0.00017639797,0.00025778753,0.00005640346,0.000028030112,0.0001300584,0.00006443161,0.7574067,0.03266208,0.20027453,0.008798261,0.000046802135],"about_ca_topic_score_codex":0.001223764,"about_ca_topic_score_gemma":0.0017382404,"teacher_disagreement_score":0.0058686426,"about_ca_system_score_codex":0.0020195413,"about_ca_system_score_gemma":0.0011552244,"threshold_uncertainty_score":0.019632578},"labels":[],"label_agreement":null},{"id":"W2731346518","doi":"10.1017/s0963548318000342","title":"Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives","year":2018,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Mathematics; Upper and lower bounds; Bounding overwatch; Combinatorics; Hermite polynomials; Uniqueness; Polynomial; Context (archaeology); Grid; Orthogonal polynomials; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.03031485595492576,"score_gpt":0.2887224744568492,"score_spread":0.2584076185019234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731346518","genre_codex":"empirical","genre_gemma":"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.59497684,0.00054786296,0.3913942,0.000505425,0.000045756915,0.00004218228,0.00027449295,0.00021792836,0.011995306],"genre_scores_gemma":[0.9700528,0.00029957216,0.02733729,0.00004751397,0.00005641859,0.00005173347,0.00015188067,0.000068470385,0.0019343136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983126,0.00036136742,0.00008504689,0.0003165262,0.0005504203,0.00037406967],"domain_scores_gemma":[0.98991966,0.0059828707,0.0014224625,0.0014601856,0.0005475346,0.0006672901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019303912,0.0007225282,0.0010139588,0.0019386773,0.00096261513,0.0020908616,0.0019116785,0.0006997422,0.0032558972],"category_scores_gemma":[0.012018635,0.00039804686,0.0005752797,0.0016712387,0.00363968,0.005468875,0.0035915782,0.0017549954,0.00043782665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000453095,0.00013834322,0.014652446,0.00021185503,0.00006421543,0.0005372044,0.00044788638,0.07738073,0.01779499,0.8527178,0.0013474292,0.034253996],"study_design_scores_gemma":[0.000028361334,0.0001895317,0.0020758286,0.000046233592,0.00004209974,0.0006032068,0.00016512591,0.33739093,0.025665719,0.630638,0.0031057561,0.000049154987],"about_ca_topic_score_codex":0.0004143078,"about_ca_topic_score_gemma":0.0005240638,"teacher_disagreement_score":0.0032558972,"about_ca_system_score_codex":0.001246648,"about_ca_system_score_gemma":0.0005558189,"threshold_uncertainty_score":0.010892093},"labels":[],"label_agreement":null},{"id":"W2732089117","doi":"10.13069/jacodesmath.327375","title":"On the equivalence of cyclic and quasi-cyclic codes over finite fields","year":2017,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cyclic code; Huffman coding; Mathematics; Cyclic group; Combinatorics; Discrete mathematics; Equivalence (formal languages); Prime (order theory); Linear code; Block code; Algorithm; Decoding methods; Data compression","score_opus":0.012767901897734298,"score_gpt":0.2660729161778279,"score_spread":0.2533050142800936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732089117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.72275555,0.0017196843,0.20995013,0.0038127385,0.0002411718,0.00014630334,0.00039626,0.00016334273,0.060814753],"genre_scores_gemma":[0.975233,0.00097399525,0.018826254,0.00033255437,0.00042918717,0.00005604961,0.0005752346,0.0000660592,0.0035076255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613684,0.0012234551,0.0002991665,0.0007017863,0.0010387643,0.0005999712],"domain_scores_gemma":[0.97923,0.015610813,0.0015175729,0.0017132777,0.0013302336,0.0005981529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003260693,0.0003769698,0.00084980135,0.0017019528,0.001898282,0.0026970035,0.0013177972,0.0017735013,0.004397976],"category_scores_gemma":[0.020554833,0.00036593157,0.0006943148,0.0015441513,0.0048021236,0.011975747,0.0027946862,0.002791694,0.00046893876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030843323,0.00012641739,0.002334287,0.000097926575,0.000016381568,0.00021823644,0.0011157339,0.006360656,0.0019162875,0.9521943,0.001121386,0.034189858],"study_design_scores_gemma":[0.000026833197,0.00008176794,0.0007115411,0.000034070606,0.000011472854,0.00025045505,0.00034932946,0.013387944,0.001817314,0.9806317,0.0026781019,0.000019529089],"about_ca_topic_score_codex":0.0010471715,"about_ca_topic_score_gemma":0.0005320163,"teacher_disagreement_score":0.004397976,"about_ca_system_score_codex":0.0013825248,"about_ca_system_score_gemma":0.00095228694,"threshold_uncertainty_score":0.017244339},"labels":[],"label_agreement":null},{"id":"W2734990741","doi":"10.1145/3092951","title":"High-Performance Ideal Lattice-Based Cryptography on 8-Bit AVR Microcontrollers","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Public Works and Government Services Canada; Hansung University","keywords":"Computer science; Cryptography; Lattice-based cryptography; Encryption; Microcontroller; BLISS; Ring oscillator; Lattice (music); Embedded system; Computer engineering; Computer hardware; Quantum cryptography; Quantum; Algorithm; Computer security; Operating system; Quantum information; Physics; Quantum mechanics","score_opus":0.018539254408967837,"score_gpt":0.2495674323668857,"score_spread":0.23102817795791786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734990741","genre_codex":"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.83046913,0.00066496496,0.14621055,0.00038280708,0.00014948056,0.00016693982,0.00017461122,0.0056700567,0.016111497],"genre_scores_gemma":[0.97711,0.00005563577,0.021235334,0.00003742915,0.0000073649594,0.000038511283,0.00004486912,0.000049250528,0.0014216139],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873585,0.0004080143,0.00008906725,0.00013356979,0.00047682878,0.00015671],"domain_scores_gemma":[0.99890983,0.0003593836,0.00018245434,0.00021765403,0.0002640064,0.00006667805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076240464,0.0003909503,0.0005176656,0.0005385941,0.00031172266,0.00077573064,0.0009938305,0.0004554144,0.0048092664],"category_scores_gemma":[0.0024265735,0.00016054627,0.00014992701,0.00042648238,0.00044583576,0.0018754124,0.00056755776,0.0004841473,0.0010345904],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067329947,0.00075014326,0.0064730337,0.0012932956,0.00015869614,0.001388656,0.0007377442,0.30364805,0.36653987,0.08577802,0.008874651,0.2176249],"study_design_scores_gemma":[0.00035305775,0.0029039553,0.0016464458,0.000086625056,0.000048363912,0.0006908621,0.00017523726,0.7107775,0.2594993,0.010123329,0.013606889,0.00008838002],"about_ca_topic_score_codex":0.00046424335,"about_ca_topic_score_gemma":0.00038393232,"teacher_disagreement_score":0.0048092664,"about_ca_system_score_codex":0.0006785845,"about_ca_system_score_gemma":0.00056236703,"threshold_uncertainty_score":0.016088605},"labels":[],"label_agreement":null},{"id":"W2735846137","doi":"10.13154/tosc.v2017.i2.27-58","title":"New Constructions of MACs from (Tweakable) Block Ciphers","year":2017,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Block (permutation group theory); Computer science; Block cipher; Arithmetic; Parallel computing; Mathematics; Algorithm; Cryptography; Combinatorics","score_opus":0.21282791171314513,"score_gpt":0.5227469216745202,"score_spread":0.30991900996137506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735846137","genre_codex":"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.04476898,0.000897223,0.94138676,0.00064323505,0.0002968778,0.00022297935,0.00021737494,0.00069670717,0.010869877],"genre_scores_gemma":[0.58557755,0.0013422313,0.393081,0.00065399846,0.00033914208,0.0006716019,0.00041223355,0.0002607795,0.017661572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984913,0.00039756115,0.00015290156,0.00025675245,0.00047541945,0.00022599883],"domain_scores_gemma":[0.9972499,0.00084836583,0.00047710794,0.00081913755,0.0004295907,0.00017587627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013503142,0.0006136377,0.0005675336,0.0009651369,0.00066156185,0.0017064884,0.0011585696,0.0009903291,0.0038002965],"category_scores_gemma":[0.004218427,0.0004842477,0.0008134662,0.00059153355,0.0019348144,0.0035742684,0.002427041,0.0023363237,0.0015197543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021310271,0.00006351096,0.00042405076,0.00025035275,0.00004247694,0.00018826166,0.00031825123,0.012993735,0.03536972,0.91445076,0.0022857015,0.03340003],"study_design_scores_gemma":[0.00022021843,0.00047692956,0.0006406632,0.00019822238,0.00011942187,0.0013134453,0.00015232351,0.24107674,0.1457727,0.527227,0.08260007,0.00020236785],"about_ca_topic_score_codex":0.00020665012,"about_ca_topic_score_gemma":0.0002560638,"teacher_disagreement_score":0.0038002965,"about_ca_system_score_codex":0.00087811693,"about_ca_system_score_gemma":0.0010643364,"threshold_uncertainty_score":0.0127132535},"labels":[],"label_agreement":null},{"id":"W2736709020","doi":"10.1016/j.ffa.2017.06.003","title":"Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Carleton University","keywords":"Mathematics; Permutation (music); Spectrum (functional analysis); Ambiguity; Degree (music); Finite field; Differential (mechanical device); Combinatorics; Pure mathematics","score_opus":0.014462414056729801,"score_gpt":0.24901569412702437,"score_spread":0.23455328007029458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736709020","genre_codex":"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.8596636,0.0018199031,0.10362186,0.0022494867,0.00029333957,0.000030201783,0.00019154255,0.00009556823,0.03203456],"genre_scores_gemma":[0.9869442,0.0007726319,0.0070431605,0.00012145617,0.0003486767,0.000025539135,0.00008573459,0.000032956304,0.004625528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894184,0.00035635504,0.00005853503,0.00017035016,0.00029600709,0.00017680938],"domain_scores_gemma":[0.99483925,0.0028430717,0.00084813946,0.0003801719,0.0003829633,0.00070641463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021797835,0.0008886911,0.0009720742,0.003347296,0.001538243,0.0033167829,0.0012343621,0.0014556936,0.0031575838],"category_scores_gemma":[0.009506587,0.0005958933,0.00054881023,0.0019934173,0.0069780555,0.005903427,0.0024175856,0.0023485592,0.00040308113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007738127,0.000028633365,0.00038825048,0.00002252847,0.000004049287,0.00010730208,0.00024861147,0.0015294725,0.0012127762,0.99315107,0.0002690791,0.0029608796],"study_design_scores_gemma":[0.00001593517,0.000021363856,0.00021340734,0.000014562732,0.0000039147317,0.00016294647,0.00009387466,0.007343267,0.00031067443,0.9912816,0.00052128447,0.000017096383],"about_ca_topic_score_codex":0.00075798354,"about_ca_topic_score_gemma":0.00046278746,"teacher_disagreement_score":0.003347296,"about_ca_system_score_codex":0.0015293871,"about_ca_system_score_gemma":0.0011219638,"threshold_uncertainty_score":0.0115279555},"labels":[],"label_agreement":null},{"id":"W2736937761","doi":"","title":"Enumeration of Combinatorial Classes of Single Variable Complex Polynomial Vector Fields","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Variable (mathematics); Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.029770559900625687,"score_gpt":0.22766958401789977,"score_spread":0.19789902411727409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736937761","genre_codex":"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.7977099,0.00066241086,0.11013267,0.0020971713,0.00018271116,0.00013864833,0.0019226171,0.0003994236,0.08675445],"genre_scores_gemma":[0.952283,0.0004015674,0.028695164,0.00032401783,0.00018848747,0.00016228286,0.0021571475,0.000168181,0.015620133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986644,0.00032764647,0.00008535513,0.00025532008,0.00039125766,0.0002760397],"domain_scores_gemma":[0.9953963,0.0028182133,0.00042807986,0.0005883586,0.00042659108,0.00034242222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009300205,0.00069323205,0.0009967288,0.002739675,0.0016600112,0.005156912,0.0018814955,0.0012349979,0.010206472],"category_scores_gemma":[0.005213175,0.00060964125,0.0007691632,0.0033947823,0.0018892401,0.0041638035,0.0014717269,0.0024623557,0.000968154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021166858,0.00012304977,0.0022962026,0.00011864386,0.000017695145,0.00008918615,0.00028749558,0.004425171,0.0030896412,0.94867593,0.0049171215,0.035748072],"study_design_scores_gemma":[0.000058335016,0.000039086295,0.001380869,0.00004577668,0.000025235911,0.0002955425,0.00015579151,0.02368461,0.0026245227,0.9632489,0.008414205,0.000027119715],"about_ca_topic_score_codex":0.0005898007,"about_ca_topic_score_gemma":0.00088959245,"teacher_disagreement_score":0.010206472,"about_ca_system_score_codex":0.0017360598,"about_ca_system_score_gemma":0.0009660858,"threshold_uncertainty_score":0.034143984},"labels":[],"label_agreement":null},{"id":"W2737359669","doi":"10.48550/arxiv.1707.05846","title":"On the Computation of Neumann Series","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rendering (computer graphics); Computation; Basis (linear algebra); Series (stratigraphy); Von Neumann architecture; Neumann series; Binary number; Algorithm; Theoretical computer science; Mathematics; Arithmetic; Pure mathematics; Artificial intelligence","score_opus":0.08182257507973612,"score_gpt":0.18887596494283454,"score_spread":0.10705338986309842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737359669","genre_codex":"methods","genre_gemma":"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.02629623,0.0010414015,0.9475105,0.0006028109,0.00043494455,0.00007066539,0.00008453104,0.0003344588,0.023624528],"genre_scores_gemma":[0.40464517,0.0024655052,0.5734583,0.00056572637,0.0006695722,0.0003074308,0.00032058955,0.0004573839,0.01711029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988341,0.0003767669,0.000069133115,0.00014569277,0.00042100507,0.00015322384],"domain_scores_gemma":[0.99878055,0.00062038546,0.00006884329,0.00024950836,0.00019119162,0.00008949748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017107006,0.0010321494,0.0007646424,0.0012862926,0.0012116047,0.0013355898,0.00091117533,0.00080239243,0.0060667996],"category_scores_gemma":[0.0063444986,0.0003606638,0.0011207237,0.0008923617,0.0031309729,0.004451582,0.002173186,0.0024623205,0.0020022287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007420326,0.000024335684,0.00015328232,0.000071616036,0.000009905796,0.000041511077,0.00013306341,0.015819827,0.0028639736,0.9470563,0.0018296387,0.03192225],"study_design_scores_gemma":[0.00002228155,0.000058265334,0.000083601524,0.000051337884,0.000007270692,0.00007346852,0.000033917935,0.10897942,0.0029337495,0.87877846,0.0089459075,0.000032448475],"about_ca_topic_score_codex":0.0010324504,"about_ca_topic_score_gemma":0.0011297114,"teacher_disagreement_score":0.0060667996,"about_ca_system_score_codex":0.0011522159,"about_ca_system_score_gemma":0.0008263848,"threshold_uncertainty_score":0.020295441},"labels":[],"label_agreement":null},{"id":"W2738883014","doi":"10.1145/3087604.3087645","title":"Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Degree (music); Mathematics; Polynomial; Iterated function; Function (biology); Algebraic number; Discrete mathematics; Rational function; Rank (graph theory); Algorithm; Combinatorics; Applied mathematics; Mathematical analysis","score_opus":0.018551030756057768,"score_gpt":0.23704309874496082,"score_spread":0.21849206798890305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738883014","genre_codex":"methods","genre_gemma":"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.031454246,0.00050104636,0.95998144,0.0005782591,0.00006309463,0.00011466211,0.000048344045,0.002183924,0.005074955],"genre_scores_gemma":[0.38741106,0.00026279752,0.60560745,0.00036875214,0.00008276297,0.0002506924,0.00020841123,0.00076101825,0.005046985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919584,0.0030254198,0.00050650624,0.00091495615,0.002542557,0.0010523425],"domain_scores_gemma":[0.9668219,0.02562524,0.0013459056,0.0030637532,0.0028021936,0.0003409427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066332817,0.0017421782,0.0022136434,0.0012438049,0.0015012758,0.0022046189,0.0019195682,0.0022033772,0.0034438744],"category_scores_gemma":[0.04749725,0.0007753064,0.0010503859,0.0013411152,0.0043893266,0.0041244444,0.0043863957,0.004732433,0.0016887784],"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.0027945153,0.00023173245,0.004222704,0.0006469381,0.000117742966,0.00054419285,0.0027034844,0.4465049,0.01766033,0.18953875,0.0052859443,0.32974872],"study_design_scores_gemma":[0.000075879245,0.00012795767,0.00013584207,0.00006665203,0.000018044948,0.00008813552,0.000116587486,0.9207855,0.013192031,0.06353784,0.0018264336,0.000029024848],"about_ca_topic_score_codex":0.004067527,"about_ca_topic_score_gemma":0.0043227645,"teacher_disagreement_score":0.0066332817,"about_ca_system_score_codex":0.0016936985,"about_ca_system_score_gemma":0.0028221686,"threshold_uncertainty_score":0.035080552},"labels":[],"label_agreement":null},{"id":"W2739099558","doi":"","title":"Classification of optimal binary self-orthogonal codes up to length 24","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.015138935895520962,"score_gpt":0.24782273497306154,"score_spread":0.23268379907754058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739099558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9332307,0.00097315444,0.029952168,0.0013778061,0.0002141581,0.000098170174,0.0009896605,0.0002801293,0.032884087],"genre_scores_gemma":[0.9729864,0.0006097227,0.013348313,0.00025858014,0.00030001224,0.00008528775,0.001753139,0.00012023189,0.010538303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989587,0.00013578257,0.00009753543,0.00013074979,0.00040003008,0.00027724353],"domain_scores_gemma":[0.9956826,0.001779539,0.0008508052,0.00053816277,0.0006786251,0.00047033178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072161574,0.00056292955,0.0009161116,0.0027586191,0.0014262953,0.0028497633,0.0008186147,0.0015306569,0.005432052],"category_scores_gemma":[0.0053688977,0.00046686208,0.00059386523,0.0014243874,0.0018367838,0.0018138826,0.0015925772,0.001388202,0.0008581557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009422257,0.0002952169,0.011039059,0.0003143408,0.00005990621,0.00041766866,0.00059431745,0.0098268585,0.016950373,0.8523645,0.010963996,0.09623149],"study_design_scores_gemma":[0.00020180839,0.00029472925,0.006218707,0.00015142106,0.00007562375,0.0009598532,0.0003101613,0.06525004,0.011845204,0.9003991,0.014213973,0.00007927751],"about_ca_topic_score_codex":0.00035187713,"about_ca_topic_score_gemma":0.00045514837,"teacher_disagreement_score":0.005432052,"about_ca_system_score_codex":0.001281125,"about_ca_system_score_gemma":0.0013035274,"threshold_uncertainty_score":0.018171966},"labels":[],"label_agreement":null},{"id":"W2739627166","doi":"","title":"A class of mutually inequivalent circulant weighing matrices.","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Order (exchange); Prime (order theory); Matrix (chemical analysis); Weight function; Prime power; Euler's totient function; Ternary operation; Discrete mathematics; Class (philosophy); Euler's formula; Mathematical analysis","score_opus":0.023509549341280165,"score_gpt":0.250974437196984,"score_spread":0.22746488785570382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739627166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5639816,0.0014290194,0.30069354,0.000769755,0.0005042314,0.00024755218,0.0007189108,0.0006117616,0.13104357],"genre_scores_gemma":[0.9489744,0.00035646942,0.036706537,0.00035004725,0.00021272794,0.0001457978,0.00045897908,0.000062897314,0.012732287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909616,0.00014675804,0.000053774067,0.00017906903,0.0003245358,0.00019980004],"domain_scores_gemma":[0.99864715,0.00046168818,0.0002906892,0.00021159428,0.0002232657,0.00016569339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756781,0.0006287178,0.00033504656,0.0013589322,0.0010807146,0.0013488593,0.0004947461,0.00089588575,0.006388638],"category_scores_gemma":[0.0038532473,0.00029408888,0.00030983237,0.0008419782,0.00093496835,0.0012203476,0.0010163394,0.00082044554,0.0009918644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011147249,0.000054155047,0.0011060612,0.000056676872,0.000016487036,0.00036072286,0.00016397212,0.0030289502,0.015869724,0.94307417,0.0025199344,0.03363768],"study_design_scores_gemma":[0.000077313576,0.00018100785,0.0016634889,0.000044713415,0.000026923843,0.0017573596,0.00013476772,0.04950724,0.015085663,0.90413404,0.02731209,0.000075444426],"about_ca_topic_score_codex":0.00040305464,"about_ca_topic_score_gemma":0.00043749827,"teacher_disagreement_score":0.006388638,"about_ca_system_score_codex":0.0004419734,"about_ca_system_score_gemma":0.00051848707,"threshold_uncertainty_score":0.02137214},"labels":[],"label_agreement":null},{"id":"W2739858881","doi":"","title":"Orthogonal designs and MDS self-dual codes","year":2006,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Orthogonal array; Arithmetic; Statistics; Taguchi methods; Philosophy; Linguistics","score_opus":0.013060633229469244,"score_gpt":0.22629292382948352,"score_spread":0.21323229060001428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739858881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5541755,0.0023916804,0.31877357,0.004323715,0.0008959612,0.00012090817,0.0005544773,0.00029369057,0.118470594],"genre_scores_gemma":[0.93499833,0.0009824105,0.030783698,0.000736385,0.00060636865,0.00013997727,0.00024908828,0.00007179915,0.031431817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986664,0.0004499309,0.00007918905,0.0001804435,0.0004017557,0.0002222717],"domain_scores_gemma":[0.9972397,0.001286253,0.0005037089,0.00040902183,0.00035058334,0.00021077965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001469816,0.0007416331,0.00059043797,0.0019248712,0.0013969258,0.0023240456,0.000539383,0.0013546996,0.0042461674],"category_scores_gemma":[0.0038098712,0.0005925775,0.0006082956,0.0016025159,0.002519306,0.002071919,0.002753504,0.0018261742,0.0007808298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009752142,0.00001453092,0.00019240311,0.000022656914,0.0000057429347,0.000066381544,0.00014559363,0.0013735365,0.0011139651,0.99048877,0.00064922625,0.005829683],"study_design_scores_gemma":[0.00003101881,0.000027043068,0.000115512514,0.000015357755,0.0000083537525,0.00019927847,0.000054958593,0.0062122256,0.0010385999,0.9891266,0.0031559751,0.000015097335],"about_ca_topic_score_codex":0.00028299456,"about_ca_topic_score_gemma":0.00031675867,"teacher_disagreement_score":0.0042461674,"about_ca_system_score_codex":0.0010418285,"about_ca_system_score_gemma":0.00078791403,"threshold_uncertainty_score":0.01420486},"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":"W2750547415","doi":"10.1007/978-3-319-66396-8_6","title":"A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Concatenation (mathematics); Lexicographical order; Sequence (biology); String (physics); Necklace; Computer science; Combinatorics; Shift register; Discrete mathematics; Mathematics; Telecommunications","score_opus":0.03179502160440214,"score_gpt":0.27607926042371983,"score_spread":0.24428423881931768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750547415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.12397285,0.0013294133,0.76249826,0.0006272315,0.0018163535,0.0002198246,0.00036339197,0.0021558874,0.107016824],"genre_scores_gemma":[0.5523533,0.0014480393,0.37548918,0.0005170236,0.0005128541,0.0002788378,0.0005734698,0.0010933778,0.06773388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957246,0.0001056764,0.000029798417,0.000108223416,0.00012110569,0.0000627597],"domain_scores_gemma":[0.99956936,0.00015798605,0.00002622235,0.0001513812,0.000058444642,0.000036709516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046204872,0.00065618864,0.0005603653,0.0011467115,0.0011288632,0.0012265759,0.0008983454,0.00083625404,0.008213623],"category_scores_gemma":[0.0012771307,0.0005401537,0.00090785325,0.0012390735,0.0014471689,0.0017074952,0.0014759818,0.0014825411,0.0026435242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001668405,0.00005691466,0.00016945395,0.0002095856,0.000023864142,0.00036465004,0.0002791541,0.003829855,0.02817489,0.8396136,0.003765832,0.12334542],"study_design_scores_gemma":[0.00006922647,0.00027638485,0.0003201198,0.00013831681,0.00008941526,0.0009386157,0.000113758295,0.023845026,0.06531514,0.81251043,0.096269354,0.00011425529],"about_ca_topic_score_codex":0.00038028872,"about_ca_topic_score_gemma":0.00054382463,"teacher_disagreement_score":0.008213623,"about_ca_system_score_codex":0.00042449657,"about_ca_system_score_gemma":0.0007763377,"threshold_uncertainty_score":0.027477264},"labels":[],"label_agreement":null},{"id":"W2751038856","doi":"10.5539/jmr.v9n5p54","title":"Sign of Permutation Induced by Nagata Automorphism over Finite Fields","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Permutation (music); Inner automorphism; Sign (mathematics); Automorphism group; Prime (order theory); Field (mathematics); Finite field; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.13284878583619505,"score_gpt":0.4036273196044981,"score_spread":0.2707785337683031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751038856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8878994,0.00027997015,0.07402093,0.00045618418,0.00038476553,0.00008300025,0.0000883624,0.00034350358,0.036443964],"genre_scores_gemma":[0.9879529,0.00025803238,0.007209367,0.00007777548,0.000089451096,0.000030768882,0.00006255303,0.00005784459,0.0042613004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993086,0.00015386064,0.00004764549,0.00011159813,0.00018487735,0.00019336586],"domain_scores_gemma":[0.99904436,0.0002479643,0.00021306053,0.00020603793,0.00015878087,0.00012980221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004566849,0.00036120918,0.0004434475,0.00077610585,0.0008032052,0.0012510546,0.00029172085,0.00048767368,0.0024718586],"category_scores_gemma":[0.0018468825,0.0002113283,0.0006577023,0.00033770694,0.0019324567,0.0017748196,0.0011297459,0.0010939675,0.0004819273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073876494,0.00012134732,0.005456808,0.00016785454,0.000045901917,0.0023085747,0.0011142504,0.0068015237,0.09698451,0.84889996,0.0012557339,0.036104683],"study_design_scores_gemma":[0.00020596023,0.0008415115,0.0047270562,0.00008353892,0.000111222136,0.0028601119,0.00059565855,0.024975814,0.119560346,0.82296675,0.022898067,0.00017390265],"about_ca_topic_score_codex":0.00040192966,"about_ca_topic_score_gemma":0.00024494407,"teacher_disagreement_score":0.0024718586,"about_ca_system_score_codex":0.0004572538,"about_ca_system_score_gemma":0.0007363457,"threshold_uncertainty_score":0.008269191},"labels":[],"label_agreement":null},{"id":"W2755348373","doi":"10.46298/dmtcs.3550","title":"Hamming distance from irreducible polynomials over $\\mathbb {F}_2$","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamming distance; Polynomial; Degree (music); Conjecture; Irreducible polynomial; Discrete mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.01240369567851942,"score_gpt":0.2623634053157415,"score_spread":0.24995970963722206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755348373","genre_codex":"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.928971,0.00034332954,0.06397367,0.0003981384,0.000026158506,0.000033890352,0.00089636643,0.0002149319,0.0051425966],"genre_scores_gemma":[0.98755556,0.00025255824,0.010157491,0.0000688694,0.000040075123,0.00003823149,0.0007410848,0.000038253882,0.0011079198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832946,0.000305517,0.00007637109,0.000384569,0.0004959059,0.00040812418],"domain_scores_gemma":[0.9841232,0.009949015,0.0025879485,0.0019681063,0.00080945843,0.00056218344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014546716,0.00045564154,0.00071908196,0.0020477576,0.0016331924,0.0011824133,0.0011231877,0.00056006154,0.0030248542],"category_scores_gemma":[0.015177241,0.00027563708,0.0004769719,0.0022512388,0.0015633308,0.0026617784,0.0012532173,0.0010483235,0.00042545953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015423101,0.00027791437,0.054331,0.00049639057,0.00019464812,0.00070757547,0.0012976571,0.099349186,0.02761901,0.65882885,0.0056391614,0.14971629],"study_design_scores_gemma":[0.0001249808,0.00080620975,0.024508748,0.000112901595,0.0001328764,0.0022910328,0.00044791464,0.31543404,0.031716827,0.6095379,0.01471108,0.00017549942],"about_ca_topic_score_codex":0.001719378,"about_ca_topic_score_gemma":0.0014588201,"teacher_disagreement_score":0.0030248542,"about_ca_system_score_codex":0.0015326564,"about_ca_system_score_gemma":0.00094391464,"threshold_uncertainty_score":0.01112026},"labels":[],"label_agreement":null},{"id":"W2756157712","doi":"10.1016/j.ffa.2018.01.011","title":"A group action on multivariate polynomials over finite fields","year":2018,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Invariant (physics); Combinatorics; Prime power; Polynomial ring; Prime (order theory); Polynomial; Group ring; Invariant theory; Group (periodic table); Action (physics); Finite group; Algebraic number; Discrete mathematics; Pure mathematics; Algebra over a field; Physics; Mathematical physics; Mathematical analysis; Quantum mechanics","score_opus":0.034434389097119385,"score_gpt":0.2819874740633739,"score_spread":0.2475530849662545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756157712","genre_codex":"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.61744213,0.0031942755,0.20127329,0.008091607,0.00157177,0.0000678315,0.00043904013,0.00046158396,0.16745842],"genre_scores_gemma":[0.96046555,0.0009783441,0.010641771,0.00044407655,0.0011335826,0.000040107512,0.00014437624,0.00009087738,0.026061382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993598,0.00019342944,0.00002141337,0.000116511954,0.00016970959,0.00013903955],"domain_scores_gemma":[0.99900776,0.00037337575,0.0001691711,0.00012665389,0.00010528544,0.00021778543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007803317,0.0009839485,0.0006740736,0.0019359032,0.0012053606,0.0020422623,0.00066735264,0.0012491602,0.0071574734],"category_scores_gemma":[0.0017805218,0.00035531598,0.0007335904,0.0012816106,0.0034401205,0.0037768753,0.002077905,0.0021616719,0.0008043599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027186834,0.000017514412,0.000085963315,0.000016664782,0.0000032650798,0.000050635575,0.00012678509,0.00063883583,0.0005970783,0.9941518,0.00076001004,0.003524271],"study_design_scores_gemma":[0.0000139370195,0.000018167473,0.00009518632,0.000011896967,0.0000056842973,0.00007894158,0.00004012118,0.004207181,0.00037293628,0.99230474,0.0028410242,0.00001025656],"about_ca_topic_score_codex":0.0006016449,"about_ca_topic_score_gemma":0.00042158374,"teacher_disagreement_score":0.0071574734,"about_ca_system_score_codex":0.0010077779,"about_ca_system_score_gemma":0.00063687767,"threshold_uncertainty_score":0.02394414},"labels":[],"label_agreement":null},{"id":"W2757847923","doi":"10.1007/s12095-017-0256-3","title":"Characteristic digit-sum sequences","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Autocorrelation; Complementary sequences; Binary number; Mathematics; Numerical digit; Nonlinear system; Primitive polynomial; Sequence (biology); Discrete mathematics; Combinatorics; Arithmetic; Statistics; Biology; Physics; Genetics","score_opus":0.03788298953616897,"score_gpt":0.2873308536251481,"score_spread":0.24944786408897912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757847923","genre_codex":"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.4009031,0.002059983,0.33477646,0.0047509787,0.0011836394,0.0001882889,0.0018770379,0.0012592017,0.25300133],"genre_scores_gemma":[0.8984844,0.0012131117,0.032110013,0.0007013634,0.0005285562,0.0001264227,0.00097100815,0.00022969037,0.06563538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992513,0.00013967336,0.00005010267,0.00014147365,0.00027252937,0.00014487252],"domain_scores_gemma":[0.9980044,0.00078180694,0.00030902092,0.00032760328,0.0003547263,0.00022248625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622464,0.0007859509,0.00048650274,0.0024554,0.0010473621,0.002727093,0.00057085464,0.0010141167,0.01138443],"category_scores_gemma":[0.004490844,0.0002727271,0.00033693723,0.0026446811,0.001432139,0.0026942268,0.0015832975,0.00181223,0.0045490735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021453737,0.00003799746,0.0007374994,0.00009098962,0.0000117400095,0.00018333527,0.00016500434,0.0022751878,0.0047789006,0.93789196,0.0046870266,0.048925776],"study_design_scores_gemma":[0.000031741423,0.00006985208,0.000814044,0.00005258731,0.000017888484,0.0010223255,0.00007314357,0.008299397,0.008340923,0.9618367,0.019400578,0.000040918418],"about_ca_topic_score_codex":0.0001649778,"about_ca_topic_score_gemma":0.00018317347,"teacher_disagreement_score":0.01138443,"about_ca_system_score_codex":0.0009966989,"about_ca_system_score_gemma":0.000947657,"threshold_uncertainty_score":0.038084686},"labels":[],"label_agreement":null},{"id":"W2759330492","doi":"","title":"Semisymmetric Cubic Graphs Of Order 10p n .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Order (exchange); Combinatorics; Graph; Line graph; Business","score_opus":0.013466573888961155,"score_gpt":0.24626373044304853,"score_spread":0.23279715655408736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759330492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.56437075,0.00067278655,0.06688859,0.0032626796,0.0005278939,0.00018893299,0.00486678,0.0008255556,0.35839602],"genre_scores_gemma":[0.9470121,0.0003323898,0.012687929,0.00043615216,0.00008944052,0.000059616323,0.0015420894,0.00010218024,0.037738077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996358,0.00006951168,0.0000119001825,0.00005148628,0.00012088142,0.000110453155],"domain_scores_gemma":[0.99900717,0.00026571777,0.00021879142,0.00019249697,0.00017326753,0.00014262728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024265515,0.0003219874,0.0003439119,0.0006249796,0.0009556645,0.0010569355,0.00053407904,0.0005471444,0.013766959],"category_scores_gemma":[0.0012823329,0.0002240104,0.00026388915,0.0006970107,0.000864378,0.0010890865,0.0010295425,0.0011164949,0.0015936209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042670427,0.00008359776,0.00093660736,0.00019283191,0.000016893131,0.00060969277,0.00025207916,0.004885822,0.009043786,0.9352664,0.022156196,0.026129436],"study_design_scores_gemma":[0.000117988544,0.00008075809,0.002276375,0.000056837536,0.000017538568,0.00074050284,0.00030762088,0.019621167,0.0052616736,0.93419814,0.037279528,0.000041984098],"about_ca_topic_score_codex":0.0042095515,"about_ca_topic_score_gemma":0.010104576,"teacher_disagreement_score":0.013766959,"about_ca_system_score_codex":0.0012359646,"about_ca_system_score_gemma":0.0016959776,"threshold_uncertainty_score":0.046055138},"labels":[],"label_agreement":null},{"id":"W2760258650","doi":"","title":"Skew-quasi-cyclic codes over Ml(F q )[X, θ].","year":2017,"lang":"nl","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Skew; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.01811014444861419,"score_gpt":0.26818527129966757,"score_spread":0.2500751268510534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760258650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.70876235,0.0017323894,0.18403001,0.0032450364,0.0005660785,0.00016645853,0.0023275206,0.0012652688,0.097904846],"genre_scores_gemma":[0.97242844,0.00045785145,0.01137182,0.00040209165,0.00025238557,0.00005788858,0.0005262992,0.00008544973,0.014417732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999137,0.0002117944,0.000041094216,0.000098921664,0.00024957265,0.00026167688],"domain_scores_gemma":[0.99794954,0.0006758693,0.000471435,0.00035703686,0.0003480509,0.00019802371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079956837,0.00038278606,0.0003511387,0.0008312838,0.0007618665,0.00137523,0.00037826758,0.00055970025,0.007011181],"category_scores_gemma":[0.0035121976,0.00018623979,0.0002532136,0.0008989564,0.0010102985,0.0018967134,0.0014052084,0.0009645913,0.0013731028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006389188,0.0000721877,0.002060787,0.00011422151,0.000021661495,0.00037912928,0.0004649115,0.004669874,0.0099417595,0.92109984,0.008306504,0.052230254],"study_design_scores_gemma":[0.00011041628,0.00021592597,0.0030411019,0.00010684229,0.000028996485,0.0009330676,0.00030114403,0.021610022,0.011604885,0.93174684,0.030222427,0.000078436766],"about_ca_topic_score_codex":0.000908443,"about_ca_topic_score_gemma":0.0006876984,"teacher_disagreement_score":0.007011181,"about_ca_system_score_codex":0.0007041973,"about_ca_system_score_gemma":0.0010276022,"threshold_uncertainty_score":0.023454726},"labels":[],"label_agreement":null},{"id":"W2766579298","doi":"10.1016/j.ffa.2018.02.002","title":"Existence of primitive 1-normal elements in finite fields","year":2018,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Combinatorics; Dimension (graph theory); Primitive element; Normal basis; Prime (order theory); Linear subspace; Mathematics; Subspace topology; Space (punctuation); Vector space; Physics; Finite field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.022613683833424547,"score_gpt":0.25630218835844,"score_spread":0.23368850452501544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766579298","genre_codex":"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.7208339,0.0030868233,0.18175396,0.0061555863,0.00059119414,0.00008193918,0.00054376887,0.0004156186,0.08653713],"genre_scores_gemma":[0.95566213,0.0016045643,0.021342129,0.00042881045,0.00082584703,0.00007400123,0.0004359676,0.000112446105,0.019514095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863595,0.00038140084,0.00007845367,0.0002940048,0.00033638833,0.0002736955],"domain_scores_gemma":[0.9932193,0.004605944,0.0005279599,0.00043811765,0.00059493317,0.0006137071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019001864,0.0010891431,0.0012069553,0.0034097654,0.0018822234,0.004265033,0.0013091193,0.002009447,0.004911932],"category_scores_gemma":[0.0087011745,0.0009751334,0.00091748306,0.0022963262,0.006518153,0.009533118,0.0036294865,0.004849794,0.0008199426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006604764,0.000025033309,0.0003318126,0.000052248586,0.000004475953,0.000056981276,0.0003183624,0.0005644225,0.0007999803,0.9929349,0.000516058,0.004329782],"study_design_scores_gemma":[0.000014011634,0.000013639976,0.00008251966,0.000015484487,0.0000042273336,0.000082831655,0.000056671084,0.0014818691,0.00046663333,0.99679655,0.00097593205,0.000009598991],"about_ca_topic_score_codex":0.00043456175,"about_ca_topic_score_gemma":0.00036650183,"teacher_disagreement_score":0.004911932,"about_ca_system_score_codex":0.0018912525,"about_ca_system_score_gemma":0.0010637657,"threshold_uncertainty_score":0.016432047},"labels":[],"label_agreement":null},{"id":"W2766744273","doi":"10.1109/isit.2018.8437698","title":"On the List-Decodability of Random Linear Rank-Metric Codes","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Rank (graph theory); Mathematics; Metric (unit); Hamming distance; Constant (computer programming); RADIUS; Discrete mathematics; Computer science","score_opus":0.02531693207324356,"score_gpt":0.2669588836877031,"score_spread":0.24164195161445953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766744273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.21667959,0.0030417952,0.72014827,0.0043626116,0.00037005253,0.0002058863,0.0011953344,0.0011395583,0.05285698],"genre_scores_gemma":[0.92936134,0.0029083407,0.0497644,0.0008104011,0.00055160164,0.00043385793,0.0010196912,0.00026237333,0.014888005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934564,0.0021177619,0.00024365193,0.0007208876,0.002235881,0.0012254708],"domain_scores_gemma":[0.95255166,0.034614876,0.0032051771,0.0046558087,0.003895462,0.001077042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049632294,0.0018496749,0.0013168405,0.0027561253,0.0022364266,0.0029794956,0.0022175142,0.0021434072,0.0056884144],"category_scores_gemma":[0.048234474,0.0008344738,0.0009965412,0.0023804053,0.00565501,0.0065332153,0.004876463,0.0040565855,0.0019091697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077513186,0.00008878383,0.0014465034,0.00040107797,0.00009298044,0.0004933625,0.00075214886,0.14490393,0.009828754,0.80149573,0.007231979,0.032489628],"study_design_scores_gemma":[0.0001225645,0.00035464825,0.00076539646,0.00019799694,0.000066084795,0.00067674764,0.00020220019,0.59128994,0.012615903,0.38895395,0.004528732,0.00022582833],"about_ca_topic_score_codex":0.0042495034,"about_ca_topic_score_gemma":0.002344643,"teacher_disagreement_score":0.0056884144,"about_ca_system_score_codex":0.0032265426,"about_ca_system_score_gemma":0.0035274706,"threshold_uncertainty_score":0.026248395},"labels":[],"label_agreement":null},{"id":"W2768936014","doi":"10.4153/cmb-2018-027-x","title":"Irreducible Polynomials Over a Finite Field with Restricted Coefficients","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Finite field; Field (mathematics); Degree (music); Function field; Function (biology); Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.010190630557633737,"score_gpt":0.22021462390097324,"score_spread":0.2100239933433395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768936014","genre_codex":"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.90061307,0.00056363136,0.07361388,0.000827222,0.00005627856,0.000023002616,0.00022440284,0.00032562573,0.023752935],"genre_scores_gemma":[0.99502605,0.00023250346,0.0035035484,0.000050030845,0.0000725027,0.000014241829,0.00008768971,0.0000223844,0.0009910285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880946,0.00023905639,0.000045024928,0.00025984913,0.00040926578,0.0002373601],"domain_scores_gemma":[0.9942365,0.0037105053,0.0005346688,0.00076542934,0.0003601732,0.00039277348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014777551,0.00049816846,0.0010390858,0.0016098567,0.00085153803,0.0017418573,0.00097238034,0.0005255365,0.0031439702],"category_scores_gemma":[0.011807567,0.00031316947,0.0005624592,0.0010987264,0.003371009,0.0039030898,0.0022979786,0.002037212,0.00040137314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006713793,0.00011931666,0.0064096656,0.0002731376,0.00005727039,0.0008281681,0.00054339843,0.03567984,0.018807497,0.9135582,0.0016135963,0.021438444],"study_design_scores_gemma":[0.0001235482,0.00016788635,0.004003235,0.00013047959,0.00007267722,0.001997888,0.00022598235,0.1208294,0.017287094,0.85038334,0.0047029043,0.00007563364],"about_ca_topic_score_codex":0.0007273812,"about_ca_topic_score_gemma":0.00043056018,"teacher_disagreement_score":0.0031439702,"about_ca_system_score_codex":0.0011286922,"about_ca_system_score_gemma":0.000534554,"threshold_uncertainty_score":0.010517597},"labels":[],"label_agreement":null},{"id":"W2769119271","doi":"","title":"On triplanes of order twelve admitting an automorphism of order six and their binary and ternary codes","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ternary operation; Isomorphism (crystallography); Combinatorics; Automorphism; Order (exchange); Automorphism group; Binary number; Dimension (graph theory); Binary code; Residual; Discrete mathematics; Arithmetic; Algorithm; Computer science","score_opus":0.021984553661439928,"score_gpt":0.2662980361193844,"score_spread":0.2443134824579445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769119271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9415908,0.00068236055,0.039572332,0.00009626162,0.00004070182,0.000026990403,0.0003140207,0.00007303746,0.017603492],"genre_scores_gemma":[0.97446764,0.0007016875,0.016723385,0.00005307403,0.000048731432,0.00003426468,0.000770373,0.000038407536,0.007162494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971324,0.000037156333,0.000022141337,0.000064094245,0.00009826307,0.00006503731],"domain_scores_gemma":[0.99949384,0.000114627925,0.00018123294,0.00008273932,0.00007028159,0.000057313497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014587815,0.00026188104,0.00021973831,0.0011143936,0.00048775898,0.00068428967,0.00018020952,0.0002846832,0.0030342138],"category_scores_gemma":[0.0006939899,0.00015007892,0.00037188962,0.00072749244,0.00090254296,0.00060940423,0.0006487441,0.0004729865,0.00062878523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038748578,0.000059336733,0.0066971527,0.0002721637,0.000042491145,0.0007298818,0.0013890811,0.017040368,0.039794408,0.83675355,0.0018851792,0.094948955],"study_design_scores_gemma":[0.0000708224,0.00074293645,0.012100955,0.00017176091,0.000074911375,0.003369887,0.0013468298,0.036424585,0.03669771,0.8395208,0.06932452,0.00015420928],"about_ca_topic_score_codex":0.00048650577,"about_ca_topic_score_gemma":0.00036874533,"teacher_disagreement_score":0.0030342138,"about_ca_system_score_codex":0.00030686354,"about_ca_system_score_gemma":0.0003055245,"threshold_uncertainty_score":0.010150433},"labels":[],"label_agreement":null},{"id":"W2770344099","doi":"10.3842/sigma.2018.050","title":"Evaluation of Certain Hypergeometric Functions over Finite Fields","year":2018,"lang":"en","type":"article","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Ministry of Science and Technology, Taiwan; National Center for Theoretical Sciences","keywords":"Prime (order theory); Character (mathematics); Hypergeometric function; Finite field; Mathematics; Hypergeometric distribution; Multiplicative function; Order (exchange); Combinatorics; Matrix (chemical analysis); Field (mathematics); Group (periodic table); Pure mathematics; Physics; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.04308796895526812,"score_gpt":0.36609163102773973,"score_spread":0.3230036620724716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770344099","genre_codex":"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.94001126,0.0003190092,0.03950232,0.00024478347,0.00006197223,0.000029187719,0.000081440914,0.00008615306,0.019663809],"genre_scores_gemma":[0.9894315,0.00028279138,0.005307039,0.00003476621,0.00007697384,0.000016845766,0.000077218385,0.000039324594,0.004733395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953043,0.00011881267,0.000019769883,0.00006144529,0.00012885536,0.00014077123],"domain_scores_gemma":[0.9992256,0.0002827473,0.00016183709,0.00006671478,0.0001095406,0.00015350452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009548191,0.00075004983,0.00054379296,0.0029257066,0.0009416694,0.002310128,0.00060115283,0.0005084894,0.0034987372],"category_scores_gemma":[0.0027275537,0.00021992171,0.00047768123,0.0013146695,0.0022013234,0.0032609024,0.0011565319,0.0010749599,0.0003826773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033474425,0.000106114654,0.004560158,0.0001440155,0.000053414773,0.0011819518,0.00091079576,0.015963137,0.019438537,0.9325819,0.00064188597,0.024083193],"study_design_scores_gemma":[0.00004921072,0.0001749597,0.0049613127,0.000098930876,0.00005682938,0.0010366132,0.00066545606,0.088860296,0.036601815,0.8628816,0.004493069,0.000119850985],"about_ca_topic_score_codex":0.00042758803,"about_ca_topic_score_gemma":0.00045830657,"teacher_disagreement_score":0.0034987372,"about_ca_system_score_codex":0.001288426,"about_ca_system_score_gemma":0.00061760755,"threshold_uncertainty_score":0.011704445},"labels":[],"label_agreement":null},{"id":"W2773164695","doi":"10.1016/j.jsc.2020.06.007","title":"Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada; National Science Foundation","keywords":"Mathematics; Finite field; Lift (data mining); Polynomial ring; Invariant (physics); Hasse principle; Multiplication (music); Complex multiplication; Polynomial; Discrete mathematics; Combinatorics; Pure mathematics; Algebraic number field; Elliptic curve; Computer science","score_opus":0.04452285834766072,"score_gpt":0.28032262866603996,"score_spread":0.23579977031837923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773164695","genre_codex":"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.7780732,0.002341684,0.08833333,0.0018590887,0.00041277302,0.000053348725,0.00047593415,0.0004440446,0.12800656],"genre_scores_gemma":[0.9712414,0.0005597967,0.009487927,0.00017821626,0.0003380348,0.00002230089,0.00023743692,0.00008669463,0.01784805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992193,0.00018100113,0.00004213468,0.00016495876,0.0002193751,0.00017312741],"domain_scores_gemma":[0.99905986,0.00030850954,0.0002029499,0.00013655657,0.00011303244,0.0001790837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013216226,0.0010737487,0.00091304077,0.003254848,0.0014142711,0.0034207578,0.0007311197,0.0010579807,0.0070802663],"category_scores_gemma":[0.0023599546,0.0006356969,0.00083617563,0.0021434033,0.00306275,0.0054659788,0.0021093918,0.0019685014,0.00089016696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000714157,0.000041797954,0.0003277821,0.000025077301,0.000013018284,0.00010050148,0.00029015687,0.0010239304,0.0011945955,0.9908076,0.00073459104,0.0053694984],"study_design_scores_gemma":[0.00003214753,0.000031308013,0.00037641774,0.000013195988,0.000015300418,0.00023111989,0.00010619187,0.003338902,0.0011431569,0.991499,0.003189774,0.000023555864],"about_ca_topic_score_codex":0.0009450805,"about_ca_topic_score_gemma":0.00084722624,"teacher_disagreement_score":0.0070802663,"about_ca_system_score_codex":0.001323734,"about_ca_system_score_gemma":0.0005613843,"threshold_uncertainty_score":0.023685813},"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":"W2778339298","doi":"10.1137/1.9781611975031.36","title":"Time and Space Efficient Representations of Distributive Lattices","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Distributive property; Joins; Lattice (music); Distributive lattice; Combinatorics; Mathematics; Binary logarithm; Discrete mathematics; Space (punctuation); Data structure; Computer science; Pure mathematics; Physics","score_opus":0.039126921472558585,"score_gpt":0.24990642846794822,"score_spread":0.21077950699538964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778339298","genre_codex":"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.061836023,0.0016039432,0.901884,0.0011840696,0.00028581097,0.00019631271,0.0023036462,0.003324034,0.027382135],"genre_scores_gemma":[0.32842118,0.0011121754,0.64872664,0.00029322534,0.00020386229,0.00047313547,0.0038374297,0.0004954258,0.016437069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887675,0.00019546611,0.00009890128,0.00015654703,0.0005310726,0.00014120985],"domain_scores_gemma":[0.9980951,0.00053225784,0.00016982053,0.00082357205,0.00028449186,0.000094850206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005891639,0.0005728752,0.0007369551,0.0010825543,0.0009906428,0.0032257498,0.0015936914,0.00056641933,0.007898946],"category_scores_gemma":[0.0037738334,0.00042825541,0.00046722713,0.0025893387,0.0013832247,0.007124093,0.0019694779,0.0015243855,0.0024954004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007371307,0.00015032539,0.0006190556,0.00031020748,0.000018077202,0.00017878604,0.00057907595,0.025109107,0.013503533,0.61766785,0.02192884,0.31919795],"study_design_scores_gemma":[0.00015153953,0.00025020508,0.0002985586,0.000141328,0.000031367203,0.00052903645,0.00038389006,0.16773291,0.032112144,0.6939946,0.10428268,0.000091838105],"about_ca_topic_score_codex":0.00092748395,"about_ca_topic_score_gemma":0.0014271785,"teacher_disagreement_score":0.007898946,"about_ca_system_score_codex":0.0012897091,"about_ca_system_score_gemma":0.0010935846,"threshold_uncertainty_score":0.026424646},"labels":[],"label_agreement":null},{"id":"W2779154616","doi":"10.1109/cns.2017.8228669","title":"Cryptanalysis of stream cipher using density evolution","year":2017,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Stream cipher; Correlation attack; Stream cipher attack; Ciphertext; Computer science; Cryptanalysis; Keystream; Algorithm; Theoretical computer science; Cryptography; Computer security; Encryption","score_opus":0.026266682278312393,"score_gpt":0.27037643313201004,"score_spread":0.24410975085369765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779154616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.41614982,0.0004299377,0.57597333,0.00033967514,0.00003720966,0.00009132818,0.00004412166,0.0003072786,0.0066273],"genre_scores_gemma":[0.96153235,0.00022602938,0.036942087,0.000038532344,0.000011764429,0.000028753706,0.000020884898,0.00001663794,0.0011828993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953294,0.000115040355,0.000015658019,0.00004113764,0.0002518379,0.000043369448],"domain_scores_gemma":[0.99910706,0.0005589867,0.00012400573,0.00010543145,0.00008476658,0.000019765279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006688244,0.0002911032,0.00034087084,0.0004796905,0.0002637591,0.00043636683,0.00034197656,0.00040370374,0.0007087782],"category_scores_gemma":[0.002798363,0.00014528347,0.00035095765,0.00031737835,0.0008522414,0.00096515205,0.00050533225,0.00041189935,0.000112506044],"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.0003468479,0.000080568476,0.0061512277,0.00019058006,0.00011228524,0.000523196,0.0002700001,0.391841,0.08779525,0.44737104,0.00069029676,0.06462763],"study_design_scores_gemma":[0.000017254037,0.00008297202,0.00079160946,0.00001380153,0.0000124167045,0.00024791787,0.000014419311,0.9448381,0.027365675,0.025792975,0.00081144454,0.000011375393],"about_ca_topic_score_codex":0.00049014436,"about_ca_topic_score_gemma":0.00033589872,"teacher_disagreement_score":0.0007087782,"about_ca_system_score_codex":0.00065479235,"about_ca_system_score_gemma":0.00054044515,"threshold_uncertainty_score":0.004750848},"labels":[],"label_agreement":null},{"id":"W2782009702","doi":"10.1070/im8739","title":"Asymptotic bounds for spherical codes","year":2018,"lang":"en","type":"article","venue":"Izvestiya Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamming code; Cardinality (data modeling); Code (set theory); Unit square; Set (abstract data type); Linear code; Alphabet; Hamming distance; Domain (mathematical analysis)","score_opus":0.024722990702615473,"score_gpt":0.2728183929624516,"score_spread":0.24809540225983612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782009702","genre_codex":"methods","genre_gemma":"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.072730646,0.0113747595,0.81121415,0.0037293485,0.00073502,0.000079704856,0.0006388272,0.0010318091,0.09846574],"genre_scores_gemma":[0.91180325,0.007132595,0.064777404,0.0012590402,0.0014656162,0.00032590484,0.0011345376,0.00053302065,0.011568713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580836,0.0012351152,0.00016289402,0.00046427693,0.0016738877,0.00065545825],"domain_scores_gemma":[0.96438205,0.025175845,0.0014425522,0.0029173584,0.0049896482,0.0010924763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048442576,0.0016218163,0.0015062246,0.0036267822,0.0013307502,0.003612033,0.0021054517,0.0015432752,0.0074027576],"category_scores_gemma":[0.0476692,0.0005165201,0.001291476,0.0024600753,0.0039051108,0.0053458367,0.005271116,0.004208114,0.001960161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013152363,0.000028000752,0.00081006833,0.00020420337,0.00003901499,0.00011765194,0.0002367353,0.03803814,0.0022796367,0.93827164,0.0040771523,0.015766349],"study_design_scores_gemma":[0.0000152036155,0.000073813506,0.00077503757,0.00018192294,0.000046000612,0.00032577023,0.00013776521,0.22637235,0.0023618971,0.7631198,0.006534605,0.000055835604],"about_ca_topic_score_codex":0.0024881884,"about_ca_topic_score_gemma":0.001667041,"teacher_disagreement_score":0.0074027576,"about_ca_system_score_codex":0.003629254,"about_ca_system_score_gemma":0.0015442425,"threshold_uncertainty_score":0.0263322},"labels":[],"label_agreement":null},{"id":"W2782312501","doi":"10.1109/tit.2017.2789208","title":"Explicit Full Correlation Distribution of Sequence Families Using Plateaued Functions","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Orta Doğu Teknik Üniversitesi","keywords":"Correlation; Sequence (biology); Mathematics; Distribution (mathematics); Statistics; Computer science; Genetics; Biology; Mathematical analysis","score_opus":0.020004070796250637,"score_gpt":0.2379385320035846,"score_spread":0.21793446120733398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782312501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.44339246,0.00046885028,0.5451677,0.00026454875,0.00003491342,0.000060137038,0.0002773666,0.0004914699,0.009842498],"genre_scores_gemma":[0.9658939,0.00032320284,0.030492881,0.00009921364,0.000053317763,0.00010892736,0.000283167,0.00012089468,0.0026244298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998379,0.0005239554,0.00007152859,0.00021876002,0.00049329986,0.0003134815],"domain_scores_gemma":[0.9934076,0.0038484698,0.00066725165,0.0006920573,0.00095658365,0.00042807756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002384355,0.0006989084,0.0006127675,0.0023429752,0.000883141,0.001815307,0.0009801184,0.00089922576,0.0030969027],"category_scores_gemma":[0.012006592,0.0005267135,0.0006097962,0.0016895907,0.002041758,0.0037690448,0.0016451284,0.0012560723,0.00053086993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002886828,0.000084662395,0.004054108,0.00012167944,0.000029979194,0.00051186496,0.00042521892,0.08082452,0.01140888,0.8784008,0.0015405985,0.022308975],"study_design_scores_gemma":[0.00005446953,0.00018424485,0.0016541554,0.0000921034,0.000020524625,0.00076845457,0.00016801829,0.5854511,0.0141764,0.39396963,0.0033786392,0.00008220184],"about_ca_topic_score_codex":0.00075584376,"about_ca_topic_score_gemma":0.0005221957,"teacher_disagreement_score":0.0030969027,"about_ca_system_score_codex":0.0019531688,"about_ca_system_score_gemma":0.0011108546,"threshold_uncertainty_score":0.014171302},"labels":[],"label_agreement":null},{"id":"W2783366629","doi":"10.26493/1855-3974.938.1ae","title":"On t-fold covers of coherent configurations","year":2017,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Computer science","score_opus":0.032275262402703966,"score_gpt":0.2719553988205454,"score_spread":0.23968013641784147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783366629","genre_codex":"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.87932867,0.00026298506,0.07512246,0.00026399852,0.00011459007,0.000050585575,0.00019936149,0.00020000954,0.044457402],"genre_scores_gemma":[0.9835263,0.00015112717,0.008266327,0.000068361944,0.0000680202,0.00006944867,0.00019551434,0.00006947703,0.0075853947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994943,0.000072664625,0.000023972305,0.00011018431,0.00011509955,0.00018376007],"domain_scores_gemma":[0.999283,0.00014871644,0.0001307456,0.000090867456,0.00009697229,0.00024965242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039108878,0.00041495168,0.00033495488,0.0018674113,0.0015417353,0.0020287673,0.00045030745,0.00078720076,0.005871108],"category_scores_gemma":[0.0014987714,0.0003317274,0.00048135297,0.00094864616,0.0018069234,0.0026573478,0.0021304341,0.001027895,0.00073150167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036102225,0.000016122094,0.0008222268,0.000020575018,0.0000068921754,0.00035029923,0.00033994607,0.0019664601,0.004545534,0.9865628,0.00038062356,0.0049524433],"study_design_scores_gemma":[0.000034758254,0.000092340524,0.002096094,0.000048451104,0.000015637306,0.00082500203,0.00059629936,0.025682518,0.0061069173,0.9574502,0.0070142066,0.00003766419],"about_ca_topic_score_codex":0.0006149371,"about_ca_topic_score_gemma":0.0005203045,"teacher_disagreement_score":0.005871108,"about_ca_system_score_codex":0.00088109175,"about_ca_system_score_gemma":0.0002935225,"threshold_uncertainty_score":0.019640863},"labels":[],"label_agreement":null},{"id":"W278832587","doi":"10.1049/iet-com.2010.0078","title":"Efficient soft decoding of Reed–Solomon codes based on sphere decoding","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; List decoding; Code word; Algorithm; Sequential decoding; Computer science; Mathematics; Coding (social sciences); Theoretical computer science; Concatenated error correction code; Block code; Statistics","score_opus":0.0626680418802916,"score_gpt":0.2730091243760964,"score_spread":0.21034108249580483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W278832587","genre_codex":"methods","genre_gemma":"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.015208162,0.00030067784,0.981406,0.0000996798,0.00004882007,0.00005033406,0.000058119644,0.0004279134,0.0024002597],"genre_scores_gemma":[0.44686303,0.00069051393,0.54593253,0.00016525698,0.000087669025,0.00013951445,0.00032254757,0.00009663202,0.005702307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998938,0.00029680482,0.00006128466,0.00008110347,0.00053801946,0.00008472039],"domain_scores_gemma":[0.9986878,0.00057372916,0.00012183498,0.00023988477,0.00032247504,0.000054277152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051331683,0.0007649018,0.00087666645,0.0008637794,0.0003838284,0.00081757235,0.00068307196,0.00057989545,0.0011526704],"category_scores_gemma":[0.002499753,0.00027673037,0.00048413323,0.00087562995,0.0007113137,0.0008327207,0.0011364591,0.00085822324,0.0009495265],"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.00069661834,0.000115396244,0.0010603549,0.0003318191,0.000110767614,0.00052892376,0.000319142,0.2864946,0.13616282,0.119947724,0.0039463183,0.4502855],"study_design_scores_gemma":[0.000046343244,0.00013071993,0.00025837735,0.000022640454,0.000014520129,0.00029935135,0.000022691123,0.91543144,0.06287101,0.017156253,0.0036995942,0.000047129284],"about_ca_topic_score_codex":0.0013967807,"about_ca_topic_score_gemma":0.0015555129,"teacher_disagreement_score":0.0013967807,"about_ca_system_score_codex":0.0005720221,"about_ca_system_score_gemma":0.0013331935,"threshold_uncertainty_score":0.004150331},"labels":[],"label_agreement":null},{"id":"W2790464680","doi":"10.4213/mvk117","title":"Описание скрученных линейных рекуррент максимального периода в терминах мультипликаторов","year":2014,"lang":"ru","type":"article","venue":"Математические вопросы криптографии","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Psychology","score_opus":0.009770268943029212,"score_gpt":0.21146467684759654,"score_spread":0.20169440790456733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790464680","genre_codex":"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.1135536,0.04017284,0.26459628,0.0077620978,0.0031631428,0.0003732336,0.0012936151,0.001142469,0.5679428],"genre_scores_gemma":[0.63980955,0.027966423,0.22324029,0.0006470699,0.00085565925,0.0006088722,0.00062275684,0.00051109074,0.10573836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999076,0.00016637874,0.00005129664,0.00016645015,0.00042862177,0.00011120386],"domain_scores_gemma":[0.9992162,0.00019469223,0.00010625528,0.00014346726,0.0002747481,0.00006461423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000947531,0.00035221054,0.00030728924,0.0016783511,0.001156446,0.001950825,0.00042890458,0.00058397243,0.01497518],"category_scores_gemma":[0.002063427,0.00039475752,0.00042328492,0.0016308941,0.0017415995,0.0011897559,0.0010152111,0.0013962261,0.004662064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018389757,0.000065853965,0.0015244535,0.00041686094,0.00002573218,0.00085529464,0.0018561878,0.0025187016,0.025612848,0.6200277,0.012838578,0.33407384],"study_design_scores_gemma":[0.00004503951,0.00009745035,0.0034176642,0.00021387973,0.00004814591,0.0014245064,0.0008717791,0.0020659526,0.014544591,0.14243445,0.83474076,0.00009581617],"about_ca_topic_score_codex":0.0039489088,"about_ca_topic_score_gemma":0.0051677437,"teacher_disagreement_score":0.01497518,"about_ca_system_score_codex":0.0013676612,"about_ca_system_score_gemma":0.0025467894,"threshold_uncertainty_score":0.05009699},"labels":[],"label_agreement":null},{"id":"W2791716769","doi":"10.3934/amc.2019006","title":"Maximum weight spectrum codes","year":2018,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Conjecture; Finite field; Hamming distance; Discrete mathematics; Prime power; Bounded function; Integer (computer science); Hamming code; Prime (order theory); Upper and lower bounds; Spectrum (functional analysis); Linear code; Block code; Algorithm","score_opus":0.018168014798504373,"score_gpt":0.3000045371685736,"score_spread":0.28183652237006923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791716769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4055467,0.0026952093,0.51444745,0.0036844448,0.00047623113,0.00017115258,0.0015427154,0.0008108957,0.070625246],"genre_scores_gemma":[0.9276168,0.0008053207,0.057655502,0.0004238625,0.0003104776,0.00016104663,0.0008315835,0.00011303178,0.012082507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883646,0.00018047148,0.000054758235,0.00023393889,0.00042939401,0.000265017],"domain_scores_gemma":[0.996434,0.0018040065,0.00039557286,0.0006716419,0.0004367137,0.0002581084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663515,0.0005717567,0.0006271647,0.0012671431,0.0011606584,0.0015110731,0.0011935948,0.001312592,0.0045556184],"category_scores_gemma":[0.0060711545,0.00034075405,0.00048923487,0.0010998406,0.0015843916,0.0030238389,0.0022147822,0.0015892462,0.0010375674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022171247,0.000052849035,0.0010213924,0.00016641547,0.000023349075,0.00019648219,0.0002636793,0.014905384,0.010915797,0.93588996,0.004453713,0.03188927],"study_design_scores_gemma":[0.000044301018,0.000084843465,0.0007486028,0.00006829018,0.000016587868,0.00045993674,0.000103163584,0.08138773,0.010910774,0.894303,0.011835301,0.000037506677],"about_ca_topic_score_codex":0.00057743373,"about_ca_topic_score_gemma":0.00069994025,"teacher_disagreement_score":0.0045556184,"about_ca_system_score_codex":0.0012101365,"about_ca_system_score_gemma":0.00075332774,"threshold_uncertainty_score":0.015240014},"labels":[],"label_agreement":null},{"id":"W2791996780","doi":"10.1007/s12095-018-0292-7","title":"Compositional inverses of permutation polynomials of the form xrh(xs) over finite fields","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Program for New Century Excellent Talents in University","keywords":"Permutation (music); Finite field; Mathematics; Combinatorics; Polynomial; Inverse; Discrete mathematics; Cyclic permutation; Field (mathematics); Permutation matrix; Pure mathematics; Symmetric group; Physics","score_opus":0.019065109459526768,"score_gpt":0.2589763174456607,"score_spread":0.2399112079861339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791996780","genre_codex":"empirical","genre_gemma":"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.67317855,0.0006017899,0.24599788,0.0009920802,0.00041029972,0.00018652575,0.00037259728,0.00075160706,0.07750862],"genre_scores_gemma":[0.9514516,0.00037268418,0.026991194,0.00030035365,0.00028060513,0.000067662084,0.00033369815,0.00019428311,0.020007966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998776,0.0002300476,0.00006212242,0.0001698863,0.00039909504,0.00036280934],"domain_scores_gemma":[0.9981554,0.0008633417,0.00021946279,0.00034499864,0.0002655733,0.00015117571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095908233,0.00048553772,0.0004282172,0.0009538415,0.0008558334,0.0018678958,0.0006137421,0.00089673983,0.008754379],"category_scores_gemma":[0.0040686224,0.0003803435,0.00077304046,0.00061952154,0.0020409392,0.003166563,0.0015053162,0.0017668515,0.0015523222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034621242,0.00012063856,0.0005749457,0.000110092034,0.000015109827,0.00055604236,0.0006170632,0.002622366,0.010840399,0.9594052,0.0012771466,0.023514785],"study_design_scores_gemma":[0.00008647453,0.00021652522,0.0009384609,0.00006127911,0.000032617052,0.0008162845,0.00037899733,0.0130036315,0.019390585,0.9568109,0.008208839,0.00005534048],"about_ca_topic_score_codex":0.0005083985,"about_ca_topic_score_gemma":0.0005458065,"teacher_disagreement_score":0.008754379,"about_ca_system_score_codex":0.000649118,"about_ca_system_score_gemma":0.00097497646,"threshold_uncertainty_score":0.029286265},"labels":[],"label_agreement":null},{"id":"W2794440484","doi":"10.5539/jmr.v10n3p35","title":"Applications of Pell Polynomials in Rings","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ring (chemistry); Modulo; Generator (circuit theory); Combinatorics; Polynomial ring; Polynomial; Order (exchange); Type (biology); Discrete mathematics; Mathematical analysis; Power (physics)","score_opus":0.0726336278362588,"score_gpt":0.39747629711266697,"score_spread":0.32484266927640815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794440484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.27900636,0.010817085,0.524547,0.0022484916,0.0011789683,0.00011132428,0.0002786282,0.0005358895,0.18127628],"genre_scores_gemma":[0.90489733,0.0058328463,0.07080364,0.0002623696,0.0011107357,0.00005040903,0.00010598183,0.00013788641,0.01679869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945134,0.00018539747,0.00003120653,0.000111400535,0.00012839229,0.00009225253],"domain_scores_gemma":[0.9994252,0.00023668088,0.00008835478,0.00008304652,0.00008659025,0.00008011412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054655067,0.00060722604,0.00043635603,0.0016413188,0.0010696857,0.0012239412,0.00042689222,0.00038684794,0.0044328603],"category_scores_gemma":[0.0027329987,0.00023640231,0.0006213102,0.0013797318,0.0017396889,0.0024670463,0.0018004418,0.0010015954,0.0008263143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042503845,0.000012787261,0.00051327643,0.00007919195,0.000007226215,0.00014459297,0.0002613812,0.003679654,0.001792678,0.9634827,0.00068475143,0.02929935],"study_design_scores_gemma":[0.00001295318,0.00008809322,0.0005936538,0.00005348094,0.00001599437,0.0006799443,0.0001845505,0.019380221,0.003694437,0.9426549,0.032604862,0.000036914465],"about_ca_topic_score_codex":0.000735296,"about_ca_topic_score_gemma":0.00059630576,"teacher_disagreement_score":0.0044328603,"about_ca_system_score_codex":0.0009535645,"about_ca_system_score_gemma":0.0006356694,"threshold_uncertainty_score":0.014829397},"labels":[],"label_agreement":null},{"id":"W2796148655","doi":"10.22215/etd/2018-12651","title":"A Character Formula for the Sidelnikov-Lempel-Cohn-Eastman Sequences","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Manitoba","funders":"","keywords":"Mathematics; Character (mathematics); Multiplier (economics); Randomness; Modulo; Algebraic number; Prime (order theory); Discrete mathematics; Number theory; Sequence (biology); Combinatorics; Statistics; Mathematical analysis","score_opus":0.017876006387989408,"score_gpt":0.2760142367189429,"score_spread":0.25813823033095346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796148655","genre_codex":"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.48437008,0.0013249146,0.39199632,0.0018338383,0.0004767648,0.000113762326,0.0004918563,0.00023364217,0.11915878],"genre_scores_gemma":[0.94253844,0.0004845413,0.041983526,0.00042779406,0.00030145608,0.00014701902,0.00027629232,0.00009015712,0.013750756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993319,0.00014409766,0.000046340912,0.000096130636,0.00026680733,0.000114620714],"domain_scores_gemma":[0.9987539,0.00057495985,0.00013432819,0.00012768153,0.00027878155,0.00013030204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077383564,0.00039204347,0.0004173084,0.0018252773,0.0008595695,0.001430846,0.0007148863,0.0008141595,0.0041993335],"category_scores_gemma":[0.004176826,0.00020240714,0.00039169416,0.0011653096,0.0019030645,0.002777222,0.001221289,0.001793325,0.00079178385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019883228,0.000009513792,0.00018549342,0.00002164911,0.000002225609,0.00004539097,0.00013344991,0.00085923984,0.0015948683,0.9911522,0.00043602832,0.005540017],"study_design_scores_gemma":[0.000010635964,0.000036580117,0.00033705452,0.000030632877,0.000005656405,0.00022329984,0.00008207647,0.015095872,0.0037564128,0.97701365,0.0033831822,0.000024931727],"about_ca_topic_score_codex":0.00032927666,"about_ca_topic_score_gemma":0.00026980383,"teacher_disagreement_score":0.0041993335,"about_ca_system_score_codex":0.0011304935,"about_ca_system_score_gemma":0.00049889594,"threshold_uncertainty_score":0.014048159},"labels":[],"label_agreement":null},{"id":"W2799851485","doi":"10.1016/j.ejc.2018.03.006","title":"Constructing de Bruijn sequences with co-lexicographic order: The<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml23\" display=\"inline\" overflow=\"scroll\" altimg=\"si23.gif\"><mml:mi>k</mml:mi></mml:math>-ary Grandmama sequence","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Lexicographical order; Substring; Mathematics; String (physics); Combinatorics; Sequence (biology); Order (exchange); De Bruijn graph; Aperiodic graph; Discrete mathematics; Data structure; Computer science","score_opus":0.017720056711356687,"score_gpt":0.23768122403048136,"score_spread":0.21996116731912468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799851485","genre_codex":"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.058446802,0.000514296,0.8305521,0.0010292755,0.0007932562,0.0003333716,0.002331672,0.004925167,0.10107398],"genre_scores_gemma":[0.3351353,0.00082901795,0.5904583,0.0004804515,0.00029647446,0.00028371115,0.0054659257,0.003016237,0.06403461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990896,0.00024648965,0.00008846311,0.00018108691,0.00024581287,0.0001485574],"domain_scores_gemma":[0.9981406,0.0007964607,0.000105232575,0.000463079,0.00038122365,0.00011343402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007818722,0.00090039225,0.0006122199,0.0014827895,0.0013672092,0.0021002365,0.0007283346,0.00070694234,0.018070592],"category_scores_gemma":[0.004285597,0.00068178255,0.00084072916,0.0014643882,0.0009802156,0.002385822,0.0019888482,0.0014957101,0.012055057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034997094,0.00015261288,0.0009057381,0.0005505432,0.000045044402,0.00059783587,0.0008824772,0.009544612,0.018970734,0.73527896,0.038272902,0.19444855],"study_design_scores_gemma":[0.00012372033,0.0001293236,0.00042323628,0.00018970277,0.000043349268,0.0008440674,0.00030400688,0.03719109,0.0620243,0.7683407,0.13029796,0.00008862018],"about_ca_topic_score_codex":0.0011776205,"about_ca_topic_score_gemma":0.0022948452,"teacher_disagreement_score":0.018070592,"about_ca_system_score_codex":0.00068198534,"about_ca_system_score_gemma":0.0015859719,"threshold_uncertainty_score":0.060452104},"labels":[],"label_agreement":null},{"id":"W2803286074","doi":"10.1080/10236198.2018.1471471","title":"On the solution space of the Golomb recursion","year":2018,"lang":"en","type":"article","venue":"The Journal of Difference Equations and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Golomb coding; Mathematics; Recursion (computer science); Conjecture; Sequence (biology); Equivalence (formal languages); Equivalence relation; Combinatorics; Space (punctuation); Solution set; Pure mathematics; Set (abstract data type); Discrete mathematics; Algorithm; Computer science","score_opus":0.021594852961432407,"score_gpt":0.24417285455141852,"score_spread":0.2225780015899861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803286074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4572303,0.0011559365,0.4940729,0.0023885854,0.00009264846,0.00014692335,0.00023753567,0.00027151988,0.044403583],"genre_scores_gemma":[0.874703,0.0006077613,0.11416017,0.00041099,0.00010696355,0.00023127692,0.0003116894,0.00019153353,0.009276671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988462,0.0004701696,0.00004822748,0.00013670088,0.0002447711,0.00025393468],"domain_scores_gemma":[0.9976311,0.0016969246,0.00018088534,0.00013948293,0.00022245478,0.0001291412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018624692,0.0006833783,0.0007230207,0.0018534457,0.0019482642,0.0023549474,0.0009131747,0.0014741078,0.006027157],"category_scores_gemma":[0.008571722,0.0003843221,0.0011429361,0.0011201276,0.0045412867,0.0034516107,0.0022662673,0.002400463,0.00082358933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033387365,0.000017847331,0.00028366843,0.000030084375,0.00000407558,0.0000570961,0.00022415146,0.009247928,0.0006658073,0.9824913,0.00034486433,0.006599859],"study_design_scores_gemma":[0.000018197177,0.000021419299,0.00007911221,0.000022292266,0.000002932428,0.000033551318,0.000055154476,0.049704466,0.00051256374,0.9484037,0.0011349653,0.000011600213],"about_ca_topic_score_codex":0.0014596607,"about_ca_topic_score_gemma":0.0009372079,"teacher_disagreement_score":0.006027157,"about_ca_system_score_codex":0.0018677232,"about_ca_system_score_gemma":0.001195512,"threshold_uncertainty_score":0.02016288},"labels":[],"label_agreement":null},{"id":"W2806148690","doi":"10.51611/iars.irj.v8i1.2018.84","title":"Cryptanalysis of Mono-Alphabetic Substitution Ciphers using Genetic Algorithms and Simulated Annealing","year":2018,"lang":"en","type":"article","venue":"IARS International Research Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptanalysis; Ciphertext; Plaintext; Simulated annealing; Computer science; Cipher; Algorithm; Genetic algorithm; Substitution (logic); Theoretical computer science; Cryptography; Encryption; Machine learning; Computer security; Programming language","score_opus":0.08168138884846182,"score_gpt":0.3965612098387054,"score_spread":0.3148798209902436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806148690","genre_codex":"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.08064817,0.0003280564,0.913699,0.00033451463,0.000063944266,0.00009582332,0.000021374997,0.00022349859,0.004585675],"genre_scores_gemma":[0.6851487,0.00042889142,0.31106254,0.0001275768,0.000024440793,0.00012773603,0.00003524193,0.000047456953,0.0029973974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916065,0.00030108078,0.00004586148,0.000100706704,0.0003090681,0.00008265481],"domain_scores_gemma":[0.99908435,0.0005602449,0.00012261656,0.000107667904,0.000098572076,0.00002645197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009333191,0.00045892716,0.0005874145,0.00072860776,0.00048461714,0.00071407226,0.0005502142,0.000723729,0.00086163264],"category_scores_gemma":[0.0027607542,0.00024298068,0.00087579567,0.0005402943,0.0011570966,0.0008597981,0.0006042825,0.00078982493,0.000160729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018023273,0.00007925225,0.0015554372,0.00011335873,0.00012752097,0.00014420117,0.00015793058,0.8095607,0.017071525,0.11293526,0.00044939807,0.05762519],"study_design_scores_gemma":[0.000015657308,0.000052514606,0.0001977823,0.00001245047,0.000014188013,0.00006729819,0.00001871834,0.9735285,0.006689635,0.018604849,0.0007896906,0.00000869931],"about_ca_topic_score_codex":0.001368905,"about_ca_topic_score_gemma":0.0012986622,"teacher_disagreement_score":0.001368905,"about_ca_system_score_codex":0.00080836506,"about_ca_system_score_gemma":0.0010810194,"threshold_uncertainty_score":0.005865097},"labels":[],"label_agreement":null},{"id":"W2809380199","doi":"10.17781/p002436","title":"Power Efficient Gurumukhi Unicode Reader Design and Implementation on FPGA","year":2018,"lang":"en","type":"article","venue":"International Journal of New Computer Architectures and their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Unicode; Computer science; Field-programmable gate array; Power (physics); Embedded system; Wireless; Computer architecture; Computer hardware; Telecommunications; Artificial intelligence","score_opus":0.015370822721551007,"score_gpt":0.28910042617121945,"score_spread":0.27372960344966846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809380199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.26876312,0.003018056,0.5973271,0.0007890678,0.0005198804,0.0006920526,0.00076118164,0.021227581,0.10690191],"genre_scores_gemma":[0.8110648,0.00051914493,0.13503166,0.00037410337,0.00004431638,0.00023471528,0.0005740849,0.00030538277,0.05185179],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999795,0.0000316764,0.00001796826,0.000048968297,0.00006337132,0.00004299334],"domain_scores_gemma":[0.9998423,0.000029747505,0.000022539212,0.000027065324,0.000067794586,0.000010557914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109014,0.00041870365,0.0002698504,0.0004379725,0.0002481771,0.0007051223,0.0009736486,0.00030337373,0.012036029],"category_scores_gemma":[0.00028067944,0.0001645566,0.00017010955,0.00033323618,0.000114463954,0.00047844066,0.00021171068,0.00025229013,0.0032241372],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013717865,0.00019728055,0.004766369,0.0012264722,0.00016393952,0.0021950016,0.00062487065,0.025538735,0.36696944,0.015694676,0.037739128,0.5435123],"study_design_scores_gemma":[0.00034738812,0.0034026888,0.0085243,0.00027532104,0.00025750583,0.0069782594,0.0004805913,0.17548798,0.5724239,0.0028463192,0.22881268,0.00016301704],"about_ca_topic_score_codex":0.0009525229,"about_ca_topic_score_gemma":0.001579415,"teacher_disagreement_score":0.012036029,"about_ca_system_score_codex":0.00043087098,"about_ca_system_score_gemma":0.00033844082,"threshold_uncertainty_score":0.040264487},"labels":[],"label_agreement":null},{"id":"W2810042661","doi":"10.37236/8040","title":"$2$-Neighbour-Transitive Codes with Small Blocks of Imprimitivity","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive relation; Combinatorics; Mathematics; Hamming graph; Corollary; Transitive closure; Partition (number theory); Alphabet; Affine transformation; Discrete mathematics; Hamming distance; Hamming code; Block code; Algorithm; Pure mathematics; Decoding methods","score_opus":0.015017993378834263,"score_gpt":0.21669026466686267,"score_spread":0.2016722712880284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810042661","genre_codex":"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.9404345,0.0003076419,0.038128886,0.00012877649,0.00003548003,0.00003677094,0.00029279402,0.00009766881,0.020537507],"genre_scores_gemma":[0.9893701,0.00013341109,0.00735238,0.00004984538,0.000030142066,0.000036515372,0.0003068957,0.000028182172,0.002692534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989266,0.00016669735,0.00010223685,0.00021817227,0.00035707827,0.00022915643],"domain_scores_gemma":[0.9969336,0.0010298706,0.0006471267,0.00083117763,0.0002447658,0.00031343094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036361918,0.00034562667,0.0005540929,0.001068028,0.0009522453,0.0011789701,0.00064702355,0.00062600384,0.0020084279],"category_scores_gemma":[0.0029099528,0.0003483463,0.00061431824,0.0008363875,0.0020627377,0.00092780474,0.0012315384,0.000716315,0.00037789973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008184512,0.00009180999,0.009181915,0.00022653735,0.00006366865,0.0012816009,0.0015208628,0.03195594,0.033321507,0.87156725,0.001931148,0.048039302],"study_design_scores_gemma":[0.000089197674,0.00043190125,0.012716015,0.000091990856,0.00008519211,0.003680994,0.00061596953,0.085903026,0.029229203,0.85363567,0.013378708,0.00014214055],"about_ca_topic_score_codex":0.0013038273,"about_ca_topic_score_gemma":0.0015006013,"teacher_disagreement_score":0.0020084279,"about_ca_system_score_codex":0.000525891,"about_ca_system_score_gemma":0.0005090078,"threshold_uncertainty_score":0.006718874},"labels":[],"label_agreement":null},{"id":"W2810174119","doi":"10.4230/lipics.approx-random.2018.46","title":"Satisfiability and Derandomization for Small Polynomial Threshold Circuits","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Polynomial; Computer science; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.017630096420032347,"score_gpt":0.24257035753034417,"score_spread":0.22494026111031182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810174119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2634573,0.0011816024,0.7057559,0.0067742993,0.00019257294,0.00039568567,0.0014266866,0.0028656505,0.017950272],"genre_scores_gemma":[0.8976091,0.00064160937,0.08778442,0.0013375208,0.00025415412,0.00062297913,0.0013282365,0.00063456816,0.009787485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367493,0.002280925,0.0003370556,0.0016960566,0.0010580447,0.00095299527],"domain_scores_gemma":[0.96218765,0.029410033,0.0016453177,0.0046049207,0.0012882376,0.0008638938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043444256,0.001190021,0.0017395407,0.0010089893,0.0013612224,0.003701549,0.0026427135,0.0017523868,0.0069412347],"category_scores_gemma":[0.034128778,0.0006981056,0.0026696727,0.0011829715,0.0035560506,0.007855547,0.0040784054,0.005943125,0.0009447644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011490473,0.00023445538,0.0048084166,0.0005952848,0.00027232195,0.0002965773,0.0006195481,0.26940677,0.017564412,0.65631324,0.007992702,0.040747155],"study_design_scores_gemma":[0.00016315175,0.000087748514,0.00054691563,0.000048378017,0.00010207937,0.00009818075,0.000067122426,0.6167107,0.0057265237,0.3737628,0.0026495887,0.000036824382],"about_ca_topic_score_codex":0.0027518587,"about_ca_topic_score_gemma":0.003181865,"teacher_disagreement_score":0.0069412347,"about_ca_system_score_codex":0.005406523,"about_ca_system_score_gemma":0.0037872833,"threshold_uncertainty_score":0.039227307},"labels":[],"label_agreement":null},{"id":"W2858801556","doi":"10.1109/tc.2018.2854757","title":"Hardware Optimizations and Analysis for the WG-16 Cipher with Tower Field Arithmetic","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datapath; Computer science; Parallel computing; Arithmetic; Field-programmable gate array; Cipher; Clock rate; Computer hardware; Mathematics; Encryption; Chip","score_opus":0.01361540963635866,"score_gpt":0.2300953382651075,"score_spread":0.21647992862874885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2858801556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2777955,0.0023323467,0.6713474,0.00046484594,0.00018796805,0.00030721453,0.00050638866,0.002259017,0.04479936],"genre_scores_gemma":[0.84877217,0.0009836828,0.14231165,0.00011721915,0.000070261,0.00010663524,0.00060444674,0.00027711937,0.0067568896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994759,0.00008849849,0.000041720723,0.000050113023,0.00023280563,0.000110970854],"domain_scores_gemma":[0.99962413,0.00013120074,0.00005961296,0.00009528632,0.000079551326,0.000010172978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004908651,0.0007643091,0.0003371072,0.00074017403,0.00034698192,0.00071619893,0.00040356713,0.00022178129,0.0045573832],"category_scores_gemma":[0.0013898503,0.00022891881,0.00067902217,0.00068456726,0.00049328164,0.0016100033,0.0003903005,0.0006308546,0.0012316017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094049214,0.00013527054,0.0037433086,0.0007459407,0.00010827976,0.00083264447,0.00030758453,0.3807062,0.18493912,0.1987765,0.008140278,0.22062442],"study_design_scores_gemma":[0.00011961795,0.0009516737,0.001892704,0.00017120711,0.00011643054,0.00077600114,0.0001542029,0.75413054,0.16643889,0.042786133,0.03239606,0.00006661438],"about_ca_topic_score_codex":0.0009231168,"about_ca_topic_score_gemma":0.0014816583,"teacher_disagreement_score":0.0045573832,"about_ca_system_score_codex":0.00085721473,"about_ca_system_score_gemma":0.0011304257,"threshold_uncertainty_score":0.015245914},"labels":[],"label_agreement":null},{"id":"W2883399088","doi":"10.1016/j.jcta.2019.105173","title":"Minimal binary 2-neighbour-transitive codes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Australian Research Council","keywords":"Transitive relation; Mathematics; Combinatorics; Alphabet; Permutation (music); Mathematical proof; Discrete mathematics; Transitive closure; Binary number; Permutation group; Class (philosophy); Cyclic permutation; Symmetric group; Computer science; Arithmetic","score_opus":0.01077805819466981,"score_gpt":0.2373821752603489,"score_spread":0.2266041170656791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883399088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6823642,0.00096835394,0.08802727,0.00230739,0.0005560301,0.00021179586,0.0023789709,0.00065949967,0.22252643],"genre_scores_gemma":[0.95248413,0.00033325967,0.016830549,0.0004552874,0.00020263344,0.00012975132,0.0011111059,0.00016820592,0.028284986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988188,0.00022348261,0.00008265191,0.00019734632,0.0004145887,0.00026306583],"domain_scores_gemma":[0.9978321,0.0009351758,0.00027607888,0.000398117,0.00029492888,0.0002635878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044593602,0.0006277209,0.0008645761,0.001685501,0.001580584,0.003038751,0.0011259334,0.0018241822,0.009197148],"category_scores_gemma":[0.003438617,0.00047285418,0.0005555125,0.0012051775,0.0015041893,0.0020720274,0.0022206793,0.0016053697,0.0021226378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035685362,0.000069870635,0.0006479389,0.00013198676,0.000018670742,0.00026151427,0.0003471847,0.0028837642,0.006909806,0.9682529,0.004480916,0.015638562],"study_design_scores_gemma":[0.000078815036,0.0000496875,0.00053670944,0.000046794976,0.000024596347,0.00040088038,0.00011567309,0.0100094685,0.0046557477,0.9775065,0.006540007,0.000035109744],"about_ca_topic_score_codex":0.0006647447,"about_ca_topic_score_gemma":0.00093965017,"teacher_disagreement_score":0.009197148,"about_ca_system_score_codex":0.0010101161,"about_ca_system_score_gemma":0.0009927365,"threshold_uncertainty_score":0.0307675},"labels":[],"label_agreement":null},{"id":"W2883518022","doi":"","title":"Skew cyclic codes over &#x1d53d;p + u&#x1d53d;p","year":2018,"lang":"en","type":"article","venue":"International Journal of Information and Coding Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Skew; Mathematics; Combinatorics; Code (set theory); Cyclic code; Generator matrix; Prime (order theory); Ring (chemistry); Discrete mathematics; Ternary operation; Linear code; Block code; Algorithm; Computer science; Decoding methods; Telecommunications","score_opus":0.007443628613926179,"score_gpt":0.25292789128001436,"score_spread":0.2454842626660882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883518022","genre_codex":"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.8883686,0.00082622434,0.08620578,0.00033589592,0.000069685026,0.000041056257,0.00027922328,0.00010649568,0.023766985],"genre_scores_gemma":[0.9800909,0.00036338883,0.015144184,0.000050954055,0.000056749923,0.000023653636,0.0001115388,0.000032544136,0.004126009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995976,0.00009166892,0.000023152435,0.00007687047,0.00010313074,0.00010762854],"domain_scores_gemma":[0.99920124,0.00029139023,0.00023093881,0.00009475586,0.000097859156,0.000083816645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040097232,0.000246444,0.00026720474,0.00045277638,0.0004548038,0.0005714287,0.00023832574,0.00023845187,0.002805031],"category_scores_gemma":[0.001128602,0.00009930981,0.00022416317,0.00047141608,0.0008896404,0.0009722738,0.0006299399,0.00041685137,0.0003768013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027572407,0.00004354134,0.003331999,0.00013902223,0.000019223424,0.00059640483,0.0004525125,0.017724358,0.015542276,0.9108142,0.0013975848,0.049663108],"study_design_scores_gemma":[0.00006379456,0.0004099231,0.004436148,0.00010480967,0.000045403474,0.002767762,0.00047752107,0.10286722,0.051403932,0.80588007,0.031452835,0.00009063093],"about_ca_topic_score_codex":0.00045038684,"about_ca_topic_score_gemma":0.0003233144,"teacher_disagreement_score":0.002805031,"about_ca_system_score_codex":0.00048773576,"about_ca_system_score_gemma":0.00039683824,"threshold_uncertainty_score":0.009383738},"labels":[],"label_agreement":null},{"id":"W2884285234","doi":"10.1109/itw.1998.706467","title":"Relationships between different error-correcting capabilities of a code","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"University of Lethbridge","keywords":"Hamming distance; Error detection and correction; Hamming code; Computer science; Algorithm; Levenshtein distance; Channel (broadcasting); Code (set theory); Type (biology); Mathematics; Topology (electrical circuits); Combinatorics; Block code; Decoding methods; Telecommunications","score_opus":0.08557244224298977,"score_gpt":0.2492534551778942,"score_spread":0.16368101293490445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884285234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5416034,0.0012324047,0.4149891,0.0010795378,0.00014539616,0.0001518854,0.00068368996,0.00062090973,0.039493617],"genre_scores_gemma":[0.9551915,0.00053322344,0.04191782,0.00011981766,0.0000770815,0.00008728941,0.00017321056,0.000051034174,0.0018490265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949758,0.0012265043,0.00051881926,0.00097112235,0.0015763105,0.00073147524],"domain_scores_gemma":[0.93016547,0.046162494,0.007873887,0.0063874936,0.007047046,0.0023636017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030724749,0.001046004,0.0006295168,0.0044169626,0.0014057644,0.0042819194,0.001077166,0.001772671,0.0027470903],"category_scores_gemma":[0.03439351,0.000730707,0.0006022778,0.002462795,0.0052448586,0.008786498,0.003761347,0.0028517991,0.00046281927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018990955,0.00006278465,0.0042290613,0.00013042735,0.000048977192,0.00038988914,0.00048893027,0.016036918,0.006618486,0.94931656,0.0004166908,0.022071468],"study_design_scores_gemma":[0.000026120484,0.00014100253,0.002213064,0.00008218129,0.000063009975,0.0011780276,0.00031450862,0.06751874,0.016354155,0.90757924,0.004403223,0.00012673762],"about_ca_topic_score_codex":0.00041676854,"about_ca_topic_score_gemma":0.00040383518,"teacher_disagreement_score":0.0044169626,"about_ca_system_score_codex":0.001433283,"about_ca_system_score_gemma":0.00132705,"threshold_uncertainty_score":0.016248941},"labels":[],"label_agreement":null},{"id":"W2885945836","doi":"10.1016/j.disc.2018.07.010","title":"A framework for constructing de Bruijn sequences via simple successor rules","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Successor cardinal; Disjoint sets; Simple (philosophy); Mathematics; Correctness; De Bruijn graph; Discrete mathematics; Shift register; Combinatorics; Algorithm; Computer science","score_opus":0.028255695515363267,"score_gpt":0.3082963769190016,"score_spread":0.2800406814036383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885945836","genre_codex":"methods","genre_gemma":"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.017779393,0.00026384275,0.9596585,0.00024420116,0.00015267135,0.00007925737,0.00012020511,0.000681007,0.021020865],"genre_scores_gemma":[0.29054108,0.0008085713,0.68690175,0.00029216614,0.00022624418,0.0003053461,0.00038686374,0.0005171107,0.0200209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987174,0.00034774683,0.00010717963,0.00025044064,0.00042405145,0.00015313772],"domain_scores_gemma":[0.9981717,0.00093913625,0.000110426416,0.0004364152,0.0002171206,0.0001251288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016846452,0.00089124474,0.00090039225,0.0021200266,0.0020844522,0.003276416,0.0021141467,0.0012305323,0.0070920014],"category_scores_gemma":[0.0045790863,0.000964588,0.0016180212,0.0021095262,0.0033352787,0.0056012548,0.0028081858,0.0032943208,0.0026086296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015589954,0.000020325338,0.000048094367,0.000034949444,0.000004550177,0.000039648596,0.00011426328,0.0024337468,0.0010704774,0.9824651,0.0005224798,0.013230766],"study_design_scores_gemma":[0.000009081749,0.000017667613,0.00002294336,0.00001859325,0.0000070003057,0.00004937335,0.00001965184,0.010513771,0.001504493,0.9823186,0.005502451,0.000016289925],"about_ca_topic_score_codex":0.000783935,"about_ca_topic_score_gemma":0.0011674922,"teacher_disagreement_score":0.0070920014,"about_ca_system_score_codex":0.0009537943,"about_ca_system_score_gemma":0.0011095887,"threshold_uncertainty_score":0.023725092},"labels":[],"label_agreement":null},{"id":"W2890991810","doi":"10.1007/s12095-019-00384-4","title":"Unicyclic strong permutations","year":2019,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.01529905154711339,"score_gpt":0.24889155304962726,"score_spread":0.23359250150251387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890991810","genre_codex":"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.22501965,0.0024048567,0.13578328,0.0068755373,0.0014321858,0.00023898121,0.001434169,0.0008195718,0.62599176],"genre_scores_gemma":[0.85782087,0.001314035,0.01697732,0.0015259448,0.0007356741,0.00019621446,0.000741015,0.00021544992,0.120473504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847275,0.00041229735,0.00007892935,0.00026808467,0.00039288463,0.00037501095],"domain_scores_gemma":[0.996828,0.0011591245,0.00031311036,0.0008267903,0.00047809328,0.00039488485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010743053,0.00080300396,0.0010433975,0.001971603,0.0028240157,0.0035897954,0.0008348389,0.0012820611,0.018720934],"category_scores_gemma":[0.004004705,0.00061652955,0.0006735496,0.002568381,0.002536777,0.0051038093,0.004559768,0.0031228275,0.00434332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010105947,0.000016690145,0.00010116555,0.000046682944,0.0000067835854,0.00006772355,0.000097889875,0.00027888917,0.0007552169,0.986395,0.0035411194,0.008591838],"study_design_scores_gemma":[0.000028994771,0.00003422393,0.00014042921,0.000025738604,0.00001180685,0.00029676344,0.000057831283,0.0012108664,0.0010917177,0.9833308,0.013757878,0.000012975575],"about_ca_topic_score_codex":0.0002428848,"about_ca_topic_score_gemma":0.0003464205,"teacher_disagreement_score":0.018720934,"about_ca_system_score_codex":0.0010337486,"about_ca_system_score_gemma":0.0010582968,"threshold_uncertainty_score":0.06262773},"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":"W2893614166","doi":"10.3934/amc.2018044","title":"Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields","year":2018,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Mathematics; Logarithm; Computation; Field (mathematics); Discrete mathematics; Polynomial; Pure mathematics; Algorithm; Mathematical analysis; Computer science; Public-key cryptography","score_opus":0.025838952826023737,"score_gpt":0.316651990292815,"score_spread":0.29081303746679127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893614166","genre_codex":"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.5353427,0.0008303486,0.4346442,0.0023918794,0.00021031572,0.0001344999,0.0004310072,0.0016251529,0.024389926],"genre_scores_gemma":[0.92146176,0.00025131766,0.07533047,0.00021738863,0.00006022404,0.0000369906,0.00024112024,0.00007465968,0.0023260766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991248,0.00016425154,0.0000604454,0.00014553753,0.00030472438,0.0002003127],"domain_scores_gemma":[0.9973539,0.0016062515,0.00022390757,0.00045110253,0.00022558538,0.00013933597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013876957,0.0004627793,0.00052695174,0.0007031752,0.0008147936,0.0018573427,0.0007317042,0.00053555437,0.003524341],"category_scores_gemma":[0.0059041576,0.00017850212,0.0008707834,0.0010612482,0.0021955904,0.0047064913,0.0023334546,0.002056834,0.000828046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015186585,0.00030006218,0.009195647,0.00045303977,0.00010385656,0.0006347011,0.0010583827,0.049835872,0.024433766,0.76286024,0.0062587108,0.1433471],"study_design_scores_gemma":[0.00023917998,0.0002735259,0.0012121138,0.00009087334,0.000043941254,0.00048176083,0.00030715973,0.11107944,0.042023595,0.8312187,0.012956727,0.00007291711],"about_ca_topic_score_codex":0.0007511857,"about_ca_topic_score_gemma":0.0010077284,"teacher_disagreement_score":0.003524341,"about_ca_system_score_codex":0.0015386019,"about_ca_system_score_gemma":0.0016156319,"threshold_uncertainty_score":0.011790097},"labels":[],"label_agreement":null},{"id":"W2899859986","doi":"10.22215/etd/2018-13355","title":"Problems on Permutation and Irreducible Polynomials Over Finite Fields","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Finite field; TRACE (psycholinguistics); Mathematics; Discrete orthogonal polynomials; Difference polynomials; Field (mathematics); Pure mathematics; Classical orthogonal polynomials; Algebra over a field; Orthogonal polynomials; Combinatorics; Physics; Linguistics","score_opus":0.014267063163323955,"score_gpt":0.26011461515041245,"score_spread":0.2458475519870885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899859986","genre_codex":"methods","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.25818735,0.020411018,0.32735854,0.062864624,0.0026079887,0.00013620361,0.0016833488,0.000378457,0.3263725],"genre_scores_gemma":[0.8052342,0.018758846,0.07586714,0.002010223,0.006186811,0.00015741725,0.0020756705,0.00026949323,0.08944021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988691,0.00036406255,0.000051777955,0.00025575212,0.0002840746,0.00017513834],"domain_scores_gemma":[0.9958825,0.0032285934,0.00016310062,0.00031461442,0.00024621494,0.00016493305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015628507,0.0008288279,0.00094506925,0.0010640064,0.0023183918,0.0034602406,0.0009337016,0.0017668481,0.010141095],"category_scores_gemma":[0.007021294,0.00044401624,0.0009459461,0.0019064676,0.0045436374,0.008400401,0.0022704427,0.0045013977,0.0012447811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002305102,0.000020034808,0.00009614213,0.00008874709,0.0000048220472,0.000047523463,0.00013272854,0.0018791738,0.0001259366,0.98360175,0.0044139656,0.009566226],"study_design_scores_gemma":[0.000008282571,0.000007180838,0.00006319345,0.000025325291,0.0000022862184,0.00004817004,0.00008060228,0.0025194245,0.0001360975,0.99093646,0.0061678505,0.000005105923],"about_ca_topic_score_codex":0.0014722814,"about_ca_topic_score_gemma":0.00087759574,"teacher_disagreement_score":0.010141095,"about_ca_system_score_codex":0.0019876815,"about_ca_system_score_gemma":0.0018761032,"threshold_uncertainty_score":0.033925354},"labels":[],"label_agreement":null},{"id":"W2902857717","doi":"10.1109/iscisc.2018.8546855","title":"Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security","year":2018,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Modular arithmetic; Secrecy; Modular design; Lattice (music); Algebraic number; Discrete mathematics; Cryptography; Mathematics; Prime (order theory); Computer science; Combinatorics; Theoretical computer science; Algorithm; Physics","score_opus":0.004887033359057656,"score_gpt":0.20134492010896896,"score_spread":0.1964578867499113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902857717","genre_codex":"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.13020669,0.029304927,0.7199261,0.0028400633,0.000841006,0.00018799484,0.00037637696,0.00041878276,0.115898006],"genre_scores_gemma":[0.69727886,0.018525796,0.26819038,0.00049916375,0.0012930159,0.00025777143,0.00036141518,0.00011173363,0.013481771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995129,0.00015286542,0.000030390182,0.00008939099,0.0001657109,0.000048721697],"domain_scores_gemma":[0.9993075,0.00033878488,0.00011822866,0.000116632145,0.00006448518,0.00005438977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006610051,0.00046998655,0.00036896567,0.0016789696,0.00083874346,0.0012847222,0.00037376443,0.00038650862,0.0026146264],"category_scores_gemma":[0.0014876357,0.00026834465,0.0007060004,0.0012102968,0.0026608834,0.0019992113,0.0013039316,0.0016289195,0.0006228188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032037442,0.00002716181,0.00041243128,0.00016055872,0.000007686735,0.000089753856,0.00013880948,0.0051730555,0.002438652,0.9530626,0.0015127092,0.036944676],"study_design_scores_gemma":[0.000022362818,0.000110639536,0.00049090217,0.000111790214,0.00001314567,0.0009563861,0.000108692315,0.036266726,0.0057595484,0.90757316,0.04854148,0.00004512866],"about_ca_topic_score_codex":0.00032163854,"about_ca_topic_score_gemma":0.00027950844,"teacher_disagreement_score":0.0026146264,"about_ca_system_score_codex":0.001047902,"about_ca_system_score_gemma":0.00062756776,"threshold_uncertainty_score":0.008746743},"labels":[],"label_agreement":null},{"id":"W2902893142","doi":"10.1007/s12095-019-00386-2","title":"New constructions of involutions over finite fields","year":2019,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Finite field; Mathematics; Combinatorics; Permutation (music); Coding theory; Multiplicative function; Discrete mathematics; Field (mathematics); Inverse; Pure mathematics; Physics; Mathematical analysis; Geometry","score_opus":0.012569949773552767,"score_gpt":0.23385835745186695,"score_spread":0.22128840767831418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902893142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.206812,0.0033082073,0.6513971,0.003597282,0.0027711936,0.00020383655,0.00030195617,0.0021717614,0.12943658],"genre_scores_gemma":[0.79190457,0.0021418696,0.15160292,0.00095484976,0.0013388052,0.00022888916,0.00035187445,0.0010456265,0.050430607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984571,0.00043034295,0.00011876706,0.00021289974,0.0004564832,0.00032442846],"domain_scores_gemma":[0.99717605,0.0011606759,0.00020468213,0.00077430985,0.00027214552,0.0004121221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016469245,0.0013903804,0.0010411022,0.0029699933,0.0023898238,0.00410846,0.0017426867,0.0015656427,0.007824613],"category_scores_gemma":[0.004008315,0.0009254214,0.001525002,0.0020185902,0.0043342733,0.006929048,0.0046922304,0.0044208686,0.0018646608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039156643,0.000037883827,0.00013014923,0.000045059947,0.0000066235316,0.00011982685,0.00037470186,0.0006208333,0.0015617292,0.98475015,0.0012476776,0.011066057],"study_design_scores_gemma":[0.000031050633,0.00004288032,0.00008162041,0.000048184847,0.0000173141,0.00040694332,0.00013499359,0.0052123205,0.0033308829,0.973515,0.017148566,0.000030249825],"about_ca_topic_score_codex":0.0002133999,"about_ca_topic_score_gemma":0.00043856222,"teacher_disagreement_score":0.007824613,"about_ca_system_score_codex":0.0016803674,"about_ca_system_score_gemma":0.0006526215,"threshold_uncertainty_score":0.026175916},"labels":[],"label_agreement":null},{"id":"W2909715706","doi":"10.2478/ausi-2018-0010","title":"Sampling k-partite graphs with a given degree sequence","year":2018,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Informatica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bipartite graph; Combinatorics; Degree (music); Mathematics; Simple (philosophy); Simple graph; Graph; Sequence (biology); Complete bipartite graph; Discrete mathematics; Physics","score_opus":0.031590578671340415,"score_gpt":0.23983180174683097,"score_spread":0.20824122307549056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909715706","genre_codex":"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.77828604,0.00012005133,0.21355343,0.00060223433,0.000056721867,0.00025106993,0.0013336493,0.0012915342,0.0045053554],"genre_scores_gemma":[0.9431497,0.000043018375,0.05267317,0.00012060569,0.000032628148,0.00012522006,0.0015754426,0.000112730464,0.0021674798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989605,0.0004902516,0.000036064885,0.00021117394,0.00015677708,0.00014520573],"domain_scores_gemma":[0.9944003,0.0037054918,0.00023880343,0.0009400656,0.00039012547,0.00032512378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086747203,0.0005061904,0.0006866202,0.00078410155,0.0006359111,0.00078752823,0.0011870628,0.0009949167,0.0030040173],"category_scores_gemma":[0.008100719,0.00048199328,0.00070388627,0.0009016568,0.00074505596,0.0010009535,0.0009448513,0.0007612022,0.00058375567],"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.0031436898,0.00044496203,0.015757263,0.00029930798,0.00019171445,0.00050151383,0.00044488523,0.8576481,0.026517624,0.037296157,0.007885599,0.04986915],"study_design_scores_gemma":[0.00008937698,0.00005466158,0.0008835387,0.00000570029,0.000015876418,0.000040958024,0.00005361634,0.9791955,0.003374651,0.015791925,0.00048524002,0.000009034471],"about_ca_topic_score_codex":0.0025876078,"about_ca_topic_score_gemma":0.00478127,"teacher_disagreement_score":0.0030040173,"about_ca_system_score_codex":0.00081299536,"about_ca_system_score_gemma":0.0006321902,"threshold_uncertainty_score":0.010049403},"labels":[],"label_agreement":null},{"id":"W2911106712","doi":"10.1016/j.disc.2018.12.024","title":"Modified Erdös–Ginzburg–Ziv constants for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e22\" altimg=\"si12.gif\"><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>∕</mml:mo><mml:mi>n</mml:mi><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e33\" altimg=\"si13.gif\"><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>∕</mml:mo><mml:mi>n</mml:mi><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>","year":2019,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Sanitarium Association; University of Minnesota Duluth","keywords":"Scroll; Mathematics; Combinatorics; Discrete mathematics; Computer graphics (images); Computer science; Theology; Philosophy","score_opus":0.021009833591813968,"score_gpt":0.24561769744811865,"score_spread":0.22460786385630468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911106712","genre_codex":"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.011382603,0.0035381478,0.21438701,0.0060391636,0.00622094,0.00022167308,0.011400903,0.0053505255,0.741459],"genre_scores_gemma":[0.17200549,0.004714623,0.17212966,0.0032727576,0.0015967283,0.000891361,0.017138548,0.017753676,0.6104971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992617,0.00016412325,0.00003981381,0.00011439765,0.00032136435,0.000098604236],"domain_scores_gemma":[0.9993617,0.00011496022,0.00005661042,0.00016754855,0.00024470064,0.000054544034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013000099,0.0014282464,0.0010867044,0.0024887174,0.0014382374,0.003110639,0.00269577,0.0016223467,0.17684807],"category_scores_gemma":[0.003600478,0.0005937885,0.0011093069,0.0022322885,0.0009546143,0.0046279603,0.0017945819,0.0034134067,0.095224336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052931024,0.000036290632,0.00018727919,0.00019850962,0.000018472056,0.00008553081,0.00022355848,0.0013069888,0.0011340964,0.73399913,0.23093143,0.031825706],"study_design_scores_gemma":[0.000053271662,0.000025646703,0.0006842067,0.0001139791,0.000017462216,0.0002095575,0.00017646798,0.0089107985,0.0026195827,0.41530195,0.57180405,0.000082935876],"about_ca_topic_score_codex":0.0043005026,"about_ca_topic_score_gemma":0.0054748044,"teacher_disagreement_score":0.17684807,"about_ca_system_score_codex":0.0031803285,"about_ca_system_score_gemma":0.0015244358,"threshold_uncertainty_score":0.59161574},"labels":[],"label_agreement":null},{"id":"W2911380990","doi":"10.3934/amc.2019019","title":"Some new constructions of isodual and LCD codes over finite fields","year":2019,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Finite field; Liquid-crystal display; Dual (grammatical number); Generator (circuit theory); Root (linguistics); Simple (philosophy); Discrete mathematics; Pure mathematics; Computer science; Physics; Linguistics; Power (physics)","score_opus":0.015160570346571891,"score_gpt":0.2879144393704459,"score_spread":0.27275386902387405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911380990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.3060382,0.0023262438,0.60506177,0.0012304983,0.00054403977,0.00021750802,0.00051772106,0.0005392681,0.08352473],"genre_scores_gemma":[0.7710124,0.0014136782,0.21168904,0.00060374575,0.0003349166,0.00021933556,0.00063905906,0.00019413438,0.0138936285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940133,0.00012352048,0.000049012684,0.000121763755,0.00021338761,0.00009099538],"domain_scores_gemma":[0.9989574,0.00030144124,0.0001177167,0.00027892005,0.0002078613,0.0001366701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057048694,0.00040807194,0.00035809528,0.0014407494,0.0010864085,0.0010537178,0.0005532512,0.0005770227,0.0026246957],"category_scores_gemma":[0.0019333381,0.0003099999,0.00054489996,0.0008561409,0.0015203056,0.0016388888,0.0018324406,0.0015813796,0.00048358188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012280408,0.00004402498,0.0011021749,0.00015808965,0.0000105788995,0.00036214493,0.00064631604,0.0041031525,0.015497834,0.9300201,0.0015296186,0.04640326],"study_design_scores_gemma":[0.000103545855,0.00025315557,0.0012107186,0.00016347882,0.000051696283,0.0028125995,0.0004143634,0.051243782,0.040559545,0.8278829,0.07516735,0.00013684356],"about_ca_topic_score_codex":0.00032907553,"about_ca_topic_score_gemma":0.00036593137,"teacher_disagreement_score":0.0026246957,"about_ca_system_score_codex":0.0008905703,"about_ca_system_score_gemma":0.000683749,"threshold_uncertainty_score":0.008780479},"labels":[],"label_agreement":null},{"id":"W2911871489","doi":"10.1016/j.jsc.2012.05.010","title":"Generating subfields","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Factorization; Lattice (music); Set (abstract data type); Unique factorization domain; Implementation; Lattice reduction; Algebra over a field; Degree (music); Discrete mathematics; Combinatorics; Algorithm; Pure mathematics; Computer science","score_opus":0.016794418969717118,"score_gpt":0.2626005843204643,"score_spread":0.24580616535074717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911871489","genre_codex":"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.26278353,0.0011337613,0.23835617,0.0057309233,0.0020829288,0.0002568086,0.00058166054,0.0010891324,0.48798501],"genre_scores_gemma":[0.7960808,0.0009428846,0.046658237,0.0011295495,0.0011487588,0.00020554278,0.00069709047,0.00075560214,0.15238152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993112,0.0001854047,0.00003071513,0.00009745463,0.00022833263,0.00014687688],"domain_scores_gemma":[0.99903095,0.00030513396,0.000078294215,0.00023846766,0.00019291101,0.00015425333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094371685,0.001043292,0.00096198934,0.0023458046,0.002187627,0.0026114986,0.0010276536,0.0011021228,0.018532595],"category_scores_gemma":[0.0024175213,0.0004962433,0.0009944803,0.0014889168,0.0027970767,0.0042924182,0.002726144,0.003642974,0.004431553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023652943,0.000021273578,0.00006427146,0.000012403655,0.000002729788,0.00002384023,0.000103848,0.00021216291,0.00046416448,0.9918154,0.0015942984,0.0056618955],"study_design_scores_gemma":[0.000015108612,0.00001598296,0.000043711927,0.000009337762,0.0000050288636,0.00006784377,0.00003681823,0.0016908029,0.0009795924,0.99137235,0.0057566627,0.0000068233317],"about_ca_topic_score_codex":0.00033037312,"about_ca_topic_score_gemma":0.00035089493,"teacher_disagreement_score":0.018532595,"about_ca_system_score_codex":0.0012309732,"about_ca_system_score_gemma":0.00080669916,"threshold_uncertainty_score":0.06199771},"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":"W2921327408","doi":"10.1109/access.2019.2903304","title":"Exploring Various Levels of Parallelism in High-Performance CRC Algorithms","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Higher Education Discipline Innovation Project","keywords":"Computer science; Parallel computing; Task parallelism; Thread (computing); Data parallelism; Instruction-level parallelism; Slicing; Speedup; Parallelism (grammar); Implicit parallelism; Algorithm; Computation","score_opus":0.09974725890309234,"score_gpt":0.2800559948137624,"score_spread":0.1803087359106701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921327408","genre_codex":"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.1152448,0.001399847,0.8737472,0.00048754385,0.000049732214,0.00012127873,0.000040293282,0.000497515,0.008411719],"genre_scores_gemma":[0.6544901,0.0007660426,0.34263325,0.00010741667,0.000050918385,0.00007959124,0.00007974373,0.00007768066,0.001715284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881554,0.00031176078,0.000061757804,0.00014068691,0.00053111045,0.00013914179],"domain_scores_gemma":[0.9980313,0.0010576721,0.00020304648,0.0003265765,0.0003193733,0.00006196756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013661126,0.0005593368,0.00042869794,0.0007938543,0.00062079105,0.0010239566,0.00067364646,0.0005630691,0.0013143596],"category_scores_gemma":[0.004456534,0.00030325775,0.0005056009,0.0008455318,0.0008509719,0.002346404,0.0007972733,0.00096520944,0.00028520235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042916287,0.00027189683,0.004093451,0.0003405779,0.000076580356,0.00032645627,0.00042418786,0.5144443,0.04473008,0.17915876,0.0017396752,0.25396496],"study_design_scores_gemma":[0.00003480765,0.00019860521,0.00045583415,0.000031494114,0.0000205362,0.00014179914,0.00005535396,0.92823076,0.01342827,0.054156654,0.0032241067,0.000021778415],"about_ca_topic_score_codex":0.0013768917,"about_ca_topic_score_gemma":0.0021581303,"teacher_disagreement_score":0.0013768917,"about_ca_system_score_codex":0.0007310974,"about_ca_system_score_gemma":0.0014878468,"threshold_uncertainty_score":0.0072247386},"labels":[],"label_agreement":null},{"id":"W2922170409","doi":"10.1007/s00493-018-3779-0","title":"The Two-Point Fano and Ideal Binary Clutters","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fano plane; Ideal (ethics); Combinatorics; Binary number; Mathematics; Clutter; Discrete mathematics; Physics; Pure mathematics; Arithmetic; Computer science; Telecommunications","score_opus":0.0053238846182333665,"score_gpt":0.21095649114792916,"score_spread":0.2056326065296958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922170409","genre_codex":"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.39736426,0.0028035627,0.16736741,0.0060722064,0.0006174026,0.00007941969,0.0008000187,0.00048008285,0.42441562],"genre_scores_gemma":[0.94801664,0.0009136255,0.014166341,0.00057063706,0.0005672165,0.00006479131,0.00027731972,0.00010990829,0.035313547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898535,0.00026518616,0.0000372784,0.00016232922,0.00029820175,0.00025160034],"domain_scores_gemma":[0.9983132,0.00074883655,0.00019821718,0.00022791454,0.00019172755,0.0003200548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012776302,0.0008054252,0.0009647806,0.0036522995,0.003202692,0.0041511413,0.00092031923,0.0014029284,0.011362453],"category_scores_gemma":[0.0044927676,0.0005170045,0.00066993246,0.0025090503,0.005320968,0.0062187226,0.0027240214,0.002128339,0.0013528662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020163558,0.0000047947715,0.000072241535,0.000007637103,0.0000012062742,0.000020473684,0.000060223276,0.00033336045,0.00009901406,0.99669766,0.00080325204,0.0018800527],"study_design_scores_gemma":[0.0000092341315,0.0000058219057,0.000117508695,0.000010548847,0.000002676589,0.00010205302,0.00004709171,0.0022400625,0.00020088314,0.9932591,0.003992789,0.000012258228],"about_ca_topic_score_codex":0.0013333217,"about_ca_topic_score_gemma":0.00080677326,"teacher_disagreement_score":0.011362453,"about_ca_system_score_codex":0.0016118422,"about_ca_system_score_gemma":0.00069748354,"threshold_uncertainty_score":0.038011253},"labels":[],"label_agreement":null},{"id":"W2943388400","doi":"10.1109/tit.2020.3016510","title":"New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Windsor; University of Waterloo","funders":"","keywords":"Quaternion; Conjecture; Perfect power; Sequence (biology); Connection (principal bundle); Power of two","score_opus":0.01412715130810025,"score_gpt":0.21804413429190164,"score_spread":0.2039169829838014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943388400","genre_codex":"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.5150932,0.002313522,0.4004045,0.0013078382,0.0004935758,0.000111773035,0.00038264602,0.00060361036,0.07928918],"genre_scores_gemma":[0.90452206,0.0010290629,0.06973554,0.00035120788,0.00025191082,0.00024245559,0.0004542268,0.00014585516,0.023267753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991455,0.00018827217,0.000065189466,0.00019782418,0.00024013185,0.00016309689],"domain_scores_gemma":[0.99761605,0.0010559553,0.000479984,0.00028318327,0.00026721196,0.00029765192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088266644,0.00067588984,0.00036960177,0.0020953813,0.0015215288,0.0016856511,0.00078759843,0.0008788317,0.005886948],"category_scores_gemma":[0.0044951076,0.00053267385,0.0005229623,0.0010169555,0.0021061723,0.0041635544,0.0017057209,0.0012895297,0.0008240376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007786589,0.000021125457,0.000837023,0.00006177542,0.000008009026,0.0003883864,0.00041377856,0.0023281928,0.005342076,0.9725352,0.0009819446,0.017004767],"study_design_scores_gemma":[0.000035916437,0.00016242352,0.0007491695,0.000105300234,0.000023613862,0.0013473302,0.00032141645,0.020230336,0.014053475,0.9303143,0.03258008,0.00007659739],"about_ca_topic_score_codex":0.00027549049,"about_ca_topic_score_gemma":0.00035140797,"teacher_disagreement_score":0.005886948,"about_ca_system_score_codex":0.001001722,"about_ca_system_score_gemma":0.00050741545,"threshold_uncertainty_score":0.019693792},"labels":[],"label_agreement":null},{"id":"W2943969851","doi":"10.5539/jmr.v11n3p14","title":"On Liouvillian Solutions of Third Order Homogeneous Linear Differential Equations","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homogeneous; Exponent; Invariant (physics); Combinatorics; Logarithm; Exponential function; Differential equation; Constant (computer programming); Mathematical physics; Pure mathematics; Mathematical analysis","score_opus":0.09084313278958654,"score_gpt":0.3563194632935208,"score_spread":0.26547633050393427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943969851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.21689759,0.0013590449,0.70581347,0.0011253589,0.000302888,0.00018563544,0.00022137431,0.0006026505,0.07349197],"genre_scores_gemma":[0.67191046,0.0015782893,0.2625727,0.00044411008,0.00022916905,0.0001698874,0.0004438044,0.0003936398,0.062257875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994992,0.00013692013,0.000026870484,0.00006167608,0.00016237742,0.00011281028],"domain_scores_gemma":[0.99944705,0.00026582388,0.0000810302,0.000057872625,0.00008805044,0.00006019109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011009455,0.0009478899,0.00075137295,0.0015862944,0.0012800199,0.0018191646,0.0010172006,0.0007839332,0.006820524],"category_scores_gemma":[0.00297025,0.00032091324,0.00092106056,0.0016136718,0.0028102603,0.0023490812,0.0025080552,0.002209919,0.0019426766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112827714,0.000048834954,0.0010412338,0.00012557226,0.000013911869,0.00037235257,0.0011109293,0.008311908,0.0039751716,0.9377739,0.0016630198,0.045450367],"study_design_scores_gemma":[0.00006166956,0.000121064266,0.0005088671,0.000071726696,0.0000195736,0.00031042498,0.00047555845,0.092024125,0.009884206,0.8738114,0.022662703,0.0000487651],"about_ca_topic_score_codex":0.0019459724,"about_ca_topic_score_gemma":0.0022246398,"teacher_disagreement_score":0.006820524,"about_ca_system_score_codex":0.0015772367,"about_ca_system_score_gemma":0.00086100854,"threshold_uncertainty_score":0.022816956},"labels":[],"label_agreement":null},{"id":"W2945676371","doi":"10.1049/pbse001e_ch11","title":"Recent trends in the cryptanalysis of block ciphers","year":2018,"lang":"en","type":"book-chapter","venue":"Institution of Engineering and Technology eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Cryptographic primitive; Linear cryptanalysis; Computer science; Cryptanalysis; Cryptography; Boomerang attack; Differential cryptanalysis; Focus (optics); Block (permutation group theory); Theoretical computer science; Computer security; Mathematics; Cryptographic protocol; Combinatorics; Physics","score_opus":0.01177854641691063,"score_gpt":0.2070096056228307,"score_spread":0.19523105920592007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945676371","genre_codex":"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.0027711233,0.76240504,0.06693726,0.005049137,0.004756187,0.0000787142,0.00020090178,0.0005218525,0.15727976],"genre_scores_gemma":[0.024649212,0.8126966,0.042603593,0.0020907072,0.0073668663,0.00010300305,0.0005409702,0.00037856156,0.109570466],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913126,0.000111957146,0.000050503,0.00013163901,0.0005172483,0.000057438116],"domain_scores_gemma":[0.99870205,0.00079812837,0.00005555073,0.00015062929,0.0002448817,0.00004865613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411033,0.000943088,0.00077993923,0.003067322,0.00045571776,0.0024681122,0.0010311293,0.0012101537,0.016512977],"category_scores_gemma":[0.002380283,0.00065305765,0.00061968004,0.0053555383,0.0014525121,0.0053620497,0.0014147338,0.0033943113,0.0117494],"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.00007484678,0.000078911886,0.00015193295,0.002681087,0.00003298559,0.0001282223,0.00020379097,0.0027059882,0.0046941866,0.27839327,0.060981207,0.6498735],"study_design_scores_gemma":[0.000012723678,0.00006096076,0.00018288534,0.0006056449,0.000017419605,0.00066029094,0.00004238347,0.0026233818,0.0031455657,0.098461986,0.8941643,0.000022397231],"about_ca_topic_score_codex":0.00024858085,"about_ca_topic_score_gemma":0.00029828274,"teacher_disagreement_score":0.016512977,"about_ca_system_score_codex":0.0011910701,"about_ca_system_score_gemma":0.00086398155,"threshold_uncertainty_score":0.055241466},"labels":[],"label_agreement":null},{"id":"W2945969795","doi":"10.48550/arxiv.1905.07798","title":"Construction of irreducible polynomials through rational transformations","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Degree (music); Finite field; Combinatorics; Irreducible polynomial; Mathematics; Prime power; Prime (order theory); Field (mathematics); Divisor (algebraic geometry); Polynomial; Sequence (biology); Discrete mathematics; Physics; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.06413194052311819,"score_gpt":0.1908568574993896,"score_spread":0.12672491697627142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945969795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.34738228,0.00047385713,0.56912696,0.00092367345,0.00029441825,0.00022177002,0.0003442863,0.0013622646,0.07987031],"genre_scores_gemma":[0.8699468,0.00056746963,0.11013336,0.00018535212,0.000107378786,0.000092094866,0.00037840905,0.00028282235,0.018306458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934524,0.00010624103,0.000023855666,0.00010323842,0.00021290021,0.00020860104],"domain_scores_gemma":[0.9995937,0.00012735903,0.000049805218,0.00009046659,0.00006637546,0.000072387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005098124,0.0005718324,0.00046995722,0.0012493655,0.000992088,0.0011995302,0.0006103939,0.0004983409,0.0043585566],"category_scores_gemma":[0.00152609,0.00036371645,0.0007256939,0.00079956796,0.0016241457,0.0013542784,0.0020674998,0.0016551787,0.0014595267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007249031,0.00008959233,0.0006215063,0.00007770418,0.000009019254,0.00029534035,0.0006395701,0.004282835,0.013742758,0.93814284,0.0021465097,0.039879866],"study_design_scores_gemma":[0.00013362146,0.0002493665,0.00095180137,0.000095133,0.000050509047,0.00082005194,0.00037084785,0.053145625,0.059247814,0.83979094,0.045050222,0.00009411455],"about_ca_topic_score_codex":0.0007166383,"about_ca_topic_score_gemma":0.0007718009,"teacher_disagreement_score":0.0043585566,"about_ca_system_score_codex":0.0007810367,"about_ca_system_score_gemma":0.0008409775,"threshold_uncertainty_score":0.014580846},"labels":[],"label_agreement":null},{"id":"W2947382456","doi":"10.1145/3338637.3338639","title":"Computing isomorphisms and embeddings of finite fields","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Embedding; Automorphism; Prime (order theory); Prime power; Field (mathematics); Mathematics; Combinatorics; Discrete mathematics; Physics; Pure mathematics; Computer science","score_opus":0.021110576094278227,"score_gpt":0.2708240089321153,"score_spread":0.24971343283783706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947382456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.42651886,0.0012311,0.5556735,0.0011308293,0.00019151847,0.000119052114,0.0008908555,0.0041432483,0.010101018],"genre_scores_gemma":[0.7366509,0.0005157221,0.2539853,0.00017132299,0.00019186952,0.000111566646,0.0022129787,0.000499005,0.0056614093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963522,0.00093706365,0.00039266632,0.0009356483,0.0008348071,0.0005475376],"domain_scores_gemma":[0.9904018,0.005637179,0.00072464,0.002033166,0.00068024494,0.0005229495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025692717,0.0009608627,0.0009881788,0.0024654425,0.0011824983,0.00460705,0.0020498137,0.0012074065,0.0040437505],"category_scores_gemma":[0.015211426,0.0009907396,0.0014528504,0.0030885434,0.003992864,0.015535157,0.0049394662,0.002346922,0.0010486766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007853908,0.0003635691,0.010642463,0.0005190938,0.0001399724,0.00051882904,0.0030471093,0.041324105,0.008801734,0.70703393,0.006031833,0.22079197],"study_design_scores_gemma":[0.000046237787,0.000102703416,0.00072185224,0.00006105507,0.00003526957,0.0001453757,0.00057119527,0.04798116,0.005487594,0.9392153,0.0055979537,0.000034367822],"about_ca_topic_score_codex":0.0015799649,"about_ca_topic_score_gemma":0.0018276307,"teacher_disagreement_score":0.00460705,"about_ca_system_score_codex":0.0019711102,"about_ca_system_score_gemma":0.0010851631,"threshold_uncertainty_score":0.014301479},"labels":[],"label_agreement":null},{"id":"W2949157299","doi":"10.48550/arxiv.1410.2903","title":"Quadratic Zero-Difference Balanced Functions, APN Functions and Strongly Regular Graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero (linguistics); Mathematics; Combinatorics; Zero set; Integer (computer science); Quadratic equation; Function (biology); Discrete mathematics; Square (algebra); Planar; Geometry","score_opus":0.03459704331227223,"score_gpt":0.1670907178183848,"score_spread":0.13249367450611257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949157299","genre_codex":"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.8383543,0.00027795974,0.13270609,0.00040944808,0.000032871834,0.000026963593,0.00019397834,0.00017837975,0.027820036],"genre_scores_gemma":[0.98186815,0.00018034341,0.011856489,0.00009484155,0.000031396572,0.000031019787,0.0001607729,0.000049306578,0.005727693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997365,0.000050601877,0.000013960831,0.00007244189,0.000066805886,0.00005970313],"domain_scores_gemma":[0.9994485,0.00020633567,0.0000821898,0.00010495926,0.00007859294,0.0000793655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036189405,0.00034445876,0.00027693465,0.0006337934,0.0006546161,0.0009534723,0.0005064959,0.00039014744,0.0020644472],"category_scores_gemma":[0.0014149568,0.00019288993,0.0003438539,0.00051391654,0.001475168,0.0017288482,0.0010073627,0.0007233546,0.00028477385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009272408,0.000025265508,0.0016871816,0.000047257497,0.000008680432,0.0001618567,0.00034154335,0.00554488,0.010480381,0.96344835,0.0006272461,0.017534664],"study_design_scores_gemma":[0.00003206916,0.00011275854,0.0025229275,0.000036536712,0.00003100659,0.00088482123,0.0005034244,0.06517327,0.015836157,0.90154564,0.013282486,0.0000390155],"about_ca_topic_score_codex":0.000698464,"about_ca_topic_score_gemma":0.0005682246,"teacher_disagreement_score":0.0020644472,"about_ca_system_score_codex":0.0009584045,"about_ca_system_score_gemma":0.0002501362,"threshold_uncertainty_score":0.0069537163},"labels":[],"label_agreement":null},{"id":"W2949277723","doi":"","title":"On Isogeny Graphs of Supersingular Elliptic Curves over Finite Fields.","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Supersingular elliptic curve; Finite field; Mathematics; Elliptic curve; Pure mathematics; Discrete mathematics","score_opus":0.015041918843179607,"score_gpt":0.2532680040649097,"score_spread":0.23822608522173008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949277723","genre_codex":"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.913076,0.0006756949,0.03404987,0.0017363667,0.00015562249,0.00009212689,0.0004777532,0.00015013329,0.049586415],"genre_scores_gemma":[0.9847904,0.00061624387,0.0048755095,0.00021624606,0.00013447014,0.000049051072,0.0005426933,0.00009740432,0.008678063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956876,0.00010769216,0.000012363327,0.000098958844,0.000102637474,0.00010963758],"domain_scores_gemma":[0.9984401,0.00064778514,0.00034553386,0.00012506342,0.00014184075,0.00029971788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046176318,0.0007451199,0.0006704045,0.0030506265,0.0019472453,0.0024983326,0.00070616364,0.0009874781,0.0062786997],"category_scores_gemma":[0.002439256,0.00038804114,0.0006167502,0.0017003355,0.0023006792,0.0033763172,0.0014936791,0.0015205815,0.00058933685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098291624,0.000040087878,0.0015307568,0.00007122378,0.000010434764,0.00040310496,0.0006691018,0.0042255498,0.0020178135,0.9816181,0.0018183051,0.0074970657],"study_design_scores_gemma":[0.000020787473,0.000022143013,0.0011559672,0.00003234763,0.000012772809,0.00022086334,0.00040112704,0.006620184,0.0011149534,0.9869467,0.0034389999,0.000013214305],"about_ca_topic_score_codex":0.0013627309,"about_ca_topic_score_gemma":0.0009887132,"teacher_disagreement_score":0.0062786997,"about_ca_system_score_codex":0.0012639994,"about_ca_system_score_gemma":0.00048890524,"threshold_uncertainty_score":0.02100432},"labels":[],"label_agreement":null},{"id":"W2949436340","doi":"10.48550/arxiv.1101.3682","title":"Diversification improves interpolation","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interpolation (computer graphics); Polynomial; Mathematical optimization; Subroutine; Mathematics; Algorithm; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.07856686972037918,"score_gpt":0.17446414768115845,"score_spread":0.09589727796077926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949436340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.066112205,0.0006882358,0.91486657,0.0011033012,0.00017737785,0.00010418342,0.0001658517,0.0014713432,0.015310986],"genre_scores_gemma":[0.53159183,0.0004897876,0.4580417,0.00070893025,0.00013854729,0.00016241423,0.0004276681,0.0004881017,0.007951072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977196,0.0007894519,0.00009331519,0.0004454953,0.00068325497,0.0002687712],"domain_scores_gemma":[0.994007,0.003173241,0.00039171142,0.0016945811,0.00052659085,0.00020679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028524583,0.00079571025,0.0013745642,0.0008855214,0.0010875107,0.0012966773,0.0013895194,0.0015309484,0.0067814416],"category_scores_gemma":[0.014348389,0.00042214314,0.001062021,0.0010903027,0.0018027743,0.002802964,0.004594603,0.0028377846,0.002748648],"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.0009549869,0.0003011739,0.0051915674,0.00033041727,0.00009919668,0.00040589782,0.00044063682,0.31274498,0.025758233,0.37542537,0.011717777,0.26662984],"study_design_scores_gemma":[0.00014434331,0.00028040996,0.00045517227,0.00005965108,0.000030654806,0.00034596684,0.00007604704,0.80756587,0.010901405,0.16814628,0.011952532,0.000041613668],"about_ca_topic_score_codex":0.0007580319,"about_ca_topic_score_gemma":0.0009700643,"teacher_disagreement_score":0.0067814416,"about_ca_system_score_codex":0.0009207614,"about_ca_system_score_gemma":0.0014270187,"threshold_uncertainty_score":0.022686124},"labels":[],"label_agreement":null},{"id":"W2949439822","doi":"","title":"Cryptographic hash functions from expander graphs.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hash function; Collision resistance; Expander graph; Ramanujan's sum; Rolling hash; Double hashing; Cryptographic hash function; Discrete mathematics; SWIFFT; Mathematics; SHA-2; Computer science; Graph; Combinatorics","score_opus":0.015068098000872231,"score_gpt":0.23397112799222256,"score_spread":0.21890302999135033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949439822","genre_codex":"methods","genre_gemma":"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.13031061,0.0006581168,0.8354807,0.00153505,0.00018412388,0.0005012056,0.0005446573,0.0026242733,0.028161155],"genre_scores_gemma":[0.80568725,0.000493091,0.18022896,0.00062166736,0.00014552425,0.00039859102,0.00094855455,0.0003218129,0.011154507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981116,0.00061306386,0.00005712136,0.00027062662,0.00073437847,0.0002132324],"domain_scores_gemma":[0.995152,0.0025400943,0.0003056331,0.001558175,0.00031520924,0.00012890116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016862738,0.000572087,0.00045336134,0.0010004954,0.0007630883,0.0012829724,0.0011900839,0.000983395,0.008074233],"category_scores_gemma":[0.0059816027,0.00048372964,0.00080652966,0.00088391,0.0015475515,0.0054017254,0.0022712843,0.0021593526,0.0015232561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007208238,0.00021872902,0.0013058553,0.00035393087,0.000069362715,0.00034895612,0.000473363,0.052614495,0.0375431,0.77478516,0.006598714,0.12496755],"study_design_scores_gemma":[0.00013474919,0.0003725974,0.0007172259,0.00005821909,0.000053308802,0.00063571637,0.00015698661,0.21005283,0.068361014,0.69342124,0.02597029,0.000065851316],"about_ca_topic_score_codex":0.00025709934,"about_ca_topic_score_gemma":0.00039121782,"teacher_disagreement_score":0.008074233,"about_ca_system_score_codex":0.0011001319,"about_ca_system_score_gemma":0.00065731845,"threshold_uncertainty_score":0.027010977},"labels":[],"label_agreement":null},{"id":"W2949606720","doi":"10.48550/arxiv.1205.5282","title":"Spectral Norm of Symmetric Functions","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Logarithm; Boolean function; Mathematics; Combinatorics; Norm (philosophy); Communication complexity; Discrete mathematics; Fourier transform; Parity (physics); Function (biology); Upper and lower bounds; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.062424345662946086,"score_gpt":0.17253730175960888,"score_spread":0.1101129560966628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949606720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.29990965,0.0020976686,0.60853165,0.0035492522,0.00055179076,0.000090925336,0.0012311217,0.000369339,0.08366859],"genre_scores_gemma":[0.935567,0.0014841266,0.048963908,0.0006604382,0.0009794512,0.00025712844,0.00070384995,0.0002190883,0.011165034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976248,0.0007276264,0.00012293506,0.00038229677,0.0007934123,0.00034895982],"domain_scores_gemma":[0.99273527,0.004168821,0.00069702475,0.00069883483,0.0010897215,0.00061028346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006861,0.00072949496,0.00071106263,0.002184225,0.0009056178,0.0027943887,0.0010891053,0.0010679526,0.005859952],"category_scores_gemma":[0.012405789,0.00026285637,0.00059154286,0.0012586561,0.0036214879,0.0051650205,0.0020637745,0.0022516074,0.0014558807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009394949,0.000031682157,0.00039581594,0.000059684673,0.000009025798,0.00006212206,0.00013453049,0.005942062,0.0032519412,0.97353685,0.001889758,0.014592651],"study_design_scores_gemma":[0.000010478137,0.00004244285,0.0003862509,0.000026357562,0.000004898692,0.00015027635,0.00007021702,0.047952276,0.0021062104,0.9457155,0.0035118007,0.000023311122],"about_ca_topic_score_codex":0.00041401802,"about_ca_topic_score_gemma":0.00024220535,"teacher_disagreement_score":0.005859952,"about_ca_system_score_codex":0.0011781596,"about_ca_system_score_gemma":0.0007222762,"threshold_uncertainty_score":0.019603431},"labels":[],"label_agreement":null},{"id":"W2949970207","doi":"","title":"Some New Results on Binary Polynomial Multiplication.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Finite field; Binary number; Mathematics; Multiplication algorithm; Polynomial; Logarithm; Field (mathematics); Binary operation; Arithmetic; Time complexity; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.03608209612606198,"score_gpt":0.2823102171917265,"score_spread":0.24622812106566452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949970207","genre_codex":"methods","genre_gemma":"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.010801263,0.011638162,0.8675684,0.0021791202,0.0027061575,0.00012337723,0.00046380292,0.0007029692,0.10381665],"genre_scores_gemma":[0.22381279,0.024789372,0.67966914,0.0036732557,0.005016347,0.00034378972,0.0015696527,0.0011892855,0.05993631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750924,0.0003972868,0.00018426203,0.0005011729,0.0011219601,0.00028597747],"domain_scores_gemma":[0.997846,0.0010708515,0.00016244265,0.00043513675,0.00036145904,0.00012405039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016334599,0.001457628,0.00079964264,0.00272445,0.0011635056,0.0023292566,0.0012661435,0.0010093868,0.015256642],"category_scores_gemma":[0.0055720033,0.000679195,0.0015896033,0.0031787283,0.0025065027,0.008671573,0.0026659616,0.004764233,0.006944901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017524324,0.00009918179,0.00033027946,0.0006903545,0.000047051115,0.0002913236,0.00041149792,0.006023424,0.0087473,0.7996646,0.014351374,0.16916846],"study_design_scores_gemma":[0.000046834153,0.00016889739,0.0005369521,0.00018097558,0.00006432656,0.0016979785,0.00011707629,0.02369966,0.014974015,0.7652153,0.19319102,0.000106952124],"about_ca_topic_score_codex":0.00085277786,"about_ca_topic_score_gemma":0.0008756395,"teacher_disagreement_score":0.015256642,"about_ca_system_score_codex":0.0016616216,"about_ca_system_score_gemma":0.0011175419,"threshold_uncertainty_score":0.051038563},"labels":[],"label_agreement":null},{"id":"W2949987681","doi":"","title":"Generalized mix functions and orthogonal equitable rectangles.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization; Block cipher; Simple (philosophy); Mathematics; Computer science; Context (archaeology); Cryptography; Symmetric-key algorithm; Block (permutation group theory); Construct (python library); Discrete mathematics; Combinatorics; Encryption; Algorithm; Public-key cryptography","score_opus":0.0233944121876038,"score_gpt":0.2677684308100168,"score_spread":0.24437401862241298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949987681","genre_codex":"methods","genre_gemma":"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.08336014,0.0011680644,0.87383443,0.00039639894,0.0001554771,0.00019873482,0.0002580219,0.00047750722,0.040151216],"genre_scores_gemma":[0.6471014,0.0010699653,0.3294975,0.00039035865,0.0001323437,0.0006139359,0.00030338892,0.0002669942,0.020624086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982065,0.00071331207,0.00010685491,0.00031643556,0.00039927813,0.00025767842],"domain_scores_gemma":[0.9981592,0.0007771517,0.0003049218,0.00050231384,0.00016557706,0.00009075748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013095058,0.00088883383,0.00054915063,0.00092938764,0.00070985575,0.0016896421,0.0007610702,0.0009748149,0.0056480994],"category_scores_gemma":[0.0044438816,0.0005267813,0.0007254011,0.0012387689,0.0017918411,0.0035507525,0.0022318051,0.0013624609,0.0014757111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002089822,0.00003504257,0.0004052122,0.00012347776,0.000026123758,0.00019741592,0.00019581761,0.011962263,0.012720326,0.91540825,0.0016300987,0.057087056],"study_design_scores_gemma":[0.000113349815,0.00046543364,0.0009310414,0.00011746187,0.00008584601,0.0016980573,0.00035129592,0.12965763,0.06486273,0.7244565,0.07713053,0.00013015204],"about_ca_topic_score_codex":0.00028065642,"about_ca_topic_score_gemma":0.0002859053,"teacher_disagreement_score":0.0056480994,"about_ca_system_score_codex":0.00080840825,"about_ca_system_score_gemma":0.00041060895,"threshold_uncertainty_score":0.018894792},"labels":[],"label_agreement":null},{"id":"W2950091396","doi":"10.48550/arxiv.quant-ph/0309120","title":"Constructions of Mutually Unbiased Bases","year":2003,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutually unbiased bases; Orthonormal basis; Mathematics; Pairwise comparison; Combinatorics; Set (abstract data type); Exponential function; Prime (order theory); Product (mathematics); Space (punctuation); Discrete mathematics; Computer science; Pure mathematics; Statistics; Physics; Hilbert space; Mathematical analysis","score_opus":0.06883026968149751,"score_gpt":0.16990992274561864,"score_spread":0.10107965306412113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950091396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.15965213,0.00067328126,0.8127049,0.00045313686,0.00014213633,0.00010179806,0.00035328692,0.0003964312,0.025522806],"genre_scores_gemma":[0.711443,0.00052089524,0.2800971,0.0003395786,0.0001428777,0.00037224026,0.0005860516,0.0001618206,0.006336379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965867,0.0012181966,0.00020967716,0.00044719654,0.0010066975,0.0005315341],"domain_scores_gemma":[0.99428225,0.0022472702,0.00068270374,0.0013985893,0.0010013389,0.0003878675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021676042,0.0005892504,0.0008607121,0.0018300114,0.0015887794,0.0019557478,0.00093224866,0.0009723828,0.0030569604],"category_scores_gemma":[0.010257447,0.00088722777,0.00050730305,0.0013430222,0.0014295528,0.0020890336,0.005216492,0.0018264019,0.0009344287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015392559,0.000038883612,0.0014140418,0.00007185563,0.000030953863,0.00018357974,0.0003384999,0.006183236,0.012235098,0.94139344,0.0016907927,0.03626583],"study_design_scores_gemma":[0.00005276455,0.00015582758,0.001106537,0.000115856674,0.000059606464,0.0009969831,0.00030926007,0.077210024,0.037390348,0.86369765,0.018815488,0.00008967835],"about_ca_topic_score_codex":0.00012072479,"about_ca_topic_score_gemma":0.0001574843,"teacher_disagreement_score":0.0030569604,"about_ca_system_score_codex":0.00048013314,"about_ca_system_score_gemma":0.00053690956,"threshold_uncertainty_score":0.011463463},"labels":[],"label_agreement":null},{"id":"W2950506350","doi":"10.48550/arxiv.1808.02468","title":"Theory of supports for linear codes endowed with the sum-rank metric","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Combinatorics; Discrete mathematics; Block code; Linear code; Hamming code; Coding theory; Metric (unit); Hamming distance; Algorithm; Decoding methods","score_opus":0.050092583081987746,"score_gpt":0.1899559556125362,"score_spread":0.13986337253054845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950506350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2883325,0.0023417359,0.6433499,0.001533206,0.00026596567,0.00006892564,0.0011852095,0.00030134092,0.06262125],"genre_scores_gemma":[0.8927018,0.0021690417,0.08354087,0.00035261404,0.0008318863,0.00020303392,0.0009411124,0.00020606925,0.019053575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801815,0.00051229703,0.00013130953,0.0002588943,0.0008606444,0.00021869449],"domain_scores_gemma":[0.9949916,0.0022936342,0.0006769071,0.00049141987,0.0010427047,0.00050365797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013817028,0.00075333414,0.00067971885,0.0027860778,0.0009457718,0.0032674617,0.0009985884,0.0009074092,0.004902076],"category_scores_gemma":[0.007260186,0.00035468495,0.0007745189,0.0017520013,0.0026018224,0.00473505,0.0027426681,0.002328983,0.0013948539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026323176,0.000007858779,0.00017790668,0.00003681452,0.0000059787694,0.00004497242,0.00009816502,0.0018046979,0.00083934056,0.9922448,0.00043581845,0.0042775287],"study_design_scores_gemma":[0.000012121511,0.000057157613,0.0002730941,0.000026521757,0.000008420286,0.00018177109,0.000104509556,0.026947761,0.0013962477,0.9663215,0.00464724,0.000023664648],"about_ca_topic_score_codex":0.00052987883,"about_ca_topic_score_gemma":0.00030338703,"teacher_disagreement_score":0.004902076,"about_ca_system_score_codex":0.0010312712,"about_ca_system_score_gemma":0.0006106936,"threshold_uncertainty_score":0.016399026},"labels":[],"label_agreement":null},{"id":"W2950683093","doi":"","title":"On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Herding; Computer science; Theoretical computer science; Computational complexity theory; Iterated function; Mathematics; Algorithm; Computer security","score_opus":0.04691549099858613,"score_gpt":0.26865511557032656,"score_spread":0.22173962457174043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950683093","genre_codex":"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.3226894,0.0062946077,0.58688706,0.014883741,0.0005758636,0.0011605007,0.0022637343,0.0011959102,0.06404923],"genre_scores_gemma":[0.898034,0.0029365234,0.088161804,0.0010911471,0.00079726474,0.00070848037,0.0013041672,0.00038333156,0.0065834248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99058026,0.0027678804,0.00035295993,0.001264607,0.0030421868,0.0019922],"domain_scores_gemma":[0.9342614,0.052153688,0.003998761,0.0063955807,0.0020310706,0.0011595536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050690495,0.0017974875,0.0022150318,0.0028536292,0.0030975123,0.004562052,0.0032433665,0.0035971848,0.0066402797],"category_scores_gemma":[0.03395493,0.0009461116,0.0028421693,0.0026164725,0.004628402,0.016801724,0.004837045,0.007493674,0.0011034034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020043831,0.000623396,0.008884486,0.000993193,0.00048619078,0.000695497,0.00085476396,0.3612036,0.012085303,0.51990396,0.020356687,0.07190853],"study_design_scores_gemma":[0.00009721404,0.00018344927,0.0017968648,0.000061900995,0.00011694065,0.00044093945,0.00016302863,0.6814854,0.0030883288,0.30931985,0.003167749,0.00007829102],"about_ca_topic_score_codex":0.0027438577,"about_ca_topic_score_gemma":0.0021062202,"teacher_disagreement_score":0.008198247,"about_ca_system_score_codex":0.008198247,"about_ca_system_score_gemma":0.0038599279,"threshold_uncertainty_score":0.059482694},"labels":[],"label_agreement":null},{"id":"W2950758769","doi":"","title":"Resilience to Distinguishing Attacks on WG-7 Cipher and Their Generalizations.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Stream cipher attack; Computer science; Cipher; Correlation attack; Transposition cipher; Resilience (materials science); Cryptography; Computer security; Block cipher mode of operation; Arithmetic; Theoretical computer science; Running key cipher; Mathematics; Encryption","score_opus":0.022609844201641523,"score_gpt":0.2711592093576486,"score_spread":0.24854936515600706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950758769","genre_codex":"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.57316357,0.0021010756,0.38990992,0.0016605601,0.00027481976,0.0002695333,0.00054360944,0.0012813105,0.030795585],"genre_scores_gemma":[0.9867034,0.0005532455,0.01022182,0.00010018019,0.0000978387,0.000056601108,0.00017873652,0.000038669124,0.0020495087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774384,0.00047398562,0.00014541193,0.0004091104,0.0007420419,0.0004855554],"domain_scores_gemma":[0.9908676,0.0037337234,0.0017900426,0.0028571715,0.0004552972,0.00029611302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017031408,0.00064058095,0.00077682396,0.0010896334,0.0007262612,0.0011807267,0.00078451046,0.0010721459,0.0015853053],"category_scores_gemma":[0.009337916,0.0002834128,0.00091429387,0.0007611615,0.0019176414,0.0034129508,0.0027575293,0.0025856148,0.000561944],"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.0014337458,0.00015165232,0.0043153404,0.00039045216,0.00018712068,0.0014032164,0.00089155545,0.1320953,0.06755764,0.7220836,0.0050908183,0.06439957],"study_design_scores_gemma":[0.00012767299,0.0007869287,0.0030177669,0.00013075015,0.0001684549,0.0030951423,0.00024213058,0.43085656,0.061103404,0.48554087,0.014800915,0.00012941605],"about_ca_topic_score_codex":0.00019337554,"about_ca_topic_score_gemma":0.00012063987,"teacher_disagreement_score":0.0017031408,"about_ca_system_score_codex":0.00073848444,"about_ca_system_score_gemma":0.0006261581,"threshold_uncertainty_score":0.0090072155},"labels":[],"label_agreement":null},{"id":"W2950808142","doi":"","title":"A General Construction for 1-round δ-RMT and (0, δ)-SMT.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Communication source; Message authentication code; Reliability (semiconductor); Disjoint sets; Node (physics); Computer network; Transmission (telecommunications); Adversary; Theoretical computer science; Authentication (law); Protocol (science); Relation (database); Power (physics); Cryptography; Algorithm; Computer security; Mathematics; Discrete mathematics; Telecommunications","score_opus":0.021138895533528768,"score_gpt":0.2656808496929594,"score_spread":0.24454195415943064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950808142","genre_codex":"methods","genre_gemma":"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.04866969,0.00028375947,0.92275876,0.0006067915,0.00018425583,0.00050009676,0.0005008077,0.0013600622,0.025135772],"genre_scores_gemma":[0.49845216,0.00029333535,0.48270878,0.00046458226,0.00009342358,0.0010517428,0.0007564403,0.00026566457,0.015913757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977101,0.0006228259,0.00019122874,0.00045475658,0.00067303976,0.00034796924],"domain_scores_gemma":[0.99579406,0.0012483939,0.0006122543,0.0015014609,0.00050727226,0.00033650186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021114985,0.0008750265,0.00059257186,0.00095820957,0.0015366422,0.0014376568,0.0017234981,0.0017233891,0.004889288],"category_scores_gemma":[0.0056126015,0.00081805873,0.0013395407,0.001286357,0.002395305,0.0030652857,0.005048043,0.002362073,0.0017293898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026901887,0.000073777555,0.0009858519,0.0002762473,0.00004458635,0.00062072504,0.0005796436,0.0283505,0.019052304,0.9025772,0.004958633,0.04221137],"study_design_scores_gemma":[0.0001524039,0.0006078479,0.0010937277,0.00016605295,0.00016076455,0.0024086474,0.00025764815,0.1967459,0.048635904,0.682888,0.06665656,0.0002265203],"about_ca_topic_score_codex":0.0005491224,"about_ca_topic_score_gemma":0.0006245789,"teacher_disagreement_score":0.004889288,"about_ca_system_score_codex":0.0014253597,"about_ca_system_score_gemma":0.0016555571,"threshold_uncertainty_score":0.01635629},"labels":[],"label_agreement":null},{"id":"W2950970010","doi":"10.48550/arxiv.cs/0611162","title":"Quaternary Constant-Amplitude Codes for Multicode CDMA","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constant (computer programming); Amplitude; Mathematics; Binary number; Linear code; Integer (computer science); Code (set theory); Binary code; Discrete mathematics; Physics; Algorithm; Block code; Computer science; Arithmetic; Optics","score_opus":0.0681218899085884,"score_gpt":0.20243852884784844,"score_spread":0.13431663893926005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950970010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.16304836,0.010471045,0.7571942,0.0011719798,0.0006015157,0.00009014105,0.00014903503,0.00025215937,0.067021556],"genre_scores_gemma":[0.79783654,0.0054129693,0.17975004,0.00031366874,0.00045664763,0.000103210485,0.00015647775,0.00006312585,0.015907336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978274,0.000049960032,0.000011121648,0.000031983567,0.000099364865,0.000024880457],"domain_scores_gemma":[0.9996408,0.00014267582,0.000059409806,0.000056938577,0.00007977388,0.00002034297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022753465,0.00028831986,0.00018104208,0.0005870325,0.0004674042,0.000863949,0.00023851964,0.0005361576,0.0019577362],"category_scores_gemma":[0.0011988168,0.00011613255,0.00021080686,0.0008206985,0.0007144922,0.00064831175,0.0005734456,0.0007050006,0.00043557055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055458695,0.000018910358,0.00034275252,0.00010966474,0.0000057073657,0.00014540929,0.00020705277,0.01858208,0.017543117,0.8987452,0.0015050407,0.06273966],"study_design_scores_gemma":[0.0000232063,0.00021193583,0.0008582018,0.0001392734,0.000025525276,0.0012950023,0.00013829109,0.20791128,0.022927808,0.6756696,0.090735056,0.000064792366],"about_ca_topic_score_codex":0.00042359292,"about_ca_topic_score_gemma":0.000404863,"teacher_disagreement_score":0.0019577362,"about_ca_system_score_codex":0.0005881021,"about_ca_system_score_gemma":0.0003959738,"threshold_uncertainty_score":0.0065492988},"labels":[],"label_agreement":null},{"id":"W2951330406","doi":"10.48550/arxiv.1408.5169","title":"Constructions of complex equiangular lines from mutually unbiased bases","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Equiangular polygon; Combinatorics; Conjecture; Mutually unbiased bases; Mathematics; Hermitian matrix; Set (abstract data type); Discrete mathematics; Geometry; Computer science; Pure mathematics; Hilbert space","score_opus":0.09353905603015882,"score_gpt":0.18995181469569855,"score_spread":0.09641275866553974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951330406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.29336032,0.00077038794,0.62370116,0.0006239226,0.0002745198,0.00016355584,0.0005305535,0.0011808763,0.07939477],"genre_scores_gemma":[0.6540323,0.00052356336,0.32850024,0.00043956403,0.00009514142,0.0004402443,0.0007012643,0.00036548876,0.014902259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991146,0.00024361012,0.000060991864,0.0001548424,0.00027997722,0.00014601192],"domain_scores_gemma":[0.9989538,0.00028312716,0.00013398044,0.00030674218,0.00023289582,0.00008943186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005273562,0.0005589936,0.00040814737,0.0011830351,0.0010060223,0.0015647613,0.00085119647,0.0006665762,0.007816192],"category_scores_gemma":[0.0021508047,0.0005532512,0.00041625078,0.0011501493,0.0008774741,0.0017088791,0.0017681977,0.0012527364,0.0017152391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016338064,0.00006991752,0.0011401821,0.00012929083,0.00003247395,0.0003272022,0.0005134381,0.007559816,0.041250873,0.8635163,0.0050048404,0.08029224],"study_design_scores_gemma":[0.00017706832,0.0004003866,0.0015590462,0.0001830773,0.00006502328,0.0015684786,0.0008613295,0.090158075,0.22186601,0.5814838,0.10144907,0.00022867144],"about_ca_topic_score_codex":0.000188919,"about_ca_topic_score_gemma":0.00042305037,"teacher_disagreement_score":0.007816192,"about_ca_system_score_codex":0.0005253116,"about_ca_system_score_gemma":0.00031419614,"threshold_uncertainty_score":0.026147783},"labels":[],"label_agreement":null},{"id":"W2951468398","doi":"10.48550/arxiv.1708.01593","title":"On invariant fields of vectors and covectors","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; Queen's University; National Natural Science Foundation of China","keywords":"Combinatorics; Invariant (physics); Physics; Order (exchange); Finite field; Field (mathematics); Mathematics; Mathematical physics; Pure mathematics","score_opus":0.059501435884615345,"score_gpt":0.18209707624477522,"score_spread":0.12259564036015988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951468398","genre_codex":"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.4205927,0.0019267879,0.06735331,0.0022402208,0.00064855494,0.000094285424,0.0006066021,0.00040974122,0.5061278],"genre_scores_gemma":[0.9070762,0.0011358347,0.017926285,0.000573753,0.00089641975,0.00013073896,0.00090483617,0.00028217162,0.07107374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988668,0.00024223399,0.000036458892,0.00016462935,0.00024971462,0.00044026188],"domain_scores_gemma":[0.9994585,0.0001263289,0.000098203,0.000076518954,0.00009527062,0.00014519999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078659336,0.001076873,0.000825394,0.0026422988,0.0028519386,0.0031578976,0.0009983925,0.00083880906,0.009861764],"category_scores_gemma":[0.0013192766,0.00043650164,0.00091667305,0.0015550405,0.00414649,0.0034025882,0.002251392,0.0019282299,0.0017932643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012739394,0.000011101678,0.00005824829,0.000007969746,0.000001746495,0.000024523644,0.000084940024,0.00023243722,0.00028531704,0.9968585,0.0007266376,0.0016959824],"study_design_scores_gemma":[0.0000141253895,0.000022352011,0.00020045035,0.0000130224535,0.000002896276,0.00004546752,0.00009275454,0.0018804967,0.00031267692,0.9918311,0.0055765067,0.000008058958],"about_ca_topic_score_codex":0.0026641847,"about_ca_topic_score_gemma":0.0022838796,"teacher_disagreement_score":0.009861764,"about_ca_system_score_codex":0.002424836,"about_ca_system_score_gemma":0.0010239946,"threshold_uncertainty_score":0.032990873},"labels":[],"label_agreement":null},{"id":"W2951648961","doi":"10.1016/j.jsc.2011.12.008","title":"Fast arithmetics in Artin–Schreier towers over finite fields","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Finite field; Tower; Algebraic number field; Arithmetic; Elliptic curve; Torsion (gastropod); Discrete mathematics; Pure mathematics","score_opus":0.023157195573169496,"score_gpt":0.2446057168958486,"score_spread":0.2214485213226791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951648961","genre_codex":"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.7399633,0.0020042486,0.14813119,0.002405797,0.00065254606,0.00011960768,0.0005450852,0.0012462556,0.1049319],"genre_scores_gemma":[0.9607129,0.00062845665,0.019758863,0.00023921981,0.00042489654,0.00007186902,0.00028482464,0.00019874277,0.017680336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983565,0.00037654405,0.0000855493,0.0002197617,0.0005647541,0.0003968183],"domain_scores_gemma":[0.9964606,0.0020567616,0.0003525311,0.00045739624,0.000297741,0.00037491255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020676926,0.0014634953,0.0017239765,0.0047832145,0.0032566818,0.0047281403,0.0018435823,0.0015846797,0.016007502],"category_scores_gemma":[0.006994817,0.0010186232,0.0015199814,0.0028440915,0.0037951714,0.010584611,0.003843088,0.0033614056,0.0018825603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001663101,0.0000335409,0.00044492332,0.00006411141,0.000017718945,0.00017343854,0.00035465142,0.0029958438,0.0010083265,0.9858042,0.0014297647,0.007507176],"study_design_scores_gemma":[0.00005132197,0.000032144693,0.00027535894,0.000030587733,0.000019218285,0.0001340314,0.00008352207,0.010462088,0.00079061306,0.9864178,0.0016742756,0.000029070929],"about_ca_topic_score_codex":0.0013701472,"about_ca_topic_score_gemma":0.0024145492,"teacher_disagreement_score":0.016007502,"about_ca_system_score_codex":0.0027073736,"about_ca_system_score_gemma":0.00096975884,"threshold_uncertainty_score":0.05355048},"labels":[],"label_agreement":null},{"id":"W2951688843","doi":"10.48550/arxiv.0909.3321","title":"Asymptotic enumeration of correlation-immune boolean functions","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Mathematical Sciences","keywords":"Boolean function; Mathematics; Parity function; Combinatorics; Function (biology); Discrete mathematics; Order (exchange); Maximum satisfiability problem; Enumeration; Boolean expression","score_opus":0.023533060566468787,"score_gpt":0.23567684776227488,"score_spread":0.2121437871958061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951688843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.44224235,0.0016840629,0.4832527,0.0024088097,0.00013448337,0.00010538801,0.0007652098,0.00084770255,0.06855915],"genre_scores_gemma":[0.9424793,0.0009049633,0.045616213,0.0005832972,0.00031462926,0.0002748968,0.0008369527,0.00020312732,0.008786653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970964,0.00084240275,0.00013930876,0.0004991104,0.0009332475,0.0004896309],"domain_scores_gemma":[0.98141205,0.012853897,0.001222681,0.0022892237,0.0015277998,0.00069431466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022083058,0.0006700276,0.0009776121,0.0016994601,0.0010329974,0.0026620391,0.0016731818,0.0013539431,0.0041982154],"category_scores_gemma":[0.033371214,0.00052221614,0.0008201012,0.0014048029,0.0030036375,0.0041659474,0.0026021432,0.0025480508,0.0009802856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038010368,0.00011558264,0.006044759,0.00020354002,0.000046345645,0.000264052,0.00029079264,0.051081978,0.010460625,0.8880626,0.0051851873,0.037864543],"study_design_scores_gemma":[0.00004181851,0.00008533368,0.0026729337,0.000088156565,0.000043543423,0.00071719015,0.00006583508,0.34497285,0.0064952476,0.6401948,0.0045654364,0.000056905457],"about_ca_topic_score_codex":0.00077346776,"about_ca_topic_score_gemma":0.00076955615,"teacher_disagreement_score":0.0041982154,"about_ca_system_score_codex":0.002387089,"about_ca_system_score_gemma":0.0013586896,"threshold_uncertainty_score":0.01731962},"labels":[],"label_agreement":null},{"id":"W2951766187","doi":"10.48550/arxiv.1205.0626","title":"Advances in the merit factor problem for binary sequences","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Skew; Binary number; Mathematics; Conjecture; Figure of merit; Binary Golay code; Aperiodic graph; Complementary sequences; Pseudorandom binary sequence; Combinatorics; Autocorrelation; Discrete mathematics; Algorithm; Statistics; Computer science","score_opus":0.08007383609668346,"score_gpt":0.20832597944222828,"score_spread":0.1282521433455448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951766187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.19737485,0.0048920466,0.76515913,0.0026947472,0.0002465647,0.000043228923,0.00022815689,0.00028935986,0.029071959],"genre_scores_gemma":[0.82481915,0.0030862088,0.16635941,0.00020650674,0.00072945864,0.000063127605,0.00024725098,0.00011881052,0.0043699574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988165,0.00040892494,0.00005819641,0.00021732925,0.00039949335,0.0000996375],"domain_scores_gemma":[0.98648435,0.01035347,0.00091390446,0.0011089948,0.0008343452,0.00030496545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028011228,0.0007071741,0.0009994122,0.0029051641,0.0009500404,0.002348023,0.0011312546,0.0014419511,0.002094802],"category_scores_gemma":[0.023078656,0.0004577477,0.0007218269,0.0018474128,0.0029225047,0.00490663,0.0016890793,0.0025199663,0.00051442604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012823546,0.000037220478,0.002066572,0.00014626706,0.000013927322,0.00010543905,0.00017526739,0.04178043,0.0028973655,0.9063025,0.0014421372,0.044904582],"study_design_scores_gemma":[0.000011304839,0.000040692397,0.0005596777,0.000037656107,0.0000072622925,0.00018139048,0.000055915563,0.24387574,0.0016219293,0.75079703,0.0027885195,0.000022866368],"about_ca_topic_score_codex":0.00061485684,"about_ca_topic_score_gemma":0.00036857452,"teacher_disagreement_score":0.0029051641,"about_ca_system_score_codex":0.0014834101,"about_ca_system_score_gemma":0.00065236253,"threshold_uncertainty_score":0.0148139},"labels":[],"label_agreement":null},{"id":"W2952097853","doi":"10.48550/arxiv.1407.5884","title":"A probabilistic approach to value sets of polynomials over finite fields","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Infinity; Distribution (mathematics); Finite field; Order (exchange); Expected value; Polynomial; Value (mathematics); Combinatorics; Discrete mathematics; Degree (music); Random variable; Probabilistic logic; Set (abstract data type); Finite set; Field (mathematics); Random field; Pure mathematics; Statistics; Mathematical analysis; Physics; Computer science","score_opus":0.056120039602601576,"score_gpt":0.191049739230665,"score_spread":0.13492969962806345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952097853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.08012598,0.0022083588,0.9038678,0.004099315,0.00014616083,0.00014026651,0.00040702894,0.00021722126,0.008787882],"genre_scores_gemma":[0.86572295,0.0033497955,0.11879254,0.00076516904,0.0014139763,0.00062860054,0.0005156178,0.00029130158,0.008520043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99043524,0.00460641,0.00028865322,0.001507714,0.0024375159,0.0007244305],"domain_scores_gemma":[0.8935214,0.093324214,0.00433153,0.004995955,0.002156578,0.0016701454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014437217,0.0013995357,0.002197113,0.0050585605,0.0024200077,0.005265478,0.0062589995,0.0031681904,0.006066851],"category_scores_gemma":[0.06081817,0.0018253808,0.0024634078,0.0035047557,0.011072368,0.017385779,0.0045772023,0.0066986643,0.00049509853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004050557,0.000026872258,0.0007991865,0.00008162818,0.000034708522,0.00008720431,0.00019101016,0.025591211,0.00070703804,0.9688062,0.00048177261,0.00315258],"study_design_scores_gemma":[0.000026605601,0.000057972593,0.0005203267,0.00005254202,0.00002095002,0.0002150866,0.0001008205,0.25037092,0.0008900935,0.7460375,0.0016611257,0.000046063964],"about_ca_topic_score_codex":0.0014000529,"about_ca_topic_score_gemma":0.0008031471,"teacher_disagreement_score":0.014437217,"about_ca_system_score_codex":0.00549286,"about_ca_system_score_gemma":0.0016391621,"threshold_uncertainty_score":0.07635218},"labels":[],"label_agreement":null},{"id":"W2952358871","doi":"10.48550/arxiv.1212.0048","title":"Strictly chained (p,q)-ary partitions","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.085180390743753,"score_gpt":0.17646769825399794,"score_spread":0.09128730751024494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952358871","genre_codex":"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.81222904,0.00044587677,0.13751285,0.00079770683,0.00016435914,0.00013339959,0.0006128719,0.00020920175,0.04789468],"genre_scores_gemma":[0.9664747,0.00027841728,0.020585066,0.00017994957,0.00009580247,0.0001215734,0.00047752922,0.000072576935,0.011714245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890554,0.00022041351,0.00007669435,0.0002030827,0.00024298472,0.00035128737],"domain_scores_gemma":[0.99660057,0.0017508981,0.00045947568,0.000605664,0.0002634667,0.00031985907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012745745,0.0005546234,0.00061267515,0.0010885784,0.001595739,0.0028832888,0.0010628494,0.0012536497,0.008530938],"category_scores_gemma":[0.00695075,0.00041682695,0.0005450986,0.001257543,0.002734867,0.0040360224,0.0023690173,0.0017588607,0.0010599016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028666062,0.00004067019,0.0009694525,0.00007349223,0.000010460001,0.00037643855,0.00037342604,0.008907279,0.0069466718,0.9742309,0.0010458017,0.0067389323],"study_design_scores_gemma":[0.00007563743,0.00010966615,0.00074947043,0.000069078895,0.000021351043,0.0004816764,0.00029637635,0.042545035,0.009367764,0.9419069,0.0043304516,0.000046534657],"about_ca_topic_score_codex":0.0005735844,"about_ca_topic_score_gemma":0.0006999269,"teacher_disagreement_score":0.008530938,"about_ca_system_score_codex":0.0012901826,"about_ca_system_score_gemma":0.0007337235,"threshold_uncertainty_score":0.028538823},"labels":[],"label_agreement":null},{"id":"W2952398546","doi":"10.48550/arxiv.0802.0855","title":"A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutually unbiased bases; Orthonormal basis; Homogeneous; Set (abstract data type); Mathematics; Computer science; Combinatorics; Physics","score_opus":0.06864132746274425,"score_gpt":0.29352718407274825,"score_spread":0.224885856610004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952398546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.012777682,0.0008582981,0.969411,0.00042977673,0.00014566549,0.00006098467,0.00011031412,0.00016942609,0.016036773],"genre_scores_gemma":[0.49349084,0.0018034409,0.4868225,0.0008082191,0.0010504309,0.00066899037,0.0005007707,0.00057167996,0.014283156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929248,0.002868991,0.0004597691,0.00090595876,0.0020122346,0.0008282413],"domain_scores_gemma":[0.9847777,0.008296134,0.001186395,0.0018824039,0.0031629687,0.00069440523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075099305,0.0014082775,0.0012614285,0.0041877227,0.0026676978,0.0033084187,0.0014255077,0.0019611341,0.0070709665],"category_scores_gemma":[0.026343904,0.0008799223,0.0010741317,0.002769352,0.0045982595,0.0046063396,0.006073603,0.0046104714,0.0021608872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050435585,0.000017304526,0.0003189038,0.00007930615,0.000017841186,0.00006766879,0.00017164747,0.0074277124,0.003928235,0.96538836,0.00131153,0.021221131],"study_design_scores_gemma":[0.000014938287,0.00014440397,0.0004911366,0.00012241144,0.00002574813,0.00021601905,0.0001488931,0.06099588,0.013083127,0.9126096,0.012060198,0.00008764551],"about_ca_topic_score_codex":0.00079608714,"about_ca_topic_score_gemma":0.0007046453,"teacher_disagreement_score":0.0075099305,"about_ca_system_score_codex":0.0017916475,"about_ca_system_score_gemma":0.0013067705,"threshold_uncertainty_score":0.03971678},"labels":[],"label_agreement":null},{"id":"W2952438738","doi":"10.48550/arxiv.1501.05296","title":"Output-sensitive algorithms for sumset and sparse polynomial multiplication","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Integer (computer science); Multiplication (music); Univariate; Polynomial; Interpolation (computer graphics); Algorithm; Set (abstract data type); Discrete mathematics; Computer science; Combinatorics; Multivariate statistics","score_opus":0.11802119843768791,"score_gpt":0.21397372353932664,"score_spread":0.09595252510163874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952438738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.012951904,0.00015486762,0.9790061,0.00039029407,0.00011339698,0.0001325252,0.00033738665,0.0022199806,0.0046935044],"genre_scores_gemma":[0.29337928,0.00024708698,0.69243264,0.0004376097,0.00031945194,0.0006041045,0.0016585392,0.000987001,0.009934272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959037,0.0010108803,0.00031472975,0.0006839279,0.001590231,0.00049657957],"domain_scores_gemma":[0.9935829,0.0027545865,0.00057275296,0.002056417,0.00081408105,0.00021923654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00217882,0.0013765516,0.001245813,0.0013782734,0.0011354056,0.002913573,0.0020802459,0.0011739453,0.011648354],"category_scores_gemma":[0.013854831,0.000615295,0.0013694956,0.0022320068,0.001481424,0.0053237276,0.004342557,0.0030967423,0.0039609964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015417465,0.0004027392,0.0017584546,0.00039884457,0.00011468246,0.00019787093,0.00030323546,0.09878963,0.015966957,0.4458547,0.019076614,0.41559464],"study_design_scores_gemma":[0.00017000722,0.00017377513,0.00025533332,0.000051674826,0.000039121842,0.00017600557,0.00006639914,0.52087677,0.020815484,0.44709986,0.010217704,0.000057923415],"about_ca_topic_score_codex":0.0007518708,"about_ca_topic_score_gemma":0.001415068,"teacher_disagreement_score":0.011648354,"about_ca_system_score_codex":0.0016674855,"about_ca_system_score_gemma":0.002144315,"threshold_uncertainty_score":0.03896761},"labels":[],"label_agreement":null},{"id":"W2952684653","doi":"10.48550/arxiv.0707.1102","title":"Nonexistence of permutation binomials of certain shapes","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Permutation (music); Prime (order theory); Mathematics; Discrete mathematics; Physics","score_opus":0.06256228778151406,"score_gpt":0.29486276568508935,"score_spread":0.23230047790357528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952684653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8542286,0.00037623817,0.05988827,0.0020227213,0.00032871612,0.0000796069,0.00043531947,0.00045083094,0.082189694],"genre_scores_gemma":[0.97780025,0.00023834925,0.010688631,0.00027638872,0.00023742885,0.00009089395,0.00035171187,0.0001311852,0.010185151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981772,0.0003385741,0.00009643344,0.00042433868,0.00052587216,0.00043776943],"domain_scores_gemma":[0.99290246,0.004186736,0.0007882512,0.0008347798,0.0006012882,0.000686419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001561023,0.0005169205,0.0010544409,0.001174061,0.0026071018,0.0032721644,0.0011217068,0.0013442008,0.0067666704],"category_scores_gemma":[0.018265842,0.0012465537,0.000881922,0.00084114703,0.0039043818,0.003793726,0.0031855982,0.0026721316,0.0012200368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003371957,0.000048367176,0.0034723536,0.000094692456,0.000029855726,0.001246829,0.00046120078,0.0020063857,0.006681807,0.9746894,0.0030617137,0.007870123],"study_design_scores_gemma":[0.00020216647,0.00010918707,0.0019816598,0.00006535807,0.000040935585,0.0037870964,0.00037413303,0.02402999,0.008529484,0.95094186,0.00986685,0.00007132923],"about_ca_topic_score_codex":0.00038265125,"about_ca_topic_score_gemma":0.0003817278,"teacher_disagreement_score":0.0067666704,"about_ca_system_score_codex":0.0008508033,"about_ca_system_score_gemma":0.00077840895,"threshold_uncertainty_score":0.022636771},"labels":[],"label_agreement":null},{"id":"W2952761579","doi":"10.1109/isit.2012.6284696","title":"An algorithm for list decoding number field codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Decoding methods; Field (mathematics); Algebraic number; Algorithm; Gröbner basis; List decoding; Computer science; Discrete mathematics; Mathematics; Combinatorics; Block code; Pure mathematics; Concatenated error correction code; Computation","score_opus":0.027561398868023414,"score_gpt":0.3110633547250667,"score_spread":0.2835019558570433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952761579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.015868736,0.00051318324,0.9550459,0.0015094238,0.00041941297,0.000449161,0.0009594253,0.005590763,0.019643985],"genre_scores_gemma":[0.13699187,0.00051249453,0.8309812,0.0010242255,0.00031876913,0.0008956251,0.0027687496,0.0007736127,0.025733389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828076,0.00043196848,0.00014199922,0.0002461687,0.0006693691,0.00022974591],"domain_scores_gemma":[0.9972699,0.0011740768,0.0001360497,0.0006401329,0.0006538568,0.00012593163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011702173,0.0011379968,0.0010791416,0.002025714,0.0015135378,0.0029193982,0.0015635354,0.0019680827,0.011965517],"category_scores_gemma":[0.0059933597,0.0004937318,0.00084074435,0.0023601782,0.000850795,0.0026659959,0.0032800713,0.0017954585,0.0075156335],"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.00092183676,0.00023645147,0.0012271885,0.0004790709,0.00009155798,0.00026249257,0.00042999376,0.037173647,0.018969767,0.19407773,0.045065958,0.7010642],"study_design_scores_gemma":[0.00070856506,0.0005051124,0.0009127774,0.0002705689,0.00015797412,0.0010781693,0.00021511769,0.37431353,0.041772105,0.5045682,0.075324036,0.0001737888],"about_ca_topic_score_codex":0.0016135635,"about_ca_topic_score_gemma":0.0023929111,"teacher_disagreement_score":0.011965517,"about_ca_system_score_codex":0.002051539,"about_ca_system_score_gemma":0.003062201,"threshold_uncertainty_score":0.04002863},"labels":[],"label_agreement":null},{"id":"W2953313566","doi":"10.48550/arxiv.1208.2361","title":"Lexicodes over Rings","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multiplicative function; Greedy algorithm; Combinatorics; Constraint (computer-aided design); Mathematics; Selection (genetic algorithm); Property (philosophy); Binary number; Discrete mathematics; Construct (python library); Dual (grammatical number); Chain (unit); Algorithm; Computer science; Physics; Arithmetic","score_opus":0.07209345690978462,"score_gpt":0.18186137546924006,"score_spread":0.10976791855945543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953313566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2591512,0.0013243651,0.61555153,0.00096792594,0.0003110935,0.00016345407,0.0006468934,0.0007239831,0.12115957],"genre_scores_gemma":[0.5801505,0.0014733227,0.37295598,0.00046628417,0.00021025095,0.0001667154,0.0006083957,0.00038805208,0.04358052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960047,0.00013479202,0.00002467645,0.00006674197,0.00009886086,0.00007443538],"domain_scores_gemma":[0.9995436,0.00017708166,0.00005306753,0.00009549359,0.00007399786,0.00005677786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037076444,0.00024845928,0.00027285036,0.0006161803,0.0009999302,0.0010507726,0.0002797257,0.00029619678,0.0066962824],"category_scores_gemma":[0.00094685785,0.00022232224,0.00029632697,0.0006733622,0.00092421955,0.001573584,0.0011093091,0.0006913182,0.0021095483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007296504,0.000027514785,0.00033718944,0.00011879741,0.0000064256433,0.00008604363,0.00021785955,0.003310617,0.0057379906,0.9409246,0.0021672333,0.046992715],"study_design_scores_gemma":[0.0000354993,0.0001833206,0.00041031823,0.00009612015,0.000014304859,0.0004392628,0.00031311053,0.020634258,0.021055162,0.86812586,0.088652454,0.00004029743],"about_ca_topic_score_codex":0.000377977,"about_ca_topic_score_gemma":0.00075374136,"teacher_disagreement_score":0.0066962824,"about_ca_system_score_codex":0.0005648424,"about_ca_system_score_gemma":0.00050488015,"threshold_uncertainty_score":0.022401273},"labels":[],"label_agreement":null},{"id":"W2953369668","doi":"10.48550/arxiv.1504.05086","title":"A Modified KZ Reduction Algorithm","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reduction (mathematics); Zhàng; Matrix (chemical analysis); Algorithm; Computer science; Basis (linear algebra); Cryptography; Mathematics; Materials science; Political science; Law; China","score_opus":0.09205719074556395,"score_gpt":0.18919996683841947,"score_spread":0.09714277609285552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953369668","genre_codex":"methods","genre_gemma":"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.0125145065,0.00035153874,0.9677972,0.00042257286,0.00029889986,0.00013202733,0.0002592692,0.0016169171,0.016607067],"genre_scores_gemma":[0.16681321,0.00044739395,0.8032773,0.00051657856,0.00022297748,0.00029212292,0.00096724724,0.0010815994,0.026381576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989152,0.00020259702,0.000054695953,0.00017980058,0.0005107949,0.00013694131],"domain_scores_gemma":[0.9994,0.00014885931,0.00002992629,0.00017281555,0.00021859731,0.000029758407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213567,0.0006960592,0.0009114658,0.0014564396,0.001002449,0.0013659898,0.0011937767,0.001019873,0.011327657],"category_scores_gemma":[0.002418928,0.00032213633,0.00086460373,0.0010009754,0.0009652439,0.001611922,0.0019810759,0.0015390458,0.0076073054],"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.00033793834,0.00011747283,0.000552402,0.0002228268,0.00006405363,0.00022469797,0.00022313782,0.04606124,0.02732034,0.37240514,0.021286845,0.53118396],"study_design_scores_gemma":[0.00017809068,0.00017092042,0.0006834906,0.000077591685,0.000060629758,0.0007872667,0.00012408757,0.48613334,0.037255768,0.3837328,0.09064827,0.00014773347],"about_ca_topic_score_codex":0.0010646427,"about_ca_topic_score_gemma":0.0011984052,"teacher_disagreement_score":0.011327657,"about_ca_system_score_codex":0.00064506865,"about_ca_system_score_gemma":0.0013181348,"threshold_uncertainty_score":0.037894785},"labels":[],"label_agreement":null},{"id":"W2953439278","doi":"10.1109/tcsii.2019.2924455","title":"High-Throughput Low-Latency Encoder and Decoder for a Class of Generalized Reed–Solomon Codes for Short-Reach Optical Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Encoder; Computer science; Latency (audio); Throughput; CMOS; Computer hardware; Power consumption; Error detection and correction; Low latency (capital markets); Forward error correction; Decoding methods; Embedded system; Power (physics); Electronic engineering; Computer network; Telecommunications; Algorithm; Engineering; Wireless; Operating system","score_opus":0.0281348514875513,"score_gpt":0.26723044420526443,"score_spread":0.23909559271771313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953439278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.41160822,0.006036952,0.55308557,0.0005808083,0.00033289,0.00039052722,0.0004400434,0.0028353238,0.024689805],"genre_scores_gemma":[0.7941463,0.0016562899,0.19215316,0.00014729513,0.00014282503,0.00010478571,0.00030672428,0.000086444794,0.011256258],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998895,0.000017519349,0.0000079073125,0.000017647142,0.000049089922,0.00001838321],"domain_scores_gemma":[0.999813,0.000052306244,0.000044706467,0.000029452387,0.00005210302,0.000008488905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001392939,0.00037824846,0.00018812592,0.00024931334,0.00021881316,0.0003462602,0.00032427168,0.00031674295,0.0015753186],"category_scores_gemma":[0.0002902721,0.000109844514,0.00015828582,0.00019446944,0.00018584848,0.00049961073,0.00014622045,0.00035045797,0.0005486387],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002165423,0.00006733575,0.0006417871,0.0006163077,0.000036824113,0.00034529093,0.0001369252,0.010353099,0.82948667,0.032514874,0.002142746,0.12344156],"study_design_scores_gemma":[0.00006722856,0.001170299,0.0013565612,0.00007171542,0.000092170616,0.0013927206,0.000057076824,0.1081637,0.8197075,0.0051593287,0.062695354,0.00006637015],"about_ca_topic_score_codex":0.0004375329,"about_ca_topic_score_gemma":0.0012820325,"teacher_disagreement_score":0.0015753186,"about_ca_system_score_codex":0.00030631022,"about_ca_system_score_gemma":0.00044543663,"threshold_uncertainty_score":0.0052699447},"labels":[],"label_agreement":null},{"id":"W2955456460","doi":"10.1142/s0219498820501509","title":"Additive decompositions of polynomials over unique factorization domains","year":2019,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Factorization; Factorization of polynomials; Decomposition; Pure mathematics; Finite field; Unique factorization domain; Algebra over a field; Discrete mathematics; Combinatorics; Polynomial; Mathematical analysis; Algorithm; Matrix polynomial","score_opus":0.004977955045630473,"score_gpt":0.23256817190012807,"score_spread":0.2275902168544976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955456460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.42704478,0.005151006,0.49770248,0.0014230463,0.00064794347,0.00008674878,0.00048824662,0.00022156302,0.06723424],"genre_scores_gemma":[0.9356364,0.0022161687,0.04503436,0.00021725084,0.00061089103,0.000052440657,0.00041043395,0.00008049475,0.015741562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987073,0.00023218486,0.00006515429,0.000217656,0.00044768592,0.00033014288],"domain_scores_gemma":[0.9982338,0.0005399148,0.00033223623,0.00020322969,0.00042745416,0.0002633843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333309,0.0007529968,0.0007876036,0.002408488,0.0011996665,0.0022472858,0.0006602344,0.0003855303,0.0039037203],"category_scores_gemma":[0.0028003317,0.00032460445,0.0010285205,0.0016264074,0.00247091,0.0043634363,0.0023976967,0.0021363338,0.00084680656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030511086,0.000021664404,0.00031333228,0.000057965837,0.000011718285,0.00010620814,0.00021602542,0.0013121454,0.0011674265,0.9848257,0.00071942096,0.011217767],"study_design_scores_gemma":[0.0000128493575,0.00006143324,0.00038095762,0.00004425908,0.000018998124,0.00041788226,0.00020262097,0.0077072373,0.0021815116,0.9824348,0.006514766,0.000022578351],"about_ca_topic_score_codex":0.0006113257,"about_ca_topic_score_gemma":0.0005730663,"teacher_disagreement_score":0.0039037203,"about_ca_system_score_codex":0.00087725336,"about_ca_system_score_gemma":0.0006638846,"threshold_uncertainty_score":0.013059258},"labels":[],"label_agreement":null},{"id":"W2960394841","doi":"10.1145/3326229.3326263","title":"Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication","year":2019,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invertible matrix; Integer (computer science); Combinatorics; Mathematics; Multiplication (music); Matrix (chemical analysis); Reduction (mathematics); Integer matrix; Matrix multiplication; Prime (order theory); Discrete mathematics; Permutation (music); Triangular matrix; Diagonal; Symmetric matrix; Pure mathematics; Computer science; Physics","score_opus":0.009066095495544341,"score_gpt":0.25127952253054475,"score_spread":0.2422134270350004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960394841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.05441405,0.0003891743,0.91951424,0.0012058904,0.00020637122,0.00032825436,0.00044658605,0.0030980876,0.020397305],"genre_scores_gemma":[0.43589297,0.00031521896,0.5493605,0.00074987375,0.00015918934,0.000503768,0.0012461387,0.0007053019,0.01106694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742967,0.00053689216,0.00012295015,0.0005154707,0.000924048,0.0004710061],"domain_scores_gemma":[0.99738675,0.0011320148,0.00016412226,0.0010181408,0.00024262267,0.000056344117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010090196,0.0007529889,0.0009720192,0.00043701645,0.0009009453,0.0014522079,0.0015522726,0.00081254117,0.005442384],"category_scores_gemma":[0.0045241583,0.00042509206,0.0014728402,0.00076729385,0.0016141144,0.0018665439,0.002381896,0.0031706716,0.0019549327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001129582,0.00043337513,0.0010516398,0.00068775605,0.00012273189,0.00034021988,0.0006116414,0.23386686,0.030554421,0.4221872,0.020809824,0.2882048],"study_design_scores_gemma":[0.00024526066,0.00025875602,0.00044490577,0.000048658243,0.000068506524,0.00018425476,0.00011482952,0.61690265,0.033465043,0.32815877,0.020033956,0.00007441485],"about_ca_topic_score_codex":0.0021412596,"about_ca_topic_score_gemma":0.0032463244,"teacher_disagreement_score":0.005442384,"about_ca_system_score_codex":0.0017418755,"about_ca_system_score_gemma":0.002381283,"threshold_uncertainty_score":0.018206596},"labels":[],"label_agreement":null},{"id":"W2960877448","doi":"10.1017/s0004972719000728","title":"A NEW PROOF OF THE CARLITZ–LUTZ THEOREM","year":2019,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Brock University","funders":"","keywords":"Mathematics; Finite field; Hermite polynomials; Permutation (music); Combinatorics; Polynomial; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.012929760564801487,"score_gpt":0.2245219212870269,"score_spread":0.2115921607222254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960877448","genre_codex":"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.055135783,0.006052473,0.5935363,0.024841608,0.0068506007,0.00018143491,0.0018121385,0.0015026996,0.31008694],"genre_scores_gemma":[0.72352546,0.0058529763,0.17050937,0.009513628,0.0051518786,0.00038086055,0.000790463,0.00080177624,0.08347358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935406,0.00011041118,0.00003852147,0.00013295123,0.00025905157,0.0001051459],"domain_scores_gemma":[0.99873656,0.0005389082,0.000098369695,0.00018588413,0.00030930163,0.00013104187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013539006,0.00093990535,0.0007577629,0.0023702201,0.0017582428,0.0019728981,0.0008680091,0.0011206821,0.014052761],"category_scores_gemma":[0.0038499502,0.000426545,0.0011920637,0.0012640205,0.0022952852,0.0038413722,0.0027860259,0.0036971571,0.0024186014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001093995,0.000018129396,0.000121609155,0.00004617951,0.000009670598,0.00007600808,0.00009185329,0.0005756796,0.0009047103,0.98347616,0.0070740143,0.007595138],"study_design_scores_gemma":[0.00001921859,0.00002652039,0.000319181,0.00003957832,0.000019216115,0.0002961399,0.000050755832,0.01025255,0.0016482559,0.9329181,0.05436768,0.000042872107],"about_ca_topic_score_codex":0.0015880541,"about_ca_topic_score_gemma":0.0020016686,"teacher_disagreement_score":0.014052761,"about_ca_system_score_codex":0.0020406486,"about_ca_system_score_gemma":0.0015953181,"threshold_uncertainty_score":0.047011137},"labels":[],"label_agreement":null},{"id":"W2961053155","doi":"10.5539/jmr.v11n4p26","title":"Design ”Strong Diffie-Hellman-Exponential-Schnnor Key Exchange” Over Elliptic Curves (SDH-XS-KE Over EC)","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Key exchange; Diffie–Hellman key exchange; Key (lock); Elliptic curve; Exponential function; Prime (order theory); Protocol (science); Discrete mathematics; Combinatorics; Public-key cryptography; Computer network; Pure mathematics; Computer science; Mathematical analysis; Computer security; Encryption","score_opus":0.08870657533090492,"score_gpt":0.35289147446467806,"score_spread":0.26418489913377313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961053155","genre_codex":"methods","genre_gemma":"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.04417186,0.00047673928,0.9447433,0.0004675123,0.00018104803,0.00078351126,0.00014752774,0.0010056061,0.00802291],"genre_scores_gemma":[0.69768345,0.00050540885,0.29135656,0.00045494753,0.000086917484,0.0006077742,0.00046770388,0.0001460515,0.008691222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665654,0.0009204032,0.00040116516,0.0006626176,0.00093291845,0.00042629146],"domain_scores_gemma":[0.99742067,0.00056925986,0.00027943432,0.0011039254,0.0004317731,0.00019496091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003792194,0.0005914896,0.00071448885,0.00063899986,0.0007767296,0.0014476196,0.0014642989,0.001108729,0.0023804484],"category_scores_gemma":[0.004160823,0.0003197927,0.00061087235,0.00061194337,0.0016252254,0.0037499834,0.004261829,0.0014861157,0.000872975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084353046,0.00028255003,0.0036686766,0.0008535759,0.0001877568,0.000601368,0.00077925663,0.037148707,0.04535289,0.738792,0.004712402,0.16677727],"study_design_scores_gemma":[0.0005276288,0.0012961613,0.001550567,0.00023527563,0.0002517583,0.0026326273,0.00061244785,0.37237772,0.22077624,0.25727236,0.14219241,0.00027487392],"about_ca_topic_score_codex":0.00030239797,"about_ca_topic_score_gemma":0.00025026238,"teacher_disagreement_score":0.003792194,"about_ca_system_score_codex":0.000956539,"about_ca_system_score_gemma":0.0015330242,"threshold_uncertainty_score":0.020055294},"labels":[],"label_agreement":null},{"id":"W2961176507","doi":"10.1109/tit.2019.2928292","title":"A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Notation; Mathematics; Bounded function; Discrete mathematics; Successor cardinal; Disjoint sets; Conjecture; Correctness; Sequence (biology); Combinatorics; Computer science; Algebra over a field; Algorithm; Pure mathematics; Arithmetic","score_opus":0.007995481466533831,"score_gpt":0.23025340793767662,"score_spread":0.22225792647114279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961176507","genre_codex":"methods","genre_gemma":"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.013991272,0.00017546995,0.97117627,0.00011444352,0.000098379045,0.00014552867,0.00012206675,0.0013210431,0.012855494],"genre_scores_gemma":[0.20236267,0.0003931058,0.78431785,0.00015381374,0.00006646586,0.00030238647,0.00033675935,0.00045474825,0.011612194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987791,0.0002487947,0.00015458625,0.00032180923,0.00035033116,0.00014548191],"domain_scores_gemma":[0.9987588,0.0004568812,0.000104348765,0.00031394698,0.00031140997,0.000054668613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014118301,0.0006552637,0.0005547154,0.0012537446,0.0011737484,0.0019009718,0.0014546335,0.00080479996,0.0058711637],"category_scores_gemma":[0.0037543254,0.00059131003,0.0010609864,0.000872713,0.0018451255,0.0028983736,0.0014215912,0.0013322269,0.002604342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079375044,0.000056616955,0.0002703245,0.00019568024,0.000015428315,0.00024560848,0.00043837674,0.014438929,0.010784489,0.8583751,0.0017588831,0.113341294],"study_design_scores_gemma":[0.00006888718,0.00021947279,0.00018213128,0.0001450441,0.000054096367,0.0005621566,0.00017845939,0.11563049,0.065171316,0.7422755,0.075388074,0.00012446905],"about_ca_topic_score_codex":0.0014772156,"about_ca_topic_score_gemma":0.0015915995,"teacher_disagreement_score":0.0058711637,"about_ca_system_score_codex":0.00088183174,"about_ca_system_score_gemma":0.0014173257,"threshold_uncertainty_score":0.019641042},"labels":[],"label_agreement":null},{"id":"W2962788513","doi":"10.4171/jncg/65","title":"Codes and noncommutative stochastic matrices","year":2010,"lang":"en","type":"article","venue":"Journal of Noncommutative Geometry","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Noncommutative geometry; Mathematics; Skew; Matrix (chemical analysis); Field (mathematics); Column (typography); Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.008211970431845749,"score_gpt":0.2628949219386728,"score_spread":0.25468295150682707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962788513","genre_codex":"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.31193995,0.0023742951,0.6274782,0.0020015547,0.0006821887,0.000064058295,0.0004211859,0.0002088536,0.054829758],"genre_scores_gemma":[0.94389254,0.0013991828,0.040455095,0.0004614446,0.000804219,0.000104283055,0.0002099702,0.00010575751,0.012567403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847907,0.00043839528,0.00010605039,0.00023481637,0.000543261,0.00019844667],"domain_scores_gemma":[0.99600476,0.0016513548,0.0007100817,0.0005190365,0.0007783127,0.00033654948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019521147,0.00062163273,0.00056754984,0.0017555618,0.0010144371,0.0016376753,0.00074521045,0.00082150137,0.003995613],"category_scores_gemma":[0.00585755,0.00036634743,0.00070911134,0.0013301059,0.003314654,0.0040611248,0.0017451821,0.0017931234,0.000736056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009118222,0.0000047014264,0.00007989731,0.00001111515,0.0000022226993,0.000045482673,0.00006371306,0.0015972187,0.00029295683,0.99606377,0.00022693696,0.0016029052],"study_design_scores_gemma":[0.0000057122465,0.000015903574,0.00011929616,0.00000956707,0.000002878841,0.00010171743,0.000030556756,0.011676323,0.00053178007,0.9857054,0.001786548,0.00001437463],"about_ca_topic_score_codex":0.00064921763,"about_ca_topic_score_gemma":0.00079671404,"teacher_disagreement_score":0.003995613,"about_ca_system_score_codex":0.0011143326,"about_ca_system_score_gemma":0.0007618552,"threshold_uncertainty_score":0.013366699},"labels":[],"label_agreement":null},{"id":"W2962898640","doi":"10.1016/j.ffa.2019.01.003","title":"Further results on complete permutation monomials over finite fields","year":2019,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Monomial; Conjecture; Counterexample; Finite field; Modulo; Combinatorics; Prime (order theory); Permutation (music); Multiplicative function; Prime power; Multiplicative group; Discrete mathematics; Class (philosophy)","score_opus":0.018511220055682745,"score_gpt":0.23542736778320295,"score_spread":0.21691614772752021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962898640","genre_codex":"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.2418554,0.012063785,0.15523712,0.011524573,0.003495056,0.00013156733,0.0013749659,0.0005019385,0.5738157],"genre_scores_gemma":[0.7737526,0.013586088,0.02295859,0.0020703026,0.0067269676,0.00010074211,0.0022547373,0.00039805422,0.17815197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999156,0.00016168234,0.000039444385,0.00012989386,0.00029604376,0.00021705963],"domain_scores_gemma":[0.99739057,0.0013720418,0.00021131233,0.00039340707,0.00028266574,0.00035015502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014474246,0.0019680012,0.0015966523,0.0035094868,0.002487534,0.002831532,0.0013739858,0.0010253853,0.021477068],"category_scores_gemma":[0.0037778695,0.00066986546,0.0020059948,0.0057861493,0.0040645073,0.009864134,0.0033522758,0.005177001,0.003166724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001100979,0.00010882249,0.00025351136,0.00019671765,0.000018074317,0.00016169182,0.00022984328,0.0018333961,0.0011039666,0.97356695,0.0055441754,0.016872803],"study_design_scores_gemma":[0.000016979944,0.000042161737,0.00035597774,0.000039077884,0.000023251303,0.00017349765,0.000078951394,0.0021149628,0.00095058297,0.9831933,0.0129914675,0.00001973687],"about_ca_topic_score_codex":0.0009654357,"about_ca_topic_score_gemma":0.0013113549,"teacher_disagreement_score":0.021477068,"about_ca_system_score_codex":0.0015345906,"about_ca_system_score_gemma":0.0011367422,"threshold_uncertainty_score":0.071847975},"labels":[],"label_agreement":null},{"id":"W2962947731","doi":"10.1142/s1793830909000312","title":"CLASSIFICATION OF NEAR-NORMAL SEQUENCES","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geology","score_opus":0.01773718719294016,"score_gpt":0.2653631227996698,"score_spread":0.24762593560672963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962947731","genre_codex":"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.7606328,0.0011528458,0.17207555,0.000891335,0.00052491465,0.00015226565,0.00090996624,0.00037416338,0.063286066],"genre_scores_gemma":[0.9220723,0.0010174478,0.05071235,0.00033537936,0.00046936763,0.00016848366,0.0025538346,0.0001412796,0.022529539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872416,0.0001911903,0.000119706376,0.00027063498,0.000465114,0.0002291655],"domain_scores_gemma":[0.99701023,0.0006228197,0.00043784225,0.00031796098,0.0009741178,0.00063704513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977085,0.00051223324,0.0005983659,0.0038934909,0.0015953887,0.0023375233,0.000833513,0.00096706435,0.0061820354],"category_scores_gemma":[0.004965368,0.00022691372,0.00042224498,0.001781361,0.002197985,0.004361177,0.0022301588,0.001732741,0.0013339816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021840693,0.00010474594,0.0058517894,0.00009035539,0.000008672301,0.00019843307,0.00063226116,0.0021751064,0.007964359,0.92573667,0.0025115157,0.05450775],"study_design_scores_gemma":[0.000025700894,0.00014536435,0.0030664478,0.00008062415,0.0000114852755,0.0009865611,0.0004533859,0.02108196,0.005487249,0.94349855,0.025115475,0.00004725374],"about_ca_topic_score_codex":0.0004073113,"about_ca_topic_score_gemma":0.00026590683,"teacher_disagreement_score":0.0061820354,"about_ca_system_score_codex":0.0009516018,"about_ca_system_score_gemma":0.0005367758,"threshold_uncertainty_score":0.020681024},"labels":[],"label_agreement":null},{"id":"W2963159955","doi":"10.1093/imrn/rnv392","title":"The Asymptotic Formula for Waring's Problem in Function Fields","year":2016,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Asymptotic formula; Integer (computer science); Combinatorics; Exponential function; Finite field; Function (biology); Field (mathematics); Function field; Ring (chemistry); Minor (academic); Quadratic equation; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.0694521847039834,"score_gpt":0.3662492453983421,"score_spread":0.2967970606943587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963159955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.24828011,0.0035434063,0.6353981,0.007472951,0.00067139853,0.0001500698,0.00037324583,0.00079378334,0.103316925],"genre_scores_gemma":[0.9087587,0.0025809102,0.06731661,0.0009015218,0.0013832249,0.0003527173,0.00045996252,0.00034243177,0.017903898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794453,0.0005230053,0.00011229535,0.00036439413,0.0006378836,0.00041789885],"domain_scores_gemma":[0.9835993,0.012307601,0.00079127436,0.0011214853,0.0012929948,0.0008873734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004088307,0.0010746041,0.0015553664,0.0030009826,0.0017086741,0.0030706748,0.0027744516,0.0018102127,0.0072880327],"category_scores_gemma":[0.038305793,0.00054121687,0.001464193,0.0017997255,0.0056629498,0.0113872755,0.0032913582,0.00640729,0.00084353244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012138338,0.00005387814,0.001437004,0.0001443231,0.000022036853,0.00016252731,0.00023859252,0.0115696015,0.0013457704,0.96329445,0.0036258367,0.017984705],"study_design_scores_gemma":[0.000017120848,0.00004797289,0.0006568825,0.00007351562,0.000022959483,0.00023943208,0.0000833227,0.106844686,0.0011677911,0.88861847,0.0021978784,0.000030039144],"about_ca_topic_score_codex":0.0013851343,"about_ca_topic_score_gemma":0.0008773554,"teacher_disagreement_score":0.0072880327,"about_ca_system_score_codex":0.0033086247,"about_ca_system_score_gemma":0.0013838336,"threshold_uncertainty_score":0.024380922},"labels":[],"label_agreement":null},{"id":"W2963225323","doi":"","title":"Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Univariate; Algorithm; Polynomial; Bivariate analysis; Gröbner basis; Decoding methods; Mathematics; Computer science; Polynomial matrix; Algebra over a field; Matrix polynomial; Multivariate statistics","score_opus":0.010147098928548724,"score_gpt":0.25593090733220786,"score_spread":0.24578380840365913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963225323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.028479923,0.0004012731,0.9527911,0.00023919057,0.00008626107,0.000062224906,0.00023520889,0.009139695,0.008565127],"genre_scores_gemma":[0.35907418,0.00057681237,0.63222027,0.000110303845,0.00013155179,0.00011514665,0.0009040487,0.0013546861,0.0055131153],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986719,0.00031071037,0.0001217954,0.00022468914,0.00046316022,0.00020789009],"domain_scores_gemma":[0.99753165,0.0008188401,0.00017824298,0.0009084373,0.000466243,0.00009650728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001296329,0.0009819935,0.000782954,0.0012723851,0.0006065163,0.0020150938,0.001544302,0.0006665419,0.009795889],"category_scores_gemma":[0.00813171,0.0003646337,0.00073720625,0.0017754363,0.00092364993,0.003120811,0.0020279025,0.0014963556,0.0045798495],"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.0006708152,0.00023133546,0.0017506647,0.00045718535,0.00006373099,0.00025423965,0.0004567927,0.063432984,0.02915117,0.29169977,0.015131193,0.5967001],"study_design_scores_gemma":[0.0002036053,0.00025805295,0.0006319474,0.00011161175,0.000067005145,0.00060575287,0.0001989592,0.7043295,0.07775142,0.179345,0.036411367,0.00008578994],"about_ca_topic_score_codex":0.0012975544,"about_ca_topic_score_gemma":0.0019118012,"teacher_disagreement_score":0.009795889,"about_ca_system_score_codex":0.0010344668,"about_ca_system_score_gemma":0.0015308573,"threshold_uncertainty_score":0.032770455},"labels":[],"label_agreement":null},{"id":"W2963245222","doi":"10.1016/j.jnt.2011.02.006","title":"La suite de Thue--Morse le long des multiples d'entiers","year":2011,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Integer (computer science); Hamming weight; Subsequence; Morse code; Base (topology); Sequence (biology); Discrete mathematics; Multiple; Square-free integer; Hamming code; Binary number; Arithmetic; Statistics; Mathematical analysis; Decoding methods","score_opus":0.02978019369975616,"score_gpt":0.22106855905822567,"score_spread":0.19128836535846952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963245222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.17101957,0.0037894268,0.726768,0.011577127,0.0045181485,0.0001527608,0.00084697513,0.0029365506,0.07839145],"genre_scores_gemma":[0.637269,0.0024088072,0.13002622,0.0022752772,0.0033139554,0.00043458276,0.0011591271,0.0015178022,0.22159523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971444,0.00077278115,0.00011255706,0.00053584174,0.0010523945,0.0003820356],"domain_scores_gemma":[0.994547,0.0027449373,0.000348962,0.00048032252,0.0012566922,0.000622067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029829,0.0021932828,0.002171088,0.002564032,0.0034630944,0.005091848,0.0014244642,0.0042612487,0.019650714],"category_scores_gemma":[0.00988286,0.00081962784,0.0026213299,0.0013735703,0.0039247302,0.004379805,0.0025817107,0.0074866405,0.0057655084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014734317,0.00008202681,0.0040308475,0.00031071814,0.0003122776,0.0021083273,0.0008449493,0.042277023,0.021620307,0.8154411,0.018531574,0.092967406],"study_design_scores_gemma":[0.00033697142,0.0006646593,0.005907536,0.00028605238,0.00019425395,0.0049587786,0.0015230085,0.40186146,0.04023082,0.40211016,0.14163296,0.00029337962],"about_ca_topic_score_codex":0.0129605,"about_ca_topic_score_gemma":0.009433728,"teacher_disagreement_score":0.019650714,"about_ca_system_score_codex":0.0044138287,"about_ca_system_score_gemma":0.0023225758,"threshold_uncertainty_score":0.06573826},"labels":[],"label_agreement":null},{"id":"W2963336182","doi":"10.1109/isit.2016.7541434","title":"On deep holes of projective Reed-Solomon codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre de Recherches Mathématiques; National Science Foundation","keywords":"Reed–Solomon error correction; Projective test; Reed–Muller code; Computer science; RADIUS; Mathematics; Decoding methods; Algorithm; Concatenated error correction code; Block code; Pure mathematics; Computer security","score_opus":0.01100211429692679,"score_gpt":0.2298730084517459,"score_spread":0.2188708941548191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963336182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.42150694,0.012192384,0.46083945,0.0027519027,0.0006422326,0.00016973045,0.00060472434,0.00074672926,0.10054586],"genre_scores_gemma":[0.96784556,0.0032192268,0.022877406,0.00030756067,0.00051226176,0.000082224855,0.00018241737,0.0001562699,0.00481704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827945,0.0005174887,0.00008071455,0.00028825243,0.0005048331,0.00032932113],"domain_scores_gemma":[0.99180955,0.005248153,0.0010359372,0.0007990104,0.00049013144,0.00061721634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016872165,0.0017277638,0.0014123699,0.003080198,0.0011348018,0.0021206865,0.0011606523,0.0010813872,0.003627844],"category_scores_gemma":[0.011624307,0.0006339297,0.00078843156,0.0011124013,0.0044855834,0.007323544,0.005392725,0.0029396915,0.0006582487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025769623,0.000055538334,0.001969453,0.00040823562,0.00004019458,0.0004933289,0.00072224566,0.022006255,0.008159039,0.94220537,0.0025758066,0.021106843],"study_design_scores_gemma":[0.000035310735,0.00016098931,0.0014161838,0.00012724704,0.000046223995,0.0009825925,0.00033514772,0.06988715,0.0058910926,0.91445357,0.0065763113,0.000088177934],"about_ca_topic_score_codex":0.00036856136,"about_ca_topic_score_gemma":0.00026949096,"teacher_disagreement_score":0.003627844,"about_ca_system_score_codex":0.0010570453,"about_ca_system_score_gemma":0.0004019375,"threshold_uncertainty_score":0.01213634},"labels":[],"label_agreement":null},{"id":"W2963410748","doi":"10.4153/cjm-2016-004-8","title":"Number of Right Ideals and a <i>q</i>-analogue of Indecomposable Permutations","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Indecomposable module; Codimension; Noncommutative geometry; Combinatorics; Field (mathematics); Pure mathematics; Laurent polynomial; Discrete mathematics; Algebra over a field","score_opus":0.012424748791594819,"score_gpt":0.23566398146780285,"score_spread":0.22323923267620802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963410748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.93741584,0.00031052047,0.03280879,0.000692416,0.00013872946,0.00004148806,0.00018021626,0.00011047373,0.028301563],"genre_scores_gemma":[0.991963,0.00008946676,0.004556747,0.000059015383,0.00009657403,0.000023256947,0.00010933946,0.000019702105,0.003082854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734277,0.0005407412,0.00022615927,0.0005985551,0.000750931,0.0005409336],"domain_scores_gemma":[0.9910772,0.003456318,0.0018009807,0.0008795554,0.0009581799,0.0018277568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024683634,0.0005086108,0.0009754447,0.0015465403,0.0018656844,0.0041045053,0.001023748,0.00071879895,0.005418886],"category_scores_gemma":[0.0046120626,0.00056715374,0.0009195222,0.00071611226,0.004690806,0.0054403534,0.0024924052,0.002363152,0.00056891335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008206718,0.0001820831,0.007635024,0.00009887326,0.00003265685,0.0009187964,0.00059074984,0.0020554152,0.020299008,0.9605105,0.0006806022,0.0061757057],"study_design_scores_gemma":[0.00015409439,0.00023475895,0.0071995384,0.00004538856,0.000048490172,0.0019181301,0.000480012,0.017603043,0.02415269,0.9425229,0.005556474,0.000084478],"about_ca_topic_score_codex":0.00036164589,"about_ca_topic_score_gemma":0.00027228022,"teacher_disagreement_score":0.005418886,"about_ca_system_score_codex":0.0013058753,"about_ca_system_score_gemma":0.0006416093,"threshold_uncertainty_score":0.018128037},"labels":[],"label_agreement":null},{"id":"W2963680237","doi":"10.4064/aa8252-3-2016","title":"On a problem of Sidon for polynomials over finite fields","year":2016,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Omega; Integer (computer science); Sequence (biology); Combinatorics; Discrete mathematics; Physics","score_opus":0.012347681773915865,"score_gpt":0.2410096026789031,"score_spread":0.22866192090498721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963680237","genre_codex":"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.31472617,0.009331773,0.20496069,0.20579897,0.0076171407,0.0002686786,0.0015333861,0.0010518079,0.2547114],"genre_scores_gemma":[0.83259666,0.0046379482,0.054530483,0.01443811,0.0066665807,0.00030673828,0.0016755235,0.0005413793,0.084606566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976979,0.0007667208,0.00013646537,0.00045962378,0.00041770888,0.00052161823],"domain_scores_gemma":[0.99039334,0.007725856,0.00028668827,0.0006057816,0.0005294536,0.00045893554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034579064,0.0012622788,0.0025771789,0.002177677,0.0068307645,0.0038028609,0.001966016,0.0061706235,0.011052191],"category_scores_gemma":[0.017677752,0.0008301538,0.00216066,0.003246272,0.0068043694,0.016008839,0.0053547155,0.007999414,0.0020751157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023916544,0.00007132059,0.00050335954,0.0001344981,0.000020583173,0.00017187893,0.0005336034,0.002207586,0.00031656364,0.95635223,0.02563329,0.01381588],"study_design_scores_gemma":[0.00007438647,0.000034556782,0.00014354636,0.000043909327,0.000013088697,0.000094726274,0.00020337479,0.008123301,0.00031026127,0.9777966,0.01313072,0.000031553194],"about_ca_topic_score_codex":0.004123021,"about_ca_topic_score_gemma":0.0026889865,"teacher_disagreement_score":0.011052191,"about_ca_system_score_codex":0.0053890054,"about_ca_system_score_gemma":0.0031256285,"threshold_uncertainty_score":0.03910017},"labels":[],"label_agreement":null},{"id":"W2963692803","doi":"10.1016/j.ffa.2012.02.004","title":"On a conjecture of polynomials with prescribed range","year":2012,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Multiset; Finite field; Conjecture; Multiplicity (mathematics); Combinatorics; Integer (computer science); Discrete mathematics; Polynomial; Field (mathematics); Degree (music); Range (aeronautics); Pure mathematics; Mathematical analysis; Physics","score_opus":0.010380977272338545,"score_gpt":0.20909048490546786,"score_spread":0.1987095076331293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963692803","genre_codex":"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.30384398,0.011047699,0.21849231,0.10977525,0.0043701595,0.0001406313,0.00165353,0.0010314285,0.349645],"genre_scores_gemma":[0.9348771,0.003821986,0.025705772,0.0051958663,0.0054730275,0.00015275928,0.0012462887,0.00029332898,0.023233885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995411,0.0015732684,0.0001912391,0.0009651644,0.0009881444,0.00087124144],"domain_scores_gemma":[0.97052336,0.023261195,0.001057994,0.002408361,0.0016381876,0.001110957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005907461,0.001340796,0.0028260157,0.0029929015,0.004222319,0.0055575413,0.0027510135,0.0054237787,0.011326445],"category_scores_gemma":[0.029472275,0.0010325541,0.0023325523,0.0039399387,0.015626894,0.02308897,0.0067253625,0.011433317,0.0016298464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007824661,0.000024162144,0.00017764766,0.0000561378,0.0000055743308,0.000043200136,0.0002297174,0.0007740474,0.00013419565,0.9929767,0.003016368,0.0024839805],"study_design_scores_gemma":[0.000026367605,0.000012330229,0.00008118457,0.000026232869,0.000005395239,0.000043415035,0.00006250763,0.0021222406,0.00010207512,0.99532723,0.0021790434,0.000011946517],"about_ca_topic_score_codex":0.0024099948,"about_ca_topic_score_gemma":0.0011816359,"teacher_disagreement_score":0.011326445,"about_ca_system_score_codex":0.0037745954,"about_ca_system_score_gemma":0.0018928663,"threshold_uncertainty_score":0.037890673},"labels":[],"label_agreement":null},{"id":"W2963700364","doi":"10.3934/amc.2017056","title":"On the performance of optimal double circulant even codes","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Decoding methods; Weight distribution; Bounded function; Minimum distance; Minimum weight; Combinatorics; Discrete mathematics; Distribution (mathematics); Algorithm; Mathematical analysis","score_opus":0.03960450188849118,"score_gpt":0.32103007023788704,"score_spread":0.28142556834939586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963700364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9506339,0.0014621408,0.035776947,0.0006342507,0.00007029844,0.00003483502,0.000286922,0.00026766502,0.010833172],"genre_scores_gemma":[0.99577856,0.00029529864,0.0033116776,0.000053216874,0.000024364927,0.000016289681,0.00012272065,0.000036206373,0.000361749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966402,0.0010410007,0.00012806852,0.0002940935,0.0010501364,0.00084652536],"domain_scores_gemma":[0.98313105,0.011735331,0.001359998,0.0014336845,0.0015687218,0.0007712275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035657098,0.0013260583,0.0014030929,0.0013474065,0.00089670863,0.0019082796,0.0009212826,0.0010951823,0.0016658541],"category_scores_gemma":[0.027135694,0.0003756278,0.00025311412,0.0010812429,0.0020100828,0.0018919602,0.0024794883,0.0009048743,0.00032615208],"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.00353317,0.00020834395,0.010840998,0.0003144889,0.00018947295,0.00041390976,0.00025781125,0.794957,0.041127652,0.10559908,0.0023914173,0.04016672],"study_design_scores_gemma":[0.0001224186,0.00069502584,0.0028205153,0.00012535276,0.000060319882,0.00041477004,0.00017637023,0.9027066,0.030292615,0.061572123,0.0008922419,0.000121608275],"about_ca_topic_score_codex":0.0012616453,"about_ca_topic_score_gemma":0.0010470075,"teacher_disagreement_score":0.0035657098,"about_ca_system_score_codex":0.0015968028,"about_ca_system_score_gemma":0.0019894,"threshold_uncertainty_score":0.018857539},"labels":[],"label_agreement":null},{"id":"W2963782751","doi":"10.1007/s12190-016-1042-7","title":"Algebraic quantum synchronizable codes","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"BCH code; Mathematics; Expander code; Discrete mathematics; Block code; Linear code; Extension (predicate logic); Intersection (aeronautics); Algorithm; Computer science; Error detection and correction; Decoding methods","score_opus":0.010122908029831243,"score_gpt":0.21649620788739593,"score_spread":0.2063732998575647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963782751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.3160793,0.0012006569,0.48482764,0.0049742996,0.0018248825,0.00034565182,0.000544548,0.0010163216,0.18918668],"genre_scores_gemma":[0.96056706,0.00039070012,0.017873049,0.0004901361,0.00051982823,0.00013321073,0.00017803548,0.00012469603,0.019723121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842083,0.00039229757,0.000098187724,0.00022581614,0.00061314035,0.00024970484],"domain_scores_gemma":[0.9970874,0.0010382676,0.0003479138,0.00074306945,0.00050510775,0.0002781776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011460868,0.00051546417,0.00083513046,0.0012957408,0.0014392082,0.002416513,0.0007197319,0.0015960117,0.010175314],"category_scores_gemma":[0.004770081,0.0003988827,0.00056447426,0.0012652948,0.0027634127,0.0029202756,0.00308615,0.0023615472,0.0012467413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048298978,0.00001636543,0.00009700836,0.000016893782,0.000005466379,0.000032121963,0.00008844479,0.0017135891,0.00092594494,0.99314547,0.00063637656,0.0032741274],"study_design_scores_gemma":[0.00004877175,0.00004038981,0.00013721151,0.00002110624,0.000010886799,0.0000886434,0.00007004905,0.019267518,0.002166164,0.9740776,0.0040441095,0.000027556016],"about_ca_topic_score_codex":0.00036099367,"about_ca_topic_score_gemma":0.00036033953,"teacher_disagreement_score":0.010175314,"about_ca_system_score_codex":0.00097190525,"about_ca_system_score_gemma":0.001378484,"threshold_uncertainty_score":0.034039855},"labels":[],"label_agreement":null},{"id":"W2963861488","doi":"10.22215/etd/2018-13380","title":"Composed Product and Factorization of Cyclotomic Polynomials Over Finite Fields","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Cyclotomic polynomial; Mathematics; Factorization; Prime (order theory); Prime power; Modulo; Divisor (algebraic geometry); Product (mathematics); Field (mathematics); Cyclotomic field; Factorization of polynomials; Prime factor; Combinatorics; Polynomial; Discrete mathematics; Arithmetic; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.009301017107973144,"score_gpt":0.2460644579323794,"score_spread":0.23676344082440626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963861488","genre_codex":"methods","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.22893971,0.00395724,0.59256464,0.0022694978,0.0010318181,0.000117134805,0.00057378714,0.00048070264,0.1700654],"genre_scores_gemma":[0.7831948,0.002871269,0.1569853,0.00037812424,0.0006581435,0.00009885732,0.0008029467,0.0002455712,0.054765012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992974,0.00011677687,0.000041213938,0.00018298213,0.0002291379,0.00013252103],"domain_scores_gemma":[0.9993573,0.00022954402,0.00007621422,0.000117963675,0.00013930078,0.000079730424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007965348,0.0006967288,0.0005038199,0.0009668413,0.0009113516,0.0017126553,0.00049268693,0.00047633352,0.008326663],"category_scores_gemma":[0.0017690656,0.00036787702,0.00089336385,0.00092633406,0.0018402236,0.004099501,0.0015055914,0.0020838373,0.0017537036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073889394,0.000024474339,0.00018422325,0.00005888769,0.0000072612534,0.00015638373,0.00032450684,0.0016251592,0.002344545,0.979393,0.001926584,0.013881125],"study_design_scores_gemma":[0.000021748636,0.000060724673,0.00023939168,0.00004484715,0.000015346312,0.00038678013,0.00009438711,0.008253619,0.00639292,0.96535194,0.019113878,0.00002443915],"about_ca_topic_score_codex":0.000834446,"about_ca_topic_score_gemma":0.0010963216,"teacher_disagreement_score":0.008326663,"about_ca_system_score_codex":0.0010770325,"about_ca_system_score_gemma":0.0006320773,"threshold_uncertainty_score":0.027855396},"labels":[],"label_agreement":null},{"id":"W2963943201","doi":"10.1016/j.tcs.2018.06.039","title":"Constructing de Bruijn sequences by concatenating smaller universal cycles","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Disjoint sets; De Bruijn graph; Set (abstract data type); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Computer science","score_opus":0.010244523004723291,"score_gpt":0.2417172559699828,"score_spread":0.23147273296525953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963943201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.28682733,0.0006326654,0.6785478,0.00053820806,0.00041393252,0.00028156687,0.00032637012,0.002259827,0.030172346],"genre_scores_gemma":[0.58148605,0.00048706934,0.40206197,0.00034081048,0.0001268252,0.00026829186,0.0005989464,0.0008268417,0.013803193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920577,0.00023966128,0.000071787945,0.00019906096,0.00015884348,0.00012485508],"domain_scores_gemma":[0.9979588,0.0009872675,0.00012558348,0.0006119519,0.00019066845,0.00012572392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006724406,0.0006854437,0.0007600594,0.0013960699,0.0008821826,0.0010687374,0.00081118307,0.00083137886,0.0064906674],"category_scores_gemma":[0.0039694957,0.0006643653,0.0007230076,0.0012478039,0.000984618,0.0023092907,0.0021127318,0.0012975131,0.0017862014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005881865,0.00033907226,0.0016381685,0.00055961224,0.00009176021,0.0005627661,0.0010674619,0.039975945,0.085540675,0.52435,0.0045732646,0.34071302],"study_design_scores_gemma":[0.00012113003,0.0004752062,0.0008266809,0.00024154731,0.00012727387,0.0007432434,0.00043240667,0.15501924,0.10916843,0.67447263,0.058241475,0.00013066227],"about_ca_topic_score_codex":0.0003683738,"about_ca_topic_score_gemma":0.0007995516,"teacher_disagreement_score":0.0064906674,"about_ca_system_score_codex":0.00044928503,"about_ca_system_score_gemma":0.0007617638,"threshold_uncertainty_score":0.021713495},"labels":[],"label_agreement":null},{"id":"W2963965013","doi":"10.1007/978-3-319-55589-8_11","title":"Constacyclic Codes over Finite Principal Ideal Rings","year":2017,"lang":"en","type":"book-chapter","venue":"Digital Kenyon (Kenyon College)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Principal ideal; Ideal (ethics); Ring (chemistry); Isomorphism (crystallography); Principal (computer security); Principal ideal ring; Dual (grammatical number); Discrete mathematics; Computer science; Mathematics; Combinatorics; Commutative ring; Crystallography","score_opus":0.017059826668799287,"score_gpt":0.23443577686962072,"score_spread":0.21737595020082143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963965013","genre_codex":"other","genre_gemma":"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.34385416,0.018774817,0.17007637,0.002591856,0.00087705994,0.0000730141,0.00030584342,0.00029025323,0.46315664],"genre_scores_gemma":[0.8888965,0.010606649,0.029608341,0.0002531993,0.00057867466,0.0000388972,0.00024851263,0.00006939838,0.069699764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998266,0.000027435743,0.0000080965965,0.0000397454,0.000063703745,0.000034451667],"domain_scores_gemma":[0.9995165,0.00022807873,0.000055694843,0.00007557037,0.00007477554,0.000049432667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026432856,0.00021909607,0.00019560567,0.00061679725,0.0007934693,0.0011890801,0.00029846083,0.0003129343,0.0039352295],"category_scores_gemma":[0.0009656179,0.0001426828,0.00022226798,0.00078396226,0.0016354931,0.002392623,0.00073614257,0.0010725188,0.0007346128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019398374,0.000008365525,0.00021160198,0.00008407791,0.00000199856,0.00009538112,0.00036782888,0.0010373809,0.0014944582,0.9757248,0.0012788267,0.019675901],"study_design_scores_gemma":[0.000008303683,0.00007522145,0.0006381682,0.00008846742,0.000009370325,0.0008002255,0.00031016362,0.0050795334,0.005219036,0.8860888,0.10166105,0.000021555517],"about_ca_topic_score_codex":0.00037842427,"about_ca_topic_score_gemma":0.0004479339,"teacher_disagreement_score":0.0039352295,"about_ca_system_score_codex":0.0006268459,"about_ca_system_score_gemma":0.00047721658,"threshold_uncertainty_score":0.0131646395},"labels":[],"label_agreement":null},{"id":"W2963971814","doi":"10.1016/j.ffa.2014.02.006","title":"On the inverses of some classes of permutations of finite fields","year":2014,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Class (philosophy); Algebra over a field; Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Computer science","score_opus":0.015100497092835462,"score_gpt":0.22195010277631844,"score_spread":0.20684960568348298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963971814","genre_codex":"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.7456042,0.0017652587,0.11115841,0.0030670583,0.00054378336,0.000096698,0.00035196825,0.00021696814,0.13719565],"genre_scores_gemma":[0.95804924,0.0014785222,0.013808004,0.00049434614,0.0008689372,0.000094043935,0.0004929521,0.00012438247,0.024589596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998865,0.0003101487,0.00006832401,0.00019362538,0.0002692887,0.00029359446],"domain_scores_gemma":[0.9959656,0.002560296,0.00044396886,0.0003208929,0.00029649088,0.0004127839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018201101,0.0007992656,0.00096888246,0.0030263586,0.0023724874,0.0043846234,0.0009905428,0.0017912323,0.0066984617],"category_scores_gemma":[0.005765517,0.00059815746,0.0016011923,0.0016499393,0.004766843,0.0061054444,0.0018655839,0.0034046422,0.00063651905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042714597,0.00003066719,0.00027370724,0.000016403288,0.0000038387925,0.000082700404,0.00018175921,0.0004955616,0.00044773016,0.99503195,0.00054601114,0.002846869],"study_design_scores_gemma":[0.000022750537,0.000026889591,0.0002713482,0.00002123222,0.000007212486,0.00023556038,0.00011755536,0.00457523,0.0004287581,0.9918339,0.0024442591,0.000015341755],"about_ca_topic_score_codex":0.0008888948,"about_ca_topic_score_gemma":0.0005406103,"teacher_disagreement_score":0.0066984617,"about_ca_system_score_codex":0.0015889836,"about_ca_system_score_gemma":0.0010333355,"threshold_uncertainty_score":0.022408605},"labels":[],"label_agreement":null},{"id":"W2964009544","doi":"","title":"Asymptotic bounds for spherical codes","year":2019,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hamming code; Mathematics; Cardinality (data modeling); Code (set theory); Unit square; Alphabet; Discrete mathematics; Hamming distance; Computability; Combinatorics; Set (abstract data type); Linear code; Block code; Algorithm; Computer science; Decoding methods","score_opus":0.008404612149608321,"score_gpt":0.21766901610359102,"score_spread":0.2092644039539827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964009544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.057259083,0.015376611,0.7903825,0.0046490645,0.0009020018,0.00009403977,0.0010299877,0.0014571161,0.12884954],"genre_scores_gemma":[0.85984045,0.014161878,0.09495688,0.0024782561,0.0025289855,0.0006526648,0.002589543,0.0011035542,0.021687757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572206,0.0011407633,0.00016438581,0.00047643154,0.001719501,0.0007768861],"domain_scores_gemma":[0.9671022,0.022601027,0.0013761064,0.0032033992,0.00456843,0.0011489249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004786682,0.0020167949,0.0016846868,0.0037313586,0.0015736499,0.004054207,0.0025572462,0.0017932268,0.00958634],"category_scores_gemma":[0.04977782,0.0006336621,0.0015938439,0.003019172,0.004058185,0.006779791,0.0058135153,0.005080789,0.0032200543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015766583,0.000032546173,0.00094842125,0.00025368473,0.000047089514,0.00013982892,0.00029078775,0.033405323,0.0023016362,0.93447256,0.0070073735,0.02094312],"study_design_scores_gemma":[0.000017763336,0.00007538089,0.0008162282,0.00021707451,0.000053059593,0.000335346,0.00013978263,0.16841806,0.00204483,0.8185307,0.00929077,0.000060917657],"about_ca_topic_score_codex":0.002639887,"about_ca_topic_score_gemma":0.0021238967,"teacher_disagreement_score":0.00958634,"about_ca_system_score_codex":0.0041516023,"about_ca_system_score_gemma":0.0018369762,"threshold_uncertainty_score":0.032069504},"labels":[],"label_agreement":null},{"id":"W2964083059","doi":"10.1007/s00200-019-00381-3","title":"On extremal double circulant self-dual codes of lengths 90–96","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science","keywords":"Circulant matrix; Dual (grammatical number); Mathematics; Code (set theory); Combinatorics; Discrete mathematics; Computer science","score_opus":0.006535158867155918,"score_gpt":0.20682669579713003,"score_spread":0.20029153692997412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964083059","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.77857494,0.000829098,0.095203854,0.0025963609,0.0006229492,0.00008061858,0.00041456698,0.00035312405,0.12132441],"genre_scores_gemma":[0.9741945,0.00028385204,0.010948629,0.0003997706,0.00033712396,0.0000626198,0.00020887108,0.00012472809,0.013439895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998765,0.00035057619,0.00004472507,0.00014257776,0.00036711278,0.00033006535],"domain_scores_gemma":[0.99711347,0.0013860872,0.00037360005,0.00033472784,0.00038801756,0.00040415104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012084836,0.0007547346,0.00082807324,0.0023942967,0.0022402809,0.002638997,0.0010787362,0.0014236469,0.0061101974],"category_scores_gemma":[0.0060546375,0.0004528914,0.0006314983,0.0009728353,0.003027511,0.002559417,0.002109749,0.0024792994,0.0008821447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009439971,0.000025544485,0.00018475375,0.000022786262,0.0000052101277,0.00010017403,0.00011192819,0.0025908204,0.0012961288,0.99162334,0.0010149931,0.0029299748],"study_design_scores_gemma":[0.000022835959,0.000024967014,0.00021940707,0.000029580546,0.000005013324,0.00017073008,0.00007428475,0.023491008,0.0012816759,0.9732771,0.0013735141,0.00002993614],"about_ca_topic_score_codex":0.0009938788,"about_ca_topic_score_gemma":0.0010605964,"teacher_disagreement_score":0.0061101974,"about_ca_system_score_codex":0.0014919093,"about_ca_system_score_gemma":0.0011911517,"threshold_uncertainty_score":0.020440638},"labels":[],"label_agreement":null},{"id":"W2964086002","doi":"10.1007/s10801-018-0812-8","title":"Construction and nonexistence of strong external difference families","year":2018,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lambda; Algebraic number; Combinatorics; Algebraic combinatorics; Range (aeronautics); Scope (computer science); Discrete mathematics; Character (mathematics); Mathematical analysis; Geometry; Physics; Quantum mechanics; Computer science","score_opus":0.010477650962763556,"score_gpt":0.2262110500473466,"score_spread":0.21573339908458303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964086002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5642278,0.00038653394,0.3210893,0.0017021694,0.0002742659,0.00009043313,0.00032910123,0.00043109836,0.111469276],"genre_scores_gemma":[0.9540042,0.00018676979,0.028693749,0.0002677947,0.00007796132,0.0000984385,0.00029749647,0.000117627074,0.01625596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840206,0.0003114466,0.0001163123,0.00038248664,0.00046527825,0.00032246424],"domain_scores_gemma":[0.99604106,0.001960856,0.0002668387,0.00066993485,0.0005654085,0.0004959516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016803456,0.00053151115,0.0008086475,0.001267542,0.0022791743,0.0029548416,0.0014308692,0.0011626568,0.005884744],"category_scores_gemma":[0.005464608,0.0008530774,0.00084118947,0.00087218755,0.0033118688,0.0058289086,0.007920859,0.0033191072,0.0008182122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055118035,0.000023845076,0.00050770235,0.000026641523,0.0000069285074,0.00008512174,0.00020394968,0.00031764797,0.002187053,0.99296534,0.00039861398,0.0032220846],"study_design_scores_gemma":[0.000041085914,0.000033499724,0.00030505232,0.000025104588,0.000020847734,0.00041390845,0.0001782493,0.003667433,0.005708408,0.9833055,0.0062777908,0.000023034474],"about_ca_topic_score_codex":0.00013954929,"about_ca_topic_score_gemma":0.00014817153,"teacher_disagreement_score":0.005884744,"about_ca_system_score_codex":0.0010688809,"about_ca_system_score_gemma":0.00054612727,"threshold_uncertainty_score":0.0196864},"labels":[],"label_agreement":null},{"id":"W2964100793","doi":"10.1016/j.ffa.2018.01.011","title":"A group action on multivariate polynomials over finite fields","year":2018,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Polynomial ring; Invariant (physics); Prime power; Invariant theory; Invariant polynomial; Prime (order theory); Action (physics); Polynomial; Finite group; Pure mathematics; Combinatorics; Group ring; Algebra over a field; Discrete mathematics; Group (periodic table); Matrix polynomial; Mathematical analysis","score_opus":0.029540127908605333,"score_gpt":0.2661090079301746,"score_spread":0.23656888002156928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964100793","genre_codex":"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.49245098,0.0043748934,0.2993565,0.006922453,0.0011322089,0.00008610434,0.0005533213,0.00034399785,0.19477957],"genre_scores_gemma":[0.95733273,0.0017152197,0.01634884,0.00042728145,0.00080711406,0.000037090387,0.00018411898,0.00006821153,0.023079412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991761,0.00018822352,0.00003184492,0.00019914637,0.00020086666,0.0002039215],"domain_scores_gemma":[0.9990133,0.00029007814,0.00021259155,0.00022622269,0.00011511627,0.00014257674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074088783,0.0004993746,0.00032747345,0.0010743405,0.0011168885,0.001474984,0.00039455944,0.0006057699,0.0081452895],"category_scores_gemma":[0.0020744158,0.00017611228,0.0006014085,0.0011396393,0.0035345694,0.0027001426,0.0019670124,0.0017416965,0.0009846418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037150177,0.000013406615,0.0003672677,0.00003698273,0.0000042975057,0.00008196335,0.00042210636,0.0008836881,0.0015869687,0.9846228,0.001177502,0.010765998],"study_design_scores_gemma":[0.000016245187,0.000076017364,0.0008417201,0.00003765283,0.000011319615,0.00036977575,0.00024489753,0.0044678138,0.0020929612,0.96618396,0.025636604,0.000021159385],"about_ca_topic_score_codex":0.00097611453,"about_ca_topic_score_gemma":0.00069634017,"teacher_disagreement_score":0.0081452895,"about_ca_system_score_codex":0.00088807405,"about_ca_system_score_gemma":0.0007370517,"threshold_uncertainty_score":0.02724874},"labels":[],"label_agreement":null},{"id":"W2964162826","doi":"10.1016/j.jnt.2015.09.008","title":"On the number of N-free elements with prescribed trace","year":2015,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; TRACE (psycholinguistics); Combinatorics","score_opus":0.02272514160561887,"score_gpt":0.2591571500289095,"score_spread":0.23643200842329062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964162826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.82328,0.0008313991,0.11707701,0.0052306955,0.0004067204,0.000079016994,0.0004906359,0.00038683641,0.05221781],"genre_scores_gemma":[0.977084,0.0003159288,0.01266393,0.00027771475,0.00028536588,0.00010416528,0.00025732638,0.00010524188,0.008906344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976947,0.00075360684,0.00014718948,0.00039763833,0.0005854293,0.00042142734],"domain_scores_gemma":[0.9757638,0.018076213,0.0014968716,0.0013654463,0.0011278385,0.0021697464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003486367,0.0009828607,0.0014570083,0.0028444875,0.002563091,0.0042395513,0.003324058,0.0024932541,0.006078389],"category_scores_gemma":[0.022223942,0.0007305225,0.0008179433,0.0017675093,0.008470853,0.008250424,0.0041469857,0.0027920336,0.0005951027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005613562,0.00007281374,0.0019037337,0.00008359195,0.000032880347,0.0001088414,0.0003421799,0.008300102,0.0024240876,0.9782178,0.0015397385,0.00641295],"study_design_scores_gemma":[0.00007657368,0.000055949193,0.0004888416,0.00003801638,0.000016665434,0.0001585996,0.000099153825,0.039096914,0.0015813021,0.95730454,0.0010525751,0.00003086992],"about_ca_topic_score_codex":0.0009622813,"about_ca_topic_score_gemma":0.00089608214,"teacher_disagreement_score":0.006078389,"about_ca_system_score_codex":0.002686982,"about_ca_system_score_gemma":0.0018625373,"threshold_uncertainty_score":0.020334244},"labels":[],"label_agreement":null},{"id":"W2966790914","doi":"10.5539/mas.v13n8p150","title":"The Possibility of Applying Rumen Research at the Projective Plane PG (2,17)","year":2019,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Paragraph; Projective plane; Set (abstract data type); Projection (relational algebra); Plane (geometry); Mathematics; Constraint (computer-aided design); Blocking (statistics); Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Geometry; Algorithm","score_opus":0.03448192112627413,"score_gpt":0.30444077740428416,"score_spread":0.26995885627801003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966790914","genre_codex":"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.16045718,0.0016014297,0.7540023,0.0017912016,0.0002700165,0.00012814405,0.0003095645,0.0006450617,0.08079506],"genre_scores_gemma":[0.6470404,0.0016479366,0.32151118,0.00042263808,0.00019034828,0.00013196652,0.00039247202,0.00026311513,0.02839992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892044,0.000367047,0.00004089946,0.00027295173,0.00023867881,0.0001600497],"domain_scores_gemma":[0.99807715,0.0007960293,0.00017767669,0.0006461919,0.00018548859,0.00011747061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010713929,0.0006599259,0.0005576108,0.0012772591,0.0015504712,0.0017367831,0.0011993062,0.00076297554,0.009027026],"category_scores_gemma":[0.0038832517,0.00041198236,0.0007165853,0.0010855513,0.0020905333,0.004016095,0.0020376514,0.002336665,0.0022328247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002996709,0.00009619801,0.0015734934,0.0002788997,0.000041127394,0.0002638543,0.00067327905,0.013362148,0.010407687,0.9081653,0.0020593577,0.06277901],"study_design_scores_gemma":[0.000064189146,0.00037241538,0.0010066745,0.00011279994,0.000071337425,0.00084135024,0.00045905774,0.061263744,0.054648403,0.81674975,0.06433074,0.00007961726],"about_ca_topic_score_codex":0.0010292728,"about_ca_topic_score_gemma":0.00095686584,"teacher_disagreement_score":0.009027026,"about_ca_system_score_codex":0.0009395051,"about_ca_system_score_gemma":0.0009522934,"threshold_uncertainty_score":0.030198455},"labels":[],"label_agreement":null},{"id":"W2967737995","doi":"10.1016/j.ffa.2020.101687","title":"Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables","year":2020,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond","keywords":"Mathematics; Polynomial ring; Ring (chemistry); Skew; Polynomial; Automorphism; Diagonal; Finite field; Pure mathematics; Field (mathematics); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.021477965358708686,"score_gpt":0.24511429906311336,"score_spread":0.22363633370440467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967737995","genre_codex":"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.9218352,0.0010806042,0.06455965,0.0006020976,0.00009386423,0.000041502597,0.00037447535,0.00018302377,0.011229596],"genre_scores_gemma":[0.98771125,0.0005737912,0.007169901,0.00007205988,0.0002686506,0.00002095139,0.00045848257,0.00003770988,0.0036872094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993938,0.00015697918,0.00004253726,0.00012640003,0.00015055004,0.00012970045],"domain_scores_gemma":[0.99752253,0.000889528,0.0008322248,0.0003067034,0.00016143448,0.00028742058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087777566,0.00036452644,0.0006454164,0.0017974473,0.00078856753,0.002276439,0.0006392112,0.00049395824,0.002912577],"category_scores_gemma":[0.0025613632,0.00022476155,0.00045233587,0.0020269668,0.002247705,0.003874088,0.0009184456,0.0011153882,0.00035202657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030447872,0.00012492576,0.010221233,0.0000903728,0.000018799266,0.00017655469,0.00041399073,0.006154435,0.004268087,0.92816246,0.0027354648,0.04732907],"study_design_scores_gemma":[0.000053139218,0.0001328675,0.0072623254,0.00005297124,0.00003240232,0.0006380728,0.00036362253,0.03719522,0.0045768283,0.9407874,0.008862981,0.000042219668],"about_ca_topic_score_codex":0.00025186353,"about_ca_topic_score_gemma":0.00017888173,"teacher_disagreement_score":0.002912577,"about_ca_system_score_codex":0.00065572135,"about_ca_system_score_gemma":0.0005323094,"threshold_uncertainty_score":0.009743571},"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":"W2971765372","doi":"","title":"Gray code for generating tree of permutation with three cycles","year":2015,"lang":"en","type":"article","venue":"ARPN Journal of Engineering and Applied Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gray code; Permutation (music); Gray (unit); Computer science; Tree (set theory); Algorithm; Mathematics; Combinatorics; Medicine; Physics","score_opus":0.025616388529559476,"score_gpt":0.23147420184914494,"score_spread":0.20585781331958547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971765372","genre_codex":"methods","genre_gemma":"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.33056,0.0005716788,0.6089441,0.0009406623,0.00036217028,0.00026849812,0.00083852187,0.0015438471,0.05597045],"genre_scores_gemma":[0.8755956,0.00030805005,0.10429988,0.00036597654,0.000071736395,0.00021418986,0.00066739245,0.00019245189,0.018284684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997801,0.000037958656,0.000009166191,0.000038715152,0.00007272285,0.000061389335],"domain_scores_gemma":[0.9996668,0.00009439224,0.00003317166,0.000083244406,0.00008335244,0.000039096467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016076825,0.000299457,0.00029210155,0.0007439733,0.0005913052,0.0006453838,0.00040923906,0.000670756,0.005169597],"category_scores_gemma":[0.0008245906,0.00014487536,0.0003337341,0.0007366455,0.0005032783,0.00053185754,0.0006868198,0.00061324215,0.00085537275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043946915,0.000119541575,0.0014563353,0.00020439309,0.000028300941,0.0011151627,0.00052022503,0.027405733,0.06403707,0.7433402,0.010988987,0.15034454],"study_design_scores_gemma":[0.0001794085,0.00037140498,0.0025014693,0.00014711595,0.000086066444,0.0018933157,0.00019202565,0.2880632,0.06923034,0.601892,0.035317898,0.00012577194],"about_ca_topic_score_codex":0.0012228511,"about_ca_topic_score_gemma":0.0010531629,"teacher_disagreement_score":0.005169597,"about_ca_system_score_codex":0.00059654855,"about_ca_system_score_gemma":0.0009131852,"threshold_uncertainty_score":0.01729405},"labels":[],"label_agreement":null},{"id":"W2972280902","doi":"10.1109/tit.2019.2939113","title":"On Inverses of Permutation Polynomials of Small Degree Over Finite Fields","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Dongguan University of Technology; Guangdong Polytechnic of Science and Technology; China Postdoctoral Science Foundation; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China; Peng Cheng Laboratory; National Science Foundation","keywords":"Finite field; Degree (music); Permutation (music); Inverse; Coding theory; Binomial (polynomial); Class (philosophy); Discrete orthogonal polynomials; Generalized permutation matrix","score_opus":0.015786315832481093,"score_gpt":0.2181984177347041,"score_spread":0.20241210190222303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972280902","genre_codex":"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.5341305,0.0042989533,0.25487727,0.0019356521,0.00062286505,0.00011693615,0.00018280452,0.00023949503,0.20359556],"genre_scores_gemma":[0.94899315,0.0032678293,0.02484399,0.000319488,0.00089735084,0.00007469417,0.0001953477,0.00011037115,0.021297775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989833,0.00019443758,0.00005349344,0.00014071619,0.0003845054,0.00024348337],"domain_scores_gemma":[0.99794656,0.0012878657,0.00020077452,0.0001762173,0.00023845817,0.00015016622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043547,0.0005839101,0.00047071895,0.0019470452,0.0011503159,0.0019454706,0.00039569396,0.00065353676,0.0034702173],"category_scores_gemma":[0.005258243,0.00039174798,0.0007957383,0.0011146198,0.0033605224,0.0038670795,0.0017695567,0.0029836642,0.0007097725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003456284,0.000023357501,0.00035414766,0.00003703302,0.0000022706706,0.0002095298,0.00030974828,0.0011666657,0.0017648344,0.98442554,0.00057877484,0.011093606],"study_design_scores_gemma":[0.000017440498,0.000057150573,0.00046147167,0.000037139253,0.000008044591,0.0005805685,0.00015437395,0.0065028863,0.0024293081,0.9795741,0.010152466,0.000025184278],"about_ca_topic_score_codex":0.00071742135,"about_ca_topic_score_gemma":0.00047563532,"teacher_disagreement_score":0.0034702173,"about_ca_system_score_codex":0.0008974903,"about_ca_system_score_gemma":0.00053725485,"threshold_uncertainty_score":0.011609018},"labels":[],"label_agreement":null},{"id":"W2975353307","doi":"10.1109/isit.2019.8849456","title":"Improved Soft Decoding of Reed-Solomon Codes on Gilbert-Elliott Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"List decoding; Decoding methods; Reed–Solomon error correction; Sequential decoding; Algorithm; Berlekamp–Welch algorithm; Concatenated error correction code; Computer science; Block code; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.011934839004199567,"score_gpt":0.22933247536351012,"score_spread":0.21739763635931056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975353307","genre_codex":"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.45079112,0.00042604282,0.54257774,0.00035101507,0.00005725965,0.000085499894,0.00010102714,0.00077855634,0.004831742],"genre_scores_gemma":[0.9392606,0.00020337538,0.059086643,0.00007023862,0.000018601835,0.000033907116,0.00004153931,0.00002458268,0.0012604969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986284,0.0006146309,0.000062057225,0.000089371606,0.0004215471,0.00018403737],"domain_scores_gemma":[0.9941146,0.004133706,0.00046255905,0.0005707948,0.00058596814,0.00013244642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015273271,0.00071527506,0.0005520957,0.0009964254,0.00046063904,0.0009838588,0.0007036381,0.0006676469,0.0006923846],"category_scores_gemma":[0.008564049,0.00029508202,0.0003227308,0.00074192893,0.0012299446,0.0012033214,0.0011599471,0.0007641292,0.00022956188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087868894,0.00007257928,0.0020188,0.00014208246,0.00005351844,0.00030477476,0.00038781055,0.825077,0.030716356,0.09475702,0.00062613416,0.04496526],"study_design_scores_gemma":[0.000043657303,0.00012002181,0.0002524941,0.000016484211,0.000016735978,0.00006277856,0.00002746508,0.9585078,0.02400694,0.01648331,0.00043662445,0.000025799753],"about_ca_topic_score_codex":0.0021551114,"about_ca_topic_score_gemma":0.0020852685,"teacher_disagreement_score":0.0021551114,"about_ca_system_score_codex":0.0012268733,"about_ca_system_score_gemma":0.0013899065,"threshold_uncertainty_score":0.008901596},"labels":[],"label_agreement":null},{"id":"W2979325266","doi":"10.1515/jmc-2019-0048","title":"On the equivalence of authentication codes and robust (2, 2)-threshold schemes","year":2020,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Equivalence (formal languages); Authentication (law); Computer science; Secret sharing; Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Cryptography","score_opus":0.062021590250013615,"score_gpt":0.2836574490103651,"score_spread":0.2216358587603515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979325266","genre_codex":"methods","genre_gemma":"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.28035238,0.0006834266,0.6368698,0.0027365442,0.00039403045,0.00019017169,0.00029356708,0.0002698433,0.07821025],"genre_scores_gemma":[0.9615352,0.00027748052,0.031582125,0.00052322523,0.00021254283,0.0000973118,0.00011842037,0.000055120134,0.005598743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952886,0.001521262,0.00024927422,0.0007612801,0.0015823315,0.00059721695],"domain_scores_gemma":[0.9898595,0.005733398,0.0010218981,0.0018450121,0.0011587885,0.00038140392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027126714,0.0003752334,0.0004785994,0.0011613198,0.001183017,0.0025589387,0.0008262537,0.0017483725,0.0068492736],"category_scores_gemma":[0.012457945,0.00033614313,0.00085037405,0.0009685917,0.0050518527,0.0059579783,0.0044457642,0.0035424968,0.00068528915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040197272,0.00001764617,0.0001584718,0.000017331948,0.000005046406,0.00005546467,0.00021144822,0.0017745182,0.0012637553,0.99157506,0.0003754135,0.004505785],"study_design_scores_gemma":[0.000021257087,0.000055206983,0.00019113706,0.000021776586,0.000007944344,0.0001586929,0.000064882064,0.017368974,0.002008235,0.97712517,0.0029579522,0.000018804236],"about_ca_topic_score_codex":0.00043007347,"about_ca_topic_score_gemma":0.0001615974,"teacher_disagreement_score":0.0068492736,"about_ca_system_score_codex":0.0012375996,"about_ca_system_score_gemma":0.00080438016,"threshold_uncertainty_score":0.022913039},"labels":[],"label_agreement":null},{"id":"W2979569747","doi":"10.1109/tit.2020.2977319","title":"On the Weights of General MDS Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Code word; Discrete mathematics; Binary number; Mathematical proof; Linear code; Binary code; Block code; Arithmetic; Algorithm; Decoding methods","score_opus":0.0161087276406441,"score_gpt":0.22740331890276427,"score_spread":0.21129459126212016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979569747","genre_codex":"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.7705175,0.0011388416,0.17764309,0.0005823649,0.000121111814,0.00005597059,0.00042686524,0.00016845479,0.049345702],"genre_scores_gemma":[0.97293866,0.0008049195,0.018031353,0.00009019448,0.000116763076,0.00006265393,0.0002245766,0.000100965066,0.0076299706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926764,0.0001313917,0.00004079589,0.00012485878,0.0002733671,0.00016202767],"domain_scores_gemma":[0.99841547,0.00073992985,0.00022580006,0.00020155293,0.00025271054,0.00016454083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061564875,0.00078526506,0.00044915808,0.0019674816,0.0009390259,0.0017355839,0.00065769785,0.00068868685,0.0038688506],"category_scores_gemma":[0.0047127386,0.00041313216,0.0003377744,0.0014506881,0.0018256988,0.0025344363,0.0016790959,0.0012145749,0.0007436742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015150866,0.000028438302,0.00060819427,0.00006587122,0.000008978231,0.00019117488,0.0002439802,0.013424378,0.008949048,0.95932806,0.0007860968,0.01621413],"study_design_scores_gemma":[0.000019001553,0.00003121443,0.00040645478,0.00004820815,0.0000071067698,0.00024126707,0.00012190934,0.04371166,0.004095839,0.9482729,0.0030183762,0.000026106414],"about_ca_topic_score_codex":0.0005038886,"about_ca_topic_score_gemma":0.00034935967,"teacher_disagreement_score":0.0038688506,"about_ca_system_score_codex":0.0008675556,"about_ca_system_score_gemma":0.00044561733,"threshold_uncertainty_score":0.012942612},"labels":[],"label_agreement":null},{"id":"W2980330807","doi":"10.1016/j.jcta.2020.105337","title":"An analogue of Ruzsa's conjecture for polynomials over finite fields","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Conjecture; Polynomial; Field (mathematics); Combinatorics; Ring (chemistry); Physics; Mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis; Chemistry","score_opus":0.01710372350876875,"score_gpt":0.2712803088292093,"score_spread":0.2541765853204405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980330807","genre_codex":"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.3707481,0.003449327,0.08394377,0.047809366,0.003635039,0.00012964227,0.0014768834,0.00077719445,0.48803067],"genre_scores_gemma":[0.9602217,0.0012803259,0.009280508,0.0023174135,0.0023505257,0.00006504723,0.0006358257,0.00013591441,0.023712814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771476,0.00060949154,0.00012912,0.00055512326,0.0005139031,0.000477599],"domain_scores_gemma":[0.99390936,0.003594822,0.00046875014,0.0010799638,0.00062638003,0.00032074112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022664012,0.0008586191,0.0024371035,0.002457016,0.0028674612,0.005216173,0.0021527389,0.0042421287,0.017713884],"category_scores_gemma":[0.0109925615,0.0007242413,0.0018435558,0.0029918586,0.0062430482,0.012574719,0.0037456874,0.005863498,0.0018050625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012438519,0.00003931022,0.00032323762,0.000095951735,0.000012847422,0.00012475131,0.00018702832,0.0010515307,0.00038253565,0.98869276,0.0047875866,0.00417812],"study_design_scores_gemma":[0.000037235266,0.0000127557905,0.00020058807,0.00001999413,0.000010264552,0.00009398344,0.00006372886,0.0027792824,0.00018140246,0.9933981,0.0031897982,0.000012836124],"about_ca_topic_score_codex":0.0017743398,"about_ca_topic_score_gemma":0.0012841497,"teacher_disagreement_score":0.017713884,"about_ca_system_score_codex":0.002265516,"about_ca_system_score_gemma":0.00089508836,"threshold_uncertainty_score":0.05925882},"labels":[],"label_agreement":null},{"id":"W2981927247","doi":"10.4153/s0008414x21000377","title":"Combinatorics of the geometry of Wilson loop diagrams II: Grassmann necklaces, dimensions, and denominators","year":2021,"lang":"en","type":"preprint","venue":"Canadian Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diagram; Propagator; Grassmannian; Ideal (ethics); Loop (graph theory); Necklace; Mathematics; Feynman diagram; Dimension (graph theory); Product (mathematics); Scattering amplitude; Quadric; Pure mathematics; Mathematical physics; Combinatorics; Geometry; Scattering; Physics; Quantum mechanics","score_opus":0.012604360739530116,"score_gpt":0.20501290667547445,"score_spread":0.19240854593594434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981927247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.900444,0.00019845057,0.071328185,0.00034146188,0.0000572436,0.000048539085,0.00014053396,0.00020456544,0.02723711],"genre_scores_gemma":[0.98082924,0.000112268935,0.012204525,0.000048002385,0.00006904667,0.00002807896,0.00010197734,0.00007455494,0.0065321354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942553,0.00011930396,0.000037651265,0.00011866771,0.00017854715,0.00012024781],"domain_scores_gemma":[0.9988674,0.00030930084,0.0002474317,0.00013684023,0.00015076189,0.00028835537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063018576,0.00036572473,0.0005058219,0.0021828827,0.00117543,0.00296742,0.0006581343,0.00053008826,0.0043600323],"category_scores_gemma":[0.0015197572,0.0003060624,0.00045302458,0.0007739581,0.0026620873,0.0032344593,0.001537748,0.00094163086,0.00045593525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006270026,0.000030490772,0.00082735904,0.00002871191,0.0000035796072,0.00029269117,0.0003604155,0.0014704375,0.005111111,0.9873361,0.00048633196,0.0039900327],"study_design_scores_gemma":[0.000032537668,0.00005509261,0.0008884961,0.000020709913,0.000009662551,0.00057262584,0.00029523182,0.011374052,0.0057574497,0.97615594,0.004806024,0.000032266053],"about_ca_topic_score_codex":0.00055718125,"about_ca_topic_score_gemma":0.00060884,"teacher_disagreement_score":0.0043600323,"about_ca_system_score_codex":0.0010394051,"about_ca_system_score_gemma":0.00038540154,"threshold_uncertainty_score":0.014585733},"labels":[],"label_agreement":null},{"id":"W2982529634","doi":"10.1515/jmc-2019-0048","title":"On the equivalence of authentication codes and robust (2, 2)-threshold schemes","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Equivalence (formal languages); Authentication (law); Mathematics; Computer science; Theoretical computer science; Key (lock); Discrete mathematics; Computer security","score_opus":0.3196056766571743,"score_gpt":0.49898679185062084,"score_spread":0.17938111519344652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982529634","genre_codex":"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.13632534,0.0009792708,0.7806786,0.0026263795,0.00038811998,0.00017652387,0.000305355,0.00024675598,0.07827376],"genre_scores_gemma":[0.9276238,0.0007955946,0.060192008,0.0009125365,0.00042098854,0.00018402276,0.0002203336,0.000107682186,0.00954299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944959,0.0016215665,0.0002892841,0.00097638235,0.0018600626,0.0007567265],"domain_scores_gemma":[0.9876886,0.0074164676,0.001171406,0.002147251,0.001180718,0.00039551963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032713742,0.000523154,0.00056141184,0.0012308002,0.0014004236,0.0024958265,0.0008890002,0.0017972807,0.007470834],"category_scores_gemma":[0.015292906,0.00039103773,0.0009883582,0.0012301854,0.005429737,0.0075864363,0.004726579,0.00417113,0.0009054362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027330054,0.000013723241,0.00011149518,0.000020364083,0.0000046816713,0.0000444399,0.0002037402,0.0014732413,0.00088298676,0.9924385,0.0003328409,0.0044466504],"study_design_scores_gemma":[0.000016349237,0.00006011558,0.00017247193,0.000025921654,0.000009093604,0.00017176368,0.00006099178,0.01297974,0.0013953157,0.9817696,0.003318679,0.000019863697],"about_ca_topic_score_codex":0.00051830494,"about_ca_topic_score_gemma":0.00020047247,"teacher_disagreement_score":0.007470834,"about_ca_system_score_codex":0.0014386148,"about_ca_system_score_gemma":0.0009896429,"threshold_uncertainty_score":0.024992466},"labels":[],"label_agreement":null},{"id":"W2984571407","doi":"10.33693/2313-223x-2019-6-2-85-89","title":"ON A CONSTRUCTION METHOD FOR PERMUTATIONS OVER FINITE FIELDS","year":2019,"lang":"en","type":"article","venue":"Computational nanotechnology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Finite field; Dimension (graph theory); Mathematics; Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.009436795283932415,"score_gpt":0.27141265576806706,"score_spread":0.2619758604841346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984571407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.015557647,0.00037184835,0.9728572,0.000403119,0.00021367928,0.00007160329,0.000039269733,0.00035876498,0.010126823],"genre_scores_gemma":[0.16056593,0.0010463943,0.8213899,0.00024920312,0.00028589703,0.00024416897,0.00013070546,0.00040173784,0.015686074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930644,0.00025303397,0.000036622798,0.000109959336,0.00023567237,0.000058344074],"domain_scores_gemma":[0.9992692,0.0003454142,0.00004061463,0.00022408545,0.00007592481,0.000044815424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000934539,0.00054332544,0.00046787297,0.0012924105,0.001624783,0.0011282751,0.00082529965,0.00087559037,0.004492816],"category_scores_gemma":[0.0018537439,0.0003928952,0.0011324411,0.00092064816,0.0027333251,0.0036117123,0.0019630454,0.0016925522,0.0013077242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041055355,0.000036265934,0.00025165,0.00011560559,0.000013339162,0.00012112185,0.0002654739,0.006344038,0.006073937,0.93760026,0.0012908013,0.047846526],"study_design_scores_gemma":[0.000046732344,0.00013021541,0.00015937598,0.00007400963,0.000030125919,0.0005583901,0.00007968901,0.052723277,0.013230197,0.8869393,0.045971986,0.00005670561],"about_ca_topic_score_codex":0.00031044768,"about_ca_topic_score_gemma":0.0004183474,"teacher_disagreement_score":0.004492816,"about_ca_system_score_codex":0.0006297226,"about_ca_system_score_gemma":0.0007260588,"threshold_uncertainty_score":0.015029967},"labels":[],"label_agreement":null},{"id":"W2986162624","doi":"10.13069/jacodesmath.645015","title":"Construction of quasi-twisted codes and enumeration of defining polynomials","year":2019,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Enumeration; Hamming code; Combinatorics; Mathematics; Linear code; Minimum distance; Hamming distance; Code (set theory); Finite field; Discrete mathematics; Block code; Algorithm; Computer science; Decoding methods","score_opus":0.004648419889312304,"score_gpt":0.22453174188112726,"score_spread":0.21988332199181496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986162624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.60544574,0.0003570876,0.36472112,0.00044341883,0.00012751909,0.00012581848,0.00062155584,0.0004952968,0.02766244],"genre_scores_gemma":[0.8612135,0.00035892482,0.12902297,0.0001229179,0.00004647732,0.00013438454,0.00077079085,0.00012896892,0.008200958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939585,0.00015336457,0.0000507079,0.00007828271,0.00017476008,0.00014702862],"domain_scores_gemma":[0.99892646,0.0003616945,0.00013119397,0.0002427156,0.00018779878,0.00015007949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039225785,0.00040189648,0.00042204035,0.0010473422,0.0008264324,0.0011516195,0.0007710841,0.000480893,0.0031199167],"category_scores_gemma":[0.0018176957,0.0003094002,0.0004407556,0.0010506565,0.0011020714,0.0014447268,0.0015853908,0.0010055553,0.0008224961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017901306,0.00007733217,0.0023935128,0.00016101982,0.000012341575,0.00034350404,0.00060980435,0.014170577,0.031271435,0.8896823,0.0020238645,0.05907539],"study_design_scores_gemma":[0.000052586718,0.00026361828,0.0014276126,0.00011331725,0.000031514963,0.0014750905,0.00041168582,0.15715936,0.06747374,0.75522953,0.016246242,0.00011573023],"about_ca_topic_score_codex":0.00040457133,"about_ca_topic_score_gemma":0.0006011672,"teacher_disagreement_score":0.0031199167,"about_ca_system_score_codex":0.00071211846,"about_ca_system_score_gemma":0.0008878802,"threshold_uncertainty_score":0.010437131},"labels":[],"label_agreement":null},{"id":"W2988233485","doi":"10.1587/elex.16.20190600","title":"Novel bit-serial semi-systolic array structure for simultaneously computing field multiplication and squaring","year":2019,"lang":"en","type":"article","venue":"IEICE Electronics Express","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deanship of Scientific Research, Prince Sattam bin Abdulaziz University; Prince Sattam bin Abdulaziz University","keywords":"Multiplication (music); Systolic array; Computer science; Bit (key); Arithmetic; Parallel computing; Field (mathematics); Mathematics; Embedded system; Very-large-scale integration; Computer network; Combinatorics","score_opus":0.006169500513034223,"score_gpt":0.22789496363776854,"score_spread":0.22172546312473432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988233485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.057913296,0.00044914806,0.9309828,0.00012360598,0.00017092898,0.000078659614,0.00016095897,0.0020190983,0.008101395],"genre_scores_gemma":[0.34206825,0.00044824329,0.6478364,0.0001888018,0.00012993309,0.00014677056,0.0006201312,0.00010118369,0.008460247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998932,0.000018853269,0.000011693808,0.000018431467,0.00004673849,0.0000110820165],"domain_scores_gemma":[0.9997899,0.000039457558,0.00003177354,0.000033586086,0.00009023488,0.000014999112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015047283,0.00033764302,0.00019403915,0.00040710365,0.00020425358,0.00040275216,0.00081201986,0.00022984919,0.002966193],"category_scores_gemma":[0.00033699154,0.00013506848,0.00020519893,0.00054749625,0.0001633357,0.0005508623,0.00026789473,0.00027571435,0.0013169302],"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.0004796265,0.00018770051,0.0016968226,0.00036795286,0.00007425912,0.00039516223,0.00015159063,0.041423254,0.4205217,0.034940723,0.006151902,0.49360937],"study_design_scores_gemma":[0.00017147962,0.002506601,0.0021241147,0.00006891329,0.000107027736,0.0014529303,0.00007873777,0.6428071,0.28173277,0.01323123,0.05565612,0.0000628823],"about_ca_topic_score_codex":0.000269603,"about_ca_topic_score_gemma":0.0007792881,"teacher_disagreement_score":0.002966193,"about_ca_system_score_codex":0.00021721964,"about_ca_system_score_gemma":0.00063358597,"threshold_uncertainty_score":0.009922922},"labels":[],"label_agreement":null},{"id":"W2991341770","doi":"10.3934/amc.2020047","title":"A construction of $ \\mathbb{F}_2 $-linear cyclic, MDS codes","year":2019,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Generator matrix; Combinatorics; Logarithm; Separable space; Partition (number theory); Dimension (graph theory); Prime (order theory); Parity (physics); Linear code; Discrete mathematics; Matrix (chemical analysis); Block code; Algorithm; Mathematical analysis","score_opus":0.014686634800500595,"score_gpt":0.29866985212177943,"score_spread":0.28398321732127885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991341770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.27656332,0.0008624311,0.67760205,0.00092282874,0.00023733823,0.00021632841,0.00075522566,0.0011440882,0.04169636],"genre_scores_gemma":[0.67868966,0.00047508324,0.30112454,0.00037902922,0.000095269716,0.00021448506,0.0005800604,0.00012205104,0.018319901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978644,0.000045374,0.000010015627,0.000034101307,0.00007838265,0.000045723722],"domain_scores_gemma":[0.9997249,0.00007187526,0.00004455577,0.00006842803,0.000050829483,0.000039348353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016233455,0.00040060515,0.00026001013,0.00066376757,0.00057154556,0.00042474893,0.0003417023,0.00036738234,0.0025157556],"category_scores_gemma":[0.0007412081,0.00021133333,0.00026105935,0.0005790126,0.0007570765,0.00045104788,0.0010437503,0.00057761424,0.0007545577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027177014,0.000092531205,0.0012814107,0.0002920797,0.000030318797,0.00047576684,0.0005057289,0.038086403,0.078718424,0.7123143,0.006950408,0.16098087],"study_design_scores_gemma":[0.00021104475,0.0006455435,0.002245586,0.0001709138,0.000055297307,0.002033771,0.00020975896,0.2443778,0.1909288,0.4478878,0.11104067,0.00019295026],"about_ca_topic_score_codex":0.0007800154,"about_ca_topic_score_gemma":0.0010336722,"teacher_disagreement_score":0.0025157556,"about_ca_system_score_codex":0.00057065964,"about_ca_system_score_gemma":0.00087513746,"threshold_uncertainty_score":0.008416057},"labels":[],"label_agreement":null},{"id":"W2995380196","doi":"10.1145/3377006.3377021","title":"New bivariate Hensel lifting algorithm for <i>n</i> factors","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital","funders":"","keywords":"Monic polynomial; Bivariate analysis; Univariate; Mathematics; Bounded function; Degree (music); Polynomial; Algorithm; Combinatorics; Finite field; Field (mathematics); Applied mathematics; Pure mathematics; Mathematical analysis; Multivariate statistics; Physics; Statistics","score_opus":0.03193140114877477,"score_gpt":0.28122522502960706,"score_spread":0.2492938238808323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995380196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.030179227,0.00016443437,0.95779556,0.00018645388,0.00011386495,0.000120450386,0.00027818794,0.005317139,0.0058447435],"genre_scores_gemma":[0.2047127,0.00025398808,0.7838983,0.0001325918,0.00011106198,0.00014269809,0.0012223216,0.00058380974,0.008942559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950206,0.000038189966,0.000040067574,0.000114394286,0.00017047836,0.00013479686],"domain_scores_gemma":[0.9995683,0.00005882471,0.00003304264,0.00017450476,0.00012171804,0.000043732576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001479,0.0006951613,0.00060681236,0.0010627761,0.0007206653,0.0009319853,0.00085333886,0.00040273028,0.009876087],"category_scores_gemma":[0.0011805361,0.00034354685,0.0009382282,0.000923057,0.0005589102,0.0014828361,0.0020340707,0.0010204216,0.0038442817],"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.00044427754,0.00017032224,0.002189605,0.00027776073,0.00005582395,0.0004452782,0.00037589416,0.011359646,0.05172507,0.047197636,0.015774691,0.86998403],"study_design_scores_gemma":[0.00043512977,0.0008464604,0.0036241435,0.00017628966,0.00023255064,0.00241374,0.0007345509,0.4508897,0.25026843,0.13972948,0.15040022,0.00024937507],"about_ca_topic_score_codex":0.0019851415,"about_ca_topic_score_gemma":0.0019162537,"teacher_disagreement_score":0.009876087,"about_ca_system_score_codex":0.00048723436,"about_ca_system_score_gemma":0.0011643803,"threshold_uncertainty_score":0.033038855},"labels":[],"label_agreement":null},{"id":"W2996211895","doi":"10.1109/tit.2020.3005544","title":"On the Algebraic Combinatorics of Injections and its Applications to Injection Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Combinatorics; Set (abstract data type); Algebraic number; Mathematics; Algebraic combinatorics; Element (criminal law); Enumerative combinatorics; Discrete mathematics; Combinatorial proof; Extremal combinatorics; Computer science","score_opus":0.017538525243185533,"score_gpt":0.23840092839491958,"score_spread":0.22086240315173405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996211895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.10305137,0.0014411836,0.7968641,0.003715185,0.00040494496,0.00014779951,0.0004450832,0.00067081273,0.09325955],"genre_scores_gemma":[0.76484644,0.0038039985,0.19349493,0.0017493521,0.0012629421,0.0005678277,0.0011091105,0.00083778845,0.032327574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970004,0.0007579221,0.0001755245,0.000497434,0.0010488452,0.000519809],"domain_scores_gemma":[0.98925155,0.007123384,0.00094702,0.0009260674,0.0010513703,0.0007006946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002425009,0.0017421484,0.0011804511,0.0033423842,0.0019202618,0.0048328214,0.0020091552,0.0015001949,0.009405754],"category_scores_gemma":[0.011959029,0.0006963322,0.001970935,0.0034229823,0.0058766236,0.009303462,0.0051414473,0.0056307106,0.002294212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004207395,0.000046415713,0.00039115467,0.00006128546,0.000008281375,0.00008791916,0.0001872124,0.008994259,0.00093349454,0.97677773,0.0012088943,0.011261345],"study_design_scores_gemma":[0.000010176499,0.000037108683,0.00015533826,0.00003272366,0.000010119362,0.00012256118,0.00007682471,0.026546564,0.0018365016,0.9671692,0.0039758803,0.000026941712],"about_ca_topic_score_codex":0.0024475115,"about_ca_topic_score_gemma":0.00199344,"teacher_disagreement_score":0.009405754,"about_ca_system_score_codex":0.003384996,"about_ca_system_score_gemma":0.0016323001,"threshold_uncertainty_score":0.03146541},"labels":[],"label_agreement":null},{"id":"W2996314380","doi":"10.4153/s0008439522000546","title":"The shape of cyclic number fields","year":2022,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discriminant; TRACE (psycholinguistics); Zero (linguistics); Matrix (chemical analysis); Algebraic number field; Degree (music); Combinatorics; Field (mathematics); Gramian matrix; Prime (order theory); Discrete mathematics; Pure mathematics; Eigenvalues and eigenvectors; Physics","score_opus":0.008504844339050781,"score_gpt":0.20587415917286053,"score_spread":0.19736931483380976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996314380","genre_codex":"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.91100836,0.0003878777,0.030683229,0.0009191582,0.00012371066,0.000051666568,0.00024645167,0.0002464169,0.05633309],"genre_scores_gemma":[0.991666,0.00009204663,0.0038548156,0.00008091363,0.00005925049,0.00001804181,0.00008688999,0.000032699543,0.004109457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946266,0.00012156262,0.000017820155,0.000064484004,0.00021930155,0.00011403894],"domain_scores_gemma":[0.9985532,0.00039806496,0.00027532937,0.00026868653,0.00024673378,0.00025797548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004427322,0.00019042622,0.00021776897,0.0012167599,0.00064537855,0.0013844953,0.00037288785,0.0005091769,0.0038692805],"category_scores_gemma":[0.0034330054,0.00019850873,0.00017640974,0.0007352746,0.0019810314,0.0014408297,0.0008458017,0.0005821274,0.0005362917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030509412,0.000037603186,0.0017032776,0.00004732843,0.000004910939,0.00022806822,0.00062698976,0.0039342404,0.012668693,0.9597789,0.0016658003,0.018999094],"study_design_scores_gemma":[0.000071984374,0.0001867804,0.0025419907,0.000049457154,0.000010878581,0.0006884605,0.00058801373,0.029950703,0.012683564,0.9372315,0.015935972,0.00006070311],"about_ca_topic_score_codex":0.0006001004,"about_ca_topic_score_gemma":0.00043232826,"teacher_disagreement_score":0.0038692805,"about_ca_system_score_codex":0.00084140355,"about_ca_system_score_gemma":0.0005232031,"threshold_uncertainty_score":0.012944102},"labels":[],"label_agreement":null},{"id":"W2996993513","doi":"","title":"Creepers: Real quadratic orders with large class number","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Fraction (chemistry); Combinatorics; Sequence (biology); Quadratic equation; Period (music); Class (philosophy); Continued fraction; Constant (computer programming); Genus; Exponential function; Arithmetic; Discrete mathematics; Geometry; Mathematical analysis; Computer science; Physics; Remainder","score_opus":0.007218629376710863,"score_gpt":0.2422814144611492,"score_spread":0.23506278508443834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996993513","genre_codex":"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.6025507,0.004801298,0.11256832,0.020206818,0.0014491614,0.00017029475,0.0013077232,0.0015793383,0.25536638],"genre_scores_gemma":[0.94241613,0.0009776991,0.0070214304,0.00063008966,0.0006588199,0.000068972695,0.0003993107,0.00020941498,0.047618195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904746,0.00020693496,0.000038670805,0.00015573564,0.000319426,0.00023171793],"domain_scores_gemma":[0.99388605,0.0034814824,0.0006773661,0.0005940044,0.00046131667,0.0008997573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011496498,0.00049135805,0.0006371745,0.0016337578,0.002066464,0.003486397,0.0008389689,0.0010377928,0.022865983],"category_scores_gemma":[0.011037738,0.0004530315,0.00056469894,0.0013763786,0.0031297526,0.0056308955,0.0024402102,0.0042425157,0.0024050109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016201523,0.00003525757,0.0012757087,0.0001000896,0.000012413819,0.00056753744,0.00042559524,0.0032751819,0.00093243376,0.96856546,0.0125218425,0.012126498],"study_design_scores_gemma":[0.000052251435,0.000032691158,0.0012078452,0.000042464846,0.000008852843,0.00048583615,0.0001484534,0.01650051,0.0005673701,0.9659165,0.01500377,0.00003347822],"about_ca_topic_score_codex":0.0022599914,"about_ca_topic_score_gemma":0.003031215,"teacher_disagreement_score":0.022865983,"about_ca_system_score_codex":0.0027957123,"about_ca_system_score_gemma":0.0011075494,"threshold_uncertainty_score":0.076494336},"labels":[],"label_agreement":null},{"id":"W2997631494","doi":"10.1137/1.9781611975994.84","title":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"UK Research and Innovation","keywords":"Constant (computer programming); Block (permutation group theory); Mathematics; Computer science; Algorithm; Combinatorics","score_opus":0.054141402275741435,"score_gpt":0.22390022182503222,"score_spread":0.16975881954929078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997631494","genre_codex":"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.17335579,0.0020135303,0.80407995,0.002676732,0.0001783701,0.00032892684,0.0016701191,0.0034789024,0.012217683],"genre_scores_gemma":[0.7319519,0.0009868128,0.25388715,0.0012304418,0.00020656115,0.0005004965,0.0018328975,0.00068730314,0.008716444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99431914,0.0010563602,0.00040161994,0.0012802953,0.0019505266,0.0009920945],"domain_scores_gemma":[0.9706358,0.015820542,0.0021353515,0.008322834,0.0024610583,0.0006244338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021473314,0.0012138359,0.0015976422,0.00057994656,0.0011091057,0.0023960685,0.0028285582,0.0018261612,0.004371942],"category_scores_gemma":[0.026244516,0.00064493925,0.0009852584,0.0015555857,0.0026104592,0.006070783,0.0037863872,0.0047006137,0.0019366893],"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.0025359967,0.0003580673,0.004205201,0.001038388,0.00014880628,0.00063347333,0.001441017,0.5004339,0.040478405,0.29689276,0.017967049,0.13386686],"study_design_scores_gemma":[0.00025419996,0.00043357816,0.0005581719,0.0001156885,0.00009000211,0.0006106914,0.00021345155,0.72093564,0.023058081,0.24635275,0.0072694714,0.00010830505],"about_ca_topic_score_codex":0.0044004996,"about_ca_topic_score_gemma":0.0052488404,"teacher_disagreement_score":0.0044004996,"about_ca_system_score_codex":0.0023699214,"about_ca_system_score_gemma":0.004221972,"threshold_uncertainty_score":0.017195106},"labels":[],"label_agreement":null},{"id":"W2999855170","doi":"10.37236/766","title":"Codes from Cubic Curves and their Extensions","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Code (set theory); Prime (order theory); Linear code; Combinatorics; Plane curve; Range (aeronautics); Plane (geometry); Discrete mathematics; Pure mathematics; Block code; Algorithm; Geometry; Computer science; Set (abstract data type); Decoding methods","score_opus":0.010323897206391932,"score_gpt":0.1986178620096991,"score_spread":0.18829396480330718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999855170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8691815,0.0012502653,0.058967154,0.00068124686,0.00007358182,0.000060753795,0.0003207767,0.00009781084,0.06936689],"genre_scores_gemma":[0.9702354,0.001089895,0.015892772,0.00009108972,0.00015913851,0.000081453974,0.00028921457,0.000037759008,0.012123269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993018,0.000115528994,0.000026227135,0.00008488099,0.00032187355,0.00014974865],"domain_scores_gemma":[0.99832445,0.0005325109,0.0004214827,0.00021933715,0.00031067783,0.00019143993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036233576,0.00049050356,0.00040367525,0.001655963,0.0011611113,0.0012741704,0.00055433327,0.00058900943,0.0022519534],"category_scores_gemma":[0.003105301,0.00027960064,0.0005991003,0.0017123545,0.002040044,0.002241107,0.002078182,0.0018403637,0.0005004439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011471263,0.00003137801,0.0011982446,0.00009455488,0.000011243676,0.0005390713,0.00073515245,0.020662334,0.002829939,0.95348775,0.0010519527,0.019243665],"study_design_scores_gemma":[0.000032111882,0.000099583376,0.0013250132,0.00009175836,0.000012725938,0.00096195465,0.00036938387,0.056778647,0.0026105442,0.92772025,0.009946127,0.00005198626],"about_ca_topic_score_codex":0.0017034408,"about_ca_topic_score_gemma":0.0011657792,"teacher_disagreement_score":0.0022519534,"about_ca_system_score_codex":0.0010670242,"about_ca_system_score_gemma":0.00064743956,"threshold_uncertainty_score":0.0077418685},"labels":[],"label_agreement":null},{"id":"W3004650230","doi":"10.37236/8040","title":"","year":2020,"lang":"en","type":"article","venue":"UWA Profiles and Research Repository (UWA)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Transitive relation; Hamming graph; Corollary; Discrete mathematics; Alphabet; Partition (number theory); Transitive closure; Hamming code; Affine transformation; Block code; Algorithm; Decoding methods; Pure mathematics","score_opus":0.05845801451762299,"score_gpt":0.3084744139944756,"score_spread":0.2500163994768526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004650230","genre_codex":"empirical","genre_gemma":"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.5088516,0.0011373867,0.390024,0.0017984146,0.0009410998,0.0006493842,0.009679023,0.0013896308,0.08552943],"genre_scores_gemma":[0.8611529,0.00049224694,0.09760294,0.00042194512,0.00019379449,0.0003699975,0.003843388,0.00018232029,0.035740446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991503,0.00016274094,0.000050539085,0.00026768036,0.00020863893,0.00016009186],"domain_scores_gemma":[0.9984108,0.00045929122,0.00028317544,0.00039695986,0.000280481,0.00016919115],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039405443,0.00037150973,0.00032282344,0.0010812243,0.00092151354,0.0013137463,0.00049578515,0.00070261385,0.0066220523],"category_scores_gemma":[0.0020901572,0.00018412239,0.00032067866,0.0010257033,0.0013707072,0.0013097554,0.0009210821,0.00044831686,0.001641172],"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.0005904445,0.00016124378,0.006519934,0.000285717,0.00008898275,0.0011711447,0.0011289824,0.0063952664,0.04488031,0.81815284,0.02007611,0.100549035],"study_design_scores_gemma":[0.00007987518,0.000584027,0.00859231,0.00018940988,0.00008525192,0.003053517,0.00074758905,0.042598616,0.03444476,0.74251276,0.16698727,0.00012455825],"about_ca_topic_score_codex":0.0013066665,"about_ca_topic_score_gemma":0.001219684,"teacher_disagreement_score":0.9933779,"about_ca_system_score_codex":0.00066585175,"about_ca_system_score_gemma":0.00075505045,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3007435930","doi":"10.1007/s40314-020-1120-1","title":"Quasi-cyclic codes: algebraic properties and applications","year":2020,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Chinese remainder theorem; Dual (grammatical number); Linear code; Finite field; Galois extension; Generator matrix; Discrete mathematics; Generator (circuit theory); Block code; Galois group; Pure mathematics; Algorithm; Decoding methods; Physics","score_opus":0.03518806633077124,"score_gpt":0.2207856887193744,"score_spread":0.18559762238860317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007435930","genre_codex":"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.42553326,0.056215227,0.3803549,0.01017658,0.0019606063,0.0001494895,0.0013804622,0.0004303165,0.12379915],"genre_scores_gemma":[0.9367234,0.014762903,0.03552185,0.0006262976,0.0025487777,0.00007847648,0.00038443907,0.00006269813,0.009291207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939895,0.00013879949,0.000036091795,0.00012502962,0.00022130506,0.00007981895],"domain_scores_gemma":[0.99481875,0.002861443,0.0008367531,0.00041616024,0.00077187485,0.00029493944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086346676,0.0005316158,0.00050846615,0.0026387498,0.0010136208,0.0029858553,0.00054942264,0.0011396147,0.0031098404],"category_scores_gemma":[0.004946974,0.00036161506,0.00042479712,0.0038194277,0.0036900223,0.0029165791,0.0013028944,0.0015486305,0.00055335666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037098416,0.00002068788,0.0005033123,0.000084752544,0.0000050543204,0.000066006476,0.00016554969,0.0019970867,0.0012069786,0.97797465,0.0016043123,0.016334502],"study_design_scores_gemma":[0.000017100387,0.000052947486,0.00048294826,0.000044568653,0.000008421703,0.0005203503,0.00011226827,0.012490354,0.0010696432,0.9761353,0.009037879,0.000028210261],"about_ca_topic_score_codex":0.00081369834,"about_ca_topic_score_gemma":0.00060687104,"teacher_disagreement_score":0.0031098404,"about_ca_system_score_codex":0.0011797302,"about_ca_system_score_gemma":0.0012475586,"threshold_uncertainty_score":0.010403454},"labels":[],"label_agreement":null},{"id":"W3010077287","doi":"10.5539/jmr.v12n2p12","title":"On the Hyper-Kloosterman Codes Over Galois Rings","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kloosterman sum; TRACE (psycholinguistics); Hamming code; Code word; Code (set theory); Galois group; Discrete mathematics; Galois module; Combinatorics; Pure mathematics; Block code; Algorithm; Decoding methods; Computer science; Linguistics","score_opus":0.14376633328384109,"score_gpt":0.361740100144095,"score_spread":0.21797376686025394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010077287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.84357977,0.0012199958,0.12953138,0.0006174951,0.000119545846,0.000040125648,0.00017352152,0.0001123968,0.024605704],"genre_scores_gemma":[0.9788502,0.0008733827,0.01314668,0.00010337573,0.0001979588,0.00003274615,0.00011395898,0.000046759484,0.0066350526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924505,0.00018160231,0.000038217557,0.00013023689,0.00024211437,0.000162714],"domain_scores_gemma":[0.9987633,0.00045891386,0.00025212177,0.00012593862,0.0002063437,0.00019336194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006290055,0.0006741012,0.00040848582,0.0016233108,0.00081207487,0.0012729131,0.000499139,0.0005256552,0.0016113535],"category_scores_gemma":[0.0024143357,0.00021289222,0.00036399325,0.0011917822,0.0029481861,0.0024890797,0.0017295749,0.0013818508,0.0004116846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113372094,0.0000315356,0.0011652638,0.000049983173,0.000010984727,0.00025385484,0.00060435827,0.00961882,0.0049564936,0.9680931,0.00050363166,0.014598598],"study_design_scores_gemma":[0.000017960594,0.000112538946,0.0009447889,0.000059415153,0.000012687016,0.00052192353,0.0001850345,0.043953042,0.0064382483,0.94403076,0.0036630093,0.00006060117],"about_ca_topic_score_codex":0.0010175995,"about_ca_topic_score_gemma":0.00055702915,"teacher_disagreement_score":0.0016233108,"about_ca_system_score_codex":0.0007042664,"about_ca_system_score_gemma":0.0006413002,"threshold_uncertainty_score":0.005390525},"labels":[],"label_agreement":null},{"id":"W3011787975","doi":"10.1109/tc.2020.2979460","title":"Analysis and Efficient Implementations of a Class of Composited de Bruijn Sequences","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Institute of Standards and Technology; U.S. Department of Commerce","keywords":"De Bruijn sequence; Sequence (biology); Randomness; Computer science; Tuple; Discrete mathematics; Binary number; Mathematics; Algorithm; Combinatorics; Arithmetic; Statistics","score_opus":0.017455396072236968,"score_gpt":0.25407952206589374,"score_spread":0.23662412599365676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011787975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.21232824,0.00043128585,0.7733601,0.0001701271,0.0000940789,0.0001751471,0.0001884267,0.000717438,0.0125352675],"genre_scores_gemma":[0.6656623,0.00029406967,0.32755068,0.00007613157,0.00008225594,0.0002536601,0.0003891557,0.00013571234,0.0055560716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903405,0.00013761537,0.0000719831,0.0002181431,0.0004088163,0.00012938151],"domain_scores_gemma":[0.99716586,0.0010863304,0.00033482077,0.0008293741,0.00045661343,0.00012702742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006587075,0.00042391164,0.00042493708,0.0009268572,0.0006448409,0.00092241657,0.001035366,0.000613414,0.0026877003],"category_scores_gemma":[0.0040305345,0.0003761214,0.00059769757,0.00090205116,0.0009025275,0.001407567,0.0008072755,0.0009656952,0.0005219717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006536285,0.00018697292,0.0035741266,0.00048007097,0.00007384995,0.0006418946,0.00037303325,0.15733956,0.101955675,0.56705576,0.0025865221,0.16507885],"study_design_scores_gemma":[0.00009225013,0.00041506762,0.0014409582,0.000057671645,0.00005280647,0.00084412715,0.000066226894,0.8099369,0.058302842,0.10848551,0.0202366,0.00006907312],"about_ca_topic_score_codex":0.0003991406,"about_ca_topic_score_gemma":0.0006362321,"teacher_disagreement_score":0.0026877003,"about_ca_system_score_codex":0.0007512398,"about_ca_system_score_gemma":0.000811881,"threshold_uncertainty_score":0.008991241},"labels":[],"label_agreement":null},{"id":"W3012606778","doi":"10.1016/j.disc.2021.112368","title":"An efficiently generated family of binary de Bruijn sequences","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Nanyang Technological University","keywords":"De Bruijn sequence; Successor cardinal; Binary number; Shift register; Class (philosophy); Combinatorics; Discrete mathematics; Mathematics; Function (biology); State space; Computer science; Pseudorandom binary sequence; State (computer science); Sequence (biology); Algorithm; Arithmetic; Artificial intelligence; Statistics; Telecommunications","score_opus":0.0204393012070907,"score_gpt":0.2677536446587591,"score_spread":0.24731434345166842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012606778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4894001,0.0023112549,0.38144913,0.0021084875,0.00059984677,0.00020848324,0.0013962672,0.0012635449,0.12126289],"genre_scores_gemma":[0.92248225,0.0006714936,0.044831175,0.00032957818,0.00013725426,0.000186946,0.00067169656,0.00026049558,0.030429147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989588,0.00025228562,0.00005358771,0.00022199759,0.00035079505,0.00016249034],"domain_scores_gemma":[0.9978097,0.0012600756,0.0001961788,0.00032167384,0.0002516673,0.00016072553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008048406,0.00063168065,0.0005013862,0.0009857528,0.0011508316,0.0017690867,0.0006001896,0.0007645182,0.0059182406],"category_scores_gemma":[0.0035021636,0.00043840485,0.00042837602,0.00092449697,0.00082469196,0.0016169293,0.0012224534,0.0013805085,0.0012295663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035526624,0.00008832588,0.0007228627,0.00016313276,0.000030269795,0.00071047724,0.00034450632,0.011875804,0.017775474,0.92166424,0.004309026,0.041960597],"study_design_scores_gemma":[0.00014829657,0.00016808388,0.00078208576,0.00013284398,0.00004608011,0.0021132876,0.00012124433,0.07321101,0.030313771,0.84726995,0.045604266,0.00008907537],"about_ca_topic_score_codex":0.0002338857,"about_ca_topic_score_gemma":0.00026692974,"teacher_disagreement_score":0.0059182406,"about_ca_system_score_codex":0.0008519601,"about_ca_system_score_gemma":0.0006997802,"threshold_uncertainty_score":0.019798458},"labels":[],"label_agreement":null},{"id":"W3012810501","doi":"10.37236/9456","title":"On the Intersection Distribution of Degree Three Polynomials and Related Topics","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Mathematical Sciences; Universität Rostock; Pacific Institute for the Mathematical Sciences; Alexander von Humboldt-Stiftung","keywords":"Monomial; Conjecture; Intersection (aeronautics); Mathematics; Combinatorics; Degree (music); Affine transformation; Distribution (mathematics); Polynomial; Complete intersection; Interpretation (philosophy); Affine space; Field (mathematics); Discrete mathematics; Pure mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.014862534747300586,"score_gpt":0.22313194988496887,"score_spread":0.20826941513766828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012810501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8326344,0.0019648566,0.1185606,0.001876135,0.0000763053,0.00002522293,0.0003973024,0.000205226,0.04425988],"genre_scores_gemma":[0.9907845,0.00097404467,0.00534056,0.0001179367,0.00014971888,0.000031533866,0.00022894658,0.00007236563,0.0023002704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990903,0.00021408629,0.00002533246,0.00017040585,0.00020823501,0.00029163086],"domain_scores_gemma":[0.99533206,0.0027696046,0.000540471,0.00039692488,0.00046297273,0.0004978967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012870738,0.00046528375,0.0007832305,0.0032741325,0.0019071647,0.002726599,0.001413305,0.0006847937,0.0036092522],"category_scores_gemma":[0.005752747,0.00036182592,0.0006229384,0.0029323618,0.0052324,0.003766446,0.0022668983,0.0023994846,0.000455141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005499004,0.000019716057,0.0019455358,0.000028459652,0.0000057730963,0.00006765103,0.00030487258,0.0037340147,0.00076916104,0.98482394,0.0007097138,0.007536241],"study_design_scores_gemma":[0.000017821232,0.00003398993,0.0021003622,0.000042245676,0.000012373093,0.00023231357,0.0003413859,0.04283565,0.0018643526,0.94874567,0.0037358452,0.000038001694],"about_ca_topic_score_codex":0.0029743793,"about_ca_topic_score_gemma":0.0010507717,"teacher_disagreement_score":0.0036092522,"about_ca_system_score_codex":0.003064486,"about_ca_system_score_gemma":0.00087768404,"threshold_uncertainty_score":0.0222345},"labels":[],"label_agreement":null},{"id":"W3021510930","doi":"10.1007/s00200-020-00431-1","title":"Boomerang uniformity of normalized permutation polynomials of low degree","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boomerang attack; Block cipher; Permutation (music); Differential cryptanalysis; Mathematics; Linear cryptanalysis; Degree (music); Finite field; Higher-order differential cryptanalysis; Differential (mechanical device); Combinatorics; Discrete mathematics; Algorithm; Cryptography; Physics","score_opus":0.013960704577778095,"score_gpt":0.21488260193150707,"score_spread":0.20092189735372898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021510930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6774865,0.00044027233,0.24118194,0.0009574004,0.00033206618,0.000066289715,0.00042993462,0.00041411995,0.07869142],"genre_scores_gemma":[0.9640199,0.00024232261,0.01576604,0.0003377252,0.00026694336,0.000053468208,0.0002951062,0.00021350784,0.018804928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987619,0.00032783882,0.000046960897,0.00028135726,0.00026209804,0.0003199856],"domain_scores_gemma":[0.99784565,0.0008468887,0.000291837,0.00030354466,0.00035690557,0.0003552379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011570685,0.00055446883,0.00075283577,0.0017454763,0.0019120225,0.0019227838,0.0011962388,0.000666291,0.006607701],"category_scores_gemma":[0.0040349183,0.00042226308,0.0006609197,0.001517731,0.0030782819,0.00347934,0.0016828994,0.0020905044,0.0010265865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007170194,0.000019967996,0.00019558442,0.000013353665,0.000004987911,0.00004474131,0.00013678704,0.0010134095,0.0018663777,0.9917156,0.0005460019,0.004371456],"study_design_scores_gemma":[0.000012025452,0.000036073827,0.00036067824,0.000005603298,0.000005681602,0.00011043939,0.000049048893,0.007282059,0.0018852286,0.9887271,0.001504067,0.000021971657],"about_ca_topic_score_codex":0.0012361094,"about_ca_topic_score_gemma":0.0009769272,"teacher_disagreement_score":0.006607701,"about_ca_system_score_codex":0.0010213407,"about_ca_system_score_gemma":0.0008332323,"threshold_uncertainty_score":0.022104979},"labels":[],"label_agreement":null},{"id":"W3023517918","doi":"10.1016/j.disc.2021.112780","title":"Investigating the discrepancy property of de Bruijn sequences","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Substring; Mathematics; Combinatorics; String (physics); Upper and lower bounds; Binary number; Discrete mathematics; De Bruijn graph; Simple (philosophy); Data structure; Arithmetic; Computer science; Mathematical analysis","score_opus":0.02649436287000227,"score_gpt":0.25102502956612394,"score_spread":0.22453066669612168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023517918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8987263,0.00068458676,0.06303953,0.0018171004,0.00014360945,0.000024579484,0.00013248532,0.00008940756,0.035342548],"genre_scores_gemma":[0.9867395,0.00023756242,0.008956275,0.00012434229,0.00008149894,0.00001640973,0.00014473191,0.000049687205,0.003649916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.00024153278,0.000028592342,0.00010159357,0.00021351,0.00011429762],"domain_scores_gemma":[0.9902862,0.007309589,0.0008457744,0.0006493559,0.000545681,0.00036354005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014960513,0.00034441767,0.000544324,0.0011388551,0.0009822925,0.0015854464,0.0008153687,0.0012730265,0.0031298911],"category_scores_gemma":[0.015188392,0.00043084103,0.00027691142,0.00088575634,0.0018105686,0.003994945,0.0013656261,0.0019320217,0.00031131844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014948461,0.0000517533,0.0018617734,0.00005792989,0.000007965166,0.00014837098,0.0002634543,0.01806162,0.004920644,0.9683021,0.00078233035,0.0053926897],"study_design_scores_gemma":[0.00003252529,0.00005830176,0.00068032887,0.000027978107,0.000005244592,0.00022841828,0.00021935871,0.123232864,0.0034934403,0.86970603,0.0022933888,0.000022139873],"about_ca_topic_score_codex":0.00082022825,"about_ca_topic_score_gemma":0.0005995141,"teacher_disagreement_score":0.0031298911,"about_ca_system_score_codex":0.00071492343,"about_ca_system_score_gemma":0.0005735456,"threshold_uncertainty_score":0.010470569},"labels":[],"label_agreement":null},{"id":"W3026492770","doi":"10.1109/tcomm.2020.2996781","title":"A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Algorithm; Cryptosystem; Mathematics; Computer science; Theoretical computer science; Plaintext; Encryption; Decoding methods; Cryptography; Computer network","score_opus":0.10968305158944719,"score_gpt":0.28413902087906984,"score_spread":0.17445596928962265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026492770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.035103567,0.00048766955,0.95632124,0.0006484584,0.00013174205,0.00021269664,0.000163745,0.0004276812,0.0065031936],"genre_scores_gemma":[0.55615515,0.00045357368,0.43665212,0.00024491438,0.000067865134,0.00023613268,0.00015319658,0.000034284374,0.006002747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992617,0.00017990088,0.00004721582,0.00009428734,0.0003417342,0.00007517715],"domain_scores_gemma":[0.9995084,0.00009062492,0.00007999909,0.00015896145,0.000119556236,0.00004257501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592198,0.00034380882,0.00044124495,0.00037120297,0.00050387654,0.0007091475,0.0008429813,0.0006644745,0.0012681271],"category_scores_gemma":[0.0007759136,0.00018515812,0.00037868734,0.0005361711,0.0007408088,0.0011513853,0.0008709477,0.00092249614,0.00054418476],"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.00054336176,0.0002478165,0.0012045061,0.00053981185,0.00010508594,0.00066457037,0.00033018118,0.09649651,0.28611216,0.46910927,0.005034564,0.13961217],"study_design_scores_gemma":[0.00017367481,0.00030574566,0.0003628988,0.000051250172,0.000050184666,0.0010302997,0.00003295129,0.8402829,0.11145711,0.022853937,0.02328605,0.00011299241],"about_ca_topic_score_codex":0.0006248716,"about_ca_topic_score_gemma":0.00061375054,"teacher_disagreement_score":0.0012681271,"about_ca_system_score_codex":0.0006666194,"about_ca_system_score_gemma":0.0011230566,"threshold_uncertainty_score":0.0048366785},"labels":[],"label_agreement":null},{"id":"W3029268111","doi":"","title":"Asymptotic enumeration of correlation-immune boolean functions.","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boolean function; Mathematics; Parity function; Combinatorics; Function (biology); Discrete mathematics; Order (exchange); Maximum satisfiability problem; Boolean data type; Boolean expression","score_opus":0.009733637308701328,"score_gpt":0.21661350083371947,"score_spread":0.20687986352501814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029268111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2525591,0.0020981287,0.68141586,0.001853578,0.00015290471,0.00015220753,0.0006781331,0.0007352857,0.06035485],"genre_scores_gemma":[0.9083944,0.0014058668,0.07889579,0.00064860814,0.00037680953,0.0003813418,0.0009490098,0.0002116441,0.008736592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967884,0.0009521734,0.00016987095,0.00048761154,0.0010900275,0.0005119827],"domain_scores_gemma":[0.9769603,0.016301088,0.0016285868,0.0026681314,0.0017027246,0.0007391338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027647046,0.00078172877,0.00096660503,0.0021486527,0.0011055293,0.0022649805,0.0016481943,0.0013314716,0.0038650872],"category_scores_gemma":[0.039244536,0.0005370583,0.0009618528,0.0018360163,0.003041773,0.0047204345,0.0028210254,0.002491623,0.0010252339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038982028,0.00012579921,0.007410753,0.00030416003,0.000058355803,0.00028747928,0.00035643604,0.04220652,0.009780334,0.8763228,0.0054722475,0.057285283],"study_design_scores_gemma":[0.00003620849,0.00011289151,0.002530411,0.000116150724,0.000053049218,0.0010247704,0.000072765724,0.27444234,0.007351208,0.7072,0.007009233,0.00005098367],"about_ca_topic_score_codex":0.0005732616,"about_ca_topic_score_gemma":0.0006212984,"teacher_disagreement_score":0.0038650872,"about_ca_system_score_codex":0.0020674102,"about_ca_system_score_gemma":0.0011298448,"threshold_uncertainty_score":0.015000224},"labels":[],"label_agreement":null},{"id":"W3029570467","doi":"10.1007/s40314-020-01181-z","title":"New classes of codes over $$R_{q,p,m}={\\mathbb {Z}}_{p^{m}}[u_{1}, u_{2}, \\ldots , u_{ q}]/\\left\\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\\right\\rangle $$ and their applications","year":2020,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Simplex; Mathematics; Physics; Discrete mathematics","score_opus":0.016092455912445933,"score_gpt":0.2244787084467095,"score_spread":0.20838625253426357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029570467","genre_codex":"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.5243202,0.007450528,0.2711464,0.00826355,0.0025729397,0.00027780054,0.0024185209,0.0017290827,0.18182088],"genre_scores_gemma":[0.8765204,0.0033075884,0.049809474,0.0018460293,0.0024318034,0.00053674536,0.0018459448,0.00065476546,0.06304716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988475,0.00020559068,0.000063645064,0.00024625257,0.00038982605,0.00024713573],"domain_scores_gemma":[0.9964134,0.0015506241,0.00064101623,0.00044381534,0.00042017788,0.000531029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009205987,0.0011088015,0.0008978778,0.0041180174,0.0018667092,0.00348041,0.0014302057,0.0023574582,0.0055902195],"category_scores_gemma":[0.004027888,0.0006188414,0.0010809174,0.0024885314,0.0030891295,0.004087076,0.002526352,0.003408369,0.0009558872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005074634,0.000033122487,0.00025493526,0.000034560122,0.000006986948,0.00006316436,0.00015498478,0.001049484,0.00087378017,0.9849688,0.0037894621,0.008719996],"study_design_scores_gemma":[0.00006588927,0.000043385986,0.00051459455,0.000060873943,0.000019017105,0.0005482693,0.00010778805,0.02532432,0.0016100176,0.95163476,0.020013515,0.00005761583],"about_ca_topic_score_codex":0.0010646107,"about_ca_topic_score_gemma":0.0011915449,"teacher_disagreement_score":0.0055902195,"about_ca_system_score_codex":0.0021555463,"about_ca_system_score_gemma":0.0011081394,"threshold_uncertainty_score":0.018701196},"labels":[],"label_agreement":null},{"id":"W3033054633","doi":"10.2478/udt-2019-0010","title":"Joint Distribution in Residue Classes of the Base- <i>q</i> and Ostrowski Digital Sums","year":2019,"lang":"en","type":"article","venue":"Uniform distribution theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Base (topology); Combinatorics; Crystallography; Analytical Chemistry (journal); Mathematics; Chemistry","score_opus":0.005694574982321248,"score_gpt":0.18203905387445798,"score_spread":0.17634447889213672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033054633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.91435575,0.000651707,0.06416841,0.0012006644,0.00008256631,0.00008396233,0.001201158,0.0005910607,0.01766484],"genre_scores_gemma":[0.98968935,0.00026410344,0.0037986778,0.0000583365,0.00008418966,0.000075399796,0.0006006768,0.00012721065,0.0053019784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789244,0.00031841808,0.00009342896,0.00060088217,0.000596098,0.00049884384],"domain_scores_gemma":[0.98923033,0.0056339833,0.001658904,0.0014697342,0.0008787154,0.0011283833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003975361,0.0005326162,0.0012166603,0.0045925207,0.0016195702,0.004181454,0.0016402706,0.0010537881,0.012904799],"category_scores_gemma":[0.024538063,0.0007220818,0.00080989365,0.002322306,0.00421745,0.0063412646,0.0022157454,0.0020115536,0.0016400042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065247546,0.00018489007,0.03438727,0.00014024682,0.00006283595,0.00045836382,0.00081365684,0.013076637,0.003420979,0.90688616,0.0043825665,0.035533894],"study_design_scores_gemma":[0.00013007289,0.0001346395,0.0353811,0.00013037193,0.00007353178,0.0008358941,0.00044963046,0.12068662,0.0048111323,0.8280753,0.009127,0.00016462745],"about_ca_topic_score_codex":0.0015568696,"about_ca_topic_score_gemma":0.0010872874,"teacher_disagreement_score":0.012904799,"about_ca_system_score_codex":0.0019751873,"about_ca_system_score_gemma":0.00085895095,"threshold_uncertainty_score":0.04317081},"labels":[],"label_agreement":null},{"id":"W3033468545","doi":"10.3934/amc.2020084","title":"Involutory-Multiple-Lightweight MDS Matrices based on Cauchy-type Matrices","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cauchy distribution; Cauchy matrix; Combinatorics; Matrix (chemical analysis); Separable space; Arithmetic; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.031567735736418245,"score_gpt":0.29276075773538546,"score_spread":0.2611930219989672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033468545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.035300348,0.00047201078,0.93163383,0.00037409112,0.00025994697,0.00013594909,0.00042472282,0.0009556755,0.030443445],"genre_scores_gemma":[0.49489653,0.0012877904,0.4648727,0.00053332164,0.00036931928,0.00035187666,0.0012675651,0.0006068275,0.035814174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993112,0.00015443719,0.000047265552,0.00013417838,0.00026917478,0.00008363901],"domain_scores_gemma":[0.99867034,0.00034720157,0.0001526233,0.00026822087,0.00039958104,0.00016209878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049119716,0.0010749492,0.00044024983,0.0014918809,0.0007164423,0.0015639502,0.0008301182,0.0006464506,0.009976305],"category_scores_gemma":[0.0033240295,0.0003178259,0.0005453816,0.0014157386,0.0011121284,0.0018202083,0.0012349708,0.0015282285,0.0050397012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013207347,0.00006497564,0.0003806621,0.00017532922,0.00001866239,0.0002925992,0.00030431992,0.019311352,0.021398233,0.84151495,0.008420736,0.10798606],"study_design_scores_gemma":[0.000041825362,0.00022994124,0.00032233563,0.0001056731,0.000021888844,0.0009139564,0.00023907186,0.30405518,0.046163894,0.590153,0.0576388,0.00011448379],"about_ca_topic_score_codex":0.0009472981,"about_ca_topic_score_gemma":0.0014165094,"teacher_disagreement_score":0.009976305,"about_ca_system_score_codex":0.00074479514,"about_ca_system_score_gemma":0.0009825212,"threshold_uncertainty_score":0.03337401},"labels":[],"label_agreement":null},{"id":"W3036011203","doi":"10.48550/arxiv.1712.00669","title":"Drinfeld Modules with Complex Multiplication, Hasse Invariants and\\n Factoring Polynomials over Finite Fields","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada; National Science Foundation","keywords":"Mathematics; Finite field; Lift (data mining); Polynomial ring; Hasse principle; Invariant (physics); Multiplication (music); Complex multiplication; Discrete mathematics; Polynomial; Combinatorics; Pure mathematics; Algebraic number field; Elliptic curve","score_opus":0.08979091947607205,"score_gpt":0.20168409357704017,"score_spread":0.11189317410096812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036011203","genre_codex":"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.23752038,0.0005910793,0.72534233,0.0006750582,0.00017584857,0.00025515078,0.00069011573,0.016462125,0.018287878],"genre_scores_gemma":[0.54329073,0.00017711936,0.44190812,0.0001926353,0.00009072576,0.00016593313,0.0017662665,0.0012059001,0.011202552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986284,0.00015299517,0.00008305284,0.00037308375,0.00041474611,0.00034769162],"domain_scores_gemma":[0.9986576,0.0003367858,0.0001144713,0.00065073645,0.0001363296,0.000104015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180296,0.001012685,0.00086263486,0.0007525517,0.00085639505,0.0016696579,0.0014182215,0.00070766156,0.0139026465],"category_scores_gemma":[0.0034018573,0.00041812853,0.0014626962,0.0008262107,0.0012227591,0.0030119652,0.0024901703,0.0013216202,0.0042022597],"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.0017723604,0.00037617912,0.008777448,0.00047136212,0.00017584093,0.00038167278,0.0008059146,0.042800076,0.043177776,0.174469,0.024343895,0.7024485],"study_design_scores_gemma":[0.00076224137,0.00085943897,0.003333327,0.00015109834,0.00017428953,0.0007085671,0.000497949,0.43404463,0.11568755,0.40028796,0.043245025,0.0002479555],"about_ca_topic_score_codex":0.0034992958,"about_ca_topic_score_gemma":0.0076467707,"teacher_disagreement_score":0.0139026465,"about_ca_system_score_codex":0.001432819,"about_ca_system_score_gemma":0.0019731545,"threshold_uncertainty_score":0.046508968},"labels":[],"label_agreement":null},{"id":"W3036019187","doi":"10.1109/tit.2020.3002993","title":"Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Pacific Institute for the Mathematical Sciences; Alexander von Humboldt-Stiftung","keywords":"Planarity testing; Computer science; Mathematics; Theoretical computer science; Combinatorics; Algorithm","score_opus":0.011628620521478302,"score_gpt":0.19264855307998355,"score_spread":0.18101993255850524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036019187","genre_codex":"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.46985796,0.0030515727,0.4554904,0.0016219576,0.0002135074,0.0001164583,0.00070538424,0.00031297628,0.06862979],"genre_scores_gemma":[0.9491106,0.0016894256,0.042334817,0.00020804431,0.00040581723,0.000084638195,0.0003698692,0.000076024255,0.0057206517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860567,0.00030500174,0.000103878745,0.0003962683,0.00036330972,0.00022578302],"domain_scores_gemma":[0.9961085,0.0016909109,0.00056841015,0.0006791758,0.0004662012,0.00048682865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012364809,0.0009100487,0.0008498791,0.005401585,0.0019256291,0.0028799702,0.0011814676,0.0009197526,0.004346097],"category_scores_gemma":[0.0055633816,0.0005902368,0.0008948756,0.0027518966,0.0061479085,0.0066201827,0.0027022632,0.0022594894,0.00046570756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032076277,0.000009712306,0.0008816638,0.00004985034,0.000008456791,0.00010015186,0.00016627702,0.002585411,0.0011384861,0.9821889,0.00037298613,0.012466128],"study_design_scores_gemma":[0.000007765519,0.000085107604,0.0017821474,0.00004182558,0.0000183863,0.0004653425,0.00030261822,0.020138454,0.0018573847,0.97011024,0.0051453416,0.000045452314],"about_ca_topic_score_codex":0.0012186911,"about_ca_topic_score_gemma":0.00062015955,"teacher_disagreement_score":0.005401585,"about_ca_system_score_codex":0.0016280295,"about_ca_system_score_gemma":0.00038393267,"threshold_uncertainty_score":0.014539182},"labels":[],"label_agreement":null},{"id":"W3038455654","doi":"10.4153/s0008439520000892","title":"Degree gaps for multipliers and the dynamical André–Oort conjecture","year":2020,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Conjecture; Degree (music); Mathematics; Multiplier (economics); Pure mathematics; Combinatorics; Physics; Economics; Keynesian economics","score_opus":0.023204606471731695,"score_gpt":0.2279272374924802,"score_spread":0.2047226310207485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038455654","genre_codex":"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.86658055,0.0010041284,0.032853454,0.003780203,0.00018730367,0.000016748987,0.00016091675,0.00017192247,0.09524484],"genre_scores_gemma":[0.9924231,0.0001941849,0.0022304656,0.00014787733,0.00008465731,0.00001595894,0.000053728803,0.000019925608,0.004829951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961925,0.00007034272,0.00001691274,0.00008026085,0.00010391479,0.00010925722],"domain_scores_gemma":[0.9987112,0.0006509558,0.00016370497,0.00019831344,0.00011056041,0.00016524133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070062233,0.00024757892,0.0003583261,0.00095663103,0.0013753532,0.0013996749,0.00057484506,0.00089998904,0.0067128777],"category_scores_gemma":[0.0045755603,0.00022507251,0.0003119653,0.0003640774,0.002163592,0.0034513841,0.0017653023,0.0011600549,0.0004931961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613153,0.000015106021,0.00075633463,0.000026018102,0.0000026027371,0.00012065394,0.00024535993,0.001658096,0.0019936943,0.98944455,0.0010025431,0.0046736286],"study_design_scores_gemma":[0.000025927666,0.000028779397,0.00074465416,0.000022637343,0.0000045211173,0.00024587056,0.00017887447,0.008797808,0.0017712981,0.98253226,0.005632643,0.000014686859],"about_ca_topic_score_codex":0.0007319566,"about_ca_topic_score_gemma":0.0006576994,"teacher_disagreement_score":0.0067128777,"about_ca_system_score_codex":0.0009255855,"about_ca_system_score_gemma":0.00030021966,"threshold_uncertainty_score":0.022456825},"labels":[],"label_agreement":null},{"id":"W3044913267","doi":"10.48550/arxiv.2007.12825","title":"A note on watchman's walks in de Bruijn graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"De Bruijn sequence; De Bruijn graph; Digraph; Graph; Combinatorics; Order (exchange); Sequence (biology); Mathematics; Computer science; Discrete mathematics; Business","score_opus":0.05746061102912097,"score_gpt":0.18824048836806503,"score_spread":0.13077987733894406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044913267","genre_codex":"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.11412273,0.009225688,0.7303138,0.009262305,0.0032789356,0.0001442363,0.00062397466,0.0007676439,0.13226074],"genre_scores_gemma":[0.6674099,0.010966107,0.2513143,0.0032083932,0.0029864302,0.00022845894,0.0006985605,0.00062286813,0.06256499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940276,0.00017421615,0.000042609427,0.00015856887,0.00013911024,0.0000826199],"domain_scores_gemma":[0.99714774,0.0021132284,0.0001244718,0.00028828005,0.00014237782,0.00018394616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089431053,0.0006203422,0.00060015335,0.0010096143,0.0017068248,0.0018826642,0.0008650899,0.0012678909,0.003630323],"category_scores_gemma":[0.0039968314,0.0004788664,0.0008491757,0.002054193,0.0025149458,0.00516793,0.0016463044,0.0033187822,0.0007914071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053820804,0.000025930114,0.00029574241,0.00009073244,0.000008902636,0.00025042667,0.0003118912,0.004823466,0.0019528738,0.9668042,0.0048286845,0.020553233],"study_design_scores_gemma":[0.000013176574,0.000041590738,0.00019251124,0.000032698972,0.0000098685905,0.00022520692,0.00007981071,0.012762024,0.0012059144,0.9594775,0.025937734,0.000022026617],"about_ca_topic_score_codex":0.0024594106,"about_ca_topic_score_gemma":0.0030374583,"teacher_disagreement_score":0.003630323,"about_ca_system_score_codex":0.0007073123,"about_ca_system_score_gemma":0.00061140937,"threshold_uncertainty_score":0.012144625},"labels":[],"label_agreement":null},{"id":"W3044956106","doi":"","title":"On double circulant doubly even self-dual [72, 36, 12] codes and their neighbors","year":2008,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics; Philosophy; Linguistics","score_opus":0.020536902347200583,"score_gpt":0.22682279172034892,"score_spread":0.20628588937314835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044956106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.89610976,0.00040095288,0.02490389,0.0008006385,0.00020904832,0.000029721039,0.00020865317,0.00012652739,0.07721083],"genre_scores_gemma":[0.97580075,0.00020525772,0.0066537824,0.00024386094,0.00011379697,0.00003689176,0.00021114107,0.00006397028,0.016670633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958366,0.00011014225,0.000013850915,0.000064834254,0.00012030974,0.00010723689],"domain_scores_gemma":[0.9988518,0.00045934334,0.00017783612,0.0001267176,0.00020942709,0.00017479892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000340629,0.00050472596,0.0005493383,0.0017714966,0.0021626183,0.001564753,0.0006950214,0.00089902745,0.0037798584],"category_scores_gemma":[0.0024891458,0.00029544206,0.00028475755,0.00093827693,0.001739313,0.001120933,0.0012583145,0.0010634409,0.00075036153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022822301,0.000033242006,0.00087072887,0.000033179964,0.0000068697555,0.00033347667,0.00042163563,0.0056284848,0.002584201,0.9821239,0.0020902657,0.005645908],"study_design_scores_gemma":[0.000045502424,0.000044333803,0.0005199406,0.000035180867,0.000010941055,0.0003931796,0.0003030764,0.029752243,0.0019687947,0.96239036,0.004499509,0.00003702194],"about_ca_topic_score_codex":0.0024661417,"about_ca_topic_score_gemma":0.0027856298,"teacher_disagreement_score":0.0037798584,"about_ca_system_score_codex":0.0006872156,"about_ca_system_score_gemma":0.0007549044,"threshold_uncertainty_score":0.012644887},"labels":[],"label_agreement":null},{"id":"W3045549505","doi":"10.1145/3373207.3404022","title":"A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix","year":2020,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invertible matrix; Integer (computer science); Dimension (graph theory); Matrix (chemical analysis); Integer matrix; Las vegas; Mathematics; Combinatorics; Matrix multiplication; Algorithm; Discrete mathematics; Arithmetic; Computer science; Symmetric matrix; Nonnegative matrix; Pure mathematics","score_opus":0.017071315956414358,"score_gpt":0.25445148857132766,"score_spread":0.2373801726149133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045549505","genre_codex":"methods","genre_gemma":"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.016670302,0.0002512377,0.96979004,0.0003993109,0.00014988203,0.00013306219,0.00017729591,0.0026343903,0.009794456],"genre_scores_gemma":[0.22584592,0.0002856915,0.7593996,0.00042680773,0.00016157333,0.00046374582,0.0008330629,0.0004031944,0.012180491],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987704,0.00025560055,0.00007701494,0.00025445936,0.00043341838,0.00020912144],"domain_scores_gemma":[0.99884135,0.00040111778,0.00009952545,0.0003354192,0.00025838925,0.00006421142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082792493,0.00097557955,0.0007824588,0.0012997444,0.0009344158,0.0017728937,0.0011972203,0.0008216525,0.0106664905],"category_scores_gemma":[0.004829701,0.00044895665,0.00073031994,0.001237803,0.0013483462,0.0029127796,0.001916501,0.0014790779,0.00379356],"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.0010525626,0.0002447922,0.0013075795,0.00018537101,0.00009451279,0.0002358422,0.00027653595,0.088393874,0.026275411,0.3552225,0.023968698,0.50274235],"study_design_scores_gemma":[0.0003824161,0.00031726912,0.00036513133,0.000060903403,0.000044696033,0.00025487988,0.00012353121,0.61543804,0.021293169,0.33757684,0.02403909,0.00010396808],"about_ca_topic_score_codex":0.00359392,"about_ca_topic_score_gemma":0.006011794,"teacher_disagreement_score":0.0106664905,"about_ca_system_score_codex":0.0014918994,"about_ca_system_score_gemma":0.0029546365,"threshold_uncertainty_score":0.035682976},"labels":[],"label_agreement":null},{"id":"W3045916595","doi":"10.1145/3457341.3457342","title":"Computing one billion roots using the tangent Graeffe method","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Tangent; Degree (music); Factorization; Prime factor; Polynomial; Fast Fourier transform; Prime (order theory); Tangent vector; Combinatorics; Algorithm; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.12045959822385764,"score_gpt":0.345415546345897,"score_spread":0.22495594812203934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045916595","genre_codex":"methods","genre_gemma":"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.10474989,0.0004717348,0.8625443,0.00046829763,0.00027715124,0.000111132686,0.00075745705,0.010790598,0.019829474],"genre_scores_gemma":[0.28055447,0.00022045447,0.70527375,0.00014413125,0.0000552052,0.00012257496,0.0011223096,0.0017383582,0.010768671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993536,0.000088628956,0.000051027957,0.000106073654,0.00027195958,0.00012870262],"domain_scores_gemma":[0.99855274,0.0006682641,0.00007795714,0.00028206527,0.00035478923,0.00006414929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066536485,0.0010255357,0.0010206564,0.0015462267,0.00068328646,0.0013850697,0.0012073071,0.0009240514,0.019794345],"category_scores_gemma":[0.0055922023,0.00045228977,0.00091913366,0.0015254057,0.0008820187,0.002898594,0.001282071,0.0011579539,0.0056086476],"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.00081295107,0.00024931735,0.0042490833,0.0005783971,0.00013179934,0.0007174131,0.00067259313,0.2006971,0.027332956,0.15741867,0.034637276,0.57250243],"study_design_scores_gemma":[0.0001882227,0.00014656548,0.0006350033,0.00005979786,0.000032157408,0.00028336636,0.00021833592,0.8495409,0.021070004,0.10572547,0.022037206,0.000062911575],"about_ca_topic_score_codex":0.0035861318,"about_ca_topic_score_gemma":0.0059479782,"teacher_disagreement_score":0.019794345,"about_ca_system_score_codex":0.00087400863,"about_ca_system_score_gemma":0.0013632455,"threshold_uncertainty_score":0.066218674},"labels":[],"label_agreement":null},{"id":"W3046165332","doi":"10.18280/ts.370315","title":"Sequences with Perfect Periodic Auto and Cross Correlation Properties","year":2020,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Correlation; Cross-correlation; Mathematics; Computer science; Statistical physics; Statistics; Physics; Geometry","score_opus":0.02233387545748542,"score_gpt":0.2101774619114213,"score_spread":0.1878435864539359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046165332","genre_codex":"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.14103001,0.0014230701,0.83102596,0.00026155487,0.00018159997,0.000093078546,0.0004010565,0.0004536211,0.025130013],"genre_scores_gemma":[0.839334,0.0011050821,0.15206459,0.00016896689,0.00013707794,0.00014035663,0.00065316353,0.000092220944,0.0063044606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992435,0.00016854056,0.00006526977,0.00012616931,0.0003177588,0.00007877355],"domain_scores_gemma":[0.99770206,0.00079071056,0.0004535246,0.00041755254,0.0005541242,0.00008201833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006027805,0.00040457194,0.00038692576,0.00085412216,0.00033087967,0.00076970214,0.00025956848,0.00066753296,0.00195028],"category_scores_gemma":[0.0038403377,0.000194755,0.00025136024,0.0010236186,0.0006183149,0.00088949373,0.00043000214,0.00047875204,0.00095075346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043448538,0.00008701986,0.003144436,0.00065642915,0.0000623928,0.0011462977,0.0003441147,0.045893792,0.19195929,0.5296002,0.0030993726,0.22357215],"study_design_scores_gemma":[0.0000943468,0.0010258296,0.00677976,0.00023809662,0.00009466531,0.0075276983,0.00021666543,0.41182417,0.24977425,0.2679311,0.054319274,0.00017416631],"about_ca_topic_score_codex":0.00027222803,"about_ca_topic_score_gemma":0.00023111123,"teacher_disagreement_score":0.00195028,"about_ca_system_score_codex":0.0002775709,"about_ca_system_score_gemma":0.0006177889,"threshold_uncertainty_score":0.006524384},"labels":[],"label_agreement":null},{"id":"W3081150612","doi":"10.1515/jmc-2019-0033","title":"New Zémor-Tillich Type Hash Functions Over GL <sub>2</sub> (𝔽 <sub> <i>p</i> <sup> <i>n</i> </sup> </sub> )","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Mathematics; Lemma (botany); Discrete mathematics; Type (biology); Combinatorics; Hash chain; Class (philosophy); Group (periodic table); Set (abstract data type); Computer science; Physics; Biology","score_opus":0.018942253248732804,"score_gpt":0.2340439368169824,"score_spread":0.2151016835682496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081150612","genre_codex":"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.49373057,0.0010096389,0.4882696,0.00091231975,0.00019203135,0.00022263793,0.000380285,0.001197809,0.014085107],"genre_scores_gemma":[0.9357921,0.0003167927,0.057511244,0.00022538597,0.00012363485,0.00011350393,0.00025687923,0.000067508576,0.005592931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991416,0.0001542373,0.000056116492,0.0001339761,0.0003401496,0.00017386542],"domain_scores_gemma":[0.9981542,0.0005937526,0.00029186017,0.0006094181,0.00018755198,0.0001631999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284396,0.0004171939,0.00058584614,0.00097123696,0.0006295779,0.0012592815,0.0009722664,0.0008554892,0.00239502],"category_scores_gemma":[0.0025346351,0.00031254432,0.0005714908,0.00081707665,0.0020237514,0.0038910154,0.0022886894,0.0014232817,0.00065971643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018028283,0.00022423606,0.006255613,0.00028315498,0.00012958495,0.00086919987,0.001265185,0.02546356,0.076098666,0.73950726,0.0040345294,0.14406613],"study_design_scores_gemma":[0.00038043148,0.0014077966,0.0045751506,0.00012060227,0.0001717646,0.0029193424,0.0007089585,0.19685628,0.24813952,0.491608,0.052823845,0.00028825927],"about_ca_topic_score_codex":0.00017387359,"about_ca_topic_score_gemma":0.00026070466,"teacher_disagreement_score":0.00239502,"about_ca_system_score_codex":0.0008835955,"about_ca_system_score_gemma":0.00054770685,"threshold_uncertainty_score":0.008012176},"labels":[],"label_agreement":null},{"id":"W3083053830","doi":"10.1109/cec48606.2020.9185728","title":"Cryptanalysis of RSA: Integer Prime Factorization Using Genetic Algorithms","year":2020,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Prime factor; Integer factorization; Factorization; Integer (computer science); Prime number; Algorithm; Prime (order theory); Cryptanalysis; Mathematics; Computer science; Cryptosystem; Decimal; Genetic algorithm; Cryptography; Discrete mathematics; Arithmetic; Public-key cryptography; Combinatorics; Mathematical optimization; Encryption","score_opus":0.03534518883123066,"score_gpt":0.24723534307749917,"score_spread":0.2118901542462685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083053830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04252746,0.0012790554,0.94323915,0.0007431903,0.00015993367,0.00009404589,0.000042917265,0.0005620168,0.011352168],"genre_scores_gemma":[0.39259255,0.0021860169,0.5990047,0.00021758326,0.000073121904,0.000083055274,0.00008959099,0.00010363708,0.005649741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933416,0.00019932762,0.000027431908,0.000099164405,0.00027336576,0.00006650203],"domain_scores_gemma":[0.9993761,0.00035830485,0.000077581884,0.00009167632,0.00007653709,0.000019942183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009952418,0.00060664956,0.00055914896,0.0009595796,0.0006219376,0.001149282,0.0006947685,0.0008277754,0.0019071274],"category_scores_gemma":[0.0032170087,0.00019558347,0.0007342184,0.00087205926,0.0013394954,0.0012506347,0.00063451234,0.0011733309,0.0005716131],"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.0002401844,0.00016613287,0.0015559074,0.00025000796,0.000121433724,0.00018990983,0.00032292012,0.3202921,0.028529437,0.23728642,0.0017927762,0.40925285],"study_design_scores_gemma":[0.000115548115,0.0002603755,0.00080699817,0.00014473159,0.000081172126,0.0007032681,0.00016383386,0.75719005,0.045449357,0.17031564,0.024702244,0.00006679413],"about_ca_topic_score_codex":0.001510453,"about_ca_topic_score_gemma":0.0014394007,"teacher_disagreement_score":0.0019071274,"about_ca_system_score_codex":0.0008655665,"about_ca_system_score_gemma":0.0011419408,"threshold_uncertainty_score":0.0063800216},"labels":[],"label_agreement":null},{"id":"W3086805570","doi":"10.1007/s12095-021-00490-2","title":"Kim-type APN functions are affine equivalent to Gold functions","year":2021,"lang":"en","type":"preprint","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type (biology); Permutation (music); Affine transformation; Combinatorics; Mathematics; Function (biology); Physics; Pure mathematics","score_opus":0.04773061018136424,"score_gpt":0.27858215718456353,"score_spread":0.2308515470031993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086805570","genre_codex":"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.47290498,0.0008729918,0.1736487,0.001458143,0.0011398704,0.00015454489,0.0005002117,0.00061634183,0.34870416],"genre_scores_gemma":[0.92063016,0.00063855073,0.015354256,0.0007212616,0.00039884803,0.000099494384,0.00031842972,0.00026281137,0.061576076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993299,0.00014585632,0.000037187703,0.00012998685,0.00017264894,0.00018452003],"domain_scores_gemma":[0.9990121,0.00027157358,0.00015801456,0.00018854116,0.00020355037,0.00016624026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069897104,0.00097297214,0.00060593133,0.0020595128,0.0014698781,0.0030960008,0.00088270096,0.0011659369,0.009666714],"category_scores_gemma":[0.0024288613,0.00035468666,0.00078748126,0.0014658308,0.0024310816,0.0051246914,0.0019460457,0.002797916,0.0025047197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078106874,0.000018815483,0.00013702275,0.00002308617,0.000004317968,0.000088499764,0.000111202455,0.00046363485,0.0010946746,0.99007076,0.0010376939,0.0068721506],"study_design_scores_gemma":[0.000022202536,0.000039489587,0.00046904437,0.000023515318,0.000012007769,0.00028383842,0.00015155267,0.004612567,0.0027864173,0.9832086,0.008363913,0.000026783262],"about_ca_topic_score_codex":0.0006741873,"about_ca_topic_score_gemma":0.00048297865,"teacher_disagreement_score":0.009666714,"about_ca_system_score_codex":0.0013964336,"about_ca_system_score_gemma":0.0006062854,"threshold_uncertainty_score":0.03233838},"labels":[],"label_agreement":null},{"id":"W30882982","doi":"10.1007/978-1-4615-0304-0_10","title":"On Edit Distance Attack to Alternating Step Generator","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero (linguistics); Mathematics; Generator (circuit theory); Binary number; Combinatorics; String (physics); Edit distance; Conditional probability; Regular conditional probability; Discrete mathematics; Algorithm; Arithmetic; Probability mass function; Statistics; Probability distribution; Physics","score_opus":0.023100079193239264,"score_gpt":0.2447477257809203,"score_spread":0.22164764658768105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30882982","genre_codex":"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.060281064,0.0014559453,0.8440333,0.0027914962,0.00071301433,0.00019547962,0.00018551215,0.0011149273,0.08922926],"genre_scores_gemma":[0.76525414,0.0016996922,0.14745876,0.001149845,0.00066981075,0.00036700623,0.0004244158,0.0004192818,0.082557105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980118,0.00074294093,0.000076574666,0.00021587727,0.00075605535,0.00019668168],"domain_scores_gemma":[0.9964025,0.0020525532,0.00017336497,0.0009939239,0.0002877818,0.00008984599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012998391,0.00082997314,0.0007646694,0.0010407745,0.00094101246,0.001429678,0.0011312825,0.0017695423,0.0059031057],"category_scores_gemma":[0.0057300134,0.00036331097,0.00063541404,0.0011899286,0.0018235102,0.005116954,0.0027483734,0.0028304025,0.0015571683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017649346,0.000071555725,0.00026587903,0.00010646226,0.00003017478,0.00023234455,0.00027471318,0.017648123,0.005055086,0.8622615,0.011745344,0.10213239],"study_design_scores_gemma":[0.000048194106,0.0001145896,0.00016382878,0.00003741121,0.00002537985,0.00075618573,0.000052105628,0.13964862,0.009237547,0.8331327,0.016748149,0.000035189485],"about_ca_topic_score_codex":0.00024031683,"about_ca_topic_score_gemma":0.00017992777,"teacher_disagreement_score":0.0059031057,"about_ca_system_score_codex":0.0009044175,"about_ca_system_score_gemma":0.0006337986,"threshold_uncertainty_score":0.019747794},"labels":[],"label_agreement":null},{"id":"W3088897051","doi":"10.21136/cmj.2020.0543-19","title":"Sidon basis in polynomial rings over finite fields","year":2020,"lang":"en","type":"article","venue":"Czechoslovak Mathematical Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Basis (linear algebra); Polynomial ring; Pure mathematics; Finite field; Polynomial; Algebra over a field; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.02087699387912606,"score_gpt":0.24134891164860692,"score_spread":0.22047191776948086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088897051","genre_codex":"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.74301654,0.00071931677,0.13242917,0.0006103146,0.00024397421,0.00004547624,0.00030652044,0.0002565697,0.12237209],"genre_scores_gemma":[0.9581892,0.00035042813,0.021342283,0.000120343706,0.00005840012,0.000051168663,0.00038432077,0.000037864032,0.01946605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972576,0.000051009683,0.000014391716,0.00003350747,0.00007139744,0.000103895145],"domain_scores_gemma":[0.9997185,0.00008255769,0.00003307649,0.00003313477,0.0000518287,0.0000808255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041461838,0.00034138924,0.00036564074,0.0008094643,0.001174227,0.0012862391,0.000309111,0.0002646776,0.0037958943],"category_scores_gemma":[0.0005528846,0.00019241052,0.00038702667,0.0005861058,0.0011935362,0.0010530399,0.0013581229,0.0009270046,0.00086841156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113249975,0.000041011455,0.00063288107,0.000041395993,0.000004383663,0.00014915262,0.00024964026,0.0015276221,0.003492716,0.981619,0.0010855581,0.01104326],"study_design_scores_gemma":[0.000040538438,0.00015578819,0.0011823546,0.000058584155,0.000019079951,0.00038313202,0.00040445453,0.025967577,0.014750053,0.9356368,0.0213678,0.000033815875],"about_ca_topic_score_codex":0.00091906445,"about_ca_topic_score_gemma":0.0011323047,"teacher_disagreement_score":0.0037958943,"about_ca_system_score_codex":0.00086431537,"about_ca_system_score_gemma":0.0006664377,"threshold_uncertainty_score":0.012698531},"labels":[],"label_agreement":null},{"id":"W3088932472","doi":"10.1142/s0219498823500512","title":"Feedback linearly extended discrete functions","year":2021,"lang":"en","type":"preprint","venue":"Journal of Algebra and Its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Mathematics; Linear space; System of linear equations; Cryptography; Extension (predicate logic); Linear equation; Mathematical proof; Block cipher; Linear algebra; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.013034073725008904,"score_gpt":0.2499844969864728,"score_spread":0.2369504232614639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088932472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.1564224,0.00026000242,0.81991184,0.0003702567,0.0001125504,0.00009317294,0.00012568821,0.00045686672,0.022247247],"genre_scores_gemma":[0.8732421,0.0002734585,0.10371409,0.00021424759,0.0001251847,0.00017408673,0.00011465113,0.00013106014,0.022011098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993656,0.00016920282,0.000028906828,0.00013940893,0.00020134034,0.000095529416],"domain_scores_gemma":[0.9989447,0.00047639298,0.000114999624,0.00023076506,0.00013263087,0.00010048647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062832364,0.0005194326,0.00049180555,0.00044525045,0.0005356187,0.00095812295,0.00063096255,0.00050730933,0.0058903624],"category_scores_gemma":[0.0025922218,0.00021729007,0.00063976494,0.00030937366,0.0014811934,0.0024363652,0.0015205098,0.0013306602,0.0009875863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001989132,0.00009079879,0.00043859912,0.00009716942,0.000019308263,0.00021995502,0.0002946306,0.05716781,0.017485198,0.8769842,0.0009928697,0.04601053],"study_design_scores_gemma":[0.00006313327,0.00022718975,0.00025840985,0.000034129833,0.000017231587,0.00031536186,0.0001019434,0.44550776,0.012848567,0.5295801,0.010999254,0.00004696282],"about_ca_topic_score_codex":0.0003970363,"about_ca_topic_score_gemma":0.00036222127,"teacher_disagreement_score":0.0058903624,"about_ca_system_score_codex":0.0008157888,"about_ca_system_score_gemma":0.0004075879,"threshold_uncertainty_score":0.019705236},"labels":[],"label_agreement":null},{"id":"W3090085778","doi":"10.4086/toc.2020.v016a005","title":"","year":2020,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Achievement Rewards for College Scientists Foundation; Center for Long-Term Cybersecurity, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Combinatorics; Degree (music); Hyperplane; Inverse; Product (mathematics); Discrete mathematics; Geometry; Physics","score_opus":0.026835770313589143,"score_gpt":0.2276405655685452,"score_spread":0.20080479525495606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090085778","genre_codex":"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.506964,0.0016834458,0.4320515,0.0032385779,0.00028997206,0.00037777293,0.003801307,0.0015273499,0.050066084],"genre_scores_gemma":[0.97456115,0.00031128246,0.019029032,0.0005450422,0.0001854761,0.0001239095,0.0012143763,0.00013278762,0.0038970322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99455523,0.002101514,0.0002373031,0.0010167562,0.0014377707,0.0006513103],"domain_scores_gemma":[0.9382183,0.04637594,0.003056096,0.008994353,0.0021537733,0.0012014386],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0037192535,0.0011031164,0.0016377174,0.0015438263,0.0011820135,0.002024209,0.0019663433,0.0014849183,0.009303106],"category_scores_gemma":[0.055354606,0.00038967555,0.0009442276,0.001962571,0.0027941042,0.005795365,0.0034924902,0.002011524,0.0022379968],"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.00311414,0.0006093492,0.10360051,0.0009654877,0.00035876717,0.00081616687,0.0005580346,0.049575284,0.014155193,0.55278236,0.02031375,0.25315097],"study_design_scores_gemma":[0.00027557192,0.0009243383,0.024832912,0.00020205755,0.00015814792,0.0021709544,0.00069703977,0.19795047,0.025438184,0.72833335,0.018845525,0.00017145638],"about_ca_topic_score_codex":0.0009540947,"about_ca_topic_score_gemma":0.0013957561,"teacher_disagreement_score":0.9906969,"about_ca_system_score_codex":0.0011068665,"about_ca_system_score_gemma":0.00092769833,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3092499131","doi":"10.1007/s00200-020-00467-3","title":"On the stability of periodic binary sequences with zone restriction","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Algorithm; Computer science","score_opus":0.014500206227143132,"score_gpt":0.19992791936478252,"score_spread":0.1854277131376394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092499131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.72151023,0.000536045,0.27012125,0.00033868878,0.000040893818,0.00006773824,0.00032385153,0.00024764496,0.00681368],"genre_scores_gemma":[0.9787369,0.00015310681,0.019253349,0.000050075243,0.00004119631,0.00007546592,0.00022513165,0.000036263267,0.0014285109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858785,0.0003319844,0.0000871542,0.00025502843,0.0005922262,0.00014578458],"domain_scores_gemma":[0.98966295,0.0061997906,0.0018530968,0.00068942487,0.0011709308,0.0004238261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398272,0.00040186933,0.0005377403,0.0020544052,0.0006622182,0.0011501592,0.0006584884,0.00059569394,0.002010126],"category_scores_gemma":[0.012224405,0.00021934186,0.00038613778,0.001059271,0.0017167463,0.0019842659,0.0010630703,0.000900363,0.00025380746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014427529,0.00008665628,0.013484392,0.00036532865,0.00009113193,0.00042467128,0.0006720541,0.43023303,0.049986627,0.44623858,0.0016052097,0.055369623],"study_design_scores_gemma":[0.000025560557,0.00019409033,0.003143169,0.00004111289,0.000014324807,0.00017215354,0.00010485576,0.8770007,0.010308075,0.10795553,0.0009834738,0.000056957135],"about_ca_topic_score_codex":0.0012500999,"about_ca_topic_score_gemma":0.0005048109,"teacher_disagreement_score":0.0020544052,"about_ca_system_score_codex":0.0010235962,"about_ca_system_score_gemma":0.0005919492,"threshold_uncertainty_score":0.007426679},"labels":[],"label_agreement":null},{"id":"W3093330059","doi":"10.1145/3679015","title":"Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Construct (python library); Combinatorics; Greedy algorithm; Mathematics; Space (punctuation); De Bruijn graph; Computer science; Algorithm; Discrete mathematics; Theoretical computer science","score_opus":0.014745811284684978,"score_gpt":0.2426197850901976,"score_spread":0.22787397380551264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093330059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.06683932,0.0004902413,0.9049979,0.00068435696,0.00028742943,0.0003456961,0.0006696249,0.0013181209,0.024367258],"genre_scores_gemma":[0.31565878,0.000569797,0.6680262,0.00043766957,0.00016490075,0.0004908651,0.0014680487,0.00046133247,0.012722366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978719,0.0005000114,0.00018081808,0.00035212922,0.00076132047,0.0003338245],"domain_scores_gemma":[0.9961228,0.0013991026,0.00033000438,0.0012619507,0.00066223025,0.00022395153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127383,0.0008275554,0.00087143335,0.0014888239,0.0015824008,0.001655781,0.0013946526,0.0010234358,0.006552841],"category_scores_gemma":[0.006702317,0.0007944873,0.0010203345,0.001813413,0.0014248963,0.0037642224,0.0031891572,0.001973578,0.0025090147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048755764,0.00020494335,0.0009272124,0.00038732958,0.0000363117,0.00046490168,0.00076910114,0.024359645,0.03018755,0.70538443,0.009979755,0.22681135],"study_design_scores_gemma":[0.00017272169,0.00035846664,0.00058376964,0.00013667489,0.000047623653,0.0014329562,0.00047297316,0.17094639,0.05878093,0.71642625,0.05048514,0.00015616907],"about_ca_topic_score_codex":0.0005481907,"about_ca_topic_score_gemma":0.0011136825,"teacher_disagreement_score":0.006552841,"about_ca_system_score_codex":0.0006736645,"about_ca_system_score_gemma":0.001716394,"threshold_uncertainty_score":0.021921456},"labels":[],"label_agreement":null},{"id":"W3094918795","doi":"10.26493/1855-3974.2374.9ff","title":"New results on modular Golomb rulers, optical orthogonal codes and related structures","year":2020,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Golomb coding; Mathematics; Modular design; Combinatorics; Order (exchange); Discrete mathematics; Computer science; Image (mathematics)","score_opus":0.03876912149739215,"score_gpt":0.27644960453701095,"score_spread":0.2376804830396188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094918795","genre_codex":"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.29839182,0.005549363,0.55701053,0.0022215205,0.0005519217,0.00013703103,0.0003981372,0.0003389885,0.13540076],"genre_scores_gemma":[0.85369426,0.0034741443,0.12613715,0.0005753416,0.0007045775,0.00018084548,0.00041339488,0.00011923817,0.014701148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864954,0.00022329009,0.00010816979,0.00026614856,0.00057701697,0.00017577762],"domain_scores_gemma":[0.99387395,0.003856476,0.00067523884,0.0006130634,0.00074910716,0.0002321625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016158842,0.00069994223,0.0006321914,0.002279172,0.0013820871,0.0019956857,0.0010931023,0.0010876247,0.0042680115],"category_scores_gemma":[0.0077659795,0.0005266555,0.0007617525,0.0012065603,0.0031407212,0.0066201007,0.002107303,0.0024586504,0.00070488313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004744894,0.00004148374,0.0010565362,0.00022165262,0.000014685391,0.00036501532,0.00032554084,0.003986513,0.006338737,0.965671,0.0014795306,0.020451907],"study_design_scores_gemma":[0.00002104344,0.00011430547,0.0008397912,0.00010134052,0.000030412506,0.0018250126,0.0003466882,0.023366354,0.010683148,0.9482134,0.014408937,0.00004963482],"about_ca_topic_score_codex":0.00022504033,"about_ca_topic_score_gemma":0.0002623636,"teacher_disagreement_score":0.0042680115,"about_ca_system_score_codex":0.0008050588,"about_ca_system_score_gemma":0.00050545775,"threshold_uncertainty_score":0.014277935},"labels":[],"label_agreement":null},{"id":"W3097401090","doi":"10.4230/lipics.icalp.2021.18","title":"Relaxed Locally Correctable Codes with Improved Parameters","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code word; Mathematics; Decoding methods; Block (permutation group theory); Combinatorics; Constant (computer programming); Discrete mathematics; Block code; List decoding; Algorithm; Computer science; Concatenated error correction code","score_opus":0.009338702257736227,"score_gpt":0.21309815665717333,"score_spread":0.2037594543994371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097401090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.11233132,0.0018479575,0.8641547,0.0025772096,0.00024239464,0.00053024804,0.0016013602,0.0033130061,0.013401805],"genre_scores_gemma":[0.71774143,0.0012628266,0.26654238,0.0012871363,0.00023751592,0.0008867382,0.0019957186,0.0010130823,0.009033169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911624,0.00209547,0.00064135564,0.0018342825,0.0031974032,0.0010690821],"domain_scores_gemma":[0.9656037,0.017466547,0.0022495072,0.010962225,0.0029328405,0.00078516675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004087563,0.0018710704,0.0020807795,0.0011153171,0.0008927759,0.0032664896,0.0035593826,0.0030143003,0.0067986646],"category_scores_gemma":[0.047667615,0.0010651575,0.001360058,0.0020651105,0.0029394496,0.011447306,0.0070452173,0.00863743,0.0029207019],"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.0023054897,0.00029996433,0.0029657274,0.00064664544,0.00014368638,0.000442768,0.0012448125,0.5276796,0.035550438,0.32787165,0.007980883,0.092868306],"study_design_scores_gemma":[0.00032444866,0.00044014858,0.00043373983,0.0001451359,0.00007677524,0.00042207807,0.00019649888,0.785306,0.020253513,0.18271708,0.009489727,0.00019492007],"about_ca_topic_score_codex":0.0032698372,"about_ca_topic_score_gemma":0.0029050426,"teacher_disagreement_score":0.0067986646,"about_ca_system_score_codex":0.0035331924,"about_ca_system_score_gemma":0.003757132,"threshold_uncertainty_score":0.025635302},"labels":[],"label_agreement":null},{"id":"W3098017919","doi":"","title":"MINIMAL MODELS FOR RATIONAL FUNCTIONS IN A DYNAMICAL SETTING","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Simon Fraser University","funders":"","keywords":"Mathematics; Rational function; Orbit (dynamics); Rational number; Conjecture; Elliptic rational functions; Set (abstract data type); Function (biology); Quadratic equation; Pure mathematics; Dynamical systems theory; Discrete mathematics; Computer science; Elliptic curve; Geometry","score_opus":0.018219096254482644,"score_gpt":0.23829896445878615,"score_spread":0.2200798682043035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098017919","genre_codex":"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.6455949,0.00016753536,0.33805692,0.0005730843,0.000039560804,0.00009563364,0.00088007574,0.00093183696,0.013660535],"genre_scores_gemma":[0.94185036,0.000048653437,0.05528266,0.000032937332,0.000020242987,0.000038808437,0.00086460606,0.00009394711,0.0017678067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960345,0.000066558474,0.000029795588,0.00009216526,0.00012733672,0.00008063881],"domain_scores_gemma":[0.9992005,0.0003697357,0.00009602034,0.00016564455,0.00009834427,0.000069725626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035943516,0.00047428926,0.000632898,0.0014453944,0.0009856964,0.002053988,0.0009978723,0.000698644,0.0064553586],"category_scores_gemma":[0.003366067,0.00030198743,0.0011185138,0.00070165267,0.0012331782,0.0029294228,0.001371507,0.00081750663,0.00065862836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002850514,0.00012257653,0.0048564086,0.00017135518,0.00004285812,0.00046605445,0.00057170435,0.050449304,0.008167779,0.90355563,0.0024747294,0.02883644],"study_design_scores_gemma":[0.000050326682,0.00005729362,0.000548422,0.000033863802,0.000025606434,0.00017817174,0.0003360027,0.21735811,0.0067039174,0.77069515,0.0039800713,0.00003307304],"about_ca_topic_score_codex":0.001108215,"about_ca_topic_score_gemma":0.0015084307,"teacher_disagreement_score":0.0064553586,"about_ca_system_score_codex":0.0010646168,"about_ca_system_score_gemma":0.00059173856,"threshold_uncertainty_score":0.021595359},"labels":[],"label_agreement":null},{"id":"W3099148554","doi":"","title":"Fast Encoding and Decoding of Gabidulin Codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; List decoding; Encoding (memory); Computer science; Coding (social sciences); Sequential decoding; Metric (unit); Theoretical computer science; Algorithm; Berlekamp–Welch algorithm; Concatenated error correction code; Block code; Mathematics; Artificial intelligence","score_opus":0.024738018419190207,"score_gpt":0.256358574827968,"score_spread":0.23162055640877777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099148554","genre_codex":"methods","genre_gemma":"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.068394125,0.00056083896,0.9214183,0.0003532433,0.00012833707,0.00007165153,0.00017561615,0.00084756315,0.008050287],"genre_scores_gemma":[0.4132342,0.00057950645,0.5778195,0.00017216447,0.00010467849,0.00010395385,0.00041516597,0.00015624202,0.0074145277],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991536,0.00024147563,0.000059215272,0.000096526295,0.0003175233,0.00013163994],"domain_scores_gemma":[0.9988952,0.0004148599,0.000113670576,0.00020125767,0.00032082066,0.000054143184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074149953,0.0006830088,0.0005375481,0.0010679608,0.00059751276,0.001420236,0.0006703266,0.00085175305,0.0019235187],"category_scores_gemma":[0.0027367729,0.00021615955,0.00041340795,0.0010005253,0.00060519023,0.0011186219,0.0014147399,0.0009817507,0.0012523828],"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.0008396747,0.000089701985,0.0016691006,0.00022784981,0.000059715036,0.0004409017,0.00058211293,0.10470427,0.09430101,0.34662855,0.006157668,0.44429943],"study_design_scores_gemma":[0.00007444487,0.00016685048,0.00041033197,0.00007018517,0.000022753868,0.0006671675,0.00010102386,0.7504007,0.11466021,0.11939989,0.013969938,0.00005655878],"about_ca_topic_score_codex":0.0010932283,"about_ca_topic_score_gemma":0.0011296979,"teacher_disagreement_score":0.0019235187,"about_ca_system_score_codex":0.0007424997,"about_ca_system_score_gemma":0.0011098984,"threshold_uncertainty_score":0.006434858},"labels":[],"label_agreement":null},{"id":"W3099901842","doi":"","title":"On permutation binomials over finite fields","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Finite field; Combinatorics; Binomial (polynomial); Permutation (music); Field (mathematics); Binomial coefficient; Polynomial; Gaussian binomial coefficient; Discrete mathematics; Negative binomial distribution; Pure mathematics; Physics; Statistics; Mathematical analysis","score_opus":0.012060074968069823,"score_gpt":0.23320000709834293,"score_spread":0.2211399321302731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099901842","genre_codex":"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.55747545,0.0018083702,0.2786452,0.0025803335,0.00073736656,0.00012496559,0.00029425602,0.00045389554,0.15788011],"genre_scores_gemma":[0.9642784,0.001268374,0.019036166,0.00042888924,0.0006748186,0.00008302362,0.00021551206,0.0001286896,0.013886196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998672,0.0004177594,0.00005890652,0.00012989932,0.00037379918,0.00034754572],"domain_scores_gemma":[0.9979323,0.0012762918,0.0002016107,0.00023763138,0.00018587266,0.00016632145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018827387,0.0005088123,0.00061439315,0.0014749075,0.0016113688,0.0016249229,0.0004379771,0.00060786505,0.0058242376],"category_scores_gemma":[0.00525625,0.0004149266,0.0006345995,0.0013322002,0.0031401524,0.0036583235,0.0018645313,0.001818704,0.0012332241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008526765,0.00002224293,0.00033307855,0.000032176988,0.000004376798,0.00025919607,0.00020757668,0.0024600928,0.0017642537,0.984709,0.0015129023,0.008609884],"study_design_scores_gemma":[0.000026954433,0.000029408677,0.00024773105,0.000029897217,0.0000075320786,0.00023341393,0.00005628866,0.01149142,0.0015433179,0.98141944,0.0048993505,0.000015233773],"about_ca_topic_score_codex":0.00084349664,"about_ca_topic_score_gemma":0.00075564213,"teacher_disagreement_score":0.0058242376,"about_ca_system_score_codex":0.0011624941,"about_ca_system_score_gemma":0.0007182156,"threshold_uncertainty_score":0.019484043},"labels":[],"label_agreement":null},{"id":"W3101685628","doi":"10.1016/j.tcs.2020.11.018","title":"Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Lexicographical order; Sequence (biology); Combinatorics; Mathematics; Representation (politics); Construct (python library); Greedy algorithm; Simple (philosophy); Discrete mathematics; Algorithm; Computer science","score_opus":0.02492197415689523,"score_gpt":0.2510284939185019,"score_spread":0.22610651976160667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101685628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.07766749,0.0018998979,0.59268945,0.008039417,0.0032821156,0.00015225825,0.0006223513,0.00084855687,0.31479844],"genre_scores_gemma":[0.7118185,0.0022098494,0.22920792,0.0031463786,0.0014530645,0.0002646578,0.0006233677,0.0012770334,0.04999928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958977,0.0015592147,0.00024768425,0.0005012704,0.0012925506,0.00050159445],"domain_scores_gemma":[0.993166,0.0030222256,0.00031068223,0.002238312,0.0009977465,0.00026505394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037295884,0.000850716,0.0008294711,0.0019254852,0.0033614184,0.0043779155,0.0018018965,0.0021911727,0.010549225],"category_scores_gemma":[0.013284634,0.0006886504,0.0010252359,0.0021911834,0.005116105,0.011271646,0.004175283,0.004992253,0.003737073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024567082,0.000010065699,0.000054423635,0.000024437419,0.0000019928268,0.000029715655,0.00012174068,0.00036531332,0.0005343903,0.99160236,0.00084740313,0.0063836453],"study_design_scores_gemma":[0.000009820821,0.000015024559,0.000054450826,0.000030786407,0.0000071882046,0.00015058865,0.00008663774,0.0024389161,0.0018083982,0.97823346,0.017145425,0.000019327585],"about_ca_topic_score_codex":0.000787902,"about_ca_topic_score_gemma":0.0010426417,"teacher_disagreement_score":0.010549225,"about_ca_system_score_codex":0.0011813776,"about_ca_system_score_gemma":0.0018621447,"threshold_uncertainty_score":0.03529066},"labels":[],"label_agreement":null},{"id":"W3103484676","doi":"","title":"Fast computation of the roots of polynomials over the ring of power series","year":2017,"lang":"en","type":"preprint","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Series (stratigraphy); Computation; Ring (chemistry); Power series; Computer science; Power (physics); Mathematics; Algorithm; Physics; Mathematical analysis","score_opus":0.014583707499634578,"score_gpt":0.22237244522748698,"score_spread":0.2077887377278524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103484676","genre_codex":"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.095016964,0.00048523882,0.8928566,0.0003656906,0.000080839665,0.00008886871,0.0003810718,0.0041075037,0.006617221],"genre_scores_gemma":[0.45681897,0.00025054484,0.5344073,0.00010456691,0.00006771588,0.00009177568,0.000810035,0.00046628853,0.006982762],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992637,0.00009390184,0.00005428116,0.00017681812,0.00026004686,0.00015126681],"domain_scores_gemma":[0.9987704,0.00046770388,0.000120994664,0.0003856679,0.00019536536,0.000059801954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055758766,0.00089331076,0.0009347101,0.001032354,0.00059893215,0.0014532096,0.0009198346,0.0006375776,0.0065121413],"category_scores_gemma":[0.004275514,0.0003826215,0.000601354,0.0011007157,0.00083119667,0.0028055897,0.0016809233,0.0013196943,0.002960521],"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.000927878,0.00015810259,0.0041256077,0.00044982487,0.000083228995,0.0004374087,0.0006211432,0.058090452,0.043505218,0.16778105,0.014348324,0.7094718],"study_design_scores_gemma":[0.00029731283,0.00033338415,0.0012123281,0.00011130805,0.00007027485,0.00086399994,0.00031166815,0.49374196,0.10453813,0.37446147,0.023969878,0.000088301],"about_ca_topic_score_codex":0.0009897122,"about_ca_topic_score_gemma":0.0014545843,"teacher_disagreement_score":0.0065121413,"about_ca_system_score_codex":0.00087554613,"about_ca_system_score_gemma":0.0013782969,"threshold_uncertainty_score":0.02178526},"labels":[],"label_agreement":null},{"id":"W3103656886","doi":"10.22215/etd/2020-14317","title":"Error Correcting Codes in Post-Quantum Cryptography","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"McEliece cryptosystem; Cryptosystem; Computer science; Key encapsulation; Cryptography; Public-key cryptography; Coding theory; Theoretical computer science; NIST; Error detection and correction; Key size; Computer security; Algorithm; Symmetric-key algorithm; Encryption","score_opus":0.014853325197370355,"score_gpt":0.26071084434221675,"score_spread":0.2458575191448464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103656886","genre_codex":"methods","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.027569525,0.23332028,0.3874816,0.013013642,0.0035952984,0.00018110174,0.0002851641,0.00047953037,0.3340738],"genre_scores_gemma":[0.49085557,0.25628528,0.11739521,0.0030381826,0.005199639,0.0003517403,0.0003642821,0.00032076766,0.12618926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00019701521,0.00003110632,0.00008417975,0.00034615092,0.00008898933],"domain_scores_gemma":[0.999206,0.00045262263,0.0000412426,0.000110873836,0.00016288992,0.000026376969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012193548,0.00047120155,0.00043602797,0.0012472549,0.0008393703,0.002165555,0.00047470877,0.0012187696,0.003788915],"category_scores_gemma":[0.0017720205,0.00028000478,0.00039020862,0.0013108691,0.0032709762,0.002860723,0.00097352563,0.0026569762,0.001486093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044220874,0.000007690656,0.000027757096,0.00007635732,0.000002270028,0.000016343814,0.00011188884,0.0013220625,0.0002979244,0.9777174,0.0020043342,0.018411648],"study_design_scores_gemma":[0.0000053900403,0.000025107296,0.00012320341,0.0002854456,0.0000049774003,0.00012817446,0.00006601796,0.0029815158,0.0018143775,0.8460166,0.14853,0.00001926665],"about_ca_topic_score_codex":0.0005875251,"about_ca_topic_score_gemma":0.00036131407,"teacher_disagreement_score":0.003788915,"about_ca_system_score_codex":0.001507992,"about_ca_system_score_gemma":0.0013870959,"threshold_uncertainty_score":0.012675166},"labels":[],"label_agreement":null},{"id":"W3104505159","doi":"","title":"THE FREQUENCY OF ELLIPTIC CURVE GROUPS OVER PRIME FINITE FIELDS","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"","keywords":"Mathematics; Pointwise; Elliptic curve; Conjecture; Prime (order theory); Group (periodic table); Combinatorics; Integer (computer science); Bounded function; Finite group; Order (exchange); Cyclic group; Prime number; Algebraic number field; Finite field; Prime number theorem; Asymptotic formula; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics; Abelian group; Quantum mechanics","score_opus":0.010901713623249994,"score_gpt":0.21963552476260687,"score_spread":0.20873381113935688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104505159","genre_codex":"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.93839914,0.0010652611,0.048556335,0.0017767726,0.000093924595,0.000036430454,0.0003122867,0.00041817158,0.009341572],"genre_scores_gemma":[0.99403834,0.00038185497,0.0040380917,0.000078278434,0.00017134324,0.00005979945,0.00019623947,0.000056574827,0.000979458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973979,0.0006670967,0.0001022276,0.0006941364,0.0005935913,0.00054511375],"domain_scores_gemma":[0.98468184,0.009539512,0.0017202322,0.0024273486,0.00065209327,0.0009789345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028680011,0.00054860633,0.00093937176,0.0029876754,0.0019600873,0.0025751523,0.0019251701,0.0016495027,0.00269794],"category_scores_gemma":[0.024349032,0.00060998567,0.0007145011,0.0014456373,0.004317809,0.0053409347,0.0032248655,0.0026383058,0.00045211456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014363106,0.00038766855,0.048796616,0.00045068676,0.00013656632,0.0012500138,0.002676037,0.052378096,0.026114658,0.79987466,0.006590025,0.059908696],"study_design_scores_gemma":[0.00014180833,0.0003778796,0.019232651,0.00021367155,0.00011094103,0.0026651316,0.0007376996,0.24775608,0.025377605,0.69309497,0.010074944,0.00021663026],"about_ca_topic_score_codex":0.0006775422,"about_ca_topic_score_gemma":0.00040541223,"teacher_disagreement_score":0.0029876754,"about_ca_system_score_codex":0.0020704356,"about_ca_system_score_gemma":0.00080249296,"threshold_uncertainty_score":0.015167594},"labels":[],"label_agreement":null},{"id":"W3104885263","doi":"10.48550/arxiv.1710.07765","title":"On the Derivative Imbalance and Ambiguity of Functions","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Abelian group; Mathematics; Ambiguity; Upper and lower bounds; Multiplicative function; Nonlinear system; Inverse; Discrete mathematics; Measure (data warehouse); Combinatorics; Applied mathematics; Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.06407652677467528,"score_gpt":0.17461623467384446,"score_spread":0.11053970789916918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104885263","genre_codex":"methods","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.3709832,0.008482296,0.45775378,0.006822052,0.00063490623,0.00007964795,0.00046603414,0.0002698367,0.15450826],"genre_scores_gemma":[0.95762604,0.0021662952,0.026742578,0.00053137547,0.00055744103,0.00006662558,0.00014465029,0.000118205455,0.0120466985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979044,0.00050421146,0.00013174421,0.0004914893,0.0006585879,0.00030958548],"domain_scores_gemma":[0.9895573,0.007116625,0.0009548118,0.0011323807,0.00069038,0.00054855493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030689365,0.0010108333,0.0011501,0.0031367706,0.0016860306,0.0036888674,0.0009763458,0.001514467,0.003962526],"category_scores_gemma":[0.01506289,0.0005454115,0.0009521676,0.0016648244,0.008377027,0.009537668,0.003928449,0.0034713803,0.00072240015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005560486,0.000008201873,0.00055254466,0.00002468524,0.0000055414307,0.00006517864,0.00018965127,0.0025399681,0.0009378517,0.9898206,0.0003419707,0.005458121],"study_design_scores_gemma":[0.000014671325,0.00004864481,0.00054287195,0.000054416883,0.000012552999,0.00024670656,0.00012008746,0.021418141,0.0013271285,0.9694257,0.006754746,0.00003434616],"about_ca_topic_score_codex":0.0008436337,"about_ca_topic_score_gemma":0.00040759606,"teacher_disagreement_score":0.003962526,"about_ca_system_score_codex":0.0030497145,"about_ca_system_score_gemma":0.00068727386,"threshold_uncertainty_score":0.02212733},"labels":[],"label_agreement":null},{"id":"W3105288378","doi":"","title":"Codes and Supersymmetry in One Dimension","year":2011,"lang":"en","type":"article","venue":"UWA Profiles and Research Repository (University of Western Australia)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dimension (graph theory); Enumeration; Topology (electrical circuits); Code (set theory); Computation; Network topology; Supersymmetry; Mathematics; Discrete mathematics; Computer science; Combinatorics; Set (abstract data type); Algorithm; Mathematical physics","score_opus":0.12623930580998557,"score_gpt":0.28935174643963296,"score_spread":0.1631124406296474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105288378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.93087757,0.00047358416,0.01482878,0.00031183474,0.000047576043,0.000012283662,0.00017247876,0.00007948461,0.05319638],"genre_scores_gemma":[0.99004924,0.00022561783,0.0051871203,0.000049611743,0.000026852653,0.000010487697,0.00009777534,0.000018289666,0.0043349867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980944,0.000042101747,0.000012752078,0.000036161655,0.000054449632,0.000045039666],"domain_scores_gemma":[0.9995535,0.00011972742,0.00009505749,0.00007220015,0.0000717689,0.00008775232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022725367,0.00021949041,0.00024084235,0.0011675635,0.00097339536,0.0012487343,0.00022550773,0.00034057754,0.0027669682],"category_scores_gemma":[0.0007352207,0.00014254217,0.0002539079,0.0005572984,0.0016167631,0.0014916692,0.00088863267,0.0005605181,0.00040669675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004319364,0.000013347462,0.0012399947,0.000029668949,0.0000050625126,0.00017765295,0.00034345218,0.0020393806,0.0029975225,0.984994,0.0004979061,0.0076187705],"study_design_scores_gemma":[0.000007931643,0.000024470288,0.0007715752,0.000019898434,0.0000043314353,0.00020035067,0.00016741698,0.0046422193,0.0013949865,0.9897076,0.0030454912,0.0000139022395],"about_ca_topic_score_codex":0.0008370684,"about_ca_topic_score_gemma":0.0011643858,"teacher_disagreement_score":0.0027669682,"about_ca_system_score_codex":0.00047909055,"about_ca_system_score_gemma":0.00031866936,"threshold_uncertainty_score":0.0092564225},"labels":[],"label_agreement":null},{"id":"W3107248454","doi":"10.1007/s11786-020-00495-9","title":"Mathematics in Computer Science volume / Common Factors in Fraction-Free Matrix Decompositions","year":2021,"lang":"en","type":"article","venue":"University Library Linz repository (Johannes Kepler Universitat Linz)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Fraction (chemistry); Mathematics; Matrix (chemical analysis); LU decomposition; Reduction (mathematics); Computation; QR decomposition; Sparse matrix; Matrix decomposition; Triangular matrix; Combinatorics; Eigenvalues and eigenvectors; Algorithm; Pure mathematics; Computational chemistry; Gaussian; Geometry; Physics","score_opus":0.006337564556684981,"score_gpt":0.19198404876411987,"score_spread":0.18564648420743488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107248454","genre_codex":"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.17448922,0.0060179224,0.4587539,0.008591002,0.002251493,0.00014097043,0.0019022716,0.0013158335,0.3465374],"genre_scores_gemma":[0.8735624,0.002725785,0.040087324,0.0009836709,0.0023851865,0.00013276657,0.0009998735,0.00071828597,0.078404896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870837,0.00027709923,0.0000627296,0.00027154328,0.00046610882,0.00021414654],"domain_scores_gemma":[0.9971762,0.001139974,0.00032025753,0.0005253342,0.0005003958,0.00033784506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009969795,0.0008777798,0.00091491913,0.0035069543,0.001303682,0.0052037025,0.000748479,0.0007905565,0.018733593],"category_scores_gemma":[0.006400554,0.00042130353,0.0007740404,0.0032090782,0.0026556724,0.005116814,0.0019264732,0.0024258834,0.0037926843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040208386,0.000015864985,0.0001864775,0.00004845115,0.0000075822804,0.000025828687,0.00014135883,0.0008700386,0.0006043145,0.98140794,0.0056161433,0.011035738],"study_design_scores_gemma":[0.0000067403485,0.000009426857,0.00016315533,0.000016036984,0.0000061925393,0.00008797794,0.000024314444,0.0025840346,0.0005126349,0.9889204,0.0076601487,0.000009024814],"about_ca_topic_score_codex":0.00070576736,"about_ca_topic_score_gemma":0.00058076746,"teacher_disagreement_score":0.018733593,"about_ca_system_score_codex":0.0016977799,"about_ca_system_score_gemma":0.00080464926,"threshold_uncertainty_score":0.06267011},"labels":[],"label_agreement":null},{"id":"W3112560171","doi":"10.3934/amc.2020125","title":"On ideal $ t $-tuple distribution of orthogonal functions in filtering de bruijn generators","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; De Bruijn sequence; Tuple; Combinatorics; Ideal (ethics); Binary number; Generator (circuit theory); Discrete mathematics; Sequence (biology); Arithmetic","score_opus":0.02528393588309801,"score_gpt":0.2869563206010946,"score_spread":0.2616723847179966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112560171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.29195288,0.0006778546,0.68112946,0.0006622014,0.00012979803,0.00010804554,0.00065537717,0.00071302167,0.02397142],"genre_scores_gemma":[0.9439269,0.00053311285,0.04254435,0.0002719363,0.00026587743,0.00027150798,0.00075044937,0.00048784868,0.010948034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984425,0.00050648145,0.00007389569,0.00033522194,0.00035759172,0.00028441835],"domain_scores_gemma":[0.99539447,0.0026638182,0.0005359063,0.0006001419,0.0004661648,0.00033948995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016165976,0.0005152929,0.0006452528,0.0014225033,0.00089475245,0.0017322716,0.000814747,0.00077373284,0.00620892],"category_scores_gemma":[0.008550189,0.00032838198,0.00071042794,0.0010204172,0.0018164243,0.0022651777,0.00095351395,0.0011366626,0.0014029185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021211967,0.00003974167,0.0018778134,0.00007561636,0.000015939271,0.00027498064,0.00021855815,0.020739404,0.008885153,0.9472577,0.0019183392,0.018484663],"study_design_scores_gemma":[0.00006175583,0.00016492551,0.0019099966,0.00005532717,0.000018419058,0.0005864558,0.00011593318,0.31220344,0.011480748,0.6677323,0.0055766166,0.00009407431],"about_ca_topic_score_codex":0.00067878247,"about_ca_topic_score_gemma":0.00042088545,"teacher_disagreement_score":0.00620892,"about_ca_system_score_codex":0.0009852317,"about_ca_system_score_gemma":0.0006684191,"threshold_uncertainty_score":0.020770907},"labels":[],"label_agreement":null},{"id":"W3113528066","doi":"10.1016/j.jnt.2020.11.009","title":"Gap principle of divisibility sequences of polynomials","year":2020,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Divisibility rule; Order (exchange); Combinatorics; Polynomial; Conjecture; Integer (computer science); Discrete mathematics; Mathematical analysis","score_opus":0.03901787686208228,"score_gpt":0.29367471951881574,"score_spread":0.25465684265673344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113528066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.41637102,0.0021490958,0.33893418,0.008209719,0.0010664449,0.00015970568,0.0006768765,0.0006036909,0.23182921],"genre_scores_gemma":[0.93612075,0.0012130428,0.029943604,0.0012068511,0.0010444848,0.00022476783,0.0003615524,0.00034385757,0.029541083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811697,0.0005326923,0.00007596893,0.00034476368,0.00053445855,0.00039516023],"domain_scores_gemma":[0.9935383,0.0041686893,0.00031682712,0.00064509193,0.0006054735,0.0007256099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027664893,0.001136837,0.0016812083,0.0030903837,0.0026329933,0.004134078,0.0021319655,0.0022303148,0.009381863],"category_scores_gemma":[0.010008145,0.0008150808,0.001249203,0.0016662087,0.0065919515,0.009018891,0.005450017,0.007742206,0.0013588694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043354037,0.000009932543,0.000053124604,0.000022927123,0.000003326925,0.000021702988,0.000095457915,0.00031974932,0.00032999835,0.99656075,0.00046542686,0.002074164],"study_design_scores_gemma":[0.000014818938,0.000014936077,0.000056734574,0.000009834256,0.0000027217848,0.000038261012,0.000023618955,0.0018095748,0.00022014334,0.99676335,0.0010399212,0.0000060478046],"about_ca_topic_score_codex":0.00054961356,"about_ca_topic_score_gemma":0.00032073527,"teacher_disagreement_score":0.009381863,"about_ca_system_score_codex":0.0022374878,"about_ca_system_score_gemma":0.0012268131,"threshold_uncertainty_score":0.03138542},"labels":[],"label_agreement":null},{"id":"W3115319021","doi":"10.1109/uemcon51285.2020.9298177","title":"Optimal Labeling with Cyclic Gray Codes for Generalized 16PAM Constellations","year":2020,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Compute Canada","keywords":"Gray code; Constellation; Computer science; Gray (unit); Algorithm; Mathematics; Physics","score_opus":0.026636058101324092,"score_gpt":0.2470954724922617,"score_spread":0.22045941439093758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115319021","genre_codex":"methods","genre_gemma":"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.35556215,0.0006028275,0.63299364,0.0005022358,0.00003221722,0.000063854124,0.0001235652,0.00021533183,0.009904249],"genre_scores_gemma":[0.85919034,0.00030985684,0.13909282,0.00009036616,0.00002398597,0.000060460974,0.000091515285,0.00003758596,0.0011030638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999371,0.00027658165,0.000029463266,0.00008524658,0.00014861782,0.00008915968],"domain_scores_gemma":[0.9988674,0.0005930163,0.00020109533,0.00018680848,0.00010216686,0.000049486433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078580255,0.00030700694,0.00037257696,0.00046957904,0.00037238997,0.00058844866,0.00033537284,0.00042507137,0.00089335715],"category_scores_gemma":[0.003337229,0.00017383297,0.00018387746,0.00072836445,0.0010993315,0.0009740559,0.00075570116,0.00035085646,0.00017068438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065704033,0.00009361247,0.001630921,0.00019742815,0.000030360294,0.0002594696,0.00051901466,0.34813115,0.06136378,0.46338716,0.0012411915,0.12248888],"study_design_scores_gemma":[0.000054684002,0.00020270079,0.00059704366,0.000049479266,0.000017479524,0.00021005547,0.00010116551,0.7600672,0.035518486,0.19893067,0.0042064255,0.000044609995],"about_ca_topic_score_codex":0.0006091447,"about_ca_topic_score_gemma":0.0006766694,"teacher_disagreement_score":0.00089335715,"about_ca_system_score_codex":0.0008451729,"about_ca_system_score_gemma":0.00090510835,"threshold_uncertainty_score":0.006132245},"labels":[],"label_agreement":null},{"id":"W3121783067","doi":"","title":"2 TURYN-TYPE SEQUENCES: CLASSIFICATION, ENUMERATION AND CONSTRUCTION","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Mathematics; Enumeration; Combinatorics; Type (biology); Equivalence (formal languages); Construct (python library); Equivalence relation; Discrete mathematics","score_opus":0.019663406855316267,"score_gpt":0.22907554908332142,"score_spread":0.20941214222800517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121783067","genre_codex":"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.7098244,0.0014779925,0.21635921,0.00073167065,0.00027819327,0.00015914199,0.0012807427,0.0003140444,0.06957456],"genre_scores_gemma":[0.9178526,0.00056643854,0.068693414,0.00021134687,0.0001618684,0.00017299826,0.0014309195,0.00009106184,0.010819489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927574,0.00016469487,0.000095870724,0.00012856332,0.00016552342,0.0001695499],"domain_scores_gemma":[0.9986816,0.000443724,0.00026446566,0.00015199692,0.00031377966,0.00014443246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006049059,0.00038025412,0.0005048109,0.0026215385,0.0010006374,0.0017261656,0.0004889782,0.0007958072,0.003913721],"category_scores_gemma":[0.002174571,0.00026789142,0.0004150257,0.0019911171,0.0014686966,0.002129984,0.0011108641,0.0010529266,0.0007437358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073566494,0.000040913368,0.002795368,0.00007780841,0.000006620031,0.00016343214,0.00042697115,0.0022203063,0.0028506091,0.96323705,0.0017962516,0.026311204],"study_design_scores_gemma":[0.000017264196,0.00008538555,0.00294599,0.000116967494,0.000012600533,0.000980491,0.0003078035,0.024504995,0.0057600033,0.9390255,0.026192691,0.000050279374],"about_ca_topic_score_codex":0.000553817,"about_ca_topic_score_gemma":0.00038807958,"teacher_disagreement_score":0.003913721,"about_ca_system_score_codex":0.0008646465,"about_ca_system_score_gemma":0.00055553025,"threshold_uncertainty_score":0.013092756},"labels":[],"label_agreement":null},{"id":"W3123136894","doi":"10.4153/s0008439521000035","title":"Vanishing of multizeta values over at negative integers","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Valuation (finance); Finite field; Statement (logic); Element (criminal law); Discrete mathematics","score_opus":0.010789220712540957,"score_gpt":0.21743265659883818,"score_spread":0.20664343588629722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123136894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.96724844,0.00033767428,0.015315457,0.0003525435,0.00005831838,0.000010747745,0.00005136791,0.00010550682,0.016520027],"genre_scores_gemma":[0.9962864,0.000115031646,0.0012567037,0.00003714243,0.00005060811,0.000008915168,0.000031003365,0.000035018926,0.002179282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953115,0.000094447234,0.000024090212,0.00008500093,0.00011035053,0.00015500849],"domain_scores_gemma":[0.998418,0.00064679736,0.00026924367,0.00014048775,0.00019671032,0.0003287533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064961653,0.0004888188,0.00057596224,0.0025724703,0.0011075821,0.0023701603,0.0007591253,0.00045572102,0.0035392717],"category_scores_gemma":[0.0036945553,0.0003503499,0.0005053727,0.00081810314,0.0036574563,0.004357127,0.0015473637,0.0014392355,0.00040804897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036112664,0.00008148393,0.0067806505,0.00013808043,0.00003474042,0.0011541283,0.000854299,0.0031261283,0.01650632,0.9595745,0.0011369117,0.010251716],"study_design_scores_gemma":[0.000072099,0.00019537909,0.005927412,0.0001238696,0.000059548453,0.0023096085,0.0006238617,0.026944233,0.018790133,0.9400257,0.0048261033,0.00010206002],"about_ca_topic_score_codex":0.00047924308,"about_ca_topic_score_gemma":0.00040075698,"teacher_disagreement_score":0.0035392717,"about_ca_system_score_codex":0.0010110851,"about_ca_system_score_gemma":0.00038332684,"threshold_uncertainty_score":0.011840045},"labels":[],"label_agreement":null},{"id":"W3131781081","doi":"10.1007/s40314-021-01425-6","title":"Some skew constacyclic codes over $$\\mathbb {F}_{q}+u\\mathbb {F}_{q}$$","year":2021,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Skew; Combinatorics; Mathematics; Ring (chemistry); Extension (predicate logic); Code (set theory); Discrete mathematics; Integer (computer science); Magma; Physics; Computer science","score_opus":0.0147979128769053,"score_gpt":0.23760458405689175,"score_spread":0.22280667117998645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131781081","genre_codex":"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.59735626,0.0018084137,0.25449854,0.005188535,0.001241822,0.00023544178,0.0023579018,0.001369491,0.13594352],"genre_scores_gemma":[0.9260852,0.0007976156,0.030706508,0.0010367932,0.00045104668,0.00020644082,0.00070867024,0.00041176428,0.03959602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985495,0.00027537695,0.000086113825,0.00025674418,0.0003949166,0.00043726206],"domain_scores_gemma":[0.99718034,0.001370224,0.0003294844,0.00038954432,0.00044827,0.00028206792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000997654,0.0010220322,0.00090666936,0.0014732778,0.0023093182,0.0027287886,0.0007084041,0.0012933982,0.0077295997],"category_scores_gemma":[0.004955657,0.0004936756,0.00075058395,0.0022108553,0.0022625593,0.0024842173,0.0016951624,0.0023656073,0.0015101611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017775084,0.000036044905,0.00032863938,0.00004012098,0.000009057899,0.00021491184,0.00019906087,0.002591574,0.0017969764,0.9808045,0.003071473,0.0107299],"study_design_scores_gemma":[0.000045343735,0.000048032085,0.00032599145,0.000039147206,0.0000147488645,0.00021765681,0.00008715829,0.011767476,0.003691525,0.97655326,0.0071644983,0.000045091558],"about_ca_topic_score_codex":0.0016523296,"about_ca_topic_score_gemma":0.0015949217,"teacher_disagreement_score":0.0077295997,"about_ca_system_score_codex":0.0020535013,"about_ca_system_score_gemma":0.002369441,"threshold_uncertainty_score":0.025858045},"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":"W3134795428","doi":"10.4208/cmr.2021-0029","title":"Generalized Cyclotomic Mappings: Switching Between Polynomial, Cyclotomic, and Wreath Product Form","year":2022,"lang":"en","type":"article","venue":"Communications in Mathematical Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wreath product; Cyclotomic polynomial; Mathematics; Product (mathematics); Polynomial; Reciprocal polynomial; Pure mathematics; Combinatorics; Algebra over a field; Discrete mathematics; Matrix polynomial; Mathematical analysis; Geometry","score_opus":0.14362795037890888,"score_gpt":0.4024250961783892,"score_spread":0.2587971457994803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134795428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7221797,0.0010180785,0.16334127,0.00090170617,0.00049175555,0.00011924762,0.0001831061,0.00032090335,0.11144416],"genre_scores_gemma":[0.9525114,0.0005745917,0.02984107,0.00024513924,0.0002100049,0.00006339202,0.00013264931,0.00013126603,0.01629045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995472,0.00009069276,0.000032240594,0.0001266592,0.00010248287,0.00010067719],"domain_scores_gemma":[0.99949765,0.00010419428,0.000058776983,0.00020300745,0.00006151028,0.00007488317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039164006,0.0003043532,0.00027716896,0.00068068405,0.0008919681,0.0017599654,0.00044838485,0.00057665765,0.0040060026],"category_scores_gemma":[0.0017389398,0.0001731874,0.00043665394,0.00071311067,0.002158043,0.0028065876,0.0010405054,0.0009958997,0.00057292846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000301341,0.000016309748,0.0003180339,0.00001741083,0.000002672478,0.0001915649,0.0003854131,0.0006389536,0.0043012225,0.9785524,0.00046335266,0.015082563],"study_design_scores_gemma":[0.000013901185,0.000062404084,0.0005590768,0.000021694934,0.000007373428,0.00083702465,0.00040583807,0.008293636,0.007672972,0.9633229,0.018775353,0.00002784755],"about_ca_topic_score_codex":0.0005729421,"about_ca_topic_score_gemma":0.00053813355,"teacher_disagreement_score":0.0040060026,"about_ca_system_score_codex":0.0007590866,"about_ca_system_score_gemma":0.00043598973,"threshold_uncertainty_score":0.013401389},"labels":[],"label_agreement":null},{"id":"W3135612806","doi":"10.1109/tit.2021.3129767","title":"Space–Time Codes From Sum-Rank Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block code; Rank (graph theory); Generalization; Mathematics; Metric (unit); Concatenated error correction code; Construct (python library); Linear code; Expander code; Computer science; Discrete mathematics; Algorithm; Decoding methods; Combinatorics; Engineering","score_opus":0.010482989564470219,"score_gpt":0.22020837598437343,"score_spread":0.2097253864199032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135612806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04315046,0.0010745322,0.9076364,0.00062573346,0.00018592342,0.00015764886,0.00046659814,0.0005069509,0.046195768],"genre_scores_gemma":[0.5610404,0.002237359,0.40951696,0.0006839297,0.00039011196,0.00044377943,0.001147397,0.00027201837,0.02426815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942625,0.000124174,0.000030398965,0.00005433329,0.00030925733,0.000055636832],"domain_scores_gemma":[0.99930215,0.00022058474,0.00010835306,0.00014015229,0.00017687182,0.000051808307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036262293,0.00052399887,0.0002953156,0.00081990863,0.00037305904,0.0009960196,0.00042745314,0.0006333086,0.00350142],"category_scores_gemma":[0.0020341026,0.00020792591,0.00040492226,0.00078336115,0.00087511,0.0010291375,0.0014453805,0.0016259027,0.0013593917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005960249,0.000018964798,0.0001332239,0.00012775426,0.00001091011,0.000096300166,0.0001258426,0.044498503,0.012887431,0.88678503,0.0023351116,0.052921426],"study_design_scores_gemma":[0.00004340764,0.0001184515,0.00033415036,0.000096551434,0.000014108346,0.0005852777,0.00005855236,0.20945615,0.03124948,0.71154976,0.046429418,0.0000647573],"about_ca_topic_score_codex":0.00053567305,"about_ca_topic_score_gemma":0.00062667654,"teacher_disagreement_score":0.00350142,"about_ca_system_score_codex":0.00064830494,"about_ca_system_score_gemma":0.0010152076,"threshold_uncertainty_score":0.011713386},"labels":[],"label_agreement":null},{"id":"W3135842381","doi":"10.1049/cdt2.12026","title":"Low‐space bit‐serial systolic array architecture for interleaved multiplication over GF(2 <sup> <i>m</i> </sup> )","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Arithmetic; Application-specific integrated circuit; Systolic array; Computer science; Multiplication (music); GF(2); Binary number; Cryptography; Finite field; Computer hardware; Parallel computing; Mathematics; Algorithm; Embedded system; Discrete mathematics; Combinatorics","score_opus":0.007820306266085804,"score_gpt":0.230148635912285,"score_spread":0.2223283296461992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135842381","genre_codex":"methods","genre_gemma":"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.19162787,0.0006607727,0.78864574,0.0003587925,0.00023752818,0.00010989808,0.000198558,0.002514027,0.015646758],"genre_scores_gemma":[0.6398074,0.00043374283,0.34807798,0.00018309025,0.00011145302,0.00010658396,0.00040531118,0.00005411162,0.010820353],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999119,0.000020362115,0.000009225345,0.000014662896,0.000033167264,0.000010788938],"domain_scores_gemma":[0.99987423,0.000015617214,0.000022084334,0.000019443576,0.000058941056,0.000009737465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012324264,0.000299195,0.00015526266,0.00039075324,0.00027637678,0.0003763662,0.0006755196,0.00022959361,0.003196349],"category_scores_gemma":[0.00021777458,0.00011456877,0.00017848118,0.00055671675,0.00016228687,0.00045156776,0.00018420754,0.00027472668,0.0012399234],"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.0006192101,0.00015599362,0.0019501704,0.00030960506,0.00008670305,0.00048779862,0.00017059341,0.022525314,0.5460081,0.044146437,0.006692581,0.37684754],"study_design_scores_gemma":[0.00034227702,0.0026843378,0.0027343284,0.000087010296,0.0002020366,0.002149472,0.00013439376,0.43736863,0.471709,0.015849328,0.066652775,0.000086391636],"about_ca_topic_score_codex":0.0003970836,"about_ca_topic_score_gemma":0.0009881783,"teacher_disagreement_score":0.003196349,"about_ca_system_score_codex":0.00025097563,"about_ca_system_score_gemma":0.0005207758,"threshold_uncertainty_score":0.010692894},"labels":[],"label_agreement":null},{"id":"W3136843670","doi":"","title":"On symmetric (78, 22, 6) designs and related self-orthogonal codes","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Orthogonal array; Combinatorics; Arithmetic; Discrete mathematics; Statistics","score_opus":0.01960781965211929,"score_gpt":0.24961681807749406,"score_spread":0.23000899842537476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136843670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5203271,0.0017502736,0.24312504,0.004015041,0.0008610392,0.00018062482,0.00062264537,0.0002468066,0.2288715],"genre_scores_gemma":[0.8962194,0.0015112937,0.0459436,0.0010299785,0.00085879525,0.00026618066,0.0003357588,0.00015661838,0.05367844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984604,0.0006110672,0.00006548785,0.00016713026,0.0004055609,0.00029040076],"domain_scores_gemma":[0.9969099,0.0014610325,0.0006138512,0.00044379602,0.00035998973,0.00021153665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016864585,0.001008835,0.00067534164,0.0021244152,0.0022353374,0.002469371,0.0009775274,0.0020207807,0.0072608767],"category_scores_gemma":[0.005694233,0.0005497917,0.00074020895,0.0021077301,0.0036354063,0.0036017871,0.002819199,0.0022383013,0.0016990781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000217166,0.0000069448956,0.00005440405,0.000012295168,0.0000020392288,0.000027587883,0.000085322434,0.0007494785,0.00022052498,0.9960224,0.00043812065,0.0023592554],"study_design_scores_gemma":[0.0000121133,0.000011471256,0.000043285218,0.00001119653,0.0000030296683,0.00005483999,0.00003078228,0.0026992713,0.00022939757,0.9955701,0.0013244713,0.000010021212],"about_ca_topic_score_codex":0.00067035883,"about_ca_topic_score_gemma":0.0007362111,"teacher_disagreement_score":0.0072608767,"about_ca_system_score_codex":0.0016170947,"about_ca_system_score_gemma":0.0014532759,"threshold_uncertainty_score":0.024290085},"labels":[],"label_agreement":null},{"id":"W314096538","doi":"10.1109/ccc.2010.14","title":"Simple Affine Extractors Using Dimension Expansion","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Omega; Affine transformation; Dimension (graph theory); Combinatorics; Constant (computer programming); Mathematics; Affine combination; Affine space; Field (mathematics); Simple (philosophy); Type (biology); Discrete mathematics; Physics; Pure mathematics; Quantum mechanics; Computer science","score_opus":0.016612393714402044,"score_gpt":0.2560692697915057,"score_spread":0.23945687607710364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W314096538","genre_codex":"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.02158645,0.0012561146,0.935354,0.00038473285,0.00036042812,0.00020319481,0.0017124604,0.0112261195,0.027916588],"genre_scores_gemma":[0.23940231,0.0017599998,0.6900684,0.0006647239,0.00057466276,0.0004130597,0.00815236,0.0034446637,0.05551977],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789065,0.00021322402,0.00021114323,0.00050445757,0.0009119783,0.00026856485],"domain_scores_gemma":[0.9986565,0.00032341655,0.00013915307,0.00051453116,0.0002810728,0.00008528285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084591215,0.0017348166,0.0010837684,0.002147879,0.00076576136,0.002507502,0.001338873,0.0009080972,0.021541309],"category_scores_gemma":[0.0037332184,0.00073637377,0.0016217135,0.0019745568,0.0014447812,0.003992917,0.004231079,0.002269,0.012174528],"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.00067255256,0.00017198965,0.0013605631,0.00065030647,0.00014271666,0.00060208136,0.0005102591,0.009305976,0.038411874,0.2362348,0.034989823,0.6769471],"study_design_scores_gemma":[0.00021853023,0.00046083456,0.0019815287,0.00038261188,0.00024363863,0.0018236462,0.00048544584,0.11850207,0.13548028,0.47939128,0.26073202,0.00029810207],"about_ca_topic_score_codex":0.00078705326,"about_ca_topic_score_gemma":0.0014237637,"teacher_disagreement_score":0.021541309,"about_ca_system_score_codex":0.0006959122,"about_ca_system_score_gemma":0.0008191289,"threshold_uncertainty_score":0.07206279},"labels":[],"label_agreement":null},{"id":"W3140997097","doi":"10.1007/978-3-030-90567-5_6","title":"On MILP-Based Automatic Search for Bit-Based Division Property for Ciphers with (Large) Linear Layers","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Division (mathematics); Permutation (music); Computer science; Multiplication (music); Integer programming; Algorithm; Integer (computer science); Linear programming; Matrix (chemical analysis); Set (abstract data type); Invertible matrix; Theoretical computer science; Mathematics; Mathematical optimization; Arithmetic","score_opus":0.023792039517128483,"score_gpt":0.28191057570485345,"score_spread":0.25811853618772496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140997097","genre_codex":"methods","genre_gemma":"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.05248456,0.00039418883,0.93533653,0.00039961454,0.00012819462,0.00014236465,0.00022935495,0.0015717124,0.0093134465],"genre_scores_gemma":[0.67239976,0.00033028814,0.3204408,0.00045258302,0.00017923731,0.0002647766,0.00077796064,0.0003630901,0.004791407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987205,0.00034548325,0.00008730804,0.00020138528,0.0004090852,0.0002362969],"domain_scores_gemma":[0.9972939,0.0015296796,0.00015152871,0.00059136597,0.0003083889,0.00012511418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013181663,0.0008185913,0.0013181757,0.0015358368,0.0007963694,0.0020563547,0.001237839,0.0010659645,0.007744485],"category_scores_gemma":[0.00650094,0.000465249,0.0011179732,0.0013342967,0.0014093851,0.0034415382,0.0030437575,0.0019619388,0.0015819932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015596586,0.0004126542,0.0019356492,0.00068264344,0.00015436778,0.0003792351,0.00036670142,0.16667476,0.039827287,0.44141367,0.01684414,0.32974926],"study_design_scores_gemma":[0.00006232733,0.00013224666,0.00016220515,0.00003971469,0.000030720905,0.00010014568,0.00003781497,0.8162149,0.0070329583,0.17446367,0.0016957698,0.000027546264],"about_ca_topic_score_codex":0.00082606665,"about_ca_topic_score_gemma":0.00091262936,"teacher_disagreement_score":0.007744485,"about_ca_system_score_codex":0.0008908564,"about_ca_system_score_gemma":0.0014317333,"threshold_uncertainty_score":0.025907874},"labels":[],"label_agreement":null},{"id":"W3150871087","doi":"","title":"Quaternary Quasi-Cyclic Codes with Even Length Components.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quaternary; Mathematics; Geology; Paleontology","score_opus":0.025103895406318192,"score_gpt":0.21940292284172855,"score_spread":0.19429902743541036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150871087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.44267756,0.007000292,0.33135378,0.003740071,0.001644377,0.00022880523,0.0018092408,0.00071959256,0.2108263],"genre_scores_gemma":[0.9269617,0.0020265556,0.036195192,0.0007873344,0.0005101747,0.00010632958,0.000621552,0.0001138776,0.03267725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.00015576456,0.000042568554,0.00007722923,0.00022200514,0.00013888419],"domain_scores_gemma":[0.9983392,0.00055211125,0.00028082813,0.0003545189,0.00030725324,0.00016600112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006241823,0.0004431382,0.0004121568,0.0010745688,0.00094854855,0.0018078414,0.00045845401,0.0007003359,0.0059860926],"category_scores_gemma":[0.0028073885,0.0003097972,0.00032185297,0.0010505088,0.0013157643,0.00180329,0.0012025686,0.0010217077,0.0015567902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001132907,0.000021440717,0.00039297756,0.00007439718,0.000007999465,0.0001695752,0.00011920642,0.0013707378,0.006930621,0.97061586,0.003260685,0.01692315],"study_design_scores_gemma":[0.00005259409,0.000112786256,0.00088570017,0.000080154656,0.000027392036,0.0008753898,0.00010508946,0.016938461,0.009337246,0.93522286,0.03631715,0.000045113793],"about_ca_topic_score_codex":0.0004879136,"about_ca_topic_score_gemma":0.000736305,"teacher_disagreement_score":0.0059860926,"about_ca_system_score_codex":0.0007540186,"about_ca_system_score_gemma":0.0010234227,"threshold_uncertainty_score":0.020025492},"labels":[],"label_agreement":null},{"id":"W3155947921","doi":"","title":"On some transitive combinatorial structures and codes constructed from the symplectic group S(6, 2)","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Symplectic geometry; Group (periodic table); Symplectic group; Combinatorics; Pure mathematics; Discrete mathematics; Physics","score_opus":0.009439262635961614,"score_gpt":0.22536039241987535,"score_spread":0.21592112978391373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155947921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.896307,0.00037358087,0.04107582,0.0010946753,0.00022001768,0.000076246586,0.00052485865,0.00016616788,0.060161654],"genre_scores_gemma":[0.97729445,0.00024123119,0.00969878,0.00021637788,0.00015164819,0.000065996304,0.0004903178,0.000094360694,0.011746795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993648,0.00014573515,0.000032944423,0.00009678473,0.00018952186,0.00017021452],"domain_scores_gemma":[0.99827266,0.00069194625,0.0003873854,0.00020478337,0.00017071726,0.00027243025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044182574,0.00071662467,0.00064556225,0.0023937786,0.0027554492,0.0023076236,0.0008911127,0.001363502,0.005860505],"category_scores_gemma":[0.0022418331,0.0004941685,0.00085415796,0.0015209877,0.003098135,0.0023724334,0.0016613108,0.0019205677,0.00059507915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005992863,0.000027434551,0.0004324004,0.000028874569,0.0000070649253,0.00026291987,0.00042626724,0.0023446241,0.0011634005,0.99092686,0.0010416901,0.0032785737],"study_design_scores_gemma":[0.000028684239,0.000038239912,0.0004712684,0.000022667049,0.0000087498265,0.00024914066,0.00016355896,0.01094271,0.0007543042,0.98511827,0.0021732755,0.000029078852],"about_ca_topic_score_codex":0.0013014018,"about_ca_topic_score_gemma":0.0017957601,"teacher_disagreement_score":0.005860505,"about_ca_system_score_codex":0.00109821,"about_ca_system_score_gemma":0.00095366075,"threshold_uncertainty_score":0.019605339},"labels":[],"label_agreement":null},{"id":"W3157716736","doi":"10.25073/2588-1086/vnucsce.240","title":"Performance of Orthogonal Frequency Division Multiplexing Based Advanced Encryption Standard","year":2020,"lang":"en","type":"article","venue":"VNU Journal of Science Computer Science and Communication Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Encryption; Advanced Encryption Standard; Computer network; Physical layer; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.011756225582458854,"score_gpt":0.21899476441871077,"score_spread":0.20723853883625193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157716736","genre_codex":"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.82078433,0.0074362,0.09833167,0.0013764811,0.000460589,0.00019972971,0.001010998,0.0023183515,0.068081714],"genre_scores_gemma":[0.9901336,0.0007606701,0.005723151,0.000081400794,0.000034918285,0.000034913624,0.00043299247,0.00003409874,0.0027641954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710196,0.0006364558,0.00018004095,0.00033556685,0.001234721,0.00051110965],"domain_scores_gemma":[0.9965744,0.0012175817,0.00032312816,0.0002870291,0.0015297747,0.00006802984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013267051,0.00057577586,0.00047666262,0.000970398,0.00053268654,0.0012632507,0.0004991398,0.00070346746,0.0037079945],"category_scores_gemma":[0.0049289963,0.00011770552,0.00020445799,0.0006817722,0.00027693043,0.0019390003,0.00067945913,0.00045829298,0.0011553884],"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.0061081033,0.0007715348,0.05618598,0.0011228421,0.00033468415,0.0016599721,0.0008590921,0.18420835,0.24313404,0.07630519,0.017521637,0.41178855],"study_design_scores_gemma":[0.00015341719,0.003024518,0.014831815,0.00014069668,0.00017501887,0.0025838427,0.00036284752,0.6831984,0.265918,0.009448862,0.019959787,0.00020274027],"about_ca_topic_score_codex":0.0011365927,"about_ca_topic_score_gemma":0.00045702176,"teacher_disagreement_score":0.0037079945,"about_ca_system_score_codex":0.0008522296,"about_ca_system_score_gemma":0.0005392961,"threshold_uncertainty_score":0.012404501},"labels":[],"label_agreement":null},{"id":"W3158493150","doi":"10.3934/math.2021428","title":"Unit groups of finite group algebras of Abelian groups of order 17 to 20","year":2021,"lang":"en","type":"article","venue":"AIMS Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Abelian group; Group (periodic table); Mathematics; Order (exchange); Unit (ring theory); Elementary abelian group; Rank of an abelian group; G-module; Non-abelian group; Pure mathematics; p-group; Field (mathematics); Finite group; Combinatorics; Algebra over a field; Physics; Mathematics education; Quantum mechanics","score_opus":0.01969302596798267,"score_gpt":0.24367161276261948,"score_spread":0.2239785867946368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158493150","genre_codex":"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.9581312,0.00033431774,0.01537613,0.00025741613,0.000041628344,0.000037174606,0.00012258948,0.00007391432,0.025625736],"genre_scores_gemma":[0.9910182,0.00010865276,0.0039679375,0.00004714094,0.00003881423,0.00003187824,0.00014732058,0.000018876282,0.0046212645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978775,0.000050121107,0.000012227973,0.000024720674,0.000041254378,0.00008393914],"domain_scores_gemma":[0.9994381,0.00011997373,0.00017361293,0.000030979805,0.00006942156,0.00016787951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028340012,0.0002566,0.00022645509,0.00097259355,0.0007611992,0.00097499223,0.00046249136,0.00025555576,0.0067604915],"category_scores_gemma":[0.0008122327,0.00014374605,0.0002655448,0.0004112163,0.0013893837,0.001586283,0.00090244587,0.00038716706,0.00057888904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000180275,0.00007139797,0.0031910143,0.000038920934,0.000013090276,0.00025336057,0.001362736,0.00079059106,0.0061900998,0.97654265,0.0010473289,0.010318535],"study_design_scores_gemma":[0.000063235304,0.00021504545,0.005450107,0.000060148122,0.000023218598,0.00066614576,0.0016139942,0.007959658,0.01786569,0.94837517,0.01766297,0.000044687677],"about_ca_topic_score_codex":0.00072509865,"about_ca_topic_score_gemma":0.00063509715,"teacher_disagreement_score":0.0067604915,"about_ca_system_score_codex":0.0005795683,"about_ca_system_score_gemma":0.00062882504,"threshold_uncertainty_score":0.022616029},"labels":[],"label_agreement":null},{"id":"W3158772284","doi":"10.48550/arxiv.2105.02374","title":"The additive index of polynomials over finite fields","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Multiplicative function; Mathematics; Permutation (music); Character (mathematics); Polynomial; Set (abstract data type); Index (typography); Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis; Computer science; Physics","score_opus":0.03920610609754951,"score_gpt":0.17957277293206456,"score_spread":0.14036666683451504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158772284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.37253702,0.0037546274,0.5100541,0.0030675514,0.0009078165,0.00007240465,0.00043258606,0.00040750438,0.108766325],"genre_scores_gemma":[0.94262093,0.001487508,0.045536358,0.00034618052,0.001206638,0.00006024344,0.00019279352,0.00010320311,0.008446085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750024,0.00043523475,0.00014998774,0.0004529743,0.0011194128,0.00034216596],"domain_scores_gemma":[0.99466103,0.0029767945,0.00062138174,0.00073702686,0.00055923185,0.0004445093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001822483,0.0006699028,0.00081104744,0.0027545805,0.0012577915,0.0045483024,0.0013281173,0.0007529663,0.003172983],"category_scores_gemma":[0.007912579,0.00032595996,0.00060465233,0.0021949837,0.004179526,0.0111756865,0.0025056705,0.0033924764,0.00070626894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023514627,0.000014777292,0.00023913429,0.000029000157,0.0000040908417,0.00004618699,0.000100876845,0.00083901937,0.0011631602,0.992192,0.00024193582,0.0051063234],"study_design_scores_gemma":[0.000007737664,0.000051748928,0.00031132318,0.00003053402,0.000013076507,0.00024812116,0.000073885894,0.008577048,0.0026256775,0.98192585,0.0061132815,0.000021667045],"about_ca_topic_score_codex":0.000202205,"about_ca_topic_score_gemma":0.00015528858,"teacher_disagreement_score":0.0045483024,"about_ca_system_score_codex":0.0013673512,"about_ca_system_score_gemma":0.0006672814,"threshold_uncertainty_score":0.010614693},"labels":[],"label_agreement":null},{"id":"W3167837386","doi":"10.1109/icjece.2020.3035182","title":"Compact Bit-Parallel Systolic Multiplier Over GF(2<i><sup>m</sup></i>)","year":2021,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Multiplier (economics); Arithmetic; Computer hardware; Parallel computing; Mathematics","score_opus":0.006237417558194646,"score_gpt":0.1783032788657816,"score_spread":0.17206586130758694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167837386","genre_codex":"methods","genre_gemma":"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.12180419,0.0010403808,0.85075253,0.00032994992,0.0003495272,0.00015410058,0.00052572653,0.0040885527,0.02095508],"genre_scores_gemma":[0.39952266,0.0008026205,0.57774246,0.00030695036,0.00028485135,0.00019491701,0.0014625903,0.00016078164,0.019522198],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985945,0.000019447443,0.000015153052,0.000025445628,0.00006258654,0.000017953418],"domain_scores_gemma":[0.99979955,0.000032409367,0.000043041124,0.000039832506,0.0000682679,0.000016880143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001685603,0.00048784664,0.00031292444,0.00050801295,0.00034063176,0.000506739,0.0007046745,0.000271136,0.005978981],"category_scores_gemma":[0.00045497902,0.00016327886,0.0003238018,0.00083898497,0.00017509342,0.0007915059,0.00038784993,0.00030432735,0.0025572572],"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.0007574726,0.00018450453,0.00086955755,0.00038825447,0.00007681675,0.00065114896,0.00019182707,0.022681613,0.3175788,0.042002875,0.010301372,0.6043158],"study_design_scores_gemma":[0.00057508127,0.0039950316,0.0030888438,0.00016518551,0.00025159956,0.004039532,0.00022174933,0.32265794,0.47512633,0.04554164,0.14420122,0.00013592053],"about_ca_topic_score_codex":0.0003734813,"about_ca_topic_score_gemma":0.0010870451,"teacher_disagreement_score":0.005978981,"about_ca_system_score_codex":0.0003003691,"about_ca_system_score_gemma":0.0008778714,"threshold_uncertainty_score":0.02000165},"labels":[],"label_agreement":null},{"id":"W3169276539","doi":"10.1515/spma-2021-0154","title":"Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Finite field; Rank (graph theory); Principal (computer security); Mathematics; Combinatorics; Field (mathematics); Electron paramagnetic resonance; Pure mathematics; Discrete mathematics; Physics; Computer science; Quantum mechanics; Genetics; Biology","score_opus":0.019173717969474775,"score_gpt":0.23007974273332416,"score_spread":0.21090602476384937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169276539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9418,0.00023071532,0.04313032,0.00039636396,0.000039103117,0.000041012554,0.0002817694,0.00009073947,0.013990018],"genre_scores_gemma":[0.9921185,0.00008792548,0.0055456553,0.000044297973,0.000088409375,0.00002971638,0.000169528,0.00001416791,0.0019017486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935085,0.0001711987,0.000043408465,0.000118105876,0.0002039525,0.00011255349],"domain_scores_gemma":[0.99342304,0.0028117027,0.0016458136,0.0003974186,0.00081147527,0.00091067376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085062365,0.00025053933,0.0004150223,0.0020928404,0.00057468866,0.0015691394,0.0005322983,0.00048427153,0.003439756],"category_scores_gemma":[0.0045490493,0.0002257439,0.00022779404,0.0012813946,0.0017934846,0.0025448992,0.00064049335,0.0008757176,0.00031280663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002608816,0.000068609465,0.0025786809,0.00006312842,0.00001264752,0.00046979607,0.00030531696,0.007523762,0.007911774,0.96997863,0.0009398028,0.009886928],"study_design_scores_gemma":[0.00007615197,0.00021913821,0.0032073536,0.00003800349,0.000017190916,0.0013114368,0.00018960654,0.045382652,0.00506291,0.940522,0.003918348,0.000055082695],"about_ca_topic_score_codex":0.00030732146,"about_ca_topic_score_gemma":0.0002430321,"teacher_disagreement_score":0.003439756,"about_ca_system_score_codex":0.0008514496,"about_ca_system_score_gemma":0.00043624354,"threshold_uncertainty_score":0.0115071535},"labels":[],"label_agreement":null},{"id":"W3169525880","doi":"","title":"Three Cousins of Recamán's Sequence","year":2020,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Combinatorics; Concatenation (mathematics); Sequence (biology); Conjecture; Multiplicative function; Product (mathematics); Mathematics; Arithmetic; Geometry; Chemistry","score_opus":0.02553951201979339,"score_gpt":0.2218846697340467,"score_spread":0.19634515771425332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169525880","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17734972,0.009001177,0.19880208,0.025533266,0.008957503,0.00018608443,0.0008872243,0.002646442,0.57663655],"genre_scores_gemma":[0.67956835,0.0035827914,0.11629219,0.0066510043,0.0024388642,0.0003239254,0.0008442153,0.0020244662,0.18827417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847144,0.00038524924,0.00006228213,0.0003365158,0.0005026287,0.0002418282],"domain_scores_gemma":[0.99834585,0.00054767967,0.00014514239,0.00029344548,0.0004202138,0.00024762933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013464662,0.000994984,0.00080054766,0.001641898,0.0024336423,0.0021330034,0.0013871164,0.0011151965,0.02050095],"category_scores_gemma":[0.008366097,0.0004470908,0.0006957584,0.0013877149,0.0040652542,0.0043586744,0.002958343,0.0038723089,0.0071717496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017153873,0.000039486727,0.000722341,0.000088033434,0.000011266474,0.00028588518,0.00031149187,0.000945601,0.0010487692,0.94394064,0.021524273,0.030910589],"study_design_scores_gemma":[0.00004099173,0.00008585048,0.0008125967,0.00010874741,0.00001560315,0.00050744665,0.00018500251,0.0052612294,0.0021949143,0.90664005,0.08408165,0.00006599777],"about_ca_topic_score_codex":0.0026587585,"about_ca_topic_score_gemma":0.0031746242,"teacher_disagreement_score":0.02050095,"about_ca_system_score_codex":0.0018388762,"about_ca_system_score_gemma":0.0010454974,"threshold_uncertainty_score":0.068582535},"labels":[],"label_agreement":null},{"id":"W3186796962","doi":"","title":"Relaxed Locally Correctable Codes with Improved Parameters.","year":2020,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code word; Mathematics; Decoding methods; Combinatorics; Block (permutation group theory); Constant (computer programming); Discrete mathematics; List decoding; Block code; Algorithm; Computer science; Concatenated error correction code","score_opus":0.011903369849054928,"score_gpt":0.17892688384034117,"score_spread":0.16702351399128623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186796962","genre_codex":"methods","genre_gemma":"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.07972798,0.0018841063,0.8909167,0.002928958,0.00029253008,0.0006835609,0.0016515969,0.0046842145,0.01723029],"genre_scores_gemma":[0.65784115,0.0010814493,0.32519212,0.0014962143,0.0002255136,0.0011517558,0.0020235353,0.0013847299,0.0096035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917538,0.001985363,0.0005427507,0.0017346783,0.0029939841,0.0009894083],"domain_scores_gemma":[0.967709,0.016564967,0.0020015752,0.010484873,0.0023784407,0.00086101046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045904284,0.0018398549,0.0017318453,0.001098245,0.0011377096,0.002941986,0.003802536,0.00353468,0.008657059],"category_scores_gemma":[0.0507241,0.0012043007,0.0015512523,0.0017898388,0.003484699,0.011543004,0.0076116594,0.008902822,0.003501969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002480656,0.0003671849,0.0031445473,0.00074640196,0.0001366,0.0003968304,0.0013519132,0.38219893,0.03715813,0.4519268,0.012966472,0.10712558],"study_design_scores_gemma":[0.00040665508,0.00048254384,0.0005052328,0.00016176054,0.0000918622,0.0005388918,0.00021177318,0.6977335,0.026083592,0.2575731,0.01600695,0.00020410573],"about_ca_topic_score_codex":0.00317673,"about_ca_topic_score_gemma":0.0035357082,"teacher_disagreement_score":0.008657059,"about_ca_system_score_codex":0.0042686295,"about_ca_system_score_gemma":0.004110468,"threshold_uncertainty_score":0.03097123},"labels":[],"label_agreement":null},{"id":"W3189065149","doi":"","title":"Some optimal codes and strongly regular graphs from the linear group L(4, 3)","year":2012,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Discrete mathematics","score_opus":0.018421924291718222,"score_gpt":0.23843827640479506,"score_spread":0.22001635211307685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189065149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.74160475,0.0013807598,0.14802982,0.005282368,0.00030586144,0.00012453816,0.00096470467,0.00035794583,0.10194919],"genre_scores_gemma":[0.9547862,0.00063302164,0.02643754,0.00053364824,0.00033052187,0.00012632778,0.0005445039,0.00014065813,0.016467594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.00022762654,0.000036354766,0.00012402308,0.0001951168,0.00017392785],"domain_scores_gemma":[0.997664,0.00119741,0.00040392825,0.00023843111,0.00023814522,0.00025824967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007062097,0.00068312534,0.0006141291,0.0014828404,0.0015161862,0.0019647933,0.00096844503,0.0014769926,0.0039025818],"category_scores_gemma":[0.0038982246,0.00051143096,0.0007932096,0.0010155671,0.002559854,0.0024434612,0.0014762236,0.002192272,0.00051029073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005509473,0.000019517462,0.00020900425,0.000038436287,0.000007193232,0.000068753376,0.00015657295,0.0028421746,0.00076042436,0.99085546,0.0012581794,0.0037291688],"study_design_scores_gemma":[0.000021301981,0.000015870999,0.00015521284,0.0000097405355,0.0000052534324,0.000051882063,0.000054599266,0.0076647843,0.0005593564,0.990275,0.0011768887,0.000010228536],"about_ca_topic_score_codex":0.0012381043,"about_ca_topic_score_gemma":0.0014923235,"teacher_disagreement_score":0.0039025818,"about_ca_system_score_codex":0.0015567747,"about_ca_system_score_gemma":0.0013837874,"threshold_uncertainty_score":0.013055444},"labels":[],"label_agreement":null},{"id":"W3195953963","doi":"","title":"Finding discrete logarithms with a set orbit distinguisher.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Discrete logarithm; Logarithm; Binary logarithm; Mathematics; Time complexity; Discrete mathematics; Set (abstract data type); Prime (order theory); Combinatorics; Polynomial; Algorithm; Computer science; Public-key cryptography","score_opus":0.019487887778501516,"score_gpt":0.2691911555552283,"score_spread":0.2497032677767268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195953963","genre_codex":"methods","genre_gemma":"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.17294239,0.00082530675,0.8038935,0.0027702653,0.00017663042,0.00023540472,0.0005289489,0.0021406165,0.016486954],"genre_scores_gemma":[0.65939957,0.00039842876,0.33105165,0.00036317122,0.00016362107,0.00019077955,0.0006665531,0.00021360995,0.0075525763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658394,0.00052264036,0.00025319072,0.0008397124,0.0012576613,0.00054292666],"domain_scores_gemma":[0.98146194,0.012997234,0.0012909706,0.0031003968,0.0005654978,0.00058397965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030362543,0.000753672,0.0012578688,0.0015129108,0.0017686043,0.003836319,0.0019006722,0.0019960876,0.0045938333],"category_scores_gemma":[0.015654895,0.00055865885,0.0015067495,0.0019346836,0.0035586841,0.009834898,0.0055055213,0.004367312,0.001308544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023153403,0.0005432886,0.0066045965,0.0006619203,0.00018634993,0.00048744242,0.0013016664,0.07083261,0.029955711,0.6729501,0.008950314,0.20521067],"study_design_scores_gemma":[0.00019289849,0.0003664807,0.0006885778,0.00006324623,0.00008992497,0.00053855666,0.00020740725,0.23646599,0.0384314,0.71477085,0.008117493,0.0000670901],"about_ca_topic_score_codex":0.00070032355,"about_ca_topic_score_gemma":0.0006245985,"teacher_disagreement_score":0.0045938333,"about_ca_system_score_codex":0.002671462,"about_ca_system_score_gemma":0.0021407125,"threshold_uncertainty_score":0.019382954},"labels":[],"label_agreement":null},{"id":"W3197582521","doi":"10.4230/lipics.ccc.2018.4","title":"Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs","year":2018,"lang":"en","type":"article","venue":"DR-NTU (Nanyang Technological University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Dimension (graph theory); Mathematics; Degree (music); Combinatorics; Subspace topology; Rank (graph theory); Finite field; Expander graph; Discrete mathematics; Mathematical analysis; Physics; Graph","score_opus":0.02242866294649585,"score_gpt":0.21290635848642606,"score_spread":0.19047769553993021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197582521","genre_codex":"methods","genre_gemma":"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.1552088,0.0008181078,0.809256,0.0006233483,0.00011749655,0.00009148895,0.00042330258,0.0022037057,0.03125779],"genre_scores_gemma":[0.7885739,0.00072045426,0.18930185,0.00038622657,0.00017285644,0.00023988442,0.00044069058,0.00030370103,0.019860456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897456,0.00027119328,0.000040679708,0.00015093632,0.00035375432,0.00020879449],"domain_scores_gemma":[0.99873453,0.0005416471,0.00014234461,0.00030114932,0.00015973616,0.000120506666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077382656,0.00057502784,0.00041995526,0.0008275309,0.0005862461,0.0011382896,0.00063002034,0.000580462,0.0043771113],"category_scores_gemma":[0.003090021,0.00035514054,0.00043952628,0.0008473731,0.0014591417,0.0025040896,0.0024811162,0.0015518743,0.0016801019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024894104,0.000053633772,0.0005860152,0.000108552835,0.000016268374,0.00013984583,0.00037703142,0.02265836,0.018065551,0.8662863,0.0037284074,0.08773112],"study_design_scores_gemma":[0.000095331874,0.00035520594,0.00040112995,0.000090248,0.000030551957,0.00048944843,0.00016680254,0.18052903,0.04335285,0.7486356,0.025737427,0.00011644959],"about_ca_topic_score_codex":0.00033586507,"about_ca_topic_score_gemma":0.0005244951,"teacher_disagreement_score":0.0043771113,"about_ca_system_score_codex":0.00074753765,"about_ca_system_score_gemma":0.00054826704,"threshold_uncertainty_score":0.014642835},"labels":[],"label_agreement":null},{"id":"W3199746871","doi":"","title":"Gray Codes for AT-Free Orders","year":2021,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Gray (unit); Gray code; Arithmetic; Algorithm; Medicine","score_opus":0.011691373019040696,"score_gpt":0.23394766561978073,"score_spread":0.22225629260074004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199746871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.44326466,0.0024552133,0.2694514,0.0065753055,0.0010530323,0.00016776152,0.001555155,0.0010903762,0.2743872],"genre_scores_gemma":[0.91212314,0.0011629157,0.021634802,0.0011077218,0.0005988581,0.00012896922,0.00048284858,0.000292853,0.062467914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903935,0.0001857852,0.000045516637,0.00012104559,0.00035029778,0.00025807178],"domain_scores_gemma":[0.99716705,0.0013701667,0.00031849628,0.0004925645,0.0003318097,0.00032003174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080865895,0.0008597235,0.0010280748,0.002771776,0.0019649009,0.0039313403,0.0011235195,0.0013998363,0.011959193],"category_scores_gemma":[0.0036785405,0.00045221543,0.00082562293,0.002386686,0.0036023466,0.0044412585,0.002317631,0.0033823461,0.0020816827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023614592,0.000008608389,0.000052093175,0.000012854824,0.0000020725174,0.000026880558,0.0000655762,0.0007215532,0.00028405274,0.99511755,0.00096165953,0.0027232887],"study_design_scores_gemma":[0.0000074571326,0.000005297762,0.00004558339,0.000008092109,0.000003056143,0.000026057607,0.000015470161,0.0023191217,0.0002469673,0.99552,0.0017950083,0.000007860574],"about_ca_topic_score_codex":0.0020058174,"about_ca_topic_score_gemma":0.0018567108,"teacher_disagreement_score":0.011959193,"about_ca_system_score_codex":0.0024521751,"about_ca_system_score_gemma":0.0013174207,"threshold_uncertainty_score":0.040007472},"labels":[],"label_agreement":null},{"id":"W3200192232","doi":"10.1016/j.ffa.2022.102083","title":"Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Carleton University","keywords":"Monic polynomial; Mathematics; Reciprocal; Irreducible polynomial; Finite field; Polynomial; Sequence (biology); Field (mathematics); Degree (music); Palindrome; Pure mathematics; Bell polynomials; Combinatorics; Matrix polynomial; Mathematical analysis","score_opus":0.009924961351266281,"score_gpt":0.22295115900243867,"score_spread":0.2130261976511724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200192232","genre_codex":"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.83666223,0.0004350892,0.12283584,0.0006249578,0.00009413395,0.000073098454,0.00042389517,0.00043314733,0.03841765],"genre_scores_gemma":[0.95975596,0.00029100792,0.028732767,0.0001067901,0.00010467577,0.00003973366,0.00048695723,0.00009965937,0.010382459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990595,0.00024262824,0.00006722057,0.00009707754,0.00030165125,0.00023193672],"domain_scores_gemma":[0.9975701,0.0013908277,0.0002628673,0.00028903078,0.00025057507,0.00023665986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009835964,0.0006972785,0.000870978,0.0021213486,0.0012802333,0.003154441,0.0010808449,0.00087854284,0.0035163488],"category_scores_gemma":[0.004236012,0.00040901263,0.00054376916,0.0021392666,0.0015822704,0.002332953,0.0016101818,0.0012527066,0.00073580944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000501845,0.00021004134,0.0027691096,0.0002504748,0.000026093652,0.000397484,0.000621753,0.0075218263,0.015725626,0.9285787,0.0024696,0.040927507],"study_design_scores_gemma":[0.000085475855,0.00013684128,0.001485461,0.00008939487,0.000053436397,0.0011322821,0.0003141313,0.06320539,0.020665653,0.90571564,0.007060352,0.000055970693],"about_ca_topic_score_codex":0.0003628366,"about_ca_topic_score_gemma":0.0008154565,"teacher_disagreement_score":0.0035163488,"about_ca_system_score_codex":0.0010254864,"about_ca_system_score_gemma":0.00091633335,"threshold_uncertainty_score":0.011763334},"labels":[],"label_agreement":null},{"id":"W3202612442","doi":"10.1002/jcd.21806","title":"Legendre pairs of lengths ℓ≡0(mod3)","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Legendre polynomials; Mathematics; Combinatorics; Integer (computer science); Legendre transformation; Legendre function; Multiplier (economics); Order (exchange); Mathematical analysis","score_opus":0.02414696928504522,"score_gpt":0.2488568550173062,"score_spread":0.22470988573226097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202612442","genre_codex":"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.79203445,0.00039968782,0.16318819,0.00040704833,0.00022705682,0.000050168434,0.00021702681,0.00027478882,0.043201584],"genre_scores_gemma":[0.9718317,0.000106966945,0.023843117,0.000143881,0.000105320425,0.000044080207,0.0001382764,0.000044080123,0.0037427016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992393,0.00014153875,0.00004405897,0.00014932416,0.00022989897,0.00019581437],"domain_scores_gemma":[0.99777895,0.00086275855,0.0005451806,0.00031549323,0.00029920848,0.00019840892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007988053,0.00053039775,0.00037891453,0.0015233814,0.00096920604,0.0014418544,0.0005992962,0.0006496877,0.009250586],"category_scores_gemma":[0.0041410252,0.00034011906,0.00044657156,0.00071505556,0.0016774078,0.0021135793,0.0013046558,0.0011402707,0.0010321873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004152602,0.00006344861,0.003210581,0.000066080895,0.000018562605,0.000511589,0.00043671517,0.0030922003,0.024785059,0.9405759,0.0014619465,0.025362624],"study_design_scores_gemma":[0.00007119964,0.00038218102,0.00481607,0.00008032752,0.000029771112,0.0019656143,0.00044198788,0.03371911,0.05159582,0.8907404,0.016049732,0.00010783293],"about_ca_topic_score_codex":0.00018810136,"about_ca_topic_score_gemma":0.00018641834,"teacher_disagreement_score":0.009250586,"about_ca_system_score_codex":0.00046826177,"about_ca_system_score_gemma":0.00035859214,"threshold_uncertainty_score":0.030946255},"labels":[],"label_agreement":null},{"id":"W3205562261","doi":"10.4064/aa220315-13-8","title":"Statistics for $p$-ranks of Artin–Schreier covers","year":2022,"lang":"en","type":"preprint","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Infinity; Isomorphism (crystallography); Finite field; Combinatorics; Prime (order theory); Limit (mathematics); Genus; Algebraic number field; Distribution (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.020933436295170714,"score_gpt":0.27408051809788675,"score_spread":0.25314708180271606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205562261","genre_codex":"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.9148413,0.0018894988,0.05326966,0.0026953798,0.0001594667,0.000034709377,0.00095047854,0.0005260557,0.025633415],"genre_scores_gemma":[0.99159545,0.00073852076,0.0029445312,0.000115574105,0.0004973388,0.000056898552,0.0006393337,0.00010482326,0.003307539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986299,0.00031762637,0.00006669364,0.00030806314,0.00038357216,0.0002942319],"domain_scores_gemma":[0.9896144,0.005858542,0.0018348286,0.00064866175,0.00064314756,0.0014003613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024764615,0.0008260616,0.001232908,0.005650336,0.0017013589,0.004529876,0.0015624922,0.0015434627,0.006327342],"category_scores_gemma":[0.015828446,0.0006479331,0.00065694645,0.0021858248,0.0048664147,0.006625616,0.0024599244,0.0021112624,0.0007541939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018317925,0.000044500925,0.00665027,0.00013458227,0.000031422216,0.00023484527,0.00036524129,0.009935643,0.003069892,0.9668422,0.0033255946,0.009182577],"study_design_scores_gemma":[0.00004584193,0.00010306155,0.010317623,0.00008197201,0.000032211803,0.00070383825,0.00026223014,0.0671308,0.00303112,0.91504854,0.003131773,0.00011099256],"about_ca_topic_score_codex":0.00080188224,"about_ca_topic_score_gemma":0.00056825025,"teacher_disagreement_score":0.006327342,"about_ca_system_score_codex":0.001884432,"about_ca_system_score_gemma":0.0005420227,"threshold_uncertainty_score":0.02116704},"labels":[],"label_agreement":null},{"id":"W3206898017","doi":"10.26493/1855-3974.2724.83d","title":"The search for small association schemes with noncyclotomic eigenvalues","year":2022,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Association scheme; Eigenvalues and eigenvectors; Rank (graph theory); Commutative property; Algebraic number; Table (database); Pure mathematics; Algebra over a field; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.024295702719765194,"score_gpt":0.23637362297935255,"score_spread":0.21207792025958735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206898017","genre_codex":"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.81486815,0.0003886417,0.16303217,0.0005855211,0.00003554711,0.000091480644,0.00015552154,0.00020922165,0.020633765],"genre_scores_gemma":[0.92115855,0.00015823747,0.07566663,0.00004387898,0.00002740853,0.000089215595,0.00017379699,0.00006222939,0.0026199985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992768,0.0001848207,0.000052924002,0.00014941409,0.00022295227,0.00011304341],"domain_scores_gemma":[0.99641824,0.001877665,0.0006485928,0.0006109764,0.00018869224,0.00025585754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011135474,0.0004828226,0.00072887336,0.0011757559,0.0013740296,0.0021096326,0.0007683599,0.00092275144,0.008213092],"category_scores_gemma":[0.006512233,0.0006074379,0.0006019842,0.0006505446,0.0020280096,0.0035682959,0.0018391598,0.0015017814,0.0008786592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017813873,0.00007782149,0.0025486927,0.00018475542,0.00003129446,0.00027562262,0.00043369774,0.018161999,0.014177707,0.942785,0.00078863016,0.020356664],"study_design_scores_gemma":[0.00009697676,0.00020926676,0.00096946716,0.00008368183,0.00004524787,0.0005363588,0.0007689865,0.055644933,0.016092906,0.91531986,0.010167179,0.00006510191],"about_ca_topic_score_codex":0.00013174769,"about_ca_topic_score_gemma":0.0003173045,"teacher_disagreement_score":0.008213092,"about_ca_system_score_codex":0.00053843216,"about_ca_system_score_gemma":0.0006414399,"threshold_uncertainty_score":0.027475595},"labels":[],"label_agreement":null},{"id":"W3209060430","doi":"10.1007/s12095-022-00580-9","title":"Construction of APN permutations via Walsh zero spaces","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subspace topology; Combinatorics; Mathematics; Zero (linguistics); Space (punctuation); Vector space; Inverse; Affine transformation; Affine space; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.015044641152424142,"score_gpt":0.23563386381277215,"score_spread":0.220589222660348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209060430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.16634046,0.00022798708,0.7333476,0.0007809056,0.0006119962,0.0001908784,0.00025619983,0.0007295259,0.09751436],"genre_scores_gemma":[0.7076765,0.00033703475,0.24872366,0.00040320778,0.00017416631,0.00032170204,0.0004681063,0.00039208354,0.041503474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990895,0.00030694302,0.00005905954,0.00010762811,0.0002462911,0.00019063143],"domain_scores_gemma":[0.9991503,0.00023408003,0.00005935937,0.00029725602,0.00013900788,0.000120112825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007410535,0.0006477939,0.0004693278,0.0012445587,0.0013671975,0.0020082013,0.00080363016,0.0008904308,0.007892985],"category_scores_gemma":[0.0019578657,0.00039913072,0.0007277615,0.00096238486,0.0018698071,0.0019880817,0.0032795784,0.002026813,0.0025395101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061551196,0.000028159775,0.00013869692,0.000029204979,0.000004262378,0.00011795529,0.00012784636,0.0015552166,0.004553936,0.9713628,0.00089156034,0.021128703],"study_design_scores_gemma":[0.00003088763,0.000060784732,0.00013697203,0.00003145343,0.000008830199,0.00026134378,0.000093096336,0.016467828,0.010026302,0.9559774,0.016873913,0.000031301413],"about_ca_topic_score_codex":0.00026921157,"about_ca_topic_score_gemma":0.0003122057,"teacher_disagreement_score":0.007892985,"about_ca_system_score_codex":0.000558092,"about_ca_system_score_gemma":0.00082174875,"threshold_uncertainty_score":0.026404679},"labels":[],"label_agreement":null},{"id":"W3210629821","doi":"10.4153/s0008439521000928","title":"Corrections to “Value sets of sparse polynomials”","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Value (mathematics); Algebra over a field; Pure mathematics; Statistics","score_opus":0.013440009344836459,"score_gpt":0.22693184765922733,"score_spread":0.21349183831439086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210629821","genre_codex":"editorial","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.021025714,0.00839336,0.26104462,0.20435819,0.2689282,0.00020162486,0.0054098614,0.006350774,0.22428766],"genre_scores_gemma":[0.5192918,0.006984956,0.104327366,0.08992928,0.09236503,0.0008208736,0.0054154857,0.008632889,0.17223236],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9814077,0.0040364787,0.0010626761,0.0026192202,0.009090344,0.0017836372],"domain_scores_gemma":[0.9630891,0.017503336,0.0012527652,0.0063534994,0.010652267,0.0011490638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072330274,0.0022607301,0.0026080739,0.0054667126,0.0047089914,0.005528533,0.006042628,0.0044472204,0.03230312],"category_scores_gemma":[0.0802585,0.0013906069,0.0031872354,0.0034542934,0.0067702415,0.009013743,0.005015871,0.017645324,0.011989036],"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.00033698478,0.00005802771,0.0003711799,0.0003582818,0.00006595567,0.00041491917,0.0002231394,0.0023323628,0.0014220979,0.37524635,0.5863787,0.032792103],"study_design_scores_gemma":[0.00008252528,0.00007295767,0.00102449,0.0003177359,0.00009956898,0.0007198124,0.00007363543,0.013574232,0.004452733,0.6978575,0.2815209,0.00020384512],"about_ca_topic_score_codex":0.00594958,"about_ca_topic_score_gemma":0.003426763,"teacher_disagreement_score":0.03230312,"about_ca_system_score_codex":0.0064952015,"about_ca_system_score_gemma":0.0025586635,"threshold_uncertainty_score":0.10806471},"labels":[],"label_agreement":null},{"id":"W3214813422","doi":"10.61091/ars163-02","title":"On the circuits of splitting matroids representable over GF(p)","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Electronic circuit; Combinatorics; Arithmetic; Mathematics; Graphic matroid; Computer science; Discrete mathematics; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.010047099580994947,"score_gpt":0.24210190770688347,"score_spread":0.23205480812588852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214813422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.68542194,0.0006142939,0.23985386,0.00062592875,0.00006908965,0.0001325031,0.0011508381,0.00034627927,0.07178521],"genre_scores_gemma":[0.92463726,0.0007811621,0.053274807,0.00022790463,0.00016352262,0.00011915565,0.0018075584,0.0001312188,0.018857386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996593,0.000042622964,0.000014042378,0.00011636906,0.000096520365,0.000071137285],"domain_scores_gemma":[0.99921274,0.00034054142,0.0001647035,0.00008876016,0.00009718544,0.00009594773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020713956,0.0006148976,0.00028744928,0.00068684336,0.00050376036,0.0013502518,0.00074343395,0.00050098705,0.0069582155],"category_scores_gemma":[0.0012723301,0.00025255463,0.00045734315,0.0010229957,0.00095488405,0.0025256877,0.00088426546,0.0011824955,0.000537992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019346645,0.000103291284,0.0011554563,0.0001591281,0.000019202633,0.00030322943,0.0004879684,0.022049816,0.015610626,0.8955014,0.003094647,0.061321687],"study_design_scores_gemma":[0.00005696314,0.0002313809,0.00281931,0.00008045503,0.00003982642,0.0008664368,0.0003673078,0.096659146,0.015229315,0.86385745,0.019750597,0.000041747044],"about_ca_topic_score_codex":0.00125166,"about_ca_topic_score_gemma":0.0017521665,"teacher_disagreement_score":0.0069582155,"about_ca_system_score_codex":0.0011202482,"about_ca_system_score_gemma":0.00031648696,"threshold_uncertainty_score":0.02327758},"labels":[],"label_agreement":null},{"id":"W360545484","doi":"","title":"Error-correcting codes, finite geometries and cryptography : Conference on Error-control Codes, Information Theory and Applied Cryptography, December 5-6, 2007, Fields Institute, Toronto, Ontario, Canada : Canadian Mathematical Society Special Session Error Control Codes, Information Theory and Applied Cryptography, CMS Winter Meeting, December 8-10, 2007, London, Ontario, Canada","year":2010,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Block code; Linear code; Cryptography; Computer science; Turbo code; Theoretical computer science; Low-density parity-check code; Error detection and correction; Concatenated error correction code; Hash function; Algorithm; Mathematics; Decoding methods; Computer security","score_opus":0.00628123852213238,"score_gpt":0.2032742254719883,"score_spread":0.19699298694985592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W360545484","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018178143,0.39883143,0.048090506,0.0075802384,0.014045179,0.000114968745,0.0008660211,0.0009756554,0.5276782],"genre_scores_gemma":[0.024002098,0.23061371,0.025037058,0.0024810852,0.007934178,0.00018772489,0.0015457587,0.0007302668,0.7074682],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937975,0.000053941076,0.00002319583,0.00009711608,0.00040031032,0.0000456704],"domain_scores_gemma":[0.99920374,0.00033258792,0.000045322002,0.00012201957,0.00022456302,0.00007182621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041130412,0.0017715034,0.0010696107,0.0031734367,0.0010450797,0.0032904733,0.0009698794,0.0013330925,0.03210781],"category_scores_gemma":[0.0016062403,0.0006487692,0.00046570066,0.0063732443,0.002424838,0.004225891,0.001294407,0.002999786,0.014252166],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021620264,0.000030740197,0.00012764469,0.0006269804,0.00001835245,0.00006351483,0.00017357442,0.0021690656,0.0013427183,0.2195278,0.5378091,0.23808895],"study_design_scores_gemma":[0.0000043521895,0.000018932946,0.00022246818,0.00027294568,0.000005519857,0.00023953087,0.00003881929,0.0010301088,0.00046403767,0.06365249,0.93403536,0.000015467509],"about_ca_topic_score_codex":0.0030055917,"about_ca_topic_score_gemma":0.0049942047,"teacher_disagreement_score":0.99699444,"about_ca_system_score_codex":0.0025216546,"about_ca_system_score_gemma":0.0021693325,"threshold_uncertainty_score":0.107411265},"labels":[],"label_agreement":null},{"id":"W36280574","doi":"","title":"Reciprocal Sums of lth Power of Generalized Binary Sequences with Indices.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reciprocal; Mathematics; Binary number; Arithmetic; Statistics; Linguistics","score_opus":0.01479477952527019,"score_gpt":0.22573780007210892,"score_spread":0.21094302054683872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36280574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.36470884,0.003126025,0.3222541,0.0017143626,0.0012400759,0.00013149792,0.00065257796,0.0007884688,0.30538416],"genre_scores_gemma":[0.89585656,0.0010936698,0.05256849,0.0006328812,0.00086772384,0.00014993588,0.00035781937,0.0002850128,0.048187934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838066,0.00044588317,0.00010931037,0.0002302651,0.0005372264,0.0002967105],"domain_scores_gemma":[0.99764425,0.0009132956,0.00029015454,0.00049182953,0.00034645444,0.00031403507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105098,0.00083663507,0.0007896443,0.0023040737,0.0012242397,0.0031104365,0.0011871046,0.0012196382,0.013331896],"category_scores_gemma":[0.006867689,0.00042358442,0.0006966667,0.001489321,0.0020129478,0.004329818,0.0022475682,0.0016574361,0.00351465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103105616,0.000031466014,0.00027395788,0.000084433224,0.00001924868,0.00024887026,0.00018432557,0.0012783424,0.0043980107,0.97390544,0.0025390869,0.016933689],"study_design_scores_gemma":[0.000021440626,0.000057509624,0.0004539063,0.000066979825,0.000036179317,0.0011571035,0.000119704535,0.016531644,0.0063624303,0.9628388,0.01230782,0.00004639508],"about_ca_topic_score_codex":0.00023320054,"about_ca_topic_score_gemma":0.00039688608,"teacher_disagreement_score":0.013331896,"about_ca_system_score_codex":0.0008049422,"about_ca_system_score_gemma":0.00055203284,"threshold_uncertainty_score":0.044599593},"labels":[],"label_agreement":null},{"id":"W395247565","doi":"10.1007/s002000050126","title":"Optimal Formally Self-Dual Codes over 𝔽 5 and 𝔽 7","year":2000,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimum weight; Dual (grammatical number); Construct (python library); Dimension (graph theory); Minimum distance; Mathematics; Linear code; Code (set theory); Computer science; Discrete mathematics; Block code; Combinatorics; Algorithm; Decoding methods","score_opus":0.003958740976191346,"score_gpt":0.19714958100646507,"score_spread":0.19319084003027373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W395247565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.52717346,0.0008708424,0.33878323,0.0041567213,0.0006446236,0.00018407284,0.0007108911,0.00056677556,0.12690932],"genre_scores_gemma":[0.94083554,0.0003619408,0.038036376,0.00068722497,0.00025547278,0.0001228904,0.00035447563,0.00016360224,0.019182436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798465,0.0006326034,0.00010690791,0.00022771464,0.00055170077,0.0004964215],"domain_scores_gemma":[0.9964941,0.0014936572,0.00039709092,0.00051141024,0.0006151326,0.0004886249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001837632,0.0006660771,0.0008377503,0.0013264765,0.0017248868,0.0033842174,0.0011185277,0.0013221325,0.0070423596],"category_scores_gemma":[0.0056033875,0.0004510152,0.0007845261,0.0009708211,0.0027097114,0.0044667893,0.002719993,0.0024573924,0.0008871551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009652714,0.000027944574,0.00010008473,0.000020209507,0.0000058346873,0.000016777836,0.00006581305,0.0026211774,0.0005456083,0.9917972,0.00089488114,0.0038078486],"study_design_scores_gemma":[0.000024679799,0.000021200094,0.000071398455,0.000014278696,0.0000068155423,0.000032966662,0.00005385333,0.012000339,0.0011215813,0.9855451,0.0010939706,0.0000138299665],"about_ca_topic_score_codex":0.0008738755,"about_ca_topic_score_gemma":0.0010271432,"teacher_disagreement_score":0.0070423596,"about_ca_system_score_codex":0.0018866882,"about_ca_system_score_gemma":0.0022467074,"threshold_uncertainty_score":0.023558974},"labels":[],"label_agreement":null},{"id":"W401987441","doi":"10.1007/978-3-319-10683-0_7","title":"Generating Good Span n Sequences Using Orthogonal Functions in Nonlinear Feedback Shift Registers","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Span (engineering); Shift register; Linear span; Sequence (biology); Randomness; Nonlinear system; Golomb coding; Pseudorandom binary sequence; Mathematics; Binary number; Ideal (ethics); Algorithm; Combinatorics; Arithmetic; Computer science; Statistics; Artificial intelligence; Telecommunications; Physics","score_opus":0.035031963168030235,"score_gpt":0.24177506436023172,"score_spread":0.2067431011922015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W401987441","genre_codex":"methods","genre_gemma":"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.10006054,0.0028680922,0.82054335,0.00047350946,0.00036070516,0.00011747788,0.0001226594,0.0006673349,0.07478645],"genre_scores_gemma":[0.6254688,0.003869652,0.32288918,0.0003092825,0.00030687888,0.00020923471,0.00026204696,0.0002894555,0.046395514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997148,0.00008114796,0.000016519685,0.00004078726,0.00011826996,0.00002846682],"domain_scores_gemma":[0.9997129,0.00015528675,0.000029532348,0.00005507964,0.000031584783,0.00001557959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045292894,0.0005655772,0.00035977145,0.00053355604,0.0003993376,0.00087595626,0.00040465963,0.00059785595,0.0030914694],"category_scores_gemma":[0.0010940436,0.0003190317,0.00034462,0.00069949677,0.0010087413,0.0012687794,0.0009237495,0.0007107445,0.0010598368],"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.00014032837,0.00004189569,0.0002177363,0.0002331612,0.00001853765,0.000099854886,0.00031502903,0.01939271,0.03595498,0.76390314,0.0024652965,0.17721741],"study_design_scores_gemma":[0.000044673307,0.0002060917,0.00030366375,0.00017778858,0.000028274859,0.00044979498,0.00009815675,0.13037871,0.060980596,0.7709543,0.036314655,0.00006340788],"about_ca_topic_score_codex":0.00012709598,"about_ca_topic_score_gemma":0.00024063115,"teacher_disagreement_score":0.0030914694,"about_ca_system_score_codex":0.0004262353,"about_ca_system_score_gemma":0.0003427459,"threshold_uncertainty_score":0.0103420615},"labels":[],"label_agreement":null},{"id":"W4200452304","doi":"10.18280/isi.260609","title":"Towards the Construction of Reed-Muller Code Based Symmetric Key FHE","year":2021,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homomorphic encryption; Computer science; Code word; Correctness; Cryptography; Theoretical computer science; Code (set theory); Encryption; Multiplication (music); Homomorphic secret sharing; Scheme (mathematics); Algorithm; Decoding methods; Mathematics; Secret sharing; Programming language; Computer security","score_opus":0.01749223748164754,"score_gpt":0.22048882900779732,"score_spread":0.20299659152614977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200452304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.02878341,0.0015666434,0.95076174,0.0004995793,0.00015703552,0.00022465808,0.00012860882,0.0005634677,0.017314844],"genre_scores_gemma":[0.33079267,0.0013651646,0.65499485,0.00021632446,0.00010082247,0.00022449909,0.00031016822,0.00010385441,0.011891683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992719,0.00017859651,0.00004083772,0.00009335633,0.00032909316,0.000086135624],"domain_scores_gemma":[0.9996184,0.000079093654,0.000041354368,0.00011199464,0.00012090906,0.00002821979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006090364,0.0004069981,0.00037299417,0.0009136534,0.0004828534,0.00081658666,0.0007580388,0.00060193887,0.0021927822],"category_scores_gemma":[0.0011642195,0.00025768904,0.00055399735,0.0005296547,0.00086752506,0.00095029845,0.0013796253,0.000961943,0.0011238588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015996725,0.000113461036,0.0011199136,0.00042456185,0.00004690357,0.0011125059,0.00064916624,0.025523366,0.06466702,0.6947532,0.00413629,0.2072936],"study_design_scores_gemma":[0.00015153724,0.00083663804,0.0013780365,0.0004546354,0.00010119347,0.0055684107,0.00029096275,0.33651242,0.1684957,0.32021338,0.16577156,0.00022551998],"about_ca_topic_score_codex":0.00052604545,"about_ca_topic_score_gemma":0.00041489812,"teacher_disagreement_score":0.0021927822,"about_ca_system_score_codex":0.0004123303,"about_ca_system_score_gemma":0.00086153834,"threshold_uncertainty_score":0.0073356032},"labels":[],"label_agreement":null},{"id":"W4206881602","doi":"","title":"Towa error-bounded algorithms for infinite-horizon DEC-POMDPs","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bounded function; Computer science; Algorithm; Horizon; Mathematics; Mathematical analysis","score_opus":0.036099323379928154,"score_gpt":0.25397334438246466,"score_spread":0.2178740210025365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206881602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.023543641,0.00045244594,0.9647907,0.0009195553,0.00016439648,0.00012581993,0.00025818788,0.0008700468,0.008875197],"genre_scores_gemma":[0.7131276,0.00033271356,0.27569577,0.00045568377,0.00013068064,0.0005658952,0.0006472762,0.00043915596,0.008605184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974552,0.00076082407,0.00014735243,0.00055100856,0.0004575123,0.0006281053],"domain_scores_gemma":[0.9840258,0.012700273,0.0005841805,0.0011591808,0.0009172779,0.00061330426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045829504,0.0020201777,0.002793517,0.00093669683,0.0015462545,0.0034679573,0.0033992364,0.0033411076,0.00847859],"category_scores_gemma":[0.022158662,0.0011859428,0.001615502,0.0010957766,0.0027029342,0.0039521963,0.006083366,0.0056440705,0.0009601488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038924124,0.00009283971,0.0004914064,0.00020591184,0.000064233776,0.000064537475,0.00012279866,0.88898385,0.0004171443,0.080318585,0.0023101768,0.026539396],"study_design_scores_gemma":[0.00004145806,0.000027107048,0.000029607527,0.00002192919,0.000008834864,0.000007971456,0.000016915905,0.9466806,0.00024625327,0.052567687,0.0003451343,0.000006550441],"about_ca_topic_score_codex":0.0076741315,"about_ca_topic_score_gemma":0.009153053,"teacher_disagreement_score":0.00847859,"about_ca_system_score_codex":0.0031763949,"about_ca_system_score_gemma":0.0051826253,"threshold_uncertainty_score":0.028363705},"labels":[],"label_agreement":null},{"id":"W4210440004","doi":"10.1109/apccas51387.2021.9687675","title":"Area-Efficient Finite Field Multiplication in $\\text{GF} (2^{n})$ Using Single-Electron Transistors","year":2021,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"GF(2); Finite field; Multiplication (music); Computer science; Transistor; Arithmetic; Physics; Mathematics; Discrete mathematics; Combinatorics; Voltage; Quantum mechanics","score_opus":0.028683540506581583,"score_gpt":0.24331429881239588,"score_spread":0.2146307583058143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210440004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.43373293,0.0012444883,0.53936565,0.0003761809,0.00019921492,0.00010845691,0.00017064586,0.0023962364,0.022406198],"genre_scores_gemma":[0.813543,0.000407487,0.17985548,0.00008635312,0.000047219288,0.000054770368,0.00014707579,0.00005920011,0.0057994374],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987197,0.0000237036,0.000008750574,0.000019973419,0.00005456855,0.000020998725],"domain_scores_gemma":[0.99978703,0.00010774106,0.000038236503,0.000031057993,0.00002698517,0.000009043332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001453296,0.00030708304,0.00026833132,0.00028221752,0.0002592383,0.00043242326,0.000608594,0.00027662405,0.003406947],"category_scores_gemma":[0.0005055551,0.000113113514,0.00026952696,0.00052200037,0.00028879143,0.0007612467,0.0003005559,0.0003617085,0.0006717095],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043844874,0.000110269946,0.0005432296,0.0003435349,0.00007203245,0.00050237175,0.0001667022,0.017463082,0.7353189,0.054594327,0.0027933451,0.18765369],"study_design_scores_gemma":[0.00015321265,0.000960068,0.0014156677,0.00009479211,0.00007393909,0.001965761,0.000070206836,0.1531558,0.79599327,0.021020144,0.025033148,0.000063946965],"about_ca_topic_score_codex":0.0003857586,"about_ca_topic_score_gemma":0.0010713792,"teacher_disagreement_score":0.003406947,"about_ca_system_score_codex":0.00026199865,"about_ca_system_score_gemma":0.00030883498,"threshold_uncertainty_score":0.011397362},"labels":[],"label_agreement":null},{"id":"W4210620791","doi":"10.1016/j.ffa.2022.102002","title":"The additive index of polynomials over finite fields","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Multiplicative function; Permutation (music); Combinatorics; Polynomial; Degree (music); Character (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.009206383225221415,"score_gpt":0.22017459575699758,"score_spread":0.21096821253177617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210620791","genre_codex":"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.6494262,0.011131026,0.20024997,0.004813999,0.0019633884,0.000048303566,0.00052075915,0.000419362,0.131427],"genre_scores_gemma":[0.97157764,0.002805225,0.011336334,0.00028186923,0.0019972115,0.000042277665,0.00020482753,0.00007947287,0.011675225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821943,0.00045178522,0.0001210112,0.0002799786,0.00063025503,0.0002975126],"domain_scores_gemma":[0.99421966,0.0033823585,0.00080213265,0.00046443316,0.00046560858,0.00066573784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019199986,0.0010023892,0.00135503,0.0057276827,0.001728589,0.0058532585,0.0017457894,0.0012878156,0.0034301481],"category_scores_gemma":[0.008082189,0.0006505775,0.0006710847,0.0045194253,0.0050927126,0.009437819,0.0027372842,0.0032642717,0.0007397626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055185323,0.000023900568,0.00024931412,0.000031333613,0.0000055112246,0.00005062545,0.00017119395,0.0008912374,0.0007170188,0.9920344,0.0004655938,0.005304738],"study_design_scores_gemma":[0.000011846629,0.000029396035,0.0003399721,0.00003715695,0.0000151997,0.0001486081,0.00006973177,0.0063248435,0.0009375474,0.9892641,0.0027991931,0.000022441389],"about_ca_topic_score_codex":0.0005125143,"about_ca_topic_score_gemma":0.00041404564,"teacher_disagreement_score":0.0058532585,"about_ca_system_score_codex":0.002030965,"about_ca_system_score_gemma":0.0010270317,"threshold_uncertainty_score":0.014735758},"labels":[],"label_agreement":null},{"id":"W4213257702","doi":"10.1016/j.disc.2006.05.004","title":"Classification of extremal double circulant self-dual codes of lengths 74–88","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.022833401465611032,"score_gpt":0.250057329470382,"score_spread":0.22722392800477098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213257702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.959499,0.00038858145,0.014128699,0.00066233735,0.00013256865,0.00005425446,0.0005533411,0.00021327971,0.024367938],"genre_scores_gemma":[0.9867573,0.0001724227,0.006287464,0.00013073641,0.00012367291,0.000055489472,0.0008843846,0.00007476658,0.0055138576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920577,0.00010593201,0.000057404726,0.00012751206,0.00029789915,0.00020545916],"domain_scores_gemma":[0.99644923,0.0012556709,0.0007660132,0.00044155406,0.0005840298,0.0005033715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135195,0.00042713483,0.000621846,0.0035589903,0.0018805079,0.0024660537,0.0007896503,0.001324333,0.004588159],"category_scores_gemma":[0.004676657,0.00038180404,0.00040198982,0.0014206404,0.00197482,0.0011699721,0.001120793,0.001524665,0.0006141151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010687794,0.00020031139,0.0151136955,0.00023157948,0.00004462677,0.0009130089,0.00086691877,0.0053633694,0.023684233,0.89361596,0.008217855,0.050679766],"study_design_scores_gemma":[0.00025260742,0.00026971617,0.017473431,0.00020897183,0.000081548074,0.0034938487,0.0006373147,0.05922729,0.02053825,0.87137115,0.026281333,0.00016447688],"about_ca_topic_score_codex":0.0004064772,"about_ca_topic_score_gemma":0.00051115046,"teacher_disagreement_score":0.004588159,"about_ca_system_score_codex":0.0012573089,"about_ca_system_score_gemma":0.00086527213,"threshold_uncertainty_score":0.015348911},"labels":[],"label_agreement":null},{"id":"W4214518471","doi":"10.1109/access.2022.3155457","title":"CRC-Based Correction of Multiple Errors Using an Optimized Lookup Table","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université Polytechnique Hauts-de-France","keywords":"Notation; Lookup table; Speedup; Table (database); Error detection and correction; Arithmetic; Computer science; Mathematics; Algorithm; Discrete mathematics; Parallel computing","score_opus":0.05214330034223808,"score_gpt":0.30089516029245744,"score_spread":0.24875185995021937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214518471","genre_codex":"methods","genre_gemma":"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.032415513,0.0019201766,0.9518573,0.00020368154,0.00063962984,0.00019895475,0.00027441222,0.007979222,0.0045111007],"genre_scores_gemma":[0.33975783,0.00096721255,0.6495538,0.00026573712,0.00026146375,0.0001409453,0.0007096562,0.00027853635,0.008064814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992861,0.0000749522,0.00005426861,0.00011401411,0.00039742462,0.000073267336],"domain_scores_gemma":[0.99911815,0.00017625568,0.00011052574,0.00023923792,0.0003285982,0.000027243708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040671186,0.0007160822,0.0006979945,0.0011945342,0.00047131878,0.0008991346,0.0013770583,0.0005332553,0.0028562855],"category_scores_gemma":[0.0017288439,0.00028897097,0.0003864622,0.0010929253,0.00030142567,0.0016468735,0.00064742664,0.00057520054,0.0020890278],"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.0009114383,0.00016685671,0.0018795369,0.00066315784,0.00014926602,0.00079895934,0.00027380645,0.048204534,0.27847946,0.032917228,0.011646555,0.6239092],"study_design_scores_gemma":[0.00020976775,0.0009986951,0.0010561036,0.00010039851,0.00023461439,0.0023453038,0.000111777794,0.48234674,0.44378614,0.006813449,0.061811995,0.00018505902],"about_ca_topic_score_codex":0.0018731884,"about_ca_topic_score_gemma":0.0025159484,"teacher_disagreement_score":0.0028562855,"about_ca_system_score_codex":0.0004249535,"about_ca_system_score_gemma":0.0014445165,"threshold_uncertainty_score":0.009555221},"labels":[],"label_agreement":null},{"id":"W4220728365","doi":"10.3390/math10050815","title":"Low-Space Bit-Parallel Systolic Structure for AOP-Based Multiplier Suitable for Resource-Constrained IoT Edge Devices","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Multiplier (economics); Application-specific integrated circuit; Field-programmable gate array; Cryptography; Parallel computing; Algorithm; Computer hardware","score_opus":0.016603813245955695,"score_gpt":0.23913817828294473,"score_spread":0.22253436503698903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220728365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.2458858,0.00073914725,0.7328447,0.00040112573,0.00019627354,0.00019533541,0.00032072648,0.0018365602,0.017580338],"genre_scores_gemma":[0.6967771,0.00048366137,0.29374993,0.00017442755,0.000072268536,0.00015339749,0.00040250493,0.0000701824,0.008116506],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99992704,0.000011764216,0.0000069438665,0.000014644671,0.000028302362,0.000011356483],"domain_scores_gemma":[0.9998635,0.000024396704,0.000029941053,0.000025167874,0.000048856713,0.0000080822765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009895428,0.00033050292,0.00016865243,0.00032923618,0.0003253434,0.00036090988,0.00051768334,0.00021016866,0.003473365],"category_scores_gemma":[0.00026411543,0.00013010575,0.00023956943,0.00045490247,0.00015672078,0.00040793733,0.00020157399,0.00030266566,0.0007812678],"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.00061811495,0.00021318317,0.002123238,0.00059380586,0.00010856738,0.0009343383,0.0002360812,0.05211449,0.5971819,0.04371466,0.006337875,0.2958238],"study_design_scores_gemma":[0.0002610728,0.0032653343,0.003969234,0.00014310196,0.0002233055,0.0031656,0.00018053761,0.4359237,0.46003985,0.018138602,0.07459914,0.00009039221],"about_ca_topic_score_codex":0.0005009546,"about_ca_topic_score_gemma":0.0014112634,"teacher_disagreement_score":0.003473365,"about_ca_system_score_codex":0.00033192796,"about_ca_system_score_gemma":0.00080753624,"threshold_uncertainty_score":0.011619568},"labels":[],"label_agreement":null},{"id":"W4221049443","doi":"10.3390/cryptography6010006","title":"Post-Quantum Two-Party Adaptor Signature Based on Coding Theory","year":2022,"lang":"en","type":"article","venue":"Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Impact Fund; Silicon Valley Community Foundation","keywords":"Computer science; Cryptography; Hash function; Ring signature; Digital signature; Theoretical computer science; Computer security","score_opus":0.00996884791988141,"score_gpt":0.2234456738021167,"score_spread":0.21347682588223527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221049443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04399578,0.0001838834,0.9420472,0.0007001824,0.00009784917,0.00021593612,0.00015961553,0.00030564764,0.0122939],"genre_scores_gemma":[0.80643547,0.0002916978,0.18346241,0.0003809338,0.00012641163,0.0003988029,0.00025390027,0.00008471761,0.008565708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968458,0.0008605701,0.00015615915,0.0003862415,0.0013282468,0.0004229789],"domain_scores_gemma":[0.9941702,0.0021814727,0.00044737483,0.0022107137,0.0007409491,0.00024936433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018369884,0.0005066166,0.0008250614,0.0010291046,0.0013902951,0.0020145723,0.001670608,0.0017340842,0.0031826939],"category_scores_gemma":[0.0064168894,0.00030247352,0.0009017972,0.0015377406,0.0037949514,0.0055426634,0.0034784046,0.0033771873,0.00082971767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008822087,0.000036095862,0.00018293182,0.000047888527,0.000011903991,0.000071781906,0.00012177464,0.01361132,0.0045387167,0.96358335,0.00092530495,0.016780695],"study_design_scores_gemma":[0.000085346364,0.00013461946,0.0002146133,0.00003203906,0.00002558831,0.0002720197,0.000053344702,0.30427894,0.02027758,0.6675394,0.00699721,0.000089328074],"about_ca_topic_score_codex":0.0008842524,"about_ca_topic_score_gemma":0.00052087463,"teacher_disagreement_score":0.0031826939,"about_ca_system_score_codex":0.0020342148,"about_ca_system_score_gemma":0.0030959006,"threshold_uncertainty_score":0.014759362},"labels":[],"label_agreement":null},{"id":"W4226120589","doi":"10.22215/etd/2022-14866","title":"Cycle Lengths of Finite Cyclotomic Mappings","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Integer (computer science); Function (biology); Cyclotomic polynomial; Index (typography); Combinatorics; Discrete mathematics; Pure mathematics; Polynomial; Mathematical analysis; Computer science","score_opus":0.005963649993695944,"score_gpt":0.23444191173008405,"score_spread":0.2284782617363881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226120589","genre_codex":"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.9372919,0.00064353383,0.029074995,0.00043680076,0.00003821831,0.000053501924,0.000368666,0.00013152268,0.031960823],"genre_scores_gemma":[0.9928756,0.00027242,0.00429564,0.000047456848,0.0000366779,0.000055784723,0.0002611449,0.00002864137,0.0021266625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.0000859893,0.000040269868,0.00013206966,0.00015905639,0.00018374655],"domain_scores_gemma":[0.99672925,0.0017759841,0.0005803857,0.00032532288,0.0002735919,0.00031537088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046432854,0.00028231385,0.0003393144,0.0014690049,0.0009706906,0.0014643394,0.0004572102,0.00060144684,0.0042366134],"category_scores_gemma":[0.004576855,0.00031635034,0.00041057644,0.00081290206,0.0013164694,0.0018667324,0.0008876303,0.0010638112,0.0003379158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005226232,0.000078469435,0.0055877836,0.00018318437,0.000023378449,0.00046747178,0.00062473136,0.028234169,0.032530736,0.89960176,0.0018213555,0.030324401],"study_design_scores_gemma":[0.000097005555,0.00021117258,0.004365987,0.00007903015,0.00002276561,0.00065731804,0.00039987694,0.051740658,0.03199706,0.9014913,0.008865627,0.000072139715],"about_ca_topic_score_codex":0.00081589684,"about_ca_topic_score_gemma":0.0008187582,"teacher_disagreement_score":0.0042366134,"about_ca_system_score_codex":0.0013852543,"about_ca_system_score_gemma":0.00077660487,"threshold_uncertainty_score":0.014172852},"labels":[],"label_agreement":null},{"id":"W4226147448","doi":"10.1017/fms.2022.71","title":"An improvement on Schmidt’s bound on the number of number fields of bounded discriminant and small degree","year":2022,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Discriminant; Mathematics; Degree (music); Bounded function; Monic polynomial; Integer (computer science); Combinatorics; Linear discriminant analysis; Upper and lower bounds; Algebraic number field; Square (algebra); Discrete mathematics; Polynomial; Statistics; Artificial intelligence; Mathematical analysis; Computer science; Geometry","score_opus":0.0341852324190214,"score_gpt":0.26253189520007775,"score_spread":0.22834666278105636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226147448","genre_codex":"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.2793343,0.012460273,0.49634677,0.024931284,0.0028976947,0.0002866317,0.0029206502,0.003308899,0.17751347],"genre_scores_gemma":[0.8917966,0.002929102,0.078429215,0.0026419288,0.0025980964,0.00032987693,0.0011038834,0.00052666693,0.019644639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98917866,0.0021323028,0.00047622027,0.0022657253,0.0038496782,0.0020973578],"domain_scores_gemma":[0.9608531,0.02661296,0.00092238886,0.0066920966,0.0028453565,0.0020740423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010008486,0.0021752012,0.0030681167,0.0046484205,0.002364381,0.0042914525,0.00410454,0.0024152156,0.013392547],"category_scores_gemma":[0.033111952,0.0011886044,0.0027303656,0.0028314136,0.007437565,0.015462899,0.011297706,0.008471398,0.0028191055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034461017,0.00040669352,0.0068453546,0.00093293324,0.00015143237,0.0006004926,0.0008113235,0.03075251,0.029196644,0.7766178,0.04081377,0.10942494],"study_design_scores_gemma":[0.00039539902,0.00068822753,0.005712791,0.00033840808,0.0002809416,0.0011900531,0.00020552655,0.19432819,0.04380207,0.69499546,0.05777373,0.00028921844],"about_ca_topic_score_codex":0.002090768,"about_ca_topic_score_gemma":0.0016402346,"teacher_disagreement_score":0.013392547,"about_ca_system_score_codex":0.0038567118,"about_ca_system_score_gemma":0.0025865014,"threshold_uncertainty_score":0.052930534},"labels":[],"label_agreement":null},{"id":"W4229985284","doi":"10.22215/etd/2013-10033","title":"Interleaved Sequences Over Finite Fields","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyphase system; Complementary sequences; Mathematics; Autocorrelation; Sequence (biology); Power of two; Pseudorandom number generator; Measure (data warehouse); Integer (computer science); Combinatorics; Linear span; Correlation; Algorithm; Discrete mathematics; Computer science; Statistics","score_opus":0.0120006681858887,"score_gpt":0.2503784513973232,"score_spread":0.2383777832114345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229985284","genre_codex":"methods","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.15060866,0.00436351,0.752768,0.0033215259,0.0011209941,0.00009603581,0.00027409292,0.00092884374,0.08651829],"genre_scores_gemma":[0.84342206,0.004118902,0.10876313,0.0006637931,0.0010438312,0.00013592467,0.00054285466,0.00017712085,0.041132297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903345,0.00026963174,0.0000497052,0.00015186919,0.00035800406,0.00013746523],"domain_scores_gemma":[0.9973937,0.0013958534,0.00016997589,0.00047013265,0.00039311202,0.0001771322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088307826,0.00043593196,0.0003320245,0.000905745,0.00054587884,0.0013418556,0.00041823616,0.00046440205,0.0041666557],"category_scores_gemma":[0.0049254685,0.0002922899,0.00028238224,0.0009985252,0.00095222035,0.0024328863,0.0011956401,0.001915228,0.0012740066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002815384,0.00007739671,0.0006904981,0.00012237563,0.000022027536,0.00015849168,0.0004108892,0.013997704,0.010029285,0.8467357,0.005324527,0.12214958],"study_design_scores_gemma":[0.00006981794,0.0001304045,0.00033896527,0.0001401182,0.000026415904,0.00025895453,0.00009860774,0.04716726,0.018544707,0.8961111,0.03707365,0.000040028048],"about_ca_topic_score_codex":0.00039843447,"about_ca_topic_score_gemma":0.00038807408,"teacher_disagreement_score":0.0041666557,"about_ca_system_score_codex":0.0007637714,"about_ca_system_score_gemma":0.00074254215,"threshold_uncertainty_score":0.013938904},"labels":[],"label_agreement":null},{"id":"W4230296085","doi":"10.22215/etd/2018-12849","title":"Fixed Points of Rational Functions Satisfying the Carlitz Property","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fixed point; Mathematics; Property (philosophy); Rational function; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01738869069007446,"score_gpt":0.24324929686779453,"score_spread":0.22586060617772008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230296085","genre_codex":"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.63008064,0.000860324,0.3133879,0.00055947073,0.00008940947,0.00011948495,0.0002183109,0.00046238065,0.05422212],"genre_scores_gemma":[0.9443186,0.00066452223,0.043569796,0.000112574766,0.00006512954,0.000108036016,0.00015824859,0.00013487063,0.010868131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994205,0.00011892736,0.000032469456,0.00010466327,0.00017109819,0.0001522779],"domain_scores_gemma":[0.9985744,0.0007340277,0.00014356173,0.0002848229,0.00018862917,0.000074467054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009810999,0.0005414955,0.00057637907,0.0015874956,0.0011937602,0.0020094353,0.0006240339,0.0007678502,0.0036125258],"category_scores_gemma":[0.003912162,0.00034554905,0.0008289708,0.0011000963,0.0025932873,0.0019395411,0.0014701273,0.0020179208,0.0011485515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021008121,0.00003343801,0.0010567835,0.000062525614,0.000014830033,0.00020507677,0.00043339483,0.0065659625,0.013566218,0.9381457,0.00077567186,0.038930207],"study_design_scores_gemma":[0.000089838264,0.0001749901,0.0007794353,0.00007179497,0.000031776293,0.0003623197,0.0002339789,0.02587036,0.03154878,0.93220615,0.008566597,0.00006407636],"about_ca_topic_score_codex":0.00079944567,"about_ca_topic_score_gemma":0.0006021466,"teacher_disagreement_score":0.0036125258,"about_ca_system_score_codex":0.0013312154,"about_ca_system_score_gemma":0.00092108035,"threshold_uncertainty_score":0.01208508},"labels":[],"label_agreement":null},{"id":"W4232343029","doi":"10.22215/etd/2010-09044","title":"On the existence of irreducible polynomials with prescribed coeffecients over finite fields","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; University of Ottawa; Library and Archives Canada","funders":"","keywords":"Finite field; Mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.01268840810658657,"score_gpt":0.24291704436477973,"score_spread":0.23022863625819318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232343029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7003797,0.0032679588,0.15142304,0.0069593396,0.00038899088,0.00006175708,0.0004669186,0.0003909601,0.13666128],"genre_scores_gemma":[0.97218907,0.0013457822,0.01399416,0.00024631532,0.00036420094,0.00002596575,0.00021179405,0.0000859931,0.011536681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884665,0.00034704254,0.000058044738,0.00019166761,0.0002974526,0.0002592046],"domain_scores_gemma":[0.9882488,0.00900896,0.0006911956,0.0007310474,0.0007234972,0.000596488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017486265,0.0005112148,0.00075720274,0.0014715785,0.0011151774,0.002975024,0.00067115854,0.0008164544,0.0040135896],"category_scores_gemma":[0.014352315,0.0005038415,0.0005018892,0.0011080444,0.0033023595,0.0041757156,0.0024271195,0.0026284745,0.00061114656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023882865,0.00006425902,0.001478812,0.000109432505,0.0000120694685,0.000244164,0.00053627195,0.00327029,0.0031643745,0.9717947,0.0023979326,0.016688852],"study_design_scores_gemma":[0.00009750608,0.00011240073,0.0012264798,0.00010635171,0.000027534792,0.0005704689,0.00032461667,0.025695173,0.0040291715,0.96039283,0.0073765367,0.000040882955],"about_ca_topic_score_codex":0.0009331617,"about_ca_topic_score_gemma":0.0010363326,"teacher_disagreement_score":0.0040135896,"about_ca_system_score_codex":0.0016432006,"about_ca_system_score_gemma":0.0010489074,"threshold_uncertainty_score":0.01342684},"labels":[],"label_agreement":null},{"id":"W4232626058","doi":"10.4213/im8739","title":"Asymptotic bounds for spherical codes","year":2019,"lang":"en","type":"article","venue":"Известия Российской академии наук Серия математическая","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hamming code; Mathematics; Cardinality (data modeling); Code (set theory); Hamming distance; Alphabet; Discrete mathematics; Linear code; Unit square; Computability; Set (abstract data type); Combinatorics; Constant-weight code; Block code; Algorithm; Computer science; Decoding methods","score_opus":0.008963900251776027,"score_gpt":0.22889879917547643,"score_spread":0.21993489892370038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232626058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04039225,0.022304645,0.72360766,0.004715102,0.0011021892,0.00008660457,0.0010803628,0.0013201532,0.205391],"genre_scores_gemma":[0.8238017,0.021946883,0.11208108,0.0027897737,0.003116676,0.0006825033,0.002792465,0.0010463049,0.031742636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631125,0.0008947127,0.00014501384,0.0004514433,0.001577715,0.000619799],"domain_scores_gemma":[0.97687715,0.015777947,0.00089970225,0.0022056994,0.003531813,0.0007076848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034821315,0.0016362196,0.001432336,0.0037547806,0.0014576911,0.0038916033,0.0022728809,0.0016182007,0.010832378],"category_scores_gemma":[0.037461918,0.00052537146,0.001296684,0.0034687715,0.0031952246,0.0058362386,0.0044976026,0.0044894777,0.0037103873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011892405,0.000027310483,0.0007033828,0.00027518082,0.000037090897,0.00010643074,0.00025191158,0.023707666,0.0017740962,0.9349692,0.009461133,0.028567668],"study_design_scores_gemma":[0.000013925628,0.000063765445,0.00089288555,0.00026252915,0.000052756743,0.0003490874,0.00014481225,0.1098458,0.0019694353,0.87121147,0.0151409,0.00005271218],"about_ca_topic_score_codex":0.003069408,"about_ca_topic_score_gemma":0.0026811885,"teacher_disagreement_score":0.010832378,"about_ca_system_score_codex":0.004137273,"about_ca_system_score_gemma":0.0019463383,"threshold_uncertainty_score":0.036237895},"labels":[],"label_agreement":null},{"id":"W4233307210","doi":"10.1109/tc.2007.70834","title":"A New Finite-Field Multiplier Using Redundant Representation","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Finite field; Critical path method; Mathematics; Algorithm; Representation (politics); Computer science; Arithmetic; Discrete mathematics","score_opus":0.046651435540987045,"score_gpt":0.2699889923095845,"score_spread":0.22333755676859746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233307210","genre_codex":"methods","genre_gemma":"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.15847659,0.001157452,0.8178729,0.00044345148,0.00055569294,0.00018796125,0.00023363017,0.0022882235,0.018784193],"genre_scores_gemma":[0.57118654,0.00065355795,0.41415006,0.00021761427,0.00021303291,0.000108601766,0.00033830962,0.00005427673,0.013078017],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998698,0.000021259197,0.000011409448,0.00002827188,0.00004788203,0.000021310147],"domain_scores_gemma":[0.999838,0.000022594857,0.000030761992,0.000032143424,0.00006192754,0.0000144572605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019471918,0.00045496927,0.00044228637,0.0005396496,0.00038279867,0.00045392133,0.00078113005,0.00038506804,0.0031152407],"category_scores_gemma":[0.0003523803,0.00021067867,0.00032304326,0.0004997427,0.00023212665,0.0010009463,0.00027874944,0.00045530443,0.00087047025],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006060381,0.00014419644,0.0007562318,0.0004616489,0.00008936411,0.0006945233,0.00014060113,0.013743535,0.5438424,0.07491982,0.004790845,0.35981086],"study_design_scores_gemma":[0.0004145063,0.0037729032,0.0019968005,0.00017072186,0.00040567038,0.0068337084,0.00010608412,0.30008456,0.5506796,0.03082067,0.104520954,0.00019379833],"about_ca_topic_score_codex":0.00019458051,"about_ca_topic_score_gemma":0.000467469,"teacher_disagreement_score":0.0031152407,"about_ca_system_score_codex":0.00028465333,"about_ca_system_score_gemma":0.0005734428,"threshold_uncertainty_score":0.0104215145},"labels":[],"label_agreement":null},{"id":"W4234843542","doi":"10.1109/tcomm.2006.877972","title":"Applications of algebraic soft-decision decoding of Reed-Solomon codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Berlekamp–Welch algorithm; Computational complexity theory; Reed–Solomon error correction; Rayleigh fading; Fading; Sequential decoding; Concatenated error correction code; Electronic engineering; Theoretical computer science; Computer engineering; Block code; Engineering","score_opus":0.01607861547041342,"score_gpt":0.2638310748973232,"score_spread":0.2477524594269098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234843542","genre_codex":"methods","genre_gemma":"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.031867668,0.00075440155,0.9530516,0.00025867173,0.000071396185,0.00006263499,0.000036405974,0.00047735035,0.01341988],"genre_scores_gemma":[0.6660341,0.001330077,0.32680058,0.00014618279,0.00012327965,0.0000642974,0.00008692488,0.00007331113,0.0053413394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989322,0.00032677123,0.00008376243,0.00009250337,0.00049492257,0.00006992576],"domain_scores_gemma":[0.9976209,0.0013161305,0.00024245131,0.00030995032,0.00046913937,0.000041433774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006109291,0.0004751092,0.00037037476,0.0007495672,0.00040279652,0.0008023538,0.0006038475,0.00040522154,0.0015669486],"category_scores_gemma":[0.004483208,0.00019835283,0.00026773108,0.0006616678,0.0009415102,0.0008175245,0.0011051744,0.00073015154,0.0006197521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028357637,0.000068231755,0.0012364633,0.00039106657,0.000042451597,0.0003244524,0.00032642848,0.20089735,0.05611531,0.41920152,0.00126993,0.31984323],"study_design_scores_gemma":[0.000037864516,0.00024867838,0.00035049842,0.0000620319,0.000025717452,0.0006413429,0.00006661369,0.76203614,0.092010655,0.13234182,0.012127911,0.00005076205],"about_ca_topic_score_codex":0.00045549017,"about_ca_topic_score_gemma":0.00066195667,"teacher_disagreement_score":0.0015669486,"about_ca_system_score_codex":0.00060822227,"about_ca_system_score_gemma":0.0006819272,"threshold_uncertainty_score":0.0052419305},"labels":[],"label_agreement":null},{"id":"W4236247724","doi":"10.22215/etd/2007-07938","title":"Langford sequences and their variants: partitions of {1, . . . , 2m + 2} \\ {k, 2m + 1}, {1, . . . , 2m—1, L} and {1, . . . , 2m, L} \\ {2} into differences in {d, . . . , d + m —1}","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.015555556260213148,"score_gpt":0.26174232423337923,"score_spread":0.24618676797316608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236247724","genre_codex":"empirical","genre_gemma":"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.44663003,0.0062842723,0.43767032,0.0026143184,0.0013972955,0.00016659049,0.0010001471,0.0004968344,0.103740275],"genre_scores_gemma":[0.85759497,0.0018136333,0.092086375,0.00054142816,0.0010715484,0.00030266322,0.0009852014,0.00018694223,0.045417305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989411,0.0003918968,0.000064320426,0.00022249554,0.00020832467,0.0001719368],"domain_scores_gemma":[0.99713945,0.0011354721,0.0004500148,0.0005702079,0.0003277295,0.00037708558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015047529,0.00057180406,0.00040451234,0.0016018852,0.0011302065,0.0029040799,0.0007694018,0.00083564356,0.005103255],"category_scores_gemma":[0.007032973,0.00036009503,0.0004242209,0.0015953887,0.0026237897,0.004514586,0.0015017849,0.001609073,0.001364794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021772666,0.000021381813,0.00043818756,0.00003101704,0.00000445155,0.00006586389,0.00029720934,0.0017929068,0.0009779511,0.9744196,0.0021698282,0.019563913],"study_design_scores_gemma":[0.000034594545,0.000078365665,0.0007055147,0.00006153297,0.000009920231,0.0003138117,0.00019559408,0.014979496,0.0018455931,0.9667295,0.015008452,0.00003761159],"about_ca_topic_score_codex":0.0007247882,"about_ca_topic_score_gemma":0.0012832823,"teacher_disagreement_score":0.005103255,"about_ca_system_score_codex":0.0012248135,"about_ca_system_score_gemma":0.00078438036,"threshold_uncertainty_score":0.017072082},"labels":[],"label_agreement":null},{"id":"W4236751895","doi":"10.22215/etd/2013-08571","title":"On difference maps and their cryptographic applications","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Cryptography; Humanities; Art; Computer security","score_opus":0.007838704822617884,"score_gpt":0.21598707970696537,"score_spread":0.20814837488434748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236751895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.12459393,0.034946114,0.5418346,0.007707847,0.003249756,0.00013613029,0.00033829955,0.00033949895,0.28685382],"genre_scores_gemma":[0.7714997,0.022024646,0.10243596,0.0017081489,0.0036200795,0.00026326103,0.0004343724,0.00023293114,0.097780846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990355,0.00030966313,0.00005395552,0.00016631647,0.00029561593,0.00013898553],"domain_scores_gemma":[0.99698263,0.0020893116,0.000183313,0.00027279143,0.00034688995,0.0001250501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128379,0.00079760316,0.00064883934,0.0028883188,0.0013089104,0.00224817,0.00081612624,0.0011770995,0.0068779285],"category_scores_gemma":[0.00703613,0.0004501598,0.0007572175,0.0031651603,0.0036582125,0.006232455,0.0034534053,0.003694078,0.001687938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003283523,0.000014094444,0.00010477265,0.000037048525,0.0000038181124,0.00004740056,0.00013092496,0.0012756692,0.0004670057,0.9792615,0.0014100026,0.017214868],"study_design_scores_gemma":[0.000008752843,0.00002908419,0.00011160056,0.000028522632,0.000004236516,0.00015731058,0.00004515073,0.00678811,0.00060711114,0.979003,0.013205634,0.0000115463845],"about_ca_topic_score_codex":0.00051281555,"about_ca_topic_score_gemma":0.0003343608,"teacher_disagreement_score":0.0068779285,"about_ca_system_score_codex":0.0012121899,"about_ca_system_score_gemma":0.00047129497,"threshold_uncertainty_score":0.023008943},"labels":[],"label_agreement":null},{"id":"W4237806138","doi":"10.1360/zf2010-40-9-1240","title":"低复杂度准循环低密度奇偶校验码的逐块构造法","year":2010,"lang":"ja","type":"article","venue":"Scientia Sinica Informationis","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.009124254520266814,"score_gpt":0.2385197187964452,"score_spread":0.2293954642761784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237806138","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.028866477,0.011273388,0.0143782655,0.06349912,0.0013250117,0.000114886716,0.00045587975,0.0001498471,0.87993693],"genre_scores_gemma":[0.82421887,0.011325278,0.014887642,0.0067271735,0.0010599698,0.0002777497,0.0003142032,0.00013135001,0.14105774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975567,0.0009883724,0.000114894065,0.0004883559,0.0006014768,0.00025018895],"domain_scores_gemma":[0.9974491,0.0010483905,0.0002522197,0.00017222081,0.0008048517,0.00027316017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029525484,0.000510194,0.00037647778,0.0018883636,0.0059632957,0.0115727205,0.0008932039,0.0022542668,0.015808782],"category_scores_gemma":[0.005415664,0.0003204742,0.0005102416,0.0025967048,0.014442102,0.0101746805,0.0020863712,0.0031435576,0.0030865213],"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.000019260768,0.000023838054,0.0012259468,0.00013437153,0.000013651601,0.00008724173,0.009714997,0.00030769125,0.00019897762,0.95149034,0.01863896,0.018144812],"study_design_scores_gemma":[0.000030959163,0.00003853033,0.0041861674,0.00055979483,0.000035941524,0.00015981287,0.02432924,0.0010644508,0.0007291755,0.5920351,0.376782,0.000048811435],"about_ca_topic_score_codex":0.02103934,"about_ca_topic_score_gemma":0.020790668,"teacher_disagreement_score":0.02103934,"about_ca_system_score_codex":0.008487947,"about_ca_system_score_gemma":0.011105212,"threshold_uncertainty_score":0.06158471},"labels":[],"label_agreement":null},{"id":"W4238079082","doi":"10.1017/cbo9781139195768.006","title":"Deciphering delay","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Literal (mathematical logic); Prefix; Computer science; Arithmetic; Mathematics; Algorithm; Linguistics","score_opus":0.0179503510271684,"score_gpt":0.18597688397889078,"score_spread":0.16802653295172237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238079082","genre_codex":"other","genre_gemma":"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.016860204,0.0544731,0.3376764,0.003289462,0.00439063,0.00014501176,0.00068159756,0.001543818,0.58093977],"genre_scores_gemma":[0.273945,0.08126903,0.16940369,0.0024787597,0.0020859053,0.00030534077,0.0011912,0.0011756056,0.4681455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994746,0.000048808604,0.000031732663,0.00013801128,0.00024756228,0.000059335438],"domain_scores_gemma":[0.99880517,0.0005608634,0.00006542531,0.00021030733,0.00031024936,0.000048036203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003794399,0.0007859137,0.00048855913,0.000920693,0.0006416533,0.0021778045,0.0009293482,0.00084983866,0.02384882],"category_scores_gemma":[0.0022555455,0.00033753845,0.0003668626,0.0010489323,0.0014100483,0.004818706,0.0013473231,0.002495436,0.00916514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088514214,0.000025284691,0.000098645534,0.00051320787,0.000007953109,0.00012623335,0.00035707562,0.0038721052,0.010953849,0.7332813,0.015858447,0.23481737],"study_design_scores_gemma":[0.0000148246745,0.00011324131,0.00012006196,0.00044963186,0.000017902534,0.0011092682,0.00014089023,0.004840904,0.024960982,0.25524172,0.7129472,0.00004340281],"about_ca_topic_score_codex":0.0003653688,"about_ca_topic_score_gemma":0.0003723724,"teacher_disagreement_score":0.02384882,"about_ca_system_score_codex":0.0014895458,"about_ca_system_score_gemma":0.0010134692,"threshold_uncertainty_score":0.07978231},"labels":[],"label_agreement":null},{"id":"W4239741176","doi":"10.1007/3-540-44977-9_8","title":"Prime Decompositions of Regular Prefix Codes","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix; Prefix code; Prime (order theory); Computer science; Automaton; Decomposition; Code (set theory); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Linear code; Combinatorics; Programming language; Block code; Decoding methods","score_opus":0.011576820774909497,"score_gpt":0.2315566761640496,"score_spread":0.2199798553891401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239741176","genre_codex":"methods","genre_gemma":"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.27253228,0.002912828,0.43751618,0.0015003617,0.0007113317,0.00018836427,0.0007678248,0.00063929526,0.28323156],"genre_scores_gemma":[0.7369312,0.003080526,0.13247998,0.0005569737,0.0008191162,0.0002489188,0.0010727055,0.0005524564,0.12425818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995772,0.00008638516,0.00002324648,0.00006779207,0.00016701972,0.000078359066],"domain_scores_gemma":[0.9992248,0.00031122117,0.00008241736,0.00014990098,0.00012637346,0.00010531212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005880363,0.0005909225,0.00063254096,0.001631212,0.00096688274,0.0021154003,0.00050436286,0.0004873094,0.007497051],"category_scores_gemma":[0.001906287,0.0004926503,0.00061147026,0.0014053101,0.0016902358,0.0026618063,0.0013902428,0.002032101,0.0018469881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029755773,0.000009764933,0.00006089752,0.000020416428,0.0000026881112,0.00003078414,0.00011177506,0.00079683756,0.00075350696,0.9846428,0.0015682383,0.01197263],"study_design_scores_gemma":[0.0000070869937,0.000011950154,0.00006480401,0.000009546111,0.0000039586007,0.0000737628,0.000027121689,0.0024657717,0.0005493541,0.9911663,0.0056144632,0.000005919192],"about_ca_topic_score_codex":0.00040279998,"about_ca_topic_score_gemma":0.0004117274,"teacher_disagreement_score":0.007497051,"about_ca_system_score_codex":0.0009132579,"about_ca_system_score_gemma":0.0006472635,"threshold_uncertainty_score":0.025080085},"labels":[],"label_agreement":null},{"id":"W4242110846","doi":"10.1109/isit.2001.936087","title":"On factor graphs and the Fourier transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Duality (order theory); Mathematics; Factor graph; Fourier transform; Discrete mathematics; Combinatorics; Mathematical analysis; Algorithm","score_opus":0.014084778959244775,"score_gpt":0.19516190344741607,"score_spread":0.1810771244881713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242110846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.09434591,0.0036565033,0.6756261,0.0035699515,0.0010612068,0.000062166655,0.00028646967,0.00032409577,0.22106762],"genre_scores_gemma":[0.8453035,0.00464965,0.10778634,0.0014267174,0.0014198141,0.000110557135,0.00031837163,0.00032223325,0.038662866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.0002464043,0.00002615303,0.000115802126,0.0001800018,0.0001353474],"domain_scores_gemma":[0.9987276,0.0005749274,0.000140736,0.00018874505,0.0002623964,0.000105568964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010580322,0.00062775885,0.00046321668,0.0019952187,0.0012236527,0.002096662,0.00059357693,0.0012199983,0.005366464],"category_scores_gemma":[0.002991206,0.00028442737,0.0008248161,0.0015469275,0.004361852,0.0053242445,0.0017805421,0.0021039795,0.0011601184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003932122,0.0000035843752,0.000022918299,0.0000056816966,8.6803203e-7,0.000016968075,0.000041037165,0.00050022017,0.00015060713,0.9970402,0.0003149516,0.0018989838],"study_design_scores_gemma":[0.0000014378526,0.0000040575896,0.000018315583,0.000005114795,9.152264e-7,0.0000399667,0.000022360182,0.0018373148,0.00011110716,0.99553007,0.002425951,0.0000032918267],"about_ca_topic_score_codex":0.0010517035,"about_ca_topic_score_gemma":0.00059269246,"teacher_disagreement_score":0.005366464,"about_ca_system_score_codex":0.00097502617,"about_ca_system_score_gemma":0.0004731944,"threshold_uncertainty_score":0.017952621},"labels":[],"label_agreement":null},{"id":"W4242297744","doi":"10.1109/fdtc.2007.4318983","title":"Fault Detection Structures for the Montgomery Multiplication over Binary Extension Fields","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Error detection and correction; Binary number; Multiplication (music); Arithmetic; Finite field; Finite field arithmetic; Redundancy (engineering); Cryptography; Multiplier (economics); Algorithm; Parallel computing; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.015906011759059296,"score_gpt":0.2645926643358906,"score_spread":0.24868665257683134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242297744","genre_codex":"methods","genre_gemma":"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.23911065,0.0010202007,0.7540255,0.00055645953,0.00016034288,0.00014197006,0.00010644887,0.0012258145,0.0036526134],"genre_scores_gemma":[0.78585666,0.00037694752,0.20773868,0.00023634032,0.00012534785,0.00013703633,0.0001727738,0.00004387051,0.0053122775],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999595,0.00007085985,0.000051889758,0.0000716138,0.00016233289,0.00004844921],"domain_scores_gemma":[0.99804604,0.0006176985,0.0005072141,0.00036530072,0.00041728243,0.00004645755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052919314,0.00037813414,0.00037863373,0.0009434094,0.0007318506,0.0006866614,0.0007632014,0.00062203896,0.0016291474],"category_scores_gemma":[0.0021842604,0.00018668926,0.00030454417,0.0005456692,0.00062503567,0.0014554912,0.00073257665,0.00057691906,0.00034511005],"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.0016720245,0.00026788426,0.0036421109,0.0004391071,0.000092358605,0.0009981928,0.0008685743,0.052487686,0.2171247,0.21115227,0.0036282437,0.50762695],"study_design_scores_gemma":[0.00030929517,0.0024444317,0.0033939919,0.00024556072,0.00020084615,0.00231166,0.00022559699,0.45897946,0.35819608,0.14489338,0.028609259,0.00019044933],"about_ca_topic_score_codex":0.0005881921,"about_ca_topic_score_gemma":0.00085071166,"teacher_disagreement_score":0.0016291474,"about_ca_system_score_codex":0.0007752558,"about_ca_system_score_gemma":0.000869447,"threshold_uncertainty_score":0.00562495},"labels":[],"label_agreement":null},{"id":"W4248613845","doi":"10.22215/etd/2015-10627","title":"Deterministic Factorization of Polynomials over Finite Fields","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Mathematics; Factorization of polynomials; Factorization; Euler's totient function; Degree (music); Polynomial; Bounded function; Coprime integers; Field (mathematics); Prime factor; Discrete mathematics; Difference polynomials; Prime (order theory); Euler's formula; Orthogonal polynomials; Combinatorics; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.018700554306535798,"score_gpt":0.28432940002124985,"score_spread":0.26562884571471407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248613845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.034221545,0.0006714051,0.95695096,0.0004935323,0.00013626173,0.00006320813,0.00016877089,0.00042736554,0.0068670767],"genre_scores_gemma":[0.4682074,0.0024218906,0.5107654,0.00033009876,0.00051178824,0.00016994996,0.0009630212,0.00040355627,0.01622687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762946,0.0003423957,0.00016820911,0.0006943085,0.00073968095,0.00042602507],"domain_scores_gemma":[0.994713,0.0026913565,0.000458153,0.0013352144,0.0005834867,0.00021866044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020622597,0.0012051372,0.0012833128,0.0012293033,0.0016998823,0.0029631145,0.0010292821,0.0008403783,0.0059844074],"category_scores_gemma":[0.008914804,0.0007008938,0.0018674851,0.001435606,0.002797436,0.007807595,0.0031309521,0.003522585,0.002146993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033715492,0.00012754393,0.0010833741,0.00033193984,0.00004007496,0.00018097626,0.0004185971,0.034796797,0.009310806,0.82493985,0.0033476606,0.12508528],"study_design_scores_gemma":[0.000044223045,0.00008166219,0.00016512758,0.0000741171,0.000033334476,0.00020800716,0.000071057286,0.08560826,0.011515392,0.8931045,0.009048513,0.000045860226],"about_ca_topic_score_codex":0.0012342257,"about_ca_topic_score_gemma":0.0013208878,"teacher_disagreement_score":0.0059844074,"about_ca_system_score_codex":0.0020449024,"about_ca_system_score_gemma":0.00189706,"threshold_uncertainty_score":0.02001977},"labels":[],"label_agreement":null},{"id":"W4248623970","doi":"10.1109/isit.1991.695146","title":"Exact Lower Bounds On The Code Length Of Three-step Permutation-decodable Cyclic Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Permutation (music); Cyclic code; Code (set theory); Computer science; Upper and lower bounds; Mathematics; Algorithm; Combinatorics; Block code; Linear code; Decoding methods; Physics; Programming language","score_opus":0.019430490607029373,"score_gpt":0.24456108052989448,"score_spread":0.2251305899228651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248623970","genre_codex":"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.3506817,0.013654097,0.5244411,0.0104478495,0.00089997094,0.000325779,0.005039488,0.0032540406,0.09125605],"genre_scores_gemma":[0.8817429,0.00414314,0.09230078,0.0012461555,0.000831858,0.00068920845,0.00312544,0.00070176047,0.015218797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942484,0.0009377758,0.00023409387,0.00066698395,0.0027273363,0.0011853772],"domain_scores_gemma":[0.9618831,0.027629027,0.0015571653,0.005172778,0.002795107,0.0009628232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040830057,0.0024002849,0.002076628,0.0027394367,0.002132503,0.0045102313,0.0034811243,0.0034878317,0.009897849],"category_scores_gemma":[0.028203418,0.0013607603,0.0012362483,0.0029708813,0.0038623486,0.0074397866,0.005595661,0.0065149674,0.0029608856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034276093,0.00040489674,0.0041816346,0.001234003,0.00023479034,0.0005894221,0.0009860261,0.2772834,0.043519538,0.5258589,0.01696161,0.12531812],"study_design_scores_gemma":[0.00017597848,0.0002459544,0.0013678104,0.00024752118,0.00011215429,0.00037252175,0.00011123566,0.49180853,0.020845732,0.47902295,0.005514451,0.00017516564],"about_ca_topic_score_codex":0.0020841595,"about_ca_topic_score_gemma":0.003858377,"teacher_disagreement_score":0.009897849,"about_ca_system_score_codex":0.0052100453,"about_ca_system_score_gemma":0.0047734827,"threshold_uncertainty_score":0.037801683},"labels":[],"label_agreement":null},{"id":"W4249698913","doi":"10.1109/glocom.2014.7417538","title":"Low Complexity Hybrid ARQ Using Extended Turbo Product Codes Self-Detection","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hybrid automatic repeat request; Cyclic redundancy check; Computer science; Error detection and correction; Turbo code; Algorithm; Throughput; Automatic repeat request; Turbo; Low-density parity-check code; Redundancy (engineering); Real-time computing; Decoding methods; Wireless; Computer network; Telecommunications link; Engineering; Telecommunications","score_opus":0.06391313434900145,"score_gpt":0.30757356344370057,"score_spread":0.24366042909469912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249698913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.07848668,0.00080984295,0.9144004,0.00015133242,0.000129734,0.000080593316,0.00006801632,0.0016078426,0.004265558],"genre_scores_gemma":[0.78955233,0.00026181294,0.20583957,0.00018563052,0.00013549687,0.00007564564,0.00010532258,0.00004769337,0.0037964939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990343,0.00024636087,0.00004021424,0.00014631213,0.00046040537,0.0000723516],"domain_scores_gemma":[0.9983352,0.0007321713,0.0001785915,0.00029327953,0.00041143145,0.000049390914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778547,0.00051462144,0.000665317,0.00064437493,0.00045307685,0.0008517482,0.0011917832,0.00059359474,0.001761359],"category_scores_gemma":[0.0014789158,0.00024987446,0.00037247982,0.0005197563,0.0005193338,0.0011409335,0.0009818765,0.00059052324,0.000684547],"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.0014869345,0.00029166357,0.003539887,0.00042184244,0.00029617464,0.0012715296,0.00037322805,0.12195336,0.25166938,0.049241174,0.0042573954,0.56519735],"study_design_scores_gemma":[0.00010779398,0.0007160857,0.0006832022,0.000022706328,0.00007577869,0.0012749414,0.00003304224,0.9502587,0.036728427,0.005725821,0.004304709,0.0000688685],"about_ca_topic_score_codex":0.0004820546,"about_ca_topic_score_gemma":0.00061644136,"teacher_disagreement_score":0.001761359,"about_ca_system_score_codex":0.000251576,"about_ca_system_score_gemma":0.00048532346,"threshold_uncertainty_score":0.0058922768},"labels":[],"label_agreement":null},{"id":"W4250205828","doi":"10.1016/s0304-3975(04)00113-6","title":"The number of binary words avoiding abelian fourth powers grows exponentially","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponential growth; Abelian group; Binary number; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.00792064906453805,"score_gpt":0.24223702468757136,"score_spread":0.2343163756230333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250205828","genre_codex":"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.7242743,0.002857546,0.12878352,0.011260673,0.0015514191,0.0001522728,0.0012636197,0.0017135689,0.12814307],"genre_scores_gemma":[0.9088398,0.0023889914,0.034128714,0.0016938999,0.0015232448,0.00046231732,0.0014100581,0.0006598692,0.048893005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980882,0.00042074407,0.00010165629,0.0003684007,0.0006754609,0.00034554157],"domain_scores_gemma":[0.97977865,0.01500271,0.0012876551,0.001943339,0.0012728433,0.0007147007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001322591,0.001103703,0.0016988396,0.0022066578,0.001807412,0.0045036785,0.0022923367,0.003242249,0.011479961],"category_scores_gemma":[0.015620419,0.0010575227,0.0010401079,0.0015316001,0.003775661,0.011379355,0.0030152847,0.004097389,0.0032943757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006176686,0.00015805388,0.0023355654,0.00063135935,0.00008008658,0.00038878265,0.00036699002,0.007691692,0.022371667,0.91221166,0.011397649,0.041748956],"study_design_scores_gemma":[0.00010126104,0.00008781834,0.0017790748,0.00012456936,0.00007811618,0.0012710182,0.00015690197,0.03723992,0.015332913,0.92981935,0.013937827,0.00007121465],"about_ca_topic_score_codex":0.00016304317,"about_ca_topic_score_gemma":0.00019768352,"teacher_disagreement_score":0.011479961,"about_ca_system_score_codex":0.0010752871,"about_ca_system_score_gemma":0.0007775394,"threshold_uncertainty_score":0.038404346},"labels":[],"label_agreement":null},{"id":"W4250336549","doi":"10.1109/isit.1997.613319","title":"Fast erasure and error decoding of algebraic geometry codes up to the Feng-Rao bound","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Erasure; Decoding methods; Generalization; Algorithm; List decoding; Algebraic number; Point (geometry); Computer science; Upper and lower bounds; Mathematics; Discrete mathematics; Concatenated error correction code; Geometry; Block code; Mathematical analysis","score_opus":0.025665025729640984,"score_gpt":0.23733339046640667,"score_spread":0.21166836473676567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250336549","genre_codex":"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.12242206,0.00094484934,0.86785954,0.00038107304,0.00011185869,0.00008798598,0.000107800406,0.00066887937,0.0074159424],"genre_scores_gemma":[0.6144096,0.00079326035,0.37933525,0.00016983491,0.00009563542,0.00014059426,0.00018807278,0.00008453361,0.0047830665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998533,0.00045279987,0.000097904944,0.00017236422,0.00048145876,0.0002624301],"domain_scores_gemma":[0.99813867,0.0009317148,0.00020234572,0.0003584029,0.0003025634,0.00006617014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401942,0.00085458416,0.0010528127,0.0009519954,0.0008763503,0.0012549129,0.0009259277,0.00094763254,0.0011499631],"category_scores_gemma":[0.0052700033,0.00037770922,0.00070384465,0.0010046522,0.001420869,0.001632119,0.0024601314,0.0016386549,0.00075885805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005761751,0.000055971115,0.0014326227,0.00019148576,0.000071668546,0.00034834933,0.00047439212,0.14883243,0.03520105,0.5672419,0.0026230908,0.24295086],"study_design_scores_gemma":[0.000101605765,0.00034964792,0.0006954992,0.000079438316,0.000055924516,0.0006069874,0.00008456688,0.62032586,0.0751482,0.29549873,0.006932914,0.00012058529],"about_ca_topic_score_codex":0.0011772363,"about_ca_topic_score_gemma":0.0013693261,"teacher_disagreement_score":0.0012549129,"about_ca_system_score_codex":0.0007303377,"about_ca_system_score_gemma":0.0012120676,"threshold_uncertainty_score":0.0055010915},"labels":[],"label_agreement":null},{"id":"W4252118012","doi":"10.22215/etd/2016-11313","title":"Deficiency and Ambiguity of Low Degree Permutation Polynomials","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Ambiguity; Permutation (music); Degree (music); Bijection; Abelian group; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.015065077950135106,"score_gpt":0.2503919824769201,"score_spread":0.235326904526785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252118012","genre_codex":"empirical","genre_gemma":"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.85720414,0.0011598174,0.10956672,0.0013280378,0.00018507079,0.0000410761,0.00016090841,0.00010173764,0.030252442],"genre_scores_gemma":[0.9844541,0.0003669158,0.012186691,0.00007999875,0.00012448746,0.000017616501,0.00007069358,0.000024706305,0.0026748315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986527,0.00027994814,0.00009542322,0.00025220832,0.00048090494,0.00023870224],"domain_scores_gemma":[0.9949431,0.0029029723,0.0006603921,0.000537332,0.00051260006,0.000443549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016961915,0.00040814467,0.00050953764,0.0020761744,0.0010366214,0.0023068695,0.00059009396,0.0005476914,0.002425483],"category_scores_gemma":[0.010287302,0.00025083547,0.0005175057,0.0009503605,0.0038630627,0.0053228913,0.0015876006,0.0020008103,0.0003778945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011377791,0.000024144658,0.0026441142,0.000065341206,0.000005331181,0.00018951335,0.00054756703,0.0019698276,0.004119993,0.9785017,0.00039072425,0.011427956],"study_design_scores_gemma":[0.00001924218,0.00007234902,0.001279274,0.000040190294,0.000009699532,0.00064911495,0.00028994636,0.009347925,0.0033093453,0.9811282,0.0038234289,0.000031221232],"about_ca_topic_score_codex":0.0003626658,"about_ca_topic_score_gemma":0.00021891166,"teacher_disagreement_score":0.002425483,"about_ca_system_score_codex":0.0011772021,"about_ca_system_score_gemma":0.00066765764,"threshold_uncertainty_score":0.00897038},"labels":[],"label_agreement":null},{"id":"W4281395388","doi":"10.1007/s10958-022-05840-w","title":"Victor Timofeevich Markov (21.06.1948–15.07.2019)","year":2022,"lang":"de","type":"article","venue":"Journal of Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Markov chain; Statistics","score_opus":0.023162792040450863,"score_gpt":0.2712931386627968,"score_spread":0.24813034662234595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281395388","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009768854,0.16046654,0.015639186,0.08156402,0.06196016,0.000061096776,0.003312755,0.0009260911,0.6663013],"genre_scores_gemma":[0.113818236,0.07239141,0.0032285163,0.008063544,0.014360262,0.00006715388,0.0013059435,0.00054293143,0.786222],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977165,0.000026456843,0.000008203275,0.000082194885,0.00007625062,0.00003518395],"domain_scores_gemma":[0.9997569,0.00005920256,0.00002836477,0.000021351087,0.00006766718,0.0000664897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035629148,0.00040169986,0.00041902013,0.00067658717,0.0008028016,0.0012882506,0.00035116583,0.0006807428,0.066584475],"category_scores_gemma":[0.0013367968,0.00014013147,0.00011876861,0.00053653563,0.0006802982,0.0011487516,0.0010947707,0.0015284431,0.046128936],"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.00011021573,0.000021308912,0.00041477216,0.00022532069,0.000016633678,0.00012580816,0.000108318105,0.0004603853,0.0009938383,0.14029863,0.6853118,0.17191301],"study_design_scores_gemma":[0.0000072781504,0.00002299746,0.0003974831,0.00010901583,0.0000046444075,0.00018361009,0.000021983227,0.0002536157,0.0006635088,0.019500026,0.97882265,0.00001323947],"about_ca_topic_score_codex":0.0010841618,"about_ca_topic_score_gemma":0.0011582788,"teacher_disagreement_score":0.066584475,"about_ca_system_score_codex":0.0010481616,"about_ca_system_score_gemma":0.00064758956,"threshold_uncertainty_score":0.2227472},"labels":[],"label_agreement":null},{"id":"W4284664208","doi":"10.1145/3476446.3536178","title":"Linear Hensel Lifting for Zp[x,y] for n Factors with Cubic Cost","year":2022,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Mathematics; Cubic function; Combinatorics; Polynomial; Univariate; Quadratic equation; Algorithm; Bounded function; Mathematical analysis; Geometry; Statistics","score_opus":0.03198754815850494,"score_gpt":0.2539633507745535,"score_spread":0.22197580261604857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284664208","genre_codex":"methods","genre_gemma":"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.09173492,0.00016367888,0.89047563,0.00026646338,0.00009918636,0.00017445657,0.00024511662,0.005966574,0.010874019],"genre_scores_gemma":[0.43618017,0.00019975676,0.54922855,0.0001240144,0.00010864181,0.00016099996,0.0007695873,0.00041802647,0.012810269],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994814,0.000036981262,0.00002630555,0.00007990345,0.00025125057,0.0001241187],"domain_scores_gemma":[0.999374,0.00014052361,0.000051952153,0.00027721887,0.000116015544,0.00004037742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047254507,0.00062776817,0.00045237664,0.000768643,0.0007281181,0.0006545556,0.0007919732,0.00033385374,0.010612734],"category_scores_gemma":[0.0017896652,0.00023254998,0.00068985345,0.00075954717,0.00056353054,0.0012942418,0.0017664446,0.0008298553,0.0027876813],"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.00068650907,0.00015847033,0.002188444,0.00034282403,0.00004889166,0.0004014524,0.0004742092,0.026694354,0.05562644,0.06061514,0.014964637,0.83779866],"study_design_scores_gemma":[0.00043254776,0.00091861637,0.0040172176,0.00013566503,0.00011247122,0.0012262494,0.0005976302,0.5705623,0.1768144,0.16991805,0.07510333,0.00016155148],"about_ca_topic_score_codex":0.0026915655,"about_ca_topic_score_gemma":0.0029923564,"teacher_disagreement_score":0.010612734,"about_ca_system_score_codex":0.0006432606,"about_ca_system_score_gemma":0.001070361,"threshold_uncertainty_score":0.03550309},"labels":[],"label_agreement":null},{"id":"W4285296771","doi":"10.1561/0100000120","title":"Codes in the Sum-Rank Metric: Fundamentals and Applications","year":2022,"lang":"en","type":"article","venue":"Foundations and Trends® in Communications and Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rank (graph theory); Metric (unit); Mathematics; Combinatorics; Computer science; Engineering; Operations management","score_opus":0.022634120572137064,"score_gpt":0.28143243875738033,"score_spread":0.2587983181852433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285296771","genre_codex":"methods","genre_gemma":"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.024198636,0.23919512,0.598181,0.0060510454,0.0022884686,0.00013497786,0.00073636335,0.00054108986,0.12867337],"genre_scores_gemma":[0.38505656,0.2689823,0.30716956,0.0021532765,0.0069759237,0.00040421495,0.001042345,0.00030416975,0.027911628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988514,0.0002505385,0.000091128415,0.0002049572,0.00048084016,0.00012112455],"domain_scores_gemma":[0.99836725,0.00079434866,0.00016876303,0.00018378827,0.0003871525,0.00009871366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008894192,0.00092704257,0.00083387096,0.0030178677,0.00078905467,0.002402724,0.0007801318,0.0015145269,0.0027384157],"category_scores_gemma":[0.00307442,0.0005010138,0.0006126609,0.0047500576,0.0027054148,0.0028928556,0.0018916792,0.0038422646,0.0015420177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025991423,0.000029841827,0.00037334193,0.00048156717,0.000014443313,0.00014382019,0.00035773977,0.009015625,0.0022656128,0.87490314,0.00800517,0.1043837],"study_design_scores_gemma":[0.000008424142,0.00010539135,0.0005443737,0.00030052778,0.000014236166,0.0009563281,0.00016746244,0.034791898,0.0024972816,0.7954751,0.16505694,0.00008205758],"about_ca_topic_score_codex":0.0014211689,"about_ca_topic_score_gemma":0.00076499593,"teacher_disagreement_score":0.0030178677,"about_ca_system_score_codex":0.001656716,"about_ca_system_score_gemma":0.0011155226,"threshold_uncertainty_score":0.0120203495},"labels":[],"label_agreement":null},{"id":"W4286614538","doi":"","title":"Décodage de turbo codes concaténés en série","year":2022,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; Programming language; Operating system","score_opus":0.017398850844093292,"score_gpt":0.23915812403932177,"score_spread":0.22175927319522848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286614538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.45709822,0.0017568298,0.51165694,0.0016195645,0.0013159534,0.00014535102,0.00079370436,0.0036209694,0.02199245],"genre_scores_gemma":[0.8678609,0.0012210812,0.08384855,0.00037735922,0.00042848245,0.00022759441,0.0010136808,0.0008255113,0.04419687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973623,0.0006243539,0.00015037775,0.00035201537,0.0011796247,0.00033123468],"domain_scores_gemma":[0.9940394,0.0032293897,0.00042077244,0.0010174375,0.0010218322,0.00027119403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020247686,0.0018833373,0.001534899,0.0013585122,0.0012559994,0.0023682455,0.0006514967,0.002250489,0.004666976],"category_scores_gemma":[0.008451471,0.00058239273,0.0012805174,0.000904901,0.0020306536,0.0017332722,0.0019250563,0.0020491213,0.0019167736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056434763,0.00035448262,0.0056972923,0.0005766268,0.00059844245,0.0059578284,0.0014373341,0.35800898,0.18321122,0.22557415,0.011797508,0.20114264],"study_design_scores_gemma":[0.0002016318,0.0006297898,0.0036561277,0.00015983402,0.00016095892,0.0015520015,0.00016467071,0.7948329,0.15499806,0.03260705,0.0108363805,0.00020062708],"about_ca_topic_score_codex":0.004422859,"about_ca_topic_score_gemma":0.004740093,"teacher_disagreement_score":0.004666976,"about_ca_system_score_codex":0.0019429687,"about_ca_system_score_gemma":0.001893524,"threshold_uncertainty_score":0.015612602},"labels":[],"label_agreement":null},{"id":"W4286890469","doi":"10.48550/arxiv.2110.15582","title":"Construction of APN permutations via Walsh zero spaces","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subspace topology; Mathematics; Zero (linguistics); Combinatorics; Affine transformation; Vector space; Space (punctuation); Inverse; Affine space; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.042106735222034175,"score_gpt":0.1739180368166843,"score_spread":0.13181130159465013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286890469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.25663984,0.00022223301,0.6411082,0.00053822726,0.00033079958,0.00019189884,0.00038404504,0.0011396635,0.09944506],"genre_scores_gemma":[0.8042011,0.00018505365,0.16315205,0.00026358353,0.00007157283,0.00037566343,0.000542212,0.00035817485,0.030850632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904364,0.0002560316,0.00006284948,0.00016318263,0.0002637647,0.00021043902],"domain_scores_gemma":[0.99924755,0.00017997519,0.000064787855,0.00025723423,0.00013020118,0.00012024773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063238665,0.0005901159,0.00040082083,0.0011039864,0.0014432397,0.0021374545,0.00067596784,0.00075122755,0.0077954074],"category_scores_gemma":[0.0018847999,0.00032884846,0.00057838106,0.000856236,0.0021723176,0.0025219542,0.0037268482,0.0018128633,0.0020953345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051383275,0.000019818652,0.00017825514,0.000021136137,0.0000028117488,0.000119343065,0.00021644888,0.0012408266,0.006007789,0.9772395,0.0007772281,0.014125558],"study_design_scores_gemma":[0.000028057539,0.00011973906,0.00028689302,0.000039132054,0.0000109023385,0.00050973933,0.0003943717,0.028585156,0.030473044,0.9014011,0.03809183,0.000060084167],"about_ca_topic_score_codex":0.00035476172,"about_ca_topic_score_gemma":0.00037425722,"teacher_disagreement_score":0.0077954074,"about_ca_system_score_codex":0.0008469401,"about_ca_system_score_gemma":0.00074202614,"threshold_uncertainty_score":0.026078165},"labels":[],"label_agreement":null},{"id":"W4288088887","doi":"10.48550/arxiv.1910.12158","title":"Combinatorics of the geometry of Wilson loop diagrams II: Grassmann\\n necklaces, dimensions, and denominators","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Alexander von Humboldt-Stiftung","keywords":"Diagram; Grassmannian; Propagator; Loop (graph theory); Ideal (ethics); Mathematics; Dimension (graph theory); Necklace; Product (mathematics); Scattering amplitude; Feynman diagram; Pure mathematics; Combinatorics; Mathematical physics; Geometry; Scattering; Physics; Quantum mechanics","score_opus":0.02852317553058432,"score_gpt":0.16268050230356054,"score_spread":0.13415732677297623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288088887","genre_codex":"empirical","genre_gemma":"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.8958985,0.00020602507,0.07330368,0.00042253066,0.00004961375,0.00005275441,0.00019104242,0.00016947516,0.029706331],"genre_scores_gemma":[0.97376424,0.00014897474,0.016371103,0.00005830825,0.00007381539,0.000040313906,0.00015765194,0.00009736452,0.0092881955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994466,0.000115710594,0.000038369642,0.00011466722,0.00015757664,0.00012706142],"domain_scores_gemma":[0.999199,0.00021743505,0.00017942952,0.00010687296,0.00009659219,0.00020072974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054541306,0.00034339805,0.0003839109,0.0018966313,0.0012457252,0.0029806215,0.00061383395,0.00041061302,0.0035715438],"category_scores_gemma":[0.001276764,0.00028916058,0.0004358663,0.0008046677,0.002693151,0.003213054,0.0016781122,0.001033685,0.00047497448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007325454,0.00002216252,0.0008476614,0.000027239445,0.0000036162967,0.00024450078,0.0004611944,0.0015804144,0.0055023334,0.98460335,0.00051587576,0.0061183963],"study_design_scores_gemma":[0.000025179907,0.0000455997,0.0007309645,0.000017535893,0.000009391929,0.00038230955,0.0002844993,0.009744938,0.006155362,0.9774165,0.005159274,0.000028437167],"about_ca_topic_score_codex":0.0006787268,"about_ca_topic_score_gemma":0.00076421705,"teacher_disagreement_score":0.0035715438,"about_ca_system_score_codex":0.001080252,"about_ca_system_score_gemma":0.00047639594,"threshold_uncertainty_score":0.011947989},"labels":[],"label_agreement":null},{"id":"W4289519905","doi":"10.1007/s12095-022-00585-4","title":"Status of three classes of sequences","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Binary Golay code; Pseudorandom number generator; Ambiguity; Field (mathematics); Autocorrelation; Computer science; Cryptography; Complementary sequences; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Statistics; Pure mathematics; Programming language","score_opus":0.04423353199970351,"score_gpt":0.2763334129997022,"score_spread":0.2320998809999987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289519905","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2893595,0.02652618,0.23026596,0.017035404,0.0027804081,0.00025525058,0.00167139,0.00096999423,0.43113595],"genre_scores_gemma":[0.8894307,0.01305085,0.04280703,0.0020675668,0.0034057319,0.00046862254,0.0020849102,0.00019624275,0.04648837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871397,0.00026589376,0.00010462907,0.00024328684,0.0003723593,0.00029978863],"domain_scores_gemma":[0.99438995,0.0027761152,0.0006068067,0.0008473228,0.0008943685,0.00048542826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014957037,0.00059869135,0.0006260796,0.0037353225,0.0030213157,0.0053089987,0.0012700222,0.0026936338,0.0144293],"category_scores_gemma":[0.0063440898,0.00029045588,0.00056226976,0.0030930159,0.0029255021,0.006387334,0.0019383186,0.002260972,0.002883589],"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.00013012176,0.000031303407,0.00029625106,0.00008717577,0.000003924595,0.000040221978,0.00017292437,0.00025573486,0.00076219084,0.9603953,0.003416676,0.03440837],"study_design_scores_gemma":[0.000073387455,0.00014487363,0.00068135245,0.0001385748,0.000019449484,0.0006097215,0.00020312668,0.004809701,0.0033859161,0.92327905,0.066621654,0.000033180557],"about_ca_topic_score_codex":0.0005454508,"about_ca_topic_score_gemma":0.00019860736,"teacher_disagreement_score":0.0144293,"about_ca_system_score_codex":0.0014726178,"about_ca_system_score_gemma":0.0012575183,"threshold_uncertainty_score":0.04827082},"labels":[],"label_agreement":null},{"id":"W4289524100","doi":"10.1007/s12095-022-00603-5","title":"Concrete constructions of weightwise perfectly balanced (2-rotation symmetric) functions with optimal algebraic immunity and high weightwise nonlinearity","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Armand Frappier Museum","funders":"Key Scientific Research Project of Colleges and Universities in Henan Province; National Natural Science Foundation of China","keywords":"Boolean function; Hamming weight; Mathematics; Cipher; Hamming distance; Stream cipher; Cryptography; Rotation (mathematics); Algebraic number; Class (philosophy); Simplicity; Discrete mathematics; Topology (electrical circuits); Hamming code; Combinatorics; Computer science; Algorithm; Encryption; Mathematical analysis; Block code","score_opus":0.010158535419387221,"score_gpt":0.2119433588205441,"score_spread":0.2017848234011569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289524100","genre_codex":"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.24482411,0.00061401376,0.669333,0.0013960815,0.00038428724,0.00016162496,0.0003497584,0.0010238868,0.081913255],"genre_scores_gemma":[0.85995716,0.00054352975,0.120320074,0.0004955899,0.0001579451,0.000162317,0.00026560455,0.00027821344,0.01781942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932826,0.00015304502,0.00003421315,0.00008466035,0.00020293184,0.0001970294],"domain_scores_gemma":[0.99945384,0.00015937323,0.000093153634,0.00011971743,0.000078905556,0.00009503089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007895176,0.0012364903,0.0006465572,0.0012298836,0.0009220268,0.002187171,0.00080608664,0.0013352743,0.0064932136],"category_scores_gemma":[0.0018500366,0.0005095838,0.0006861028,0.000978083,0.0019493233,0.0029226227,0.0028315117,0.0018696222,0.001993185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010636223,0.00002663266,0.00013447627,0.000053154417,0.000009170488,0.00010181544,0.0000926904,0.0033432953,0.009452654,0.9735825,0.0010652873,0.012032037],"study_design_scores_gemma":[0.00005932128,0.000119486285,0.00022428135,0.000056208948,0.000029505683,0.00045224835,0.00008710314,0.031442825,0.026503695,0.929535,0.011432192,0.00005822835],"about_ca_topic_score_codex":0.00019069914,"about_ca_topic_score_gemma":0.00027061973,"teacher_disagreement_score":0.0064932136,"about_ca_system_score_codex":0.0009978694,"about_ca_system_score_gemma":0.0006452977,"threshold_uncertainty_score":0.02172196},"labels":[],"label_agreement":null},{"id":"W4289655091","doi":"10.1109/isit50566.2022.9834891","title":"Maximum-Length Low-Density MDS Codes and Near Resolvable Designs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Separable space; Discrete mathematics; Code (set theory); Computer science; Mathematical analysis","score_opus":0.01110291532929121,"score_gpt":0.2274738459194741,"score_spread":0.21637093059018286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655091","genre_codex":"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.47076088,0.00046495144,0.5101157,0.0005424495,0.0000381872,0.000072763316,0.00031489893,0.0002870665,0.01740325],"genre_scores_gemma":[0.8963395,0.00042301224,0.09555821,0.0001774784,0.000067032524,0.00019246864,0.00030081888,0.000060490274,0.0068810694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883276,0.00032655304,0.000050712977,0.00015858427,0.00047925406,0.0001521116],"domain_scores_gemma":[0.9955551,0.002434173,0.00086456176,0.0005662748,0.0003448043,0.00023509038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009027666,0.0005599916,0.00047052914,0.0010766622,0.00074880075,0.0009560156,0.0008024777,0.000877116,0.002190536],"category_scores_gemma":[0.0053664055,0.0004745513,0.0004774516,0.0008356972,0.0018024679,0.0014927463,0.001587064,0.0019866724,0.0004888216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019763852,0.000066712135,0.0010383207,0.000117638134,0.000024378662,0.00015164718,0.00037823932,0.058984138,0.018991897,0.9005157,0.00067815353,0.018855574],"study_design_scores_gemma":[0.000092253234,0.0003470414,0.0010389922,0.000074451185,0.000022012242,0.0005858849,0.00013288127,0.24275082,0.027820677,0.7218481,0.0052156593,0.000071266426],"about_ca_topic_score_codex":0.0004010566,"about_ca_topic_score_gemma":0.00043997524,"teacher_disagreement_score":0.002190536,"about_ca_system_score_codex":0.00095102575,"about_ca_system_score_gemma":0.0007193437,"threshold_uncertainty_score":0.0073280334},"labels":[],"label_agreement":null},{"id":"W4293776836","doi":"10.3390/electronics11172717","title":"Decoding Quadratic Residue Codes Using Deep Neural Networks","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Decoding methods; Algorithm; Binary number; Computational complexity theory; Quadratic equation; Quadratic residue; Computer science; Berlekamp–Welch algorithm; Binary code; Artificial neural network; Reduction (mathematics); Sequential decoding; Mathematics; Block code; Arithmetic; Artificial intelligence","score_opus":0.014002833986491195,"score_gpt":0.23982951663361515,"score_spread":0.22582668264712397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293776836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.035828922,0.0005084016,0.95921034,0.00017937538,0.000093129645,0.00003668078,0.00005381338,0.00065165694,0.0034376017],"genre_scores_gemma":[0.58795977,0.00054703216,0.40315458,0.0002631007,0.00008456209,0.00006249779,0.00020625729,0.00007145311,0.007650733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996075,0.00007845072,0.000027072752,0.00006071048,0.00018232773,0.000043982996],"domain_scores_gemma":[0.99954236,0.00017359196,0.000049733317,0.000066198525,0.00014955275,0.000018649407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004404238,0.0004871278,0.00041597252,0.00041378327,0.0002957436,0.000593765,0.00069552934,0.0006406121,0.0013402323],"category_scores_gemma":[0.0012123984,0.00021388978,0.0002685763,0.000397049,0.0004434452,0.0010199993,0.0006011434,0.0008387883,0.00046860604],"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.00050463056,0.0001485429,0.0010046636,0.00029462855,0.00011355362,0.00028581565,0.00011798907,0.37422404,0.08329131,0.061380304,0.0031822054,0.47545227],"study_design_scores_gemma":[0.0000122423835,0.000064834574,0.000098074364,0.000009476633,0.000012665714,0.00008162612,0.0000072520925,0.977789,0.016120628,0.00445834,0.0013357328,0.000010212188],"about_ca_topic_score_codex":0.0019564582,"about_ca_topic_score_gemma":0.0044584745,"teacher_disagreement_score":0.0019564582,"about_ca_system_score_codex":0.000564158,"about_ca_system_score_gemma":0.0007989111,"threshold_uncertainty_score":0.004483521},"labels":[],"label_agreement":null},{"id":"W4294811685","doi":"10.1109/iwsda50346.2022.9870453","title":"Equivalence Classes and Balance Properties of Interleaved Sequences","year":2022,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Equivalence (formal languages); Sequence (biology); Balance (ability); Base (topology); Mathematics; Equivalence class (music); Computer science; Algorithm; Discrete mathematics; Mathematical analysis; Biology","score_opus":0.02680412976019372,"score_gpt":0.22119616291697963,"score_spread":0.1943920331567859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7026223,0.00043694818,0.26421085,0.0005987389,0.0000838858,0.00013806854,0.00043538833,0.0002990082,0.031174835],"genre_scores_gemma":[0.97526634,0.00024235502,0.019929929,0.000120512246,0.00015916432,0.00016862855,0.00055579457,0.000078724384,0.0034784868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736685,0.00042632967,0.00023117175,0.00059927435,0.0009269942,0.00044944376],"domain_scores_gemma":[0.9903059,0.0052182833,0.0015926122,0.0011318855,0.0010176983,0.00073353597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017517146,0.00036192164,0.00052566774,0.0024059927,0.0016142812,0.0023034073,0.00077294465,0.0009344068,0.007044714],"category_scores_gemma":[0.011729855,0.00034835926,0.00046406235,0.0012463446,0.0026940205,0.0069219605,0.001706391,0.001415066,0.0007182485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041162147,0.00015210835,0.0042043068,0.00008078829,0.000023555844,0.00028869827,0.00076091173,0.0042997277,0.019133544,0.92258745,0.0009195888,0.047137644],"study_design_scores_gemma":[0.00007592421,0.00015130495,0.0020802272,0.000033736596,0.000019332783,0.00041732797,0.00031283378,0.02654138,0.012898133,0.95171845,0.005721807,0.000029536212],"about_ca_topic_score_codex":0.0003708415,"about_ca_topic_score_gemma":0.0001812692,"teacher_disagreement_score":0.007044714,"about_ca_system_score_codex":0.00092858216,"about_ca_system_score_gemma":0.00046490473,"threshold_uncertainty_score":0.023566902},"labels":[],"label_agreement":null},{"id":"W4296192831","doi":"","title":"Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.029201065800860765,"score_gpt":0.24304280871619374,"score_spread":0.21384174291533298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296192831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9567502,0.0002999095,0.032933902,0.0008973318,0.00003298619,0.000076273594,0.0011999905,0.00039162193,0.00741767],"genre_scores_gemma":[0.97255623,0.00037535213,0.02282007,0.00013941429,0.00006984166,0.00018035476,0.0013768675,0.0002914188,0.0021905438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977609,0.00065491215,0.0001778928,0.0005424659,0.0003959614,0.00046787277],"domain_scores_gemma":[0.952144,0.034780562,0.005470378,0.0032294043,0.0015179932,0.002857685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018080876,0.00085448235,0.0011614137,0.0016478609,0.0012606988,0.0027464766,0.002414631,0.0018315075,0.0034409072],"category_scores_gemma":[0.0254049,0.0010327676,0.00078089006,0.0012102091,0.0023393221,0.0045145303,0.0022261527,0.0013766309,0.0005908486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064537143,0.00050496135,0.029180218,0.0013503694,0.0002385364,0.0011407355,0.0037691584,0.2755892,0.05915986,0.5250778,0.013138948,0.08439646],"study_design_scores_gemma":[0.0003247991,0.00059864856,0.00859785,0.00017883768,0.00019355358,0.0018065135,0.001185682,0.38210365,0.0349579,0.565309,0.0045982725,0.00014536268],"about_ca_topic_score_codex":0.0010450786,"about_ca_topic_score_gemma":0.0013135718,"teacher_disagreement_score":0.0034409072,"about_ca_system_score_codex":0.0017333267,"about_ca_system_score_gemma":0.0014573914,"threshold_uncertainty_score":0.012576282},"labels":[],"label_agreement":null},{"id":"W4297234428","doi":"10.48550/arxiv.1111.5604","title":"Shirshov's theorem and division rings that are left algebraic over a\\n subfield","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subring; Mathematics; Division ring; Ring (chemistry); Discrete mathematics; Algebraic number; Combinatorics; Bounded function; Division (mathematics); Pure mathematics; Arithmetic","score_opus":0.06469745723471905,"score_gpt":0.1709160450110573,"score_spread":0.10621858777633826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297234428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.78537107,0.0034710634,0.12364291,0.0045238337,0.00034306713,0.00004709402,0.00048098835,0.0002768657,0.08184317],"genre_scores_gemma":[0.96854645,0.0012126925,0.017185848,0.000519622,0.00035670807,0.000047659403,0.00030811733,0.000047064364,0.011775875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912554,0.00016813763,0.000066983754,0.00021471584,0.00020025652,0.00022440907],"domain_scores_gemma":[0.99654925,0.0020176098,0.0003844623,0.00046655204,0.0002715124,0.00031066177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014969697,0.00026895912,0.0005911886,0.0007804132,0.001901903,0.0019188849,0.00056033354,0.00053389254,0.003389194],"category_scores_gemma":[0.0038151173,0.00028860616,0.0006523936,0.0009978128,0.0042702453,0.005606553,0.0019987216,0.0014914158,0.0006283787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009335261,0.000016284033,0.001045906,0.000052150168,0.0000073828796,0.00012408111,0.00045837715,0.001178938,0.0013634006,0.98213744,0.0014627837,0.012059786],"study_design_scores_gemma":[0.000028238132,0.000039918574,0.0008762035,0.00002101011,0.000011171182,0.00022341855,0.00021918125,0.003774945,0.0019748413,0.9837298,0.00908336,0.000018052011],"about_ca_topic_score_codex":0.0013534778,"about_ca_topic_score_gemma":0.0010231283,"teacher_disagreement_score":0.003389194,"about_ca_system_score_codex":0.0015655062,"about_ca_system_score_gemma":0.0010507206,"threshold_uncertainty_score":0.011358559},"labels":[],"label_agreement":null},{"id":"W4300056268","doi":"10.48550/arxiv.1803.06539","title":"The Graph Structure of Chebyshev Polynomials over Finite Fields and\\n Applications","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chebyshev polynomials; Mathematics; Chebyshev filter; Graph; Chebyshev nodes; Chebyshev equation; Gegenbauer polynomials; Finite field; Discrete mathematics; Orthogonal polynomials; Applied mathematics; Classical orthogonal polynomials; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.02886546373519731,"score_gpt":0.18013911963992482,"score_spread":0.15127365590472752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300056268","genre_codex":"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.6824321,0.00082575815,0.27997792,0.0013871026,0.00008232015,0.000049453527,0.00038205745,0.00021853737,0.034644745],"genre_scores_gemma":[0.97127694,0.0006195439,0.021262499,0.0001119816,0.000116510084,0.00003875029,0.00017074423,0.0000758244,0.006327281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996762,0.00009945392,0.000010942325,0.00006619048,0.00007981818,0.000067364446],"domain_scores_gemma":[0.9979627,0.0012574344,0.00021763003,0.00019672902,0.00023399096,0.00013149508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046475805,0.00031902228,0.0002700146,0.0017824763,0.000809391,0.0011271412,0.00055544946,0.0007358105,0.0035389874],"category_scores_gemma":[0.0027655633,0.00027487444,0.00038083454,0.0011091046,0.0017796287,0.00197072,0.00062508037,0.0010870001,0.00037275584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002571068,0.00001211063,0.00044335573,0.000026472793,0.0000028093884,0.000048792157,0.00009741291,0.007957946,0.0017381145,0.9838521,0.00039545496,0.005399798],"study_design_scores_gemma":[0.0000082131,0.00002838676,0.00073418074,0.000016861639,0.0000047704575,0.00013369584,0.00007502639,0.07348669,0.0018420593,0.92147136,0.0021847247,0.000014036794],"about_ca_topic_score_codex":0.0011401067,"about_ca_topic_score_gemma":0.0009102047,"teacher_disagreement_score":0.0035389874,"about_ca_system_score_codex":0.0010653436,"about_ca_system_score_gemma":0.0005182731,"threshold_uncertainty_score":0.011839092},"labels":[],"label_agreement":null},{"id":"W4303647666","doi":"10.1145/3567428","title":"Design Space Exploration of Galois and Fibonacci Configuration Based on Espresso Stream Cipher","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Stream cipher; Cipher; Cryptography; Parallel computing; Fibonacci number; Field-programmable gate array; Theoretical computer science; Arithmetic; Embedded system; Algorithm; Encryption; Computer network; Mathematics; Discrete mathematics","score_opus":0.029275299881515227,"score_gpt":0.2330761123535786,"score_spread":0.2038008124720634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303647666","genre_codex":"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.6538204,0.0067479997,0.28521106,0.0006994271,0.0001676147,0.00026706,0.00027252204,0.0010743092,0.05173966],"genre_scores_gemma":[0.9598031,0.00076049456,0.037683222,0.00008643727,0.000015112806,0.00005125304,0.00009157866,0.000045661407,0.0014632213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995235,0.00017753262,0.00003149618,0.00006177472,0.00012438996,0.000081373895],"domain_scores_gemma":[0.9996427,0.0001405512,0.000053763168,0.000071189104,0.00006526634,0.000026476373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054087414,0.00064779236,0.00028941158,0.00076993246,0.00022274401,0.000665351,0.0005505673,0.00028025854,0.0024132484],"category_scores_gemma":[0.0008919346,0.00016541018,0.00034195487,0.0004628519,0.00038089644,0.00084001845,0.00035452892,0.00034214207,0.00031950927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016204531,0.00018648988,0.005946945,0.0008027231,0.00024253053,0.001364343,0.00031359724,0.45214912,0.12328373,0.131697,0.0059560174,0.276437],"study_design_scores_gemma":[0.00038316727,0.0033225461,0.0027653503,0.00018741592,0.00023731912,0.002402177,0.00025639133,0.8134277,0.09725719,0.04813019,0.031539194,0.00009134314],"about_ca_topic_score_codex":0.00047365468,"about_ca_topic_score_gemma":0.000706685,"teacher_disagreement_score":0.0024132484,"about_ca_system_score_codex":0.0005738843,"about_ca_system_score_gemma":0.00061497785,"threshold_uncertainty_score":0.0080730915},"labels":[],"label_agreement":null},{"id":"W43061790","doi":"10.1007/978-3-642-30615-0_18","title":"Word-Oriented Transformation Shift Registers and Their Linear Complexity","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shift register; Transformation (genetics); Computer science; Word (group theory); Arithmetic; Time complexity; Word length; Linear map; Algorithm; Mathematics; Natural language processing; Pure mathematics; Telecommunications","score_opus":0.028436077941673105,"score_gpt":0.24101112186937168,"score_spread":0.21257504392769858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43061790","genre_codex":"methods","genre_gemma":"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.28356904,0.0061859884,0.466167,0.0031615975,0.00054873934,0.00018748779,0.0007989152,0.0012974775,0.2380838],"genre_scores_gemma":[0.84200644,0.0030289846,0.07860765,0.00062930974,0.0007002872,0.00030086562,0.0005784555,0.00042612795,0.073721826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992588,0.00012113999,0.000048572885,0.00011610411,0.00033396474,0.00012129281],"domain_scores_gemma":[0.99903476,0.00056616194,0.00010466418,0.00015957921,0.00010146548,0.000033319593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032387712,0.0005656953,0.0004847421,0.0011535814,0.0006833991,0.0024874262,0.00078094326,0.0008075821,0.011805914],"category_scores_gemma":[0.0024129443,0.00044823892,0.0005182207,0.0017274052,0.0017489301,0.0038771916,0.0012548245,0.0019468118,0.002344517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007500316,0.000023823422,0.000088249,0.00005194614,0.0000079355195,0.000044411678,0.00010238585,0.0029820716,0.0019429912,0.9611606,0.0019306196,0.03158987],"study_design_scores_gemma":[0.000018953555,0.000031818636,0.00009596592,0.000016303638,0.000009375382,0.00008432278,0.000024819783,0.011142503,0.00278862,0.979545,0.006223303,0.00001911307],"about_ca_topic_score_codex":0.0004741955,"about_ca_topic_score_gemma":0.0005872029,"teacher_disagreement_score":0.011805914,"about_ca_system_score_codex":0.0010840797,"about_ca_system_score_gemma":0.0007760485,"threshold_uncertainty_score":0.039494753},"labels":[],"label_agreement":null},{"id":"W4307434441","doi":"10.1007/s11128-022-03712-5","title":"A new post-quantum multivariate polynomial public key encapsulation algorithm","year":2022,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"","keywords":"Univariate; Mathematics; Irreducible polynomial; Polynomial; Finite field; Cryptosystem; Discrete mathematics; Public-key cryptography; Multivariate statistics; Matrix polynomial; Algorithm; Cryptography; Computer science; Encryption; Statistics; Mathematical analysis","score_opus":0.014076099941054276,"score_gpt":0.23242338599106852,"score_spread":0.21834728605001424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307434441","genre_codex":"methods","genre_gemma":"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.022529136,0.00018754516,0.9620077,0.0006707935,0.00027346902,0.00018293636,0.00023499731,0.0020672893,0.011846246],"genre_scores_gemma":[0.34908423,0.00024259294,0.6271669,0.00065711,0.00027803102,0.00034064517,0.00092920905,0.0005730153,0.020728229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983498,0.00029873935,0.000113439295,0.00035688025,0.000608607,0.0002725324],"domain_scores_gemma":[0.99854916,0.00026240357,0.00010203452,0.0007362442,0.00024778067,0.000102330276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010615562,0.00063486263,0.00110706,0.0006920086,0.0010493885,0.002427258,0.0019289707,0.0014208611,0.009477178],"category_scores_gemma":[0.0027265146,0.00038829684,0.0009467053,0.0009984509,0.0009586297,0.0037783147,0.004049058,0.0021095534,0.0041676075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012437243,0.00048358005,0.0009194901,0.00026333006,0.00013175503,0.00019953471,0.00022512818,0.027829716,0.040322445,0.51643085,0.019746644,0.39220387],"study_design_scores_gemma":[0.00050049636,0.00032867002,0.00078049896,0.000068743444,0.00014783432,0.00056687824,0.00007868182,0.5391549,0.053482797,0.3597869,0.044962905,0.00014075918],"about_ca_topic_score_codex":0.0003684644,"about_ca_topic_score_gemma":0.00054463174,"teacher_disagreement_score":0.009477178,"about_ca_system_score_codex":0.0009981956,"about_ca_system_score_gemma":0.0023428684,"threshold_uncertainty_score":0.031704307},"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":"W4307815954","doi":"10.1016/j.ffa.2022.102114","title":"Two-weight or three-weight binary linear codes from cyclotomic mappings","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Construct (python library); Linear code; Binary number; Weight distribution; Discrete mathematics; Secret sharing; Block code; Cryptography; Algorithm; Arithmetic; Computer science; Decoding methods","score_opus":0.015861239519083786,"score_gpt":0.2287484881883779,"score_spread":0.21288724866929412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307815954","genre_codex":"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.63256294,0.003007206,0.20504193,0.0030464663,0.0014053286,0.00022903769,0.00087010366,0.00048420945,0.15335281],"genre_scores_gemma":[0.93517566,0.0015644941,0.033137467,0.00075746584,0.00067998585,0.00021714179,0.00039136512,0.00015288545,0.027923418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996039,0.00008172451,0.000027203145,0.00007152135,0.00012068117,0.00009492884],"domain_scores_gemma":[0.99913055,0.00036264386,0.00016461284,0.00014835976,0.000092512724,0.000101290534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048253985,0.0008411406,0.00045080928,0.0019261204,0.00087036454,0.0018868111,0.0006366328,0.0017917141,0.0059994394],"category_scores_gemma":[0.0024453064,0.00029464767,0.0005084734,0.001775242,0.0017830865,0.0023444714,0.0016984402,0.0016001322,0.0011987368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082218176,0.000031756445,0.0002262895,0.00006143579,0.000005307946,0.00014012055,0.00017960498,0.0014587626,0.0037246083,0.97519636,0.0013654319,0.01752807],"study_design_scores_gemma":[0.00002281097,0.00003168769,0.0002838824,0.000049369246,0.0000067004803,0.00036944915,0.00006811417,0.007554507,0.0041142944,0.9826774,0.004788689,0.000033030214],"about_ca_topic_score_codex":0.00027076065,"about_ca_topic_score_gemma":0.0002211805,"teacher_disagreement_score":0.0059994394,"about_ca_system_score_codex":0.00076364004,"about_ca_system_score_gemma":0.00066448277,"threshold_uncertainty_score":0.020070136},"labels":[],"label_agreement":null},{"id":"W4308166550","doi":"10.48550/arxiv.2211.00897","title":"On the equivalence of linear cyclic and constacyclic codes","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equivalence (formal languages); Mathematics; Computer science; Discrete mathematics","score_opus":0.0758015718727185,"score_gpt":0.1971062776511119,"score_spread":0.1213047057783934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308166550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5279249,0.0010999435,0.26694787,0.0025587138,0.00046053377,0.00020071876,0.0012220104,0.00042965217,0.19915561],"genre_scores_gemma":[0.9647142,0.0005579358,0.024304079,0.0003770458,0.0003613197,0.00010598474,0.0011098053,0.000101202546,0.008368263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978218,0.0003507649,0.00019122951,0.00041751284,0.0007095924,0.0005090902],"domain_scores_gemma":[0.99545574,0.0022472441,0.0004450938,0.0006202279,0.00084413873,0.00038752545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014486477,0.00035652664,0.0005284519,0.001546415,0.0015637812,0.0020978684,0.00069976586,0.00086758944,0.006506664],"category_scores_gemma":[0.00781698,0.00027903687,0.00060512504,0.0009350183,0.0033341423,0.004025421,0.0024513295,0.0027729059,0.0010452424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005835605,0.00003631477,0.00042003856,0.000027628557,0.000002857007,0.00014622911,0.00023266257,0.0011658457,0.0018772,0.9885982,0.00060633576,0.006828297],"study_design_scores_gemma":[0.000022537464,0.00006288285,0.0005014778,0.000028786571,0.000005795954,0.00019006713,0.0001529903,0.0066439514,0.00409707,0.9835442,0.00472818,0.000022083219],"about_ca_topic_score_codex":0.0009271309,"about_ca_topic_score_gemma":0.00066656474,"teacher_disagreement_score":0.006506664,"about_ca_system_score_codex":0.0010946821,"about_ca_system_score_gemma":0.001034657,"threshold_uncertainty_score":0.021766901},"labels":[],"label_agreement":null},{"id":"W4311209563","doi":"10.1007/s12095-022-00616-0","title":"Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings $ \\mathbb {F}_{q}[v_{1}, v_{2},\\dots ,v_{t}]$","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Circulant matrix; Dual (grammatical number); Finite field; Physics; Discrete mathematics; Arithmetic; Crystallography; Combinatorics; Mathematics; Chemistry; Art","score_opus":0.02588309565317558,"score_gpt":0.24789743877748394,"score_spread":0.22201434312430834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311209563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8534826,0.0011928411,0.08593194,0.0009190496,0.0002549632,0.000052010433,0.00046637576,0.0003451347,0.057355117],"genre_scores_gemma":[0.9860363,0.00022759137,0.0061606984,0.00017780653,0.00013152673,0.000037950525,0.0001419058,0.000041742474,0.0070444234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939907,0.000114498405,0.000028274957,0.000121873505,0.00017694819,0.00015936329],"domain_scores_gemma":[0.9983701,0.00048129415,0.00034811674,0.0002073393,0.00030645277,0.00028666545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005831698,0.00045776038,0.00047308617,0.0015965695,0.0013188927,0.0016431841,0.00046415327,0.00064373075,0.0022392194],"category_scores_gemma":[0.0020053803,0.0002640203,0.00037774467,0.0007810348,0.0017730447,0.0011706767,0.00094664854,0.00086846703,0.00033088817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015459216,0.000027081423,0.0005121247,0.000036379322,0.000008098103,0.00020926274,0.00013333376,0.0027115692,0.0036613587,0.9867713,0.0010341406,0.0047407267],"study_design_scores_gemma":[0.000093035145,0.00011929157,0.0013377125,0.00007200939,0.00003346538,0.0013962681,0.00014393248,0.051884778,0.010105118,0.92295754,0.011763997,0.00009289869],"about_ca_topic_score_codex":0.0009017195,"about_ca_topic_score_gemma":0.00073798816,"teacher_disagreement_score":0.0022392194,"about_ca_system_score_codex":0.0011325285,"about_ca_system_score_gemma":0.00096139096,"threshold_uncertainty_score":0.008217156},"labels":[],"label_agreement":null},{"id":"W4311555247","doi":"","title":"Stochastic Chase Decoder for Reed-Solomon Codes","year":2012,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Reed–Solomon error correction; Decoding methods; Parallel computing; Algorithm; Concatenated error correction code; Block code","score_opus":0.01547421244656132,"score_gpt":0.23462077809485193,"score_spread":0.2191465656482906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311555247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.05166147,0.0007167855,0.93581915,0.0008872844,0.00014226272,0.000100057856,0.00060930196,0.00073562737,0.009327998],"genre_scores_gemma":[0.8070217,0.0010130855,0.16688794,0.0005161237,0.00029003594,0.00029242813,0.0011411014,0.00019108383,0.02264658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984823,0.00047694554,0.00007470572,0.00015886128,0.000654066,0.00015307408],"domain_scores_gemma":[0.99570614,0.002821822,0.000262062,0.00032960472,0.0007563551,0.00012403725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014632577,0.00057592767,0.00086668844,0.00073520385,0.0006194911,0.0013632124,0.00067644473,0.0013093855,0.0028043576],"category_scores_gemma":[0.0064779315,0.0004476652,0.0004155831,0.00079221104,0.0008275305,0.000820279,0.001504112,0.0012129464,0.0010574043],"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.0007465428,0.0000979182,0.0020866566,0.00032279818,0.0001223779,0.0004047866,0.00025771584,0.46167266,0.03148487,0.40181363,0.0056451117,0.095344916],"study_design_scores_gemma":[0.000053670676,0.00008092229,0.00036991606,0.00004766795,0.00001921338,0.00015449084,0.000020329053,0.9111877,0.0108944895,0.07404043,0.0030873842,0.0000438405],"about_ca_topic_score_codex":0.0026839196,"about_ca_topic_score_gemma":0.005482729,"teacher_disagreement_score":0.0028043576,"about_ca_system_score_codex":0.0011265407,"about_ca_system_score_gemma":0.0035520517,"threshold_uncertainty_score":0.009381533},"labels":[],"label_agreement":null},{"id":"W4312608599","doi":"10.3934/amc.2022083","title":"Improved lower bounds for self-dual codes over $ \\mathbb{F}_{11} $, $ \\mathbb{F}_{13} $, $ \\mathbb{F}_{17} $, $ \\mathbb{F}_{19} $ and $ \\mathbb{F}_{23} $","year":2022,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dual (grammatical number)","score_opus":0.016897714460177005,"score_gpt":0.3018250839024632,"score_spread":0.2849273694422862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312608599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.05533886,0.0062431097,0.71831006,0.0051197107,0.0021846192,0.000570018,0.006066263,0.0057582166,0.20040914],"genre_scores_gemma":[0.539387,0.005803813,0.33859348,0.0044343164,0.0016375637,0.0022288584,0.010847424,0.0073814862,0.08968599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947977,0.00090007007,0.00019857516,0.00074280036,0.002161757,0.0011991009],"domain_scores_gemma":[0.9898393,0.005250007,0.0005841079,0.001759891,0.0018955921,0.0006710914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026976075,0.005572355,0.0019786158,0.003930429,0.0022269366,0.0058662645,0.0029129123,0.0024442365,0.03649375],"category_scores_gemma":[0.02035363,0.0010930555,0.0017519023,0.0035936658,0.0032278786,0.0051011783,0.0064752405,0.006103229,0.018788675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074343465,0.0003781222,0.0013665323,0.0011360387,0.00015139006,0.0004217469,0.00053084234,0.07450704,0.009930066,0.6865279,0.09741367,0.12689328],"study_design_scores_gemma":[0.00010484617,0.00017312013,0.00037924942,0.00055748504,0.0001296563,0.0005245645,0.00020932301,0.27903235,0.009397212,0.6723506,0.036962885,0.00017858339],"about_ca_topic_score_codex":0.0040147677,"about_ca_topic_score_gemma":0.0071041635,"teacher_disagreement_score":0.03649375,"about_ca_system_score_codex":0.003719851,"about_ca_system_score_gemma":0.0046299994,"threshold_uncertainty_score":0.12208372},"labels":[],"label_agreement":null},{"id":"W4312939501","doi":"10.1145/3572867.3572881","title":"Factoring non-monic polynomials represented by black boxes","year":2022,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Factorization; Factoring; Subroutine; Mathematics; Square (algebra); Maple; Black box; Polynomial; Computer science; Combinatorics; Algorithm; Discrete mathematics; Algebra over a field; Pure mathematics; Programming language; Artificial intelligence","score_opus":0.02913105223767142,"score_gpt":0.28632427609355016,"score_spread":0.2571932238558787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312939501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.16346122,0.00017317217,0.8300672,0.00016008141,0.00007461123,0.00007729015,0.00018319291,0.0016016151,0.0042015556],"genre_scores_gemma":[0.57455635,0.000324963,0.4167943,0.00012848791,0.00007594826,0.000101029415,0.00053949066,0.0003601933,0.0071192738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937135,0.00009696237,0.000029851264,0.00013370258,0.00016401577,0.00020407615],"domain_scores_gemma":[0.99914765,0.00032479994,0.00009753397,0.00023418055,0.00011896623,0.00007679382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000976474,0.0007650936,0.00092731026,0.0006640577,0.0005744491,0.00086773257,0.0004908822,0.0004295339,0.0071319016],"category_scores_gemma":[0.0023972497,0.00032013067,0.0008250787,0.000770762,0.0009586937,0.002150633,0.001996216,0.0010324258,0.0020358728],"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.0025062186,0.0003377067,0.0039585633,0.00065943314,0.00013031374,0.0011367403,0.0010210845,0.1206495,0.12596196,0.2847136,0.008091322,0.45083362],"study_design_scores_gemma":[0.0002686372,0.00094155216,0.0014551767,0.00018390849,0.000103256774,0.00059415074,0.0005195663,0.4625061,0.18161616,0.31872758,0.032955956,0.00012797485],"about_ca_topic_score_codex":0.0009237068,"about_ca_topic_score_gemma":0.0013980297,"teacher_disagreement_score":0.0071319016,"about_ca_system_score_codex":0.00039216442,"about_ca_system_score_gemma":0.00078748807,"threshold_uncertainty_score":0.023858607},"labels":[],"label_agreement":null},{"id":"W4313036617","doi":"10.5486/pmd.2004.3190","title":"On the greatest and least prime factors of $n!+1$. II.","year":2004,"lang":"en","type":"article","venue":"Publicationes Mathematicae Debrecen","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.018479221465145395,"score_gpt":0.21125601287628681,"score_spread":0.19277679141114143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313036617","genre_codex":"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.18463916,0.029304367,0.2462189,0.020255284,0.003774286,0.00013250785,0.0008527894,0.0005028193,0.51431996],"genre_scores_gemma":[0.8698347,0.012951453,0.046896946,0.0029774366,0.0033516837,0.00025218102,0.0007370945,0.00036656187,0.062632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990337,0.00022818522,0.00004282332,0.00020238466,0.00020865398,0.00028422006],"domain_scores_gemma":[0.9953603,0.0032262097,0.00043677678,0.00034309496,0.0003398231,0.00029373402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017216917,0.0011379729,0.0008413173,0.0015975541,0.0016092408,0.0030505862,0.00081050314,0.0010417338,0.008741387],"category_scores_gemma":[0.009366746,0.00047997365,0.0008669664,0.0011378592,0.0047626053,0.00695423,0.002956276,0.0040025017,0.0038122148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002737745,0.000033628865,0.0007615233,0.0002055608,0.000019295418,0.00023004775,0.00038046637,0.001743875,0.0023818857,0.9540369,0.011560492,0.028372424],"study_design_scores_gemma":[0.000027470069,0.000051614068,0.0009466605,0.00011589113,0.00002836832,0.00044673556,0.00011745845,0.0036853948,0.0021148187,0.9681646,0.024272863,0.00002812826],"about_ca_topic_score_codex":0.00086047675,"about_ca_topic_score_gemma":0.00060704025,"teacher_disagreement_score":0.008741387,"about_ca_system_score_codex":0.0017498153,"about_ca_system_score_gemma":0.00078028045,"threshold_uncertainty_score":0.029242814},"labels":[],"label_agreement":null},{"id":"W4315607727","doi":"10.1016/j.jat.2023.105866","title":"On maximal autocorrelations of Rudin–Shapiro sequences","year":2023,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Autocorrelation; Aperiodic graph; Mathematical proof; Sequence (biology); Algebraic number; Spectral radius; Translation (biology); Connection (principal bundle); Order (exchange); Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Statistics","score_opus":0.02071554068216593,"score_gpt":0.258096093016961,"score_spread":0.23738055233479508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315607727","genre_codex":"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.77131945,0.0010665042,0.18533507,0.00096601574,0.0001707914,0.0000448967,0.00027937145,0.00026436299,0.04055363],"genre_scores_gemma":[0.98720723,0.00035925218,0.008377966,0.000098013465,0.00016039792,0.000024980101,0.00013461734,0.00004945598,0.0035880245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908805,0.00033253484,0.00005204151,0.00012030837,0.00024375354,0.00016323876],"domain_scores_gemma":[0.9888432,0.0077667455,0.0012002699,0.0005227727,0.000758786,0.00090824364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015680351,0.00060655415,0.00074953685,0.0017820166,0.0009158018,0.001559474,0.001158286,0.0008039055,0.003718439],"category_scores_gemma":[0.014441621,0.0005202132,0.00044639496,0.0011929389,0.0021963082,0.0020873523,0.001705928,0.0014187504,0.0004469084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002375265,0.00003277186,0.0014286898,0.000060038354,0.000014789984,0.00023956805,0.00034331268,0.009322178,0.004750718,0.97431445,0.00090086786,0.008355035],"study_design_scores_gemma":[0.000052377894,0.000078017605,0.0018020199,0.00006395167,0.000019324896,0.00028793723,0.00020404396,0.099738285,0.0030026105,0.8924536,0.0022471943,0.000050762763],"about_ca_topic_score_codex":0.0014011574,"about_ca_topic_score_gemma":0.0014282287,"teacher_disagreement_score":0.003718439,"about_ca_system_score_codex":0.0013067911,"about_ca_system_score_gemma":0.0009057446,"threshold_uncertainty_score":0.01243943},"labels":[],"label_agreement":null},{"id":"W4319302639","doi":"10.1109/tit.2023.3242612","title":"Improved Error Bounds for the Distance Distribution of Reed-Solomon Codes","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Reed–Solomon error correction; Mathematics; Finite field; Reed–Muller code; Factorial; Linear code; Simple (philosophy); Distribution (mathematics); Discrete mathematics; Error detection and correction; Function (biology); Combinatorics; Decoding methods; Block code; Algorithm; Mathematical analysis","score_opus":0.013738735108576653,"score_gpt":0.245341328404443,"score_spread":0.23160259329586635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319302639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.082694024,0.0040736934,0.89327615,0.0015106752,0.0003626324,0.000103425555,0.00068149186,0.0010399084,0.016257979],"genre_scores_gemma":[0.8237045,0.0030344944,0.15828373,0.00076336815,0.0011344652,0.00037898132,0.00093772844,0.0010475158,0.010715278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943369,0.0013283007,0.00025066923,0.00072811777,0.0025187978,0.0008371674],"domain_scores_gemma":[0.9715507,0.01905315,0.0016044341,0.0032236357,0.0037706888,0.00079741055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073783947,0.0024605878,0.0018552787,0.0066152955,0.0010746768,0.0031159443,0.0037645875,0.0018846627,0.005127814],"category_scores_gemma":[0.040447112,0.0008498265,0.0015179841,0.002570598,0.0033274463,0.007659211,0.005101495,0.0056241844,0.0018208442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005315749,0.00015815828,0.0029686242,0.00034299592,0.00007258602,0.00030582145,0.00058308383,0.13001852,0.023031468,0.78943485,0.0041477303,0.048404593],"study_design_scores_gemma":[0.000033756794,0.00009849393,0.0011336231,0.0001427042,0.000036195004,0.0002831583,0.000060686485,0.6397826,0.01391551,0.34075361,0.0036400384,0.00011954443],"about_ca_topic_score_codex":0.0013142031,"about_ca_topic_score_gemma":0.0010684865,"teacher_disagreement_score":0.0073783947,"about_ca_system_score_codex":0.0048349937,"about_ca_system_score_gemma":0.0012958619,"threshold_uncertainty_score":0.039021194},"labels":[],"label_agreement":null},{"id":"W4321015079","doi":"10.1007/s12095-022-00623-1","title":"Comparing balanced sequences obtained from ElGamal function to random balanced sequences","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"ElGamal encryption; Mathematics; Combinatorics; Discrete mathematics; Randomness; Modulo; Function (biology); Random function; Golomb coding; Prime (order theory); Sequence (biology); Random variable; Computer science; Public-key cryptography","score_opus":0.039306736832341094,"score_gpt":0.2698127270029333,"score_spread":0.2305059901705922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321015079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.61004025,0.00089145586,0.3669385,0.00031263987,0.00022535706,0.00012912357,0.0005549329,0.00085507025,0.0200527],"genre_scores_gemma":[0.92796624,0.00033349174,0.0658737,0.000103984275,0.000043646964,0.00007653971,0.0012561404,0.00021883109,0.004127355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990246,0.00031611585,0.000055482302,0.00013897648,0.00031988756,0.00014485845],"domain_scores_gemma":[0.99732745,0.00157332,0.00019149622,0.000375253,0.00044773598,0.00008472412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011574317,0.00047702988,0.00040226735,0.0019694224,0.0005328684,0.0009082634,0.0004959882,0.00071197667,0.005694019],"category_scores_gemma":[0.008346179,0.00018599773,0.0003469513,0.0013235499,0.00076849794,0.0018973408,0.00088740623,0.00045447925,0.0007965948],"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.0038695757,0.00024533173,0.00683736,0.00073037494,0.00013984494,0.0007070279,0.0011231689,0.17744039,0.07048131,0.4594364,0.0053942576,0.27359495],"study_design_scores_gemma":[0.00021144022,0.0010191384,0.005937069,0.00015879044,0.00010045061,0.0014482095,0.0007109988,0.6220003,0.073168315,0.27698117,0.018152822,0.000111357745],"about_ca_topic_score_codex":0.0006126643,"about_ca_topic_score_gemma":0.00048174706,"teacher_disagreement_score":0.005694019,"about_ca_system_score_codex":0.0007063225,"about_ca_system_score_gemma":0.0007555795,"threshold_uncertainty_score":0.019048452},"labels":[],"label_agreement":null},{"id":"W4323359295","doi":"10.2478/tmmp-2023-0001","title":"Irreducibility and Multiplicative Composition of Polynomials Over Finite Fields","year":2023,"lang":"en","type":"article","venue":"Tatra Mountains Mathematical Publications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Multiplicative function; Irreducibility; Prime (order theory); Modulo; Pure mathematics; Composition (language); Multiplicative group; Finite field; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.03050358314027969,"score_gpt":0.29826170415397063,"score_spread":0.26775812101369095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323359295","genre_codex":"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.88462234,0.0007278168,0.07524349,0.0005653092,0.00016080518,0.00006049947,0.00009432788,0.00039200607,0.038133483],"genre_scores_gemma":[0.98400253,0.0003388237,0.008930461,0.00005653571,0.000132641,0.000017203327,0.000097946715,0.00004609868,0.006377774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998706,0.00021199477,0.000066424174,0.00023652976,0.0004937561,0.00028535532],"domain_scores_gemma":[0.99879825,0.00041710594,0.00017835939,0.00023616501,0.00017493863,0.00019523354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011806154,0.0005214737,0.0006748076,0.0010068403,0.0012324719,0.0022084636,0.0006477177,0.0003254343,0.0040793256],"category_scores_gemma":[0.0028022218,0.00037658136,0.0010149451,0.00067877694,0.0028711162,0.0032444876,0.0026281432,0.002079281,0.00051173597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029826318,0.00010440976,0.0013252544,0.00012324308,0.000040308172,0.0008052384,0.0014923844,0.003713374,0.011604781,0.96223956,0.00060461083,0.017648594],"study_design_scores_gemma":[0.00008156399,0.00030297355,0.0012892829,0.000062374784,0.00009216453,0.0011439256,0.00053158606,0.013412285,0.03001316,0.94015056,0.012872355,0.00004785155],"about_ca_topic_score_codex":0.00037825908,"about_ca_topic_score_gemma":0.0002800307,"teacher_disagreement_score":0.0040793256,"about_ca_system_score_codex":0.0007429807,"about_ca_system_score_gemma":0.00058755476,"threshold_uncertainty_score":0.013646662},"labels":[],"label_agreement":null},{"id":"W4324056828","doi":"10.1016/j.ffa.2023.102180","title":"On the functional graph of f(X)=c(Xq+1 + aX2) over quadratic extensions of finite fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Quadratic equation; Graph; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.024333156700218014,"score_gpt":0.22919570255133512,"score_spread":0.2048625458511171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324056828","genre_codex":"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.8879822,0.00035008078,0.037454255,0.0023109387,0.0002752804,0.000049752212,0.00053238694,0.00025708484,0.0707879],"genre_scores_gemma":[0.970666,0.000257493,0.004724061,0.00036985616,0.00020219418,0.00003405668,0.00050234474,0.00015830345,0.023085786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996946,0.00007376432,0.0000073106044,0.000054338965,0.00007582635,0.00009421994],"domain_scores_gemma":[0.99891424,0.0004647194,0.00017099993,0.00005884983,0.00013823797,0.00025292768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044849492,0.0004906221,0.00057332666,0.0016696554,0.0016619888,0.0012003473,0.00082560873,0.00095713657,0.009428199],"category_scores_gemma":[0.0012864408,0.0002559652,0.0004292938,0.0009953044,0.002068041,0.0021583543,0.000773735,0.0012123269,0.0006896914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013718856,0.000041017694,0.0004693938,0.00005239658,0.000008179656,0.00027477893,0.00021151073,0.0039728465,0.0028714752,0.984186,0.0022960051,0.0054791304],"study_design_scores_gemma":[0.000042108808,0.00004030485,0.0016317286,0.000030586114,0.000008996427,0.00024062113,0.00017987673,0.018964859,0.0013152228,0.9743201,0.0031934292,0.0000320262],"about_ca_topic_score_codex":0.0039013342,"about_ca_topic_score_gemma":0.004318617,"teacher_disagreement_score":0.009428199,"about_ca_system_score_codex":0.0011863619,"about_ca_system_score_gemma":0.00073217606,"threshold_uncertainty_score":0.031540453},"labels":[],"label_agreement":null},{"id":"W4328003225","doi":"10.1142/s1005386723000147","title":"A Class of Quadratic Matrix Equations over Finite Fields","year":2022,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Cardinality (data modeling); Pure mathematics; Class (philosophy); Quadratic equation; Action (physics); Ideal (ethics); Matrix (chemical analysis); Finite field; Finite set; Set (abstract data type); Mathematical analysis; Discrete mathematics; Geometry","score_opus":0.011808009341182379,"score_gpt":0.2459260883841396,"score_spread":0.23411807904295723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328003225","genre_codex":"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.9393983,0.00026510374,0.04686436,0.0009430173,0.00008889378,0.000062241,0.0004022508,0.00013127056,0.011844517],"genre_scores_gemma":[0.9872322,0.00013550694,0.0079690395,0.00006322456,0.0001582073,0.000042355485,0.00038579624,0.000022227903,0.0039915103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926525,0.00011123055,0.000048673635,0.00016121207,0.00024144481,0.00017207758],"domain_scores_gemma":[0.9980433,0.00092903676,0.0004375062,0.00012832163,0.00016528192,0.00029664676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007891204,0.0006886084,0.0007911039,0.001670997,0.0013953077,0.0025881615,0.0006921867,0.0010659802,0.0036460632],"category_scores_gemma":[0.0037050485,0.00030019306,0.0007195295,0.00090260484,0.0019177959,0.0036610777,0.0012916494,0.0015258248,0.00027849842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013901325,0.00010244615,0.004263673,0.00015163506,0.000039667353,0.0007065195,0.0005613216,0.0054422677,0.010620149,0.96631604,0.0015910036,0.010066329],"study_design_scores_gemma":[0.00010574132,0.00009525149,0.00283276,0.00004906546,0.00003068626,0.0013672503,0.00031328204,0.08198296,0.006840553,0.9029678,0.0033569608,0.00005764967],"about_ca_topic_score_codex":0.00048979966,"about_ca_topic_score_gemma":0.00039319738,"teacher_disagreement_score":0.0036460632,"about_ca_system_score_codex":0.0011432944,"about_ca_system_score_gemma":0.00053076295,"threshold_uncertainty_score":0.012197316},"labels":[],"label_agreement":null},{"id":"W4361269916","doi":"10.1002/jcd.21882","title":"Ordered covering arrays and upper bounds on covering codes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Ciência sem Fronteiras; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministério da Ciência, Tecnologia e Inovação; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Concatenation (mathematics); Cartesian product; Hamming code; Hamming distance; Discrete mathematics; Connection (principal bundle); Product (mathematics); Block code; Algorithm; Decoding methods; Geometry","score_opus":0.02489971877531201,"score_gpt":0.2561583306077486,"score_spread":0.23125861183243662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361269916","genre_codex":"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.10920525,0.0036721379,0.7964945,0.0009232643,0.0003112103,0.0001134209,0.0007870509,0.0012099129,0.08728328],"genre_scores_gemma":[0.8041042,0.0026800607,0.17987862,0.00046071628,0.00035891606,0.00030378625,0.0009599387,0.00041875467,0.010835046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955955,0.0009727105,0.00028419515,0.0005256147,0.0018380114,0.00078385405],"domain_scores_gemma":[0.98497033,0.009328312,0.0008854385,0.0024719336,0.0018744386,0.00046952354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017977861,0.00096260867,0.00081027264,0.00238786,0.001179729,0.0033058831,0.0011392497,0.00084102794,0.008693211],"category_scores_gemma":[0.012626304,0.0004580458,0.00092109956,0.0031520233,0.0022580395,0.00541599,0.003195267,0.00278342,0.0022775452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013010939,0.000070551556,0.0010624948,0.0002872636,0.00003230948,0.00018677452,0.00036882402,0.04712965,0.009849048,0.8527041,0.004329149,0.08384975],"study_design_scores_gemma":[0.000018249968,0.00015654892,0.00081116386,0.00016100143,0.0000422,0.0006973344,0.0002078417,0.1225935,0.032335985,0.815992,0.026898384,0.00008578705],"about_ca_topic_score_codex":0.0005591252,"about_ca_topic_score_gemma":0.00058421626,"teacher_disagreement_score":0.008693211,"about_ca_system_score_codex":0.0016380987,"about_ca_system_score_gemma":0.0007990421,"threshold_uncertainty_score":0.029081702},"labels":[],"label_agreement":null},{"id":"W4361760461","doi":"10.1007/978-3-031-29689-5_5","title":"Software Implementation of a Code-Based Key Encapsulation Mechanism from Binary QD Generalized Srivastava Codes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key encapsulation; Computer science; Cryptography; NIST; Theoretical computer science; Encryption; Public-key cryptography; Post-quantum cryptography; McEliece cryptosystem; Algorithm; Computer engineering; Symmetric-key algorithm; Computer security","score_opus":0.023902914797538918,"score_gpt":0.2659791799049679,"score_spread":0.24207626510742897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361760461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.0387966,0.00022497681,0.94165826,0.00016046979,0.000185621,0.00019094243,0.00011084243,0.010737415,0.007935014],"genre_scores_gemma":[0.6428786,0.00020589461,0.3433112,0.00023514216,0.00007511647,0.00032489703,0.0004202806,0.0013945265,0.011154424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911743,0.00012441972,0.00008090836,0.000101017846,0.00041318408,0.00016311376],"domain_scores_gemma":[0.9985837,0.00031295547,0.00009903061,0.0006449618,0.00029872588,0.000060763043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008680162,0.00052564393,0.0006725489,0.0007927219,0.0005863475,0.0017406712,0.0017262733,0.0009382725,0.00485333],"category_scores_gemma":[0.002403603,0.00047151741,0.0006528258,0.0006960084,0.00075663434,0.0017136649,0.0021847186,0.0012066955,0.002225509],"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.0011940015,0.00034832078,0.0015523251,0.00070339016,0.00019115677,0.00073652045,0.000792364,0.026511936,0.2184334,0.40352398,0.016104193,0.3299085],"study_design_scores_gemma":[0.0003351214,0.0005719268,0.0010712803,0.00015322445,0.00016257088,0.0011493172,0.000120761804,0.44801483,0.3842318,0.09996926,0.064026564,0.00019340213],"about_ca_topic_score_codex":0.000488446,"about_ca_topic_score_gemma":0.00050874753,"teacher_disagreement_score":0.00485333,"about_ca_system_score_codex":0.0006379915,"about_ca_system_score_gemma":0.00090216985,"threshold_uncertainty_score":0.016236007},"labels":[],"label_agreement":null},{"id":"W4361988195","doi":"10.1007/978-3-031-30122-3_5","title":"A New Class of Trapdoor Verifiable Delay Functions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Computer science; Class (philosophy); Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.018783626299062644,"score_gpt":0.2298494070743131,"score_spread":0.21106578077525046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361988195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.060417276,0.0041996315,0.8547137,0.0014329759,0.0008141112,0.00015767523,0.0006060199,0.0020856457,0.075572975],"genre_scores_gemma":[0.76384056,0.0054371753,0.14853658,0.0012243962,0.0010969745,0.0003808966,0.0006266792,0.0007150897,0.07814156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.00010861697,0.0000503593,0.00025127476,0.00037493106,0.00020528701],"domain_scores_gemma":[0.99827516,0.00079827383,0.00017727843,0.00045994672,0.0001787619,0.00011061611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237848,0.0009822077,0.0008205797,0.0014391484,0.00093542505,0.0037391982,0.0013995729,0.0013109554,0.005791627],"category_scores_gemma":[0.0029673453,0.0005370992,0.0009347528,0.0014432163,0.002004904,0.005619895,0.0021455605,0.0047850083,0.0018950106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015331797,0.000045725803,0.00016767759,0.00011668256,0.000018291603,0.000095197836,0.00013283544,0.004083131,0.0074538486,0.922545,0.0039722803,0.061215892],"study_design_scores_gemma":[0.00008277719,0.00016211516,0.0001656451,0.00007890795,0.00005861989,0.00079030363,0.00004666308,0.04584658,0.017717369,0.8669138,0.068067946,0.00006932875],"about_ca_topic_score_codex":0.00021945545,"about_ca_topic_score_gemma":0.00018943759,"teacher_disagreement_score":0.005791627,"about_ca_system_score_codex":0.0014587715,"about_ca_system_score_gemma":0.00097028574,"threshold_uncertainty_score":0.019374967},"labels":[],"label_agreement":null},{"id":"W4365506037","doi":"10.1016/j.ffa.2023.102198","title":"Zigzag polynomials, Artin's conjecture and trinomials","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Defence Academy","keywords":"Mathematics; Trinomial; Divisibility rule; Finite field; Combinatorics; Fibonacci number; Lucas sequence; Sequence (biology); Recursion (computer science); Order (exchange); Binomial coefficient; Discrete mathematics; Prime (order theory); Galois group; Pure mathematics; Fibonacci polynomials; Difference polynomials; Orthogonal polynomials","score_opus":0.012760571223991579,"score_gpt":0.22200973988702838,"score_spread":0.2092491686630368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365506037","genre_codex":"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.573775,0.022436924,0.11233459,0.026477458,0.0023032508,0.00006147739,0.00061276444,0.00046573335,0.2615327],"genre_scores_gemma":[0.9610245,0.0048931167,0.0089139035,0.0009796644,0.0013261497,0.000050310893,0.00028382923,0.000053177322,0.022475317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992355,0.00023180354,0.00003605992,0.00013907795,0.00018701743,0.00017052736],"domain_scores_gemma":[0.9972088,0.001805659,0.0003187457,0.0003087619,0.00016682466,0.00019126247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017652494,0.0008138368,0.001203697,0.0030798025,0.002859113,0.0035369329,0.0010895245,0.00246429,0.0067422143],"category_scores_gemma":[0.0059515773,0.0005500792,0.0007599019,0.0040545478,0.008443155,0.007072359,0.0023951316,0.004639678,0.00094384176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039817518,0.000017038292,0.00020781609,0.000036732476,0.0000030689625,0.00003746125,0.00015137669,0.0008858016,0.00014734794,0.9931467,0.0013848686,0.003941934],"study_design_scores_gemma":[0.000008347079,0.000004222758,0.000072942996,0.000012943284,0.0000022841111,0.000027866907,0.00004649069,0.0009460167,0.000052157357,0.99727136,0.0015489857,0.00000638073],"about_ca_topic_score_codex":0.0030751417,"about_ca_topic_score_gemma":0.0028184955,"teacher_disagreement_score":0.0067422143,"about_ca_system_score_codex":0.0021675734,"about_ca_system_score_gemma":0.0010920896,"threshold_uncertainty_score":0.022554934},"labels":[],"label_agreement":null},{"id":"W4365506139","doi":"10.1016/j.ffa.2023.102207","title":"Generalized Lucas polynomials over finite fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Finite field; Permutation (music); Prime (order theory); Lucas sequence; Combinatorics; Field (mathematics); Difference polynomials; Discrete mathematics; Pure mathematics; Algebra over a field; Orthogonal polynomials; Fibonacci polynomials","score_opus":0.02085775382021079,"score_gpt":0.25358558741738507,"score_spread":0.23272783359717428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365506139","genre_codex":"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.6651867,0.012097411,0.18444835,0.0056340415,0.0009907509,0.00009319926,0.0004894965,0.0006255042,0.13043462],"genre_scores_gemma":[0.9551555,0.0034611353,0.014902435,0.00025651732,0.000802253,0.000049777023,0.00013842164,0.0000687339,0.025165219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959034,0.00012304871,0.000015781701,0.000066577086,0.00011215706,0.00009216792],"domain_scores_gemma":[0.99858946,0.00071682694,0.00028992494,0.00011784112,0.00014502766,0.00014084703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066829554,0.00090022234,0.0009535544,0.0030730315,0.0012700883,0.0026772015,0.00078909675,0.0011320037,0.0060587362],"category_scores_gemma":[0.0033627637,0.00055741286,0.0005102956,0.0034478093,0.003878343,0.004209895,0.0014966839,0.00253141,0.0008402454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032844106,0.000009480252,0.00011281578,0.00003088453,0.0000031263776,0.000057218727,0.0001255652,0.0016117266,0.0004718349,0.99222916,0.00055335305,0.0047619366],"study_design_scores_gemma":[0.00001677405,0.00001821096,0.00017725996,0.000027866927,0.0000067589594,0.00010436986,0.000077870005,0.00608719,0.0004020374,0.9890442,0.0040187314,0.000018809817],"about_ca_topic_score_codex":0.0013253202,"about_ca_topic_score_gemma":0.0015306175,"teacher_disagreement_score":0.0060587362,"about_ca_system_score_codex":0.0024531947,"about_ca_system_score_gemma":0.00091617095,"threshold_uncertainty_score":0.02026844},"labels":[],"label_agreement":null},{"id":"W4366206987","doi":"10.48550/arxiv.2304.07126","title":"Decoding twisted permutation codes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Permutation group; Cyclic permutation; Decoding methods; Class (philosophy); Bit-reversal permutation; Permutation matrix; Combinatorics; Partial permutation; Degree (music); Permutation graph; Mathematics; Discrete mathematics; Computer science; Symmetric group; Algorithm; Physics; Artificial intelligence","score_opus":0.12790636386705248,"score_gpt":0.20356607019112094,"score_spread":0.07565970632406846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366206987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.14623262,0.00023326503,0.8314808,0.00043053363,0.00020517221,0.00006164919,0.00023096486,0.0005139326,0.020611065],"genre_scores_gemma":[0.7971571,0.00039218512,0.18955861,0.00026741615,0.0001552286,0.00010776496,0.0005716047,0.00028623155,0.0115038445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895704,0.00024278321,0.000059084326,0.00014792291,0.000353667,0.00023954542],"domain_scores_gemma":[0.99809223,0.0008113831,0.00014092975,0.0005473604,0.000328485,0.00007958523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005771173,0.0005260963,0.0005388935,0.0005816103,0.0007604329,0.0012821076,0.0007150614,0.0011139202,0.0028722044],"category_scores_gemma":[0.0052117063,0.0001931896,0.00046619945,0.0009793801,0.0011798572,0.002150585,0.0019225678,0.0012557481,0.0011311587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027032834,0.00003752391,0.0015981462,0.000095221076,0.000027080763,0.00058406516,0.00048824024,0.07588429,0.02951067,0.75272655,0.003081703,0.13569623],"study_design_scores_gemma":[0.000027467728,0.00007802644,0.00022028874,0.00003749953,0.000016186066,0.0004773126,0.00012900235,0.28906706,0.041485135,0.6578575,0.010569652,0.00003497618],"about_ca_topic_score_codex":0.0006008358,"about_ca_topic_score_gemma":0.00059441733,"teacher_disagreement_score":0.0028722044,"about_ca_system_score_codex":0.00065319706,"about_ca_system_score_gemma":0.00075907825,"threshold_uncertainty_score":0.009608448},"labels":[],"label_agreement":null},{"id":"W4366368346","doi":"10.1007/s11128-023-03919-0","title":"Cryptanalysis of three quantum money schemes","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum computer; Quantum algorithm; Qubit; Cryptanalysis; Polynomial; Quantum state; Hash function; Discrete mathematics; Computer science; Time complexity; Mathematics; Quantum; Cryptography; Algorithm; Quantum mechanics; Physics","score_opus":0.022040859558914275,"score_gpt":0.2530147459980161,"score_spread":0.23097388643910183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366368346","genre_codex":"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.794137,0.00043360572,0.11857061,0.009517631,0.0004909963,0.0002651734,0.00033813622,0.0005315745,0.07571531],"genre_scores_gemma":[0.9849118,0.00006245011,0.009063953,0.00015451008,0.000033154607,0.000030193485,0.00004175034,0.000029120873,0.0056731883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979382,0.0005814543,0.00008173022,0.00014601507,0.000782163,0.00047035902],"domain_scores_gemma":[0.99740183,0.0012529752,0.00024914372,0.00065554236,0.00021060975,0.00023001038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022323562,0.00054972933,0.00071777386,0.0012065087,0.0020085282,0.002677603,0.0012768296,0.0028641652,0.008352926],"category_scores_gemma":[0.006702305,0.00029201192,0.0007783296,0.001249935,0.005152838,0.0028140657,0.002655593,0.002204322,0.0008441769],"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.00057263416,0.00008055433,0.0006682406,0.00004538079,0.000022527789,0.0002211351,0.0003640096,0.007860924,0.003839525,0.9746705,0.0013400818,0.010314555],"study_design_scores_gemma":[0.00029853368,0.00021746207,0.0010677947,0.000072672825,0.00005019231,0.00051058363,0.00028547758,0.11478287,0.025575375,0.8488444,0.008191428,0.000103205806],"about_ca_topic_score_codex":0.0006514995,"about_ca_topic_score_gemma":0.00034206102,"teacher_disagreement_score":0.008352926,"about_ca_system_score_codex":0.0021108526,"about_ca_system_score_gemma":0.0020594853,"threshold_uncertainty_score":0.027943373},"labels":[],"label_agreement":null},{"id":"W4366980112","doi":"10.1016/j.jcta.2023.105763","title":"Nonexistence results of generalized bent functions from <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math> to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.svg\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math>","year":2023,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Ministry of Education - Singapore; Pacific Institute for the Mathematical Sciences","keywords":"Bent molecular geometry; Function (biology); Scalable Vector Graphics; Mathematics; Combinatorics; Computer science; Algorithm; World Wide Web; Engineering","score_opus":0.021819176248565966,"score_gpt":0.24281523015548215,"score_spread":0.22099605390691618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366980112","genre_codex":"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.38550502,0.0075580166,0.33099988,0.011392066,0.0009548353,0.00013999717,0.0010865814,0.0005561888,0.26180738],"genre_scores_gemma":[0.88804716,0.0052288505,0.04252316,0.0015265507,0.00118615,0.0002468769,0.0011158104,0.00035526653,0.059770197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837035,0.00048116807,0.00010057745,0.00038780924,0.000401377,0.00025882223],"domain_scores_gemma":[0.98870134,0.007715486,0.0008155012,0.0010777188,0.0010239325,0.00066590053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014096,0.0016088624,0.0013328678,0.002119139,0.0023053084,0.0035003086,0.0018725956,0.0013821147,0.01178762],"category_scores_gemma":[0.012179816,0.000961011,0.0023564703,0.0018013691,0.0028283359,0.0077027003,0.0033218046,0.006372145,0.0027832706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024545073,0.000074408126,0.0009106234,0.00037979803,0.00010490816,0.00037741498,0.00042807852,0.0074431906,0.0035926695,0.9517173,0.0086882645,0.026037738],"study_design_scores_gemma":[0.000047483358,0.00012366679,0.00066647347,0.00009380192,0.0001065992,0.0005876363,0.0001904164,0.028359612,0.0023286138,0.9559521,0.011498784,0.000044682267],"about_ca_topic_score_codex":0.0010997856,"about_ca_topic_score_gemma":0.0010642684,"teacher_disagreement_score":0.01178762,"about_ca_system_score_codex":0.002507887,"about_ca_system_score_gemma":0.0012223596,"threshold_uncertainty_score":0.03943354},"labels":[],"label_agreement":null},{"id":"W4367677358","doi":"10.1017/s0004972723000382","title":"TANGENT-FILLING PLANE CURVES OVER FINITE FIELDS","year":2023,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Tangent; Plane curve; Plane (geometry); Geometry; Tangent space; Mathematical analysis; Cover (algebra); Finite field; Pure mathematics; Combinatorics","score_opus":0.030438583829769834,"score_gpt":0.25765536855496873,"score_spread":0.2272167847251989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367677358","genre_codex":"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.9717136,0.0002663456,0.013772427,0.0003005112,0.000019995723,0.00001705894,0.00009469144,0.00006795852,0.013747383],"genre_scores_gemma":[0.9931687,0.00026212836,0.0023784623,0.00002309264,0.000024861412,0.000008511136,0.00009811514,0.000020950627,0.0040150736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999678,0.000060205406,0.000014346808,0.00003867751,0.00010702366,0.00010177511],"domain_scores_gemma":[0.9992513,0.00019628451,0.00019616811,0.00007108534,0.00010798217,0.00017718019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051912694,0.0005394449,0.0004699335,0.0018804973,0.0012302598,0.0025696491,0.00052361324,0.0008530725,0.0033355055],"category_scores_gemma":[0.0022819345,0.0002729784,0.00039460664,0.001998114,0.0023686003,0.00356756,0.0012098218,0.0011350607,0.00031900159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001429106,0.00004266443,0.002025914,0.000038648228,0.000013871601,0.00044500706,0.00069579325,0.012701099,0.003931226,0.973609,0.00056464155,0.0057893395],"study_design_scores_gemma":[0.00008853303,0.00015042032,0.002544354,0.000069161644,0.000026338268,0.00084591797,0.0011271416,0.07157718,0.0054699164,0.9118133,0.006244783,0.00004283583],"about_ca_topic_score_codex":0.0032038277,"about_ca_topic_score_gemma":0.0011512378,"teacher_disagreement_score":0.0033355055,"about_ca_system_score_codex":0.0014790805,"about_ca_system_score_gemma":0.00048249547,"threshold_uncertainty_score":0.011158407},"labels":[],"label_agreement":null},{"id":"W4367677360","doi":"10.1515/forum-2022-0324","title":"On the number of rational points of certain algebraic varieties over finite fields","year":2023,"lang":"en","type":"article","venue":"Forum Mathematicum","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Exponent; Mathematics; Algebraic number; Algebra over a field; Mathematical analysis; Pure mathematics","score_opus":0.0166389987825122,"score_gpt":0.2532689212513245,"score_spread":0.2366299224688123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367677360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9324715,0.0011700195,0.018056292,0.0017970179,0.00014807946,0.000043532542,0.00051186583,0.00015319086,0.045648407],"genre_scores_gemma":[0.9906123,0.00039046528,0.003096878,0.000040683648,0.00017679033,0.000031361047,0.00030961132,0.000025167968,0.0053167124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998725,0.00028582104,0.000079962854,0.0002705717,0.00039578913,0.00024280089],"domain_scores_gemma":[0.9941691,0.003257124,0.0009344667,0.00029043612,0.0005826623,0.0007662696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018961339,0.0008610734,0.0009710935,0.005143048,0.0024056574,0.005343162,0.0013438917,0.0011278002,0.01040912],"category_scores_gemma":[0.00709265,0.00048779923,0.00066647393,0.002229587,0.0051732645,0.0050157732,0.0019819264,0.0020676563,0.00095406425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007802389,0.00010257196,0.010683138,0.00021170807,0.000075063435,0.00049477705,0.0006819691,0.007059302,0.0038740966,0.95630217,0.0021884271,0.017546568],"study_design_scores_gemma":[0.00015326952,0.00018623688,0.010409713,0.00016435173,0.00007810463,0.0007120904,0.0009254149,0.02548897,0.0061997636,0.94851375,0.007082459,0.00008582911],"about_ca_topic_score_codex":0.0013029049,"about_ca_topic_score_gemma":0.0009672776,"teacher_disagreement_score":0.01040912,"about_ca_system_score_codex":0.0031368302,"about_ca_system_score_gemma":0.0005731808,"threshold_uncertainty_score":0.034821987},"labels":[],"label_agreement":null},{"id":"W4376111567","doi":"10.1016/j.disc.2023.113489","title":"On the equivalence of linear cyclic and constacyclic codes","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Discrete mathematics; Equivalence (formal languages); Finite field; Combinatorics; Equivalence relation; Equivalence class (music); Permutation (music); Linear code; Block code; Algorithm","score_opus":0.03003914856210125,"score_gpt":0.2742312853251732,"score_spread":0.24419213676307197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376111567","genre_codex":"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.4107838,0.0045250827,0.09783347,0.009191528,0.0011836336,0.00009831232,0.00071181625,0.00023468892,0.4754378],"genre_scores_gemma":[0.9631882,0.0019845455,0.008324686,0.0015155033,0.0011418844,0.000080435086,0.00057206245,0.00012378045,0.023068905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979796,0.00056741404,0.00009349826,0.00034964416,0.00059413014,0.00041575535],"domain_scores_gemma":[0.9920664,0.005389364,0.0005149027,0.0008147617,0.00085494824,0.00035962346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736087,0.0005040935,0.000772727,0.0018850035,0.0021128966,0.0040977257,0.0011875649,0.0018620269,0.009686327],"category_scores_gemma":[0.0102767665,0.00042909494,0.00071726274,0.002118143,0.005551344,0.008161018,0.003862918,0.004554753,0.000977838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051889336,0.000017426142,0.00011891176,0.0000121657795,0.0000021661049,0.00004068675,0.0001739668,0.00047418688,0.00019206866,0.99412715,0.00071865064,0.0040707616],"study_design_scores_gemma":[0.000013612619,0.000014489135,0.00014678975,0.000012288376,0.0000030492624,0.000038838774,0.000055188662,0.0015005568,0.00019302456,0.99598014,0.0020354248,0.0000065005283],"about_ca_topic_score_codex":0.0016250204,"about_ca_topic_score_gemma":0.0010468868,"teacher_disagreement_score":0.009686327,"about_ca_system_score_codex":0.0017794092,"about_ca_system_score_gemma":0.0010844108,"threshold_uncertainty_score":0.032403946},"labels":[],"label_agreement":null},{"id":"W4376622261","doi":"10.1007/978-3-031-31108-6_18","title":"Benchmark Performance of the Multivariate Polynomial Public Key Encapsulation Mechanism","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"","keywords":"NTRU; Key encapsulation; Computer science; Benchmarking; Cryptosystem; Public-key cryptography; Post-quantum cryptography; Cryptography; Theoretical computer science; Encapsulation (networking); NIST; McEliece cryptosystem; Univariate; Key (lock); Multivariate statistics; Computer engineering; Algorithm; Computer network; Computer security; Encryption; Key exchange; Machine learning","score_opus":0.01907435105049574,"score_gpt":0.22042164869522385,"score_spread":0.2013472976447281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622261","genre_codex":"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.92836577,0.003582139,0.026533967,0.0011637636,0.00044131608,0.0002186405,0.003380037,0.006906973,0.029407348],"genre_scores_gemma":[0.9882598,0.0003120756,0.0059124427,0.00007305339,0.000047395148,0.000048584563,0.0013889835,0.00017977243,0.0037780171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955124,0.000959096,0.00026447428,0.0005784555,0.0015566655,0.0011288428],"domain_scores_gemma":[0.9873054,0.0059251594,0.00093485584,0.0037863397,0.0016927599,0.00035547582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035876844,0.000938015,0.00097524724,0.0012718878,0.00090459205,0.0018630233,0.0019899446,0.0014179609,0.009860042],"category_scores_gemma":[0.01255985,0.00026775073,0.00043929173,0.0019093206,0.0010005569,0.0033651264,0.0015876823,0.00089970307,0.0015909759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.03595099,0.0029179296,0.011885668,0.0024250564,0.0007589327,0.0007184862,0.0003816419,0.36823177,0.09311963,0.081800394,0.07660689,0.32520264],"study_design_scores_gemma":[0.0014738239,0.0052548912,0.007826622,0.00019614334,0.00035615827,0.0007842712,0.00035012848,0.7827093,0.15622567,0.027306316,0.017324243,0.00019240077],"about_ca_topic_score_codex":0.0020285135,"about_ca_topic_score_gemma":0.0012252668,"teacher_disagreement_score":0.009860042,"about_ca_system_score_codex":0.0019265017,"about_ca_system_score_gemma":0.0015106098,"threshold_uncertainty_score":0.03298509},"labels":[],"label_agreement":null},{"id":"W4377020029","doi":"10.1016/j.jsc.2023.102231","title":"An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Mathematics; Inversion (geology); Tree (set theory); Set (abstract data type); Algorithm; Combinatorics; Computer science","score_opus":0.030516113599601567,"score_gpt":0.28566463479884335,"score_spread":0.2551485211992418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377020029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.014258943,0.00008065035,0.97968525,0.0001637378,0.00006873023,0.00011510751,0.00011990492,0.00075232994,0.004755327],"genre_scores_gemma":[0.10228714,0.00014850244,0.8920398,0.00022209184,0.00006532229,0.00025880765,0.0005635934,0.00027814164,0.0041366634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881727,0.00031462658,0.00010114046,0.00021107825,0.00042332665,0.00013262294],"domain_scores_gemma":[0.99683124,0.0017076138,0.00015031674,0.0007200981,0.0005081293,0.000082609615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009963737,0.00084459654,0.00087989337,0.0022076892,0.0013093563,0.0017771333,0.002235846,0.0012036987,0.0058421902],"category_scores_gemma":[0.006194898,0.0005922875,0.0012534257,0.0023108337,0.0013360427,0.002749027,0.0022503617,0.0018965265,0.0017942376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018131881,0.0002178742,0.0013614846,0.0003302708,0.000052593354,0.00024640386,0.0004780184,0.038012885,0.019407807,0.5903292,0.006734958,0.34264717],"study_design_scores_gemma":[0.000046468696,0.00013956339,0.00023607911,0.00007898578,0.00006144617,0.000382668,0.00012317754,0.3006212,0.011554945,0.67793256,0.008773172,0.000049707698],"about_ca_topic_score_codex":0.00095198763,"about_ca_topic_score_gemma":0.002353028,"teacher_disagreement_score":0.0058421902,"about_ca_system_score_codex":0.00079443847,"about_ca_system_score_gemma":0.0017464735,"threshold_uncertainty_score":0.019544065},"labels":[],"label_agreement":null},{"id":"W4377094810","doi":"10.1007/s00200-023-00608-4","title":"MWS and FWS codes for coordinate-wise weight functions","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Hamming code; Upper and lower bounds; Code (set theory); Hamming weight; Hamming distance; Linear code; Discrete mathematics; Weight function; Set (abstract data type); Block code; Algorithm; Statistics; Computer science; Decoding methods; Mathematical analysis","score_opus":0.009493921149859972,"score_gpt":0.22316264146726725,"score_spread":0.21366872031740727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377094810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.14822349,0.0012470648,0.7692149,0.0030683775,0.0009806711,0.00013949591,0.0010026661,0.0008510076,0.07527232],"genre_scores_gemma":[0.81751055,0.0011159559,0.12131151,0.0011234676,0.0009499103,0.00039237522,0.0008003839,0.00045476816,0.056341093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858874,0.00035868693,0.00008949924,0.00022200255,0.0004522274,0.00028880683],"domain_scores_gemma":[0.997644,0.0007410032,0.0002492948,0.0007644223,0.00042809354,0.00017315078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013210047,0.0007502346,0.00073202536,0.0017799736,0.0011380694,0.0023103764,0.0011219997,0.0013413465,0.0074814237],"category_scores_gemma":[0.006374766,0.00032370145,0.0008510922,0.0020218955,0.0025174948,0.003306361,0.0023580638,0.0022641132,0.0022692506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042440453,0.000010071929,0.00010672205,0.000019824303,0.0000048987795,0.000028716016,0.000046654546,0.0018879242,0.0010838232,0.98466176,0.0015512471,0.010555891],"study_design_scores_gemma":[0.0000096698395,0.000015175682,0.00010342637,0.000019563777,0.000006206333,0.00010125003,0.000023721708,0.018938132,0.0017930933,0.9754596,0.003510348,0.000019710713],"about_ca_topic_score_codex":0.0007398983,"about_ca_topic_score_gemma":0.00061937503,"teacher_disagreement_score":0.0074814237,"about_ca_system_score_codex":0.0010499461,"about_ca_system_score_gemma":0.0016928287,"threshold_uncertainty_score":0.025027871},"labels":[],"label_agreement":null},{"id":"W4379470540","doi":"10.1515/jmc-2022-0002","title":"A code-based hybrid signcryption scheme","year":2023,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Signcryption; Code (set theory); Scheme (mathematics); Computer science; Programming language; Theoretical computer science; Mathematics; Computer network; Encryption; Public-key cryptography","score_opus":0.263201233724632,"score_gpt":0.5300503687771727,"score_spread":0.2668491350525407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379470540","genre_codex":"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.08235664,0.00032985312,0.8930638,0.00087340514,0.00016331763,0.00046100552,0.00055609155,0.0013118268,0.020884035],"genre_scores_gemma":[0.73141456,0.0003159395,0.24102892,0.00047353838,0.000076965895,0.00042011187,0.00074537954,0.000100866106,0.025423627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985399,0.00028890782,0.00009629127,0.00031801872,0.00053285144,0.0002240862],"domain_scores_gemma":[0.9986167,0.00022775022,0.00016670606,0.0005641115,0.00030434958,0.00012033363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008522682,0.0004928732,0.0005550237,0.0006601146,0.00073724944,0.0013554016,0.0011995725,0.0013836655,0.0034629758],"category_scores_gemma":[0.0017294711,0.00022985182,0.000754341,0.00097341154,0.0012333497,0.0022861918,0.0024598963,0.0017040424,0.0013510217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005130977,0.00018422888,0.0011917653,0.00023698945,0.00008835125,0.0005048187,0.000575322,0.028621413,0.07214939,0.7843906,0.005775369,0.10576869],"study_design_scores_gemma":[0.0003771952,0.0007086513,0.0016518394,0.00011619741,0.00018168172,0.0021517405,0.00015039013,0.46103927,0.15400882,0.26446715,0.11484656,0.0003003944],"about_ca_topic_score_codex":0.0009294231,"about_ca_topic_score_gemma":0.0006164111,"teacher_disagreement_score":0.0034629758,"about_ca_system_score_codex":0.00089929596,"about_ca_system_score_gemma":0.0015868896,"threshold_uncertainty_score":0.011584818},"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":"W4385296592","doi":"10.1007/s00200-023-00614-6","title":"Linear label code of a root lattice using Gröbner bases","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lambda; Lattice (music); Mathematics; Quotient; Binomial coefficient; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.025112864864790273,"score_gpt":0.26670254320078446,"score_spread":0.24158967833599418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385296592","genre_codex":"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.25148255,0.00046407932,0.66752684,0.0022456427,0.00081465585,0.00021539477,0.0008940373,0.0018720223,0.07448488],"genre_scores_gemma":[0.8467425,0.0003129738,0.120813996,0.00065628503,0.00030384146,0.00024224167,0.0006176479,0.000574418,0.029736085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.00017890324,0.00003457438,0.00014021441,0.0003274028,0.00018300246],"domain_scores_gemma":[0.99891675,0.000344809,0.00010616712,0.00020725626,0.00028493415,0.00014001504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048406908,0.0004992799,0.0007342492,0.0009900758,0.0013988934,0.0020643903,0.00094315584,0.0011173248,0.00688893],"category_scores_gemma":[0.001741481,0.00027185716,0.0006269637,0.0010215358,0.0016048866,0.0016428095,0.0014814847,0.0019315447,0.0017664043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013361985,0.00007330713,0.00025535122,0.00006419501,0.0000126062805,0.00016422187,0.00015387208,0.0069695828,0.008413879,0.96435446,0.0034211196,0.015983792],"study_design_scores_gemma":[0.00007692335,0.00009355836,0.0002595339,0.000047367557,0.000026763795,0.000250194,0.000101576305,0.11086576,0.014349386,0.8653107,0.008521106,0.000097071315],"about_ca_topic_score_codex":0.0014370051,"about_ca_topic_score_gemma":0.0012514944,"teacher_disagreement_score":0.00688893,"about_ca_system_score_codex":0.0009873873,"about_ca_system_score_gemma":0.0015205808,"threshold_uncertainty_score":0.023045778},"labels":[],"label_agreement":null},{"id":"W4385457409","doi":"10.3934/amc.2023026","title":"Constacyclic and quasi-twisted codes over $ \\mathbb{Z}_{q}[u]/\\langle u^{2}-1\\rangle $ and new $ \\mathbb{Z}_4 $-linear codes","year":2023,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Ring (chemistry); Code (set theory); Combinatorics; Characterization (materials science); Algebraic number; Linear code; Discrete mathematics; Algorithm; Physics; Block code; Mathematical analysis; Computer science; Decoding methods","score_opus":0.04000628969610894,"score_gpt":0.33110270373278744,"score_spread":0.2910964140366785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385457409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8774175,0.00066438783,0.09132607,0.0003925653,0.000113189126,0.00003745329,0.00021621662,0.00012308061,0.029709509],"genre_scores_gemma":[0.9738999,0.0003537106,0.016004235,0.000086904576,0.00009813677,0.000029953553,0.00017228173,0.000058467846,0.009296375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964285,0.000051350813,0.000021198459,0.00009046656,0.000099428784,0.00009467062],"domain_scores_gemma":[0.9991709,0.00023300064,0.00021225595,0.00013286769,0.00013016527,0.00012081449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028121218,0.00029886316,0.00025309605,0.0008793825,0.00066019513,0.0010869405,0.00032318404,0.00033933882,0.0038271025],"category_scores_gemma":[0.0010631746,0.0001914322,0.00039041362,0.00058549613,0.0017488851,0.0019948834,0.00086229964,0.0010297392,0.00044870592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016760567,0.000026891814,0.0011672343,0.00006811794,0.0000064731876,0.00041303522,0.0006401887,0.0033453894,0.01373499,0.9641359,0.0004912573,0.015802827],"study_design_scores_gemma":[0.000049607104,0.00033703342,0.003641766,0.000074485564,0.000038456903,0.0019568163,0.0006681308,0.03585473,0.043161847,0.8936888,0.020429883,0.000098395976],"about_ca_topic_score_codex":0.0004547249,"about_ca_topic_score_gemma":0.0005181822,"teacher_disagreement_score":0.0038271025,"about_ca_system_score_codex":0.00062750734,"about_ca_system_score_gemma":0.00038042088,"threshold_uncertainty_score":0.012802899},"labels":[],"label_agreement":null},{"id":"W4385640144","doi":"10.1145/3614408.3614416","title":"FFCSA - Finite Field Constructions, Search, and Algorithms","year":2023,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Parameterized complexity; Finite field; Computer science; Field (mathematics); Algorithm; Implementation; Space (punctuation); Cryptography; Search algorithm; Theoretical computer science; Mathematics; Programming language; Discrete mathematics","score_opus":0.04537242768353807,"score_gpt":0.3067459312607776,"score_spread":0.26137350357723954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385640144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.0073454026,0.00076719304,0.96925956,0.00044389835,0.00014465107,0.000098124605,0.00037382534,0.0052818297,0.016285557],"genre_scores_gemma":[0.27740335,0.0015411167,0.6972113,0.00086240325,0.00035846428,0.00088278047,0.002080376,0.0033672967,0.016292894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958359,0.0013001289,0.00027663552,0.0004964238,0.001636077,0.00045482442],"domain_scores_gemma":[0.99567324,0.0023142367,0.0001888216,0.0012538069,0.0004636998,0.00010615778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003823639,0.0012309226,0.0010911744,0.0018690208,0.0013039124,0.003056782,0.001975195,0.0015915912,0.013575418],"category_scores_gemma":[0.008688922,0.0009261673,0.0022518977,0.0017712624,0.003572963,0.006723753,0.0038839877,0.0031164996,0.0061659464],"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.00022274445,0.0000536852,0.000570415,0.00034251774,0.000032964403,0.00009217936,0.0002594632,0.019455275,0.003323174,0.84870315,0.012197186,0.11474719],"study_design_scores_gemma":[0.00007439163,0.00016192567,0.00019283911,0.00018976508,0.00005294495,0.00035494796,0.000082452476,0.07542273,0.01200366,0.81033415,0.10105149,0.00007882277],"about_ca_topic_score_codex":0.0008142022,"about_ca_topic_score_gemma":0.0006308913,"teacher_disagreement_score":0.013575418,"about_ca_system_score_codex":0.001826581,"about_ca_system_score_gemma":0.0023408604,"threshold_uncertainty_score":0.04541427},"labels":[],"label_agreement":null},{"id":"W4385688796","doi":"10.1109/bsc57238.2023.10201835","title":"A Novel Framework for Relating Quasi-Cyclic Codes and Quasi-Twisted Codes","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Code (set theory); Computer science; Algorithm; Combinatorics; Discrete mathematics; Artificial intelligence; Mathematics; Programming language","score_opus":0.039559182160411356,"score_gpt":0.29236572642767655,"score_spread":0.2528065442672652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385688796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.119198486,0.0021583526,0.8157188,0.00194664,0.00090857525,0.0001413525,0.00030663417,0.00027307172,0.059348136],"genre_scores_gemma":[0.827112,0.0029313304,0.14126395,0.0013138846,0.002485945,0.0002359501,0.00046911123,0.0002702703,0.023917565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875486,0.00038912025,0.000055950204,0.00027209852,0.00032285793,0.00020505763],"domain_scores_gemma":[0.99764425,0.0008270701,0.0004243003,0.000442111,0.00045720165,0.00020504714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011802489,0.0008709084,0.00049956836,0.002784029,0.001544813,0.001993666,0.0012364674,0.0012604977,0.00623086],"category_scores_gemma":[0.0043542357,0.00029904302,0.00075672125,0.0018246701,0.0042940737,0.005628082,0.0023634892,0.0024521283,0.0012320088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010276988,0.000008418976,0.00015225234,0.000025231977,0.0000029274977,0.000060512433,0.0001322732,0.0011004985,0.0006044084,0.9936935,0.00043211703,0.0037776136],"study_design_scores_gemma":[0.0000056402946,0.000037684156,0.00017128952,0.000024606328,0.0000055455844,0.00021211445,0.000119175405,0.012645717,0.000688492,0.9803067,0.0057623805,0.000020752503],"about_ca_topic_score_codex":0.0011118753,"about_ca_topic_score_gemma":0.00070327404,"teacher_disagreement_score":0.00623086,"about_ca_system_score_codex":0.0012336328,"about_ca_system_score_gemma":0.0007608381,"threshold_uncertainty_score":0.02084428},"labels":[],"label_agreement":null},{"id":"W4385820017","doi":"10.1109/tit.2023.3304712","title":"Constructions and Bounds for Codes With Restricted Overlaps","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code word; Prefix; Parity-check matrix; Code (set theory); Mathematics; Discrete mathematics; Combinatorics; Linear code; Block code; Suffix; Binary code; Prefix code; Binary number; Computer science; Algorithm; Arithmetic; Decoding methods; Set (abstract data type)","score_opus":0.008990036429457308,"score_gpt":0.21692075491641294,"score_spread":0.20793071848695563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385820017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.19860499,0.005360805,0.7267873,0.0018414205,0.00020102826,0.00015418694,0.0006537237,0.00088453374,0.06551204],"genre_scores_gemma":[0.836192,0.004032346,0.14696218,0.0006696591,0.00042194268,0.0006658452,0.00073650497,0.00045587262,0.0098636355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99456525,0.0009659132,0.00027583606,0.000758381,0.0020970728,0.0013374347],"domain_scores_gemma":[0.9731767,0.018300554,0.0016643087,0.003755771,0.002140466,0.0009622483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029007187,0.001616609,0.0015864295,0.0024761693,0.002510113,0.003692767,0.0023531287,0.0014778614,0.004724554],"category_scores_gemma":[0.02142588,0.00089792395,0.0011200715,0.003698118,0.0041893017,0.00710227,0.007628849,0.0054263184,0.0012252307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024088119,0.00007562702,0.0012425632,0.0003128814,0.000037140086,0.00029385535,0.00075337244,0.030674623,0.008018508,0.9273922,0.002443568,0.028514883],"study_design_scores_gemma":[0.000048118833,0.00016121243,0.0006912401,0.00026480533,0.00007875823,0.0008405046,0.00034008958,0.118420765,0.016843865,0.846561,0.015650703,0.00009884781],"about_ca_topic_score_codex":0.0011137414,"about_ca_topic_score_gemma":0.001038636,"teacher_disagreement_score":0.004724554,"about_ca_system_score_codex":0.0029639108,"about_ca_system_score_gemma":0.0019160158,"threshold_uncertainty_score":0.02150482},"labels":[],"label_agreement":null},{"id":"W4385891514","doi":"10.1007/s12095-023-00656-0","title":"The welch-gong stream cipher - evolutionary path","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Computer science; Cipher; Transposition cipher; Block cipher mode of operation; Cryptography; Stream cipher attack; Path (computing); Encryption; Theoretical computer science; Permutation (music); Running key cipher; Algorithm; Computer security; Programming language","score_opus":0.02073569150712341,"score_gpt":0.25392970922735264,"score_spread":0.23319401772022924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385891514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.11011311,0.031423017,0.6813593,0.006597904,0.0016261302,0.00038484513,0.00084770366,0.0008413602,0.16680667],"genre_scores_gemma":[0.8084218,0.019959576,0.124698214,0.0022189117,0.0006361937,0.00031938616,0.0009172493,0.00020661614,0.04262204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995104,0.00014365287,0.000031893785,0.000078823374,0.00015821373,0.00007700875],"domain_scores_gemma":[0.999516,0.00020692383,0.000051076713,0.00010181132,0.00009601814,0.000028063714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000541656,0.000337362,0.00037530405,0.0008585357,0.0004495228,0.0010086284,0.0003845708,0.00076489605,0.003961107],"category_scores_gemma":[0.0021328188,0.00016019701,0.00034401932,0.0010476131,0.0010714842,0.001873916,0.00090770447,0.0010685286,0.0013452171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012663005,0.000029345307,0.00080956635,0.00022873303,0.00002284493,0.0003039598,0.000115412055,0.0234228,0.005061752,0.8146044,0.008602943,0.14667167],"study_design_scores_gemma":[0.00006407006,0.00018507594,0.00090867124,0.00023586644,0.000026183572,0.0018142092,0.00007824504,0.11673169,0.010703584,0.71102566,0.15818106,0.000045712848],"about_ca_topic_score_codex":0.00034663032,"about_ca_topic_score_gemma":0.00030145413,"teacher_disagreement_score":0.003961107,"about_ca_system_score_codex":0.00067075377,"about_ca_system_score_gemma":0.0008931567,"threshold_uncertainty_score":0.013251245},"labels":[],"label_agreement":null},{"id":"W4386072004","doi":"10.1109/isit54713.2023.10206961","title":"A Novel Construction Technique for Some Classes of Quasi-Cyclic Codes","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Generator (circuit theory); Combinatorics; Ideal (ethics); Matrix (chemical analysis); Discrete mathematics; Algorithm; Computer science; Mathematics; Physics","score_opus":0.02702305673443879,"score_gpt":0.27339360220181896,"score_spread":0.2463705454673802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386072004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.28813362,0.0011048141,0.68260264,0.000725444,0.00029795067,0.000148445,0.00020485312,0.0003722207,0.026410019],"genre_scores_gemma":[0.7874674,0.0007936643,0.20161922,0.00028039585,0.0003021842,0.00015846016,0.0003118497,0.000103996244,0.008962832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996934,0.00005418743,0.000017098788,0.00007374566,0.00011267638,0.00004900172],"domain_scores_gemma":[0.99961686,0.00009592715,0.000063049,0.00008729186,0.000081700004,0.00005505208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024467913,0.0002478373,0.00026521992,0.0009880761,0.0007964077,0.00055695325,0.0004174029,0.00038011512,0.0018073063],"category_scores_gemma":[0.00097219326,0.00019655787,0.00047665602,0.0005408595,0.0008195419,0.00097644934,0.00076536264,0.00096932246,0.00036481657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056876626,0.000042987223,0.0014090863,0.0001062341,0.000014723727,0.00028441788,0.0004562438,0.0042703166,0.029666817,0.9146267,0.0011631993,0.047902364],"study_design_scores_gemma":[0.00008585186,0.00031540997,0.0021658263,0.00006333574,0.000056584064,0.00313806,0.0002496156,0.11739759,0.051838644,0.7820959,0.04246611,0.00012707894],"about_ca_topic_score_codex":0.00042401793,"about_ca_topic_score_gemma":0.0005170097,"teacher_disagreement_score":0.0018073063,"about_ca_system_score_codex":0.0004771522,"about_ca_system_score_gemma":0.00065709295,"threshold_uncertainty_score":0.0060460567},"labels":[],"label_agreement":null},{"id":"W4386075135","doi":"10.1109/isit54713.2023.10206458","title":"Constructing Quadratic and Cubic Negabent Functions over Finite Fields","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Monomial; TRACE (psycholinguistics); Hadamard transform; Finite field; Function (biology); Quadratic equation; Mathematics; Combinatorics; Discrete mathematics; Walsh function; Boolean function; Algorithm; Mathematical analysis","score_opus":0.0160214151502778,"score_gpt":0.23341290011721585,"score_spread":0.21739148496693805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386075135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.33576608,0.0005000823,0.6288619,0.0005573354,0.0001900308,0.00006312298,0.00011681271,0.0006834011,0.03326123],"genre_scores_gemma":[0.8108971,0.0004900176,0.17052618,0.00023650794,0.00012205646,0.00006914755,0.00026542685,0.0002371761,0.01715633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995472,0.000093481845,0.000026509111,0.000056395664,0.0001657368,0.00011072843],"domain_scores_gemma":[0.9994609,0.00015723887,0.000058082485,0.0001233475,0.000118491764,0.00008197273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055400736,0.00050524174,0.0003661748,0.0007944097,0.0008390769,0.00081649335,0.00043847985,0.0005030989,0.0019343679],"category_scores_gemma":[0.001511715,0.00030211904,0.0006820523,0.0007377652,0.0012664329,0.0014836229,0.001360825,0.0010091509,0.00077355443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030392213,0.00009134645,0.0015313561,0.0001635475,0.000022922317,0.0005802926,0.00057786435,0.017236171,0.0365992,0.82835716,0.0023332462,0.11220287],"study_design_scores_gemma":[0.00008237865,0.00038479912,0.0023052616,0.000069591624,0.00004976231,0.0021036207,0.000303093,0.1958547,0.086460546,0.6823676,0.02987579,0.00014283006],"about_ca_topic_score_codex":0.00073181436,"about_ca_topic_score_gemma":0.0008676672,"teacher_disagreement_score":0.0019343679,"about_ca_system_score_codex":0.0006617274,"about_ca_system_score_gemma":0.00078711036,"threshold_uncertainty_score":0.006471157},"labels":[],"label_agreement":null},{"id":"W4386812617","doi":"10.1016/j.phycom.2023.102194","title":"Neural layered min-sum decoders for cyclic codes","year":2023,"lang":"en","type":"article","venue":"Physical Communication","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National University's Basic Research Foundation of China; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"BCH code; Computer science; Decoding methods; Berlekamp–Welch algorithm; Algorithm; Artificial neural network; Quadratic equation; Binary number; Binary code; Block code; Linear code; Arithmetic; Mathematics; Artificial intelligence","score_opus":0.040927238321110476,"score_gpt":0.3116940082888786,"score_spread":0.27076676996776816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386812617","genre_codex":"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.048351675,0.0009813918,0.94034046,0.000561107,0.00017756961,0.00004116945,0.00023449473,0.0006638928,0.00864819],"genre_scores_gemma":[0.7020077,0.0010077611,0.27852392,0.00050950353,0.00021082,0.00014464029,0.00042524433,0.0001888076,0.01698162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943036,0.00016858317,0.000038142967,0.00007130402,0.00019769893,0.00009390031],"domain_scores_gemma":[0.9985226,0.00081484235,0.00010445042,0.00018063444,0.00029477404,0.000082843275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010447328,0.0006135663,0.00084655726,0.0005474472,0.00048612236,0.0012734061,0.0014268755,0.0012133961,0.0036547484],"category_scores_gemma":[0.0043029822,0.0004913407,0.0004931185,0.0008020171,0.00092002604,0.0014459209,0.0021564355,0.0015115084,0.0010569959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052092987,0.00010386415,0.0009955058,0.00028326816,0.00017907376,0.00015606389,0.00021369768,0.52999884,0.021238966,0.19959104,0.006360364,0.24035846],"study_design_scores_gemma":[0.000013653361,0.0000476237,0.000104148174,0.00002401751,0.000024038043,0.00006486831,0.000012997538,0.9503533,0.0054343673,0.042705778,0.00119206,0.00002311039],"about_ca_topic_score_codex":0.0021708359,"about_ca_topic_score_gemma":0.0055413605,"teacher_disagreement_score":0.0036547484,"about_ca_system_score_codex":0.00095581333,"about_ca_system_score_gemma":0.0014250673,"threshold_uncertainty_score":0.012226343},"labels":[],"label_agreement":null},{"id":"W4386825137","doi":"10.1007/s44007-023-00062-1","title":"New Estimates and Existence Results About Irreducible Polynomials and Self-Reciprocal Irreducible Polynomials with Prescribed Coefficients Over a Finite Field","year":2023,"lang":"en","type":"article","venue":"La Matematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Carleton University","keywords":"Monic polynomial; Mathematics; Reciprocal; Irreducible polynomial; Degree (music); Polynomial; Field (mathematics); Finite field; Combinatorics; Pure mathematics; Mathematical analysis; Matrix polynomial; Physics","score_opus":0.012849181796090533,"score_gpt":0.2545236785330037,"score_spread":0.24167449673691319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386825137","genre_codex":"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.16672619,0.014196258,0.6591387,0.009658317,0.0020823511,0.00015575338,0.0009972347,0.0010221676,0.14602306],"genre_scores_gemma":[0.8220905,0.01197246,0.11552908,0.0017452176,0.004750884,0.00031935907,0.001020639,0.00085632567,0.041715562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707365,0.00078039465,0.00019220084,0.0005715752,0.00094611605,0.00043608065],"domain_scores_gemma":[0.9810534,0.01271659,0.0012381626,0.0011768704,0.0021155998,0.0016992977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006475783,0.0037500903,0.0019839457,0.010557351,0.0024171164,0.0041961186,0.0033454357,0.002334987,0.009365477],"category_scores_gemma":[0.025059002,0.0015381896,0.0027135876,0.0049974094,0.006851074,0.02099895,0.009470335,0.0117764445,0.0017232742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017930567,0.00013578711,0.0011605868,0.00045152905,0.000049116123,0.00025984136,0.00067684485,0.0030109158,0.003782895,0.96796554,0.0039961278,0.01833145],"study_design_scores_gemma":[0.000028629423,0.00010740094,0.0013898576,0.00016836415,0.00014460774,0.0006265918,0.0003247855,0.02820279,0.0043247035,0.95459926,0.009988764,0.00009426952],"about_ca_topic_score_codex":0.0005632723,"about_ca_topic_score_gemma":0.0007347472,"teacher_disagreement_score":0.010557351,"about_ca_system_score_codex":0.0028021818,"about_ca_system_score_gemma":0.0010222285,"threshold_uncertainty_score":0.034247577},"labels":[],"label_agreement":null},{"id":"W4386863539","doi":"10.1007/s12095-023-00674-y","title":"Some classes of permutation binomials and trinomials of index $$q-1$$ over $${\\mathbb {F}_{q^n}}$$","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Trinomial; Combinatorics; Permutation (music); Prime (order theory); Mathematics; Prime power; Degree (music); Discrete mathematics; Polynomial; Physics","score_opus":0.02931724793707374,"score_gpt":0.2847397981237077,"score_spread":0.25542255018663396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386863539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.41063377,0.002517396,0.26625788,0.0067975977,0.0013776246,0.0002117208,0.0016837425,0.0008984316,0.30962187],"genre_scores_gemma":[0.8999964,0.0015521899,0.032718256,0.0014885656,0.0011776258,0.0004246858,0.0009816824,0.00048358805,0.061177026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795073,0.0005745827,0.000102979975,0.00031690433,0.00053906837,0.000515711],"domain_scores_gemma":[0.99478793,0.003217348,0.0005847333,0.00041003327,0.00041748097,0.0005825459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002459103,0.0009298371,0.0010473082,0.0030183524,0.0029003501,0.0046308236,0.0015195603,0.0014753873,0.016186424],"category_scores_gemma":[0.009114847,0.00083453144,0.0012174636,0.0029619164,0.003867739,0.0057110605,0.0021863002,0.0038781164,0.0017650343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003991783,0.0000197832,0.00020533006,0.000019883124,0.00000518216,0.00006907037,0.00010767347,0.0002600367,0.00029874803,0.99309134,0.0023018934,0.0035812552],"study_design_scores_gemma":[0.000030479265,0.00001729483,0.00035465698,0.000024315163,0.000009482101,0.00030510165,0.00005524827,0.006198747,0.0003906165,0.98758113,0.005008441,0.000024416848],"about_ca_topic_score_codex":0.00096481224,"about_ca_topic_score_gemma":0.0010424779,"teacher_disagreement_score":0.016186424,"about_ca_system_score_codex":0.0024263125,"about_ca_system_score_gemma":0.0014051441,"threshold_uncertainty_score":0.054148972},"labels":[],"label_agreement":null},{"id":"W4386875350","doi":"10.48550/arxiv.2309.09124","title":"Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples","year":2023,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science","keywords":"Mathematics; Multiplicative function; Diophantine equation; Combinatorics; Conjecture; Product (mathematics); Square number; Finite field; Upper and lower bounds; Diophantine approximation; Multiplicative group; Discrete mathematics; Mathematical analysis","score_opus":0.05128684009991128,"score_gpt":0.2942028820027344,"score_spread":0.24291604190282315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386875350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6153582,0.0065537333,0.32677007,0.0034433207,0.00043946508,0.0000931547,0.00036715038,0.00037641276,0.046598546],"genre_scores_gemma":[0.91989124,0.0025253163,0.06868974,0.00045435558,0.0008355595,0.00008327676,0.00026684342,0.00009374413,0.0071598776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990404,0.00018050645,0.000067157904,0.0003068346,0.0002687023,0.00013640516],"domain_scores_gemma":[0.99700373,0.001669673,0.00036289316,0.00047935967,0.00022008075,0.00026425888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010323677,0.00068223494,0.0007961297,0.0015112631,0.0011397266,0.002158146,0.0008830358,0.0006427948,0.0031849956],"category_scores_gemma":[0.0041867066,0.00043695248,0.0010042972,0.0014155984,0.0030907274,0.005112691,0.002441544,0.002381921,0.0004757006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083918916,0.00003520111,0.0011906269,0.00011837838,0.00001687533,0.00016478606,0.0006405941,0.004577827,0.006643016,0.97009945,0.00056104735,0.015868304],"study_design_scores_gemma":[0.000020636542,0.00008715047,0.00060196046,0.000038066108,0.000027044109,0.0003005781,0.00021082262,0.0148916,0.0050669326,0.97152585,0.007200458,0.000028983452],"about_ca_topic_score_codex":0.0005642258,"about_ca_topic_score_gemma":0.00046369032,"teacher_disagreement_score":0.0031849956,"about_ca_system_score_codex":0.0013551564,"about_ca_system_score_gemma":0.0005452455,"threshold_uncertainty_score":0.010654926},"labels":[],"label_agreement":null},{"id":"W4387149210","doi":"10.1109/cita58204.2023.10262713","title":"Post Quantum Code-Based Cryptosystems with Dual Inverse Matrix","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"McEliece cryptosystem; Cryptosystem; Computer science; Hybrid cryptosystem; Transpose; Cryptography; Theoretical computer science; Code (set theory); Algorithm; Physics; Quantum mechanics; Programming language","score_opus":0.016119782013749133,"score_gpt":0.24157429302885278,"score_spread":0.22545451101510364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387149210","genre_codex":"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.16128582,0.0006744305,0.7832995,0.00173867,0.00059932115,0.00022707273,0.00019916745,0.00068227504,0.051293787],"genre_scores_gemma":[0.85219413,0.0004633605,0.1297483,0.00032553828,0.0002170487,0.00019069234,0.000121382174,0.000095041825,0.016644439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985927,0.0002561441,0.000083095816,0.00018511828,0.0006783412,0.00020463658],"domain_scores_gemma":[0.99825543,0.0005517773,0.0002110048,0.00052162615,0.00035427322,0.000105901934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008728535,0.00037762983,0.0004865876,0.00069081335,0.0007552069,0.0018064756,0.000692749,0.0011698784,0.0035384644],"category_scores_gemma":[0.0027736484,0.00029099084,0.00052368635,0.00068512466,0.002699422,0.0024103823,0.0016119245,0.0020423857,0.0009709182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014950284,0.000055124106,0.00015026516,0.00005026963,0.000011615672,0.00014798221,0.00013286462,0.00964858,0.014193712,0.9597373,0.0010177892,0.014705083],"study_design_scores_gemma":[0.00015681963,0.00036490773,0.0003577875,0.00006317816,0.000034298173,0.0007707149,0.00008502619,0.3131627,0.07308251,0.5922804,0.019527463,0.00011418744],"about_ca_topic_score_codex":0.0005179257,"about_ca_topic_score_gemma":0.00041491925,"teacher_disagreement_score":0.0035384644,"about_ca_system_score_codex":0.0008686177,"about_ca_system_score_gemma":0.0014462769,"threshold_uncertainty_score":0.011837304},"labels":[],"label_agreement":null},{"id":"W4387703346","doi":"10.12688/f1000research.133031.1","title":"A novel homomorphic polynomial public key encapsulation algorithm","year":2023,"lang":"en","type":"preprint","venue":"F1000Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Open peer review; Homomorphic encryption; Plant biology; Computer science; Algorithm; Key (lock); Encapsulation (networking); Medicine; Biology; Computer security; Botany","score_opus":0.13445829665325448,"score_gpt":0.3258276826811684,"score_spread":0.19136938602791392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387703346","genre_codex":"methods","genre_gemma":"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.012760696,0.00022732426,0.975294,0.0004468575,0.00012717608,0.00022543607,0.00014611169,0.0020219893,0.008750411],"genre_scores_gemma":[0.32470828,0.0002816167,0.659235,0.00038016928,0.000117425756,0.00026471438,0.0007471552,0.00026290485,0.014002694],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842584,0.00023180421,0.00014076622,0.00029995176,0.00066615717,0.00023549277],"domain_scores_gemma":[0.9990376,0.00018921803,0.00008792477,0.00044913767,0.0001853785,0.000050727347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090749,0.0005242682,0.0006973074,0.00078466814,0.0008451866,0.0018351951,0.0016078079,0.0013465957,0.0071062995],"category_scores_gemma":[0.002212602,0.00032547212,0.000825567,0.00080847484,0.00073419744,0.003222631,0.0026308894,0.0016833192,0.0039289864],"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.0006153602,0.0003834917,0.0008325863,0.0002784167,0.00011466216,0.00063311204,0.00038592602,0.0373707,0.053753626,0.30744925,0.018225983,0.57995695],"study_design_scores_gemma":[0.00036168811,0.00040455337,0.00060110114,0.00009981326,0.00009603947,0.0025356463,0.00014314508,0.6638126,0.09140421,0.15518482,0.08520609,0.00015034086],"about_ca_topic_score_codex":0.00048470465,"about_ca_topic_score_gemma":0.00037318195,"teacher_disagreement_score":0.0071062995,"about_ca_system_score_codex":0.0007861441,"about_ca_system_score_gemma":0.0016267635,"threshold_uncertainty_score":0.023772955},"labels":[],"label_agreement":null},{"id":"W4387772410","doi":"10.1007/978-3-031-37238-4_4","title":"Some Further Properties of the Lucas Sequences","year":2023,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Lucas sequence; Lucas number; Mathematics; Modulo; Factorization; Integer (computer science); Sequence (biology); Section (typography); Sine; Discrete mathematics; Integer sequence; Combinatorics; Arithmetic; Fibonacci polynomials; Algorithm; Computer science; Fibonacci number; Generating function; Classical orthogonal polynomials; Orthogonal polynomials","score_opus":0.054992082819469705,"score_gpt":0.23134471022071418,"score_spread":0.17635262740124447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387772410","genre_codex":"other","genre_gemma":"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.030996224,0.009554941,0.045791183,0.0037673274,0.0010346253,0.00005399978,0.00045248534,0.00020630841,0.9081429],"genre_scores_gemma":[0.44025528,0.014614232,0.059988484,0.0022503494,0.0036575487,0.00025557316,0.0011961281,0.00042447026,0.47735792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981993,0.000041884254,0.000010019841,0.00003561005,0.0000613572,0.000031155167],"domain_scores_gemma":[0.9995296,0.00024196885,0.000043361902,0.000049846498,0.000092005466,0.000043205706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038093404,0.0008547939,0.00047807596,0.0018369316,0.0011886978,0.002743015,0.0005415262,0.00072660664,0.02066946],"category_scores_gemma":[0.00203617,0.0003785051,0.0006031553,0.0021127737,0.0020339505,0.0030090585,0.0007522423,0.0028638425,0.0039624567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013415529,0.0000078346475,0.000051484934,0.000034518736,0.0000016884576,0.00003615915,0.0001279996,0.0002870301,0.000569225,0.97937185,0.0048843524,0.014614462],"study_design_scores_gemma":[0.000008471897,0.000015774755,0.00020541095,0.000025450388,0.0000035901771,0.00011269049,0.000079384365,0.0006288957,0.00041646624,0.9464729,0.05202353,0.0000073795027],"about_ca_topic_score_codex":0.0012309356,"about_ca_topic_score_gemma":0.0012977719,"teacher_disagreement_score":0.02066946,"about_ca_system_score_codex":0.0013902202,"about_ca_system_score_gemma":0.000623434,"threshold_uncertainty_score":0.069146216},"labels":[],"label_agreement":null},{"id":"W4388579442","doi":"10.1515/spma-2023-0105","title":"Legendre pairs of lengths<i>ℓ</i>≡ 0 (mod 5)","year":2023,"lang":"en","type":"article","venue":"Special Matrices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Austrian Science Fund; U.S. Department of Defense","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.013745096507448965,"score_gpt":0.23347397089837096,"score_spread":0.219728874390922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388579442","genre_codex":"empirical","genre_gemma":"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.9201103,0.0002180229,0.037349053,0.0005724752,0.00022405133,0.000064005704,0.00021461943,0.0004053561,0.0408421],"genre_scores_gemma":[0.9770199,0.00010159349,0.01097954,0.0002538497,0.0001854963,0.00009740631,0.0003820799,0.00015095939,0.010829124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.000117999734,0.000025499234,0.00010710484,0.00016438888,0.00016626257],"domain_scores_gemma":[0.9990049,0.00031034512,0.00024964724,0.00016465024,0.00010453376,0.00016596312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052156125,0.0006771526,0.00045602437,0.0011626757,0.0011016799,0.0011556944,0.00065619213,0.0007287029,0.015364686],"category_scores_gemma":[0.0032152266,0.0002793193,0.0005325376,0.0005847714,0.001225257,0.0014673426,0.0011132361,0.0010278788,0.001338182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011479518,0.00017256512,0.005570545,0.00016561433,0.000056993267,0.0009241984,0.0006144429,0.005389982,0.038386382,0.90016353,0.008284864,0.039122876],"study_design_scores_gemma":[0.0002639541,0.0011010156,0.012446646,0.00013456523,0.00008810423,0.0019498547,0.0009623294,0.07003369,0.066344075,0.8175538,0.028899549,0.00022241432],"about_ca_topic_score_codex":0.00030380642,"about_ca_topic_score_gemma":0.00029661387,"teacher_disagreement_score":0.015364686,"about_ca_system_score_codex":0.0005097191,"about_ca_system_score_gemma":0.00036651723,"threshold_uncertainty_score":0.051399946},"labels":[],"label_agreement":null},{"id":"W4389087156","doi":"10.1016/j.jcta.2023.105834","title":"The second-order football-pool problem and the optimal rate of generalized-covering codes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Order (exchange); Mathematics; Code (set theory); Property (philosophy); Function (biology); Football; Combinatorics; Discrete mathematics; Computer science; Law","score_opus":0.00764930142739302,"score_gpt":0.2229173974703567,"score_spread":0.21526809604296368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389087156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5298795,0.003580635,0.39177632,0.008378779,0.0004317614,0.0002473736,0.0013337623,0.00053138414,0.06384054],"genre_scores_gemma":[0.95160735,0.001676,0.03514817,0.00056768925,0.00041202566,0.0002286107,0.00046953073,0.00022931272,0.009661338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667287,0.0015685807,0.00009943239,0.00035958234,0.00044642133,0.0008531821],"domain_scores_gemma":[0.9812983,0.014283238,0.0009420916,0.0014297247,0.0008433088,0.0012033824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040883296,0.0016265041,0.0030987612,0.0019684078,0.0017984316,0.006058395,0.00395484,0.003467234,0.0074531194],"category_scores_gemma":[0.028624488,0.001237856,0.0012405709,0.0027261297,0.0039284523,0.007009937,0.0043791756,0.0031311782,0.000846379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063989044,0.0001223277,0.0008206623,0.0002404205,0.00008209154,0.00022728324,0.00031657366,0.16526595,0.0023157788,0.8016697,0.0081623355,0.020136988],"study_design_scores_gemma":[0.0000955579,0.00007059995,0.00029784074,0.000060969654,0.000024026585,0.00018674691,0.00013491974,0.2961994,0.0010390787,0.7003192,0.0015196751,0.00005189386],"about_ca_topic_score_codex":0.0028728668,"about_ca_topic_score_gemma":0.0020205285,"teacher_disagreement_score":0.0074531194,"about_ca_system_score_codex":0.003983806,"about_ca_system_score_gemma":0.0036614554,"threshold_uncertainty_score":0.028904676},"labels":[],"label_agreement":null},{"id":"W4389147223","doi":"10.54254/2753-8818/13/20240801","title":"Discrete logarithms and primitive roots: Algorithms, properties, and typical solution methods","year":2023,"lang":"en","type":"article","venue":"Theoretical and Natural Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Mathematics; Iterated logarithm; Integer (computer science); Binary logarithm; Discrete mathematics; Root (linguistics); Analytic number theory; Value (mathematics); Prime (order theory); Combinatorics; Field (mathematics); Pure mathematics; Computer science; Mathematical analysis","score_opus":0.019475613507888602,"score_gpt":0.29277019236077895,"score_spread":0.2732945788528903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389147223","genre_codex":"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.00732903,0.0067902138,0.96697134,0.002478738,0.0003698428,0.00009961848,0.00010826073,0.0003321354,0.015520875],"genre_scores_gemma":[0.17273146,0.01071117,0.8045205,0.0008327079,0.0012635288,0.00048222815,0.00029892154,0.00022093748,0.008938515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978503,0.0007496655,0.0001637132,0.00042043143,0.0006971556,0.000118811986],"domain_scores_gemma":[0.99681133,0.002200215,0.0001679518,0.00041682483,0.00031435303,0.00008938306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002918521,0.0009044743,0.0010347177,0.00208176,0.0011542261,0.0034298778,0.0017229618,0.0015083674,0.003020411],"category_scores_gemma":[0.0122339325,0.00042588703,0.0010324873,0.0047065206,0.0036840057,0.009758449,0.0023936862,0.004247347,0.0011366892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029165873,0.000027513697,0.00026394578,0.00015098297,0.000013008393,0.000023527653,0.00014991764,0.0039719623,0.00027540882,0.9171051,0.0035464666,0.07444299],"study_design_scores_gemma":[0.000028462951,0.000023366567,0.000065303255,0.000048999846,0.000008549511,0.00012112713,0.00004779411,0.03781097,0.00066339225,0.9488739,0.012291787,0.000016269038],"about_ca_topic_score_codex":0.0004599456,"about_ca_topic_score_gemma":0.00032957154,"teacher_disagreement_score":0.0034298778,"about_ca_system_score_codex":0.0017240167,"about_ca_system_score_gemma":0.0014929632,"threshold_uncertainty_score":0.015434802},"labels":[],"label_agreement":null},{"id":"W4389192997","doi":"10.22215/etd/2023-15755","title":"A Comparative Study on Post-Quantum Cryptographic Digital Signature Algorithms: Network Performance, Key Robustness, and Energy Consumption.","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cryptography; Digital signature; Post-quantum cryptography; Digital Signature Algorithm; NIST; Algorithm; Public-key cryptography; Computer engineering; Theoretical computer science; Key (lock); Quantum cryptography; Robustness (evolution); Energy consumption; Hash function; Distributed computing; Computer security; Quantum; Encryption; Quantum information; Engineering","score_opus":0.01987942196517221,"score_gpt":0.25749121083770465,"score_spread":0.23761178887253245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389192997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.71656674,0.022723781,0.1538156,0.002795575,0.0006038782,0.00031077204,0.0009455766,0.0009965231,0.10124157],"genre_scores_gemma":[0.95752823,0.0046749962,0.028710308,0.00012074693,0.000101915306,0.000046888435,0.0005608601,0.00009719319,0.00815884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817383,0.00040117442,0.0000830589,0.00019200852,0.0009778097,0.00017221647],"domain_scores_gemma":[0.9947307,0.0030226787,0.00040523685,0.00077353086,0.0009580723,0.00010984715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018466418,0.00038241604,0.00036588794,0.0013849746,0.00046768476,0.0014504928,0.00053002505,0.00053328223,0.0038647712],"category_scores_gemma":[0.0094578415,0.00012190495,0.00030191374,0.0022686364,0.00043640155,0.0026952906,0.0006111268,0.0005386372,0.0010020264],"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.0017961888,0.0006323558,0.013524508,0.0011453137,0.0002235138,0.00022436891,0.0004018287,0.10083658,0.040743582,0.09950692,0.013230025,0.7277348],"study_design_scores_gemma":[0.00011287117,0.005430608,0.02687852,0.00045825046,0.00029724406,0.0026854852,0.0011084992,0.63873076,0.17469007,0.05437774,0.09502612,0.0002039232],"about_ca_topic_score_codex":0.0005128065,"about_ca_topic_score_gemma":0.00074782415,"teacher_disagreement_score":0.0038647712,"about_ca_system_score_codex":0.0013479289,"about_ca_system_score_gemma":0.0007933223,"threshold_uncertainty_score":0.012928903},"labels":[],"label_agreement":null},{"id":"W4390973014","doi":"10.1007/s00200-023-00642-2","title":"On the classification of non-exceptional APN functions","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Medicine","score_opus":0.010759470734211237,"score_gpt":0.22430183092138856,"score_spread":0.21354236018717732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390973014","genre_codex":"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.6139914,0.0018163002,0.18960525,0.0026268784,0.00090612785,0.00008555585,0.00040347254,0.00036528744,0.19019976],"genre_scores_gemma":[0.95232415,0.00093400996,0.019230884,0.0004867612,0.00075840455,0.0000685599,0.00065534184,0.00011486934,0.025427077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900645,0.00026100795,0.000072773924,0.00012441765,0.00032337473,0.0002120994],"domain_scores_gemma":[0.99749494,0.0008607389,0.0002650361,0.0003576867,0.00051997765,0.00050157687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018776684,0.0007265654,0.0008450215,0.0039497716,0.002409572,0.003589362,0.001479864,0.0013193783,0.005708513],"category_scores_gemma":[0.0047100554,0.00025317713,0.0006541147,0.0020819767,0.0046611656,0.005740291,0.0030699696,0.0029237042,0.0011391965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003173889,0.000022155371,0.0005428875,0.000022126907,0.0000028083546,0.000063199164,0.00015207972,0.0004516591,0.00048069854,0.9906178,0.0009050027,0.00670774],"study_design_scores_gemma":[0.0000059281388,0.000011813519,0.00041858503,0.000021344242,0.000003150264,0.00015741732,0.000077335615,0.0060871686,0.00031627296,0.9903611,0.0025284493,0.000011537438],"about_ca_topic_score_codex":0.0007361023,"about_ca_topic_score_gemma":0.00039701854,"teacher_disagreement_score":0.005708513,"about_ca_system_score_codex":0.0012262353,"about_ca_system_score_gemma":0.0009109822,"threshold_uncertainty_score":0.019096911},"labels":[],"label_agreement":null},{"id":"W4391453430","doi":"10.4064/aa230804-2-9","title":"On sequences of integers with small prime factors","year":2024,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Prime (order theory); Prime factor; Combinatorics; Discrete mathematics","score_opus":0.017897390609651145,"score_gpt":0.22567275838901593,"score_spread":0.20777536777936478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391453430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5917466,0.0059995214,0.36303777,0.0013033481,0.0005303261,0.00008204312,0.00028493922,0.00050990604,0.03650547],"genre_scores_gemma":[0.9339659,0.003501283,0.050783634,0.00035543367,0.00047141092,0.00016310244,0.000392599,0.0001807574,0.010185943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987735,0.0002988043,0.00007438232,0.00023095621,0.00043759713,0.00018474436],"domain_scores_gemma":[0.98762834,0.008785043,0.0015595952,0.0007386824,0.0007367761,0.00055153103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013577543,0.0011756888,0.00086324464,0.0027763667,0.0012008728,0.0017681118,0.0012532366,0.0012469455,0.0028339012],"category_scores_gemma":[0.021898612,0.00047420454,0.0005507085,0.0020319866,0.0030211706,0.0060557425,0.0023810554,0.0023432684,0.0008610717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043162814,0.00006913496,0.0026872125,0.0003376798,0.00002753476,0.0012677959,0.0009603205,0.030961772,0.015383457,0.9194331,0.0015321018,0.026908245],"study_design_scores_gemma":[0.000051620238,0.00017731678,0.0016202063,0.0001938814,0.00004099749,0.0012425698,0.00021554698,0.15186614,0.006436827,0.83040965,0.0076810247,0.000064313535],"about_ca_topic_score_codex":0.0007856375,"about_ca_topic_score_gemma":0.0006180901,"teacher_disagreement_score":0.0028339012,"about_ca_system_score_codex":0.0010905816,"about_ca_system_score_gemma":0.0005765713,"threshold_uncertainty_score":0.009480357},"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":"W4392003966","doi":"10.3842/sigma.2024.016","title":"Color-Dressed Generalized Biadjoint Scalar Amplitudes: Local Planarity","year":2024,"lang":"en","type":"article","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; European Commission; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Planarity testing; Feynman diagram; Scalar (mathematics); Amplitude; Propagator; Mathematics; Mathematical physics; Pure mathematics; Combinatorics; Physics; Quantum mechanics; Geometry","score_opus":0.02325770731853105,"score_gpt":0.34477211347793113,"score_spread":0.3215144061594001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392003966","genre_codex":"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.6498904,0.0005400334,0.23055582,0.0010202241,0.0003853233,0.000074470154,0.00013973664,0.0005924809,0.11680149],"genre_scores_gemma":[0.9669631,0.00018366503,0.02357656,0.00026573165,0.00006841111,0.000027846352,0.0000620104,0.0000986868,0.008754063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976903,0.000057704794,0.000010170428,0.000040988503,0.000074086514,0.000048000733],"domain_scores_gemma":[0.9996277,0.00007506289,0.000049044364,0.000106386855,0.00006777998,0.00007393897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030683546,0.00037212437,0.0003008635,0.0007529613,0.000641791,0.0011603964,0.0006923764,0.0007784171,0.0034305917],"category_scores_gemma":[0.0010634521,0.00019504603,0.00037238697,0.0005306448,0.0016187138,0.0016719191,0.0009834522,0.00095939124,0.00033032178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012242119,0.0000073596207,0.00017162418,0.000020314132,0.0000028637835,0.00011670004,0.00009442729,0.001168962,0.0035588415,0.9917041,0.00035330883,0.0027893495],"study_design_scores_gemma":[0.000020196694,0.000027606164,0.0005137871,0.000020839498,0.00000843132,0.00041603623,0.00017119304,0.04099269,0.0042010457,0.94987166,0.0037244891,0.00003205983],"about_ca_topic_score_codex":0.00068561285,"about_ca_topic_score_gemma":0.0008855737,"teacher_disagreement_score":0.0034305917,"about_ca_system_score_codex":0.00047027427,"about_ca_system_score_gemma":0.00038118634,"threshold_uncertainty_score":0.011476517},"labels":[],"label_agreement":null},{"id":"W4392919062","doi":"10.1016/j.disc.2024.113968","title":"On extremal and near-extremal self-dual ternary codes","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Ternary operation; Combinatorics; Dual (grammatical number); Discrete mathematics; Computer science","score_opus":0.012475497688923032,"score_gpt":0.24352448114496758,"score_spread":0.23104898345604455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392919062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.62489134,0.00080215087,0.3215471,0.00049480435,0.00010678548,0.00010813154,0.00068486086,0.0003087428,0.051056158],"genre_scores_gemma":[0.8627208,0.00083614996,0.12956473,0.00014015536,0.00010526243,0.0001275162,0.0008330995,0.00008918916,0.0055830106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994848,0.0001377011,0.000036143672,0.000060975144,0.00019259726,0.00008787164],"domain_scores_gemma":[0.99830914,0.0009786307,0.00018897622,0.00022286641,0.00021995716,0.000080442216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005494174,0.00042919515,0.00044432824,0.0026901094,0.0009327822,0.001569886,0.00059809815,0.0006274203,0.0040084464],"category_scores_gemma":[0.004186683,0.00024336114,0.00044667203,0.0017116577,0.0010567729,0.0017053158,0.0011838271,0.00081465655,0.000558448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026140385,0.00015258374,0.0029449866,0.0002600021,0.000023640938,0.00031246347,0.00029797392,0.058996852,0.01465908,0.8343234,0.0027251963,0.08504244],"study_design_scores_gemma":[0.000023741517,0.00009776753,0.00096752116,0.00010766804,0.000022678958,0.0006228698,0.00021644511,0.294521,0.014439056,0.68466973,0.0042656395,0.000045854325],"about_ca_topic_score_codex":0.0002742023,"about_ca_topic_score_gemma":0.00060006895,"teacher_disagreement_score":0.0040084464,"about_ca_system_score_codex":0.00061208045,"about_ca_system_score_gemma":0.0005999846,"threshold_uncertainty_score":0.013409555},"labels":[],"label_agreement":null},{"id":"W4392947762","doi":"10.1016/j.jcta.2024.105887","title":"Extremal Peisert-type graphs without the strict-EKR property","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Type (biology); Property (philosophy); Combinatorics; Mathematics; Philosophy; Geology; Epistemology; Paleontology","score_opus":0.01369679362650714,"score_gpt":0.23965393686259145,"score_spread":0.22595714323608432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392947762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7317283,0.0005303081,0.08127953,0.0020535805,0.0002791769,0.000071196526,0.000970162,0.0006775073,0.1824102],"genre_scores_gemma":[0.97540104,0.0002757195,0.010760915,0.0003670919,0.00011704364,0.000041775045,0.00038234366,0.00011032825,0.01254373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997197,0.00006771578,0.000015317646,0.00005888616,0.00007147522,0.00006678724],"domain_scores_gemma":[0.9985567,0.00062925066,0.0002248124,0.00026544448,0.0001407621,0.00018292741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004049761,0.00039086462,0.00056638964,0.001503225,0.001239806,0.0018482141,0.00085576775,0.0014138893,0.0075382926],"category_scores_gemma":[0.0022913325,0.00045191287,0.00048076606,0.000783441,0.0014284566,0.002900328,0.0013023441,0.001722358,0.0009087551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059722035,0.000018548564,0.00035998385,0.00004308974,0.000008842407,0.00021800685,0.000078441015,0.0010132886,0.0014436506,0.99109787,0.0018389832,0.003819645],"study_design_scores_gemma":[0.000025455956,0.000014625712,0.00048747213,0.000013056589,0.000010413681,0.00038135317,0.00006371705,0.0061007803,0.0010221011,0.9902716,0.0015963473,0.000013052392],"about_ca_topic_score_codex":0.00024598787,"about_ca_topic_score_gemma":0.0003641399,"teacher_disagreement_score":0.0075382926,"about_ca_system_score_codex":0.0004415658,"about_ca_system_score_gemma":0.00038614916,"threshold_uncertainty_score":0.02521807},"labels":[],"label_agreement":null},{"id":"W4393028178","doi":"10.1109/gcwkshps58843.2023.10465005","title":"Generalized Spatially-Coupled Product-Like Codes Using Zipper Codes with Irregular Degree","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Zipper; Degree (music); Product (mathematics); Computer science; Mathematics; Algorithm; Physics; Geometry","score_opus":0.04225229409151661,"score_gpt":0.25582524645420196,"score_spread":0.21357295236268536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393028178","genre_codex":"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.39401954,0.00060982583,0.5884575,0.00027018026,0.00008468802,0.00012995822,0.0001795845,0.0005560293,0.01569264],"genre_scores_gemma":[0.95543027,0.00030438683,0.041165248,0.000054624943,0.000022738144,0.00006526474,0.000077303164,0.00004623248,0.0028338672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993729,0.00019399283,0.000026823003,0.000075519674,0.0002238353,0.00010698988],"domain_scores_gemma":[0.99700147,0.0014694716,0.00046013025,0.0005000762,0.0004388291,0.00013014166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192731,0.00060223846,0.0006358514,0.0008163004,0.0006763783,0.0011542211,0.0008772856,0.00085733394,0.0017709362],"category_scores_gemma":[0.0034088304,0.00036273632,0.00048251706,0.0013665128,0.0014847972,0.0014550699,0.000982657,0.0007467534,0.00034979955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000233565,0.000048957183,0.0018735608,0.00013834944,0.00006210733,0.0004710774,0.00027673595,0.44926095,0.014323571,0.51654,0.000915791,0.015855389],"study_design_scores_gemma":[0.000020629705,0.0000580768,0.00020719781,0.00001429883,0.000017711442,0.00016747785,0.000039657923,0.92965037,0.006175543,0.06233713,0.0012792465,0.000032680633],"about_ca_topic_score_codex":0.0017712252,"about_ca_topic_score_gemma":0.0017436701,"teacher_disagreement_score":0.0017712252,"about_ca_system_score_codex":0.001281452,"about_ca_system_score_gemma":0.000882968,"threshold_uncertainty_score":0.009297669},"labels":[],"label_agreement":null},{"id":"W4393179419","doi":"10.1017/9781009283403.013","title":"Rank-Metric and Subspace Codes","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subspace topology; Rank (graph theory); Metric (unit); Computer science; Content (measure theory); Information retrieval; Mathematics; Combinatorics; Artificial intelligence; Engineering; Operations management","score_opus":0.015197975533359971,"score_gpt":0.1884363852016741,"score_spread":0.17323840966831414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393179419","genre_codex":"other","genre_gemma":"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.007659788,0.08595052,0.09854965,0.007632946,0.0029551284,0.000068239926,0.0023945218,0.00086715724,0.79392195],"genre_scores_gemma":[0.21557912,0.08491587,0.039679676,0.0030740309,0.0049264906,0.00014572132,0.0044488357,0.0006511693,0.6465791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994728,0.0000868173,0.000018150507,0.00006254504,0.00031108712,0.000048701113],"domain_scores_gemma":[0.9994103,0.00019552016,0.000028582177,0.00011683474,0.00020756481,0.000041309257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005319932,0.0006171871,0.0005611746,0.0014716261,0.00050378556,0.0016302251,0.00041680585,0.00053119415,0.023841357],"category_scores_gemma":[0.0016571458,0.00018884876,0.00023856696,0.0025477274,0.0013178568,0.002044304,0.00085994595,0.0015406361,0.008362304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001699256,0.000011203134,0.00006122923,0.0002465442,0.000008150508,0.000040487415,0.00007744825,0.0029859818,0.0004593436,0.7102201,0.15165897,0.1342135],"study_design_scores_gemma":[0.0000037132077,0.00003599594,0.00028364974,0.0001113702,0.0000048055913,0.00020991673,0.000057207337,0.0031215209,0.0005024334,0.64693487,0.34871534,0.00001923368],"about_ca_topic_score_codex":0.001960272,"about_ca_topic_score_gemma":0.0016663594,"teacher_disagreement_score":0.023841357,"about_ca_system_score_codex":0.001522905,"about_ca_system_score_gemma":0.0010077246,"threshold_uncertainty_score":0.07975727},"labels":[],"label_agreement":null},{"id":"W4393305872","doi":"10.1016/j.ffa.2024.102415","title":"Constructing permutation polynomials from permutation polynomials of subfields","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Pró-Reitoria de Pesquisa, Universidade Federal de Minas Gerais; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Permutation (music); Finite field; Combinatorics; Discrete mathematics; Polynomial; Field (mathematics); Pure mathematics; Mathematical analysis","score_opus":0.010885680740948258,"score_gpt":0.23387814785765237,"score_spread":0.22299246711670412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393305872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.20752995,0.0005860304,0.7650302,0.00071675755,0.00035062074,0.00013156029,0.00018923086,0.0007159412,0.02474976],"genre_scores_gemma":[0.71896267,0.0011464816,0.26420107,0.0002974429,0.0003577896,0.0000760523,0.00051595265,0.00045560437,0.0139868995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00015190347,0.000025790005,0.00007307506,0.0001663191,0.000105725594],"domain_scores_gemma":[0.9988985,0.00061567023,0.00009636177,0.00020362993,0.00011903619,0.000066720546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094016286,0.00073401164,0.0007834022,0.0013816403,0.0008865601,0.001449551,0.00088912254,0.00067020196,0.0035727965],"category_scores_gemma":[0.003428522,0.0005036545,0.0009351755,0.001775936,0.0019395956,0.0026762825,0.001590673,0.0020582734,0.0013511574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019455595,0.00010367553,0.0007645579,0.00016687228,0.000019335908,0.00032816027,0.0005037261,0.010350088,0.010569141,0.86116445,0.0032122466,0.11262325],"study_design_scores_gemma":[0.00004183112,0.00008729761,0.0002471785,0.000032400538,0.00002143474,0.00026476008,0.00012146617,0.03256564,0.0095262565,0.9486168,0.008440197,0.000034664703],"about_ca_topic_score_codex":0.0007010174,"about_ca_topic_score_gemma":0.0009818091,"teacher_disagreement_score":0.0035727965,"about_ca_system_score_codex":0.00072118297,"about_ca_system_score_gemma":0.000943822,"threshold_uncertainty_score":0.011952162},"labels":[],"label_agreement":null},{"id":"W4393486369","doi":"10.5281/zenodo.825339","title":"Enumeration Of Williamson Sequences Of Even Order","year":2017,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Order (exchange); Combinatorics; Mathematics; Economics","score_opus":0.0339572623554256,"score_gpt":0.2704479077943061,"score_spread":0.23649064543888051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393486369","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016465641,0.0002529835,0.00019152682,0.00016879181,0.00003825115,0.000030382682,0.9957047,0.0007600805,0.0012067038],"genre_scores_gemma":[0.0017999985,0.00010521836,0.00053589913,0.000057648358,0.000009620621,0.000084147876,0.9968405,0.000040678602,0.00052631256],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987343,0.00014980685,0.0001244413,0.00035656654,0.0004135885,0.00022129333],"domain_scores_gemma":[0.9975073,0.00079012325,0.00022891248,0.00072404864,0.0005699166,0.00017975087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007450886,0.0028734321,0.0014664899,0.0036098028,0.0009792569,0.0021753812,0.0035599575,0.0030605346,0.031241572],"category_scores_gemma":[0.0066826767,0.00060715026,0.0012559779,0.006926685,0.0006699165,0.0019043211,0.0015088021,0.0020808368,0.03619924],"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.00024388926,0.000111470836,0.0017267072,0.0009728007,0.00004578241,0.00008681357,0.000035088735,0.001561399,0.00046196327,0.0017017968,0.9846044,0.008447901],"study_design_scores_gemma":[0.0012346572,0.00015436101,0.009339492,0.0006591064,0.00007005133,0.0004777216,0.0002574118,0.007925538,0.0031512373,0.008829463,0.9678349,0.00006616672],"about_ca_topic_score_codex":0.017514644,"about_ca_topic_score_gemma":0.03408531,"teacher_disagreement_score":0.031241572,"about_ca_system_score_codex":0.0025497505,"about_ca_system_score_gemma":0.0025752431,"threshold_uncertainty_score":0.10451347},"labels":[],"label_agreement":null},{"id":"W4394838676","doi":"10.4230/lipics.approx/random.2024.34","title":"Matrix Multiplication Reductions","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matrix multiplication; Reduction (mathematics); Matrix (chemical analysis); Mathematics; Multiplication (music); Algorithm; Random matrix; Overhead (engineering); Product (mathematics); Discrete mathematics; Combinatorics; Computer science; Physics; Eigenvalues and eigenvectors","score_opus":0.05783141494549967,"score_gpt":0.20199178987491692,"score_spread":0.14416037492941725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394838676","genre_codex":"methods","genre_gemma":"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.040670045,0.0011554414,0.89142245,0.0031920578,0.0006977746,0.000348405,0.0006786824,0.0046910476,0.057144],"genre_scores_gemma":[0.41059583,0.000792195,0.5399754,0.0021687758,0.0012178179,0.00071946083,0.0020267176,0.002535015,0.039968707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905093,0.0019599143,0.0004590976,0.0021514364,0.0035283554,0.0013919029],"domain_scores_gemma":[0.98337656,0.008121608,0.0006095828,0.0060864524,0.0014195741,0.00038622503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003628211,0.001480647,0.0016358022,0.0011965295,0.002455002,0.004064575,0.003696736,0.0017544515,0.017415578],"category_scores_gemma":[0.01712078,0.0007081662,0.003172862,0.0017836426,0.0028672963,0.009534105,0.0053354586,0.0063268533,0.006049898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059173396,0.00050745416,0.0013002674,0.00068485254,0.00012487454,0.00028833986,0.0006945892,0.061148025,0.0090097,0.68866664,0.037403587,0.1995799],"study_design_scores_gemma":[0.000088227,0.00016389615,0.00025598274,0.000056995697,0.00005706553,0.00036494347,0.000115079696,0.14102344,0.009464149,0.8206615,0.027704673,0.000044118868],"about_ca_topic_score_codex":0.0012231091,"about_ca_topic_score_gemma":0.0015719583,"teacher_disagreement_score":0.017415578,"about_ca_system_score_codex":0.002846651,"about_ca_system_score_gemma":0.0025853133,"threshold_uncertainty_score":0.058260918},"labels":[],"label_agreement":null},{"id":"W4395099387","doi":"10.1007/978-3-031-48679-1_14","title":"On a Class of Optimal Constant Weight Codes","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Constant (computer programming); Class (philosophy); Mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.06101310244959245,"score_gpt":0.2808782458193701,"score_spread":0.21986514336977764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099387","genre_codex":"other","genre_gemma":"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.10146255,0.008207276,0.38842502,0.0026900219,0.0009422619,0.00013837316,0.0010074372,0.00063650345,0.4964906],"genre_scores_gemma":[0.6391162,0.014719043,0.14025164,0.0017423067,0.0018319892,0.00041615378,0.0015619122,0.0009053169,0.19945553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935406,0.0000981012,0.000025095771,0.000112744856,0.0002912403,0.00011867576],"domain_scores_gemma":[0.9990798,0.00047707013,0.000075547374,0.00017187641,0.00013516721,0.000060577484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713342,0.00096256786,0.0008130334,0.0015533965,0.0010624161,0.002499847,0.0011151045,0.0010870778,0.008238283],"category_scores_gemma":[0.0033277927,0.00045267906,0.0005753417,0.0026688892,0.0017995044,0.003076095,0.001534907,0.0026964776,0.0013663938],"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.000026178133,0.000011535093,0.0000631853,0.00004097826,0.0000046061036,0.000017382476,0.000049232334,0.0031472174,0.0005603666,0.9700217,0.0037199145,0.022337688],"study_design_scores_gemma":[0.0000107193755,0.000011492427,0.000093264025,0.000028544491,0.000005966595,0.00007314914,0.000021631773,0.011179299,0.0004977588,0.9769096,0.0111597525,0.000008805358],"about_ca_topic_score_codex":0.001299714,"about_ca_topic_score_gemma":0.0010360961,"teacher_disagreement_score":0.008238283,"about_ca_system_score_codex":0.001480599,"about_ca_system_score_gemma":0.0011268782,"threshold_uncertainty_score":0.027559817},"labels":[],"label_agreement":null},{"id":"W4395099399","doi":"10.1007/978-3-031-48679-1_12","title":"Group Rings and Character Sums: Tricks of the Trade","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Character (mathematics); Group (periodic table); Mathematics; Chemistry; Geometry; Organic chemistry","score_opus":0.05506792985972499,"score_gpt":0.2504341640557827,"score_spread":0.19536623419605775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099399","genre_codex":"other","genre_gemma":"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.017494578,0.020610962,0.09341996,0.022147078,0.0035701438,0.000036511596,0.00021474883,0.0006177612,0.84188825],"genre_scores_gemma":[0.5106465,0.019406505,0.05403183,0.00589582,0.00927804,0.00015677753,0.00023775804,0.0010418564,0.3993049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993936,0.00025071538,0.000028345674,0.00009172331,0.00018558966,0.00004994182],"domain_scores_gemma":[0.99904686,0.00056467974,0.000037594313,0.0001874998,0.00009486545,0.00006838325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010193397,0.0007023431,0.0007970006,0.001428226,0.0020282422,0.005843007,0.00070268824,0.0012257285,0.015377315],"category_scores_gemma":[0.003489335,0.00040101743,0.000360871,0.0014356436,0.0066467496,0.015822988,0.0024949294,0.0041834814,0.0043683215],"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.000006633663,0.0000045730453,0.000019451083,0.00001500355,0.0000012632382,0.000007848679,0.0001198178,0.000080723665,0.00008479897,0.9857007,0.0065427003,0.007416435],"study_design_scores_gemma":[0.000003040546,0.00000398484,0.000026353098,0.000016120563,0.0000015474578,0.000044857814,0.000054067426,0.00025927997,0.000104288185,0.9607489,0.038733702,0.0000038028688],"about_ca_topic_score_codex":0.0002777112,"about_ca_topic_score_gemma":0.00042020532,"teacher_disagreement_score":0.015377315,"about_ca_system_score_codex":0.0009951466,"about_ca_system_score_gemma":0.00046228088,"threshold_uncertainty_score":0.051442266},"labels":[],"label_agreement":null},{"id":"W4395667498","doi":"10.4064/aa230330-21-2","title":"Additive decompositions of large multiplicative subgroups in finite fields","year":2024,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicative function; Mathematics; Finite field; Multiplicative group; Combinatorics; Field (mathematics); Pure mathematics; Multiplicative inverse; Inverse; Mathematical analysis; Geometry","score_opus":0.009240028293323056,"score_gpt":0.2672007845938596,"score_spread":0.25796075630053655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395667498","genre_codex":"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.86777174,0.0006072262,0.091951095,0.00083650986,0.00016868344,0.00005786512,0.00013656651,0.00023280513,0.038237512],"genre_scores_gemma":[0.9785221,0.00018465317,0.013865058,0.00013302694,0.00013369924,0.00005500723,0.00017438915,0.000048438684,0.0068836655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923384,0.00017842185,0.00006627662,0.00013886963,0.00019993336,0.00018280462],"domain_scores_gemma":[0.9987148,0.0004840805,0.0002016978,0.00023545806,0.000123735,0.00024025208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083975156,0.0006614613,0.00047809738,0.0017293544,0.0012169523,0.0023471052,0.0005772477,0.00054644834,0.0038572007],"category_scores_gemma":[0.0023394967,0.000400344,0.000928204,0.00073105213,0.0026562952,0.003676877,0.0021088046,0.0015176379,0.0005537054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013627637,0.000049982424,0.0010034448,0.000041253534,0.000014852745,0.00027332336,0.00078004086,0.0010365229,0.006525397,0.9820209,0.00069171283,0.007426214],"study_design_scores_gemma":[0.00004072176,0.00007268333,0.0006687449,0.000031115916,0.000028151077,0.0003646098,0.00042885885,0.006143582,0.0062014586,0.9814418,0.004556932,0.000021367961],"about_ca_topic_score_codex":0.0002728116,"about_ca_topic_score_gemma":0.00036460883,"teacher_disagreement_score":0.0038572007,"about_ca_system_score_codex":0.00080815324,"about_ca_system_score_gemma":0.00041162732,"threshold_uncertainty_score":0.012903631},"labels":[],"label_agreement":null},{"id":"W4396243126","doi":"10.5802/alco.344","title":"Bivariate <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>P</mml:mi> </mml:math> -polynomial association schemes","year":2024,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; American Heart Association","keywords":"Association scheme; Bivariate analysis; Generalization; Mathematics; Polynomial; Intersection (aeronautics); Association (psychology); Discrete mathematics; Combinatorics; Statistics; Mathematical analysis; Cartography; Psychology","score_opus":0.012333815138695157,"score_gpt":0.2275865630329706,"score_spread":0.21525274789427543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396243126","genre_codex":"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.018353045,0.00042465358,0.82610005,0.0029236951,0.0010902158,0.0005665815,0.0062176357,0.0062212655,0.13810278],"genre_scores_gemma":[0.31447658,0.002272811,0.46887782,0.0023733554,0.0013865249,0.0013879635,0.016774831,0.005799209,0.1866509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189055,0.001995918,0.000944541,0.0015124277,0.0024061138,0.0012504332],"domain_scores_gemma":[0.98883086,0.0021873247,0.0008776204,0.005243513,0.0021541787,0.0007065425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067347335,0.0014289885,0.0014453778,0.002161974,0.0032332481,0.008477087,0.0033275667,0.0022578945,0.05246158],"category_scores_gemma":[0.01566037,0.0015735879,0.002433515,0.0050025694,0.003677637,0.017019276,0.008469708,0.007976667,0.036500223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016289073,0.00007363385,0.00051634066,0.00015762758,0.000014766482,0.00011874208,0.0004327233,0.0014214311,0.0024155898,0.9231071,0.03771923,0.033859935],"study_design_scores_gemma":[0.00010325963,0.00010378425,0.0010021548,0.0001681309,0.00005450312,0.0006757539,0.00045673831,0.011827508,0.009724599,0.531882,0.44380596,0.000195515],"about_ca_topic_score_codex":0.0040870504,"about_ca_topic_score_gemma":0.004187353,"teacher_disagreement_score":0.05246158,"about_ca_system_score_codex":0.0036634824,"about_ca_system_score_gemma":0.0055011003,"threshold_uncertainty_score":0.17550147},"labels":[],"label_agreement":null},{"id":"W4396584860","doi":"10.1007/s00373-024-02788-3","title":"Ternary Extremal Four-Negacirculant Self-Dual Codes","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Dual (grammatical number); Ternary operation; Discrete mathematics; Computer science","score_opus":0.013059801209253449,"score_gpt":0.21164270032346905,"score_spread":0.1985828991142156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396584860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7455004,0.00055281963,0.065080814,0.0027387314,0.00043353942,0.00008429582,0.0006077196,0.0004039157,0.18459783],"genre_scores_gemma":[0.9683281,0.00018593625,0.011794495,0.0005091639,0.00014555661,0.000061395665,0.00026436144,0.000089508474,0.018621465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00018335764,0.000041241325,0.0000943783,0.00022117047,0.00019519994],"domain_scores_gemma":[0.9985386,0.0005735256,0.00018969686,0.00021542342,0.00025544426,0.00022721352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069646025,0.0005361481,0.0006927691,0.0026771775,0.002078363,0.0034602815,0.0009639128,0.0020012273,0.011186525],"category_scores_gemma":[0.0030408015,0.00037807072,0.0005338813,0.0010696999,0.00265869,0.0020867079,0.002207059,0.001876833,0.0014791384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013925711,0.00003347801,0.00036428988,0.00004301811,0.000006855207,0.00017763808,0.00013186221,0.0013497977,0.0025105039,0.98790205,0.0016131909,0.0057282345],"study_design_scores_gemma":[0.000051277555,0.000030421561,0.00046288135,0.000044140023,0.000015909787,0.0005222245,0.00016766267,0.014423513,0.0040669693,0.9763362,0.0038441354,0.000034786248],"about_ca_topic_score_codex":0.00051340566,"about_ca_topic_score_gemma":0.000743985,"teacher_disagreement_score":0.011186525,"about_ca_system_score_codex":0.001356845,"about_ca_system_score_gemma":0.0008594594,"threshold_uncertainty_score":0.037422597},"labels":[],"label_agreement":null},{"id":"W4396691412","doi":"10.3390/math12101429","title":"Secure Key Exchange in Tropical Cryptography: Leveraging Efficiency with Advanced Block Matrix Protocols","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key exchange; Block (permutation group theory); Cryptography; Theoretical computer science; Cryptographic protocol; Implementation; Distributed computing; Key (lock); Protocol (science); Algorithm; Mathematics; Computer network; Public-key cryptography; Encryption; Computer security","score_opus":0.015025953523157843,"score_gpt":0.27593166329989566,"score_spread":0.2609057097767378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396691412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.045365363,0.0004366297,0.9414008,0.00055473583,0.00008964696,0.0001407174,0.00005376948,0.00036463168,0.011593664],"genre_scores_gemma":[0.75320125,0.00089336536,0.24121153,0.00020868728,0.00013913852,0.00021042355,0.000090265596,0.00012326601,0.0039220382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729055,0.0010095476,0.0001875134,0.00026105283,0.0009229495,0.00032844284],"domain_scores_gemma":[0.9941391,0.002521656,0.0005867112,0.0020470482,0.0004700998,0.00023535677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042070597,0.0005231268,0.000630738,0.0010128939,0.0010173649,0.0021760415,0.0011707408,0.00081931,0.0031602297],"category_scores_gemma":[0.008916902,0.0003837356,0.00063281046,0.00092735933,0.003106218,0.0071131526,0.0037289292,0.0023270606,0.0010085611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014155658,0.000043208107,0.00018662478,0.00008182492,0.000013778909,0.00009999064,0.0003272803,0.019860327,0.014378043,0.9453266,0.0006564251,0.01888437],"study_design_scores_gemma":[0.00007641209,0.00031758664,0.00013872859,0.00008112536,0.00003808344,0.0004515257,0.00017258368,0.35213742,0.03440627,0.59586483,0.016240612,0.000074816766],"about_ca_topic_score_codex":0.00040127325,"about_ca_topic_score_gemma":0.00034313163,"teacher_disagreement_score":0.0042070597,"about_ca_system_score_codex":0.0008499548,"about_ca_system_score_gemma":0.0013132254,"threshold_uncertainty_score":0.022249341},"labels":[],"label_agreement":null},{"id":"W4396758762","doi":"10.1016/j.ffa.2024.102442","title":"Nilpotent linearized polynomials over finite fields, revisited","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Nilpotent; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.013120139164921706,"score_gpt":0.24181829841122354,"score_spread":0.22869815924630182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396758762","genre_codex":"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.32568315,0.03892175,0.102956474,0.031087166,0.0022062105,0.000044862427,0.00030604927,0.0003643936,0.4984299],"genre_scores_gemma":[0.9460207,0.0070240926,0.004913772,0.0011724569,0.0019557234,0.000017640943,0.00005771117,0.000041500385,0.03879647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960595,0.00013233117,0.000013624391,0.000046586283,0.00012310685,0.00007848712],"domain_scores_gemma":[0.99902666,0.00050992245,0.00013588027,0.00010422586,0.00012275866,0.00010054015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000579051,0.00037185522,0.0004410523,0.0016269338,0.0012418292,0.002118757,0.00086000905,0.00092207955,0.0077444776],"category_scores_gemma":[0.0022185345,0.00023055749,0.00029188386,0.0010385119,0.0036668063,0.005815591,0.0016393587,0.0028263882,0.0010122934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005802336,0.0000045240554,0.000048956583,0.000019533474,0.0000012684318,0.00003037917,0.00009856546,0.00019042999,0.00016920017,0.9965509,0.0005445891,0.0023357808],"study_design_scores_gemma":[0.000004969294,0.000012594425,0.00013386937,0.000023244336,0.0000024905648,0.0002024533,0.00014453348,0.0014285182,0.0002769775,0.9921544,0.0056079337,0.000007989014],"about_ca_topic_score_codex":0.00078598567,"about_ca_topic_score_gemma":0.0006732781,"teacher_disagreement_score":0.0077444776,"about_ca_system_score_codex":0.0011670992,"about_ca_system_score_gemma":0.0006581233,"threshold_uncertainty_score":0.025907874},"labels":[],"label_agreement":null},{"id":"W4396773962","doi":"10.1007/s12095-024-00720-3","title":"Additive codes with few weights","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.013635971077980277,"score_gpt":0.2440361152280393,"score_spread":0.23040014415005902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396773962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.16007616,0.0024551263,0.7392402,0.0037939618,0.001504201,0.00015817223,0.00063348585,0.00094286824,0.091195844],"genre_scores_gemma":[0.7956331,0.0022829182,0.12749358,0.0019338555,0.0015416174,0.00038837062,0.0004971426,0.00043240673,0.06979701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997414,0.00072079466,0.00014398785,0.00043705525,0.00095435965,0.0003297308],"domain_scores_gemma":[0.99528414,0.0018840999,0.00041625887,0.0015079571,0.0005787488,0.00032887515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010628074,0.001610684,0.0011448119,0.0020295554,0.0015450461,0.0030744167,0.0012129263,0.0020657168,0.0060328958],"category_scores_gemma":[0.008213585,0.000845751,0.0007522968,0.002022086,0.0025737542,0.0041780043,0.005239319,0.0034721373,0.0041246247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021373552,0.000046124955,0.00030444446,0.00010355771,0.000033755714,0.0001185962,0.000115404415,0.0048637167,0.006999275,0.9456433,0.002721065,0.03883699],"study_design_scores_gemma":[0.000022165332,0.000062068604,0.00018276654,0.00005589987,0.000028804,0.00025401713,0.000032132844,0.017072586,0.00580886,0.9693866,0.007060172,0.000034034507],"about_ca_topic_score_codex":0.00024255614,"about_ca_topic_score_gemma":0.00033745897,"teacher_disagreement_score":0.0060328958,"about_ca_system_score_codex":0.00084000843,"about_ca_system_score_gemma":0.000931564,"threshold_uncertainty_score":0.020182014},"labels":[],"label_agreement":null},{"id":"W4396786710","doi":"10.48550/arxiv.2405.03681","title":"Low complexity among principal fully irreducible elements of Out($F_3$)","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; National Science Foundation","keywords":"Principal (computer security); Computer science; Mathematics; Computer security","score_opus":0.09778688757724818,"score_gpt":0.21011341495262886,"score_spread":0.11232652737538068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396786710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9251944,0.00019311154,0.044697933,0.00062267145,0.000046619483,0.00004614926,0.00074137887,0.000668521,0.027789205],"genre_scores_gemma":[0.9755131,0.00009631332,0.016006637,0.00012339403,0.000051746338,0.00005028243,0.00077194005,0.00020186434,0.0071846377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932146,0.000078255616,0.000034041266,0.00014241849,0.00018069641,0.00024304022],"domain_scores_gemma":[0.9986859,0.0006073908,0.00016276105,0.0003429705,0.000074388205,0.000126591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256943,0.0005006696,0.0005047589,0.00046219653,0.001023643,0.0016426226,0.0005937902,0.0007313169,0.008564544],"category_scores_gemma":[0.0020288667,0.000246215,0.000644311,0.0004064247,0.0013134993,0.002946671,0.0017067947,0.0013147383,0.0013442227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023996383,0.00025452184,0.006967318,0.00049208157,0.00004994655,0.0009828998,0.001430511,0.023026042,0.042251814,0.8328751,0.011485434,0.077784635],"study_design_scores_gemma":[0.00009437543,0.00023846341,0.0019467375,0.00005820826,0.00003591059,0.00049107254,0.0003008452,0.034486443,0.024800852,0.92726403,0.0102175055,0.000065516004],"about_ca_topic_score_codex":0.0005843185,"about_ca_topic_score_gemma":0.0009319129,"teacher_disagreement_score":0.008564544,"about_ca_system_score_codex":0.00084013806,"about_ca_system_score_gemma":0.0005734871,"threshold_uncertainty_score":0.028651237},"labels":[],"label_agreement":null},{"id":"W4396896613","doi":"10.3390/app14104085","title":"Enhancing Field Multiplication in IoT Nodes with Limited Resources: A Low-Complexity Systolic Array Solution","year":2024,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Cryptography; Multiplier (economics); Distributed computing; Multiplication (music); Internet of Things; Field-programmable gate array; Embedded system; Computer security; Mathematics","score_opus":0.023769059919736137,"score_gpt":0.24822382730306583,"score_spread":0.2244547673833297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396896613","genre_codex":"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.04524538,0.0004547289,0.9425803,0.00035892293,0.00012551487,0.000053319705,0.00006306404,0.00066696596,0.010451889],"genre_scores_gemma":[0.44638705,0.0005997089,0.54387224,0.00024801702,0.0001297507,0.00009977709,0.00016076684,0.000050342755,0.008452341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999087,0.000018699242,0.000008409613,0.000016071479,0.000036868518,0.000011240916],"domain_scores_gemma":[0.9997924,0.000056476678,0.000040325165,0.000027419057,0.000068061156,0.000015347465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015445465,0.00041745105,0.00021620387,0.0002917086,0.00027088355,0.00046725987,0.00072575134,0.00033291138,0.0033650405],"category_scores_gemma":[0.00050073996,0.00015211554,0.00021482586,0.00043314626,0.00022043836,0.0008442401,0.00038489263,0.00036217947,0.0011349116],"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.00046610067,0.00017726989,0.0011841295,0.0003751025,0.000072519775,0.0006179702,0.00019440272,0.16098176,0.35057434,0.094666585,0.0065697297,0.38412005],"study_design_scores_gemma":[0.00014080526,0.0013092215,0.0003915071,0.00007714182,0.00007582029,0.0010727689,0.000096436845,0.80610293,0.120084055,0.02930076,0.041305184,0.000043398482],"about_ca_topic_score_codex":0.00025372906,"about_ca_topic_score_gemma":0.00067865406,"teacher_disagreement_score":0.0033650405,"about_ca_system_score_codex":0.00026513118,"about_ca_system_score_gemma":0.00053670316,"threshold_uncertainty_score":0.011257172},"labels":[],"label_agreement":null},{"id":"W4397028602","doi":"10.48550/arxiv.2405.10159","title":"Artin-Schreier towers of finite fields","year":2024,"lang":"en","type":"preprint","venue":"Conicet","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo para la Investigación Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Finite field; Mathematics; Pure mathematics; Discrete mathematics","score_opus":0.01942421436895959,"score_gpt":0.2554171752170396,"score_spread":0.23599296084808002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397028602","genre_codex":"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.6707626,0.0013914888,0.061333846,0.0013640559,0.00037172704,0.000078009005,0.00053330883,0.0006787835,0.26348615],"genre_scores_gemma":[0.9465051,0.0004414508,0.015529633,0.00021822129,0.00034931177,0.000060218852,0.0003902377,0.00010753215,0.03639832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999393,0.00012941814,0.000025536614,0.000094861665,0.00016950625,0.00018767014],"domain_scores_gemma":[0.9992642,0.00022931631,0.00010379767,0.00009596365,0.000078110286,0.00022859924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010696128,0.0007809354,0.00077532005,0.0022671453,0.002324457,0.0021144573,0.0009543442,0.00057740393,0.011284142],"category_scores_gemma":[0.0017410946,0.00048075157,0.0009891536,0.00083669083,0.0022867585,0.0044004116,0.0018421016,0.0016274962,0.0012307409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000881681,0.000024238714,0.00052618945,0.000054317446,0.000009653317,0.0002722973,0.00050821016,0.0025902262,0.0015672968,0.988976,0.0015799034,0.0038033412],"study_design_scores_gemma":[0.000056315483,0.0000629159,0.0011259123,0.00004143448,0.000018439627,0.00023640771,0.00021768932,0.016154148,0.0018110664,0.9722421,0.007996876,0.000036542966],"about_ca_topic_score_codex":0.0021049608,"about_ca_topic_score_gemma":0.0032790953,"teacher_disagreement_score":0.011284142,"about_ca_system_score_codex":0.0022496788,"about_ca_system_score_gemma":0.00047776318,"threshold_uncertainty_score":0.03774923},"labels":[],"label_agreement":null},{"id":"W4398262841","doi":"10.1007/jhep05(2024)256","title":"Basis decompositions of genus-one string integrals","year":2024,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Knut och Alice Wallenbergs Stiftelse; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Genus; Basis (linear algebra); String (physics); Mathematics; Pure mathematics; Zoology; Biology; Mathematical physics; Geometry","score_opus":0.015432382776057624,"score_gpt":0.23863621922833292,"score_spread":0.2232038364522753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398262841","genre_codex":"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.780559,0.0003552071,0.16617474,0.00034824508,0.00014643255,0.00007238409,0.00015190706,0.00023132774,0.051960714],"genre_scores_gemma":[0.9508301,0.00043778485,0.03440541,0.00012812167,0.00008992812,0.00010892257,0.00024578124,0.0002219881,0.013532068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996991,0.0000649252,0.000018781457,0.000030641517,0.00011468536,0.00007182085],"domain_scores_gemma":[0.9996271,0.00007773418,0.000036700574,0.00009184971,0.0000874323,0.00007915237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005898429,0.0005684296,0.00049118244,0.0022426376,0.0009436462,0.002054858,0.0008359226,0.00075255136,0.004510165],"category_scores_gemma":[0.0011917476,0.00024430268,0.00064387545,0.00072786934,0.001770587,0.0018984835,0.0012589439,0.00164079,0.0009134258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003268353,0.000046146855,0.000383834,0.000026572436,0.000004816915,0.00011658047,0.00022258889,0.0034891008,0.0054101306,0.98226154,0.00046299995,0.007542943],"study_design_scores_gemma":[0.000010457079,0.00004355384,0.00041201137,0.000027298453,0.00000768782,0.00015326084,0.00016553156,0.05689881,0.003093283,0.9376926,0.0014756664,0.00001978979],"about_ca_topic_score_codex":0.0004230177,"about_ca_topic_score_gemma":0.0005575556,"teacher_disagreement_score":0.004510165,"about_ca_system_score_codex":0.0005771074,"about_ca_system_score_gemma":0.0005594027,"threshold_uncertainty_score":0.015088022},"labels":[],"label_agreement":null},{"id":"W4399051511","doi":"10.1112/jlms.12938","title":"Blocking sets, minimal codes and trifferent codes","year":2024,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Blocking (statistics); Block code; Computer science; Algorithm; Computer network; Decoding methods","score_opus":0.0169197979942907,"score_gpt":0.2593375928641306,"score_spread":0.24241779486983991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399051511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.48321125,0.0019940427,0.47210658,0.001156215,0.00012991363,0.00009657686,0.0015995393,0.0010021791,0.038703766],"genre_scores_gemma":[0.9347031,0.00057060766,0.058874834,0.0003389353,0.00009602118,0.00015222408,0.0010902,0.00011582088,0.0040582134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998135,0.00022961992,0.00011961202,0.00028906896,0.0008054259,0.00042131994],"domain_scores_gemma":[0.9896918,0.0057201907,0.0011741535,0.0015583605,0.0012559739,0.0005994539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725421,0.0005401516,0.00061151077,0.0011403337,0.0009282995,0.0015426537,0.0012606689,0.00066568423,0.0039551402],"category_scores_gemma":[0.006772426,0.00036694392,0.0005686748,0.0010695517,0.0019462475,0.0024025205,0.0022320983,0.0018658866,0.0008030778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005055416,0.00010652995,0.004354124,0.000357592,0.00005491374,0.00017961499,0.00048932515,0.06460935,0.039710045,0.83951604,0.0058938777,0.0442231],"study_design_scores_gemma":[0.00007341695,0.00035662187,0.0032548518,0.000137291,0.000055378558,0.0005901106,0.00029663782,0.21504697,0.057401862,0.70261306,0.020052182,0.00012166128],"about_ca_topic_score_codex":0.0017277654,"about_ca_topic_score_gemma":0.0013477061,"teacher_disagreement_score":0.0039551402,"about_ca_system_score_codex":0.0014601279,"about_ca_system_score_gemma":0.00081879174,"threshold_uncertainty_score":0.013231218},"labels":[],"label_agreement":null},{"id":"W4399695835","doi":"10.48550/arxiv.2406.09302","title":"The reflection complexity of sequences over finite alphabets","year":2024,"lang":"en","type":"preprint","venue":"Open Repository and Bibliography (University of Liège)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Fonds De La Recherche Scientifique - FNRS","keywords":"Reflection (computer programming); Computer science; Mathematics; Theoretical computer science; Programming language","score_opus":0.043960474005396315,"score_gpt":0.26988739621173546,"score_spread":0.22592692220633914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399695835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8825265,0.00031597068,0.10347896,0.00033684788,0.000024260658,0.000041750933,0.00027709673,0.0003167083,0.012681834],"genre_scores_gemma":[0.9805252,0.00021774424,0.015750563,0.000040006293,0.000044075936,0.00007079693,0.0003454741,0.00008075137,0.0029253352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991093,0.00017237409,0.00006846825,0.00017571957,0.00032404863,0.00015001379],"domain_scores_gemma":[0.9941293,0.0041877474,0.00057128066,0.00041729133,0.000429197,0.00026505813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007049432,0.0005688114,0.0005299349,0.0015689707,0.000648869,0.0020416696,0.00081692875,0.00056021183,0.00344843],"category_scores_gemma":[0.0078055193,0.00025864778,0.0007093543,0.0012053117,0.0024156063,0.0035142275,0.00095394655,0.0011096209,0.00040676384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031829605,0.00008132486,0.008259043,0.0002210365,0.000042485168,0.00031839393,0.0013029717,0.053800974,0.026216181,0.8677744,0.001111007,0.040553924],"study_design_scores_gemma":[0.000023522052,0.00017512117,0.0043339953,0.000051269843,0.000031659565,0.0003573143,0.00034577405,0.30868843,0.023353767,0.65911514,0.0034513576,0.00007256684],"about_ca_topic_score_codex":0.0011353289,"about_ca_topic_score_gemma":0.0007651257,"teacher_disagreement_score":0.00344843,"about_ca_system_score_codex":0.0015242805,"about_ca_system_score_gemma":0.0007597791,"threshold_uncertainty_score":0.011536121},"labels":[],"label_agreement":null},{"id":"W4400035848","doi":"10.1109/tit.2024.3417894","title":"A New Version of q-Ary Varshamov-Tenengolts Codes With More Efficient Encoders: The Differential VT Codes and The Differential Shifted VT Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Advanced Education and Technology","keywords":"Differential coding; Block code; Luby transform code; Encoder; Turbo code; Linear code; Computer science; Differential (mechanical device); Raptor code; Concatenated error correction code; Algorithm; Mathematics; Discrete mathematics; Decoding methods; Physics","score_opus":0.005042429923905955,"score_gpt":0.20200954126550688,"score_spread":0.19696711134160091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400035848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.061077245,0.002673767,0.9135185,0.00063549797,0.0006775464,0.00012834174,0.00042858944,0.00041375126,0.02044681],"genre_scores_gemma":[0.5072746,0.002471945,0.46236974,0.0012188809,0.00047404753,0.00028388345,0.0010438653,0.0002175657,0.024645446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909997,0.0001839786,0.00007249436,0.00023971546,0.0002809529,0.00012281474],"domain_scores_gemma":[0.99822754,0.00050543895,0.00019368902,0.0004837631,0.00047131904,0.00011821988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063078006,0.00072050805,0.00053776434,0.0011523378,0.000585828,0.0012147588,0.0011051601,0.0010092028,0.0023294585],"category_scores_gemma":[0.0033066217,0.00030281398,0.0006153815,0.0013577376,0.0011325355,0.0014650975,0.0013556011,0.0017771645,0.0010049653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002841901,0.00009222422,0.0010042907,0.00025947636,0.000050256956,0.00042191867,0.0003932448,0.04759859,0.036405623,0.7182903,0.004950878,0.190249],"study_design_scores_gemma":[0.00016187021,0.00048101458,0.00095496915,0.00026012986,0.0000948216,0.0022606307,0.0001281426,0.4347937,0.05324316,0.423857,0.08356744,0.00019712823],"about_ca_topic_score_codex":0.0015957649,"about_ca_topic_score_gemma":0.0016883606,"teacher_disagreement_score":0.0023294585,"about_ca_system_score_codex":0.0009944197,"about_ca_system_score_gemma":0.0015255205,"threshold_uncertainty_score":0.0077928305},"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":"W4400484767","doi":"10.61091/jcmcc120-040","title":"The Domination Number of C n □ P m for n ≡ 2 ( mod 5 )","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics","score_opus":0.011969324701241036,"score_gpt":0.2727788284367423,"score_spread":0.26080950373550127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484767","genre_codex":"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.565669,0.0007194434,0.36060086,0.001290094,0.000099608194,0.00009936228,0.0011827283,0.00054943416,0.06978942],"genre_scores_gemma":[0.9170705,0.00031789893,0.07669487,0.00014510873,0.000036267425,0.00011900367,0.00056012574,0.000093768795,0.00496256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999511,0.000064915344,0.000017765733,0.00014124575,0.00011654359,0.00014855078],"domain_scores_gemma":[0.9983771,0.0009155655,0.00019453728,0.00021737248,0.0001546269,0.00014077411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047849584,0.0003791871,0.00041792967,0.0011284534,0.0009066456,0.0014011086,0.00087959785,0.00044561495,0.0044149207],"category_scores_gemma":[0.0031551023,0.000226323,0.00034615773,0.0008678304,0.001067341,0.0021024845,0.0011215631,0.0010599504,0.00036521084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006514164,0.00009236415,0.010848392,0.0004099735,0.00004924665,0.00045303392,0.0006119605,0.10009065,0.0394144,0.72937834,0.011161045,0.10683922],"study_design_scores_gemma":[0.000047581245,0.000115279625,0.005272018,0.00009406893,0.000036197627,0.0007406293,0.00021849324,0.32293457,0.02829848,0.6209815,0.021204142,0.00005697456],"about_ca_topic_score_codex":0.0016352299,"about_ca_topic_score_gemma":0.0030046145,"teacher_disagreement_score":0.0044149207,"about_ca_system_score_codex":0.0011216983,"about_ca_system_score_gemma":0.00068440445,"threshold_uncertainty_score":0.014769375},"labels":[],"label_agreement":null},{"id":"W4400499032","doi":"10.1007/978-3-031-64171-8_23","title":"SmmPack: Obfuscation for SMM Modules with TPM Sealed Key","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Obfuscation; Key (lock); Programming language; Computer security","score_opus":0.013910048823303605,"score_gpt":0.23443216042550555,"score_spread":0.22052211160220195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499032","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061322488,0.0021506206,0.8532625,0.0012562069,0.00091120426,0.00031989938,0.0010157678,0.01486134,0.0649],"genre_scores_gemma":[0.71345437,0.0015960649,0.20949157,0.0006843307,0.00043675076,0.00042174067,0.0017484882,0.002931427,0.06923525],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906725,0.00016983006,0.00005267546,0.00013344435,0.00037204157,0.00020480256],"domain_scores_gemma":[0.9988943,0.00033386072,0.00007196473,0.0005818954,0.000078548386,0.00003952909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009090612,0.0010151356,0.00066309003,0.00079016224,0.0007843625,0.0013820509,0.0010069376,0.0012751439,0.01601993],"category_scores_gemma":[0.002737986,0.00064027944,0.0009156334,0.00085797184,0.0011267838,0.0035681773,0.0039881677,0.002860953,0.0076855267],"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.0009851924,0.00018235415,0.0009160702,0.0010187046,0.000106720334,0.0006468028,0.00057531125,0.011079375,0.046943117,0.43891147,0.059362546,0.43927243],"study_design_scores_gemma":[0.00014676443,0.0004710578,0.001287995,0.00043203036,0.00015707385,0.0021766145,0.00014684607,0.08047437,0.1859792,0.57127714,0.15732028,0.00013063499],"about_ca_topic_score_codex":0.00016096796,"about_ca_topic_score_gemma":0.0001829204,"teacher_disagreement_score":0.01601993,"about_ca_system_score_codex":0.000663439,"about_ca_system_score_gemma":0.0006750781,"threshold_uncertainty_score":0.053592026},"labels":[],"label_agreement":null},{"id":"W4400543041","doi":"10.1007/s00493-024-00112-4","title":"Unavoidable Flats in Matroids Representable over Prime Fields","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Prime (order theory); Graphic matroid; Discrete mathematics","score_opus":0.007505440034048896,"score_gpt":0.24720173998075382,"score_spread":0.2396962999467049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400543041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7814413,0.0008004139,0.12547462,0.003165481,0.00026964216,0.00010596013,0.00101737,0.0008854774,0.08683975],"genre_scores_gemma":[0.9710542,0.00041822804,0.0110099185,0.00033550232,0.00021131917,0.00006559811,0.0006581264,0.00016518374,0.016081842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982622,0.00041840997,0.000113226044,0.00033048238,0.00041529845,0.0004604648],"domain_scores_gemma":[0.99384296,0.0032710882,0.0008431574,0.0008081942,0.00042052203,0.0008141295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348982,0.0009501396,0.0012210523,0.0027208456,0.0034563162,0.0051763696,0.0017686532,0.0019097624,0.010316063],"category_scores_gemma":[0.005961555,0.0014197857,0.0011606573,0.0030844545,0.0036049972,0.009174086,0.0030348182,0.004975273,0.0011062499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015468073,0.00004993876,0.0005878262,0.000058929567,0.000012632568,0.00022284604,0.00043834542,0.0018886536,0.00076599646,0.9902108,0.001517094,0.0040923427],"study_design_scores_gemma":[0.000024311244,0.000025611564,0.00026503013,0.000016263684,0.000013581899,0.00016033277,0.000139263,0.0045809634,0.00053688517,0.9927852,0.0014403661,0.000012271066],"about_ca_topic_score_codex":0.0013794381,"about_ca_topic_score_gemma":0.0019412182,"teacher_disagreement_score":0.010316063,"about_ca_system_score_codex":0.0020948967,"about_ca_system_score_gemma":0.00077660073,"threshold_uncertainty_score":0.03451073},"labels":[],"label_agreement":null},{"id":"W4400596744","doi":"10.55016/ojs/cdm.v15i1.62718","title":"An elementary, geometric proof of the non-existence of a projective plane of order 6","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Narodowym Centrum Nauki","keywords":"Projective plane; Mathematics; Elementary proof; Projective test; Order (exchange); Combinatorics; Plane (geometry); Collineation; Blocking set; Binary number; Line at infinity; Pure mathematics; Discrete mathematics; Projective space; Geometry; Arithmetic","score_opus":0.014683256317517292,"score_gpt":0.2749188379889225,"score_spread":0.26023558167140526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.086930886,0.002324456,0.6811306,0.009372746,0.0015628128,0.00015775241,0.00076044566,0.00054425024,0.21721609],"genre_scores_gemma":[0.76683503,0.0025491554,0.20049022,0.0023060795,0.0013807123,0.0002824623,0.0007511489,0.00019616468,0.025208898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923193,0.00015419802,0.00003400642,0.00013608005,0.00034045344,0.00010335654],"domain_scores_gemma":[0.99702257,0.0018808377,0.00022009603,0.00037122561,0.00033547386,0.00016974325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977079,0.00091992924,0.0006367708,0.001004713,0.0013801121,0.0018202412,0.001543514,0.001122678,0.009909781],"category_scores_gemma":[0.0048921006,0.00054794416,0.00089686195,0.00053799764,0.0060565174,0.0047751134,0.005365774,0.004606762,0.0015396607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014720409,0.000018192299,0.00013168105,0.00008072064,0.0000071667832,0.00018049065,0.000102166836,0.0006549155,0.0016512788,0.99076414,0.0023707983,0.004023784],"study_design_scores_gemma":[0.0000330618,0.00006215147,0.0004661961,0.0000499283,0.000013293463,0.0006336543,0.00009507239,0.0025963983,0.0053188764,0.95506066,0.035639204,0.000031523276],"about_ca_topic_score_codex":0.00039296245,"about_ca_topic_score_gemma":0.00041367757,"teacher_disagreement_score":0.009909781,"about_ca_system_score_codex":0.0007590168,"about_ca_system_score_gemma":0.00067784055,"threshold_uncertainty_score":0.033151507},"labels":[],"label_agreement":null},{"id":"W4400956666","doi":"10.1016/j.disc.2024.114179","title":"m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; American Heart Association","keywords":"Mathematics; Association scheme; Combinatorics; Relation (database); Multivariate statistics; Discrete mathematics; Polynomial; Statistics; Computer science","score_opus":0.010421698671277943,"score_gpt":0.23907503008408365,"score_spread":0.2286533314128057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400956666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.33553597,0.00074110815,0.6211408,0.0012579935,0.00012808705,0.000097473334,0.0005794484,0.00034917728,0.040170018],"genre_scores_gemma":[0.90722215,0.00068084785,0.0810274,0.00030454464,0.0001815949,0.00008543336,0.0003613451,0.000110854715,0.010025879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984719,0.00039099948,0.00008308799,0.0004352067,0.0003865327,0.00023229448],"domain_scores_gemma":[0.99430674,0.0020070954,0.0011560997,0.0012627075,0.0007141118,0.0005531891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012658879,0.00036882816,0.0004803199,0.0017558626,0.0014681184,0.0021646617,0.0010888708,0.0008043545,0.0043257126],"category_scores_gemma":[0.0062220707,0.00036144824,0.00060776796,0.002625245,0.0026294508,0.0048137233,0.00233374,0.0020586692,0.0007251253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028751921,0.000010636213,0.00041404206,0.000024272947,0.000004995048,0.000054240467,0.00015686725,0.002641247,0.00077944394,0.98904955,0.00056544127,0.006270494],"study_design_scores_gemma":[0.000013693917,0.000030461415,0.0006419569,0.000017850596,0.000013624759,0.00028257837,0.00014429953,0.023195734,0.0010813153,0.9635965,0.010956016,0.000025973854],"about_ca_topic_score_codex":0.001060501,"about_ca_topic_score_gemma":0.00071893324,"teacher_disagreement_score":0.0043257126,"about_ca_system_score_codex":0.0012957428,"about_ca_system_score_gemma":0.0006334816,"threshold_uncertainty_score":0.0144709945},"labels":[],"label_agreement":null},{"id":"W4401159343","doi":"10.1007/978-981-96-0944-4_11","title":"On the Semidirect Discrete Logarithm Problem in Finite Groups","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa; University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Computer science; Algebra over a field; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.012888119266516262,"score_gpt":0.22533632136950263,"score_spread":0.21244820210298637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401159343","genre_codex":"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.13232404,0.02178829,0.1958088,0.033595838,0.004561644,0.000113641356,0.00060322566,0.00041658487,0.6107879],"genre_scores_gemma":[0.84557235,0.014208929,0.03164005,0.0029808185,0.0064452463,0.0001897502,0.0007419561,0.0002668552,0.097954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988788,0.00042195973,0.000054101103,0.00013483234,0.00037489663,0.00013550214],"domain_scores_gemma":[0.9976174,0.0017629407,0.00011209667,0.00024779962,0.00012078009,0.00013885724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015669118,0.0009168337,0.0014839486,0.001393925,0.0017985567,0.003956948,0.00126444,0.0017001607,0.00844417],"category_scores_gemma":[0.0048631737,0.00055428204,0.000837779,0.002651547,0.0056896852,0.011670988,0.0037570356,0.00623597,0.0016813187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042149277,0.00003054723,0.00007244338,0.000067084344,0.000005407459,0.000054833217,0.00016378982,0.0009871856,0.00020220985,0.98341745,0.004999757,0.009957005],"study_design_scores_gemma":[0.000008622589,0.000007135218,0.000034489665,0.000016909506,0.00000168046,0.00005203296,0.00003220617,0.0010630237,0.00009503141,0.9951462,0.0035380642,0.000004610623],"about_ca_topic_score_codex":0.0005129143,"about_ca_topic_score_gemma":0.00040554383,"teacher_disagreement_score":0.00844417,"about_ca_system_score_codex":0.0021029105,"about_ca_system_score_gemma":0.001079051,"threshold_uncertainty_score":0.028248549},"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":"W4401541962","doi":"10.1117/12.3026738","title":"Circuit implementation of Shor's algorithm for the factorization of small integers in Qiskit","year":2024,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Factorization; Algorithm; Parallel computing","score_opus":0.0289716943697705,"score_gpt":0.2877319611699004,"score_spread":0.2587602668001299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401541962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.17876232,0.00026282918,0.7688427,0.00094151654,0.00026816182,0.0003584205,0.00048004338,0.004013752,0.046070192],"genre_scores_gemma":[0.7525004,0.00012092816,0.24034125,0.00019607757,0.000027615566,0.0002196176,0.00024810506,0.00014248602,0.0062035946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957746,0.000082561004,0.000024363015,0.000058374033,0.0001626257,0.000094644834],"domain_scores_gemma":[0.99971706,0.00010108348,0.000022486025,0.00007915383,0.00006105147,0.00001919083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048609945,0.0002576404,0.00040746707,0.0003186472,0.00061836,0.0007304115,0.0008831207,0.0005133428,0.007845237],"category_scores_gemma":[0.0012849137,0.00019194855,0.0003290595,0.00044440915,0.000779372,0.0010003395,0.00058617623,0.00060501235,0.0011052312],"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.001105078,0.0003169497,0.0017690364,0.0003745389,0.000058974398,0.00049259805,0.0005890144,0.09151708,0.08834943,0.67704314,0.013641201,0.12474297],"study_design_scores_gemma":[0.00041247232,0.0006890496,0.00081658625,0.00009182864,0.000059660593,0.0003371351,0.00016278467,0.6791878,0.1424275,0.13281313,0.04291122,0.0000908415],"about_ca_topic_score_codex":0.0013175777,"about_ca_topic_score_gemma":0.0020703075,"teacher_disagreement_score":0.007845237,"about_ca_system_score_codex":0.00077631336,"about_ca_system_score_gemma":0.0013452217,"threshold_uncertainty_score":0.026244879},"labels":[],"label_agreement":null},{"id":"W4401693525","doi":"10.1109/isit57864.2024.10619580","title":"Unequal Message Protection: One-Shot analysis via Poisson Matching Lemma","year":2024,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Qualcomm (Canada); University of Toronto","funders":"","keywords":"Poisson distribution; Shot (pellet); Lemma (botany); Computer science; Matching (statistics); Mathematics; Statistics","score_opus":0.04926335140884894,"score_gpt":0.27585601238633956,"score_spread":0.22659266097749062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401693525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.02179153,0.0003959533,0.9637739,0.00045122555,0.000054833472,0.00006669896,0.000088747205,0.00013329014,0.013243956],"genre_scores_gemma":[0.884745,0.0011568939,0.10283864,0.00062611233,0.00021434127,0.00030876286,0.00016840661,0.000176528,0.0097653475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966151,0.0011446844,0.00009331924,0.00030724375,0.0013295083,0.00051012833],"domain_scores_gemma":[0.98764616,0.009421623,0.0007545666,0.0008414853,0.0010513001,0.0002848776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004174516,0.0008742619,0.0013851798,0.0016472106,0.0011228411,0.0020579433,0.0027833765,0.0016300994,0.004807222],"category_scores_gemma":[0.019240934,0.00076794747,0.0014193808,0.0014024061,0.0033262118,0.0047044414,0.003387719,0.003166715,0.0007910866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117438125,0.000049375565,0.0004461393,0.000098735356,0.000042094027,0.00026722078,0.00027105332,0.076761626,0.0047297813,0.9047136,0.0015154978,0.0109874],"study_design_scores_gemma":[0.000016912187,0.00005221526,0.00017497005,0.000028469387,0.000018151743,0.00020138563,0.000063299216,0.60261714,0.0032944179,0.39247125,0.0010281388,0.000033616772],"about_ca_topic_score_codex":0.0009211794,"about_ca_topic_score_gemma":0.00040190184,"teacher_disagreement_score":0.004807222,"about_ca_system_score_codex":0.002496932,"about_ca_system_score_gemma":0.001307992,"threshold_uncertainty_score":0.022077203},"labels":[],"label_agreement":null},{"id":"W4401989792","doi":"10.1109/ojcoms.2024.3452040","title":"A Simpler Proof on the Existence of Good Nested Lattice Codes Over Imaginary Quadratic Integers for AWGN Channel","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Science and Technology Council","keywords":"Quadratic equation; Mathematics; Lattice (music); Additive white Gaussian noise; Channel (broadcasting); Combinatorics; Discrete mathematics; Computer science; Physics; Telecommunications","score_opus":0.08755874170739679,"score_gpt":0.35183127727660596,"score_spread":0.26427253556920915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401989792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.053363975,0.00048642926,0.9059068,0.0016011093,0.00034781604,0.00008578636,0.00023895976,0.00020104705,0.03776816],"genre_scores_gemma":[0.69758046,0.0007240698,0.29344434,0.0008224716,0.00034670348,0.00015732528,0.00019203054,0.00012406893,0.0066086026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998706,0.00031989897,0.000052273448,0.0001712335,0.0006074091,0.00014316678],"domain_scores_gemma":[0.9946843,0.0033138401,0.00041860994,0.0007212191,0.00058814534,0.00027394894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001467915,0.0005479262,0.00047394808,0.0006631871,0.00066949177,0.00095253973,0.0005328686,0.0006811636,0.004155139],"category_scores_gemma":[0.007666433,0.00023807683,0.0004559878,0.00049300806,0.0024757737,0.0024310146,0.0019930985,0.0023884587,0.0006724653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043199863,0.000031950174,0.00017675325,0.00008671709,0.0000067099195,0.00013444448,0.0001605927,0.009000843,0.008469625,0.9711438,0.0013838842,0.009361592],"study_design_scores_gemma":[0.00005880195,0.00021415768,0.00037499022,0.00009073267,0.000013896536,0.000721811,0.00014574121,0.10343774,0.02050846,0.85230595,0.022037005,0.00009071346],"about_ca_topic_score_codex":0.0003299608,"about_ca_topic_score_gemma":0.0003008701,"teacher_disagreement_score":0.004155139,"about_ca_system_score_codex":0.00046415685,"about_ca_system_score_gemma":0.0008365099,"threshold_uncertainty_score":0.01390028},"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":"W4402766525","doi":"10.1080/00150517.2019.12427663","title":"A Class of Exponential Sequences with Shift-Invariant Discriminators","year":2019,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Exponential function; Invariant (physics); Class (philosophy); Pure mathematics; Artificial intelligence; Computer science; Mathematical analysis; Mathematical physics","score_opus":0.007380506141431615,"score_gpt":0.20403577098095924,"score_spread":0.1966552648395276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402766525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8837413,0.00056428,0.093571045,0.00020687278,0.000084356936,0.000045184028,0.00028791977,0.00031629734,0.02118268],"genre_scores_gemma":[0.9811716,0.00017420636,0.014288342,0.00006556469,0.00007364884,0.00003361682,0.0002966585,0.000041050902,0.0038552242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996573,0.000035523364,0.000017127382,0.00007170752,0.00012021824,0.00009805258],"domain_scores_gemma":[0.99884915,0.0004312277,0.00020185484,0.00018392714,0.00015018886,0.00018371257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045737327,0.00037018504,0.00036693958,0.0012617254,0.0006921006,0.0011868197,0.0006334233,0.0006586343,0.0033934354],"category_scores_gemma":[0.00472185,0.00019657772,0.00039194105,0.00084843073,0.0011810834,0.0018725725,0.0012132267,0.0009077628,0.00042133767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024384927,0.00006837412,0.0074468623,0.00007006542,0.000016694452,0.0005413436,0.00030251942,0.023055691,0.010208239,0.92170095,0.001911668,0.034433775],"study_design_scores_gemma":[0.00012654183,0.0001766351,0.0037674503,0.000049566486,0.000019466352,0.0016345888,0.00020688426,0.21597835,0.009797698,0.7540926,0.014084319,0.00006595785],"about_ca_topic_score_codex":0.0006250175,"about_ca_topic_score_gemma":0.00051151356,"teacher_disagreement_score":0.0033934354,"about_ca_system_score_codex":0.00089949486,"about_ca_system_score_gemma":0.0006107067,"threshold_uncertainty_score":0.011352181},"labels":[],"label_agreement":null},{"id":"W4402768742","doi":"10.3934/amc.2024039","title":"An RSA cryptosystem based on Lehmer sequences in Some classes of groups","year":2024,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cryptosystem; Pure mathematics; Arithmetic; Algebra over a field; Cryptography; Algorithm","score_opus":0.02368202647637344,"score_gpt":0.3274646391995649,"score_spread":0.30378261272319146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402768742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4522368,0.0022729782,0.48886976,0.0009124542,0.00032869223,0.00025904994,0.00013466776,0.00064420025,0.054341406],"genre_scores_gemma":[0.93387395,0.0006208894,0.059562873,0.00011746995,0.000109597146,0.00005708509,0.00009938181,0.00003214278,0.005526554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966824,0.00006389893,0.000023339413,0.00005744745,0.00011302946,0.00007404584],"domain_scores_gemma":[0.9996295,0.00013465704,0.000069546724,0.000083158935,0.000048405156,0.000034746827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030583984,0.00028611225,0.00038169176,0.00078081526,0.00086681684,0.0009163041,0.00026240764,0.00045089956,0.0022779885],"category_scores_gemma":[0.0010183641,0.00011254393,0.00030819964,0.00045989163,0.00088007865,0.0024867519,0.0007361293,0.0006361021,0.00039494384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004363724,0.00007872184,0.0012195904,0.000201679,0.000030989384,0.0003727973,0.0007417432,0.015518099,0.039729696,0.821219,0.0013567802,0.11909446],"study_design_scores_gemma":[0.00014550315,0.0005490287,0.0013979258,0.00011085037,0.00005683685,0.0015657548,0.00035227972,0.17342314,0.096951835,0.6784904,0.046831593,0.00012492671],"about_ca_topic_score_codex":0.00020861579,"about_ca_topic_score_gemma":0.00021978254,"teacher_disagreement_score":0.0022779885,"about_ca_system_score_codex":0.0005127518,"about_ca_system_score_gemma":0.00059699954,"threshold_uncertainty_score":0.0076206923},"labels":[],"label_agreement":null},{"id":"W4402811173","doi":"10.1109/tit.2024.3467194","title":"The Mean and Variance of the Reciprocal Merit Factor of Four Classes of Binary Sequences","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reciprocal; Binary number; Variance (accounting); Mathematics; Statistics; Factor (programming language); Combinatorics; Computer science; Arithmetic; Linguistics","score_opus":0.013838930947939402,"score_gpt":0.22778885495100865,"score_spread":0.21394992400306925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402811173","genre_codex":"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.5832748,0.0018003867,0.39775425,0.0009478545,0.00016542443,0.00009062774,0.0006488242,0.0005415633,0.014776326],"genre_scores_gemma":[0.96813804,0.0005999555,0.027547946,0.000088221015,0.00018250015,0.00012755822,0.00051993894,0.00010558502,0.0026903402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827015,0.00031575662,0.00010410771,0.0005104542,0.00059444364,0.0002050373],"domain_scores_gemma":[0.9795759,0.014036473,0.0020705198,0.0018800392,0.001841641,0.0005953707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029882651,0.0005137155,0.00069169054,0.0022615422,0.0005342771,0.0017829438,0.0010024958,0.0011860416,0.002604191],"category_scores_gemma":[0.031071912,0.00021901166,0.00042755483,0.0010703793,0.0026738618,0.0024695552,0.0009627728,0.0010416037,0.0007048136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011695011,0.00014581929,0.023203354,0.0004907016,0.00013274819,0.00055301597,0.00087332685,0.105050005,0.03874509,0.66203517,0.004556636,0.1630447],"study_design_scores_gemma":[0.00006385552,0.00029472087,0.019714033,0.0001368718,0.00006993775,0.001717286,0.0002678381,0.5474505,0.019188799,0.40572262,0.0051198034,0.00025374856],"about_ca_topic_score_codex":0.00041994682,"about_ca_topic_score_gemma":0.00028506725,"teacher_disagreement_score":0.0029882651,"about_ca_system_score_codex":0.0011495453,"about_ca_system_score_gemma":0.00073896634,"threshold_uncertainty_score":0.015803635},"labels":[],"label_agreement":null},{"id":"W4402955314","doi":"10.48550/arxiv.2409.01929","title":"On the gcd graphs over polynomial rings","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Foundation for Science and Technology Development","keywords":"Mathematics; Combinatorics; Polynomial; Polynomial ring; Discrete mathematics","score_opus":0.04367791074753419,"score_gpt":0.1731613111773378,"score_spread":0.1294834004298036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402955314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.65104,0.004877382,0.20551164,0.004624593,0.0005428223,0.0000827247,0.00053507724,0.0003297152,0.13245606],"genre_scores_gemma":[0.967034,0.0024995527,0.01926072,0.00048180827,0.00053613546,0.000053410127,0.00025397987,0.00010972453,0.009770581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995858,0.00015172464,0.000015570065,0.00008066655,0.000085390464,0.00008071387],"domain_scores_gemma":[0.9989203,0.0005753972,0.00014205807,0.00008796628,0.00013129255,0.00014292436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054331066,0.0005022666,0.00042228462,0.0021072477,0.0014261649,0.0019116729,0.00047460108,0.00080315437,0.0033102587],"category_scores_gemma":[0.0022083698,0.0002690671,0.00039254644,0.0015789917,0.0033468127,0.004101898,0.0014589055,0.0013258518,0.00038650772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008683464,0.000007839247,0.00021961352,0.000015774938,0.0000014511496,0.000053026837,0.00012737447,0.001428361,0.00029989195,0.9936866,0.00077308016,0.003378263],"study_design_scores_gemma":[0.000005319724,0.000010701895,0.00028629255,0.000025153138,0.0000033231618,0.00014134514,0.00014426769,0.008832311,0.000319458,0.9859751,0.00424715,0.000009514578],"about_ca_topic_score_codex":0.0017891319,"about_ca_topic_score_gemma":0.0012558654,"teacher_disagreement_score":0.0033102587,"about_ca_system_score_codex":0.0012834301,"about_ca_system_score_gemma":0.0005759019,"threshold_uncertainty_score":0.011073947},"labels":[],"label_agreement":null},{"id":"W4403165328","doi":"10.61091/jcmcc122-29","title":"On Negacyclic Codes of Length 8 p s over F p m + u F p m","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Biology; Mathematics; Physics; Horticulture","score_opus":0.011746528716764532,"score_gpt":0.25635946195902387,"score_spread":0.24461293324225933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.79026407,0.0019199697,0.14130017,0.0025779763,0.00078169757,0.000090397414,0.0005744634,0.00023928192,0.06225196],"genre_scores_gemma":[0.93482465,0.0009737778,0.051732615,0.00067735056,0.00057245255,0.000071248236,0.000524248,0.0000979201,0.0105257165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991242,0.00018696398,0.00005709153,0.00016551885,0.00028389986,0.00018223925],"domain_scores_gemma":[0.99719524,0.0013238649,0.00038509438,0.00045958723,0.00041071462,0.00022548132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058616925,0.0004227067,0.00058983755,0.0011959244,0.0017535449,0.0011803017,0.0005415548,0.0010444293,0.0028751746],"category_scores_gemma":[0.004068665,0.0002903158,0.00035443887,0.0010062059,0.002436122,0.0019885595,0.0013712079,0.002162252,0.00055238703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059477176,0.00006827451,0.0027092174,0.00020945602,0.000011801317,0.00096988556,0.000916613,0.0075261816,0.022195997,0.91258997,0.0039861426,0.048221704],"study_design_scores_gemma":[0.00007323399,0.0003400918,0.002416602,0.00017433568,0.000031709937,0.0013224522,0.0003552024,0.043337986,0.019007355,0.90793663,0.024910571,0.00009390401],"about_ca_topic_score_codex":0.0006426071,"about_ca_topic_score_gemma":0.0011311861,"teacher_disagreement_score":0.0028751746,"about_ca_system_score_codex":0.00073966075,"about_ca_system_score_gemma":0.00077953434,"threshold_uncertainty_score":0.009618461},"labels":[],"label_agreement":null},{"id":"W4403165702","doi":"10.61091/ars-160-10","title":"A Note on Complete Classification of Repeated-Root σ -Constacyclic Codes of Prime Power Length over F p m [ u ] / ⟨ u 3 ⟩ and their Hamming Distances","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamming distance; Prime (order theory); Combinatorics; Hamming code; Root (linguistics); Prime power; Discrete mathematics; Statistics; Block code","score_opus":0.014657195662445307,"score_gpt":0.248646103392119,"score_spread":0.2339889077296737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.65339327,0.007880054,0.22475171,0.00802919,0.0020517777,0.00008731601,0.00157027,0.00059130596,0.10164507],"genre_scores_gemma":[0.9344555,0.002872395,0.044621535,0.001237333,0.0014192319,0.000060257644,0.001431149,0.00014064512,0.013761966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922717,0.00010531117,0.000058268273,0.00021865832,0.0002889173,0.000101722326],"domain_scores_gemma":[0.99663466,0.002018391,0.0003382924,0.00050461455,0.00029873368,0.00020545573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073332473,0.0004312285,0.0008704673,0.0016863878,0.0015926795,0.0020875698,0.0008042867,0.001110951,0.0031188384],"category_scores_gemma":[0.0040412312,0.0003181827,0.00043637288,0.0020174272,0.0020138868,0.0026853024,0.0012529579,0.003394579,0.00062803895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003051312,0.000058909347,0.004717267,0.0002564835,0.000026965572,0.0006998157,0.0013774671,0.0050863395,0.008087975,0.8686633,0.015327662,0.09539268],"study_design_scores_gemma":[0.000027672702,0.00015645123,0.0036395888,0.00009622783,0.000027513131,0.0011325371,0.00022732282,0.015915273,0.0057808817,0.9307397,0.04218784,0.00006898244],"about_ca_topic_score_codex":0.00083692564,"about_ca_topic_score_gemma":0.00070659176,"teacher_disagreement_score":0.0031188384,"about_ca_system_score_codex":0.0007954816,"about_ca_system_score_gemma":0.00074152637,"threshold_uncertainty_score":0.010433555},"labels":[],"label_agreement":null},{"id":"W4403537073","doi":"10.1016/j.ffa.2024.102520","title":"Stable binomials over finite fields","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.014667909028146828,"score_gpt":0.2384795716512006,"score_spread":0.22381166262305377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403537073","genre_codex":"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.5781699,0.008716805,0.18646061,0.0066942475,0.001740438,0.00012886872,0.00047353545,0.00049699406,0.21711859],"genre_scores_gemma":[0.9513845,0.0025796879,0.010159303,0.00032064022,0.0015119108,0.000090743546,0.00017989479,0.00008399733,0.033689316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990195,0.00034902935,0.000049013586,0.000119699755,0.000296788,0.00016591634],"domain_scores_gemma":[0.9956726,0.0027116297,0.0005249765,0.00020689427,0.00043029783,0.00045368721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020483648,0.00087694253,0.0013571022,0.00521093,0.0026063912,0.00474713,0.0008917778,0.0012751137,0.008789795],"category_scores_gemma":[0.0071766814,0.0007963041,0.0006049979,0.0037194178,0.00506227,0.007022225,0.002090353,0.002415297,0.0009940781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020573287,0.000011417795,0.00006989013,0.00001379323,0.0000022236532,0.00003552397,0.00010935341,0.00033150194,0.00019910205,0.9966633,0.000520863,0.0020224673],"study_design_scores_gemma":[0.00001618684,0.000010346781,0.00007710337,0.0000149870075,0.000004145074,0.00006235427,0.000040572497,0.0029208495,0.00017746724,0.9952421,0.0014246119,0.000009174051],"about_ca_topic_score_codex":0.00075186364,"about_ca_topic_score_gemma":0.00069673144,"teacher_disagreement_score":0.008789795,"about_ca_system_score_codex":0.0019563409,"about_ca_system_score_gemma":0.00080927415,"threshold_uncertainty_score":0.029404819},"labels":[],"label_agreement":null},{"id":"W4403964093","doi":"10.1016/j.ffa.2024.102536","title":"Quasi-polycyclic and skew quasi-polycyclic codes over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math>","year":2024,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Carleton University","keywords":"Skew; Mathematics; Computer science","score_opus":0.01852373439247834,"score_gpt":0.24274089607668084,"score_spread":0.2242171616842025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403964093","genre_codex":"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.41027254,0.0038188607,0.3997052,0.004979848,0.0012422685,0.00025675553,0.0052181687,0.0013538798,0.17315246],"genre_scores_gemma":[0.88732874,0.0017946108,0.04888173,0.0008895819,0.000713266,0.00019354126,0.0017029609,0.00030667696,0.058188934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987733,0.00029906482,0.00009729958,0.00025868925,0.00031425347,0.00025752568],"domain_scores_gemma":[0.99540675,0.0019247085,0.00074499164,0.0007964456,0.0007758902,0.00035121513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010824389,0.00040342848,0.00035198597,0.0010863169,0.00078952545,0.0020196731,0.0004210917,0.00060783484,0.0117956605],"category_scores_gemma":[0.0051660617,0.00027712746,0.00044326074,0.0016064184,0.0016739315,0.0024357766,0.0011727571,0.0010959838,0.0022335683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024402534,0.000035756268,0.0006059197,0.00008724974,0.0000105081945,0.00017473218,0.00018952534,0.004865151,0.0027451338,0.95496225,0.0072392127,0.028840493],"study_design_scores_gemma":[0.00005299628,0.00011580918,0.0011926274,0.00008733935,0.000016985377,0.0005243286,0.00011484867,0.028221408,0.0053855274,0.9323537,0.031869207,0.0000652129],"about_ca_topic_score_codex":0.001893042,"about_ca_topic_score_gemma":0.0017680294,"teacher_disagreement_score":0.0117956605,"about_ca_system_score_codex":0.0012961926,"about_ca_system_score_gemma":0.0016686312,"threshold_uncertainty_score":0.03946042},"labels":[],"label_agreement":null},{"id":"W4404192098","doi":"10.1137/24m1633376","title":"Shape Enumerators of Self-Dual NRT Codes over Finite Fields","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton; University of Saskatchewan","funders":"Algoma University","keywords":"Mathematics; Finite field; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.013323530558958904,"score_gpt":0.25979826793906785,"score_spread":0.24647473738010894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404192098","genre_codex":"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.9092648,0.00028213882,0.05833538,0.00085231045,0.00012272982,0.000051419967,0.00061652815,0.00040927192,0.030065415],"genre_scores_gemma":[0.97865933,0.00017381783,0.009685484,0.0001599911,0.00013319426,0.00007821474,0.00048650466,0.00012182536,0.010501659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901533,0.00019926934,0.00007252486,0.00012795767,0.00037157102,0.00021332758],"domain_scores_gemma":[0.99575007,0.0022728452,0.0006367037,0.0005539707,0.00047318102,0.0003132431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780332,0.0005615703,0.00065493,0.0017707708,0.0011738468,0.0023063298,0.0011862207,0.0011541685,0.0052891104],"category_scores_gemma":[0.004878891,0.00045710194,0.00073616265,0.0008958414,0.001542758,0.0020151378,0.001947627,0.0016461962,0.001072004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040046693,0.00009463335,0.001964299,0.00008943213,0.000022041944,0.0004024962,0.000571832,0.014941541,0.007999386,0.95367223,0.0023132719,0.017528398],"study_design_scores_gemma":[0.00006749978,0.000059622915,0.0009027483,0.00005393349,0.000018970119,0.00045260054,0.00012800038,0.07572325,0.0051679164,0.91540515,0.001977043,0.00004327883],"about_ca_topic_score_codex":0.0004997527,"about_ca_topic_score_gemma":0.0006496908,"teacher_disagreement_score":0.0052891104,"about_ca_system_score_codex":0.0012935288,"about_ca_system_score_gemma":0.0009275232,"threshold_uncertainty_score":0.017693818},"labels":[],"label_agreement":null},{"id":"W4404597517","doi":"10.1007/s12095-024-00756-5","title":"On the counting of involutory MDS matrices","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complex Hadamard matrix; Circulant matrix; Hadamard transform; Hadamard matrix; Mathematics; Hadamard's maximal determinant problem; Hadamard's inequality; Matrix (chemical analysis); Hadamard three-lines theorem; Order (exchange); Combinatorics; Discrete mathematics","score_opus":0.02329012407093261,"score_gpt":0.25297691125141764,"score_spread":0.22968678718048502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404597517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.4266613,0.0020461422,0.45301077,0.0039106193,0.000715522,0.00018169294,0.0010469476,0.0009233272,0.11150356],"genre_scores_gemma":[0.9045184,0.0013076721,0.0654626,0.000530566,0.0009880777,0.00024210478,0.0009183874,0.00035145305,0.025680607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965107,0.001048837,0.00025116117,0.00047435268,0.0011464756,0.00056847755],"domain_scores_gemma":[0.9825127,0.011014391,0.0015880936,0.00217395,0.0017510846,0.0009597439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028874124,0.0012050162,0.0016682022,0.005103197,0.0026220432,0.0055942577,0.0027199842,0.0019331006,0.007888256],"category_scores_gemma":[0.023556503,0.00071007194,0.0007881428,0.004636649,0.0043018544,0.009015787,0.0038616483,0.0024731054,0.0012738027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081577185,0.000024717117,0.0007376266,0.000049682858,0.000007404436,0.00006380269,0.00014243837,0.0030352934,0.00079202635,0.9801184,0.0023508654,0.012596086],"study_design_scores_gemma":[0.000009099145,0.00001753157,0.00021048692,0.000038981456,0.00000929277,0.00014917362,0.00005497471,0.029017413,0.0012445939,0.96661025,0.0026216828,0.00001650933],"about_ca_topic_score_codex":0.0011220606,"about_ca_topic_score_gemma":0.0012936514,"teacher_disagreement_score":0.007888256,"about_ca_system_score_codex":0.002205836,"about_ca_system_score_gemma":0.0014625778,"threshold_uncertainty_score":0.026388824},"labels":[],"label_agreement":null},{"id":"W4404788977","doi":"10.1109/tit.2024.3503770","title":"Linearized Reed-Solomon Codes With Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; Peng Cheng Laboratory","keywords":"Reed–Solomon error correction; Generator matrix; Computer science; Coding (social sciences); Block code; Linear code; Algorithm; Decoding methods; Theoretical computer science; Mathematics; Statistics","score_opus":0.010043670841173455,"score_gpt":0.23847043933896916,"score_spread":0.2284267684977957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.04778184,0.0040482767,0.9314141,0.0015088893,0.00017508639,0.00010361857,0.00032040128,0.00047891683,0.014168824],"genre_scores_gemma":[0.7567473,0.0064981417,0.22827365,0.00042933688,0.000510902,0.0003699598,0.00054607575,0.000121883626,0.006502816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913967,0.00030607096,0.000046356836,0.000085808584,0.000338267,0.00008378838],"domain_scores_gemma":[0.9961423,0.0025162327,0.00043652777,0.00026028694,0.00054556737,0.00009916644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068717106,0.00074492,0.00043945466,0.0009712851,0.00036598893,0.00084151217,0.0004958778,0.000816414,0.0024646618],"category_scores_gemma":[0.0070067975,0.00033216857,0.0003571672,0.0013010467,0.0008740337,0.0013036726,0.0010267969,0.0011641673,0.00084376155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034685477,0.00009723399,0.0010351955,0.00075110997,0.00003933516,0.001237019,0.00044381848,0.24495366,0.04471519,0.5667863,0.006984536,0.13260978],"study_design_scores_gemma":[0.00004288059,0.00016745673,0.00050680863,0.00014432285,0.000016083994,0.0008655185,0.0001144521,0.7572121,0.017973877,0.2121985,0.010673555,0.00008441028],"about_ca_topic_score_codex":0.00097099313,"about_ca_topic_score_gemma":0.0012640083,"teacher_disagreement_score":0.0024646618,"about_ca_system_score_codex":0.0007454299,"about_ca_system_score_gemma":0.00096241746,"threshold_uncertainty_score":0.0082451105},"labels":[],"label_agreement":null},{"id":"W4405098767","doi":"10.22215/etd/2024-16165","title":"A Collection of New Algorithms in Post-Quantum Cryptography","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cryptography; Cryptosystem; Computer science; Algorithm; Theoretical computer science; Cryptanalysis; Block cipher","score_opus":0.010873164270546994,"score_gpt":0.259110136686574,"score_spread":0.24823697241602702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405098767","genre_codex":"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.0047914297,0.0027910618,0.9589429,0.0018715987,0.0009803806,0.00019245078,0.00015967607,0.00048458728,0.02978598],"genre_scores_gemma":[0.09657768,0.0062595676,0.8558717,0.0019979028,0.0031753893,0.00077467546,0.00038816436,0.00063528924,0.034319714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971738,0.0006846788,0.00024519442,0.000550068,0.001133202,0.00021304931],"domain_scores_gemma":[0.99753475,0.00093198655,0.00016005342,0.00091842475,0.0003639535,0.000090760914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031389424,0.0013015673,0.0009106723,0.0025220132,0.0014253252,0.0033496576,0.0019371225,0.001730401,0.007019296],"category_scores_gemma":[0.0058309785,0.0007078059,0.0019085394,0.0023141624,0.0060819564,0.009591878,0.0031619137,0.0068509476,0.003948273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002068345,0.000031923562,0.00009490879,0.000081014594,0.000008597061,0.000023526482,0.000104493905,0.0025777787,0.0008519289,0.9470547,0.0029855436,0.04616492],"study_design_scores_gemma":[0.000033214877,0.00007115005,0.00013159146,0.00008820278,0.000011119724,0.00019110252,0.000033678076,0.025554894,0.0041191923,0.8846851,0.08503059,0.00005018531],"about_ca_topic_score_codex":0.00041262226,"about_ca_topic_score_gemma":0.00026876663,"teacher_disagreement_score":0.007019296,"about_ca_system_score_codex":0.0018074525,"about_ca_system_score_gemma":0.0013581385,"threshold_uncertainty_score":0.023481846},"labels":[],"label_agreement":null},{"id":"W4405256772","doi":"10.4153/s0008439524000547","title":"<i>p</i>-Adic quotient sets: Linear recurrence sequences with reducible characteristic polynomials","year":2024,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quotient; Mathematics; Combinatorics; Order (exchange); Polynomial; Sequence (biology); Prime (order theory); Mathematical analysis","score_opus":0.014363401098204795,"score_gpt":0.2325155924357643,"score_spread":0.2181521913375595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405256772","genre_codex":"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.877517,0.0010331519,0.059020203,0.00080535223,0.0001542789,0.000045992467,0.0006114956,0.0003875066,0.060425043],"genre_scores_gemma":[0.9835722,0.00029399706,0.0075965063,0.00010481568,0.000117929514,0.000040233735,0.0005005266,0.0000693668,0.0077044833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994049,0.000086822,0.000038649207,0.00016390572,0.00015461526,0.0001510846],"domain_scores_gemma":[0.999231,0.00027288275,0.00013659116,0.00008262422,0.00013559723,0.00014136451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040857017,0.0005548032,0.00068829866,0.0015535997,0.0012183418,0.002487554,0.0006621763,0.00044796208,0.005154503],"category_scores_gemma":[0.0019325598,0.00036294508,0.00078585086,0.0011214531,0.0022104797,0.0019225238,0.0011568349,0.0016029335,0.00094069866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010817364,0.000035645422,0.0011870397,0.00006029929,0.000012784347,0.00032963342,0.0005620697,0.0024907382,0.0027836931,0.9790157,0.0014550588,0.011959277],"study_design_scores_gemma":[0.00004667443,0.00006469458,0.0011113858,0.000037872287,0.00002277917,0.00036667846,0.00022370186,0.0122215375,0.0033282943,0.97622865,0.006306793,0.000040933388],"about_ca_topic_score_codex":0.0015236659,"about_ca_topic_score_gemma":0.001105731,"teacher_disagreement_score":0.005154503,"about_ca_system_score_codex":0.0016599915,"about_ca_system_score_gemma":0.00047556273,"threshold_uncertainty_score":0.017243505},"labels":[],"label_agreement":null},{"id":"W4405262838","doi":"10.1007/s12095-024-00761-8","title":"On the stability of $$b^q(x+a)^{q+1}+x$$ from the perspective of periodic sequences","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Perspective (graphical); Stability (learning theory); Crystallography; Mathematics; Computer science; Chemistry; Geometry","score_opus":0.03811957096684519,"score_gpt":0.274348788150973,"score_spread":0.23622921718412782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405262838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.64550066,0.0023730723,0.15808812,0.007890712,0.00081330875,0.0000667076,0.00027419804,0.00020123368,0.18479197],"genre_scores_gemma":[0.9746991,0.0006692874,0.0081288805,0.00038506582,0.00037413553,0.000064118234,0.00009231925,0.00007256338,0.015514573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965584,0.00011437883,0.000013536973,0.000057238005,0.000099557124,0.000059472888],"domain_scores_gemma":[0.99837685,0.0009964937,0.00019542754,0.000080125326,0.00020925845,0.00014183785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008504044,0.00037306335,0.00037512177,0.0011274,0.001516654,0.0016171272,0.0009125907,0.0009444778,0.009337678],"category_scores_gemma":[0.005250058,0.00019499227,0.00027709812,0.0005488183,0.002563864,0.0021029066,0.0012001994,0.0013184675,0.0006520424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061287705,0.000011464708,0.00011549213,0.000017584625,0.0000038959156,0.000047252546,0.00010597284,0.0046667093,0.0014783175,0.9884919,0.0010753865,0.003924787],"study_design_scores_gemma":[0.000024659908,0.000035090838,0.00020145853,0.000017833629,0.0000033345116,0.000054777796,0.00007272295,0.056336567,0.00070116116,0.94102246,0.001516115,0.000013917258],"about_ca_topic_score_codex":0.0015561322,"about_ca_topic_score_gemma":0.0008255611,"teacher_disagreement_score":0.009337678,"about_ca_system_score_codex":0.0009811556,"about_ca_system_score_gemma":0.0008224777,"threshold_uncertainty_score":0.031237602},"labels":[],"label_agreement":null},{"id":"W4405269950","doi":"10.1007/978-981-96-0891-1_11","title":"SQIsign2D–West","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Capital Commission","funders":"Agence Nationale de la Recherche","keywords":"Computer science","score_opus":0.014104254749029582,"score_gpt":0.23489427583538686,"score_spread":0.22079002108635729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405269950","genre_codex":"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.0022963316,0.003438814,0.12164214,0.0021332877,0.0029891883,0.0001132699,0.005227847,0.020085549,0.8420735],"genre_scores_gemma":[0.011436197,0.002020502,0.035256352,0.0008158126,0.00041758968,0.00010300369,0.0049888985,0.009209676,0.9357519],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996189,0.000035921326,0.000015555486,0.00009520188,0.00018638505,0.000047959944],"domain_scores_gemma":[0.999666,0.000049358656,0.000013011338,0.000098286546,0.00010835003,0.00006502722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533163,0.0010724636,0.0005942457,0.0013993072,0.0006635566,0.0023555413,0.0011628573,0.0008728015,0.22588144],"category_scores_gemma":[0.0010578496,0.00050466607,0.00048768902,0.0013711054,0.0005944383,0.0022676338,0.001844078,0.0019109416,0.15884049],"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.00011904968,0.00003148798,0.00012761672,0.0002109726,0.000008241286,0.00006441656,0.00005513173,0.000983573,0.0031124311,0.07035686,0.51557744,0.40935284],"study_design_scores_gemma":[0.000010950033,0.000018531891,0.00010325225,0.000042030446,0.000003428925,0.00011782852,0.00000849895,0.001168214,0.0022088708,0.014715818,0.9815918,0.00001075945],"about_ca_topic_score_codex":0.0011704006,"about_ca_topic_score_gemma":0.0018757847,"teacher_disagreement_score":0.22588144,"about_ca_system_score_codex":0.00078259484,"about_ca_system_score_gemma":0.00079780834,"threshold_uncertainty_score":0.75564873},"labels":[],"label_agreement":null},{"id":"W4405324345","doi":"10.1515/jmc-2024-0010","title":"Revisiting linearly extended discrete functions","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.017181849297748342,"score_gpt":0.2836623500587121,"score_spread":0.26648050076096375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405324345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.081796475,0.0038442712,0.6420362,0.01238905,0.005353603,0.0001281258,0.0004232878,0.0011472747,0.25288174],"genre_scores_gemma":[0.7593161,0.0029445793,0.15237105,0.0044223736,0.0025963949,0.00015318283,0.00027872773,0.00049313175,0.077424526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968263,0.0012514256,0.00019201392,0.0005092613,0.00090059213,0.00032039528],"domain_scores_gemma":[0.99575186,0.0019005912,0.00021207661,0.0012335632,0.0006836404,0.0002182951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027555134,0.000666157,0.00047423434,0.0010085934,0.0012855931,0.0029173016,0.0011307207,0.0014702457,0.008622422],"category_scores_gemma":[0.0087078195,0.00039394252,0.0012771708,0.0010067219,0.0056723254,0.008031383,0.0034012126,0.0048525683,0.0028041773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039000817,0.000017660777,0.00013139022,0.00004650094,0.000004684315,0.00011193444,0.0002354283,0.0020961368,0.0008809369,0.98016274,0.0020848429,0.014188771],"study_design_scores_gemma":[0.000026035756,0.00008654005,0.00012425585,0.00009323558,0.0000091553475,0.00029107693,0.0001495385,0.017603716,0.0032292125,0.86323535,0.11511227,0.00003956885],"about_ca_topic_score_codex":0.0014199757,"about_ca_topic_score_gemma":0.0006791163,"teacher_disagreement_score":0.008622422,"about_ca_system_score_codex":0.0022810337,"about_ca_system_score_gemma":0.000993422,"threshold_uncertainty_score":0.028844833},"labels":[],"label_agreement":null},{"id":"W4405564320","doi":"","title":"Some New Non-binary Quantum Codes from One-generator Quasi-cyclic Codes","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Generator (circuit theory); Quantum; Binary number; Computer science; Mathematics; Physics; Arithmetic; Quantum mechanics; Power (physics)","score_opus":0.062464857201931706,"score_gpt":0.19695075927704078,"score_spread":0.13448590207510908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405564320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5491256,0.001275805,0.37653667,0.0025314093,0.00059774116,0.00024249197,0.0007490314,0.00035821143,0.06858297],"genre_scores_gemma":[0.9025519,0.00068311417,0.084156066,0.0004697817,0.00041454373,0.00017554701,0.0005913191,0.00013436135,0.010823424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990471,0.00017459865,0.00006622822,0.00015562974,0.00042104305,0.00013543789],"domain_scores_gemma":[0.9974521,0.0010558069,0.00036368828,0.00043981778,0.00042495425,0.00026357287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071719376,0.00037737607,0.00036852658,0.0009562821,0.0010871015,0.0012445736,0.0006067525,0.0009956459,0.0036470126],"category_scores_gemma":[0.0047913776,0.00032782144,0.0005244611,0.0006754601,0.0017227156,0.0025786797,0.0014234816,0.0020622027,0.00044579533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056746077,0.000029125202,0.00046145258,0.00009299449,0.000006785889,0.00022181569,0.00031333035,0.0035182498,0.0061265137,0.9784687,0.0009863192,0.009717814],"study_design_scores_gemma":[0.00006385997,0.000101946585,0.0006707179,0.000057258832,0.000013523933,0.00092562556,0.00012713911,0.046208713,0.009029698,0.93242925,0.010312913,0.00005945862],"about_ca_topic_score_codex":0.00032742726,"about_ca_topic_score_gemma":0.00036303402,"teacher_disagreement_score":0.0036470126,"about_ca_system_score_codex":0.0006899968,"about_ca_system_score_gemma":0.0010302995,"threshold_uncertainty_score":0.012200415},"labels":[],"label_agreement":null},{"id":"W4405665600","doi":"10.1007/s40993-024-00606-6","title":"Solving norm equations in global function fields","year":2024,"lang":"en","type":"article","venue":"Research in Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Norm (philosophy); Implementation; Mathematics; Function (biology); Applied mathematics; Computer science; Mathematical optimization; Field (mathematics); Algorithm; Theoretical computer science; Calculus (dental); Pure mathematics","score_opus":0.061304192240290635,"score_gpt":0.38097454176670853,"score_spread":0.3196703495264179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405665600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.14366971,0.0011413081,0.80806404,0.0027740586,0.0006488887,0.00006408621,0.0001791049,0.0002299625,0.04322897],"genre_scores_gemma":[0.6989499,0.0016400659,0.24502026,0.0010192476,0.0013276524,0.00016272423,0.0005910122,0.0006046019,0.050684497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990742,0.00044583518,0.00003726096,0.00009953811,0.00024568444,0.0000974251],"domain_scores_gemma":[0.9969348,0.0022521818,0.00019394228,0.0001702857,0.0002699173,0.00017896065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022751724,0.0009774608,0.0011905126,0.0012920045,0.0007360349,0.0018807147,0.0013953329,0.0013675642,0.005338177],"category_scores_gemma":[0.009392181,0.00048614002,0.0008947324,0.0010215864,0.0028957385,0.0055473913,0.002784606,0.0031335664,0.0004220214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002705513,0.000023936987,0.00027863245,0.000084403844,0.000017137103,0.00003415923,0.00013677264,0.020471806,0.00053992943,0.96608967,0.002089346,0.010207068],"study_design_scores_gemma":[0.000020764062,0.000016277367,0.000091811446,0.000014599008,0.0000058086466,0.000022394253,0.00006479269,0.10801147,0.0003551957,0.8894905,0.0018965299,0.000009833678],"about_ca_topic_score_codex":0.0011803191,"about_ca_topic_score_gemma":0.0018497277,"teacher_disagreement_score":0.005338177,"about_ca_system_score_codex":0.00092683197,"about_ca_system_score_gemma":0.0007422125,"threshold_uncertainty_score":0.01785791},"labels":[],"label_agreement":null},{"id":"W4406163648","doi":"10.61091/um121-03","title":"Disproof of a Conjecture on the Edge Mostar Index","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Conjecture; Index (typography); Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Statistics; Computer science; Artificial intelligence","score_opus":0.016446326568152852,"score_gpt":0.24469439071936436,"score_spread":0.22824806415121152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406163648","genre_codex":"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.70225495,0.0024015785,0.18509842,0.014504491,0.00073054986,0.00012238516,0.0023898066,0.001505962,0.09099186],"genre_scores_gemma":[0.9774802,0.00037147247,0.017077675,0.0018005762,0.00029185362,0.00006167441,0.00073349394,0.00014548971,0.0020374998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957426,0.0009781355,0.00019141998,0.0012292003,0.0010169821,0.0008415097],"domain_scores_gemma":[0.96070564,0.02713086,0.0022054804,0.0063546733,0.0022802409,0.001323123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025461146,0.0007471314,0.0019460716,0.002319207,0.002871019,0.0033102273,0.0029775426,0.0030051987,0.0056564207],"category_scores_gemma":[0.034075383,0.0009088321,0.0014141896,0.0020940944,0.00451094,0.006327108,0.0033226947,0.006402553,0.0012986177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014427043,0.0002085155,0.013189838,0.0005046944,0.00017002202,0.00068836275,0.0014912458,0.022013888,0.015865006,0.8769021,0.03139383,0.036129728],"study_design_scores_gemma":[0.00008985758,0.00015767776,0.0034278084,0.000106720116,0.00008155,0.0010345529,0.00036800522,0.06007775,0.011071667,0.912932,0.010571274,0.00008108423],"about_ca_topic_score_codex":0.00124629,"about_ca_topic_score_gemma":0.0009288162,"teacher_disagreement_score":0.0056564207,"about_ca_system_score_codex":0.001597237,"about_ca_system_score_gemma":0.0009214894,"threshold_uncertainty_score":0.018922627},"labels":[],"label_agreement":null},{"id":"W4406164271","doi":"10.61091/ars161-09","title":"On Hermitian Cones in \\(pG(3,q^2\\)","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Hermitian matrix; Mathematics; Characterization (materials science); Pure mathematics; Combinatorics; Physics; Optics","score_opus":0.009287498487718702,"score_gpt":0.237330348251289,"score_spread":0.22804284976357028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5808397,0.0016852018,0.25239825,0.0018354439,0.0005984924,0.00021104253,0.0014293995,0.00026930412,0.1607332],"genre_scores_gemma":[0.9404565,0.0009322326,0.031027442,0.00059074484,0.0005960334,0.00012346654,0.0010208206,0.00014808794,0.025104582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924636,0.00018829963,0.000039550418,0.00011793348,0.00024171994,0.0001661469],"domain_scores_gemma":[0.998738,0.00034521398,0.000293359,0.00007766444,0.00025505314,0.00029070873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052957993,0.00082749466,0.00051947293,0.0017843506,0.001557009,0.0026551737,0.0006797846,0.0005063762,0.0075336415],"category_scores_gemma":[0.0012198136,0.00023302407,0.00042358806,0.001587575,0.0019289964,0.0032720182,0.0014893579,0.001883194,0.0010597076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003694404,0.00003153185,0.0003623314,0.00003740224,0.000004374356,0.00020411731,0.00013970697,0.0009835804,0.0014064062,0.98856366,0.0019093405,0.006320531],"study_design_scores_gemma":[0.000022340608,0.000054687713,0.00077143084,0.000037891627,0.0000062604026,0.0004021764,0.0002289315,0.0124817025,0.0013933436,0.9747487,0.009818877,0.00003366855],"about_ca_topic_score_codex":0.0009642591,"about_ca_topic_score_gemma":0.0008333789,"teacher_disagreement_score":0.0075336415,"about_ca_system_score_codex":0.00065864186,"about_ca_system_score_gemma":0.00043201432,"threshold_uncertainty_score":0.025202513},"labels":[],"label_agreement":null},{"id":"W4406261782","doi":"10.1109/qce60285.2024.10410","title":"Efficient Training of Layerwise-Commuting PQCs with Parallel Gradient Estimation","year":2024,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Training (meteorology); Computer science; Estimation; Engineering; Geography","score_opus":0.020563959661628193,"score_gpt":0.24079308891214343,"score_spread":0.22022912925051524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.14903855,0.00021286459,0.84115,0.0005094502,0.000102904356,0.0002520836,0.00015597808,0.0028319422,0.005746196],"genre_scores_gemma":[0.7895225,0.00006206933,0.20596607,0.0002676583,0.000028343198,0.00034084654,0.0003311367,0.00026269592,0.0032186948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995925,0.000115006515,0.000027610302,0.00007118018,0.00010814964,0.00008554215],"domain_scores_gemma":[0.9978726,0.0011549301,0.00012747826,0.00040795802,0.00034207618,0.00009483485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011533848,0.0010205047,0.0010635174,0.0003535808,0.0004387621,0.0005714053,0.0026004158,0.0011884375,0.0060877446],"category_scores_gemma":[0.0055568055,0.00061731035,0.0005790573,0.0004126081,0.0010497376,0.0016177378,0.0017592014,0.0022623441,0.0007886863],"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.00023579742,0.00019501946,0.0019349967,0.00017865008,0.00009045476,0.00009821656,0.00012681037,0.85424864,0.008851946,0.016025182,0.0022839813,0.11573023],"study_design_scores_gemma":[0.000010714461,0.000028088558,0.000052503518,0.0000032725723,0.0000038456433,0.0000072122252,0.0000059789963,0.99588877,0.0014221102,0.0024275726,0.00014707321,0.0000028434715],"about_ca_topic_score_codex":0.0036731844,"about_ca_topic_score_gemma":0.006602808,"teacher_disagreement_score":0.0060877446,"about_ca_system_score_codex":0.00076840975,"about_ca_system_score_gemma":0.0017805456,"threshold_uncertainty_score":0.020365536},"labels":[],"label_agreement":null},{"id":"W4406510177","doi":"10.1016/j.jcta.2025.106009","title":"There are no good infinite families of toric codes","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.00604794033340711,"score_gpt":0.22289110269807988,"score_spread":0.21684316236467277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406510177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.94059604,0.0011811974,0.040851925,0.0011733108,0.00008637124,0.000029351826,0.00036999243,0.0002111172,0.015500759],"genre_scores_gemma":[0.98931956,0.00033970238,0.007131848,0.00018114506,0.000060344522,0.00007141855,0.00034779368,0.000049922804,0.002498248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868816,0.0003145802,0.00007602401,0.00025488506,0.00036455592,0.00030175515],"domain_scores_gemma":[0.9907831,0.004833871,0.0009594928,0.001260526,0.0010809567,0.001082023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011700435,0.00041558628,0.001028014,0.001572189,0.0027579425,0.0025728007,0.0008638827,0.0009498734,0.0022293737],"category_scores_gemma":[0.009409687,0.00088892266,0.0007450382,0.0009339565,0.0045121266,0.0034736753,0.002040941,0.0015873769,0.00029569116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049462885,0.000054091837,0.0077518015,0.00021803418,0.0000910024,0.0006905763,0.0012144074,0.018878436,0.0070319837,0.9467774,0.0040001157,0.012797496],"study_design_scores_gemma":[0.00014504482,0.00020822692,0.0060864985,0.00015109355,0.000120894896,0.0022678887,0.0012156825,0.07531583,0.010270424,0.88870025,0.015342274,0.00017596447],"about_ca_topic_score_codex":0.00074080133,"about_ca_topic_score_gemma":0.00070056925,"teacher_disagreement_score":0.0027579425,"about_ca_system_score_codex":0.0015507037,"about_ca_system_score_gemma":0.0006509136,"threshold_uncertainty_score":0.011251211},"labels":[],"label_agreement":null},{"id":"W4406655904","doi":"10.1016/b978-044488002-4/50018-x","title":"10.1016/b978-044488002-4/50018-x","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.008502868985910426,"score_gpt":0.1668347251275831,"score_spread":0.15833185614167267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406655904","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024883385,0.00048819507,0.001015197,0.0003258297,0.00015290917,0.000033683387,0.0007645605,0.00080088235,0.99616987],"genre_scores_gemma":[0.00057622866,0.00026083167,0.0003480337,0.00009745926,0.0000383771,0.000022264512,0.00038577162,0.00022943427,0.9980415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995753,0.00002993111,0.000030158615,0.00013836256,0.00014805073,0.00007826773],"domain_scores_gemma":[0.99844664,0.00046367268,0.00012631396,0.00026129812,0.00029357505,0.00040854007],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007136226,0.0020419455,0.0011482675,0.0021258106,0.0012612885,0.0046053734,0.0023914876,0.0038663268,0.96700567],"category_scores_gemma":[0.0015380511,0.0008514906,0.0007271113,0.0028113574,0.0011646294,0.0055275923,0.0027194384,0.0019591276,0.9816093],"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.00010833897,0.000085856154,0.0004163578,0.00040756576,0.000014268137,0.00011238183,0.00007964636,0.000333443,0.0020602837,0.010810685,0.4086778,0.5768934],"study_design_scores_gemma":[0.000011083599,0.00003145396,0.00044383112,0.00017920448,0.0000054927004,0.00013867355,0.000056371286,0.00014365277,0.0003641378,0.0013988847,0.9972179,0.0000091972615],"about_ca_topic_score_codex":0.0027597619,"about_ca_topic_score_gemma":0.0030940084,"teacher_disagreement_score":0.03299433,"about_ca_system_score_codex":0.0009734251,"about_ca_system_score_gemma":0.0007907961,"threshold_uncertainty_score":0.047062397},"labels":[],"label_agreement":null},{"id":"W4406949003","doi":"10.1109/tcomm.2025.3535882","title":"Constituent Automorphism Decoding of Reed-Muller Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Reed–Muller code; List decoding; Computer science; Mathematics; Concatenated error correction code; Telecommunications; Block code","score_opus":0.026309699697830938,"score_gpt":0.2870004848657971,"score_spread":0.2606907851679662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.13679174,0.00027228825,0.845117,0.00028601606,0.00019332486,0.00008162557,0.00018928626,0.0018802909,0.015188496],"genre_scores_gemma":[0.8245443,0.00036466913,0.16160099,0.00014029366,0.00012807817,0.00007062782,0.00043916446,0.00046748304,0.012244272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990121,0.0003190433,0.0000537188,0.00015689214,0.0003251445,0.00013305398],"domain_scores_gemma":[0.9986816,0.00048761815,0.00013134933,0.0003434122,0.00028249473,0.00007355673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007629254,0.0006022921,0.0007059446,0.00060261885,0.0006078056,0.0013010268,0.000673815,0.0007857572,0.002149614],"category_scores_gemma":[0.0035051988,0.00025480252,0.00052264536,0.0006375499,0.000855822,0.0013980684,0.001832205,0.0013576741,0.0018520073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092250627,0.00012450427,0.0019936108,0.00018756425,0.000093457624,0.00048692335,0.0007672882,0.17210048,0.15584154,0.45693716,0.0037419808,0.20680289],"study_design_scores_gemma":[0.00002534442,0.00018560184,0.00039977935,0.00003765325,0.000027951115,0.00023474488,0.00006402016,0.71878576,0.12846756,0.14449657,0.0072209043,0.000054097138],"about_ca_topic_score_codex":0.0004042801,"about_ca_topic_score_gemma":0.0006493293,"teacher_disagreement_score":0.002149614,"about_ca_system_score_codex":0.00054349867,"about_ca_system_score_gemma":0.0008075221,"threshold_uncertainty_score":0.007191181},"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":"W4408138048","doi":"10.18280/mmep.120235","title":"Design and Implementation of Low Power Generic Reversible Binary-Coded Decimal Adder on Artix-7 FPGA","year":2025,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Adder; Decimal; Binary number; Arithmetic; Computer science; Computer hardware; Mathematics; Telecommunications","score_opus":0.01936665366118238,"score_gpt":0.22810981810873965,"score_spread":0.20874316444755728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408138048","genre_codex":"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.5039436,0.004881138,0.4026283,0.00074948254,0.00060120923,0.0005270161,0.0008721754,0.0067425645,0.07905452],"genre_scores_gemma":[0.88558346,0.000597903,0.101418346,0.00023348017,0.000043734482,0.00008083577,0.00048225463,0.00007519632,0.011484879],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989116,0.000014369231,0.000009576619,0.000023011751,0.000035193058,0.000026713962],"domain_scores_gemma":[0.99992764,0.000012857647,0.000011585789,0.000014088943,0.0000282935,0.000005567199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010655915,0.00037959783,0.0003010282,0.0004330278,0.00032119916,0.000600642,0.0007887231,0.00029034654,0.0050901137],"category_scores_gemma":[0.0001596205,0.00018272919,0.00024916005,0.0002887358,0.00012811455,0.0003818441,0.00018521887,0.00021323595,0.0007232557],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001050317,0.00019237197,0.0028301186,0.001633301,0.00031567764,0.0015669934,0.00029044863,0.054247886,0.40003347,0.033800457,0.013168559,0.49087036],"study_design_scores_gemma":[0.000669157,0.002816125,0.0073892293,0.00028191172,0.0005218308,0.004380964,0.00031771197,0.33385333,0.519323,0.010675842,0.11961124,0.00015960705],"about_ca_topic_score_codex":0.0010540617,"about_ca_topic_score_gemma":0.0024069622,"teacher_disagreement_score":0.0050901137,"about_ca_system_score_codex":0.0003889146,"about_ca_system_score_gemma":0.00066846056,"threshold_uncertainty_score":0.017028153},"labels":[],"label_agreement":null},{"id":"W4408207844","doi":"10.1007/s00208-024-03084-4","title":"Abelian varieties of prescribed order over finite fields","year":2025,"lang":"lv","type":"article","venue":"Mathematische Annalen","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Division of Mathematical Sciences; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Institut des Sciences Mathématiques, Université du Québec à Montréal; Centre de Recherches Mathématiques; Simons Foundation","keywords":"Algorithm; Computer science","score_opus":0.01715553903969254,"score_gpt":0.26288330988389746,"score_spread":0.24572777084420494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408207844","genre_codex":"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.7665321,0.0011117097,0.040421918,0.0019464382,0.00038198283,0.00008525591,0.00038517136,0.00067973597,0.18845563],"genre_scores_gemma":[0.9819756,0.00023728037,0.002874768,0.00007675734,0.00016152776,0.000018789468,0.00017449168,0.00004589925,0.014434855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991511,0.00016060074,0.000045630783,0.00013896702,0.0002686565,0.0002349314],"domain_scores_gemma":[0.99874735,0.00044789864,0.0001642844,0.00017452097,0.00021944931,0.0002464816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008440515,0.00051625405,0.00061214226,0.0013754738,0.0018382312,0.0025589447,0.0004288026,0.0004011723,0.008944263],"category_scores_gemma":[0.002249957,0.000270266,0.000553363,0.00082189357,0.003535043,0.0030281602,0.0019474817,0.0012789359,0.0012373491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018489375,0.000042616342,0.0013384734,0.0000524058,0.000011199949,0.00032940012,0.0004993846,0.0013357535,0.0019835657,0.98742616,0.0014213464,0.005374897],"study_design_scores_gemma":[0.00009188397,0.00009069093,0.0018570563,0.00005157872,0.000025743913,0.00050696934,0.00060487614,0.005889835,0.0056200284,0.96388596,0.02134643,0.000028998647],"about_ca_topic_score_codex":0.0017519138,"about_ca_topic_score_gemma":0.0013427084,"teacher_disagreement_score":0.008944263,"about_ca_system_score_codex":0.00282019,"about_ca_system_score_gemma":0.00087545277,"threshold_uncertainty_score":0.029921591},"labels":[],"label_agreement":null},{"id":"W4408408500","doi":"10.1016/j.ffa.2025.102606","title":"Artin-Schreier towers of finite fields","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo para la Investigación Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Mathematics; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.008855253006169935,"score_gpt":0.22812650273654952,"score_spread":0.2192712497303796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408408500","genre_codex":"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.57463217,0.010182824,0.11097145,0.0047843964,0.0013597183,0.00008969554,0.00064554624,0.00078025105,0.296554],"genre_scores_gemma":[0.9522679,0.002169227,0.013435239,0.00038631927,0.0011242923,0.00006394997,0.0003140226,0.00010738753,0.030131737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989316,0.00033938914,0.000057888472,0.00017332763,0.00027332158,0.00022452754],"domain_scores_gemma":[0.9971493,0.0015110524,0.00036068208,0.00023574769,0.00023762092,0.0005056931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257175,0.0014340866,0.0020576164,0.006877785,0.0036535924,0.0046497686,0.002018747,0.0018337187,0.009890612],"category_scores_gemma":[0.005145329,0.001061044,0.0013094759,0.0033157824,0.0062579233,0.008163006,0.0033107842,0.0039118608,0.0010574502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030485773,0.000017137181,0.00015643252,0.00003383032,0.000007676539,0.00008157918,0.00023254644,0.00066729647,0.00029839543,0.9958262,0.00065503875,0.001993442],"study_design_scores_gemma":[0.000017960856,0.000010844563,0.00021847169,0.000020249261,0.000008177213,0.000078788544,0.00006385951,0.002070734,0.00016181445,0.9959474,0.0013866123,0.000015058252],"about_ca_topic_score_codex":0.0019662853,"about_ca_topic_score_gemma":0.002416628,"teacher_disagreement_score":0.009890612,"about_ca_system_score_codex":0.0030573457,"about_ca_system_score_gemma":0.00070077856,"threshold_uncertainty_score":0.033087432},"labels":[],"label_agreement":null},{"id":"W4408490912","doi":"10.61091/jcmcc124-07","title":"Group Codes over Algebra of Wreath Products","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wreath product; Group (periodic table); Algebra over a field; Group algebra; Mathematics; Pure mathematics; Chemistry; Geometry","score_opus":0.009685897510156652,"score_gpt":0.24366118912376966,"score_spread":0.23397529161361302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408490912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6823685,0.0008756525,0.22798301,0.00059789413,0.00037599975,0.0001340437,0.0003881129,0.00030244415,0.08697428],"genre_scores_gemma":[0.9427422,0.00050792145,0.035776466,0.0002196176,0.0002830162,0.00010782707,0.00041247005,0.0001089567,0.01984155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993387,0.00010633582,0.00004163384,0.00013482705,0.00020866035,0.00016980962],"domain_scores_gemma":[0.99934036,0.00012864974,0.00012818913,0.00011008226,0.00020210649,0.00009053013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038710173,0.0004496132,0.0004597181,0.0010622041,0.00088200276,0.0012231901,0.00052511663,0.00039406307,0.005094921],"category_scores_gemma":[0.0010725285,0.00014672733,0.0005535109,0.00069034175,0.0014576113,0.0020063492,0.0009551352,0.00091992435,0.0013181518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007933079,0.000028179993,0.0003037327,0.000056680943,0.000010165531,0.00017800524,0.00022950026,0.002089876,0.0056560375,0.9749383,0.0007886226,0.015641533],"study_design_scores_gemma":[0.00002325892,0.00009595764,0.00033031448,0.000026435202,0.000011205897,0.0003327065,0.0001463637,0.011606159,0.009269007,0.96908116,0.009039421,0.000037978683],"about_ca_topic_score_codex":0.0005886545,"about_ca_topic_score_gemma":0.0004640615,"teacher_disagreement_score":0.005094921,"about_ca_system_score_codex":0.00054845307,"about_ca_system_score_gemma":0.0006293515,"threshold_uncertainty_score":0.017044187},"labels":[],"label_agreement":null},{"id":"W4408490938","doi":"10.61091/jcmcc124-08","title":"A class of constacyclic codes over \\(\\frac{\\mathbb{F}_{p^m}[u, v]}{\\left\\langle u^k, v^2, u v-v u\\right\\rangle}\\)","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Combinatorics; Physics; Mathematics; Computer science","score_opus":0.008560200244819571,"score_gpt":0.24957331413538608,"score_spread":0.2410131138905665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408490938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.92728215,0.0006195694,0.037740204,0.000367847,0.00010565903,0.000044843804,0.0004704595,0.000118517615,0.03325071],"genre_scores_gemma":[0.97714806,0.00036010638,0.0117525095,0.00011520085,0.00012641809,0.000055272336,0.000618118,0.000034290908,0.009790125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960965,0.00003427171,0.0000227075,0.000129798,0.00010247882,0.00010103167],"domain_scores_gemma":[0.9988991,0.00038621158,0.00030220943,0.00014570531,0.00013826,0.00012850626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019301302,0.00028798744,0.00025936292,0.00085677294,0.0011330243,0.0012441719,0.00041788665,0.00045104485,0.0027053864],"category_scores_gemma":[0.0014272457,0.0001641964,0.00029213497,0.0007223265,0.0016718085,0.0012436965,0.00073076546,0.0010631932,0.00038593682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019254482,0.000051836472,0.0030145857,0.000085099535,0.000010436945,0.00046781785,0.0006919127,0.0037019409,0.00909735,0.9522503,0.0013015188,0.029134644],"study_design_scores_gemma":[0.00010790436,0.00037607804,0.005799546,0.0001304779,0.00004380172,0.002135204,0.00079657533,0.030491063,0.02290141,0.89333284,0.043767087,0.000118002485],"about_ca_topic_score_codex":0.00091636484,"about_ca_topic_score_gemma":0.0009342208,"teacher_disagreement_score":0.0027053864,"about_ca_system_score_codex":0.0008359222,"about_ca_system_score_gemma":0.00080446294,"threshold_uncertainty_score":0.009050429},"labels":[],"label_agreement":null},{"id":"W4409115157","doi":"10.1016/j.disc.2025.114500","title":"The graph of a family of functions over quadratic extensions of finite fields","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Quadratic equation; Combinatorics; Graph; Discrete mathematics; Finite graph","score_opus":0.0159986512985675,"score_gpt":0.26208359964935496,"score_spread":0.24608494835078745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409115157","genre_codex":"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.8467952,0.00035957588,0.12877758,0.0007433144,0.000045164124,0.000054785363,0.00027643592,0.00027470273,0.022673236],"genre_scores_gemma":[0.966888,0.00021273368,0.026166,0.00010793039,0.000041280047,0.000051779447,0.00021348403,0.000073082316,0.006245854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998134,0.000052856758,0.0000058844157,0.00004248383,0.00004977874,0.000035604928],"domain_scores_gemma":[0.9988319,0.000553701,0.00013127316,0.0001227139,0.0001930988,0.0001672923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033639863,0.00024368295,0.00019222916,0.0011647562,0.00096266274,0.0006435479,0.00045013533,0.0005121253,0.0022857254],"category_scores_gemma":[0.0017968366,0.0002060086,0.00035556927,0.00059124804,0.0012912811,0.0013280918,0.00037213342,0.00065647793,0.00019255752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015255607,0.0000566112,0.003449022,0.000084718384,0.000020313726,0.0004605121,0.0006585745,0.021303274,0.019838942,0.9193009,0.002326463,0.03234811],"study_design_scores_gemma":[0.000035759396,0.00021428318,0.008087488,0.000045428016,0.000023554892,0.0012839286,0.0004303397,0.12457517,0.010660081,0.8395366,0.015041929,0.00006534626],"about_ca_topic_score_codex":0.0013753991,"about_ca_topic_score_gemma":0.001075655,"teacher_disagreement_score":0.0022857254,"about_ca_system_score_codex":0.0007252065,"about_ca_system_score_gemma":0.00032181278,"threshold_uncertainty_score":0.007646501},"labels":[],"label_agreement":null},{"id":"W4409685573","doi":"10.1109/lascas64004.2025.10966289","title":"A Novel and Efficient Large Integer Number Theoretic Transform Multiplier Based on Unified Blocks","year":2025,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Computer science; Integer (computer science); Mathematics; Algorithm; Arithmetic","score_opus":0.0060730478338142735,"score_gpt":0.2307963007107455,"score_spread":0.22472325287693123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409685573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.08521496,0.0017783645,0.89069986,0.00028792117,0.00024717717,0.00020870878,0.0001597219,0.0013533302,0.020049896],"genre_scores_gemma":[0.56143606,0.0006527663,0.4277234,0.0001763769,0.00009704741,0.00016624268,0.00026669833,0.00007216408,0.009409168],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998417,0.000024745688,0.000010330463,0.000028878789,0.00006720388,0.000027012858],"domain_scores_gemma":[0.9998963,0.00001897233,0.000022038701,0.00001893533,0.00003166949,0.000012038887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001996128,0.0003342034,0.00036014704,0.00040797895,0.00037785037,0.00053241424,0.0008336655,0.00034669455,0.0035143944],"category_scores_gemma":[0.00029214946,0.00020374416,0.0002478992,0.00047855717,0.00024195563,0.00095302035,0.00042535408,0.00043836076,0.0010379639],"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.000605581,0.00014405686,0.0006998988,0.00042546494,0.00007823472,0.0005079785,0.00014783582,0.021366782,0.5665838,0.11678028,0.0050685247,0.28759158],"study_design_scores_gemma":[0.00019649105,0.0020144444,0.0014412128,0.0000938995,0.00015346217,0.0020149515,0.00006513962,0.45207694,0.42660812,0.013131247,0.10210108,0.00010298788],"about_ca_topic_score_codex":0.00030326124,"about_ca_topic_score_gemma":0.0007646169,"teacher_disagreement_score":0.0035143944,"about_ca_system_score_codex":0.0003501407,"about_ca_system_score_gemma":0.00059988,"threshold_uncertainty_score":0.011756897},"labels":[],"label_agreement":null},{"id":"W4410193200","doi":"10.1016/j.ffa.2025.102648","title":"The second generalized covering radius of binary primitive double-error-correcting BCH codes","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"BCH code; Mathematics; Binary number; RADIUS; Discrete mathematics; Arithmetic; Combinatorics; Error detection and correction; Algorithm; Computer science","score_opus":0.014762619647715433,"score_gpt":0.2518076760788961,"score_spread":0.23704505643118065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410193200","genre_codex":"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.66639596,0.008211604,0.25498217,0.0018587789,0.00041858014,0.00006975275,0.0005123721,0.0006138324,0.066936925],"genre_scores_gemma":[0.97967726,0.0013320209,0.013913248,0.0001355687,0.00037285106,0.00005834452,0.00014056772,0.00008824315,0.0042817495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989378,0.00036232037,0.000048787977,0.00018040511,0.00031085566,0.00015981743],"domain_scores_gemma":[0.9949704,0.0028507488,0.0007319304,0.00060401333,0.00043763247,0.00040529406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010761623,0.0008811258,0.0011258064,0.0027094807,0.00090100017,0.0022374229,0.0011571082,0.0014888183,0.0022934342],"category_scores_gemma":[0.008190016,0.00042761554,0.00048945594,0.0013387079,0.0030396422,0.002672762,0.0018935095,0.0014358746,0.0005180916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021199018,0.000025498144,0.00077280734,0.00015238108,0.000030598127,0.0001402909,0.0003128202,0.03932999,0.006486107,0.93478864,0.001951637,0.015797213],"study_design_scores_gemma":[0.000034127315,0.00008137382,0.0014932841,0.000098014134,0.000025000507,0.0005683862,0.00013930725,0.19559039,0.006555098,0.7899173,0.0054047364,0.00009303114],"about_ca_topic_score_codex":0.00059931446,"about_ca_topic_score_gemma":0.00029388652,"teacher_disagreement_score":0.0027094807,"about_ca_system_score_codex":0.0013921374,"about_ca_system_score_gemma":0.0007301791,"threshold_uncertainty_score":0.010100722},"labels":[],"label_agreement":null},{"id":"W4410706585","doi":"10.1007/978-3-031-90229-1_5","title":"Increasing Index Sizes for Information Set Decoding Algorithms","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Decoding methods; Index (typography); Algorithm; Set (abstract data type); World Wide Web","score_opus":0.014154261852111117,"score_gpt":0.2513658610471208,"score_spread":0.23721159919500967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410706585","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.06114514,0.005028792,0.8154009,0.00808007,0.0012116545,0.0006903536,0.0021671967,0.0065006814,0.09977524],"genre_scores_gemma":[0.33196327,0.0038962585,0.6184923,0.0030812055,0.002136433,0.0019770102,0.0025264965,0.0037976229,0.032129396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98781407,0.0037871653,0.0007894515,0.0013246551,0.0051495745,0.0011350152],"domain_scores_gemma":[0.8906011,0.08686688,0.0021321734,0.014991294,0.0038017419,0.0016067834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007823102,0.0025087257,0.002952561,0.0036853203,0.0032578893,0.00607341,0.0056389184,0.0041063027,0.015439332],"category_scores_gemma":[0.06721806,0.0019297557,0.0020443539,0.0059088585,0.0045627467,0.014484732,0.006979847,0.008002722,0.0053456104],"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.00157988,0.00038138084,0.0010292276,0.00068218925,0.00008117458,0.00021016506,0.00056496746,0.07774151,0.012809774,0.58792114,0.043519605,0.27347884],"study_design_scores_gemma":[0.00014293387,0.000137857,0.00021866306,0.00018114825,0.000059577796,0.0002959005,0.000064495616,0.18284982,0.008491699,0.79881227,0.008688456,0.000057205154],"about_ca_topic_score_codex":0.0011134938,"about_ca_topic_score_gemma":0.0016814563,"teacher_disagreement_score":0.015439332,"about_ca_system_score_codex":0.006269632,"about_ca_system_score_gemma":0.0038298338,"threshold_uncertainty_score":0.05164969},"labels":[],"label_agreement":null},{"id":"W4410813117","doi":"10.1016/j.ffa.2025.102660","title":"Linear codes with few weights from vectorial dual-bent functions","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Qufu Normal University","keywords":"Bent molecular geometry; Mathematics; Dual (grammatical number); Combinatorics; Bent function; Discrete mathematics; Algebra over a field; Boolean function; Pure mathematics","score_opus":0.0072687133727059395,"score_gpt":0.21116720648958442,"score_spread":0.2038984931168785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410813117","genre_codex":"methods","genre_gemma":"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.36558658,0.002537477,0.5343105,0.002952989,0.0012103559,0.00013902773,0.00070492696,0.00089355995,0.09166471],"genre_scores_gemma":[0.8789129,0.0016546592,0.07375605,0.0011977238,0.0011515926,0.00022044023,0.0005525233,0.00056013407,0.041993994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912304,0.00024814683,0.000047295744,0.00013806671,0.00028309677,0.00016035474],"domain_scores_gemma":[0.9979602,0.0009276479,0.00028495194,0.0003421966,0.00025878448,0.00022624621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086618855,0.0013103412,0.0008614246,0.0023162058,0.0011463097,0.002447684,0.0011858535,0.0020324162,0.005154021],"category_scores_gemma":[0.0053444165,0.00074595754,0.0007281448,0.0017786067,0.0026008575,0.003558344,0.00289921,0.003622181,0.002003868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007134057,0.000029591918,0.00016149961,0.000046606237,0.000007725906,0.00006487962,0.000121820296,0.002287791,0.00271899,0.980978,0.0011370126,0.012374649],"study_design_scores_gemma":[0.000013118359,0.000019803429,0.000099752826,0.000032099473,0.000006911782,0.00013780457,0.000024847594,0.010781318,0.0015533961,0.9848845,0.0024195686,0.000026801295],"about_ca_topic_score_codex":0.00042914524,"about_ca_topic_score_gemma":0.00047232985,"teacher_disagreement_score":0.005154021,"about_ca_system_score_codex":0.0010095811,"about_ca_system_score_gemma":0.00080797274,"threshold_uncertainty_score":0.017241895},"labels":[],"label_agreement":null},{"id":"W4411146828","doi":"10.1016/j.tcs.2025.115392","title":"Full domain functional bootstrapping using the prime cyclotomic ring","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chinese Academy of Sciences; Canadian Anesthesiologists' Society","keywords":"Bootstrapping (finance); Prime (order theory); Ring (chemistry); Domain (mathematical analysis); Mathematics; Computer science; Arithmetic; Discrete mathematics; Combinatorics; Econometrics","score_opus":0.01338887354693723,"score_gpt":0.24919515177760657,"score_spread":0.23580627823066933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411146828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.3968428,0.0006512611,0.49943486,0.0013105548,0.00043344885,0.00011601181,0.00022675075,0.0011389903,0.09984522],"genre_scores_gemma":[0.9558007,0.00025721258,0.03346926,0.00021375794,0.0002003655,0.00004569104,0.00009193772,0.00017224404,0.009748765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995253,0.00013830024,0.000014870719,0.00008437628,0.0001331918,0.000103978186],"domain_scores_gemma":[0.9990847,0.00031833004,0.000060987542,0.00032957137,0.0001014935,0.00010498863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007420919,0.0004543408,0.0006816052,0.00084990787,0.0009864254,0.0012396927,0.00066097546,0.0007572702,0.006844786],"category_scores_gemma":[0.0027585877,0.0002525922,0.0006119856,0.00047443665,0.0020016627,0.0027248284,0.0018773155,0.0014647152,0.0011094438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012200471,0.000025909922,0.00014543917,0.00003521092,0.000007917173,0.0001218983,0.00008678228,0.0049587423,0.0034237502,0.97504616,0.0013467028,0.014679504],"study_design_scores_gemma":[0.00002979845,0.000057463272,0.00015349106,0.000014235873,0.000008923376,0.00017299333,0.00003808351,0.04860363,0.0044199964,0.94259596,0.0038822459,0.000023234094],"about_ca_topic_score_codex":0.0002791247,"about_ca_topic_score_gemma":0.00019870057,"teacher_disagreement_score":0.006844786,"about_ca_system_score_codex":0.00046016838,"about_ca_system_score_gemma":0.0004055962,"threshold_uncertainty_score":0.022898078},"labels":[],"label_agreement":null},{"id":"W4411319887","doi":"10.1145/3717823.3718106","title":"High Rate Multivariate Polynomial Evaluation Codes","year":2025,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multivariate statistics; Computer science; Polynomial; Algorithm; Mathematics; Machine learning","score_opus":0.015814278145214505,"score_gpt":0.28121949894585924,"score_spread":0.2654052208006447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411319887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.14922601,0.002781589,0.76701427,0.0059204386,0.00064494705,0.00019028952,0.0010698789,0.00190918,0.07124338],"genre_scores_gemma":[0.90830773,0.0014517511,0.055620242,0.0007880829,0.00070788566,0.00016423548,0.00039053994,0.00044377294,0.03212578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977036,0.00067564665,0.000085823056,0.00025215535,0.00086382247,0.0004188859],"domain_scores_gemma":[0.9938356,0.0031215583,0.0005825491,0.0014079047,0.00070965785,0.00034262563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022039593,0.0008631517,0.0009061093,0.0014185011,0.0009063687,0.0026083977,0.0009970037,0.0010490712,0.011988652],"category_scores_gemma":[0.012931192,0.00040374033,0.00047523555,0.0022885217,0.0017747951,0.0038972949,0.003516359,0.0027750784,0.0029067323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042523164,0.00006379615,0.00064257433,0.00012528736,0.000021310301,0.00012328394,0.00012303892,0.01468348,0.004916493,0.918769,0.0066367215,0.05346985],"study_design_scores_gemma":[0.00010284779,0.00010705917,0.0007775088,0.00012682275,0.000034144756,0.00051746715,0.000048746937,0.1014636,0.012470472,0.8700797,0.014185445,0.00008622619],"about_ca_topic_score_codex":0.0004931347,"about_ca_topic_score_gemma":0.0005609537,"teacher_disagreement_score":0.011988652,"about_ca_system_score_codex":0.0015230232,"about_ca_system_score_gemma":0.0013756474,"threshold_uncertainty_score":0.040106},"labels":[],"label_agreement":null},{"id":"W4411599115","doi":"10.61091/jcmcc126-21","title":"On negacyclic codes of length \\(5p^s\\) over \\(\\mathbb{F}_{p^m}+u \\mathbb{F}_{p^m}\\)","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Combinatorics; Mathematics","score_opus":0.009586833770709654,"score_gpt":0.25546216318416476,"score_spread":0.2458753294134551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.9070664,0.0014086239,0.051671352,0.00083890755,0.00013586957,0.00006387658,0.00073051936,0.00014629697,0.037938055],"genre_scores_gemma":[0.97234356,0.0012233129,0.011727583,0.00021909275,0.000189911,0.000080724414,0.0013115956,0.00006734172,0.012836934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993794,0.00006924544,0.00003653254,0.00015560967,0.00017309735,0.00018600305],"domain_scores_gemma":[0.9979715,0.0010963074,0.00042600394,0.00016060477,0.00017906133,0.00016652225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034173555,0.00066779763,0.0004707481,0.0015968455,0.0009846265,0.0012453123,0.00047488842,0.00072830543,0.0034274322],"category_scores_gemma":[0.0026097405,0.0002292871,0.00037815652,0.001675309,0.001863511,0.001413408,0.0010572326,0.0013249998,0.000695242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006336926,0.00017539566,0.0052082115,0.00021928681,0.000020925503,0.00063319935,0.001089513,0.032680187,0.02252972,0.8447629,0.005287931,0.08675891],"study_design_scores_gemma":[0.00013826329,0.0006535538,0.0077354694,0.00028296775,0.000050998326,0.0018973738,0.0006926885,0.106647596,0.022016656,0.8309311,0.028816368,0.00013688634],"about_ca_topic_score_codex":0.0019671575,"about_ca_topic_score_gemma":0.002191277,"teacher_disagreement_score":0.0034274322,"about_ca_system_score_codex":0.0012188676,"about_ca_system_score_gemma":0.00085055636,"threshold_uncertainty_score":0.011465967},"labels":[],"label_agreement":null},{"id":"W4411599128","doi":"10.61091/jcmcc126-17","title":"Perfect truncated-metric codes in lattice graphs and superlattice graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lattice (music); Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.009980412928587685,"score_gpt":0.25002859726437976,"score_spread":0.2400481843357921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.5972229,0.0005437923,0.25922424,0.0025461344,0.0007862675,0.00013468522,0.0010584709,0.0013189835,0.13716456],"genre_scores_gemma":[0.9117672,0.0003243123,0.05209147,0.00072045415,0.00033306138,0.00017146165,0.0007383612,0.00046304407,0.033390716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00019698558,0.000043654527,0.00015420343,0.0003052815,0.00016813162],"domain_scores_gemma":[0.99873024,0.00027937914,0.00016121045,0.0001890628,0.00027522355,0.0003648624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005998102,0.0006208677,0.00070988445,0.001626666,0.0013268876,0.002152995,0.0010528634,0.00084752863,0.007309663],"category_scores_gemma":[0.0027038648,0.00038226528,0.0006784416,0.001248764,0.0024570287,0.002473075,0.0015842814,0.0020341848,0.0012301444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021111504,0.000009001863,0.000084866966,0.000017109764,0.0000025594582,0.000033238914,0.00008278852,0.0017812663,0.0005561106,0.9924757,0.0010198095,0.003916486],"study_design_scores_gemma":[0.000011492975,0.000014339625,0.00013721194,0.000008709549,0.0000020207603,0.00003921729,0.00006426114,0.01434429,0.00067115214,0.98266554,0.0020262306,0.00001547294],"about_ca_topic_score_codex":0.0042003905,"about_ca_topic_score_gemma":0.0039181886,"teacher_disagreement_score":0.007309663,"about_ca_system_score_codex":0.0022970485,"about_ca_system_score_gemma":0.0011762824,"threshold_uncertainty_score":0.024453282},"labels":[],"label_agreement":null},{"id":"W4411643374","doi":"10.1103/bq28-r2r7","title":"Classical and Quantum Algorithms for Characters of the Symmetric Group","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Canadian Institute for Advanced Research; International Business Machines Corporation","keywords":"Group (periodic table); Quantum; Algorithm; Computer science; Algebra over a field; Mathematics; Pure mathematics; Quantum mechanics; Physics","score_opus":0.018705742008315887,"score_gpt":0.2574392845268054,"score_spread":0.23873354251848955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411643374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.068503104,0.0005930334,0.8866261,0.0031538415,0.00032252166,0.00038969895,0.00070040335,0.0034221618,0.0362891],"genre_scores_gemma":[0.4253746,0.00038436195,0.5481543,0.00061290123,0.00021579492,0.00045464453,0.0013543812,0.00064061367,0.022808308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973894,0.00068180275,0.00016013926,0.0006444602,0.0007394567,0.00038474292],"domain_scores_gemma":[0.99695,0.0015172131,0.00017362853,0.0007913682,0.00042322124,0.00014460587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014693722,0.00084264914,0.0006807042,0.00096355146,0.0016905842,0.00299925,0.0019918403,0.001874553,0.010807503],"category_scores_gemma":[0.0076342076,0.00048515332,0.001480291,0.0012478847,0.0017927078,0.006061804,0.0029782378,0.0026594172,0.0030523066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037773032,0.00022334878,0.000589866,0.00020386546,0.00005338566,0.000101096615,0.00044589036,0.03909343,0.0058636484,0.7785962,0.015703319,0.15874822],"study_design_scores_gemma":[0.00009742608,0.000074856696,0.00017048822,0.000035061414,0.000020954047,0.000072125804,0.00010498598,0.2530513,0.0069054943,0.7306773,0.008754937,0.00003504848],"about_ca_topic_score_codex":0.002223973,"about_ca_topic_score_gemma":0.002965144,"teacher_disagreement_score":0.010807503,"about_ca_system_score_codex":0.0027064788,"about_ca_system_score_gemma":0.0029908346,"threshold_uncertainty_score":0.036154747},"labels":[],"label_agreement":null},{"id":"W4411720738","doi":"10.61091/ars163-08","title":"Type I and type II codes over the ring \\({\\mathbb F}_2+u{\\mathbb F}_2+u^2{\\mathbb F}_2+u^3{\\mathbb F}_2\\)","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Ring (chemistry); Chemistry; Geology","score_opus":0.009220630435054828,"score_gpt":0.24031467567472292,"score_spread":0.2310940452396681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.85196584,0.0006170848,0.0636056,0.0007391302,0.00032292824,0.000092338465,0.0008858124,0.00027269428,0.081498556],"genre_scores_gemma":[0.96531415,0.00034074357,0.016954515,0.00017554351,0.00015734238,0.00007514811,0.00039516206,0.00012171423,0.016465802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993285,0.00009349865,0.000036230012,0.0001298816,0.00018031828,0.00023161076],"domain_scores_gemma":[0.99878985,0.00022971077,0.0003669327,0.00019688475,0.00019300025,0.0002236147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034072596,0.00051546487,0.0002846805,0.0010384322,0.0007743329,0.0014954994,0.00047234105,0.0006315789,0.0059597096],"category_scores_gemma":[0.0016370198,0.00019164881,0.00045018533,0.00067043037,0.0014433484,0.0014438137,0.0010711643,0.0008987859,0.00078293425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035253845,0.00008431911,0.0025702883,0.000092882736,0.000016899661,0.0003064191,0.00035957116,0.0052516377,0.01060727,0.952515,0.0025778087,0.025265187],"study_design_scores_gemma":[0.00010177075,0.00034034895,0.0034838154,0.000116165895,0.000052754935,0.0010900487,0.00059942104,0.042417455,0.032256145,0.89822924,0.021216612,0.00009614954],"about_ca_topic_score_codex":0.00058678805,"about_ca_topic_score_gemma":0.0006359842,"teacher_disagreement_score":0.0059597096,"about_ca_system_score_codex":0.00080612086,"about_ca_system_score_gemma":0.0006781029,"threshold_uncertainty_score":0.019937277},"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":"W4411790448","doi":"10.1007/s12095-025-00823-5","title":"New successor rules to efficiently produce exponentially many binary de Bruijn sequences","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Fujian Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Nanyang Technological University","keywords":"De Bruijn sequence; Successor cardinal; Binary number; Computer science; Sequence (biology); Arithmetic; Combinatorics; Mathematics; Biology; Genetics","score_opus":0.014948405639395227,"score_gpt":0.2771713694160146,"score_spread":0.2622229637766194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411790448","genre_codex":"methods","genre_gemma":"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.05931409,0.0005628347,0.89453125,0.00082606863,0.0008836193,0.00030298065,0.00040413588,0.003888815,0.03928616],"genre_scores_gemma":[0.36864293,0.00040673604,0.6057753,0.0005177681,0.00022406843,0.00036087385,0.0008411936,0.001118761,0.022112291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982222,0.00044691705,0.0001882421,0.00027650173,0.0006815825,0.00018456174],"domain_scores_gemma":[0.99530506,0.0024858594,0.00015437047,0.0010856076,0.00075886695,0.00021022512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134197,0.00073100894,0.0007450666,0.0011519162,0.0011474753,0.0022610894,0.0013342211,0.00090371666,0.009423729],"category_scores_gemma":[0.007635129,0.0006221282,0.0007620695,0.0010218599,0.0012528922,0.0036053895,0.0026996455,0.0023440944,0.0036495342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005420939,0.0005288878,0.0007869477,0.00042784563,0.000050292634,0.0003382463,0.00043043238,0.025397299,0.033156693,0.5557266,0.018338302,0.36427635],"study_design_scores_gemma":[0.00018451744,0.00022271872,0.000199876,0.00014229536,0.000064659944,0.00042916852,0.00011634539,0.20425409,0.04835012,0.7131899,0.032762665,0.00008359746],"about_ca_topic_score_codex":0.00041266237,"about_ca_topic_score_gemma":0.0015591951,"teacher_disagreement_score":0.009423729,"about_ca_system_score_codex":0.00062786776,"about_ca_system_score_gemma":0.0012487391,"threshold_uncertainty_score":0.031525552},"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":"W4412623673","doi":"10.1109/tit.2025.3592490","title":"Improved Constructions of Skew-Tolerant Gray Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Skew; Computer science; Gray code; Gray (unit); Mathematics; Algorithm; Telecommunications","score_opus":0.004925184053069241,"score_gpt":0.21465684968382953,"score_spread":0.2097316656307603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.1344705,0.0008039254,0.8353713,0.00062181096,0.00028613931,0.0001555398,0.00044221865,0.0016128027,0.026235765],"genre_scores_gemma":[0.6845263,0.00077120104,0.29146746,0.0005397598,0.00014888946,0.0002133681,0.00073765725,0.00039798746,0.021197388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.00018474787,0.00007956455,0.00015267967,0.0004820179,0.00019511813],"domain_scores_gemma":[0.99792117,0.0004619018,0.00020891274,0.0007226613,0.000513704,0.0001717239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006688295,0.00064642134,0.00066481694,0.0013052908,0.0008109806,0.0010921416,0.0009902588,0.0005354525,0.0036880404],"category_scores_gemma":[0.0032088598,0.00039876046,0.0006324946,0.001091985,0.001125013,0.0015698202,0.002685264,0.0015118683,0.00118757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000413756,0.00009646776,0.00108402,0.00024265503,0.000039912826,0.0004523473,0.0005984284,0.090532444,0.054093774,0.6712684,0.0074582165,0.17371947],"study_design_scores_gemma":[0.00012419224,0.0003936195,0.0007381718,0.00011365827,0.000063005435,0.0011275576,0.00018981454,0.3909012,0.10698574,0.4534703,0.04574161,0.00015119581],"about_ca_topic_score_codex":0.0007455472,"about_ca_topic_score_gemma":0.0007439308,"teacher_disagreement_score":0.0036880404,"about_ca_system_score_codex":0.00097349,"about_ca_system_score_gemma":0.001005572,"threshold_uncertainty_score":0.012337685},"labels":[],"label_agreement":null},{"id":"W4412647240","doi":"10.55016/ojs/cdm.v3i1.61969","title":"The transitive and co-transitive blocking sets in P^2(F_q)","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Combinatorics; Blocking (statistics); Transitive reduction; Transitive closure; Graph; Statistics; Line graph; Voltage graph","score_opus":0.012679004613922034,"score_gpt":0.27959254246855,"score_spread":0.26691353785462796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647240","genre_codex":"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.79157543,0.0008013412,0.09980384,0.00061965385,0.00007971182,0.00011776993,0.001188383,0.00029031985,0.1055236],"genre_scores_gemma":[0.9658284,0.00034694144,0.018750817,0.000078115634,0.000049144062,0.0001050305,0.0010182182,0.00006346427,0.01375983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947315,0.000056703244,0.000027457658,0.00009252513,0.00013517917,0.00021506049],"domain_scores_gemma":[0.99910223,0.00032321733,0.0002126851,0.00012192343,0.00011444519,0.0001254678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004586735,0.0005980073,0.0005273668,0.001617469,0.0017529349,0.0028862515,0.000941306,0.00071188103,0.0055723633],"category_scores_gemma":[0.0012162258,0.00036710384,0.0005847594,0.0012501505,0.0018159904,0.0027540212,0.00096616865,0.0010484298,0.000940619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014644797,0.000038437596,0.0013704401,0.000054857213,0.000014370918,0.000096011965,0.00035951546,0.0021824085,0.003884686,0.9821529,0.0012162088,0.008483748],"study_design_scores_gemma":[0.00005414455,0.000075803844,0.002628813,0.000055330634,0.00004526847,0.00052301754,0.00053245167,0.01423511,0.0103837205,0.9484722,0.02295168,0.000042444673],"about_ca_topic_score_codex":0.003537449,"about_ca_topic_score_gemma":0.0025060927,"teacher_disagreement_score":0.0055723633,"about_ca_system_score_codex":0.0013441215,"about_ca_system_score_gemma":0.0008270977,"threshold_uncertainty_score":0.018641353},"labels":[],"label_agreement":null},{"id":"W4412647898","doi":"10.55016/ojs/cdm.v2i1.61875","title":"Classes of codes from quadratic surfaces of PG(3,q)","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Quadratic equation; Geometry","score_opus":0.013079741330489067,"score_gpt":0.2896136453142532,"score_spread":0.27653390398376415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647898","genre_codex":"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.8800588,0.000994831,0.07154414,0.0010621888,0.00009511266,0.00008734723,0.00034411653,0.00037292094,0.045440476],"genre_scores_gemma":[0.9805252,0.00057765224,0.0115844775,0.00016877335,0.000097706936,0.00007765791,0.000424673,0.0001007341,0.006443126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933475,0.00006817632,0.000026059206,0.000104840685,0.00031009992,0.0001560326],"domain_scores_gemma":[0.9985524,0.00065023144,0.00028651828,0.00018277108,0.00018429614,0.00014385585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003348987,0.00059510436,0.0004926883,0.0019742148,0.001433978,0.002098869,0.00063032185,0.0010425126,0.003226251],"category_scores_gemma":[0.0026051681,0.0002574879,0.0004596057,0.0014073706,0.0023757163,0.002119021,0.0011075283,0.0014960371,0.0003544771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001123687,0.00003681181,0.0019783515,0.00011928414,0.000012667873,0.00033149592,0.0006419484,0.012343619,0.005449718,0.951,0.0015163579,0.026457349],"study_design_scores_gemma":[0.0000800314,0.00014496944,0.004037775,0.00014244857,0.000026452888,0.0014774399,0.00048145402,0.070574395,0.0170957,0.87906706,0.026783513,0.00008883779],"about_ca_topic_score_codex":0.001438993,"about_ca_topic_score_gemma":0.0008223785,"teacher_disagreement_score":0.003226251,"about_ca_system_score_codex":0.0013545622,"about_ca_system_score_gemma":0.00056346046,"threshold_uncertainty_score":0.010792911},"labels":[],"label_agreement":null},{"id":"W4412648042","doi":"10.55016/ojs/cdm.v1i1.61901","title":"Classification of linear codes exploiting an invariant","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Invariant (physics); Combinatorics; Discrete mathematics","score_opus":0.024009442177748672,"score_gpt":0.28978886986806357,"score_spread":0.2657794276903149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.40394294,0.00041614825,0.58065945,0.0005209439,0.00015766986,0.00010187332,0.00027774757,0.00037762304,0.013545531],"genre_scores_gemma":[0.8592282,0.00034615715,0.13442133,0.00015543526,0.00027566077,0.0000926672,0.0008975247,0.00011840216,0.004464611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986071,0.00017981183,0.00012202489,0.0002648063,0.0005901085,0.0002361662],"domain_scores_gemma":[0.99711466,0.0009870201,0.0005501343,0.00072964403,0.0004209153,0.00019766587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008174874,0.00038341366,0.00082819595,0.0023138036,0.0008886432,0.0020195607,0.0007917782,0.0007888189,0.0022121768],"category_scores_gemma":[0.00415464,0.0002093816,0.00093331427,0.0016486768,0.0023184866,0.0027858168,0.0015968082,0.0013012945,0.00058774435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026541998,0.00018453806,0.0038077082,0.00014441607,0.000033676693,0.00025480657,0.00065402285,0.03141355,0.013693456,0.7813537,0.0026611486,0.16553357],"study_design_scores_gemma":[0.00002861242,0.00024600222,0.0014676743,0.000028927227,0.000019583542,0.00035553673,0.00018452833,0.2211605,0.011584484,0.7592004,0.0056717894,0.000052039475],"about_ca_topic_score_codex":0.00093919813,"about_ca_topic_score_gemma":0.0004605848,"teacher_disagreement_score":0.0023138036,"about_ca_system_score_codex":0.0010441402,"about_ca_system_score_gemma":0.0005983858,"threshold_uncertainty_score":0.00757581},"labels":[],"label_agreement":null},{"id":"W4412710571","doi":"10.1016/j.jalgebra.2025.07.016","title":"Positivity preservers over finite fields","year":2025,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Defence Science and Technology Group; Directorate for Mathematical and Physical Sciences; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; Plymouth University; Pacific Institute for the Mathematical Sciences; Indian Institute of Science; Simons Foundation; American Institute of Mathematics; Science and Engineering Research Board; National Science Foundation","keywords":"Mathematics; Pure mathematics","score_opus":0.006301348979913577,"score_gpt":0.24062356465520532,"score_spread":0.23432221567529174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412710571","genre_codex":"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.6111013,0.0009473893,0.1432633,0.005003239,0.0010410108,0.00012915058,0.000674184,0.0007467729,0.2370937],"genre_scores_gemma":[0.9565939,0.0004835635,0.00727145,0.0005608172,0.0008019825,0.0000655192,0.00022545145,0.00019588329,0.033801388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848324,0.0003516833,0.000089822475,0.00028715873,0.00042518714,0.0003629047],"domain_scores_gemma":[0.9953603,0.0018038991,0.0006165793,0.0005075047,0.0006084175,0.0011032273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021745916,0.0008222375,0.0010818131,0.0025626593,0.00383423,0.004203174,0.0010786508,0.0012359951,0.009379914],"category_scores_gemma":[0.0043312884,0.0008176628,0.0010231677,0.0017635244,0.0052977195,0.010633291,0.0037225967,0.00442862,0.0011769492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048484533,0.000021411697,0.00008727773,0.000012217447,0.0000045880533,0.00006583711,0.00014891112,0.00010718557,0.0005193423,0.99699044,0.00049231196,0.0015019987],"study_design_scores_gemma":[0.000017117545,0.000018680008,0.00010977395,0.000005707984,0.000004924397,0.000100721365,0.00004635771,0.00053043314,0.00035306255,0.9974866,0.0013173389,0.0000093329745],"about_ca_topic_score_codex":0.0006784888,"about_ca_topic_score_gemma":0.00067931734,"teacher_disagreement_score":0.009379914,"about_ca_system_score_codex":0.001501451,"about_ca_system_score_gemma":0.0010818281,"threshold_uncertainty_score":0.031378984},"labels":[],"label_agreement":null},{"id":"W4412809371","doi":"10.1016/j.ffa.2025.102710","title":"Construction of (n,n)-functions with low differential-linear uniformity","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Hubei Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Differential (mechanical device); Pure mathematics; Linear differential equation; Discrete mathematics; Mathematical analysis; Combinatorics; Differential equation; Physics","score_opus":0.005076776265270787,"score_gpt":0.20212316995202365,"score_spread":0.19704639368675286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412809371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.3802149,0.0005760736,0.5449386,0.0011052468,0.00035478515,0.00011739383,0.00023395118,0.00092040416,0.071538694],"genre_scores_gemma":[0.8918521,0.00029564582,0.082699284,0.000391399,0.00016031013,0.00013832623,0.00020711315,0.00020970847,0.024046179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995098,0.0001471109,0.000028597131,0.00009431992,0.00009514621,0.0001249884],"domain_scores_gemma":[0.99931943,0.00026874788,0.00007051973,0.00011326028,0.000082778635,0.00014527714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079978403,0.00069902197,0.0006731767,0.0012037245,0.0013021884,0.0013653412,0.0008232602,0.00081697555,0.0031438563],"category_scores_gemma":[0.001596014,0.00038777784,0.000693981,0.0008431985,0.002074147,0.0019860477,0.0029507831,0.0013744981,0.00081848365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111775604,0.00003550086,0.0003684113,0.00004685041,0.0000070266,0.00013637531,0.00017722217,0.0015476423,0.008031012,0.9731724,0.0010453156,0.015320388],"study_design_scores_gemma":[0.00006964912,0.0001502991,0.0006360361,0.000047620437,0.000025531592,0.00052251364,0.00012494266,0.018635143,0.025684977,0.93918204,0.014862057,0.00005922611],"about_ca_topic_score_codex":0.00027580268,"about_ca_topic_score_gemma":0.00024599562,"teacher_disagreement_score":0.0031438563,"about_ca_system_score_codex":0.0012546871,"about_ca_system_score_gemma":0.00064829696,"threshold_uncertainty_score":0.01051724},"labels":[],"label_agreement":null},{"id":"W4413267765","doi":"10.1109/ojcoms.2025.3593140","title":"Fact-Checking 5G Security: Bridging the Gap Between Expectations and Reality","year":2025,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Spanish National Plan for Scientific and Technical Research and Innovation; Institució Catalana de Recerca i Estudis Avançats; European Commission","keywords":"Bridging (networking); Computer security; Computer science; Business","score_opus":0.08491558144744353,"score_gpt":0.3602592592662317,"score_spread":0.27534367781878816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413267765","genre_codex":"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.7456861,0.004703622,0.14435482,0.026565075,0.00068680383,0.00024688206,0.002971169,0.0014167012,0.07336885],"genre_scores_gemma":[0.9834816,0.00078623946,0.012937209,0.0008836463,0.000073882795,0.000033238506,0.00090105925,0.00010961581,0.00079350785],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99281836,0.0026577911,0.00034947632,0.00081583543,0.0027688255,0.00058962125],"domain_scores_gemma":[0.9598521,0.019732587,0.0056650927,0.0053885938,0.00819682,0.0011648268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010637444,0.00051395013,0.00046316173,0.0019377605,0.0013479873,0.006355748,0.0012107885,0.0014273354,0.0019727394],"category_scores_gemma":[0.043282103,0.00032525437,0.0002982492,0.0022512057,0.0027539243,0.012897299,0.0022548803,0.002767009,0.00058224285],"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.0006826077,0.00018398157,0.38158864,0.00078175607,0.00020044595,0.0014735456,0.009780329,0.0476523,0.008040032,0.23644298,0.033150367,0.28002292],"study_design_scores_gemma":[0.00006563566,0.00067773525,0.21372387,0.0019158489,0.00022866575,0.0027283977,0.028255196,0.29015175,0.013193095,0.22996555,0.21862032,0.0004739488],"about_ca_topic_score_codex":0.009544349,"about_ca_topic_score_gemma":0.007746068,"teacher_disagreement_score":0.010637444,"about_ca_system_score_codex":0.0027383221,"about_ca_system_score_gemma":0.0022102841,"threshold_uncertainty_score":0.05625689},"labels":[],"label_agreement":null},{"id":"W4413395728","doi":"10.1080/00927872.2025.2541931","title":"Existence and nonexistence of permutation trinomials in odd characteristics","year":2025,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"University Grants Commission of Bangladesh","keywords":"Trinomial; Mathematics; Permutation (music); Combinatorics; Pure mathematics; Physics","score_opus":0.026333597666429384,"score_gpt":0.3057598996862343,"score_spread":0.2794263020198049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413395728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.950852,0.00041199537,0.033568747,0.00060428376,0.000052986095,0.000024690764,0.00018058905,0.00007810878,0.0142266955],"genre_scores_gemma":[0.9937271,0.00017907086,0.00330913,0.00005044485,0.000050945233,0.000027596538,0.00013697967,0.000025628628,0.0024929661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987056,0.00026273716,0.00007899264,0.00027548513,0.0002576996,0.00041945782],"domain_scores_gemma":[0.9902928,0.0057441676,0.0017102964,0.00075689604,0.0007271366,0.0007686787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011078629,0.00024350271,0.0006738751,0.0013431701,0.0015952877,0.002053649,0.00083904166,0.000585208,0.0024697972],"category_scores_gemma":[0.011300853,0.0005958712,0.0005400754,0.0010368836,0.003163127,0.0030525487,0.001809509,0.0016530567,0.00033041154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007060238,0.000099940946,0.018966116,0.00019583113,0.00003347044,0.0019899237,0.0013355332,0.0046122563,0.014207319,0.93798417,0.0022748841,0.01759459],"study_design_scores_gemma":[0.00015760143,0.00024268635,0.0066324812,0.00008388328,0.00004352148,0.0035567465,0.0007675473,0.035737965,0.013180563,0.9321909,0.007298378,0.00010783387],"about_ca_topic_score_codex":0.0010803456,"about_ca_topic_score_gemma":0.0007533227,"teacher_disagreement_score":0.0024697972,"about_ca_system_score_codex":0.0010346659,"about_ca_system_score_gemma":0.0011243691,"threshold_uncertainty_score":0.008262336},"labels":[],"label_agreement":null},{"id":"W4413608238","doi":"10.3390/jsan14050086","title":"Efficient and Low-Cost Modular Polynomial Multiplier for WSN Security","year":2025,"lang":"en","type":"article","venue":"Journal of Sensor and Actuator Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Modular design; Multiplier (economics); Polynomial; Computer security; Mathematics; Programming language; Economics","score_opus":0.004999587297650567,"score_gpt":0.22610221801728347,"score_spread":0.2211026307196329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413608238","genre_codex":"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.15417543,0.0022845923,0.82899094,0.0003596853,0.00018664803,0.00011910413,0.00011003867,0.0009723825,0.012801305],"genre_scores_gemma":[0.8706066,0.0006492231,0.12392738,0.00006266666,0.00004045207,0.00004268497,0.00007670599,0.000035894096,0.004558412],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99990475,0.000019077253,0.0000053187728,0.000019040282,0.00003747358,0.0000143486395],"domain_scores_gemma":[0.9998884,0.00002737685,0.000024232444,0.000019648507,0.000033831762,0.000006460059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014294847,0.0003523978,0.00020004512,0.000327733,0.00029564323,0.00034218823,0.00050180027,0.00026184434,0.002548933],"category_scores_gemma":[0.00041383,0.00013481216,0.00024982492,0.0003202937,0.00016910429,0.0005905294,0.00021863008,0.00036943954,0.00053797563],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005273194,0.00009353664,0.000897858,0.0005353844,0.00008666943,0.00044060693,0.000117463416,0.054745153,0.5910535,0.059406232,0.0031254813,0.2889709],"study_design_scores_gemma":[0.00017942225,0.0017144796,0.0016066589,0.000120647645,0.00016697346,0.0021081641,0.000073745985,0.46905103,0.4507821,0.020102149,0.05401257,0.000082069455],"about_ca_topic_score_codex":0.00023959068,"about_ca_topic_score_gemma":0.0005341804,"teacher_disagreement_score":0.002548933,"about_ca_system_score_codex":0.00034371097,"about_ca_system_score_gemma":0.0004028451,"threshold_uncertainty_score":0.0085270405},"labels":[],"label_agreement":null},{"id":"W4415350706","doi":"10.46298/dmtcs.15939","title":"Low complexity binary words avoiding $(5/2)^+$-powers","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Binary number; Cover (algebra); Word (group theory); Structured program theorem; Feature (linguistics)","score_opus":0.016745601426225484,"score_gpt":0.2703264039003534,"score_spread":0.2535808024741279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415350706","genre_codex":"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.76187813,0.00094788993,0.11940903,0.001997948,0.0002561393,0.000118633165,0.00055101694,0.0005504883,0.114290796],"genre_scores_gemma":[0.9452544,0.0003511496,0.029213687,0.00050743483,0.0001943207,0.0001501587,0.0004471949,0.00016101073,0.023720691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942124,0.00010952098,0.000052209114,0.00010787958,0.00013751218,0.00017170851],"domain_scores_gemma":[0.99816173,0.0009646749,0.00028064032,0.00027604448,0.00020832299,0.00010856911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037749627,0.00039206308,0.0004186324,0.0006509878,0.0012618076,0.002679915,0.0004918088,0.0007807163,0.008263493],"category_scores_gemma":[0.0032775046,0.00031935272,0.00054003036,0.00054537517,0.001890655,0.0042240834,0.001368336,0.0014459698,0.0021153148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016406649,0.000031425032,0.00080493896,0.0000777003,0.000006772033,0.00022741238,0.0005436663,0.0017490024,0.0073941504,0.96943,0.0025383348,0.017032515],"study_design_scores_gemma":[0.000051488503,0.0000818695,0.0006458404,0.000051378334,0.000020122905,0.00048990006,0.00036562615,0.0060017062,0.009180596,0.96335506,0.01971665,0.00003969998],"about_ca_topic_score_codex":0.00036354052,"about_ca_topic_score_gemma":0.00047271405,"teacher_disagreement_score":0.008263493,"about_ca_system_score_codex":0.0007034601,"about_ca_system_score_gemma":0.00043848445,"threshold_uncertainty_score":0.027644157},"labels":[],"label_agreement":null},{"id":"W4415367806","doi":"10.1109/isit63088.2025.11195625","title":"Improved Constructions of Skew-Tolerant Gray Codes","year":2025,"lang":"","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gray (unit); Gray code; Exponential function","score_opus":0.007889438034966365,"score_gpt":0.238796188712744,"score_spread":0.23090675067777763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415367806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.17208451,0.0015085029,0.7947369,0.00093010557,0.00048032217,0.00016220857,0.00032067686,0.001667108,0.028109655],"genre_scores_gemma":[0.7943074,0.0011813892,0.18977182,0.0005672329,0.00020704398,0.00015678987,0.00038696476,0.0003700273,0.013051383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989189,0.00019233153,0.0000727799,0.00012555826,0.00048534904,0.00020506764],"domain_scores_gemma":[0.9972632,0.00078359013,0.00024325683,0.00092365063,0.00056627777,0.0002200658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009315273,0.0007200615,0.0007168353,0.0012528277,0.0007467983,0.001084495,0.0011307843,0.00061167806,0.0032819957],"category_scores_gemma":[0.0043986277,0.00040061548,0.00052367384,0.0011633808,0.0015082749,0.0019585534,0.0033646757,0.002126367,0.0009339547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038547357,0.00008901908,0.00095328863,0.00027854566,0.000033532244,0.00050114485,0.0005798991,0.064184286,0.058465663,0.73999435,0.0059306277,0.12860414],"study_design_scores_gemma":[0.00014233238,0.00041040563,0.0006749449,0.00012354027,0.000072376046,0.0014526002,0.000221156,0.27630046,0.10071868,0.5809045,0.038823307,0.00015577684],"about_ca_topic_score_codex":0.00041971734,"about_ca_topic_score_gemma":0.00049208006,"teacher_disagreement_score":0.0032819957,"about_ca_system_score_codex":0.0008589338,"about_ca_system_score_gemma":0.00084548903,"threshold_uncertainty_score":0.010979295},"labels":[],"label_agreement":null},{"id":"W4415954489","doi":"10.3390/appliedmath5040156","title":"Application of a New Iterative Formula for Computing π and Nested Radicals with Roots of 2","year":2025,"lang":"en","type":"article","venue":"AppliedMath","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thoth Technology (Canada); York University","funders":"National Research Council Canada; York University","keywords":"Iterative method; Iterative refinement; Algebra over a field; Iterative and incremental development; Computation; Set (abstract data type)","score_opus":0.006826968357424119,"score_gpt":0.25727211449781584,"score_spread":0.2504451461403917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415954489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.023018565,0.0001657628,0.96747833,0.0001348375,0.00015059707,0.000051990333,0.000037156384,0.00047531468,0.008487477],"genre_scores_gemma":[0.23683608,0.0002227316,0.75773114,0.00019821725,0.00011794154,0.000115001945,0.00011231801,0.00026290832,0.004403746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934703,0.00010511989,0.000064615226,0.000092295086,0.00031508267,0.00007591936],"domain_scores_gemma":[0.99920493,0.0002758803,0.00006340814,0.0001701477,0.00024535033,0.000040273615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007633549,0.00058254483,0.00042855108,0.001286768,0.0006806452,0.0009556054,0.001060791,0.0005809474,0.0035785595],"category_scores_gemma":[0.004078733,0.00023900431,0.0005875262,0.00074395665,0.0008603697,0.002017646,0.0016035478,0.0011215038,0.00086573226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024322921,0.000112341164,0.0018976475,0.0003307084,0.00006663012,0.00048366483,0.00078980817,0.039072692,0.05995233,0.58180827,0.003931809,0.31131083],"study_design_scores_gemma":[0.00009326841,0.00042838135,0.0009019665,0.0001488002,0.000082770595,0.0011781225,0.00017097245,0.4717207,0.0946018,0.39640477,0.034119636,0.00014890681],"about_ca_topic_score_codex":0.0005194514,"about_ca_topic_score_gemma":0.0010757836,"teacher_disagreement_score":0.0035785595,"about_ca_system_score_codex":0.0006549731,"about_ca_system_score_gemma":0.00074383256,"threshold_uncertainty_score":0.011971533},"labels":[],"label_agreement":null},{"id":"W4416023954","doi":"10.48550/arxiv.2511.04113","title":"On an analogue of BRK-type sets in finite fields","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Upper and lower bounds; Homogeneous; Homogeneous polynomial; Dilation (metric space); Polynomial; Hypersphere","score_opus":0.05184821192318932,"score_gpt":0.3012877040333555,"score_spread":0.24943949211016614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416023954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.62191635,0.0019133273,0.1771875,0.0037219494,0.0004734686,0.000084905245,0.00070379424,0.0005290363,0.19346975],"genre_scores_gemma":[0.9544768,0.00066934555,0.026644502,0.0007203782,0.00047278122,0.00011298212,0.00040824478,0.00015416015,0.016340893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998309,0.0003719798,0.00009183022,0.0003239441,0.000519443,0.00038376887],"domain_scores_gemma":[0.9960502,0.0023487967,0.00036234612,0.0005957578,0.00025635224,0.00038658382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015335032,0.00069952616,0.0011856869,0.0028307738,0.002783947,0.0034017425,0.001772384,0.0014482684,0.008488887],"category_scores_gemma":[0.007116892,0.0006363734,0.0010568586,0.0022206118,0.005017823,0.0069380924,0.0045049936,0.003925511,0.0009636029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004691962,0.000013374373,0.00021820577,0.000036306777,0.000004055363,0.000054349286,0.00015863396,0.0015781997,0.00066538784,0.99343926,0.00078025024,0.003005059],"study_design_scores_gemma":[0.000029377063,0.00003160623,0.0005232028,0.00004633943,0.000012779891,0.00018636556,0.00010503087,0.012262292,0.0010621184,0.981457,0.0042521423,0.00003187193],"about_ca_topic_score_codex":0.0020067873,"about_ca_topic_score_gemma":0.0017012261,"teacher_disagreement_score":0.008488887,"about_ca_system_score_codex":0.0030694122,"about_ca_system_score_gemma":0.00060621666,"threshold_uncertainty_score":0.028398156},"labels":[],"label_agreement":null},{"id":"W4416139549","doi":"10.4064/aa250108-11-3","title":"Existence of normal elements with prescribed norms","year":2025,"lang":"","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Multiplicative group; Prime (order theory); Extension (predicate logic); Primitive element; Multiplicative function; Finite field; Galois group; Generator (circuit theory); Group (periodic table)","score_opus":0.00905378361818915,"score_gpt":0.235147966041236,"score_spread":0.22609418242304685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416139549","genre_codex":"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.7930828,0.00026467317,0.15097345,0.0004751091,0.000109101195,0.00006262466,0.00026899888,0.0002762305,0.05448706],"genre_scores_gemma":[0.94485587,0.00023616808,0.03992283,0.00010200924,0.00010201566,0.00009416065,0.00046721456,0.0000980553,0.014121695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893266,0.00019713593,0.00008694865,0.00021927996,0.00040258016,0.00016134525],"domain_scores_gemma":[0.9961718,0.0014481127,0.00047557038,0.0004980492,0.0008236117,0.0005828099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008852109,0.00035046917,0.0005443998,0.0010801804,0.0009252103,0.001867741,0.0007270901,0.0005242827,0.002651798],"category_scores_gemma":[0.00635495,0.0003402115,0.0005663052,0.0005285728,0.0028819125,0.003393621,0.0021909706,0.0014292056,0.0007090907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012069179,0.000046300163,0.0021538683,0.000046570607,0.000007970103,0.00015978684,0.00038798497,0.0017335429,0.005440903,0.9794804,0.00046497228,0.0099570835],"study_design_scores_gemma":[0.000044869732,0.00016011823,0.001024573,0.000041872394,0.00001672357,0.00077884586,0.00039332197,0.01651822,0.015450317,0.95705223,0.00847417,0.00004478022],"about_ca_topic_score_codex":0.00031131372,"about_ca_topic_score_gemma":0.0003002148,"teacher_disagreement_score":0.002651798,"about_ca_system_score_codex":0.0007870833,"about_ca_system_score_gemma":0.0006727666,"threshold_uncertainty_score":0.008871198},"labels":[],"label_agreement":null},{"id":"W4416176599","doi":"10.48550/arxiv.2508.06695","title":"When isometry and equivalence for skew constacyclic codes coincide","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Isometry (Riemannian geometry); Skew; Commutative property; Equivalence (formal languages); Base (topology); Commutative ring","score_opus":0.06761650630616854,"score_gpt":0.20719122511680382,"score_spread":0.13957471881063527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416176599","genre_codex":"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.59695154,0.0018371677,0.3025752,0.0020632362,0.0005693223,0.00010422691,0.00026249187,0.00029780105,0.095338956],"genre_scores_gemma":[0.9609107,0.0007949141,0.027864322,0.0005425296,0.00043169424,0.00009329678,0.00032831889,0.000088300796,0.008945834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684453,0.0005746485,0.0002834599,0.00092846266,0.0008438622,0.0005251771],"domain_scores_gemma":[0.994695,0.0019569509,0.0006890776,0.0016307441,0.0006347069,0.0003934796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019340273,0.0003869025,0.0005492666,0.0014107052,0.0013118277,0.0032778007,0.0006361763,0.0011689957,0.002911565],"category_scores_gemma":[0.009490504,0.00034213555,0.00051920564,0.0012490144,0.005360934,0.009496656,0.0031400316,0.002586419,0.0006011328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069595066,0.00002550178,0.0011724925,0.00002929968,0.000004505257,0.0001253213,0.00081889867,0.0007568676,0.0011659731,0.98400176,0.00045294082,0.011376912],"study_design_scores_gemma":[0.000015778933,0.00006817556,0.0008446089,0.000034975394,0.000009207159,0.00024370916,0.00041106652,0.0043099374,0.0025059395,0.983716,0.007818969,0.000021656673],"about_ca_topic_score_codex":0.0005650554,"about_ca_topic_score_gemma":0.00030990562,"teacher_disagreement_score":0.0032778007,"about_ca_system_score_codex":0.0010182501,"about_ca_system_score_gemma":0.00061103946,"threshold_uncertainty_score":0.010228217},"labels":[],"label_agreement":null},{"id":"W4416300436","doi":"10.4153/s000843952510146x","title":"Rational Delsarte designs and Galois fusions of association schemes","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Canterbury; National Science Foundation","keywords":"Association scheme; Finite field; Scheme (mathematics); Galois theory; Hamming code; Commutative property; Association (psychology); Eigenvalues and eigenvectors","score_opus":0.010825324948958428,"score_gpt":0.22137062539269423,"score_spread":0.2105453004437358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416300436","genre_codex":"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.83006877,0.00040094258,0.132611,0.0005172947,0.00007606205,0.00006986239,0.00013111524,0.00011960809,0.03600529],"genre_scores_gemma":[0.9826056,0.00014031252,0.0129689695,0.00006192878,0.000047318983,0.000034207234,0.00004795783,0.000013711612,0.004079908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844724,0.00045042756,0.00011984495,0.0002698271,0.00039361377,0.00031905726],"domain_scores_gemma":[0.9965791,0.001036408,0.00078483863,0.0007125276,0.00046827085,0.00041878782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019152517,0.00028686968,0.00034310255,0.0013438393,0.0011681508,0.0017534172,0.00037810748,0.0005268189,0.0035134028],"category_scores_gemma":[0.0037969616,0.00025757286,0.0005716379,0.0008292636,0.00427132,0.0020817302,0.002051377,0.00097377383,0.0004005076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052817006,0.000009941129,0.0005177652,0.000014961821,0.000004083097,0.000050596365,0.00024324919,0.0019050569,0.0012170287,0.9917425,0.0001574497,0.0040846025],"study_design_scores_gemma":[0.00004555555,0.00015676003,0.0007016337,0.000035238038,0.000011471001,0.00026725966,0.00031162848,0.016371427,0.0037203352,0.9712923,0.0070539424,0.000032440832],"about_ca_topic_score_codex":0.00056280696,"about_ca_topic_score_gemma":0.00037252987,"teacher_disagreement_score":0.0035134028,"about_ca_system_score_codex":0.001263087,"about_ca_system_score_gemma":0.0005443562,"threshold_uncertainty_score":0.0117534995},"labels":[],"label_agreement":null},{"id":"W4417054196","doi":"10.1109/ecoc66593.2025.11263268","title":"Hybrid Soft/Hard-Decision Iterative Decoding of Concatenated RS-BCH Codes","year":2025,"lang":"","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Concatenated error correction code; BCH code; Code (set theory); Serial concatenated convolutional codes; Sequential decoding; Convolutional code","score_opus":0.01770583419132134,"score_gpt":0.27699960010346436,"score_spread":0.25929376591214304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417054196","genre_codex":"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.729614,0.001075885,0.23895986,0.00045155434,0.00006547999,0.000069759146,0.00018980594,0.00036779547,0.02920587],"genre_scores_gemma":[0.98112226,0.00019138561,0.016676482,0.000041511837,0.00002027562,0.000019605493,0.00003740798,0.00003514758,0.0018559913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842393,0.00059867505,0.0000529199,0.00011396574,0.0005402578,0.00027026454],"domain_scores_gemma":[0.99579155,0.003021156,0.00032132646,0.0003190881,0.00043503795,0.0001117854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448425,0.001068912,0.00075844163,0.00053857255,0.0004099057,0.0015306583,0.0007381109,0.0009733903,0.0017055545],"category_scores_gemma":[0.0054213763,0.00032287667,0.0005221865,0.0006388961,0.0012162426,0.001298319,0.0010748339,0.0005500936,0.00032935766],"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.00034720407,0.000039901268,0.0008074707,0.000062660816,0.0000552684,0.00017074449,0.00004942161,0.95695364,0.011452612,0.022651173,0.00020926438,0.0072005983],"study_design_scores_gemma":[0.000016048702,0.000089818,0.00025483372,0.000010994153,0.000020926445,0.00005794277,0.0000150839405,0.98217,0.01001444,0.007150697,0.00018415034,0.000015159767],"about_ca_topic_score_codex":0.0016941129,"about_ca_topic_score_gemma":0.003119771,"teacher_disagreement_score":0.0017055545,"about_ca_system_score_codex":0.001369463,"about_ca_system_score_gemma":0.0010042145,"threshold_uncertainty_score":0.0099362135},"labels":[],"label_agreement":null},{"id":"W4417529622","doi":"10.48550/arxiv.2512.16118","title":"Equidistribution of polynomial sequences in function fields: resolution of a conjecture","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Equidistributed sequence; Conjecture; Resolution (logic); Polynomial; Finite field; Laurent series; Function field; Integer (computer science)","score_opus":0.03629586369635444,"score_gpt":0.2698655428394987,"score_spread":0.23356967914314428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417529622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.71472573,0.0013245086,0.14781035,0.013055593,0.000849734,0.00005865127,0.0003162691,0.00077780866,0.12108129],"genre_scores_gemma":[0.9704737,0.0005219673,0.013623566,0.0010236356,0.00047444805,0.00005119648,0.00033839385,0.00016233785,0.013330625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997332,0.00044366182,0.00019284044,0.00079309323,0.0006249177,0.0006135971],"domain_scores_gemma":[0.99234504,0.0039747735,0.00071267295,0.0014827,0.00069032586,0.00079449016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003513411,0.00071711687,0.0011832707,0.0013795734,0.0032733292,0.003790696,0.0026796816,0.0027414241,0.011008124],"category_scores_gemma":[0.015331694,0.00084367633,0.001632687,0.001731899,0.0061807,0.010825931,0.005257023,0.006728185,0.0012277378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020782516,0.000085978914,0.0012935386,0.00006349562,0.000010153469,0.0003751038,0.0012662085,0.0024962933,0.0012991013,0.98090506,0.002376123,0.009621118],"study_design_scores_gemma":[0.00006863886,0.00009237153,0.0005755385,0.000042168856,0.000015918906,0.00052929966,0.0005971028,0.015130022,0.0025423025,0.9728812,0.0074982126,0.000027184642],"about_ca_topic_score_codex":0.0013522169,"about_ca_topic_score_gemma":0.0007202327,"teacher_disagreement_score":0.011008124,"about_ca_system_score_codex":0.0024354893,"about_ca_system_score_gemma":0.0011201334,"threshold_uncertainty_score":0.036825836},"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":"W526827","doi":"10.1136/bmj.2.6203.1507","title":"On weight distributions of codes of planes of order 9.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.010940128916950304,"score_gpt":0.2132957907862825,"score_spread":0.20235566186933218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W526827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.88890773,0.0011036079,0.08101104,0.0017247731,0.00009271904,0.000061969164,0.0010234801,0.00020740082,0.025867352],"genre_scores_gemma":[0.9860751,0.0009220644,0.005502153,0.00019801792,0.00021647118,0.000091068214,0.0007480591,0.00013094403,0.006116072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998638,0.00036213806,0.00004810903,0.00018113475,0.00036667805,0.0004039326],"domain_scores_gemma":[0.9896932,0.0060443394,0.001523508,0.000868438,0.00088290335,0.0009877121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648523,0.00074118236,0.0007104997,0.00358505,0.0011660029,0.0029749575,0.0014791433,0.0011308964,0.005857936],"category_scores_gemma":[0.01499862,0.0005294078,0.00042487693,0.0024194517,0.0027060118,0.0046124524,0.0022028533,0.0022261133,0.0008886111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028195704,0.000058442776,0.0029330838,0.00005748345,0.000018777382,0.00010422437,0.00040526147,0.008388633,0.002530769,0.9676981,0.0031960784,0.01432719],"study_design_scores_gemma":[0.00004924384,0.000050247236,0.0022979076,0.00007836551,0.000017290486,0.00024579576,0.00021902114,0.049665794,0.002018365,0.9425502,0.0027690788,0.000038725433],"about_ca_topic_score_codex":0.0015418996,"about_ca_topic_score_gemma":0.0013711851,"teacher_disagreement_score":0.005857936,"about_ca_system_score_codex":0.0019670657,"about_ca_system_score_gemma":0.00075877376,"threshold_uncertainty_score":0.019596756},"labels":[],"label_agreement":null},{"id":"W560384006","doi":"10.1007/s13389-015-0101-6","title":"Some new results on binary polynomial multiplication","year":2015,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Multiplication (music); Mathematics; Finite field; Binary number; Multiplication algorithm; Polynomial; Logarithm; Binary operation; Field (mathematics); Algorithm; Strassen algorithm; Arithmetic; Discrete mathematics; Combinatorics; Matrix multiplication; Pure mathematics","score_opus":0.021652763300848785,"score_gpt":0.23424336271828586,"score_spread":0.21259059941743708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W560384006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.094114415,0.028870039,0.47662324,0.014964161,0.010437867,0.0001946929,0.001077004,0.00095786696,0.37276077],"genre_scores_gemma":[0.62243116,0.020893278,0.14303777,0.005758089,0.020115105,0.00042986075,0.0017534504,0.0011380686,0.18444324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814904,0.0003175882,0.00015184403,0.00039841855,0.00071548653,0.0002676892],"domain_scores_gemma":[0.996718,0.0019261762,0.00026341557,0.00043697483,0.0003299837,0.00032546412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017522183,0.0024795684,0.0017311703,0.005050731,0.0030891339,0.0049560964,0.002221008,0.0017599202,0.017258985],"category_scores_gemma":[0.005438955,0.0011414558,0.0020166393,0.006395616,0.004871107,0.011546166,0.005205544,0.0062954477,0.0039034714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021425977,0.000091744405,0.00025113396,0.00033450214,0.00003470585,0.00022539622,0.0003389825,0.0013902404,0.0023981659,0.9429954,0.010074374,0.041651197],"study_design_scores_gemma":[0.000032790795,0.00005232643,0.0002634288,0.000052632928,0.00004592915,0.0004626784,0.0000558545,0.0045180754,0.0017242013,0.9653648,0.027389312,0.0000380196],"about_ca_topic_score_codex":0.000350969,"about_ca_topic_score_gemma":0.00046404116,"teacher_disagreement_score":0.017258985,"about_ca_system_score_codex":0.0017185205,"about_ca_system_score_gemma":0.0008142739,"threshold_uncertainty_score":0.057736993},"labels":[],"label_agreement":null},{"id":"W639887749","doi":"10.1201/b15006","title":"Handbook of Finite Fields","year":2013,"lang":"ru","type":"book","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Computer science; Compiler; Coding theory; Field (mathematics); Cryptography; Theoretical computer science; Coding (social sciences); Algebra over a field; Mathematics; Pure mathematics; Algorithm; Discrete mathematics; Programming language","score_opus":0.017081597093007328,"score_gpt":0.21419716338702652,"score_spread":0.1971155662940192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W639887749","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009380276,0.112402424,0.023112608,0.0041725216,0.005382236,0.000115154166,0.0025022847,0.0018322302,0.8495425],"genre_scores_gemma":[0.00863509,0.076903895,0.022342786,0.0024116002,0.0031154512,0.00018468298,0.0038429492,0.0012283612,0.88133514],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917823,0.00010438094,0.000052068248,0.00013241704,0.0004747743,0.000058117577],"domain_scores_gemma":[0.9988471,0.00049268745,0.00005996446,0.00016583836,0.00033363554,0.00010072639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005218141,0.0011575585,0.0010348654,0.004408259,0.001461487,0.003879338,0.0011279801,0.0009830372,0.13312545],"category_scores_gemma":[0.002783674,0.0005937458,0.00044394765,0.0050621736,0.0011618403,0.0051956293,0.0015260755,0.0029942421,0.08916902],"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.00001766587,0.000035588055,0.00009132385,0.000554281,0.000006057258,0.00006871649,0.00043291852,0.00038213324,0.0008139207,0.12967253,0.5852285,0.2826964],"study_design_scores_gemma":[9.629704e-7,0.000004792076,0.000069703325,0.00015133782,9.374169e-7,0.00011956792,0.000020948022,0.00004516172,0.000062069725,0.010187033,0.98933405,0.0000034149255],"about_ca_topic_score_codex":0.0013207569,"about_ca_topic_score_gemma":0.002590027,"teacher_disagreement_score":0.13312545,"about_ca_system_score_codex":0.001726616,"about_ca_system_score_gemma":0.002240109,"threshold_uncertainty_score":0.44534904},"labels":[],"label_agreement":null},{"id":"W67599134","doi":"","title":"On the Quaternary Projection of Binary Linear Block Codes.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternary; Binary number; Projection (relational algebra); Block (permutation group theory); Arithmetic; Combinatorics; Algorithm; Geology; Paleontology","score_opus":0.01500699985465057,"score_gpt":0.24732202664166197,"score_spread":0.2323150267870114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67599134","genre_codex":"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.19992988,0.006600221,0.469695,0.00406179,0.0014912076,0.00018036764,0.0012518181,0.00045904616,0.3163307],"genre_scores_gemma":[0.85603034,0.0062053157,0.072387315,0.0014694973,0.0013775066,0.00021986778,0.0010321225,0.0002638474,0.061014038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991159,0.00029248424,0.000033274282,0.00008228336,0.0003105069,0.00016560983],"domain_scores_gemma":[0.9987097,0.00055226195,0.0001530755,0.00020573766,0.00023395626,0.00014521675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070996536,0.00068832166,0.00061902544,0.0011871216,0.0011457376,0.0018666426,0.0005521131,0.000930719,0.0070658387],"category_scores_gemma":[0.003711794,0.00036309214,0.0003981897,0.0013127733,0.0023042448,0.0034239942,0.0023320187,0.002160514,0.0025026035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003156994,0.000012559727,0.000096159136,0.000027976648,0.0000035220576,0.00005717265,0.00007378848,0.001750714,0.0007867964,0.987079,0.0029423125,0.0071383263],"study_design_scores_gemma":[0.000010417131,0.000023972827,0.00013371774,0.000028604974,0.0000035387147,0.00013117393,0.000035788456,0.01198717,0.0006256236,0.9806755,0.006332398,0.000012093179],"about_ca_topic_score_codex":0.00074946997,"about_ca_topic_score_gemma":0.0008327573,"teacher_disagreement_score":0.0070658387,"about_ca_system_score_codex":0.00068229606,"about_ca_system_score_gemma":0.0008433456,"threshold_uncertainty_score":0.023637593},"labels":[],"label_agreement":null},{"id":"W6910447097","doi":"10.4230/lipics.itcs.2025.93","title":"Polynomials, Divided Differences, and Codes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Multiplicity (mathematics); Decodes; Finite field; List decoding; Reed–Muller code; Decoding methods; Degree (music); Finite set; Linear code","score_opus":0.009595065195354174,"score_gpt":0.23929865331196112,"score_spread":0.22970358811660696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910447097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.08006197,0.0056832135,0.8803094,0.0022048424,0.00045504596,0.000073177216,0.0003562423,0.00064672105,0.030209387],"genre_scores_gemma":[0.7207125,0.0040657115,0.25135604,0.0007895148,0.0008538371,0.00012962385,0.0004493918,0.00023486871,0.021408523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987901,0.00027219145,0.000049286442,0.00030310062,0.00040456778,0.00018073161],"domain_scores_gemma":[0.9984364,0.0007025747,0.00021818669,0.0003514053,0.00020573256,0.00008567086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077546714,0.0005436404,0.00042004793,0.001134678,0.00083802856,0.0016007044,0.0007811312,0.0008149019,0.0032134815],"category_scores_gemma":[0.0048430883,0.00027465753,0.00041744686,0.0019638455,0.0033830595,0.0035936914,0.0017685369,0.0019633435,0.0011340092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082870945,0.000011754518,0.0002686576,0.00005887553,0.000004526924,0.000050078983,0.00014502669,0.007130272,0.0010231923,0.95708096,0.0017984406,0.032345347],"study_design_scores_gemma":[0.00001572167,0.000060924427,0.0001829436,0.000039985214,0.0000067973924,0.00018621446,0.00005070146,0.02631258,0.0021562253,0.95835996,0.012603981,0.000023931385],"about_ca_topic_score_codex":0.0013248533,"about_ca_topic_score_gemma":0.0008688809,"teacher_disagreement_score":0.0032134815,"about_ca_system_score_codex":0.0013865187,"about_ca_system_score_gemma":0.00087020366,"threshold_uncertainty_score":0.010750234},"labels":[],"label_agreement":null},{"id":"W6925137329","doi":"10.17605/osf.io/36pfh","title":"Systematic Review of Interventions for Trauma-Related Symptoms in Public Service Personnel","year":2023,"lang":"en","type":"article","venue":"OSF Preprints (OSF Preprints)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Psychological intervention; Public service; Service (business); Public health; Public sector; Context (archaeology)","score_opus":0.03268112356539941,"score_gpt":0.28244157595526054,"score_spread":0.24976045238986114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925137329","genre_codex":"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.014539068,0.9786227,0.00062531896,0.00082294596,0.0006521963,0.0030887048,0.0010251782,0.00004362373,0.0005802472],"genre_scores_gemma":[0.26842502,0.7187418,0.0043299375,0.002100491,0.00026556174,0.005141722,0.0006088434,0.000028317885,0.0003583383],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.97913134,0.010880942,0.0063846884,0.0012643202,0.0017955841,0.0005431598],"domain_scores_gemma":[0.9577124,0.030824516,0.007448179,0.0008379649,0.0024276818,0.00074922555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014151914,0.001866012,0.012022859,0.0061928285,0.0010850427,0.002547258,0.002418568,0.002879568,0.0061769052],"category_scores_gemma":[0.0791743,0.00167492,0.0112595055,0.005677779,0.0014397242,0.0021515407,0.0021899098,0.0027233919,0.00030302597],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023454502,0.000095830204,0.00086815853,0.9298128,0.044660106,0.00006809151,0.00029960438,0.00014989586,0.00016356954,0.000100170255,0.0009035017,0.020532873],"study_design_scores_gemma":[0.010815001,0.0023331135,0.00982194,0.6531627,0.31434527,0.00019424032,0.00093700655,0.00024384231,0.0003206028,0.0005083075,0.007225009,0.000092944116],"about_ca_topic_score_codex":0.022209574,"about_ca_topic_score_gemma":0.06065234,"teacher_disagreement_score":0.022209574,"about_ca_system_score_codex":0.0070693158,"about_ca_system_score_gemma":0.017244928,"threshold_uncertainty_score":0.07484341},"labels":[],"label_agreement":null},{"id":"W69266142","doi":"","title":"New Binary Sequences of Length 4p with Optimal Autocorrelation Magnitude.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Autocorrelation; Binary number; Magnitude (astronomy); Statistics; Arithmetic; Astrophysics; Physics","score_opus":0.01346012957703902,"score_gpt":0.2181718340643522,"score_spread":0.20471170448731318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69266142","genre_codex":"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.39153874,0.006811321,0.47534525,0.005150521,0.002169612,0.0004201238,0.002132501,0.0013874277,0.11504452],"genre_scores_gemma":[0.7999523,0.0013416924,0.16938828,0.0007178131,0.00042698163,0.0003162904,0.0012078728,0.0001712561,0.026477568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991683,0.00017912823,0.0000668906,0.00011651262,0.00033735918,0.00013184517],"domain_scores_gemma":[0.9978655,0.0008643809,0.00036842533,0.00027996954,0.0003538192,0.00026802538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007347094,0.0006011471,0.0005387628,0.0013633047,0.00070952775,0.0014984795,0.0007367778,0.0011301074,0.0062287673],"category_scores_gemma":[0.0054339278,0.00050911354,0.00024783445,0.0013170287,0.0009763528,0.0018379136,0.0017058004,0.0011673294,0.0017332993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013855991,0.00022642365,0.0014222658,0.00040182445,0.000048168673,0.0012165809,0.00032552748,0.015880482,0.09979463,0.6912471,0.012761564,0.17528974],"study_design_scores_gemma":[0.0005218123,0.0008291501,0.003118532,0.0003512547,0.0000969733,0.005029865,0.0002950277,0.19871327,0.12634753,0.58463514,0.079828,0.00023342553],"about_ca_topic_score_codex":0.00023944429,"about_ca_topic_score_gemma":0.00066533,"teacher_disagreement_score":0.0062287673,"about_ca_system_score_codex":0.0009144681,"about_ca_system_score_gemma":0.0010876014,"threshold_uncertainty_score":0.020837307},"labels":[],"label_agreement":null},{"id":"W6931498520","doi":"10.5281/zenodo.4700946","title":"FIGURE 2 in Endogean beetles (Coleoptera) of Madagascar: deep soil sampling and illustrated overview","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Sampling (signal processing); Hydrology (agriculture); Distance sampling; Vegetation (pathology); Exclosure","score_opus":0.05359348776241104,"score_gpt":0.2563982468288499,"score_spread":0.20280475906643883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931498520","genre_codex":"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.5709186,0.002406456,0.007628202,0.0011549795,0.00027461565,0.00045168347,0.20543633,0.0017352065,0.20999393],"genre_scores_gemma":[0.7767992,0.0020366912,0.024228148,0.00054416957,0.000105168074,0.00052831654,0.09587616,0.00040820934,0.09947395],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999155,0.000011656779,0.0000030544052,0.000026957357,0.000019578165,0.000023202334],"domain_scores_gemma":[0.9999039,0.0000141777555,0.000015659452,0.000014389162,0.000029990733,0.000021826234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092887196,0.00037809668,0.00008458957,0.0017451589,0.00053760497,0.00040312822,0.0002637375,0.0002042269,0.04164784],"category_scores_gemma":[0.00020008441,0.000110903515,0.00012030154,0.002604929,0.00016458248,0.00018230802,0.00044557697,0.0001503026,0.0066894093],"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.00050451566,0.00011588277,0.3127942,0.0009883204,0.00006771629,0.0020771783,0.0031560047,0.0017781312,0.049570646,0.0023152453,0.2908314,0.33580074],"study_design_scores_gemma":[0.000010409143,0.000047026107,0.7002944,0.000096935786,0.000025068253,0.0008307936,0.001495847,0.0006516821,0.003827968,0.0002576441,0.29244906,0.000013203593],"about_ca_topic_score_codex":0.031017695,"about_ca_topic_score_gemma":0.095882125,"teacher_disagreement_score":0.04164784,"about_ca_system_score_codex":0.00021324611,"about_ca_system_score_gemma":0.00022936954,"threshold_uncertainty_score":0.13932592},"labels":[],"label_agreement":null},{"id":"W6939190082","doi":"10.6084/m9.figshare.11998437.v1","title":"Additional file 6 of Transcriptome analysis of metabolic pathways associated with oil accumulation in developing seed kernels of Styrax tonkinensis, a woody biodiesel species","year":2020,"lang":"en","type":"dataset","venue":"Figshare","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transcriptome; Metabolic pathway; Biodiesel; Primer (cosmetics); Pathway analysis; Bioenergy","score_opus":0.06436006396920159,"score_gpt":0.2475318861981247,"score_spread":0.1831718222289231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939190082","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075549644,0.000018956762,0.00004846211,0.000016937818,0.000005782875,0.000010025626,0.9995351,0.00013409177,0.00015509457],"genre_scores_gemma":[0.00087294733,0.000041744806,0.00054986135,0.00006656724,0.000005793793,0.0002190841,0.9974952,0.00012759541,0.0006213421],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938786,0.00006922681,0.00008208204,0.00023291614,0.00012223158,0.0001056716],"domain_scores_gemma":[0.9964539,0.002089869,0.00030449202,0.0003587365,0.0005836122,0.00020944541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010324022,0.0019712462,0.001990313,0.0025513347,0.0010403869,0.002092909,0.0026573075,0.0024570744,0.38982904],"category_scores_gemma":[0.0059906393,0.0007078238,0.0014874395,0.0040934645,0.0004192029,0.0015120122,0.0014568813,0.001649736,0.10675868],"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.0004237353,0.0001291004,0.0031997866,0.0072865156,0.00014768609,0.000106370964,0.00008738295,0.0010121844,0.0010871454,0.0007874,0.980601,0.005131708],"study_design_scores_gemma":[0.003157004,0.00018497976,0.025303625,0.0020901954,0.00031529885,0.00031455373,0.00022970288,0.0016289143,0.0021616023,0.0056646923,0.9588062,0.00014318891],"about_ca_topic_score_codex":0.008545042,"about_ca_topic_score_gemma":0.016456123,"teacher_disagreement_score":0.38982904,"about_ca_system_score_codex":0.001177643,"about_ca_system_score_gemma":0.0020476212,"threshold_uncertainty_score":0.8703348},"labels":[],"label_agreement":null},{"id":"W6996107501","doi":"","title":"Reed-Solomon encoder VLST implementation","year":2015,"lang":"en","type":"dissertation","venue":"CSUN ScholarWorks (California State University, Northridge)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"International Development Research Centre","keywords":"Encoder; Block (permutation group theory); Scale (ratio); CMOS; Encoding (memory); Integrated circuit","score_opus":0.01113769750515896,"score_gpt":0.25292080124280547,"score_spread":0.2417831037376465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996107501","genre_codex":"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.07794562,0.00056747586,0.80572534,0.0012414309,0.0005612724,0.00039020946,0.0017979975,0.0153668225,0.09640395],"genre_scores_gemma":[0.5595583,0.00038976473,0.34275982,0.00061685295,0.00013585255,0.00025273548,0.002412064,0.0006649276,0.09320959],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995604,0.00006655414,0.000023610608,0.00006826472,0.00017903165,0.00010222712],"domain_scores_gemma":[0.99957484,0.000072129085,0.000020135743,0.00014393752,0.00017395374,0.000014994599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023614615,0.00039715914,0.00032969413,0.0005605699,0.0005220275,0.00087373226,0.0006734174,0.0005526788,0.01588825],"category_scores_gemma":[0.0009681456,0.00021628117,0.00028176664,0.00043317475,0.00023027607,0.00059049623,0.00067039876,0.0004914569,0.008264857],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000738464,0.0001790034,0.0014568494,0.00034113924,0.00005491047,0.00053167256,0.00026692802,0.010866174,0.14847572,0.16539852,0.031013178,0.64067745],"study_design_scores_gemma":[0.00034899416,0.0006218012,0.0017737041,0.0002182717,0.00011059262,0.0020284404,0.00020319535,0.15047666,0.60860974,0.058242742,0.17725417,0.000111741836],"about_ca_topic_score_codex":0.0012980074,"about_ca_topic_score_gemma":0.0029353525,"teacher_disagreement_score":0.01588825,"about_ca_system_score_codex":0.0005686775,"about_ca_system_score_gemma":0.0017009871,"threshold_uncertainty_score":0.05315149},"labels":[],"label_agreement":null},{"id":"W7023699737","doi":"","title":"Oral History Interview with Wayne Miller, August 8, 2001","year":2001,"lang":"en","type":"article","venue":"The Portal to Texas History (University of North Texas)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Navy; Submarine; German; Oral history; Crew; Miller; Albatross; George (robot)","score_opus":0.030837661817993536,"score_gpt":0.19676033237721277,"score_spread":0.16592267055921922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023699737","genre_codex":"commentary","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.0265176,0.024390992,0.0005166535,0.5109733,0.021491239,0.00035832115,0.0028021045,0.00024370076,0.4127061],"genre_scores_gemma":[0.063726105,0.010559245,0.00042638837,0.12821302,0.003739816,0.0008421454,0.00063561584,0.00017735778,0.7916803],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.99940073,0.00019346467,0.000024938186,0.00007310536,0.00015233575,0.00015547489],"domain_scores_gemma":[0.9991398,0.00029126534,0.00009311939,0.000034138324,0.00018500484,0.00025672032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011971233,0.0006978728,0.0005295153,0.0012872086,0.0092843715,0.003429089,0.00069881557,0.0038384392,0.08737048],"category_scores_gemma":[0.0049350713,0.0005966915,0.00020790628,0.0013553397,0.0015339163,0.0047311257,0.0029039448,0.00573528,0.018355839],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014908032,0.000020824944,0.00039464756,0.000038284565,0.000001043676,0.00033679273,0.013967927,0.0000074245836,0.00015312732,0.0013636353,0.9777213,0.005980062],"study_design_scores_gemma":[0.0000021995045,0.000009644402,0.00083823194,0.00008484287,7.051391e-7,0.00017643221,0.014988366,0.0000055051546,0.000031345913,0.00012287727,0.983733,0.000006760474],"about_ca_topic_score_codex":0.018546183,"about_ca_topic_score_gemma":0.066127606,"teacher_disagreement_score":0.08737048,"about_ca_system_score_codex":0.0038532692,"about_ca_system_score_gemma":0.0022173568,"threshold_uncertainty_score":0.29228342},"labels":[],"label_agreement":null},{"id":"W7026976970","doi":"","title":"Balchem Corporation Reports Record Second Quarter Sales of $147.1 Million with Second Quarter Net Earnings of $16.5 Million and Adjusted Net Earnings of $20.5 Million","year":2017,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Earnings; Quarter (Canadian coin); Corporation; Net income; Net worth","score_opus":0.011450314561274,"score_gpt":0.21187969277097465,"score_spread":0.20042937820970066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026976970","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056490935,0.0014881641,0.00079033844,0.004128351,0.0010427603,0.00008732199,0.019749396,0.0030903835,0.96397424],"genre_scores_gemma":[0.012228547,0.0015845756,0.000532252,0.0005559986,0.00022283944,0.000026773867,0.012306134,0.00037717362,0.9721656],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990344,0.000039263952,0.00002336188,0.00009717626,0.00066440826,0.00014144766],"domain_scores_gemma":[0.99798965,0.00020628693,0.0001760257,0.0001821945,0.001114307,0.00033153789],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007648957,0.00087575393,0.00045769577,0.0032958994,0.0017715623,0.0035780391,0.00076392066,0.0010249633,0.37093022],"category_scores_gemma":[0.0020363803,0.0003146932,0.00040462898,0.0033140667,0.0007006343,0.002045434,0.0011760618,0.0015169574,0.27324295],"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.000057336052,0.00007454264,0.00072379544,0.00007144501,0.000005176772,0.000046212284,0.00002780664,0.00007659858,0.00047791918,0.0048828153,0.9484173,0.04513906],"study_design_scores_gemma":[0.000018492801,0.000038633352,0.0023208733,0.000051475898,0.0000050149824,0.00007736052,0.0000883581,0.0002817129,0.0010832021,0.0012517641,0.99477,0.00001307607],"about_ca_topic_score_codex":0.013179489,"about_ca_topic_score_gemma":0.025934475,"teacher_disagreement_score":0.37093022,"about_ca_system_score_codex":0.0014445075,"about_ca_system_score_gemma":0.0023891577,"threshold_uncertainty_score":0.89729166},"labels":[],"label_agreement":null},{"id":"W7027563031","doi":"","title":"Constructions of APN permutations","year":2021,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dimension (graph theory); Construct (python library); Block (permutation group theory); Differential (mechanical device); Permutation (music); Function (biology); Finite field","score_opus":0.009420094323796844,"score_gpt":0.210666094699641,"score_spread":0.20124600037584417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027563031","genre_codex":"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.23175192,0.00076446036,0.6022529,0.0006975379,0.00047838598,0.00021652368,0.00026963695,0.0005917433,0.1629769],"genre_scores_gemma":[0.81097484,0.00079038,0.14838707,0.00039157105,0.00013477867,0.00030827735,0.00043470343,0.00028883934,0.038289618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990194,0.00024873018,0.00007353124,0.00016613846,0.0003052562,0.00018707223],"domain_scores_gemma":[0.9991918,0.00020726884,0.0000735835,0.00028932068,0.0001415404,0.000096465286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743785,0.00054905174,0.00042182533,0.0014016337,0.0012060973,0.001736817,0.0006352545,0.00070870563,0.0048325644],"category_scores_gemma":[0.0020129161,0.00029525845,0.00065854745,0.000962494,0.0021235067,0.0024645915,0.002701721,0.001912479,0.0013766211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004461024,0.000017923701,0.00024725782,0.000043794695,0.0000046114956,0.0001402108,0.00024231657,0.0014131176,0.006240348,0.9645495,0.000739965,0.026316365],"study_design_scores_gemma":[0.000024106419,0.0001294115,0.000599167,0.000063171734,0.000018070636,0.0010579797,0.00026021904,0.016755775,0.027050834,0.89958125,0.054412454,0.00004751584],"about_ca_topic_score_codex":0.0002469318,"about_ca_topic_score_gemma":0.00022294672,"teacher_disagreement_score":0.0048325644,"about_ca_system_score_codex":0.0010355298,"about_ca_system_score_gemma":0.00069939415,"threshold_uncertainty_score":0.016166568},"labels":[],"label_agreement":null},{"id":"W70284720","doi":"","title":"K-dominating sets of P[2k+2]xP[n] and P[m]xP[n].","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010486811885346777,"score_gpt":0.23344293085394574,"score_spread":0.22295611896859896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70284720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.6673161,0.0023044301,0.13597506,0.007754629,0.0004702629,0.0006956842,0.012914461,0.0008433596,0.17172597],"genre_scores_gemma":[0.86099535,0.0010916104,0.06848885,0.0010590375,0.00024475387,0.0005094735,0.011841429,0.00028719168,0.05548233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983718,0.00031819814,0.00011667649,0.00041734913,0.00039674074,0.0003792853],"domain_scores_gemma":[0.99453026,0.002538761,0.0006241561,0.0007906161,0.00070076203,0.00081533106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503055,0.0007101125,0.00077625783,0.0012571849,0.0028416354,0.004451077,0.0015107149,0.0012447205,0.010130124],"category_scores_gemma":[0.006376769,0.00084883225,0.00073124026,0.0013485176,0.0015877383,0.004354579,0.0029652794,0.0022435938,0.0018599806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020300047,0.00034388684,0.00576077,0.0006288322,0.00019881623,0.0011999871,0.0017945284,0.01382726,0.018356051,0.8830912,0.034630354,0.038138267],"study_design_scores_gemma":[0.00021414338,0.00013980219,0.0071052276,0.000173811,0.00011471915,0.0026823534,0.0008584115,0.032751236,0.018459845,0.8806148,0.05679113,0.000094505354],"about_ca_topic_score_codex":0.001577395,"about_ca_topic_score_gemma":0.0021211214,"teacher_disagreement_score":0.010130124,"about_ca_system_score_codex":0.0020226904,"about_ca_system_score_gemma":0.0013233545,"threshold_uncertainty_score":0.033888698},"labels":[],"label_agreement":null},{"id":"W7036129718","doi":"","title":"AVANGRID : REPORTS THIRD QUARTER 2024 FINANCIAL RESULTS Form 8 K","year":2024,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Term (time); Payment; Financial management","score_opus":0.008436000869264009,"score_gpt":0.2259268784277057,"score_spread":0.21749087755844168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036129718","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012831821,0.00042744842,0.0004724542,0.0028743423,0.0016892496,0.000058252215,0.009193563,0.00087170873,0.9831297],"genre_scores_gemma":[0.0036495454,0.0002626271,0.00018200393,0.00024096087,0.00013960076,0.00002259131,0.002673675,0.00026034983,0.99256855],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994153,0.000048986312,0.00001654546,0.00008667093,0.0002479731,0.00018458508],"domain_scores_gemma":[0.9990716,0.00011112397,0.00005510465,0.00014057114,0.00031597968,0.00030553804],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005130718,0.0010944512,0.00067756546,0.0013221942,0.0016898448,0.004967142,0.0012537272,0.0029000554,0.6956823],"category_scores_gemma":[0.0018336959,0.00029254248,0.00087489065,0.0015195155,0.0007311535,0.0012439276,0.0018813789,0.0017737403,0.6815936],"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.0002234483,0.000062758496,0.0002307309,0.00008034088,0.000012313283,0.00007560099,0.00001584012,0.00024120025,0.00044364997,0.010592836,0.94906145,0.038959887],"study_design_scores_gemma":[0.000057777706,0.000048473772,0.00088241615,0.0000724388,0.000008360566,0.000041620402,0.000054218774,0.0005865859,0.0010074122,0.005513673,0.99171257,0.000014405728],"about_ca_topic_score_codex":0.0075852564,"about_ca_topic_score_gemma":0.011499099,"teacher_disagreement_score":0.6956823,"about_ca_system_score_codex":0.002235262,"about_ca_system_score_gemma":0.0023860512,"threshold_uncertainty_score":0.43407226},"labels":[],"label_agreement":null},{"id":"W7066184690","doi":"","title":"The graph structure of Chebyshev polynomials over finite fields and applications","year":2019,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Chebyshev polynomials; Finite field; Graph; Algebra over a field; Field (mathematics); Orthogonal polynomials","score_opus":0.010261419036127845,"score_gpt":0.22348653192962592,"score_spread":0.21322511289349808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066184690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.8245035,0.0026628952,0.108214766,0.0049952865,0.00027171517,0.0000649382,0.0010387753,0.00023388,0.05801432],"genre_scores_gemma":[0.9712107,0.0015415293,0.013753582,0.00022846827,0.00028250512,0.00003551089,0.00048617035,0.000073919,0.012387647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963784,0.00009819983,0.000014104996,0.00008646631,0.00007531347,0.00008813337],"domain_scores_gemma":[0.9936511,0.004057869,0.0008028399,0.00042928173,0.0005835643,0.0004752942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046140482,0.00032871586,0.00053089525,0.002691292,0.0014201582,0.0021456694,0.0006741272,0.0009132443,0.008542545],"category_scores_gemma":[0.004821716,0.0003589578,0.00041841695,0.0031016602,0.0017014674,0.0026089014,0.0008591753,0.0015683755,0.0009495921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015262298,0.00006810318,0.0018316914,0.000106258,0.000012119574,0.00020609947,0.0004104236,0.009199798,0.0025290423,0.95388424,0.0036808597,0.027918767],"study_design_scores_gemma":[0.000018447288,0.000038373746,0.0015240837,0.000038082566,0.000010980242,0.00022202382,0.00016430196,0.026696064,0.0010602331,0.96532536,0.0048751216,0.000027017333],"about_ca_topic_score_codex":0.0026833825,"about_ca_topic_score_gemma":0.0026616696,"teacher_disagreement_score":0.008542545,"about_ca_system_score_codex":0.0014305543,"about_ca_system_score_gemma":0.00078339846,"threshold_uncertainty_score":0.028577626},"labels":[],"label_agreement":null},{"id":"W7097667488","doi":"","title":"Joint work with Jonathan Dixon Canadian Mathematical Society Winter Meeting 2008 Distance enumerators","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hamming distance; Joint (building); Work (physics); Code (set theory); Hamming code; Word (group theory)","score_opus":0.019554664958432236,"score_gpt":0.2033176837151474,"score_spread":0.1837630187567152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097667488","genre_codex":"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.009906463,0.037648544,0.07051472,0.11651415,0.043730944,0.00021654087,0.0033677958,0.0015853901,0.7165155],"genre_scores_gemma":[0.049189027,0.01670799,0.022549784,0.0024460703,0.005800941,0.000100777936,0.001437573,0.0006767204,0.90109104],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860233,0.00026775076,0.000069026835,0.00041687564,0.0004961814,0.00014781738],"domain_scores_gemma":[0.9962268,0.0010388861,0.00009376291,0.0004496087,0.0015734073,0.0006175161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021468226,0.001134926,0.0014039965,0.0021796352,0.0026091572,0.0035165646,0.0010333606,0.0010553051,0.124508485],"category_scores_gemma":[0.006216565,0.00048967643,0.0009686019,0.0019502058,0.0013350899,0.0040210285,0.0029530032,0.0036945727,0.035951857],"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.00010613694,0.00005966884,0.00059619674,0.00022781092,0.000039971153,0.00012967698,0.00036000347,0.0012547544,0.00095209567,0.21960682,0.6749359,0.101731114],"study_design_scores_gemma":[0.000010700031,0.000018958908,0.00037630094,0.00009569231,0.000018924477,0.00012595743,0.00012836726,0.0015834139,0.00046631793,0.037075758,0.9600733,0.000026244636],"about_ca_topic_score_codex":0.013433417,"about_ca_topic_score_gemma":0.017406695,"teacher_disagreement_score":0.124508485,"about_ca_system_score_codex":0.0075527295,"about_ca_system_score_gemma":0.003803101,"threshold_uncertainty_score":0.41652238},"labels":[],"label_agreement":null},{"id":"W7100628069","doi":"","title":"University of Alberta Customized Raptor Code Designs for Finite Lengths and Practical Settings","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Permission; Code (set theory); Block (permutation group theory); Decoding methods; Extension (predicate logic); Raptor code","score_opus":0.02561581926195506,"score_gpt":0.24790652488437645,"score_spread":0.2222907056224214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100628069","genre_codex":"methods","genre_gemma":"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.031369433,0.0012135959,0.94297487,0.00033873323,0.000085644235,0.00012354158,0.0001952505,0.00069569563,0.0230033],"genre_scores_gemma":[0.41606066,0.0012834755,0.5685819,0.00019362925,0.00009986022,0.0002849929,0.0002483847,0.00012601263,0.013121154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881244,0.00038956857,0.00004907587,0.00016735941,0.00044311924,0.00013842163],"domain_scores_gemma":[0.9974256,0.0010557069,0.00025466483,0.0007398278,0.00045002872,0.00007406117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010856233,0.00079248665,0.00047470356,0.00078284513,0.00055156735,0.0010693148,0.0009319484,0.0007276672,0.0039471164],"category_scores_gemma":[0.0044615273,0.00038419847,0.00035451577,0.00095583434,0.0007594042,0.000991461,0.001021422,0.00107549,0.0011517198],"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.00045590883,0.000095350115,0.0009225734,0.00029398207,0.000065234926,0.0003958977,0.00034849063,0.35264584,0.033933796,0.31149247,0.009771779,0.28957868],"study_design_scores_gemma":[0.000084773266,0.00033489775,0.00052070216,0.00014029605,0.000055368993,0.0008528807,0.00006652635,0.8254506,0.030565372,0.1035148,0.03833417,0.00007956454],"about_ca_topic_score_codex":0.0023755447,"about_ca_topic_score_gemma":0.0064068134,"teacher_disagreement_score":0.0039471164,"about_ca_system_score_codex":0.0014490272,"about_ca_system_score_gemma":0.0022198977,"threshold_uncertainty_score":0.013204396},"labels":[],"label_agreement":null},{"id":"W7120289752","doi":"","title":"A family of error-correcting codes to eficient cryptosystems based on syndrome decoding.","year":2010,"lang":"pt","type":"dissertation","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cryptosystem; Hierarchy; Public key cryptosystem; Class (philosophy)","score_opus":0.0262533683709543,"score_gpt":0.2658196923045793,"score_spread":0.239566323933625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7120289752","genre_codex":"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.084228195,0.006411741,0.81368315,0.002352137,0.0014986566,0.0008987958,0.0011270188,0.0029687542,0.08683148],"genre_scores_gemma":[0.67998403,0.004832216,0.23163302,0.0011553168,0.00047093048,0.0007172112,0.0013554133,0.0003101643,0.07954167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984713,0.00033928984,0.000102920756,0.0002327629,0.0006350795,0.00021853419],"domain_scores_gemma":[0.99756324,0.00071269675,0.00028281336,0.0005694121,0.0007247559,0.00014700036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011979702,0.0012634023,0.0007334218,0.0020220215,0.0014063482,0.0017663597,0.0009314451,0.0015719989,0.005914037],"category_scores_gemma":[0.007032713,0.00034191497,0.0008420035,0.0013419356,0.0015514009,0.0016094185,0.0021815442,0.0014626384,0.0030238044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053985126,0.00010140036,0.0024165248,0.00044990669,0.00013558353,0.00085688394,0.0005061984,0.051693637,0.013169326,0.68549913,0.015185167,0.22944635],"study_design_scores_gemma":[0.0002890849,0.0007945651,0.0018312009,0.00067825033,0.00017378118,0.0046350355,0.00029235965,0.31003273,0.033619054,0.46747583,0.180028,0.00015013618],"about_ca_topic_score_codex":0.0019155919,"about_ca_topic_score_gemma":0.0020362001,"teacher_disagreement_score":0.005914037,"about_ca_system_score_codex":0.0012117611,"about_ca_system_score_gemma":0.0032329548,"threshold_uncertainty_score":0.01978439},"labels":[],"label_agreement":null},{"id":"W71254070","doi":"","title":"Combinatorial properties of the divisibilty of mn by am + bn + c.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.016232122160847007,"score_gpt":0.1975913502918124,"score_spread":0.1813592281309654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71254070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.7191475,0.00080408796,0.030877117,0.0038541525,0.0004371198,0.00010410778,0.0007610712,0.00027154008,0.24374327],"genre_scores_gemma":[0.9659176,0.0003025038,0.0057637645,0.00038505415,0.0004255508,0.0001116636,0.00045290813,0.00012200539,0.02651902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990375,0.00025567916,0.00005575816,0.0002003762,0.00024179251,0.00020893473],"domain_scores_gemma":[0.99645585,0.001711375,0.0006035846,0.00048074024,0.00025304497,0.0004954115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093067874,0.000741117,0.0006298537,0.0018100955,0.0017764678,0.0027506708,0.0011228999,0.001045611,0.02080278],"category_scores_gemma":[0.0052984687,0.00046366663,0.0005831073,0.0010557958,0.0039450508,0.0039582937,0.0031535146,0.002717109,0.0020236117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024872384,0.000052894025,0.0006709344,0.00006724287,0.000016612286,0.00022622192,0.0002912886,0.0019517977,0.0030391566,0.9806445,0.0038561788,0.008934401],"study_design_scores_gemma":[0.000080218626,0.00006653332,0.0011465113,0.00003667041,0.000020760914,0.0006591896,0.00009453425,0.0060729277,0.0023743797,0.9793506,0.010065831,0.00003194189],"about_ca_topic_score_codex":0.0007637325,"about_ca_topic_score_gemma":0.0008161838,"teacher_disagreement_score":0.02080278,"about_ca_system_score_codex":0.0011556013,"about_ca_system_score_gemma":0.00052739045,"threshold_uncertainty_score":0.06959218},"labels":[],"label_agreement":null},{"id":"W71375510","doi":"","title":"Application of Computer Algebra in List Decoding","year":2013,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Decoding methods; Algebra over a field; List decoding; Arithmetic; Mathematics; Algorithm; Pure mathematics","score_opus":0.04636306062092578,"score_gpt":0.2759508251952433,"score_spread":0.2295877645743175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71375510","genre_codex":"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.015496548,0.0042104647,0.8982364,0.0033759468,0.0008441348,0.00009977133,0.0003475875,0.00044557502,0.076943666],"genre_scores_gemma":[0.49364173,0.01135402,0.44698256,0.002421772,0.00274916,0.00058018166,0.0010344569,0.0004489948,0.04078714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858034,0.0005282101,0.00010349562,0.00028727404,0.0003577837,0.00014285868],"domain_scores_gemma":[0.99759966,0.0014265465,0.00013953337,0.00032385538,0.0004469413,0.00006355828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013411517,0.0007369326,0.00077870133,0.0016900548,0.0013462079,0.002483609,0.0009817282,0.00097301154,0.008273245],"category_scores_gemma":[0.006830428,0.00033855828,0.0014088866,0.0021832036,0.0029181368,0.0033202006,0.0023002843,0.004082496,0.0039518187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033948545,0.000029675324,0.00029620712,0.00014653208,0.000016598933,0.000113549264,0.0002553626,0.013533296,0.0009442206,0.946847,0.00479155,0.032991968],"study_design_scores_gemma":[0.000013564011,0.000027872768,0.00011939238,0.000050879622,0.0000080418695,0.00013294451,0.000034457753,0.054194603,0.0010885798,0.9320273,0.012274316,0.000028099174],"about_ca_topic_score_codex":0.0026300573,"about_ca_topic_score_gemma":0.001692285,"teacher_disagreement_score":0.008273245,"about_ca_system_score_codex":0.0017136028,"about_ca_system_score_gemma":0.0013538973,"threshold_uncertainty_score":0.027676761},"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":"W813408335","doi":"","title":"Optimized Baby Step-Giant Step Methods","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Group (periodic table); Homogeneous space; Interval (graph theory); Logarithm; Computation; Mathematics; Abelian group; Computer science; Mathematical optimization; Combinatorics; Geometry","score_opus":0.021671581640086698,"score_gpt":0.3057153022000379,"score_spread":0.2840437205599512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W813408335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"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.016692882,0.00012133193,0.97672576,0.00010165815,0.00006320676,0.000069526846,0.00010201702,0.00083661085,0.0052870465],"genre_scores_gemma":[0.16304815,0.00012603891,0.82565314,0.00014700717,0.000048435257,0.00020233988,0.0003080123,0.00057629065,0.009890598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926597,0.00024018071,0.000045943147,0.00008556479,0.00026819893,0.0000941368],"domain_scores_gemma":[0.9986432,0.00048899994,0.000088733264,0.00042451252,0.00028900884,0.00006558348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009489486,0.00053316937,0.0006874301,0.00092876976,0.00041538588,0.0007787554,0.0014687217,0.0007182447,0.011763001],"category_scores_gemma":[0.00437342,0.00035489417,0.0006034807,0.0009836105,0.0006672884,0.0015885821,0.0017289731,0.0011443463,0.0025117046],"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.0008554861,0.0001751789,0.0019724322,0.00030546408,0.00012601475,0.0002466687,0.00024940658,0.13718481,0.015961321,0.28491428,0.013243359,0.5447656],"study_design_scores_gemma":[0.00012833154,0.00015854299,0.00045926095,0.000029641866,0.000029378616,0.00017587829,0.000059645456,0.87543243,0.012865046,0.1001301,0.010492632,0.000039046226],"about_ca_topic_score_codex":0.0007681542,"about_ca_topic_score_gemma":0.0020340367,"teacher_disagreement_score":0.011763001,"about_ca_system_score_codex":0.0005137187,"about_ca_system_score_gemma":0.0010497966,"threshold_uncertainty_score":0.039351165},"labels":[],"label_agreement":null},{"id":"W81760815","doi":"","title":"A bit-serial word-parallel finite field multiplier using redundant basis in F 2 M","year":2007,"lang":"en","type":"article","venue":"Communication Systems and Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Computer science; Finite field; Basis (linear algebra); Word (group theory); Parallel architecture; Arithmetic; Bit (key); Architecture; Parallel computing; Word length; Algorithm; Mathematics; Discrete mathematics","score_opus":0.030023732731777882,"score_gpt":0.2716742679876745,"score_spread":0.24165053525589664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81760815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.32857254,0.0011049057,0.6510058,0.00029242682,0.00024999905,0.00017289567,0.00017256178,0.0019915036,0.016437342],"genre_scores_gemma":[0.67995644,0.00028765446,0.3113548,0.00009791828,0.00006328685,0.00009068336,0.00013034527,0.000029829318,0.007988981],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991703,0.0000185617,0.0000062984354,0.000014148038,0.000029672545,0.0000142679655],"domain_scores_gemma":[0.99988747,0.000020555748,0.000021263506,0.000022207905,0.000038645307,0.000009892523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017228334,0.00037024874,0.0003252516,0.00043951016,0.00034550263,0.0003450178,0.0005883533,0.0003991204,0.0023600198],"category_scores_gemma":[0.00022341192,0.00017808459,0.00026482323,0.00048471807,0.00017853652,0.0005574575,0.00019372397,0.00028740047,0.0006625121],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008856838,0.00015442928,0.0009918257,0.0004060672,0.000107071886,0.0009543805,0.00014396243,0.019583138,0.5924248,0.041131046,0.0035958907,0.33962163],"study_design_scores_gemma":[0.00044398656,0.004774653,0.0040064068,0.00013076067,0.00030419475,0.0065989434,0.000112833746,0.38794932,0.53186786,0.016659832,0.04697513,0.00017605408],"about_ca_topic_score_codex":0.0002879611,"about_ca_topic_score_gemma":0.0007843075,"teacher_disagreement_score":0.0023600198,"about_ca_system_score_codex":0.0001730471,"about_ca_system_score_gemma":0.00032752464,"threshold_uncertainty_score":0.007895052},"labels":[],"label_agreement":null},{"id":"W81892204","doi":"10.4153/cmb-2004-056-7","title":"A Generalization of the Turán Theorem and Its Applications","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Mathematical Society","keywords":"Mathematics; Generalization; Order (exchange); Context (archaeology); Function field; Field (mathematics); Pure mathematics; Function (biology); Algebra over a field; Mathematical analysis","score_opus":0.007399357207807976,"score_gpt":0.19276489342862435,"score_spread":0.18536553622081636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81892204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.118090935,0.009064666,0.5556453,0.010210447,0.003013124,0.000102970786,0.0006802478,0.0010731858,0.3021191],"genre_scores_gemma":[0.9077263,0.0046576518,0.060187355,0.0030092213,0.002626416,0.00011249337,0.00032130716,0.00023465339,0.021124683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854577,0.00043676485,0.000094152776,0.00039498744,0.00034502838,0.00018324809],"domain_scores_gemma":[0.99785596,0.00078840286,0.0002239293,0.0005033352,0.00047050757,0.00015792354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019510234,0.0006019848,0.00112894,0.0022593013,0.0018500375,0.0025914537,0.0013869373,0.0013232914,0.005357431],"category_scores_gemma":[0.004259005,0.00033112263,0.0012557093,0.0017733942,0.006156454,0.0059567476,0.0036701423,0.0029471854,0.0011918866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005922064,0.0000043157,0.000104805345,0.00002423722,0.0000042806046,0.00005429742,0.00006144881,0.00081015256,0.00013690499,0.9931189,0.0013997586,0.004275016],"study_design_scores_gemma":[0.000005492587,0.000013008648,0.00022233813,0.000024782412,0.000006745986,0.00019273533,0.000036830166,0.004645287,0.00022434068,0.9789828,0.015631644,0.000014092973],"about_ca_topic_score_codex":0.0022379563,"about_ca_topic_score_gemma":0.0013114524,"teacher_disagreement_score":0.005357431,"about_ca_system_score_codex":0.0017325726,"about_ca_system_score_gemma":0.0010036133,"threshold_uncertainty_score":0.017922461},"labels":[],"label_agreement":null},{"id":"W88187898","doi":"","title":"New Quasi-Cyclic Codes over GF(8) with Improved Minimum Distance.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Minimum distance; Arithmetic","score_opus":0.006523910088930377,"score_gpt":0.21579717158636735,"score_spread":0.20927326149743697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88187898","genre_codex":"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.41718885,0.008185054,0.4813384,0.0056682527,0.0027972413,0.00036947028,0.0016391259,0.002259787,0.080553874],"genre_scores_gemma":[0.678603,0.0023120383,0.28726628,0.0009645913,0.0007095889,0.00030234325,0.0013180809,0.00025502816,0.028269041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992654,0.00015252341,0.000050172945,0.00008083365,0.00033944007,0.00011160948],"domain_scores_gemma":[0.9979388,0.00066132646,0.00031908462,0.0004931157,0.0004005047,0.00018713169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809465,0.00039430693,0.00047586721,0.00085452147,0.00062378857,0.0011580968,0.00083367864,0.00076643005,0.0048445407],"category_scores_gemma":[0.0028657222,0.00029299184,0.00031387518,0.0011174594,0.0007384584,0.0015753433,0.0011254824,0.0010491257,0.0013961071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001315887,0.00040116216,0.0018400301,0.00066419493,0.00009625477,0.00077104237,0.00049144996,0.02929025,0.11480594,0.5487378,0.023697147,0.27788886],"study_design_scores_gemma":[0.00085776014,0.0013553597,0.0038700148,0.0003677834,0.00024008243,0.0048973244,0.00029185935,0.2568097,0.1488657,0.39980564,0.18232597,0.0003128928],"about_ca_topic_score_codex":0.00048931694,"about_ca_topic_score_gemma":0.0017741026,"teacher_disagreement_score":0.0048445407,"about_ca_system_score_codex":0.0007626267,"about_ca_system_score_gemma":0.0013668434,"threshold_uncertainty_score":0.016206622},"labels":[],"label_agreement":null},{"id":"W95819301","doi":"10.1007/3-540-44983-3_20","title":"Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders (Extended Abstract)","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Prime (order theory); Cryptosystem; Factorization; Quadratic equation; Embedding; Discrete mathematics; Class (philosophy); Group (periodic table); Logarithm; Cyclic group; Mathematics; Computer science; Algebra over a field; Theoretical computer science; Pure mathematics; Combinatorics; Algorithm; Public-key cryptography; Cryptography; Encryption; Artificial intelligence","score_opus":0.026177758402865958,"score_gpt":0.28772726128539006,"score_spread":0.2615495028825241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95819301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.03939935,0.003804537,0.82662046,0.0026521909,0.0007632993,0.00019093532,0.00013138645,0.0015091089,0.124928765],"genre_scores_gemma":[0.46271193,0.0051623425,0.4107602,0.0006570484,0.0008902913,0.0002510509,0.00047493135,0.00071634026,0.11837585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993405,0.00011960457,0.000025079447,0.000085737396,0.00033862455,0.000090454545],"domain_scores_gemma":[0.99921024,0.0004372327,0.000036055055,0.00017083412,0.000100675985,0.0000449269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856143,0.00090074877,0.0005178159,0.00047386653,0.00072875636,0.0025015764,0.0011184749,0.00088807195,0.011967219],"category_scores_gemma":[0.0014844269,0.00068139675,0.00046931658,0.0006579916,0.002130049,0.0052303276,0.0020943445,0.003499464,0.0039443295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000190045,0.00010235327,0.00012484918,0.00034414837,0.000017179887,0.000132447,0.00034056103,0.007875194,0.018126445,0.8821579,0.008550106,0.08203885],"study_design_scores_gemma":[0.00013225086,0.00015655204,0.00018338552,0.00011690258,0.000022283328,0.00036329977,0.00008918986,0.065481156,0.027731169,0.8291945,0.07648791,0.000041410065],"about_ca_topic_score_codex":0.00023487928,"about_ca_topic_score_gemma":0.00038675003,"teacher_disagreement_score":0.011967219,"about_ca_system_score_codex":0.0011486225,"about_ca_system_score_gemma":0.00054544845,"threshold_uncertainty_score":0.040034294},"labels":[],"label_agreement":null}]}