{"meta":{"query_hash":"6ecf5e280fda","filters":{"venue":"Cryptography and Communications"},"cohort_total":41,"direct_labels_cover":0,"predictions_cover":41,"exported":41,"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/6ecf5e280fda","api":"https://metacan.xera.ac/api/v1/cohort?venue=Cryptography+and+Communications"},"results":[{"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":"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":"W1986968979","doi":"10.1007/s12095-011-0061-3","title":"Fault analysis of the NTRUSign digital signature scheme","year":2012,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Signature (topology); Digital signature; Discrete mathematics; NTRU; Transpose; Computer science; Combinatorics; Polynomial; Lattice (music); Mathematics; Algorithm; Physics; Cryptography; Computer security; Quantum mechanics; Mathematical analysis; Geometry","score_opus":0.021450423385992394,"score_gpt":0.2749272250956457,"score_spread":0.2534768017096533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986968979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5973682,0.00064907817,0.38965955,0.0011966057,0.00016017437,0.00007087943,0.00031386144,0.001529454,0.009052244],"genre_scores_gemma":[0.9894629,0.000046881938,0.0087540075,0.000040721017,0.000023299255,0.000007758479,0.00009427682,0.000024852929,0.0015452661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981451,0.00032989256,0.0001222694,0.00019859608,0.0009480884,0.0002559702],"domain_scores_gemma":[0.9955781,0.0017499943,0.00056330813,0.0011780343,0.0008231428,0.00010737921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009412151,0.00033740603,0.00054660486,0.0010652433,0.00052555476,0.0010933673,0.00073488307,0.0010422802,0.0031608709],"category_scores_gemma":[0.0071682604,0.0001801714,0.00043416422,0.00073608616,0.0010760598,0.0022860765,0.0009263831,0.0007206674,0.00052206806],"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.0052309884,0.00023075072,0.018076984,0.00042551366,0.00014187001,0.0013401147,0.0006580219,0.29890442,0.087220624,0.39725646,0.005772943,0.18474129],"study_design_scores_gemma":[0.000057219386,0.00027134814,0.0020151841,0.00003279869,0.000037604597,0.000645288,0.00005572279,0.8474523,0.04379567,0.10325956,0.0023378015,0.00003948919],"about_ca_topic_score_codex":0.0009264136,"about_ca_topic_score_gemma":0.0005654381,"teacher_disagreement_score":0.0031608709,"about_ca_system_score_codex":0.0011836941,"about_ca_system_score_gemma":0.0011351418,"threshold_uncertainty_score":0.010574162},"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":"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":"W2035522326","doi":"10.1007/s12095-014-0102-9","title":"Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64","year":2014,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":35,"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":"Block cipher; Computer science; Key schedule; Key (lock); Block size; Cipher; Block (permutation group theory); Cryptography; Theoretical computer science; Computer security; Differential cryptanalysis; Arithmetic; Mathematics; Encryption","score_opus":0.06520715281484786,"score_gpt":0.3169153443027311,"score_spread":0.25170819148788326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035522326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23486698,0.0012460004,0.63649136,0.0049137864,0.0005062715,0.00026665255,0.0002866018,0.0015584849,0.11986393],"genre_scores_gemma":[0.890595,0.00057985034,0.088723116,0.00031568037,0.000184068,0.00013990006,0.0001603655,0.00017065983,0.01913135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981975,0.00055921567,0.000075469135,0.00017083275,0.0006670747,0.00032992748],"domain_scores_gemma":[0.9971419,0.0011814825,0.00032905568,0.0008517402,0.00037301262,0.0001228575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017469316,0.00065412535,0.0007870402,0.0017537227,0.0020969573,0.0018736083,0.0008004736,0.0020983857,0.00570416],"category_scores_gemma":[0.008259508,0.00029023472,0.00072062167,0.001996104,0.002289724,0.003841938,0.003852129,0.0021029466,0.0011409351],"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.0006254175,0.00019691313,0.0012904947,0.00008853927,0.000042672047,0.00041391936,0.0003990228,0.05712425,0.0057591856,0.8489289,0.009975922,0.07515478],"study_design_scores_gemma":[0.000034155044,0.000082360566,0.00044043065,0.000030557225,0.000018475164,0.0005157742,0.00017500843,0.5013601,0.005731278,0.48413733,0.00741347,0.000061050516],"about_ca_topic_score_codex":0.00096017355,"about_ca_topic_score_gemma":0.0010066854,"teacher_disagreement_score":0.00570416,"about_ca_system_score_codex":0.0013972211,"about_ca_system_score_gemma":0.0011591276,"threshold_uncertainty_score":0.019082308},"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":"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":"W2073411533","doi":"10.1007/s12095-014-0101-x","title":"Revisiting iterated attacks in the context of decorrelation theory","year":2014,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","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":"Canadian Imperial Bank of Commerce (Canada)","funders":"","keywords":"Decorrelation; Iterated function; Stream cipher; Ciphertext; Computer science; Cipher; Plaintext; Mathematics; Theoretical computer science; Block cipher; Algorithm; Context (archaeology); Generalization; Discrete mathematics; Cryptography; Encryption; Computer security","score_opus":0.02313353761003308,"score_gpt":0.29160466073669583,"score_spread":0.26847112312666277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073411533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052497897,0.0026632347,0.82172555,0.005449529,0.00081680744,0.00005908137,0.000072095136,0.00022995079,0.116485894],"genre_scores_gemma":[0.8937693,0.0024716302,0.085264094,0.0014176698,0.001313165,0.00008127646,0.00006725017,0.00022971332,0.015385881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931238,0.0035179066,0.0003106889,0.0007538628,0.0015754086,0.0007183927],"domain_scores_gemma":[0.9879381,0.0071784416,0.0007267718,0.0030229501,0.0008850457,0.000248716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043769036,0.0011550825,0.0013088924,0.0012916372,0.0019419998,0.005605205,0.002057406,0.003556757,0.0057253693],"category_scores_gemma":[0.014935001,0.0007226563,0.0014679108,0.00107172,0.011575584,0.015488212,0.005857817,0.006812337,0.0011408667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065932886,0.0000058331025,0.000054790158,0.000016608803,0.0000045366332,0.000045304012,0.00008379589,0.001563119,0.00021982587,0.9959726,0.00023996514,0.0017869008],"study_design_scores_gemma":[0.0000048800234,0.000012887777,0.000040666728,0.000026789803,0.0000048929974,0.00006823527,0.00002801564,0.011805852,0.00026405635,0.98516095,0.0025716273,0.000011101814],"about_ca_topic_score_codex":0.00081789383,"about_ca_topic_score_gemma":0.0006959726,"teacher_disagreement_score":0.0057253693,"about_ca_system_score_codex":0.0016974208,"about_ca_system_score_gemma":0.0013211111,"threshold_uncertainty_score":0.023147523},"labels":[],"label_agreement":null},{"id":"W2100535482","doi":"10.1007/s12095-010-0029-8","title":"Unbiased complex Hadamard matrices and bases","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","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 Lethbridge","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Mathematics; Mutually unbiased bases; Order (exchange); Hadamard product; Hadamard's inequality; Combinatorics; Hadamard's maximal determinant problem; Pure mathematics; Mathematical analysis","score_opus":0.02123927109641836,"score_gpt":0.2520727094033488,"score_spread":0.23083343830693046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100535482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061476562,0.003361466,0.88422716,0.001214179,0.00078714633,0.00006625864,0.00047774834,0.00022805197,0.04816146],"genre_scores_gemma":[0.6951516,0.0049742223,0.24881843,0.0010065512,0.001379642,0.00022125286,0.00065191655,0.00022040648,0.047575984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892163,0.00033326607,0.000058324276,0.00014815187,0.00042983278,0.000108708555],"domain_scores_gemma":[0.9982901,0.00049337605,0.0002362613,0.0004235417,0.0004678456,0.00008888887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014217002,0.0007636852,0.00059811724,0.0019620396,0.00073745317,0.002329402,0.0006711681,0.0012527442,0.0047075795],"category_scores_gemma":[0.005453197,0.00045121234,0.00034334385,0.0017062065,0.0017090841,0.002032596,0.0012114282,0.0014507262,0.0017102398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028093173,0.000009478612,0.00012960935,0.000029802106,0.0000066847833,0.000033917648,0.000069443464,0.0052811573,0.0024615799,0.97748125,0.0009517435,0.0135173965],"study_design_scores_gemma":[0.000014567239,0.000032216853,0.0002884967,0.000043324162,0.000009129492,0.00022075155,0.000049451985,0.040201224,0.004618501,0.9442063,0.010265176,0.000050924584],"about_ca_topic_score_codex":0.0003498921,"about_ca_topic_score_gemma":0.0003267219,"teacher_disagreement_score":0.0047075795,"about_ca_system_score_codex":0.0005091538,"about_ca_system_score_gemma":0.0006722881,"threshold_uncertainty_score":0.015748382},"labels":[],"label_agreement":null},{"id":"W2116360492","doi":"10.1007/s12095-010-0039-6","title":"Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","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":"Engineering and Physical Sciences Research Council","keywords":"Secret sharing; Access structure; Overhead (engineering); Computer science; Converse; Decoding methods; Secure multi-party computation; Scheme (mathematics); Theoretical computer science; Context (archaeology); Mathematics; Cryptography; Algorithm","score_opus":0.02625024890392574,"score_gpt":0.2840280931100921,"score_spread":0.25777784420616634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116360492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12238964,0.0006305605,0.8574687,0.0018143825,0.00014091446,0.00017355966,0.00032657624,0.0005791339,0.0164765],"genre_scores_gemma":[0.9421973,0.0005115192,0.0443635,0.000264829,0.00013989207,0.00019128875,0.0001897015,0.00012100265,0.012021018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99352527,0.0016813035,0.0003364118,0.0011147595,0.0018271789,0.0015151392],"domain_scores_gemma":[0.9822474,0.010473962,0.0019690061,0.0040827617,0.0008384313,0.00038849114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004930533,0.001657302,0.0023745087,0.0011525857,0.0021465498,0.0032767134,0.0027767627,0.0038924168,0.003613992],"category_scores_gemma":[0.016974175,0.001347721,0.0013148611,0.0015027197,0.006796376,0.010203447,0.006410445,0.0048237983,0.0010098101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013598669,0.0001302004,0.0005296517,0.00025636255,0.00011057775,0.00055971637,0.0007885877,0.18977852,0.008981147,0.77935225,0.0024559246,0.015697125],"study_design_scores_gemma":[0.00011828468,0.00014738973,0.00019195105,0.00005052433,0.00006778547,0.00032039595,0.00008425304,0.43735427,0.008353303,0.551832,0.0013832396,0.00009653958],"about_ca_topic_score_codex":0.0011546336,"about_ca_topic_score_gemma":0.00096179225,"teacher_disagreement_score":0.004930533,"about_ca_system_score_codex":0.0029895313,"about_ca_system_score_gemma":0.0034349929,"threshold_uncertainty_score":0.026075423},"labels":[],"label_agreement":null},{"id":"W2125124709","doi":"10.1007/s12095-015-0134-9","title":"On encoding symbol degrees of array BP-XOR codes","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Error Correcting Code Techniques","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":"Luby transform code; Low-density parity-check code; Fountain code; Encoding (memory); Decoding methods; Exclusive or; Computer science; Bitwise operation; Belief propagation; Arithmetic; Tornado code; Binary number; Symbol (formal); Algorithm; Theoretical computer science; Mathematics; Error floor","score_opus":0.0674218556422158,"score_gpt":0.30376916118930675,"score_spread":0.23634730554709094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125124709","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.15417814,0.0009430266,0.79874474,0.0010299901,0.00044457443,0.0000827631,0.00042124212,0.0004989379,0.043656643],"genre_scores_gemma":[0.8048084,0.0017573289,0.17532301,0.00040556488,0.00038390784,0.00016203846,0.0003987068,0.0002715508,0.016489528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991762,0.0002922897,0.000048394002,0.00008579716,0.00029099334,0.00010637705],"domain_scores_gemma":[0.9981034,0.0011410442,0.00015818446,0.00024165722,0.00027974375,0.000076031974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157374,0.0007122593,0.0004355743,0.0009184132,0.0006239099,0.0013037472,0.0005709088,0.0005411833,0.003357293],"category_scores_gemma":[0.0052039,0.00027813224,0.00027334248,0.0012014254,0.0013008168,0.002158543,0.0014393596,0.0014046817,0.000936108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004014536,0.000039248,0.000672892,0.0001037631,0.000013647384,0.00008912683,0.00032055672,0.04188642,0.011308789,0.85268116,0.0023953894,0.09008757],"study_design_scores_gemma":[0.00004328503,0.000109416505,0.0005030234,0.000111456284,0.000026461297,0.00020299837,0.00010567786,0.22567661,0.024698768,0.7390533,0.009398521,0.000070514216],"about_ca_topic_score_codex":0.000742533,"about_ca_topic_score_gemma":0.00078321557,"teacher_disagreement_score":0.003357293,"about_ca_system_score_codex":0.0007504291,"about_ca_system_score_gemma":0.0007594697,"threshold_uncertainty_score":0.011231244},"labels":[],"label_agreement":null},{"id":"W2130959496","doi":"10.1007/s12095-009-0013-3","title":"On the structural weakness of the GGHN stream cipher","year":2009,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptographic Implementations and Security","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":"Concordia University","funders":"","keywords":"Keystream; Stream cipher; RC4; Computer science; State (computer science); Stream cipher attack; Cryptanalysis; Computation; Arithmetic; Algorithm; Cryptography; Theoretical computer science; Parallel computing; Mathematics","score_opus":0.019974549228413296,"score_gpt":0.2722364008669581,"score_spread":0.2522618516385448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130959496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5191406,0.006019798,0.3308875,0.013049259,0.0009068078,0.0001327048,0.000307718,0.0003642159,0.12919137],"genre_scores_gemma":[0.9753294,0.0016972831,0.012963713,0.00067163963,0.00033862048,0.000036482877,0.00008412917,0.000051197912,0.008827586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860114,0.0004620627,0.00006710367,0.00013883624,0.0005513917,0.00017938016],"domain_scores_gemma":[0.9962255,0.002251187,0.00032740194,0.000759161,0.00036445304,0.00007223838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023011116,0.00045660025,0.0005459374,0.00093875895,0.00068251364,0.0013348355,0.0007304188,0.0014844716,0.002636542],"category_scores_gemma":[0.007073518,0.0003783067,0.0003182249,0.0008931069,0.0035729427,0.0053852396,0.002062873,0.0027912268,0.0008402998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029105844,0.00003626233,0.0007430641,0.0001215989,0.000024103385,0.00029501924,0.0002833057,0.013245009,0.010578898,0.9450007,0.0025265382,0.026854418],"study_design_scores_gemma":[0.00004601673,0.00012747195,0.0005394649,0.00005632117,0.000029873347,0.00057157356,0.000107429805,0.04436604,0.008967888,0.9374344,0.007718095,0.0000354071],"about_ca_topic_score_codex":0.00033894775,"about_ca_topic_score_gemma":0.00024628473,"teacher_disagreement_score":0.002636542,"about_ca_system_score_codex":0.00071264565,"about_ca_system_score_gemma":0.0006429557,"threshold_uncertainty_score":0.0121695995},"labels":[],"label_agreement":null},{"id":"W2140046536","doi":"10.1007/s12095-015-0125-x","title":"Extended results on privacy against coalitions of users in user-private information retrieval protocols","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Privacy-Preserving Technologies in Data","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":"Computer science; Anonymity; Private information retrieval; Probabilistic logic; Differential privacy; Information retrieval; Identity (music); Set (abstract data type); Computer security; Database; Data mining","score_opus":0.07438507081949432,"score_gpt":0.3265853601268155,"score_spread":0.2522002893073212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140046536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042586815,0.0018666363,0.91161805,0.005919324,0.00041069585,0.0002900184,0.0007972826,0.00045008768,0.03606102],"genre_scores_gemma":[0.8318866,0.003706116,0.11950722,0.0025666892,0.0017081228,0.0009882925,0.0012589564,0.0005861531,0.037791956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97989446,0.0070861285,0.0012406431,0.0028381168,0.005671609,0.0032689709],"domain_scores_gemma":[0.90443915,0.06960418,0.0039148782,0.014624014,0.005065051,0.0023527618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014144898,0.002183264,0.004354038,0.0034184144,0.005102865,0.009600139,0.007604318,0.006326742,0.012456566],"category_scores_gemma":[0.062223427,0.0019555972,0.0045984555,0.0070016966,0.009979141,0.03282569,0.014326401,0.011637544,0.0026650692],"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.0004384361,0.00013477847,0.00058297784,0.00032263418,0.0001391535,0.00023488168,0.0013573002,0.028108705,0.0014942895,0.9450594,0.0047106347,0.01741681],"study_design_scores_gemma":[0.00006621954,0.00006358948,0.00012898608,0.00005090406,0.00007860833,0.0001497044,0.00014483609,0.07338871,0.0013972408,0.9204228,0.0040729675,0.000035527748],"about_ca_topic_score_codex":0.0017672115,"about_ca_topic_score_gemma":0.0007604187,"teacher_disagreement_score":0.014144898,"about_ca_system_score_codex":0.0044399914,"about_ca_system_score_gemma":0.0037202523,"threshold_uncertainty_score":0.07480627},"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":"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":"W2293795016","doi":"10.1007/s12095-015-0178-x","title":"A new class of Fibonacci sequence based error correcting codes","year":2016,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","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 Victoria","funders":"","keywords":"Fibonacci number; Parity-check matrix; Mathematics; Combinatorics; Decoding methods; Matrix (chemical analysis); Integer matrix; Error detection and correction; Integer (computer science); Discrete mathematics; Inverse; Binary number; Class (philosophy); Sequence (biology); Low-density parity-check code; Arithmetic; Algorithm; Computer science; Nonnegative matrix; Symmetric matrix; Physics","score_opus":0.03790508481512996,"score_gpt":0.3152612926342888,"score_spread":0.2773562078191589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293795016","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.09794269,0.007783738,0.8134228,0.0012439421,0.0021436855,0.0002882115,0.0008081981,0.0022762627,0.07409044],"genre_scores_gemma":[0.61901885,0.004444634,0.3271445,0.0018666106,0.00089125434,0.0004975386,0.0010774768,0.00041969412,0.04463951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921656,0.00010297332,0.00005246118,0.00012809897,0.00040824147,0.00009172106],"domain_scores_gemma":[0.9984434,0.0004579988,0.00016015995,0.00033538535,0.0005165453,0.00008645933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053039,0.0007254446,0.0007579622,0.0023410288,0.0011857264,0.0017891089,0.0010196427,0.0015044629,0.003200674],"category_scores_gemma":[0.0031559572,0.00023542925,0.0005251557,0.0015154917,0.00095640274,0.0011580338,0.0007700403,0.001223947,0.0012144089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002148846,0.000059252576,0.0010373116,0.0002387619,0.000046173245,0.00037311818,0.00022324163,0.017197492,0.026885314,0.7840325,0.010109435,0.15958245],"study_design_scores_gemma":[0.00012416774,0.0002903675,0.0011138335,0.00022294703,0.00008629366,0.0031842145,0.00006474447,0.26318574,0.041588128,0.55424595,0.1356681,0.00022543356],"about_ca_topic_score_codex":0.00077022234,"about_ca_topic_score_gemma":0.00086360826,"teacher_disagreement_score":0.003200674,"about_ca_system_score_codex":0.0007801489,"about_ca_system_score_gemma":0.0014460792,"threshold_uncertainty_score":0.010707319},"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":"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":"W2745796023","doi":"10.1007/s12095-017-0253-6","title":"Security of BLS and BGLS signatures in a multi-user setting","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"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":"Horizon 2020 Framework Programme; University of Waterloo; European Commission","keywords":"Computer science; Chemistry","score_opus":0.02860318381621792,"score_gpt":0.30377426839742083,"score_spread":0.27517108458120293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745796023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10647443,0.001028764,0.85045505,0.0028281584,0.00021236192,0.00020494252,0.00032054473,0.00079098856,0.03768476],"genre_scores_gemma":[0.9317751,0.00045345712,0.059394877,0.0005087316,0.00022784453,0.0001468951,0.0001720294,0.00014040429,0.0071807303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98753554,0.0033815766,0.0004619115,0.0019230798,0.0046832296,0.0020146077],"domain_scores_gemma":[0.98679745,0.0048935106,0.0012990697,0.005326053,0.0011229106,0.00056102365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043570916,0.0010483289,0.0014020109,0.0015981863,0.002046431,0.0055054165,0.0021264097,0.002500889,0.0038185476],"category_scores_gemma":[0.010689007,0.00074209506,0.00197869,0.0021071446,0.0062253913,0.013611204,0.008677688,0.0074974056,0.0011209383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025506812,0.00006688887,0.00035738436,0.00008690679,0.000046465044,0.00015736968,0.00031054651,0.033673458,0.0035705715,0.9455054,0.0017998414,0.014170208],"study_design_scores_gemma":[0.000038958136,0.00008087076,0.00028009494,0.00003719745,0.00003838492,0.0002857708,0.000121676916,0.14913796,0.006535874,0.8360955,0.007292783,0.00005502141],"about_ca_topic_score_codex":0.0015469842,"about_ca_topic_score_gemma":0.0009697625,"teacher_disagreement_score":0.0055054165,"about_ca_system_score_codex":0.0051258174,"about_ca_system_score_gemma":0.0031691196,"threshold_uncertainty_score":0.037190616},"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":"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":"W2800569707","doi":"10.1007/s12095-018-0301-x","title":"Error analysis of weak Poly-LWE instances","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","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":"Learning with errors; Gaussian; Encryption; Distribution (mathematics); Error detection and correction; Algorithm; Computer science; Error analysis; Algebraic number; Mathematics; Cryptography; Applied mathematics; Physics; Mathematical analysis","score_opus":0.03121228252270323,"score_gpt":0.2987014544463359,"score_spread":0.26748917192363264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800569707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23667254,0.0014750068,0.7119199,0.007849488,0.00052437355,0.00018600846,0.0015001249,0.0012585758,0.03861397],"genre_scores_gemma":[0.917097,0.000628143,0.062258348,0.00085532933,0.00050992036,0.00028603288,0.0014677503,0.0007637355,0.0161339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99409395,0.0019059498,0.00028969217,0.0007643776,0.0017425413,0.0012034806],"domain_scores_gemma":[0.95683914,0.032025978,0.0018435008,0.0051930556,0.0026889637,0.0014093362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060932892,0.0015206757,0.0024387978,0.002326817,0.0022123514,0.004829669,0.004563178,0.002481834,0.01199229],"category_scores_gemma":[0.050798226,0.0008773399,0.0015625271,0.0025478944,0.0050684744,0.010600443,0.007220807,0.006297366,0.001471212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007469664,0.00014946374,0.0019186996,0.00023846184,0.000081070604,0.0001868951,0.0002731586,0.087020956,0.0009851371,0.8843064,0.009021786,0.015070973],"study_design_scores_gemma":[0.000056138295,0.00002621436,0.00017922124,0.000038582843,0.000022264989,0.00005004508,0.000055178734,0.23537216,0.00070122734,0.76252115,0.00095743086,0.00002036101],"about_ca_topic_score_codex":0.001891221,"about_ca_topic_score_gemma":0.0017432417,"teacher_disagreement_score":0.01199229,"about_ca_system_score_codex":0.0029994878,"about_ca_system_score_gemma":0.0024486925,"threshold_uncertainty_score":0.040118158},"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":"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":"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":"W3121786052","doi":"10.1007/s12095-020-00469-5","title":"Quiescent photonics side channel analysis: Low cost SRAM readout attack","year":2021,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Integrated Circuits and Semiconductor Failure Analysis","field":"Engineering","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":"Photonics; Static random-access memory; Channel (broadcasting); Computer science; Substrate (aquarium); Flash (photography); Optoelectronics; Photon; Computer hardware; Embedded system; Materials science; Optics; Telecommunications; Physics","score_opus":0.025129568954345673,"score_gpt":0.2511682808218927,"score_spread":0.226038711867547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121786052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7535673,0.00067131594,0.16034865,0.002679696,0.0002926487,0.00012024754,0.00048478018,0.0013847082,0.08045057],"genre_scores_gemma":[0.98590463,0.00007375019,0.006069945,0.00036471526,0.000031862844,0.000018628587,0.0000682226,0.000055207318,0.0074129947],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937844,0.000075306496,0.000021264561,0.000101782076,0.00030543347,0.00011771815],"domain_scores_gemma":[0.99914706,0.00034724394,0.000126655,0.00019257738,0.0001562296,0.00003018404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034988645,0.00032642428,0.00021100674,0.00044721673,0.00045183257,0.00086825236,0.0006753098,0.0010864519,0.0064128176],"category_scores_gemma":[0.0014220739,0.00018542154,0.00028123872,0.0002920311,0.0005596661,0.0012490442,0.00062893896,0.00054709817,0.0007513862],"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.0019093734,0.00031295494,0.015366389,0.00033764713,0.00018031544,0.0034362024,0.0005173038,0.023311313,0.59094894,0.23677643,0.016438287,0.110464774],"study_design_scores_gemma":[0.0001037949,0.00092581817,0.008474843,0.000083359395,0.00012212568,0.0029087425,0.00032717563,0.3632113,0.54221594,0.06720532,0.014350543,0.00007104944],"about_ca_topic_score_codex":0.00038286689,"about_ca_topic_score_gemma":0.00081595045,"teacher_disagreement_score":0.0064128176,"about_ca_system_score_codex":0.00060542533,"about_ca_system_score_gemma":0.0004913019,"threshold_uncertainty_score":0.021452963},"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":"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":"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":"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":"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":"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":"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":"W4400692708","doi":"10.1007/s12095-024-00723-0","title":"Uni/multi variate polynomial embeddings for zkSNARKs","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","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":"Random variate; Polynomial; Mathematics; Computer science; Algebra over a field; Pure mathematics; Statistics; Mathematical analysis; Random variable","score_opus":0.034453706021442834,"score_gpt":0.31400243489403484,"score_spread":0.279548728872592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400692708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24986754,0.00031920595,0.72466266,0.0010619984,0.00008346098,0.00033807565,0.0005563203,0.0020416745,0.021069057],"genre_scores_gemma":[0.8735296,0.00023619394,0.11891851,0.00018823161,0.000052332973,0.00014230829,0.0005126346,0.0003247723,0.0060954103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968599,0.0007753751,0.00023219142,0.00047537565,0.0012030784,0.0004540615],"domain_scores_gemma":[0.9933348,0.0038887467,0.00059726904,0.0014546167,0.0005105902,0.00021392686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018497312,0.0003561411,0.0005179605,0.0007768276,0.0009066923,0.0028438885,0.0009941033,0.0008093937,0.01123058],"category_scores_gemma":[0.009375467,0.00034737214,0.0012568496,0.0007407015,0.001994798,0.00660263,0.002903706,0.0027281942,0.0013220154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043731736,0.00009842489,0.000933857,0.00028620273,0.000025137691,0.00019236615,0.0004202258,0.035928056,0.0076030795,0.91439706,0.001494501,0.03818381],"study_design_scores_gemma":[0.00009203312,0.00021158082,0.00055108086,0.00008415285,0.00006682992,0.0002566332,0.0001980441,0.17085254,0.033220615,0.7835394,0.0108631,0.0000640167],"about_ca_topic_score_codex":0.0010026672,"about_ca_topic_score_gemma":0.0011368797,"teacher_disagreement_score":0.01123058,"about_ca_system_score_codex":0.0025410883,"about_ca_system_score_gemma":0.0017324729,"threshold_uncertainty_score":0.03757006},"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":"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":"W4409873972","doi":"10.1007/s12095-025-00798-3","title":"An effective approach to enumerate universal cycles for k-permutations","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Foundation of Henan Educational Committee; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Enumeration; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.008558640135579046,"score_gpt":0.2534321535233065,"score_spread":0.24487351338772745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409873972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030399809,0.00041835997,0.9486739,0.00059527834,0.00019257318,0.0001367709,0.00034077052,0.0005804535,0.01866215],"genre_scores_gemma":[0.2725861,0.00069750595,0.7034116,0.0006530777,0.00022801226,0.0004082594,0.0009089414,0.00042115184,0.020685328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986047,0.0003681754,0.00013993165,0.00023419688,0.00046769675,0.00018528158],"domain_scores_gemma":[0.9977324,0.0010380078,0.000097943324,0.0005874868,0.00042481496,0.00011936304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071377,0.0011260192,0.0010567644,0.0034334688,0.002229101,0.0032694424,0.0021510792,0.0015465822,0.0069701197],"category_scores_gemma":[0.0054647014,0.0005971865,0.0015178251,0.002838598,0.0019526343,0.0062818984,0.003460188,0.0026294473,0.0017822126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000724706,0.00008267282,0.0006687523,0.00016468948,0.000035155386,0.000101538426,0.00036480473,0.014589719,0.0041251327,0.8705634,0.0047476776,0.10448396],"study_design_scores_gemma":[0.000010552675,0.000024619825,0.000089079185,0.000049204562,0.000023563913,0.00008754939,0.000088318884,0.058385428,0.0021241012,0.9322537,0.006841842,0.000021899477],"about_ca_topic_score_codex":0.0017291501,"about_ca_topic_score_gemma":0.0046493183,"teacher_disagreement_score":0.0069701197,"about_ca_system_score_codex":0.0015136026,"about_ca_system_score_gemma":0.0016050204,"threshold_uncertainty_score":0.023317337},"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":"W4413224920","doi":"10.1007/s12095-025-00829-z","title":"New Turyn-type sequences","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","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":"Wilfrid Laurier University","funders":"","keywords":"Type (biology); Computer science; Biology","score_opus":0.05563705351840285,"score_gpt":0.3583692880045586,"score_spread":0.3027322344861557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413224920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14565276,0.0048692287,0.59670854,0.003039622,0.0031721487,0.00015890267,0.0005234697,0.0009973753,0.24487796],"genre_scores_gemma":[0.7115756,0.0033588556,0.13392489,0.0021464955,0.001583828,0.0003242408,0.0006411262,0.00057706115,0.14586784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916244,0.00027373273,0.00005230457,0.00014858566,0.00023086797,0.00013210278],"domain_scores_gemma":[0.9979657,0.0007513821,0.00025195983,0.0002716324,0.0004081642,0.0003511854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010001961,0.0009025619,0.00068487134,0.0021587794,0.0012972184,0.002980405,0.001146941,0.0016057556,0.011139527],"category_scores_gemma":[0.005239463,0.0004614275,0.0006666203,0.001720507,0.0019756116,0.0046962765,0.0023558417,0.0035183544,0.002860654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036491558,0.000012952151,0.0001031149,0.000028582655,0.0000033832266,0.00004139316,0.00007284172,0.00080458145,0.00074826524,0.98821867,0.0016817836,0.008247895],"study_design_scores_gemma":[0.000019206867,0.00005257813,0.0002142651,0.000048808804,0.000011469501,0.00028719407,0.00007447794,0.015074545,0.0014244659,0.9603362,0.02243266,0.000024058778],"about_ca_topic_score_codex":0.00032459458,"about_ca_topic_score_gemma":0.0004113594,"teacher_disagreement_score":0.011139527,"about_ca_system_score_codex":0.0014576897,"about_ca_system_score_gemma":0.0007156153,"threshold_uncertainty_score":0.03726548},"labels":[],"label_agreement":null}]}