{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1083,"total_is_capped":false,"direct_labels_cover":2,"predictions_cover":1083,"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":"ce406a165f67","filters":{"topic":"Cryptography and Data Security"}},"results":[{"id":"W1992282993","doi":"10.1109/focs.2011.12","title":"Efficient Fully Homomorphic Encryption from (Standard) LWE","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1462,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Learning with errors; Security parameter; Encryption; Theoretical computer science; Computer science; Homomorphic secret sharing; Communication complexity; Scheme (mathematics); Public-key cryptography; Commitment scheme; Lattice problem; Discrete logarithm; Protocol (science); Reduction (mathematics); Cryptography; Mathematics; Algorithm; Secret sharing; Computer security","authors":[{"name":"Zvika Brakerski","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02339945567962077,"gpt":0.2062763215648654,"spread":0.1828768658852446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001767596,0.0004227182,0.001045333,0.000440692,0.0006288014,0.00152487,0.001502505,0.001130437,0.002735576],"category_scores_gemma":[0.003196612,0.0004687615,0.0007211895,0.0007570086,0.00165376,0.005391314,0.004876801,0.002632851,0.001231168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007101697,"about_ca_system_score_gemma":0.001298728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000208316,"about_ca_topic_score_gemma":0.0001867699,"domain_scores_codex":[0.9969845,0.0005547726,0.0002179644,0.0003693292,0.001450654,0.0004227063],"domain_scores_gemma":[0.9968168,0.0006606926,0.0002747864,0.001852076,0.0002806334,0.0001150181],"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.0005619591,0.000336745,0.0006439803,0.0004704439,0.00008371733,0.000543232,0.0005801541,0.04027405,0.0516044,0.7513139,0.007303494,0.1462839],"study_design_scores_gemma":[0.0003570252,0.0004551905,0.0006375258,0.0001116757,0.00007126939,0.00135297,0.000173395,0.358549,0.1394729,0.4694569,0.02916745,0.0001946222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0517607,0.0004343361,0.9329935,0.0008562538,0.0001376399,0.0002767776,0.0004276807,0.001107303,0.01200586],"genre_scores_gemma":[0.7332571,0.0003430378,0.2578406,0.00044488,0.0001404572,0.0003792645,0.0005069161,0.0001407377,0.006946987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002735576,"threshold_uncertainty_score":0.009348035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2177209050","doi":"10.1145/2633600","title":"(Leveled) Fully Homomorphic Encryption without Bootstrapping","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1374,"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; Defense Advanced Research Projects Agency; Simons Foundation","keywords":"Homomorphic encryption; Bootstrapping (finance); Learning with errors; Security parameter; Computation; Computer science; Polynomial; Encryption; Mathematics; Bounded function; Theoretical computer science; Cryptography; Algorithm","authors":[{"name":"Zvika Brakerski","is_ca":false},{"name":"Craig Gentry","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01778963680264913,"gpt":0.250754521302626,"spread":0.2329648844999769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008720102,0.0003283707,0.0005134245,0.0003180274,0.0003647891,0.001505961,0.00117565,0.0009926765,0.004683305],"category_scores_gemma":[0.002773503,0.0003124662,0.0007345431,0.0003749689,0.001275297,0.004842899,0.003395664,0.001872231,0.001337462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006407868,"about_ca_system_score_gemma":0.0005790838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001673386,"about_ca_topic_score_gemma":0.000228598,"domain_scores_codex":[0.9985733,0.0002668823,0.0001127727,0.0002801625,0.0005412912,0.0002255835],"domain_scores_gemma":[0.997701,0.0003676707,0.0001429893,0.0015193,0.0002032976,0.0000658584],"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.000509425,0.0002575377,0.001778506,0.0004191237,0.0001120669,0.0005396477,0.0004518023,0.04454598,0.1230578,0.6142939,0.007470474,0.2065638],"study_design_scores_gemma":[0.000147062,0.0005978196,0.001236783,0.00009263132,0.00007376056,0.001274567,0.0001175687,0.429552,0.1644324,0.3684865,0.03385859,0.0001302849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0533529,0.000294727,0.9340293,0.0004916609,0.0000826589,0.0001569123,0.0003248942,0.001522392,0.009744519],"genre_scores_gemma":[0.6579852,0.0001673665,0.3347612,0.0005243026,0.00006881329,0.000162984,0.0003405737,0.00009837516,0.005891276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004683305,"threshold_uncertainty_score":0.01566726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1589176872","doi":"10.1007/3-540-46766-1_35","title":"Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1043,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Zero-knowledge proof; Ciphertext; Computer science; Computer security; Encryption; Cryptography","authors":[{"name":"Charles Rackoff","is_ca":true},{"name":"Daniel Simón","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02433145023707008,"gpt":0.2923114647678343,"spread":0.2679800145307643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965281,0.001211224,0.002173906,0.001311247,0.002090177,0.006748479,0.003448397,0.00349213,0.007516256],"category_scores_gemma":[0.02050648,0.001453669,0.002032379,0.002070497,0.006039407,0.01376552,0.00841188,0.006924465,0.002418166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003104748,"about_ca_system_score_gemma":0.003186483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007068241,"about_ca_topic_score_gemma":0.0004754313,"domain_scores_codex":[0.9899527,0.003114302,0.0004841058,0.001171021,0.004029566,0.001248219],"domain_scores_gemma":[0.9689214,0.02371535,0.001056341,0.004714157,0.001132767,0.0004600611],"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.0003396788,0.00008899849,0.0002692504,0.0003049983,0.00007455303,0.0002848579,0.0005051927,0.01409814,0.002693462,0.9515585,0.00478561,0.02499663],"study_design_scores_gemma":[0.00006533627,0.00002895641,0.00009369072,0.00006269795,0.00003496966,0.0002454511,0.00003178389,0.04548567,0.004664598,0.9451277,0.004122311,0.00003675979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0247517,0.001667122,0.9074804,0.004088664,0.0003550066,0.0002549809,0.0004975306,0.001001594,0.05990301],"genre_scores_gemma":[0.8509163,0.001670626,0.1117787,0.0008408034,0.0004657531,0.0004156396,0.0004507945,0.000257258,0.03320399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007516256,"threshold_uncertainty_score":0.02625918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2866028610","doi":"10.1109/eurosp.2018.00032","title":"CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1000,"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; Horizon 2020 Framework Programme; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Bpifrance","keywords":"Key encapsulation; Computer science; Random oracle; NIST; Key exchange; Learning with errors; Cryptographic primitive; Cryptography; Ciphertext; Encryption; Theoretical computer science; Public-key cryptography; Cryptographic protocol; Computer security","authors":[{"name":"Joppe W. Bos","is_ca":false},{"name":"Léo Ducas","is_ca":false},{"name":"Eike Kiltz","is_ca":false},{"name":"Tancrède Lepoint","is_ca":false},{"name":"Vadim Lyubashevsky","is_ca":false},{"name":"John M. Schanck","is_ca":true},{"name":"Peter Schwabe","is_ca":false},{"name":"Gregor Seiler","is_ca":false},{"name":"Damien Stehlé","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02456623467212205,"gpt":0.2615881485768737,"spread":0.2370219139047516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001695709,0.0005896116,0.001032228,0.0007140596,0.001621736,0.002210905,0.002129231,0.001275767,0.008308574],"category_scores_gemma":[0.003636133,0.0005188234,0.001113465,0.001097927,0.002791462,0.005807342,0.006555586,0.003724694,0.005889385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009805682,"about_ca_system_score_gemma":0.002843514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004385175,"about_ca_topic_score_gemma":0.0006307113,"domain_scores_codex":[0.9975469,0.0005652522,0.0001461534,0.0003822953,0.00103755,0.0003219015],"domain_scores_gemma":[0.998583,0.0003604761,0.0001360498,0.0005175698,0.0002155277,0.0001873173],"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.0004725125,0.0001845296,0.0003498267,0.0002929996,0.00005735476,0.0003310972,0.0003882212,0.01921092,0.01602079,0.8885043,0.01164973,0.06253771],"study_design_scores_gemma":[0.0002634551,0.0002897675,0.0002072442,0.00008220971,0.0000543485,0.0007393028,0.0001512719,0.1462456,0.05302723,0.7274542,0.07129535,0.0001900743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02848282,0.0004009776,0.9361516,0.001038487,0.0003665579,0.0004025886,0.0005943663,0.003676108,0.02888652],"genre_scores_gemma":[0.532029,0.000550199,0.4282984,0.00097857,0.0002075005,0.0006921177,0.001113956,0.000853515,0.03527673],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008308574,"threshold_uncertainty_score":0.0277949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W198033559","doi":"10.1007/978-3-642-29011-4_29","title":"Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":442,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Homomorphic encryption; Secure multi-party computation; Theoretical computer science; Computation; Encryption; Plaintext; Universal composability; Public-key cryptography; Cryptography; Computer security; Algorithm; Cryptographic protocol","authors":[{"name":"Gilad Asharov","is_ca":false},{"name":"Abhishek Jain","is_ca":false},{"name":"Adriana López-Alt","is_ca":false},{"name":"Eran Tromer","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":true},{"name":"Daniel Wichs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01550720551093689,"gpt":0.2565546351823031,"spread":0.2410474296713662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823132,0.0007303732,0.0014847,0.001188674,0.001704826,0.003525264,0.001577861,0.002808672,0.008141642],"category_scores_gemma":[0.007722771,0.00057845,0.001054113,0.001087188,0.004190826,0.005119113,0.005837381,0.005474397,0.00223973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001490877,"about_ca_system_score_gemma":0.000771021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002130795,"about_ca_topic_score_gemma":0.0001658405,"domain_scores_codex":[0.9972796,0.0008793728,0.0001289166,0.0004115822,0.0009061824,0.0003945279],"domain_scores_gemma":[0.9954969,0.002527989,0.0002022795,0.001257024,0.0002646988,0.0002511551],"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.00005223914,0.00002274262,0.00004936831,0.00004650971,0.000008803376,0.00003983251,0.0000804856,0.002947423,0.002011078,0.9864013,0.001108136,0.007232139],"study_design_scores_gemma":[0.00001686976,0.00002817991,0.00005864622,0.00001811569,0.000007906081,0.00009239581,0.00001479959,0.04059201,0.001874236,0.9553019,0.001978724,0.00001632406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04976094,0.001130962,0.8525059,0.002389547,0.0004361668,0.0001599453,0.0001861827,0.0006040282,0.09282634],"genre_scores_gemma":[0.8637528,0.0005740542,0.0896296,0.0006593037,0.0004782314,0.0003525897,0.0001453753,0.0002339374,0.04417424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008141642,"threshold_uncertainty_score":0.02723646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113717903","doi":"10.1007/978-3-642-55220-5_30","title":"Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":432,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Ciphertext; Homomorphic encryption; Learning with errors; Plaintext; Key (lock); Encryption; Attribute-based encryption; Computer science; Public-key cryptography; Construct (python library); Arithmetic; Theoretical computer science; Key size; Multilinear map; Electronic circuit; Cryptography; Algorithm; Mathematics; Computer security; Computer network","authors":[{"name":"Dan Boneh","is_ca":false},{"name":"Craig Gentry","is_ca":false},{"name":"S. Gorbunov","is_ca":false},{"name":"Shai Halevi","is_ca":false},{"name":"Valeria Nikolaenko","is_ca":false},{"name":"Gil Segev","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":false},{"name":"Dhinakaran Vinayagamurthy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01741008001241027,"gpt":0.2243699274008831,"spread":0.2069598473884728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003227216,0.0007450514,0.0007094219,0.0004838064,0.0003843362,0.001870955,0.0005803937,0.0009224469,0.004256248],"category_scores_gemma":[0.001093033,0.0003709711,0.0004760408,0.0009958071,0.001267866,0.005225388,0.0011219,0.002061158,0.00140863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006281144,"about_ca_system_score_gemma":0.0003421435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001138068,"about_ca_topic_score_gemma":0.0001351637,"domain_scores_codex":[0.9996048,0.00007443549,0.00002561171,0.00007494765,0.0001664424,0.0000538385],"domain_scores_gemma":[0.9997168,0.0001168481,0.00002940235,0.00009684393,0.00003022468,0.000009782952],"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.00009147751,0.00003379694,0.00004672637,0.000219865,0.00001442368,0.0000816317,0.00006669985,0.004962055,0.006158836,0.9275509,0.002744736,0.05802888],"study_design_scores_gemma":[0.00001991514,0.00007096546,0.0001313288,0.00005887755,0.00001380087,0.0004513272,0.00002324864,0.01584989,0.006921011,0.9545141,0.0219231,0.00002244285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07913765,0.02383323,0.7330078,0.002122172,0.001042216,0.0001653259,0.0004570267,0.0009955694,0.159239],"genre_scores_gemma":[0.7554826,0.01359264,0.1534456,0.0005767886,0.0007755508,0.0001906887,0.0005833525,0.0002635245,0.07508917],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004256248,"threshold_uncertainty_score":0.0142386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W167928972","doi":"10.1007/978-3-642-28914-9_24","title":"How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":353,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Verifiable secret sharing; Delegate; Computer science; Delegation; Theoretical computer science; Encryption; Computation; Cryptography; Scheme (mathematics); Function (biology); Cryptographic primitive; Algorithm; Computer security; Mathematics; Programming language; Cryptographic protocol; Law","authors":[{"name":"Bryan Parno","is_ca":false},{"name":"Mariana Raykova","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02531275578391829,"gpt":0.2365524085154586,"spread":0.2112396527315404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003940629,0.001179828,0.001504886,0.0006357251,0.001535802,0.006820918,0.002175092,0.002483127,0.01150965],"category_scores_gemma":[0.01356114,0.001267895,0.002058649,0.001147164,0.00434872,0.02081371,0.00559062,0.008142635,0.005968668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001531101,"about_ca_system_score_gemma":0.002039584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008796204,"about_ca_topic_score_gemma":0.0008363553,"domain_scores_codex":[0.9943,0.001636463,0.0005622524,0.0007520067,0.002262404,0.0004868196],"domain_scores_gemma":[0.9938905,0.00241552,0.0001643528,0.00294952,0.0004436298,0.0001364677],"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.0001867405,0.0001027814,0.0001773123,0.0003473495,0.0000642471,0.0001262523,0.0004949862,0.007334504,0.002952109,0.8174117,0.01862432,0.1521778],"study_design_scores_gemma":[0.00002487313,0.00001643226,0.00005470603,0.00005754122,0.00002244039,0.000126494,0.00003622727,0.01588007,0.00501396,0.9588994,0.01983436,0.00003335013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004187872,0.0008426269,0.9763851,0.002475663,0.0006065313,0.0001454736,0.0002356738,0.002010219,0.01311078],"genre_scores_gemma":[0.2648452,0.002328581,0.6943412,0.001540699,0.0007522654,0.0004692303,0.001213623,0.002480853,0.03202839],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01150965,"threshold_uncertainty_score":0.03850365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2514893051","doi":"10.1145/2976749.2978425","title":"Frodo","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":300,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Learning with errors; Computer science; Key exchange; Cryptography; Protocol (science); Ideal (ethics); Theoretical computer science; Encryption; Cryptographic primitive; Quantum; Quantum computer; Cryptographic protocol; Key (lock); Computation; Public-key cryptography; Computer security; Algorithm","authors":[{"name":"Joppe W. Bos","is_ca":false},{"name":"Craig Costello","is_ca":false},{"name":"Léo Ducas","is_ca":false},{"name":"Ilya Mironov","is_ca":false},{"name":"Michael Naehrig","is_ca":false},{"name":"Valeria Nikolaenko","is_ca":false},{"name":"Ananth Raghunathan","is_ca":false},{"name":"Douglas Stebila","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008075333001502117,"gpt":0.2018218456617459,"spread":0.1937465126602438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007841266,0.001176629,0.0008172141,0.001607049,0.001997384,0.003915534,0.001710655,0.002084678,0.5925826],"category_scores_gemma":[0.002377554,0.0004892623,0.0007015744,0.001074438,0.0008129803,0.003406882,0.003949252,0.002283798,0.4875277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001345153,"about_ca_system_score_gemma":0.001407135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003165479,"about_ca_topic_score_gemma":0.00342927,"domain_scores_codex":[0.9990895,0.00009762628,0.00004575726,0.0002940724,0.000337284,0.0001357689],"domain_scores_gemma":[0.9990295,0.000116668,0.00007681162,0.0002618587,0.0002722769,0.0002428694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004725106,0.0001657871,0.001368706,0.0008723076,0.00003578948,0.0005578144,0.0003772896,0.0006438444,0.005625308,0.06836636,0.5329304,0.3885839],"study_design_scores_gemma":[0.00002913304,0.00003518568,0.000421485,0.0001046802,0.000007333784,0.0002413658,0.00006200455,0.0003826321,0.0008433161,0.004643678,0.9932141,0.00001493928],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005069361,0.003585136,0.01691739,0.005381875,0.003101635,0.0003821158,0.01071704,0.01095693,0.9438885],"genre_scores_gemma":[0.03931516,0.003687027,0.01455178,0.003665335,0.0009106296,0.00033602,0.01371306,0.003499079,0.920322],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4074174,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1572330878","doi":"10.1007/3-540-47721-7_17","title":"All-or-Nothing Disclosure of Secrets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Nothing; Internet privacy; Computer science; Business; Philosophy; Epistemology","authors":[{"name":"Gilles Brassard","is_ca":true},{"name":"Claude Crépeau","is_ca":true},{"name":"Jean‐Marc Robert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03114779796906828,"gpt":0.278129350780815,"spread":0.2469815528117467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487869,0.0005890887,0.0005168996,0.0005659673,0.0009892767,0.003256106,0.001314209,0.001445741,0.009966053],"category_scores_gemma":[0.00653929,0.0004295562,0.0005853441,0.0008896615,0.002800164,0.008403857,0.00278479,0.002037317,0.003340028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006076417,"about_ca_system_score_gemma":0.0008461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001205083,"about_ca_topic_score_gemma":0.0001478527,"domain_scores_codex":[0.9980457,0.0004747864,0.0001299502,0.0003145094,0.0007223394,0.0003127582],"domain_scores_gemma":[0.9952043,0.001244285,0.0003334154,0.002798643,0.0002978118,0.000121625],"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.0001806561,0.0000636289,0.0007838414,0.0002367485,0.00004571842,0.0002644404,0.0005955072,0.002004507,0.004407987,0.8331001,0.01733585,0.140981],"study_design_scores_gemma":[0.0000287369,0.00009015331,0.0005550782,0.0002032146,0.00007709309,0.001653563,0.000261934,0.008003752,0.02170302,0.839554,0.1278165,0.00005284769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0879606,0.00841593,0.3835952,0.01464803,0.002405125,0.0001825221,0.001035502,0.001595541,0.5001615],"genre_scores_gemma":[0.8316373,0.005051919,0.02683484,0.001462006,0.0009136748,0.00008760631,0.0004663698,0.0002242865,0.1333221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009966053,"threshold_uncertainty_score":0.03333974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W65414435","doi":"10.1007/978-3-642-32009-5_11","title":"Functional Encryption with Bounded Collusions via Multi-party Computation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":290,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computation; Encryption; Bounded function; Functional encryption; Theoretical computer science; Distributed computing; Secure multi-party computation; Computer security; Algorithm; Mathematics; Ciphertext","authors":[{"name":"S. Gorbunov","is_ca":true},{"name":"Vinod Vaikuntanathan","is_ca":true},{"name":"Hoeteck Wee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02381885422453816,"gpt":0.2427579886217169,"spread":0.2189391343971787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304237,0.00108827,0.001432093,0.0008350788,0.001304867,0.00284133,0.001680013,0.00189486,0.005089595],"category_scores_gemma":[0.007018306,0.0006641608,0.001504092,0.001166164,0.003060632,0.007162962,0.006389819,0.004135879,0.001564483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001274572,"about_ca_system_score_gemma":0.0007866001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001620429,"about_ca_topic_score_gemma":0.000151858,"domain_scores_codex":[0.9956351,0.001511859,0.000256799,0.0004634649,0.001496437,0.0006363446],"domain_scores_gemma":[0.9946089,0.002707471,0.0002847489,0.001956906,0.0003009982,0.0001409115],"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.0002598924,0.00005266044,0.0001461187,0.0001441311,0.00004050957,0.0002203275,0.0001770862,0.0254509,0.00608233,0.9344099,0.001866924,0.03114924],"study_design_scores_gemma":[0.00004913423,0.00008558764,0.0000922656,0.00003851436,0.00002597995,0.0003111187,0.00002786976,0.2136218,0.008340146,0.7744703,0.002901474,0.00003586238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02821779,0.0005039634,0.9531846,0.0007085383,0.0001329957,0.0001152288,0.00007764677,0.0004997903,0.01655954],"genre_scores_gemma":[0.8888409,0.0004852158,0.09830495,0.0002325634,0.0001548023,0.0002378511,0.0001046455,0.0001428601,0.01149621],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005089595,"threshold_uncertainty_score":0.01702636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147096042","doi":"10.1109/tdsc.2015.2406704","title":"Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":275,"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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Upload; Encryption; Server; Relevance (law); Information retrieval; Usability; Database; Data mining; Computer security; World Wide Web","authors":[{"name":"Hongwei Li","is_ca":false},{"name":"Yi Yang","is_ca":false},{"name":"Tom H. Luan","is_ca":false},{"name":"Xiaohui Liang","is_ca":false},{"name":"Liang Zhou","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08650531738753572,"gpt":0.3112842504318411,"spread":0.2247789330443054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150316,0.0004605122,0.001362295,0.001159442,0.0007680148,0.001724188,0.001190541,0.0008651126,0.00182001],"category_scores_gemma":[0.005602187,0.0002842934,0.000680365,0.002378874,0.0007465378,0.005788508,0.003193462,0.0009358503,0.001249946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008130555,"about_ca_system_score_gemma":0.001652156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001675004,"about_ca_topic_score_gemma":0.001874967,"domain_scores_codex":[0.997268,0.0004821637,0.0004620899,0.0004180977,0.0009568243,0.0004128777],"domain_scores_gemma":[0.9944217,0.001442776,0.0006691289,0.00235619,0.0008283594,0.0002817921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003883257,0.0007388895,0.008767775,0.0013007,0.0003169815,0.001548717,0.002050207,0.05981142,0.2660198,0.08083536,0.01216241,0.5625646],"study_design_scores_gemma":[0.0003596477,0.00101255,0.003371296,0.0001039362,0.0001817286,0.003948588,0.001511351,0.7049803,0.2004911,0.06213243,0.0216778,0.0002293067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2512833,0.002235382,0.737183,0.0005566169,0.0001260092,0.0004939297,0.001443299,0.001647539,0.005030875],"genre_scores_gemma":[0.8287355,0.0007077953,0.165789,0.0001765994,0.00006917861,0.0001141392,0.001010318,0.0000798271,0.003317794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00182001,"threshold_uncertainty_score":0.006088495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017126829","doi":"10.1109/icc.2012.6364125","title":"Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":265,"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":"Computer science; Cloud computing; Server; Encryption; Verifiable secret sharing; Computer security; Outsourcing; Download; Information privacy; Security analysis; Client-side encryption; Computer network; World Wide Web; On-the-fly encryption; Operating system","authors":[{"name":"Qi Chai","is_ca":true},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02246958670426611,"gpt":0.2568745365771847,"spread":0.2344049498729186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005501286,0.0004629008,0.001220313,0.0006556707,0.001365924,0.002748007,0.001943522,0.00164854,0.002217047],"category_scores_gemma":[0.01060846,0.0004987914,0.0009772442,0.0007999372,0.002560139,0.006481495,0.003240514,0.002107906,0.0005497081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002523339,"about_ca_system_score_gemma":0.003309661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001140996,"about_ca_topic_score_gemma":0.0009290287,"domain_scores_codex":[0.994108,0.002020548,0.0005044824,0.0005516417,0.001911093,0.0009043288],"domain_scores_gemma":[0.9867117,0.005943171,0.001663893,0.004451552,0.0008440157,0.0003856352],"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.002245656,0.0003378926,0.002858405,0.0004460739,0.000174431,0.001295981,0.001451241,0.1905893,0.06204765,0.6793476,0.003338984,0.05586679],"study_design_scores_gemma":[0.0002669083,0.0002005733,0.0004765381,0.00004265083,0.00006557321,0.0004400612,0.0001313541,0.830726,0.02650828,0.137758,0.003322124,0.00006189194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1584032,0.0005820496,0.8337997,0.001601837,0.00007159164,0.0002562314,0.0001941349,0.0005603872,0.004530822],"genre_scores_gemma":[0.9497756,0.0001814249,0.04712209,0.0001278415,0.00004466953,0.0001213038,0.00008773705,0.00003400613,0.00250521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005501286,"threshold_uncertainty_score":0.02909392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056634932","doi":"10.1145/1866835.1866845","title":"Privacy preserving EHR system using attribute-based infrastructure","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":256,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Alberta Innovates - Technology Futures","keywords":"Computer science; Cloud computing; Scalability; Computer security; Cryptography; Construct (python library); Information privacy; Task (project management); Service provider; Service (business); Database; Computer network","authors":[{"name":"Shivaramakrishnan Narayan","is_ca":true},{"name":"Martin Gagné","is_ca":true},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01324287000225734,"gpt":0.2418667009600764,"spread":0.2286238309578191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002914224,0.0002733102,0.0007132008,0.0006918985,0.001014249,0.002510645,0.001780685,0.001066086,0.00239406],"category_scores_gemma":[0.003680774,0.0003410857,0.000578814,0.001188605,0.0007557105,0.005552254,0.004392524,0.00168715,0.001564139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008483495,"about_ca_system_score_gemma":0.001510549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005038939,"about_ca_topic_score_gemma":0.0002173856,"domain_scores_codex":[0.997377,0.0006898018,0.0003179763,0.0003524331,0.0009295453,0.0003332382],"domain_scores_gemma":[0.9963273,0.0005859094,0.0004251549,0.001988793,0.0004167102,0.0002559728],"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.003600772,0.001179661,0.0111236,0.0005181464,0.0003829855,0.002915632,0.001607989,0.06731614,0.1392017,0.3928298,0.02623064,0.3530929],"study_design_scores_gemma":[0.0007892058,0.0009475801,0.003935876,0.0001001365,0.0003199274,0.003495927,0.000379307,0.6444485,0.1616418,0.1122489,0.07143056,0.0002623399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08524464,0.0006449569,0.894401,0.001891864,0.0001830098,0.0003188134,0.0003470532,0.009321705,0.007646955],"genre_scores_gemma":[0.8806486,0.0003882169,0.1139606,0.0002625112,0.00009591784,0.0001192465,0.0004491958,0.0000922901,0.003983483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002914224,"threshold_uncertainty_score":0.01541203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2801491268","doi":"10.1515/popets-2018-0024","title":"Privacy-preserving Machine Learning as a Service","year":2018,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":255,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Center for Discrete Mathematics and Theoretical Computer Science; National Science Foundation","keywords":"Computer science; Homomorphic encryption; Encryption; Cloud computing; Machine learning; Artificial intelligence; Artificial neural network; Deep learning; Domain (mathematical analysis); Information privacy; Service provider; Raw data; Service (business); Data mining; Computer security","authors":[{"name":"Ehsan Hesamifard","is_ca":false},{"name":"Hassan Takabi","is_ca":false},{"name":"Mehdi Ghasemi","is_ca":true},{"name":"Rebecca N. Wright","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01662893650988808,"gpt":0.2558164311824623,"spread":0.2391874946725742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003091524,0.0006072486,0.0009613901,0.0008576461,0.001086555,0.002234174,0.001514936,0.001524346,0.003849978],"category_scores_gemma":[0.008522593,0.0003136855,0.000674089,0.0017186,0.001678303,0.004537273,0.00301779,0.002897348,0.001293149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812297,"about_ca_system_score_gemma":0.00238016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009278428,"about_ca_topic_score_gemma":0.0006465199,"domain_scores_codex":[0.9947916,0.001795586,0.0003192337,0.0005191924,0.001922204,0.0006522008],"domain_scores_gemma":[0.990348,0.002711674,0.0008371227,0.005038556,0.0008329371,0.0002317631],"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.002253078,0.000808087,0.004262608,0.0003951835,0.0001684644,0.001104394,0.0003476815,0.2919326,0.02584081,0.3541614,0.02593668,0.292789],"study_design_scores_gemma":[0.00008817323,0.00008222467,0.0002959163,0.0000244474,0.0000146131,0.0002960219,0.00005266384,0.8908822,0.01727949,0.0846348,0.00632514,0.00002430501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08266494,0.0008437606,0.8969533,0.003889486,0.0002493143,0.0002475028,0.0007115389,0.003884048,0.01055596],"genre_scores_gemma":[0.9455435,0.0002986728,0.04988483,0.0004426935,0.0001222203,0.0001195262,0.0003063307,0.00007592113,0.003206225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003849978,"threshold_uncertainty_score":0.01634979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2801958627","doi":"10.2196/medinform.8805","title":"Secure Logistic Regression Based on Homomorphic Encryption: Design and Evaluation","year":2018,"lang":"en","type":"article","venue":"JMIR Medical Informatics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":247,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Institute of General Medical Sciences; National Institute of Biomedical Imaging and Bioengineering; National Human Genome Research Institute; National Research Foundation of Korea; National Research Foundation","keywords":"Homomorphic encryption; Computer science; Encryption; Logistic regression; Machine learning; Cloud computing; Discriminative model; Support vector machine; Computation; Data mining; Artificial intelligence; Outsourcing; Classifier (UML); Algorithm; Computer security","authors":[{"name":"Miran Kim","is_ca":false},{"name":"Yongsoo Song","is_ca":false},{"name":"Shuang Wang","is_ca":false},{"name":"Yuhou Xia","is_ca":false},{"name":"Xiaoqian Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05255794342517325,"gpt":0.3334524473528274,"spread":0.2808945039276542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003690063,0.000745469,0.0009143213,0.0006173601,0.0003214038,0.001260511,0.002199714,0.0009544839,0.0033338],"category_scores_gemma":[0.008720457,0.000372369,0.0004875373,0.0005829761,0.0007191679,0.002161703,0.001418484,0.001055962,0.001195311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204084,"about_ca_system_score_gemma":0.001299493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001288918,"about_ca_topic_score_gemma":0.0006208787,"domain_scores_codex":[0.9970698,0.001109022,0.0001468405,0.0002964807,0.001133258,0.0002446282],"domain_scores_gemma":[0.9959037,0.001653158,0.0004394807,0.0008519134,0.0009442698,0.0002075144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003568576,0.001420534,0.007010076,0.0009230648,0.0003458593,0.0006904146,0.0001446015,0.5862992,0.02006319,0.01994442,0.006751638,0.3528385],"study_design_scores_gemma":[0.0001635482,0.0005643083,0.0003415363,0.00001328217,0.00002992487,0.0001949632,0.00001747004,0.9874207,0.008927232,0.001383894,0.0009284175,0.00001476955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1974242,0.002011867,0.7883007,0.001046921,0.0001374172,0.000958919,0.0002139346,0.00430473,0.005601278],"genre_scores_gemma":[0.8657269,0.0009397728,0.130449,0.0001491486,0.00003628685,0.0003240963,0.0002040047,0.0001383031,0.002032429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003690063,"threshold_uncertainty_score":0.01951516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125871822","doi":"10.1109/trustcom.2011.15","title":"DACC: Distributed Access Control in Clouds","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":220,"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":"Computer science; Encryption; Cloud computing; Revocation; Access control; Key (lock); Attribute-based encryption; Cloud storage; Functional encryption; Matching (statistics); Scheme (mathematics); Computer network; Set (abstract data type); Database; Computer security; Public-key cryptography; Ciphertext; Overhead (engineering); Operating system","authors":[{"name":"Sushmita Ruj","is_ca":true},{"name":"Amiya Nayak","is_ca":true},{"name":"Ivan Stojmenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03762996186804547,"gpt":0.2619045826058696,"spread":0.2242746207378242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003725223,0.000718117,0.00139537,0.00130415,0.002047945,0.004464458,0.003487999,0.001387521,0.003176111],"category_scores_gemma":[0.004596601,0.0004067991,0.0009174052,0.00251529,0.002295841,0.006317513,0.004437122,0.002013543,0.001121023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003195199,"about_ca_system_score_gemma":0.004327771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004957242,"about_ca_topic_score_gemma":0.002233524,"domain_scores_codex":[0.992897,0.001518476,0.0005643112,0.0008950247,0.003132729,0.0009924183],"domain_scores_gemma":[0.9949926,0.0008184034,0.0005191477,0.002084257,0.00104576,0.0005397834],"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.0009276535,0.0003236048,0.001886553,0.0004884863,0.00014246,0.000481037,0.0004729348,0.08931956,0.01207621,0.7056198,0.02570782,0.162554],"study_design_scores_gemma":[0.0002476469,0.0003211685,0.0004696524,0.00008089711,0.00008208254,0.0007865813,0.0001621471,0.7269907,0.0145881,0.1535022,0.1026401,0.0001287127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0116303,0.0010385,0.9768743,0.001165466,0.0003570171,0.0005034315,0.0002440349,0.002028254,0.006158645],"genre_scores_gemma":[0.7057787,0.001323662,0.2810233,0.0007983283,0.0004497701,0.0006261597,0.0005394169,0.0001653894,0.009295307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004957242,"threshold_uncertainty_score":0.02318287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102859083","doi":"10.1109/jsac.2009.090502","title":"Sage: a strong privacy-preserving scheme against global eavesdropping for ehealth systems","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Ontario Tech University","funders":"","keywords":"Eavesdropping; Computer science; eHealth; Adversary; Scheme (mathematics); Software deployment; Computer security; Information privacy; Cryptography; Internet privacy; Health care","authors":[{"name":"Xiaodong Lin","is_ca":true},{"name":"Rongxing Lu","is_ca":true},{"name":"Xuemin Shen","is_ca":true},{"name":"Y. Nemoto","is_ca":false},{"name":"Nei Kato","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04570417879071471,"gpt":0.3370362626392936,"spread":0.2913320838485789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002907322,0.0008323506,0.001055791,0.0009003815,0.001019867,0.001390441,0.001229424,0.001633793,0.001603678],"category_scores_gemma":[0.005855512,0.0003115973,0.0009626357,0.0009458061,0.00216639,0.003808843,0.005098089,0.002159184,0.0007019723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005221594,"about_ca_system_score_gemma":0.001040756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001802783,"about_ca_topic_score_gemma":0.000191264,"domain_scores_codex":[0.9966664,0.001271781,0.0002405428,0.0003331393,0.001121774,0.0003663278],"domain_scores_gemma":[0.9952485,0.001763286,0.0006079878,0.001658287,0.0004705726,0.0002514042],"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.002360116,0.0002567172,0.002296035,0.0009857849,0.0004382434,0.001852093,0.001788054,0.1598191,0.1495217,0.4308369,0.01033367,0.2395117],"study_design_scores_gemma":[0.0004633332,0.001784744,0.00128645,0.0001821185,0.0003170561,0.003086697,0.0004669727,0.6476907,0.1102126,0.1882886,0.04592172,0.0002990946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03321448,0.0007192671,0.9587056,0.0008260716,0.000184826,0.0002147063,0.0001235731,0.0008753325,0.005136251],"genre_scores_gemma":[0.8762312,0.0006424019,0.1171818,0.0005299965,0.0001851439,0.0002173678,0.0001939174,0.00004419879,0.004773957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002907322,"threshold_uncertainty_score":0.01537555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1590453572","doi":"10.1007/978-3-642-40084-1_30","title":"How to Run Turing Machines on Encrypted Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":213,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Encryption; Homomorphic encryption; Cryptography; Theoretical computer science; Turing machine; Functional encryption; Algorithm; Computer security; Ciphertext; Computation","authors":[{"name":"Shafi Goldwasser","is_ca":false},{"name":"Yael Tauman Kalai","is_ca":false},{"name":"Raluca Ada Popa","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":true},{"name":"Nickolai Zeldovich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02802479393924267,"gpt":0.251666548258778,"spread":0.2236417543195353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000687801,0.0006832012,0.0006153337,0.0004124335,0.000889551,0.002670748,0.0008894577,0.001364346,0.01796273],"category_scores_gemma":[0.005349747,0.0006972396,0.001019713,0.0005103778,0.001641287,0.006707633,0.002067148,0.002734607,0.009015583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005119548,"about_ca_system_score_gemma":0.0007788389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005804042,"about_ca_topic_score_gemma":0.0006466617,"domain_scores_codex":[0.9992206,0.0002001538,0.00006688925,0.000115402,0.0002892269,0.0001076558],"domain_scores_gemma":[0.9986659,0.000547936,0.00003939828,0.0005204845,0.0001735948,0.00005267177],"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.0001304181,0.00007837029,0.000558953,0.0006571605,0.0001175605,0.0002894682,0.0007512904,0.01806531,0.01440727,0.6177181,0.05743376,0.2897924],"study_design_scores_gemma":[0.000030188,0.00002764118,0.0001651882,0.0001198532,0.00003993623,0.0002818672,0.0001417384,0.045502,0.02331661,0.825659,0.1046754,0.00004051897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01499255,0.0008826233,0.9117914,0.003702413,0.001178274,0.000178166,0.0004905029,0.008702374,0.0580816],"genre_scores_gemma":[0.2432887,0.001424671,0.6764625,0.001133174,0.0003664951,0.0004177812,0.001140098,0.004596835,0.07116974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01796273,"threshold_uncertainty_score":0.06009132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096113448","doi":"10.1007/978-3-642-02384-2_13","title":"Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":211,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Credential; Scheme (mathematics); Computer science; Merkle signature scheme; Signature (topology); Computer security; Issuer; Authentication (law); Schnorr signature; Blind signature; Digital signature; Theoretical computer science; Mathematics; Hash function","authors":[{"name":"Siamak F. Shahandashti","is_ca":false},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01146492847783279,"gpt":0.2295075769623096,"spread":0.2180426484844768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003640017,0.0005759199,0.001311879,0.001728304,0.001698174,0.00627596,0.002003002,0.002911255,0.00496665],"category_scores_gemma":[0.02248595,0.0008137414,0.001084938,0.005006342,0.004526759,0.00862245,0.00388467,0.005682091,0.001295316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0018617,"about_ca_system_score_gemma":0.001458493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007090126,"about_ca_topic_score_gemma":0.0004921481,"domain_scores_codex":[0.9966354,0.000986033,0.0002568561,0.0003864871,0.001511178,0.000224124],"domain_scores_gemma":[0.9896567,0.007338197,0.0004995666,0.001308596,0.000860278,0.0003367344],"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.00004326373,0.00002951397,0.00008721279,0.00005037093,0.00000754968,0.00006160379,0.0002655842,0.008691522,0.0007093275,0.9606905,0.001136937,0.02822652],"study_design_scores_gemma":[0.00001099482,0.00001628197,0.00003862754,0.00001864558,0.000007285799,0.0001012819,0.00004190625,0.07844833,0.0007574466,0.9160487,0.004489024,0.00002149368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01515427,0.002042509,0.9620447,0.000858751,0.0004419373,0.0001172144,0.00009289829,0.0004653885,0.0187823],"genre_scores_gemma":[0.5667461,0.004401634,0.402953,0.0004251637,0.001035255,0.0002726032,0.000133806,0.0002521711,0.02378033],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00627596,"threshold_uncertainty_score":0.01925045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099739670","doi":"10.1109/tetc.2014.2371239","title":"Enabling Efficient Multi-Keyword Ranked Search Over Encrypted Mobile Cloud Data Through Blind Storage","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":192,"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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Scalability; Server; Cloud storage; Leverage (statistics); Database; Information retrieval; Data mining; Computer security; Computer network; Artificial intelligence","authors":[{"name":"Hongwei Li","is_ca":false},{"name":"Dongxiao Liu","is_ca":false},{"name":"Yuanshun Dai","is_ca":false},{"name":"Tom H. Luan","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05866860787291012,"gpt":0.3325185406351731,"spread":0.273849932762263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008838258,0.0003569366,0.001059649,0.0008184676,0.0008616754,0.00161926,0.001271843,0.0007613947,0.002010439],"category_scores_gemma":[0.003611187,0.0002423687,0.0005701018,0.001809796,0.0007536283,0.004648341,0.002181091,0.0006217972,0.001013518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007317907,"about_ca_system_score_gemma":0.001704141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001929647,"about_ca_topic_score_gemma":0.001885162,"domain_scores_codex":[0.9986003,0.0002610481,0.0001460008,0.000122767,0.0006000561,0.0002698677],"domain_scores_gemma":[0.9977632,0.0006350801,0.0002543434,0.0008047582,0.0004418709,0.0001007947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003131528,0.000647211,0.004586224,0.001088477,0.000198731,0.001656797,0.001163057,0.1437898,0.2239013,0.1384478,0.0115035,0.4698856],"study_design_scores_gemma":[0.0001619729,0.0004789139,0.0007967612,0.00005660328,0.00008396,0.001718592,0.0003943929,0.8365327,0.1102321,0.0395624,0.009845433,0.0001361647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1603776,0.002284838,0.8287363,0.0004648755,0.0001234512,0.0002612233,0.0003958202,0.001681114,0.005674789],"genre_scores_gemma":[0.8878965,0.0006602185,0.1079788,0.0001091161,0.00004271059,0.00007495884,0.0001794561,0.00004896756,0.003009248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002010439,"threshold_uncertainty_score":0.00672555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W34785529","doi":"","title":"Outsourcing Multi-Party Computation.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Protocol (science); Secure two-party computation; Outsourcing; Computation; Set (abstract data type); Construct (python library); Secure multi-party computation; Standard Model (mathematical formulation); Scheme (mathematics); Computer security; Programming language; Mathematics","authors":[{"name":"Seny Kamara","is_ca":false},{"name":"Payman Mohassel","is_ca":true},{"name":"Mariana Raykova","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04780136964815156,"gpt":0.2858845172483337,"spread":0.2380831476001821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004303315,0.001013672,0.001395362,0.0007227086,0.00154357,0.003634978,0.002687411,0.001928841,0.01146801],"category_scores_gemma":[0.008896807,0.0007453567,0.001844872,0.001923465,0.003733004,0.007441579,0.007507343,0.004452041,0.002813668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002480262,"about_ca_system_score_gemma":0.002555924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007997425,"about_ca_topic_score_gemma":0.0008491183,"domain_scores_codex":[0.9928353,0.002552562,0.0004396529,0.001142191,0.002349052,0.0006811735],"domain_scores_gemma":[0.9908194,0.002661511,0.000498901,0.00522388,0.0004355694,0.0003606597],"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.00006130982,0.00004791079,0.0003085562,0.0002922555,0.00004139886,0.0001716529,0.0002131391,0.01314001,0.001631191,0.9584835,0.002925335,0.02268388],"study_design_scores_gemma":[0.00003172419,0.00006118766,0.0001836193,0.0001016134,0.00003584709,0.0003921509,0.00009538716,0.122262,0.004338286,0.8295241,0.04294891,0.00002512344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009805077,0.002123821,0.9358369,0.002941051,0.0003652565,0.0004001818,0.000357171,0.0005515987,0.04761893],"genre_scores_gemma":[0.6427596,0.00448968,0.3124824,0.001143689,0.000582651,0.0007098781,0.0007326126,0.0002332093,0.0368663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01146801,"threshold_uncertainty_score":0.03836435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2338858629","doi":"10.1145/2659897","title":"Certificate transparency","year":2014,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":166,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Apache (Canada)","funders":"","keywords":"Transparency (behavior); Computer science; Certificate; Computer security; Algorithm","authors":[{"name":"Ben Laurie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1273299418084081,"gpt":0.2974916278556979,"spread":0.1701616860472897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01041613,0.00104087,0.001623197,0.001839156,0.002456111,0.009624463,0.003610275,0.003723069,0.03153468],"category_scores_gemma":[0.07537174,0.001122243,0.001027397,0.00231079,0.003027773,0.0211423,0.009971621,0.007371455,0.01885504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002780856,"about_ca_system_score_gemma":0.009511325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001451406,"about_ca_topic_score_gemma":0.001162718,"domain_scores_codex":[0.977019,0.005239265,0.001923164,0.002797741,0.009716713,0.003304166],"domain_scores_gemma":[0.9037605,0.02188907,0.004417015,0.05575146,0.01190356,0.002278418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002193137,0.0003735923,0.003737828,0.0006992299,0.0001006865,0.0007975452,0.0009199994,0.005909391,0.009023492,0.7311547,0.1434974,0.1015931],"study_design_scores_gemma":[0.0004833661,0.0002253609,0.00106887,0.0003878062,0.0001385924,0.001429358,0.000448789,0.0313944,0.03812983,0.6575138,0.268608,0.0001717313],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03817343,0.002452218,0.6460698,0.01792279,0.003541642,0.001801992,0.02072824,0.04539278,0.2239171],"genre_scores_gemma":[0.8482567,0.001356591,0.05182228,0.002884221,0.00101356,0.0008803107,0.01101961,0.002787637,0.07997911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03153468,"threshold_uncertainty_score":0.105494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095677682","doi":"10.1109/tsg.2012.2224389","title":"A Decentralized Security Framework for Data Aggregation and Access Control in Smart Grids","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Smart Grid","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":166,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Smart grid; Encryption; Computer science; Access control; Computer network; Data aggregator; Cryptography; Homomorphic encryption; Computer security; Data security; Attribute-based encryption; Public-key cryptography; Engineering; Wireless sensor network","authors":[{"name":"Sushmita Ruj","is_ca":false},{"name":"Amiya Nayak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03327745325759631,"gpt":0.2986537949778276,"spread":0.2653763417202313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00305948,0.0005484505,0.0009496803,0.0009192247,0.001641852,0.002392108,0.001719889,0.001490406,0.002090168],"category_scores_gemma":[0.001945715,0.0004590253,0.001233773,0.0008416609,0.001924481,0.003764274,0.002785262,0.00213522,0.0006448624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001933418,"about_ca_system_score_gemma":0.002775742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002216614,"about_ca_topic_score_gemma":0.002116579,"domain_scores_codex":[0.9972547,0.0006872641,0.0002331867,0.0004397438,0.001161519,0.0002237032],"domain_scores_gemma":[0.998518,0.000373328,0.0001725128,0.000414531,0.0003565223,0.0001650777],"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.00007779419,0.0001050158,0.0004474011,0.0001435989,0.00006082307,0.000413673,0.0004184172,0.06929434,0.007918282,0.8763052,0.00516471,0.03965072],"study_design_scores_gemma":[0.0001282639,0.0001720013,0.0004036328,0.00008669646,0.00007400811,0.0005901187,0.0001516328,0.6281192,0.006367183,0.2750305,0.08879088,0.00008587859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00410764,0.0002818038,0.9908703,0.0006229213,0.00008830766,0.0001413547,0.0000512349,0.0004841817,0.003352273],"genre_scores_gemma":[0.4164197,0.0008594437,0.5707427,0.0004216191,0.0004071364,0.0007773102,0.0003136511,0.0001068612,0.009951569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00305948,"threshold_uncertainty_score":0.01618028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949495942","doi":"10.1109/tcc.2019.2923222","title":"Blockchain-Assisted Public-Key Encryption with Keyword Search Against Keyword Guessing Attacks for Cloud Storage","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":165,"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":"National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China; Brander Beacons Cancer Research","keywords":"Computer science; Encryption; Computer security; Key (lock); Server; Public-key cryptography; Cloud storage; Cloud computing; Outsourcing; Cryptography; Computer network; Operating system","authors":[{"name":"Yuan Zhang","is_ca":true},{"name":"Chunxiang Xu","is_ca":false},{"name":"Jianbing Ni","is_ca":true},{"name":"Hongwei Li","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02949962545518827,"gpt":0.2660163876203529,"spread":0.2365167621651646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352491,0.000403496,0.000856833,0.0005531932,0.0009885281,0.001046251,0.00113212,0.0009671298,0.002838832],"category_scores_gemma":[0.003838374,0.0002718968,0.0003762656,0.001092078,0.001109362,0.00420219,0.002778106,0.001029917,0.0008462488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00100735,"about_ca_system_score_gemma":0.002581223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009261796,"about_ca_topic_score_gemma":0.001020778,"domain_scores_codex":[0.9982083,0.0004584787,0.0001286275,0.000184749,0.0007077359,0.0003120708],"domain_scores_gemma":[0.9966154,0.0009793733,0.0004270449,0.001289139,0.0004951351,0.0001939293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002902846,0.0004805536,0.004342442,0.0007493239,0.0002027935,0.001284852,0.0008182654,0.3472705,0.09933606,0.2484336,0.0107396,0.2834392],"study_design_scores_gemma":[0.0001537801,0.0003195,0.0004023593,0.00004157272,0.00003746202,0.0005752592,0.0001069498,0.8875338,0.03551789,0.06896567,0.006293403,0.00005238691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1808998,0.001974327,0.804149,0.001236322,0.0001782869,0.0003747885,0.0003409912,0.001820083,0.009026414],"genre_scores_gemma":[0.9803481,0.0002899939,0.01729975,0.0000574832,0.00002719292,0.00007235583,0.00009918906,0.0000223424,0.001783548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002838832,"threshold_uncertainty_score":0.009496808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123389487","doi":"10.1504/ijsn.2011.043666","title":"ESPAC: Enabling Security and Patient-centric Access Control for eHealth in cloud computing","year":2011,"lang":"en","type":"article","venue":"International Journal of Security and Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":149,"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":"eHealth; Computer science; Cloud computing; Access control; Cloud computing security; Computer security; Control (management); Operating system; Health care; Artificial intelligence","authors":[{"name":"Mrinmoy Barua","is_ca":true},{"name":"Xiaohui Liang","is_ca":true},{"name":"Rongxing Lu","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01909033418894395,"gpt":0.2731349774530039,"spread":0.2540446432640599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003779099,0.0005295562,0.0007350203,0.0006478359,0.001038469,0.001913037,0.001848266,0.0009117376,0.001629957],"category_scores_gemma":[0.003523788,0.0002103086,0.0005930354,0.001170378,0.001327289,0.003136,0.003372889,0.001277279,0.0004242561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009939196,"about_ca_system_score_gemma":0.002233705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002067354,"about_ca_topic_score_gemma":0.001679642,"domain_scores_codex":[0.9967371,0.001149558,0.0001958325,0.0003389492,0.0009584615,0.0006201535],"domain_scores_gemma":[0.9974582,0.000735627,0.0002774754,0.000762337,0.0005481432,0.0002181855],"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.001290381,0.0004808992,0.006647364,0.0007235049,0.0002285946,0.001487624,0.0008189473,0.1786647,0.04442388,0.3815146,0.01361287,0.3701066],"study_design_scores_gemma":[0.00009823364,0.000391651,0.001468514,0.00006292165,0.00007695703,0.00136999,0.000340511,0.8811464,0.02501344,0.06998985,0.01996499,0.00007653049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04233246,0.001018456,0.9503759,0.001030827,0.0001584763,0.0003722381,0.0001442756,0.0006813231,0.003886012],"genre_scores_gemma":[0.8338256,0.0006674711,0.1619619,0.0003314634,0.0001362394,0.0001331837,0.0001790486,0.00002717215,0.002737871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003779099,"threshold_uncertainty_score":0.01998603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3158731422","doi":"10.1109/jbhi.2021.3075995","title":"An Efficient Ciphertext-Policy Weighted Attribute-Based Encryption for the Internet of Health Things","year":2021,"lang":"en","type":"article","venue":"IEEE Journal of Biomedical and Health Informatics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"Japan Society for the Promotion of Science; National Natural Science Foundation of China","keywords":"Encryption; Scheme (mathematics); The Internet; Internet of Things; Security analysis; Attribute-based encryption; Coding (social sciences); Cryptography","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03604034266255726,"gpt":0.330014678386462,"spread":0.2939743357239047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001186733,0.0003570321,0.0005976458,0.000519418,0.0007571952,0.0009533996,0.0009951034,0.0005589736,0.00133921],"category_scores_gemma":[0.002866499,0.0001865505,0.0005860534,0.001133524,0.0006965755,0.002993437,0.001777062,0.001216258,0.0005564375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008764572,"about_ca_system_score_gemma":0.001242906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005581668,"about_ca_topic_score_gemma":0.0004599454,"domain_scores_codex":[0.997856,0.0005714053,0.0002114599,0.0002448988,0.0008858936,0.0002303457],"domain_scores_gemma":[0.9987895,0.0003027751,0.0001748572,0.0003988221,0.0002581204,0.00007588207],"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.0009336757,0.0002960286,0.001549583,0.0004248976,0.0001069587,0.001159594,0.0007777523,0.06591012,0.1166326,0.5729099,0.0122932,0.2270057],"study_design_scores_gemma":[0.000228598,0.0005205336,0.001237725,0.0001077624,0.0001095354,0.002536563,0.0002288703,0.7396762,0.09016244,0.1245272,0.04046286,0.000201727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02964826,0.0004343597,0.9641164,0.0005479211,0.0001676832,0.0002657348,0.000185308,0.0003141093,0.004320216],"genre_scores_gemma":[0.7762978,0.0005682031,0.2159097,0.0003163269,0.0001078539,0.000259365,0.000380214,0.00004646683,0.006114019],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00133921,"threshold_uncertainty_score":0.00635916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010302109","doi":"10.1109/tpds.2014.2380373","title":"Secure and Verifiable Policy Update Outsourcing for Big Data Access Control in the Cloud","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":135,"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":"Research Grants Council, University Grants Committee; National Science Foundation","keywords":"Computer science; Cloud computing; Access control; Encryption; Outsourcing; Overhead (engineering); Big data; Computer security; Data access; Construct (python library); Volume (thermodynamics); Database; Computer network; Distributed computing; Data mining; Operating system","authors":[{"name":"Kan Yang","is_ca":true},{"name":"Xiaohua Jia","is_ca":false},{"name":"Kui Ren","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04324047064942231,"gpt":0.2792164425248126,"spread":0.2359759718753903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002722373,0.0004140453,0.001047587,0.0005381831,0.001418399,0.002338648,0.001355299,0.0008207049,0.001242291],"category_scores_gemma":[0.006435687,0.0003581923,0.0007039855,0.0009389544,0.001783174,0.004459925,0.002619354,0.001893847,0.0003764254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001934461,"about_ca_system_score_gemma":0.003599707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002631814,"about_ca_topic_score_gemma":0.001628689,"domain_scores_codex":[0.9945887,0.001150403,0.0003981121,0.0006560711,0.002401747,0.0008049567],"domain_scores_gemma":[0.993658,0.001363903,0.0008068972,0.002965941,0.0008337563,0.0003714506],"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.002081938,0.0007058939,0.005307444,0.0003495566,0.0001794415,0.001461927,0.001372657,0.1682672,0.06474643,0.4630879,0.008919095,0.2835206],"study_design_scores_gemma":[0.0001088454,0.0001250904,0.0008084301,0.00003056761,0.00004748875,0.0004501583,0.0001580987,0.8885769,0.03136373,0.0719734,0.006296277,0.0000609638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07404338,0.000654584,0.9182714,0.0008329296,0.0001717708,0.0002959332,0.0001226633,0.001116112,0.004491193],"genre_scores_gemma":[0.940041,0.0002733913,0.05742071,0.0001360792,0.0000831883,0.00009013374,0.00008190913,0.00004708825,0.001826657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002722373,"threshold_uncertainty_score":0.01439744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953289753","doi":"10.1109/tvlsi.2019.2922999","title":"Optimized Schoolbook Polynomial Multiplication for Compact Lattice-Based Cryptography on FPGA","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; Six Talent Peaks Project in Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Field-programmable gate array; Computer science; Lattice-based cryptography; Speedup; Cryptography; Multiplication (music); Throughput; Parallel computing; Computer hardware; Algorithm; Mathematics; Quantum; Quantum cryptography; Physics; Quantum information","authors":[{"name":"Weiqiang Liu","is_ca":false},{"name":"Sailong Fan","is_ca":false},{"name":"Ayesha Khalid","is_ca":false},{"name":"Ciara Rafferty","is_ca":false},{"name":"Máire O׳Neill","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01530187227589272,"gpt":0.2526773690943855,"spread":0.2373754968184928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001466146,0.0004601383,0.000361183,0.0003761336,0.0003127237,0.0006458557,0.0005922249,0.0002426142,0.004755035],"category_scores_gemma":[0.0003270105,0.0001546843,0.0002394854,0.0005290391,0.0002207663,0.000727903,0.0003123537,0.0004081828,0.00145044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005995958,"about_ca_system_score_gemma":0.0008221955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006748748,"about_ca_topic_score_gemma":0.001635376,"domain_scores_codex":[0.999803,0.00003419495,0.00001212903,0.00002429808,0.00008763152,0.00003871168],"domain_scores_gemma":[0.9998405,0.00003583663,0.00002878107,0.00004064529,0.00003912997,0.00001518882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001288176,0.0002361517,0.001660201,0.0006719924,0.000103816,0.0005959194,0.0001356543,0.07559013,0.4353988,0.06505444,0.01560892,0.4036557],"study_design_scores_gemma":[0.00041566,0.002443718,0.002350302,0.0001124678,0.0001275038,0.001974114,0.0001184579,0.4794904,0.4053343,0.01207799,0.09543236,0.0001227698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2889356,0.00197797,0.6603856,0.0004823558,0.0002569727,0.000316698,0.0004596578,0.004979278,0.04220583],"genre_scores_gemma":[0.675435,0.0004771183,0.3159652,0.000122442,0.00005611275,0.0001273407,0.0003949579,0.0001136113,0.007308192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004755035,"threshold_uncertainty_score":0.01590723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973079148","doi":"10.1109/focs.2011.98","title":"Computing Blindfolded: New Developments in Fully Homomorphic Encryption","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Holy Grail; Cryptography; Scheme (mathematics); Theoretical computer science; Homomorphic secret sharing; Computer security; Mathematics; Secure multi-party computation; World Wide Web","authors":[{"name":"Vinod Vaikuntanathan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05197287695405777,"gpt":0.2297380351051167,"spread":0.1777651581510589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00381621,0.0007742351,0.0008492469,0.001548221,0.001022064,0.003076777,0.001531204,0.001595058,0.003505945],"category_scores_gemma":[0.007664648,0.0005841734,0.00100803,0.001757415,0.005282978,0.01419786,0.004312319,0.004803997,0.001204366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001408076,"about_ca_system_score_gemma":0.0007249971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004479158,"about_ca_topic_score_gemma":0.0002836729,"domain_scores_codex":[0.9975146,0.000736021,0.0001699116,0.0003899725,0.0009845044,0.0002050467],"domain_scores_gemma":[0.9962393,0.001860772,0.0001388427,0.001121972,0.0004674668,0.000171711],"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.00006053977,0.00002795642,0.000135638,0.0001310589,0.000011519,0.0001094953,0.0001673985,0.002842285,0.001112329,0.9329045,0.004761788,0.05773556],"study_design_scores_gemma":[0.00002090185,0.00004798952,0.00009827691,0.00008412213,0.00001070334,0.0002894724,0.00005008859,0.02022123,0.00197625,0.9422312,0.03493753,0.00003226975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02305009,0.03175346,0.875608,0.008414722,0.002243413,0.0001015977,0.0002472118,0.0008526291,0.05772899],"genre_scores_gemma":[0.4941285,0.03459541,0.4412618,0.004326395,0.00500935,0.00027827,0.0004410804,0.0004401171,0.01951912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00381621,"threshold_uncertainty_score":0.02018231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121321202","doi":"10.1016/j.dam.2011.04.021","title":"On cryptographic protocols employing asymmetric pairings — The role of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>Ψ</mml:mi></mml:math>revisited","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Type (biology); Isomorphism (crystallography); Computer science; Cryptographic protocol; Cryptographic primitive; Theoretical computer science; Mathematics; Discrete mathematics; Computer security","authors":[{"name":"Sanjit Chatterjee","is_ca":true},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0213364122456201,"gpt":0.2471069906702213,"spread":0.2257705784246012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008951223,0.001972818,0.001728034,0.002565645,0.004272332,0.007866425,0.003713906,0.005285153,0.01100059],"category_scores_gemma":[0.02052806,0.001314255,0.001680529,0.003067202,0.01438573,0.03724733,0.0111095,0.0113935,0.006385627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002970705,"about_ca_system_score_gemma":0.002243581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009437401,"about_ca_topic_score_gemma":0.0006553355,"domain_scores_codex":[0.9885069,0.005091314,0.0006705326,0.001580973,0.003106527,0.001043825],"domain_scores_gemma":[0.9820684,0.007041188,0.001030926,0.007308322,0.00200624,0.0005449663],"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.00003065527,0.00001062559,0.00003472694,0.00004297325,0.000006630641,0.00004499819,0.000085543,0.000627133,0.0003061923,0.9902631,0.002716169,0.005831329],"study_design_scores_gemma":[0.00001190448,0.0000239285,0.00004380648,0.00006653927,0.000009671225,0.0001323819,0.00004659308,0.003734434,0.0006803644,0.9776381,0.01758737,0.00002487686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02340347,0.01283628,0.685986,0.02303,0.00544707,0.0002687796,0.0003505132,0.0005356654,0.2481422],"genre_scores_gemma":[0.6511883,0.02984784,0.1790477,0.01045812,0.01228527,0.0009038491,0.0008860564,0.001343362,0.1140394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01100059,"threshold_uncertainty_score":0.04733914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2999209598","doi":"10.1007/978-3-030-44223-1_5","title":"Benchmarking Post-quantum Cryptography in TLS","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key exchange; Quantum computer; Network packet; Testbed; Cryptography; Computer network; Distributed computing; Public-key cryptography; Computer engineering; Quantum; Algorithm; Encryption","authors":[{"name":"Christian Paquin","is_ca":false},{"name":"Douglas Stebila","is_ca":true},{"name":"Goutam Tamvada","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01337910450183077,"gpt":0.2306112219525647,"spread":0.2172321174507339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00531018,0.0008013902,0.001197011,0.001051744,0.0009206455,0.003083635,0.002032224,0.001880732,0.02645126],"category_scores_gemma":[0.01592254,0.0002801856,0.0005128566,0.001317081,0.001843515,0.005689137,0.003225719,0.001959082,0.005921043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001929579,"about_ca_system_score_gemma":0.001906731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006687463,"about_ca_topic_score_gemma":0.000735788,"domain_scores_codex":[0.9928483,0.00249709,0.0002807769,0.0004644669,0.002942821,0.0009665815],"domain_scores_gemma":[0.9907281,0.002972772,0.0002741497,0.00383581,0.001831284,0.0003578677],"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.004004153,0.001111328,0.004611013,0.001372238,0.0002170372,0.0001972334,0.0003068598,0.209365,0.02446296,0.4817187,0.05099255,0.2216409],"study_design_scores_gemma":[0.0002223785,0.001445804,0.001689323,0.0002457016,0.00008138206,0.0001928824,0.0002329537,0.691084,0.06728812,0.1948714,0.04254121,0.0001049395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4421142,0.004907236,0.2719986,0.004043781,0.002644358,0.0004527051,0.003034143,0.02091054,0.2498945],"genre_scores_gemma":[0.9562747,0.0003776736,0.0274326,0.0003543392,0.0001525808,0.00009573849,0.00160956,0.001152581,0.01255026],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02645126,"threshold_uncertainty_score":0.08848828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562018356","doi":"10.1007/978-3-540-30539-2_36","title":"Strong Conditional Oblivious Transfer and Computing on Intervals","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Oblivious transfer; Predicate (mathematical logic); Computer science; Generalization; Simple (philosophy); Theoretical computer science; Modular design; Modular construction; Transfer (computing); Algorithm; Discrete mathematics; Mathematics; Cryptography; Programming language; Parallel computing","authors":[{"name":"Ian F. Blake","is_ca":true},{"name":"Vladimir Kolesnikov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01740736196155751,"gpt":0.2486044370477504,"spread":0.2311970750861929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015087,0.0005691498,0.001085435,0.0009056152,0.001212578,0.002648019,0.001508075,0.0007216822,0.00731524],"category_scores_gemma":[0.004947955,0.0004573647,0.0009282446,0.002323933,0.00298903,0.007512181,0.002754714,0.00376755,0.001169558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529564,"about_ca_system_score_gemma":0.0007425075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004357801,"about_ca_topic_score_gemma":0.0002480597,"domain_scores_codex":[0.9987611,0.0002907659,0.00006606028,0.0002133687,0.0004249993,0.0002436391],"domain_scores_gemma":[0.9963566,0.002133902,0.0001763957,0.0009924847,0.0002040234,0.0001365977],"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.00006007701,0.00001195016,0.0000453974,0.00003398945,0.000004680353,0.00001902483,0.000085354,0.002965901,0.0005622861,0.9846267,0.0009435932,0.01064107],"study_design_scores_gemma":[0.0000115351,0.00001881681,0.00005467551,0.000009924198,0.000007533748,0.00003057994,0.00001374775,0.01335437,0.001068562,0.9833836,0.002039378,0.000007305449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09338938,0.001337036,0.8303856,0.001352472,0.0002690564,0.00008365855,0.0002642637,0.001005343,0.0719131],"genre_scores_gemma":[0.8935573,0.0009927419,0.07525618,0.0002677055,0.0004063518,0.0001979689,0.0002555404,0.000327468,0.02873865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00731524,"threshold_uncertainty_score":0.02447194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118326624","doi":"10.5555/1182635.1164140","title":"Efficient secure query evaluation over encrypted XML databases","year":2006,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Database; Encryption; Database security; Metadata; View; XML database; XML Encryption; Information retrieval; XML; Computer security; Database design; World Wide Web","authors":[{"name":"Hui Wang","is_ca":true},{"name":"Laks V. S. Lakshmanan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03633933031643261,"gpt":0.2968752340972579,"spread":0.2605359037808253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004934669,0.0007589792,0.001517884,0.0007413275,0.0009234383,0.002481638,0.001853585,0.001053615,0.001450283],"category_scores_gemma":[0.01377619,0.0005003082,0.0009924505,0.001272961,0.001145362,0.005229879,0.003285064,0.001410986,0.0004731725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001632389,"about_ca_system_score_gemma":0.001678207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001891118,"about_ca_topic_score_gemma":0.001627897,"domain_scores_codex":[0.9903555,0.002240235,0.001323455,0.0009771566,0.004263247,0.0008404659],"domain_scores_gemma":[0.9826225,0.008430656,0.001432513,0.005415978,0.001742577,0.0003558203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00570805,0.001051212,0.01561959,0.0006394408,0.0003534362,0.001830166,0.002354416,0.3993197,0.1320525,0.08125668,0.007703283,0.3521116],"study_design_scores_gemma":[0.0001123902,0.0001644959,0.0007520957,0.00001568398,0.00004509863,0.0004090489,0.000254961,0.9330346,0.03945662,0.02434301,0.001390265,0.00002171025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2920678,0.000589723,0.700386,0.0009532759,0.00004625768,0.0002488137,0.0004024777,0.002744163,0.002561392],"genre_scores_gemma":[0.8817077,0.0002139585,0.1160021,0.0001301677,0.00004457253,0.00007487452,0.0003255963,0.0001345857,0.001366538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004934669,"threshold_uncertainty_score":0.02609736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111133028","doi":"10.1109/tcc.2013.11","title":"Hybrid Attribute- and Re-Encryption-Based Key Management for Secure and Scalable Mobile Applications in Clouds","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":120,"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":"Computer science; Cloud computing; Mobile cloud computing; Encryption; Scalability; Client-side encryption; Cryptography; Computer network; Computer security; Mobile computing; Distributed computing; Database; On-the-fly encryption; Operating system","authors":[{"name":"Piotr K. Tysowski","is_ca":true},{"name":"M. Anwarul Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01168891035751351,"gpt":0.2414132367006423,"spread":0.2297243263431288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001388826,0.0003942916,0.0007088464,0.0006388531,0.001070655,0.001352244,0.001623332,0.0006000749,0.001432344],"category_scores_gemma":[0.001987487,0.0002233397,0.0004755272,0.0009407596,0.0006844603,0.003553883,0.002187877,0.0008575635,0.0006295285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009642849,"about_ca_system_score_gemma":0.001247305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001053844,"about_ca_topic_score_gemma":0.001259592,"domain_scores_codex":[0.998421,0.0003871179,0.0001554036,0.0001420854,0.0005691321,0.0003252392],"domain_scores_gemma":[0.9986669,0.0002500984,0.0001737869,0.0005163013,0.0003099955,0.0000828641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002474079,0.000589487,0.003476806,0.0006033805,0.0002797873,0.001897807,0.001014151,0.2358948,0.1588179,0.2339426,0.01784339,0.3431658],"study_design_scores_gemma":[0.0001619467,0.000298276,0.0007934314,0.00004982054,0.00005889995,0.000875263,0.000265563,0.8827044,0.05721434,0.04048368,0.01700659,0.00008769199],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08689311,0.001699796,0.9035705,0.0006674246,0.0002309102,0.0004257389,0.0001554708,0.001263312,0.005093652],"genre_scores_gemma":[0.929877,0.0003492188,0.0673108,0.0001025725,0.0000535306,0.0001099054,0.0001242728,0.00003118549,0.002041508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001623332,"threshold_uncertainty_score":0.007344961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143772938","doi":"10.1109/tit.2007.901248","title":"Dual RSA and Its Security Analysis","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":119,"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":"PKCS #1; Public-key cryptography; Computer science; Dual (grammatical number); Secrecy; Cryptography; Key generation; Information-theoretic security; Key size; Authentication (law); Security analysis; Key (lock); Theoretical computer science; Mathematics; Computer security; Encryption","authors":[{"name":"Hung–Min Sun","is_ca":false},{"name":"Mu‐En Wu","is_ca":false},{"name":"Wei-Chi Ting","is_ca":false},{"name":"M. Jason Hinek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006610957988836975,"gpt":0.2277177245244399,"spread":0.2211067665356029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832391,0.000931379,0.0007089798,0.002170585,0.001017613,0.003570336,0.001248727,0.001337386,0.004920909],"category_scores_gemma":[0.008233706,0.000631393,0.001296052,0.001322275,0.003328573,0.006625334,0.003459468,0.004286138,0.002506715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001300935,"about_ca_system_score_gemma":0.0008896925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003077659,"about_ca_topic_score_gemma":0.0001238065,"domain_scores_codex":[0.9958864,0.001071612,0.0002517208,0.0007179885,0.00163999,0.0004323858],"domain_scores_gemma":[0.9947051,0.001992984,0.0004825938,0.00169629,0.0009125293,0.0002103518],"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.000127255,0.00003280644,0.0003828093,0.00009161096,0.00002316303,0.0001334982,0.0001027514,0.005069306,0.00461844,0.9576022,0.002120179,0.02969601],"study_design_scores_gemma":[0.00003665025,0.00008617776,0.0002479191,0.00007504567,0.00003719554,0.001443624,0.0000596326,0.07032064,0.008488052,0.8792057,0.03994333,0.00005596538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04489843,0.007241724,0.8379041,0.003816542,0.0008588335,0.0001436274,0.0002891136,0.0004604206,0.1043873],"genre_scores_gemma":[0.7642855,0.005286107,0.2103457,0.0009905827,0.001298647,0.0002072655,0.0002789956,0.0002090094,0.01709824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004920909,"threshold_uncertainty_score":0.01646203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1958037614","doi":"10.1109/sfcs.1998.743500","title":"Oblivious transfer with a memory-bounded receiver","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; McGill University","funders":"","keywords":"Bounded function; Communication source; Oblivious transfer; String (physics); Bit array; Alpha (finance); Transfer (computing); Computer science; Hash function; Discrete mathematics; Protocol (science); Theoretical computer science; Algorithm; Mathematics; Cryptography; Computer network; Parallel computing; Computer security; Statistics; Type (biology)","authors":[{"name":"Christian Cachin","is_ca":false},{"name":"Claude Crépeau","is_ca":true},{"name":"J. Marcil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01485542327124839,"gpt":0.1818471552665501,"spread":0.1669917319953017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002256668,0.000723519,0.001144144,0.0006397235,0.00156114,0.002336077,0.004042285,0.002371804,0.003631571],"category_scores_gemma":[0.007786642,0.0008118323,0.0011033,0.0008478872,0.004253866,0.008910087,0.00645516,0.004110277,0.001434671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001708973,"about_ca_system_score_gemma":0.001652697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005634962,"about_ca_topic_score_gemma":0.0002430187,"domain_scores_codex":[0.9969138,0.000977329,0.0001622223,0.0004378755,0.001043128,0.0004657409],"domain_scores_gemma":[0.9912295,0.003108031,0.0008712239,0.003892306,0.0005435154,0.0003553776],"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.0006205814,0.0001549951,0.0009051851,0.0002223794,0.00009161812,0.0004066916,0.0009654192,0.04657319,0.02106164,0.9002209,0.002198501,0.02657887],"study_design_scores_gemma":[0.0002515474,0.0004804336,0.0002948652,0.00006304027,0.0001662494,0.0006802071,0.0001524698,0.494095,0.04435607,0.4446666,0.01465549,0.0001380776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05020057,0.0003892699,0.9380807,0.0009873549,0.00006869614,0.0001367226,0.00008946968,0.001524537,0.008522574],"genre_scores_gemma":[0.8289978,0.0003286115,0.1610736,0.0003466172,0.0001320068,0.0003816503,0.0001113005,0.0001733735,0.008455025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004042285,"threshold_uncertainty_score":0.01239949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3184916135","doi":"10.1155/2021/8873429","title":"A Survey of Self-Sovereign Identity Ecosystem","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Identity (music); Identity management; Identifier; Computer science; Digital identity; Sovereignty; Blockchain; Key (lock); Internet privacy; Computer security; Political science; Authentication (law); Law; Politics","authors":[{"name":"Reza Soltani","is_ca":true},{"name":"Uyen Trang Nguyen","is_ca":true},{"name":"Aijun An","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0156691857503428,"gpt":0.2446312842600534,"spread":0.2289620985097106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342545,0.0004760523,0.0007263536,0.003762009,0.001876544,0.005486646,0.001122502,0.001824031,0.006889592],"category_scores_gemma":[0.004194351,0.0004530798,0.0005283784,0.007134127,0.00209836,0.01473864,0.003110729,0.001876472,0.002093158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002338044,"about_ca_system_score_gemma":0.002743694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001489778,"about_ca_topic_score_gemma":0.0009901914,"domain_scores_codex":[0.9979353,0.0006492272,0.000164981,0.0002917194,0.0007277886,0.0002309194],"domain_scores_gemma":[0.9976482,0.001081143,0.0001632663,0.0003662102,0.0005776678,0.0001635022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002425224,0.00004510488,0.001440085,0.001017339,0.00001709831,0.0001682539,0.001012636,0.0008651702,0.0003192429,0.7987668,0.01998864,0.1763353],"study_design_scores_gemma":[0.000002480282,0.00002990198,0.0008052008,0.000849693,0.000008814756,0.0006416787,0.0009615868,0.001693442,0.000271609,0.166801,0.8279139,0.00002081334],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.02737405,0.4782011,0.09261448,0.02401732,0.001845804,0.0001774979,0.0005992302,0.0004963864,0.374674],"genre_scores_gemma":[0.2586575,0.6391439,0.04547793,0.00616539,0.002074061,0.0002548157,0.001709234,0.0002655052,0.04625156],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006889592,"threshold_uncertainty_score":0.02304792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1801457577","doi":"10.1007/978-3-642-27576-0_13","title":"Revisiting the Computational Practicality of Private Information Retrieval","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Private information retrieval; Server; Scheme (mathematics); Confidentiality; Bandwidth (computing); Computation; Computer network; Theoretical computer science; Algorithm; Computer security; Mathematics","authors":[{"name":"Femi Olumofin","is_ca":true},{"name":"Ian Goldberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01863049201738024,"gpt":0.2627758982982837,"spread":0.2441454062809034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01194805,0.001198627,0.002143371,0.002598336,0.002580294,0.01074285,0.005025972,0.004357117,0.02008844],"category_scores_gemma":[0.08152576,0.00152065,0.00194671,0.004207291,0.01900003,0.0495614,0.009051649,0.01010211,0.005063331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003987939,"about_ca_system_score_gemma":0.002833462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002021536,"about_ca_topic_score_gemma":0.001276979,"domain_scores_codex":[0.9839544,0.007274911,0.0007015961,0.00188766,0.005294486,0.00088692],"domain_scores_gemma":[0.9049811,0.07408796,0.001202123,0.01578759,0.003445534,0.0004957437],"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.00005294751,0.00002278617,0.0001096351,0.0001257156,0.000009366609,0.00003697513,0.0001377096,0.002320914,0.0002325775,0.9743418,0.003667707,0.01894189],"study_design_scores_gemma":[0.00001278326,0.000009799593,0.00004247183,0.00003069029,0.000005182029,0.00006513816,0.00003214861,0.007597731,0.0002699349,0.9869473,0.004977123,0.000009641603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03063702,0.0130606,0.7361481,0.05267389,0.001701434,0.0001708805,0.0004919305,0.0007043824,0.1644117],"genre_scores_gemma":[0.7205718,0.01252418,0.215077,0.00596736,0.008290676,0.000305312,0.0006862009,0.001060714,0.03551679],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02008844,"threshold_uncertainty_score":0.06720251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950776700","doi":"","title":"Can homomorphic encryption be practical","year":2011,"lang":"en","type":"preprint","venue":"TU/e Research Portal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Homomorphic secret sharing; Client-side encryption; Learning with errors; Probabilistic encryption; Cloud computing; On-the-fly encryption; 56-bit encryption; Computer security; Theoretical computer science; Filesystem-level encryption; Scheme (mathematics); Outsourcing; Multiple encryption; Cryptography; Mathematics; Law; Secure multi-party computation; Operating system; Political science","authors":[{"name":"Kristin Lauter","is_ca":false},{"name":"Michael Naehrig","is_ca":false},{"name":"Vinod Vaikuntanathan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2127804591427322,"gpt":0.4159124099031242,"spread":0.203131950760392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007631679,0.000755497,0.0009218275,0.0005886531,0.001613493,0.005669381,0.001641212,0.00410243,0.01382712],"category_scores_gemma":[0.03380125,0.0009555648,0.0009730161,0.0008314458,0.006665057,0.022822,0.005257756,0.006299303,0.004758602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00180028,"about_ca_system_score_gemma":0.002179453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000500472,"about_ca_topic_score_gemma":0.0003490444,"domain_scores_codex":[0.9919451,0.002669421,0.0003859872,0.001273265,0.002556777,0.001169487],"domain_scores_gemma":[0.9643012,0.01891839,0.001624063,0.01211366,0.002421881,0.0006208285],"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.0002705589,0.0001013249,0.0004034231,0.0001881296,0.00003248417,0.0001804473,0.0001814753,0.01265812,0.001472039,0.9533693,0.008773091,0.02236948],"study_design_scores_gemma":[0.00007307906,0.00004941835,0.00009227687,0.00007529206,0.00001048929,0.0001696364,0.00009574215,0.02839814,0.002371924,0.9587402,0.009901241,0.00002253093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1232178,0.005461779,0.6567808,0.04601743,0.001714167,0.0004011404,0.0008251505,0.001109049,0.1644727],"genre_scores_gemma":[0.929047,0.001974611,0.05111698,0.00217623,0.0006041377,0.0002503692,0.0004438812,0.0001709576,0.01421578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01382712,"threshold_uncertainty_score":0.0462563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295445672","doi":"10.1109/tc.2015.2500576","title":"SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":112,"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":"Speedup; Homomorphic encryption; Computer science; IBM; Encryption; Theoretical computer science; Parallel computing; Operating system","authors":[{"name":"Alhassan Khedr","is_ca":true},{"name":"Glenn Gulak","is_ca":true},{"name":"Vinod Vaikuntanathan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06959331102854904,"gpt":0.3037236892231882,"spread":0.2341303781946391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009569697,0.0004423072,0.0004697951,0.0004667573,0.0003438217,0.0011646,0.001403601,0.0006082637,0.009389476],"category_scores_gemma":[0.002708829,0.0002835801,0.0004545214,0.0004094181,0.0006128387,0.002588164,0.001427403,0.001195993,0.003869016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006491316,"about_ca_system_score_gemma":0.001011714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005730816,"about_ca_topic_score_gemma":0.0006843028,"domain_scores_codex":[0.9989442,0.000174387,0.00007808431,0.0001550302,0.0004901193,0.000158067],"domain_scores_gemma":[0.9988237,0.0002772156,0.000078583,0.0005787789,0.0001880999,0.00005359181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001837458,0.0005365637,0.004032235,0.000542584,0.0001918009,0.0007044874,0.0005058119,0.07615487,0.1361196,0.1532027,0.04564687,0.580525],"study_design_scores_gemma":[0.0002143566,0.0003428676,0.001002402,0.00005547706,0.00004831214,0.0005812735,0.00008235041,0.6633407,0.243258,0.04855927,0.04244424,0.0000708417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05147741,0.0004638745,0.9082275,0.0003172414,0.0001503742,0.0002230308,0.0005751242,0.02739745,0.01116805],"genre_scores_gemma":[0.6003352,0.0002746164,0.3830487,0.0003536332,0.00009430618,0.0002444311,0.001416708,0.001500649,0.01273167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009389476,"threshold_uncertainty_score":0.03141099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W813596860","doi":"10.1007/s10623-015-0094-2","title":"The random oracle model: a twenty-year retrospective","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Oracle; Mathematical proof; Provable security; Pseudorandom number generator; Theoretical computer science; Schnorr signature; Concrete security; Flexibility (engineering); Computer security model; Computer security; Cryptography; Encryption; Mathematics; Algorithm; Public-key cryptography; Programming language; Statistics","authors":[{"name":"Neal Koblitz","is_ca":false},{"name":"Alfred Menezes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03038591141236432,"gpt":0.2513953581725988,"spread":0.2210094467602345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01454884,0.000501466,0.000684778,0.001896846,0.0007542795,0.002487128,0.001546202,0.00140057,0.003921806],"category_scores_gemma":[0.04978226,0.0005742552,0.000612301,0.002719587,0.003550946,0.007785235,0.002000048,0.003736804,0.0009283826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002413854,"about_ca_system_score_gemma":0.002629052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003666007,"about_ca_topic_score_gemma":0.00242564,"domain_scores_codex":[0.9957832,0.002220057,0.0003430238,0.0004793759,0.0008537311,0.0003205934],"domain_scores_gemma":[0.9252061,0.05255435,0.007278346,0.007305823,0.006099757,0.001555608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002095561,0.001403069,0.136699,0.001722447,0.0005514746,0.001380236,0.002104501,0.01042137,0.001084451,0.3428637,0.03304104,0.4666331],"study_design_scores_gemma":[0.000256665,0.003377382,0.1199114,0.005524486,0.001109982,0.01051115,0.004148958,0.0264888,0.007648044,0.205067,0.6155486,0.000407536],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.4008714,0.4185498,0.05997178,0.05750433,0.001601763,0.0003964293,0.003216081,0.0002477774,0.05764071],"genre_scores_gemma":[0.7574966,0.2181365,0.008592085,0.006124789,0.001369206,0.000154173,0.00146066,0.0001945828,0.006471501],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01454884,"threshold_uncertainty_score":0.0769425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1498129884","doi":"10.1007/3-540-47719-5_33","title":"Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Schnorr signature; Computer science; Merkle signature scheme; Scheme (mathematics); Digital signature; Signature (topology); Ring signature; Certificate; ElGamal signature scheme; Theoretical computer science; Random oracle; Blind signature; Public-key cryptography; Algorithm; Mathematics; Computer network; Computer security","authors":[{"name":"Douglas R. Stinson","is_ca":true},{"name":"Reto Strobl","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01745578900752887,"gpt":0.2470108243823711,"spread":0.2295550353748422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358625,0.0007474294,0.001290974,0.0007643197,0.002090679,0.005703038,0.00244263,0.002415342,0.00690578],"category_scores_gemma":[0.007189661,0.0009213217,0.001066557,0.002199705,0.003835175,0.01529011,0.00592069,0.004965121,0.00216459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003402048,"about_ca_system_score_gemma":0.003018031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006805936,"about_ca_topic_score_gemma":0.000805601,"domain_scores_codex":[0.9962244,0.0005991336,0.0003084248,0.0007061845,0.001658139,0.0005037444],"domain_scores_gemma":[0.9951742,0.001552709,0.0003930794,0.002289271,0.0003652941,0.0002255337],"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.0005264707,0.00008554722,0.0002374362,0.000187459,0.00002587984,0.0001075519,0.0003878745,0.007079491,0.009035329,0.9478089,0.002892064,0.031626],"study_design_scores_gemma":[0.0001482629,0.0001108893,0.000212531,0.00004824045,0.00004106161,0.0002570981,0.00008681302,0.0348307,0.01675207,0.9334932,0.0139531,0.00006612529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.101455,0.001386581,0.8182555,0.003003051,0.0004607658,0.000283229,0.0005630145,0.002640999,0.07195184],"genre_scores_gemma":[0.8192399,0.0006568976,0.1301446,0.0003296612,0.0002778945,0.0002369597,0.0004048523,0.0003265014,0.04838283],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00690578,"threshold_uncertainty_score":0.02468377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1951707894","doi":"10.1007/0-387-34805-0_29","title":"Flexible Access Control with Master Keys","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Scheme (mathematics); Key (lock); Set (abstract data type); Service (business); Access control; Representation (politics); Computer network; Computer security; Distributed computing; Mathematics; Programming language; Business","authors":[{"name":"Gerald C. Chick","is_ca":true},{"name":"S.E. Tavares","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03239600057577496,"gpt":0.2709463475798041,"spread":0.2385503470040291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00117737,0.0008898349,0.0009474967,0.0009310605,0.0008224789,0.002435511,0.001585111,0.0006824964,0.007804224],"category_scores_gemma":[0.003122108,0.0005607765,0.000551346,0.001032891,0.00149918,0.006661682,0.00324048,0.002389096,0.002612041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006275647,"about_ca_system_score_gemma":0.0006145905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002385403,"about_ca_topic_score_gemma":0.0002200656,"domain_scores_codex":[0.9984246,0.0001749301,0.0001274982,0.0003330345,0.0005984397,0.0003415276],"domain_scores_gemma":[0.9973676,0.0005847172,0.000203872,0.001521629,0.0002314708,0.0000907722],"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.0008004183,0.000101702,0.0003717159,0.0003669873,0.00006777275,0.0002331592,0.0004618898,0.01333968,0.05768444,0.6657274,0.01005557,0.2507892],"study_design_scores_gemma":[0.0001838932,0.0004314241,0.0006684475,0.0001629648,0.0001195831,0.001246288,0.0001390974,0.1886388,0.1327165,0.5794569,0.09607352,0.0001624504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02396212,0.001272592,0.9483542,0.0002824043,0.0002356833,0.0001466457,0.000189238,0.003098794,0.02245839],"genre_scores_gemma":[0.7970759,0.001508539,0.1435003,0.000256354,0.0003229835,0.0003403937,0.000434626,0.0005526838,0.0560082],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007804224,"threshold_uncertainty_score":0.02610773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113282491","doi":"","title":"Pretty Secure BGP (psBGP)","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":104,"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":"Border Gateway Protocol; Default-free zone; Computer science; Computer security; The Internet; Computer network; Simplicity; Protocol (science); Autonomous system (mathematics); Routing protocol; Routing (electronic design automation); Routing table; World Wide Web","authors":[{"name":"Tao Wan","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Paul C. van Oorschot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005734647566967056,"gpt":0.2123785155253207,"spread":0.2066438679583536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002389347,0.0006776939,0.0004965733,0.001225141,0.001136181,0.002238152,0.00178491,0.00148521,0.004465207],"category_scores_gemma":[0.006628482,0.0004440839,0.0004833788,0.001773691,0.001955475,0.005526004,0.003387645,0.002225671,0.002142638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259262,"about_ca_system_score_gemma":0.002005776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001193445,"about_ca_topic_score_gemma":0.001319722,"domain_scores_codex":[0.9973718,0.0006242317,0.0001623857,0.0002491127,0.001298223,0.0002942636],"domain_scores_gemma":[0.9933176,0.001009263,0.0007647303,0.00364566,0.001063468,0.0001992658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001112928,0.0002056744,0.004079381,0.0004510941,0.0001152415,0.0003479945,0.0003866933,0.0544765,0.03738409,0.5857196,0.02562662,0.2900941],"study_design_scores_gemma":[0.0003463904,0.001071725,0.002759073,0.0001217968,0.0001559097,0.002714355,0.0002205281,0.2811446,0.09213885,0.4490144,0.1701256,0.0001869201],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05667857,0.001360655,0.8989732,0.002042035,0.000267555,0.0004682654,0.00055797,0.005095062,0.03455652],"genre_scores_gemma":[0.6097907,0.00216585,0.375837,0.0006234664,0.0002211431,0.0002893904,0.001284609,0.0004883606,0.009299528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004465207,"threshold_uncertainty_score":0.01493758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3135750780","doi":"10.1109/access.2021.3062201","title":"Post-Quantum Era Privacy Protection for Intelligent Infrastructures","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"Horizon 2020 Framework Programme; European Commission; Ministerstvo Vnitra České Republiky","keywords":"Privacy protection; Computer science; Information privacy; Computer security; Privacy software; Internet privacy","authors":[{"name":"Lukáš Malina","is_ca":false},{"name":"Petr Dzurenda","is_ca":false},{"name":"Sara Ricci","is_ca":false},{"name":"Jan Hajný","is_ca":false},{"name":"Gautam Srivastava","is_ca":true},{"name":"Raimundas Matulevičius","is_ca":false},{"name":"Abasi-amefon Obot Affia","is_ca":false},{"name":"Maryline Laurent","is_ca":false},{"name":"Nazatul Haque Sultan","is_ca":false},{"name":"Qiang Tang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03568436532439909,"gpt":0.3087632272387393,"spread":0.2730788619143402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002987575,0.0004610482,0.0004705579,0.000909263,0.001641146,0.003586515,0.001163668,0.002347768,0.004217926],"category_scores_gemma":[0.006409768,0.0003475339,0.0008878717,0.001041963,0.003368059,0.009062382,0.003168014,0.003406164,0.001172817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001899739,"about_ca_system_score_gemma":0.00182326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003936253,"about_ca_topic_score_gemma":0.0002615382,"domain_scores_codex":[0.9964134,0.001237869,0.0001830316,0.0004407413,0.001300082,0.0004248696],"domain_scores_gemma":[0.9964105,0.001311647,0.0003028128,0.001537316,0.0003536471,0.00008406908],"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.00005593078,0.00003085056,0.000345128,0.0002388467,0.00001640176,0.0001533798,0.0003570399,0.00247912,0.004404255,0.9420827,0.00364992,0.04618642],"study_design_scores_gemma":[0.00002800576,0.0001528785,0.0006908101,0.0004361248,0.00004668965,0.001045435,0.0003815849,0.03650314,0.0216554,0.7887431,0.1502542,0.00006248616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04421851,0.01281011,0.7850614,0.01262284,0.0006789722,0.0002878164,0.0003542757,0.0008424033,0.1431236],"genre_scores_gemma":[0.8542841,0.009406897,0.1133114,0.002515889,0.0006000338,0.0003012599,0.0003146424,0.0001430019,0.01912273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004217926,"threshold_uncertainty_score":0.0158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022351540","doi":"10.1109/infcomw.2011.5928784","title":"SDSM: A secure data service mechanism in mobile cloud computing","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Cloud computing; Overhead (engineering); Mobile cloud computing; Computer security; Mobile computing; Computer network; Mobile device; Operating system","authors":[{"name":"Weiwei Jia","is_ca":false},{"name":"Haojin Zhu","is_ca":false},{"name":"Zhenfu Cao","is_ca":false},{"name":"Lifei Wei","is_ca":false},{"name":"Xiaodong Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05705607368771993,"gpt":0.2644413662822268,"spread":0.2073852925945069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003840301,0.0006910807,0.001103405,0.001694957,0.001748705,0.002648242,0.003148505,0.00175252,0.001652948],"category_scores_gemma":[0.003292392,0.0006164182,0.001607154,0.001505859,0.001990681,0.004413538,0.004851679,0.002080327,0.0007488692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001928896,"about_ca_system_score_gemma":0.002886612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00157704,"about_ca_topic_score_gemma":0.0009800942,"domain_scores_codex":[0.9964532,0.0007583706,0.0003676518,0.0003701957,0.001455291,0.0005953538],"domain_scores_gemma":[0.9979653,0.0002749968,0.0003481129,0.0007734801,0.0003708297,0.0002673065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001003248,0.0004203868,0.004513159,0.001317779,0.000312706,0.00179235,0.001017421,0.0225457,0.08285739,0.7004029,0.01178336,0.1720335],"study_design_scores_gemma":[0.0006499446,0.001195162,0.002562724,0.0003406311,0.0003605393,0.004138678,0.0004148603,0.5220013,0.121263,0.1169739,0.2296539,0.0004453695],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02944248,0.001717307,0.9609234,0.001055318,0.0003400728,0.0008787542,0.000130474,0.001862374,0.003649689],"genre_scores_gemma":[0.6500337,0.001487875,0.3410255,0.0006291554,0.0003343268,0.0007079791,0.0002422337,0.0001771873,0.005361995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003840301,"threshold_uncertainty_score":0.02030969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1520227725","doi":"10.1007/978-3-642-15317-4_11","title":"Threshold Attribute-Based Signcryption","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Signcryption; Computer science; Communication source; Ciphertext; Smart card; Digital signature; Scheme (mathematics); Computer security; Standard Model (mathematical formulation); Theoretical computer science; Non-repudiation; Property (philosophy); Encryption; Computer network; Public-key cryptography; Mathematics","authors":[{"name":"Martin Gagné","is_ca":true},{"name":"Shivaramakrishnan Narayan","is_ca":true},{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01802859906822213,"gpt":0.2400219214272223,"spread":0.2219933223590002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126773,0.0004783328,0.001090238,0.0008135503,0.000727869,0.003226095,0.001174694,0.0009875497,0.007503664],"category_scores_gemma":[0.003444156,0.0003170732,0.0005276134,0.001784895,0.001778074,0.005313415,0.003365779,0.002633408,0.003610226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008858977,"about_ca_system_score_gemma":0.000874476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002214935,"about_ca_topic_score_gemma":0.0001890021,"domain_scores_codex":[0.9978272,0.0002533307,0.0001706844,0.0002833083,0.001128037,0.0003373716],"domain_scores_gemma":[0.9978109,0.0005203401,0.0001283465,0.00104751,0.0003639628,0.0001289557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007434807,0.0001862691,0.0004415901,0.0002704805,0.00004751984,0.0001378483,0.0003150494,0.01368567,0.04066942,0.6834602,0.01049672,0.2495457],"study_design_scores_gemma":[0.0001835273,0.0004085305,0.0006333101,0.0001125607,0.00009296028,0.001044529,0.0001228935,0.2037875,0.1193634,0.6224582,0.05167398,0.0001185757],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05982732,0.00151492,0.8828785,0.0008654337,0.0006904944,0.0002146717,0.0003521652,0.00300233,0.05065418],"genre_scores_gemma":[0.8251042,0.001361214,0.1296609,0.0003495778,0.0002392432,0.0001358254,0.0005482366,0.0002879275,0.04231294],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007503664,"threshold_uncertainty_score":0.02510226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003406796","doi":"10.1109/focs.2006.77","title":"Towards Secure and Scalable Computation in Peer-to-Peer Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Scalability; Computer science; Fraction (chemistry); Adversary; Constant (computer programming); Computation; Leader election; Protocol (science); Theoretical computer science; Distributed computing; Computer network; Parallel computing; Algorithm; Computer security","authors":[{"name":"Valerie King","is_ca":true},{"name":"Jared Saia","is_ca":false},{"name":"Vishal Sanwalani","is_ca":true},{"name":"Erik Vee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007618213281689664,"gpt":0.2363035584337525,"spread":0.2286853451520628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005739488,0.001185634,0.001889782,0.001104347,0.001637109,0.002996557,0.003480413,0.002288748,0.001821816],"category_scores_gemma":[0.01358568,0.0009449391,0.0009493165,0.002201929,0.004475307,0.00934796,0.006641204,0.004101466,0.001159347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001499504,"about_ca_system_score_gemma":0.00213766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001429689,"about_ca_topic_score_gemma":0.001116625,"domain_scores_codex":[0.9934275,0.002163942,0.0003294663,0.0006247636,0.002952866,0.0005014839],"domain_scores_gemma":[0.9915575,0.003895377,0.0006468591,0.00266299,0.0008937315,0.0003435804],"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.0003577592,0.0001261062,0.000630962,0.0004745208,0.0001113739,0.000454657,0.0008010354,0.3933825,0.01112567,0.5000829,0.009762574,0.08268987],"study_design_scores_gemma":[0.00009991781,0.00006795049,0.00007362778,0.00002694653,0.00002224424,0.00006841658,0.00007738358,0.5753744,0.003238219,0.4119867,0.008942833,0.00002135561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02256864,0.001499316,0.9676995,0.002486011,0.0001775257,0.0002128742,0.00006240106,0.001338604,0.003955155],"genre_scores_gemma":[0.4991805,0.002528493,0.4908801,0.0004271213,0.0005718655,0.0006812899,0.0002436743,0.0003224791,0.00516451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005739488,"threshold_uncertainty_score":0.03035372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1804630428","doi":"10.1007/978-3-642-15317-4_27","title":"Distributed Private-Key Generators for Identity-Based Cryptography","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Encryption; Scheme (mathematics); Key escrow; Key (lock); Public-key cryptography; Computer security; Protocol (science); Cryptography; Cryptosystem; Identity (music); Theoretical computer science; Mathematics","authors":[{"name":"Aniket Kate","is_ca":true},{"name":"Ian Goldberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01318622371227801,"gpt":0.2463608134856581,"spread":0.2331745897733801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001515317,0.0007484062,0.0009256217,0.0006383039,0.001031594,0.002053573,0.001781018,0.001206455,0.007565614],"category_scores_gemma":[0.003456418,0.0004731739,0.0004895376,0.001207165,0.001776475,0.004154345,0.002119356,0.003164962,0.004147916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105542,"about_ca_system_score_gemma":0.0008574839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001114682,"about_ca_topic_score_gemma":0.0001551641,"domain_scores_codex":[0.9984924,0.0004816125,0.00008480511,0.0002476752,0.0005668037,0.0001267583],"domain_scores_gemma":[0.9985215,0.0005408625,0.00006095055,0.0006445079,0.0001817601,0.00005043421],"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.0001149478,0.00006123095,0.00009305138,0.0001255742,0.00001409047,0.00006894473,0.0001513682,0.005374488,0.004296604,0.8590645,0.008755765,0.1218794],"study_design_scores_gemma":[0.0000716095,0.00004680183,0.00005936925,0.00003814634,0.00001460836,0.0002245201,0.00002332486,0.04139435,0.00838512,0.9073095,0.04241167,0.00002085673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003782936,0.001401216,0.9772936,0.0004841073,0.0003278411,0.000142631,0.00009600475,0.0008736677,0.0155981],"genre_scores_gemma":[0.3511371,0.00249653,0.5867282,0.000461223,0.0007990247,0.0006614694,0.0007099569,0.0005315717,0.05647495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007565614,"threshold_uncertainty_score":0.0253095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3105676249","doi":"","title":"Secure multiparty quantum computation with (only) a strict honest majority","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; McGill University","funders":"","keywords":"Computer science; Quantum computer; Secure multi-party computation; Computation; Theoretical computer science; Quantum; Computer security; Programming language; Quantum mechanics; Physics","authors":[{"name":"Michael Ben-Or","is_ca":false},{"name":"Claude Crépeau","is_ca":true},{"name":"Daniel Gottesman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01991022459749521,"gpt":0.2479268264051,"spread":0.2280166018076048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002216,0.0005583777,0.001086022,0.0003833649,0.001384056,0.001737091,0.001703193,0.001437495,0.002485469],"category_scores_gemma":[0.005767975,0.0004451013,0.0008851109,0.0009104931,0.003527385,0.005065537,0.003782323,0.002149724,0.0007332318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007936357,"about_ca_system_score_gemma":0.001504347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003487585,"about_ca_topic_score_gemma":0.0003796592,"domain_scores_codex":[0.9966665,0.0008232485,0.0002066041,0.0005033656,0.001461221,0.0003390558],"domain_scores_gemma":[0.9964799,0.00118184,0.0003231992,0.001645874,0.000252832,0.0001163461],"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.0001055857,0.00004658053,0.0001920944,0.00009293155,0.00002738446,0.0001206742,0.0001955501,0.02361143,0.005736381,0.9506119,0.0009249097,0.01833467],"study_design_scores_gemma":[0.00007312564,0.00006885536,0.0001193115,0.00001998138,0.000022172,0.0001150267,0.00003585685,0.2995079,0.01237305,0.6813215,0.006314217,0.00002899282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0478977,0.0002872235,0.9364586,0.001016688,0.0001352085,0.0001744766,0.0001119572,0.0003164918,0.01360166],"genre_scores_gemma":[0.8080397,0.0003445484,0.1811801,0.0003404112,0.0001384507,0.0002695076,0.0001386066,0.00007462133,0.009474187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002485469,"threshold_uncertainty_score":0.01171947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}