{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002055327,0.0001151299,0.0001177702,0.00009699025,0.0001134734,0.00009454007,0.0007051155,0.00005793642,0.0006722798],"category_scores_gemma":[0.00001351823,0.00009746656,0.0000809998,0.0003657755,0.0000577311,0.0001948476,0.0002337914,0.000101626,0.0003163694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001512493,"about_ca_system_score_gemma":0.00003369021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004208897,"about_ca_topic_score_gemma":0.00006645958,"domain_scores_codex":[0.9989099,0.0000423596,0.0001708192,0.0003821137,0.00027109,0.0002237401],"domain_scores_gemma":[0.9990301,0.00003599969,0.00004987719,0.0007085367,0.00006246714,0.0001130164],"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.00003522955,0.0001949326,0.001460902,0.00000433986,0.00002021342,0.00002821131,0.002620598,0.00001075932,0.0008143242,0.9769872,0.002692523,0.01513076],"study_design_scores_gemma":[0.003343464,0.001122016,0.1598457,0.0000952971,0.00007225762,0.00005341444,0.0006442397,0.1014318,0.04068725,0.6445257,0.04610537,0.002073468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1509055,0.0001099243,0.8378451,0.00009241739,0.0003720188,0.0000902254,0.00003234049,0.0004222982,0.0101302],"genre_scores_gemma":[0.8682923,0.00001000647,0.1314322,0.000198668,0.00004228404,0.000005884941,0.000007607875,0.000005334013,0.000005737562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7173868,"threshold_uncertainty_score":0.7360992,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008248196,0.000203152,0.0001845838,0.0003476915,0.0004531272,0.000194485,0.0007953363,0.00009692578,0.00005949356],"category_scores_gemma":[0.00005688853,0.0002088056,0.0001423936,0.0006178007,0.0000967446,0.0007201112,0.00001863821,0.0002922367,0.0002032975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003178765,"about_ca_system_score_gemma":0.00004476734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009049087,"about_ca_topic_score_gemma":0.000006798894,"domain_scores_codex":[0.9982311,0.0003859716,0.000303051,0.0004901325,0.0003215884,0.0002681835],"domain_scores_gemma":[0.9982691,0.0005785755,0.0001181558,0.0007978698,0.0001153697,0.0001209104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005524816,0.000235768,0.00004314626,0.00002533991,0.00005271967,0.000002267733,0.000935436,0.01246813,0.0007682825,0.4918731,0.00007456962,0.4934659],"study_design_scores_gemma":[0.0009919468,0.0002943776,0.003783487,0.00006133558,0.00003583007,0.00004136889,0.000107108,0.124617,0.00179617,0.8658623,0.001939923,0.0004691701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01562228,0.00002565333,0.9817275,0.000522364,0.0005289185,0.0001890394,0.00000934531,0.0007457885,0.0006290678],"genre_scores_gemma":[0.9142057,0.00001370868,0.08512212,0.0005275188,0.00005680039,0.00002643615,0.0000120814,0.00001709435,0.0000185702],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8985834,"threshold_uncertainty_score":0.8514846,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001106066,0.0006368863,0.0007893183,0.001223751,0.0002144449,0.000275249,0.003004792,0.0004144818,0.00001934956],"category_scores_gemma":[0.00006597886,0.0005814171,0.0001933847,0.001068372,0.001332898,0.0009402814,0.002483535,0.0009879048,0.00002537589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001508466,"about_ca_system_score_gemma":0.0004784171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002431779,"about_ca_topic_score_gemma":0.0002919598,"domain_scores_codex":[0.996222,0.00003779984,0.0006897598,0.001750837,0.0005985659,0.000701018],"domain_scores_gemma":[0.9965605,0.0007374049,0.0004124836,0.001534369,0.000486654,0.0002685983],"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.00002779636,0.0002134369,0.0002333649,0.0002258176,0.0000405235,0.00004507363,0.006751815,0.0003477467,0.0001411785,0.02160772,0.0002085639,0.970157],"study_design_scores_gemma":[0.00229426,0.001666809,0.004102396,0.004011803,0.00007650869,0.0003129556,0.000002643037,0.6003383,0.01929944,0.3309738,0.03326143,0.003659699],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004803076,0.002254047,0.9768388,0.00007551216,0.001465316,0.0005598294,0.00002055737,0.00007501325,0.01823059],"genre_scores_gemma":[0.7391931,0.0001439736,0.259398,0.0003933296,0.0005623935,0.00001407533,0.00001626504,0.00005975526,0.000219045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9664972,"threshold_uncertainty_score":0.9996637,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006799307,0.0005672887,0.0005519422,0.0003742715,0.000209416,0.0009266721,0.003831273,0.0005917681,0.0005161539],"category_scores_gemma":[0.00007064579,0.0005130511,0.0004761967,0.0005591215,0.0002116536,0.0004796757,0.003673566,0.0008202309,0.0002691231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005990169,"about_ca_system_score_gemma":0.0003912818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000248377,"about_ca_topic_score_gemma":0.0001176427,"domain_scores_codex":[0.9962755,0.0001752612,0.0005486843,0.001655144,0.0007040405,0.0006413878],"domain_scores_gemma":[0.9951068,0.0001722315,0.0003026105,0.003811208,0.0002871259,0.0003200435],"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.00007040959,0.001157257,0.001121387,0.0009626672,0.0003471853,0.0001465295,0.001745469,0.0006668756,0.0001749981,0.8214496,0.1628242,0.009333318],"study_design_scores_gemma":[0.001446828,0.0002975363,0.002071235,0.0004935599,0.0001058344,0.0000234813,0.0000311204,0.2852329,0.003054894,0.5323022,0.1724874,0.002452974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009986727,0.0004072627,0.9694169,0.001376355,0.001739273,0.0005924541,0.000277761,0.001007848,0.01519544],"genre_scores_gemma":[0.4503685,0.00007015633,0.5456425,0.002465205,0.0008063181,0.0001267474,0.0003491393,0.00004978168,0.000121709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4403817,"threshold_uncertainty_score":0.9997321,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007995254,0.0004854196,0.0004280597,0.000726583,0.00046115,0.0006790987,0.001367634,0.000251217,0.000007892635],"category_scores_gemma":[0.00002108074,0.0004269549,0.00007100491,0.0006282575,0.0008483222,0.002098987,0.0009574237,0.0008450398,0.00001743489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000155497,"about_ca_system_score_gemma":0.000142784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005767504,"about_ca_topic_score_gemma":0.0002441547,"domain_scores_codex":[0.9971299,0.00006589187,0.0005006945,0.001088285,0.0007378582,0.0004773805],"domain_scores_gemma":[0.9974616,0.000519558,0.0004452437,0.001020161,0.0003533497,0.0002001147],"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.00003244838,0.0001181983,0.0007128031,0.00009227944,0.00002942459,0.00001384881,0.00277218,0.04828728,0.00008262751,0.02114126,0.00004127438,0.9266764],"study_design_scores_gemma":[0.0005237772,0.0001739975,0.00147172,0.0004529346,0.00001908945,0.0001510125,0.000001075981,0.8790655,0.0003673285,0.1167221,0.0003729731,0.0006785234],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001060429,0.0008814486,0.9958289,0.0004031757,0.0005571748,0.0004886357,0.000008956039,0.0001820081,0.0005892654],"genre_scores_gemma":[0.6230999,0.00009380776,0.3761757,0.0004166366,0.0001174055,0.000008622464,0.00006387303,0.00002059179,0.000003462413],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9259979,"threshold_uncertainty_score":0.9998182,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001591973,0.0008319169,0.0009189607,0.001328429,0.0005178566,0.001305036,0.003779342,0.0004912694,0.00005288902],"category_scores_gemma":[0.0001407171,0.0008012194,0.0002057099,0.0008540499,0.001476148,0.0007797981,0.001110145,0.00123697,0.00008464386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001710021,"about_ca_system_score_gemma":0.0004507362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004956258,"about_ca_topic_score_gemma":0.0001061147,"domain_scores_codex":[0.9944269,0.00009915339,0.0007612716,0.002373772,0.001338727,0.001000184],"domain_scores_gemma":[0.995782,0.000746549,0.0004365084,0.002224071,0.0003511258,0.0004597457],"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.000007864104,0.00008146986,0.0004971866,0.0001923929,0.00004397971,0.0001670525,0.001742781,0.001572584,0.0005188463,0.4989526,0.0001607812,0.4960625],"study_design_scores_gemma":[0.0009669872,0.0004863787,0.003708707,0.0008983632,0.00003842736,0.0005601907,3.842176e-7,0.1557481,0.0004613823,0.8266754,0.008546595,0.001909136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000385217,0.0009114771,0.9925705,0.0005664549,0.001240228,0.0005023618,0.00002192013,0.000388703,0.003413169],"genre_scores_gemma":[0.9142931,0.0002263614,0.08153857,0.002947111,0.0008014389,0.00001173041,0.0000274609,0.0000872265,0.00006698992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9139079,"threshold_uncertainty_score":0.9997317,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008913164,0.0004840298,0.0004955842,0.001252452,0.0002159881,0.001597384,0.001721762,0.0003633902,0.000009822636],"category_scores_gemma":[0.0001033626,0.0004869559,0.00008190979,0.001171772,0.0003557468,0.001956424,0.0009758844,0.0006994383,0.00001851537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00024302,"about_ca_system_score_gemma":0.0003186471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001832308,"about_ca_topic_score_gemma":0.0004469209,"domain_scores_codex":[0.9964505,0.00006740964,0.0004045069,0.001502085,0.0008080731,0.0007674673],"domain_scores_gemma":[0.9978245,0.0004531195,0.0002137452,0.0009600373,0.0001990026,0.0003495702],"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.00003246436,0.0001350234,0.002219638,0.00007502569,0.0000199565,0.00006725722,0.001379781,0.01231404,0.0007914454,0.06338356,0.00008719906,0.9194946],"study_design_scores_gemma":[0.001260542,0.0003740173,0.008705291,0.0005686536,0.0000187669,0.00002193105,0.000001017414,0.7592837,0.002238655,0.2116736,0.01409451,0.001759303],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002471962,0.0007547989,0.9929224,0.002083884,0.0009925551,0.0004582785,0.00006422357,0.0001273147,0.000124615],"genre_scores_gemma":[0.5945928,0.00003429158,0.403973,0.00105334,0.0002255107,0.00001313745,0.00008588577,0.00001832271,0.000003745102],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9177353,"threshold_uncertainty_score":0.9997582,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005384762,0.00002500936,0.00002444741,0.00002248908,0.00002096375,0.00002529612,0.000346343,0.00001082705,0.0001692973],"category_scores_gemma":[0.000008466648,0.00001272044,0.00002033064,0.00009404762,0.00001322501,0.0003342131,0.0001058157,0.00001011242,0.0003199855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001892116,"about_ca_system_score_gemma":0.000005141066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006556864,"about_ca_topic_score_gemma":0.000005308427,"domain_scores_codex":[0.9997131,0.000007014659,0.00003628258,0.0001110409,0.00005669051,0.00007585691],"domain_scores_gemma":[0.9996039,0.00003111374,0.000006743561,0.0003156945,0.000009623084,0.00003290958],"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":[2.798946e-7,0.000006542114,0.0005524624,2.16133e-7,9.126459e-7,8.95501e-7,0.00001534604,3.407939e-9,0.0006358442,0.9192648,0.00960029,0.0699224],"study_design_scores_gemma":[0.0003981666,0.00004130898,0.01617642,0.000008090131,9.999104e-7,0.000007798966,0.000004705519,0.0001821272,0.01388463,0.4453644,0.5237473,0.0001840781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002940262,0.00001613599,0.9727266,0.001756534,0.0001059492,0.00001335792,0.000001738291,0.00013706,0.02230232],"genre_scores_gemma":[0.8920628,0.0000134683,0.1071808,0.0005452769,0.00003533549,0.000001612695,2.663365e-7,0.00000124192,0.0001591814],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8891225,"threshold_uncertainty_score":0.4112873,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001431177,0.0005397909,0.0006418957,0.001169192,0.0001745878,0.000335302,0.004561328,0.0004371186,0.00004746498],"category_scores_gemma":[0.0001028851,0.0004381865,0.0002248467,0.001020542,0.0009471883,0.0008962069,0.001910354,0.0009931352,0.0000132817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001105274,"about_ca_system_score_gemma":0.0004713712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005990191,"about_ca_topic_score_gemma":0.0002413747,"domain_scores_codex":[0.9956692,0.00002968923,0.000718498,0.001487093,0.001356904,0.00073862],"domain_scores_gemma":[0.9965011,0.0006729626,0.0004321167,0.001950254,0.0002210532,0.000222455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004465688,0.00009133138,0.0002425549,0.0001856168,0.00004671351,0.0003679652,0.005400093,0.002622814,0.0002212807,0.2658643,0.00006352957,0.7248491],"study_design_scores_gemma":[0.001153666,0.0008210882,0.001172432,0.002095128,0.00005332122,0.0003929435,0.000001565787,0.2054495,0.006777337,0.7438471,0.0353737,0.002862239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001445402,0.0005155143,0.993318,0.0003935488,0.001342593,0.0002787478,0.00002449732,0.0001368948,0.003845648],"genre_scores_gemma":[0.1230828,0.0001426352,0.8731321,0.002932617,0.0005755098,0.000004127451,0.00002268028,0.00004570713,0.00006184343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7219868,"threshold_uncertainty_score":0.999807,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007604302,0.0005452521,0.0004380267,0.000897448,0.000672276,0.0005456029,0.001512543,0.0003282374,0.00005735497],"category_scores_gemma":[0.00002776726,0.0004652621,0.0001358313,0.001007961,0.000872588,0.001499753,0.0009236453,0.0007998116,0.00008268577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002675203,"about_ca_system_score_gemma":0.0004952507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004046725,"about_ca_topic_score_gemma":0.0003185075,"domain_scores_codex":[0.9961891,0.00005278653,0.0004721469,0.001387446,0.001204655,0.0006938671],"domain_scores_gemma":[0.9976538,0.0003388942,0.0003428914,0.001023693,0.0003589368,0.0002817853],"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.00006508455,0.0003932683,0.0006278466,0.00008346847,0.00005844277,0.00007360024,0.001919822,0.03233071,0.0006393162,0.1547085,0.0001581892,0.8089417],"study_design_scores_gemma":[0.00121241,0.00037754,0.005597369,0.0003284307,0.00003707708,0.0002806975,4.954364e-7,0.7501364,0.0005547964,0.2372177,0.00286091,0.001396249],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001814096,0.0003793217,0.9962724,0.0003112456,0.001614719,0.0004896886,0.0000220571,0.0002382621,0.000490829],"genre_scores_gemma":[0.2040718,0.00003487324,0.7945085,0.0007487989,0.0004575629,0.00001748159,0.00009758119,0.00002960158,0.00003386629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8075455,"threshold_uncertainty_score":0.9997799,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001424873,0.000348983,0.0003669303,0.0003802735,0.0009712466,0.0006049813,0.00116723,0.0001888643,0.0000212159],"category_scores_gemma":[0.00005823318,0.0003458743,0.0001061465,0.001053901,0.0001268319,0.001370131,0.0001005674,0.0007962345,0.00001730892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005267681,"about_ca_system_score_gemma":0.000251379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003253334,"about_ca_topic_score_gemma":0.000448293,"domain_scores_codex":[0.9967932,0.0002137261,0.0005829321,0.001089491,0.0005981389,0.0007224787],"domain_scores_gemma":[0.9976044,0.0004265076,0.0001668404,0.001191519,0.0002155508,0.0003952048],"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.001268292,0.004674946,0.00566062,0.0008931948,0.001625358,0.001140972,0.0492749,0.115048,0.01634895,0.07485058,0.01220576,0.7170084],"study_design_scores_gemma":[0.001969133,0.0001647488,0.0002460409,0.00009403678,0.00004572557,0.0001184574,0.0007746449,0.985418,0.00615452,0.0008123752,0.003648216,0.000554162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1189459,0.000252464,0.8785025,0.0003019702,0.001098636,0.000252837,0.0001314318,0.0004149632,0.00009920449],"genre_scores_gemma":[0.9500262,0.00004807885,0.04940215,0.0001878095,0.0001924288,0.000005285799,0.00009347741,0.00002530197,0.00001929464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8703699,"threshold_uncertainty_score":0.9998993,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008404634,0.0001653711,0.0001747725,0.0002873414,0.0002707283,0.0001818115,0.0007545113,0.000104224,0.00008521738],"category_scores_gemma":[0.00006090938,0.0001530676,0.0001386291,0.001395675,0.00004374812,0.001872939,0.0002763522,0.0001356601,0.0001743157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005107398,"about_ca_system_score_gemma":0.00005553591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003193878,"about_ca_topic_score_gemma":0.0000129405,"domain_scores_codex":[0.99829,0.00005648822,0.0002098935,0.0003708068,0.0003248369,0.0007479671],"domain_scores_gemma":[0.9986399,0.0002019552,0.00006476398,0.0007092436,0.0001043751,0.0002797533],"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.0000225039,0.0002698054,0.003535644,0.00008135358,0.00002866472,0.000001601682,0.0005225042,0.0000245282,0.0008487247,0.9595701,0.02870343,0.006391131],"study_design_scores_gemma":[0.003964894,0.0009401927,0.01580009,0.00006848117,0.00008099578,0.0001053306,0.000784134,0.08152012,0.03640359,0.1004757,0.7577321,0.002124362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08382814,0.0006509962,0.9082712,0.0003807747,0.001639104,0.0004972609,0.00004342919,0.0004126151,0.004276488],"genre_scores_gemma":[0.8811141,0.0001106522,0.1173712,0.0005356547,0.0004401449,0.00008026612,0.00005925539,0.00001697183,0.0002717909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8590944,"threshold_uncertainty_score":0.6241917,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560876,0.0001417167,0.0001413339,0.000120046,0.0002085065,0.0003318631,0.001498179,0.000110696,0.00007755093],"category_scores_gemma":[0.0000503292,0.0001187732,0.00008129499,0.0005465403,0.00003788095,0.0007596632,0.0005776914,0.0003030137,0.00001135262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001997308,"about_ca_system_score_gemma":0.0000998856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000136494,"about_ca_topic_score_gemma":0.00003774188,"domain_scores_codex":[0.9988374,0.00004053639,0.0001930752,0.0003713381,0.0002610678,0.0002965489],"domain_scores_gemma":[0.9984168,0.00007292279,0.00007719226,0.001205676,0.00009138851,0.0001360136],"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.00001102974,0.00008940243,0.05547119,0.000265325,0.00003184631,0.00003776096,0.0004925216,0.000528163,0.03587933,0.8980324,0.005119381,0.004041617],"study_design_scores_gemma":[0.0008173151,0.00004516922,0.04290771,0.00007361011,0.00001695857,0.00007604755,0.00007756646,0.9094263,0.01721562,0.00502016,0.0237349,0.0005885978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2940268,0.0000139421,0.7040685,0.0001227193,0.0005870095,0.0001140748,0.00001403097,0.0003414114,0.0007114657],"genre_scores_gemma":[0.7434774,2.202723e-7,0.2563081,0.0001113625,0.00008590221,0.00000249408,0.000007545278,0.000005002934,0.0000020011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9088982,"threshold_uncertainty_score":0.4843429,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006668227,0.0004030585,0.000341463,0.0006226062,0.0007020821,0.0006087666,0.005592371,0.0002801659,0.00003054336],"category_scores_gemma":[0.003605132,0.0003695879,0.00009878235,0.002469159,0.0001836205,0.001608752,0.00619003,0.0008991635,0.0003131327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007476731,"about_ca_system_score_gemma":0.00005432676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009913662,"about_ca_topic_score_gemma":0.00002151,"domain_scores_codex":[0.9971521,0.0000154129,0.0004192853,0.001076911,0.0005476882,0.0007886123],"domain_scores_gemma":[0.9979364,0.0001397524,0.0002990454,0.00107504,0.0004597445,0.00009004714],"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.0001348801,0.0003645513,0.01048485,0.0004344289,0.000120702,0.00002646324,0.01144166,0.00000430767,0.1196953,0.758559,0.005328249,0.09340557],"study_design_scores_gemma":[0.0005132143,0.0009348616,0.0004897563,0.0004038401,0.0000166353,0.00004983163,0.001124259,0.01741265,0.6089785,0.3175822,0.05167248,0.0008216876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8803282,0.000428691,0.07958185,0.01519043,0.0003777623,0.0005317765,0.000004677262,0.01471737,0.008839179],"genre_scores_gemma":[0.9019129,0.0001247852,0.09706999,0.0006956832,0.00008440646,0.0000553576,0.000003310163,0.00002910349,0.0000245123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4892832,"threshold_uncertainty_score":0.9998756,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578264,0.000130943,0.0001318922,0.0001418054,0.0001900051,0.0001272619,0.0004705136,0.0001726161,0.0001987481],"category_scores_gemma":[0.000291482,0.00009467638,0.00003211098,0.0003966504,0.0002744684,0.0005082685,0.0001350234,0.0002439902,0.0001049474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000250184,"about_ca_system_score_gemma":0.0001932519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001477745,"about_ca_topic_score_gemma":0.000001098432,"domain_scores_codex":[0.997924,0.0001475895,0.0003362378,0.0001430946,0.001246623,0.0002024828],"domain_scores_gemma":[0.998702,0.0002668625,0.0001350033,0.0004866763,0.0001664546,0.0002430055],"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.0002272788,0.0007340004,0.0004868955,0.0004835666,0.00004040034,0.00004240918,0.0192977,0.0002759455,0.000048278,0.2561085,0.09616396,0.6260911],"study_design_scores_gemma":[0.0006806469,0.0004091094,0.0007113006,0.0001866493,0.00000783454,0.00001707297,0.0000750308,0.9853123,0.00007701844,0.009444594,0.002947939,0.000130441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01336133,0.00003139083,0.9841853,0.0006870196,0.0002707239,0.0003976868,0.000003465664,0.0001680787,0.000895042],"genre_scores_gemma":[0.877753,0.00002465083,0.1194472,0.002513952,0.0001691632,0.00005887715,0.00002602613,0.000005852524,0.000001386723],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9850364,"threshold_uncertainty_score":0.386079,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001743443,0.00007327647,0.00009956174,0.00006954026,0.00003298594,0.0001114272,0.001273638,0.00003872237,0.0001557801],"category_scores_gemma":[0.00001602264,0.00006103471,0.00003894149,0.0005180894,0.00002817074,0.0009061551,0.0002666892,0.00008462715,0.00002733768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000769354,"about_ca_system_score_gemma":0.00001842874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004648335,"about_ca_topic_score_gemma":0.0002614363,"domain_scores_codex":[0.9992945,0.00003587119,0.0001411407,0.0002305179,0.00009844884,0.0001995529],"domain_scores_gemma":[0.9993733,0.00003656353,0.00002894175,0.0004694693,0.00002470854,0.00006707712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002199327,0.0002258618,0.09747895,0.000005388815,0.00001000772,0.00003222233,0.0005513653,0.000001818083,0.00004348838,0.8924747,0.003937135,0.00521706],"study_design_scores_gemma":[0.002267585,0.00009976362,0.7930988,0.0000141986,0.000004969703,0.00001077441,0.00005630527,0.0219025,0.001756937,0.169746,0.01059304,0.0004490748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02678141,0.00002967983,0.9639161,0.000167338,0.0001588161,0.00009742672,0.00003399872,0.0001295854,0.008685648],"genre_scores_gemma":[0.9936019,0.000005024962,0.005863989,0.0004922237,0.00001388511,0.000008259244,0.00001067799,0.000001788239,0.000002260098],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9668205,"threshold_uncertainty_score":0.2488923,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008922394,0.0002002868,0.0002843821,0.0002904574,0.0008559151,0.0005865604,0.004620392,0.000106243,0.000001484565],"category_scores_gemma":[0.0003925038,0.0002006117,0.0001156884,0.001835742,0.00004671877,0.0008640351,0.0002970263,0.0008555856,0.000003585489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003657416,"about_ca_system_score_gemma":0.0003809026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004668746,"about_ca_topic_score_gemma":0.000121575,"domain_scores_codex":[0.9977363,0.0004330264,0.0006657838,0.0002963334,0.0003452174,0.0005233646],"domain_scores_gemma":[0.9962566,0.0004145179,0.000382686,0.002338707,0.0003708371,0.0002365811],"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.000199692,0.003207795,0.01426377,0.0001230058,0.000243345,0.00004156364,0.002957263,0.006106218,0.003473661,0.8562933,0.01222922,0.1008612],"study_design_scores_gemma":[0.004336922,0.0010532,0.08309026,0.002557051,0.00003952374,0.0004709798,0.0004606185,0.8214142,0.000188308,0.04951473,0.0355881,0.001286126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07875911,0.003264263,0.9053236,0.008321378,0.0006131791,0.0008696274,0.00009359185,0.0002796081,0.002475694],"genre_scores_gemma":[0.9014834,0.0008349725,0.09700996,0.0004732038,0.0001313434,0.0000269731,0.00002901326,0.000008193852,0.00000299537],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8227242,"threshold_uncertainty_score":0.8585915,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007861244,0.0006894683,0.0005619882,0.001264414,0.0003388713,0.002285989,0.01188782,0.0002967953,0.00003881469],"category_scores_gemma":[0.0002152574,0.0005882962,0.0001134305,0.001004428,0.0004010751,0.001837917,0.006718883,0.001000298,0.0001592192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152942,"about_ca_system_score_gemma":0.0002337727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000655767,"about_ca_topic_score_gemma":0.0001531029,"domain_scores_codex":[0.9946172,0.00004026083,0.0004085022,0.002843343,0.001263659,0.0008270903],"domain_scores_gemma":[0.9932101,0.0004899913,0.0002188299,0.005526122,0.0001839035,0.0003710902],"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.000007304899,0.00004421931,0.00003171041,0.00003772374,0.00001510896,0.0000772995,0.000453426,0.001700324,0.0001533075,0.09864315,0.0007868673,0.8980496],"study_design_scores_gemma":[0.0004932536,0.0005268982,0.000617491,0.000935901,0.00001730221,0.00009810059,3.422224e-7,0.5622832,0.001413741,0.3716881,0.05965313,0.00227258],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001320073,0.0002693424,0.9906398,0.003363685,0.002255919,0.000560939,0.00008103093,0.0002631016,0.002434172],"genre_scores_gemma":[0.05475781,0.00005586899,0.9385161,0.005056913,0.00125703,0.00001697757,0.00009469854,0.00005308126,0.0001915607],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.895777,"threshold_uncertainty_score":0.9996569,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007266846,0.0005522279,0.0005206676,0.0009128109,0.0003312726,0.00113509,0.0029126,0.0003886825,0.000003562194],"category_scores_gemma":[0.00002858446,0.0004682972,0.0001186539,0.0008335265,0.0003767108,0.0004734078,0.0008397758,0.0006638376,0.00001054393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173036,"about_ca_system_score_gemma":0.0002579426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004319624,"about_ca_topic_score_gemma":0.00009317219,"domain_scores_codex":[0.9964553,0.00003144849,0.0004349608,0.001755988,0.0007311044,0.0005912209],"domain_scores_gemma":[0.99742,0.0002774334,0.0002122022,0.001597888,0.0002126613,0.0002798353],"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.0000306789,0.0001027385,0.0001044487,0.0001052018,0.00002033724,0.00005976239,0.0008235732,0.08319841,0.001481026,0.1382121,0.0002519932,0.7756098],"study_design_scores_gemma":[0.0004928123,0.0005054105,0.0005842551,0.0004437541,0.00001343277,0.00005946498,4.655876e-7,0.8612887,0.002523485,0.1225089,0.01025,0.001329301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002003415,0.001775011,0.9950634,0.0005954611,0.0008716464,0.0008054706,0.00005297425,0.0002104713,0.0004252785],"genre_scores_gemma":[0.8866639,0.00003705563,0.1098088,0.002720449,0.0006422704,0.00003111832,0.00004831931,0.00002868141,0.00001951748],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8864635,"threshold_uncertainty_score":0.9999018,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001448558,0.0002861736,0.0003228822,0.000382585,0.0005994154,0.0002371263,0.001951867,0.0001398908,0.00002797839],"category_scores_gemma":[0.00002854831,0.0003073523,0.0001196067,0.001394224,0.00009257089,0.000488771,0.00009498094,0.0008867866,0.00001542386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008300923,"about_ca_system_score_gemma":0.00006237411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003195322,"about_ca_topic_score_gemma":0.0001233742,"domain_scores_codex":[0.9968982,0.0003202756,0.0005683764,0.001044885,0.0005341043,0.0006341816],"domain_scores_gemma":[0.9972826,0.0004895974,0.0001134568,0.00192399,0.00008036877,0.0001099658],"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.00004577252,0.0008695341,0.0001470727,0.00008393193,0.00006475043,0.00001961049,0.00772246,0.8629235,0.000374074,0.007302294,0.00007397616,0.120373],"study_design_scores_gemma":[0.001631246,0.00006672802,0.0001703525,0.0001168731,0.00001258388,0.000005597202,0.0001546164,0.9919617,0.001269072,0.0002618987,0.004005456,0.0003438725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1869123,0.00009046235,0.8101187,0.0001251189,0.002067604,0.0003043353,0.00002141117,0.0002463327,0.0001137193],"genre_scores_gemma":[0.883334,0.00003723721,0.116152,0.0001734859,0.0002505963,0.000008858166,0.00001511528,0.00001989184,0.000008790734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6964217,"threshold_uncertainty_score":0.9999378,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005196469,0.0006175567,0.0007995312,0.0005439128,0.0002989748,0.0002061571,0.002898922,0.0004645553,0.00007262882],"category_scores_gemma":[0.0001255398,0.0006312649,0.0004898026,0.0002565713,0.0004988246,0.0002690744,0.007752725,0.001851939,0.0004222705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004872215,"about_ca_system_score_gemma":0.0002435636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002193863,"about_ca_topic_score_gemma":0.0002209851,"domain_scores_codex":[0.9958839,0.0005393481,0.0007544879,0.001736616,0.0003058679,0.0007797634],"domain_scores_gemma":[0.9966354,0.0004012966,0.0005445946,0.001952292,0.0001506332,0.0003157537],"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.00002362487,0.000273721,0.003757143,0.00008528998,0.0001647525,0.0001019918,0.007679288,0.0009711751,0.00009291212,0.9777247,0.0009525205,0.008172911],"study_design_scores_gemma":[0.0005347633,0.00005170446,0.02059432,0.00008519238,0.00003822666,0.00006276104,0.00006420327,0.03803987,0.0003173704,0.9383315,0.001201261,0.000678781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008473305,0.0002650617,0.9829398,0.0004375516,0.002041999,0.000603504,0.0001398123,0.0006670593,0.004431842],"genre_scores_gemma":[0.09869497,0.00007557149,0.9004261,0.0003427468,0.0001345889,0.0001071541,0.0001882081,0.00003011621,4.955048e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09022167,"threshold_uncertainty_score":0.9996139,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0002640726,0.000043457,0.00006379138,0.00003135584,0.0001912148,0.0000252183,0.05751369,0.00002039927,0.000003511132],"category_scores_gemma":[0.001233175,0.00003143145,0.0000733634,0.0003567575,0.0001626559,0.0001520455,0.0110952,0.00009655801,0.00001261632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003325566,"about_ca_system_score_gemma":0.00001254894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002936716,"about_ca_topic_score_gemma":0.00003335762,"domain_scores_codex":[0.9994565,0.0001397103,0.0001466931,0.00009688708,0.00008628163,0.00007387901],"domain_scores_gemma":[0.9509892,0.0001948504,0.00007045794,0.04868244,0.00004139302,0.00002161429],"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":[7.762494e-7,0.0000827402,0.001371715,0.000005551221,0.000006841495,6.820385e-9,0.0005437589,0.000004824317,0.001037815,0.9823889,0.006073149,0.00848393],"study_design_scores_gemma":[0.00009834464,0.00001205469,0.02454773,0.00001675814,0.000007940271,0.000001159619,0.00001222344,0.003441412,0.002833284,0.8972592,0.07169763,0.00007231296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03094708,0.00265278,0.5090064,0.4115251,0.0006560909,0.0005351013,0.00006027089,0.0004010544,0.04421617],"genre_scores_gemma":[0.7905772,0.00008144557,0.2092079,0.0001144328,0.000004145322,0.000006401303,0.000003047809,0.000001663349,0.000003785743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7596301,"threshold_uncertainty_score":0.9969029,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003767473,0.000201583,0.0002558737,0.0002285707,0.0002281478,0.0004774858,0.00114353,0.0001504685,0.0000560433],"category_scores_gemma":[0.00003069126,0.0001964346,0.00007955172,0.0005724384,0.00008095903,0.002551201,0.00001686057,0.0003408959,0.00001687163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002817122,"about_ca_system_score_gemma":0.000053617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007474552,"about_ca_topic_score_gemma":0.0008956907,"domain_scores_codex":[0.9982907,0.0001087011,0.0003340145,0.0006660399,0.0002228783,0.0003776542],"domain_scores_gemma":[0.9980115,0.0005204444,0.00008500478,0.001138644,0.00008112431,0.0001632545],"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.001710496,0.006191386,0.03066689,0.0008286494,0.0008186012,0.0000446966,0.007386138,0.001558472,0.001099734,0.155649,0.04196697,0.752079],"study_design_scores_gemma":[0.009796904,0.0005134126,0.02054323,0.0003811415,0.0001494172,0.00004609387,0.0001143133,0.6864241,0.006021922,0.2401932,0.03432999,0.001486273],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03011731,0.0001132844,0.9651552,0.001560508,0.00144268,0.0009753194,0.000484091,0.0001301401,0.00002139954],"genre_scores_gemma":[0.964192,0.0002555684,0.034243,0.0008651695,0.00007856895,0.0002951013,0.00005581143,0.00001293592,0.000001842445],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9340747,"threshold_uncertainty_score":0.8010372,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001056898,0.0004626119,0.0004726622,0.0005195774,0.001131775,0.0007333976,0.001197474,0.000221837,0.00002479963],"category_scores_gemma":[0.000009982425,0.0004474906,0.0003200667,0.001658264,0.0001244823,0.0004752466,0.00002734094,0.000809011,0.00006130704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001895466,"about_ca_system_score_gemma":0.000217198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006036372,"about_ca_topic_score_gemma":0.00007846847,"domain_scores_codex":[0.9962733,0.0002589805,0.0005830175,0.001173373,0.0007350987,0.0009761757],"domain_scores_gemma":[0.997203,0.0006428249,0.0002417186,0.001249441,0.0003647013,0.0002983207],"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.0007334706,0.002517391,0.0008428892,0.0006492041,0.0006697561,0.00006872557,0.01152996,0.2780987,0.009606881,0.0471749,0.00100797,0.6471001],"study_design_scores_gemma":[0.003594455,0.0009601049,0.001047274,0.0005010246,0.00005949424,0.00007410727,0.000687887,0.9800184,0.006131001,0.0005069415,0.00514941,0.001269896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3760891,0.00003081178,0.6202872,0.0003706194,0.001834416,0.0005763004,0.00003499498,0.0004531461,0.0003234247],"genre_scores_gemma":[0.9283776,0.000008616462,0.07073307,0.0003643209,0.000368501,0.00002754598,0.00002225337,0.00004869274,0.00004937617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7019197,"threshold_uncertainty_score":0.9997977,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249938,0.0001422896,0.0002691495,0.0003107576,0.0001071218,0.0002666668,0.0007456316,0.00009957605,0.000005391262],"category_scores_gemma":[0.00007891146,0.000132328,0.00008874847,0.0002343782,0.00007006464,0.001072484,0.0002875051,0.0004050228,1.318819e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003440051,"about_ca_system_score_gemma":0.00005048877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009342564,"about_ca_topic_score_gemma":0.00008237613,"domain_scores_codex":[0.9985192,0.0001055996,0.0005658088,0.000246894,0.0002848253,0.0002776173],"domain_scores_gemma":[0.9985575,0.0003534378,0.0004810215,0.0001192499,0.0003195314,0.0001692331],"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.003414402,0.002351884,0.2145445,0.0002394231,0.0007815828,0.0006449037,0.08901493,0.001935639,0.00002639989,0.3538118,0.002036284,0.3311982],"study_design_scores_gemma":[0.01115294,0.001136027,0.02783739,0.000772664,0.00006403046,0.0008554236,0.001362929,0.6810966,0.000179057,0.268847,0.0059073,0.0007886196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5145887,0.003893249,0.4789866,0.0005404616,0.001656643,0.0002137391,0.00002464572,0.00001768059,0.00007828688],"genre_scores_gemma":[0.995472,0.001240169,0.002182034,0.0006962808,0.0003986638,0.000001877123,0.000003391476,0.000005475373,6.962409e-8],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.679161,"threshold_uncertainty_score":0.5396178,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003325594,0.0001005509,0.0003464331,0.0002096914,0.0001915867,0.00008519874,0.0004864566,0.00006847228,0.00000514053],"category_scores_gemma":[0.00007266028,0.00006201815,0.0001056281,0.0005517661,0.0001464429,0.0003735303,0.00005201699,0.0002491996,5.475583e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006349599,"about_ca_system_score_gemma":0.001565653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007686864,"about_ca_topic_score_gemma":0.000004986104,"domain_scores_codex":[0.997604,0.0001053833,0.001431343,0.00007576022,0.0005009343,0.0002826539],"domain_scores_gemma":[0.9976691,0.0002440882,0.001188031,0.0002452674,0.0002924325,0.0003610736],"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.000113525,0.001293398,0.0003228056,0.002739862,0.0001203065,0.000005783039,0.03118078,0.0002261294,0.00007548516,0.0714998,0.02431628,0.8681058],"study_design_scores_gemma":[0.002808817,0.003391533,0.004180182,0.000656469,0.00001914747,0.0001887787,0.001264282,0.9220839,0.0004607713,0.005439922,0.05931624,0.0001900074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.020581,0.0009523816,0.9532508,0.02453448,0.0004804978,0.0001481232,0.00003732292,0.00001169352,0.000003688604],"genre_scores_gemma":[0.750176,0.001343432,0.229286,0.01877711,0.0003573031,0.000004799509,0.00004676422,0.000007118946,0.000001462428],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9218577,"threshold_uncertainty_score":0.2777401,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316149,0.000166171,0.0002432777,0.0001242732,0.0003503543,0.0006369625,0.000993354,0.00008846918,5.341403e-7],"category_scores_gemma":[0.00001563682,0.0001218528,0.00004216855,0.0004331083,0.00006209921,0.0005552353,0.00001311536,0.0001746232,0.000001665972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001302452,"about_ca_system_score_gemma":0.00003739392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000803212,"about_ca_topic_score_gemma":0.0002362879,"domain_scores_codex":[0.9986245,0.0001865228,0.0002686192,0.0004615791,0.0001645046,0.0002942643],"domain_scores_gemma":[0.9986003,0.0003091414,0.00007998729,0.0008771214,0.00003587438,0.00009756406],"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.001536668,0.002182542,0.002898353,0.001896633,0.0007123296,0.00003938325,0.006266911,0.4512305,0.0004511498,0.4181868,0.03812195,0.07647675],"study_design_scores_gemma":[0.003788078,0.0001681292,0.0007869602,0.00008520192,0.0000541833,0.00005835095,0.0003672522,0.8984629,0.00001443255,0.003995669,0.09182581,0.0003930355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002341144,0.0002500442,0.9918596,0.001441,0.0006279355,0.0005134771,0.002875485,0.00005656226,0.00003481972],"genre_scores_gemma":[0.9987816,0.00009257195,0.0002978544,0.0003664558,0.0002038468,0.00009869332,0.0001502682,0.000005950543,0.000002714893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9964405,"threshold_uncertainty_score":0.6142244,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007250784,0.0004522478,0.0005245042,0.0008156427,0.0005188521,0.0005644463,0.0008030182,0.0003006015,0.00007002998],"category_scores_gemma":[0.00001541612,0.0004155508,0.0006348644,0.000874128,0.0000632966,0.001154642,0.000003342539,0.0005034633,0.0002961204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001888733,"about_ca_system_score_gemma":0.0001415453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001321385,"about_ca_topic_score_gemma":0.0000845449,"domain_scores_codex":[0.9968672,0.0002941359,0.0007383978,0.0009494527,0.0006021056,0.000548699],"domain_scores_gemma":[0.9971329,0.0006088483,0.0003094582,0.001382519,0.0003199916,0.0002462777],"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.01255665,0.01822642,0.001159773,0.001627647,0.001660573,0.0000166227,0.006851999,0.6371203,0.06504135,0.1593687,0.0474494,0.04892059],"study_design_scores_gemma":[0.00741486,0.00110766,0.0004202501,0.0004501579,0.0000853384,0.000009000726,0.0004237392,0.924354,0.05082706,0.0002548856,0.01375015,0.0009029206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01734722,0.00005487313,0.9745495,0.0003712027,0.003402894,0.002337891,0.0007983184,0.0005110459,0.0006270375],"genre_scores_gemma":[0.9787369,0.00001410481,0.01994868,0.0004232383,0.0001655683,0.0004162811,0.0001593581,0.00004024956,0.00009556167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9613897,"threshold_uncertainty_score":0.9998296,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000299909,0.000112622,0.0001146565,0.000238822,0.00006797705,0.0000767675,0.0007144255,0.00005979553,0.00008678614],"category_scores_gemma":[0.00001463715,0.0001074774,0.0000372802,0.0007666863,0.00002092081,0.0006196977,0.0003096284,0.0001262423,0.0001648241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001972067,"about_ca_system_score_gemma":0.0001055829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005746963,"about_ca_topic_score_gemma":0.000309014,"domain_scores_codex":[0.9989216,0.00003606853,0.0002472095,0.0003378667,0.0001806716,0.0002765458],"domain_scores_gemma":[0.9994242,0.00002638709,0.00005723732,0.0003472517,0.00003025785,0.000114629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001268285,0.0002308502,0.05448062,0.00001095942,0.00001332421,0.00004525189,0.006669156,0.000003824989,0.000213537,0.8146083,0.001596962,0.1221145],"study_design_scores_gemma":[0.002064886,0.0001610486,0.8560905,0.00009326667,0.000006380415,0.00005660096,0.0002246408,0.009974006,0.005163374,0.1186605,0.006642922,0.0008619059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.128727,0.00004433224,0.8604853,0.00006866577,0.0002751243,0.0001156512,6.249157e-7,0.0002763454,0.01000692],"genre_scores_gemma":[0.7064812,0.000006962977,0.2932617,0.0002075822,0.00002189211,0.000001268674,0.000002659577,0.000004007997,0.00001276691],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8016099,"threshold_uncertainty_score":0.4382803,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001089017,0.000460654,0.0003831213,0.0003187539,0.0005168143,0.0003772675,0.001874891,0.0003297248,0.00002193229],"category_scores_gemma":[0.0002100173,0.0004125711,0.0005436885,0.001456628,0.0003328076,0.0004768191,0.0009507511,0.0005660164,0.0002410278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009329219,"about_ca_system_score_gemma":0.0001037345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005343123,"about_ca_topic_score_gemma":0.00001441107,"domain_scores_codex":[0.9966261,0.00006061515,0.0008798395,0.000732115,0.0009977816,0.0007035654],"domain_scores_gemma":[0.9961833,0.0006153217,0.0008526545,0.00205588,0.00007562008,0.0002171641],"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.00009055808,0.0003376674,0.00003130514,0.0004776177,0.0001725528,0.00001852923,0.002895125,0.00002477115,0.0008363485,0.9930207,0.0001183519,0.001976536],"study_design_scores_gemma":[0.001047736,0.0006119347,0.0003350529,0.000768257,0.0002566289,0.0000670826,0.001056273,0.8224288,0.01935743,0.1515125,0.001698041,0.0008602974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9093395,0.0001337454,0.07937439,0.00004882711,0.0001284556,0.00139983,0.00009824116,0.0003316058,0.009145382],"genre_scores_gemma":[0.9376107,0.00005148014,0.05880859,0.0002859024,0.0001169879,0.002966752,0.0000615421,0.00009551411,0.000002539358],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8415082,"threshold_uncertainty_score":0.9998326,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009899067,0.0007585678,0.000786323,0.002202378,0.0002691711,0.0008693957,0.005349476,0.0004440519,0.00004204442],"category_scores_gemma":[0.0001105225,0.0007461701,0.0003309963,0.002584321,0.0008343838,0.001204211,0.00251736,0.001642458,0.00004377369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001469548,"about_ca_system_score_gemma":0.0005027857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008463196,"about_ca_topic_score_gemma":0.0002886524,"domain_scores_codex":[0.994362,0.00006821702,0.000806404,0.002509078,0.001278444,0.0009758813],"domain_scores_gemma":[0.9967492,0.0005549762,0.0003367367,0.0018042,0.0002185869,0.0003362706],"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.00002067522,0.00008102618,0.0006727543,0.00009711859,0.00002014727,0.0005049741,0.001958862,0.002288635,0.0002369262,0.5460483,0.00007716833,0.4479933],"study_design_scores_gemma":[0.0005083914,0.0004420312,0.001788196,0.0006879884,0.0000106332,0.00007057405,6.499267e-7,0.2647743,0.0003404267,0.7250178,0.004931111,0.001427919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002752338,0.0008485136,0.9922955,0.001398919,0.002039129,0.0004705082,0.00003448992,0.0002276144,0.002410062],"genre_scores_gemma":[0.3078927,0.0002209535,0.6837384,0.006989561,0.001007531,0.00001977203,0.0000610903,0.00006577029,0.000004261785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4465654,"threshold_uncertainty_score":0.9994989,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006505312,0.0005249671,0.0004891261,0.0008586564,0.0003371998,0.000674405,0.002024025,0.0002695078,0.00003350734],"category_scores_gemma":[0.00003312948,0.0004941131,0.0001503747,0.0004320721,0.0009574289,0.0006166409,0.0008120234,0.0009538942,0.00001911308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001740996,"about_ca_system_score_gemma":0.000315653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002233491,"about_ca_topic_score_gemma":0.00005247618,"domain_scores_codex":[0.9964461,0.00003499457,0.0004727134,0.001570435,0.0008826862,0.0005930137],"domain_scores_gemma":[0.9981542,0.0004915974,0.0001123808,0.0009046278,0.0001268151,0.0002103279],"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.000007516224,0.0000496422,0.0000491931,0.0000425141,0.00001546895,0.00009031229,0.0009153342,0.01019043,0.00002742209,0.7660505,0.00001150737,0.2225502],"study_design_scores_gemma":[0.0008037727,0.0005437887,0.001104281,0.001016901,0.00001294445,0.0001569402,4.184394e-7,0.1204903,0.0006009179,0.8736416,0.0006154809,0.001012614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008563199,0.0003004773,0.9954301,0.0004836276,0.0008414073,0.0003059656,0.00004937648,0.0001559893,0.00157676],"genre_scores_gemma":[0.8740885,0.00003601162,0.1237934,0.001720201,0.0003011886,0.000003005065,0.00002808347,0.00002261436,0.000007016979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8732322,"threshold_uncertainty_score":0.999751,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400533,0.0002562026,0.0002166503,0.0002458821,0.0002989895,0.0002704891,0.001901904,0.00006482934,0.0004208434],"category_scores_gemma":[0.0002833086,0.0002381948,0.00007619454,0.0009359709,0.00006596804,0.001613508,0.001766267,0.0001776709,0.0001064604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003989756,"about_ca_system_score_gemma":0.0001861196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007935662,"about_ca_topic_score_gemma":0.0007172869,"domain_scores_codex":[0.9969066,0.0002492093,0.0003670876,0.001031744,0.000942048,0.0005032686],"domain_scores_gemma":[0.995765,0.0002851582,0.000146734,0.003562882,0.0001362089,0.0001039607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005595697,0.002129859,0.0106027,0.00009589524,0.00006763306,0.0001101634,0.0001325429,0.0009115197,0.001188761,0.3950707,0.583452,0.006182232],"study_design_scores_gemma":[0.001301711,0.00004676167,0.02591831,0.00008465094,0.00008959457,0.00002246809,0.00004581159,0.620317,0.0009976777,0.00207143,0.3484833,0.0006212654],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2880721,0.003380074,0.6705275,0.0002411675,0.001276523,0.0007062066,0.03397528,0.0006140039,0.001207138],"genre_scores_gemma":[0.933746,0.00005573272,0.02549034,0.0006856002,0.0004088209,0.00003379257,0.03955165,0.00002040818,0.000007631003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6456739,"threshold_uncertainty_score":0.9713302,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002837002,0.0001879195,0.0001908234,0.0002112972,0.0004716988,0.0002342388,0.0003203252,0.0000605933,0.00001009491],"category_scores_gemma":[0.000001861454,0.0001963537,0.00006350152,0.0004620069,0.00007003032,0.0002475496,0.00001282737,0.0002020309,0.000007740529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000379294,"about_ca_system_score_gemma":0.00001940284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008503709,"about_ca_topic_score_gemma":0.00002737675,"domain_scores_codex":[0.9986032,0.0000482477,0.0002962406,0.0005679749,0.000155473,0.0003288098],"domain_scores_gemma":[0.9989496,0.0003412766,0.00007385891,0.0004459637,0.00006890676,0.0001204054],"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.000126491,0.003938341,0.003194099,0.001803837,0.0003279751,0.00002002938,0.00474022,0.1731397,0.001252574,0.1440796,0.003927337,0.6634498],"study_design_scores_gemma":[0.002411932,0.0003271151,0.002202912,0.0001489761,0.0000439885,0.0000108387,0.0004250681,0.9700332,0.003379419,0.0157094,0.004691239,0.0006158859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1745123,0.00008694854,0.8235977,0.0002044372,0.0001853424,0.001174577,0.00004592136,0.0001384086,0.0000544091],"genre_scores_gemma":[0.9287745,0.00003027922,0.07052636,0.0001752922,0.00003897586,0.0004242379,0.00001270253,0.00001102018,0.000006667107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7968935,"threshold_uncertainty_score":0.8007073,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001013241,0.000107632,0.0001149463,0.0007063189,0.0002539216,0.0001365356,0.0002056854,0.0000749115,0.00007438535],"category_scores_gemma":[0.000006776864,0.0001033435,0.0001137013,0.001235499,0.00004100377,0.002762167,0.000003359964,0.0001827521,0.00007309335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001935571,"about_ca_system_score_gemma":0.00001759822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009839948,"about_ca_topic_score_gemma":0.00003330264,"domain_scores_codex":[0.9991215,0.00005108087,0.0002856123,0.0001325816,0.0002263323,0.0001829107],"domain_scores_gemma":[0.9992312,0.0001859359,0.00008092848,0.0003110112,0.00008043072,0.0001104728],"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.0001047684,0.0001244037,0.0000222571,0.00002686946,0.0002958839,0.000002856622,0.01656587,0.001226063,0.00004683584,0.8513578,0.00007825138,0.1301482],"study_design_scores_gemma":[0.006115261,0.001096318,0.01659196,0.00009108944,0.001730064,0.0002006437,0.008391244,0.3877341,0.157685,0.3687341,0.04810621,0.003523975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03896178,0.00003077828,0.9579967,0.0000664007,0.0002399965,0.00009669136,0.00005351712,0.0001632944,0.002390885],"genre_scores_gemma":[0.9977278,0.00004031368,0.001795449,0.0003981669,0.00001244631,0.000005974282,0.000009928183,0.000001889176,0.000008042483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.958766,"threshold_uncertainty_score":0.4214225,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007625839,0.0001041556,0.00009745025,0.00008035696,0.00009978563,0.0001562546,0.0005259687,0.00003775003,0.0007895108],"category_scores_gemma":[0.000003032794,0.00007451936,0.0000483777,0.0005355594,0.00005849107,0.000599079,0.000040206,0.00009577107,0.000160973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007445923,"about_ca_system_score_gemma":0.000008607425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006231751,"about_ca_topic_score_gemma":0.0001756249,"domain_scores_codex":[0.9991425,0.00002645459,0.00009454953,0.0003060157,0.0002132845,0.0002172155],"domain_scores_gemma":[0.9992973,0.00003095959,0.000008810697,0.0005352189,0.00003494079,0.00009273767],"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.00002547705,0.0004839913,0.0007945783,0.00001545557,0.00006363865,0.0001112136,0.005510451,0.00000643194,0.000247838,0.8853657,0.02336054,0.0840147],"study_design_scores_gemma":[0.02080072,0.004884268,0.03111387,0.000241504,0.0002085537,0.001567917,0.00109051,0.1662042,0.04221539,0.1456678,0.578917,0.007088235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03351161,0.0001210533,0.9066399,0.0008856977,0.0001012019,0.0001347249,0.000004792114,0.0003466628,0.05825432],"genre_scores_gemma":[0.9575653,0.00004091086,0.04126275,0.000842596,0.00002618834,0.000008556252,0.000001846238,0.000005491072,0.0002463528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9240537,"threshold_uncertainty_score":0.8644589,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131667,0.00009951965,0.0002025936,0.00004237065,0.0001990461,0.0001712378,0.0009723633,0.0001035908,0.00001534196],"category_scores_gemma":[0.00005626087,0.0001093846,0.00005716675,0.0007623133,0.00004891552,0.0008069343,0.0009893179,0.0002406562,0.00000221613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001122757,"about_ca_system_score_gemma":0.00005806188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002493465,"about_ca_topic_score_gemma":0.004437988,"domain_scores_codex":[0.998347,0.0007839944,0.0002961071,0.0002474666,0.000172955,0.0001524906],"domain_scores_gemma":[0.9975773,0.0003642206,0.0001621731,0.001530164,0.0002894052,0.00007674742],"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.000006175594,0.0002073714,0.009819536,0.00004530086,0.00004624046,0.000002151702,0.001184279,0.00003323806,0.000003698033,0.9849776,0.0003822331,0.003292164],"study_design_scores_gemma":[0.001217463,0.00009051616,0.2623098,0.0002246334,0.00004817013,0.00006062667,0.0004097575,0.4772806,0.0002594949,0.250407,0.007021251,0.0006707057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3154022,0.04576407,0.6278592,0.0005200168,0.0004298588,0.0003928033,0.0001846178,0.0003974547,0.009049809],"genre_scores_gemma":[0.9905523,0.004251448,0.004954772,0.0001039023,0.00001245802,0.000005743755,0.0001146851,0.000003735732,9.469902e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7345707,"threshold_uncertainty_score":0.4460573,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002530118,0.0002801051,0.0003317317,0.0003910497,0.0002699526,0.0003984934,0.002345142,0.0001863773,0.00001824935],"category_scores_gemma":[0.000380507,0.0002092624,0.0001283253,0.000775762,0.0007751145,0.002439421,0.001309257,0.0007530454,0.00002169865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009121624,"about_ca_system_score_gemma":0.0003034519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009564857,"about_ca_topic_score_gemma":0.000001613131,"domain_scores_codex":[0.9971752,0.00006867562,0.0006893969,0.0004781666,0.001186813,0.0004017875],"domain_scores_gemma":[0.9965793,0.001182319,0.0006775028,0.001084381,0.0003707932,0.0001056313],"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.00001054802,0.00001254792,0.0001430337,0.00006747281,0.00001037012,0.000002370814,0.0009836268,0.005586707,0.00001211996,0.5675813,0.000007786882,0.4255821],"study_design_scores_gemma":[0.0002661104,0.00007134051,0.003194169,0.0003407397,0.00001899392,0.0000774068,5.496325e-7,0.3142705,0.0004639736,0.6715335,0.009228351,0.0005342984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001569823,0.0003099513,0.9961428,0.00130447,0.0005942527,0.0002893202,0.00002266719,0.00006126416,0.001118302],"genre_scores_gemma":[0.3584806,0.00005499261,0.6395621,0.001279787,0.000567116,0.00000235884,0.00003969854,0.00001091124,0.000002380286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4250478,"threshold_uncertainty_score":0.8533473,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003751646,0.0003252756,0.0003841314,0.0006861848,0.000347494,0.0006160988,0.002375948,0.0005001155,0.0006383957],"category_scores_gemma":[0.0005644916,0.0003172396,0.0002539752,0.0007774243,0.000520189,0.0005774948,0.005270206,0.003638935,0.000234304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006274643,"about_ca_system_score_gemma":0.001540954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002180745,"about_ca_topic_score_gemma":0.0006895767,"domain_scores_codex":[0.9944568,0.0006994022,0.0004611065,0.00131703,0.00199251,0.001073132],"domain_scores_gemma":[0.9958215,0.0003242565,0.0001822999,0.002536939,0.0005591878,0.0005758125],"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.00003329385,0.0005068706,0.0006253796,0.000159023,0.00009008273,0.001455772,0.001511449,0.000001800534,0.0001573594,0.935064,0.05709956,0.003295415],"study_design_scores_gemma":[0.0007660429,0.000686237,0.01215663,0.0003268376,0.00005135208,0.0006025253,0.0004503561,0.004326847,0.001837608,0.9360794,0.04113086,0.001585247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2752854,0.003250553,0.4320167,0.05206808,0.008433505,0.008153139,0.002104918,0.005146421,0.2135413],"genre_scores_gemma":[0.9700769,0.0006203324,0.02804608,0.0001354304,0.0004977838,0.0002014116,0.0003070842,0.00004319978,0.00007180006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6947914,"threshold_uncertainty_score":0.999928,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003751792,0.0001606968,0.0001981672,0.0002997695,0.0001181442,0.0001022313,0.001353374,0.00006691597,0.00002984473],"category_scores_gemma":[0.000002465572,0.0001648491,0.00008121057,0.0008429846,0.0000919153,0.001079556,0.00001874798,0.0001881741,0.00003703152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004074266,"about_ca_system_score_gemma":0.0001618404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003538,"about_ca_topic_score_gemma":0.000151122,"domain_scores_codex":[0.9984257,0.00009896077,0.0003283706,0.0004838054,0.0004066822,0.0002565225],"domain_scores_gemma":[0.9982064,0.0001150037,0.0001145565,0.001268723,0.00009775915,0.0001975932],"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.0002032159,0.001814942,0.0005319358,0.0001245557,0.0006230751,0.00006314099,0.008894189,0.0292716,0.002012803,0.04532223,0.06430594,0.8468324],"study_design_scores_gemma":[0.009716361,0.002418239,0.001452765,0.0002190127,0.0002508123,0.0001332407,0.002961091,0.8683733,0.07750753,0.009447302,0.02553073,0.001989552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01160602,0.00002532831,0.9857593,0.000409841,0.001495909,0.0001903881,0.0001479788,0.0002449431,0.0001203365],"genre_scores_gemma":[0.9202713,0.00002027783,0.07939257,0.0002322225,0.00002991696,0.000009772021,0.00002983495,0.00001106236,0.000003065069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9086652,"threshold_uncertainty_score":0.6722351,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912614,0.0002151986,0.000236708,0.0001595116,0.000554854,0.0006514158,0.0007901505,0.00008069965,0.0000027193],"category_scores_gemma":[0.00006014263,0.0001492858,0.0001746305,0.0009808275,0.0002910957,0.0005658966,0.000254474,0.0002110351,0.000008458135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001422918,"about_ca_system_score_gemma":0.00006238616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000406169,"about_ca_topic_score_gemma":0.0000399202,"domain_scores_codex":[0.9982864,0.0001504687,0.000236403,0.0004893763,0.0004171772,0.0004202296],"domain_scores_gemma":[0.9985211,0.0001630098,0.00009861749,0.0007406327,0.0001866039,0.0002900166],"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.0001337579,0.00007237473,0.00537072,0.000004830803,0.00006063741,0.00000645725,0.001155125,0.00004891146,0.00007495326,0.980917,0.007185577,0.004969632],"study_design_scores_gemma":[0.003166131,0.000378205,0.003153753,0.00002103798,0.00004119822,0.00002258737,0.0006150547,0.08152799,0.0003042356,0.8893698,0.02086255,0.0005374431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01184228,0.001980803,0.9820265,0.0004455466,0.0001975475,0.0002877105,0.00003011817,0.0002311351,0.00295841],"genre_scores_gemma":[0.9114725,0.0007729079,0.08733583,0.0002659937,0.00006644268,0.00005485518,0.000008246683,0.00001534279,0.000007892285],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8996302,"threshold_uncertainty_score":0.6281618,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006753583,0.0007130967,0.0006474246,0.0007502235,0.0005056135,0.001118347,0.003296637,0.0005829471,0.00001094395],"category_scores_gemma":[0.0001098184,0.0006285494,0.0002002816,0.0009782261,0.0009172332,0.0009045979,0.001516023,0.001008154,0.000005218945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001096386,"about_ca_system_score_gemma":0.0002885368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002025885,"about_ca_topic_score_gemma":0.000100386,"domain_scores_codex":[0.9955446,0.00001660255,0.0005540504,0.002233535,0.0007177807,0.0009334131],"domain_scores_gemma":[0.9970015,0.0004565302,0.000298732,0.001644919,0.0003279415,0.000270396],"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.00007306454,0.0001528416,0.0004031887,0.0003227565,0.00007250156,0.000114101,0.0009007503,0.002023644,0.00191626,0.6660663,0.0009862158,0.3269684],"study_design_scores_gemma":[0.0005909367,0.0003157187,0.0002107425,0.0003598757,0.0000206699,0.0000982799,5.467899e-7,0.2873182,0.001768082,0.6888916,0.01925926,0.001166034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003095231,0.002373239,0.9931393,0.001550523,0.0006257719,0.001040342,0.0002342473,0.000283033,0.0004440425],"genre_scores_gemma":[0.2802506,0.0003005155,0.716067,0.002042135,0.0008180702,0.0001195443,0.0002669715,0.00008805872,0.00004714321],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3258024,"threshold_uncertainty_score":0.9999186,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001058608,0.0006517187,0.0006145147,0.001320146,0.0002981448,0.001485752,0.006082637,0.0003532011,0.00006263396],"category_scores_gemma":[0.00002815712,0.0005184195,0.0001504225,0.001206854,0.001018489,0.001800527,0.001548451,0.001027544,0.00005066003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001379493,"about_ca_system_score_gemma":0.0004623019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004125265,"about_ca_topic_score_gemma":0.0002415655,"domain_scores_codex":[0.9952896,0.0000306021,0.0005087396,0.001879323,0.00133523,0.0009564689],"domain_scores_gemma":[0.9965459,0.0004659256,0.0003063641,0.002095697,0.0002952876,0.0002908232],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007988395,0.00009275807,0.001057284,0.00008587052,0.00004836583,0.0004683862,0.0006139762,0.008695628,0.00003563305,0.2055501,0.0001162897,0.7831558],"study_design_scores_gemma":[0.003514829,0.001273591,0.002552947,0.001438015,0.00006560871,0.0005287447,4.332966e-7,0.241455,0.003977525,0.7082208,0.0329752,0.003997251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003698558,0.0003622595,0.9855194,0.0004930842,0.00106964,0.0004861259,0.00002069189,0.0002659151,0.0117459],"genre_scores_gemma":[0.1951402,0.00006562882,0.793211,0.01012172,0.001114976,0.00002155539,0.00002363455,0.00008478444,0.0002164931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7791585,"threshold_uncertainty_score":0.9997267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001284043,0.00007821248,0.00006821589,0.00005136766,0.00007261877,0.0001124154,0.0006778002,0.00004291472,0.000239712],"category_scores_gemma":[0.000009387398,0.00006456782,0.00005735423,0.000287505,0.00002362116,0.0007394265,0.0002030821,0.00009198231,0.0002424243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000088304,"about_ca_system_score_gemma":0.00001861625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000163051,"about_ca_topic_score_gemma":0.0000980333,"domain_scores_codex":[0.9992687,0.00001942537,0.0001046229,0.0002614477,0.0001556902,0.0001900936],"domain_scores_gemma":[0.9992664,0.00002865671,0.0000219949,0.0005731917,0.00002485584,0.00008487984],"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.000001369046,0.00005605889,0.0004200421,0.000002925369,0.000005153498,0.00000223122,0.0003576849,0.000006385757,0.00008427721,0.913096,0.0278917,0.05807614],"study_design_scores_gemma":[0.0002754872,0.00004430923,0.00419098,0.000005378919,0.000003137059,0.00001719095,0.00001965966,0.02137689,0.003635898,0.02602067,0.9441554,0.0002550338],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00848994,0.0002047008,0.9236978,0.002893185,0.0001677587,0.00008718659,0.000007310693,0.0004167967,0.06403538],"genre_scores_gemma":[0.7511275,0.00001908275,0.2467996,0.001765499,0.0001603082,0.000005065117,0.00000528392,0.000003523636,0.0001140629],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9162636,"threshold_uncertainty_score":0.3115954,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001183899,0.000114468,0.0001175066,0.00009492841,0.0001648823,0.0005858723,0.00102983,0.00006282103,0.0000316996],"category_scores_gemma":[0.0001026043,0.0001053889,0.00009879486,0.0004648544,0.00002603439,0.001145417,0.0003078092,0.0001459317,0.000007056542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001771864,"about_ca_system_score_gemma":0.00009811621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007471594,"about_ca_topic_score_gemma":0.00004068991,"domain_scores_codex":[0.9990016,0.00003912926,0.0001825915,0.0003883164,0.000169406,0.000219],"domain_scores_gemma":[0.9989632,0.00005458151,0.00007412088,0.0005933562,0.00024526,0.00006943168],"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.0001456077,0.0004682971,0.002050008,0.0004217006,0.0001499149,0.00006480779,0.003533162,0.0003933673,0.05246613,0.4658362,0.0133179,0.4611529],"study_design_scores_gemma":[0.00056943,0.0002001757,0.02063068,0.00005011965,0.00001895374,0.00006907295,0.00005443954,0.01574918,0.4867388,0.4231494,0.05225796,0.000511852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1420717,0.0001068172,0.8553731,0.0006806426,0.001230079,0.0003117634,0.00004103914,0.0001142767,0.00007049085],"genre_scores_gemma":[0.9788051,0.00002571762,0.02020152,0.0006356132,0.0002042482,0.00008644319,0.00002790622,0.000007886817,0.000005599585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8367333,"threshold_uncertainty_score":0.564958,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053874,0.0001321758,0.0001485983,0.0001131771,0.00007731411,0.00008677102,0.003031381,0.00007176806,0.0001179239],"category_scores_gemma":[0.000009936037,0.000121292,0.00002729622,0.0008920239,0.00001580747,0.0009210928,0.002570244,0.0001882641,0.00008637566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008672784,"about_ca_system_score_gemma":0.00003819086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009908088,"about_ca_topic_score_gemma":0.001397077,"domain_scores_codex":[0.9986241,0.00006314366,0.0002267857,0.0005967579,0.0001804266,0.0003088285],"domain_scores_gemma":[0.9979291,0.00004786062,0.00005704097,0.001830761,0.00004431729,0.00009091376],"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.000005706903,0.0002160807,0.0005125983,0.00002838148,0.00001066096,0.00003846616,0.006757595,0.000003349661,0.0001157291,0.9826319,0.001606507,0.008073037],"study_design_scores_gemma":[0.001717947,0.0002612621,0.005245573,0.0001232093,0.00001913033,0.000111468,0.002027694,0.5821951,0.004509727,0.3773369,0.0251843,0.001267718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07308774,0.0001425954,0.9184412,0.0001375246,0.000573213,0.0002754618,0.00004858869,0.0003477635,0.00694593],"genre_scores_gemma":[0.75854,0.00001525644,0.2401563,0.00115972,0.00006498607,0.000004887591,0.00004894697,0.000006673054,0.000003248382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6854522,"threshold_uncertainty_score":0.563311,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001106079,0.0006060458,0.0005171453,0.001103757,0.000402919,0.0008386754,0.004654189,0.0006435086,0.00006728172],"category_scores_gemma":[0.00006827289,0.000565796,0.0002426859,0.0009327829,0.001004127,0.000894539,0.001209781,0.001746322,0.00008340739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451871,"about_ca_system_score_gemma":0.0006649757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002057717,"about_ca_topic_score_gemma":0.0001777994,"domain_scores_codex":[0.9955986,0.00002543507,0.0005140413,0.001864332,0.001214293,0.0007832838],"domain_scores_gemma":[0.9963298,0.0003998606,0.0002890733,0.002443413,0.0002747268,0.0002631183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002497735,0.0001850527,0.000540707,0.0001167846,0.00002379505,0.0002703188,0.0005796808,0.01041091,0.003316388,0.4676607,0.0001299556,0.5167408],"study_design_scores_gemma":[0.0006108099,0.0002907333,0.0004474695,0.000328081,0.00001493784,0.00005084027,6.327869e-8,0.3068506,0.01003409,0.6693547,0.01060659,0.001411087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001634572,0.0002875131,0.9941265,0.0008321388,0.002439107,0.0003867931,0.0000324734,0.0003089404,0.001423081],"genre_scores_gemma":[0.2220898,0.00003608211,0.7739437,0.0029669,0.000810737,0.00001625998,0.0000649493,0.00004516712,0.00002641283],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5153297,"threshold_uncertainty_score":0.9996793,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494588,0.00008843106,0.0001005239,0.0001232747,0.0000578181,0.0002189624,0.0002327408,0.00005793081,0.00001302845],"category_scores_gemma":[0.00001287875,0.00008095501,0.00002212982,0.0006758845,0.00002155022,0.0003870092,0.000183269,0.0001015402,0.00000901238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001208736,"about_ca_system_score_gemma":0.00001536139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009328388,"about_ca_topic_score_gemma":0.0007559331,"domain_scores_codex":[0.9990577,0.00002815121,0.0001460253,0.000289843,0.0002680804,0.0002102399],"domain_scores_gemma":[0.9995919,0.00003262395,0.00002133668,0.0001841509,0.0001027373,0.00006720168],"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.00001398688,0.0001945827,0.02111159,0.00001739845,0.000006718858,0.00002416268,0.0008015626,0.02549236,0.00003786454,0.7546182,0.1269107,0.07077096],"study_design_scores_gemma":[0.0005576087,0.00007309346,0.1597394,0.00001709886,0.000002803645,0.00001228044,0.00004372249,0.7516782,0.0001117736,0.06012101,0.02734809,0.0002949547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04655207,0.00008470083,0.9427763,0.00279963,0.0001378385,0.0001127262,0.000004322172,0.00009776038,0.007434712],"genre_scores_gemma":[0.8810018,0.000003120891,0.1183552,0.0004615061,0.00005826426,0.000004705589,0.00002786706,0.000003341595,0.00008425853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8344497,"threshold_uncertainty_score":0.330125,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001179317,0.0007343867,0.000651855,0.001468837,0.0006377083,0.001432247,0.005624794,0.0006496898,0.0000238131],"category_scores_gemma":[0.0001433982,0.0007022349,0.0004668519,0.001649811,0.001183328,0.001381993,0.001163403,0.00119408,0.00001600241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106298,"about_ca_system_score_gemma":0.0005554474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001294329,"about_ca_topic_score_gemma":0.0002421503,"domain_scores_codex":[0.9951261,0.00003547354,0.0006719545,0.002047566,0.001165875,0.0009530509],"domain_scores_gemma":[0.9959195,0.0005509512,0.0004056277,0.002351017,0.0004295286,0.0003433753],"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.00001225549,0.00006675381,0.000153934,0.00007027156,0.00001817456,0.00002593785,0.0001282741,0.001652794,0.0006228006,0.9435955,0.00004687863,0.05360638],"study_design_scores_gemma":[0.0005418551,0.0001880914,0.0001236865,0.0001474037,0.00001860322,0.00001256904,5.211556e-8,0.07253417,0.009117499,0.9024252,0.01395953,0.0009313627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002225344,0.0002688953,0.9944217,0.0004935445,0.00304606,0.0008023424,0.0002885628,0.0003130997,0.0001432789],"genre_scores_gemma":[0.01102099,0.00002001166,0.9867352,0.001436546,0.0005370366,0.00004055834,0.00016884,0.00004035616,4.722527e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07088137,"threshold_uncertainty_score":0.9997553,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003111754,0.000485802,0.0004867177,0.0003026946,0.0002577462,0.0003949609,0.001485344,0.0003577759,0.00001533904],"category_scores_gemma":[0.00002825574,0.0003925655,0.0002013071,0.0007656979,0.0001407123,0.0005619818,0.001593147,0.0009867185,0.00004329178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005357288,"about_ca_system_score_gemma":0.0004346689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001083144,"about_ca_topic_score_gemma":0.0004639688,"domain_scores_codex":[0.9970332,0.0001990969,0.0004147457,0.001235977,0.0006682017,0.0004487563],"domain_scores_gemma":[0.9976618,0.0001782998,0.0003082599,0.001358622,0.0002641491,0.0002289207],"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.0003966825,0.003446276,0.04375095,0.001223362,0.0007162551,0.001170971,0.01073966,0.01420771,0.00004479917,0.8100863,0.07424974,0.03996735],"study_design_scores_gemma":[0.002484445,0.0005151635,0.0895537,0.0003052959,0.00008885066,0.0005016946,0.0001640102,0.8310109,0.0002059679,0.06010744,0.01240753,0.002654997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08495051,0.0001727535,0.9110476,0.0003460218,0.0006836284,0.0005540636,0.0001477706,0.0007001936,0.001397466],"genre_scores_gemma":[0.7882903,0.0002471485,0.2106479,0.0001979934,0.0001508049,0.00003424258,0.0004004102,0.00001997601,0.00001131345],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8168032,"threshold_uncertainty_score":0.9998526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}