{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":43,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":43,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"44d73b0cb73f","filters":{"venue":"Journal of Mathematical Cryptology"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Luca De Feo","is_ca":false},{"name":"David Jao","is_ca":true},{"name":"Jérôme Plût","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01353937373835186,"gpt":0.2384679318503223,"spread":0.2249285581119704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006092033,0.0007738556,0.00122575,0.001312264,0.001522082,0.004280171,0.001909322,0.002494357,0.007163104],"category_scores_gemma":[0.01379617,0.0008547865,0.0008592047,0.00101177,0.004641324,0.01124865,0.00584874,0.006124357,0.002104621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001660968,"about_ca_system_score_gemma":0.001449029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002729727,"about_ca_topic_score_gemma":0.0001792025,"domain_scores_codex":[0.9936811,0.001933859,0.0003151269,0.0007607007,0.00266235,0.0006469765],"domain_scores_gemma":[0.9892867,0.004473957,0.001035186,0.003956366,0.0008424266,0.0004053823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004631482,0.000173608,0.000480804,0.0001589629,0.00003122884,0.0001569798,0.0005107907,0.01529482,0.0180838,0.9488492,0.001990825,0.01380583],"study_design_scores_gemma":[0.0003311549,0.0002786063,0.0002360508,0.00007470348,0.00004740339,0.0002764144,0.0002743746,0.1964601,0.06737674,0.7211623,0.01339838,0.00008367463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2372583,0.0006548404,0.7249073,0.004308775,0.0002989819,0.000783439,0.0002253105,0.001605245,0.02995777],"genre_scores_gemma":[0.8533496,0.0004791488,0.1368655,0.0004009783,0.0001674328,0.0004177343,0.0002569268,0.000247094,0.007815563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007163104,"threshold_uncertainty_score":0.0322181,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0096042011635041,"gpt":0.2281385526665449,"spread":0.2185343515030408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00249843,0.0005631294,0.001077277,0.001018307,0.001069359,0.002925898,0.001308156,0.001068361,0.006222516],"category_scores_gemma":[0.01053124,0.000392868,0.001054074,0.001217449,0.002275654,0.005528095,0.00385449,0.00248111,0.001438258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00267626,"about_ca_system_score_gemma":0.002754712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007901562,"about_ca_topic_score_gemma":0.001023165,"domain_scores_codex":[0.9970988,0.0005390177,0.0001890905,0.0005671366,0.001157923,0.0004480015],"domain_scores_gemma":[0.9932417,0.002961952,0.0004787379,0.002329775,0.0006853412,0.0003025256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001626135,0.0006724847,0.008042258,0.0004632091,0.0002319508,0.000422265,0.00124859,0.05026663,0.04590002,0.6495731,0.005875594,0.2356777],"study_design_scores_gemma":[0.000459001,0.000327531,0.00173269,0.00006757706,0.0001124234,0.0004066148,0.0004379064,0.2239316,0.06494168,0.6942707,0.01322913,0.00008318036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4257253,0.0005423954,0.5479267,0.001905238,0.0001794483,0.0002704523,0.0002725917,0.002579835,0.02059801],"genre_scores_gemma":[0.8263995,0.0001981849,0.1668112,0.0001896806,0.00006933159,0.0001132045,0.0003565566,0.0002243256,0.005637957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006222516,"threshold_uncertainty_score":0.02081639,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02101922251094666,"gpt":0.3118900434789471,"spread":0.2908708209680004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007707428,0.0005495214,0.0005948367,0.001377983,0.002985194,0.00621506,0.002475355,0.00624731,0.01106495],"category_scores_gemma":[0.01839932,0.0006869219,0.001087078,0.001315209,0.01068629,0.03032649,0.004525582,0.01315149,0.002361618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003611817,"about_ca_system_score_gemma":0.002150552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001980749,"about_ca_topic_score_gemma":0.0008644064,"domain_scores_codex":[0.9927148,0.003612859,0.0002593359,0.0007640902,0.002036402,0.0006125676],"domain_scores_gemma":[0.9883824,0.006003039,0.0005159852,0.003020182,0.001713981,0.0003644215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000128176,0.000007392474,0.00005427135,0.00003999312,0.000004191996,0.00004081416,0.0001762181,0.0001921032,0.0002702963,0.9872044,0.005078514,0.006918915],"study_design_scores_gemma":[0.00001768081,0.00006040287,0.0001016638,0.0001419624,0.000007983636,0.0004053186,0.0003177391,0.002297893,0.001508832,0.7295232,0.2655898,0.00002738939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01679528,0.04098314,0.3606609,0.2424923,0.008574968,0.0002044135,0.0003424516,0.001125922,0.3288205],"genre_scores_gemma":[0.5710909,0.02898792,0.2120092,0.06840976,0.01067873,0.0003292524,0.0003089461,0.001166289,0.107019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01106495,"threshold_uncertainty_score":0.04076129,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"M. Jason Hinek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02980014665877204,"gpt":0.2613415051658113,"spread":0.2315413585070392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003831801,0.001301262,0.001683894,0.002941813,0.002149719,0.004523825,0.001210761,0.0021665,0.004990124],"category_scores_gemma":[0.01037428,0.0007629367,0.001165967,0.002470461,0.00625593,0.009300465,0.00633229,0.004268338,0.001613971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327665,"about_ca_system_score_gemma":0.0007404834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003297098,"about_ca_topic_score_gemma":0.0001783953,"domain_scores_codex":[0.9959514,0.0009065632,0.0002368229,0.0006953683,0.001492762,0.0007170883],"domain_scores_gemma":[0.983651,0.0112639,0.001044489,0.002758283,0.0008216606,0.0004607599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00139617,0.0001860635,0.002520193,0.000375288,0.0001313119,0.001201349,0.0007432085,0.04222194,0.008569355,0.8885941,0.004825943,0.04923515],"study_design_scores_gemma":[0.000076124,0.0001721177,0.0006118941,0.0001878576,0.00005854737,0.0007305201,0.0001221885,0.0329462,0.004650936,0.9513552,0.009024252,0.00006411543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6374818,0.03360153,0.1602735,0.01522869,0.001515731,0.0001948301,0.000904262,0.0006417194,0.150158],"genre_scores_gemma":[0.9813195,0.005143566,0.009403494,0.0003993302,0.0009193168,0.00004102433,0.0001186226,0.00005239506,0.002602674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004990124,"threshold_uncertainty_score":0.02026474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Andrew M. Childs","is_ca":true},{"name":"Gábor Ivanyos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01041743502972207,"gpt":0.2623641466392208,"spread":0.2519467116094987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390087,0.0002463202,0.0003852355,0.0004159895,0.0007624741,0.001578515,0.0007103136,0.0006077871,0.007664307],"category_scores_gemma":[0.004042629,0.0002048537,0.0007578178,0.0003412631,0.002079917,0.003705007,0.00180626,0.001225143,0.001185071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007291391,"about_ca_system_score_gemma":0.0006389496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002656309,"about_ca_topic_score_gemma":0.0001848871,"domain_scores_codex":[0.9987559,0.0003853178,0.00008772327,0.000186227,0.0004223112,0.0001624486],"domain_scores_gemma":[0.9976857,0.001185821,0.0001440583,0.0005996752,0.0002074295,0.0001773753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002635858,0.0001262251,0.0006098074,0.00008498132,0.00001303775,0.0002573068,0.0004910486,0.01059479,0.01181265,0.9532574,0.002045334,0.0204439],"study_design_scores_gemma":[0.00008922984,0.0001258083,0.00019981,0.00002709522,0.000009282847,0.0001238408,0.000121758,0.1250407,0.0126611,0.8541911,0.007384839,0.00002541729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2770121,0.0002871453,0.6712083,0.002502459,0.000564886,0.0001755523,0.000218071,0.001473314,0.04655829],"genre_scores_gemma":[0.9310804,0.0001124529,0.06246135,0.0001696104,0.0001252626,0.00008921098,0.0001095249,0.0000646287,0.00578755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007664307,"threshold_uncertainty_score":0.02563959,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Neal Koblitz","is_ca":true},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01724332120571248,"gpt":0.2433354980022897,"spread":0.2260921767965772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005250041,0.0004382055,0.000941199,0.003665296,0.002668155,0.004540537,0.001945412,0.002721595,0.006761997],"category_scores_gemma":[0.01778198,0.000382521,0.001078634,0.003047384,0.01153367,0.01609631,0.003834137,0.007798783,0.0003836579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00229396,"about_ca_system_score_gemma":0.0009127181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006425453,"about_ca_topic_score_gemma":0.000667089,"domain_scores_codex":[0.994547,0.002711643,0.0001630757,0.0004232017,0.001686061,0.0004691027],"domain_scores_gemma":[0.9644513,0.02812677,0.001998525,0.003321744,0.001169954,0.000931684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004181688,0.00006441429,0.0008429486,0.00006559261,0.0000102844,0.00007739798,0.0002549934,0.00123445,0.0002333199,0.9907204,0.002061523,0.004393046],"study_design_scores_gemma":[0.00001709614,0.00001839762,0.0006470635,0.00002004906,0.000005443913,0.000148298,0.0002577587,0.004373248,0.0002896542,0.9900056,0.00420864,0.000008750653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4631823,0.010637,0.164243,0.1352382,0.00109971,0.000142996,0.000549542,0.0003571363,0.2245501],"genre_scores_gemma":[0.9720782,0.001380996,0.01699678,0.002914278,0.001048423,0.00003945375,0.0001532906,0.00006474596,0.005323811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006761997,"threshold_uncertainty_score":0.02776515,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Roberto Avanzi","is_ca":false},{"name":"Nicolas Thériault","is_ca":true},{"name":"Zhonghua Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01639432943262557,"gpt":0.2547704709577174,"spread":0.2383761415250918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278094,0.0006075951,0.0006122111,0.0009261589,0.0006924424,0.001832645,0.001052705,0.0005326165,0.002776785],"category_scores_gemma":[0.005868409,0.0002861403,0.00048603,0.0008777137,0.001836661,0.003237042,0.002364543,0.001589754,0.0007513544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000700074,"about_ca_system_score_gemma":0.0006655783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003677466,"about_ca_topic_score_gemma":0.0005170943,"domain_scores_codex":[0.9988016,0.0002443031,0.00008702052,0.0000953342,0.0006017333,0.000169914],"domain_scores_gemma":[0.9975258,0.001061908,0.0002764201,0.0007435485,0.0003186965,0.00007363644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008554317,0.0003163068,0.004576655,0.0006700052,0.00007375221,0.0008620262,0.00116359,0.08392339,0.1101807,0.4060605,0.004240471,0.3870772],"study_design_scores_gemma":[0.0002385571,0.0007342589,0.001733945,0.0003335036,0.00009968155,0.001263841,0.0004246755,0.5126169,0.1585572,0.2886843,0.03514216,0.0001709975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4219075,0.0007435148,0.5578727,0.0007864346,0.0002159823,0.0001241805,0.00005065705,0.001988938,0.01631019],"genre_scores_gemma":[0.8282806,0.000508738,0.1664216,0.0001665812,0.0001559555,0.00003912243,0.00006263408,0.0004723501,0.003892386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002776785,"threshold_uncertainty_score":0.009289205,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01973009016552912,"gpt":0.2759682676567227,"spread":0.2562381774911935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00682992,0.0007305204,0.0006166224,0.001575231,0.003186218,0.005410637,0.002535434,0.004696243,0.02144385],"category_scores_gemma":[0.0141507,0.0006386945,0.00125184,0.001515055,0.009790354,0.01561759,0.004782668,0.01563171,0.005017987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004752799,"about_ca_system_score_gemma":0.003719038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002888908,"about_ca_topic_score_gemma":0.001742652,"domain_scores_codex":[0.9902776,0.003700216,0.0003758413,0.001102101,0.00370622,0.0008379705],"domain_scores_gemma":[0.9884064,0.003580187,0.0004603515,0.00379536,0.003314345,0.0004433973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003375546,0.00001787865,0.0001481863,0.0000784975,0.00001033834,0.0000581977,0.0001528663,0.0004057002,0.0004940936,0.9711415,0.01402559,0.01343341],"study_design_scores_gemma":[0.00003754068,0.000115915,0.0002848835,0.0003476851,0.00002913067,0.0005329547,0.0003364584,0.007909307,0.005352272,0.6181768,0.3668142,0.00006288343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01429474,0.01929603,0.4901683,0.1489355,0.01126948,0.0002287687,0.0004210644,0.00251439,0.3128718],"genre_scores_gemma":[0.5374148,0.009149673,0.2441807,0.06416972,0.008344307,0.0003907641,0.0004870091,0.0008734102,0.1349896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02144385,"threshold_uncertainty_score":0.07173681,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mridul Nandi","is_ca":false},{"name":"Avradip Mandal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02477130548309333,"gpt":0.2978662247649975,"spread":0.2730949192819042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003981465,0.001324916,0.00149515,0.001916433,0.001713507,0.002217539,0.002721218,0.001956269,0.01103019],"category_scores_gemma":[0.01820771,0.0006652771,0.001652624,0.001440994,0.005443011,0.00656115,0.006409205,0.009264546,0.002145965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004056711,"about_ca_system_score_gemma":0.002792655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001037383,"about_ca_topic_score_gemma":0.0005251484,"domain_scores_codex":[0.9903684,0.001873935,0.0002800417,0.001443655,0.004537489,0.001496549],"domain_scores_gemma":[0.9795448,0.009348493,0.001197039,0.006699327,0.002662479,0.0005479396],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001278353,0.0002559777,0.002267348,0.0004225236,0.0001076823,0.0006189917,0.0003120076,0.1462945,0.0385614,0.7456493,0.01003543,0.05419638],"study_design_scores_gemma":[0.0001086124,0.0002523789,0.0006345179,0.0000721282,0.00005704918,0.0004786314,0.00003869613,0.6680357,0.02579787,0.2942536,0.01019793,0.00007270709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1007912,0.001318873,0.8323454,0.004842043,0.0004569687,0.000428196,0.000455605,0.003387704,0.05597402],"genre_scores_gemma":[0.91806,0.0003467207,0.07183998,0.0006930828,0.0004207146,0.0002880821,0.0001675523,0.0002188159,0.007965018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01103019,"threshold_uncertainty_score":0.03689969,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Blake Ian F.","is_ca":true},{"name":"Kolesnikov Vladimir","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03433697848249082,"gpt":0.3210987023680869,"spread":0.2867617238855961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004370697,0.0004040943,0.0008750495,0.0005546956,0.0007984773,0.003060455,0.001823249,0.0008388982,0.004107859],"category_scores_gemma":[0.01076999,0.0002743252,0.0007089015,0.0007344731,0.003172189,0.007720035,0.00344738,0.001965312,0.0006671454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001479929,"about_ca_system_score_gemma":0.001164376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002993105,"about_ca_topic_score_gemma":0.0002181279,"domain_scores_codex":[0.9938504,0.002213063,0.0003582352,0.001014302,0.00185551,0.0007084992],"domain_scores_gemma":[0.9881701,0.005862236,0.00123977,0.003727256,0.0006754713,0.0003252316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001874247,0.0002005868,0.00205659,0.000245255,0.0001063182,0.0004234297,0.0008326874,0.04341259,0.0230835,0.8522704,0.002583831,0.07291058],"study_design_scores_gemma":[0.0001894129,0.0004603785,0.0009290922,0.00008191,0.0000823919,0.0004526484,0.0003641974,0.2095487,0.0850441,0.6922352,0.01052048,0.00009155978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2989474,0.0003067652,0.6769302,0.00158608,0.0001870499,0.0002711935,0.0002606438,0.0009234942,0.02058721],"genre_scores_gemma":[0.9566978,0.00007862543,0.03948061,0.0001324739,0.00004061794,0.00005822814,0.00008633898,0.00005802741,0.003367343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004370697,"threshold_uncertainty_score":0.02311474,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Douglas R. Stinson","is_ca":true},{"name":"Jiewen Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01542390334754307,"gpt":0.3342108138883982,"spread":0.3187869105408551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820854,0.000576359,0.0009081094,0.0006778829,0.001132346,0.001684895,0.001890611,0.001460825,0.002108012],"category_scores_gemma":[0.002442583,0.0004148073,0.0005336133,0.0007139504,0.001662534,0.00600097,0.003592781,0.002538323,0.0007828522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006534692,"about_ca_system_score_gemma":0.001779729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002691277,"about_ca_topic_score_gemma":0.0001553323,"domain_scores_codex":[0.9979885,0.0004551804,0.0001454892,0.0003713778,0.0008218389,0.0002175829],"domain_scores_gemma":[0.9982223,0.0005060777,0.000210075,0.000628278,0.0002983826,0.0001350208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007570756,0.0005929501,0.0009357591,0.0006076414,0.0000992802,0.0009092145,0.001101527,0.03624952,0.08153062,0.691883,0.006128723,0.1792046],"study_design_scores_gemma":[0.000530349,0.0006952168,0.0007648144,0.0001055984,0.0001901538,0.001695015,0.0003099708,0.5528022,0.1388963,0.2394743,0.06419995,0.0003360547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0243603,0.0002233566,0.9692965,0.0004559857,0.0001474087,0.0002286142,0.00008334781,0.0007759411,0.004428554],"genre_scores_gemma":[0.5059426,0.0005266379,0.4801224,0.0003394725,0.0001417217,0.0006928,0.0004149498,0.0001359352,0.01168348],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002108012,"threshold_uncertainty_score":0.009629667,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Clemens Heuberger","is_ca":false},{"name":"James A. Muir","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01260887349827984,"gpt":0.2798365928290339,"spread":0.2672277193307541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006303179,0.0003266736,0.0002700223,0.0008871428,0.0006380627,0.001575372,0.0006808342,0.0005358842,0.00233229],"category_scores_gemma":[0.004365583,0.0002256247,0.0004800942,0.001080454,0.00129239,0.002839577,0.001568929,0.001046125,0.0006208363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007037403,"about_ca_system_score_gemma":0.0007665363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002458805,"about_ca_topic_score_gemma":0.0003119668,"domain_scores_codex":[0.9992309,0.0001461023,0.00009002639,0.0001434033,0.0002635398,0.0001261503],"domain_scores_gemma":[0.998502,0.0004517394,0.0002558723,0.0004573779,0.0002658794,0.00006711217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001689829,0.00004539564,0.001245267,0.00007591442,0.000009144247,0.0001551568,0.0003839014,0.005848594,0.01750305,0.8927981,0.001640977,0.08012541],"study_design_scores_gemma":[0.00005876508,0.0002287302,0.0009861653,0.00009468518,0.00004246849,0.000981944,0.000299079,0.06275261,0.07401829,0.8288905,0.03154909,0.00009764163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2863517,0.000190445,0.6873447,0.0004573871,0.00006482797,0.000108778,0.0003234258,0.0008086276,0.02435009],"genre_scores_gemma":[0.7476827,0.0002071419,0.2438529,0.0001768581,0.00004140159,0.0001480249,0.0005671838,0.0002539865,0.007069782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00233229,"threshold_uncertainty_score":0.007802308,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"David Urbanik","is_ca":true},{"name":"David Jao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02557958490615122,"gpt":0.2749462218296103,"spread":0.249366636923459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00266169,0.0005228751,0.0009657937,0.001214315,0.00113058,0.001421242,0.001879137,0.001146861,0.007071287],"category_scores_gemma":[0.005981413,0.0004485296,0.0008561034,0.0007378757,0.003315042,0.004558961,0.005542766,0.003117673,0.001627088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009866557,"about_ca_system_score_gemma":0.001060347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001857473,"about_ca_topic_score_gemma":0.0002757398,"domain_scores_codex":[0.9970817,0.0007562477,0.0001884338,0.0003744646,0.001344694,0.0002545049],"domain_scores_gemma":[0.9961907,0.001130339,0.0002164187,0.001957375,0.0003800633,0.0001251572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002085874,0.0001393421,0.0004259252,0.0002293596,0.00003599789,0.00022764,0.00041761,0.01042452,0.02762449,0.8732392,0.002488902,0.08453839],"study_design_scores_gemma":[0.0001547087,0.0003548928,0.0004060811,0.00007358906,0.00004486751,0.001296926,0.0002972704,0.224435,0.08032105,0.6394994,0.05300223,0.0001140424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02880569,0.0003476756,0.9441534,0.0007986204,0.0002512419,0.0001952568,0.00004773505,0.0007352319,0.02466511],"genre_scores_gemma":[0.405588,0.0003955768,0.5770181,0.0003003592,0.0001870758,0.0002602119,0.0001324238,0.0002214705,0.01589673],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007071287,"threshold_uncertainty_score":0.02365583,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Exponent; Cryptography; Modulus; Cryptanalysis; Mathematics; Computer science; Computer security; Arithmetic; Philosophy","authors":[{"name":"M. Jason Hinek","is_ca":true},{"name":"Charles Lam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01795605403223394,"gpt":0.2806987262896556,"spread":0.2627426722574217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003087805,0.0007328818,0.0009573737,0.0009782577,0.00129861,0.001552526,0.001375186,0.001376415,0.002583577],"category_scores_gemma":[0.01202688,0.0004121772,0.001273114,0.001099324,0.00269213,0.006875323,0.003338016,0.002540505,0.0005369239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001199399,"about_ca_system_score_gemma":0.0007963713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009300347,"about_ca_topic_score_gemma":0.0009424777,"domain_scores_codex":[0.9952853,0.001233866,0.0003212014,0.0007906623,0.001632422,0.0007364615],"domain_scores_gemma":[0.9853748,0.00578624,0.00133514,0.006578772,0.0006055539,0.0003195234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004983972,0.0006158355,0.03541274,0.0005674531,0.0005236145,0.002519354,0.00262625,0.1917332,0.09728121,0.3950355,0.01119926,0.2575016],"study_design_scores_gemma":[0.0006613961,0.001653068,0.007277554,0.0001640817,0.0002163711,0.004216026,0.0007074028,0.6587982,0.07533916,0.2217276,0.02902889,0.0002102578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8177553,0.001252054,0.1620501,0.001623126,0.0001516231,0.0002621493,0.00024809,0.001016807,0.01564075],"genre_scores_gemma":[0.9690514,0.0002378086,0.02901371,0.0000799907,0.0000691908,0.00005878557,0.0001231428,0.00004770726,0.001318151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003087805,"threshold_uncertainty_score":0.01633006,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Oleg Taraskin","is_ca":false},{"name":"Vladimir Soukharev","is_ca":false},{"name":"David Jao","is_ca":true},{"name":"Jason T. LeGrow","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02433102281915421,"gpt":0.2535551929376487,"spread":0.2292241701184945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006165529,0.0005982373,0.00115424,0.001569474,0.001131626,0.00288744,0.002625688,0.002217097,0.004116838],"category_scores_gemma":[0.00851338,0.000676494,0.0007857225,0.001096641,0.004638888,0.006082375,0.007333145,0.005015276,0.00234888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061253,"about_ca_system_score_gemma":0.001410978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004593087,"about_ca_topic_score_gemma":0.0002200675,"domain_scores_codex":[0.9932489,0.002400686,0.0003788349,0.0008318218,0.002457338,0.0006824575],"domain_scores_gemma":[0.9931638,0.001658977,0.000522806,0.003016061,0.001209632,0.0004287176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004593662,0.0002000644,0.0007914588,0.0001635294,0.00003678437,0.0005151732,0.0006375497,0.01668013,0.01878498,0.9149657,0.003158959,0.0436063],"study_design_scores_gemma":[0.0002160851,0.0003432988,0.0002536256,0.00009337235,0.00004259682,0.0008783689,0.000183421,0.3728905,0.04335184,0.5585466,0.02309904,0.0001012515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03589619,0.0002805221,0.9506758,0.001332853,0.0001886509,0.0001824221,0.00004921581,0.000702826,0.01069165],"genre_scores_gemma":[0.7207096,0.0004482301,0.271621,0.0004654837,0.0002472646,0.0001767139,0.0001654027,0.0001198281,0.006046564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006165529,"threshold_uncertainty_score":0.03260684,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02216529395055507,"gpt":0.2667200353334149,"spread":0.2445547413828598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003110303,0.0005079638,0.0009868696,0.00112127,0.001621157,0.001612095,0.001943903,0.002665503,0.00113692],"category_scores_gemma":[0.01158794,0.0003644379,0.0007658066,0.00162041,0.001807082,0.002964976,0.005309603,0.002813872,0.0004598789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002461495,"about_ca_system_score_gemma":0.001334342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001325786,"about_ca_topic_score_gemma":0.0004715493,"domain_scores_codex":[0.9928759,0.002068053,0.0004969463,0.0005271386,0.003214429,0.0008175344],"domain_scores_gemma":[0.991913,0.002168532,0.001491578,0.002993622,0.001043774,0.0003895603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004540513,0.0004512325,0.0110726,0.0007586909,0.0004928363,0.004048896,0.004716643,0.07158013,0.0829002,0.595919,0.01965751,0.2038617],"study_design_scores_gemma":[0.000834336,0.001216356,0.00601524,0.0002071328,0.0002930569,0.003978584,0.0006611783,0.5061236,0.1651793,0.2501485,0.06491511,0.0004275452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5496489,0.003741043,0.3999112,0.01163576,0.0009347484,0.0009118749,0.0005336413,0.00118741,0.03149535],"genre_scores_gemma":[0.9806744,0.0002906958,0.01615411,0.000499939,0.00005091748,0.0001309623,0.00007083648,0.00001547526,0.002112451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003110303,"threshold_uncertainty_score":0.01785946,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Cryptanalysis; Linear cryptanalysis; Computer science; Impossible differential cryptanalysis; Computer security; Cryptography","authors":[{"name":"Daniel R. L. Brown","is_ca":true},{"name":"Neal Koblitz","is_ca":false},{"name":"Jason T. LeGrow","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01518316274001528,"gpt":0.2579301987313154,"spread":0.2427470359913001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001496504,0.0004606234,0.0006090579,0.0009049579,0.001621581,0.00205532,0.000836048,0.001214072,0.006971265],"category_scores_gemma":[0.00633317,0.0003492821,0.0008556116,0.0008017507,0.002746151,0.003431835,0.003227429,0.002020273,0.001390992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001478346,"about_ca_system_score_gemma":0.0009761968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007720399,"about_ca_topic_score_gemma":0.0006816218,"domain_scores_codex":[0.9975434,0.0004855991,0.00007512092,0.0003290924,0.001013755,0.0005529424],"domain_scores_gemma":[0.9973192,0.0008659377,0.0002363723,0.001093772,0.00033789,0.0001469285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007660682,0.00008120797,0.001343191,0.00008884873,0.0001096163,0.0006867725,0.0004982097,0.01114641,0.01001316,0.9279215,0.01460985,0.03273518],"study_design_scores_gemma":[0.0001633706,0.0002177147,0.001053378,0.00007847371,0.00009953905,0.0008521686,0.000277084,0.09452217,0.04145391,0.7874331,0.0737723,0.00007689177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.3851722,0.001251862,0.369268,0.01524432,0.001731206,0.0003255639,0.000655344,0.003036071,0.2233154],"genre_scores_gemma":[0.959855,0.0001446735,0.01360371,0.0006565006,0.0001301359,0.00005952058,0.0001164543,0.0001106767,0.02532337],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.006971265,"threshold_uncertainty_score":0.02332121,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"David Jao","is_ca":true},{"name":"Jason T. LeGrow","is_ca":true},{"name":"Christopher Leonardi","is_ca":true},{"name":"Luis Marco Ruiz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03095288594065633,"gpt":0.2680828124425766,"spread":0.2371299265019203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853767,0.0004744512,0.0005533867,0.0007566578,0.0007527127,0.001522966,0.001494901,0.001050868,0.008019126],"category_scores_gemma":[0.002843625,0.0002151454,0.0006169025,0.0008606272,0.001481856,0.002543814,0.002297413,0.001923816,0.001601856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001532129,"about_ca_system_score_gemma":0.002494883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001528151,"about_ca_topic_score_gemma":0.001801477,"domain_scores_codex":[0.9989039,0.0002065576,0.00006384569,0.0002596948,0.000368649,0.0001973464],"domain_scores_gemma":[0.998498,0.0005324663,0.0001131902,0.0005317701,0.0002137273,0.0001108409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001056563,0.0004510393,0.001921215,0.0002234397,0.00006722435,0.0002057367,0.0006523886,0.02921621,0.043671,0.6130849,0.01090769,0.2985427],"study_design_scores_gemma":[0.0005800606,0.0004001162,0.0007946864,0.00003925492,0.00007240261,0.000362633,0.000294769,0.4615394,0.05832338,0.4527942,0.02469962,0.00009941374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0954126,0.0002804136,0.8771147,0.001557337,0.0001671848,0.0002208896,0.000144348,0.002873375,0.02222917],"genre_scores_gemma":[0.6212695,0.0001494574,0.3686518,0.0003175828,0.00009773874,0.00014696,0.0002374201,0.0002172127,0.008912273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008019126,"threshold_uncertainty_score":0.02682662,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Koray Karabina","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01011419312858089,"gpt":0.2554686893593438,"spread":0.2453544962307629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000463167,0.0006801199,0.0005938188,0.0008013506,0.0003453036,0.001019045,0.0006134944,0.0005762505,0.005812474],"category_scores_gemma":[0.003101303,0.0002126617,0.0005167257,0.001096316,0.0006077454,0.002513496,0.001586041,0.0006780635,0.001049505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005316855,"about_ca_system_score_gemma":0.0006982686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005548989,"about_ca_topic_score_gemma":0.0006904306,"domain_scores_codex":[0.9993857,0.00008848409,0.00005018569,0.00008707124,0.0002608091,0.0001278215],"domain_scores_gemma":[0.9982947,0.0004199827,0.0002368891,0.0007442636,0.0002139254,0.00009013766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.006701368,0.0006175073,0.007262913,0.0004865989,0.0001779972,0.001473793,0.001763077,0.05880508,0.1240012,0.08295044,0.01272577,0.7030343],"study_design_scores_gemma":[0.0006518893,0.001500202,0.003542843,0.000139143,0.0001287619,0.001847991,0.0009868924,0.4633718,0.4174407,0.07530513,0.03495595,0.0001287707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8556907,0.0006683291,0.1278462,0.0006915251,0.0002566371,0.0001951707,0.0005280559,0.003727964,0.01039543],"genre_scores_gemma":[0.8958647,0.000239419,0.09576223,0.00009630123,0.0001153213,0.00008664488,0.001271642,0.0002032801,0.006360554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005812474,"threshold_uncertainty_score":0.01944464,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Jalaj Upadhyay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02797886585797383,"gpt":0.3078930306575395,"spread":0.2799141647995657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007873983,0.001164404,0.001200913,0.003405608,0.001593652,0.003553534,0.002740333,0.00267152,0.006540802],"category_scores_gemma":[0.03840427,0.0009372758,0.002529218,0.00223348,0.008519475,0.008099697,0.004552756,0.006905261,0.0009740936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008270596,"about_ca_system_score_gemma":0.004473431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003304906,"about_ca_topic_score_gemma":0.001622756,"domain_scores_codex":[0.994413,0.001941376,0.0002119525,0.0004942719,0.002001642,0.0009379033],"domain_scores_gemma":[0.9611208,0.02968863,0.002240711,0.003190715,0.002882466,0.000876595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001428511,0.00001520799,0.0001956298,0.00003173707,0.00001018252,0.00004874778,0.000108411,0.02554754,0.000360264,0.9714665,0.0004141416,0.00178732],"study_design_scores_gemma":[0.0000117794,0.00002131563,0.0001230865,0.00003968309,0.000009474697,0.00005105723,0.0000359214,0.2956367,0.0004618382,0.7026258,0.000962851,0.00002055758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03127643,0.0004329804,0.9505126,0.001405958,0.0000612607,0.0001465911,0.000144127,0.0001650912,0.01585501],"genre_scores_gemma":[0.8797925,0.001289962,0.1045972,0.0009003,0.0004494304,0.0006892623,0.0003397325,0.0002089555,0.01173275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008270596,"threshold_uncertainty_score":0.06000763,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Thalia M. Laing","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04044575581766818,"gpt":0.305518014241802,"spread":0.2650722584241338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004593221,0.000938314,0.001362636,0.002117847,0.0008620672,0.002443609,0.002639192,0.001707879,0.004219585],"category_scores_gemma":[0.01272072,0.0006381962,0.001118987,0.003452527,0.002853647,0.006164865,0.003072449,0.003475013,0.001299483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002599509,"about_ca_system_score_gemma":0.00167288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006258789,"about_ca_topic_score_gemma":0.0002982045,"domain_scores_codex":[0.9958085,0.001264256,0.0003440181,0.0006097233,0.001587309,0.0003862451],"domain_scores_gemma":[0.992046,0.004443848,0.0005235715,0.00198108,0.0008334753,0.0001719757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001655537,0.00006778361,0.0003918268,0.001270855,0.00004539429,0.00009345712,0.0003384801,0.02410333,0.00411963,0.8276039,0.004153826,0.137646],"study_design_scores_gemma":[0.0000906752,0.0005373117,0.0006231692,0.001496969,0.0001210281,0.00171811,0.0003107314,0.1190831,0.01466735,0.6572492,0.2039546,0.0001476404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03141945,0.07908902,0.8388934,0.002854468,0.0006777874,0.0002926361,0.0003530067,0.0005789087,0.04584143],"genre_scores_gemma":[0.6246004,0.08028108,0.2765371,0.001168529,0.001331803,0.0004585934,0.0005566237,0.0003149306,0.014751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004593221,"threshold_uncertainty_score":0.02429157,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Kevin Henry","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1205386107623073,"gpt":0.2851397040136409,"spread":0.1646010932513336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004219046,0.0007826986,0.0005882159,0.00147222,0.001094521,0.001842368,0.002077559,0.0009568803,0.003817637],"category_scores_gemma":[0.008775591,0.0004746117,0.0007651487,0.001332314,0.003881811,0.003809069,0.003850132,0.002585423,0.000725144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002800453,"about_ca_system_score_gemma":0.0009118089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001180715,"about_ca_topic_score_gemma":0.000823077,"domain_scores_codex":[0.9966928,0.001590002,0.000166996,0.0003746717,0.0008829672,0.0002925746],"domain_scores_gemma":[0.9911538,0.005638084,0.000803912,0.001359876,0.0008477418,0.0001966278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001699966,0.00006687315,0.0004465736,0.0002516124,0.00006648678,0.0002011767,0.000410432,0.3057903,0.003966777,0.6414665,0.003196024,0.04396726],"study_design_scores_gemma":[0.00002590177,0.00007970657,0.00007810358,0.00003452047,0.00002161472,0.00008980463,0.00007613143,0.6703959,0.002661061,0.3222927,0.004219527,0.00002504379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01189736,0.0006109371,0.9791406,0.0009878947,0.00008868096,0.00007881936,0.00004214324,0.0004065098,0.006746968],"genre_scores_gemma":[0.7588226,0.001353868,0.2297949,0.0006397557,0.0003063495,0.0003364659,0.0001014507,0.0001302871,0.008514374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004219046,"threshold_uncertainty_score":0.0223127,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hayley Tomkins","is_ca":true},{"name":"Monica Nevins","is_ca":true},{"name":"Hadi Salmasian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0189422532487328,"gpt":0.2340439368169824,"spread":0.2151016835682496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122844,0.0004171939,0.0005858461,0.000971237,0.0006295779,0.001259282,0.0009722664,0.0008554892,0.00239502],"category_scores_gemma":[0.002534635,0.0003125443,0.0005714908,0.0008170767,0.002023751,0.003891015,0.002288689,0.001423282,0.0006597164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008835955,"about_ca_system_score_gemma":0.0005477068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001738736,"about_ca_topic_score_gemma":0.0002607047,"domain_scores_codex":[0.9991416,0.0001542373,0.00005611649,0.0001339761,0.0003401496,0.0001738654],"domain_scores_gemma":[0.9981542,0.0005937526,0.0002918602,0.0006094181,0.000187552,0.0001631999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001802828,0.0002242361,0.006255613,0.000283155,0.000129585,0.0008691999,0.001265185,0.02546356,0.07609867,0.7395073,0.004034529,0.1440661],"study_design_scores_gemma":[0.0003804315,0.001407797,0.004575151,0.0001206023,0.0001717646,0.002919342,0.0007089585,0.1968563,0.2481395,0.491608,0.05282385,0.0002882593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4937306,0.001009639,0.4882696,0.0009123198,0.0001920314,0.0002226379,0.000380285,0.001197809,0.01408511],"genre_scores_gemma":[0.9357921,0.0003167927,0.05751124,0.000225386,0.0001236348,0.0001135039,0.0002568792,0.00006750858,0.005592931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00239502,"threshold_uncertainty_score":0.008012176,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Koray Karabina","is_ca":true},{"name":"Alfred Menezes","is_ca":true},{"name":"Carl Pomerance","is_ca":false},{"name":"Igor E. Shparlinski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009872256274622604,"gpt":0.2513074244030055,"spread":0.2414351681283829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008484874,0.001002864,0.001800741,0.003804053,0.002375433,0.004200165,0.001803046,0.002213643,0.004701111],"category_scores_gemma":[0.06752258,0.0004684363,0.0007856461,0.001194523,0.007443939,0.008161126,0.00619051,0.005165187,0.0006242177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002465741,"about_ca_system_score_gemma":0.001234882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006003195,"about_ca_topic_score_gemma":0.0003870995,"domain_scores_codex":[0.9928653,0.003147628,0.0002405426,0.0005676904,0.001946613,0.00123215],"domain_scores_gemma":[0.9387729,0.04794562,0.002893501,0.005470854,0.002734888,0.002182175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001028161,0.0001684608,0.005311493,0.0002323047,0.0001309215,0.0004557846,0.0004350079,0.07925807,0.009620261,0.8777692,0.00374524,0.02184517],"study_design_scores_gemma":[0.00008214798,0.0002866,0.001722908,0.0001941675,0.00009004622,0.0006757358,0.0002331195,0.4717829,0.01030133,0.5121509,0.00240372,0.0000765299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7370965,0.004839148,0.1198787,0.007587966,0.0003519035,0.0001496643,0.0002880865,0.001020715,0.1287872],"genre_scores_gemma":[0.994796,0.0005254186,0.003116574,0.0001278289,0.0001508981,0.00004063685,0.00006069338,0.00006439149,0.001117734],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008484874,"threshold_uncertainty_score":0.04487282,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jiang Wu","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01681584144669115,"gpt":0.3360632588257027,"spread":0.3192474173790115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002943326,0.0006119192,0.0009650987,0.0006541206,0.00114851,0.002333886,0.002223353,0.00171022,0.003547016],"category_scores_gemma":[0.004828544,0.0004464658,0.0006149538,0.0008626272,0.002221785,0.005384953,0.005949194,0.002464207,0.0008739883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008420761,"about_ca_system_score_gemma":0.001210544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002274813,"about_ca_topic_score_gemma":0.0001585911,"domain_scores_codex":[0.9957507,0.001243449,0.0003448689,0.0007598692,0.001438632,0.0004624344],"domain_scores_gemma":[0.9943777,0.001571933,0.0005939106,0.002539818,0.0005972686,0.0003193795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008022118,0.0004209678,0.0008256936,0.0003028176,0.0001250377,0.0009028056,0.0008627917,0.02357338,0.07225873,0.8503436,0.004207712,0.04537426],"study_design_scores_gemma":[0.0006084898,0.0006499908,0.0008045912,0.0001060964,0.0001914014,0.001142304,0.0002612642,0.4940512,0.1430705,0.3183376,0.04053711,0.0002393951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09839407,0.0003296694,0.8839002,0.001147719,0.0002879628,0.0004387931,0.0002091865,0.001662804,0.01362969],"genre_scores_gemma":[0.8902461,0.0001758959,0.09982517,0.0003418035,0.00008853403,0.0003527488,0.0002423512,0.0001123682,0.008615107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003547016,"threshold_uncertainty_score":0.01556593,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Blake Ian F.","is_ca":true},{"name":"Igor E. Shparlinski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01422313058258052,"gpt":0.2898918531890217,"spread":0.2756687226064412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006382899,0.000424176,0.001146129,0.002657657,0.001421873,0.002913958,0.002365548,0.001658377,0.003019409],"category_scores_gemma":[0.05928065,0.0008766347,0.0005000474,0.00214292,0.006221153,0.006750666,0.003071904,0.002490042,0.0004829565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002650217,"about_ca_system_score_gemma":0.001237078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003798491,"about_ca_topic_score_gemma":0.0001693119,"domain_scores_codex":[0.9950079,0.001813018,0.0002256546,0.0006634318,0.001757997,0.0005321082],"domain_scores_gemma":[0.9276932,0.05299224,0.007838743,0.006035129,0.003568293,0.001872497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000420562,0.0000679147,0.008393869,0.0001142465,0.00004686282,0.0003588274,0.0005777197,0.05782204,0.004670722,0.9138994,0.001433313,0.01219451],"study_design_scores_gemma":[0.00006783388,0.0001941326,0.003420014,0.00004876144,0.0000190552,0.0007598126,0.0002906125,0.4586828,0.003878974,0.5311108,0.001426323,0.0001009036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7277201,0.001534472,0.2605328,0.002612287,0.0001420183,0.0001116666,0.0004370106,0.0002774266,0.006632215],"genre_scores_gemma":[0.9931763,0.0004700709,0.004512379,0.00008691632,0.0001578217,0.00006812283,0.0001726891,0.00004316998,0.001312649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006382899,"threshold_uncertainty_score":0.03375638,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Colleen M. Swanson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01063959411535506,"gpt":0.2518685554776877,"spread":0.2412289613623327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007088712,0.0006938084,0.001052558,0.001251845,0.002265362,0.005134209,0.002853232,0.003575636,0.005404982],"category_scores_gemma":[0.01166488,0.0008232096,0.001636294,0.002229759,0.007551582,0.0141507,0.008793049,0.007624968,0.001205975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004233025,"about_ca_system_score_gemma":0.002495351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006488675,"about_ca_topic_score_gemma":0.0002691392,"domain_scores_codex":[0.98544,0.005275215,0.001033342,0.001607242,0.005239042,0.001405167],"domain_scores_gemma":[0.986497,0.005215695,0.001594345,0.004477852,0.001665218,0.0005500139],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002588838,0.00001197087,0.00006296409,0.00002955625,0.000006406652,0.00004457909,0.0001822748,0.001445748,0.0006540421,0.9936687,0.0004751993,0.003392723],"study_design_scores_gemma":[0.00005116044,0.00006343522,0.00008582859,0.00004941994,0.00001956371,0.0002293195,0.0001066568,0.02377534,0.003264772,0.9533179,0.01900852,0.0000281153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08762652,0.002722553,0.841992,0.00974,0.0004941621,0.0002543359,0.000284676,0.001047991,0.05583774],"genre_scores_gemma":[0.9200671,0.001066602,0.06562373,0.000808187,0.0004495363,0.0001972411,0.0001796994,0.00007825444,0.01152963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007088712,"threshold_uncertainty_score":0.03748912,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mahabir Prasad Jhanwar","is_ca":true},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03649148341082455,"gpt":0.2945608209996092,"spread":0.2580693375887846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578456,0.0003104418,0.0007170027,0.0004811429,0.0007512949,0.001576214,0.001440349,0.0009122737,0.002817922],"category_scores_gemma":[0.004184894,0.0002209225,0.0008944384,0.0006135619,0.001518023,0.003913463,0.003426452,0.001367545,0.0004841083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261663,"about_ca_system_score_gemma":0.001036359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003453661,"about_ca_topic_score_gemma":0.0001942969,"domain_scores_codex":[0.9976516,0.0004785527,0.0002088448,0.0003636389,0.0009381802,0.0003591358],"domain_scores_gemma":[0.9965774,0.0008802991,0.0007805142,0.001189419,0.0003297004,0.0002426363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007170611,0.0001123497,0.0008746693,0.0002050208,0.00009688638,0.0004166095,0.0005791637,0.05307187,0.0619674,0.8498637,0.001214176,0.03088106],"study_design_scores_gemma":[0.0001786369,0.0004410079,0.000839957,0.00005150633,0.00009295167,0.000870119,0.0001542805,0.5456277,0.05648556,0.3870651,0.008066806,0.0001264533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1813231,0.0001997042,0.8085805,0.0004608696,0.00005861077,0.0001476046,0.0003257999,0.0004318039,0.008472104],"genre_scores_gemma":[0.9564653,0.00007161721,0.04140724,0.00005640642,0.00002778078,0.00006991377,0.0001071409,0.00001701841,0.001777555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002817922,"threshold_uncertainty_score":0.009426892,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mathieu Ciet","is_ca":false},{"name":"Jean-Jacques Quisquater","is_ca":false},{"name":"Francesco Sica","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04824862023982155,"gpt":0.2888926973347993,"spread":0.2406440770949778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009080514,0.000366414,0.0007170027,0.001410714,0.0009084127,0.002187685,0.0005499466,0.0006706151,0.008219895],"category_scores_gemma":[0.006370017,0.0002182429,0.0003439951,0.001030335,0.001824151,0.003969658,0.002096679,0.001168879,0.0007959855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001070263,"about_ca_system_score_gemma":0.0003473653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002018854,"about_ca_topic_score_gemma":0.0001436525,"domain_scores_codex":[0.9989053,0.0002005406,0.00006079537,0.0001976002,0.0004034188,0.0002322947],"domain_scores_gemma":[0.9965364,0.001327849,0.000594225,0.0007880022,0.0003745997,0.0003789868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001958781,0.00007353733,0.001206981,0.00005368651,0.000008839561,0.0001951997,0.0003236334,0.004168598,0.003838403,0.9704385,0.001281161,0.01821557],"study_design_scores_gemma":[0.00006418392,0.00008961643,0.001396481,0.0000325924,0.00001235828,0.0003182582,0.0001662967,0.02708366,0.004584429,0.9575223,0.008712396,0.00001737259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8762031,0.0005733331,0.06987075,0.0008581325,0.00009337464,0.00006168038,0.0002380987,0.0003333676,0.05176817],"genre_scores_gemma":[0.9892336,0.0001544462,0.004976964,0.00005077793,0.0001161051,0.00003531996,0.0001461941,0.00002753034,0.005259028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.008219895,"threshold_uncertainty_score":0.0274983,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jean Belo Klamti","is_ca":true},{"name":"M. Anwarul Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03226791542826929,"gpt":0.3214974984068498,"spread":0.2892295829785805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003821653,0.0005580487,0.001333258,0.0009803482,0.002106622,0.003885227,0.001814129,0.002348877,0.008532616],"category_scores_gemma":[0.01051039,0.0005372638,0.001251205,0.0010785,0.00447303,0.009043625,0.006578569,0.003594443,0.002917429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002532983,"about_ca_system_score_gemma":0.002692315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0015157,"about_ca_topic_score_gemma":0.0008027396,"domain_scores_codex":[0.9930162,0.001985907,0.0004560998,0.0009001151,0.002657328,0.0009842518],"domain_scores_gemma":[0.9901106,0.003209104,0.0007450812,0.004333759,0.0009678596,0.0006335975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009308601,0.0001635318,0.0008587688,0.0001564543,0.00004955403,0.000286714,0.0004921369,0.04377092,0.01299686,0.8982385,0.004035113,0.03802058],"study_design_scores_gemma":[0.0002451327,0.0002613224,0.0002287349,0.00008126803,0.00003783432,0.0003594406,0.0002044159,0.3698218,0.03619728,0.5669129,0.02545251,0.000197214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.10891,0.0008593222,0.8530217,0.002285526,0.0005846163,0.0004304327,0.000447788,0.00409554,0.02936505],"genre_scores_gemma":[0.9115374,0.0002595007,0.07571717,0.0003217911,0.0001411738,0.0001886587,0.0002174047,0.0002147919,0.0114022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008532616,"threshold_uncertainty_score":0.02854443,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Arithmetic","authors":[{"name":"John Friedlander","is_ca":true},{"name":"Igor E. Shparlinski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0160479035626701,"gpt":0.2496530297266319,"spread":0.2336051261639618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002502557,0.0003544693,0.0011141,0.002744822,0.00160306,0.002383788,0.0008144415,0.0008356084,0.003073782],"category_scores_gemma":[0.01749041,0.0004885163,0.0005242017,0.001058157,0.005972334,0.003340221,0.00286248,0.001473407,0.0002166911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001151715,"about_ca_system_score_gemma":0.0003698374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003340151,"about_ca_topic_score_gemma":0.0001657123,"domain_scores_codex":[0.9983809,0.0006003084,0.00005415775,0.0002526042,0.000517278,0.0001948451],"domain_scores_gemma":[0.9891529,0.00786961,0.0009717063,0.0006416306,0.0007206957,0.0006434242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001193984,0.00002036863,0.001918794,0.00007807201,0.00001788944,0.0002770642,0.0002732465,0.004278154,0.002993248,0.9853983,0.0007577151,0.003867781],"study_design_scores_gemma":[0.00005462308,0.0001354267,0.003055295,0.00007353908,0.00004382003,0.001666787,0.0003069097,0.05533648,0.005798342,0.9298226,0.003651729,0.00005449374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8628313,0.001235062,0.1061771,0.001955937,0.000111982,0.00004415387,0.0001923079,0.0002243486,0.0272278],"genre_scores_gemma":[0.9959102,0.0001993641,0.002813641,0.00008630777,0.0001081791,0.00002675026,0.00003827036,0.00001616231,0.0008011044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003073782,"threshold_uncertainty_score":0.01323497,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daniel R. L. Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02542509089501993,"gpt":0.279011769400209,"spread":0.2535866785051891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005715801,0.0006127335,0.001130715,0.0008745786,0.003905111,0.005480584,0.001920377,0.003795317,0.02247415],"category_scores_gemma":[0.0223374,0.0008178498,0.001069612,0.001277431,0.006344453,0.01642468,0.01059662,0.006947291,0.007909536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002076214,"about_ca_system_score_gemma":0.001647989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007674185,"about_ca_topic_score_gemma":0.0003943237,"domain_scores_codex":[0.9900525,0.00206267,0.0007633551,0.002136973,0.00320168,0.001782799],"domain_scores_gemma":[0.9819413,0.005445555,0.001313219,0.008193319,0.002458703,0.0006478689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000420071,0.00006529195,0.0007824069,0.0001273719,0.00004047386,0.0005518129,0.0005922698,0.003020292,0.002945303,0.9512635,0.01710753,0.02308364],"study_design_scores_gemma":[0.00007799709,0.00008025402,0.0002309092,0.00009338466,0.00002575475,0.0008060044,0.0003069634,0.02035835,0.008546365,0.9183856,0.05103033,0.00005803343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1260877,0.001285868,0.6294005,0.02472841,0.001739823,0.000426991,0.001160494,0.005299506,0.2098708],"genre_scores_gemma":[0.9339585,0.0005420639,0.03956151,0.002610533,0.0005877599,0.0003058304,0.0007822652,0.0004540804,0.02119748],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02247415,"threshold_uncertainty_score":0.07518351,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Claude Gravel","is_ca":true},{"name":"Daniel Panario","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01718184929774834,"gpt":0.2836623500587121,"spread":0.2664805007609637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002755513,0.000666157,0.0004742343,0.001008593,0.001285593,0.002917302,0.001130721,0.001470246,0.008622422],"category_scores_gemma":[0.00870782,0.0003939425,0.001277171,0.001006722,0.005672325,0.008031383,0.003401213,0.004852568,0.002804177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002281034,"about_ca_system_score_gemma":0.000993422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001419976,"about_ca_topic_score_gemma":0.0006791163,"domain_scores_codex":[0.9968263,0.001251426,0.0001920139,0.0005092613,0.0009005921,0.0003203953],"domain_scores_gemma":[0.9957519,0.001900591,0.0002120766,0.001233563,0.0006836404,0.0002182951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003900082,0.00001766078,0.0001313902,0.00004650094,0.000004684315,0.0001119344,0.0002354283,0.002096137,0.0008809369,0.9801627,0.002084843,0.01418877],"study_design_scores_gemma":[0.00002603576,0.00008654005,0.0001242559,0.00009323558,0.000009155347,0.0002910769,0.0001495385,0.01760372,0.003229212,0.8632354,0.1151123,0.00003956885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08179647,0.003844271,0.6420362,0.01238905,0.005353603,0.0001281258,0.0004232878,0.001147275,0.2528817],"genre_scores_gemma":[0.7593161,0.002944579,0.152371,0.004422374,0.002596395,0.0001531828,0.0002787277,0.0004931318,0.07742453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008622422,"threshold_uncertainty_score":0.02884483,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Liang Feng Zhang","is_ca":false},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009955474349203255,"gpt":0.2534273374824649,"spread":0.2434718631332616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00278095,0.00047944,0.001165822,0.000475001,0.0008089423,0.002193194,0.001745069,0.001367877,0.002593502],"category_scores_gemma":[0.009901204,0.0003928201,0.00110927,0.0009610733,0.002383481,0.004512073,0.004987172,0.002731984,0.000519436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001950209,"about_ca_system_score_gemma":0.001423526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008923771,"about_ca_topic_score_gemma":0.0004947478,"domain_scores_codex":[0.9949626,0.001200334,0.0002769135,0.0008090758,0.001880905,0.0008701503],"domain_scores_gemma":[0.9911721,0.00326423,0.0008042612,0.003929056,0.000557432,0.0002727786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001412497,0.0003733143,0.002118615,0.0003604464,0.0001334329,0.0008082741,0.0007621599,0.1439917,0.03728453,0.7237886,0.003423646,0.08554273],"study_design_scores_gemma":[0.0001811819,0.0002426359,0.0007418909,0.00006971727,0.00007112521,0.0004772583,0.0001032092,0.6294774,0.08165227,0.2789238,0.007979567,0.00007992979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1278488,0.0003856988,0.8619738,0.001027004,0.00009766108,0.000153591,0.0002846466,0.001173052,0.00705576],"genre_scores_gemma":[0.961317,0.000149236,0.03507986,0.0001374593,0.0000541723,0.00008361565,0.0001358931,0.00004704641,0.002995698],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00278095,"threshold_uncertainty_score":0.01470721,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Computer science","authors":[{"name":"Douglas R. Stinson","is_ca":true},{"name":"Jalaj Upadhyay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1212380830603228,"gpt":0.3780973235038994,"spread":0.2568592404435766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02213411,0.001035889,0.002064931,0.00301277,0.004571342,0.01359212,0.004272494,0.006240877,0.01673775],"category_scores_gemma":[0.09015594,0.00114277,0.003087318,0.004867285,0.01438327,0.05800067,0.007530177,0.006757658,0.009017535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002916116,"about_ca_system_score_gemma":0.004523695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001531396,"about_ca_topic_score_gemma":0.0008601171,"domain_scores_codex":[0.9679103,0.01133448,0.00323134,0.005764512,0.009198067,0.002561296],"domain_scores_gemma":[0.838887,0.05147137,0.007534147,0.08451077,0.014872,0.002724641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006593256,0.0002253431,0.006410543,0.0009804633,0.0001897793,0.0006686549,0.002057812,0.001944046,0.004225322,0.825887,0.03511708,0.1216346],"study_design_scores_gemma":[0.00006137726,0.0001176981,0.00123825,0.0004529811,0.000193033,0.001767455,0.001237276,0.007242539,0.01253369,0.8902986,0.08473167,0.0001254886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05425607,0.007627336,0.7614037,0.07867246,0.005421393,0.0006423189,0.002501388,0.004987191,0.08448805],"genre_scores_gemma":[0.6758261,0.009153689,0.2252542,0.0186744,0.006378694,0.0007372985,0.006684376,0.002405341,0.05488586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02213411,"threshold_uncertainty_score":0.1170577,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Robert Gallant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02869037447552344,"gpt":0.2826695385318816,"spread":0.2539791640563581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003149045,0.0005964093,0.001252465,0.001280977,0.001684212,0.003481387,0.001414313,0.001672452,0.003181121],"category_scores_gemma":[0.0164193,0.0005175119,0.001255489,0.00137071,0.003547016,0.008118924,0.004667417,0.00404815,0.0006655866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002449329,"about_ca_system_score_gemma":0.002027747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005397036,"about_ca_topic_score_gemma":0.0004852416,"domain_scores_codex":[0.9972166,0.000455432,0.00024084,0.0006880724,0.001007044,0.0003920159],"domain_scores_gemma":[0.9741976,0.01866555,0.001672338,0.003701332,0.0008433256,0.0009197911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003949527,0.0007811175,0.01558961,0.0005900437,0.0002899123,0.0007069097,0.00173836,0.1458137,0.05360271,0.6160353,0.005211539,0.1556913],"study_design_scores_gemma":[0.0002659921,0.0005292186,0.001110065,0.00006760722,0.0001228445,0.0004518376,0.0002249629,0.440871,0.05811724,0.4938285,0.004310601,0.0001000574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4536276,0.0004089636,0.5330371,0.002122559,0.0001192449,0.0001627246,0.0002577051,0.00126665,0.008997411],"genre_scores_gemma":[0.8490161,0.000123741,0.1474858,0.000173778,0.0000768473,0.00007971804,0.0002055182,0.00008816749,0.002750433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003481387,"threshold_uncertainty_score":0.01777124,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Jalaj Upadhyay","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03915340734756542,"gpt":0.3104437271759212,"spread":0.2712903198283558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01412413,0.000954332,0.001933751,0.001841976,0.002223053,0.004666394,0.003991387,0.003163503,0.01126709],"category_scores_gemma":[0.05758813,0.001368515,0.002467035,0.001675277,0.007098543,0.01031553,0.009725141,0.007871313,0.001913471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002299988,"about_ca_system_score_gemma":0.00281013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004206696,"about_ca_topic_score_gemma":0.000266934,"domain_scores_codex":[0.9763967,0.009303385,0.001356982,0.003312626,0.007456459,0.002173878],"domain_scores_gemma":[0.8559676,0.098915,0.006103606,0.02967096,0.007283637,0.002059177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003216651,0.0001251221,0.001086599,0.0004125675,0.0001144602,0.0004397597,0.001091997,0.02505849,0.006706065,0.9427888,0.003270743,0.01858368],"study_design_scores_gemma":[0.0001381198,0.0001157449,0.0002788169,0.0001043806,0.00005369517,0.0004855458,0.0001094989,0.1696601,0.01546869,0.8070124,0.00649562,0.00007749171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06384251,0.0005320781,0.9082242,0.004119008,0.0002271263,0.0002528095,0.0003955347,0.001932239,0.02047457],"genre_scores_gemma":[0.9157373,0.0003003583,0.07715999,0.0007654486,0.0002989169,0.0002499959,0.0001909481,0.0002432044,0.005053847],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01412413,"threshold_uncertainty_score":0.07469642,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03865162738862765,"gpt":0.286290799396298,"spread":0.2476391720076703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002631848,0.0006448685,0.0008625256,0.0007794062,0.001043455,0.001693729,0.002056213,0.001339167,0.003679533],"category_scores_gemma":[0.006862234,0.0006867095,0.0009031339,0.001095109,0.00211868,0.004222477,0.004324029,0.001966164,0.0006644077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002912271,"about_ca_system_score_gemma":0.00146977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004822343,"about_ca_topic_score_gemma":0.000608113,"domain_scores_codex":[0.9977444,0.0008152665,0.0001318299,0.0003683708,0.0005655558,0.0003746205],"domain_scores_gemma":[0.9930509,0.003663945,0.000612118,0.002014573,0.0003947057,0.0002637786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005869761,0.0001846591,0.001030944,0.0003325221,0.00006373077,0.0002356963,0.0006736723,0.2088682,0.01844009,0.7111278,0.003757781,0.05469802],"study_design_scores_gemma":[0.0001452114,0.0001306426,0.0003292583,0.00005487607,0.00004737493,0.0002390551,0.0002195165,0.6159853,0.01741813,0.3598097,0.005556297,0.00006460643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1256008,0.0003332676,0.8644649,0.0009175421,0.00005984136,0.0002680224,0.0002341345,0.00055023,0.007571217],"genre_scores_gemma":[0.7473558,0.0003127207,0.247571,0.0001516651,0.00003388792,0.0002337992,0.0002404886,0.0001488768,0.003951785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003679533,"threshold_uncertainty_score":0.02113008,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"M. Jason Hinek","is_ca":true},{"name":"Charles Lam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01735023518713309,"gpt":0.3037783712800312,"spread":0.2864281360928981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003213349,0.001174313,0.0006988671,0.002014687,0.001167369,0.001898643,0.001611758,0.001175805,0.01090525],"category_scores_gemma":[0.008897413,0.0005523202,0.001251415,0.001667159,0.002434731,0.007780356,0.002187793,0.003461525,0.002924733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001520411,"about_ca_system_score_gemma":0.0007652296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005627045,"about_ca_topic_score_gemma":0.0003660877,"domain_scores_codex":[0.9980133,0.0006872303,0.00008871806,0.0002726937,0.0008052839,0.0001326677],"domain_scores_gemma":[0.9963664,0.001744357,0.0001670198,0.001024581,0.0006172935,0.00008033193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001392696,0.00005927594,0.0002894848,0.0002589074,0.0000294425,0.00008847922,0.0002298851,0.008400137,0.003512532,0.838595,0.006581274,0.1418162],"study_design_scores_gemma":[0.0001637888,0.0002649768,0.0002882945,0.0002804881,0.00004090548,0.0005528269,0.0000917723,0.08998442,0.009997622,0.7546322,0.1436383,0.00006446854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01545506,0.009615515,0.9258231,0.004074136,0.001566475,0.000154098,0.00006687169,0.0005530397,0.04269166],"genre_scores_gemma":[0.2001465,0.008091223,0.7506035,0.001219165,0.002444977,0.0002582208,0.0001424331,0.000471717,0.0366223],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01090525,"threshold_uncertainty_score":0.03648174,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06202159025001362,"gpt":0.2836574490103651,"spread":0.2216358587603515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002712671,0.0003752334,0.0004785994,0.00116132,0.001183017,0.002558939,0.0008262537,0.001748372,0.006849274],"category_scores_gemma":[0.01245795,0.0003361431,0.0008503741,0.0009685917,0.005051853,0.005957978,0.004445764,0.003542497,0.0006852892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0012376,"about_ca_system_score_gemma":0.0008043802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004300735,"about_ca_topic_score_gemma":0.0001615974,"domain_scores_codex":[0.9952886,0.001521262,0.0002492742,0.0007612801,0.001582331,0.0005972169],"domain_scores_gemma":[0.9898595,0.005733398,0.001021898,0.001845012,0.001158788,0.0003814039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004019727,0.00001764617,0.0001584718,0.00001733195,0.000005046406,0.00005546467,0.0002114482,0.001774518,0.001263755,0.9915751,0.0003754135,0.004505785],"study_design_scores_gemma":[0.00002125709,0.00005520698,0.0001911371,0.00002177659,0.000007944344,0.0001586929,0.00006488206,0.01736897,0.002008235,0.9771252,0.002957952,0.00001880424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2803524,0.0006834266,0.6368698,0.002736544,0.0003940304,0.0001901717,0.0002935671,0.0002698433,0.07821025],"genre_scores_gemma":[0.9615352,0.0002774805,0.03158212,0.0005232252,0.0002125428,0.0000973118,0.0001184204,0.00005512013,0.005598743],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006849274,"threshold_uncertainty_score":0.02291304,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Imin Chen","is_ca":true},{"name":"David Sun","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01215892878859508,"gpt":0.2651285732825296,"spread":0.2529696444939346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003775001,0.0006592357,0.001270701,0.0008919032,0.002215374,0.003657627,0.002402869,0.002775996,0.0129985],"category_scores_gemma":[0.02657923,0.0004506254,0.00124559,0.001208213,0.006149348,0.009336734,0.006603402,0.005388382,0.001934513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001895703,"about_ca_system_score_gemma":0.002007118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001113563,"about_ca_topic_score_gemma":0.0007845986,"domain_scores_codex":[0.9943094,0.001621367,0.0003235794,0.001117812,0.001713919,0.0009137831],"domain_scores_gemma":[0.9709762,0.01812572,0.001290189,0.006889665,0.001562709,0.001155518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000322451,0.00008629537,0.001417444,0.0001405086,0.0000368554,0.0001056718,0.0005097897,0.008438482,0.0019542,0.9615862,0.005850285,0.01955183],"study_design_scores_gemma":[0.00007242113,0.0000727224,0.000219722,0.00003477121,0.00001882034,0.0001010949,0.0002248395,0.04318322,0.003916108,0.948027,0.004105806,0.00002346444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3675127,0.001092035,0.5191341,0.01576342,0.0006188144,0.000553176,0.001023791,0.001095879,0.09320603],"genre_scores_gemma":[0.9576312,0.0003870628,0.02861759,0.001116986,0.0003257604,0.0002285703,0.0005291692,0.000140355,0.01102329],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0129985,"threshold_uncertainty_score":0.04348427,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean Belo Klamti","is_ca":true},{"name":"M. Anwar Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05729437724278092,"gpt":0.3073742563585063,"spread":0.2500798791157254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001250756,0.0004883924,0.0006813643,0.0009464907,0.0008364246,0.002238157,0.001053163,0.001706865,0.003677957],"category_scores_gemma":[0.00265671,0.0002547211,0.0005708699,0.001054092,0.001472602,0.002760538,0.003005231,0.001231313,0.001875232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00114438,"about_ca_system_score_gemma":0.001477019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009689904,"about_ca_topic_score_gemma":0.000463054,"domain_scores_codex":[0.9980093,0.0004376995,0.0001342056,0.0002717919,0.0008574605,0.0002896893],"domain_scores_gemma":[0.9970177,0.0005470491,0.0002601021,0.001185076,0.000767945,0.000222154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001022012,0.0003344399,0.001575317,0.0002540771,0.00008116698,0.0006422536,0.000705888,0.04400797,0.100231,0.7068353,0.00886835,0.1354423],"study_design_scores_gemma":[0.0004344315,0.0004998326,0.0009384642,0.0001217984,0.0001030608,0.001083968,0.0001007542,0.5702053,0.148889,0.1982876,0.07912902,0.0002068299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1265769,0.0003555017,0.8444238,0.001058936,0.0002705508,0.0004084556,0.000434746,0.004049516,0.02242169],"genre_scores_gemma":[0.8136923,0.0002100036,0.1592101,0.0003686947,0.00009524681,0.0002728697,0.0004842608,0.0002268416,0.0254396],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003677957,"threshold_uncertainty_score":0.01230401,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"D. R. Stinson","is_ca":true},{"name":"W. H. D. R.","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0236044729694288,"gpt":0.2915814528388346,"spread":0.2679769798694058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0100368,0.001562501,0.002440237,0.002081383,0.003103765,0.006783513,0.004129283,0.00503885,0.01167014],"category_scores_gemma":[0.03296741,0.001521882,0.004056281,0.0032626,0.006995125,0.03112358,0.005534057,0.01042421,0.001396124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0048446,"about_ca_system_score_gemma":0.002796438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001168798,"about_ca_topic_score_gemma":0.0004924468,"domain_scores_codex":[0.9883504,0.003728951,0.0008289976,0.001615294,0.003543109,0.001933307],"domain_scores_gemma":[0.9607221,0.02955726,0.00296095,0.004294636,0.001738818,0.0007260882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000136374,0.00008339127,0.0002295235,0.0001524642,0.00002281561,0.00009301017,0.0004724041,0.0127275,0.001192016,0.9774864,0.0008752659,0.006528866],"study_design_scores_gemma":[0.00007097518,0.0001158758,0.0002923072,0.0000540534,0.00006829986,0.0002569606,0.0001410179,0.1292528,0.003382793,0.8617453,0.004550361,0.00006925769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05767754,0.001490171,0.9146681,0.004010954,0.000116768,0.0003659488,0.0003328991,0.0003873779,0.02095015],"genre_scores_gemma":[0.8196918,0.003761278,0.1521088,0.001882394,0.001028872,0.001096079,0.000805908,0.0004538739,0.01917104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01167014,"threshold_uncertainty_score":0.05308026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}