{"meta":{"query_hash":"44d73b0cb73f","filters":{"venue":"Journal of Mathematical Cryptology"},"cohort_total":43,"direct_labels_cover":0,"predictions_cover":43,"exported":43,"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/44d73b0cb73f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Mathematical+Cryptology"},"results":[{"id":"W1971243765","doi":"10.1515/jmc-2013-0038","title":"Quantum computation of discrete logarithms in semigroups","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discrete logarithm; Mathematics; Discrete mathematics; Semigroup; Abelian group; Order (exchange); Quantum; Quantum algorithm; Constructive; Cryptosystem; Logarithm; Quantum computer; Pure mathematics; Combinatorics; Cryptography; Algorithm; Computer science; Public-key cryptography; Encryption; Quantum mechanics","score_opus":0.010417435029722071,"score_gpt":0.26236414663922075,"score_spread":0.25194671160949866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971243765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27701205,0.00028714526,0.67120826,0.002502459,0.000564886,0.0001755523,0.00021807101,0.0014733135,0.046558287],"genre_scores_gemma":[0.9310804,0.0001124529,0.062461354,0.00016961042,0.00012526258,0.00008921098,0.00010952491,0.0000646287,0.0057875495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875593,0.00038531784,0.000087723274,0.00018622699,0.00042231116,0.00016244865],"domain_scores_gemma":[0.9976857,0.0011858213,0.00014405826,0.00059967523,0.00020742946,0.00017737526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013900866,0.0002463202,0.00038523547,0.00041598955,0.0007624741,0.0015785153,0.00071031356,0.0006077871,0.0076643075],"category_scores_gemma":[0.004042629,0.00020485371,0.00075781776,0.00034126313,0.0020799174,0.0037050066,0.0018062597,0.0012251426,0.001185071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026358583,0.00012622515,0.0006098074,0.000084981315,0.000013037752,0.0002573068,0.0004910486,0.010594794,0.011812646,0.9532574,0.0020453339,0.020443901],"study_design_scores_gemma":[0.00008922984,0.00012580834,0.00019981,0.000027095219,0.000009282847,0.00012384084,0.000121757956,0.12504068,0.012661103,0.8541911,0.0073848395,0.000025417288],"about_ca_topic_score_codex":0.0002656309,"about_ca_topic_score_gemma":0.00018488713,"teacher_disagreement_score":0.0076643075,"about_ca_system_score_codex":0.00072913914,"about_ca_system_score_gemma":0.0006389496,"threshold_uncertainty_score":0.025639594},"labels":[],"label_agreement":null},{"id":"W1985273268","doi":"10.1515/jmc.2008.006","title":"On the security of multi-prime RSA","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prime (order theory); Factoring; Exponent; Public-key cryptography; Mathematics; Cryptography; Algebraic number; Arithmetic; Discrete mathematics; Computer science; Computer security; Combinatorics; Algorithm; Encryption; Business","score_opus":0.029800146658772037,"score_gpt":0.2613415051658113,"score_spread":0.23154135850703925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985273268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6374818,0.03360153,0.16027346,0.015228686,0.0015157309,0.00019483012,0.000904262,0.00064171944,0.15015797],"genre_scores_gemma":[0.98131955,0.0051435656,0.009403494,0.0003993302,0.00091931684,0.000041024326,0.000118622615,0.00005239506,0.0026026736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959514,0.0009065632,0.00023682292,0.0006953683,0.0014927618,0.00071708835],"domain_scores_gemma":[0.983651,0.011263897,0.0010444892,0.002758283,0.0008216606,0.00046075994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038318008,0.0013012622,0.0016838937,0.0029418126,0.0021497193,0.0045238254,0.0012107608,0.0021665,0.004990124],"category_scores_gemma":[0.010374284,0.0007629367,0.0011659674,0.0024704612,0.0062559303,0.009300465,0.0063322904,0.004268338,0.0016139714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013961698,0.00018606351,0.002520193,0.00037528801,0.0001313119,0.001201349,0.0007432085,0.04222194,0.008569355,0.8885941,0.004825943,0.049235154],"study_design_scores_gemma":[0.000076124,0.00017211771,0.0006118941,0.00018785756,0.000058547368,0.0007305201,0.00012218855,0.032946195,0.004650936,0.9513552,0.009024252,0.00006411543],"about_ca_topic_score_codex":0.00032970984,"about_ca_topic_score_gemma":0.00017839528,"teacher_disagreement_score":0.004990124,"about_ca_system_score_codex":0.0013276652,"about_ca_system_score_gemma":0.0007404834,"threshold_uncertainty_score":0.020264745},"labels":[],"label_agreement":null},{"id":"W1987475429","doi":"10.1515/jmc-2012-0015","title":"Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":398,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Isogeny; Mathematics; Cryptosystem; Supersingular elliptic curve; Endomorphism ring; Public-key cryptography; Elliptic curve; Mathematical proof; Post-quantum cryptography; Endomorphism; Commutative property; Cryptography; Scheme (mathematics); Discrete mathematics; Pure mathematics; Algebra over a field; Encryption; Computer science; Algorithm; Mathematical analysis","score_opus":0.01353937373835186,"score_gpt":0.23846793185032228,"score_spread":0.22492855811197043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987475429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23725827,0.00065484043,0.72490734,0.004308775,0.0002989819,0.00078343897,0.00022531048,0.0016052452,0.02995777],"genre_scores_gemma":[0.8533496,0.0004791488,0.13686548,0.0004009783,0.00016743277,0.00041773432,0.0002569268,0.00024709397,0.007815563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936811,0.0019338593,0.00031512688,0.00076070067,0.0026623502,0.00064697646],"domain_scores_gemma":[0.98928666,0.0044739572,0.0010351859,0.0039563663,0.00084242655,0.00040538234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060920333,0.0007738556,0.0012257501,0.0013122639,0.0015220816,0.0042801714,0.0019093216,0.0024943573,0.007163104],"category_scores_gemma":[0.013796169,0.00085478654,0.00085920474,0.0010117703,0.004641324,0.011248655,0.00584874,0.0061243568,0.0021046214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046314817,0.00017360804,0.000480804,0.00015896292,0.000031228843,0.00015697976,0.0005107907,0.01529482,0.018083801,0.9488492,0.0019908247,0.01380583],"study_design_scores_gemma":[0.00033115488,0.00027860625,0.0002360508,0.00007470348,0.000047403388,0.0002764144,0.00027437464,0.19646011,0.06737674,0.7211623,0.01339838,0.000083674626],"about_ca_topic_score_codex":0.00027297268,"about_ca_topic_score_gemma":0.00017920251,"teacher_disagreement_score":0.007163104,"about_ca_system_score_codex":0.0016609684,"about_ca_system_score_gemma":0.0014490293,"threshold_uncertainty_score":0.0322181},"labels":[],"label_agreement":null},{"id":"W1996714756","doi":"10.1515/jmc.2008.011","title":"Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universidad de Talca","keywords":"Hyperelliptic curve cryptography; Arithmetic; Jacobian matrix and determinant; Binary number; Mathematics; Genus; Field (mathematics); Pure mathematics; Computer science; Applied mathematics; Biology; Zoology","score_opus":0.016394329432625573,"score_gpt":0.2547704709577174,"score_spread":0.2383761415250918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996714756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4219075,0.0007435148,0.55787265,0.00078643457,0.0002159823,0.00012418053,0.00005065705,0.0019889376,0.01631019],"genre_scores_gemma":[0.82828057,0.000508738,0.16642162,0.00016658119,0.00015595548,0.000039122435,0.00006263408,0.0004723501,0.0038923856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988016,0.00024430308,0.00008702052,0.0000953342,0.00060173334,0.00016991398],"domain_scores_gemma":[0.99752575,0.0010619075,0.00027642006,0.0007435485,0.00031869652,0.00007363644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012780939,0.0006075951,0.0006122111,0.00092615886,0.0006924424,0.0018326446,0.0010527049,0.0005326165,0.002776785],"category_scores_gemma":[0.005868409,0.00028614033,0.00048602995,0.00087771367,0.0018366606,0.0032370416,0.002364543,0.0015897539,0.0007513544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085543166,0.00031630683,0.0045766546,0.00067000516,0.000073752206,0.0008620262,0.0011635901,0.08392339,0.110180676,0.4060605,0.0042404714,0.38707724],"study_design_scores_gemma":[0.00023855714,0.00073425885,0.0017339446,0.00033350362,0.00009968155,0.0012638413,0.00042467547,0.51261693,0.1585572,0.28868428,0.03514216,0.00017099747],"about_ca_topic_score_codex":0.00036774657,"about_ca_topic_score_gemma":0.0005170943,"teacher_disagreement_score":0.002776785,"about_ca_system_score_codex":0.000700074,"about_ca_system_score_gemma":0.0006655783,"threshold_uncertainty_score":0.009289205},"labels":[],"label_agreement":null},{"id":"W2005895372","doi":"10.1515/jmc.2007.015","title":"Minimal weight and colexicographically minimal integer representations","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Integer (computer science); Discrete mathematics; Set (abstract data type); Representation (politics); Minimal models; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.012608873498279837,"score_gpt":0.27983659282903395,"score_spread":0.2672277193307541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005895372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2863517,0.00019044497,0.68734473,0.0004573871,0.00006482797,0.00010877803,0.00032342577,0.00080862764,0.02435009],"genre_scores_gemma":[0.7476827,0.00020714187,0.24385288,0.0001768581,0.000041401592,0.00014802492,0.0005671838,0.00025398645,0.007069782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923086,0.00014610232,0.00009002639,0.0001434033,0.00026353978,0.00012615026],"domain_scores_gemma":[0.998502,0.00045173944,0.0002558723,0.0004573779,0.0002658794,0.00006711217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006303179,0.00032667365,0.00027002234,0.0008871428,0.00063806266,0.0015753717,0.00068083423,0.00053588423,0.0023322904],"category_scores_gemma":[0.0043655834,0.00022562468,0.0004800942,0.0010804541,0.0012923897,0.002839577,0.001568929,0.0010461251,0.00062083633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016898291,0.000045395638,0.0012452672,0.000075914424,0.000009144247,0.00015515678,0.00038390138,0.005848594,0.017503047,0.8927981,0.0016409772,0.080125414],"study_design_scores_gemma":[0.000058765076,0.00022873022,0.0009861653,0.00009468518,0.00004246849,0.000981944,0.000299079,0.06275261,0.07401829,0.8288905,0.03154909,0.000097641634],"about_ca_topic_score_codex":0.00024588048,"about_ca_topic_score_gemma":0.00031196675,"teacher_disagreement_score":0.0023322904,"about_ca_system_score_codex":0.00070374034,"about_ca_system_score_gemma":0.00076653634,"threshold_uncertainty_score":0.0078023076},"labels":[],"label_agreement":null},{"id":"W2008487746","doi":"10.1515/jmc.2007.003","title":"Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Binary number; Computer science; Boolean function; Theoretical computer science; Server; Boolean conjunctive query; Function (biology); Private information retrieval; Query optimization; Information retrieval; Mathematics; Algorithm; Sargable; Web search query; Search engine; Arithmetic; Computer security; Computer network","score_opus":0.023604472969428802,"score_gpt":0.29158145283883463,"score_spread":0.26797697986940583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008487746","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.05767754,0.0014901707,0.91466814,0.004010954,0.000116767995,0.00036594883,0.0003328991,0.0003873779,0.020950152],"genre_scores_gemma":[0.81969184,0.0037612778,0.1521088,0.0018823938,0.0010288721,0.0010960787,0.000805908,0.00045387394,0.01917104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883504,0.0037289509,0.0008289976,0.0016152941,0.0035431094,0.0019333073],"domain_scores_gemma":[0.96072215,0.029557263,0.00296095,0.004294636,0.0017388175,0.0007260882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010036803,0.0015625011,0.0024402367,0.0020813835,0.0031037647,0.006783513,0.0041292827,0.00503885,0.0116701415],"category_scores_gemma":[0.03296741,0.0015218817,0.004056281,0.0032626,0.006995125,0.031123579,0.005534057,0.010424214,0.0013961244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000136374,0.00008339127,0.00022952346,0.00015246416,0.000022815608,0.00009301017,0.00047240406,0.012727504,0.0011920162,0.9774864,0.00087526586,0.0065288665],"study_design_scores_gemma":[0.000070975184,0.0001158758,0.00029230717,0.0000540534,0.00006829986,0.0002569606,0.00014101794,0.1292528,0.0033827932,0.8617453,0.004550361,0.000069257694],"about_ca_topic_score_codex":0.0011687981,"about_ca_topic_score_gemma":0.00049244676,"teacher_disagreement_score":0.0116701415,"about_ca_system_score_codex":0.0048446003,"about_ca_system_score_gemma":0.0027964383,"threshold_uncertainty_score":0.05308026},"labels":[],"label_agreement":null},{"id":"W2018752355","doi":"10.1515/jmc-2014-0031","title":"Optimal constructions for ID-based one-way-function key predistribution schemesrealizing specified communication graphs","year":2014,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hash function; Key (lock); Pairwise comparison; Scheme (mathematics); Cryptography; Theoretical computer science; Graph; Function (biology); Computer network; Distributed computing; Computer security; Mathematics","score_opus":0.03865162738862765,"score_gpt":0.286290799396298,"score_spread":0.24763917200767033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018752355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12560081,0.00033326764,0.8644649,0.0009175421,0.000059841357,0.00026802236,0.0002341345,0.00055023,0.007571217],"genre_scores_gemma":[0.7473558,0.00031272075,0.247571,0.00015166512,0.00003388792,0.00023379923,0.00024048856,0.00014887683,0.0039517847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774444,0.00081526645,0.00013182992,0.0003683708,0.0005655558,0.00037462055],"domain_scores_gemma":[0.99305093,0.0036639448,0.000612118,0.002014573,0.0003947057,0.00026377858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002631848,0.00064486853,0.0008625256,0.00077940617,0.0010434551,0.0016937291,0.0020562129,0.001339167,0.003679533],"category_scores_gemma":[0.006862234,0.0006867095,0.00090313394,0.0010951088,0.0021186804,0.0042224773,0.004324029,0.0019661635,0.00066440774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058697606,0.0001846591,0.0010309437,0.0003325221,0.000063730775,0.00023569634,0.0006736723,0.20886824,0.018440086,0.71112776,0.003757781,0.054698016],"study_design_scores_gemma":[0.00014521136,0.00013064257,0.0003292583,0.000054876065,0.00004737493,0.0002390551,0.0002195165,0.61598533,0.01741813,0.3598097,0.0055562975,0.00006460643],"about_ca_topic_score_codex":0.00048223432,"about_ca_topic_score_gemma":0.000608113,"teacher_disagreement_score":0.003679533,"about_ca_system_score_codex":0.002912271,"about_ca_system_score_gemma":0.0014697697,"threshold_uncertainty_score":0.021130085},"labels":[],"label_agreement":null},{"id":"W2023005004","doi":"10.1515/jmc.2009.021","title":"An efficient identification protocol secure against concurrent-reset attacks","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reset (finance); Computer science; Identification (biology); Protocol (science); Simple (philosophy); Cryptographic protocol; Computer security; Theoretical computer science; Cryptography; Medicine","score_opus":0.016815841446691154,"score_gpt":0.3360632588257027,"score_spread":0.3192474173790115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023005004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09839407,0.0003296694,0.8839002,0.0011477193,0.00028796276,0.00043879313,0.0002091865,0.0016628039,0.013629686],"genre_scores_gemma":[0.8902461,0.0001758959,0.09982517,0.00034180353,0.000088534034,0.00035274876,0.00024235119,0.000112368194,0.008615107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99575067,0.0012434489,0.00034486892,0.0007598692,0.0014386316,0.00046243437],"domain_scores_gemma":[0.9943777,0.0015719329,0.00059391063,0.002539818,0.00059726863,0.00031937947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029433265,0.00061191915,0.0009650987,0.00065412064,0.0011485099,0.0023338865,0.002223353,0.0017102202,0.0035470156],"category_scores_gemma":[0.004828544,0.0004464658,0.0006149538,0.0008626272,0.0022217848,0.005384953,0.0059491936,0.002464207,0.0008739883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008022118,0.0004209678,0.0008256936,0.00030281756,0.0001250377,0.0009028056,0.0008627917,0.023573382,0.072258726,0.8503436,0.0042077117,0.045374256],"study_design_scores_gemma":[0.00060848985,0.0006499908,0.00080459117,0.00010609644,0.00019140144,0.0011423044,0.00026126418,0.49405125,0.14307047,0.3183376,0.04053711,0.00023939514],"about_ca_topic_score_codex":0.00022748127,"about_ca_topic_score_gemma":0.00015859114,"teacher_disagreement_score":0.0035470156,"about_ca_system_score_codex":0.0008420761,"about_ca_system_score_gemma":0.0012105445,"threshold_uncertainty_score":0.015565932},"labels":[],"label_agreement":null},{"id":"W2024310614","doi":"10.1515/jmc.2008.007","title":"Improved security analysis of PMAC","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Regional Municipality of Waterloo; University of Waterloo","funders":"","keywords":"PMAC; Parallelizable manifold; Computer science; Message authentication code; Upper and lower bounds; Authentication (law); Provable security; Theoretical computer science; Algorithm; Mathematics; Cryptography; Computer security","score_opus":0.024771305483093333,"score_gpt":0.29786622476499747,"score_spread":0.27309491928190416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024310614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10079123,0.0013188731,0.83234537,0.004842043,0.00045696873,0.000428196,0.000455605,0.0033877036,0.05597402],"genre_scores_gemma":[0.91806,0.0003467207,0.07183998,0.00069308275,0.0004207146,0.0002880821,0.00016755225,0.00021881587,0.007965018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99036837,0.0018739352,0.0002800417,0.0014436552,0.004537489,0.0014965492],"domain_scores_gemma":[0.97954476,0.009348493,0.0011970386,0.006699327,0.0026624787,0.0005479396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039814645,0.0013249164,0.0014951498,0.0019164335,0.0017135075,0.0022175394,0.0027212184,0.0019562691,0.011030188],"category_scores_gemma":[0.018207708,0.0006652771,0.0016526238,0.0014409936,0.0054430114,0.00656115,0.0064092055,0.009264546,0.0021459647],"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.0012783529,0.00025597773,0.0022673483,0.00042252365,0.00010768235,0.00061899173,0.0003120076,0.14629446,0.038561404,0.74564934,0.010035434,0.05419638],"study_design_scores_gemma":[0.00010861245,0.00025237887,0.00063451787,0.000072128205,0.00005704918,0.00047863138,0.000038696133,0.66803575,0.025797872,0.29425362,0.010197928,0.00007270709],"about_ca_topic_score_codex":0.0010373831,"about_ca_topic_score_gemma":0.0005251484,"teacher_disagreement_score":0.011030188,"about_ca_system_score_codex":0.0040567107,"about_ca_system_score_gemma":0.0027926553,"threshold_uncertainty_score":0.036899686},"labels":[],"label_agreement":null},{"id":"W2026017982","doi":"10.1515/jmc-2013-5006","title":"Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Secrecy; Verifiable secret sharing; Access structure; Secure multi-party computation; Homomorphic secret sharing; Scheme (mathematics); Computer science; Property (philosophy); Robustness (evolution); Shamir's Secret Sharing; Mathematics; Set (abstract data type); Theoretical computer science; Cryptography; Computer security","score_opus":0.03649148341082455,"score_gpt":0.2945608209996092,"score_spread":0.25806933758878464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026017982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18132308,0.00019970418,0.80858046,0.0004608696,0.000058610774,0.00014760456,0.00032579992,0.00043180393,0.008472104],"genre_scores_gemma":[0.9564653,0.00007161721,0.041407242,0.000056406425,0.00002778078,0.000069913774,0.00010714087,0.000017018414,0.0017775554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765164,0.00047855265,0.00020884477,0.00036363894,0.0009381802,0.00035913583],"domain_scores_gemma":[0.99657744,0.0008802991,0.00078051415,0.0011894193,0.00032970036,0.00024263629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015784565,0.00031044177,0.0007170027,0.00048114292,0.0007512949,0.0015762142,0.0014403489,0.0009122737,0.002817922],"category_scores_gemma":[0.004184894,0.00022092253,0.00089443836,0.00061356195,0.0015180229,0.0039134626,0.003426452,0.0013675446,0.00048410834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007170611,0.00011234966,0.0008746693,0.00020502083,0.000096886375,0.00041660952,0.0005791637,0.05307187,0.061967395,0.8498637,0.0012141756,0.03088106],"study_design_scores_gemma":[0.00017863688,0.00044100787,0.00083995704,0.00005150633,0.00009295167,0.00087011897,0.00015428053,0.54562765,0.056485556,0.38706508,0.008066806,0.00012645332],"about_ca_topic_score_codex":0.0003453661,"about_ca_topic_score_gemma":0.00019429688,"teacher_disagreement_score":0.002817922,"about_ca_system_score_codex":0.0012616634,"about_ca_system_score_gemma":0.0010363591,"threshold_uncertainty_score":0.009426892},"labels":[],"label_agreement":null},{"id":"W2037126171","doi":"10.1515/jmc.2007.010","title":"An efficient and secure two-flow zero-knowledge identification protocol","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero-knowledge proof; Identification (biology); Computer science; Protocol (science); Flow (mathematics); Zero (linguistics); Knowledge flow; Theoretical computer science; Cryptography; Computer security; Mathematics; Medicine; Knowledge management; Philosophy; Biology","score_opus":0.015423903347543066,"score_gpt":0.3342108138883982,"score_spread":0.3187869105408551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037126171","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.0243603,0.00022335665,0.9692965,0.00045598572,0.0001474087,0.00022861415,0.00008334781,0.0007759411,0.0044285543],"genre_scores_gemma":[0.50594264,0.0005266379,0.4801224,0.00033947252,0.00014172171,0.0006928,0.0004149498,0.0001359352,0.011683483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798846,0.00045518044,0.0001454892,0.00037137783,0.00082183885,0.00021758293],"domain_scores_gemma":[0.9982223,0.0005060777,0.00021007498,0.00062827795,0.00029838263,0.0001350208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018208545,0.000576359,0.00090810936,0.00067788287,0.0011323462,0.0016848954,0.0018906109,0.0014608254,0.002108012],"category_scores_gemma":[0.0024425827,0.00041480732,0.00053361326,0.00071395043,0.001662534,0.0060009696,0.0035927815,0.0025383232,0.0007828522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007570756,0.00059295015,0.0009357591,0.0006076414,0.0000992802,0.0009092145,0.001101527,0.036249522,0.081530616,0.691883,0.006128723,0.17920463],"study_design_scores_gemma":[0.000530349,0.0006952168,0.00076481444,0.000105598396,0.00019015382,0.0016950148,0.00030997075,0.5528022,0.1388963,0.23947431,0.06419995,0.00033605474],"about_ca_topic_score_codex":0.00026912766,"about_ca_topic_score_gemma":0.00015533227,"teacher_disagreement_score":0.002108012,"about_ca_system_score_codex":0.0006534692,"about_ca_system_score_gemma":0.0017797286,"threshold_uncertainty_score":0.009629667},"labels":[],"label_agreement":null},{"id":"W2041780131","doi":"10.1515/jmc.2010.003","title":"Common modulus attacks on small private exponent RSA and some fast variants (in practice)","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exponent; Cryptography; Modulus; Cryptanalysis; Mathematics; Computer science; Computer security; Arithmetic; Philosophy","score_opus":0.017956054032233937,"score_gpt":0.28069872628965564,"score_spread":0.2627426722574217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041780131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81775534,0.0012520535,0.16205013,0.0016231263,0.00015162314,0.00026214926,0.00024809001,0.0010168072,0.01564075],"genre_scores_gemma":[0.9690514,0.00023780858,0.029013708,0.0000799907,0.0000691908,0.000058785572,0.00012314283,0.000047707264,0.001318151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528533,0.0012338656,0.0003212014,0.0007906623,0.0016324223,0.00073646154],"domain_scores_gemma":[0.9853748,0.0057862396,0.0013351401,0.006578772,0.00060555385,0.00031952336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030878054,0.00073288183,0.0009573737,0.0009782577,0.0012986097,0.0015525263,0.0013751857,0.0013764153,0.0025835766],"category_scores_gemma":[0.012026882,0.0004121772,0.0012731138,0.0010993242,0.0026921302,0.006875323,0.0033380159,0.0025405055,0.0005369239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049839723,0.00061583554,0.035412744,0.0005674531,0.00052361446,0.0025193538,0.0026262498,0.19173317,0.09728121,0.3950355,0.011199258,0.2575016],"study_design_scores_gemma":[0.0006613961,0.0016530677,0.007277554,0.00016408174,0.00021637112,0.004216026,0.00070740277,0.65879816,0.07533916,0.2217276,0.029028887,0.00021025779],"about_ca_topic_score_codex":0.0009300347,"about_ca_topic_score_gemma":0.00094247767,"teacher_disagreement_score":0.0030878054,"about_ca_system_score_codex":0.0011993988,"about_ca_system_score_gemma":0.0007963713,"threshold_uncertainty_score":0.016330063},"labels":[],"label_agreement":null},{"id":"W2045890225","doi":"10.1515/jmc-2012-0016","title":"Constructing elliptic curve isogenies in quantum subexponential time","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Isogeny; Finite field; Cardinality (data modeling); Quantum algorithm; Quantum Fourier transform; Elliptic curve; Quantum; Cryptosystem; Endomorphism; Discrete logarithm","score_opus":0.0096042011635041,"score_gpt":0.2281385526665449,"score_spread":0.2185343515030408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045890225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42572528,0.0005423954,0.5479267,0.0019052384,0.0001794483,0.00027045232,0.00027259166,0.002579835,0.020598007],"genre_scores_gemma":[0.8263995,0.00019818486,0.16681118,0.00018968062,0.00006933159,0.00011320451,0.0003565566,0.00022432565,0.005637957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970988,0.00053901767,0.00018909051,0.00056713657,0.0011579233,0.0004480015],"domain_scores_gemma":[0.9932417,0.002961952,0.00047873787,0.0023297747,0.00068534125,0.00030252562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024984302,0.00056312943,0.0010772768,0.0010183074,0.0010693591,0.0029258984,0.0013081558,0.0010683612,0.0062225163],"category_scores_gemma":[0.010531242,0.00039286804,0.0010540743,0.0012174492,0.002275654,0.005528095,0.0038544901,0.0024811104,0.0014382579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016261349,0.0006724847,0.008042258,0.00046320911,0.00023195082,0.000422265,0.0012485903,0.050266635,0.045900024,0.64957315,0.0058755944,0.2356777],"study_design_scores_gemma":[0.00045900102,0.00032753104,0.0017326896,0.00006757706,0.00011242341,0.00040661477,0.00043790645,0.22393158,0.06494168,0.6942707,0.013229132,0.00008318036],"about_ca_topic_score_codex":0.00079015625,"about_ca_topic_score_gemma":0.0010231653,"teacher_disagreement_score":0.0062225163,"about_ca_system_score_codex":0.0026762597,"about_ca_system_score_gemma":0.0027547115,"threshold_uncertainty_score":0.020816386},"labels":[],"label_agreement":null},{"id":"W2064190686","doi":"10.1515/jmc-2013-5004","title":"Another look at HMAC","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash-based message authentication code; Hash function; Computer science; Message authentication code; Computer security; Cryptography; Authentication (law); Code (set theory); Cryptographic hash function; Cryptographic primitive; Theoretical computer science; Cryptographic protocol; Programming language","score_opus":0.019730090165529124,"score_gpt":0.27596826765672267,"score_spread":0.25623817749119354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064190686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014294738,0.019296028,0.4901683,0.14893548,0.011269478,0.00022876868,0.00042106444,0.00251439,0.31287175],"genre_scores_gemma":[0.5374148,0.009149673,0.24418066,0.06416972,0.008344307,0.00039076412,0.00048700906,0.0008734102,0.1349896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902776,0.0037002163,0.00037584128,0.001102101,0.00370622,0.0008379705],"domain_scores_gemma":[0.9884064,0.003580187,0.00046035153,0.0037953604,0.0033143447,0.0004433973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00682992,0.0007305204,0.0006166224,0.0015752314,0.0031862175,0.0054106372,0.0025354335,0.004696243,0.02144385],"category_scores_gemma":[0.014150697,0.0006386945,0.00125184,0.0015150554,0.009790354,0.01561759,0.004782668,0.015631715,0.0050179875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033755463,0.000017878647,0.00014818631,0.0000784975,0.00001033834,0.000058197696,0.00015286634,0.00040570018,0.00049409363,0.97114146,0.014025591,0.013433407],"study_design_scores_gemma":[0.000037540678,0.00011591498,0.00028488348,0.00034768507,0.00002913067,0.0005329547,0.00033645844,0.007909307,0.0053522717,0.61817676,0.36681423,0.00006288343],"about_ca_topic_score_codex":0.002888908,"about_ca_topic_score_gemma":0.0017426519,"teacher_disagreement_score":0.02144385,"about_ca_system_score_codex":0.0047527994,"about_ca_system_score_gemma":0.0037190383,"threshold_uncertainty_score":0.07173681},"labels":[],"label_agreement":null},{"id":"W2064998746","doi":"10.1515/jmc-2012-0002","title":"Finding discrete logarithms with a set orbit distinguisher","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Logarithm; Orbit (dynamics); Set (abstract data type); Discrete logarithm; Mathematics; Arithmetic; Computer science; Mathematical analysis; Computer security; Programming language; Public-key cryptography","score_opus":0.028690374475523445,"score_gpt":0.2826695385318816,"score_spread":0.2539791640563581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064998746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45362765,0.00040896365,0.53303707,0.002122559,0.00011924491,0.0001627246,0.00025770513,0.0012666499,0.008997411],"genre_scores_gemma":[0.8490161,0.00012374096,0.14748584,0.00017377797,0.000076847304,0.00007971804,0.0002055182,0.000088167486,0.0027504326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972166,0.00045543196,0.00024083999,0.0006880724,0.0010070443,0.00039201594],"domain_scores_gemma":[0.9741976,0.018665547,0.0016723379,0.0037013323,0.0008433256,0.00091979105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003149045,0.00059640926,0.0012524651,0.0012809767,0.0016842121,0.0034813872,0.0014143129,0.0016724516,0.0031811208],"category_scores_gemma":[0.016419303,0.0005175119,0.0012554886,0.0013707099,0.0035470156,0.008118924,0.004667417,0.0040481505,0.00066558656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039495267,0.0007811175,0.015589608,0.00059004367,0.0002899123,0.00070690975,0.0017383596,0.14581375,0.05360271,0.6160353,0.0052115386,0.15569127],"study_design_scores_gemma":[0.00026599213,0.00052921864,0.001110065,0.00006760722,0.00012284446,0.00045183764,0.00022496293,0.440871,0.05811724,0.49382854,0.0043106014,0.00010005745],"about_ca_topic_score_codex":0.0005397036,"about_ca_topic_score_gemma":0.00048524165,"teacher_disagreement_score":0.0034813872,"about_ca_system_score_codex":0.0024493285,"about_ca_system_score_gemma":0.0020277472,"threshold_uncertainty_score":0.017771244},"labels":[],"label_agreement":null},{"id":"W2065483996","doi":"10.1515/jmc.2009.016","title":"On the density of some special primes","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Arithmetic","score_opus":0.016047903562670104,"score_gpt":0.2496530297266319,"score_spread":0.23360512616396178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065483996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8628313,0.0012350625,0.1061771,0.001955937,0.00011198198,0.000044153865,0.00019230794,0.00022434864,0.027227802],"genre_scores_gemma":[0.99591017,0.00019936413,0.0028136414,0.000086307766,0.000108179054,0.00002675026,0.00003827036,0.000016162307,0.00080110435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983809,0.00060030835,0.000054157746,0.00025260416,0.000517278,0.00019484511],"domain_scores_gemma":[0.9891529,0.00786961,0.0009717063,0.00064163056,0.00072069565,0.00064342417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025025571,0.00035446932,0.0011141001,0.0027448223,0.00160306,0.0023837879,0.00081444153,0.0008356084,0.0030737824],"category_scores_gemma":[0.017490406,0.0004885163,0.0005242017,0.0010581571,0.0059723337,0.0033402215,0.0028624798,0.0014734069,0.00021669111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001193984,0.00002036863,0.0019187935,0.00007807201,0.000017889437,0.0002770642,0.0002732465,0.004278154,0.0029932484,0.9853983,0.0007577151,0.0038677813],"study_design_scores_gemma":[0.00005462308,0.00013542674,0.0030552945,0.00007353908,0.000043820033,0.0016667873,0.00030690973,0.05533648,0.0057983417,0.92982256,0.0036517286,0.000054493736],"about_ca_topic_score_codex":0.00033401515,"about_ca_topic_score_gemma":0.00016571234,"teacher_disagreement_score":0.0030737824,"about_ca_system_score_codex":0.0011517154,"about_ca_system_score_gemma":0.00036983742,"threshold_uncertainty_score":0.013234973},"labels":[],"label_agreement":null},{"id":"W2069036743","doi":"10.1515/jmc.2008.014","title":"Another look at non-standard discrete log and Diffie-Hellman problems","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Mathematics; Genus; Standard Model (mathematical formulation); Discrete mathematics; Theoretical computer science; Computer science; Computer security; Public-key cryptography; Encryption; Geography","score_opus":0.017243321205712477,"score_gpt":0.24333549800228965,"score_spread":0.22609217679657717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069036743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46318233,0.010636999,0.16424303,0.13523819,0.0010997101,0.000142996,0.000549542,0.00035713628,0.22455014],"genre_scores_gemma":[0.9720782,0.0013809962,0.016996777,0.0029142783,0.0010484225,0.000039453746,0.00015329059,0.00006474596,0.005323811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994547,0.0027116425,0.00016307572,0.0004232017,0.0016860607,0.00046910273],"domain_scores_gemma":[0.96445125,0.028126774,0.0019985253,0.0033217443,0.001169954,0.000931684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005250041,0.00043820552,0.00094119896,0.0036652961,0.0026681547,0.004540537,0.0019454124,0.0027215946,0.0067619965],"category_scores_gemma":[0.01778198,0.00038252104,0.0010786339,0.0030473843,0.011533666,0.01609631,0.0038341365,0.0077987835,0.0003836579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004181688,0.00006441429,0.00084294856,0.00006559261,0.0000102844015,0.000077397985,0.0002549934,0.0012344501,0.00023331994,0.9907204,0.0020615228,0.0043930463],"study_design_scores_gemma":[0.000017096145,0.000018397615,0.00064706354,0.000020049061,0.000005443913,0.000148298,0.00025775871,0.004373248,0.00028965424,0.99000555,0.00420864,0.000008750653],"about_ca_topic_score_codex":0.0006425453,"about_ca_topic_score_gemma":0.000667089,"teacher_disagreement_score":0.0067619965,"about_ca_system_score_codex":0.00229396,"about_ca_system_score_gemma":0.0009127181,"threshold_uncertainty_score":0.027765155},"labels":[],"label_agreement":null},{"id":"W2070823145","doi":"10.1515/jmc.2011.007","title":"Compact elliptic curve representations","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Elliptic curve; Isomorphism (crystallography); Prime (order theory); Upper and lower bounds; Combinatorics; Reduction (mathematics); Discrete mathematics; Jacobian curve; Pure mathematics; Schoof's algorithm; Mathematical analysis; Quarter period; Geometry; Crystallography; Chemistry","score_opus":0.04824862023982155,"score_gpt":0.28889269733479933,"score_spread":0.2406440770949778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070823145","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87620306,0.00057333306,0.06987075,0.0008581325,0.00009337464,0.00006168038,0.00023809873,0.00033336756,0.051768165],"genre_scores_gemma":[0.9892336,0.00015444617,0.0049769636,0.000050777926,0.00011610509,0.000035319965,0.00014619406,0.00002753034,0.005259028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989053,0.00020054064,0.00006079537,0.00019760015,0.00040341885,0.0002322947],"domain_scores_gemma":[0.9965364,0.0013278491,0.000594225,0.00078800216,0.0003745997,0.00037898682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009080514,0.000366414,0.0007170027,0.0014107145,0.0009084127,0.002187685,0.00054994656,0.00067061506,0.008219895],"category_scores_gemma":[0.006370017,0.00021824289,0.00034399505,0.0010303353,0.0018241509,0.0039696577,0.0020966788,0.0011688787,0.00079598546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019587806,0.00007353733,0.0012069809,0.00005368651,0.000008839561,0.00019519965,0.0003236334,0.004168598,0.0038384034,0.9704385,0.0012811606,0.018215572],"study_design_scores_gemma":[0.00006418392,0.000089616435,0.0013964808,0.000032592405,0.000012358278,0.00031825824,0.00016629665,0.027083661,0.0045844293,0.95752233,0.008712396,0.00001737259],"about_ca_topic_score_codex":0.0002018854,"about_ca_topic_score_gemma":0.00014365246,"teacher_disagreement_score":0.008219895,"about_ca_system_score_codex":0.0010702625,"about_ca_system_score_gemma":0.00034736533,"threshold_uncertainty_score":0.027498305},"labels":[],"label_agreement":null},{"id":"W2071803996","doi":"10.1515/jmc-2013-0034","title":"Is extracting data the same as possessing data?","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.12123808306032284,"score_gpt":0.3780973235038994,"score_spread":0.25685924044357655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071803996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054256074,0.007627336,0.76140374,0.07867246,0.005421393,0.00064231886,0.0025013878,0.0049871914,0.08448805],"genre_scores_gemma":[0.67582613,0.009153689,0.2252542,0.018674396,0.0063786935,0.0007372985,0.0066843764,0.0024053408,0.05488586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96791035,0.01133448,0.0032313403,0.0057645123,0.009198067,0.0025612959],"domain_scores_gemma":[0.83888704,0.05147137,0.0075341472,0.084510766,0.0148720015,0.0027246412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022134108,0.0010358894,0.0020649305,0.00301277,0.0045713424,0.01359212,0.0042724945,0.0062408773,0.01673775],"category_scores_gemma":[0.090155944,0.00114277,0.003087318,0.0048672855,0.014383268,0.05800067,0.0075301775,0.0067576584,0.0090175355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006593256,0.00022534314,0.006410543,0.0009804633,0.00018977931,0.00066865486,0.0020578124,0.0019440464,0.0042253216,0.82588696,0.035117082,0.12163461],"study_design_scores_gemma":[0.000061377265,0.00011769806,0.0012382497,0.00045298107,0.000193033,0.0017674548,0.0012372764,0.007242539,0.012533686,0.8902986,0.08473167,0.00012548863],"about_ca_topic_score_codex":0.001531396,"about_ca_topic_score_gemma":0.00086011714,"teacher_disagreement_score":0.022134108,"about_ca_system_score_codex":0.002916116,"about_ca_system_score_gemma":0.0045236945,"threshold_uncertainty_score":0.11705774},"labels":[],"label_agreement":null},{"id":"W2078293442","doi":"10.1515/jmc.2010.001","title":"Factor-4 and 6 compression of cyclotomic subgroups of and","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairing; Exponentiation; Mathematics; Discrete logarithm; Finite field; Multiplicative group; Prime (order theory); Elliptic curve; Cryptography; Order (exchange); Embedding; Prime factor; Discrete mathematics; Multiplicative function; Combinatorics; Pure mathematics; Algorithm; Public-key cryptography; Computer science; Mathematical analysis","score_opus":0.01011419312858089,"score_gpt":0.2554686893593438,"score_spread":0.24535449623076291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078293442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8556907,0.0006683291,0.12784615,0.0006915251,0.00025663705,0.00019517065,0.00052805594,0.0037279641,0.010395432],"genre_scores_gemma":[0.89586467,0.00023941902,0.09576223,0.00009630123,0.00011532125,0.000086644875,0.001271642,0.0002032801,0.006360554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993857,0.00008848409,0.00005018569,0.00008707124,0.00026080912,0.00012782153],"domain_scores_gemma":[0.99829465,0.00041998274,0.00023688913,0.0007442636,0.00021392538,0.000090137655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046316703,0.0006801199,0.0005938188,0.0008013506,0.0003453036,0.0010190455,0.0006134944,0.0005762505,0.0058124736],"category_scores_gemma":[0.0031013035,0.00021266175,0.0005167257,0.0010963164,0.0006077454,0.0025134962,0.0015860414,0.0006780635,0.0010495051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067013684,0.0006175073,0.0072629126,0.00048659893,0.0001779972,0.0014737928,0.0017630768,0.05880508,0.124001235,0.08295044,0.012725771,0.7030343],"study_design_scores_gemma":[0.0006518893,0.0015002015,0.003542843,0.00013914301,0.00012876187,0.0018479914,0.0009868924,0.46337175,0.4174407,0.07530513,0.03495595,0.00012877071],"about_ca_topic_score_codex":0.0005548989,"about_ca_topic_score_gemma":0.00069043064,"teacher_disagreement_score":0.0058124736,"about_ca_system_score_codex":0.0005316855,"about_ca_system_score_gemma":0.00069826865,"threshold_uncertainty_score":0.019444644},"labels":[],"label_agreement":null},{"id":"W2092202686","doi":"10.1515/jmc.2009.008","title":"Another look at some fast modular arithmetic methods","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Arithmetic; Modular arithmetic; Modular design; Computer science; Algebra over a field; Saturation arithmetic; Mathematics; Programming language; Arbitrary-precision arithmetic; Pure mathematics","score_opus":0.01735023518713309,"score_gpt":0.3037783712800312,"score_spread":0.28642813609289813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092202686","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.01545506,0.009615515,0.9258231,0.004074136,0.0015664754,0.000154098,0.00006687169,0.0005530397,0.042691663],"genre_scores_gemma":[0.20014645,0.008091223,0.7506035,0.0012191648,0.0024449767,0.00025822077,0.0001424331,0.00047171704,0.036622304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801326,0.00068723026,0.000088718065,0.00027269372,0.0008052839,0.00013266767],"domain_scores_gemma":[0.9963664,0.0017443574,0.00016701977,0.0010245809,0.00061729347,0.00008033193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032133486,0.0011743131,0.00069886714,0.0020146873,0.0011673688,0.0018986434,0.0016117578,0.0011758046,0.010905254],"category_scores_gemma":[0.008897413,0.00055232015,0.0012514151,0.0016671591,0.0024347305,0.007780356,0.0021877934,0.003461525,0.002924733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013926958,0.000059275942,0.00028948483,0.0002589074,0.000029442503,0.00008847922,0.00022988513,0.008400137,0.0035125325,0.83859503,0.0065812743,0.14181624],"study_design_scores_gemma":[0.00016378883,0.0002649768,0.00028829445,0.00028048814,0.000040905485,0.00055282685,0.0000917723,0.08998442,0.009997622,0.7546322,0.14363827,0.000064468535],"about_ca_topic_score_codex":0.0005627045,"about_ca_topic_score_gemma":0.00036608768,"teacher_disagreement_score":0.010905254,"about_ca_system_score_codex":0.0015204106,"about_ca_system_score_gemma":0.0007652296,"threshold_uncertainty_score":0.036481738},"labels":[],"label_agreement":null},{"id":"W2104145890","doi":"10.1515/jmc.2009.003","title":"One-round secure comparison of integers","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Predicate (mathematical logic); Extension (predicate logic); Computer science; Common value auction; Proxy (statistics); Set (abstract data type); Theoretical computer science; Encryption; Cryptography; Discrete mathematics; Mathematics; Computer security; Programming language; Statistics","score_opus":0.034336978482490815,"score_gpt":0.3210987023680869,"score_spread":0.28676172388559606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104145890","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.29894742,0.0003067652,0.6769302,0.00158608,0.00018704993,0.0002711935,0.00026064378,0.00092349417,0.020587206],"genre_scores_gemma":[0.95669776,0.00007862543,0.039480608,0.00013247388,0.000040617942,0.000058228143,0.00008633898,0.000058027414,0.0033673428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99385035,0.0022130627,0.00035823518,0.0010143025,0.0018555104,0.0007084992],"domain_scores_gemma":[0.98817015,0.0058622365,0.0012397696,0.0037272556,0.0006754713,0.00032523158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004370697,0.00040409435,0.0008750495,0.00055469555,0.00079847727,0.0030604547,0.001823249,0.0008388982,0.004107859],"category_scores_gemma":[0.0107699875,0.00027432517,0.0007089015,0.0007344731,0.0031721895,0.0077200346,0.0034473797,0.0019653123,0.00066714536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018742474,0.00020058679,0.0020565898,0.00024525504,0.0001063182,0.00042342968,0.0008326874,0.043412592,0.023083502,0.8522704,0.0025838309,0.072910585],"study_design_scores_gemma":[0.00018941292,0.00046037853,0.00092909223,0.000081909995,0.000082391896,0.00045264838,0.00036419736,0.20954871,0.0850441,0.6922352,0.010520482,0.00009155978],"about_ca_topic_score_codex":0.00029931054,"about_ca_topic_score_gemma":0.00021812785,"teacher_disagreement_score":0.004370697,"about_ca_system_score_codex":0.0014799294,"about_ca_system_score_gemma":0.0011643764,"threshold_uncertainty_score":0.02311474},"labels":[],"label_agreement":null},{"id":"W2114535050","doi":"10.1515/jmc.2010.007","title":"On the asymptotic effectiveness of Weil descent attacks","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; National Science Foundation","keywords":"Descent (aeronautics); Generalization; Mathematics; Discrete logarithm; Logarithm; Genus; Gradient descent; Pure mathematics; Discrete mathematics; Applied mathematics; Combinatorics; Mathematical analysis; Computer science; Public-key cryptography; Artificial intelligence; Artificial neural network; Computer security","score_opus":0.009872256274622604,"score_gpt":0.2513074244030055,"score_spread":0.24143516812838292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114535050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7370965,0.0048391484,0.11987869,0.0075879656,0.00035190347,0.00014966434,0.00028808648,0.0010207151,0.12878725],"genre_scores_gemma":[0.994796,0.00052541855,0.0031165737,0.00012782887,0.00015089814,0.000040636853,0.00006069338,0.00006439149,0.0011177341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928653,0.003147628,0.00024054265,0.0005676904,0.0019466127,0.0012321505],"domain_scores_gemma":[0.9387729,0.04794562,0.0028935007,0.005470854,0.0027348883,0.0021821752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008484874,0.0010028635,0.0018007407,0.0038040532,0.0023754328,0.004200165,0.0018030455,0.0022136434,0.004701111],"category_scores_gemma":[0.06752258,0.0004684363,0.0007856461,0.001194523,0.007443939,0.008161126,0.0061905105,0.005165187,0.0006242177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010281609,0.00016846084,0.005311493,0.00023230466,0.00013092147,0.0004557846,0.00043500794,0.07925807,0.009620261,0.8777692,0.0037452404,0.02184517],"study_design_scores_gemma":[0.000082147984,0.0002866,0.0017229076,0.00019416754,0.00009004622,0.0006757358,0.0002331195,0.47178286,0.010301326,0.5121509,0.0024037196,0.0000765299],"about_ca_topic_score_codex":0.0006003195,"about_ca_topic_score_gemma":0.00038709954,"teacher_disagreement_score":0.008484874,"about_ca_system_score_codex":0.0024657405,"about_ca_system_score_gemma":0.0012348819,"threshold_uncertainty_score":0.04487282},"labels":[],"label_agreement":null},{"id":"W2119589927","doi":"10.1515/jmc.2007.016","title":"Statistical distribution and collisions of VSH","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Collision; Hash function; Mathematics; Collision attack; Distribution (mathematics); Work (physics); Statistical physics; Computer science; Physics; Mathematical analysis; Thermodynamics; Cryptographic hash function; Computer security","score_opus":0.014223130582580516,"score_gpt":0.28989185318902166,"score_spread":0.27566872260644115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119589927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7277201,0.0015344722,0.26053283,0.0026122872,0.00014201831,0.000111666595,0.00043701063,0.00027742662,0.0066322153],"genre_scores_gemma":[0.9931763,0.0004700709,0.0045123794,0.00008691632,0.00015782173,0.000068122834,0.00017268914,0.000043169977,0.0013126495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950079,0.0018130176,0.00022565456,0.00066343177,0.0017579972,0.0005321082],"domain_scores_gemma":[0.9276932,0.05299224,0.007838743,0.0060351286,0.003568293,0.001872497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006382899,0.000424176,0.0011461289,0.0026576575,0.0014218735,0.002913958,0.0023655477,0.001658377,0.0030194088],"category_scores_gemma":[0.059280653,0.0008766347,0.0005000474,0.00214292,0.0062211533,0.006750666,0.003071904,0.0024900425,0.0004829565],"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.00042056205,0.0000679147,0.008393869,0.00011424645,0.00004686282,0.0003588274,0.0005777197,0.057822037,0.004670722,0.9138994,0.0014333125,0.012194507],"study_design_scores_gemma":[0.000067833884,0.00019413258,0.0034200144,0.00004876144,0.000019055196,0.0007598126,0.00029061252,0.45868278,0.0038789741,0.53111076,0.0014263234,0.00010090365],"about_ca_topic_score_codex":0.00037984905,"about_ca_topic_score_gemma":0.00016931193,"teacher_disagreement_score":0.006382899,"about_ca_system_score_codex":0.0026502172,"about_ca_system_score_gemma":0.0012370781,"threshold_uncertainty_score":0.033756375},"labels":[],"label_agreement":null},{"id":"W2143987151","doi":"10.1515/jmc.2008.018","title":"Two attacks on a sensor network key distribution scheme of Cheng and Agrawal","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Wireless sensor network; Node (physics); Computer science; Scheme (mathematics); Cluster (spacecraft); Pairwise comparison; Key (lock); Computer network; Topology (electrical circuits); Mathematics; Computer security; Artificial intelligence; Combinatorics; Engineering","score_opus":0.02216529395055507,"score_gpt":0.2667200353334149,"score_spread":0.2445547413828598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143987151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54964894,0.0037410427,0.39991122,0.011635764,0.0009347484,0.00091187493,0.00053364126,0.0011874102,0.031495348],"genre_scores_gemma":[0.98067445,0.0002906958,0.016154114,0.000499939,0.000050917482,0.00013096229,0.000070836475,0.00001547526,0.0021124515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99287593,0.0020680532,0.00049694633,0.0005271386,0.003214429,0.0008175344],"domain_scores_gemma":[0.99191296,0.0021685315,0.001491578,0.0029936223,0.0010437738,0.00038956027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031103033,0.00050796376,0.0009868696,0.0011212705,0.0016211569,0.0016120954,0.0019439028,0.0026655027,0.0011369203],"category_scores_gemma":[0.011587936,0.00036443787,0.0007658066,0.00162041,0.0018070816,0.0029649762,0.005309603,0.0028138717,0.00045987894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004540513,0.00045123245,0.011072603,0.00075869093,0.0004928363,0.0040488956,0.0047166427,0.07158013,0.082900204,0.595919,0.019657511,0.20386171],"study_design_scores_gemma":[0.00083433604,0.0012163564,0.0060152397,0.00020713278,0.0002930569,0.0039785844,0.0006611783,0.5061236,0.16517933,0.25014853,0.064915106,0.00042754522],"about_ca_topic_score_codex":0.0013257861,"about_ca_topic_score_gemma":0.0004715493,"teacher_disagreement_score":0.0031103033,"about_ca_system_score_codex":0.002461495,"about_ca_system_score_gemma":0.0013343424,"threshold_uncertainty_score":0.017859459},"labels":[],"label_agreement":null},{"id":"W2144731398","doi":"10.1515/jmc-2013-5002","title":"A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retrievability; Foundation (evidence); Computer science; Cloud computing; Coding (social sciences); Cloud storage; Mathematics; Theoretical computer science; Information retrieval; Statistics; Operating system; Law","score_opus":0.027978865857973833,"score_gpt":0.3078930306575395,"score_spread":0.27991416479956566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144731398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031276435,0.0004329804,0.9505126,0.0014059579,0.0000612607,0.00014659115,0.00014412701,0.00016509122,0.015855007],"genre_scores_gemma":[0.87979245,0.0012899621,0.10459721,0.0009003,0.00044943043,0.00068926235,0.00033973253,0.00020895553,0.011732751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99441296,0.0019413765,0.0002119525,0.00049427187,0.0020016416,0.0009379033],"domain_scores_gemma":[0.96112084,0.029688628,0.002240711,0.0031907146,0.002882466,0.000876595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007873983,0.0011644041,0.0012009135,0.0034056082,0.0015936518,0.003553534,0.0027403333,0.0026715205,0.006540802],"category_scores_gemma":[0.038404275,0.00093727576,0.0025292183,0.00223348,0.008519475,0.008099697,0.0045527564,0.006905261,0.00097409356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014285113,0.000015207988,0.00019562982,0.000031737065,0.000010182515,0.00004874778,0.000108410975,0.025547542,0.00036026398,0.97146654,0.00041414163,0.0017873199],"study_design_scores_gemma":[0.0000117794025,0.000021315627,0.00012308647,0.000039683095,0.0000094746965,0.000051057228,0.000035921395,0.29563668,0.00046183824,0.7026258,0.00096285105,0.000020557576],"about_ca_topic_score_codex":0.0033049062,"about_ca_topic_score_gemma":0.0016227561,"teacher_disagreement_score":0.008270596,"about_ca_system_score_codex":0.008270596,"about_ca_system_score_gemma":0.004473431,"threshold_uncertainty_score":0.06000763},"labels":[],"label_agreement":null},{"id":"W2172194269","doi":"10.1515/jmc.2007.004","title":"Another look at HMQV","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Key (lock); Computer security; Theoretical computer science; Key exchange; Mathematics; Public-key cryptography","score_opus":0.02101922251094666,"score_gpt":0.31189004347894705,"score_spread":0.2908708209680004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172194269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016795283,0.040983137,0.36066094,0.24249233,0.008574968,0.00020441347,0.00034245156,0.0011259222,0.32882053],"genre_scores_gemma":[0.57109094,0.028987916,0.21200916,0.068409756,0.010678731,0.00032925242,0.00030894612,0.0011662886,0.10701902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927148,0.0036128587,0.0002593359,0.0007640902,0.0020364022,0.00061256764],"domain_scores_gemma":[0.9883824,0.0060030394,0.0005159852,0.0030201823,0.0017139806,0.00036442146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007707428,0.00054952136,0.0005948367,0.0013779833,0.0029851936,0.00621506,0.0024753546,0.00624731,0.011064948],"category_scores_gemma":[0.01839932,0.00068692194,0.0010870782,0.0013152086,0.010686289,0.030326493,0.0045255823,0.013151493,0.002361618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012817602,0.000007392474,0.000054271353,0.000039993116,0.0000041919957,0.00004081416,0.00017621809,0.00019210321,0.0002702963,0.9872044,0.005078514,0.006918915],"study_design_scores_gemma":[0.000017680812,0.00006040287,0.00010166378,0.00014196239,0.000007983636,0.00040531863,0.00031773906,0.0022978932,0.0015088315,0.72952324,0.26558983,0.000027389386],"about_ca_topic_score_codex":0.0019807487,"about_ca_topic_score_gemma":0.0008644064,"teacher_disagreement_score":0.011064948,"about_ca_system_score_codex":0.003611817,"about_ca_system_score_gemma":0.002150552,"threshold_uncertainty_score":0.040761292},"labels":[],"label_agreement":null},{"id":"W2295167940","doi":"10.1515/jmc-2018-0012","title":"Multi-prover proof of retrievability","year":2018,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Gas meter prover; Cryptography; Theoretical computer science; Retrievability; Scheme (mathematics); Protocol (science); Confidentiality; Discrete mathematics; Algorithm; Computer security; Mathematics; Mathematical proof; Computer network; Information retrieval","score_opus":0.03915340734756542,"score_gpt":0.3104437271759212,"score_spread":0.27129031982835583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295167940","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.06384251,0.0005320781,0.9082242,0.0041190083,0.0002271263,0.00025280952,0.0003955347,0.0019322394,0.02047457],"genre_scores_gemma":[0.91573733,0.00030035828,0.07715999,0.00076544855,0.00029891694,0.00024999585,0.00019094812,0.00024320438,0.005053847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97639674,0.009303385,0.0013569822,0.0033126262,0.0074564586,0.0021738783],"domain_scores_gemma":[0.85596764,0.098914996,0.0061036064,0.029670961,0.0072836373,0.0020591766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014124127,0.000954332,0.001933751,0.0018419763,0.0022230526,0.0046663936,0.0039913873,0.003163503,0.011267088],"category_scores_gemma":[0.057588127,0.0013685151,0.0024670346,0.0016752772,0.0070985425,0.010315526,0.009725141,0.007871313,0.0019134715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003216651,0.00012512214,0.0010865986,0.00041256752,0.000114460156,0.00043975966,0.0010919974,0.025058486,0.0067060655,0.94278884,0.0032707432,0.018583676],"study_design_scores_gemma":[0.00013811981,0.00011574488,0.00027881688,0.000104380575,0.00005369517,0.00048554575,0.00010949886,0.16966009,0.015468686,0.8070124,0.00649562,0.00007749171],"about_ca_topic_score_codex":0.00042066962,"about_ca_topic_score_gemma":0.00026693405,"teacher_disagreement_score":0.014124127,"about_ca_system_score_codex":0.0022999877,"about_ca_system_score_gemma":0.0028101304,"threshold_uncertainty_score":0.07469642},"labels":[],"label_agreement":null},{"id":"W2408559501","doi":"10.1515/jmc-2015-0042","title":"Linear approaches to resilient aggregation in sensor networks","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless sensor network; Computer science; Computer network; Network topology; Base station; Aggregate (composite); Protocol (science); Node (physics); Key distribution in wireless sensor networks; Distributed computing; Topology (electrical circuits); Wireless network; Wireless; Telecommunications; Mathematics; Engineering","score_opus":0.12053861076230735,"score_gpt":0.2851397040136409,"score_spread":0.16460109325133357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408559501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011897363,0.0006109371,0.97914064,0.0009878947,0.00008868096,0.000078819365,0.000042143238,0.00040650985,0.0067469683],"genre_scores_gemma":[0.75882256,0.0013538682,0.22979495,0.0006397557,0.00030634954,0.00033646586,0.00010145066,0.00013028711,0.008514374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966928,0.001590002,0.00016699596,0.00037467174,0.0008829672,0.00029257458],"domain_scores_gemma":[0.9911538,0.005638084,0.000803912,0.0013598755,0.0008477418,0.00019662778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042190463,0.00078269857,0.0005882159,0.0014722197,0.0010945206,0.0018423682,0.002077559,0.00095688034,0.003817637],"category_scores_gemma":[0.008775591,0.00047461173,0.00076514867,0.0013323145,0.0038818114,0.003809069,0.0038501315,0.0025854227,0.000725144],"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.00016999657,0.00006687315,0.0004465736,0.00025161242,0.00006648678,0.00020117672,0.000410432,0.30579033,0.0039667767,0.6414665,0.003196024,0.043967262],"study_design_scores_gemma":[0.000025901772,0.00007970657,0.00007810358,0.000034520468,0.000021614722,0.000089804635,0.00007613143,0.67039585,0.002661061,0.32229272,0.004219527,0.000025043786],"about_ca_topic_score_codex":0.0011807149,"about_ca_topic_score_gemma":0.00082307705,"teacher_disagreement_score":0.0042190463,"about_ca_system_score_codex":0.002800453,"about_ca_system_score_gemma":0.00091180886,"threshold_uncertainty_score":0.0223127},"labels":[],"label_agreement":null},{"id":"W2562444902","doi":"10.1515/jmc-2016-0002","title":"Unconditionally secure signature schemes revisited","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Digital signature; Key (lock); Computer security; Public-key cryptography; Signature (topology); Robustness (evolution); Theoretical computer science; Public key infrastructure; Scheme (mathematics); Context (archaeology); Extension (predicate logic); Algorithm; Mathematics; Programming language; Encryption","score_opus":0.010639594115355061,"score_gpt":0.2518685554776877,"score_spread":0.24122896136233266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562444902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08762652,0.0027225527,0.841992,0.00974,0.00049416214,0.00025433593,0.00028467597,0.0010479912,0.05583774],"genre_scores_gemma":[0.92006713,0.0010666018,0.06562373,0.000808187,0.00044953628,0.00019724113,0.00017969939,0.00007825444,0.011529632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98543996,0.0052752146,0.0010333423,0.0016072417,0.005239042,0.0014051672],"domain_scores_gemma":[0.986497,0.0052156947,0.0015943451,0.004477852,0.0016652184,0.00055001385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007088712,0.0006938084,0.001052558,0.0012518448,0.0022653618,0.0051342086,0.0028532315,0.0035756358,0.0054049823],"category_scores_gemma":[0.011664879,0.0008232096,0.0016362944,0.0022297588,0.0075515816,0.014150704,0.0087930495,0.0076249684,0.001205975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025888385,0.0000119708675,0.00006296409,0.000029556246,0.0000064066517,0.000044579087,0.00018227483,0.0014457476,0.00065404206,0.99366874,0.00047519928,0.0033927232],"study_design_scores_gemma":[0.000051160445,0.00006343522,0.000085828586,0.00004941994,0.00001956371,0.00022931951,0.00010665681,0.023775335,0.0032647722,0.9533179,0.01900852,0.000028115297],"about_ca_topic_score_codex":0.00064886746,"about_ca_topic_score_gemma":0.0002691392,"teacher_disagreement_score":0.007088712,"about_ca_system_score_codex":0.0042330245,"about_ca_system_score_gemma":0.0024953505,"threshold_uncertainty_score":0.037489116},"labels":[],"label_agreement":null},{"id":"W2794450234","doi":"10.1515/jmc-2017-0058","title":"A survey and refinement of repairable threshold schemes","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Metric (unit); Theoretical computer science; Scheme (mathematics); Algorithm; Mathematics","score_opus":0.04044575581766818,"score_gpt":0.305518014241802,"score_spread":0.26507225842413384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794450234","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.03141945,0.07908902,0.83889335,0.002854468,0.0006777874,0.0002926361,0.00035300673,0.00057890866,0.045841433],"genre_scores_gemma":[0.6246004,0.08028108,0.27653706,0.0011685289,0.0013318028,0.00045859336,0.0005566237,0.00031493063,0.014751002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958085,0.0012642564,0.0003440181,0.00060972327,0.0015873087,0.00038624514],"domain_scores_gemma":[0.992046,0.0044438476,0.0005235715,0.0019810796,0.00083347526,0.00017197568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045932205,0.000938314,0.0013626355,0.0021178466,0.00086206716,0.0024436088,0.0026391917,0.0017078789,0.004219585],"category_scores_gemma":[0.012720719,0.0006381962,0.001118987,0.0034525273,0.0028536466,0.006164865,0.0030724488,0.0034750127,0.0012994825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016555366,0.00006778361,0.00039182682,0.001270855,0.00004539429,0.00009345712,0.00033848008,0.024103329,0.0041196304,0.8276039,0.0041538263,0.13764605],"study_design_scores_gemma":[0.0000906752,0.0005373117,0.0006231692,0.0014969694,0.00012102814,0.0017181099,0.00031073144,0.119083084,0.014667347,0.6572492,0.20395459,0.00014764036],"about_ca_topic_score_codex":0.00062587886,"about_ca_topic_score_gemma":0.00029820454,"teacher_disagreement_score":0.0045932205,"about_ca_system_score_codex":0.0025995085,"about_ca_system_score_gemma":0.00167288,"threshold_uncertainty_score":0.024291575},"labels":[],"label_agreement":null},{"id":"W2979325266","doi":"10.1515/jmc-2019-0048","title":"On the equivalence of authentication codes and robust (2, 2)-threshold schemes","year":2020,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Equivalence (formal languages); Authentication (law); Computer science; Secret sharing; Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Cryptography","score_opus":0.062021590250013615,"score_gpt":0.2836574490103651,"score_spread":0.2216358587603515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979325266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28035238,0.0006834266,0.6368698,0.0027365442,0.00039403045,0.00019017169,0.00029356708,0.0002698433,0.07821025],"genre_scores_gemma":[0.9615352,0.00027748052,0.031582125,0.00052322523,0.00021254283,0.0000973118,0.00011842037,0.000055120134,0.005598743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952886,0.001521262,0.00024927422,0.0007612801,0.0015823315,0.00059721695],"domain_scores_gemma":[0.9898595,0.005733398,0.0010218981,0.0018450121,0.0011587885,0.00038140392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027126714,0.0003752334,0.0004785994,0.0011613198,0.001183017,0.0025589387,0.0008262537,0.0017483725,0.0068492736],"category_scores_gemma":[0.012457945,0.00033614313,0.00085037405,0.0009685917,0.0050518527,0.0059579783,0.0044457642,0.0035424968,0.00068528915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040197272,0.00001764617,0.0001584718,0.000017331948,0.000005046406,0.00005546467,0.00021144822,0.0017745182,0.0012637553,0.99157506,0.0003754135,0.004505785],"study_design_scores_gemma":[0.000021257087,0.000055206983,0.00019113706,0.000021776586,0.000007944344,0.0001586929,0.000064882064,0.017368974,0.002008235,0.97712517,0.0029579522,0.000018804236],"about_ca_topic_score_codex":0.00043007347,"about_ca_topic_score_gemma":0.0001615974,"teacher_disagreement_score":0.0068492736,"about_ca_system_score_codex":0.0012375996,"about_ca_system_score_gemma":0.00080438016,"threshold_uncertainty_score":0.022913039},"labels":[],"label_agreement":null},{"id":"W2979943645","doi":"10.1515/jmc-2018-0039","title":"Privacy-preserving verifiable delegation of polynomial and matrix functions","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Computer science; Verifiable secret sharing; Theoretical computer science; Delegation; Homomorphic encryption; Security parameter; Outsourcing; Functional encryption; Secure multi-party computation; Boolean circuit; Encryption; Cryptography; Boolean function; Computer security; Ciphertext; Algorithm; Programming language","score_opus":0.009955474349203255,"score_gpt":0.2534273374824649,"score_spread":0.24347186313326163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979943645","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.12784885,0.00038569883,0.86197376,0.0010270037,0.000097661075,0.00015359103,0.00028464655,0.0011730518,0.0070557604],"genre_scores_gemma":[0.961317,0.00014923596,0.035079863,0.00013745928,0.0000541723,0.00008361565,0.00013589307,0.00004704641,0.0029956982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949626,0.001200334,0.0002769135,0.0008090758,0.0018809045,0.00087015034],"domain_scores_gemma":[0.99117213,0.0032642302,0.00080426125,0.0039290558,0.00055743195,0.00027277865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00278095,0.00047944003,0.0011658225,0.000475001,0.0008089423,0.0021931943,0.001745069,0.0013678767,0.0025935017],"category_scores_gemma":[0.009901204,0.0003928201,0.00110927,0.00096107327,0.0023834808,0.004512073,0.0049871723,0.002731984,0.000519436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014124966,0.00037331434,0.0021186147,0.00036044637,0.00013343293,0.00080827414,0.0007621599,0.14399171,0.03728453,0.7237886,0.0034236463,0.08554273],"study_design_scores_gemma":[0.00018118188,0.00024263594,0.0007418909,0.000069717265,0.00007112521,0.00047725826,0.00010320921,0.62947744,0.08165227,0.2789238,0.007979567,0.00007992979],"about_ca_topic_score_codex":0.00089237705,"about_ca_topic_score_gemma":0.0004947478,"teacher_disagreement_score":0.00278095,"about_ca_system_score_codex":0.0019502094,"about_ca_system_score_gemma":0.0014235263,"threshold_uncertainty_score":0.014707208},"labels":[],"label_agreement":null},{"id":"W3036444063","doi":"10.1515/jmc-2015-0056","title":"New Techniques for SIDH-based NIKE","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"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; York University; University of Toronto","funders":"Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Key exchange; Computer science; Isogeny; Adversary; Key (lock); Computer security; Public-key cryptography; Protocol (science); Nike; Cryptography; Diffie–Hellman key exchange; Mathematics; Elliptic curve; Advertising","score_opus":0.02557958490615122,"score_gpt":0.27494622182961026,"score_spread":0.24936663692345903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036444063","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.028805686,0.00034767558,0.9441534,0.0007986204,0.00025124193,0.00019525677,0.000047735055,0.0007352319,0.02466511],"genre_scores_gemma":[0.405588,0.0003955768,0.57701814,0.00030035918,0.00018707583,0.0002602119,0.0001324238,0.00022147053,0.01589673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970817,0.0007562477,0.0001884338,0.00037446458,0.0013446936,0.00025450494],"domain_scores_gemma":[0.99619067,0.0011303392,0.00021641873,0.001957375,0.0003800633,0.0001251572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026616899,0.00052287505,0.0009657937,0.0012143146,0.0011305802,0.0014212419,0.0018791372,0.0011468612,0.0070712874],"category_scores_gemma":[0.0059814127,0.00044852955,0.0008561034,0.0007378757,0.0033150418,0.004558961,0.005542766,0.0031176733,0.001627088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020858744,0.00013934211,0.0004259252,0.00022935956,0.000035997895,0.00022764,0.00041760996,0.01042452,0.02762449,0.87323916,0.002488902,0.08453839],"study_design_scores_gemma":[0.00015470873,0.0003548928,0.0004060811,0.000073589064,0.000044867513,0.0012969264,0.00029727042,0.22443502,0.08032105,0.63949937,0.053002227,0.00011404242],"about_ca_topic_score_codex":0.00018574731,"about_ca_topic_score_gemma":0.00027573985,"teacher_disagreement_score":0.0070712874,"about_ca_system_score_codex":0.0009866557,"about_ca_system_score_gemma":0.0010603468,"threshold_uncertainty_score":0.023655832},"labels":[],"label_agreement":null},{"id":"W3036855880","doi":"10.1515/jmc-2015-0057","title":"A subexponential-time, polynomial quantum space algorithm for inverting the CM group action","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Isogeny; Mathematics; Polynomial; Group (periodic table); Quantum algorithm; Action (physics); Quantum computer; Time complexity; Quantum; Cryptosystem; Multiplication (music); Group action; Discrete mathematics; Space (punctuation); Algorithm; Algebra over a field; Elliptic curve; Combinatorics; Pure mathematics; Computer science; Cryptography; Mathematical analysis; Quantum mechanics; Physics","score_opus":0.03095288594065633,"score_gpt":0.2680828124425766,"score_spread":0.23712992650192027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036855880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095412605,0.00028041363,0.87711465,0.0015573374,0.00016718476,0.0002208896,0.000144348,0.0028733748,0.022229167],"genre_scores_gemma":[0.6212695,0.00014945737,0.3686518,0.0003175828,0.00009773874,0.00014696004,0.00023742011,0.00021721274,0.008912273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989039,0.00020655763,0.00006384569,0.0002596948,0.00036864902,0.00019734638],"domain_scores_gemma":[0.99849796,0.00053246634,0.000113190166,0.0005317701,0.00021372727,0.00011084093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853767,0.00047445117,0.0005533867,0.0007566578,0.0007527127,0.0015229661,0.0014949014,0.0010508677,0.008019126],"category_scores_gemma":[0.002843625,0.00021514544,0.0006169025,0.00086062716,0.0014818558,0.0025438138,0.0022974133,0.0019238162,0.0016018563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010565626,0.00045103935,0.0019212145,0.00022343968,0.00006722435,0.0002057367,0.00065238855,0.029216206,0.043671004,0.6130849,0.010907688,0.29854268],"study_design_scores_gemma":[0.0005800606,0.00040011623,0.0007946864,0.000039254923,0.00007240261,0.00036263297,0.00029476904,0.46153945,0.058323376,0.4527942,0.024699617,0.000099413744],"about_ca_topic_score_codex":0.0015281512,"about_ca_topic_score_gemma":0.0018014773,"teacher_disagreement_score":0.008019126,"about_ca_system_score_codex":0.0015321289,"about_ca_system_score_gemma":0.002494883,"threshold_uncertainty_score":0.02682662},"labels":[],"label_agreement":null},{"id":"W3081150612","doi":"10.1515/jmc-2019-0033","title":"New Zémor-Tillich Type Hash Functions Over GL <sub>2</sub> (𝔽 <sub> <i>p</i> <sup> <i>n</i> </sup> </sub> )","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Mathematics; Lemma (botany); Discrete mathematics; Type (biology); Combinatorics; Hash chain; Class (philosophy); Group (periodic table); Set (abstract data type); Computer science; Physics; Biology","score_opus":0.018942253248732804,"score_gpt":0.2340439368169824,"score_spread":0.2151016835682496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081150612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49373057,0.0010096389,0.4882696,0.00091231975,0.00019203135,0.00022263793,0.000380285,0.001197809,0.014085107],"genre_scores_gemma":[0.9357921,0.0003167927,0.057511244,0.00022538597,0.00012363485,0.00011350393,0.00025687923,0.000067508576,0.005592931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991416,0.0001542373,0.000056116492,0.0001339761,0.0003401496,0.00017386542],"domain_scores_gemma":[0.9981542,0.0005937526,0.00029186017,0.0006094181,0.00018755198,0.0001631999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284396,0.0004171939,0.00058584614,0.00097123696,0.0006295779,0.0012592815,0.0009722664,0.0008554892,0.00239502],"category_scores_gemma":[0.0025346351,0.00031254432,0.0005714908,0.00081707665,0.0020237514,0.0038910154,0.0022886894,0.0014232817,0.00065971643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018028283,0.00022423606,0.006255613,0.00028315498,0.00012958495,0.00086919987,0.001265185,0.02546356,0.076098666,0.73950726,0.0040345294,0.14406613],"study_design_scores_gemma":[0.00038043148,0.0014077966,0.0045751506,0.00012060227,0.0001717646,0.0029193424,0.0007089585,0.19685628,0.24813952,0.491608,0.052823845,0.00028825927],"about_ca_topic_score_codex":0.00017387359,"about_ca_topic_score_gemma":0.00026070466,"teacher_disagreement_score":0.00239502,"about_ca_system_score_codex":0.0008835955,"about_ca_system_score_gemma":0.00054770685,"threshold_uncertainty_score":0.008012176},"labels":[],"label_agreement":null},{"id":"W3111886287","doi":"10.1515/jmc-2020-0071","title":"Towards Isogeny-Based Password-Authenticated Key Establishment","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Password; Computer science; Key exchange; Zero-knowledge password proof; Authenticated Key Exchange; Computer security; Cryptography; Cryptographic primitive; Key (lock); Password strength; Public-key cryptography; Theoretical computer science; One-time password; Cryptographic protocol; Encryption","score_opus":0.024331022819154207,"score_gpt":0.25355519293764867,"score_spread":0.22922417011849447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111886287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035896193,0.00028052207,0.9506758,0.0013328529,0.00018865088,0.00018242207,0.00004921581,0.000702826,0.010691649],"genre_scores_gemma":[0.7207096,0.00044823013,0.27162096,0.00046548367,0.00024726463,0.00017671392,0.00016540274,0.000119828146,0.0060465643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99324894,0.0024006863,0.00037883493,0.0008318218,0.002457338,0.0006824575],"domain_scores_gemma":[0.99316376,0.0016589771,0.00052280596,0.0030160614,0.0012096324,0.00042871758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061655287,0.00059823727,0.0011542405,0.0015694735,0.0011316258,0.00288744,0.0026256882,0.0022170965,0.0041168383],"category_scores_gemma":[0.00851338,0.00067649403,0.0007857225,0.0010966413,0.0046388884,0.0060823746,0.0073331455,0.0050152764,0.0023488798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045936622,0.00020006443,0.0007914588,0.00016352937,0.000036784375,0.00051517325,0.0006375497,0.016680133,0.018784976,0.91496575,0.003158959,0.043606296],"study_design_scores_gemma":[0.0002160851,0.00034329877,0.00025362556,0.00009337235,0.000042596817,0.0008783689,0.00018342104,0.3728905,0.04335184,0.5585466,0.023099039,0.000101251455],"about_ca_topic_score_codex":0.00045930874,"about_ca_topic_score_gemma":0.0002200675,"teacher_disagreement_score":0.0061655287,"about_ca_system_score_codex":0.0010612528,"about_ca_system_score_gemma":0.0014109785,"threshold_uncertainty_score":0.03260684},"labels":[],"label_agreement":null},{"id":"W4211129862","doi":"10.1515/jmc-2021-0016","title":"Cryptanalysis of “MAKE”","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Cryptanalysis; Linear cryptanalysis; Computer science; Impossible differential cryptanalysis; Computer security; Cryptography","score_opus":0.01518316274001528,"score_gpt":0.2579301987313154,"score_spread":0.24274703599130013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211129862","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38517225,0.0012518623,0.36926797,0.015244319,0.0017312064,0.00032556386,0.000655344,0.0030360708,0.22331539],"genre_scores_gemma":[0.959855,0.00014467345,0.013603709,0.0006565006,0.0001301359,0.00005952058,0.00011645432,0.00011067665,0.025323369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975434,0.0004855991,0.000075120915,0.0003290924,0.0010137553,0.0005529424],"domain_scores_gemma":[0.99731916,0.0008659377,0.00023637233,0.0010937722,0.00033788997,0.00014692852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014965044,0.00046062344,0.0006090579,0.0009049579,0.0016215807,0.0020553204,0.00083604804,0.0012140722,0.006971265],"category_scores_gemma":[0.0063331695,0.00034928205,0.0008556116,0.00080175075,0.0027461513,0.0034318345,0.003227429,0.002020273,0.0013909924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076606823,0.00008120797,0.0013431915,0.000088848734,0.000109616274,0.0006867725,0.0004982097,0.011146409,0.010013162,0.9279215,0.014609853,0.03273518],"study_design_scores_gemma":[0.00016337055,0.00021771474,0.0010533778,0.000078473706,0.00009953905,0.0008521686,0.00027708404,0.09452217,0.041453913,0.7874331,0.073772304,0.000076891774],"about_ca_topic_score_codex":0.00077203993,"about_ca_topic_score_gemma":0.0006816218,"teacher_disagreement_score":0.006971265,"about_ca_system_score_codex":0.0014783456,"about_ca_system_score_gemma":0.00097619684,"threshold_uncertainty_score":0.023321211},"labels":[],"label_agreement":null},{"id":"W4226062551","doi":"10.1515/jmc-2022-0002","title":"A code-based hybrid signcryption scheme","year":2023,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Impact Fund; Silicon Valley Community Foundation","keywords":"Signcryption; Key encapsulation; Ciphertext; Computer science; Code (set theory); Encryption; McEliece cryptosystem; Theoretical computer science; Ciphertext indistinguishability; Scheme (mathematics); Signature (topology); Public-key cryptography; Hybrid cryptosystem; Mathematics; Symmetric-key algorithm; Computer network; Malleability; Programming language","score_opus":0.05729437724278092,"score_gpt":0.3073742563585063,"score_spread":0.2500798791157254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226062551","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.12657687,0.00035550172,0.8444238,0.0010589359,0.00027055075,0.00040845558,0.000434746,0.0040495163,0.022421688],"genre_scores_gemma":[0.81369233,0.0002100036,0.15921012,0.00036869475,0.00009524681,0.00027286966,0.0004842608,0.00022684164,0.025439598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800926,0.00043769952,0.00013420563,0.00027179194,0.0008574605,0.0002896893],"domain_scores_gemma":[0.99701774,0.0005470491,0.0002601021,0.0011850762,0.000767945,0.00022215399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012507555,0.0004883924,0.00068136427,0.0009464907,0.0008364246,0.0022381574,0.0010531633,0.0017068653,0.0036779565],"category_scores_gemma":[0.0026567096,0.00025472115,0.0005708699,0.0010540918,0.0014726018,0.0027605377,0.0030052313,0.0012313131,0.0018752321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001022012,0.00033443994,0.0015753171,0.00025407714,0.00008116698,0.00064225355,0.00070588803,0.04400797,0.100231,0.70683527,0.00886835,0.13544229],"study_design_scores_gemma":[0.0004344315,0.0004998326,0.00093846425,0.00012179837,0.00010306075,0.001083968,0.00010075423,0.5702053,0.14888899,0.19828756,0.07912902,0.00020682989],"about_ca_topic_score_codex":0.00096899044,"about_ca_topic_score_gemma":0.00046305402,"teacher_disagreement_score":0.0036779565,"about_ca_system_score_codex":0.0011443802,"about_ca_system_score_gemma":0.0014770194,"threshold_uncertainty_score":0.012304008},"labels":[],"label_agreement":null},{"id":"W4320925590","doi":"10.1515/jmc-2022-0010","title":"Plactic key agreement (insecure?)","year":2023,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Key (lock); Public-key cryptography; Computer science; Division (mathematics); Byte; Cryptography; Theoretical computer science; Computer security; Arithmetic; Mathematics; Encryption; Programming language","score_opus":0.02542509089501993,"score_gpt":0.279011769400209,"score_spread":0.25358667850518907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320925590","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.12608773,0.0012858681,0.6294005,0.024728414,0.0017398226,0.00042699097,0.0011604936,0.0052995062,0.20987076],"genre_scores_gemma":[0.93395853,0.0005420639,0.03956151,0.0026105328,0.0005877599,0.00030583036,0.0007822652,0.00045408044,0.021197485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900525,0.0020626702,0.00076335506,0.0021369727,0.00320168,0.0017827987],"domain_scores_gemma":[0.98194134,0.0054455553,0.001313219,0.008193319,0.0024587025,0.0006478689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005715801,0.00061273354,0.0011307148,0.0008745786,0.0039051108,0.005480584,0.0019203768,0.0037953174,0.02247415],"category_scores_gemma":[0.022337398,0.0008178498,0.0010696118,0.0012774306,0.006344453,0.01642468,0.010596624,0.006947291,0.007909536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042007104,0.00006529195,0.00078240695,0.00012737191,0.000040473864,0.00055181293,0.00059226976,0.0030202921,0.0029453032,0.95126355,0.017107528,0.023083637],"study_design_scores_gemma":[0.00007799709,0.00008025402,0.00023090917,0.00009338466,0.000025754754,0.0008060044,0.0003069634,0.020358352,0.008546365,0.9183856,0.051030334,0.000058033427],"about_ca_topic_score_codex":0.00076741853,"about_ca_topic_score_gemma":0.00039432367,"teacher_disagreement_score":0.02247415,"about_ca_system_score_codex":0.002076214,"about_ca_system_score_gemma":0.0016479887,"threshold_uncertainty_score":0.07518351},"labels":[],"label_agreement":null},{"id":"W4392878815","doi":"10.1515/jmc-2022-0029","title":"The dihedral hidden subgroup problem","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Dihedral group; Coset; Quantum algorithm; Mathematics; Dihedral angle; Discrete mathematics; Quantum; Algorithm; Pure mathematics; Group (periodic table); Quantum mechanics","score_opus":0.01215892878859508,"score_gpt":0.26512857328252964,"score_spread":0.25296964449393455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392878815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36751273,0.0010920354,0.5191341,0.015763415,0.00061881443,0.000553176,0.0010237907,0.0010958789,0.093206026],"genre_scores_gemma":[0.95763123,0.00038706278,0.028617585,0.0011169857,0.0003257604,0.00022857034,0.00052916916,0.00014035501,0.011023291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943094,0.0016213674,0.00032357938,0.001117812,0.0017139186,0.0009137831],"domain_scores_gemma":[0.9709762,0.018125717,0.0012901895,0.006889665,0.0015627091,0.0011555179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037750008,0.0006592357,0.0012707012,0.00089190324,0.0022153745,0.0036576267,0.002402869,0.0027759958,0.012998497],"category_scores_gemma":[0.026579231,0.00045062538,0.0012455899,0.001208213,0.006149348,0.009336734,0.006603402,0.005388382,0.0019345125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032245103,0.000086295375,0.0014174443,0.00014050858,0.000036855403,0.000105671825,0.0005097897,0.008438482,0.0019542002,0.96158624,0.0058502853,0.019551827],"study_design_scores_gemma":[0.000072421135,0.0000727224,0.00021972205,0.00003477121,0.00001882034,0.00010109494,0.00022483952,0.04318322,0.003916108,0.94802696,0.004105806,0.000023464436],"about_ca_topic_score_codex":0.0011135633,"about_ca_topic_score_gemma":0.00078459864,"teacher_disagreement_score":0.012998497,"about_ca_system_score_codex":0.0018957035,"about_ca_system_score_gemma":0.002007118,"threshold_uncertainty_score":0.04348427},"labels":[],"label_agreement":null},{"id":"W4404803098","doi":"10.1515/jmc-2023-0012","title":"Revocable policy-based chameleon hash using lattices","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; National Research Council Canada","funders":"University of Waterloo; Impact Fund; Silicon Valley Community Foundation","keywords":"Hash function; Computer science; Computer security; Theoretical computer science","score_opus":0.03226791542826929,"score_gpt":0.32149749840684977,"score_spread":0.2892295829785805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404803098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10890998,0.0008593222,0.85302174,0.002285526,0.0005846163,0.00043043273,0.00044778798,0.0040955404,0.02936505],"genre_scores_gemma":[0.9115374,0.00025950072,0.075717166,0.00032179113,0.00014117382,0.0001886587,0.00021740467,0.00021479191,0.0114022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99301624,0.0019859073,0.00045609983,0.0009001151,0.0026573283,0.0009842518],"domain_scores_gemma":[0.9901106,0.0032091036,0.00074508117,0.004333759,0.0009678596,0.0006335975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038216526,0.00055804866,0.0013332576,0.0009803482,0.0021066223,0.0038852275,0.0018141286,0.0023488766,0.008532616],"category_scores_gemma":[0.010510394,0.0005372638,0.0012512048,0.0010784997,0.0044730296,0.009043625,0.006578569,0.0035944427,0.0029174292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009308601,0.00016353182,0.0008587688,0.00015645428,0.000049554033,0.00028671403,0.0004921369,0.04377092,0.012996859,0.8982385,0.004035113,0.038020577],"study_design_scores_gemma":[0.00024513266,0.0002613224,0.00022873489,0.00008126803,0.000037834325,0.00035944063,0.00020441588,0.36982185,0.036197282,0.56691295,0.025452508,0.00019721397],"about_ca_topic_score_codex":0.0015156997,"about_ca_topic_score_gemma":0.00080273964,"teacher_disagreement_score":0.008532616,"about_ca_system_score_codex":0.0025329827,"about_ca_system_score_gemma":0.0026923146,"threshold_uncertainty_score":0.028544426},"labels":[],"label_agreement":null},{"id":"W4405324345","doi":"10.1515/jmc-2024-0010","title":"Revisiting linearly extended discrete functions","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.017181849297748342,"score_gpt":0.2836623500587121,"score_spread":0.26648050076096375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405324345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081796475,0.0038442712,0.6420362,0.01238905,0.005353603,0.0001281258,0.0004232878,0.0011472747,0.25288174],"genre_scores_gemma":[0.7593161,0.0029445793,0.15237105,0.0044223736,0.0025963949,0.00015318283,0.00027872773,0.00049313175,0.077424526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968263,0.0012514256,0.00019201392,0.0005092613,0.00090059213,0.00032039528],"domain_scores_gemma":[0.99575186,0.0019005912,0.00021207661,0.0012335632,0.0006836404,0.0002182951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027555134,0.000666157,0.00047423434,0.0010085934,0.0012855931,0.0029173016,0.0011307207,0.0014702457,0.008622422],"category_scores_gemma":[0.0087078195,0.00039394252,0.0012771708,0.0010067219,0.0056723254,0.008031383,0.0034012126,0.0048525683,0.0028041773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039000817,0.000017660777,0.00013139022,0.00004650094,0.000004684315,0.00011193444,0.0002354283,0.0020961368,0.0008809369,0.98016274,0.0020848429,0.014188771],"study_design_scores_gemma":[0.000026035756,0.00008654005,0.00012425585,0.00009323558,0.0000091553475,0.00029107693,0.0001495385,0.017603716,0.0032292125,0.86323535,0.11511227,0.00003956885],"about_ca_topic_score_codex":0.0014199757,"about_ca_topic_score_gemma":0.0006791163,"teacher_disagreement_score":0.008622422,"about_ca_system_score_codex":0.0022810337,"about_ca_system_score_gemma":0.000993422,"threshold_uncertainty_score":0.028844833},"labels":[],"label_agreement":null}]}