{"meta":{"query_hash":"ce406a165f67","filters":{"topic":"Cryptography and Data Security"},"cohort_total":1083,"direct_labels_cover":2,"predictions_cover":1083,"exported":1083,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ce406a165f67","api":"https://metacan.xera.ac/api/v1/cohort?topic=Cryptography+and+Data+Security"},"results":[{"id":"W1015929330","doi":"10.1007/978-3-319-06355-3_2","title":"Equality Query for Auction in Emerging Smart Grid Marketing","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Smart grid; Computer science; Encryption; Key (lock); Computer security; Scheme (mathematics); Grid; Power grid; Extension (predicate logic); Power (physics); Engineering","score_opus":0.021962755430494862,"score_gpt":0.2624164904758304,"score_spread":0.24045373504533551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1015929330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077823415,0.006150306,0.84009594,0.015595822,0.0011596897,0.00036912467,0.0014513816,0.002101577,0.05525291],"genre_scores_gemma":[0.86131203,0.0016811184,0.10289384,0.0009868037,0.0012378412,0.00016002251,0.0014602203,0.00046063322,0.02980749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920323,0.0040749935,0.0004912046,0.0010044938,0.0016298675,0.000767193],"domain_scores_gemma":[0.9871705,0.0093648285,0.00046487496,0.0014603526,0.001065784,0.00047360724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00817724,0.00068927876,0.0033368913,0.0012822927,0.0020725776,0.008520559,0.0033404357,0.0033981719,0.01861548],"category_scores_gemma":[0.033053637,0.0007615359,0.0010974638,0.002670004,0.0024404933,0.0192247,0.0041315523,0.0043404982,0.0028083217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077929004,0.00021988119,0.0013179837,0.0002797296,0.00006426979,0.00019524437,0.00040946665,0.03151684,0.00067398086,0.83936745,0.03753344,0.087642476],"study_design_scores_gemma":[0.000071789276,0.00004231118,0.00036852757,0.000035243218,0.000020835423,0.00015876042,0.00018660791,0.33559573,0.00043273362,0.65384287,0.009212636,0.000031871492],"about_ca_topic_score_codex":0.0051737064,"about_ca_topic_score_gemma":0.003490607,"teacher_disagreement_score":0.01861548,"about_ca_system_score_codex":0.0042519495,"about_ca_system_score_gemma":0.0023338944,"threshold_uncertainty_score":0.062274992},"labels":[],"label_agreement":null},{"id":"W106417899","doi":"10.1007/978-3-319-06355-3_3","title":"Conjunctive Query over Encrypted Multidimensional Data","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; Computer science; Information retrieval; Computer security","score_opus":0.027600466253791037,"score_gpt":0.25880149416130643,"score_spread":0.2312010279075154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106417899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106680155,0.005282134,0.8354276,0.0054233205,0.00056575006,0.00047553825,0.0037538349,0.003417221,0.038974416],"genre_scores_gemma":[0.74511373,0.0043443423,0.22605799,0.0012723744,0.00090492546,0.00030656325,0.004573496,0.0005104588,0.016916076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561465,0.0009648322,0.00046289002,0.00046910814,0.0021311094,0.00035744288],"domain_scores_gemma":[0.9940088,0.0040772287,0.00028348767,0.0010362965,0.0004606895,0.00013356817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024448386,0.0006494772,0.0014309408,0.0011397798,0.0008321072,0.0038711743,0.0014335908,0.0013098763,0.0074683665],"category_scores_gemma":[0.008555705,0.0005218173,0.0007472881,0.003367736,0.0015983469,0.009518681,0.0032271114,0.0017530893,0.0016518114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014758076,0.00032114855,0.003531772,0.0027130798,0.0002789152,0.0034491937,0.0014892773,0.048160367,0.03774599,0.5609947,0.07495094,0.26488885],"study_design_scores_gemma":[0.00019783122,0.0002111787,0.0013667243,0.0001953529,0.00019155178,0.004340838,0.00088950683,0.4463851,0.033054665,0.4497357,0.06333198,0.00009955512],"about_ca_topic_score_codex":0.0015337194,"about_ca_topic_score_gemma":0.0012952776,"teacher_disagreement_score":0.0074683665,"about_ca_system_score_codex":0.0016870887,"about_ca_system_score_gemma":0.00071354845,"threshold_uncertainty_score":0.02498418},"labels":[],"label_agreement":null},{"id":"W110982490","doi":"","title":"Instance-Dependent Commitment Schemes and the Round Complexity of Perfect Zero-Knowledge Proofs.","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical proof; Zero-knowledge proof; Commitment scheme; Gas meter prover; Mathematics; Equivalence (formal languages); Randomness; Discrete mathematics; Theoretical computer science; Security parameter; Constant (computer programming); Computer science; Scheme (mathematics); Set (abstract data type); Cryptography; Algorithm","score_opus":0.050680659994196374,"score_gpt":0.2605024107624979,"score_spread":0.20982175076830153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110982490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26307926,0.0020284539,0.67121464,0.013584225,0.00029942245,0.0006355528,0.001357262,0.000997588,0.046803575],"genre_scores_gemma":[0.89818954,0.00096639124,0.08792508,0.00086381857,0.00027208644,0.00057022605,0.00069544645,0.00036672363,0.010150712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9840169,0.0060239024,0.0007898676,0.0026577425,0.0043588714,0.002152686],"domain_scores_gemma":[0.83940476,0.13047569,0.00707416,0.017465867,0.0027481853,0.0028313268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013666918,0.0011247204,0.0018151919,0.0017279021,0.0029956945,0.007440459,0.005544406,0.0035606732,0.010072889],"category_scores_gemma":[0.075153336,0.0014160521,0.0035894983,0.0020939033,0.008548925,0.026223041,0.0074414387,0.010534761,0.0011060433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056131044,0.00012884273,0.0016697255,0.00029915606,0.00014065453,0.00012710982,0.0006373772,0.050815437,0.0025752934,0.9271403,0.0021879193,0.0137169],"study_design_scores_gemma":[0.0000912278,0.00008512413,0.00052724965,0.00004712245,0.0000663175,0.00012384553,0.000070906746,0.1406879,0.0026234933,0.8532116,0.0024153905,0.000049792965],"about_ca_topic_score_codex":0.0015986077,"about_ca_topic_score_gemma":0.0010490522,"teacher_disagreement_score":0.013666918,"about_ca_system_score_codex":0.007879916,"about_ca_system_score_gemma":0.0041108485,"threshold_uncertainty_score":0.07227838},"labels":[],"label_agreement":null},{"id":"W113842324","doi":"10.1007/978-3-540-71677-8_9","title":"Optimistic Fair Exchange in a Multi-user Setting","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Iran Telecommunication Research Center; York University","keywords":"Computer science; Random oracle; Computer security; Encryption; Key exchange; Oracle; Computer security model; Key (lock); Signature (topology); Public-key cryptography; Scheme (mathematics); Mathematics","score_opus":0.018644610070629692,"score_gpt":0.27764272781927457,"score_spread":0.2589981177486449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113842324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14434528,0.0007371951,0.83702826,0.0029155798,0.000390722,0.00022202621,0.00020862068,0.0006111967,0.013541081],"genre_scores_gemma":[0.9587398,0.00017247688,0.03526766,0.0001467667,0.00021071633,0.0000804002,0.000048047717,0.000047992675,0.0052860305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98725164,0.0062224893,0.00057504704,0.0013673864,0.0026354664,0.0019480777],"domain_scores_gemma":[0.9571703,0.027262358,0.002159759,0.007844668,0.002634943,0.0029279238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01860304,0.0011743982,0.003099299,0.0013279717,0.004445646,0.007721043,0.00477389,0.0034347922,0.007889711],"category_scores_gemma":[0.035550103,0.0014112594,0.0007925048,0.001956394,0.00376553,0.0123480335,0.007041149,0.004139142,0.0008047436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003167253,0.0003325734,0.0019419799,0.00017020629,0.00023439975,0.00093952974,0.0007610568,0.2568,0.00306634,0.7020924,0.0048544076,0.025639782],"study_design_scores_gemma":[0.00013493831,0.00009739804,0.00016662372,0.00001442255,0.000056718607,0.00015495827,0.00010105334,0.64285755,0.00077796803,0.354502,0.0010826986,0.00005360538],"about_ca_topic_score_codex":0.001410388,"about_ca_topic_score_gemma":0.0017662797,"teacher_disagreement_score":0.01860304,"about_ca_system_score_codex":0.0024279014,"about_ca_system_score_gemma":0.0033946144,"threshold_uncertainty_score":0.098383486},"labels":[],"label_agreement":null},{"id":"W1164216906","doi":"","title":"The Best of Both Worlds: Combining Information-Theoretic and Computational Private Information Retrieval for Communication Efficiency","year":2014,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Computer science; Protocol (science); Server; Private information retrieval; Scheme (mathematics); Computer network; Database; Distributed computing; Computer security","score_opus":0.0056299108367909865,"score_gpt":0.19889422961830752,"score_spread":0.19326431878151654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1164216906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00791214,0.0024840424,0.9441698,0.009091342,0.00024226843,0.0001650165,0.000066962384,0.0008218714,0.035046536],"genre_scores_gemma":[0.5220521,0.00448529,0.4499543,0.0032796059,0.0016125729,0.0004790872,0.00022742333,0.00052155263,0.017388081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9875179,0.0043980093,0.0007078221,0.0011699621,0.005318799,0.0008875429],"domain_scores_gemma":[0.9728593,0.012589937,0.0010489027,0.011012585,0.0020887672,0.00040043946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009100547,0.0011278393,0.0018132663,0.0027714507,0.0018747866,0.008458475,0.0037019819,0.0033482206,0.009112901],"category_scores_gemma":[0.034683965,0.0008291332,0.0012566006,0.0034357081,0.006422164,0.028819166,0.00933804,0.004767723,0.0034598492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015524059,0.00013243074,0.0003780192,0.0002377861,0.00005580704,0.00012209505,0.0002394884,0.019736614,0.0030452765,0.84309304,0.0067413924,0.12606281],"study_design_scores_gemma":[0.00006935168,0.00015978618,0.00018237735,0.00014486672,0.000052832576,0.00039026394,0.000162352,0.1727978,0.008662036,0.7837784,0.033517253,0.00008267113],"about_ca_topic_score_codex":0.0011266383,"about_ca_topic_score_gemma":0.0007145699,"teacher_disagreement_score":0.009112901,"about_ca_system_score_codex":0.0026676345,"about_ca_system_score_gemma":0.0037147333,"threshold_uncertainty_score":0.048128843},"labels":[],"label_agreement":null},{"id":"W116546113","doi":"10.1007/978-3-319-07536-5_5","title":"Verifiable Multi-server Private Information Retrieval","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Server; Computer science; Verifiable secret sharing; Private information retrieval; Scheme (mathematics); Database; Outsourcing; Sublinear function; Cloud computing; Computer network; Computer security; Operating system; Mathematics; Discrete mathematics","score_opus":0.014487175205021309,"score_gpt":0.23057500325852326,"score_spread":0.21608782805350196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116546113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030372236,0.00211635,0.93403715,0.0023647773,0.0005666617,0.00029530484,0.00077685167,0.0055730324,0.023897571],"genre_scores_gemma":[0.82273996,0.0011242009,0.1234855,0.00091703504,0.00076598424,0.0003481964,0.001415156,0.0005935378,0.048610456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99240375,0.0015414708,0.00040021067,0.00092348113,0.0035589144,0.0011721256],"domain_scores_gemma":[0.9854299,0.004950381,0.00062173035,0.007562303,0.0011772091,0.0002584167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003562142,0.0010363178,0.0021383944,0.001159714,0.0015219041,0.004038248,0.0035958674,0.003506916,0.01082898],"category_scores_gemma":[0.010466617,0.0010885746,0.00093671697,0.0019120432,0.0025732901,0.009968518,0.0063717226,0.0051826304,0.005798732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021231011,0.0004985359,0.00090568024,0.0006766432,0.00019917014,0.00061714544,0.00044990156,0.049173776,0.04382246,0.5141271,0.035108574,0.35229796],"study_design_scores_gemma":[0.00030004082,0.00026749398,0.00076431746,0.00014392394,0.00011950289,0.001191888,0.00007660974,0.49559486,0.073018074,0.4035841,0.0248024,0.00013678383],"about_ca_topic_score_codex":0.0005391848,"about_ca_topic_score_gemma":0.0005513193,"teacher_disagreement_score":0.01082898,"about_ca_system_score_codex":0.0026042478,"about_ca_system_score_gemma":0.0023089084,"threshold_uncertainty_score":0.03622651},"labels":[],"label_agreement":null},{"id":"W1199169209","doi":"10.1007/978-3-319-22174-8_7","title":"FHEW with Efficient Multibit Bootstrapping","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bootstrapping (finance); Computer science; Generalization; Homomorphic encryption; Scheme (mathematics); NAND gate; Theoretical computer science; Algorithm; Encryption; Parallel computing; Logic gate; Mathematics; Computer security","score_opus":0.024005236498710805,"score_gpt":0.24567374793724434,"score_spread":0.22166851143853353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1199169209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01249903,0.00031142423,0.9584519,0.0002741524,0.00032803626,0.00013763664,0.00024568604,0.0053253467,0.022426823],"genre_scores_gemma":[0.29043952,0.00024024435,0.6780687,0.00037455664,0.00022222858,0.00030844234,0.0007207911,0.00093547715,0.028690094],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998408,0.00032039153,0.000090887515,0.00022943753,0.0006885618,0.00026275808],"domain_scores_gemma":[0.9983463,0.00036633338,0.00007448642,0.0009486689,0.00019599381,0.00006811616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008989786,0.0010164769,0.00093637296,0.0009840431,0.0008895009,0.0016815347,0.001629976,0.0012219254,0.022229712],"category_scores_gemma":[0.0041177124,0.00045361294,0.0006991816,0.0010700806,0.0008204757,0.003120253,0.004665692,0.0016389053,0.00771845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007704732,0.00019694482,0.0005845974,0.00026878325,0.000070220965,0.00031890336,0.00015406466,0.024146367,0.025486456,0.15184474,0.023328412,0.7728301],"study_design_scores_gemma":[0.00017932508,0.00031542862,0.000646378,0.00012787689,0.00008753525,0.0009916328,0.000137099,0.48958534,0.058222685,0.3703871,0.07920976,0.000109853914],"about_ca_topic_score_codex":0.00044843034,"about_ca_topic_score_gemma":0.00078219787,"teacher_disagreement_score":0.022229712,"about_ca_system_score_codex":0.00047908668,"about_ca_system_score_gemma":0.0008659319,"threshold_uncertainty_score":0.074365735},"labels":[],"label_agreement":null},{"id":"W120943514","doi":"","title":"Providing a data location assurance service for cloud storage environments","year":2012,"lang":"en","type":"article","venue":"Journal of Multimedia","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloud computing; Computer science; Cloud storage; Computer security; Encryption; Service provider; Cryptography; Cloud computing security; Service (business); Database; Operating system; Business","score_opus":0.046744764212440885,"score_gpt":0.286761461718619,"score_spread":0.2400166975061781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120943514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095238425,0.0013326199,0.87180555,0.0030864931,0.0005229182,0.00076885475,0.00059318304,0.011712431,0.014939504],"genre_scores_gemma":[0.87890327,0.00048780223,0.11155162,0.00067342416,0.00018238061,0.00017005984,0.0005256721,0.00023356332,0.007272163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972662,0.0004870334,0.0002771552,0.0003256111,0.0011621971,0.00048182777],"domain_scores_gemma":[0.9954733,0.00045844677,0.00053498684,0.002066705,0.0011451758,0.00032140978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013415599,0.0004963247,0.0007580951,0.00070468395,0.0016733492,0.003141856,0.0025449938,0.0019122842,0.0038008704],"category_scores_gemma":[0.0041882754,0.0004286068,0.0007199202,0.0011060839,0.00094105233,0.0051191105,0.0050929566,0.0017889701,0.0028077317],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002643845,0.00079290237,0.011958728,0.0015713053,0.0002583651,0.0026911327,0.0021812795,0.042162128,0.183709,0.29755944,0.060024213,0.3944476],"study_design_scores_gemma":[0.00023136585,0.0005799958,0.002916772,0.00024183012,0.00016767273,0.0021009052,0.0010679889,0.60637003,0.15268466,0.038690023,0.19464974,0.00029897966],"about_ca_topic_score_codex":0.001981402,"about_ca_topic_score_gemma":0.0012905599,"teacher_disagreement_score":0.0038008704,"about_ca_system_score_codex":0.0019177563,"about_ca_system_score_gemma":0.0021718286,"threshold_uncertainty_score":0.013914287},"labels":[],"label_agreement":null},{"id":"W122504873","doi":"10.1007/978-3-642-36594-2_30","title":"Computational Soundness of Coinductive Symbolic Security under Active Attacks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Soundness; Computer science; Encryption; Theoretical computer science; TRACE (psycholinguistics); Symmetric-key algorithm; Ciphertext; Mathematics; Computer security; Public-key cryptography; Programming language","score_opus":0.01716209837868851,"score_gpt":0.2580138085464211,"score_spread":0.24085171016773257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122504873","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12622716,0.0027298804,0.6497933,0.008147824,0.0009410542,0.00018282862,0.00080439064,0.0021851284,0.20898847],"genre_scores_gemma":[0.9508083,0.0008875265,0.0306874,0.000849746,0.0004940958,0.000183785,0.00046058674,0.00030176877,0.015326873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955285,0.0009334476,0.00028847417,0.00082606496,0.0017590865,0.00066433754],"domain_scores_gemma":[0.9894611,0.0066525377,0.0003100571,0.002154433,0.0011931972,0.00022861022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024212247,0.0009999383,0.0013809432,0.0017019291,0.0020716903,0.006294461,0.0020504089,0.002342505,0.006475357],"category_scores_gemma":[0.010451782,0.0009837183,0.0018096503,0.0017089613,0.013214083,0.013408447,0.0045799864,0.0080297645,0.0013591801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000370885,0.000014807858,0.00009202781,0.00005819413,0.000009671672,0.00003754591,0.00024059502,0.0014923151,0.0006266461,0.9909236,0.0007987962,0.005668672],"study_design_scores_gemma":[0.000011891869,0.000008819169,0.00003633745,0.000015225492,0.000010181883,0.0000267298,0.000030152452,0.0027739515,0.00059865374,0.9949292,0.0015508829,0.000008078104],"about_ca_topic_score_codex":0.0014552292,"about_ca_topic_score_gemma":0.0010380647,"teacher_disagreement_score":0.006475357,"about_ca_system_score_codex":0.003043814,"about_ca_system_score_gemma":0.0021542832,"threshold_uncertainty_score":0.022084534},"labels":[],"label_agreement":null},{"id":"W123374098","doi":"10.1007/978-3-319-11212-1_4","title":"Large Universe Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Attribute-based encryption; Traitor tracing; Traceability; Encryption; Ciphertext; Key (lock); Computer security; Overhead (engineering); Access control; Database; Public-key cryptography; Operating system; Software engineering","score_opus":0.011143646232620067,"score_gpt":0.22962481435137308,"score_spread":0.218481168118753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123374098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02893322,0.0004120664,0.95608485,0.000499069,0.00016126092,0.00015133033,0.00022441491,0.0018324554,0.011701327],"genre_scores_gemma":[0.784505,0.0004641386,0.20128927,0.00026906203,0.00014841103,0.00017455635,0.00045115824,0.00035486397,0.012343453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711895,0.000667933,0.00021364674,0.00039229952,0.0011552597,0.00045196508],"domain_scores_gemma":[0.9955258,0.0012943532,0.00018860899,0.0023836114,0.0004436831,0.00016393137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019408413,0.00053252844,0.001223485,0.0006145604,0.0010101387,0.0031738637,0.0015443945,0.0009866966,0.0046960823],"category_scores_gemma":[0.004845483,0.00038689421,0.00089516945,0.0014798103,0.0016763438,0.007006373,0.003938418,0.0032104175,0.0018178256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068706233,0.00023986217,0.0004067923,0.00021255473,0.00006247394,0.00027073335,0.0002939685,0.034184076,0.016940821,0.8280717,0.007684092,0.11094582],"study_design_scores_gemma":[0.00009881617,0.00012017826,0.0002365481,0.0000461622,0.000042675107,0.0003566671,0.000054775333,0.26009974,0.028260067,0.69984615,0.010779894,0.000058330126],"about_ca_topic_score_codex":0.0005551626,"about_ca_topic_score_gemma":0.00042979865,"teacher_disagreement_score":0.0046960823,"about_ca_system_score_codex":0.0015564582,"about_ca_system_score_gemma":0.0016980255,"threshold_uncertainty_score":0.015709937},"labels":[],"label_agreement":null},{"id":"W1247648998","doi":"10.1007/978-3-642-40084-1_3","title":"Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Israel Science Foundation","keywords":"Computer science; Electronic circuit; Computation; Secure multi-party computation; Theoretical computer science; Algorithm; Electrical engineering","score_opus":0.01578873189766865,"score_gpt":0.24816522096256566,"score_spread":0.232376489064897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1247648998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023373226,0.0012588219,0.9527795,0.000979472,0.00084461295,0.0002555527,0.00027323747,0.0045077694,0.015727798],"genre_scores_gemma":[0.5380606,0.0011959905,0.43312997,0.001182456,0.00058900355,0.00030579316,0.0008442001,0.0015722401,0.023119757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941414,0.0013657773,0.00044167263,0.0011988413,0.0021069234,0.00074540364],"domain_scores_gemma":[0.99248016,0.002992118,0.0003091774,0.0034147426,0.00061490835,0.00018900823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026085926,0.0020555493,0.0026527087,0.0019936382,0.0011698467,0.0057849726,0.0035354309,0.0027788747,0.014811423],"category_scores_gemma":[0.009879188,0.0012268751,0.002945209,0.0031063817,0.0038624534,0.015719129,0.007526621,0.0072815698,0.003679276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012866047,0.00037090667,0.00050494727,0.000782034,0.00016793895,0.00040131927,0.0003280637,0.03652661,0.024231102,0.70918727,0.009661695,0.2165515],"study_design_scores_gemma":[0.0002500211,0.00018723735,0.00018331649,0.00013790831,0.00012909962,0.0004252459,0.00006186486,0.14224184,0.029263005,0.8115173,0.015495128,0.000108039734],"about_ca_topic_score_codex":0.0005964334,"about_ca_topic_score_gemma":0.0007939591,"teacher_disagreement_score":0.014811423,"about_ca_system_score_codex":0.0017394794,"about_ca_system_score_gemma":0.0018857718,"threshold_uncertainty_score":0.049549162},"labels":[],"label_agreement":null},{"id":"W12547246","doi":"10.1007/978-3-319-07536-5_8","title":"Private Message Transmission Using Disjoint Paths","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Disjoint sets; Alice and Bob; Computer science; Transmission (telecommunications); Protocol (science); Alice (programming language); Information leakage; Algorithm; Information transmission; Multipath propagation; Discrete mathematics; Computer network; Theoretical computer science; Arithmetic; Mathematics; Telecommunications","score_opus":0.01702414394061469,"score_gpt":0.24238550559854916,"score_spread":0.22536136165793447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12547246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017632445,0.0008058616,0.95562476,0.00052900193,0.00022130371,0.00018084551,0.00017025715,0.0008855256,0.02394994],"genre_scores_gemma":[0.6297331,0.0020875002,0.32494566,0.000410725,0.00028475863,0.00052502425,0.00047798123,0.00039661615,0.041138623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978967,0.0005265603,0.000121577425,0.0003750517,0.0007947753,0.00028530278],"domain_scores_gemma":[0.9966372,0.0018253436,0.00019709095,0.0010256944,0.0002475684,0.00006697968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013675811,0.0010360779,0.0011887697,0.0012957032,0.0013540573,0.0020064702,0.0012612266,0.0012064949,0.008392889],"category_scores_gemma":[0.0048428075,0.0007001014,0.00066952204,0.0016831269,0.0013338628,0.0045588245,0.004883058,0.0018981274,0.0021459707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006453885,0.00014041,0.00026429162,0.0004378226,0.00012166489,0.00024624798,0.0004631659,0.04931641,0.017881276,0.63807434,0.008753234,0.28365576],"study_design_scores_gemma":[0.00017150858,0.00023070905,0.00021159386,0.0001432598,0.00011495045,0.0009309074,0.00010457238,0.25926748,0.026059788,0.68366134,0.029025145,0.0000787933],"about_ca_topic_score_codex":0.000280459,"about_ca_topic_score_gemma":0.00029074764,"teacher_disagreement_score":0.008392889,"about_ca_system_score_codex":0.0010012358,"about_ca_system_score_gemma":0.0010571938,"threshold_uncertainty_score":0.028077066},"labels":[],"label_agreement":null},{"id":"W135777109","doi":"10.1016/j.scient.2013.05.002","title":"Secure untraceable off-line electronic cash system","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Electronic cash; Anonymity; Computer science; Scheme (mathematics); Computer security; Identity (music); Internet privacy; World Wide Web; Payment","score_opus":0.006082017936117052,"score_gpt":0.20400721141720313,"score_spread":0.1979251934810861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135777109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5341705,0.0012054264,0.3602018,0.001961338,0.00072254956,0.00064126746,0.0022994592,0.018295692,0.08050195],"genre_scores_gemma":[0.97102463,0.00010226996,0.0071220146,0.00013043254,0.00006580187,0.0000633407,0.00035913158,0.00010226381,0.0210302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985897,0.00020168792,0.00006501007,0.00020828078,0.00043014486,0.0005051629],"domain_scores_gemma":[0.99800426,0.00028845613,0.00018126372,0.0010550997,0.00033129493,0.00013948255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007085219,0.0004947534,0.0005907445,0.0006001524,0.0011995855,0.0021031438,0.0010828101,0.0008534465,0.011314794],"category_scores_gemma":[0.0015476282,0.00021465163,0.00028466582,0.0005251149,0.0007792826,0.0023911018,0.0024075462,0.001012985,0.003083355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0102031985,0.0012822343,0.0051659457,0.0004876964,0.00018210647,0.004996203,0.001211037,0.039943483,0.21734694,0.33088055,0.04954319,0.33875746],"study_design_scores_gemma":[0.001053798,0.0014677386,0.0052237147,0.00016274181,0.0002722803,0.0026241802,0.00023459205,0.40563288,0.3114938,0.1722584,0.09930538,0.00027047592],"about_ca_topic_score_codex":0.0011521253,"about_ca_topic_score_gemma":0.0010039696,"teacher_disagreement_score":0.011314794,"about_ca_system_score_codex":0.0011920506,"about_ca_system_score_gemma":0.0012692466,"threshold_uncertainty_score":0.03785169},"labels":[],"label_agreement":null},{"id":"W1417471449","doi":"10.1007/978-3-642-27576-0_14","title":"Optimal One Round Almost Perfectly Secure Message Transmission (Short Paper)","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Protocol (science); Transmission (telecommunications); Modular design; Modular construction; Computer science; Transmission rate; Discrete mathematics; Computer network; Mathematics; Combinatorics; Telecommunications; Operating system","score_opus":0.017114601076291848,"score_gpt":0.23978471017740682,"score_spread":0.22267010910111498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1417471449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055473495,0.0041303695,0.8361476,0.0039626863,0.0013552076,0.00019585901,0.0011600502,0.0015519138,0.09602282],"genre_scores_gemma":[0.7789514,0.0032590483,0.15287957,0.0009891711,0.0013287471,0.00022034353,0.00087181764,0.0005358166,0.060964078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776673,0.000489359,0.000102709826,0.0005368718,0.00068155193,0.00042268506],"domain_scores_gemma":[0.9973847,0.0014928614,0.00021141107,0.00060490187,0.00019294022,0.00011318372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012406152,0.0012647543,0.0015487286,0.0007111223,0.00091943535,0.0020385755,0.0013326958,0.001768504,0.014663187],"category_scores_gemma":[0.0040903087,0.00089544285,0.00085066253,0.0012261512,0.0017858137,0.0035050954,0.0030357721,0.0020978893,0.00351617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015943428,0.00026899567,0.0006260591,0.00087956985,0.0002282608,0.00027932393,0.00023088165,0.21023144,0.018048234,0.5254407,0.03729339,0.20487888],"study_design_scores_gemma":[0.000117800526,0.00022888118,0.0007564769,0.00016273007,0.00010859488,0.00041967456,0.00005208611,0.40296984,0.0140566435,0.5671111,0.013912688,0.00010352318],"about_ca_topic_score_codex":0.0006453995,"about_ca_topic_score_gemma":0.00081999105,"teacher_disagreement_score":0.014663187,"about_ca_system_score_codex":0.0018940585,"about_ca_system_score_gemma":0.0019526902,"threshold_uncertainty_score":0.04905325},"labels":[],"label_agreement":null},{"id":"W143274136","doi":"10.1007/978-3-642-36362-7_28","title":"Rate-Limited Secure Function Evaluation: Definitions and Constructions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Protocol (science); Random oracle; Mathematical proof; Compiler; Stateless protocol; Overhead (engineering); Correctness; Theoretical computer science; State (computer science); Programming language; Computer network; Mathematics; Public-key cryptography","score_opus":0.03294323945451356,"score_gpt":0.241773257592287,"score_spread":0.20883001813777344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143274136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012676244,0.0050658523,0.91258436,0.0016074346,0.00035895852,0.00018273167,0.00030812822,0.0005919498,0.06662431],"genre_scores_gemma":[0.57014465,0.0127815865,0.35151163,0.0013509898,0.0017309003,0.0010850147,0.0007191514,0.0009520328,0.059723936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941613,0.0017015052,0.0004744049,0.00080545753,0.0023180712,0.0005391345],"domain_scores_gemma":[0.99415416,0.0031954516,0.00032488647,0.0015392862,0.00058331015,0.00020291998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057328963,0.0018574825,0.0019524011,0.0028219807,0.0018423935,0.006733164,0.00293203,0.002428843,0.0055443486],"category_scores_gemma":[0.0109893475,0.0011780267,0.00195209,0.0044179335,0.007530341,0.013220757,0.006091667,0.0073476974,0.0028958707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025419158,0.000011907758,0.00003826111,0.00005921912,0.0000057953243,0.000025182913,0.00007766788,0.0009968646,0.00048760057,0.9872449,0.0010039518,0.010023212],"study_design_scores_gemma":[0.000013300152,0.00004323657,0.000049353705,0.00007899172,0.000022642085,0.00027044487,0.000027152058,0.008687036,0.0029179468,0.97639126,0.011466969,0.000031656662],"about_ca_topic_score_codex":0.00033025976,"about_ca_topic_score_gemma":0.00019732043,"teacher_disagreement_score":0.006733164,"about_ca_system_score_codex":0.0033601313,"about_ca_system_score_gemma":0.0014115262,"threshold_uncertainty_score":0.030318797},"labels":[],"label_agreement":null},{"id":"W1444918406","doi":"10.1007/978-3-319-21966-0_6","title":"Privacy-Preserving Distance-Bounding Proof-of-Knowledge","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Gas meter prover; Anonymity; Computer science; Protocol (science); Bounding overwatch; Discrete mathematics; Public-key cryptography; Computer security; Combinatorics; Mathematics; Mathematical proof; Encryption","score_opus":0.03646465178910363,"score_gpt":0.28133050551089944,"score_spread":0.2448658537217958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1444918406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068065273,0.0014971419,0.9575315,0.0019500515,0.0002712339,0.00014611614,0.00038212448,0.0010429387,0.030372245],"genre_scores_gemma":[0.6014685,0.004352589,0.357178,0.001399335,0.0009216308,0.0005241972,0.0014729416,0.00068039144,0.032002382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876951,0.002793873,0.0006517357,0.0018683274,0.0055188686,0.0014721482],"domain_scores_gemma":[0.97531223,0.013731504,0.00097601966,0.007960174,0.0014973008,0.00052277755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044526346,0.0016892714,0.0026491496,0.0021673443,0.002260244,0.006669045,0.0062542143,0.0037220216,0.008443898],"category_scores_gemma":[0.027334368,0.0016717218,0.0026302577,0.0042491322,0.0055196895,0.018578485,0.01485394,0.009321031,0.003918669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019127384,0.00008877635,0.00018947068,0.0003473778,0.00005860986,0.00012372495,0.0002939335,0.018931743,0.0015364515,0.89730805,0.00878212,0.072148375],"study_design_scores_gemma":[0.000031307285,0.000029846507,0.000066725326,0.00006673188,0.000034963523,0.0002938209,0.00003277723,0.04821376,0.0028579591,0.9395139,0.008825137,0.000033097687],"about_ca_topic_score_codex":0.0007143639,"about_ca_topic_score_gemma":0.00041028805,"teacher_disagreement_score":0.008443898,"about_ca_system_score_codex":0.0029163642,"about_ca_system_score_gemma":0.0032412538,"threshold_uncertainty_score":0.028247654},"labels":[],"label_agreement":null},{"id":"W1467237292","doi":"10.1007/978-3-662-47989-6_11","title":"Reproducible Circularly-Secure Bit Encryption: Applications and Realizations","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Encryption; Probabilistic encryption; Computer science; 40-bit encryption; 56-bit encryption; Theoretical computer science; Deterministic encryption; Multiple encryption; Plaintext-aware encryption; Cryptographic primitive; Cryptography; Algorithm; Computer security; Cryptographic protocol","score_opus":0.027452252509168322,"score_gpt":0.26233597664488306,"score_spread":0.23488372413571473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1467237292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06312935,0.0038919135,0.81425947,0.001503969,0.0006615962,0.00017495606,0.00043309142,0.00056940364,0.1153761],"genre_scores_gemma":[0.78039056,0.0052149296,0.16908613,0.0005102854,0.0009014002,0.00031787727,0.00045762584,0.00047959734,0.042641584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988243,0.0002212179,0.0000919765,0.00018370888,0.0005216174,0.00015725281],"domain_scores_gemma":[0.99848527,0.0004944715,0.0001466879,0.00057525194,0.00023306913,0.00006529056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012559216,0.0010767262,0.0010574093,0.00094594073,0.001271407,0.0034071107,0.0012356514,0.0020669114,0.005256495],"category_scores_gemma":[0.0032236576,0.0006985888,0.0010882128,0.0016475439,0.0027932993,0.0039361906,0.00226104,0.0030340566,0.002484748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045548837,0.0000195588,0.000039284503,0.000057650283,0.0000050567364,0.000048577665,0.000052731357,0.002710521,0.0030241075,0.985631,0.0008320727,0.00753407],"study_design_scores_gemma":[0.000028730363,0.000048659876,0.00007014852,0.000034356177,0.000011101468,0.00021024606,0.000022105147,0.033160124,0.008787217,0.95178896,0.005803876,0.000034530007],"about_ca_topic_score_codex":0.00019842281,"about_ca_topic_score_gemma":0.00017051976,"teacher_disagreement_score":0.005256495,"about_ca_system_score_codex":0.0012648224,"about_ca_system_score_gemma":0.00087886106,"threshold_uncertainty_score":0.017584741},"labels":[],"label_agreement":null},{"id":"W148149816","doi":"10.1007/978-3-319-03515-4_12","title":"On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Computer science; Cheating; Scheme (mathematics); RSS; Computer security; Access structure; Theoretical computer science; Shamir's Secret Sharing; Homomorphic secret sharing; Algorithm; Mathematics; Cryptography; World Wide Web","score_opus":0.017609588989595006,"score_gpt":0.21191658323344859,"score_spread":0.1943069942438536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148149816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04480378,0.0033014505,0.92035484,0.0013392862,0.00017717948,0.00015185215,0.00018947625,0.0002311912,0.029450975],"genre_scores_gemma":[0.86026126,0.0036992137,0.11860322,0.0006666648,0.0006516629,0.00035462584,0.00024359432,0.000518604,0.015001124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99182194,0.0034585148,0.000272255,0.0011053523,0.0022696801,0.0010722125],"domain_scores_gemma":[0.95729023,0.03435463,0.0014708771,0.004872225,0.001615847,0.00039627365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009294343,0.0026641847,0.0037446981,0.0023224643,0.0015037239,0.0048457244,0.005001976,0.0032941876,0.007858016],"category_scores_gemma":[0.03538765,0.0012583361,0.0025008176,0.0044769426,0.008247147,0.013987901,0.006503961,0.004968281,0.0011969239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089846103,0.00015169918,0.0004947008,0.00043946021,0.00018809,0.00014315412,0.0003248553,0.13413253,0.0074234456,0.7924005,0.004173624,0.05922953],"study_design_scores_gemma":[0.000045293673,0.000113090384,0.00023568103,0.00006282799,0.00007896652,0.00016765973,0.000054272015,0.3868597,0.0036540087,0.6070312,0.0016518073,0.000045495235],"about_ca_topic_score_codex":0.00091070187,"about_ca_topic_score_gemma":0.0005084409,"teacher_disagreement_score":0.009294343,"about_ca_system_score_codex":0.00412865,"about_ca_system_score_gemma":0.0019770844,"threshold_uncertainty_score":0.049153805},"labels":[],"label_agreement":null},{"id":"W1483992070","doi":"10.1007/3-540-44983-3_10","title":"Dynamic Multi-threshold Metering Schemes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Metering mode; Computer science; Server; Frame (networking); Audit; Construct (python library); Scheme (mathematics); Focus (optics); Real-time computing; Protocol (science); Computer network; Distributed computing; Mathematics; Engineering; Accounting; Business","score_opus":0.021845255038977194,"score_gpt":0.261660223650158,"score_spread":0.23981496861118082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483992070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03406328,0.0021441525,0.9060258,0.001340695,0.00044413915,0.00020959141,0.00028179758,0.0014618539,0.054028705],"genre_scores_gemma":[0.778079,0.0018403695,0.16595754,0.0005525148,0.00026622514,0.0002265975,0.00044233148,0.00021328419,0.052422147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986745,0.00024415393,0.00008990131,0.00025200343,0.00050814415,0.0002313837],"domain_scores_gemma":[0.99755716,0.0004470527,0.00019912656,0.0014709112,0.00021856868,0.00010722431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011282407,0.00073104067,0.0008370932,0.00094997254,0.0011154765,0.0020043545,0.0020882008,0.0011890392,0.007848252],"category_scores_gemma":[0.0032871515,0.0005021991,0.0005283915,0.002061829,0.0012841405,0.005418372,0.003790116,0.002879472,0.002447976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045400005,0.00014165966,0.00049636274,0.0002935514,0.000040729483,0.00014956678,0.00030928143,0.018267127,0.025929943,0.7019729,0.008306917,0.24363792],"study_design_scores_gemma":[0.00018836657,0.00028529434,0.00070978183,0.00018151282,0.00009855072,0.0020395077,0.00016392594,0.19073282,0.05704116,0.6406089,0.10783799,0.000112217596],"about_ca_topic_score_codex":0.0001098221,"about_ca_topic_score_gemma":0.00011862124,"teacher_disagreement_score":0.007848252,"about_ca_system_score_codex":0.001472965,"about_ca_system_score_gemma":0.0006684771,"threshold_uncertainty_score":0.026255071},"labels":[],"label_agreement":null},{"id":"W1484056815","doi":"10.1007/978-3-642-30057-8_5","title":"Waters Signatures with Optimal Security Reduction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reduction (mathematics); Cryptosystem; Computer science; Signature (topology); Concrete security; Pairing; Theoretical computer science; Adversarial system; Cryptography; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.009463093335293276,"score_gpt":0.21925516858228092,"score_spread":0.20979207524698765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484056815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04891486,0.001823173,0.70567226,0.004929699,0.0015771689,0.00032619352,0.0007943522,0.0032671755,0.23269507],"genre_scores_gemma":[0.61424255,0.0020534694,0.24085708,0.0014314392,0.0010313112,0.00046430476,0.0013483043,0.0016149931,0.13695666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968939,0.0005611697,0.00016944023,0.00044179044,0.0014419324,0.0004917479],"domain_scores_gemma":[0.9987797,0.0003594912,0.00006400259,0.00055922125,0.0001743202,0.00006315802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011428186,0.001255518,0.0013959835,0.0012552207,0.001687206,0.0033768162,0.0015332907,0.0015137893,0.016755706],"category_scores_gemma":[0.0036992477,0.0008478877,0.00152741,0.001920554,0.003048626,0.007448196,0.005453272,0.0051717185,0.007083582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019271119,0.000064297405,0.00006237281,0.000118295764,0.000021996022,0.00004577008,0.000105335406,0.0058921054,0.0030145189,0.9070044,0.009993064,0.073485166],"study_design_scores_gemma":[0.000024432627,0.00001944244,0.000026268317,0.000016355756,0.000013178768,0.0000640669,0.00002891268,0.007962515,0.004238839,0.9749279,0.012660484,0.00001767282],"about_ca_topic_score_codex":0.00048643042,"about_ca_topic_score_gemma":0.0004920102,"teacher_disagreement_score":0.016755706,"about_ca_system_score_codex":0.0015312749,"about_ca_system_score_gemma":0.0019823688,"threshold_uncertainty_score":0.0560534},"labels":[],"label_agreement":null},{"id":"W1485214605","doi":"10.1007/11428862_84","title":"Computing Valuation Popov Forms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Waterloo","funders":"","keywords":"Valuation (finance); Noncommutative geometry; Mathematics; Pure mathematics; Mathematical economics; Algebra over a field; Economics; Finance","score_opus":0.020939754484880613,"score_gpt":0.2613913306737741,"score_spread":0.2404515761888935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485214605","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2589361,0.0027257928,0.27476606,0.0026683542,0.0007605469,0.000107672386,0.00089871086,0.0007252782,0.45841143],"genre_scores_gemma":[0.88916147,0.0018315533,0.029501505,0.00028320996,0.0005618424,0.000084113795,0.00089044654,0.00031839783,0.07736743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945813,0.00011941679,0.000025848758,0.00009606937,0.00020040743,0.000100138896],"domain_scores_gemma":[0.9993687,0.0002380826,0.0000556016,0.00013461626,0.00011372305,0.000089228124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071973633,0.0008634305,0.0010088244,0.002504347,0.0014400731,0.004706353,0.0008181624,0.000485562,0.016444458],"category_scores_gemma":[0.0027184323,0.0005153735,0.0006803303,0.0027681591,0.0024941487,0.006876893,0.002742406,0.002608837,0.003027023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015461263,0.0000071652044,0.00014178753,0.00002209715,0.000004688022,0.00001885795,0.0001074814,0.00038598716,0.00020241289,0.9856468,0.0015976204,0.011849685],"study_design_scores_gemma":[0.000003784857,0.00000614282,0.00007557006,0.000012442967,0.0000047549547,0.000038644954,0.00004737987,0.0010456298,0.00026324746,0.99097013,0.007527465,0.00000477709],"about_ca_topic_score_codex":0.00034303762,"about_ca_topic_score_gemma":0.00035063643,"teacher_disagreement_score":0.016444458,"about_ca_system_score_codex":0.001206715,"about_ca_system_score_gemma":0.00048463888,"threshold_uncertainty_score":0.055012167},"labels":[],"label_agreement":null},{"id":"W1487545695","doi":"10.1007/978-3-642-20728-0_10","title":"Unconditionally Secure Signature Schemes Revisited","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Digital signature; Signature (topology); Scheme (mathematics); Computer security; Context (archaeology); Theoretical computer science; Resolution (logic); Sign (mathematics); Formal description; Algorithm; Programming language; Mathematics","score_opus":0.014172668106645593,"score_gpt":0.23066639085473495,"score_spread":0.21649372274808937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487545695","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037330847,0.011252798,0.62209,0.022651138,0.0033759538,0.00016493938,0.00037919037,0.001044885,0.3017103],"genre_scores_gemma":[0.7144545,0.0070975893,0.097437344,0.002332606,0.0028937552,0.00025963734,0.00034774045,0.0003883667,0.17478849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594754,0.0011197764,0.00023456482,0.00056278025,0.0016843004,0.0004510881],"domain_scores_gemma":[0.9955382,0.0018439281,0.0002209536,0.0017912276,0.00045982376,0.00014575341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030147976,0.0010303756,0.0010370733,0.0011854628,0.0024644695,0.005652139,0.0023859867,0.0028726372,0.009509442],"category_scores_gemma":[0.006442667,0.0009977939,0.00083178544,0.002644734,0.006863713,0.017045317,0.0057923384,0.012594932,0.0050223363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012531658,0.000007227827,0.000011997795,0.00002085267,0.0000022094287,0.000018275969,0.00009655722,0.00028889772,0.00034856822,0.9898986,0.00138683,0.007907407],"study_design_scores_gemma":[0.00000924266,0.000014131232,0.000023573906,0.000018841742,0.0000062196427,0.00010202782,0.00003173305,0.0016149282,0.0010205464,0.97696984,0.020177206,0.000011706737],"about_ca_topic_score_codex":0.00036089012,"about_ca_topic_score_gemma":0.000261278,"teacher_disagreement_score":0.009509442,"about_ca_system_score_codex":0.003045658,"about_ca_system_score_gemma":0.0021166801,"threshold_uncertainty_score":0.03181225},"labels":[],"label_agreement":null},{"id":"W1487872532","doi":"10.1109/bigdatacongress.2015.96","title":"Computation and Search over Encrypted XML Documents","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Homomorphic encryption; XML; Encryption; Cloud computing; Computation; XML Encryption; Database; Index (typography); XML Signature; Information retrieval; Efficient XML Interchange; Computer security; World Wide Web; Operating system; Algorithm","score_opus":0.03231016123522345,"score_gpt":0.29920365433973656,"score_spread":0.2668934931045131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487872532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20488866,0.0016606872,0.7707539,0.0023301565,0.00014987648,0.00020318144,0.0007283344,0.001059789,0.018225396],"genre_scores_gemma":[0.768221,0.0011897547,0.21811159,0.0002523282,0.00013371892,0.00011907995,0.0007440457,0.0001234963,0.011104963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979779,0.00045395558,0.00025377443,0.00026784145,0.0008305333,0.00021604291],"domain_scores_gemma":[0.9970482,0.0014728381,0.0002737789,0.0008316844,0.0002907682,0.00008290544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012153763,0.00029344836,0.00072012364,0.0007092965,0.00086013484,0.0024344134,0.0007254418,0.0008125783,0.0029730983],"category_scores_gemma":[0.004647406,0.00026992452,0.0007095754,0.0015994208,0.0011315035,0.005550951,0.0016575253,0.00076449744,0.00090265565],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013284311,0.00022573906,0.0037293192,0.0006358819,0.00012319117,0.0014515226,0.0012188928,0.1507239,0.04013691,0.58644783,0.012144262,0.2018341],"study_design_scores_gemma":[0.0001346709,0.00015985582,0.00089962425,0.0000695627,0.000050585266,0.0012919378,0.00041155546,0.6631046,0.047155183,0.2708337,0.01584808,0.00004064648],"about_ca_topic_score_codex":0.0012043747,"about_ca_topic_score_gemma":0.0012521239,"teacher_disagreement_score":0.0029730983,"about_ca_system_score_codex":0.0011202995,"about_ca_system_score_gemma":0.0010893133,"threshold_uncertainty_score":0.009946048},"labels":[],"label_agreement":null},{"id":"W1488807031","doi":"10.1007/11941378_11","title":"On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Public-key cryptography; Ephemeral key; Key (lock); Key-agreement protocol; Discrete logarithm; Protocol (science); Computer security; Diffie–Hellman key exchange; Mathematical proof; Cryptographic protocol; Key exchange; Key management; Representation (politics); Theoretical computer science; Cryptography; Key distribution; Encryption; Mathematics; Law; Political science","score_opus":0.032046700323440654,"score_gpt":0.2681816712348219,"score_spread":0.23613497091138125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488807031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020345597,0.0152007295,0.8557558,0.0131423315,0.0022557976,0.00033957866,0.00015653874,0.00048059836,0.09232302],"genre_scores_gemma":[0.69511104,0.021701926,0.24260052,0.0035649242,0.004405981,0.0007012194,0.00033789544,0.000910587,0.030665996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9793011,0.009352824,0.0012013353,0.0018163917,0.0067857844,0.0015425435],"domain_scores_gemma":[0.86757225,0.10555259,0.0024711706,0.017832952,0.00580116,0.0007698881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026775625,0.001595821,0.00268689,0.0021639678,0.003962848,0.009592408,0.0050277817,0.0070503294,0.0072386074],"category_scores_gemma":[0.09322132,0.002233426,0.0016572129,0.003228824,0.016198145,0.053193476,0.009417717,0.018581636,0.0024367499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028503896,0.000049248036,0.00029283884,0.00018562809,0.000018792236,0.00020121818,0.00038521714,0.005626164,0.0011703355,0.9488465,0.0034992266,0.039439805],"study_design_scores_gemma":[0.00005143059,0.00006404927,0.00018271728,0.0002509257,0.000045909997,0.0003615681,0.00015440946,0.04842001,0.0025892071,0.9367035,0.011102972,0.00007315291],"about_ca_topic_score_codex":0.0019093562,"about_ca_topic_score_gemma":0.0013109142,"teacher_disagreement_score":0.026775625,"about_ca_system_score_codex":0.0037532237,"about_ca_system_score_gemma":0.0028470343,"threshold_uncertainty_score":0.14160472},"labels":[],"label_agreement":null},{"id":"W1489428148","doi":"10.1109/cwit.2015.7255155","title":"Database query privacy using homomorphic encryptions","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Plaintext; Ciphertext; Homomorphic secret sharing; Multiple encryption; Probabilistic encryption; On-the-fly encryption; Scheme (mathematics); Theoretical computer science; 40-bit encryption; Client-side encryption; Computer security; Cryptography; Mathematics; Secure multi-party computation","score_opus":0.10812961857907898,"score_gpt":0.30127437997316286,"score_spread":0.19314476139408387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489428148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022738142,0.0013517982,0.9556975,0.0018283167,0.000102519225,0.00016356268,0.0003108282,0.0006301175,0.017177273],"genre_scores_gemma":[0.8238831,0.0029715719,0.1609956,0.0007898554,0.0004259274,0.0003380198,0.0004257753,0.00011894535,0.01005116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99325997,0.0020582047,0.0005494346,0.000843816,0.00274432,0.0005442913],"domain_scores_gemma":[0.99292445,0.0024816326,0.0004121519,0.0035683336,0.00047784383,0.00013564367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038919083,0.0005280695,0.001153058,0.0010375022,0.0011011856,0.004467167,0.0016211469,0.0018053623,0.002632942],"category_scores_gemma":[0.0073861373,0.00063950766,0.0011573611,0.001845092,0.0026495971,0.010406938,0.0044308677,0.002972738,0.0011665679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021215263,0.00007857153,0.00048307204,0.00014833327,0.00003822236,0.00028920412,0.00036905947,0.012237702,0.0044928933,0.9234975,0.0035705783,0.054582693],"study_design_scores_gemma":[0.00013470932,0.00016642586,0.0004041149,0.000088714165,0.000073923606,0.0014725782,0.00016822311,0.17293665,0.014383672,0.7821551,0.027955234,0.000060726412],"about_ca_topic_score_codex":0.0005384709,"about_ca_topic_score_gemma":0.00029358687,"teacher_disagreement_score":0.004467167,"about_ca_system_score_codex":0.0014705879,"about_ca_system_score_gemma":0.0014773753,"threshold_uncertainty_score":0.020582676},"labels":[],"label_agreement":null},{"id":"W1491408478","doi":"10.1109/wirles.2005.1549408","title":"Improving the Diffie-Hellman Secure Key Exchange","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Diffie–Hellman key exchange; Key exchange; Key (lock); Prime (order theory); Cryptography; Generator (circuit theory); Public-key cryptography; Discrete mathematics; Computer science; Integer (computer science); Domain (mathematical analysis); Symmetric-key algorithm; Algorithm; Combinatorics; Mathematics; Theoretical computer science; Encryption; Computer network; Computer security; Physics","score_opus":0.009834475060566084,"score_gpt":0.21212011609400339,"score_spread":0.2022856410334373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491408478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031176398,0.0025748801,0.951056,0.00089943013,0.0005405636,0.00029459764,0.000115585906,0.0012384396,0.012104073],"genre_scores_gemma":[0.38076797,0.002810149,0.60685045,0.00046355408,0.00046692297,0.00023979043,0.00037025983,0.00014789059,0.007882968],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496424,0.0012683504,0.00038245626,0.0006570089,0.002319762,0.0004081403],"domain_scores_gemma":[0.99486935,0.001501805,0.00025649488,0.00197898,0.0012626239,0.00013070052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037175156,0.0008552856,0.0013637507,0.0010846148,0.00093044946,0.0015233823,0.002866352,0.0016453351,0.0034066201],"category_scores_gemma":[0.01113446,0.00040109866,0.000882598,0.0015930746,0.0014650312,0.008970554,0.00324408,0.0020158803,0.002103323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010259496,0.00041936937,0.0024268103,0.00059949845,0.00013847667,0.00054912403,0.0005743591,0.058368266,0.033611987,0.3233126,0.016092677,0.56288093],"study_design_scores_gemma":[0.00037007366,0.0005201303,0.0014422968,0.00009373929,0.00016974575,0.0014478582,0.00024477212,0.62432706,0.06739903,0.20876516,0.095049836,0.00017025402],"about_ca_topic_score_codex":0.0007558441,"about_ca_topic_score_gemma":0.000370055,"teacher_disagreement_score":0.0037175156,"about_ca_system_score_codex":0.0008312494,"about_ca_system_score_gemma":0.0013622975,"threshold_uncertainty_score":0.019660294},"labels":[],"label_agreement":null},{"id":"W1492812875","doi":"10.1109/sp.2015.31","title":"Malicious-Client Security in Blind Seer: A Scalable Private DBMS","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Scalability; Database; Private information retrieval; Sargable; Access control; Computer security; Web search query; Information retrieval; Search engine","score_opus":0.026358316001841377,"score_gpt":0.2614187890034859,"score_spread":0.23506047300164454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492812875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067940675,0.0006028054,0.8998992,0.0013170317,0.00008750047,0.000411894,0.00041645207,0.02178585,0.0075387126],"genre_scores_gemma":[0.70914537,0.0003149006,0.2784432,0.00080921035,0.00010737725,0.00019397853,0.0005897701,0.0009883584,0.009407949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443346,0.0010502768,0.00039181914,0.00076531165,0.0028050055,0.0005541517],"domain_scores_gemma":[0.99284595,0.0010155479,0.0003703039,0.0048688,0.00063036184,0.00026896285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046935137,0.00065168703,0.0012940026,0.00077020953,0.001384825,0.0031186354,0.00311416,0.0017973866,0.0046783704],"category_scores_gemma":[0.0069522806,0.0007152914,0.001057966,0.0013139128,0.0029258025,0.008991295,0.007455204,0.0024725513,0.0016295144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037725559,0.0008673014,0.006543036,0.00057580945,0.0002977496,0.0014186617,0.0018153838,0.052049045,0.1476986,0.3558347,0.03528772,0.39383942],"study_design_scores_gemma":[0.0005497694,0.0005982363,0.0015690218,0.000080923644,0.00012180328,0.0018229593,0.00029272027,0.6472949,0.14562821,0.16127273,0.040509984,0.0002587535],"about_ca_topic_score_codex":0.0015790564,"about_ca_topic_score_gemma":0.0012904623,"teacher_disagreement_score":0.0046935137,"about_ca_system_score_codex":0.001290391,"about_ca_system_score_gemma":0.002192201,"threshold_uncertainty_score":0.024821937},"labels":[],"label_agreement":null},{"id":"W1493874060","doi":"10.1023/a:1019217210183","title":"Digital payment systems for Internet commerce: The state of the art","year":2000,"lang":"en","type":"article","venue":"World Wide Web","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Payment; The Internet; Context (archaeology); Principal (computer security); Protocol (science); Taxonomy (biology); World Wide Web; Computer security","score_opus":0.010617747578999234,"score_gpt":0.2196965376633797,"score_spread":0.20907879008438046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493874060","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022878159,0.7394559,0.12373682,0.032329135,0.0024060959,0.0002271259,0.00013894512,0.0006274994,0.07820027],"genre_scores_gemma":[0.35606974,0.54302084,0.072443746,0.004561856,0.0063038836,0.00015691321,0.0003288765,0.00013575086,0.016978411],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99566585,0.0016325535,0.00027149892,0.00043283578,0.0016865046,0.00031087932],"domain_scores_gemma":[0.9879381,0.0076562995,0.0009572774,0.0013016694,0.0017785622,0.0003681622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006286958,0.00063637435,0.001025761,0.0022940212,0.0010214064,0.010639578,0.0017432476,0.0039991364,0.009224062],"category_scores_gemma":[0.010116908,0.0005520799,0.00048552107,0.00503576,0.004026867,0.01681662,0.0021845698,0.0034366678,0.0042628064],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020330079,0.00022151042,0.0013056103,0.0018671512,0.000036292346,0.000059253904,0.00023241382,0.0023644706,0.0015341894,0.28724018,0.014243939,0.69069165],"study_design_scores_gemma":[0.000085839456,0.00043358968,0.002839513,0.0034790388,0.00011751945,0.0011621541,0.0008088359,0.044346992,0.006960779,0.32060575,0.61901426,0.00014564302],"about_ca_topic_score_codex":0.0007686624,"about_ca_topic_score_gemma":0.0004274195,"teacher_disagreement_score":0.010639578,"about_ca_system_score_codex":0.002550277,"about_ca_system_score_gemma":0.0023290773,"threshold_uncertainty_score":0.03324902},"labels":[],"label_agreement":null},{"id":"W1494042884","doi":"10.1007/3-540-45961-8_13","title":"An Interactive Data Exchange Protocol Based on Discrete Exponentiation","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Key exchange; Exponentiation; Data exchange; Cryptographic protocol; Oakley protocol; Public-key cryptography; Computer network; Otway–Rees protocol; Authentication protocol; Cryptography; Wide Mouth Frog protocol; Authentication (law); Universal composability; Computer security; Encryption; Challenge-Handshake Authentication Protocol; Database; Mathematics; Medicine","score_opus":0.04424939035978744,"score_gpt":0.3295069657627377,"score_spread":0.28525757540295027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494042884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026788412,0.00048634422,0.9528958,0.00044234702,0.00035681808,0.00038770118,0.00030257498,0.003338428,0.0150014],"genre_scores_gemma":[0.6137671,0.0006549458,0.35603023,0.00036657686,0.00027418183,0.0007595008,0.0007926647,0.00045807648,0.026896859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819916,0.00037585583,0.00019236971,0.00029853173,0.0006577184,0.00027637012],"domain_scores_gemma":[0.9972312,0.0010757248,0.00014399951,0.001088126,0.00027729064,0.0001836949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774834,0.0008500702,0.0011793548,0.0008087657,0.0011224347,0.0026407486,0.0016514977,0.0012442357,0.0067564873],"category_scores_gemma":[0.00325206,0.0004410431,0.00070087035,0.001111205,0.0014480388,0.004193595,0.0040023346,0.002180688,0.001954142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018165143,0.00040120396,0.00072941935,0.00047285666,0.000109837194,0.00074332923,0.00085692265,0.0154062025,0.06742583,0.7467659,0.009881937,0.1553901],"study_design_scores_gemma":[0.0007718484,0.0009841276,0.0009066314,0.00015360823,0.00027396088,0.0020566434,0.00018852629,0.31982294,0.14789687,0.40767518,0.1189822,0.00028748935],"about_ca_topic_score_codex":0.00022092146,"about_ca_topic_score_gemma":0.00022724998,"teacher_disagreement_score":0.0067564873,"about_ca_system_score_codex":0.0007053699,"about_ca_system_score_gemma":0.0009337959,"threshold_uncertainty_score":0.022602677},"labels":[],"label_agreement":null},{"id":"W1496961188","doi":"10.1007/978-1-4419-5906-5_250","title":"Elliptic Curve Public-Key Encryption Schemes","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key (lock); Public-key cryptography; Encryption; Elliptic curve; Computer science; Political science; Mathematics; Computer security; Pure mathematics","score_opus":0.044942332588688516,"score_gpt":0.22294227908082817,"score_spread":0.17799994649213965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496961188","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056551187,0.035831857,0.20501117,0.0039761723,0.0023569546,0.00021557864,0.00063666335,0.001133851,0.7451827],"genre_scores_gemma":[0.077529125,0.058935594,0.09076264,0.0012841048,0.0015754247,0.00020976833,0.0013778745,0.00047454395,0.76785094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994784,0.000062537874,0.000024488383,0.000060127863,0.00033104784,0.000043442917],"domain_scores_gemma":[0.9996799,0.00011013678,0.00001796129,0.00010045078,0.0000765724,0.000014940232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047231093,0.0008536869,0.0005941067,0.00096322974,0.00068427145,0.0019189744,0.00072589243,0.0007893916,0.021400496],"category_scores_gemma":[0.000984406,0.00044802917,0.00035165643,0.0022067577,0.0011347774,0.0046640267,0.0011879994,0.0024257032,0.014809049],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040849074,0.00007571283,0.00006391006,0.00045890262,0.00001269744,0.000090852714,0.00024982484,0.0018836021,0.0038162174,0.5501911,0.08278731,0.3603291],"study_design_scores_gemma":[0.00001872999,0.000029805105,0.00010874624,0.00020892551,0.000008678042,0.00042702784,0.000037480542,0.0019588852,0.0037818665,0.2461457,0.747256,0.000018189949],"about_ca_topic_score_codex":0.00016867946,"about_ca_topic_score_gemma":0.00022030703,"teacher_disagreement_score":0.021400496,"about_ca_system_score_codex":0.000983106,"about_ca_system_score_gemma":0.0007593207,"threshold_uncertainty_score":0.071591735},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01745578900752887,"score_gpt":0.2470108243823711,"score_spread":0.22955503537484223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498129884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10145502,0.0013865811,0.8182555,0.0030030508,0.00046076585,0.00028322896,0.00056301453,0.002640999,0.071951844],"genre_scores_gemma":[0.81923985,0.0006568976,0.13014457,0.0003296612,0.00027789446,0.0002369597,0.0004048523,0.0003265014,0.04838283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962244,0.0005991336,0.0003084248,0.00070618454,0.0016581394,0.0005037444],"domain_scores_gemma":[0.9951742,0.0015527093,0.00039307945,0.0022892714,0.00036529405,0.00022553372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023586247,0.00074742944,0.0012909736,0.00076431973,0.0020906786,0.0057030376,0.0024426302,0.002415342,0.00690578],"category_scores_gemma":[0.0071896613,0.0009213217,0.0010665571,0.002199705,0.003835175,0.015290113,0.00592069,0.004965121,0.0021645897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005264707,0.000085547224,0.00023743615,0.00018745898,0.000025879837,0.000107551874,0.00038787452,0.007079491,0.009035329,0.94780886,0.0028920637,0.031626],"study_design_scores_gemma":[0.00014826292,0.00011088929,0.00021253101,0.000048240447,0.00004106161,0.00025709806,0.000086813016,0.034830704,0.016752066,0.9334932,0.0139531,0.000066125285],"about_ca_topic_score_codex":0.0006805936,"about_ca_topic_score_gemma":0.00080560095,"teacher_disagreement_score":0.00690578,"about_ca_system_score_codex":0.003402048,"about_ca_system_score_gemma":0.003018031,"threshold_uncertainty_score":0.024683774},"labels":[],"label_agreement":null},{"id":"W1498483645","doi":"10.1007/978-3-319-02937-5_18","title":"Private Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Maps","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Correctness; Outsourcing; Matrix multiplication; Verifiable secret sharing; Multiplication (music); Polynomial; Theoretical computer science; Function (biology); Computation; Algorithm; Programming language; Mathematics","score_opus":0.026410232219953297,"score_gpt":0.28909247038452657,"score_spread":0.26268223816457326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498483645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07707285,0.0014333694,0.86817706,0.0014732716,0.00027694786,0.00016805845,0.00037001522,0.0016005242,0.0494279],"genre_scores_gemma":[0.80720556,0.0013328184,0.14311911,0.00016947566,0.00030200378,0.00019971437,0.0005360425,0.00049480394,0.04664043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767095,0.0005325477,0.00009932903,0.00021296169,0.0009901961,0.000494006],"domain_scores_gemma":[0.998089,0.0004644571,0.000088745786,0.0011048537,0.00017656277,0.00007626631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011403288,0.00071076176,0.0011907683,0.0005402124,0.0011335657,0.002619199,0.0011151014,0.0006233479,0.009779285],"category_scores_gemma":[0.003718948,0.0005090859,0.00091117056,0.0018738946,0.0014490107,0.005644076,0.0044220965,0.0023331062,0.0027317957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045405835,0.00018030286,0.0004570569,0.00025378965,0.000058824302,0.00019417898,0.00044256955,0.036226783,0.0058382754,0.73102415,0.014143657,0.2107264],"study_design_scores_gemma":[0.00007789488,0.00011673897,0.0004919883,0.00005262881,0.00004126646,0.0004174583,0.00017166784,0.18966092,0.013982056,0.7699011,0.025041224,0.000045113968],"about_ca_topic_score_codex":0.0008655005,"about_ca_topic_score_gemma":0.0011097239,"teacher_disagreement_score":0.009779285,"about_ca_system_score_codex":0.0015781989,"about_ca_system_score_gemma":0.0017039186,"threshold_uncertainty_score":0.032714903},"labels":[],"label_agreement":null},{"id":"W1500810532","doi":"10.1007/978-3-540-73408-6_13","title":"Anonymous k-Show Credentials","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Identity (music); Computer science; Predicate (mathematical logic); Cryptography; Computer security; Internet privacy; Theoretical computer science; Programming language; Physics","score_opus":0.025046910903816996,"score_gpt":0.2666376149516097,"score_spread":0.2415907040477927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500810532","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033646517,0.0008235258,0.39364856,0.004915198,0.0013351053,0.00025968548,0.0014976081,0.0059748283,0.557899],"genre_scores_gemma":[0.656812,0.00095195806,0.04104468,0.00085528137,0.00040995658,0.00017298649,0.000787901,0.0008401653,0.2981251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979652,0.00049825787,0.00009986886,0.00024200336,0.00071348867,0.00048130084],"domain_scores_gemma":[0.9957866,0.001411976,0.00018096824,0.0016900308,0.000592629,0.00033787405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016397131,0.00061254203,0.0006133342,0.00091018097,0.0023620932,0.004244202,0.0012249267,0.0018345226,0.052387886],"category_scores_gemma":[0.0076308707,0.0005580846,0.0005479162,0.0017457878,0.0022451174,0.010410633,0.0040678037,0.0030941572,0.019519992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019717518,0.000060362225,0.0002051205,0.00010067477,0.000008401017,0.00010124032,0.00028594257,0.0012362777,0.0013657712,0.91649187,0.030125882,0.049821246],"study_design_scores_gemma":[0.000040163548,0.000042937336,0.00025079199,0.00007700109,0.000021717125,0.0007074291,0.00013015757,0.007880744,0.007624291,0.7903851,0.19278108,0.000058537684],"about_ca_topic_score_codex":0.00044979024,"about_ca_topic_score_gemma":0.00050467305,"teacher_disagreement_score":0.052387886,"about_ca_system_score_codex":0.0012485726,"about_ca_system_score_gemma":0.001481307,"threshold_uncertainty_score":0.17525494},"labels":[],"label_agreement":null},{"id":"W1501230309","doi":"10.1007/978-3-642-10868-6_14","title":"A New Protocol for the Nearby Friend Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Computer network; Medicine","score_opus":0.022239907320381353,"score_gpt":0.2794544085331996,"score_spread":0.25721450121281825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501230309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01609413,0.0009262641,0.90046495,0.0059706084,0.0020395988,0.0009234021,0.0005874739,0.0024979596,0.0704956],"genre_scores_gemma":[0.393151,0.0018145473,0.48599613,0.0036371697,0.0019243849,0.0035000208,0.0016568276,0.0017467731,0.10657314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921256,0.0022034398,0.0005993187,0.0013845138,0.002754376,0.0009328692],"domain_scores_gemma":[0.9841839,0.006545051,0.0008458793,0.005910813,0.0016896062,0.00082474586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005411857,0.0015188328,0.0026486432,0.0022272028,0.0069235866,0.0050894255,0.006434663,0.0066202707,0.017791027],"category_scores_gemma":[0.016384695,0.001407689,0.0023318045,0.002903394,0.0063302265,0.02444679,0.018700961,0.0116608,0.0068347026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004621865,0.00015452928,0.0001816554,0.00026505167,0.00004627137,0.0002585488,0.00087935675,0.0019269141,0.0045001544,0.9023187,0.025705608,0.063300855],"study_design_scores_gemma":[0.00035955483,0.00017390552,0.00014395552,0.00012051057,0.00015269789,0.0008538946,0.00039393964,0.038724404,0.009058439,0.8664521,0.08339396,0.00017264302],"about_ca_topic_score_codex":0.00088624144,"about_ca_topic_score_gemma":0.0008508514,"teacher_disagreement_score":0.017791027,"about_ca_system_score_codex":0.0023258962,"about_ca_system_score_gemma":0.0026469484,"threshold_uncertainty_score":0.059516907},"labels":[],"label_agreement":null},{"id":"W1503056535","doi":"10.1007/3-540-46513-8_15","title":"Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Secret sharing; Scheme (mathematics); Cheating; Computer science; Access structure; Construct (python library); Computer security; Homomorphic secret sharing; Adversary; Theoretical computer science; Secure multi-party computation; Cryptography; Computer network; Mathematics; Set (abstract data type)","score_opus":0.010263107160238224,"score_gpt":0.22471778286306976,"score_spread":0.21445467570283153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503056535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10740641,0.000560595,0.84384614,0.0011706478,0.00023884822,0.00032632612,0.00062550994,0.002057075,0.04376847],"genre_scores_gemma":[0.89253104,0.0002955311,0.09110162,0.00025310702,0.00012642668,0.00031252654,0.00050304167,0.000109672044,0.014767081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975006,0.00057748624,0.00017060673,0.00036051628,0.00096966705,0.00042099392],"domain_scores_gemma":[0.9961547,0.0012075705,0.00038041477,0.0017254319,0.00029995895,0.0002319849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013986662,0.000713235,0.0010256662,0.0008647532,0.0016437044,0.0037371952,0.002314395,0.00153649,0.004033326],"category_scores_gemma":[0.0028980675,0.00059763633,0.0008864474,0.0016711178,0.0017737657,0.0051282956,0.0038759562,0.0027551714,0.0017118019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004959838,0.00016537975,0.00024549913,0.00016354704,0.000043103188,0.00015993301,0.00021358787,0.019408999,0.022607123,0.91139793,0.0037817967,0.04131711],"study_design_scores_gemma":[0.00025165227,0.00042974768,0.00034971425,0.00005532476,0.00012018162,0.00076701347,0.00008847906,0.19981843,0.031052882,0.7547935,0.012140882,0.00013221301],"about_ca_topic_score_codex":0.00023480403,"about_ca_topic_score_gemma":0.00027322705,"teacher_disagreement_score":0.004033326,"about_ca_system_score_codex":0.0015646524,"about_ca_system_score_gemma":0.0026607532,"threshold_uncertainty_score":0.013492823},"labels":[],"label_agreement":null},{"id":"W1503321858","doi":"10.1007/978-3-642-17650-0_19","title":"Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheme (mathematics); Negotiation; Vickrey–Clarke–Groves auction; Common value auction; Commitment scheme; Generalized second-price auction; Construct (python library); Reverse auction; Auction theory; Vickrey auction; Computer security; Protocol (science); Revenue equivalence; Auction algorithm; Double auction; Distributed computing; Theoretical computer science; Cryptography; Computer network; Microeconomics; Mathematics; Law","score_opus":0.026775647695604053,"score_gpt":0.2772296855446453,"score_spread":0.25045403784904124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503321858","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050220948,0.00044070822,0.91793305,0.0010423145,0.00030700152,0.00036647837,0.0002075112,0.0016749115,0.027807157],"genre_scores_gemma":[0.73538095,0.0005688837,0.22382765,0.00025597302,0.000223724,0.00047766673,0.00032122718,0.00036303414,0.03858097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597824,0.00077033235,0.00034764624,0.00055381184,0.0017696765,0.0005803394],"domain_scores_gemma":[0.9944851,0.0015738218,0.00035599794,0.0028802855,0.0004727007,0.00023216328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002914177,0.00092278,0.0015463377,0.0007902767,0.002270661,0.0054424875,0.0038475005,0.0024890644,0.0065474855],"category_scores_gemma":[0.0052603334,0.0011429932,0.0011873959,0.0016061914,0.0024100433,0.011184099,0.006136661,0.0060657416,0.0028930632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042371612,0.00021721757,0.0001715233,0.00018487233,0.00005904487,0.00018537886,0.00030184776,0.015137276,0.014918094,0.91629726,0.003056088,0.04904762],"study_design_scores_gemma":[0.00018953148,0.00022859419,0.00025554013,0.00006073055,0.00008070666,0.0005853311,0.000081621096,0.14753173,0.029068056,0.80690515,0.014874749,0.00013833925],"about_ca_topic_score_codex":0.00026857373,"about_ca_topic_score_gemma":0.0003091278,"teacher_disagreement_score":0.0065474855,"about_ca_system_score_codex":0.0015053191,"about_ca_system_score_gemma":0.0019511693,"threshold_uncertainty_score":0.021903515},"labels":[],"label_agreement":null},{"id":"W1504167826","doi":"10.1109/cloud.2015.74","title":"An Efficient Conjunctive Keyword and Phase Search Scheme for Encrypted Cloud Storage Systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Encryption; Cloud storage; Scheme (mathematics); Cloud computing; Ranking (information retrieval); Phrase search; Key (lock); Data mining; Information retrieval; Search engine; Computer security; Web search query; Mathematics","score_opus":0.048911196728243206,"score_gpt":0.3224327963020137,"score_spread":0.27352159957377054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504167826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11592628,0.0013099595,0.8658631,0.0009968027,0.00019773639,0.00075455464,0.0007410276,0.0018020595,0.01240854],"genre_scores_gemma":[0.7616506,0.00047383417,0.22844319,0.00027099118,0.00008116128,0.00020851745,0.00046032004,0.000071548115,0.0083398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797577,0.00039294717,0.00031849294,0.00016523164,0.0008413978,0.00030621546],"domain_scores_gemma":[0.9978155,0.00049169164,0.0002700478,0.00079896394,0.00050258765,0.00012122253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013766098,0.0003290667,0.00094103883,0.00077647757,0.001249888,0.0018714053,0.0013415489,0.00085940736,0.0046127676],"category_scores_gemma":[0.002969327,0.00024249443,0.000448325,0.0016756344,0.0007746373,0.0044812653,0.0023491872,0.000698072,0.001378761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003086909,0.0005321602,0.0017068166,0.0007239871,0.00016673551,0.0011274151,0.0012498107,0.053464063,0.16662015,0.35327172,0.022713214,0.39533696],"study_design_scores_gemma":[0.00059794687,0.0010313118,0.0011023327,0.00010335631,0.0001574202,0.0024087864,0.0005234228,0.7018441,0.13183206,0.10963414,0.05054302,0.00022209929],"about_ca_topic_score_codex":0.0010256036,"about_ca_topic_score_gemma":0.0011807256,"teacher_disagreement_score":0.0046127676,"about_ca_system_score_codex":0.0014141714,"about_ca_system_score_gemma":0.0022096783,"threshold_uncertainty_score":0.015431285},"labels":[],"label_agreement":null},{"id":"W1504406874","doi":"10.1007/978-3-642-25578-6_21","title":"Publicly Verifiable Secret Sharing for Cloud-Based Key Management","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Random oracle; Computer science; Computer security; Key management; Encryption; Public-key cryptography; Key (lock); Scheme (mathematics); Cryptography; Theoretical computer science; Mathematics","score_opus":0.025773715802764864,"score_gpt":0.2366170650551623,"score_spread":0.21084334925239745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504406874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010936702,0.0042106635,0.9513933,0.002061763,0.0006743689,0.00023820638,0.000247293,0.0010123254,0.02922541],"genre_scores_gemma":[0.73742425,0.0054622185,0.2045847,0.00062701735,0.0010771714,0.0004748489,0.0007094769,0.0004382052,0.049202073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967175,0.00074506126,0.00018215778,0.00036888904,0.0014367452,0.00054960896],"domain_scores_gemma":[0.99624604,0.0013989568,0.00028658967,0.0016705447,0.00029656754,0.00010129328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024735807,0.00088472397,0.0010904331,0.0006629725,0.0013916761,0.004523742,0.0023992357,0.0024194885,0.008079582],"category_scores_gemma":[0.0057106377,0.0008431351,0.0008680724,0.001750865,0.0030016804,0.009136561,0.0042307377,0.0060629933,0.002801465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021454615,0.00010554085,0.000114078575,0.0002898074,0.000045117893,0.00015329181,0.00023887653,0.019170955,0.008116893,0.86220986,0.01103106,0.09831002],"study_design_scores_gemma":[0.00006817411,0.000095179996,0.00014641043,0.00015518627,0.00004451872,0.00036994266,0.000068724206,0.14521265,0.016224192,0.7997606,0.037790846,0.000063638654],"about_ca_topic_score_codex":0.0005746268,"about_ca_topic_score_gemma":0.0005435375,"teacher_disagreement_score":0.008079582,"about_ca_system_score_codex":0.0029396804,"about_ca_system_score_gemma":0.0023060213,"threshold_uncertainty_score":0.027028918},"labels":[],"label_agreement":null},{"id":"W1504698366","doi":"10.1007/978-3-642-19571-6_28","title":"Tight Bounds for Classical and Quantum Coin Flipping","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of Bristol; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Coin flipping; Computer science; Quantum; Correctness; Cryptography; Range (aeronautics); Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Quantum mechanics; Physics","score_opus":0.02601304566012222,"score_gpt":0.24715929867673572,"score_spread":0.2211462530166135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504698366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047273085,0.017574575,0.639571,0.01343847,0.0020211881,0.00032561936,0.0018343036,0.0018272753,0.2761344],"genre_scores_gemma":[0.7245027,0.015991418,0.14973108,0.0039965315,0.0049885022,0.0016094461,0.0025436217,0.0025114045,0.09412535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877627,0.002567261,0.00047924428,0.001844851,0.0045112493,0.0028347168],"domain_scores_gemma":[0.9454223,0.04029266,0.0012740166,0.0077194762,0.0032272807,0.0020643587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009834587,0.0048106015,0.005908761,0.0059109204,0.0059807273,0.013788964,0.010301652,0.006628815,0.038954236],"category_scores_gemma":[0.053946093,0.0035592047,0.0039003487,0.009457918,0.011540236,0.033377584,0.014285714,0.01893664,0.007712276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023373679,0.00010240323,0.0001773789,0.00025823448,0.000040568048,0.00005220583,0.00019915459,0.013477435,0.00061932753,0.955312,0.010132199,0.019395497],"study_design_scores_gemma":[0.000019515564,0.000015808348,0.000085253494,0.00006003764,0.000028137545,0.000034285364,0.000032241373,0.021877674,0.0003459862,0.9746532,0.0028230543,0.00002475143],"about_ca_topic_score_codex":0.0036943303,"about_ca_topic_score_gemma":0.004223167,"teacher_disagreement_score":0.038954236,"about_ca_system_score_codex":0.009739718,"about_ca_system_score_gemma":0.0049869427,"threshold_uncertainty_score":0.13031489},"labels":[],"label_agreement":null},{"id":"W1506026585","doi":"10.1023/a:1016549024113","title":"On the Security of the Digital Signature Algorithm","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ephemeral key; Key (lock); Key size; Computer science; Upper and lower bounds; Digital signature; Theoretical computer science; Lattice reduction; Mathematics; Discrete mathematics; Algorithm; Public-key cryptography; Computer security; Encryption; Computer network; Channel (broadcasting); Hash function","score_opus":0.015309284858419923,"score_gpt":0.1986974840301912,"score_spread":0.18338819917177127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506026585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0963765,0.013309454,0.6452289,0.018466918,0.0038905004,0.00017254397,0.00055418164,0.0003457218,0.2216552],"genre_scores_gemma":[0.812203,0.015437616,0.11505966,0.003145367,0.0045323614,0.00023376667,0.0005761872,0.00025056145,0.048561525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689,0.0009286228,0.00018709876,0.000453849,0.0010815972,0.0004589451],"domain_scores_gemma":[0.9933509,0.0042731995,0.00037814665,0.00094645726,0.00087671174,0.00017462586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028801893,0.00124882,0.0011278656,0.0023419799,0.0017802769,0.0038697072,0.0010718206,0.0030248726,0.006206134],"category_scores_gemma":[0.011293398,0.00052339013,0.00092726166,0.0027015281,0.0070096343,0.009024807,0.0038153839,0.0053767413,0.0020963866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016304836,0.000018795488,0.000090698086,0.00006136998,0.000013705395,0.00005814894,0.00011718202,0.0049435436,0.001072563,0.97189766,0.0022181598,0.01934505],"study_design_scores_gemma":[0.00003360581,0.000034550445,0.000058936123,0.000059170572,0.000010562483,0.000086000684,0.000029188912,0.014915114,0.0011408962,0.9740994,0.009509519,0.000022954926],"about_ca_topic_score_codex":0.00082871265,"about_ca_topic_score_gemma":0.00036802943,"teacher_disagreement_score":0.006206134,"about_ca_system_score_codex":0.0019955272,"about_ca_system_score_gemma":0.001878051,"threshold_uncertainty_score":0.02076155},"labels":[],"label_agreement":null},{"id":"W1508813780","doi":"10.1007/bf02994841","title":"IP multicast security: Issues and directions","year":2000,"lang":"fr","type":"article","venue":"Annals of Telecommunications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Humanities; Political science; Computer science; Philosophy","score_opus":0.07974467661862467,"score_gpt":0.35785112996938145,"score_spread":0.2781064533507568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508813780","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045764027,0.4097027,0.032624274,0.47855824,0.010157876,0.00007193702,0.00016504298,0.00024105527,0.0639026],"genre_scores_gemma":[0.1771112,0.6173975,0.068354934,0.04650271,0.060187254,0.00035313852,0.00037987897,0.00012769003,0.029585797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958261,0.0017204689,0.00026821328,0.000490432,0.0011950305,0.00049974734],"domain_scores_gemma":[0.9793185,0.010969916,0.0010448847,0.001055297,0.0058952016,0.0017162331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012952322,0.0013975438,0.0015268197,0.002766301,0.004128775,0.014121073,0.0035889782,0.018273417,0.015500315],"category_scores_gemma":[0.012866751,0.00093657814,0.0009021372,0.0056966166,0.010534826,0.040777996,0.0031209607,0.01094351,0.003713512],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020111808,0.00040982765,0.0011298008,0.0009821268,0.000033900247,0.0002636482,0.0005535484,0.0011737543,0.00042807672,0.6016599,0.14178449,0.25137985],"study_design_scores_gemma":[0.00008479873,0.00015006993,0.0006309166,0.0016226282,0.00005328476,0.00065711833,0.0030566668,0.0066951388,0.0004255565,0.5687529,0.4177815,0.00008945903],"about_ca_topic_score_codex":0.0031258261,"about_ca_topic_score_gemma":0.004099684,"teacher_disagreement_score":0.018273417,"about_ca_system_score_codex":0.0043731835,"about_ca_system_score_gemma":0.0061021587,"threshold_uncertainty_score":0.06849927},"labels":[],"label_agreement":null},{"id":"W1508839005","doi":"10.1007/978-3-540-85230-8_4","title":"An Efficient Deniable Key Exchange Protocol (Extended Abstract)","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Key (lock); Key exchange; Protocol (science); Computer security; Oakley protocol; Secure channel; Property (philosophy); Cryptographic protocol; Computer network; Public-key cryptography; Cryptography; Encryption","score_opus":0.01851223929371503,"score_gpt":0.2670871109191254,"score_spread":0.24857487162541037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508839005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011249686,0.000815326,0.9638638,0.001077769,0.00060923345,0.00027696905,0.0003607257,0.0014729304,0.020273643],"genre_scores_gemma":[0.34752518,0.0020979152,0.5651885,0.0011660765,0.0004861994,0.00081867084,0.001694033,0.00061400345,0.08040938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891925,0.0002605713,0.000073171745,0.00018267127,0.0004358333,0.00012860916],"domain_scores_gemma":[0.99912256,0.0002655235,0.00005260739,0.0003794804,0.00014561036,0.000034096804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999208,0.00066616596,0.000736664,0.0004807131,0.00072402495,0.0022057751,0.0015174955,0.0012433793,0.009336478],"category_scores_gemma":[0.00243919,0.00046897185,0.0005644748,0.00097022834,0.0011551941,0.0044069677,0.0029852435,0.0019661384,0.0039745118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048846373,0.00017261604,0.00015162163,0.00039452882,0.00004124942,0.0003241345,0.00019934737,0.015493129,0.020676704,0.80849385,0.020742383,0.132822],"study_design_scores_gemma":[0.00028477376,0.00023435587,0.00026878645,0.000101666286,0.00008395284,0.00079178123,0.000062490275,0.14396398,0.023624307,0.71607625,0.11442748,0.00008022104],"about_ca_topic_score_codex":0.00038661622,"about_ca_topic_score_gemma":0.0004964364,"teacher_disagreement_score":0.009336478,"about_ca_system_score_codex":0.0006711486,"about_ca_system_score_gemma":0.0009730987,"threshold_uncertainty_score":0.031233609},"labels":[],"label_agreement":null},{"id":"W1519891470","doi":"10.1007/0-387-34805-0_32","title":"On Key Distribution Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Adversary; Concrete security; Computer science; Construct (python library); Key (lock); Mathematics; Distribution (mathematics); Function (biology); Theoretical computer science; Computer security; Computer security model; Discrete mathematics; Computer network","score_opus":0.018830238362220638,"score_gpt":0.24870287496624863,"score_spread":0.22987263660402799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519891470","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015804509,0.011332025,0.65222096,0.0061002164,0.0031778587,0.0002624748,0.00044723594,0.001066277,0.30958843],"genre_scores_gemma":[0.55004466,0.016370086,0.13534221,0.0023296662,0.0028011128,0.0007783671,0.0013446843,0.0007469253,0.29024225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989655,0.00030381375,0.00004997864,0.00019003694,0.00034756464,0.00014306352],"domain_scores_gemma":[0.99897075,0.00037199445,0.000047006295,0.0004333652,0.00013520053,0.00004168457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083721476,0.0008932052,0.00077938725,0.001033589,0.0015069377,0.0030648047,0.001036458,0.0011408753,0.02507168],"category_scores_gemma":[0.0030771918,0.0004728925,0.00043815916,0.0019565783,0.001979732,0.0067008855,0.0032286625,0.0025680745,0.006585019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043638396,0.000017159133,0.0000727971,0.00006788976,0.0000071253626,0.000031853302,0.00009511335,0.0015393608,0.00073359,0.9246659,0.01454512,0.058180355],"study_design_scores_gemma":[0.000016382965,0.000023844073,0.00009461268,0.000046374924,0.000009779366,0.00014554651,0.000045889137,0.009248615,0.0010386613,0.915651,0.07366956,0.000009722613],"about_ca_topic_score_codex":0.00042587463,"about_ca_topic_score_gemma":0.0003488132,"teacher_disagreement_score":0.02507168,"about_ca_system_score_codex":0.0015840327,"about_ca_system_score_gemma":0.0007974439,"threshold_uncertainty_score":0.08387315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018028599068222132,"score_gpt":0.2400219214272223,"score_spread":0.22199332235900018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520227725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059827324,0.0015149204,0.8828785,0.00086543366,0.0006904944,0.00021467175,0.00035216523,0.00300233,0.050654177],"genre_scores_gemma":[0.8251042,0.001361214,0.12966093,0.00034957784,0.00023924318,0.00013582535,0.0005482366,0.00028792754,0.04231294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782723,0.00025333065,0.00017068439,0.0002833083,0.0011280373,0.0003373716],"domain_scores_gemma":[0.9978109,0.00052034005,0.00012834645,0.0010475102,0.00036396278,0.00012895573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126773,0.00047833283,0.0010902378,0.0008135503,0.000727869,0.0032260949,0.0011746936,0.0009875497,0.0075036637],"category_scores_gemma":[0.0034441557,0.0003170732,0.00052761345,0.0017848951,0.0017780741,0.005313415,0.003365779,0.0026334082,0.0036102263],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074348075,0.0001862691,0.0004415901,0.00027048052,0.00004751984,0.00013784827,0.00031504937,0.013685673,0.040669415,0.6834602,0.01049672,0.24954572],"study_design_scores_gemma":[0.00018352729,0.00040853053,0.0006333101,0.00011256071,0.000092960276,0.0010445294,0.00012289353,0.20378746,0.1193634,0.6224582,0.05167398,0.000118575736],"about_ca_topic_score_codex":0.00022149348,"about_ca_topic_score_gemma":0.00018900208,"teacher_disagreement_score":0.0075036637,"about_ca_system_score_codex":0.0008858977,"about_ca_system_score_gemma":0.000874476,"threshold_uncertainty_score":0.025102258},"labels":[],"label_agreement":null},{"id":"W1542807488","doi":"10.1007/978-3-642-04355-0_47","title":"From Almost Everywhere to Everywhere: Byzantine Agreement with $\\tilde{O}(n^{3/2})$ Bits","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Leader election; Adversary; Set (abstract data type); Byzantine fault tolerance; Theoretical computer science; Distributed computing; Discrete mathematics; Parallel computing; Algorithm; Computer security; Fault tolerance; Mathematics","score_opus":0.010895341814394659,"score_gpt":0.22631574826434261,"score_spread":0.21542040644994795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542807488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030559298,0.0017978707,0.6362776,0.016427306,0.001970577,0.00017704401,0.0005368487,0.001832122,0.31042135],"genre_scores_gemma":[0.73315126,0.0017072029,0.14782323,0.0030878403,0.00094352785,0.0005676997,0.00044071977,0.0020770277,0.11020147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948205,0.0021183584,0.00028888165,0.00083474995,0.0012016429,0.00073576416],"domain_scores_gemma":[0.99398273,0.0028900404,0.0002365099,0.002057627,0.0005874108,0.00024566182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038781846,0.000847066,0.0016247466,0.0011118174,0.005721451,0.0072729858,0.0019494096,0.0032322432,0.016703341],"category_scores_gemma":[0.012927845,0.0008636975,0.0010360423,0.0021495004,0.008889507,0.022406831,0.007161758,0.008892608,0.0057463655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020951116,0.000004346564,0.000010036774,0.000013080026,0.0000015571827,0.00000970605,0.00015285736,0.0001836697,0.00012324534,0.9934865,0.0019503,0.0040435903],"study_design_scores_gemma":[0.000005411263,0.0000028347001,0.0000050756457,0.000011704414,0.0000020764362,0.00001343754,0.00003454093,0.00073293684,0.0003206826,0.9932694,0.005595997,0.000005969495],"about_ca_topic_score_codex":0.00090906204,"about_ca_topic_score_gemma":0.00091570884,"teacher_disagreement_score":0.016703341,"about_ca_system_score_codex":0.0021110233,"about_ca_system_score_gemma":0.0019828123,"threshold_uncertainty_score":0.055878222},"labels":[],"label_agreement":null},{"id":"W1542812669","doi":"10.1007/3-540-36492-7_19","title":"New Results on Unconditionally Secure Distributed Oblivious Transfer","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Oblivious transfer; Computer science; Communication source; Theoretical computer science; Randomness; Server; Impossibility; Set (abstract data type); Access structure; Secret sharing; Transfer (computing); Upper and lower bounds; Cryptography; Distributed computing; Algorithm; Computer network; Mathematics; Parallel computing","score_opus":0.012989627268754307,"score_gpt":0.2276530457781751,"score_spread":0.2146634185094208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542812669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029555788,0.0027755955,0.84510016,0.0034091407,0.0015715561,0.0001393474,0.0004062682,0.0020342628,0.11500789],"genre_scores_gemma":[0.70319057,0.005066292,0.1359913,0.0026334133,0.0040913713,0.000786986,0.0009580555,0.0018321947,0.14544983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646395,0.00042591736,0.00018850862,0.00071019604,0.0016170231,0.000594429],"domain_scores_gemma":[0.99283737,0.003842336,0.00036520732,0.002026177,0.0005530176,0.00037576223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021518809,0.0020786982,0.0020349594,0.0026341833,0.002944625,0.0045411834,0.003831497,0.0022966308,0.016405117],"category_scores_gemma":[0.0074582077,0.0013667536,0.0019023274,0.0034445713,0.006501731,0.017809942,0.009308808,0.009960607,0.005356961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019124558,0.000080355036,0.000106358246,0.00018682695,0.00002662633,0.000096466974,0.0002360014,0.0048485417,0.002858845,0.95613736,0.006078004,0.029153366],"study_design_scores_gemma":[0.000029888206,0.000031260028,0.000082689265,0.000027668315,0.000038160248,0.00012246068,0.000028364295,0.016254386,0.0029227065,0.970786,0.0096470015,0.000029551156],"about_ca_topic_score_codex":0.00036236597,"about_ca_topic_score_gemma":0.00033963108,"teacher_disagreement_score":0.016405117,"about_ca_system_score_codex":0.0020605293,"about_ca_system_score_gemma":0.0014150282,"threshold_uncertainty_score":0.05488056},"labels":[],"label_agreement":null},{"id":"W154319015","doi":"10.46298/dmtcs.3564","title":"Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Stateless protocol; Revocation; Broadcast encryption; Limiting; Scheme (mathematics); Set (abstract data type); Encryption; Discrete mathematics; Computer network; Algorithm; Computer science; Public-key cryptography","score_opus":0.01624078492076061,"score_gpt":0.27554257225738804,"score_spread":0.25930178733662745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154319015","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7630267,0.0008041405,0.22805846,0.0018063112,0.0000587178,0.0002271555,0.00044706778,0.00051395217,0.0050574243],"genre_scores_gemma":[0.9736139,0.00040270473,0.02287363,0.00010280655,0.00007062691,0.00020797322,0.00029550106,0.00012282422,0.0023098506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418795,0.0025150336,0.00031408356,0.0008048518,0.0012792405,0.00089885807],"domain_scores_gemma":[0.89943534,0.07318065,0.010190382,0.009344132,0.0045746337,0.0032748447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009715044,0.000823802,0.0015145304,0.0015884119,0.001232972,0.002569158,0.0029879042,0.0020493008,0.003673348],"category_scores_gemma":[0.06949862,0.00090107915,0.0010883891,0.0010307638,0.0033912577,0.008518718,0.0020303377,0.0032220127,0.00067185576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043749325,0.0006468565,0.014839426,0.0005397186,0.00016661572,0.00081427797,0.0018746612,0.28745833,0.043568037,0.5943146,0.0050182072,0.046384506],"study_design_scores_gemma":[0.0001956449,0.0005208338,0.002855615,0.00005507971,0.000050354032,0.000690123,0.0003290128,0.8497525,0.0099054305,0.13439494,0.0011595916,0.00009078372],"about_ca_topic_score_codex":0.00048426643,"about_ca_topic_score_gemma":0.0004132383,"teacher_disagreement_score":0.009715044,"about_ca_system_score_codex":0.003868946,"about_ca_system_score_gemma":0.001449315,"threshold_uncertainty_score":0.051378727},"labels":[],"label_agreement":null},{"id":"W1545021118","doi":"10.1007/978-3-540-77026-8_4","title":"On the Bits of Elliptic Curve Diffie-Hellman Keys","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Elliptic curve; Finite field; Discrete mathematics; Counting points on elliptic curves; Key size; Arithmetic; Schoof's algorithm; Computer science; Pure mathematics; Public-key cryptography; Encryption; Quarter period","score_opus":0.02444145475790404,"score_gpt":0.24924164457106449,"score_spread":0.22480018981316044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545021118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046168156,0.024488075,0.6247143,0.008112693,0.004092044,0.0002536974,0.0009535766,0.0008293208,0.29038817],"genre_scores_gemma":[0.6249358,0.027938316,0.21757245,0.0026876712,0.0032433022,0.00053365796,0.0012687189,0.0010358393,0.12078431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828255,0.0004915541,0.00012934538,0.00019183487,0.00070275157,0.00020194823],"domain_scores_gemma":[0.9968917,0.0017151142,0.00015688779,0.00084093557,0.00030593533,0.00008951405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017526221,0.0013110184,0.0010382996,0.0026001588,0.001428209,0.005127262,0.0013257975,0.001991194,0.011517473],"category_scores_gemma":[0.008301681,0.0011494451,0.00063154224,0.0037338496,0.005077452,0.014136396,0.0031730235,0.005252621,0.004186271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054835695,0.000007901157,0.000061062776,0.000042971555,0.000003498425,0.000035737372,0.00013443122,0.0016979573,0.0005746192,0.9702279,0.0035587235,0.023600278],"study_design_scores_gemma":[0.000008347881,0.000010538501,0.000052413594,0.00006207865,0.000004250162,0.00006663358,0.000030185007,0.003170586,0.0006558758,0.9774032,0.01852264,0.000013292077],"about_ca_topic_score_codex":0.00051086233,"about_ca_topic_score_gemma":0.0003799711,"teacher_disagreement_score":0.011517473,"about_ca_system_score_codex":0.0013971758,"about_ca_system_score_gemma":0.0007808592,"threshold_uncertainty_score":0.038529754},"labels":[],"label_agreement":null},{"id":"W1546090284","doi":"10.4086/toc.2011.v007a007","title":"","year":2011,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research; W. M. Keck Foundation; National Science Foundation","keywords":"Gas meter prover; Expressive power; Discrete mathematics; Computer science; Mathematics; Logarithm; Quantum; Theoretical computer science; Mathematical proof; Quantum mechanics","score_opus":0.03739569460194093,"score_gpt":0.23011846106527764,"score_spread":0.19272276646333672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546090284","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045233764,0.0010768675,0.8484801,0.0015267099,0.00033016346,0.00019642706,0.0002544822,0.00066399045,0.102237545],"genre_scores_gemma":[0.8106606,0.00086055655,0.15996395,0.0005641768,0.00020125593,0.00017970029,0.0003447435,0.00019147941,0.027033525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972799,0.00071829377,0.00011461467,0.0006295846,0.0008424701,0.00041517036],"domain_scores_gemma":[0.99534637,0.0020103557,0.0003150613,0.0015605049,0.0005221616,0.0002455633],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014690085,0.00046732315,0.00045899733,0.00039672357,0.0017437241,0.0026604342,0.0024159187,0.0014250306,0.014108665],"category_scores_gemma":[0.005885821,0.0002631229,0.0007503458,0.0005573603,0.0028969077,0.005306333,0.0019878263,0.0016722167,0.0024338935],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015584698,0.000051734547,0.00040802232,0.00008246794,0.000021153943,0.00010156469,0.000193553,0.008186602,0.0022952054,0.9645675,0.001905151,0.022031209],"study_design_scores_gemma":[0.00009122016,0.00023674114,0.00052623096,0.00006295106,0.0000625005,0.00060910103,0.00023845871,0.118761785,0.014575255,0.7730895,0.09165469,0.00009156303],"about_ca_topic_score_codex":0.0013344014,"about_ca_topic_score_gemma":0.0012771192,"teacher_disagreement_score":0.98589134,"about_ca_system_score_codex":0.0014262024,"about_ca_system_score_gemma":0.0013229297,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1547371858","doi":"10.26421/qic9.7-8-7","title":"Entanglement-resistant two-Prover interactive proof systems and non-adaptive PIRs","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Soundness; Gas meter prover; Completeness (order theory); Quantum entanglement; Constant (computer programming); Mathematics; Property (philosophy); Discrete mathematics; Scheme (mathematics); Combinatorics; Theoretical computer science; Computer science; Mathematical proof; Quantum; Physics; Programming language; Quantum mechanics","score_opus":0.010346494460206294,"score_gpt":0.25322522719894325,"score_spread":0.24287873273873695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547371858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0461903,0.00016429544,0.93826175,0.0013091431,0.000047261343,0.00016897924,0.00011901709,0.0015119397,0.012227328],"genre_scores_gemma":[0.82496303,0.00020538876,0.16744235,0.00038868774,0.00012462783,0.00040697068,0.00015570561,0.00027370744,0.0060396027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99056375,0.0034093256,0.000542567,0.0017179385,0.002651433,0.0011149059],"domain_scores_gemma":[0.9570555,0.026202654,0.0034549348,0.010491137,0.0019597868,0.00083585584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008381813,0.0007490983,0.0011787799,0.001009185,0.0020701804,0.0031114893,0.0044387057,0.0022194013,0.007381318],"category_scores_gemma":[0.034303628,0.00083576096,0.0016076831,0.00095483765,0.007107232,0.008966333,0.008183578,0.0049444656,0.0013806124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021517489,0.0000597364,0.00038855677,0.00015556143,0.00005432048,0.00022791591,0.0007970728,0.02524774,0.005738853,0.95552343,0.0010012314,0.010590522],"study_design_scores_gemma":[0.00017472876,0.000097464006,0.00019154581,0.000033759196,0.000059089714,0.00028298624,0.00006958447,0.26134002,0.012388919,0.7196066,0.0056814128,0.00007398121],"about_ca_topic_score_codex":0.0005331765,"about_ca_topic_score_gemma":0.0003401038,"teacher_disagreement_score":0.008381813,"about_ca_system_score_codex":0.0017526402,"about_ca_system_score_gemma":0.0018119282,"threshold_uncertainty_score":0.044327796},"labels":[],"label_agreement":null},{"id":"W1547665694","doi":"10.1007/11761679_13","title":"Optimal Reductions Between Oblivious Transfers Using Interactive Hashing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Hash function; Theoretical computer science; Computer security","score_opus":0.02452952840016438,"score_gpt":0.26604784353527416,"score_spread":0.2415183151351098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547665694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274649,0.0017301091,0.75338316,0.0026446395,0.0010565703,0.0006898869,0.0010458735,0.006161792,0.10582309],"genre_scores_gemma":[0.74750984,0.00086467096,0.19532688,0.00071464153,0.00059345644,0.0007410333,0.0016852542,0.002276276,0.050287906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950139,0.0010531297,0.00022452146,0.0005981013,0.0019035937,0.0012066744],"domain_scores_gemma":[0.99325997,0.0031283263,0.00020682013,0.0028807044,0.00031719176,0.00020693337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020497318,0.0013639987,0.0021352589,0.0015060633,0.002712118,0.0042857085,0.0043840823,0.0023003935,0.019469794],"category_scores_gemma":[0.0070242966,0.0014666065,0.002567382,0.0025901354,0.0035945587,0.011833081,0.007129798,0.0066891084,0.004201781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016474687,0.00052410644,0.00037479942,0.0005774021,0.00012252554,0.00015241935,0.00071605167,0.034668606,0.0083913915,0.8016945,0.023831202,0.1272995],"study_design_scores_gemma":[0.00019735686,0.00010772781,0.000226602,0.00006103024,0.00010693442,0.000109583736,0.00015516413,0.054750692,0.010814171,0.92381275,0.009608857,0.000049191265],"about_ca_topic_score_codex":0.0008911471,"about_ca_topic_score_gemma":0.0013722668,"teacher_disagreement_score":0.019469794,"about_ca_system_score_codex":0.0030544826,"about_ca_system_score_gemma":0.0023855371,"threshold_uncertainty_score":0.065132976},"labels":[],"label_agreement":null},{"id":"W1551572893","doi":"10.1007/978-3-540-30500-2_21","title":"An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract)","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Quantum; Automaton; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.01346062156270837,"score_gpt":0.2702512214973635,"score_spread":0.25679059993465514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551572893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013523281,0.0018005754,0.91523355,0.0014305603,0.0008663508,0.00011951246,0.00011565994,0.00094040507,0.065970026],"genre_scores_gemma":[0.48601088,0.0028386037,0.47087666,0.00083307375,0.0011321389,0.00036217264,0.00022329796,0.00062551687,0.03709759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893504,0.00042605918,0.00006839171,0.00016868596,0.00030822752,0.000093724615],"domain_scores_gemma":[0.9975326,0.0019052416,0.000046818946,0.00027373226,0.00017835453,0.00006321948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011692157,0.0005522504,0.0008102186,0.00089690037,0.0016206963,0.0027607123,0.0015064813,0.0012861639,0.014499778],"category_scores_gemma":[0.0056482097,0.00063971645,0.0020698889,0.0012506471,0.0031375922,0.0043397914,0.002885055,0.0026670052,0.0016970031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002494889,0.000026523378,0.000078878555,0.00009556027,0.000023369506,0.00013905184,0.00024895044,0.006421628,0.0012181541,0.96417123,0.0025331762,0.025018536],"study_design_scores_gemma":[0.00001077561,0.000011130776,0.00006169424,0.00002147507,0.000012258401,0.00006114622,0.000016774353,0.02795339,0.0007752311,0.962548,0.008516234,0.000011801612],"about_ca_topic_score_codex":0.0019769536,"about_ca_topic_score_gemma":0.0013971792,"teacher_disagreement_score":0.014499778,"about_ca_system_score_codex":0.0017195008,"about_ca_system_score_gemma":0.00088901847,"threshold_uncertainty_score":0.048506618},"labels":[],"label_agreement":null},{"id":"W1553664401","doi":"10.1007/11964254_13","title":"Cryptographic Protocol to Establish Trusted History of Interactions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cryptographic protocol; Computer science; Protocol (science); Cryptography; Computer security; Cryptographic primitive; Context (archaeology); Public-key cryptography; Computer network; Key management; Encryption; Geography; Medicine","score_opus":0.017544731609668664,"score_gpt":0.25551568009658604,"score_spread":0.23797094848691738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553664401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010232486,0.00037606034,0.95916766,0.0010614522,0.00051376066,0.00036051084,0.0002584694,0.0017826821,0.026246982],"genre_scores_gemma":[0.48493403,0.0009332026,0.44619393,0.0006930752,0.0006507946,0.0013284162,0.0010534032,0.0006804365,0.06353271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963175,0.0009105175,0.00033762841,0.0005111003,0.001513201,0.00040994925],"domain_scores_gemma":[0.9877079,0.003294355,0.00064158597,0.0063383556,0.001440323,0.00057740835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003984071,0.000821941,0.0010484947,0.002312194,0.0030881988,0.0038059384,0.0026874267,0.0021950777,0.011955949],"category_scores_gemma":[0.012322333,0.00081855495,0.0010320152,0.0023533527,0.0034218212,0.010939025,0.00701255,0.006642101,0.006730993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014084051,0.000061390514,0.00017165668,0.00009012323,0.00002135036,0.000119304175,0.00038206074,0.002047971,0.003952666,0.94506013,0.0067625144,0.041190047],"study_design_scores_gemma":[0.00019116612,0.00024126057,0.0002585718,0.00015905872,0.000115744064,0.0007322893,0.00024103196,0.08079639,0.028180607,0.8059714,0.08300912,0.0001033629],"about_ca_topic_score_codex":0.00042043193,"about_ca_topic_score_gemma":0.0004946414,"teacher_disagreement_score":0.011955949,"about_ca_system_score_codex":0.0015462531,"about_ca_system_score_gemma":0.003175107,"threshold_uncertainty_score":0.039996624},"labels":[],"label_agreement":null},{"id":"W1553775054","doi":"10.1007/11814764_19","title":"Key Revocation for Identity-Based Schemes in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Revocation; Computer science; Computer network; Public-key cryptography; Node (physics); Mobile ad hoc network; Computer security; Wireless ad hoc network; Key (lock); Key management; Revocation list; Cryptography; Scheme (mathematics); Public key infrastructure; Encryption; Telecommunications; Wireless; Overhead (engineering); Engineering; Mathematics","score_opus":0.012511211369120218,"score_gpt":0.2545338079866253,"score_spread":0.24202259661750505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553775054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025257358,0.007371122,0.937198,0.001320496,0.0007908101,0.00032302272,0.000092514994,0.0008651109,0.026781607],"genre_scores_gemma":[0.7414873,0.0055158725,0.2154002,0.0003754116,0.0006790814,0.00045075922,0.00036983265,0.00024366326,0.035477776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966214,0.0012108029,0.00026605368,0.00037195277,0.0010728624,0.00045699388],"domain_scores_gemma":[0.99546057,0.0018820398,0.0003130714,0.0017815473,0.00042451208,0.00013826888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031094,0.0007027682,0.0011737143,0.00074035465,0.0016912429,0.0033693209,0.0025957834,0.0018849191,0.0045886487],"category_scores_gemma":[0.008990449,0.00056713837,0.0006269042,0.0014529534,0.0025749025,0.008979741,0.0039675017,0.0034329044,0.0018923727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006187473,0.00015032061,0.00039586684,0.00059840677,0.000049318583,0.00035970635,0.00093585986,0.01734056,0.0126343435,0.7345562,0.011207369,0.22115335],"study_design_scores_gemma":[0.00015683589,0.00030372405,0.00031699368,0.0002329856,0.000064856475,0.0016077394,0.00047393725,0.16991931,0.013908616,0.74290067,0.07000327,0.000110986875],"about_ca_topic_score_codex":0.0003118466,"about_ca_topic_score_gemma":0.00027967078,"teacher_disagreement_score":0.0045886487,"about_ca_system_score_codex":0.0016411187,"about_ca_system_score_gemma":0.0009731033,"threshold_uncertainty_score":0.016444266},"labels":[],"label_agreement":null},{"id":"W1556443226","doi":"10.1007/3-540-36178-2_22","title":"On Unconditionally Secure Robust Distributed Key Distribution Centers","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Verifiable secret sharing; Key distribution; Secret sharing; Encryption; Key (lock); Computer network; Scheme (mathematics); Server; Computer security; Distributed computing; Adversary; Set (abstract data type); Cryptography; Public-key cryptography; Mathematics","score_opus":0.013509845303457748,"score_gpt":0.21453234559898712,"score_spread":0.20102250029552937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556443226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009892178,0.0006593093,0.9745928,0.0008086051,0.00021887782,0.00010733715,0.0001483519,0.000929957,0.012642525],"genre_scores_gemma":[0.6596039,0.0026368944,0.28456038,0.0010749669,0.00081679196,0.0005584369,0.00069038855,0.0009150241,0.049143195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975654,0.00051805243,0.00011336736,0.00041037955,0.0010533981,0.00033952892],"domain_scores_gemma":[0.9961461,0.001698525,0.00027983385,0.0013656813,0.000399672,0.00011016365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020075382,0.0012494744,0.0013474501,0.00095733267,0.0013885591,0.0031730675,0.0029392722,0.0018174535,0.009584561],"category_scores_gemma":[0.007182987,0.00079970056,0.00068651943,0.0017065776,0.002895584,0.008122634,0.0070736352,0.0043270458,0.0030249401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032572882,0.00006608721,0.00012114632,0.000100370824,0.000021364353,0.00007702768,0.00011721888,0.046150945,0.0059553585,0.86938727,0.00759545,0.07008204],"study_design_scores_gemma":[0.000054713964,0.000081785685,0.00011399476,0.000036004873,0.000023462511,0.00013071808,0.000048667924,0.2275003,0.0069494536,0.7550917,0.009932338,0.00003678703],"about_ca_topic_score_codex":0.00051339,"about_ca_topic_score_gemma":0.00044840854,"teacher_disagreement_score":0.009584561,"about_ca_system_score_codex":0.0018075197,"about_ca_system_score_gemma":0.0012304924,"threshold_uncertainty_score":0.032063603},"labels":[],"label_agreement":null},{"id":"W1556721149","doi":"10.1109/infocom.2015.7218628","title":"TR-MABE: White-box traceable and revocable multi-authority attribute-based encryption and its applications to multi-level privacy-preserving e-healthcare cloud computing systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Encryption; Cloud computing; Outsourcing; Computer science; Computer security; Identity (music); Health care; Internet privacy; Patient privacy; Business","score_opus":0.1366961373607677,"score_gpt":0.33091096270169146,"score_spread":0.19421482534092377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556721149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016151767,0.00045636794,0.97823524,0.0004789715,0.00009131424,0.00016210621,0.0001434454,0.0007612899,0.003519449],"genre_scores_gemma":[0.8197063,0.00041361633,0.17402095,0.0003052533,0.00007666471,0.00017862722,0.00019368436,0.00008638638,0.005018415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967139,0.0010809412,0.00029965455,0.0005284775,0.0009917528,0.0003852816],"domain_scores_gemma":[0.9960978,0.0008656248,0.00051851396,0.0018233164,0.0005289365,0.00016583153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002350514,0.0004346098,0.0008217167,0.0006163759,0.00073376094,0.0016840269,0.0019720194,0.001132487,0.002589447],"category_scores_gemma":[0.0057105324,0.00026928014,0.0010081558,0.0010489598,0.0012628982,0.004656065,0.0027158093,0.0021943497,0.0010269064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010217489,0.00040029344,0.0017884166,0.00058176205,0.00019282488,0.0013792907,0.0009864738,0.14414017,0.058147408,0.5378981,0.0086907735,0.24477278],"study_design_scores_gemma":[0.00019758374,0.00048184543,0.00060208485,0.00010115149,0.00007684536,0.0022044089,0.00019538932,0.7441606,0.04284283,0.18037729,0.028613284,0.00014670033],"about_ca_topic_score_codex":0.00061612244,"about_ca_topic_score_gemma":0.00042649644,"teacher_disagreement_score":0.002589447,"about_ca_system_score_codex":0.00076633255,"about_ca_system_score_gemma":0.0014333315,"threshold_uncertainty_score":0.012430847},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017407361961557514,"score_gpt":0.2486044370477504,"score_spread":0.2311970750861929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562018356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093389384,0.0013370363,0.8303856,0.0013524725,0.00026905644,0.000083658546,0.00026426365,0.0010053434,0.0719131],"genre_scores_gemma":[0.8935573,0.0009927419,0.075256184,0.0002677055,0.00040635178,0.00019796885,0.00025554042,0.000327468,0.028738653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876106,0.00029076592,0.00006606028,0.0002133687,0.0004249993,0.00024363914],"domain_scores_gemma":[0.9963566,0.002133902,0.00017639571,0.0009924847,0.00020402341,0.00013659772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010150872,0.0005691498,0.001085435,0.00090561516,0.0012125785,0.0026480188,0.0015080753,0.00072168215,0.0073152403],"category_scores_gemma":[0.0049479553,0.00045736475,0.0009282446,0.0023239332,0.0029890295,0.0075121806,0.002754714,0.0037675502,0.0011695576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006007701,0.000011950161,0.000045397403,0.000033989447,0.0000046803534,0.00001902483,0.000085354004,0.0029659006,0.00056228606,0.9846267,0.0009435932,0.010641073],"study_design_scores_gemma":[0.000011535098,0.000018816805,0.000054675515,0.000009924198,0.0000075337484,0.000030579937,0.00001374775,0.013354373,0.0010685617,0.9833836,0.002039378,0.0000073054493],"about_ca_topic_score_codex":0.0004357801,"about_ca_topic_score_gemma":0.00024805975,"teacher_disagreement_score":0.0073152403,"about_ca_system_score_codex":0.001529564,"about_ca_system_score_gemma":0.0007425075,"threshold_uncertainty_score":0.024471939},"labels":[],"label_agreement":null},{"id":"W1563857976","doi":"10.1007/3-540-39799-x_18","title":"A Layered Approach to the Design of Private Key Cryptosystems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cryptosystem; Cryptography; Key (lock); Encryption; Key space; Key encapsulation; Theoretical computer science; Hybrid cryptosystem; Simple (philosophy); Algorithm; Symmetric-key algorithm; Public-key cryptography; Computer security","score_opus":0.04022197994180138,"score_gpt":0.2519787673323826,"score_spread":0.21175678739058124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563857976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027366208,0.00039709956,0.9891834,0.00046580666,0.00006392838,0.000059369646,0.000035225305,0.0006196397,0.006438823],"genre_scores_gemma":[0.13595022,0.0018531191,0.8503231,0.00031330492,0.00015784054,0.00027935547,0.00015982162,0.00034904087,0.010614254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971449,0.00087183976,0.00026578203,0.00022905506,0.0011659721,0.00032245062],"domain_scores_gemma":[0.9967974,0.0010589309,0.00019743928,0.0012060828,0.00054695486,0.00019316563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959716,0.0011764539,0.0007617689,0.0012172096,0.001298841,0.0056521636,0.002930866,0.0016785373,0.0051361746],"category_scores_gemma":[0.0070949197,0.0017728,0.0014754892,0.00131072,0.003001047,0.00837357,0.0041332007,0.0046329317,0.0022828758],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008896807,0.000046150606,0.00023332241,0.00018871091,0.000057812842,0.000092093665,0.00037202644,0.02689428,0.0062516434,0.89783096,0.0033988138,0.06454529],"study_design_scores_gemma":[0.000041920746,0.00006805279,0.00008560987,0.00013918534,0.00008049393,0.00016480534,0.000078140554,0.1359629,0.011972923,0.8138766,0.037472297,0.000057018467],"about_ca_topic_score_codex":0.0008983381,"about_ca_topic_score_gemma":0.0014224992,"teacher_disagreement_score":0.0056521636,"about_ca_system_score_codex":0.0017975688,"about_ca_system_score_gemma":0.0018169224,"threshold_uncertainty_score":0.017182171},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Nothing; Internet privacy; Computer science; Business; Philosophy; Epistemology","score_opus":0.03114779796906828,"score_gpt":0.27812935078081497,"score_spread":0.2469815528117467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572330878","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0879606,0.00841593,0.38359523,0.014648026,0.0024051254,0.0001825221,0.001035502,0.0015955414,0.50016147],"genre_scores_gemma":[0.83163726,0.005051919,0.026834836,0.0014620065,0.0009136748,0.00008760631,0.0004663698,0.00022428649,0.1333221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980457,0.00047478644,0.00012995025,0.00031450944,0.00072233944,0.00031275823],"domain_scores_gemma":[0.9952043,0.0012442846,0.0003334154,0.0027986434,0.00029781178,0.00012162499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014878686,0.00058908865,0.00051689957,0.00056596735,0.0009892767,0.003256106,0.0013142087,0.0014457406,0.009966053],"category_scores_gemma":[0.00653929,0.00042955618,0.0005853441,0.00088966155,0.002800164,0.008403857,0.0027847902,0.0020373168,0.0033400278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018065612,0.0000636289,0.00078384136,0.00023674846,0.00004571842,0.0002644404,0.0005955072,0.002004507,0.0044079875,0.8331001,0.017335853,0.14098099],"study_design_scores_gemma":[0.000028736898,0.000090153306,0.0005550782,0.00020321459,0.00007709309,0.0016535628,0.00026193395,0.008003752,0.021703018,0.839554,0.12781653,0.00005284769],"about_ca_topic_score_codex":0.00012050833,"about_ca_topic_score_gemma":0.0001478527,"teacher_disagreement_score":0.009966053,"about_ca_system_score_codex":0.0006076417,"about_ca_system_score_gemma":0.00084610004,"threshold_uncertainty_score":0.03333974},"labels":[],"label_agreement":null},{"id":"W1576239661","doi":"10.1109/wimob.2005.1512846","title":"Optimal secure data retrieval using an oblivious transfer scheme","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Oblivious transfer; Scheme (mathematics); Cryptography; Information retrieval; Computer security; Mathematics","score_opus":0.05117754267365345,"score_gpt":0.2821374034627391,"score_spread":0.23095986078908562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576239661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03648098,0.00040616494,0.9551731,0.0010503671,0.00006396505,0.0002124348,0.00015391315,0.000724451,0.005734605],"genre_scores_gemma":[0.72154874,0.0007281204,0.26912832,0.00033733697,0.00017482096,0.00045789487,0.00029722962,0.00015583963,0.0071716732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951592,0.001069807,0.00048714242,0.0007111033,0.0020334697,0.00053926976],"domain_scores_gemma":[0.99549806,0.001603235,0.00044469757,0.0020335144,0.0002722644,0.00014830696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020845106,0.0005527404,0.0015722098,0.0007839873,0.0014344902,0.0027027784,0.0020635603,0.0015107925,0.0034377233],"category_scores_gemma":[0.0061151455,0.00059595157,0.0009604608,0.0015687636,0.0028104417,0.009480433,0.0052058157,0.0021514753,0.0014534073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010882785,0.00038411826,0.0005079358,0.00042840288,0.000121730445,0.0003783645,0.00053131406,0.12954643,0.031764526,0.72707236,0.0056256945,0.1025509],"study_design_scores_gemma":[0.00036066893,0.00026283553,0.0001877688,0.000037795922,0.00007471947,0.00037064758,0.00011203466,0.43186724,0.035804406,0.52070165,0.010121694,0.0000985746],"about_ca_topic_score_codex":0.0003717347,"about_ca_topic_score_gemma":0.0002974385,"teacher_disagreement_score":0.0034377233,"about_ca_system_score_codex":0.0017434999,"about_ca_system_score_gemma":0.0026883613,"threshold_uncertainty_score":0.012650013},"labels":[],"label_agreement":null},{"id":"W1576729878","doi":"10.1109/pst.2015.7232961","title":"A secure revocable personal health record system with policy-based fine-grained access control","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Attribute-based encryption; Computer security; Access control; Encryption; Revocation; Cryptography; Ciphertext; Cryptographic primitive; Android (operating system); Data sharing; Service provider; Internet privacy; Service (business); Public-key cryptography; Cryptographic protocol; Business","score_opus":0.027390759411470643,"score_gpt":0.2807596617822251,"score_spread":0.2533689023707545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576729878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0911186,0.000804011,0.8791804,0.0013968113,0.00032347828,0.001159447,0.00028697492,0.016826782,0.008903496],"genre_scores_gemma":[0.86432236,0.00033454588,0.12265988,0.00045974407,0.00011952846,0.00029399834,0.00040346547,0.00016878349,0.011237733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723274,0.0006134995,0.00040022112,0.00043708624,0.0010160564,0.0003003729],"domain_scores_gemma":[0.99697113,0.00033063776,0.00039497428,0.0015002668,0.00054724846,0.0002556667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165259,0.00028118805,0.0006863019,0.0006728714,0.00078792754,0.0017593306,0.0015300397,0.0012578239,0.0023498544],"category_scores_gemma":[0.0032073504,0.0003192109,0.000632142,0.0005583772,0.00099321,0.0035830662,0.0028578017,0.0013530873,0.0016464799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003578278,0.0013559702,0.011768364,0.0009470266,0.00039359074,0.005175846,0.0027674495,0.03875323,0.24806172,0.22617307,0.026849365,0.43417606],"study_design_scores_gemma":[0.00094649335,0.0015681705,0.005673569,0.00014036319,0.00033277573,0.005516534,0.0004311669,0.6688195,0.14080949,0.028919172,0.14640518,0.00043766035],"about_ca_topic_score_codex":0.0015237675,"about_ca_topic_score_gemma":0.00074638485,"teacher_disagreement_score":0.0023498544,"about_ca_system_score_codex":0.000796924,"about_ca_system_score_gemma":0.0015671423,"threshold_uncertainty_score":0.011451125},"labels":[],"label_agreement":null},{"id":"W1576877349","doi":"10.1007/11556992_3","title":"Time-Based Release of Confidential Information in Hierarchical Settings","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Confidentiality; Computer security","score_opus":0.005998236118238785,"score_gpt":0.21739923651093762,"score_spread":0.21140100039269882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576877349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10482962,0.000874462,0.87102056,0.0007541181,0.00023195134,0.00027307984,0.00030058215,0.0014612055,0.020254405],"genre_scores_gemma":[0.9029436,0.0005250206,0.082908906,0.00015799105,0.00019339753,0.00017440082,0.00024411254,0.00022424344,0.012628193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99284923,0.0023805723,0.00054941117,0.000779895,0.0020682295,0.00137257],"domain_scores_gemma":[0.9604034,0.022007268,0.0033176944,0.010926894,0.0016169923,0.0017277345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060346257,0.00095825025,0.0017076221,0.0013502487,0.0012400197,0.003641071,0.0034310124,0.001670324,0.007549745],"category_scores_gemma":[0.02993789,0.0009981138,0.0009263195,0.0019186721,0.0027432877,0.01064353,0.0055775996,0.0027440758,0.0014195193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027994935,0.00027030805,0.0014944831,0.0003640394,0.00011156845,0.0005180047,0.0011585733,0.17214912,0.014436319,0.6947994,0.008053505,0.10384518],"study_design_scores_gemma":[0.00013441026,0.000445759,0.00062477204,0.000060108494,0.000070256385,0.00056193914,0.00028323263,0.60768056,0.008089181,0.3777201,0.0042359,0.00009366773],"about_ca_topic_score_codex":0.0005919393,"about_ca_topic_score_gemma":0.00049958815,"teacher_disagreement_score":0.007549745,"about_ca_system_score_codex":0.0014811215,"about_ca_system_score_gemma":0.0013859465,"threshold_uncertainty_score":0.031914532},"labels":[],"label_agreement":null},{"id":"W1581663072","doi":"10.1007/3-540-39568-7_7","title":"Some Public-Key Crypto-Functions as Intractable as Factorization","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cryptosystem; Public-key cryptography; Computer science; Digital signature; Factorization; Factoring; Plaintext-aware encryption; Encryption; Theoretical computer science; Cryptography; Key (lock); Integer factorization; Mathematics; Deterministic encryption; Computer security; Algorithm; Hash function","score_opus":0.023529506798401458,"score_gpt":0.25717308456722276,"score_spread":0.2336435777688213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581663072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09751128,0.0106245065,0.52640516,0.030135857,0.0013546637,0.0002877822,0.0011107798,0.0009529578,0.33161703],"genre_scores_gemma":[0.83424765,0.0069937506,0.06958218,0.0024909936,0.0019622466,0.00038134996,0.0007671655,0.0005288777,0.083045654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751186,0.0007953444,0.00013901903,0.00030883422,0.0008931729,0.00035176493],"domain_scores_gemma":[0.9929068,0.0049423096,0.00029208625,0.0013464303,0.00033933303,0.00017301792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030505224,0.0014603386,0.0016059743,0.0015352125,0.0027990565,0.006859342,0.001384703,0.0027023198,0.009210223],"category_scores_gemma":[0.01597993,0.00095781026,0.0014820216,0.003468961,0.008224464,0.017700091,0.0031212694,0.008971004,0.0023302832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035158282,0.000008673047,0.00003332108,0.000040700586,0.0000042254383,0.000018860268,0.000067174355,0.0010290407,0.00009035032,0.99181706,0.002365813,0.0044895583],"study_design_scores_gemma":[0.000012413499,0.000004122104,0.000019632816,0.0000109490675,0.0000044056264,0.00003871345,0.0000102835975,0.003033935,0.0001781996,0.9941049,0.0025772885,0.0000050641465],"about_ca_topic_score_codex":0.0006331662,"about_ca_topic_score_gemma":0.00051036227,"teacher_disagreement_score":0.009210223,"about_ca_system_score_codex":0.003642711,"about_ca_system_score_gemma":0.0016850388,"threshold_uncertainty_score":0.03081131},"labels":[],"label_agreement":null},{"id":"W1582427591","doi":"","title":"Encrypted processes for oblivious data retrieval","year":2011,"lang":"en","type":"article","venue":"International Conference for Internet Technology and Secured Transactions","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Encryption; Server; Cloud computing; The Internet; Process (computing); Information privacy; Database; Computer security; Computer network; World Wide Web; Operating system","score_opus":0.0973360943738306,"score_gpt":0.2967641895469393,"score_spread":0.19942809517310867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582427591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021187255,0.0013690665,0.96674347,0.00069838704,0.000174422,0.00031038388,0.00006793344,0.00077612436,0.0086730905],"genre_scores_gemma":[0.59895515,0.002176568,0.37736306,0.0004983941,0.0002907602,0.0006894696,0.00022136561,0.00032432374,0.019480905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763954,0.00056017254,0.00020318136,0.00020787334,0.0011296001,0.0002596767],"domain_scores_gemma":[0.99744153,0.0009549874,0.00023998789,0.0009639164,0.00034132064,0.000058268633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014534073,0.0004850268,0.0007039406,0.0006490069,0.0010332011,0.00197078,0.0011898007,0.001038312,0.004636077],"category_scores_gemma":[0.005102519,0.00041118727,0.0005633031,0.0009078792,0.0021982172,0.0054257903,0.0026805701,0.0020639207,0.0016861823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006688811,0.00018064432,0.0004320244,0.00033655338,0.000045979526,0.0004233165,0.00065982866,0.03172402,0.021960547,0.85847193,0.004598424,0.08049797],"study_design_scores_gemma":[0.00033972054,0.0002987788,0.00023656861,0.00013737816,0.00007668504,0.00087094784,0.00016770445,0.38077962,0.05789073,0.5003015,0.058831666,0.00006874238],"about_ca_topic_score_codex":0.0004797278,"about_ca_topic_score_gemma":0.00037339496,"teacher_disagreement_score":0.004636077,"about_ca_system_score_codex":0.0009989643,"about_ca_system_score_gemma":0.001373745,"threshold_uncertainty_score":0.015509248},"labels":[],"label_agreement":null},{"id":"W1582612001","doi":"10.1007/11889663_18","title":"Conditional Encrypted Mapping and Comparing Encrypted Numbers","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Encryption; Extension (predicate logic); Theoretical computer science; Common value auction; Variety (cybernetics); Cryptography; Computer security; Artificial intelligence; Mathematics; Programming language","score_opus":0.01629565653645883,"score_gpt":0.22689966167781167,"score_spread":0.21060400514135283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582612001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05623675,0.00035755255,0.9255813,0.00031447166,0.00029072017,0.000106291795,0.00029812485,0.001154736,0.015660064],"genre_scores_gemma":[0.53444415,0.00043965311,0.4461133,0.00013602873,0.00015762838,0.00013878083,0.0009485795,0.0005189807,0.01710285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695814,0.00080650195,0.0002610009,0.00050869375,0.0012023159,0.00026331656],"domain_scores_gemma":[0.9931687,0.0032354554,0.0004222961,0.001997446,0.0010346498,0.00014143746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00212565,0.00044541986,0.0007658588,0.0015764995,0.00072240323,0.0028624088,0.0016958581,0.00076495507,0.0070883026],"category_scores_gemma":[0.017149676,0.00036204088,0.00056959834,0.002265282,0.0015854826,0.00790792,0.002791171,0.00138962,0.0015943546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005738761,0.000053026066,0.0017039585,0.00016123411,0.000036110046,0.00030605076,0.00032549584,0.017413514,0.006809299,0.7012845,0.005031472,0.2663014],"study_design_scores_gemma":[0.000024708408,0.00013120129,0.0011489048,0.00007632138,0.00005040967,0.0009573116,0.00019113664,0.1817361,0.02961484,0.76899606,0.017019827,0.000053228803],"about_ca_topic_score_codex":0.0004710208,"about_ca_topic_score_gemma":0.000409603,"teacher_disagreement_score":0.0070883026,"about_ca_system_score_codex":0.0009234111,"about_ca_system_score_gemma":0.0011329051,"threshold_uncertainty_score":0.023712754},"labels":[],"label_agreement":null},{"id":"W1583751262","doi":"10.1007/978-3-642-10628-6_4","title":"A Study of Two-Party Certificateless Authenticated Key-Agreement Protocols","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Ephemeral key; Authenticated Key Exchange; Key (lock); Flexibility (engineering); Adversary; Key exchange; Public-key cryptography; Mathematics; Encryption","score_opus":0.04438229916738024,"score_gpt":0.3045518653909579,"score_spread":0.2601695662235777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583751262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09075554,0.008146276,0.77309215,0.0055481824,0.000600956,0.0004199488,0.00023526278,0.00021778223,0.12098388],"genre_scores_gemma":[0.8848935,0.006184277,0.080815405,0.00052199996,0.000716192,0.00039189777,0.00023288766,0.00015800916,0.026085889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932875,0.0026276584,0.00033863698,0.0008085275,0.0023141308,0.00062348467],"domain_scores_gemma":[0.9801896,0.015454805,0.0008165563,0.0021190927,0.0010493117,0.0003705919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005326685,0.0010141714,0.0014724524,0.0016854625,0.0032006467,0.006976539,0.0034889372,0.0033288465,0.0070221187],"category_scores_gemma":[0.024005529,0.0011063442,0.0015046899,0.0047904635,0.006055966,0.01727772,0.0036390424,0.005994448,0.0011238786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003295612,0.000028753337,0.00008773442,0.000057184472,0.0000087675735,0.00009006081,0.0002228733,0.0046183662,0.00033667826,0.9890926,0.0006205579,0.0048034354],"study_design_scores_gemma":[0.000030438488,0.000047118843,0.00009741738,0.000054729284,0.00002092326,0.00022599127,0.00015819914,0.076540045,0.0005902665,0.9162015,0.006011065,0.000022484704],"about_ca_topic_score_codex":0.0010766509,"about_ca_topic_score_gemma":0.0005363853,"teacher_disagreement_score":0.0070221187,"about_ca_system_score_codex":0.0029440834,"about_ca_system_score_gemma":0.0028762359,"threshold_uncertainty_score":0.028170586},"labels":[],"label_agreement":null},{"id":"W1585991710","doi":"10.1007/978-3-030-71522-9_240","title":"Cut-and-Choose Protocol","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Protocol (science); Computer science; Medicine","score_opus":0.013645142401271695,"score_gpt":0.25843478049040053,"score_spread":0.24478963808912885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585991710","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00637268,0.0021602036,0.39392242,0.003143229,0.0014795547,0.0006524283,0.0011998442,0.0021235703,0.588946],"genre_scores_gemma":[0.16986896,0.005358136,0.17571753,0.0028422496,0.0006601701,0.0014870537,0.002099417,0.0010593272,0.64090717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992393,0.00014710783,0.000035430676,0.000111915135,0.0003464307,0.000119841585],"domain_scores_gemma":[0.9992968,0.00022540639,0.000036571142,0.00028309526,0.00011529365,0.000042839463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007340487,0.001018497,0.0008342878,0.0011392784,0.0017443291,0.0031917184,0.0013493905,0.0015906821,0.03289139],"category_scores_gemma":[0.0019671575,0.00044455496,0.00053059857,0.0017490617,0.0019269629,0.004903921,0.0025958428,0.0042302455,0.017319918],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091822236,0.00003387436,0.000040624585,0.00009108752,0.000008962801,0.000067988425,0.00010391634,0.0007522673,0.0019361239,0.89028597,0.04816923,0.058418136],"study_design_scores_gemma":[0.000057888064,0.00004413735,0.00009104579,0.000105877356,0.000024234541,0.00047095554,0.000095045354,0.010148058,0.0070869955,0.6562951,0.3255358,0.000044887343],"about_ca_topic_score_codex":0.0005508119,"about_ca_topic_score_gemma":0.000833091,"teacher_disagreement_score":0.03289139,"about_ca_system_score_codex":0.0012145112,"about_ca_system_score_gemma":0.0018026232,"threshold_uncertainty_score":0.11003268},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Zero-knowledge proof; Ciphertext; Computer science; Computer security; Encryption; Cryptography","score_opus":0.024331450237070083,"score_gpt":0.2923114647678343,"score_spread":0.26798001453076425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589176872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024751702,0.0016671222,0.90748036,0.0040886644,0.00035500663,0.0002549809,0.0004975306,0.0010015945,0.059903007],"genre_scores_gemma":[0.8509163,0.0016706261,0.1117787,0.00084080343,0.00046575314,0.00041563963,0.0004507945,0.00025725798,0.033203986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98995274,0.0031143024,0.00048410584,0.0011710207,0.0040295664,0.0012482188],"domain_scores_gemma":[0.9689214,0.023715345,0.0010563413,0.0047141565,0.0011327674,0.00046006113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049652806,0.001211224,0.0021739057,0.0013112469,0.0020901773,0.0067484793,0.0034483974,0.00349213,0.0075162556],"category_scores_gemma":[0.020506477,0.0014536689,0.0020323792,0.0020704968,0.006039407,0.013765522,0.00841188,0.0069244653,0.0024181665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033967884,0.000088998495,0.0002692504,0.00030499828,0.000074553034,0.0002848579,0.0005051927,0.014098136,0.0026934617,0.95155853,0.0047856104,0.024996633],"study_design_scores_gemma":[0.00006533627,0.000028956407,0.000093690716,0.000062697945,0.000034969657,0.00024545108,0.000031783893,0.045485668,0.0046645976,0.9451277,0.0041223112,0.00003675979],"about_ca_topic_score_codex":0.0007068241,"about_ca_topic_score_gemma":0.0004754313,"teacher_disagreement_score":0.0075162556,"about_ca_system_score_codex":0.0031047475,"about_ca_system_score_gemma":0.0031864827,"threshold_uncertainty_score":0.026259184},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02802479393924267,"score_gpt":0.251666548258778,"score_spread":0.2236417543195353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590453572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014992552,0.00088262325,0.91179144,0.003702413,0.0011782739,0.00017816595,0.0004905029,0.008702374,0.0580816],"genre_scores_gemma":[0.24328873,0.0014246706,0.6764625,0.001133174,0.00036649508,0.00041778124,0.0011400984,0.0045968345,0.07116974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00020015375,0.00006688925,0.00011540202,0.00028922694,0.00010765579],"domain_scores_gemma":[0.9986659,0.00054793595,0.00003939828,0.0005204845,0.0001735948,0.000052671774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068780105,0.0006832012,0.00061533373,0.0004124335,0.00088955095,0.002670748,0.0008894577,0.0013643464,0.017962726],"category_scores_gemma":[0.0053497474,0.0006972396,0.0010197127,0.0005103778,0.0016412875,0.0067076334,0.0020671475,0.0027346069,0.009015583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013041806,0.00007837029,0.00055895303,0.0006571605,0.000117560485,0.0002894682,0.00075129035,0.01806531,0.0144072715,0.6177181,0.05743376,0.2897924],"study_design_scores_gemma":[0.000030187997,0.000027641183,0.00016518823,0.000119853205,0.000039936232,0.00028186722,0.00014173836,0.045502,0.023316605,0.82565904,0.10467538,0.00004051897],"about_ca_topic_score_codex":0.0005804042,"about_ca_topic_score_gemma":0.0006466617,"teacher_disagreement_score":0.017962726,"about_ca_system_score_codex":0.0005119548,"about_ca_system_score_gemma":0.00077883893,"threshold_uncertainty_score":0.060091317},"labels":[],"label_agreement":null},{"id":"W1592523240","doi":"10.1109/pacrim.2015.7334830","title":"CRT based somewhat homomorphic encryption over the integers","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Homomorphic encryption; Encryption; Computer science; Homomorphism; Cryptography; Theoretical computer science; Computation; Multiple encryption; Scheme (mathematics); Confidentiality; Probabilistic encryption; Computer security; Algorithm; Mathematics","score_opus":0.03238131260693049,"score_gpt":0.24752462510399373,"score_spread":0.21514331249706325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592523240","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062080335,0.0010417157,0.8934575,0.0010246807,0.0003390892,0.00033415444,0.00055283966,0.0014977655,0.03967193],"genre_scores_gemma":[0.78055227,0.0007970201,0.20546879,0.0003989057,0.00017661671,0.0002390171,0.00027441917,0.000092105016,0.012000839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886096,0.00028025045,0.0000966417,0.00016561827,0.00042592396,0.00017062528],"domain_scores_gemma":[0.99927336,0.00023450438,0.000095015086,0.00025400647,0.000102326776,0.00004077384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077572686,0.00031447996,0.00048653843,0.00037270944,0.0004731026,0.0013498944,0.00067061663,0.00068741373,0.0033682704],"category_scores_gemma":[0.0018535287,0.00017250229,0.00053651846,0.00052796584,0.0010713913,0.0022880242,0.0010928186,0.0013445851,0.0011131411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038479382,0.000083605686,0.00032527535,0.00017756992,0.000018611696,0.00062073587,0.0004789635,0.010851787,0.03364036,0.905517,0.004306161,0.043595064],"study_design_scores_gemma":[0.00033207837,0.0008918552,0.0010659155,0.000198134,0.00009125884,0.002725959,0.00018563755,0.19259089,0.093126714,0.6124201,0.096201755,0.00016972142],"about_ca_topic_score_codex":0.00038475194,"about_ca_topic_score_gemma":0.00020414533,"teacher_disagreement_score":0.0033682704,"about_ca_system_score_codex":0.00087216974,"about_ca_system_score_gemma":0.0007702884,"threshold_uncertainty_score":0.01126796},"labels":[],"label_agreement":null},{"id":"W1592748842","doi":"10.1007/11605805_6","title":"Another Look at Small RSA Exponents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponent; Computer science; Public-key cryptography; Key (lock); Critical exponent; Discrete mathematics; Theoretical computer science; Mathematics; Computer security; Encryption; Scaling; Geometry","score_opus":0.019956215077243548,"score_gpt":0.22758990769814297,"score_spread":0.20763369262089942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592748842","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019129245,0.041221656,0.11831702,0.036888003,0.0102678025,0.00007887581,0.00027549197,0.0013545345,0.7724674],"genre_scores_gemma":[0.22204179,0.029053295,0.07439112,0.012504309,0.008018885,0.000112078385,0.00024401434,0.0022760532,0.6513585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999597,0.000085166794,0.000017509998,0.000064092295,0.00019051504,0.000045653673],"domain_scores_gemma":[0.99886596,0.0006160234,0.000049057722,0.00024195974,0.00016068376,0.000066437155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046637192,0.001227781,0.00094562443,0.0016817541,0.0014886977,0.0023951328,0.0008010414,0.0010863929,0.040017236],"category_scores_gemma":[0.0031759571,0.0005184433,0.00059248914,0.0012056746,0.002521019,0.012617111,0.0015550569,0.005255009,0.011929812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010439034,0.000040536273,0.0001027004,0.00020749336,0.0000101943315,0.00014492888,0.0002844861,0.00035856865,0.004367342,0.89538294,0.039617937,0.059378523],"study_design_scores_gemma":[0.000033801192,0.0000853056,0.00013236655,0.00014425108,0.000017910841,0.0006125128,0.0001313153,0.00090362615,0.0030095691,0.6753876,0.31951475,0.000026921995],"about_ca_topic_score_codex":0.00021519302,"about_ca_topic_score_gemma":0.00043914327,"teacher_disagreement_score":0.040017236,"about_ca_system_score_codex":0.0009001871,"about_ca_system_score_gemma":0.00031116803,"threshold_uncertainty_score":0.13387102},"labels":[],"label_agreement":null},{"id":"W1593793911","doi":"10.1007/11427995_7","title":"Private Mining of Association Rules","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Homomorphic encryption; Computer science; Association rule learning; Encryption; Confidentiality; Protocol (science); Computer security; Data sharing; Secure multi-party computation; Private information retrieval; Focus (optics); Set (abstract data type); Task (project management); Data mining; Cryptography","score_opus":0.012836411530273345,"score_gpt":0.23525049561436948,"score_spread":0.22241408408409613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593793911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062019948,0.0012864204,0.92790437,0.001274722,0.0001381005,0.00017927351,0.0012015195,0.0014180222,0.004577663],"genre_scores_gemma":[0.5124819,0.001592075,0.46257517,0.00036512237,0.00042896566,0.00021853851,0.0072282623,0.00026456403,0.014845316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954367,0.00096027047,0.00045284542,0.0011230854,0.00176892,0.0002581749],"domain_scores_gemma":[0.9887649,0.005561508,0.0006993525,0.0039152205,0.0008361178,0.00022294442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032363061,0.00065585633,0.0014963975,0.0027639277,0.0011512109,0.0032549547,0.002506529,0.0011682682,0.0031950804],"category_scores_gemma":[0.014081159,0.00087640085,0.0018931708,0.0027046287,0.0011406326,0.005075373,0.003072177,0.0021119819,0.0019595453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065439695,0.0006550038,0.010996341,0.000443451,0.00041662957,0.0005609463,0.00044909224,0.032187253,0.013232053,0.073773585,0.011427555,0.8552036],"study_design_scores_gemma":[0.000101465674,0.00022351675,0.0035228767,0.000117769836,0.0002326161,0.0016899096,0.00021218725,0.5831899,0.020355597,0.37393457,0.016376007,0.000043640714],"about_ca_topic_score_codex":0.0004925179,"about_ca_topic_score_gemma":0.0009652637,"teacher_disagreement_score":0.0032549547,"about_ca_system_score_codex":0.00075764843,"about_ca_system_score_gemma":0.0017218245,"threshold_uncertainty_score":0.017115414},"labels":[],"label_agreement":null},{"id":"W1596404826","doi":"10.1109/cloud.2015.83","title":"Keyword Search over Shared Cloud Data without Secure Channel or Authority","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Encryption; Cloud computing; Computer science; Outsourcing; Computer security; Channel (broadcasting); Cloud storage; Cloud computing security; Computer network; Internet privacy; Business","score_opus":0.15834902517828844,"score_gpt":0.3500270831073978,"score_spread":0.19167805792910933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596404826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20549668,0.001581605,0.78309447,0.00091186893,0.00013322064,0.00038044452,0.0006096328,0.0013493306,0.006442845],"genre_scores_gemma":[0.9485831,0.00032420145,0.048314784,0.00010223658,0.0000708241,0.00010246312,0.00016276303,0.000052737912,0.0022867892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472296,0.0007248573,0.0006861754,0.00090136897,0.0018561224,0.0011084437],"domain_scores_gemma":[0.9845099,0.004050526,0.0020149676,0.007408143,0.001478199,0.00053829997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021909694,0.0006307055,0.002440129,0.0012258732,0.0020620024,0.0036256933,0.0020075755,0.0014940582,0.0021164606],"category_scores_gemma":[0.009103639,0.0005295615,0.0010381558,0.0031500717,0.0020216673,0.0095409965,0.004878588,0.0012333363,0.0010158322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006967117,0.000715939,0.012117805,0.0013572453,0.0007417835,0.004467752,0.0026543685,0.13108197,0.15385617,0.3589625,0.011327334,0.31574997],"study_design_scores_gemma":[0.00036639508,0.0005039782,0.0015008479,0.000102473205,0.0002711281,0.0029560819,0.00084368326,0.73905474,0.102846004,0.13472956,0.016609533,0.00021570602],"about_ca_topic_score_codex":0.0019715447,"about_ca_topic_score_gemma":0.0014112003,"teacher_disagreement_score":0.0036256933,"about_ca_system_score_codex":0.001709591,"about_ca_system_score_gemma":0.0030854752,"threshold_uncertainty_score":0.012404025},"labels":[],"label_agreement":null},{"id":"W1604604413","doi":"10.1007/11687238_16","title":"Authorization-Transparent Access Control for XML Under the Non-Truman Model","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; XPath; Access control; XML; XML Schema (W3C); Authorization; Role-based access control; Transparency (behavior); Parameterized complexity; Database; Computer security; Programming language; XML Signature; XML database; Document Structure Description; World Wide Web; Algorithm","score_opus":0.030968736806513852,"score_gpt":0.28291570672809674,"score_spread":0.2519469699215829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604604413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016894279,0.00067657256,0.94224274,0.0019112228,0.000337092,0.00014090182,0.00016994172,0.0020617833,0.035565417],"genre_scores_gemma":[0.7215934,0.0012604635,0.23864526,0.0010358613,0.0006694226,0.0004653363,0.0005339037,0.0006505292,0.035145853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912315,0.0025054307,0.00094509614,0.0009613181,0.0033234658,0.0010331941],"domain_scores_gemma":[0.9930032,0.0027179108,0.0005453642,0.002704512,0.0007863193,0.00024270813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005323848,0.000534366,0.0010240503,0.0010173765,0.0019552137,0.0062426375,0.002401869,0.002499029,0.005096633],"category_scores_gemma":[0.007855391,0.00073346903,0.0017072205,0.0015007149,0.0054414063,0.014399562,0.003993192,0.00550865,0.0016075561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009113784,0.00003313722,0.00011780185,0.000058224454,0.000015916921,0.000115735194,0.00029474558,0.0024541505,0.0020340255,0.976029,0.0024739823,0.01628218],"study_design_scores_gemma":[0.000055138757,0.0000484698,0.000113649316,0.00004309283,0.000033439137,0.0002920885,0.00009285284,0.047722753,0.00524119,0.9312236,0.015080902,0.000052864394],"about_ca_topic_score_codex":0.0027240005,"about_ca_topic_score_gemma":0.0020736982,"teacher_disagreement_score":0.0062426375,"about_ca_system_score_codex":0.0019299163,"about_ca_system_score_gemma":0.0027156505,"threshold_uncertainty_score":0.028155506},"labels":[],"label_agreement":null},{"id":"W161845448","doi":"10.1007/978-3-642-31410-0_6","title":"Bounds and Constructions for 1-Round (0,δ)-Secure Message Transmission against Generalized Adversary","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Secret sharing; Communication complexity; Theoretical computer science; Communication source; Adversary; Upper and lower bounds; Adversary model; Disjoint sets; Security parameter; Computer network; Cryptography; Discrete mathematics; Mathematics; Algorithm; Computer security","score_opus":0.015057917327216291,"score_gpt":0.243302894587604,"score_spread":0.22824497726038773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161845448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0545778,0.0068601198,0.8067283,0.0064830347,0.00088137947,0.0006897867,0.0013115855,0.004143746,0.1183242],"genre_scores_gemma":[0.72321033,0.0067169573,0.21674344,0.002220994,0.001497055,0.0022976396,0.0018218794,0.0016427771,0.043848787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9888237,0.0023616552,0.00059561676,0.0018950446,0.0036660274,0.0026579758],"domain_scores_gemma":[0.9752459,0.01713671,0.0010947977,0.0046331286,0.0009671374,0.0009223368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006960677,0.0040624654,0.0036532034,0.0042690593,0.0043185656,0.009804784,0.0073039047,0.004939668,0.014799015],"category_scores_gemma":[0.021307528,0.0026772742,0.004689245,0.005060721,0.0065702503,0.024624676,0.014580146,0.015752664,0.005555773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008583881,0.00016980522,0.00042015212,0.000644021,0.00013864704,0.00025323572,0.0009208922,0.034895994,0.0070319143,0.9041627,0.011985989,0.038518324],"study_design_scores_gemma":[0.000076927296,0.00018234208,0.0003693822,0.0003344212,0.0002801128,0.00037019773,0.00013757656,0.10178628,0.0067741587,0.8789347,0.010584497,0.00016952216],"about_ca_topic_score_codex":0.001469145,"about_ca_topic_score_gemma":0.0013849384,"teacher_disagreement_score":0.014799015,"about_ca_system_score_codex":0.008477713,"about_ca_system_score_gemma":0.003925081,"threshold_uncertainty_score":0.061510444},"labels":[],"label_agreement":null},{"id":"W162331591","doi":"10.1007/978-3-642-27739-9_95-2","title":"Schnorr Identification Protocol","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Protocol (science); Identification (biology); Medicine; Biology","score_opus":0.02166011130841794,"score_gpt":0.2648809201761888,"score_spread":0.24322080886777087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162331591","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062541757,0.0029053718,0.25524142,0.0028866825,0.00092888327,0.00034965237,0.0009525399,0.0024887263,0.7279926],"genre_scores_gemma":[0.16274677,0.0060033845,0.09814403,0.0017490858,0.0006076086,0.0005106827,0.0017678683,0.0007325836,0.7277379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929047,0.00012849044,0.000029944962,0.00009869345,0.00035953612,0.00009288711],"domain_scores_gemma":[0.9995289,0.00013774999,0.000026913009,0.00016576205,0.00011442223,0.000026269996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000546145,0.0009148102,0.0005122171,0.0012967804,0.0017077479,0.0020852527,0.0009516244,0.0010866502,0.038457956],"category_scores_gemma":[0.0012536729,0.0004256622,0.00036753088,0.001947669,0.0013832472,0.0040952824,0.001849976,0.0023912077,0.02077792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006232752,0.00003750407,0.00003670537,0.00016407043,0.000008645256,0.000076321885,0.00018029392,0.0015827637,0.0039131194,0.8467358,0.046764262,0.100438274],"study_design_scores_gemma":[0.00001931011,0.000053344746,0.000115229384,0.00010469276,0.000025926995,0.0004239608,0.00010954894,0.006561901,0.0141829755,0.49595624,0.48239735,0.000049509366],"about_ca_topic_score_codex":0.0006738308,"about_ca_topic_score_gemma":0.00085772335,"teacher_disagreement_score":0.038457956,"about_ca_system_score_codex":0.0012985009,"about_ca_system_score_gemma":0.0015049357,"threshold_uncertainty_score":0.12865472},"labels":[],"label_agreement":null},{"id":"W162742832","doi":"","title":"An Efficient and Flexible Scheme to Support Biometric-Based and Role-Based Access Control","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Ciphertext; Encryption; Random oracle; DECIPHER; Theoretical computer science; Scheme (mathematics); Computer science; Cryptography; Identity (music); Set (abstract data type); Biometrics; Attribute-based encryption; Cryptographic primitive; Access control; Mathematics; Computer security; Public-key cryptography; Cryptographic protocol; Programming language","score_opus":0.016173003785775426,"score_gpt":0.29500760206454246,"score_spread":0.27883459827876705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162742832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016306022,0.00031278149,0.9778256,0.00038435447,0.00013099231,0.00032120757,0.00007998089,0.0008319406,0.0038072038],"genre_scores_gemma":[0.57047147,0.00045641014,0.4189642,0.0002941659,0.00017114084,0.0004959237,0.0003045572,0.0000903892,0.008751662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558085,0.0010474406,0.000441813,0.0006777144,0.0016754328,0.00057664997],"domain_scores_gemma":[0.9957696,0.00065015355,0.0004798366,0.0023078627,0.00049569015,0.0002968331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032395378,0.00061916525,0.0011892663,0.0009805915,0.0014582826,0.002140534,0.0024430824,0.0017012408,0.002810279],"category_scores_gemma":[0.005777652,0.0005153907,0.0009918673,0.0013172188,0.0019761682,0.0063476404,0.0053915335,0.0025651837,0.0013997783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007033615,0.00026538776,0.0008252197,0.0002126758,0.00008015931,0.0007030953,0.00078426895,0.0156148635,0.08291846,0.7301549,0.005089826,0.16264772],"study_design_scores_gemma":[0.00070946803,0.0013150086,0.0015553912,0.00014348887,0.00022033362,0.0053411005,0.00030080244,0.44030103,0.11259494,0.27013656,0.16697673,0.00040519334],"about_ca_topic_score_codex":0.00035382714,"about_ca_topic_score_gemma":0.00036415967,"teacher_disagreement_score":0.0032395378,"about_ca_system_score_codex":0.00088456424,"about_ca_system_score_gemma":0.0012463197,"threshold_uncertainty_score":0.01713252},"labels":[],"label_agreement":null},{"id":"W1631229389","doi":"10.1109/sfcs.1998.743499","title":"Lower bounds for zero knowledge on the Internet","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Zero-knowledge proof; Mathematical proof; Asynchronous communication; Computer science; Argument (complex analysis); Zero (linguistics); Theoretical computer science; The Internet; Class (philosophy); Mathematics; Artificial intelligence; Computer network; World Wide Web","score_opus":0.03950594790954061,"score_gpt":0.25278911530177345,"score_spread":0.21328316739223285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1631229389","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124141514,0.01285772,0.5343449,0.021649403,0.000800649,0.00025557267,0.002013532,0.002339663,0.301597],"genre_scores_gemma":[0.90718186,0.008205558,0.05227672,0.0023062543,0.0018743878,0.00063675933,0.0016508186,0.0008646743,0.02500303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98861104,0.0026126397,0.00042944035,0.0017363598,0.003990742,0.0026198379],"domain_scores_gemma":[0.8806645,0.09692028,0.004283947,0.009224488,0.0050184154,0.003888374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009572722,0.0019329627,0.0024445364,0.005969484,0.0041451138,0.011131436,0.0054395874,0.0040346156,0.020291409],"category_scores_gemma":[0.06150299,0.0013312376,0.0020852666,0.004731265,0.007455049,0.02605297,0.00840584,0.010171031,0.0035634148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004633931,0.00013654937,0.0008372959,0.00037580184,0.000082573424,0.00020299766,0.00037390037,0.033889778,0.0010325533,0.93615806,0.008884866,0.017562265],"study_design_scores_gemma":[0.000059192054,0.00004521689,0.00026351056,0.00015620526,0.000075066855,0.00012807462,0.0000627654,0.08527634,0.0011626544,0.90662503,0.006107463,0.00003860335],"about_ca_topic_score_codex":0.002190538,"about_ca_topic_score_gemma":0.0017581184,"teacher_disagreement_score":0.020291409,"about_ca_system_score_codex":0.007100908,"about_ca_system_score_gemma":0.003005933,"threshold_uncertainty_score":0.067881584},"labels":[],"label_agreement":null},{"id":"W1641444145","doi":"10.1007/978-3-642-45249-9_16","title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Asynchronous communication; Computer science; Computation; Latency (audio); Secure multi-party computation; Theoretical computer science; Function (biology); Distributed algorithm; Field (mathematics); Distributed computing; Algorithm; Computer network; Mathematics; Telecommunications","score_opus":0.01032017751236791,"score_gpt":0.2362114292912487,"score_spread":0.22589125177888078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641444145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009894764,0.00042009275,0.9761505,0.00038697105,0.00032995854,0.00016255237,0.00016699288,0.0018872587,0.0106008835],"genre_scores_gemma":[0.53911155,0.000552702,0.42893106,0.0005372753,0.000399019,0.00054443703,0.00046881204,0.00074583397,0.028709264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973406,0.0008543858,0.00015896196,0.00035748028,0.0009702034,0.00031840714],"domain_scores_gemma":[0.9973748,0.0013278805,0.00009816327,0.0008694126,0.00020741961,0.00012224844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024843425,0.00073315424,0.0017207937,0.00066176715,0.0012426677,0.002825026,0.002539637,0.0017470339,0.010032041],"category_scores_gemma":[0.0053927894,0.0006201835,0.0007023879,0.0013437426,0.0012911175,0.0035699983,0.005881596,0.0025933008,0.0033282042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012046961,0.00028255646,0.00031966262,0.00035764175,0.000084456886,0.0002252425,0.00037303485,0.053128246,0.022340411,0.61486316,0.022875356,0.28394556],"study_design_scores_gemma":[0.00016741811,0.00009831825,0.00011327881,0.000027755352,0.000028431927,0.00014466711,0.000045790566,0.570711,0.009818664,0.40484157,0.01396698,0.000036058394],"about_ca_topic_score_codex":0.00030530643,"about_ca_topic_score_gemma":0.0004951903,"teacher_disagreement_score":0.010032041,"about_ca_system_score_codex":0.00077405653,"about_ca_system_score_gemma":0.0008043859,"threshold_uncertainty_score":0.033560455},"labels":[],"label_agreement":null},{"id":"W167406361","doi":"10.1007/978-3-540-85093-9_8","title":"A Single Initialization Server for Multi-party Cryptography","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Initialization; Computer science; Protocol (science); Cryptography; Computer security; Computer network; Modular design; Zero-knowledge proof; Theoretical computer science; Distributed computing; Operating system","score_opus":0.04531214121852579,"score_gpt":0.26840447495771924,"score_spread":0.22309233373919346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167406361","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012921909,0.00092081854,0.9548878,0.00025208108,0.00048884295,0.00043624252,0.000209487,0.017598184,0.012284631],"genre_scores_gemma":[0.38940609,0.0008592826,0.5478646,0.00051532727,0.0006113226,0.0008143649,0.0014466078,0.0038611507,0.054621264],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713886,0.0004901622,0.00024824307,0.00050460896,0.0011052265,0.0005129769],"domain_scores_gemma":[0.9956109,0.00041981746,0.0001613824,0.0028807619,0.00060532114,0.00032181307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017036751,0.00152352,0.0023803127,0.0015332272,0.0023462265,0.003750313,0.004103915,0.0020074283,0.020089729],"category_scores_gemma":[0.0030852184,0.0017370972,0.001091804,0.001699592,0.0013230294,0.0083564585,0.0058530257,0.00434788,0.021052321],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036213158,0.00077740225,0.0017566737,0.000715728,0.00018941288,0.00056961813,0.00050767354,0.013975108,0.098918006,0.2043267,0.057951473,0.6166909],"study_design_scores_gemma":[0.00058826857,0.000982038,0.0016594356,0.00025757885,0.0003560449,0.0022750483,0.00017581423,0.37475294,0.31436878,0.14907397,0.1551197,0.00039041953],"about_ca_topic_score_codex":0.0003231147,"about_ca_topic_score_gemma":0.00041045962,"teacher_disagreement_score":0.020089729,"about_ca_system_score_codex":0.0014778234,"about_ca_system_score_gemma":0.001817784,"threshold_uncertainty_score":0.0672068},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025312755783918294,"score_gpt":0.23655240851545864,"score_spread":0.21123965273154036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167928972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041878717,0.0008426269,0.9763851,0.002475663,0.00060653134,0.00014547356,0.00023567381,0.0020102195,0.013110777],"genre_scores_gemma":[0.26484516,0.0023285812,0.69434124,0.0015406988,0.0007522654,0.00046923032,0.001213623,0.0024808533,0.032028392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943,0.0016364632,0.0005622524,0.0007520067,0.0022624042,0.0004868196],"domain_scores_gemma":[0.9938905,0.00241552,0.0001643528,0.0029495202,0.00044362983,0.00013646769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039406293,0.0011798284,0.0015048862,0.0006357251,0.0015358025,0.006820918,0.0021750925,0.002483127,0.011509652],"category_scores_gemma":[0.013561136,0.0012678952,0.0020586485,0.0011471644,0.00434872,0.020813707,0.0055906195,0.008142635,0.0059686685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018674048,0.00010278139,0.00017731228,0.0003473495,0.0000642471,0.00012625231,0.00049498625,0.007334504,0.002952109,0.81741166,0.018624322,0.15217775],"study_design_scores_gemma":[0.000024873127,0.000016432263,0.00005470603,0.000057541216,0.000022440394,0.00012649396,0.000036227273,0.015880074,0.00501396,0.9588994,0.019834364,0.000033350134],"about_ca_topic_score_codex":0.00087962043,"about_ca_topic_score_gemma":0.0008363553,"teacher_disagreement_score":0.011509652,"about_ca_system_score_codex":0.0015311007,"about_ca_system_score_gemma":0.0020395836,"threshold_uncertainty_score":0.038503647},"labels":[],"label_agreement":null},{"id":"W169624009","doi":"10.1007/978-3-642-31284-7_21","title":"A General Construction for 1-Round δ-RMT and (0, δ)-SMT","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Communication source; Computer science; Message authentication code; Reliability (semiconductor); Computer network; Disjoint sets; Node (physics); Transmission (telecommunications); Adversary; Authentication (law); Protocol (science); Theoretical computer science; Mathematical proof; Power (physics); Cryptography; Algorithm; Computer security; Mathematics; Discrete mathematics; Engineering; Telecommunications","score_opus":0.017436051969349727,"score_gpt":0.24401483039975455,"score_spread":0.22657877843040483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169624009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025044382,0.0006351291,0.8883056,0.0013998689,0.000684461,0.0005478694,0.0011013999,0.005088117,0.07719322],"genre_scores_gemma":[0.42808527,0.0006546776,0.482008,0.0010799811,0.00044158826,0.0010684995,0.001593517,0.0016674501,0.08340104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982692,0.00031952743,0.00012761334,0.00039448863,0.00047646192,0.00041271796],"domain_scores_gemma":[0.99855286,0.00031195444,0.00008101718,0.00081307394,0.0001400703,0.000100916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012803839,0.000979194,0.0010981074,0.0007416005,0.0021608039,0.0025633092,0.0021370132,0.0019919986,0.022825103],"category_scores_gemma":[0.0027159331,0.000957216,0.0017526787,0.0014418076,0.0019159293,0.0052481014,0.0053502168,0.0030529539,0.007579676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025086483,0.00006692106,0.00025943358,0.00025995343,0.000033528613,0.00021390776,0.00025415208,0.0058377045,0.014225315,0.9064261,0.014439214,0.05773293],"study_design_scores_gemma":[0.00011462677,0.00016806132,0.00046699974,0.00009651051,0.00010171866,0.0006872892,0.000095511285,0.03399096,0.020424424,0.87102234,0.0726953,0.00013614759],"about_ca_topic_score_codex":0.00051673996,"about_ca_topic_score_gemma":0.00088305847,"teacher_disagreement_score":0.022825103,"about_ca_system_score_codex":0.0015460852,"about_ca_system_score_gemma":0.0016550063,"threshold_uncertainty_score":0.07635754},"labels":[],"label_agreement":null},{"id":"W1714637014","doi":"10.1007/978-3-642-17511-4_4","title":"On the Equality of Probabilistic Terms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Soundness; Mathematical proof; Probabilistic logic; Computer science; Formalism (music); Theoretical computer science; Cryptography; Heuristics; Concatenation (mathematics); Algebra over a field; Algorithm; Mathematics; Programming language; Pure mathematics; Arithmetic; Artificial intelligence","score_opus":0.021634481731602314,"score_gpt":0.25146973096143116,"score_spread":0.22983524922982884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1714637014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016749583,0.007906266,0.7183825,0.006923152,0.0013464782,0.000054496755,0.000515406,0.00026396738,0.24785823],"genre_scores_gemma":[0.66385365,0.010868456,0.20654106,0.0037485128,0.00526963,0.00033911702,0.0014262235,0.0008811942,0.10707211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99393684,0.0020213316,0.0004574503,0.0011080834,0.0019659903,0.0005102662],"domain_scores_gemma":[0.9909638,0.0065387795,0.0002887968,0.0012088238,0.0007879706,0.00021173141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052135256,0.00094375585,0.001524038,0.002282283,0.0027376318,0.005107956,0.0024684079,0.0023873264,0.012026564],"category_scores_gemma":[0.015691161,0.0014244323,0.00220586,0.0030875306,0.010525201,0.021923825,0.006547526,0.009397002,0.0027990392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006480116,0.0000024443796,0.000028565693,0.000016337248,0.0000029203075,0.000013986496,0.00008846012,0.0001971843,0.000078876394,0.99487054,0.0007217901,0.0039724307],"study_design_scores_gemma":[0.0000024429214,0.0000032056794,0.000036785645,0.0000114772965,0.0000036969102,0.00003521813,0.000012117032,0.0006910325,0.000099342644,0.9941375,0.0049623107,0.000004933637],"about_ca_topic_score_codex":0.0014719274,"about_ca_topic_score_gemma":0.00089222536,"teacher_disagreement_score":0.012026564,"about_ca_system_score_codex":0.00252513,"about_ca_system_score_gemma":0.0011933623,"threshold_uncertainty_score":0.040232897},"labels":[],"label_agreement":null},{"id":"W1755042603","doi":"10.1007/3-540-46088-8_15","title":"Provably Secure Implicit Certificate Schemes","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Certificate; Public key certificate; Digital signature; Certificate authority; Computer security; Theoretical computer science; Public-key cryptography; Encryption","score_opus":0.03565530077184503,"score_gpt":0.24877883958655686,"score_spread":0.21312353881471183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1755042603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054587524,0.0018979189,0.73195493,0.004256571,0.001079202,0.00034710087,0.0010508884,0.0034562966,0.20136954],"genre_scores_gemma":[0.75891536,0.0019140479,0.09594471,0.0006641745,0.00062801543,0.0004109484,0.0012604798,0.0007529716,0.13950922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965215,0.00064400653,0.00021402372,0.00041508893,0.0017527338,0.00045263514],"domain_scores_gemma":[0.9942303,0.0020694875,0.0003370853,0.002580832,0.00056975667,0.00021265837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023431603,0.0010271139,0.0010196834,0.0008023324,0.0022000994,0.004746263,0.0024497223,0.0016565977,0.01678767],"category_scores_gemma":[0.008149825,0.0008939613,0.0007662701,0.0021237936,0.0029718194,0.014105687,0.0061119036,0.0066218134,0.006014775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025501623,0.00009727082,0.00012651927,0.00020631586,0.0000137645675,0.000054120526,0.00029589114,0.003120385,0.0024455795,0.93800575,0.006616053,0.048763286],"study_design_scores_gemma":[0.00014976725,0.0000794117,0.00013600785,0.000093532566,0.00004434654,0.00022489118,0.00006210383,0.0124636665,0.008826848,0.9192579,0.058622926,0.00003861664],"about_ca_topic_score_codex":0.00029738658,"about_ca_topic_score_gemma":0.00032786833,"teacher_disagreement_score":0.01678767,"about_ca_system_score_codex":0.0019915332,"about_ca_system_score_gemma":0.0020087548,"threshold_uncertainty_score":0.05616039},"labels":[],"label_agreement":null},{"id":"W177008603","doi":"10.1007/978-3-642-32284-6_2","title":"Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Waterloo","funders":"","keywords":"Correctness; Robustness (evolution); Computer science; Computation; Theoretical computer science; Secure multi-party computation; Voting; Algorithm","score_opus":0.026432498549224772,"score_gpt":0.269511752620335,"score_spread":0.24307925407111022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177008603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081305295,0.0018925826,0.85660475,0.008115244,0.0005843319,0.00011488704,0.00014197051,0.0004922523,0.05074865],"genre_scores_gemma":[0.92139435,0.0006358505,0.067472465,0.000519698,0.0006194056,0.00013047658,0.00006578492,0.00022176615,0.008940344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98907954,0.004627707,0.00064365135,0.0015660981,0.0031500652,0.00093304197],"domain_scores_gemma":[0.96176755,0.02573107,0.0016055128,0.009330445,0.0009492539,0.00061625737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00864768,0.0010213441,0.0017635428,0.00079961173,0.0019646306,0.0062914668,0.0024173385,0.0038600892,0.0027119543],"category_scores_gemma":[0.03609864,0.00091428304,0.0021498809,0.0011369241,0.009231194,0.01457953,0.0056152977,0.0087380335,0.000748987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001665473,0.00003246163,0.00018389223,0.00006891002,0.00004132648,0.00009331201,0.00019957733,0.009682615,0.0019853204,0.9750363,0.0010951246,0.011414612],"study_design_scores_gemma":[0.000014155539,0.000020966789,0.000046819314,0.000010671463,0.000010010745,0.000038383965,0.000012580355,0.028566733,0.0011096282,0.96942073,0.00073660567,0.000012761247],"about_ca_topic_score_codex":0.00019564615,"about_ca_topic_score_gemma":0.00013280884,"teacher_disagreement_score":0.00864768,"about_ca_system_score_codex":0.0016198439,"about_ca_system_score_gemma":0.00095098093,"threshold_uncertainty_score":0.04573387},"labels":[],"label_agreement":null},{"id":"W177692115","doi":"10.1007/978-3-642-36818-9_47","title":"Confidentiality-Preserving Query Execution of Fragmented Outsourced Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Confidentiality; Cloud computing; Encryption; Service provider; Cryptography; Overhead (engineering); Private information retrieval; Computer security; Database; Service (business)","score_opus":0.02900764904512085,"score_gpt":0.26388565670701075,"score_spread":0.2348780076618899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177692115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27528653,0.0012719681,0.7106977,0.0007149753,0.000108128,0.0002631808,0.00067237014,0.0036702566,0.0073149847],"genre_scores_gemma":[0.8989996,0.00046395638,0.09522369,0.00011876437,0.00006259219,0.00008911412,0.000778352,0.00038014606,0.003883807],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956235,0.00073394284,0.00025884443,0.00036955858,0.0022023283,0.0008118152],"domain_scores_gemma":[0.99269474,0.0019183145,0.00040776972,0.004093417,0.00071411394,0.00017155496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009516,0.0006406228,0.0011586904,0.0006684723,0.0009004656,0.0020907242,0.0024822578,0.00077044626,0.002075736],"category_scores_gemma":[0.0063057262,0.00055299763,0.0006746928,0.0019125865,0.0015519623,0.0034307188,0.002866593,0.0014382087,0.000734259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061506624,0.0005471131,0.007960294,0.00080560806,0.00038552075,0.002412128,0.0034617775,0.23872718,0.15088141,0.16731296,0.019809993,0.40154532],"study_design_scores_gemma":[0.00023481133,0.00043591906,0.0016032354,0.000062874584,0.00012359934,0.0011545508,0.0006375934,0.78698474,0.10498185,0.09470899,0.009015714,0.000056042896],"about_ca_topic_score_codex":0.0019376941,"about_ca_topic_score_gemma":0.0015990166,"teacher_disagreement_score":0.003009516,"about_ca_system_score_codex":0.000987407,"about_ca_system_score_gemma":0.0017264845,"threshold_uncertainty_score":0.01591599},"labels":[],"label_agreement":null},{"id":"W1794864632","doi":"10.1007/978-3-540-76900-2_25","title":"Information-Theoretic Security Without an Honest Majority","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Computer security; Abort; Protocol (science); Veto; Transmission (telecommunications); Private information retrieval; Pairwise comparison; Channel (broadcasting); Oblivious transfer; Computer network; Cryptography; Telecommunications; Political science; Law; Artificial intelligence","score_opus":0.011934644676817511,"score_gpt":0.24989171179120237,"score_spread":0.23795706711438486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794864632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045770675,0.0032771367,0.50425446,0.02123534,0.0021930323,0.00025571714,0.00081139425,0.0006923953,0.42150986],"genre_scores_gemma":[0.80794144,0.0020789898,0.06923192,0.0023374734,0.0015017985,0.0003996913,0.00035819112,0.00025105293,0.11589946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528164,0.0012814797,0.00025055662,0.00069388736,0.0019312232,0.0005611386],"domain_scores_gemma":[0.9954715,0.0020778817,0.00020102954,0.0017785358,0.0003448319,0.0001262004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028911242,0.0010008271,0.0010682442,0.0009074364,0.001917519,0.0036004146,0.0017076406,0.0028649918,0.006661648],"category_scores_gemma":[0.008123064,0.0007802229,0.0009829388,0.0010959927,0.0055386857,0.01128924,0.004522859,0.005639427,0.003552136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047083966,0.00001501717,0.000029011795,0.000045689518,0.0000117261525,0.000025236071,0.00009195773,0.0012442314,0.0006445966,0.9851016,0.0036576705,0.009086182],"study_design_scores_gemma":[0.000010828836,0.000009503447,0.000017283697,0.000010926983,0.0000064820983,0.00003662897,0.000008439758,0.002436049,0.00065801304,0.9925863,0.004213441,0.0000060671896],"about_ca_topic_score_codex":0.00015222741,"about_ca_topic_score_gemma":0.00013328408,"teacher_disagreement_score":0.006661648,"about_ca_system_score_codex":0.001417414,"about_ca_system_score_gemma":0.0013659858,"threshold_uncertainty_score":0.022285461},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Private information retrieval; Server; Scheme (mathematics); Confidentiality; Bandwidth (computing); Computation; Computer network; Theoretical computer science; Algorithm; Computer security; Mathematics","score_opus":0.018630492017380238,"score_gpt":0.2627758982982837,"score_spread":0.24414540628090345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801457577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03063702,0.013060599,0.7361481,0.052673895,0.0017014343,0.00017088046,0.00049193046,0.0007043824,0.16441171],"genre_scores_gemma":[0.72057176,0.012524178,0.21507697,0.00596736,0.008290676,0.00030531196,0.00068620086,0.0010607137,0.03551679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9839544,0.0072749113,0.0007015961,0.0018876595,0.005294486,0.00088691997],"domain_scores_gemma":[0.9049811,0.074087955,0.0012021227,0.015787588,0.0034455338,0.0004957437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011948048,0.0011986272,0.0021433707,0.0025983355,0.0025802942,0.010742852,0.0050259717,0.0043571168,0.020088444],"category_scores_gemma":[0.08152576,0.0015206495,0.0019467098,0.004207291,0.019000031,0.049561396,0.009051649,0.010102115,0.005063331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052947515,0.000022786171,0.00010963512,0.00012571563,0.0000093666085,0.000036975132,0.00013770958,0.0023209136,0.00023257748,0.97434175,0.003667707,0.01894189],"study_design_scores_gemma":[0.00001278326,0.000009799593,0.000042471835,0.000030690288,0.0000051820293,0.00006513816,0.00003214861,0.007597731,0.00026993486,0.9869473,0.0049771233,0.000009641603],"about_ca_topic_score_codex":0.0020215365,"about_ca_topic_score_gemma":0.0012769792,"teacher_disagreement_score":0.020088444,"about_ca_system_score_codex":0.0039879386,"about_ca_system_score_gemma":0.0028334619,"threshold_uncertainty_score":0.06720251},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01318622371227801,"score_gpt":0.24636081348565808,"score_spread":0.23317458977338007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1804630428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037829361,0.0014012164,0.97729355,0.0004841073,0.00032784106,0.00014263103,0.00009600475,0.0008736677,0.015598095],"genre_scores_gemma":[0.35113713,0.0024965296,0.5867282,0.00046122304,0.00079902465,0.00066146936,0.0007099569,0.00053157174,0.056474946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849236,0.00048161251,0.00008480511,0.00024767517,0.00056680373,0.00012675827],"domain_scores_gemma":[0.9985215,0.0005408625,0.000060950548,0.0006445079,0.00018176007,0.000050434213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015153165,0.0007484062,0.0009256217,0.00063830387,0.0010315935,0.0020535726,0.0017810176,0.0012064552,0.0075656143],"category_scores_gemma":[0.003456418,0.0004731739,0.0004895376,0.0012071651,0.0017764753,0.0041543455,0.0021193558,0.003164962,0.0041479156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114947834,0.00006123095,0.00009305138,0.00012557415,0.000014090467,0.00006894473,0.00015136824,0.005374488,0.004296604,0.8590645,0.008755765,0.12187939],"study_design_scores_gemma":[0.0000716095,0.000046801833,0.00005936925,0.00003814634,0.0000146083585,0.00022452009,0.000023324863,0.041394345,0.00838512,0.9073095,0.042411666,0.00002085673],"about_ca_topic_score_codex":0.000111468195,"about_ca_topic_score_gemma":0.0001551641,"teacher_disagreement_score":0.0075656143,"about_ca_system_score_codex":0.0010554197,"about_ca_system_score_gemma":0.0008574839,"threshold_uncertainty_score":0.025309503},"labels":[],"label_agreement":null},{"id":"W1820018505","doi":"10.1007/978-3-662-47989-6_4","title":"Provably Weak Instances of Ring-LWE","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Learning with errors; Cryptosystem; Ring (chemistry); Cyclotomic field; Polynomial ring; Discrete mathematics; Mathematics; Ring of integers; Lattice problem; Algebraic number field; Class (philosophy); Computer science; Lattice (music); Cryptography; Combinatorics; Polynomial; Algorithm; Physics; Artificial intelligence","score_opus":0.024629387579976094,"score_gpt":0.2539962491447131,"score_spread":0.22936686156473698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1820018505","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15161821,0.0041677277,0.39045072,0.020417992,0.0018482499,0.00036478377,0.0040371628,0.003081452,0.42401364],"genre_scores_gemma":[0.8636266,0.0020388633,0.069208734,0.0028338968,0.0013397683,0.0004708511,0.0026148367,0.0007732035,0.05709338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967709,0.00072101515,0.0002346974,0.0007400561,0.0009447204,0.00058848324],"domain_scores_gemma":[0.9935033,0.004168057,0.00028925645,0.0011227645,0.0005560691,0.00036064838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024597663,0.0013364734,0.0015211913,0.001206311,0.0028991455,0.006727111,0.0025192604,0.0023499539,0.01981306],"category_scores_gemma":[0.009185931,0.0011329617,0.0018748617,0.0018741649,0.004693953,0.016377326,0.006644763,0.007860317,0.003642422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015428095,0.00005301648,0.00023312485,0.00018419109,0.000030738676,0.00008734915,0.00017925019,0.0014431068,0.000860595,0.98053026,0.00673976,0.009504286],"study_design_scores_gemma":[0.000035649726,0.000012209216,0.0000739141,0.000028143946,0.000018341021,0.00010344258,0.000055023196,0.0024045561,0.0006862673,0.99028647,0.0062831216,0.00001302004],"about_ca_topic_score_codex":0.00048093792,"about_ca_topic_score_gemma":0.00074613595,"teacher_disagreement_score":0.01981306,"about_ca_system_score_codex":0.0024136778,"about_ca_system_score_gemma":0.0013413783,"threshold_uncertainty_score":0.06628132},"labels":[],"label_agreement":null},{"id":"W1833038439","doi":"10.1007/11535218_28","title":"New Monotones and Lower Bounds in Unconditional Two-Party Computation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Oblivious transfer; Computation; Protocol (science); String (physics); Theoretical computer science; Reduction (mathematics); Context (archaeology); Upper and lower bounds; Secure multi-party computation; Transfer (computing); Scheme (mathematics); Algorithm; Mathematics; Parallel computing","score_opus":0.012011701040091664,"score_gpt":0.25291351746423923,"score_spread":0.24090181642414757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833038439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036762055,0.00767865,0.78329444,0.009833223,0.0012312412,0.00021699448,0.00055821583,0.0010106517,0.15941449],"genre_scores_gemma":[0.68394655,0.0070370934,0.23587662,0.0033710322,0.004327719,0.001023972,0.000663501,0.0012677015,0.06248579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99108195,0.002930194,0.00041919484,0.0013201486,0.0030231592,0.0012254268],"domain_scores_gemma":[0.9646041,0.027360577,0.0008970208,0.0040347963,0.001849102,0.0012543554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009318979,0.0028284236,0.0036050244,0.004318055,0.0043052956,0.008724344,0.0071245413,0.0049926434,0.014974119],"category_scores_gemma":[0.0349224,0.0022701966,0.003638669,0.006586495,0.01065232,0.029497169,0.012784294,0.02200998,0.0029927536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057829144,0.000038485756,0.00007233863,0.000071179915,0.0000092218115,0.0000224212,0.00009071835,0.001614947,0.00026409095,0.9873076,0.0021865054,0.0082645975],"study_design_scores_gemma":[0.000011748172,0.000014891785,0.0000508774,0.000024690093,0.000015255389,0.000039547704,0.000015058935,0.01559623,0.0002419266,0.98207664,0.0018971406,0.0000160415],"about_ca_topic_score_codex":0.0008942338,"about_ca_topic_score_gemma":0.0010221052,"teacher_disagreement_score":0.014974119,"about_ca_system_score_codex":0.0057631037,"about_ca_system_score_gemma":0.002348385,"threshold_uncertainty_score":0.050093412},"labels":[],"label_agreement":null},{"id":"W184223002","doi":"","title":"On the n x n Knight Cover Problem.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knight; Mathematics; Cover (algebra); Combinatorics; Physics; Astronomy; Engineering","score_opus":0.009955061762726578,"score_gpt":0.21334173450552674,"score_spread":0.20338667274280015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184223002","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2848602,0.0074620056,0.26751375,0.024730759,0.0016725174,0.0003054757,0.0024610918,0.00085346337,0.41014078],"genre_scores_gemma":[0.8569767,0.005615791,0.053061977,0.0018910108,0.0015578538,0.00025321514,0.0021611215,0.00028506664,0.0781973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987577,0.00034719886,0.000045830657,0.00019272717,0.00025833977,0.00039814782],"domain_scores_gemma":[0.99679106,0.0022429153,0.00025553812,0.00035782444,0.00012890775,0.00022363507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012103394,0.00090221147,0.0012422677,0.0011888638,0.0028959601,0.0034158959,0.0013886807,0.002472949,0.019507995],"category_scores_gemma":[0.006036391,0.0005846363,0.0007070623,0.0022539727,0.0033960235,0.009706652,0.0035507153,0.0030740425,0.0028725401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045390578,0.00012946804,0.0008830204,0.0002736748,0.00007176053,0.000440496,0.00029933263,0.02149316,0.0012429868,0.8799148,0.05260488,0.042192657],"study_design_scores_gemma":[0.00006225325,0.000028114973,0.000415907,0.00004847373,0.000022891561,0.00023521237,0.0001583584,0.019876352,0.00063159806,0.9654065,0.0130941,0.000020258065],"about_ca_topic_score_codex":0.0030926177,"about_ca_topic_score_gemma":0.003892731,"teacher_disagreement_score":0.019507995,"about_ca_system_score_codex":0.0022065674,"about_ca_system_score_gemma":0.0013303796,"threshold_uncertainty_score":0.06526077},"labels":[],"label_agreement":null},{"id":"W1842316007","doi":"10.1007/978-3-642-28368-0_28","title":"Dynamic Secure Cloud Storage with Provenance","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Cloud computing; Anonymity; Ciphertext; Computer security; Broadcast encryption; Cloud storage; Cryptography; Server; Scalability; Public-key cryptography; Computer network; Database; Operating system","score_opus":0.007655643334861957,"score_gpt":0.21668619705554076,"score_spread":0.2090305537206788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842316007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036039457,0.003959971,0.9083357,0.0023869763,0.0013267318,0.00028564947,0.0010326327,0.004255655,0.042377178],"genre_scores_gemma":[0.7705255,0.003558123,0.18588546,0.00031376586,0.0006199401,0.00018753763,0.0011676698,0.0007664509,0.036975555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869066,0.00015889898,0.00011154422,0.00015196396,0.0007040493,0.00018288603],"domain_scores_gemma":[0.996552,0.000566045,0.00014692363,0.002254312,0.00040614605,0.000074553485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014109651,0.0004553606,0.0006176923,0.00075523934,0.0011564018,0.0029136492,0.0013422583,0.00074222806,0.0051358775],"category_scores_gemma":[0.004710802,0.00047593185,0.0005229057,0.001730704,0.0013767626,0.008016119,0.0029603562,0.0017568894,0.0013408305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059155846,0.00009270989,0.0009177308,0.00038387408,0.000047275324,0.00043914653,0.00040054857,0.03275944,0.017815173,0.659801,0.021259865,0.2654917],"study_design_scores_gemma":[0.00010479079,0.00010282473,0.0003679634,0.00017193923,0.00007051569,0.00085540477,0.00018056734,0.1709824,0.044293776,0.6683957,0.114394955,0.00007913555],"about_ca_topic_score_codex":0.0010738581,"about_ca_topic_score_gemma":0.0012354961,"teacher_disagreement_score":0.0051358775,"about_ca_system_score_codex":0.0012017683,"about_ca_system_score_gemma":0.0016650622,"threshold_uncertainty_score":0.017181158},"labels":[],"label_agreement":null},{"id":"W1842898613","doi":"","title":"Secure group communication","year":2005,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; IP multicast; Computer science; Pragmatic General Multicast; Computer network; Source-specific multicast; Xcast; Secure multicast; Protocol Independent Multicast; Inter-domain; Internet Group Management Protocol; Reliable multicast; Distributed computing","score_opus":0.020727574175582773,"score_gpt":0.2764088116190725,"score_spread":0.2556812374434897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842898613","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012715853,0.0015926446,0.83506817,0.002169246,0.0014833701,0.00087696884,0.00063464587,0.0027512761,0.14270787],"genre_scores_gemma":[0.5806057,0.0037291953,0.29331604,0.0016691224,0.0011930903,0.0018212368,0.0026544102,0.0006491705,0.11436212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952813,0.001190265,0.0003167609,0.00065272226,0.0019514171,0.0006075702],"domain_scores_gemma":[0.9935197,0.0015020802,0.00040868967,0.0034682301,0.0009369875,0.00016426829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025217372,0.0011716684,0.0011843425,0.00180504,0.0025827142,0.0034585341,0.00137626,0.0026747063,0.030723358],"category_scores_gemma":[0.00818292,0.00045675982,0.0008270765,0.0016595356,0.0019761578,0.004457133,0.0059408583,0.0018806154,0.01766772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065500324,0.00013771815,0.0006712202,0.00033443494,0.000097373144,0.00043368572,0.00059156417,0.012044092,0.007089745,0.6949158,0.047342252,0.23568726],"study_design_scores_gemma":[0.0002756805,0.00031024337,0.00036417152,0.00024231593,0.00007790247,0.0012720668,0.00031813505,0.08639855,0.014922141,0.64889157,0.24684626,0.00008093332],"about_ca_topic_score_codex":0.00041056002,"about_ca_topic_score_gemma":0.0004172885,"teacher_disagreement_score":0.030723358,"about_ca_system_score_codex":0.0011742723,"about_ca_system_score_gemma":0.0015835017,"threshold_uncertainty_score":0.102779865},"labels":[],"label_agreement":null},{"id":"W1887434847","doi":"10.1007/978-3-642-22792-9_38","title":"Constant-Rate Oblivious Transfer from Noisy Channels","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Oblivious transfer; Computer science; Generality; Constant (computer programming); Security parameter; Transfer (computing); Corollary; Channel (broadcasting); Binary symmetric channel; Theoretical computer science; Alice and Bob; Discrete mathematics; Cryptography; Algorithm; Mathematics; Channel capacity; Computer network; Alice (programming language); Parallel computing","score_opus":0.021383647531742943,"score_gpt":0.22123537187448616,"score_spread":0.19985172434274323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887434847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025254546,0.0017159397,0.9134943,0.0014699148,0.00032928956,0.00019245612,0.00038572194,0.0017686192,0.055389237],"genre_scores_gemma":[0.7912819,0.0034196153,0.114819564,0.0007189105,0.0006272904,0.0006343742,0.0007127433,0.0009146954,0.08687095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986745,0.0003061509,0.00006656768,0.00021503872,0.0005016232,0.00023612044],"domain_scores_gemma":[0.99761677,0.0012009271,0.00014762009,0.00085508946,0.00012906361,0.00005056615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009510208,0.001294979,0.0011517293,0.0007946013,0.0010576628,0.0021332726,0.0017687441,0.0019202672,0.008594095],"category_scores_gemma":[0.004392937,0.0008034146,0.00075237674,0.0014950116,0.0026558142,0.0060116537,0.0037430422,0.0037204092,0.0035310576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036093782,0.000087595465,0.0001344442,0.00049592805,0.00006323258,0.000131293,0.00037250802,0.05024138,0.010420598,0.8536363,0.01066648,0.07338934],"study_design_scores_gemma":[0.00008233494,0.000083616455,0.00013723648,0.00012402268,0.00004847053,0.0003106651,0.00004142861,0.11609602,0.018940497,0.84950656,0.01456686,0.00006224369],"about_ca_topic_score_codex":0.00025790805,"about_ca_topic_score_gemma":0.00019752995,"teacher_disagreement_score":0.008594095,"about_ca_system_score_codex":0.0012292981,"about_ca_system_score_gemma":0.0009353997,"threshold_uncertainty_score":0.028750122},"labels":[],"label_agreement":null},{"id":"W1902194318","doi":"10.1109/tetc.2015.2445101","title":"EnDAS: Efficient Encrypted Data Search as a Mobile Cloud Service","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Computer network; Binary search algorithm; Search algorithm; Operating system","score_opus":0.06748292502868941,"score_gpt":0.33240495347269283,"score_spread":0.2649220284440034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902194318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24102981,0.0014193592,0.7435529,0.00041635157,0.00014438621,0.00039841043,0.00061570713,0.004015193,0.008407939],"genre_scores_gemma":[0.8613412,0.00041668717,0.13203429,0.000110387315,0.000036482117,0.00006893042,0.00055762124,0.000075146985,0.0053592576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953246,0.000066488275,0.000041977764,0.00004517179,0.00020902927,0.00010490543],"domain_scores_gemma":[0.9995091,0.00009803758,0.000067373425,0.00015580255,0.00011921169,0.00005049599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029727575,0.0003086304,0.0005223926,0.0005812761,0.0004432871,0.0007681421,0.00094151916,0.00040361754,0.0020971089],"category_scores_gemma":[0.0008881984,0.00010841656,0.00034520467,0.00082651706,0.00030502217,0.0019588275,0.0009946228,0.0004089183,0.00063016353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047398964,0.000878744,0.00683383,0.00049246365,0.00020002638,0.0017198081,0.00034635965,0.07068864,0.20134315,0.06590671,0.019519359,0.627331],"study_design_scores_gemma":[0.00029220124,0.00055180164,0.0018383987,0.000028308488,0.0000728844,0.0017697185,0.00017788516,0.81924903,0.14151333,0.010579578,0.02385954,0.0000672609],"about_ca_topic_score_codex":0.0012963519,"about_ca_topic_score_gemma":0.0015107113,"teacher_disagreement_score":0.0020971089,"about_ca_system_score_codex":0.0004834307,"about_ca_system_score_gemma":0.00079914404,"threshold_uncertainty_score":0.0070155263},"labels":[],"label_agreement":null},{"id":"W1927997230","doi":"10.1002/sec.533","title":"DEFF: a new architecture for private online social networks","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Exploit; Architecture; Popularity; Private information retrieval; Limiting; Encryption; Information leakage; Proxy (statistics); Computation; Computer security; Information flow; Computer network","score_opus":0.017743482781911984,"score_gpt":0.26181447564114074,"score_spread":0.24407099285922876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927997230","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030048044,0.00018459956,0.96030676,0.00044158517,0.0000747819,0.00032354175,0.0000918012,0.0055971574,0.0029317543],"genre_scores_gemma":[0.6497437,0.00022141171,0.33786696,0.00027455416,0.00011091716,0.00051573425,0.00033069248,0.00032488824,0.010611174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979432,0.00056156656,0.00017948504,0.0004444556,0.00059734134,0.00027394784],"domain_scores_gemma":[0.99669904,0.0006686301,0.00029195458,0.0016921249,0.00041192694,0.00023630827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034699484,0.00048115943,0.00061659183,0.001311147,0.0014560678,0.0026573779,0.0027511194,0.0018116427,0.004372968],"category_scores_gemma":[0.0055764127,0.00051256316,0.0006598391,0.000606293,0.0019164272,0.0072445995,0.0041381163,0.0017375925,0.0010176367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092198845,0.0006190644,0.0056743487,0.0002959516,0.00014528977,0.0006559264,0.0015022355,0.11756668,0.03994852,0.40625507,0.015821084,0.41059384],"study_design_scores_gemma":[0.000096307165,0.0002498773,0.00090235076,0.00003409292,0.000041820782,0.000426321,0.00012941279,0.84227717,0.018964676,0.09388717,0.042882964,0.000107856125],"about_ca_topic_score_codex":0.002358902,"about_ca_topic_score_gemma":0.0015771294,"teacher_disagreement_score":0.004372968,"about_ca_system_score_codex":0.0016692278,"about_ca_system_score_gemma":0.001017886,"threshold_uncertainty_score":0.018351018},"labels":[],"label_agreement":null},{"id":"W1942829792","doi":"10.1109/fcst.2015.20","title":"Identity-Based Broadcast Encryption Schemes for Open Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Broadcast encryption; Encryption; Computer science; Computer network; Scheme (mathematics); Communication source; Probabilistic encryption; Multiple encryption; Attribute-based encryption; On-the-fly encryption; Identity (music); Public-key cryptography; 40-bit encryption; Computer security; Mathematics","score_opus":0.07422615849192722,"score_gpt":0.3328013000703388,"score_spread":0.2585751415784116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942829792","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015192621,0.005344983,0.942146,0.0013153962,0.00048995885,0.000297678,0.00020796181,0.00041328178,0.034592167],"genre_scores_gemma":[0.5426593,0.008980289,0.40288886,0.00065280055,0.0007527832,0.00087634975,0.0006815035,0.00012164666,0.042386442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984332,0.00035295234,0.00010403072,0.00012785273,0.0008057449,0.00017623162],"domain_scores_gemma":[0.99869376,0.00036617473,0.0001707945,0.00047258136,0.00022550099,0.000071137605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013025067,0.0003765822,0.0005338053,0.0005804797,0.0011293413,0.0015486549,0.0009401526,0.00081339956,0.0033418317],"category_scores_gemma":[0.0024539137,0.00021430542,0.00042726184,0.0011072345,0.0010354794,0.0037211855,0.0023182298,0.0021083872,0.0011919622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105925945,0.00005711449,0.00013642848,0.00016089853,0.000012531034,0.00014383593,0.00022427538,0.004954516,0.0065156543,0.9119719,0.0061881356,0.0695288],"study_design_scores_gemma":[0.00012926305,0.00015352652,0.00047543494,0.000194467,0.00004869238,0.0006344243,0.00016039405,0.08584053,0.0126728015,0.68460065,0.2150143,0.00007555553],"about_ca_topic_score_codex":0.0005859698,"about_ca_topic_score_gemma":0.0005890266,"teacher_disagreement_score":0.0033418317,"about_ca_system_score_codex":0.0012845724,"about_ca_system_score_gemma":0.0010934033,"threshold_uncertainty_score":0.011179507},"labels":[],"label_agreement":null},{"id":"W1948381900","doi":"10.1007/11593447_8","title":"Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Secure multi-party computation; Secret sharing; Secure two-party computation; Computation; Computer security; Theoretical computer science; Cryptography; Algorithm","score_opus":0.03368925177574418,"score_gpt":0.28926373089285506,"score_spread":0.2555744791171109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948381900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06552145,0.0010439116,0.86144567,0.0012074308,0.00029529576,0.00031695902,0.00027383285,0.00093874155,0.0689567],"genre_scores_gemma":[0.86373425,0.000744323,0.09563771,0.0002454259,0.00015174133,0.00023866163,0.00020945178,0.0001970156,0.038841367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824333,0.0004616351,0.000073060335,0.00022151448,0.0006551432,0.0003453936],"domain_scores_gemma":[0.9987024,0.0005577785,0.00006612965,0.00053146476,0.00008954938,0.00005272391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013200501,0.0007292284,0.0011754155,0.0006177394,0.001083256,0.002953458,0.0016494658,0.0013038439,0.0056706397],"category_scores_gemma":[0.0024814727,0.00040600952,0.00086220226,0.0015884036,0.002703546,0.004242997,0.0027565984,0.0024510918,0.0012433555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002267545,0.00005948423,0.0000910624,0.000088513916,0.000019694038,0.000108537984,0.0001317085,0.013696981,0.0049928785,0.9468623,0.0022819638,0.031439997],"study_design_scores_gemma":[0.000054464897,0.00008181095,0.00013188836,0.000023777686,0.000025214173,0.00019633757,0.000024379147,0.10456551,0.011864753,0.87729096,0.0057075378,0.000033412078],"about_ca_topic_score_codex":0.0003718038,"about_ca_topic_score_gemma":0.00052967004,"teacher_disagreement_score":0.0056706397,"about_ca_system_score_codex":0.0014274463,"about_ca_system_score_gemma":0.0011577118,"threshold_uncertainty_score":0.018970191},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03239600057577496,"score_gpt":0.27094634757980407,"score_spread":0.2385503470040291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1951707894","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023962121,0.0012725919,0.9483542,0.0002824043,0.00023568327,0.0001466457,0.00018923798,0.0030987945,0.022458386],"genre_scores_gemma":[0.7970759,0.001508539,0.14350033,0.00025635402,0.0003229835,0.00034039372,0.00043462598,0.0005526838,0.056008197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842465,0.00017493007,0.00012749819,0.00033303452,0.0005984397,0.00034152757],"domain_scores_gemma":[0.99736756,0.0005847172,0.00020387198,0.001521629,0.00023147084,0.0000907722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011773697,0.0008898349,0.00094749674,0.00093106047,0.0008224789,0.0024355112,0.0015851107,0.0006824964,0.007804224],"category_scores_gemma":[0.0031221076,0.0005607765,0.00055134605,0.0010328911,0.0014991801,0.0066616824,0.0032404803,0.0023890964,0.0026120413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080041826,0.00010170198,0.0003717159,0.00036698728,0.00006777275,0.00023315923,0.00046188978,0.013339683,0.05768444,0.66572744,0.010055567,0.25078917],"study_design_scores_gemma":[0.00018389318,0.00043142407,0.00066844746,0.00016296476,0.000119583085,0.0012462876,0.00013909742,0.18863884,0.13271649,0.5794569,0.09607352,0.00016245038],"about_ca_topic_score_codex":0.00023854033,"about_ca_topic_score_gemma":0.0002200656,"teacher_disagreement_score":0.007804224,"about_ca_system_score_codex":0.00062756473,"about_ca_system_score_gemma":0.00061459054,"threshold_uncertainty_score":0.026107728},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.014855423271248386,"score_gpt":0.1818471552665501,"score_spread":0.1669917319953017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958037614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050200574,0.0003892699,0.9380807,0.0009873549,0.000068696136,0.00013672259,0.00008946968,0.0015245373,0.008522574],"genre_scores_gemma":[0.8289978,0.0003286115,0.16107364,0.00034661716,0.00013200681,0.00038165032,0.000111300484,0.00017337347,0.008455025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969138,0.000977329,0.00016222234,0.00043787545,0.0010431283,0.00046574094],"domain_scores_gemma":[0.99122953,0.0031080313,0.00087122386,0.0038923062,0.00054351543,0.00035537762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022566682,0.000723519,0.0011441436,0.0006397235,0.0015611404,0.0023360772,0.0040422855,0.0023718036,0.0036315706],"category_scores_gemma":[0.007786642,0.0008118323,0.0011033004,0.00084788725,0.004253866,0.008910087,0.00645516,0.0041102767,0.0014346712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062058144,0.00015499511,0.00090518506,0.00022237943,0.00009161812,0.00040669163,0.0009654192,0.04657319,0.021061642,0.9002209,0.0021985006,0.026578873],"study_design_scores_gemma":[0.0002515474,0.0004804336,0.00029486523,0.00006304027,0.00016624939,0.0006802071,0.00015246983,0.49409497,0.044356067,0.4446666,0.014655494,0.00013807764],"about_ca_topic_score_codex":0.0005634962,"about_ca_topic_score_gemma":0.00024301867,"teacher_disagreement_score":0.0040422855,"about_ca_system_score_codex":0.0017089727,"about_ca_system_score_gemma":0.001652697,"threshold_uncertainty_score":0.012399495},"labels":[],"label_agreement":null},{"id":"W1964276265","doi":"10.1504/ijact.2012.045587","title":"Attribute-based encryption without key cloning","year":2012,"lang":"en","type":"article","venue":"International Journal of Applied Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Encryption; Computer science; Attribute-based encryption; Security token; Probabilistic encryption; Computer security; Scheme (mathematics); 40-bit encryption; On-the-fly encryption; Functional encryption; Construct (python library); Theoretical computer science; Ciphertext; Public-key cryptography; Computer network; Mathematics","score_opus":0.013021267932893685,"score_gpt":0.25794942204718074,"score_spread":0.24492815411428706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964276265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017944796,0.0011415603,0.97311574,0.00063282414,0.00019049915,0.00016242282,0.000083267536,0.00022774273,0.0065011126],"genre_scores_gemma":[0.6680643,0.002021808,0.31831443,0.00040045104,0.0002774791,0.0003001761,0.00018930859,0.000073157986,0.010358926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99288505,0.002112549,0.0007608869,0.0007971297,0.0029330708,0.0005111433],"domain_scores_gemma":[0.9893634,0.0028814347,0.0010660623,0.0057241605,0.00073090516,0.00023409528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040999157,0.00051259616,0.0011828803,0.00060593936,0.001177984,0.003206611,0.0026566123,0.0018349148,0.0019282493],"category_scores_gemma":[0.009710347,0.0004405565,0.0014319549,0.0018668016,0.002670155,0.012137658,0.00397518,0.00331748,0.0013449794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019839447,0.000085805696,0.0006227647,0.00029004505,0.0000530311,0.00039188692,0.00052090985,0.013830692,0.00817255,0.93797463,0.0009794493,0.036879912],"study_design_scores_gemma":[0.00015183842,0.0003878299,0.0005042246,0.00017674934,0.00016389287,0.0029260942,0.00022153293,0.23493734,0.05052657,0.63362485,0.076251626,0.0001273918],"about_ca_topic_score_codex":0.00030250553,"about_ca_topic_score_gemma":0.00015025174,"teacher_disagreement_score":0.0040999157,"about_ca_system_score_codex":0.0013236287,"about_ca_system_score_gemma":0.0013843187,"threshold_uncertainty_score":0.02168274},"labels":[],"label_agreement":null},{"id":"W1965580203","doi":"10.1145/2688073.2688074","title":"Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Computer science; Merlin (protein); Communication complexity; Theoretical computer science; Discrete mathematics; Protocol (science); Mathematics; Statistics","score_opus":0.037714644436269915,"score_gpt":0.2918630324526188,"score_spread":0.25414838801634887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965580203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27817982,0.0015904432,0.6411205,0.01761448,0.00027595725,0.00028714395,0.00025760534,0.00091880275,0.059755117],"genre_scores_gemma":[0.9431323,0.000590925,0.04806971,0.0012863573,0.00022565886,0.00034405472,0.00012095212,0.00013794565,0.0060921186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870352,0.005879907,0.0006030555,0.0019715303,0.0031206412,0.0013896326],"domain_scores_gemma":[0.9221483,0.05983917,0.004411782,0.010503439,0.0018253173,0.0012718977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011536047,0.0010546182,0.0015771774,0.0022596172,0.0030705286,0.005298597,0.0030144604,0.0036161165,0.005010503],"category_scores_gemma":[0.04431057,0.0010829283,0.0022158434,0.0018252991,0.012554215,0.019158104,0.010461857,0.009953189,0.0008195654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001008235,0.000033877193,0.00022797263,0.00005790652,0.000018507522,0.000050343508,0.00042124253,0.0038592033,0.0009403096,0.99000424,0.0006669892,0.0036185484],"study_design_scores_gemma":[0.00003985975,0.00005107425,0.00007544931,0.000038510643,0.000021565194,0.0000873942,0.000066303066,0.026087899,0.0027265914,0.9687497,0.0020242683,0.00003134783],"about_ca_topic_score_codex":0.0006469264,"about_ca_topic_score_gemma":0.00041328184,"teacher_disagreement_score":0.011536047,"about_ca_system_score_codex":0.0037173883,"about_ca_system_score_gemma":0.0021625205,"threshold_uncertainty_score":0.06100917},"labels":[],"label_agreement":null},{"id":"W1966770521","doi":"10.1109/ccece.2013.6567854","title":"Privacy protection for RBAC in service oriented architecture","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Role-based access control; Permission; Access control; Service-oriented architecture; Computer security; Computer science; Interoperability; Information privacy; Web service; Internet privacy; World Wide Web","score_opus":0.0148319545494696,"score_gpt":0.22784683290492067,"score_spread":0.21301487835545108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966770521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021061715,0.0013455022,0.95876193,0.0033934764,0.00019817015,0.00018713194,0.00011036543,0.00062959787,0.014312059],"genre_scores_gemma":[0.7565638,0.0016733847,0.2308453,0.0012182961,0.0003849739,0.00052996253,0.00024785957,0.00015716885,0.008379201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97814584,0.009223834,0.0012787138,0.001904675,0.0076124254,0.0018345664],"domain_scores_gemma":[0.97742647,0.007921424,0.0018102853,0.009637353,0.0027158358,0.0004887234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012627862,0.0008759425,0.0011988904,0.001386083,0.0034731124,0.00605149,0.0021299417,0.0034512598,0.0023607363],"category_scores_gemma":[0.024154799,0.00093836774,0.0021995332,0.0019527216,0.005252153,0.009068547,0.0045350227,0.0058301156,0.0013262869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030328552,0.000099990735,0.0008459306,0.00019426514,0.00011651091,0.00036853674,0.0013636582,0.022745105,0.006338864,0.9227477,0.0034020313,0.04147412],"study_design_scores_gemma":[0.00014731075,0.00016102572,0.0003697922,0.00020935242,0.00018271609,0.0007544936,0.00042339202,0.21363345,0.017155249,0.7322965,0.034557357,0.00010940004],"about_ca_topic_score_codex":0.002636324,"about_ca_topic_score_gemma":0.0010361687,"teacher_disagreement_score":0.012627862,"about_ca_system_score_codex":0.0030867925,"about_ca_system_score_gemma":0.0055401884,"threshold_uncertainty_score":0.06678325},"labels":[],"label_agreement":null},{"id":"W1970973296","doi":"10.1145/1373290.1373306","title":"Security and privacy system architecture for an e-hospital environment","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer security; Computer science; Access control; Audit trail; Confidentiality; Authentication (law); Cryptography; Health care; Audit; Internet privacy; Business","score_opus":0.011090889982795095,"score_gpt":0.20636635387270785,"score_spread":0.19527546388991276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970973296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07210609,0.0005547256,0.89774555,0.0023391263,0.00023677808,0.0007938681,0.00019978874,0.011485438,0.014538671],"genre_scores_gemma":[0.62181765,0.00058993226,0.34552142,0.0008224466,0.00016022904,0.0004191554,0.000679669,0.00024994853,0.02973955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986866,0.00032251154,0.00020974141,0.00016571779,0.00040990833,0.00020546526],"domain_scores_gemma":[0.998434,0.0002283564,0.00011627155,0.00038907575,0.0006071658,0.0002250971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021175272,0.0002966433,0.00039179611,0.0005827156,0.0012476636,0.0027333237,0.0014574148,0.0015746385,0.0051799337],"category_scores_gemma":[0.0017436151,0.00035089458,0.0005144736,0.0005467852,0.0006793096,0.0031298436,0.00217017,0.0013503368,0.0028287936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020064262,0.0011880636,0.016231373,0.0009494702,0.0004273421,0.0026009632,0.003293026,0.06231892,0.16623268,0.3090655,0.035992883,0.39969337],"study_design_scores_gemma":[0.00037394065,0.0012122347,0.0066803927,0.00023270799,0.00049944676,0.0029057837,0.00091786054,0.5820287,0.13309856,0.057045825,0.2147239,0.00028076017],"about_ca_topic_score_codex":0.0013204016,"about_ca_topic_score_gemma":0.00088558503,"teacher_disagreement_score":0.0051799337,"about_ca_system_score_codex":0.0009929915,"about_ca_system_score_gemma":0.0016957701,"threshold_uncertainty_score":0.01732862},"labels":[],"label_agreement":null},{"id":"W1971382044","doi":"10.1049/iet-ifs:20060131","title":"Non-interactive two-channel message authentication based on hybrid-collision resistant hash functions","year":2007,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Collision resistance; Message authentication code; Computer network; Hash-based message authentication code; Computer security; Hash chain; Key (lock); SHA-2; Protocol (science); Channel (broadcasting); Cryptographic hash function; Cryptography; Double hashing","score_opus":0.007652615270703633,"score_gpt":0.2504995711155292,"score_spread":0.24284695584482555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971382044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024014734,0.00020219357,0.9725653,0.00013540602,0.00005807324,0.000115340976,0.00002820039,0.0003938393,0.0024869223],"genre_scores_gemma":[0.8165838,0.00029085952,0.1770861,0.000091734735,0.0000785309,0.0002379157,0.00009700297,0.000063626416,0.005470363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974769,0.0008719712,0.00013316867,0.0003068892,0.00090227457,0.00030880544],"domain_scores_gemma":[0.9953431,0.0024905938,0.00037703893,0.0011356289,0.00047718946,0.00017642276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024011324,0.0005107258,0.0009198981,0.00073918013,0.0009678496,0.002044413,0.0023958634,0.0012217078,0.0024454307],"category_scores_gemma":[0.0043289815,0.00040357633,0.0007825792,0.00078559364,0.0030086352,0.0040915734,0.0029661648,0.0013671825,0.00074592023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083705795,0.00014242508,0.0006308649,0.00020072826,0.000108089764,0.00053625484,0.00057868677,0.08507402,0.02860419,0.83190876,0.0016379401,0.04974095],"study_design_scores_gemma":[0.00014490639,0.00029774645,0.00022973033,0.000028427829,0.000055924436,0.000385158,0.000089359164,0.82607955,0.023332288,0.14318681,0.0060767876,0.000093316754],"about_ca_topic_score_codex":0.00042815253,"about_ca_topic_score_gemma":0.00034210226,"teacher_disagreement_score":0.0024454307,"about_ca_system_score_codex":0.0009527844,"about_ca_system_score_gemma":0.0010327293,"threshold_uncertainty_score":0.012698531},"labels":[],"label_agreement":null},{"id":"W1972244700","doi":"10.1145/1501434.1501485","title":"Privacy enhanced personalization in e-learning","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Personalization; Computer science; Internet privacy; Information privacy; Privacy software; World Wide Web","score_opus":0.005471625175880436,"score_gpt":0.21350501152245274,"score_spread":0.2080333863465723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972244700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05773987,0.0031897782,0.8958818,0.00849451,0.00025899275,0.0002815053,0.000117507654,0.0007552138,0.033280954],"genre_scores_gemma":[0.82991123,0.0021273205,0.1545932,0.0008824918,0.00028096154,0.00019044198,0.00010448932,0.00010304286,0.011806833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99018073,0.005261032,0.00053987757,0.001184757,0.0021080473,0.00072550075],"domain_scores_gemma":[0.98265487,0.009041337,0.0010650144,0.005657106,0.0010904036,0.00049133814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008366461,0.00042040102,0.0006630983,0.000665583,0.0017564963,0.0049198414,0.0017307395,0.002846743,0.0036966638],"category_scores_gemma":[0.018129574,0.00064716476,0.00076985324,0.0012096957,0.0034453394,0.013207836,0.005060013,0.0038631838,0.0010131535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000503166,0.0004952211,0.0039698645,0.0004259398,0.0000705868,0.0004320763,0.0023259283,0.036669955,0.006216744,0.7212008,0.006434652,0.22125502],"study_design_scores_gemma":[0.000101517915,0.00030820383,0.0018096293,0.00019972998,0.00007621272,0.0012395575,0.00095509837,0.17138304,0.026572969,0.7361053,0.061139062,0.00010959174],"about_ca_topic_score_codex":0.0007047434,"about_ca_topic_score_gemma":0.00049753184,"teacher_disagreement_score":0.008366461,"about_ca_system_score_codex":0.0014596719,"about_ca_system_score_gemma":0.0013132736,"threshold_uncertainty_score":0.044246614},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05197287695405777,"score_gpt":0.22973803510511673,"score_spread":0.17776515815105895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973079148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02305009,0.031753458,0.87560797,0.008414722,0.0022434134,0.00010159766,0.00024721184,0.0008526291,0.05772899],"genre_scores_gemma":[0.4941285,0.034595408,0.44126177,0.0043263948,0.0050093504,0.00027827002,0.00044108037,0.00044011706,0.01951912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975146,0.000736021,0.00016991155,0.0003899725,0.0009845044,0.0002050467],"domain_scores_gemma":[0.9962393,0.0018607716,0.00013884273,0.0011219722,0.00046746677,0.00017171101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038162102,0.0007742351,0.00084924686,0.0015482213,0.0010220639,0.0030767766,0.0015312035,0.0015950585,0.0035059447],"category_scores_gemma":[0.0076646484,0.00058417337,0.0010080299,0.0017574155,0.0052829776,0.014197865,0.0043123187,0.004803997,0.0012043661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060539773,0.000027956425,0.00013563804,0.00013105894,0.0000115190005,0.000109495275,0.00016739848,0.002842285,0.001112329,0.9329045,0.004761788,0.05773556],"study_design_scores_gemma":[0.000020901847,0.00004798952,0.00009827691,0.000084122126,0.000010703336,0.0002894724,0.000050088587,0.020221232,0.00197625,0.9422312,0.03493753,0.00003226975],"about_ca_topic_score_codex":0.00044791575,"about_ca_topic_score_gemma":0.00028367285,"teacher_disagreement_score":0.0038162102,"about_ca_system_score_codex":0.0014080757,"about_ca_system_score_gemma":0.0007249971,"threshold_uncertainty_score":0.020182312},"labels":[],"label_agreement":null},{"id":"W1973681026","doi":"10.1145/2046707.2093479","title":"Poster","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multicast; Network packet; Computer network; Overhead (engineering); Hash function; Authentication (law); Bandwidth (computing); Message authentication code; Algorithm; Cryptography; Computer security","score_opus":0.035692061337450336,"score_gpt":0.2135955337165303,"score_spread":0.17790347237907997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973681026","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008855818,0.0077409847,0.06689965,0.019357584,0.046369195,0.00066792994,0.0052189,0.0033484038,0.8415415],"genre_scores_gemma":[0.06563287,0.0055772914,0.03153488,0.0063574202,0.009414951,0.0003812506,0.009821018,0.0010500889,0.87023026],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988576,0.00025605108,0.00006981919,0.00033778136,0.00033347268,0.00014526305],"domain_scores_gemma":[0.99853444,0.00023586139,0.00008076542,0.0003737509,0.00045001906,0.0003250932],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012646164,0.0006956483,0.00058269507,0.0013325828,0.0022805235,0.0041348967,0.0016227306,0.0021558614,0.29633242],"category_scores_gemma":[0.0032171125,0.00029431892,0.0007116843,0.0010771167,0.000703508,0.0037862419,0.0033866195,0.002091546,0.15136607],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025837964,0.00015510607,0.0010254864,0.00043348176,0.000030670275,0.00049221865,0.00035785686,0.0010130114,0.0028087783,0.102701426,0.6825271,0.20819646],"study_design_scores_gemma":[0.000017594499,0.000042517197,0.0003826816,0.0000805649,0.000009906991,0.00041439178,0.00015716512,0.0007715603,0.001119912,0.013515225,0.98347497,0.000013474612],"about_ca_topic_score_codex":0.00072673336,"about_ca_topic_score_gemma":0.0011220317,"teacher_disagreement_score":0.7036676,"about_ca_system_score_codex":0.0009911532,"about_ca_system_score_gemma":0.0010167016,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1975861567","doi":"10.1007/s10623-014-9952-6","title":"Paillier-based publicly verifiable (non-interactive) secret sharing","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Verifiable secret sharing; Paillier cryptosystem; Correctness; Semantic security; Computer science; Homomorphic secret sharing; Secret sharing; Computer security; Scheme (mathematics); Homomorphic encryption; Shamir's Secret Sharing; Security analysis; Encryption; Theoretical computer science; Public-key cryptography; Cryptography; Hybrid cryptosystem; Algorithm; Mathematics; Programming language; Attribute-based encryption","score_opus":0.014836702109259437,"score_gpt":0.22962428863276396,"score_spread":0.21478758652350452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975861567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041336905,0.00048470421,0.9277851,0.0011452147,0.0002303442,0.00028235363,0.0004348463,0.0038418095,0.02445871],"genre_scores_gemma":[0.8642806,0.0003174797,0.10561577,0.0004034156,0.00018022602,0.00031547053,0.00046193594,0.00032520771,0.02809994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928756,0.0014358613,0.00025348883,0.0011913874,0.002771968,0.0014716708],"domain_scores_gemma":[0.9887489,0.0040790774,0.0010528719,0.0045030387,0.0011538987,0.00046215253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033359334,0.0010801485,0.0019058571,0.0014389266,0.0020503083,0.0042092917,0.0042475606,0.003286277,0.012617035],"category_scores_gemma":[0.011226121,0.0008889185,0.0013067705,0.0018415792,0.0033283622,0.008004043,0.0080795325,0.0038108139,0.0037241653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019064001,0.0003346163,0.0008783338,0.0002556565,0.00014900102,0.000501142,0.00069835066,0.077320494,0.022881525,0.78517133,0.009031139,0.100872025],"study_design_scores_gemma":[0.00033956935,0.0003774643,0.00032068833,0.00008250788,0.000103439124,0.00041446261,0.00008780707,0.54395187,0.03764195,0.40108415,0.015440319,0.00015564107],"about_ca_topic_score_codex":0.0018654783,"about_ca_topic_score_gemma":0.0016907518,"teacher_disagreement_score":0.012617035,"about_ca_system_score_codex":0.0034076464,"about_ca_system_score_gemma":0.004075755,"threshold_uncertainty_score":0.042208135},"labels":[],"label_agreement":null},{"id":"W1977411270","doi":"10.1109/infcomw.2011.5928953","title":"PEACE: An efficient and secure patient-centric access control scheme for eHealth care system","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"eHealth; Access control; Confidentiality; Computer science; Computer security; Scheme (mathematics); Cryptography; Digital signature; Identity (music); Identity management; Internet privacy; Masking (illustration); Construct (python library); Order (exchange); Health care; Computer network; Business","score_opus":0.021888516045589897,"score_gpt":0.2560803814361911,"score_spread":0.23419186539060122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977411270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016777368,0.00040106592,0.97855604,0.0006145972,0.00015093136,0.0003804812,0.00010433326,0.0010926824,0.0019225754],"genre_scores_gemma":[0.7228125,0.00075500365,0.26834667,0.00062369084,0.0003404902,0.0005560858,0.0004957024,0.000080133264,0.0059897597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99472046,0.0017860377,0.00040170885,0.000530371,0.0019607816,0.00060058973],"domain_scores_gemma":[0.99585897,0.0007913863,0.00076707045,0.0015480175,0.0006248103,0.00040976255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038452845,0.0006401815,0.0011220537,0.0012853361,0.0015948117,0.0017673057,0.0021721676,0.0013187407,0.0024576236],"category_scores_gemma":[0.005181694,0.00040448512,0.0010420072,0.001223352,0.0019341423,0.005685514,0.005341039,0.0027363407,0.00085224217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026498954,0.0007266477,0.0038945482,0.00078558864,0.00048209215,0.0014198424,0.0027405645,0.06200595,0.11764774,0.44687387,0.021852644,0.33892074],"study_design_scores_gemma":[0.00074394007,0.0028428163,0.003197058,0.00013518173,0.00040336073,0.0040986827,0.00085981213,0.66250724,0.0967441,0.12859927,0.09934355,0.00052505604],"about_ca_topic_score_codex":0.00048120707,"about_ca_topic_score_gemma":0.00027936217,"teacher_disagreement_score":0.0038452845,"about_ca_system_score_codex":0.001081435,"about_ca_system_score_gemma":0.0017949842,"threshold_uncertainty_score":0.020336092},"labels":[],"label_agreement":null},{"id":"W1977514582","doi":"10.1109/pst.2012.6297936","title":"Social secret sharing in cloud computing using a new trust function","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cloud computing; Secret sharing; Computer science; Secure multi-party computation; Function (biology); Computer security; Scheme (mathematics); Shared resource; Order (exchange); Resource (disambiguation); Internet privacy; Distributed computing; Cryptography; Computer network; Business","score_opus":0.05312747432631672,"score_gpt":0.2934009329537384,"score_spread":0.24027345862742172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977514582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038020533,0.0010207484,0.9489706,0.0015511282,0.0001691671,0.000090715446,0.00003618784,0.000096936,0.010043995],"genre_scores_gemma":[0.89879245,0.0014021074,0.09494456,0.00018334136,0.00029804598,0.00016456588,0.00003139887,0.000041553136,0.0041420315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967714,0.0014142967,0.00022818214,0.00032591174,0.00090952916,0.0003507243],"domain_scores_gemma":[0.997334,0.0011406617,0.00029573508,0.00055559375,0.0004527071,0.00022133424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036773782,0.00064480095,0.0008881091,0.0011453512,0.0014399209,0.0034306995,0.0012474492,0.0016725248,0.001016676],"category_scores_gemma":[0.0058369245,0.00031423417,0.0012193036,0.0014221171,0.003863892,0.008221816,0.002377169,0.001956503,0.00032937527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044769073,0.000022343109,0.00027537497,0.000068636844,0.000024872064,0.00016165596,0.00032288747,0.021395339,0.0026122925,0.9630925,0.00057719555,0.011402111],"study_design_scores_gemma":[0.000029225543,0.00013877115,0.00032118696,0.000052456435,0.000049033926,0.00038508777,0.0001713206,0.4307532,0.0033641013,0.55471456,0.0099452175,0.00007581419],"about_ca_topic_score_codex":0.00090731407,"about_ca_topic_score_gemma":0.0004523691,"teacher_disagreement_score":0.0036773782,"about_ca_system_score_codex":0.0024609952,"about_ca_system_score_gemma":0.0012198763,"threshold_uncertainty_score":0.019448102},"labels":[],"label_agreement":null},{"id":"W1978881617","doi":"10.1049/iet-ifs.2011.0052","title":"HB <sup>𝒞</sup> entity authentication for low-cost pervasive devices","year":2012,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Authentication protocol; Authentication (law); Protocol (science); Computer network; Forward secrecy; Key exchange; Computer security; Theoretical computer science; Public-key cryptography; Encryption","score_opus":0.013724625033797884,"score_gpt":0.2565123386231124,"score_spread":0.24278771358931453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978881617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034274735,0.0007863415,0.93604577,0.0026658708,0.00050296774,0.00022517526,0.00018165473,0.0019871364,0.023330426],"genre_scores_gemma":[0.78154325,0.00064768136,0.19699833,0.0009282055,0.0002492737,0.0001937382,0.00031763598,0.00013255705,0.018989244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919266,0.0002710849,0.00006132981,0.000070744245,0.00032045774,0.000083803774],"domain_scores_gemma":[0.99758875,0.000666507,0.00021114621,0.00094445155,0.0004862635,0.00010280801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012903928,0.0003575457,0.0003202064,0.0003079488,0.0006983558,0.0008641293,0.0010331229,0.0007026895,0.0055549485],"category_scores_gemma":[0.0031988488,0.00021530263,0.00020721937,0.00043375284,0.0008328679,0.002179041,0.0013967195,0.0010420191,0.00207014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007738272,0.000079832906,0.0007750007,0.00033661464,0.000038889084,0.00035574127,0.00023557278,0.015083579,0.048770186,0.63064325,0.037443973,0.26546353],"study_design_scores_gemma":[0.00011390637,0.0005814196,0.00086958345,0.00008265459,0.00006076901,0.0010163257,0.000263044,0.49220607,0.11903777,0.26930353,0.11637798,0.000086950844],"about_ca_topic_score_codex":0.00047623023,"about_ca_topic_score_gemma":0.0007696141,"teacher_disagreement_score":0.0055549485,"about_ca_system_score_codex":0.00057724875,"about_ca_system_score_gemma":0.0005887067,"threshold_uncertainty_score":0.018583119},"labels":[],"label_agreement":null},{"id":"W1979804866","doi":"10.1109/ainaw.2007.197","title":"Heuristics for Improving Cryptographic Key Assignment in a Hierarchy","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cryptography; Heuristics; Key management; Hierarchy; Key (lock); Heuristic; Tree (set theory); Distributed computing; Graph; Group key; Theoretical computer science; Computer network; Computer security; Encryption; Mathematics; Artificial intelligence","score_opus":0.013369544053542595,"score_gpt":0.2556440705172971,"score_spread":0.2422745264637545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979804866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074722655,0.0007410603,0.92024034,0.0002466145,0.000058203223,0.00020810444,0.00006730669,0.0008962235,0.0028194606],"genre_scores_gemma":[0.30967736,0.00036776453,0.68809795,0.000102436556,0.000032917706,0.00011151357,0.00020663529,0.00012265325,0.0012808191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988288,0.00040353573,0.000076537,0.00016038933,0.00027215737,0.00025852947],"domain_scores_gemma":[0.9972108,0.0015894378,0.00034926707,0.00034528915,0.00031077492,0.00019450358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017260211,0.0010758835,0.0008689335,0.0015317046,0.00094213104,0.0009911021,0.0016264227,0.0008298137,0.0021029867],"category_scores_gemma":[0.005637494,0.00062778255,0.00054486905,0.0016521284,0.00086944405,0.0024379615,0.0014543309,0.00094088784,0.0004584831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033651516,0.00040511467,0.0020756207,0.00028873573,0.00006682018,0.00014579191,0.00049901434,0.6497054,0.009761426,0.030068964,0.0038891062,0.3027575],"study_design_scores_gemma":[0.00015912905,0.00021689008,0.0003573462,0.000022953767,0.00004597669,0.00011123342,0.00021513185,0.96584255,0.004287946,0.025653092,0.0030606715,0.000027112465],"about_ca_topic_score_codex":0.005252679,"about_ca_topic_score_gemma":0.006144833,"teacher_disagreement_score":0.005252679,"about_ca_system_score_codex":0.0014373884,"about_ca_system_score_gemma":0.002343771,"threshold_uncertainty_score":0.010444224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015507205510936888,"score_gpt":0.25655463518230315,"score_spread":0.24104742967136625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198033559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049760938,0.0011309619,0.8525059,0.0023895472,0.00043616683,0.00015994532,0.0001861827,0.0006040282,0.09282634],"genre_scores_gemma":[0.8637528,0.0005740542,0.0896296,0.00065930374,0.00047823138,0.0003525897,0.0001453753,0.00023393738,0.04417424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972796,0.00087937276,0.00012891658,0.0004115822,0.0009061824,0.00039452795],"domain_scores_gemma":[0.99549687,0.002527989,0.00020227954,0.0012570241,0.00026469876,0.0002511551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018231319,0.0007303732,0.0014846999,0.0011886741,0.0017048257,0.003525264,0.0015778608,0.0028086717,0.0081416415],"category_scores_gemma":[0.0077227713,0.00057845004,0.0010541134,0.0010871876,0.004190826,0.005119113,0.005837381,0.005474397,0.0022397297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052239142,0.000022742615,0.00004936831,0.00004650971,0.000008803376,0.000039832506,0.000080485595,0.0029474234,0.002011078,0.98640126,0.0011081356,0.007232139],"study_design_scores_gemma":[0.000016869762,0.00002817991,0.000058646223,0.000018115694,0.000007906081,0.00009239581,0.0000147995925,0.04059201,0.001874236,0.9553019,0.0019787243,0.000016324062],"about_ca_topic_score_codex":0.00021307946,"about_ca_topic_score_gemma":0.00016584052,"teacher_disagreement_score":0.0081416415,"about_ca_system_score_codex":0.0014908769,"about_ca_system_score_gemma":0.000771021,"threshold_uncertainty_score":0.027236462},"labels":[],"label_agreement":null},{"id":"W1980884844","doi":"10.1504/ijsn.2007.013177","title":"Preventing or utilising key escrow in identity-based schemes employed in mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Security and Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key escrow; Mobile ad hoc network; Computer science; Key (lock); Computer network; Wireless ad hoc network; Computer security; Key management; Public-key cryptography; Cryptography; Wireless; Telecommunications; Encryption; Network packet","score_opus":0.012871657456760572,"score_gpt":0.29442693532209135,"score_spread":0.2815552778653308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980884844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17018026,0.0021875987,0.81715536,0.0012872507,0.00013085791,0.0002033456,0.000045568802,0.00026354005,0.008546282],"genre_scores_gemma":[0.967203,0.000829667,0.030450102,0.000107252934,0.000059168484,0.000053587897,0.000017773058,0.000022620412,0.0012568226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99177176,0.0039806785,0.00034188363,0.0008500021,0.0018567976,0.0011988409],"domain_scores_gemma":[0.9683708,0.015693253,0.0049760723,0.009080883,0.001238373,0.0006405195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074273986,0.0008964349,0.0013964862,0.0013779603,0.0018696844,0.0032759584,0.0025697728,0.002871022,0.001121036],"category_scores_gemma":[0.025340194,0.0007794344,0.0010573233,0.0018444888,0.0072538033,0.010946828,0.0051213596,0.0031158717,0.0004823676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007222515,0.00019923708,0.004108068,0.0005097033,0.00015134306,0.0011430072,0.0019873334,0.16145444,0.018142227,0.75870013,0.001587632,0.051294662],"study_design_scores_gemma":[0.000079782454,0.00062380417,0.0007236807,0.00017525537,0.00012335167,0.001817235,0.0007449376,0.66913486,0.02282055,0.29483318,0.008784474,0.0001388333],"about_ca_topic_score_codex":0.00062234764,"about_ca_topic_score_gemma":0.0004323994,"teacher_disagreement_score":0.0074273986,"about_ca_system_score_codex":0.0017388866,"about_ca_system_score_gemma":0.0013738372,"threshold_uncertainty_score":0.039280295},"labels":[],"label_agreement":null},{"id":"W1981635722","doi":"10.1109/cisda.2012.6291534","title":"A mobile role-based access control system using identity-based encryption with zero knowledge proof","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Mitacs","keywords":"Access control; Computer science; Role-based access control; Encryption; Computer security; Authentication (law); Identity (music); Zero-knowledge proof; Identity management; Cryptography","score_opus":0.021422971327692362,"score_gpt":0.2860525118196568,"score_spread":0.2646295404919644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981635722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016315259,0.00037293698,0.9751923,0.00052813697,0.00016628935,0.00020435553,0.00005899291,0.0016238615,0.0055379933],"genre_scores_gemma":[0.6573244,0.000537681,0.33032492,0.0004498866,0.0001814008,0.0003214704,0.00014742649,0.00008100399,0.010631814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976246,0.0006031152,0.00020715404,0.00041172834,0.0008937919,0.00025959234],"domain_scores_gemma":[0.99831665,0.0004264928,0.00023250213,0.00054727827,0.00027983822,0.00019725878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971419,0.0005754459,0.0010283696,0.0006511717,0.0011814305,0.0024059927,0.0021264097,0.0017960236,0.0027752288],"category_scores_gemma":[0.0026971344,0.0003449923,0.00096821244,0.0005236589,0.0014121043,0.0035352123,0.0022200604,0.0016381245,0.0015299122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097503845,0.0006551482,0.0020791597,0.0004592407,0.00025091905,0.0029495494,0.001421747,0.052822977,0.104123145,0.64692277,0.00833735,0.17900299],"study_design_scores_gemma":[0.000513421,0.0010579035,0.0008871078,0.0001262517,0.00027261773,0.0040640524,0.00020586325,0.7559613,0.056973737,0.08678403,0.09291753,0.0002361427],"about_ca_topic_score_codex":0.0010777895,"about_ca_topic_score_gemma":0.00078125775,"teacher_disagreement_score":0.0027752288,"about_ca_system_score_codex":0.0006786182,"about_ca_system_score_gemma":0.0011302065,"threshold_uncertainty_score":0.010425985},"labels":[],"label_agreement":null},{"id":"W1985019380","doi":"10.1108/17440080911006216","title":"Schema‐level access control policies for XML documents","year":2009,"lang":"en","type":"article","venue":"International Journal of Web Information Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Acadia University","funders":"","keywords":"Computer science; Encryption; Correctness; Document Structure Description; Access control; Scalability; XML; Schema (genetic algorithms); Database; Theoretical computer science; Information retrieval; Computer security; Programming language; World Wide Web","score_opus":0.026692456795155334,"score_gpt":0.3243364336617772,"score_spread":0.2976439768666219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985019380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019218141,0.0006846333,0.96642435,0.0006853699,0.00008560818,0.00070487603,0.0008051047,0.004083151,0.007308751],"genre_scores_gemma":[0.38832802,0.0016342605,0.5963176,0.000594287,0.000114103634,0.0007694383,0.003030881,0.000614153,0.008597317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9916551,0.0028446934,0.0015011883,0.0009226141,0.0026125147,0.0004637908],"domain_scores_gemma":[0.9867842,0.004051932,0.0010838783,0.006061182,0.0016976802,0.00032111938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006625337,0.00054898293,0.00053271855,0.0011035969,0.0009117719,0.0051605655,0.0016697438,0.0015136076,0.0036733833],"category_scores_gemma":[0.015377798,0.0005863405,0.0009922133,0.0016663324,0.0013693925,0.006718565,0.0017684562,0.0021570043,0.0016793845],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005127144,0.0003134742,0.0048756665,0.0010131841,0.0001346729,0.00060884655,0.0017921537,0.05775968,0.03489628,0.684177,0.009620861,0.20429553],"study_design_scores_gemma":[0.00019227434,0.00042575382,0.002137223,0.0005441674,0.00013505464,0.001621434,0.0009441825,0.44859412,0.09638423,0.21505117,0.23381212,0.00015825161],"about_ca_topic_score_codex":0.0027316916,"about_ca_topic_score_gemma":0.0023099938,"teacher_disagreement_score":0.006625337,"about_ca_system_score_codex":0.0016874567,"about_ca_system_score_gemma":0.0027892801,"threshold_uncertainty_score":0.03503859},"labels":[],"label_agreement":null},{"id":"W1985322847","doi":"10.1049/iet-ifs.2009.0098","title":"Unconditionally secure social secret sharing scheme","year":2010,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Scheme (mathematics); Secret sharing; Computer security; Computer science; Internet privacy; Commitment scheme; Cryptography; Mathematics; Law; Political science","score_opus":0.00596736023236297,"score_gpt":0.23090521996746646,"score_spread":0.2249378597351035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985322847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053668134,0.00033914635,0.92300093,0.0014408272,0.00021172132,0.00036032838,0.0003457708,0.00086563476,0.019767528],"genre_scores_gemma":[0.880071,0.00027137887,0.10172136,0.0002971667,0.00014730908,0.00034070495,0.00024932856,0.000050803555,0.01685099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953969,0.0013606972,0.00032278147,0.0005751003,0.0015928603,0.00075158133],"domain_scores_gemma":[0.9953122,0.0011055606,0.0006819266,0.0018984183,0.00061583763,0.0003861458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024477525,0.0006570485,0.001058384,0.0007650823,0.0016928932,0.0021255529,0.0019072699,0.0017040166,0.004843028],"category_scores_gemma":[0.005147993,0.0004164774,0.0008971137,0.0012122893,0.002374146,0.0040927376,0.0058348277,0.0020744938,0.001859078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034224775,0.00011871613,0.0004758891,0.00015869905,0.00006124565,0.00034037174,0.00079107523,0.024144858,0.012600044,0.90437907,0.003991666,0.052596036],"study_design_scores_gemma":[0.00027741215,0.0004661626,0.0005752361,0.00011112954,0.00013314655,0.0012877411,0.00021041092,0.33039716,0.020737505,0.57979566,0.06579685,0.00021158947],"about_ca_topic_score_codex":0.000513574,"about_ca_topic_score_gemma":0.00044766712,"teacher_disagreement_score":0.004843028,"about_ca_system_score_codex":0.0015400252,"about_ca_system_score_gemma":0.0024536208,"threshold_uncertainty_score":0.016201556},"labels":[],"label_agreement":null},{"id":"W1985331271","doi":"10.4236/ijcns.2011.47055","title":"A Framework for Security-Enhanced Peer-to-Peer Applications in Mobile Cellular Networks","year":2011,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Computer network; Cellular network; Session Initiation Protocol; Computer security; Server","score_opus":0.03674613265191875,"score_gpt":0.31610515957498053,"score_spread":0.2793590269230618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985331271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016216539,0.0005358301,0.99081576,0.00053826673,0.00018221176,0.00028820368,0.000037770293,0.0013311594,0.004649104],"genre_scores_gemma":[0.116751924,0.0013354319,0.8719372,0.00027310668,0.00035870122,0.0009843637,0.00017545378,0.00025316645,0.007930624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727976,0.00081169506,0.00024866106,0.00031240826,0.0011141793,0.0002332482],"domain_scores_gemma":[0.99872583,0.000369231,0.000089497866,0.0003149535,0.00030052758,0.000199956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004247198,0.0010257268,0.000977066,0.0009786339,0.0022427058,0.0040364075,0.004192508,0.0030692166,0.0023662364],"category_scores_gemma":[0.0038751664,0.0006935301,0.0013393097,0.0007888956,0.0026649095,0.0045678676,0.0038644632,0.003619714,0.001529645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046824098,0.00007032469,0.0001599425,0.00016946788,0.000032368163,0.00060326507,0.00056719093,0.03154392,0.0049491725,0.91631526,0.006077189,0.039464984],"study_design_scores_gemma":[0.00011373275,0.00018132772,0.00015828262,0.00017051196,0.000076297016,0.0010253896,0.00018596576,0.45249873,0.0049918485,0.30349386,0.23698413,0.000119849734],"about_ca_topic_score_codex":0.002723818,"about_ca_topic_score_gemma":0.0028028814,"teacher_disagreement_score":0.004247198,"about_ca_system_score_codex":0.0013834962,"about_ca_system_score_gemma":0.0028144498,"threshold_uncertainty_score":0.022461653},"labels":[],"label_agreement":null},{"id":"W1985531885","doi":"10.1109/pst.2012.6297925","title":"An integrated key management and secure routing framework for Mobile Ad-Hoc Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Key management; Cryptography; Key (lock); Computer network; Mobile ad hoc network; Authentication (law); Wireless ad hoc network; Computer security; Symmetric-key algorithm; Scheme (mathematics); Public-key cryptography; Encryption; Telecommunications; Mathematics; Wireless","score_opus":0.01137472593323966,"score_gpt":0.26329595665719985,"score_spread":0.25192123072396017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985531885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007518494,0.0008372857,0.9869379,0.00047473228,0.00013200968,0.00021067665,0.000040222225,0.0007373428,0.0031113757],"genre_scores_gemma":[0.34652585,0.0013598949,0.6440998,0.0002807043,0.0002617294,0.00040024286,0.00025920852,0.00008834834,0.006724204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985697,0.00029495725,0.00012356939,0.00020079454,0.00066372537,0.00014722659],"domain_scores_gemma":[0.9993874,0.000075389224,0.000099859455,0.00021503486,0.00015087676,0.00007153464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016715236,0.0006574901,0.0006783728,0.00094802637,0.0012187603,0.0018300896,0.0020950024,0.001232169,0.0015235955],"category_scores_gemma":[0.0013057167,0.00041556708,0.0007343538,0.0009883214,0.0010974883,0.0056122392,0.0029229345,0.0018121161,0.0008803759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021271518,0.00022014375,0.0005287654,0.00035295932,0.00010062809,0.0006804812,0.0004141342,0.06688999,0.0356216,0.6800966,0.0073576444,0.20752439],"study_design_scores_gemma":[0.00018136179,0.0006979881,0.00049216003,0.00011592108,0.00018072726,0.0016489511,0.00025265632,0.661369,0.02011292,0.2149351,0.0998436,0.0001695371],"about_ca_topic_score_codex":0.0007115924,"about_ca_topic_score_gemma":0.00087864837,"teacher_disagreement_score":0.0020950024,"about_ca_system_score_codex":0.0009396972,"about_ca_system_score_gemma":0.002101734,"threshold_uncertainty_score":0.008839965},"labels":[],"label_agreement":null},{"id":"W1985567543","doi":"10.1145/2462096.2462110","title":"The weakness of integrity protection for LTE","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Message authentication code; Computer security; Data integrity; Harm; Authentication (law); Key (lock); Computer network; Cryptography; Law","score_opus":0.022924956862296935,"score_gpt":0.24240532672181375,"score_spread":0.21948036985951683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985567543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21321337,0.013669722,0.68751454,0.0072631924,0.0007604842,0.00024287881,0.00045472645,0.0027886683,0.0740925],"genre_scores_gemma":[0.9746947,0.001454749,0.01848306,0.0005266049,0.00020337466,0.00004898801,0.000119214965,0.00006389704,0.004405273],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960368,0.000852154,0.00030420843,0.0004324701,0.0018035551,0.0005707282],"domain_scores_gemma":[0.9871997,0.0042151716,0.0012269586,0.005380613,0.0017924433,0.00018516117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029483319,0.0005876306,0.0006354913,0.0009674956,0.0014046725,0.0019783606,0.0015374705,0.0023297798,0.0035362963],"category_scores_gemma":[0.013155152,0.00047379604,0.00067484815,0.00093817635,0.001499907,0.0054104244,0.002089647,0.0018675562,0.0017665473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018241145,0.00010864601,0.01817938,0.0012313286,0.0005223485,0.0020532634,0.0020307805,0.050169338,0.18424465,0.21409687,0.012437512,0.5131018],"study_design_scores_gemma":[0.00012520383,0.0018543126,0.008723998,0.00047581265,0.00067557476,0.014481564,0.00069886324,0.24323212,0.4742369,0.10442769,0.15079263,0.00027535035],"about_ca_topic_score_codex":0.0009168159,"about_ca_topic_score_gemma":0.0003737878,"teacher_disagreement_score":0.0035362963,"about_ca_system_score_codex":0.0011412895,"about_ca_system_score_gemma":0.0009321559,"threshold_uncertainty_score":0.015592456},"labels":[],"label_agreement":null},{"id":"W1989147389","doi":"10.4236/jis.2012.32013","title":"Privacy Preserving Scheme for Location-Based Services","year":2012,"lang":"en","type":"article","venue":"Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Executor; Scheme (mathematics); Confidentiality; Computer security; Process (computing); Computer network; Database; Operating system","score_opus":0.011344082077225849,"score_gpt":0.25827496749926643,"score_spread":0.24693088542204059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989147389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039993685,0.0007471043,0.9423538,0.0013909596,0.00016579912,0.00040787144,0.00039568616,0.0015228236,0.013022302],"genre_scores_gemma":[0.77058303,0.0006940016,0.20985386,0.00048473757,0.00017588827,0.00043660885,0.0005720673,0.00007291808,0.017126752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977805,0.00049187185,0.00021341979,0.00026348824,0.0009384866,0.0003123464],"domain_scores_gemma":[0.9975108,0.0004429433,0.00026295392,0.001355769,0.0003078914,0.00011966976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014469677,0.00038456952,0.0006196901,0.00059904146,0.0013485857,0.0018384454,0.0012652773,0.0015328979,0.0045760577],"category_scores_gemma":[0.0030113126,0.00030297917,0.00066884764,0.0010006841,0.0011367205,0.0043616802,0.0029960703,0.0017252382,0.0016400979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009120149,0.00023997054,0.0008032006,0.00035404958,0.00006061211,0.0008413237,0.0009688915,0.02774386,0.05386554,0.75657934,0.010923846,0.14670742],"study_design_scores_gemma":[0.0004541518,0.00070803246,0.0010725247,0.00012172159,0.00014325754,0.0026547257,0.0003174757,0.40626895,0.08748555,0.3593785,0.14121713,0.00017799194],"about_ca_topic_score_codex":0.0006087413,"about_ca_topic_score_gemma":0.00038390173,"teacher_disagreement_score":0.0045760577,"about_ca_system_score_codex":0.0014560111,"about_ca_system_score_gemma":0.0014331294,"threshold_uncertainty_score":0.01530844},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02339945567962077,"score_gpt":0.2062763215648654,"score_spread":0.18287686588524463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992282993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051760696,0.00043433614,0.9329935,0.00085625384,0.00013763995,0.00027677757,0.00042768067,0.0011073026,0.012005856],"genre_scores_gemma":[0.73325706,0.0003430378,0.25784063,0.00044488005,0.00014045722,0.00037926453,0.00050691614,0.00014073774,0.0069469865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698454,0.00055477256,0.00021796439,0.00036932918,0.0014506542,0.0004227063],"domain_scores_gemma":[0.9968168,0.0006606926,0.0002747864,0.0018520764,0.00028063342,0.00011501806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017675961,0.00042271818,0.0010453331,0.00044069198,0.0006288014,0.0015248698,0.0015025052,0.001130437,0.002735576],"category_scores_gemma":[0.0031966118,0.0004687615,0.0007211895,0.0007570086,0.0016537595,0.0053913137,0.0048768013,0.0026328508,0.0012311677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005619591,0.000336745,0.0006439803,0.00047044386,0.00008371733,0.000543232,0.00058015407,0.040274054,0.051604398,0.7513139,0.0073034945,0.14628388],"study_design_scores_gemma":[0.00035702524,0.00045519046,0.00063752575,0.000111675676,0.00007126939,0.0013529701,0.000173395,0.35854897,0.13947293,0.4694569,0.029167453,0.0001946222],"about_ca_topic_score_codex":0.00020831604,"about_ca_topic_score_gemma":0.0001867699,"teacher_disagreement_score":0.002735576,"about_ca_system_score_codex":0.0007101697,"about_ca_system_score_gemma":0.0012987277,"threshold_uncertainty_score":0.009348035},"labels":[],"label_agreement":null},{"id":"W1997737572","doi":"10.1007/s10489-011-0280-5","title":"Service selection in stochastic environments: a learning-automaton based solution","year":2011,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; RSS; Learning automata; Quality (philosophy); Convergence (economics); Machine learning; Service (business); Reputation; Automaton; Artificial intelligence; Theoretical computer science; World Wide Web","score_opus":0.024214245027549604,"score_gpt":0.21935990216587117,"score_spread":0.19514565713832158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997737572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039201587,0.0001254185,0.95591354,0.0005857936,0.00006979073,0.00009606647,0.0000927463,0.00047482323,0.0034402134],"genre_scores_gemma":[0.8028573,0.00014169425,0.19117337,0.00019478577,0.00007899247,0.00020376184,0.00017764815,0.0000932557,0.0050792317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989963,0.0003002875,0.000054409244,0.00022931455,0.00019856537,0.00022110558],"domain_scores_gemma":[0.9974367,0.001695127,0.00017986882,0.00016809709,0.00032735014,0.00019290666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011188505,0.00078429625,0.0020498275,0.000930426,0.0011163023,0.0015143169,0.0024102149,0.002355696,0.0036301196],"category_scores_gemma":[0.0036626016,0.0006172351,0.0014083594,0.0009613787,0.0013827552,0.0012667761,0.0020059375,0.0014922459,0.00042528598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007850754,0.00007225256,0.0005046955,0.000036571008,0.000037779675,0.00006484798,0.000047131954,0.96903956,0.00056583947,0.010988533,0.0005832394,0.017981054],"study_design_scores_gemma":[0.000010024662,0.000011216696,0.00002771297,0.0000014190805,0.0000050894305,0.00000774086,0.000006248351,0.99616265,0.00008707065,0.0035897263,0.00008851269,0.0000026073521],"about_ca_topic_score_codex":0.010697214,"about_ca_topic_score_gemma":0.009311865,"teacher_disagreement_score":0.010697214,"about_ca_system_score_codex":0.0014082822,"about_ca_system_score_gemma":0.0027188591,"threshold_uncertainty_score":0.021269917},"labels":[],"label_agreement":null},{"id":"W1998787944","doi":"10.1016/j.dam.2005.03.026","title":"Properties and constraints of cheating-immune secret sharing schemes","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cheating; Mathematics; Secret sharing; Theoretical computer science; Algorithm; Cryptography; Computer science; Social psychology","score_opus":0.02531549787410058,"score_gpt":0.2313856977545834,"score_spread":0.2060701998804828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998787944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6264222,0.00065169623,0.30737948,0.004065526,0.0001476916,0.000432753,0.001327803,0.00033849917,0.059234243],"genre_scores_gemma":[0.9814554,0.0002736794,0.01512971,0.00017457428,0.000103429484,0.00018002228,0.00033238097,0.000047989302,0.0023028944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927429,0.0020923032,0.000630523,0.0009970103,0.0023291751,0.0012081079],"domain_scores_gemma":[0.9230819,0.049157545,0.00843734,0.0118259685,0.0044401297,0.0030571474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069922647,0.0006418218,0.0018608784,0.0014939117,0.002162176,0.0061974404,0.003139978,0.0023985044,0.006724416],"category_scores_gemma":[0.049464736,0.00074464217,0.0008595495,0.0028426475,0.0036487454,0.009682883,0.0032415034,0.004156305,0.00062356214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049820443,0.00016944605,0.0013132826,0.00013003952,0.000035266134,0.00023057414,0.00033401948,0.0248652,0.005144861,0.9553922,0.0014366987,0.0104501415],"study_design_scores_gemma":[0.00017021324,0.00015473724,0.0005362995,0.000048356447,0.0000329128,0.0004952066,0.00017950656,0.14243256,0.0052606096,0.84784746,0.0027954134,0.000046642388],"about_ca_topic_score_codex":0.00056596793,"about_ca_topic_score_gemma":0.00035099348,"teacher_disagreement_score":0.0069922647,"about_ca_system_score_codex":0.002166402,"about_ca_system_score_gemma":0.0023585442,"threshold_uncertainty_score":0.03697908},"labels":[],"label_agreement":null},{"id":"W2003261926","doi":"10.1145/1966913.1966922","title":"Identity-based online/offline key encapsulation and encryption","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; Computer science; Ciphertext; Plaintext; Modular exponentiation; Deterministic encryption; Theoretical computer science; Computation; Malleability; Hash function; Plaintext-aware encryption; Cryptography; Public-key cryptography; Algorithm; Computer network; Computer security","score_opus":0.04010216223299163,"score_gpt":0.24907977877987653,"score_spread":0.2089776165468849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003261926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010642965,0.00052993034,0.96393305,0.00022278048,0.00015229183,0.00028797734,0.00022105734,0.0012951542,0.022714792],"genre_scores_gemma":[0.5234391,0.0010030615,0.42060822,0.0003145763,0.00019380888,0.0004671231,0.00087020634,0.00035756614,0.05274632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977331,0.00039790478,0.0001697787,0.00028881483,0.0010384686,0.0003719099],"domain_scores_gemma":[0.99823964,0.00016551715,0.0001485504,0.001144288,0.0002264676,0.000075615324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011881234,0.00047203325,0.00073795125,0.00060643425,0.000721537,0.0020132498,0.0014823639,0.00096251006,0.0056494786],"category_scores_gemma":[0.002296465,0.00032814912,0.0006746025,0.00078732,0.0009409084,0.0035516536,0.003689316,0.0014825898,0.0049088146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006061959,0.0003460873,0.00064667576,0.00032113865,0.000039161405,0.00049521535,0.0004999309,0.01217325,0.037275232,0.69909704,0.011664213,0.2368359],"study_design_scores_gemma":[0.00016530929,0.00034321463,0.0010738237,0.00023491759,0.00007796952,0.0030642918,0.00022191527,0.24705026,0.229696,0.2877652,0.23013635,0.00017065731],"about_ca_topic_score_codex":0.00026192298,"about_ca_topic_score_gemma":0.00014836069,"teacher_disagreement_score":0.0056494786,"about_ca_system_score_codex":0.0006324789,"about_ca_system_score_gemma":0.00087583903,"threshold_uncertainty_score":0.018899381},"labels":[],"label_agreement":null},{"id":"W2003325966","doi":"10.1109/infcom.2013.6566845","title":"Proof-carrying cloud computation: The case of convex optimization","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cloud computing; Computer science; Computation; Regular polygon; Convex optimization; Mathematical optimization; Mathematics; Algorithm; Geometry","score_opus":0.01463640579354775,"score_gpt":0.24058962959319297,"score_spread":0.22595322379964522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003325966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011165411,0.00019042387,0.9794764,0.0009244959,0.00003573594,0.00008473064,0.000049341375,0.00012218118,0.007951247],"genre_scores_gemma":[0.60378534,0.00080250204,0.38737875,0.0002815374,0.00016056775,0.00037541596,0.00010805227,0.00019708704,0.006910737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99452376,0.0024400363,0.00025827636,0.000625425,0.0015837104,0.000568765],"domain_scores_gemma":[0.98828214,0.008260642,0.00068747986,0.0019244587,0.00060116453,0.00024414185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056773196,0.0010281716,0.0010478158,0.0007274179,0.0010822616,0.003450656,0.0017531167,0.0019593206,0.004053864],"category_scores_gemma":[0.02065504,0.00075698266,0.0015639829,0.0010131211,0.0051398426,0.00515852,0.0028318134,0.0038175574,0.00081263797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009100386,0.00003352736,0.00020296713,0.00011615939,0.000026187798,0.0002687396,0.00015355166,0.14907296,0.0013560059,0.8306703,0.0011473332,0.016861193],"study_design_scores_gemma":[0.000035743982,0.000023447466,0.000055808712,0.000023435863,0.0000128525135,0.00010494685,0.00002228376,0.64098185,0.0018698775,0.35448542,0.0023672986,0.000017136921],"about_ca_topic_score_codex":0.0014698054,"about_ca_topic_score_gemma":0.00079918216,"teacher_disagreement_score":0.0056773196,"about_ca_system_score_codex":0.0021938088,"about_ca_system_score_gemma":0.002129822,"threshold_uncertainty_score":0.030024886},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007618213281689664,"score_gpt":0.23630355843375248,"score_spread":0.22868534515206282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003406796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022568641,0.0014993161,0.9676995,0.0024860112,0.0001775257,0.00021287425,0.000062401064,0.0013386045,0.003955155],"genre_scores_gemma":[0.49918047,0.002528493,0.4908801,0.00042712127,0.0005718655,0.0006812899,0.00024367431,0.00032247909,0.0051645096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934275,0.0021639417,0.0003294663,0.0006247636,0.0029528665,0.0005014839],"domain_scores_gemma":[0.9915575,0.0038953768,0.00064685906,0.0026629895,0.0008937315,0.00034358044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005739488,0.0011856338,0.0018897823,0.0011043472,0.0016371086,0.0029965574,0.0034804132,0.0022887483,0.0018218159],"category_scores_gemma":[0.013585684,0.0009449391,0.00094931654,0.002201929,0.0044753067,0.00934796,0.006641204,0.004101466,0.0011593472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035775916,0.00012610616,0.00063096196,0.00047452078,0.000111373854,0.00045465695,0.0008010354,0.3933825,0.0111256745,0.5000829,0.009762574,0.08268987],"study_design_scores_gemma":[0.00009991781,0.00006795049,0.00007362778,0.000026946529,0.000022244238,0.00006841658,0.00007738358,0.57537436,0.0032382188,0.4119867,0.008942833,0.000021355607],"about_ca_topic_score_codex":0.0014296889,"about_ca_topic_score_gemma":0.0011166247,"teacher_disagreement_score":0.005739488,"about_ca_system_score_codex":0.0014995035,"about_ca_system_score_gemma":0.0021376598,"threshold_uncertainty_score":0.030353725},"labels":[],"label_agreement":null},{"id":"W2003538822","doi":"10.1142/s0218194007003367","title":"PROTECT VIRTUAL PROPERTY IN ONLINE GAMING SYSTEM","year":2007,"lang":"en","type":"article","venue":"International Journal of Software Engineering and Knowledge Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Entertainment; Property (philosophy); TRACE (psycholinguistics); Metaverse; Virtual world; Order (exchange); Virtual economy; Computer security; Virtual reality; Multimedia; Internet privacy; Human–computer interaction; World Wide Web; Business","score_opus":0.007286633045632748,"score_gpt":0.22559984909622016,"score_spread":0.2183132160505874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003538822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2814449,0.0010124884,0.6483704,0.0033883504,0.00019985862,0.0007312225,0.00066868804,0.021700999,0.042483162],"genre_scores_gemma":[0.9065564,0.00029545987,0.078674145,0.0005861387,0.000054256056,0.0002184664,0.00046404856,0.0004074775,0.012743489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976351,0.0010674758,0.0002388013,0.00019925743,0.00057670416,0.00028269732],"domain_scores_gemma":[0.99635386,0.0010492805,0.00047506907,0.0015134397,0.00044648573,0.00016187367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021778375,0.00035712178,0.00036300079,0.001075176,0.0012251823,0.0027660287,0.0011534985,0.0009516167,0.0023437254],"category_scores_gemma":[0.0054237475,0.0002613592,0.00040523813,0.00057844946,0.001737921,0.008435204,0.0028300162,0.0010650373,0.000726679],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094093336,0.0005595982,0.01378193,0.00055282924,0.00008004679,0.0027724716,0.006035165,0.02019099,0.05207547,0.59910333,0.03163441,0.2722729],"study_design_scores_gemma":[0.00016580791,0.00076454645,0.0046937214,0.0003404033,0.00019015375,0.0031340634,0.0018671296,0.38853252,0.1495703,0.23297742,0.21748993,0.00027408707],"about_ca_topic_score_codex":0.0017657417,"about_ca_topic_score_gemma":0.0011962621,"teacher_disagreement_score":0.0027660287,"about_ca_system_score_codex":0.0010396002,"about_ca_system_score_gemma":0.0012420724,"threshold_uncertainty_score":0.011517644},"labels":[],"label_agreement":null},{"id":"W2004072132","doi":"10.1109/sitis.2014.61","title":"Private Video Streaming Service Using Leveled Somewhat Homomorphic Encryption","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Bootstrapping (finance); Scheme (mathematics); Client-side encryption; Computer security; Homomorphic secret sharing; Protocol (science); Computer network; On-the-fly encryption; Cryptography; Secure multi-party computation","score_opus":0.025277970263985476,"score_gpt":0.24216090272806717,"score_spread":0.2168829324640817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004072132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14775594,0.00073281076,0.8362816,0.0005669504,0.000103495004,0.00036753246,0.00025128922,0.0013173459,0.012622982],"genre_scores_gemma":[0.8856827,0.00039227385,0.10940199,0.0001217802,0.00006941394,0.000084745174,0.0002490125,0.00006436064,0.0039337776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877316,0.00028333525,0.00009872104,0.00014887919,0.00051380246,0.00018218182],"domain_scores_gemma":[0.9990758,0.00024795838,0.00010362807,0.00036806535,0.00014566648,0.00005890528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008947674,0.00036793473,0.0004703393,0.00048617684,0.00049216923,0.0012116197,0.00085793465,0.0007439903,0.0020198133],"category_scores_gemma":[0.0016079841,0.00019170328,0.00043000482,0.00058520323,0.00072624494,0.0038658874,0.0013376768,0.0009849543,0.0005077149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001892868,0.00057094905,0.0029602784,0.00071485253,0.00021334166,0.0018429135,0.0011641431,0.059098963,0.22060263,0.4742713,0.0054808366,0.23118694],"study_design_scores_gemma":[0.00031859087,0.00095239835,0.0017579593,0.000095077434,0.00014368632,0.0025406932,0.00034456118,0.66907084,0.17322533,0.12293071,0.028457345,0.000162883],"about_ca_topic_score_codex":0.00074500026,"about_ca_topic_score_gemma":0.00036105237,"teacher_disagreement_score":0.0020198133,"about_ca_system_score_codex":0.00076787313,"about_ca_system_score_gemma":0.00071385317,"threshold_uncertainty_score":0.0067569613},"labels":[],"label_agreement":null},{"id":"W2004941559","doi":"10.1145/2046556.2046565","title":"SPEcTRe","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Toll; Computer science; Computer security; Scheme (mathematics); Law enforcement; Electronic toll collection; Enforcement; Agency (philosophy); Suite; Internet privacy; Law","score_opus":0.03388235786818647,"score_gpt":0.1969283479712389,"score_spread":0.16304599010305243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004941559","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008691505,0.0024038956,0.21952632,0.0035183914,0.0021796722,0.0009327891,0.011626636,0.09190124,0.65921956],"genre_scores_gemma":[0.11057196,0.0024341901,0.10928071,0.0030069419,0.00056181726,0.0010016613,0.030806076,0.016316773,0.7260199],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858475,0.0002199688,0.000091104084,0.00027860043,0.00062168273,0.00020401433],"domain_scores_gemma":[0.99818677,0.00028004125,0.00007802242,0.00068334315,0.00057883636,0.00019296173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011332792,0.001068348,0.00077320583,0.0012741114,0.0013239156,0.0031676693,0.0024826876,0.002204256,0.2827558],"category_scores_gemma":[0.004574192,0.0008792191,0.0007535998,0.0008912269,0.00088343804,0.004505727,0.0037535925,0.0026837115,0.18380004],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006650068,0.0002472404,0.0013021071,0.0006889049,0.000057004996,0.00036301702,0.00033362178,0.0029082673,0.010370565,0.14517792,0.54830176,0.28958464],"study_design_scores_gemma":[0.00009067989,0.000094536896,0.0002976604,0.00008381578,0.000017025348,0.00045251605,0.00006049484,0.0058349683,0.0059572607,0.024231525,0.9628388,0.00004079587],"about_ca_topic_score_codex":0.00094971823,"about_ca_topic_score_gemma":0.001313976,"teacher_disagreement_score":0.2827558,"about_ca_system_score_codex":0.0010172068,"about_ca_system_score_gemma":0.0013648291,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2006052221","doi":"10.1002/sec.203","title":"A provably secure threshold signature scheme based on DDH assumption","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Signature (topology); Computer security; Schnorr signature; Provable security; Scheme (mathematics); Key (lock); Theoretical computer science; Cryptography; Ring signature; Public-key cryptography; Mathematics; Blind signature; Encryption","score_opus":0.006193508839327878,"score_gpt":0.22318018528329517,"score_spread":0.2169866764439673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006052221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16013083,0.0011876487,0.81380725,0.001981512,0.0005286136,0.0003507651,0.0005395508,0.0014006519,0.020073092],"genre_scores_gemma":[0.9197376,0.00042614335,0.07392552,0.00029177254,0.00017928999,0.00012773674,0.0002663903,0.00003799377,0.005007689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972933,0.0003800227,0.00032118984,0.00052237976,0.0011919535,0.00029111936],"domain_scores_gemma":[0.9975846,0.00059831777,0.0005002843,0.00067202194,0.00032907526,0.0003157294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014652496,0.00036590677,0.0011061566,0.0006762759,0.0011911001,0.0028176606,0.0015281796,0.0014648373,0.0026712804],"category_scores_gemma":[0.0029755812,0.00026171503,0.0008018719,0.0013866025,0.0017925219,0.0057104,0.00338553,0.0018483688,0.0006613863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009803358,0.00024307537,0.0012779838,0.0004216999,0.000089067515,0.00089973013,0.0007759977,0.021442935,0.059227463,0.84964526,0.004017223,0.06097919],"study_design_scores_gemma":[0.0006123351,0.0006489085,0.00069697475,0.00008151509,0.00012582228,0.0023499746,0.00020836346,0.27524677,0.056803346,0.62472874,0.03829691,0.00020039514],"about_ca_topic_score_codex":0.0003209371,"about_ca_topic_score_gemma":0.00013730816,"teacher_disagreement_score":0.0028176606,"about_ca_system_score_codex":0.0017409879,"about_ca_system_score_gemma":0.001631155,"threshold_uncertainty_score":0.012631834},"labels":[],"label_agreement":null},{"id":"W2008487746","doi":"10.1515/jmc.2007.003","title":"Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Binary number; Computer science; Boolean function; Theoretical computer science; Server; Boolean conjunctive query; Function (biology); Private information retrieval; Query optimization; Information retrieval; Mathematics; Algorithm; Sargable; Web search query; Search engine; Arithmetic; Computer security; Computer network","score_opus":0.023604472969428802,"score_gpt":0.29158145283883463,"score_spread":0.26797697986940583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008487746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05767754,0.0014901707,0.91466814,0.004010954,0.000116767995,0.00036594883,0.0003328991,0.0003873779,0.020950152],"genre_scores_gemma":[0.81969184,0.0037612778,0.1521088,0.0018823938,0.0010288721,0.0010960787,0.000805908,0.00045387394,0.01917104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883504,0.0037289509,0.0008289976,0.0016152941,0.0035431094,0.0019333073],"domain_scores_gemma":[0.96072215,0.029557263,0.00296095,0.004294636,0.0017388175,0.0007260882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010036803,0.0015625011,0.0024402367,0.0020813835,0.0031037647,0.006783513,0.0041292827,0.00503885,0.0116701415],"category_scores_gemma":[0.03296741,0.0015218817,0.004056281,0.0032626,0.006995125,0.031123579,0.005534057,0.010424214,0.0013961244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000136374,0.00008339127,0.00022952346,0.00015246416,0.000022815608,0.00009301017,0.00047240406,0.012727504,0.0011920162,0.9774864,0.00087526586,0.0065288665],"study_design_scores_gemma":[0.000070975184,0.0001158758,0.00029230717,0.0000540534,0.00006829986,0.0002569606,0.00014101794,0.1292528,0.0033827932,0.8617453,0.004550361,0.000069257694],"about_ca_topic_score_codex":0.0011687981,"about_ca_topic_score_gemma":0.00049244676,"teacher_disagreement_score":0.0116701415,"about_ca_system_score_codex":0.0048446003,"about_ca_system_score_gemma":0.0027964383,"threshold_uncertainty_score":0.05308026},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04324047064942231,"score_gpt":0.27921644252481265,"score_spread":0.23597597187539032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010302109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07404338,0.00065458403,0.9182714,0.00083292957,0.00017177076,0.00029593322,0.0001226633,0.0011161119,0.004491193],"genre_scores_gemma":[0.940041,0.0002733913,0.057420712,0.00013607918,0.0000831883,0.00009013374,0.00008190913,0.00004708825,0.0018266571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458873,0.0011504034,0.00039811208,0.0006560711,0.0024017466,0.00080495665],"domain_scores_gemma":[0.993658,0.001363903,0.00080689724,0.0029659413,0.00083375635,0.00037145065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027223728,0.00041404527,0.0010475867,0.0005381831,0.0014183992,0.0023386476,0.001355299,0.00082070485,0.0012422906],"category_scores_gemma":[0.006435687,0.00035819225,0.0007039855,0.00093895436,0.0017831739,0.0044599245,0.0026193536,0.0018938468,0.00037642536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020819383,0.0007058939,0.0053074444,0.00034955665,0.00017944153,0.0014619273,0.001372657,0.16826716,0.06474643,0.46308786,0.008919095,0.2835206],"study_design_scores_gemma":[0.00010884536,0.00012509042,0.00080843014,0.000030567615,0.00004748875,0.00045015832,0.00015809866,0.8885769,0.03136373,0.0719734,0.006296277,0.000060963797],"about_ca_topic_score_codex":0.0026318142,"about_ca_topic_score_gemma":0.0016286892,"teacher_disagreement_score":0.0027223728,"about_ca_system_score_codex":0.001934461,"about_ca_system_score_gemma":0.0035997066,"threshold_uncertainty_score":0.014397442},"labels":[],"label_agreement":null},{"id":"W2010620962","doi":"10.1016/j.jnca.2010.12.012","title":"A clique-based secure admission control scheme for mobile ad hoc networks (MANETs)","year":2010,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Vehicular ad hoc network; Session key; Node (physics); Certificate; Clique; Certificate authority; Authentication (law); Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Scheme (mathematics); Computer security; Wireless; Network packet; Public-key cryptography; Routing protocol; Theoretical computer science; Telecommunications","score_opus":0.005235174949070004,"score_gpt":0.23990895880888063,"score_spread":0.23467378385981064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010620962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08765345,0.0005678711,0.898615,0.0015304981,0.00046775994,0.00068440766,0.00040188525,0.0018259812,0.008253093],"genre_scores_gemma":[0.8546731,0.0003167468,0.13793097,0.00025776197,0.0001821486,0.00029412308,0.00033071547,0.000090241665,0.0059241564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814653,0.0005359167,0.0000795473,0.00030290478,0.00066333776,0.00027166866],"domain_scores_gemma":[0.9966529,0.001302357,0.00023865423,0.0007470591,0.0006176315,0.00044150004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017628042,0.0005846424,0.0013822028,0.0010017663,0.0027581404,0.0016364892,0.0031033885,0.0013833605,0.0030166998],"category_scores_gemma":[0.0044114306,0.00041313173,0.000685329,0.0017658964,0.0015273709,0.0025593936,0.0031135755,0.0020365296,0.00061494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036461928,0.0011781132,0.0016167302,0.00033968413,0.00025822615,0.00055293617,0.0009160414,0.348119,0.059011243,0.29831284,0.027366394,0.25868252],"study_design_scores_gemma":[0.00019589177,0.00026835816,0.0002346526,0.000013210512,0.000041834082,0.00013177238,0.000053408214,0.94677687,0.0041168286,0.04322881,0.004870989,0.00006738412],"about_ca_topic_score_codex":0.003953452,"about_ca_topic_score_gemma":0.0049707755,"teacher_disagreement_score":0.003953452,"about_ca_system_score_codex":0.0017093965,"about_ca_system_score_gemma":0.0026813655,"threshold_uncertainty_score":0.012402654},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; 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","score_opus":0.022469586704266114,"score_gpt":0.25687453657718473,"score_spread":0.23440494987291863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017126829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15840322,0.0005820496,0.8337997,0.0016018373,0.00007159164,0.00025623143,0.00019413487,0.00056038715,0.004530822],"genre_scores_gemma":[0.9497756,0.00018142494,0.047122087,0.00012784149,0.00004466953,0.00012130377,0.000087737055,0.000034006134,0.0025052105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410796,0.0020205476,0.00050448236,0.0005516417,0.001911093,0.0009043288],"domain_scores_gemma":[0.98671174,0.005943171,0.0016638925,0.004451552,0.00084401574,0.00038563515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055012857,0.00046290085,0.0012203134,0.0006556707,0.001365924,0.0027480074,0.0019435219,0.0016485404,0.0022170467],"category_scores_gemma":[0.010608464,0.0004987914,0.0009772442,0.0007999372,0.0025601387,0.006481495,0.0032405143,0.0021079057,0.00054970814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022456557,0.00033789256,0.002858405,0.00044607391,0.00017443101,0.0012959808,0.0014512407,0.19058934,0.062047653,0.67934763,0.0033389837,0.055866793],"study_design_scores_gemma":[0.00026690835,0.0002005733,0.00047653806,0.000042650834,0.00006557321,0.0004400612,0.00013135414,0.830726,0.026508277,0.13775802,0.003322124,0.00006189194],"about_ca_topic_score_codex":0.0011409965,"about_ca_topic_score_gemma":0.00092902867,"teacher_disagreement_score":0.0055012857,"about_ca_system_score_codex":0.002523339,"about_ca_system_score_gemma":0.003309661,"threshold_uncertainty_score":0.029093921},"labels":[],"label_agreement":null},{"id":"W2017161972","doi":"10.1007/s00607-013-0332-2","title":"Privacy preserving and transactional advertising for mobile services","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Encryption; Upload; Computer security; Scalability; Cryptography; Cloud computing; Context (archaeology); Server; Internet privacy; Homomorphic encryption; Client-side encryption; Transaction data; World Wide Web; Database transaction; Database; On-the-fly encryption","score_opus":0.008173638724672866,"score_gpt":0.24075835658924624,"score_spread":0.23258471786457338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017161972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1751975,0.002848646,0.7696937,0.0052439407,0.0004360752,0.00024127626,0.0005003827,0.0010017948,0.044836793],"genre_scores_gemma":[0.9483039,0.0007158128,0.037086334,0.00020280355,0.00028786916,0.00005102452,0.00016166626,0.00009345521,0.013097297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966125,0.0010727188,0.0002046371,0.0003916356,0.0011667485,0.00055180717],"domain_scores_gemma":[0.9922921,0.0029420399,0.0005235945,0.0032493349,0.00074343086,0.00024954352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002408552,0.0006053125,0.0010312889,0.0007608286,0.0018154659,0.0050081336,0.0015778781,0.0017245773,0.00521431],"category_scores_gemma":[0.010207526,0.00059078896,0.0008209892,0.0016395124,0.0023275,0.00868852,0.0018872819,0.0028303042,0.0011603638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094596983,0.00026236914,0.0011708828,0.000118588134,0.00004161946,0.00032580947,0.00041316453,0.03485534,0.0068166167,0.87363905,0.005686655,0.07572401],"study_design_scores_gemma":[0.000049461967,0.00013737667,0.000451375,0.000027140843,0.000041941654,0.000575378,0.00017158187,0.28257456,0.005865579,0.70092124,0.009147932,0.000036410707],"about_ca_topic_score_codex":0.0014126383,"about_ca_topic_score_gemma":0.0013526356,"teacher_disagreement_score":0.00521431,"about_ca_system_score_codex":0.0017771001,"about_ca_system_score_gemma":0.0017903049,"threshold_uncertainty_score":0.017443597},"labels":[],"label_agreement":null},{"id":"W2018256014","doi":"10.1145/1877972.1877989","title":"Further improvements on secret image sharing scheme","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Secret sharing; Image sharing; Image (mathematics); USable; Permutation (music); Theoretical computer science; Key (lock); Modulo; Homomorphic secret sharing; Cryptography; Similarity (geometry); Computer security; Artificial intelligence; Mathematics; Discrete mathematics; World Wide Web","score_opus":0.009479088790008059,"score_gpt":0.24657381084653376,"score_spread":0.2370947220565257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018256014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079054005,0.0023010455,0.8712156,0.0016982297,0.0008088248,0.0006574799,0.00035717888,0.0025295925,0.041378055],"genre_scores_gemma":[0.4477755,0.0021070002,0.5087066,0.00072964776,0.0005939033,0.00034016694,0.00085910776,0.00018124554,0.038706806],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830747,0.00030834338,0.00011561884,0.00024493018,0.00082361535,0.0001999239],"domain_scores_gemma":[0.99842036,0.00025661156,0.00009057092,0.00069964386,0.00046328476,0.00006961394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009744722,0.00097024353,0.0009120265,0.0010754772,0.0009045718,0.0007173342,0.0013655372,0.001297153,0.0077983956],"category_scores_gemma":[0.0025181188,0.0003025139,0.0013266179,0.001509443,0.0007969243,0.0038592222,0.0016997164,0.0018808193,0.0028792748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012409237,0.0005970219,0.0016338086,0.00088365236,0.00017297863,0.0010194324,0.0007873786,0.030888107,0.20323631,0.15214139,0.015066357,0.5923327],"study_design_scores_gemma":[0.00065508153,0.0014693175,0.0029142431,0.00018272261,0.0003995987,0.0075467387,0.00031604347,0.3450443,0.24406128,0.10377707,0.2932917,0.00034190866],"about_ca_topic_score_codex":0.0006868895,"about_ca_topic_score_gemma":0.00038935844,"teacher_disagreement_score":0.0077983956,"about_ca_system_score_codex":0.00058539986,"about_ca_system_score_gemma":0.00087326247,"threshold_uncertainty_score":0.026088238},"labels":[],"label_agreement":null},{"id":"W2019783136","doi":"10.1109/pst.2012.6297945","title":"DLAS: Data Location Assurance Service for cloud computing environments","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloud computing; Computer science; Verifiable secret sharing; Ciphertext; Computer security; Encryption; Service provider; Cryptography; Service (business); Protocol (science); Cryptographic protocol; Cryptographic primitive; Cloud server; Computer network; Distributed computing; Operating system; Business","score_opus":0.04532503526572994,"score_gpt":0.2809506046446797,"score_spread":0.23562556937894974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019783136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02509592,0.0011773434,0.9340209,0.0033060631,0.0005726969,0.00062006386,0.0008213815,0.019670568,0.014715103],"genre_scores_gemma":[0.7454487,0.0012335655,0.22841021,0.0017427295,0.0004664996,0.00037981872,0.002342649,0.00073696167,0.019238774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975879,0.0005635013,0.00021969056,0.00024497503,0.00097284024,0.00041105095],"domain_scores_gemma":[0.99772924,0.0002254356,0.00030365487,0.0008125591,0.00051741046,0.0004117444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013938998,0.0006399811,0.0008445808,0.000974319,0.0016146809,0.0029039972,0.0026992771,0.0014342777,0.0052097808],"category_scores_gemma":[0.0028614034,0.00029407995,0.00060443307,0.001240442,0.0011989977,0.004047995,0.004610918,0.002532578,0.003931049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023089077,0.00057309057,0.004300656,0.0010445447,0.00016890894,0.0015137133,0.001025464,0.024756758,0.067203715,0.4278325,0.096927926,0.37234372],"study_design_scores_gemma":[0.00047539672,0.00055238395,0.0016979318,0.00019546114,0.00013044108,0.0018114174,0.0007100455,0.38709432,0.084665336,0.07452828,0.44787464,0.00026427058],"about_ca_topic_score_codex":0.0028648586,"about_ca_topic_score_gemma":0.0017285517,"teacher_disagreement_score":0.0052097808,"about_ca_system_score_codex":0.0021038444,"about_ca_system_score_gemma":0.0022599096,"threshold_uncertainty_score":0.017428458},"labels":[],"label_agreement":null},{"id":"W2020427895","doi":"10.1016/j.jco.2004.01.002","title":"On the complexity of the discrete logarithm and Diffie–Hellman problems","year":2004,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Logarithm; Mathematics; Function (biology); Cryptography; Computational complexity theory; Discrete mathematics; Decision problem; Security parameter; Theoretical computer science; Computer science; Algorithm; Public-key cryptography; Encryption","score_opus":0.05587024331900451,"score_gpt":0.2560173765409879,"score_spread":0.20014713322198338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020427895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33985788,0.022799987,0.3197819,0.092516,0.0023183185,0.0003398084,0.0023686776,0.0004506872,0.21956679],"genre_scores_gemma":[0.9308529,0.0074735023,0.03665642,0.0018107663,0.003546727,0.00033865316,0.0012126901,0.00023142678,0.017876899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99132115,0.0029464297,0.00044109725,0.0008964174,0.0033763526,0.0010184541],"domain_scores_gemma":[0.90393656,0.08378069,0.003224745,0.00454902,0.002776245,0.0017327083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008008231,0.0013871493,0.003087698,0.0033085963,0.0033765484,0.010199234,0.0037123903,0.0035488296,0.010144858],"category_scores_gemma":[0.05480824,0.001355312,0.0019976916,0.0045881,0.008420973,0.0321498,0.006897189,0.010767342,0.00095811195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027707533,0.00012543467,0.00093840796,0.00016697396,0.000043090135,0.0001025211,0.0003255449,0.01705505,0.0002440608,0.9618513,0.006955036,0.011915521],"study_design_scores_gemma":[0.000039898303,0.000015503505,0.0002679311,0.000027988477,0.000014187266,0.00006538527,0.0000660285,0.036969475,0.00013488195,0.96051866,0.0018589734,0.000021170235],"about_ca_topic_score_codex":0.0028622837,"about_ca_topic_score_gemma":0.0018085876,"teacher_disagreement_score":0.010199234,"about_ca_system_score_codex":0.0073323827,"about_ca_system_score_gemma":0.0039973212,"threshold_uncertainty_score":0.053200424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05705607368771993,"score_gpt":0.2644413662822268,"score_spread":0.2073852925945069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022351540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029442484,0.0017173067,0.96092343,0.0010553178,0.0003400728,0.0008787542,0.00013047397,0.0018623739,0.0036496888],"genre_scores_gemma":[0.6500337,0.0014878751,0.3410255,0.00062915543,0.0003343268,0.00070797914,0.0002422337,0.00017718732,0.005361995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99645317,0.0007583706,0.00036765184,0.00037019575,0.0014552906,0.0005953538],"domain_scores_gemma":[0.99796534,0.00027499677,0.00034811287,0.0007734801,0.0003708297,0.00026730655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038403012,0.0006910807,0.0011034055,0.0016949567,0.0017487046,0.0026482416,0.0031485045,0.0017525202,0.0016529481],"category_scores_gemma":[0.0032923925,0.0006164182,0.0016071536,0.001505859,0.0019906813,0.0044135377,0.0048516793,0.002080327,0.0007488692],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010032477,0.0004203868,0.0045131594,0.0013177793,0.000312706,0.0017923496,0.0010174209,0.022545697,0.082857385,0.7004029,0.011783361,0.17203352],"study_design_scores_gemma":[0.00064994465,0.0011951617,0.002562724,0.00034063112,0.00036053927,0.004138678,0.00041486026,0.5220013,0.12126302,0.11697393,0.22965388,0.00044536946],"about_ca_topic_score_codex":0.00157704,"about_ca_topic_score_gemma":0.0009800942,"teacher_disagreement_score":0.0038403012,"about_ca_system_score_codex":0.0019288962,"about_ca_system_score_gemma":0.0028866122,"threshold_uncertainty_score":0.020309687},"labels":[],"label_agreement":null},{"id":"W2022594830","doi":"10.1007/s10796-011-9304-2","title":"Protecting privacy during peer-to-peer exchange of medical documents","year":2011,"lang":"en","type":"article","venue":"Information Systems Frontiers","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Peer-to-peer; Internet privacy; Computer science; Peer review; Computer security; World Wide Web; Law; Political science","score_opus":0.020833542549149802,"score_gpt":0.24710737595689505,"score_spread":0.22627383340774526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022594830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20755401,0.004409025,0.74414515,0.011634981,0.0013796513,0.0014725539,0.0009244273,0.0018889843,0.026591167],"genre_scores_gemma":[0.93543667,0.0010769597,0.055324886,0.00055743346,0.0006922442,0.00022701373,0.00042470457,0.00014467114,0.006115364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9778968,0.009307447,0.0017497776,0.0017765159,0.007617294,0.0016521658],"domain_scores_gemma":[0.92179924,0.038305618,0.0051071965,0.02932519,0.004067097,0.0013956652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0136121325,0.0006714375,0.0019509158,0.001358689,0.0030773368,0.0056181634,0.002446471,0.0053619994,0.002336982],"category_scores_gemma":[0.07181586,0.00073893997,0.0008460944,0.0015344679,0.00294301,0.009423422,0.0066762445,0.0032117728,0.0019729582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052752555,0.00061351806,0.010207623,0.0014200385,0.00077556394,0.011809143,0.014534037,0.047435466,0.09200655,0.3786576,0.023951793,0.4133134],"study_design_scores_gemma":[0.00041469178,0.0011122536,0.004731002,0.00043405645,0.0003931536,0.013978767,0.0035807681,0.22986652,0.12964348,0.54700893,0.06854494,0.0002913667],"about_ca_topic_score_codex":0.00055854087,"about_ca_topic_score_gemma":0.00033131463,"teacher_disagreement_score":0.0136121325,"about_ca_system_score_codex":0.00097020576,"about_ca_system_score_gemma":0.0028812494,"threshold_uncertainty_score":0.0719887},"labels":[],"label_agreement":null},{"id":"W2023005004","doi":"10.1515/jmc.2009.021","title":"An efficient identification protocol secure against concurrent-reset attacks","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reset (finance); Computer science; Identification (biology); Protocol (science); Simple (philosophy); Cryptographic protocol; Computer security; Theoretical computer science; Cryptography; Medicine","score_opus":0.016815841446691154,"score_gpt":0.3360632588257027,"score_spread":0.3192474173790115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023005004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09839407,0.0003296694,0.8839002,0.0011477193,0.00028796276,0.00043879313,0.0002091865,0.0016628039,0.013629686],"genre_scores_gemma":[0.8902461,0.0001758959,0.09982517,0.00034180353,0.000088534034,0.00035274876,0.00024235119,0.000112368194,0.008615107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99575067,0.0012434489,0.00034486892,0.0007598692,0.0014386316,0.00046243437],"domain_scores_gemma":[0.9943777,0.0015719329,0.00059391063,0.002539818,0.00059726863,0.00031937947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029433265,0.00061191915,0.0009650987,0.00065412064,0.0011485099,0.0023338865,0.002223353,0.0017102202,0.0035470156],"category_scores_gemma":[0.004828544,0.0004464658,0.0006149538,0.0008626272,0.0022217848,0.005384953,0.0059491936,0.002464207,0.0008739883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008022118,0.0004209678,0.0008256936,0.00030281756,0.0001250377,0.0009028056,0.0008627917,0.023573382,0.072258726,0.8503436,0.0042077117,0.045374256],"study_design_scores_gemma":[0.00060848985,0.0006499908,0.00080459117,0.00010609644,0.00019140144,0.0011423044,0.00026126418,0.49405125,0.14307047,0.3183376,0.04053711,0.00023939514],"about_ca_topic_score_codex":0.00022748127,"about_ca_topic_score_gemma":0.00015859114,"teacher_disagreement_score":0.0035470156,"about_ca_system_score_codex":0.0008420761,"about_ca_system_score_gemma":0.0012105445,"threshold_uncertainty_score":0.015565932},"labels":[],"label_agreement":null},{"id":"W2023580728","doi":"10.1016/j.ins.2014.02.001","title":"A note on “Selling multiple secrets to a single buyer”","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Communication source; Computer science; Scheme (mathematics); Protocol (science); Oblivious transfer; Theoretical computer science; Quadratic equation; Transfer (computing); Computer security; Cryptography; Mathematics; Computer network; Parallel computing","score_opus":0.025283122855442187,"score_gpt":0.26269705049440606,"score_spread":0.23741392763896388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023580728","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006021382,0.0057434356,0.013467798,0.74787754,0.06714934,0.0001659726,0.00032562166,0.00033245352,0.15891649],"genre_scores_gemma":[0.047411926,0.0023345673,0.0063965702,0.7850233,0.020934256,0.00027405407,0.00008961031,0.00019506038,0.1373408],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98097587,0.0036316982,0.0014769036,0.0033481894,0.008333806,0.002233558],"domain_scores_gemma":[0.97907066,0.014459241,0.0010679226,0.0018787363,0.00277339,0.00075010076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011012989,0.0016491062,0.001451008,0.0010371805,0.011007122,0.008581927,0.007092566,0.058102336,0.009697425],"category_scores_gemma":[0.04323935,0.0016856623,0.0030254351,0.0013548661,0.014642402,0.0140495645,0.0052757305,0.063747816,0.005263333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018214186,0.00006321599,0.0004247221,0.00015476013,0.00005935898,0.0013480517,0.0012327438,0.0003485525,0.0017990246,0.4083224,0.57741255,0.008652486],"study_design_scores_gemma":[0.00011050264,0.00014035235,0.0018997127,0.0007830074,0.00013408835,0.0007275141,0.00072392623,0.0010287162,0.002975896,0.15185058,0.8392949,0.00033086343],"about_ca_topic_score_codex":0.027551368,"about_ca_topic_score_gemma":0.054740816,"teacher_disagreement_score":0.058102336,"about_ca_system_score_codex":0.007184571,"about_ca_system_score_gemma":0.009464576,"threshold_uncertainty_score":0.058242917},"labels":[],"label_agreement":null},{"id":"W2024143599","doi":"10.1109/iccchina.2013.6671121","title":"PARK: A privacy-preserving aggregation scheme with adaptive key management for smart grid","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Smart grid; Computer science; Key management; Computer security; News aggregator; Key (lock); Data aggregator; Encryption; Revocation; Forward secrecy; Cryptography; Authentication (law); Public-key cryptography; Computer network; Wireless sensor network; Overhead (engineering); Engineering","score_opus":0.01632504431943029,"score_gpt":0.22184386712474957,"score_spread":0.20551882280531927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024143599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056334157,0.0009869421,0.9364856,0.0006745583,0.00016849954,0.0002815667,0.0001797667,0.0015075529,0.0033814649],"genre_scores_gemma":[0.8547783,0.00045452136,0.1398754,0.00023829064,0.000099485995,0.00020457772,0.00028523844,0.000045697507,0.0040184883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989711,0.000297911,0.00011025315,0.00016471911,0.00031078924,0.00014524133],"domain_scores_gemma":[0.99858606,0.00025975285,0.00026487903,0.00059079006,0.00019792205,0.00010062816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013183125,0.00040409472,0.0007849872,0.0005868812,0.00087531586,0.00083055213,0.0011372323,0.00074451376,0.0011599294],"category_scores_gemma":[0.002034666,0.00022507594,0.00054839585,0.0011000156,0.0007597404,0.0037571485,0.0025389038,0.0011901084,0.00043968382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020387762,0.00041643702,0.002638536,0.0005823784,0.00023385654,0.0010369205,0.0014309871,0.09984761,0.10794143,0.32721043,0.018351207,0.43827146],"study_design_scores_gemma":[0.00045729775,0.00083241315,0.0012779288,0.00005019591,0.00015416036,0.002067745,0.00027684384,0.7763094,0.04771571,0.11564818,0.054991703,0.00021848237],"about_ca_topic_score_codex":0.00049814687,"about_ca_topic_score_gemma":0.00042880749,"teacher_disagreement_score":0.0013183125,"about_ca_system_score_codex":0.0007333045,"about_ca_system_score_gemma":0.0010081202,"threshold_uncertainty_score":0.0069719553},"labels":[],"label_agreement":null},{"id":"W2026017982","doi":"10.1515/jmc-2013-5006","title":"Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Secrecy; Verifiable secret sharing; Access structure; Secure multi-party computation; Homomorphic secret sharing; Scheme (mathematics); Computer science; Property (philosophy); Robustness (evolution); Shamir's Secret Sharing; Mathematics; Set (abstract data type); Theoretical computer science; Cryptography; Computer security","score_opus":0.03649148341082455,"score_gpt":0.2945608209996092,"score_spread":0.25806933758878464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026017982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18132308,0.00019970418,0.80858046,0.0004608696,0.000058610774,0.00014760456,0.00032579992,0.00043180393,0.008472104],"genre_scores_gemma":[0.9564653,0.00007161721,0.041407242,0.000056406425,0.00002778078,0.000069913774,0.00010714087,0.000017018414,0.0017775554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765164,0.00047855265,0.00020884477,0.00036363894,0.0009381802,0.00035913583],"domain_scores_gemma":[0.99657744,0.0008802991,0.00078051415,0.0011894193,0.00032970036,0.00024263629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015784565,0.00031044177,0.0007170027,0.00048114292,0.0007512949,0.0015762142,0.0014403489,0.0009122737,0.002817922],"category_scores_gemma":[0.004184894,0.00022092253,0.00089443836,0.00061356195,0.0015180229,0.0039134626,0.003426452,0.0013675446,0.00048410834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007170611,0.00011234966,0.0008746693,0.00020502083,0.000096886375,0.00041660952,0.0005791637,0.05307187,0.061967395,0.8498637,0.0012141756,0.03088106],"study_design_scores_gemma":[0.00017863688,0.00044100787,0.00083995704,0.00005150633,0.00009295167,0.00087011897,0.00015428053,0.54562765,0.056485556,0.38706508,0.008066806,0.00012645332],"about_ca_topic_score_codex":0.0003453661,"about_ca_topic_score_gemma":0.00019429688,"teacher_disagreement_score":0.002817922,"about_ca_system_score_codex":0.0012616634,"about_ca_system_score_gemma":0.0010363591,"threshold_uncertainty_score":0.009426892},"labels":[],"label_agreement":null},{"id":"W2026183175","doi":"10.1002/sec.4","title":"Anonymous authentication and secure communication protocol for wireless mobile <i>ad hoc</i> networks","year":2008,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Anonymity; Computer network; Computer security; Node (physics); Wireless ad hoc network; Authentication (law); Mobile ad hoc network; Authentication protocol; Routing protocol; Cryptography; Robustness (evolution); Wireless; Routing (electronic design automation); Network packet; Telecommunications","score_opus":0.015193826817563994,"score_gpt":0.2638715906713702,"score_spread":0.24867776385380624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026183175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032616146,0.0006967516,0.95113766,0.0006701166,0.0003989899,0.0003351959,0.00007062472,0.0011473877,0.012927114],"genre_scores_gemma":[0.8520176,0.00054665294,0.13490868,0.00033904245,0.00021404441,0.0005435254,0.00020724777,0.00008820429,0.011134998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770606,0.0009453831,0.00017381374,0.00018801886,0.0007914033,0.00019534132],"domain_scores_gemma":[0.99747485,0.0006244317,0.0005006702,0.00049288716,0.00075572997,0.00015132989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014383469,0.00039623983,0.00043625705,0.0009114254,0.0011248677,0.001320091,0.00097435014,0.00084622094,0.0015668881],"category_scores_gemma":[0.003163094,0.00016965598,0.0004468752,0.00071494863,0.0012633415,0.0017226221,0.0016179373,0.0008751929,0.00064590067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008472164,0.00019499713,0.0012198641,0.00041885034,0.00012020852,0.0017884986,0.001731716,0.06891404,0.0654146,0.68097544,0.015208752,0.16316575],"study_design_scores_gemma":[0.00018151413,0.0008417713,0.0007195268,0.00011362049,0.00015006734,0.002259259,0.00036173867,0.7288987,0.046519063,0.12527068,0.09447465,0.00020947611],"about_ca_topic_score_codex":0.0005660097,"about_ca_topic_score_gemma":0.00033358586,"teacher_disagreement_score":0.0015668881,"about_ca_system_score_codex":0.00075377326,"about_ca_system_score_gemma":0.001125727,"threshold_uncertainty_score":0.0076068044},"labels":[],"label_agreement":null},{"id":"W2026847288","doi":"10.1007/s10207-006-0084-5","title":"Hierarchical time-based information release","year":2006,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Confidentiality; Computer science; Bidding; Encryption; Computer security; Cryptography; Business information; Information sensitivity; Business","score_opus":0.003301582137732803,"score_gpt":0.21648104891584094,"score_spread":0.21317946677810815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026847288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06293222,0.00078509236,0.9167892,0.00032977894,0.00028338074,0.00033583105,0.00035409216,0.0039963066,0.014194104],"genre_scores_gemma":[0.76568377,0.00047180135,0.21399756,0.00019619323,0.00018121993,0.00016085005,0.00064461684,0.000463504,0.018200476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959495,0.0007551589,0.00034179373,0.0005457279,0.0017476297,0.0006600868],"domain_scores_gemma":[0.98689497,0.0032619457,0.0010135471,0.0057116,0.0023567902,0.00076119084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028573724,0.0007340467,0.0012578748,0.0015857137,0.0013982115,0.0024290646,0.0021530709,0.00093823223,0.008291747],"category_scores_gemma":[0.009261719,0.00057470944,0.00083312596,0.0015191155,0.0012064162,0.0038369498,0.0034887102,0.0012750559,0.00256191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047051352,0.00068676576,0.00466641,0.00052694534,0.00021208849,0.00084030745,0.001103702,0.19645096,0.119633205,0.21100421,0.014296175,0.44587412],"study_design_scores_gemma":[0.00013518617,0.0008116029,0.0026166204,0.000055820114,0.00013873294,0.0006148847,0.00029900897,0.86609554,0.04528998,0.07008337,0.013721855,0.00013742836],"about_ca_topic_score_codex":0.0012048945,"about_ca_topic_score_gemma":0.0014173648,"teacher_disagreement_score":0.008291747,"about_ca_system_score_codex":0.00087258493,"about_ca_system_score_gemma":0.001509527,"threshold_uncertainty_score":0.02773869},"labels":[],"label_agreement":null},{"id":"W2027614277","doi":"10.1049/iet-ifs.2012.0032","title":"Oblivious decision program evaluation","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Theoretical computer science","score_opus":0.012081549980065179,"score_gpt":0.2749816545045415,"score_spread":0.2629001045244763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027614277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017016536,0.00011907954,0.97519976,0.00062516093,0.000042022606,0.00026941174,0.00006990485,0.00049843366,0.0061596553],"genre_scores_gemma":[0.6263516,0.00029130702,0.3578091,0.0005324724,0.00008135701,0.0008777185,0.00030344032,0.00020892943,0.013543996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931536,0.0030948352,0.00031283058,0.0009796222,0.001543846,0.00091531675],"domain_scores_gemma":[0.988414,0.0073869075,0.00078493636,0.0023907826,0.00073121424,0.0002921463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047834893,0.0007419865,0.0010724349,0.0006754996,0.0010768449,0.0021574702,0.0031827453,0.0016100178,0.006088659],"category_scores_gemma":[0.014172958,0.0006425667,0.0011630651,0.0006797283,0.002683699,0.0062888023,0.0041597625,0.0034173378,0.0010081106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055898994,0.00031887775,0.00087740953,0.00033103995,0.00010209997,0.00016270358,0.0007195838,0.09571414,0.0068495744,0.80970955,0.0042771823,0.08037884],"study_design_scores_gemma":[0.00012656127,0.00018696407,0.00018481797,0.000047000725,0.00004502952,0.00016007999,0.00011489658,0.5646062,0.016578134,0.40609658,0.011811523,0.00004223972],"about_ca_topic_score_codex":0.000562027,"about_ca_topic_score_gemma":0.0005364615,"teacher_disagreement_score":0.006088659,"about_ca_system_score_codex":0.002242071,"about_ca_system_score_gemma":0.00242612,"threshold_uncertainty_score":0.02529782},"labels":[],"label_agreement":null},{"id":"W2030112834","doi":"10.1007/s00200-005-0184-x","title":"On the bit security of the Diffie-Hellman key","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Diffie–Hellman key exchange; Prime (order theory); Mathematics; Function (biology); Elliptic curve; Bit (key); Discrete mathematics; Key (lock); Finite field; Arithmetic; Theoretical computer science; Computer science; Key exchange; Combinatorics; Public-key cryptography; Computer security; Pure mathematics; Encryption","score_opus":0.005165420690599298,"score_gpt":0.19354821002785624,"score_spread":0.18838278933725694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030112834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11143581,0.0071841236,0.6569556,0.016700923,0.0022864195,0.00017638424,0.0010715353,0.0003547602,0.2038345],"genre_scores_gemma":[0.88048327,0.006915194,0.07440565,0.0031862175,0.002325298,0.00034192821,0.00073751056,0.00035456748,0.03125027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997214,0.0010507611,0.00017973899,0.0003033525,0.0008265652,0.00042563473],"domain_scores_gemma":[0.99431,0.003630327,0.00023843383,0.0009675426,0.000617611,0.00023590963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043569924,0.001014051,0.0013677967,0.002037784,0.0025999781,0.0039751576,0.0015945649,0.002250321,0.0068056816],"category_scores_gemma":[0.009990543,0.00058939075,0.0010230123,0.0023033998,0.0071525723,0.015544787,0.0041242875,0.0058772066,0.002368411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040369956,0.0000068721165,0.000025928619,0.000015559359,0.0000031005613,0.000018092634,0.00006200668,0.0006701235,0.00027198845,0.996058,0.0008536736,0.001974291],"study_design_scores_gemma":[0.0000063954417,0.0000044726007,0.000016121623,0.000008529236,0.0000023396979,0.000013542379,0.00000925109,0.0022982056,0.00016359572,0.99601185,0.0014590155,0.0000066488124],"about_ca_topic_score_codex":0.0010541882,"about_ca_topic_score_gemma":0.000455503,"teacher_disagreement_score":0.0068056816,"about_ca_system_score_codex":0.0019360192,"about_ca_system_score_gemma":0.001480965,"threshold_uncertainty_score":0.023042262},"labels":[],"label_agreement":null},{"id":"W2030480083","doi":"10.1007/s00145-014-9194-9","title":"Limits on the Usefulness of Random Oracles","year":2014,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Israeli Centers for Research Excellence; Azrieli Foundation; Israel Science Foundation; Bar-Ilan University","keywords":"Impossibility; Random oracle; Oracle; Computer science; Key (lock); Black box; Protocol (science); Theoretical computer science; Product (mathematics); Computer security; Public-key cryptography; Mathematics; Encryption; Artificial intelligence; Programming language","score_opus":0.02843023898195536,"score_gpt":0.24745341478355445,"score_spread":0.21902317580159908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030480083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29594105,0.027074318,0.45859542,0.042869866,0.0008292562,0.00022694701,0.0010952374,0.0026634268,0.17070447],"genre_scores_gemma":[0.9678092,0.00485912,0.017574046,0.0013114314,0.0017562116,0.00019731406,0.00019121106,0.0005775231,0.005723955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9561275,0.021982897,0.0022624638,0.0040525924,0.011665235,0.0039092633],"domain_scores_gemma":[0.29401338,0.63448757,0.0076267924,0.048790853,0.01018228,0.0048990506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04595279,0.0020377522,0.0039975774,0.007068054,0.0021036472,0.012542481,0.0066635637,0.008084119,0.009737061],"category_scores_gemma":[0.29776475,0.002499715,0.002078083,0.0037376601,0.014070221,0.04050466,0.01179396,0.012392022,0.0025070095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010666037,0.00014811766,0.0014009415,0.00043325435,0.000076521894,0.00025493244,0.00062451453,0.014949249,0.0021442603,0.94499433,0.003164712,0.03074255],"study_design_scores_gemma":[0.00014640595,0.0001659666,0.0006013764,0.00031462385,0.00008275289,0.000686358,0.00010565719,0.07811643,0.0023855255,0.9133359,0.0039851726,0.00007375849],"about_ca_topic_score_codex":0.00039959955,"about_ca_topic_score_gemma":0.0002327707,"teacher_disagreement_score":0.04595279,"about_ca_system_score_codex":0.0024093427,"about_ca_system_score_gemma":0.0020347163,"threshold_uncertainty_score":0.24302447},"labels":[],"label_agreement":null},{"id":"W2031081173","doi":"10.1142/s1793830911001218","title":"ON \"THE POWER OF VERIFICATION QUERIES\" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Adversary; Oracle; Computer security; Random oracle; Authentication (law); Adversary model; Message authentication code; Theoretical computer science; Public-key cryptography; Cryptography; Encryption; Programming language","score_opus":0.017666047169443325,"score_gpt":0.23920205292428304,"score_spread":0.22153600575483973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031081173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11993312,0.0013326822,0.8372766,0.007193133,0.0002763551,0.0002205513,0.00016504295,0.00031462565,0.033287887],"genre_scores_gemma":[0.95159113,0.00093132246,0.040901087,0.0008764582,0.00040446027,0.00017949648,0.0000728745,0.00010981989,0.0049333745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9818413,0.010287655,0.000662934,0.0013948117,0.003449954,0.002363204],"domain_scores_gemma":[0.9122926,0.075478494,0.0032455507,0.005028298,0.0026120997,0.0013429788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012780348,0.0015054445,0.0016244721,0.0016700434,0.0023684911,0.005044519,0.0028779376,0.004030014,0.004264017],"category_scores_gemma":[0.04947172,0.00082562293,0.0019038002,0.0018526113,0.017143447,0.024461683,0.0068360427,0.0070805075,0.00065344205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016567872,0.000040417308,0.0003722904,0.000051364288,0.000016468084,0.000102873724,0.00030483998,0.02091948,0.0006384905,0.9715066,0.00066351297,0.005217971],"study_design_scores_gemma":[0.0000512469,0.00009986916,0.000108475615,0.000034402325,0.000024362957,0.000090880756,0.00008033472,0.19337817,0.0009035714,0.8039253,0.001269171,0.000034270688],"about_ca_topic_score_codex":0.0021854371,"about_ca_topic_score_gemma":0.0010592287,"teacher_disagreement_score":0.012780348,"about_ca_system_score_codex":0.0039641187,"about_ca_system_score_gemma":0.003007644,"threshold_uncertainty_score":0.06758976},"labels":[],"label_agreement":null},{"id":"W2033966971","doi":"10.1007/s00145-002-0146-4","title":"Oblivious Transfers and Privacy Amplification","year":2003,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication source; Oblivious transfer; Computer science; String (physics); Constraint (computer-aided design); Theoretical computer science; Task (project management); Cryptography; Algorithm; Mathematics; Computer network","score_opus":0.011605461127241784,"score_gpt":0.23816549144257557,"score_spread":0.22656003031533378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033966971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15801996,0.0016367107,0.6794756,0.015263007,0.00049935456,0.00032439557,0.00038826696,0.0016367771,0.14275602],"genre_scores_gemma":[0.9452035,0.0006274146,0.018743915,0.0007564566,0.00032230443,0.00020682935,0.00010186708,0.00024103992,0.033796676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934581,0.0025246746,0.0002643865,0.0007069715,0.001798455,0.0012475004],"domain_scores_gemma":[0.97255,0.018818354,0.0012659912,0.0060672355,0.00084431143,0.00045402447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040364,0.0011795262,0.0014953684,0.0018531176,0.0030932762,0.0050363047,0.0023692844,0.003449956,0.01258797],"category_scores_gemma":[0.023465302,0.0015010772,0.0016481228,0.002648447,0.009637493,0.017932873,0.008395835,0.007682215,0.0021528578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023216926,0.000046266894,0.00014628662,0.000044355853,0.000015986438,0.00010622755,0.00031840176,0.00629859,0.00091459753,0.98218393,0.0016562304,0.008036984],"study_design_scores_gemma":[0.000019966263,0.000011025271,0.000031935466,0.000009819593,0.000012798787,0.00009409201,0.000030092891,0.012084522,0.0015224868,0.98484856,0.0013234932,0.000011191186],"about_ca_topic_score_codex":0.00047038254,"about_ca_topic_score_gemma":0.00030967675,"teacher_disagreement_score":0.01258797,"about_ca_system_score_codex":0.0027676313,"about_ca_system_score_gemma":0.002029422,"threshold_uncertainty_score":0.04211092},"labels":[],"label_agreement":null},{"id":"W2034720960","doi":"10.1016/j.ins.2010.07.029","title":"Secret sharing schemes from binary linear codes","year":2010,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Secret sharing; Access structure; Computer science; Construct (python library); Theoretical computer science; Scheme (mathematics); Binary number; Code (set theory); Linear code; Homomorphic secret sharing; Set (abstract data type); Verifiable secret sharing; Mathematics; Algorithm; Block code; Cryptography; Decoding methods; Arithmetic; Computer network","score_opus":0.020688336336760427,"score_gpt":0.2764213697364868,"score_spread":0.25573303339972636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034720960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124373734,0.0039548543,0.80401605,0.004436071,0.00080668676,0.00050777144,0.00074833643,0.0009678173,0.06018873],"genre_scores_gemma":[0.8958958,0.002184822,0.07949712,0.00079908315,0.0004475908,0.00045400026,0.00047085632,0.00014631532,0.02010448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973757,0.00079842145,0.00014269615,0.00022922961,0.0010858038,0.00036819564],"domain_scores_gemma":[0.99534696,0.0024122267,0.0005339892,0.0011731788,0.0003455126,0.00018812732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016471589,0.00081079936,0.0010347837,0.0013971339,0.0012308981,0.0023462109,0.0010751524,0.0023277104,0.006203546],"category_scores_gemma":[0.007642886,0.00062518724,0.0007583661,0.0024070172,0.0019170992,0.004327629,0.0048510022,0.0026171124,0.0017346761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005211197,0.000071180235,0.00022105573,0.00032919136,0.000043241642,0.0001373847,0.00033982293,0.020076314,0.012612199,0.91627127,0.00291252,0.046464674],"study_design_scores_gemma":[0.00021204814,0.00016360561,0.00024109411,0.00017810952,0.000042169257,0.00039426752,0.0000489101,0.08451245,0.017115425,0.8841591,0.0128461085,0.000086627915],"about_ca_topic_score_codex":0.00024738378,"about_ca_topic_score_gemma":0.00021217708,"teacher_disagreement_score":0.006203546,"about_ca_system_score_codex":0.0013998402,"about_ca_system_score_gemma":0.0012821124,"threshold_uncertainty_score":0.020752907},"labels":[],"label_agreement":null},{"id":"W2035912926","doi":"10.1007/s001459910005","title":"Randomness versus Fault-Tolerance","year":2000,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Correctness; Fault tolerance; Computer science; Resilience (materials science); Upper and lower bounds; Function (biology); Polynomial; Protocol (science); State (computer science); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Distributed computing; Statistics; Physics","score_opus":0.012348127025442855,"score_gpt":0.26056062724421264,"score_spread":0.24821250021876978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035912926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19984356,0.02041864,0.6018415,0.048558023,0.0039878082,0.00014609001,0.00027532177,0.0011835318,0.12374559],"genre_scores_gemma":[0.9671942,0.0019188862,0.017961392,0.0012525788,0.0015976877,0.00007075697,0.000054630516,0.00014367126,0.009806218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963741,0.001435603,0.00020912207,0.0005194768,0.0010356564,0.00042604588],"domain_scores_gemma":[0.9680815,0.020428775,0.0017342529,0.007860593,0.0012378648,0.00065704645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036631948,0.00058500306,0.0012971702,0.0012976051,0.0014887204,0.0039367685,0.001611784,0.0035233381,0.005691571],"category_scores_gemma":[0.022282476,0.00046003502,0.0006123167,0.001347979,0.009488245,0.014896116,0.002876188,0.0049523613,0.0009937694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012524547,0.000017234766,0.00027895332,0.00006294279,0.0000138747255,0.000048233873,0.00012217091,0.0053302934,0.0004403271,0.97722673,0.0014937861,0.0148402285],"study_design_scores_gemma":[0.000029682426,0.00006876996,0.000100322366,0.00003411663,0.000020442285,0.00017976786,0.00006695727,0.007997344,0.0011712023,0.98392767,0.00638703,0.00001675393],"about_ca_topic_score_codex":0.00016660496,"about_ca_topic_score_gemma":0.00011776447,"teacher_disagreement_score":0.005691571,"about_ca_system_score_codex":0.0011705189,"about_ca_system_score_gemma":0.0008071209,"threshold_uncertainty_score":0.01937306},"labels":[],"label_agreement":null},{"id":"W2036733778","doi":"10.1145/2752952.2752965","title":"SecLoc","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cloud computing; Computer science; Computer security; Cloud storage; Flexibility (engineering); Scalability; Cloud computing security; Overhead (engineering); Reliability (semiconductor); Information privacy; Security analysis; Access control; Data security; Data Protection Act 1998; Data integrity; Computer data storage; Database; Encryption","score_opus":0.03923895487923124,"score_gpt":0.24544616155156201,"score_spread":0.20620720667233078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036733778","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05198669,0.0017900976,0.62885374,0.003362947,0.0016224536,0.0019682078,0.006178809,0.14246403,0.16177309],"genre_scores_gemma":[0.57821375,0.0016644384,0.19950135,0.0034354248,0.00075334165,0.0011956774,0.018227236,0.008055955,0.18895288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997233,0.0005444875,0.00028454122,0.00049927924,0.0010189872,0.0004195819],"domain_scores_gemma":[0.991223,0.0009861252,0.0006214528,0.005454152,0.0013852364,0.0003300514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023210403,0.0009794888,0.00095947395,0.001355858,0.0013959894,0.00318911,0.002061505,0.0014484305,0.042871162],"category_scores_gemma":[0.0064092483,0.0006205477,0.0007414504,0.0013512379,0.0013179504,0.006175441,0.0054134326,0.0016911767,0.031107277],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002921306,0.0006002651,0.0075340862,0.0008097882,0.0001506703,0.0008065134,0.0008564928,0.008431099,0.024001386,0.24713993,0.28216764,0.42458087],"study_design_scores_gemma":[0.00027758154,0.00061183656,0.002084327,0.00019424109,0.000080771046,0.0022845466,0.00035741364,0.13227807,0.05347009,0.07073444,0.73745376,0.0001729421],"about_ca_topic_score_codex":0.00068340794,"about_ca_topic_score_gemma":0.00064921234,"teacher_disagreement_score":0.042871162,"about_ca_system_score_codex":0.0011476629,"about_ca_system_score_gemma":0.0019549606,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2037126171","doi":"10.1515/jmc.2007.010","title":"An efficient and secure two-flow zero-knowledge identification protocol","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero-knowledge proof; Identification (biology); Computer science; Protocol (science); Flow (mathematics); Zero (linguistics); Knowledge flow; Theoretical computer science; Cryptography; Computer security; Mathematics; Medicine; Knowledge management; Philosophy; Biology","score_opus":0.015423903347543066,"score_gpt":0.3342108138883982,"score_spread":0.3187869105408551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037126171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0243603,0.00022335665,0.9692965,0.00045598572,0.0001474087,0.00022861415,0.00008334781,0.0007759411,0.0044285543],"genre_scores_gemma":[0.50594264,0.0005266379,0.4801224,0.00033947252,0.00014172171,0.0006928,0.0004149498,0.0001359352,0.011683483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798846,0.00045518044,0.0001454892,0.00037137783,0.00082183885,0.00021758293],"domain_scores_gemma":[0.9982223,0.0005060777,0.00021007498,0.00062827795,0.00029838263,0.0001350208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018208545,0.000576359,0.00090810936,0.00067788287,0.0011323462,0.0016848954,0.0018906109,0.0014608254,0.002108012],"category_scores_gemma":[0.0024425827,0.00041480732,0.00053361326,0.00071395043,0.001662534,0.0060009696,0.0035927815,0.0025383232,0.0007828522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007570756,0.00059295015,0.0009357591,0.0006076414,0.0000992802,0.0009092145,0.001101527,0.036249522,0.081530616,0.691883,0.006128723,0.17920463],"study_design_scores_gemma":[0.000530349,0.0006952168,0.00076481444,0.000105598396,0.00019015382,0.0016950148,0.00030997075,0.5528022,0.1388963,0.23947431,0.06419995,0.00033605474],"about_ca_topic_score_codex":0.00026912766,"about_ca_topic_score_gemma":0.00015533227,"teacher_disagreement_score":0.002108012,"about_ca_system_score_codex":0.0006534692,"about_ca_system_score_gemma":0.0017797286,"threshold_uncertainty_score":0.009629667},"labels":[],"label_agreement":null},{"id":"W2037996563","doi":"10.1109/iccsn.2011.6014024","title":"A new cryptography scheme for selective broadcasting","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Broadcast encryption; Computer science; Ciphertext; Encryption; Computer network; Node (physics); Cryptography; Broadcasting (networking); Scheme (mathematics); Public-key cryptography; Key (lock); Collusion; Overhead (engineering); Computer security; Mathematics; Engineering","score_opus":0.04296495691730081,"score_gpt":0.2440254182285409,"score_spread":0.20106046131124009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037996563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02734104,0.0020829863,0.94591767,0.0014626735,0.0007737026,0.00042749173,0.00022009185,0.00079450116,0.020979809],"genre_scores_gemma":[0.46454298,0.002349594,0.49717435,0.000995695,0.0007821302,0.0006169359,0.0004929654,0.00017580159,0.032869462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975936,0.0004295599,0.00020558809,0.000331115,0.0011213383,0.00031877655],"domain_scores_gemma":[0.9971699,0.00050559046,0.00042760375,0.0010551378,0.00058899407,0.0002527515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015929973,0.0006181078,0.0009498382,0.0011354845,0.0016878181,0.0016532808,0.0016892732,0.0015010358,0.0038421461],"category_scores_gemma":[0.002642975,0.00043617678,0.0007378243,0.0014455313,0.0013964954,0.0061393515,0.003130641,0.002433501,0.001749862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007582801,0.00021016276,0.0007359504,0.0005951275,0.000096146956,0.00072571344,0.00095983985,0.012443208,0.13735974,0.6632797,0.012377979,0.17045811],"study_design_scores_gemma":[0.0009164868,0.0012878543,0.0011046772,0.00027334716,0.00030772458,0.006677782,0.0003830969,0.22483523,0.15576641,0.2476961,0.3602821,0.0004692179],"about_ca_topic_score_codex":0.0005047031,"about_ca_topic_score_gemma":0.00044210826,"teacher_disagreement_score":0.0038421461,"about_ca_system_score_codex":0.0014490286,"about_ca_system_score_gemma":0.0016592069,"threshold_uncertainty_score":0.012853265},"labels":[],"label_agreement":null},{"id":"W2040765034","doi":"10.1007/s10623-009-9342-7","title":"NTRU over rings beyond $${\\mathbb{Z}}$$","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"NTRU; Cryptosystem; Lattice (music); Eisenstein integer; Mathematics; Lattice problem; Discrete mathematics; Pure mathematics; Combinatorics; Physics; Cryptography; Algorithm; Algebraic number; Mathematical analysis","score_opus":0.011912492673488161,"score_gpt":0.23611152333174534,"score_spread":0.2241990306582572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040765034","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14999674,0.0022790493,0.29846475,0.0030184146,0.002239689,0.00015490824,0.0011991902,0.0031260601,0.5395212],"genre_scores_gemma":[0.80928606,0.00088722736,0.048658654,0.00096599665,0.00083484285,0.00015254028,0.00050250953,0.00076731446,0.13794477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867356,0.0003595529,0.000071281494,0.00021641424,0.00038263682,0.00029658282],"domain_scores_gemma":[0.9988881,0.0002853867,0.00014252434,0.0003179049,0.00023757489,0.00012855008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208461,0.0007478341,0.00079704926,0.0010269202,0.0015280837,0.0029805086,0.00078168896,0.0007259895,0.02430453],"category_scores_gemma":[0.0026497862,0.00031055513,0.00047445385,0.0007395662,0.0015735592,0.0040520513,0.0021654158,0.0018724325,0.00882065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000222304,0.000041745076,0.00014324296,0.00008879902,0.000008611248,0.0000800457,0.00011899371,0.0007053924,0.0027667382,0.95819354,0.0066517987,0.03097874],"study_design_scores_gemma":[0.00005212073,0.00015332933,0.00032856135,0.00012553413,0.000041629435,0.00054867566,0.00007885435,0.008966606,0.018468987,0.88387513,0.08730005,0.000060630406],"about_ca_topic_score_codex":0.0005454266,"about_ca_topic_score_gemma":0.00053983636,"teacher_disagreement_score":0.02430453,"about_ca_system_score_codex":0.001094302,"about_ca_system_score_gemma":0.0006850763,"threshold_uncertainty_score":0.081306756},"labels":[],"label_agreement":null},{"id":"W2041780131","doi":"10.1515/jmc.2010.003","title":"Common modulus attacks on small private exponent RSA and some fast variants (in practice)","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exponent; Cryptography; Modulus; Cryptanalysis; Mathematics; Computer science; Computer security; Arithmetic; Philosophy","score_opus":0.017956054032233937,"score_gpt":0.28069872628965564,"score_spread":0.2627426722574217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041780131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81775534,0.0012520535,0.16205013,0.0016231263,0.00015162314,0.00026214926,0.00024809001,0.0010168072,0.01564075],"genre_scores_gemma":[0.9690514,0.00023780858,0.029013708,0.0000799907,0.0000691908,0.000058785572,0.00012314283,0.000047707264,0.001318151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528533,0.0012338656,0.0003212014,0.0007906623,0.0016324223,0.00073646154],"domain_scores_gemma":[0.9853748,0.0057862396,0.0013351401,0.006578772,0.00060555385,0.00031952336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030878054,0.00073288183,0.0009573737,0.0009782577,0.0012986097,0.0015525263,0.0013751857,0.0013764153,0.0025835766],"category_scores_gemma":[0.012026882,0.0004121772,0.0012731138,0.0010993242,0.0026921302,0.006875323,0.0033380159,0.0025405055,0.0005369239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049839723,0.00061583554,0.035412744,0.0005674531,0.00052361446,0.0025193538,0.0026262498,0.19173317,0.09728121,0.3950355,0.011199258,0.2575016],"study_design_scores_gemma":[0.0006613961,0.0016530677,0.007277554,0.00016408174,0.00021637112,0.004216026,0.00070740277,0.65879816,0.07533916,0.2217276,0.029028887,0.00021025779],"about_ca_topic_score_codex":0.0009300347,"about_ca_topic_score_gemma":0.00094247767,"teacher_disagreement_score":0.0030878054,"about_ca_system_score_codex":0.0011993988,"about_ca_system_score_gemma":0.0007963713,"threshold_uncertainty_score":0.016330063},"labels":[],"label_agreement":null},{"id":"W2042561020","doi":"10.1109/glocom.2013.6831145","title":"SPS: Secure personal health information sharing with patient-centric access control in cloud computing","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Access control; Cloud computing; Encryption; Computer security; Cryptography; eHealth; Cloud storage; Health care; Operating system","score_opus":0.009432048485541486,"score_gpt":0.2329287179912631,"score_spread":0.2234966695057216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042561020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05729043,0.00062158756,0.93368024,0.00091371906,0.0001508618,0.0003981098,0.00014732803,0.0009843352,0.0058134543],"genre_scores_gemma":[0.90075547,0.00030902444,0.09557424,0.00025190087,0.00011307595,0.00015912844,0.0001659437,0.00003163843,0.002639629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964228,0.0009810611,0.00022702829,0.00043416696,0.0014207995,0.00051418925],"domain_scores_gemma":[0.9977254,0.00031659298,0.00031004255,0.0010239453,0.00034758868,0.00027646933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020741087,0.00038393872,0.00083907525,0.0005302691,0.0010985929,0.0014000062,0.0018647193,0.0007405759,0.0014996985],"category_scores_gemma":[0.0020994074,0.0002020431,0.00073004613,0.0010936378,0.0013271328,0.0029615446,0.0038533884,0.0010863396,0.00052288704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018905489,0.00062853424,0.005521025,0.00048414618,0.00030097767,0.001440086,0.0011209457,0.10175493,0.07018331,0.42914876,0.014365996,0.37316066],"study_design_scores_gemma":[0.00018078835,0.00058457564,0.0019444812,0.00005819055,0.00009292477,0.0019026734,0.0003524622,0.8333919,0.036948603,0.09422135,0.030211076,0.000111022135],"about_ca_topic_score_codex":0.0014322209,"about_ca_topic_score_gemma":0.0007351069,"teacher_disagreement_score":0.0020741087,"about_ca_system_score_codex":0.0010386142,"about_ca_system_score_gemma":0.0020462058,"threshold_uncertainty_score":0.010969043},"labels":[],"label_agreement":null},{"id":"W2043576441","doi":"10.1109/icsmc.2006.384776","title":"Privacy-Oriented Collaborative Learning Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Construct (python library); Protocol (science); Secure multi-party computation; Kernel (algebra); Support vector machine; Theoretical computer science; Set (abstract data type); Polynomial; Computer security; Information privacy; Computation; Data sharing; Artificial intelligence; Cryptography; Computer network; Algorithm; Mathematics","score_opus":0.004930448301212233,"score_gpt":0.21073273994444394,"score_spread":0.20580229164323172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043576441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011021262,0.00033657503,0.97614914,0.0015583925,0.000096648284,0.00017684406,0.00010486901,0.0004982152,0.010058005],"genre_scores_gemma":[0.79214615,0.0007586181,0.18911767,0.0008142441,0.00034245537,0.00048390805,0.00037617315,0.00010714658,0.01585369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869409,0.0052225576,0.0007410422,0.0021946924,0.0038166435,0.0010840989],"domain_scores_gemma":[0.97618484,0.010154244,0.0018359555,0.008980783,0.0018679148,0.00097636913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010881152,0.00095884886,0.0015088373,0.0010577136,0.0024845162,0.004619869,0.0043428107,0.004024978,0.005402814],"category_scores_gemma":[0.020764437,0.00068790524,0.00089023774,0.0017664353,0.0031562857,0.0092719635,0.011014666,0.0030749852,0.001982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005298117,0.00036694016,0.0012369837,0.00022910477,0.00017920289,0.00051500206,0.0007803083,0.19520435,0.0030040664,0.6421921,0.00794191,0.14782025],"study_design_scores_gemma":[0.00012279951,0.000112162976,0.00014911279,0.000026925869,0.000033423894,0.0002256295,0.00010722884,0.51356226,0.002507207,0.47025254,0.012866698,0.000034006403],"about_ca_topic_score_codex":0.0010038328,"about_ca_topic_score_gemma":0.0006626959,"teacher_disagreement_score":0.010881152,"about_ca_system_score_codex":0.0014195497,"about_ca_system_score_gemma":0.0023245777,"threshold_uncertainty_score":0.05754572},"labels":[],"label_agreement":null},{"id":"W2044603066","doi":"10.1007/s00493-005-0014-6","title":"Lower Bounds For Concurrent Zero Knowledge*","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Zero-knowledge proof; Asynchronous communication; Zero (linguistics); Argument (complex analysis); Mathematics; Class (philosophy); Discrete mathematics; Theoretical computer science; Computer science; Artificial intelligence; Computer network","score_opus":0.018413443628149253,"score_gpt":0.27931495785124527,"score_spread":0.26090151422309604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044603066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06164723,0.006772775,0.71920025,0.019799285,0.001303672,0.00045121484,0.0025638074,0.002603916,0.18565774],"genre_scores_gemma":[0.8069646,0.0062771337,0.12121219,0.004382572,0.0037332182,0.0013214655,0.002886054,0.0020613624,0.05116141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9819759,0.0035780082,0.0007621195,0.003063287,0.005470686,0.0051500225],"domain_scores_gemma":[0.831974,0.13208063,0.0047585354,0.018723056,0.0068536107,0.0056101712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0123704765,0.004706194,0.0048253667,0.0061481856,0.007520476,0.019237543,0.01227305,0.0060222317,0.0328567],"category_scores_gemma":[0.080674514,0.003119605,0.0041294023,0.008626539,0.010896396,0.045594223,0.018807124,0.020436695,0.006614635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066438795,0.0002579353,0.0009255739,0.00053311297,0.0000967931,0.00013472627,0.00050026935,0.018561108,0.0012117348,0.9408731,0.0122899525,0.023951337],"study_design_scores_gemma":[0.000050729508,0.000034110806,0.00011517362,0.00007993921,0.00007321488,0.00009790508,0.000059856913,0.031881176,0.0009846555,0.9634964,0.0030950913,0.000031813997],"about_ca_topic_score_codex":0.0030667274,"about_ca_topic_score_gemma":0.0039658532,"teacher_disagreement_score":0.0328567,"about_ca_system_score_codex":0.01017773,"about_ca_system_score_gemma":0.00842835,"threshold_uncertainty_score":0.10991663},"labels":[],"label_agreement":null},{"id":"W2045758343","doi":"10.1016/j.jda.2005.03.003","title":"On the mean number of encryptions for tree-based broadcast encryption schemes","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Broadcast encryption; Computer science; Encryption; Stateless protocol; Scheme (mathematics); Cryptanalysis; Mathematics; Computer network; Tree (set theory); Theoretical computer science; Computer security; Discrete mathematics; Public-key cryptography; Combinatorics","score_opus":0.019086180210556407,"score_gpt":0.288083670207468,"score_spread":0.2689974899969116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045758343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15676753,0.0048429007,0.811009,0.006015238,0.00084858347,0.00023679473,0.00057594985,0.00091978646,0.018784288],"genre_scores_gemma":[0.82522476,0.00244313,0.16014606,0.0010214911,0.00082586816,0.0005330274,0.000515819,0.00055587373,0.008734016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99077964,0.0033754224,0.00047789328,0.0012300775,0.0027289395,0.0014080895],"domain_scores_gemma":[0.920565,0.056026958,0.0039614057,0.011425475,0.0055432967,0.0024778626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01127962,0.0013002909,0.0030692897,0.0021253566,0.0031149727,0.004937376,0.0038788493,0.0027722125,0.0052901893],"category_scores_gemma":[0.053701278,0.00118364,0.001783017,0.0020934269,0.004927296,0.014161118,0.0047255647,0.0067282994,0.001005196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026635893,0.0002166218,0.0021463914,0.00038135567,0.00017435208,0.00013308697,0.00044107944,0.09792612,0.010151186,0.8123839,0.012230284,0.06115197],"study_design_scores_gemma":[0.00015535616,0.00033736028,0.0007393385,0.00010688149,0.000113239796,0.00036209167,0.00012745279,0.34758267,0.0041355854,0.64284897,0.0034051794,0.00008589709],"about_ca_topic_score_codex":0.00068609655,"about_ca_topic_score_gemma":0.0015254028,"teacher_disagreement_score":0.01127962,"about_ca_system_score_codex":0.0051269773,"about_ca_system_score_gemma":0.0045236964,"threshold_uncertainty_score":0.059653103},"labels":[],"label_agreement":null},{"id":"W2046430605","doi":"10.1007/s10623-011-9540-y","title":"On-line secret sharing","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Secret sharing; Access structure; Secure multi-party computation; Verifiable secret sharing; Homomorphic secret sharing; Shamir's Secret Sharing; Infimum and supremum; Scheme (mathematics)","score_opus":0.07813434218639215,"score_gpt":0.25972917301492143,"score_spread":0.18159483082852929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046430605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0556905,0.00048135073,0.8668575,0.0008805034,0.00030161152,0.0004116408,0.0004018395,0.0020235735,0.07295144],"genre_scores_gemma":[0.8588044,0.0003924507,0.08699898,0.0005010861,0.00023027613,0.00030621886,0.00048602305,0.00024466758,0.05203594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640745,0.0008861871,0.0001294544,0.00046599878,0.0012876226,0.0008233431],"domain_scores_gemma":[0.99437606,0.0008298965,0.0003855,0.003510995,0.0007254034,0.00017207871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013293156,0.0011329973,0.0010837028,0.0009668372,0.001462933,0.0032841456,0.0018274323,0.0019589057,0.022356994],"category_scores_gemma":[0.0042424356,0.00049733766,0.0007103687,0.001636751,0.0011738178,0.004644158,0.0051079877,0.0015371419,0.0070264786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020266522,0.00048866874,0.001849086,0.00031752916,0.00017991559,0.0004330294,0.0005108985,0.07303071,0.046143413,0.48910126,0.019259136,0.36665976],"study_design_scores_gemma":[0.00022192356,0.0006753325,0.000689237,0.00012172452,0.00011623622,0.0010085829,0.00022212727,0.42410457,0.069330126,0.44215813,0.06124312,0.00010898711],"about_ca_topic_score_codex":0.00046251385,"about_ca_topic_score_gemma":0.0006493745,"teacher_disagreement_score":0.022356994,"about_ca_system_score_codex":0.0014274075,"about_ca_system_score_gemma":0.0017975252,"threshold_uncertainty_score":0.07479155},"labels":[],"label_agreement":null},{"id":"W2047068440","doi":"10.4271/2012-01-2103","title":"Novel Approach for Securing Air-Ground Communication","year":2012,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science","score_opus":0.02501508867522499,"score_gpt":0.26177213402517757,"score_spread":0.2367570453499526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047068440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016687429,0.00073765684,0.957782,0.0010076753,0.0004009129,0.00015548083,0.000024574352,0.00064001576,0.02256428],"genre_scores_gemma":[0.5063679,0.0013746591,0.45728797,0.0005019576,0.00033548503,0.00019452295,0.000085008585,0.000072291106,0.033780158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998896,0.00017796447,0.000059804,0.00015474061,0.00058869383,0.00012276391],"domain_scores_gemma":[0.99927276,0.00012411148,0.00006827821,0.00028855848,0.00019783541,0.00004849488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052343134,0.00045166656,0.00040825517,0.0006032544,0.0010395418,0.001784219,0.0010496855,0.0012727833,0.0030030322],"category_scores_gemma":[0.0009086944,0.00025598958,0.00050069037,0.0002886059,0.0011483851,0.0035924963,0.0021950325,0.0016813193,0.0014779198],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001927067,0.00019129459,0.00092923705,0.0002343959,0.000054713913,0.0011575168,0.00084720226,0.011275328,0.17556763,0.5529461,0.008346333,0.24825755],"study_design_scores_gemma":[0.00010083403,0.0005534629,0.0008608095,0.00014868943,0.00011359077,0.005685991,0.00066536886,0.46148646,0.17521438,0.17092773,0.18412372,0.00011901884],"about_ca_topic_score_codex":0.0003778477,"about_ca_topic_score_gemma":0.0004476223,"teacher_disagreement_score":0.0030030322,"about_ca_system_score_codex":0.00067903736,"about_ca_system_score_gemma":0.000742302,"threshold_uncertainty_score":0.010046124},"labels":[],"label_agreement":null},{"id":"W2048758692","doi":"10.1109/ccece.2014.6900969","title":"Digital signatures for mobile users","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Key (lock); Signature (topology); Public key certificate; Digital signature; Certificate; Public-key cryptography; Computer security; World Wide Web; Encryption; Theoretical computer science","score_opus":0.0067042800666367915,"score_gpt":0.22597040661499962,"score_spread":0.21926612654836283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048758692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00839908,0.009818184,0.8868977,0.0052091293,0.002699903,0.0005080457,0.0004942148,0.0026050655,0.08336878],"genre_scores_gemma":[0.3264461,0.012861651,0.54154027,0.0025699448,0.0030256275,0.0010543708,0.0012408899,0.00048519534,0.110775925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941028,0.0016309749,0.00047392206,0.00061753084,0.0026413733,0.00053345505],"domain_scores_gemma":[0.99480927,0.001280654,0.0004496029,0.0020121557,0.0011959776,0.0002523627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022694652,0.00088948273,0.00096829917,0.0017263654,0.0018600596,0.003640533,0.0014935582,0.0027407985,0.011100432],"category_scores_gemma":[0.009047583,0.00043938507,0.0007821505,0.0023756362,0.0024601244,0.008099126,0.0042813905,0.0035053468,0.010074624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018192486,0.00004884082,0.00028518544,0.0004495141,0.000027629798,0.0003758744,0.0005940329,0.0033681325,0.007664562,0.76028323,0.02252523,0.2041958],"study_design_scores_gemma":[0.00008812272,0.00023012093,0.00023727829,0.0003435292,0.00003842563,0.002416924,0.00033124507,0.027640756,0.016767237,0.3501862,0.6016008,0.000119230936],"about_ca_topic_score_codex":0.00052493147,"about_ca_topic_score_gemma":0.0004578461,"teacher_disagreement_score":0.011100432,"about_ca_system_score_codex":0.0016156696,"about_ca_system_score_gemma":0.0015126338,"threshold_uncertainty_score":0.037134647},"labels":[],"label_agreement":null},{"id":"W2051780367","doi":"10.1109/syscon.2012.6189541","title":"EIBC: Enhanced Identity-Based Cryptography, a conceptual design","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Key management; Cryptography; Encryption; Computer network; Key (lock); Authentication (law); Overhead (engineering); Network packet; Key encapsulation; Public-key cryptography; Multicast; Computer security; Distributed computing; Key exchange; Operating system","score_opus":0.0359672530345758,"score_gpt":0.2708292474475422,"score_spread":0.23486199441296643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051780367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005987024,0.0033481605,0.95996106,0.001006693,0.0005379557,0.00042725494,0.000081991806,0.0009401397,0.027709808],"genre_scores_gemma":[0.29765537,0.005261813,0.6722428,0.0013723517,0.00055538997,0.0008391226,0.00031095455,0.00024596782,0.02151624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965682,0.00087408704,0.0002517647,0.00037338867,0.0015415295,0.00039096255],"domain_scores_gemma":[0.99766916,0.0002541837,0.0002453424,0.0007397749,0.00088300824,0.00020843952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002656908,0.0009384477,0.0007856375,0.0016596516,0.0012676006,0.004810378,0.002516088,0.0018311571,0.002382644],"category_scores_gemma":[0.0037745794,0.00050770334,0.00056232227,0.0019301535,0.0027409731,0.0054078028,0.002319952,0.003395565,0.0019660504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015807773,0.000077752324,0.0003319119,0.00027546883,0.00002975792,0.00020808831,0.00024119245,0.0048754266,0.01606295,0.89815414,0.004367623,0.075217634],"study_design_scores_gemma":[0.00014776844,0.00071534736,0.0005872295,0.00040181345,0.00012677826,0.0035021747,0.00022966912,0.15829813,0.078216255,0.29108727,0.4664958,0.00019170607],"about_ca_topic_score_codex":0.00080574414,"about_ca_topic_score_gemma":0.00048544983,"teacher_disagreement_score":0.004810378,"about_ca_system_score_codex":0.0018917945,"about_ca_system_score_gemma":0.0024190212,"threshold_uncertainty_score":0.014051259},"labels":[],"label_agreement":null},{"id":"W2053599246","doi":"10.1145/2517840.2517855","title":"Thinking inside the BLAC box","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero-knowledge proof; Mathematical proof; Computer science; Protocol (science); Cryptography; Suite; Cryptographic protocol; Theoretical computer science; Random oracle; Blacklisting; Distributed computing; Public-key cryptography; Computer security; Mathematics; Encryption","score_opus":0.010175251424369529,"score_gpt":0.21115679034569346,"score_spread":0.20098153892132392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053599246","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011763296,0.002932523,0.8202822,0.039787013,0.002452791,0.00016681172,0.00037876863,0.0050837356,0.11715284],"genre_scores_gemma":[0.37640598,0.003891419,0.49614394,0.018071143,0.0023817006,0.00051338767,0.00047799357,0.0024586786,0.09965572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968941,0.00089985284,0.000089793255,0.000708363,0.0010088499,0.00039895534],"domain_scores_gemma":[0.9955199,0.0016002639,0.00023866567,0.0017786452,0.00056791067,0.00029471164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004484836,0.0008321877,0.0006549275,0.0010055213,0.00288504,0.005317537,0.0018167157,0.0033228858,0.021543957],"category_scores_gemma":[0.01062986,0.00077778165,0.00087316753,0.0008442131,0.0086010005,0.02311949,0.005345451,0.009542285,0.007911628],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007802336,0.000021283116,0.00013965859,0.00006540568,0.000009975091,0.00005920423,0.0003527398,0.0013988459,0.001707759,0.95328224,0.016712602,0.026172299],"study_design_scores_gemma":[0.000043535347,0.000051405303,0.00009292652,0.00014101202,0.0000143410125,0.00019139466,0.00018292046,0.011451237,0.0052619455,0.74027324,0.24222326,0.00007272119],"about_ca_topic_score_codex":0.0021670484,"about_ca_topic_score_gemma":0.0016590032,"teacher_disagreement_score":0.021543957,"about_ca_system_score_codex":0.0015586332,"about_ca_system_score_gemma":0.0028954193,"threshold_uncertainty_score":0.07207167},"labels":[],"label_agreement":null},{"id":"W2053695259","doi":"10.1007/s10623-009-9357-0","title":"Anonymity in shared symmetric key primitives","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Anonymity; Key (lock); Computer science; Context (archaeology); Set (abstract data type); Scheme (mathematics); Symmetric-key algorithm; Computer security; Theoretical computer science; Internet privacy; Public-key cryptography; Mathematics; Programming language; Encryption; Geography","score_opus":0.016838542394689588,"score_gpt":0.23947193515252987,"score_spread":0.22263339275784028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053695259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1180467,0.0009229684,0.83810174,0.003499917,0.00032315718,0.00011638341,0.00025592328,0.00054898957,0.038184125],"genre_scores_gemma":[0.9269092,0.0004339476,0.0540385,0.00039891741,0.00030843238,0.0002008942,0.00017614521,0.00015926146,0.0173748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99315464,0.0028961613,0.0003458051,0.00067771703,0.002001025,0.0009245937],"domain_scores_gemma":[0.98908114,0.005984431,0.0008861918,0.0027456188,0.0008908684,0.0004116351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040096343,0.00061033433,0.0010465627,0.0014565436,0.0032335368,0.005603558,0.0015023736,0.0024907698,0.0037312966],"category_scores_gemma":[0.012842263,0.0008375596,0.0010160828,0.002409078,0.0064413208,0.012180389,0.004570264,0.004959303,0.0011254883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010156189,0.000013165396,0.00011201874,0.000016770127,0.0000043577847,0.000033428598,0.00018962141,0.0031441622,0.00043739696,0.9912923,0.00067492225,0.003980327],"study_design_scores_gemma":[0.000014686995,0.000011621883,0.000035042638,0.000008021145,0.0000060433304,0.0000447308,0.000049194452,0.011377391,0.00076809555,0.98563,0.002044187,0.000010963386],"about_ca_topic_score_codex":0.0008362465,"about_ca_topic_score_gemma":0.0006516584,"teacher_disagreement_score":0.005603558,"about_ca_system_score_codex":0.0027823271,"about_ca_system_score_gemma":0.0021273354,"threshold_uncertainty_score":0.021205246},"labels":[],"label_agreement":null},{"id":"W2053845484","doi":"10.1007/s12083-015-0334-2","title":"Privacy preserving secure data exchange in mobile P2P cloud healthcare environment","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Saud University; University of Ontario Institute of Technology; University of Guelph","keywords":"Cloud computing; Computer science; Computer security; Data sharing; Data exchange; Cryptography; Protocol (science); Session (web analytics); Key (lock); Key exchange; Health care; Internet privacy; Encryption; Public-key cryptography; World Wide Web","score_opus":0.06793940245675492,"score_gpt":0.31355069160684707,"score_spread":0.24561128915009214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053845484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17370814,0.0014594439,0.80973244,0.0035660597,0.00031721292,0.00023509502,0.0003953294,0.0007844453,0.009801781],"genre_scores_gemma":[0.9741771,0.0002542353,0.02346636,0.00014410094,0.00006806016,0.000033646207,0.00010195179,0.000018634935,0.0017359635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997905,0.0006981699,0.00016232574,0.00029266012,0.0006464558,0.00029539407],"domain_scores_gemma":[0.99822277,0.0006696488,0.00019843735,0.00056895317,0.00024632324,0.00009382773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016629408,0.00024197015,0.0006105219,0.0003085492,0.0011046113,0.001869728,0.0008492821,0.0011026585,0.0010335762],"category_scores_gemma":[0.0029717928,0.00018937692,0.00035613598,0.00065905537,0.0006608643,0.0025231675,0.0020750011,0.0009569588,0.0004124211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038947635,0.0006311087,0.011270478,0.00058662303,0.00026417465,0.0075634923,0.0015195091,0.21642779,0.06924578,0.2670262,0.025863769,0.39570636],"study_design_scores_gemma":[0.0001020945,0.00028623256,0.0016644947,0.000030857827,0.00006358494,0.0029513035,0.00058801996,0.86381817,0.03370827,0.08295052,0.013793758,0.000042754426],"about_ca_topic_score_codex":0.00074392225,"about_ca_topic_score_gemma":0.00045326026,"teacher_disagreement_score":0.001869728,"about_ca_system_score_codex":0.0005237425,"about_ca_system_score_gemma":0.0010169679,"threshold_uncertainty_score":0.008794546},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013242870002257342,"score_gpt":0.24186670096007643,"score_spread":0.22862383095781907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056634932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08524464,0.0006449569,0.89440095,0.0018918645,0.00018300982,0.0003188134,0.00034705322,0.009321705,0.007646955],"genre_scores_gemma":[0.88064855,0.00038821693,0.11396057,0.0002625112,0.000095917836,0.00011924653,0.0004491958,0.0000922901,0.003983483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737704,0.0006898018,0.00031797632,0.00035243307,0.0009295453,0.00033323822],"domain_scores_gemma":[0.99632734,0.0005859094,0.0004251549,0.0019887928,0.00041671025,0.0002559728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029142243,0.00027331017,0.0007132008,0.0006918985,0.0010142492,0.0025106454,0.0017806846,0.0010660859,0.00239406],"category_scores_gemma":[0.0036807745,0.00034108575,0.000578814,0.001188605,0.00075571047,0.005552254,0.004392524,0.0016871499,0.0015641392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036007715,0.0011796615,0.011123601,0.00051814644,0.00038298548,0.002915632,0.0016079887,0.067316145,0.13920173,0.3928298,0.026230643,0.35309288],"study_design_scores_gemma":[0.00078920583,0.0009475801,0.0039358763,0.00010013647,0.00031992738,0.0034959265,0.00037930702,0.6444485,0.16164184,0.11224885,0.07143056,0.00026233992],"about_ca_topic_score_codex":0.0005038939,"about_ca_topic_score_gemma":0.0002173856,"teacher_disagreement_score":0.0029142243,"about_ca_system_score_codex":0.00084834953,"about_ca_system_score_gemma":0.0015105493,"threshold_uncertainty_score":0.015412033},"labels":[],"label_agreement":null},{"id":"W2060301675","doi":"10.1145/2591796.2591860","title":"A quantum algorithm for computing the unit group of an arbitrary degree number field","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Computing and Communication Foundations; Division of Mathematical Sciences; U.S. Department of Energy","keywords":"Quantum algorithm; Quantum computer; Mathematics; Discrete logarithm; Algebraic number field; Algorithm; Lattice reduction; Degree (music); Discrete mathematics; Computer science; Quantum; Encryption; Quantum mechanics; Public-key cryptography","score_opus":0.02985700186820744,"score_gpt":0.27644547700827354,"score_spread":0.2465884751400661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060301675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034341425,0.00019881259,0.95689833,0.0008268211,0.00013335126,0.00012955774,0.00007588248,0.00083848555,0.00655745],"genre_scores_gemma":[0.34812143,0.0001567403,0.6457639,0.00023482586,0.000084396415,0.00017733144,0.00017514851,0.0000821506,0.0052040545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993026,0.00017325381,0.000053999705,0.00014624652,0.00023107548,0.00009285423],"domain_scores_gemma":[0.9994253,0.00019682258,0.000044752458,0.00017680018,0.00010001611,0.000056335462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007488942,0.00036012643,0.00052944466,0.0006235865,0.0009385965,0.001046294,0.0012112869,0.000917853,0.003382645],"category_scores_gemma":[0.0021994025,0.00020801397,0.0005391005,0.0008017267,0.0013366892,0.001996175,0.0018224431,0.0011669825,0.00075076136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004352523,0.0002329321,0.0008287312,0.00016477868,0.00007181231,0.00018427239,0.00049374363,0.039385505,0.020535022,0.6476582,0.010327689,0.279682],"study_design_scores_gemma":[0.00022670996,0.00024032505,0.00028158462,0.000038039852,0.000045275443,0.00021610298,0.00013900064,0.542946,0.01682032,0.428006,0.010978033,0.00006269397],"about_ca_topic_score_codex":0.0012914976,"about_ca_topic_score_gemma":0.0019344868,"teacher_disagreement_score":0.003382645,"about_ca_system_score_codex":0.0009655332,"about_ca_system_score_gemma":0.0018313682,"threshold_uncertainty_score":0.011316121},"labels":[],"label_agreement":null},{"id":"W2060963954","doi":"10.1109/isb.2014.6990752","title":"PRECISE: PRivacy-preserving cloud-assisted quality improvement service in healthcare","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"U.S. National Library of Medicine; National Human Genome Research Institute; National Heart, Lung, and Blood Institute","keywords":"Homomorphic encryption; Computer science; Cloud computing; Health care; Encryption; Pooling; Computer security; Cryptography; Information privacy; Internet privacy","score_opus":0.03384041042032478,"score_gpt":0.30703447492510055,"score_spread":0.2731940645047758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060963954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057338316,0.0007353238,0.9220966,0.0029410932,0.00027561153,0.00090164796,0.0009047416,0.008512864,0.006293773],"genre_scores_gemma":[0.8740341,0.0004431317,0.11878122,0.000909419,0.0001829741,0.00025192433,0.00081164733,0.00013435798,0.004451269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945693,0.0015135013,0.00046217235,0.0005910524,0.002223393,0.00064062426],"domain_scores_gemma":[0.995089,0.00072675414,0.00083831284,0.0023903917,0.0005561477,0.0003994547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004239469,0.00064702355,0.0009440792,0.0008611468,0.0012729325,0.002563519,0.0023615595,0.0017271108,0.0028967091],"category_scores_gemma":[0.0064196205,0.00037305994,0.0008241228,0.0016350735,0.0013536299,0.003976415,0.0061498084,0.002144947,0.0012511988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047064824,0.0013420138,0.014885017,0.00080712466,0.00042863612,0.0025260667,0.001529173,0.12152019,0.06845755,0.24452464,0.05426387,0.48500928],"study_design_scores_gemma":[0.0004890067,0.0011857476,0.005952896,0.000100396166,0.00014554452,0.002539849,0.0005587641,0.7848725,0.0543383,0.09257472,0.05699395,0.00024843932],"about_ca_topic_score_codex":0.0014731418,"about_ca_topic_score_gemma":0.0009782233,"teacher_disagreement_score":0.004239469,"about_ca_system_score_codex":0.0013535924,"about_ca_system_score_gemma":0.0028126263,"threshold_uncertainty_score":0.022420704},"labels":[],"label_agreement":null},{"id":"W2063578896","doi":"10.1145/2810103.2813616","title":"Deniable Key Exchanges for Secure Messaging","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Forward secrecy; Secrecy; Composability; Cryptography; Key exchange; Key (lock); Internet privacy; Public-key cryptography; Encryption; Distributed computing","score_opus":0.05139075850252376,"score_gpt":0.27261772652961813,"score_spread":0.22122696802709438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063578896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017222283,0.0011334162,0.962873,0.0016074425,0.00023764878,0.0002987517,0.000099948345,0.00163705,0.014890478],"genre_scores_gemma":[0.58108634,0.0016891111,0.4013587,0.000968044,0.00036951166,0.0007724002,0.0003609194,0.0006433796,0.012751697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98378974,0.006292051,0.0011813927,0.0016869269,0.005925097,0.0011247478],"domain_scores_gemma":[0.97795653,0.007994379,0.0016480987,0.010525173,0.0013455257,0.0005302083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010192074,0.0011457404,0.0012574807,0.001178232,0.0027316215,0.004711162,0.0030264216,0.0030468425,0.008646303],"category_scores_gemma":[0.0280388,0.0011339649,0.0012623864,0.0014626768,0.0056921733,0.01704221,0.00862813,0.00822497,0.0024344039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002854294,0.00007112656,0.00023478516,0.0002155858,0.000021581114,0.00009596167,0.00036565468,0.011801001,0.0053263586,0.9566418,0.0020962576,0.02284444],"study_design_scores_gemma":[0.00015537681,0.00017264888,0.00010455986,0.00013761422,0.00005326352,0.00027707947,0.00016236086,0.12315976,0.021270506,0.81528765,0.039147604,0.00007162395],"about_ca_topic_score_codex":0.0005751854,"about_ca_topic_score_gemma":0.00058706244,"teacher_disagreement_score":0.010192074,"about_ca_system_score_codex":0.0029415763,"about_ca_system_score_gemma":0.0035782906,"threshold_uncertainty_score":0.053901494},"labels":[],"label_agreement":null},{"id":"W2064720601","doi":"10.1080/17445760802441671","title":"Distributed architectures for electronic cash schemes: a survey1","year":2009,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Electronic cash; Business; World Wide Web","score_opus":0.015877694235384827,"score_gpt":0.2838235642934869,"score_spread":0.26794587005810205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064720601","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030530984,0.6261395,0.26374125,0.0044689314,0.0008788216,0.00044624257,0.00032156362,0.0010595688,0.0724132],"genre_scores_gemma":[0.19093746,0.5964559,0.18649574,0.0011043971,0.0015858277,0.0005581352,0.0010755865,0.00028185177,0.021505203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998372,0.00032655438,0.00020131904,0.00023912813,0.0006987719,0.00016226097],"domain_scores_gemma":[0.99742293,0.0014356821,0.0002122697,0.0002903736,0.00053048023,0.00010836353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018501475,0.0009096178,0.0010087456,0.003313254,0.0010573192,0.00295656,0.001980284,0.0018232933,0.0070042703],"category_scores_gemma":[0.0038705345,0.0008215428,0.00059910916,0.007784572,0.0009882159,0.0062090545,0.0012826609,0.0016904764,0.002342496],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001811151,0.00023934752,0.0026560712,0.004992474,0.000053080275,0.00023637908,0.0005975599,0.012001534,0.0030760276,0.2076114,0.01549889,0.7528562],"study_design_scores_gemma":[0.00008834477,0.0004288997,0.003219504,0.0021815791,0.00009884082,0.0023905297,0.0008080246,0.03190863,0.004534058,0.09634946,0.85788953,0.000102595055],"about_ca_topic_score_codex":0.00091626745,"about_ca_topic_score_gemma":0.00076096354,"teacher_disagreement_score":0.0070042703,"about_ca_system_score_codex":0.0016350121,"about_ca_system_score_gemma":0.0014362144,"threshold_uncertainty_score":0.0234316},"labels":[],"label_agreement":null},{"id":"W2066290790","doi":"10.1090/s0025-5718-04-01637-0","title":"Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem","year":2004,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Annotation; Mathematics; Type (biology); Computer science; Database; Artificial intelligence","score_opus":0.03172563743395274,"score_gpt":0.2802293361987362,"score_spread":0.24850369876478345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066290790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40607563,0.0037361516,0.18028615,0.032584872,0.001443473,0.00039739336,0.0012284548,0.0010219556,0.3732259],"genre_scores_gemma":[0.94519943,0.0013574889,0.023069188,0.0014012496,0.0007855873,0.00026506142,0.0006978277,0.0001827411,0.027041469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494815,0.001473198,0.00022244763,0.0008165247,0.0013506312,0.0011890713],"domain_scores_gemma":[0.99348676,0.004020669,0.0004213846,0.0011688835,0.00045755284,0.00044477065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003696971,0.001290877,0.0018570068,0.0014454804,0.0037735684,0.004116068,0.002530092,0.0028390463,0.01279921],"category_scores_gemma":[0.014280485,0.0006324331,0.001579597,0.00194939,0.004822121,0.013057935,0.00969281,0.006973167,0.003071622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003428925,0.00006939244,0.00043390837,0.00009305894,0.000030712963,0.00019415579,0.0004026116,0.003831577,0.0006304013,0.9719552,0.009909323,0.01210669],"study_design_scores_gemma":[0.00009737003,0.000027904089,0.00011897055,0.000022174658,0.000014751798,0.00006973351,0.00008617364,0.019426424,0.0008793329,0.9741687,0.005068393,0.00002016897],"about_ca_topic_score_codex":0.001631291,"about_ca_topic_score_gemma":0.00062251167,"teacher_disagreement_score":0.01279921,"about_ca_system_score_codex":0.0029042417,"about_ca_system_score_gemma":0.0029745686,"threshold_uncertainty_score":0.042817593},"labels":[],"label_agreement":null},{"id":"W2066369985","doi":"10.1145/2000807.2000819","title":"Cake cutting really is not a piece of cake","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Division of Information and Intelligent Systems; Division of Computer and Network Systems; Division of Computing and Communication Foundations","keywords":"Bounding overwatch; Protocol (science); Upper and lower bounds; Mathematics; Divide and conquer algorithms; Value (mathematics); Computer science; Combinatorics; Discrete mathematics; Algorithm; Statistics; Artificial intelligence","score_opus":0.04865011138230788,"score_gpt":0.2574393791545293,"score_spread":0.20878926777222143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066369985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075040765,0.00036531652,0.89935607,0.0035594532,0.00015178259,0.00022363232,0.00023384226,0.0007947017,0.020274455],"genre_scores_gemma":[0.6074242,0.00033759992,0.36994377,0.0007660622,0.00010202167,0.0004020685,0.00035359865,0.0004369801,0.020233685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469876,0.0010352856,0.00029767043,0.001700272,0.0013855719,0.00088252744],"domain_scores_gemma":[0.9839844,0.0076136,0.0009579352,0.0062583853,0.0006910512,0.0004946087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031811781,0.000721118,0.0016945153,0.0005058612,0.0028827637,0.0045910194,0.0030500542,0.0033299667,0.009913797],"category_scores_gemma":[0.0179913,0.0008883063,0.0018739126,0.0011645943,0.005581243,0.015759373,0.004926957,0.0068587125,0.001367344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005908497,0.00016185432,0.0010192717,0.000298468,0.00010969338,0.0002881551,0.00066762685,0.0653949,0.009930502,0.86631745,0.0053361803,0.04988508],"study_design_scores_gemma":[0.000105208856,0.00016173933,0.00033788354,0.000066168235,0.00007044997,0.0004080001,0.00032957006,0.17391972,0.0118716415,0.794122,0.018534604,0.00007300014],"about_ca_topic_score_codex":0.0023066818,"about_ca_topic_score_gemma":0.0024173213,"teacher_disagreement_score":0.009913797,"about_ca_system_score_codex":0.0018259134,"about_ca_system_score_gemma":0.0024337487,"threshold_uncertainty_score":0.033164978},"labels":[],"label_agreement":null},{"id":"W2066431556","doi":"10.1016/j.jpdc.2003.11.007","title":"Sorting and election in anonymous asynchronous rings","year":2003,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Multiset; Combinatorics; Sorting; Upper and lower bounds; Ring (chemistry); Asynchronous communication; Prime (order theory); Leader election; Characterization (materials science); Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Computer network; Physics; Chemistry","score_opus":0.008125596502436955,"score_gpt":0.2324580116784604,"score_spread":0.22433241517602343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066431556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42343935,0.00066661125,0.54386616,0.0026552898,0.00052409514,0.0001899362,0.00024506776,0.0008523885,0.027561102],"genre_scores_gemma":[0.93175006,0.00030547,0.047857173,0.00017025783,0.00019216683,0.000082238555,0.00012184059,0.00008176652,0.01943906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976452,0.0008933562,0.00020490933,0.00029946724,0.00048389466,0.00047311594],"domain_scores_gemma":[0.9881881,0.0069368817,0.001212657,0.0016685041,0.0011736661,0.000820292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004003241,0.0003032942,0.0010914864,0.0014896656,0.0034176898,0.004293283,0.0015033573,0.0014514073,0.004511754],"category_scores_gemma":[0.017227473,0.00047783926,0.0006709507,0.0022981393,0.00287945,0.006017957,0.0022062778,0.0014643952,0.0005879477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005091217,0.000077612356,0.00092025194,0.00005122301,0.00001440005,0.000099834695,0.0004124535,0.024748579,0.0012951378,0.95228887,0.001815609,0.017766805],"study_design_scores_gemma":[0.0001028004,0.00006350363,0.00022675555,0.000011298553,0.000028835058,0.00008783522,0.00017473983,0.122782625,0.0017058109,0.870849,0.0039402163,0.00002655217],"about_ca_topic_score_codex":0.0015558026,"about_ca_topic_score_gemma":0.002018934,"teacher_disagreement_score":0.004511754,"about_ca_system_score_codex":0.0013742514,"about_ca_system_score_gemma":0.0021354954,"threshold_uncertainty_score":0.021171391},"labels":[],"label_agreement":null},{"id":"W2066448868","doi":"10.1109/glocom.2011.6134273","title":"An Efficient and Secure User Revocation Scheme in Mobile Social Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Revocation; Eavesdropping; Computer science; Computer security; Collusion; Computer network; Encryption; Scheme (mathematics); Overhead (engineering); Network packet; Secure communication","score_opus":0.015147625436243962,"score_gpt":0.24235134380494716,"score_spread":0.2272037183687032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066448868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1514002,0.0012115994,0.83927816,0.0007620703,0.0002559176,0.00051102974,0.00012931111,0.0009564229,0.005495287],"genre_scores_gemma":[0.9579309,0.00020350826,0.039038647,0.00008950841,0.00007122485,0.00012253628,0.00008149787,0.000023030845,0.0024390814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652135,0.0013999233,0.0002737188,0.0004621457,0.00096002594,0.00038289282],"domain_scores_gemma":[0.99537826,0.00091499055,0.00079174654,0.0018636741,0.0007262641,0.00032506385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020151858,0.0005777717,0.0010062079,0.00084494584,0.0013580861,0.0009523278,0.002059704,0.0012974284,0.00096711214],"category_scores_gemma":[0.0048904917,0.00027558714,0.00073008507,0.0009065691,0.001305897,0.003799506,0.0028326523,0.0010930054,0.0005487396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003441792,0.00048253778,0.006865977,0.0008235233,0.00037563173,0.0021774268,0.0036868493,0.10643862,0.20533732,0.25473332,0.010422941,0.40521407],"study_design_scores_gemma":[0.00042298966,0.0017384981,0.00247132,0.00008694422,0.00021674031,0.004132726,0.000708167,0.8234126,0.06627972,0.050489087,0.049674205,0.0003670791],"about_ca_topic_score_codex":0.00064858526,"about_ca_topic_score_gemma":0.00046497007,"teacher_disagreement_score":0.002059704,"about_ca_system_score_codex":0.0010469053,"about_ca_system_score_gemma":0.000823941,"threshold_uncertainty_score":0.010657489},"labels":[],"label_agreement":null},{"id":"W2067799592","doi":"10.5539/jpl.v1n3p102","title":"Enforceability of Database Licensing Agreement: A Comparatives Study Between Malaysia and the United States of America","year":2008,"lang":"en","type":"article","venue":"Journal of Politics and Law","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unconscionability; Licensee; Statutory law; Database; License; Bargaining power; Business; Doctrine; Waiver; Freedom of contract; Agreement; Law and economics; Law; Computer science; Economics; Political science","score_opus":0.03306238431954459,"score_gpt":0.289548480712735,"score_spread":0.25648609639319037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067799592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96332884,0.0025985069,0.0002730031,0.0006816228,0.000020420399,0.000028345832,0.00017593321,0.000008212881,0.03288502],"genre_scores_gemma":[0.99583507,0.001337261,0.00010557386,0.0000812019,0.000004968146,0.000004000158,0.000060456914,0.000003284145,0.0025681083],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868506,0.00039484573,0.00011502578,0.000112879214,0.00039720527,0.000295096],"domain_scores_gemma":[0.99362814,0.0020985713,0.001859178,0.00018785584,0.0016047349,0.0006215641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016350214,0.00016995292,0.00021283825,0.0019275465,0.0013700755,0.003418244,0.00042064438,0.0004560387,0.005459764],"category_scores_gemma":[0.005238302,0.00016006127,0.00030638764,0.003762946,0.0013426809,0.0029611727,0.0010454416,0.00068041135,0.0005244976],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059776753,0.00049374695,0.8178751,0.0008177341,0.00014288526,0.002464504,0.037301295,0.00097052776,0.0014752338,0.038715385,0.003488759,0.095657125],"study_design_scores_gemma":[0.00002368683,0.0006435584,0.78914344,0.0007863857,0.00019874435,0.0012395866,0.1548748,0.0023637526,0.0017567753,0.0022724976,0.046602327,0.00009439117],"about_ca_topic_score_codex":0.090616494,"about_ca_topic_score_gemma":0.13447995,"teacher_disagreement_score":0.090616494,"about_ca_system_score_codex":0.0034862757,"about_ca_system_score_gemma":0.0034148358,"threshold_uncertainty_score":0.1801781},"labels":[],"label_agreement":null},{"id":"W2069036743","doi":"10.1515/jmc.2008.014","title":"Another look at non-standard discrete log and Diffie-Hellman problems","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Mathematics; Genus; Standard Model (mathematical formulation); Discrete mathematics; Theoretical computer science; Computer science; Computer security; Public-key cryptography; Encryption; Geography","score_opus":0.017243321205712477,"score_gpt":0.24333549800228965,"score_spread":0.22609217679657717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069036743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46318233,0.010636999,0.16424303,0.13523819,0.0010997101,0.000142996,0.000549542,0.00035713628,0.22455014],"genre_scores_gemma":[0.9720782,0.0013809962,0.016996777,0.0029142783,0.0010484225,0.000039453746,0.00015329059,0.00006474596,0.005323811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994547,0.0027116425,0.00016307572,0.0004232017,0.0016860607,0.00046910273],"domain_scores_gemma":[0.96445125,0.028126774,0.0019985253,0.0033217443,0.001169954,0.000931684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005250041,0.00043820552,0.00094119896,0.0036652961,0.0026681547,0.004540537,0.0019454124,0.0027215946,0.0067619965],"category_scores_gemma":[0.01778198,0.00038252104,0.0010786339,0.0030473843,0.011533666,0.01609631,0.0038341365,0.0077987835,0.0003836579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004181688,0.00006441429,0.00084294856,0.00006559261,0.0000102844015,0.000077397985,0.0002549934,0.0012344501,0.00023331994,0.9907204,0.0020615228,0.0043930463],"study_design_scores_gemma":[0.000017096145,0.000018397615,0.00064706354,0.000020049061,0.000005443913,0.000148298,0.00025775871,0.004373248,0.00028965424,0.99000555,0.00420864,0.000008750653],"about_ca_topic_score_codex":0.0006425453,"about_ca_topic_score_gemma":0.000667089,"teacher_disagreement_score":0.0067619965,"about_ca_system_score_codex":0.00229396,"about_ca_system_score_gemma":0.0009127181,"threshold_uncertainty_score":0.027765155},"labels":[],"label_agreement":null},{"id":"W2070196560","doi":"10.1145/2600075.2600083","title":"Verifiable local computation on distributed data","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Research Committee, Aristotle University of Thessaloniki","keywords":"Server; Outsourcing; Computer science; Collusion; Cloud computing; Verifiable secret sharing; Computation; Information privacy; Secure multi-party computation; Bilinear interpolation; Distributed computing; Secret sharing; Computer network; Theoretical computer science; Computer security; Cryptography; Algorithm; Operating system","score_opus":0.027367462362813354,"score_gpt":0.26385528975252753,"score_spread":0.2364878273897142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070196560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05281794,0.00031405076,0.9400075,0.0010530595,0.000057829384,0.00017167108,0.0001875721,0.001201769,0.0041885558],"genre_scores_gemma":[0.88768697,0.00029782782,0.10584096,0.00025340062,0.000112435,0.00030630422,0.00029700526,0.00013509144,0.005069965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877236,0.0039293193,0.0007547197,0.0016220267,0.004170618,0.0017995998],"domain_scores_gemma":[0.970137,0.0100525245,0.0019443609,0.015619869,0.0016473533,0.00059886987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009047048,0.0007295801,0.0019688967,0.0010502052,0.0017140278,0.0040972685,0.003065487,0.0020139855,0.0027389978],"category_scores_gemma":[0.01983766,0.00070746936,0.001144621,0.0022010943,0.004470007,0.011375515,0.007989374,0.0036221796,0.00094783166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016843013,0.000202846,0.0012914417,0.00034225153,0.00010463108,0.00037489846,0.00074999605,0.19406672,0.019413546,0.69290155,0.0041691707,0.08469862],"study_design_scores_gemma":[0.00020068896,0.00016645968,0.00025531108,0.00004985563,0.000045086315,0.00016561459,0.00010374427,0.7059804,0.030039199,0.25797966,0.004958604,0.000055420533],"about_ca_topic_score_codex":0.0015366604,"about_ca_topic_score_gemma":0.0009004772,"teacher_disagreement_score":0.009047048,"about_ca_system_score_codex":0.004186265,"about_ca_system_score_gemma":0.0034833269,"threshold_uncertainty_score":0.0478459},"labels":[],"label_agreement":null},{"id":"W2071162492","doi":"10.1145/1992896.1992908","title":"A parallel LLL algorithm","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Lattice reduction; Algorithm; Parallel algorithm; Reduction (mathematics); Parallel computing; Algorithm design; Mathematics","score_opus":0.03135018558305083,"score_gpt":0.2242587231537797,"score_spread":0.19290853757072887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071162492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006688685,0.00029070216,0.9730111,0.00042067416,0.00021580089,0.00022524409,0.00021221017,0.0065034516,0.012432058],"genre_scores_gemma":[0.11568706,0.0002650948,0.86045814,0.0004636666,0.00019960718,0.00038007135,0.0008576537,0.00090163655,0.020787092],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883074,0.00016715351,0.00008618583,0.00022432017,0.00051825197,0.00017322322],"domain_scores_gemma":[0.99871075,0.00020161063,0.00007102494,0.00041285972,0.000514549,0.000089198285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081341347,0.0007110738,0.0009326386,0.0011624115,0.0010919393,0.0015899733,0.0019177035,0.00087279663,0.0154254725],"category_scores_gemma":[0.0024510953,0.00040153615,0.00074197876,0.0012447424,0.0006775745,0.0021375013,0.0022387772,0.0012868304,0.007593121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006308194,0.0003207645,0.0010181827,0.00026475353,0.00005320248,0.00026159096,0.00015719718,0.06640866,0.02182532,0.052263528,0.040587608,0.8162084],"study_design_scores_gemma":[0.00042430375,0.00024241136,0.0003448417,0.000051176918,0.00005654367,0.0004779323,0.00007651534,0.79451615,0.029252121,0.078054525,0.09643017,0.00007331705],"about_ca_topic_score_codex":0.001799303,"about_ca_topic_score_gemma":0.0021784897,"teacher_disagreement_score":0.0154254725,"about_ca_system_score_codex":0.0009926283,"about_ca_system_score_gemma":0.0021326176,"threshold_uncertainty_score":0.051603377},"labels":[],"label_agreement":null},{"id":"W2075371926","doi":"10.1002/sec.164","title":"Enhancing identity trust in cryptographic key management systems for dynamic environments","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Collusion; Computer science; Key management; Key (lock); Computer security; Heuristic; Cryptography; Key distribution; The Internet; Access control; Encryption; Computer network; Public-key cryptography; World Wide Web","score_opus":0.00574118533029021,"score_gpt":0.23189397823265137,"score_spread":0.22615279290236115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075371926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16885927,0.00031549437,0.8256469,0.00049037364,0.000052987223,0.00016796385,0.00003184123,0.0013355681,0.0030995493],"genre_scores_gemma":[0.91444635,0.00006506019,0.084595315,0.00003507589,0.000014216531,0.000033343775,0.000029559375,0.000028044526,0.0007530082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689627,0.0012275259,0.0002545673,0.00031908342,0.00080581266,0.0004967193],"domain_scores_gemma":[0.9908165,0.0037947912,0.0014254032,0.0025451682,0.0009864139,0.00043181347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037058496,0.0005569485,0.0009467843,0.00085820607,0.0013023069,0.0021876476,0.0017798295,0.0011378017,0.0016405929],"category_scores_gemma":[0.012395547,0.00041629642,0.0003725196,0.0010589537,0.0013535699,0.005166236,0.0048630745,0.0014420309,0.00057867053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019990513,0.0006455192,0.005694251,0.0002781405,0.00010525869,0.0005695622,0.000962052,0.4532028,0.04496177,0.13783859,0.003764081,0.34997895],"study_design_scores_gemma":[0.000064197964,0.00013706279,0.0002788574,0.00001127387,0.000018434608,0.0001474709,0.00010010891,0.9616096,0.013958197,0.021526376,0.0021238977,0.000024473762],"about_ca_topic_score_codex":0.0011487877,"about_ca_topic_score_gemma":0.0008207721,"teacher_disagreement_score":0.0037058496,"about_ca_system_score_codex":0.0019403682,"about_ca_system_score_gemma":0.0015526303,"threshold_uncertainty_score":0.019598603},"labels":[],"label_agreement":null},{"id":"W2075770085","doi":"10.1145/1835698.1835754","title":"Brief announcement","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Computer science; Scheme (mathematics); Computer security; Internet privacy; Mathematics; Political science; Law","score_opus":0.006739522558129448,"score_gpt":0.2229005860809689,"score_spread":0.21616106352283945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075770085","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016528995,0.022831947,0.0063196304,0.11410734,0.26900172,0.0006097125,0.0061237444,0.0013077207,0.5780452],"genre_scores_gemma":[0.009205638,0.013369546,0.0021070037,0.02900487,0.052643586,0.00031574268,0.0030855264,0.00027467342,0.8899934],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984517,0.00020245221,0.00009936526,0.00036911893,0.00064805377,0.00022918254],"domain_scores_gemma":[0.99540025,0.0006151475,0.00019136402,0.00039888555,0.0016958029,0.0016985057],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015374785,0.00090303883,0.00080635445,0.0013546797,0.002022624,0.003796556,0.002351033,0.0052124877,0.4263699],"category_scores_gemma":[0.0075941267,0.00030441472,0.00075707573,0.001025443,0.00068554457,0.0026065079,0.002058384,0.0032102694,0.30747092],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090964975,0.00006311333,0.0002561283,0.00027967978,0.000007778728,0.00026511817,0.000049901053,0.00006442396,0.00047996905,0.011886896,0.90711683,0.07943915],"study_design_scores_gemma":[0.0000076089514,0.000025130705,0.00017133151,0.000068503425,0.000004030922,0.00018167126,0.000033317738,0.000023912382,0.00014667511,0.0019999503,0.99733245,0.0000054207385],"about_ca_topic_score_codex":0.0012561776,"about_ca_topic_score_gemma":0.0019853804,"teacher_disagreement_score":0.5736301,"about_ca_system_score_codex":0.0018307074,"about_ca_system_score_gemma":0.0027191164,"threshold_uncertainty_score":0.8182137},"labels":[],"label_agreement":null},{"id":"W2078221881","doi":"10.1145/2600694.2600697","title":"Generalized homomorphic MACs with efficient verification","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Homomorphic encryption; Computer science; Correctness; Verifiable secret sharing; Multilinear map; Generalization; Degree (music); Key (lock); Theoretical computer science; Construct (python library); Computation; Algorithm; Mathematics; Programming language; Encryption; Computer security","score_opus":0.008314442726267387,"score_gpt":0.20061340619710488,"score_spread":0.1922989634708375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078221881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03625275,0.0005979168,0.95392656,0.0005137642,0.00015139043,0.00019734529,0.00020623919,0.0020939182,0.006060025],"genre_scores_gemma":[0.7316322,0.00045759196,0.2590356,0.00051914307,0.00029717412,0.0003890066,0.0002956258,0.000269658,0.0071040345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490094,0.0012605645,0.00035526874,0.0009338138,0.001729604,0.0008198536],"domain_scores_gemma":[0.9889692,0.001806297,0.00071659335,0.0072980025,0.000915692,0.00029426688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003297888,0.00088428694,0.0013113249,0.0011432263,0.001124991,0.002829298,0.0023981908,0.0014561649,0.004045243],"category_scores_gemma":[0.007864397,0.0008357773,0.0014394699,0.0017525118,0.0032212362,0.0080680875,0.007829416,0.003640735,0.0015540014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032055267,0.00010589231,0.00043038718,0.0002511025,0.00007944419,0.00029269856,0.00048878585,0.026327604,0.014266711,0.8801466,0.0041509904,0.073139176],"study_design_scores_gemma":[0.00012287861,0.00017413447,0.00030956176,0.00005332259,0.00009073912,0.00042351804,0.00007066608,0.21322732,0.025104182,0.74343884,0.016888391,0.00009634529],"about_ca_topic_score_codex":0.000789182,"about_ca_topic_score_gemma":0.00062248704,"teacher_disagreement_score":0.004045243,"about_ca_system_score_codex":0.0015093518,"about_ca_system_score_gemma":0.0023277213,"threshold_uncertainty_score":0.017441154},"labels":[],"label_agreement":null},{"id":"W2079447070","doi":"10.1109/icme.2013.6607567","title":"Scale me, crop me, knowme not: Supporting scaling and cropping in secret image sharing","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Cropping; Scale (ratio); Scaling; Computer science; Image (mathematics); Agricultural engineering; Computer vision; Mathematics; Agriculture; Engineering; Ecology; Geography; Cartography; Biology","score_opus":0.011827842221797167,"score_gpt":0.25242757011298794,"score_spread":0.24059972789119077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079447070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34076092,0.00124568,0.647818,0.0004195445,0.00007735683,0.00018485845,0.00010089099,0.0013331927,0.008059618],"genre_scores_gemma":[0.93719095,0.00022100288,0.060735177,0.000066766275,0.000033578206,0.000042154043,0.000056633548,0.000040940253,0.0016126974],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890625,0.00017435942,0.00005577593,0.00014907864,0.00052593317,0.00018859508],"domain_scores_gemma":[0.99689263,0.00061620696,0.00038602512,0.0016987696,0.00027782453,0.00012860233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008310343,0.00045860963,0.0005832295,0.00040518618,0.00078726973,0.00078049727,0.00081119273,0.0005456016,0.0016000232],"category_scores_gemma":[0.0028565584,0.00024338852,0.00040783198,0.00083899056,0.0013627445,0.0039459504,0.0022231445,0.00069292,0.00045445084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024760696,0.00039510409,0.0039375937,0.0003567062,0.00013720835,0.0014515916,0.0010721377,0.062745795,0.441411,0.096496135,0.004502625,0.385018],"study_design_scores_gemma":[0.00021390333,0.0010783296,0.002453255,0.000046138903,0.00011566686,0.0027352795,0.00045476962,0.55205667,0.3533705,0.06832063,0.018981503,0.00017331012],"about_ca_topic_score_codex":0.0007494175,"about_ca_topic_score_gemma":0.00053429545,"teacher_disagreement_score":0.0016000232,"about_ca_system_score_codex":0.00046283405,"about_ca_system_score_gemma":0.000573627,"threshold_uncertainty_score":0.0053526163},"labels":[],"label_agreement":null},{"id":"W2079521226","doi":"10.1016/j.comnet.2004.01.001","title":"A systematic approach for encryption and authentication with fault tolerance","year":2004,"lang":"en","type":"article","venue":"Computer Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Checksum; Computer science; Encryption; Error detection and correction; Hash function; Overhead (engineering); Authentication (law); Fault tolerance; Computation; Computer engineering; Cryptosystem; Algorithm; Theoretical computer science; Distributed computing; Computer network; Computer security; Operating system","score_opus":0.007780039958344512,"score_gpt":0.20387045805319748,"score_spread":0.19609041809485298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079521226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054754183,0.00042241122,0.99558866,0.00033820656,0.00010950481,0.00010107364,0.00002133281,0.00026770882,0.0026035928],"genre_scores_gemma":[0.05494838,0.001564732,0.9336269,0.00052483333,0.00028933896,0.00057930325,0.00012012999,0.00023155441,0.008114824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935762,0.0016440726,0.00058102567,0.0006835808,0.0030877101,0.0004273751],"domain_scores_gemma":[0.99581474,0.0007485552,0.00019268594,0.0020342292,0.0011026347,0.00010725529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027066655,0.0016016528,0.001480224,0.003088439,0.0027570245,0.0037932787,0.0035181288,0.0029253685,0.003146356],"category_scores_gemma":[0.0067086187,0.0010727819,0.0025263496,0.002392936,0.005173341,0.0071527273,0.004809036,0.0058825603,0.00277518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034006378,0.000062947336,0.00017733697,0.00025084216,0.000041073898,0.00014826034,0.0002738619,0.0057836818,0.0037902507,0.903299,0.0046972013,0.08144156],"study_design_scores_gemma":[0.000031427466,0.000098117365,0.0001438973,0.0002092364,0.00009807807,0.0006744939,0.00012611525,0.05266879,0.008700086,0.87604284,0.0611255,0.00008135007],"about_ca_topic_score_codex":0.0014083025,"about_ca_topic_score_gemma":0.00194235,"teacher_disagreement_score":0.0037932787,"about_ca_system_score_codex":0.0019505222,"about_ca_system_score_gemma":0.0036505125,"threshold_uncertainty_score":0.0143143535},"labels":[],"label_agreement":null},{"id":"W2079878540","doi":"10.1145/1577222.1577254","title":"Towards compromise-resilient localized authentication architecture for wireless mesh networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compromise; Wireless mesh network; Computer network; Computer science; Authentication (law); Handover; Wireless network; Mesh networking; Computer security; Architecture; Wireless; Distributed computing; Telecommunications; Geography","score_opus":0.0123028997586455,"score_gpt":0.26127606419264754,"score_spread":0.24897316443400203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079878540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020779748,0.00036350993,0.9769092,0.00022335496,0.00006559013,0.00006929384,0.000009151057,0.0008067621,0.0007733144],"genre_scores_gemma":[0.7662784,0.00032479683,0.23072185,0.00016287419,0.00008561929,0.00011128494,0.000058774,0.000030019337,0.0022264312],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987645,0.00037471327,0.000096184966,0.00020127471,0.00044239266,0.00012085244],"domain_scores_gemma":[0.9983463,0.00037213988,0.00026639886,0.00050072937,0.00042634484,0.000088177534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019129117,0.0005232861,0.0005850939,0.0006975606,0.00076737645,0.0010639,0.0021304819,0.0013681009,0.0010719441],"category_scores_gemma":[0.0024865214,0.00030693584,0.00045648753,0.00037791862,0.00093341956,0.002944089,0.0021199833,0.0015468987,0.00055246236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011289001,0.0003042569,0.0024055955,0.00045872468,0.00032979564,0.0008212399,0.0011475377,0.19999537,0.26341367,0.1627782,0.0053037773,0.36191294],"study_design_scores_gemma":[0.000059079368,0.0005594528,0.00047386726,0.000039645478,0.00012527539,0.00046693283,0.00011739467,0.90282077,0.056709405,0.027100522,0.0114633525,0.00006415947],"about_ca_topic_score_codex":0.00026684473,"about_ca_topic_score_gemma":0.0003360238,"teacher_disagreement_score":0.0021304819,"about_ca_system_score_codex":0.00073659525,"about_ca_system_score_gemma":0.00046827897,"threshold_uncertainty_score":0.010116518},"labels":[],"label_agreement":null},{"id":"W2080112733","doi":"10.1145/2332432.2332473","title":"Brief announcement","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Scalability; Computation; Computer science; Constant (computer programming); Fraction (chemistry); Nash equilibrium; Protocol (science); Function (biology); Theoretical computer science; Channel (broadcasting); Algorithm; Computer network; Mathematics; Mathematical optimization","score_opus":0.016832718762028014,"score_gpt":0.24071839001990103,"score_spread":0.223885671257873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080112733","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001810084,0.012142841,0.09242009,0.02365882,0.041965287,0.00092319155,0.012431784,0.011368767,0.803279],"genre_scores_gemma":[0.012945943,0.008631533,0.037072644,0.011644467,0.008382036,0.0006193183,0.014447127,0.002977602,0.90327924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825734,0.0002893852,0.00012453867,0.00034245162,0.00077529217,0.00021090823],"domain_scores_gemma":[0.9966466,0.00054758915,0.00015493704,0.0006275633,0.0011436446,0.00087965233],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001518065,0.0013417132,0.00084299454,0.0019224663,0.0018823579,0.0044313245,0.0031539237,0.0028257337,0.5571161],"category_scores_gemma":[0.0066390904,0.00059850333,0.0012918242,0.0018697013,0.000641868,0.0049494533,0.0037801168,0.0031064528,0.41645807],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010272616,0.00008664017,0.00029545804,0.00042228776,0.000016714057,0.00019187586,0.00006312886,0.0005064052,0.0010084313,0.03510579,0.76205057,0.2001499],"study_design_scores_gemma":[0.000010755926,0.000023756662,0.00007911491,0.000055124223,0.0000056445747,0.00014464001,0.000024313682,0.00028536163,0.00033996275,0.0065394505,0.9924833,0.000008431972],"about_ca_topic_score_codex":0.0011397223,"about_ca_topic_score_gemma":0.001785552,"teacher_disagreement_score":0.4428839,"about_ca_system_score_codex":0.001462798,"about_ca_system_score_gemma":0.0023225823,"threshold_uncertainty_score":0.6317201},"labels":[],"label_agreement":null},{"id":"W2083109656","doi":"10.1117/12.834183","title":"Conditioning properties of the LLL algorithm","year":2009,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lattice reduction; Algorithm; Conditioning; Computer science; Matrix algebra; Matrix (chemical analysis); Reduction (mathematics); Condition number; Mathematics; Physics; Statistics; Telecommunications","score_opus":0.011168609252834165,"score_gpt":0.21345184091780162,"score_spread":0.20228323166496745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083109656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01001459,0.00008518577,0.9824424,0.00021178678,0.000029648983,0.00010057516,0.00010009234,0.0016591597,0.0053565525],"genre_scores_gemma":[0.33815548,0.00023443214,0.64866364,0.000654191,0.00012399841,0.00051946356,0.00069487945,0.001158185,0.009795779],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970642,0.0008889277,0.00016585412,0.00036043674,0.0011671347,0.00035359204],"domain_scores_gemma":[0.9906791,0.0044382596,0.00063035643,0.001964906,0.0019309741,0.0003562465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023390995,0.00058753905,0.0007229793,0.0008833724,0.0008362768,0.0018404067,0.0012772803,0.0008680914,0.016126523],"category_scores_gemma":[0.014090098,0.00045400747,0.00036837117,0.0009682208,0.0020308094,0.002401629,0.0020574245,0.0020090789,0.00687491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013747778,0.00029520065,0.0026498525,0.00034578543,0.000041460884,0.00022081882,0.00042186902,0.19787389,0.050287522,0.24791427,0.014225528,0.48434895],"study_design_scores_gemma":[0.00015080784,0.00014178385,0.0004802022,0.000045793648,0.000012286231,0.00014730048,0.000053355412,0.875977,0.045507878,0.070985176,0.0064384583,0.00005998544],"about_ca_topic_score_codex":0.0015812004,"about_ca_topic_score_gemma":0.0018530833,"teacher_disagreement_score":0.016126523,"about_ca_system_score_codex":0.00091148785,"about_ca_system_score_gemma":0.0020285125,"threshold_uncertainty_score":0.05394858},"labels":[],"label_agreement":null},{"id":"W2085375867","doi":"10.5539/cis.v3n4p224","title":"Application of the Central Encryption System in the Dynamic Secret Sharing Scheme (II)","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Encryption; Scheme (mathematics); Secret sharing; Attribute-based encryption; Integer (computer science); Key (lock); Theoretical computer science; Set (abstract data type); Computer security; Algorithm; Cryptography; Public-key cryptography; Mathematics; Operating system","score_opus":0.004932492119650793,"score_gpt":0.2171906077911268,"score_spread":0.212258115671476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085375867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071096584,0.0013926892,0.9146804,0.00037043157,0.00033891993,0.000285611,0.00007434446,0.0007584821,0.011002568],"genre_scores_gemma":[0.8712332,0.00041995296,0.123847775,0.00013672347,0.00007891755,0.00014070077,0.000068163135,0.00002566712,0.0040488136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999054,0.0002974148,0.000063257954,0.0002091138,0.00023441645,0.00014186003],"domain_scores_gemma":[0.99955314,0.000074319294,0.00005311776,0.000183915,0.00010195084,0.00003347636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069174427,0.00032997996,0.00062348275,0.00040585146,0.000765792,0.00091808295,0.0007408205,0.0006118028,0.001434219],"category_scores_gemma":[0.0011110774,0.00019031404,0.00052950066,0.0005522886,0.0008095264,0.0014872653,0.0015336565,0.00090221316,0.00044615247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010369117,0.00019207518,0.0024460873,0.000533121,0.00015895856,0.0013133356,0.0010148283,0.038068492,0.21351454,0.3407121,0.0054553,0.39555433],"study_design_scores_gemma":[0.00041165267,0.0018408948,0.002825792,0.00016011331,0.0002354108,0.008314261,0.00038949988,0.46685243,0.3105553,0.12661202,0.08153008,0.0002725569],"about_ca_topic_score_codex":0.00031651204,"about_ca_topic_score_gemma":0.00021816426,"teacher_disagreement_score":0.001434219,"about_ca_system_score_codex":0.00053310994,"about_ca_system_score_gemma":0.00083921716,"threshold_uncertainty_score":0.004797876},"labels":[],"label_agreement":null},{"id":"W2086400596","doi":"10.1109/noms.2014.6838229","title":"Identity access management for Multi-tier cloud infrastructures","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cloud computing; Testbed; Computer science; Identity management; Scalability; Software deployment; Access management; Architecture; Computer security; Computer network; Distributed computing; Database; Access control; Software engineering; Operating system","score_opus":0.029530817964257283,"score_gpt":0.32045188129527397,"score_spread":0.2909210633310167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086400596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1932693,0.0011091643,0.7860284,0.0011844272,0.00020951558,0.0004296421,0.0001232661,0.0067567443,0.010889551],"genre_scores_gemma":[0.93163186,0.00015365958,0.06572444,0.00013436418,0.000055588425,0.000042745884,0.00013797976,0.000056455254,0.0020628674],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754083,0.0004374465,0.00020004854,0.00040718075,0.00083317875,0.0005814057],"domain_scores_gemma":[0.9967008,0.00031139367,0.0004446446,0.001418784,0.0006039567,0.000520432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002007755,0.00033821847,0.0005653018,0.0007657015,0.002275744,0.003067577,0.0021464988,0.00073615136,0.0013200784],"category_scores_gemma":[0.0024498994,0.00031688795,0.00041457193,0.00071451266,0.00087463734,0.0037317045,0.0037982373,0.0013233678,0.0004778297],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001236431,0.0010778981,0.03321321,0.00034271652,0.00026509436,0.0017576001,0.0018822358,0.10310281,0.16498707,0.18188377,0.023427438,0.4868238],"study_design_scores_gemma":[0.0000627998,0.0002809193,0.008037915,0.00003861162,0.00007513916,0.0007734143,0.0005348628,0.88699377,0.04174424,0.030276742,0.03106129,0.00012033145],"about_ca_topic_score_codex":0.005002916,"about_ca_topic_score_gemma":0.004595183,"teacher_disagreement_score":0.005002916,"about_ca_system_score_codex":0.0024943894,"about_ca_system_score_gemma":0.0020126165,"threshold_uncertainty_score":0.018098176},"labels":[],"label_agreement":null},{"id":"W2088810783","doi":"10.1109/mwc.2015.7096296","title":"Security and privacy in cloud-assisted wireless wearable communications: Challenges, solutions, and future directions","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Wearable computer; Cloud computing; Wireless; Wearable technology; Encryption; Computer security; Homomorphic encryption; Information privacy; Telecommunications; Embedded system","score_opus":0.07619358547997361,"score_gpt":0.29286816049784276,"score_spread":0.21667457501786913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088810783","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022140803,0.29601666,0.33358997,0.31162062,0.0022378617,0.00017280779,0.00014185428,0.00026669563,0.03381273],"genre_scores_gemma":[0.44236687,0.35251826,0.17268412,0.011244837,0.009178866,0.00033304756,0.00020125498,0.00010767689,0.011365037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99572057,0.00198148,0.00024587766,0.00043180923,0.001143272,0.00047709144],"domain_scores_gemma":[0.9861879,0.009217229,0.00083872804,0.001617812,0.0016399605,0.0004983865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080017485,0.00074989407,0.0012804308,0.0011433689,0.0024935566,0.007834099,0.0022168262,0.0069220224,0.0029556735],"category_scores_gemma":[0.007866831,0.0006111323,0.0010955,0.0025552486,0.005942649,0.017015861,0.0041225823,0.0068700574,0.0007029819],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096529155,0.00023491766,0.0017707917,0.0013316151,0.00007960128,0.0005279239,0.0008296424,0.011493113,0.0018038622,0.707135,0.019802757,0.25489414],"study_design_scores_gemma":[0.000029768447,0.00014474933,0.000737891,0.0011847176,0.000044471886,0.001269159,0.0031507122,0.06715431,0.00235203,0.84253305,0.08129941,0.00009975637],"about_ca_topic_score_codex":0.0012140505,"about_ca_topic_score_gemma":0.0009551197,"teacher_disagreement_score":0.0080017485,"about_ca_system_score_codex":0.0019207075,"about_ca_system_score_gemma":0.003132753,"threshold_uncertainty_score":0.042317748},"labels":[],"label_agreement":null},{"id":"W2089209641","doi":"10.1109/socialcom.2013.163","title":"A Notary Extension for the Online Certificate Status Protocol","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Certificate; Public key certificate; Computer science; Computer security; Authorization certificate; Certificate authority; Root certificate; Authentication (law); Protocol (science); Implicit certificate; Death certificate; Extension (predicate logic); Public-key cryptography; Key (lock); Birth certificate; Internet privacy; Medicine; Theoretical computer science; Encryption; Programming language","score_opus":0.09578804052241734,"score_gpt":0.3172337898355491,"score_spread":0.22144574931313177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089209641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02742296,0.0009799412,0.847383,0.004704205,0.0027530089,0.001997663,0.0011958587,0.010352463,0.10321086],"genre_scores_gemma":[0.5543696,0.0019922503,0.3542071,0.003815111,0.0021455006,0.002524575,0.003561102,0.0014864865,0.075898245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917378,0.002346901,0.0012599718,0.0006855171,0.0031917486,0.0007782452],"domain_scores_gemma":[0.9767278,0.006161002,0.001959768,0.009663999,0.0047363765,0.00075118156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007979116,0.00054144004,0.00065694953,0.0013180515,0.0022735372,0.0032314276,0.0020265693,0.0017178081,0.008439216],"category_scores_gemma":[0.01955764,0.00047954032,0.00073263736,0.0014658051,0.0025945615,0.009396664,0.0067407903,0.003987416,0.0025817489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010844667,0.00029498743,0.0029085716,0.0004418497,0.00003248968,0.0011272439,0.0013770582,0.0027273346,0.013345193,0.70107216,0.038085435,0.23750322],"study_design_scores_gemma":[0.00020020039,0.0006624465,0.0016935873,0.0004668269,0.000118365184,0.0026252365,0.00043653016,0.028275996,0.023521613,0.18573909,0.75605345,0.00020670185],"about_ca_topic_score_codex":0.0022156378,"about_ca_topic_score_gemma":0.0014319147,"teacher_disagreement_score":0.008439216,"about_ca_system_score_codex":0.0014802036,"about_ca_system_score_gemma":0.003848272,"threshold_uncertainty_score":0.042198062},"labels":[],"label_agreement":null},{"id":"W2090848562","doi":"10.1109/ccece.2014.6901132","title":"Frequency-based constraint relaxation for private query processing in cloud databases","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Database; View; Server; Constraint (computer-aided design); Range query (database); Information retrieval; Cloud computing; Web search query; Query language; Database server; Online aggregation; Distributed database; Private information retrieval; Cloud server; Query optimization; Sargable; Web query classification; Database design; Search engine; World Wide Web; Computer security; Mathematics","score_opus":0.02491718086787636,"score_gpt":0.26814408346970203,"score_spread":0.24322690260182567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090848562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057300664,0.00020554401,0.99090236,0.00063014415,0.00004174741,0.0001243293,0.00019625833,0.0001218218,0.0020477842],"genre_scores_gemma":[0.30100626,0.00090978073,0.6894909,0.0006446542,0.0003998737,0.00075387623,0.0006340173,0.0002527523,0.0059077754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9897127,0.0033756583,0.00084942137,0.0014045452,0.0036539377,0.0010037028],"domain_scores_gemma":[0.983904,0.009332852,0.0012440787,0.0036661846,0.0014213206,0.0004315072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007302,0.0009905678,0.0014432424,0.0010010884,0.0014851056,0.0038272988,0.0032701215,0.0014507606,0.004328583],"category_scores_gemma":[0.023970557,0.0008167992,0.0017222951,0.0030263527,0.0027986413,0.009964745,0.004586376,0.0053068562,0.0009167542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053657545,0.00024072778,0.00093142444,0.00039512632,0.00009980768,0.00037998092,0.00088529167,0.2744681,0.009119947,0.61621296,0.007718857,0.089011185],"study_design_scores_gemma":[0.00008447126,0.00011420779,0.00023546576,0.000040627507,0.00002921162,0.00027329984,0.00019612549,0.75481284,0.004914167,0.22978967,0.009452397,0.00005748328],"about_ca_topic_score_codex":0.0036773311,"about_ca_topic_score_gemma":0.0025414918,"teacher_disagreement_score":0.007302,"about_ca_system_score_codex":0.0026135836,"about_ca_system_score_gemma":0.0036223654,"threshold_uncertainty_score":0.038617134},"labels":[],"label_agreement":null},{"id":"W2091053039","doi":"10.1145/1163698.1163705","title":"Protecting the privacy of user's QoS preferences for multimedia applications","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Ontario Tech University","funders":"","keywords":"Computer science; Telephony; Quality of service; The Internet; Field (mathematics); Computer network; Computer security; Voice over IP; Videoconferencing; Privacy protection; Internet privacy; Multimedia; World Wide Web","score_opus":0.020161009696637488,"score_gpt":0.257079078202027,"score_spread":0.23691806850538955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091053039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10900389,0.002018101,0.85955393,0.0044904165,0.00015428384,0.00030933297,0.0002382711,0.001074863,0.023156948],"genre_scores_gemma":[0.902704,0.0010908742,0.090041,0.00045134287,0.00020786605,0.0001367487,0.00013185819,0.000083363615,0.005152933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523854,0.0018304999,0.00029848056,0.0004945787,0.0017328362,0.00040502206],"domain_scores_gemma":[0.98393387,0.0045309793,0.0014555535,0.008748166,0.00097607326,0.00035529843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004676968,0.0005917351,0.0007611448,0.0006175537,0.0019895695,0.003997156,0.0014572394,0.002099754,0.0017017332],"category_scores_gemma":[0.012088603,0.00036643964,0.0007531605,0.000941542,0.0021882036,0.0056666993,0.003236795,0.0031123455,0.0008250275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014174042,0.0003310695,0.008788776,0.0004976686,0.0001572816,0.0015795795,0.0055209016,0.014530885,0.09792952,0.5208308,0.0056684297,0.34274772],"study_design_scores_gemma":[0.00021185911,0.0009595572,0.00695954,0.00045987352,0.00034185656,0.006311628,0.0020815835,0.17234197,0.22751576,0.452028,0.13049822,0.00029021292],"about_ca_topic_score_codex":0.00051394204,"about_ca_topic_score_gemma":0.0002943927,"teacher_disagreement_score":0.004676968,"about_ca_system_score_codex":0.00092876534,"about_ca_system_score_gemma":0.0017095105,"threshold_uncertainty_score":0.024734437},"labels":[],"label_agreement":null},{"id":"W2093126997","doi":"10.1109/tcc.2014.2338324","title":"Fuzzy Authorization for Cloud Storage","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Revocation; Scalability; Encryption; Ciphertext; Computer security; Cloud storage; Cryptography; Secret sharing; Cryptographic primitive; Fuzzy logic; Flexibility (engineering); Database; Computer network; Cryptographic protocol; Operating system; Mathematics","score_opus":0.018400892300306157,"score_gpt":0.2570954794633033,"score_spread":0.23869458716299713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093126997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1081145,0.0011473583,0.86324495,0.00093298126,0.0002638893,0.0003815326,0.0003326517,0.0024935296,0.023088591],"genre_scores_gemma":[0.90950555,0.0003473597,0.08306337,0.00014639898,0.000077456694,0.00012513157,0.00016966568,0.000060261118,0.0065048845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986124,0.00027643153,0.00012672179,0.00018363506,0.00058672053,0.00021411576],"domain_scores_gemma":[0.99919516,0.0001436925,0.00008179938,0.0003273592,0.00018326289,0.00006861442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008865576,0.0002914184,0.0004555634,0.00063177553,0.001400777,0.0016803634,0.00079874025,0.00059031276,0.0030528088],"category_scores_gemma":[0.0017047492,0.00017426263,0.00044114696,0.00084238104,0.0010282055,0.0031238608,0.0015006599,0.00078104675,0.00070960924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013342439,0.00022938968,0.0021595312,0.00041704887,0.00005775356,0.0006646827,0.0007095803,0.084308945,0.109915264,0.5411138,0.009425219,0.24966452],"study_design_scores_gemma":[0.00015177995,0.00022811154,0.0010752823,0.0000706571,0.000056156394,0.00055232516,0.00023245832,0.7233671,0.07480682,0.15422603,0.04511333,0.00011997306],"about_ca_topic_score_codex":0.0024938246,"about_ca_topic_score_gemma":0.001829535,"teacher_disagreement_score":0.0030528088,"about_ca_system_score_codex":0.0013816942,"about_ca_system_score_gemma":0.0017532378,"threshold_uncertainty_score":0.01021266},"labels":[],"label_agreement":null},{"id":"W2093183065","doi":"10.1109/cloudcom.2012.6427504","title":"Towards privacy-preserving image template matching in the clouds","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Image (mathematics); Matching (statistics); Computer vision; Cloud computing; Image matching; Artificial intelligence; Computer security; Mathematics","score_opus":0.02464980042916221,"score_gpt":0.2801284154500541,"score_spread":0.2554786150208919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093183065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028304914,0.00038688837,0.9680443,0.0004878125,0.00006757096,0.00008849542,0.00014917398,0.00063784345,0.0018329913],"genre_scores_gemma":[0.6252265,0.0006635084,0.36877716,0.00031904798,0.00014659097,0.0001208448,0.00037040946,0.00014948765,0.0042264345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963052,0.0007337096,0.000245881,0.00046342803,0.0017134873,0.0005383591],"domain_scores_gemma":[0.9942478,0.0011527009,0.00055036665,0.0032945878,0.0005843908,0.00016999088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002065021,0.0005228337,0.0009805649,0.00071881985,0.001006193,0.0024170221,0.0020072039,0.0015378292,0.001611649],"category_scores_gemma":[0.0061500827,0.0005480478,0.00089040364,0.0019598047,0.0016550976,0.006696361,0.004395228,0.0022280854,0.0009712544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001548607,0.00027446338,0.002136346,0.00030320036,0.00013397624,0.000935349,0.0008783196,0.11627143,0.1330062,0.41750556,0.010474797,0.31653175],"study_design_scores_gemma":[0.000109822315,0.00019190028,0.0006948925,0.00004296108,0.000048751994,0.00095626584,0.0002865837,0.63034815,0.17485593,0.17224029,0.020145038,0.0000793675],"about_ca_topic_score_codex":0.0019713466,"about_ca_topic_score_gemma":0.0008675663,"teacher_disagreement_score":0.0024170221,"about_ca_system_score_codex":0.0010173318,"about_ca_system_score_gemma":0.001444249,"threshold_uncertainty_score":0.010921001},"labels":[],"label_agreement":null},{"id":"W2093442382","doi":"10.1109/secon.2010.5508202","title":"Fair Payments for Outsourced Computations","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Remuneration; Outsourcing; Laziness; Payment; Computer science; Cloud computing; Computation; Set (abstract data type); Computer security; Incentive; Business; Operating system; Microeconomics; Finance; World Wide Web; Economics; Algorithm","score_opus":0.012929200611405942,"score_gpt":0.26419077008901554,"score_spread":0.2512615694776096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093442382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06200748,0.00047459628,0.9092129,0.0016963965,0.00046112924,0.00043333793,0.00024361095,0.00078519573,0.02468532],"genre_scores_gemma":[0.82966375,0.0004047541,0.14467673,0.00023239372,0.00036809553,0.00039605997,0.00021086946,0.00024584957,0.02380152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898835,0.004031153,0.00055491505,0.0012272497,0.0027592496,0.0015439539],"domain_scores_gemma":[0.9852498,0.0039453097,0.0010876808,0.007482215,0.001412345,0.00082257006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009150256,0.00090194895,0.001433599,0.0011094761,0.0029535159,0.004873195,0.0026839771,0.0020580618,0.012935429],"category_scores_gemma":[0.0243751,0.0008091469,0.00096954545,0.0015931277,0.0032674633,0.0066031176,0.0065795034,0.0027779858,0.0022074454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001048313,0.00014169783,0.0013078244,0.0001815318,0.000054835862,0.00040679556,0.0006723971,0.079499796,0.0041828956,0.82047695,0.010683537,0.08134339],"study_design_scores_gemma":[0.00029106316,0.00013238945,0.00052256585,0.000090426365,0.000044848435,0.0002503502,0.00018576432,0.34008634,0.005067228,0.6285799,0.02469903,0.000050080158],"about_ca_topic_score_codex":0.0016216972,"about_ca_topic_score_gemma":0.0014439023,"teacher_disagreement_score":0.012935429,"about_ca_system_score_codex":0.0029033332,"about_ca_system_score_gemma":0.0039914954,"threshold_uncertainty_score":0.04839176},"labels":[],"label_agreement":null},{"id":"W2095378187","doi":"10.1007/s00145-001-0002-y","title":"Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"Defense Advanced Research Projects Agency","keywords":"Multicast; Communication source; Computer science; Computer network; Computation; Channel (broadcasting); Secure multicast; Scheme (mathematics); Wright; Authentication (law); Theoretical computer science; Xcast; Inter-domain; Mathematics; Algorithm; Computer security","score_opus":0.011147825728187974,"score_gpt":0.2749167811058279,"score_spread":0.26376895537763995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095378187","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06721897,0.017482106,0.19211152,0.5808322,0.0075601027,0.0001006158,0.00056065386,0.00048377106,0.13365017],"genre_scores_gemma":[0.888809,0.012214202,0.03483084,0.025163798,0.012054605,0.00018158868,0.00022387973,0.00025418785,0.026267774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967661,0.0012133324,0.000119379314,0.00045434447,0.0010307862,0.00041606286],"domain_scores_gemma":[0.9807264,0.013480088,0.0007507648,0.0027366122,0.0019008565,0.000405258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005661124,0.0006043729,0.001426317,0.0010427744,0.0034938129,0.0034752025,0.0016342906,0.01143135,0.008709589],"category_scores_gemma":[0.036106262,0.00066254806,0.0007634778,0.0014422622,0.008996131,0.032614153,0.0055688214,0.00802186,0.0024253584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013429251,0.000022047023,0.000121491874,0.00008108802,0.000014275358,0.00004086038,0.0002442629,0.00081594806,0.00026344202,0.95622087,0.027550537,0.014490991],"study_design_scores_gemma":[0.00003244205,0.00000813593,0.000041738014,0.000024081815,0.000006279709,0.000051359595,0.000079829086,0.0015758502,0.00021837062,0.98446333,0.013486194,0.000012410593],"about_ca_topic_score_codex":0.00087471434,"about_ca_topic_score_gemma":0.00047475583,"teacher_disagreement_score":0.01143135,"about_ca_system_score_codex":0.0018544339,"about_ca_system_score_gemma":0.0017395678,"threshold_uncertainty_score":0.029939294},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03327745325759631,"score_gpt":0.29865379497782757,"score_spread":0.2653763417202313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095677682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041076397,0.0002818038,0.9908703,0.0006229213,0.000088307665,0.00014135473,0.000051234903,0.00048418174,0.0033522733],"genre_scores_gemma":[0.4164197,0.0008594437,0.57074267,0.00042161913,0.0004071364,0.00077731017,0.00031365108,0.00010686115,0.009951569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725467,0.00068726414,0.00023318671,0.00043974377,0.0011615187,0.00022370323],"domain_scores_gemma":[0.99851805,0.00037332796,0.00017251278,0.00041453104,0.00035652227,0.00016507773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030594799,0.0005484505,0.0009496803,0.0009192247,0.0016418524,0.0023921076,0.0017198889,0.0014904062,0.0020901682],"category_scores_gemma":[0.0019457149,0.00045902532,0.0012337726,0.0008416609,0.0019244812,0.0037642743,0.0027852617,0.0021352202,0.00064486236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007779419,0.000105015795,0.00044740108,0.00014359887,0.000060823073,0.00041367297,0.00041841716,0.06929434,0.007918282,0.8763052,0.0051647103,0.039650716],"study_design_scores_gemma":[0.00012826391,0.00017200132,0.00040363285,0.00008669646,0.00007400811,0.0005901187,0.00015163279,0.6281192,0.006367183,0.27503046,0.08879088,0.000085878586],"about_ca_topic_score_codex":0.0022166143,"about_ca_topic_score_gemma":0.0021165793,"teacher_disagreement_score":0.0030594799,"about_ca_system_score_codex":0.0019334181,"about_ca_system_score_gemma":0.0027757422,"threshold_uncertainty_score":0.016180277},"labels":[],"label_agreement":null},{"id":"W2096107368","doi":"10.1007/3-540-48071-4_14","title":"Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Zero-knowledge proof; Gas meter prover; Permutation (music); Cryptography; Computer science; Theoretical computer science; Time complexity; Cryptographic protocol; Zero (linguistics); Polynomial; Mathematics; Cryptographic primitive; Discrete mathematics; Algorithm","score_opus":0.06504781997517334,"score_gpt":0.31057065287793156,"score_spread":0.24552283290275823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096107368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019693887,0.002775578,0.57510716,0.035706718,0.0016000454,0.0003222055,0.0010625011,0.0008357697,0.3628962],"genre_scores_gemma":[0.79835445,0.0058385623,0.11253762,0.0069122785,0.0029262176,0.0011068139,0.0014796237,0.0007561605,0.0700882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946315,0.001391358,0.00027817395,0.0009162305,0.0020258902,0.0007567864],"domain_scores_gemma":[0.9663862,0.025779696,0.00080926705,0.005260781,0.0012584658,0.00050562166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005354273,0.0019842535,0.0021032419,0.0022135337,0.004080205,0.00735741,0.004402075,0.00574374,0.018974924],"category_scores_gemma":[0.023600996,0.0015073854,0.00405016,0.00258706,0.010808896,0.051008087,0.00952545,0.018047998,0.004232562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003561471,0.000021843247,0.000053544834,0.00013533254,0.000015968582,0.000042481683,0.00008121418,0.0016461699,0.00013746029,0.9893175,0.003821325,0.0046916488],"study_design_scores_gemma":[0.0000072348785,0.0000036941326,0.000020232865,0.000021157703,0.000007632975,0.00002881116,0.000016563881,0.001712659,0.0001497582,0.9957837,0.0022435791,0.0000050176277],"about_ca_topic_score_codex":0.0007287063,"about_ca_topic_score_gemma":0.00071951345,"teacher_disagreement_score":0.018974924,"about_ca_system_score_codex":0.004128542,"about_ca_system_score_gemma":0.0017203236,"threshold_uncertainty_score":0.06347746},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01146492847783279,"score_gpt":0.2295075769623096,"score_spread":0.21804264848447683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096113448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015154271,0.0020425087,0.96204466,0.000858751,0.00044193733,0.00011721436,0.00009289829,0.00046538847,0.0187823],"genre_scores_gemma":[0.56674606,0.004401634,0.40295297,0.00042516366,0.0010352554,0.00027260318,0.00013380601,0.00025217107,0.02378033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966354,0.000986033,0.0002568561,0.00038648714,0.0015111777,0.00022412404],"domain_scores_gemma":[0.9896567,0.0073381965,0.00049956655,0.001308596,0.00086027797,0.00033673437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036400172,0.0005759199,0.001311879,0.0017283041,0.0016981742,0.0062759602,0.0020030015,0.002911255,0.0049666497],"category_scores_gemma":[0.022485953,0.0008137414,0.0010849377,0.005006342,0.0045267595,0.00862245,0.00388467,0.005682091,0.0012953164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004326373,0.000029513967,0.00008721279,0.00005037093,0.0000075496796,0.00006160379,0.00026558415,0.008691522,0.0007093275,0.9606905,0.0011369367,0.028226519],"study_design_scores_gemma":[0.0000109948205,0.000016281972,0.00003862754,0.00001864558,0.000007285799,0.000101281934,0.000041906253,0.07844833,0.00075744657,0.9160487,0.0044890237,0.000021493683],"about_ca_topic_score_codex":0.0007090126,"about_ca_topic_score_gemma":0.0004921481,"teacher_disagreement_score":0.0062759602,"about_ca_system_score_codex":0.0018616997,"about_ca_system_score_gemma":0.001458493,"threshold_uncertainty_score":0.019250453},"labels":[],"label_agreement":null},{"id":"W2096156163","doi":"10.1137/s0036144503439190","title":"A Survey of Public-Key Cryptosystems","year":2004,"lang":"en","type":"article","venue":"SIAM Review","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key (lock); Public key cryptosystem; Public-key cryptography; Cryptosystem; Computer security; Computer science; Cryptography; Encryption","score_opus":0.06250929679119811,"score_gpt":0.2939013193655985,"score_spread":0.2313920225744004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096156163","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0139368735,0.73065454,0.1558386,0.009996266,0.0020418176,0.00026778693,0.00070300227,0.00086809316,0.08569317],"genre_scores_gemma":[0.09322722,0.82697487,0.053358655,0.0019678278,0.0035041766,0.00025187735,0.0009049138,0.00016252672,0.019647876],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986658,0.00016972587,0.00011259288,0.00016713914,0.0007394127,0.00014531566],"domain_scores_gemma":[0.9988123,0.0005648961,0.000111751826,0.00017762401,0.00026590802,0.00006744876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012498564,0.000934252,0.0010329024,0.0036252162,0.0013700599,0.0028054256,0.0009644245,0.0013674443,0.00668742],"category_scores_gemma":[0.0024626276,0.000619448,0.00043896356,0.006464935,0.0011555348,0.0068183313,0.0013643021,0.002285572,0.004003707],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015175974,0.00018674492,0.00064877805,0.0041205604,0.000037710295,0.00017280951,0.00012353438,0.0034392145,0.0036686298,0.2734363,0.036276393,0.67773753],"study_design_scores_gemma":[0.000054784326,0.00017818403,0.0008902934,0.0010789526,0.000052901763,0.0019414888,0.00013924445,0.00935795,0.005418285,0.2344624,0.7463577,0.00006781277],"about_ca_topic_score_codex":0.00035015208,"about_ca_topic_score_gemma":0.0003303794,"teacher_disagreement_score":0.00668742,"about_ca_system_score_codex":0.0012502464,"about_ca_system_score_gemma":0.0015271629,"threshold_uncertainty_score":0.02237171},"labels":[],"label_agreement":null},{"id":"W2097241528","doi":"10.1007/978-3-642-36594-2_29","title":"On the Feasibility of Extending Oblivious Transfer","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"Oblivious transfer; Computer science; Extension (predicate logic); Cryptography; Protocol (science); Theoretical computer science; Transfer (computing); Algorithm","score_opus":0.03246745879794471,"score_gpt":0.2591633127104742,"score_spread":0.2266958539125295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097241528","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12121776,0.004065942,0.409863,0.013000257,0.00094184524,0.00021311388,0.0007572177,0.0011579825,0.44878286],"genre_scores_gemma":[0.9013239,0.0029496588,0.052798536,0.0015355775,0.0011341551,0.00043240358,0.0005793173,0.000509086,0.038737357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651283,0.0011617683,0.00018340841,0.00059153995,0.00094028725,0.0006102296],"domain_scores_gemma":[0.97454745,0.01950254,0.000665176,0.003953332,0.0009790779,0.00035232102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039980784,0.0009835908,0.0013717343,0.0011901594,0.0024684302,0.00353892,0.002489185,0.0026404005,0.015492189],"category_scores_gemma":[0.019796276,0.0009944362,0.0016216919,0.0018348162,0.0069869724,0.024744522,0.007398751,0.008388256,0.0023436083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020846038,0.000026003518,0.00010507508,0.00009485476,0.000009072436,0.00004775782,0.00013566224,0.0033075516,0.0006322333,0.9826354,0.0025952433,0.010202565],"study_design_scores_gemma":[0.000021428512,0.000015817957,0.00004189458,0.00002346306,0.00000758352,0.000032207234,0.000023224544,0.005283057,0.000506032,0.9914278,0.002610125,0.000007335312],"about_ca_topic_score_codex":0.00088398374,"about_ca_topic_score_gemma":0.00047521113,"teacher_disagreement_score":0.015492189,"about_ca_system_score_codex":0.0018066405,"about_ca_system_score_gemma":0.0016023039,"threshold_uncertainty_score":0.051826596},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05866860787291012,"score_gpt":0.3325185406351731,"score_spread":0.273849932762263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099739670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16037758,0.0022848384,0.8287363,0.0004648755,0.00012345117,0.0002612233,0.00039582024,0.0016811142,0.0056747887],"genre_scores_gemma":[0.8878965,0.0006602185,0.10797879,0.000109116074,0.00004271059,0.00007495884,0.00017945612,0.00004896756,0.003009248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986003,0.00026104815,0.00014600079,0.00012276703,0.0006000561,0.00026986768],"domain_scores_gemma":[0.99776316,0.0006350801,0.0002543434,0.00080475817,0.0004418709,0.000100794656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088382576,0.0003569366,0.0010596492,0.00081846764,0.0008616754,0.0016192603,0.001271843,0.00076139474,0.0020104388],"category_scores_gemma":[0.0036111872,0.00024236867,0.00057010184,0.0018097959,0.00075362826,0.004648341,0.0021810906,0.00062179717,0.001013518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003131528,0.00064721104,0.0045862244,0.0010884773,0.00019873101,0.001656797,0.0011630567,0.14378978,0.22390135,0.13844776,0.0115035,0.46988565],"study_design_scores_gemma":[0.00016197286,0.00047891395,0.00079676125,0.000056603276,0.00008396,0.0017185915,0.0003943929,0.8365327,0.110232145,0.0395624,0.009845433,0.00013616466],"about_ca_topic_score_codex":0.0019296473,"about_ca_topic_score_gemma":0.0018851623,"teacher_disagreement_score":0.0020104388,"about_ca_system_score_codex":0.0007317907,"about_ca_system_score_gemma":0.0017041415,"threshold_uncertainty_score":0.0067255497},"labels":[],"label_agreement":null},{"id":"W2100684940","doi":"10.1109/ebiss.2009.5137919","title":"An Efficient Fault Tolerant Cryptosystem","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cryptosystem; Computer science; Hybrid cryptosystem; Hash function; Message authentication code; Error detection and correction; Authentication (law); Fault tolerance; Overhead (engineering); Encryption; Paillier cryptosystem; Cryptography; Computer network; Theoretical computer science; Algorithm; Distributed computing; Computer security","score_opus":0.008276856055911858,"score_gpt":0.2455762267859315,"score_spread":0.23729937073001964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100684940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028914763,0.00084113114,0.9583562,0.00078574585,0.00029736443,0.00015709086,0.000110194225,0.0019751396,0.0085622985],"genre_scores_gemma":[0.6547091,0.0010326047,0.33373806,0.00043709434,0.00028099678,0.00016814005,0.0002517297,0.00011904485,0.009263309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906176,0.00013609088,0.00005904934,0.00011242267,0.00051679916,0.000113874215],"domain_scores_gemma":[0.99944144,0.00010813154,0.00006435547,0.00023555165,0.00012013248,0.000030444775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005358145,0.0004212686,0.00047235505,0.0007755972,0.00078609324,0.0010566612,0.00091002695,0.00077897956,0.0028624553],"category_scores_gemma":[0.0010415288,0.00021848422,0.0002828972,0.0006965081,0.0006498115,0.0023594138,0.0011802961,0.0009861017,0.00088061846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005295658,0.00020003393,0.00050423335,0.00040414307,0.000066280976,0.0005978963,0.00017169472,0.07120651,0.09380463,0.4775953,0.01292537,0.34199437],"study_design_scores_gemma":[0.00030387793,0.000518413,0.0005271364,0.000076000935,0.00009046567,0.0017350417,0.000085308704,0.5897728,0.12366938,0.19527993,0.087834306,0.00010742899],"about_ca_topic_score_codex":0.00022573142,"about_ca_topic_score_gemma":0.00018149649,"teacher_disagreement_score":0.0028624553,"about_ca_system_score_codex":0.00054979033,"about_ca_system_score_gemma":0.0007485507,"threshold_uncertainty_score":0.009575844},"labels":[],"label_agreement":null},{"id":"W2100714716","doi":"10.1109/focs.2007.22","title":"Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PSPACE; Speedup; Completeness (order theory); Exponential function; Computational complexity theory; Computer science; Bounded function; Computation; Reduction (mathematics); Mathematics; Time complexity; Discrete mathematics; Algorithm; Theoretical computer science; Parallel computing","score_opus":0.013621218446061276,"score_gpt":0.24306294728134392,"score_spread":0.22944172883528263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100714716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21070744,0.0027020392,0.6634215,0.009213014,0.0005935921,0.0006780903,0.00075385737,0.004253634,0.10767686],"genre_scores_gemma":[0.6538488,0.0013237651,0.3249335,0.0011027354,0.00028613213,0.000547186,0.00095080957,0.0015039409,0.015503078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99474674,0.0012829573,0.00020571251,0.0007577317,0.001883018,0.0011237817],"domain_scores_gemma":[0.9879457,0.008487502,0.0004376884,0.0021840688,0.0005302516,0.00041486777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037228968,0.0019372358,0.001465424,0.0010092873,0.0015954844,0.0030763187,0.0021860693,0.0019057982,0.02002063],"category_scores_gemma":[0.01284464,0.00080152205,0.0028196203,0.0010994143,0.0036441719,0.007765135,0.0037349728,0.007451349,0.002540682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002646936,0.0010527378,0.0016334335,0.001236221,0.00018807617,0.0006405151,0.0007601491,0.20189758,0.06515423,0.5365567,0.017296825,0.17093648],"study_design_scores_gemma":[0.00048306127,0.00023354904,0.00068523706,0.00008000924,0.00011267627,0.00040495006,0.0001982298,0.37311676,0.042849276,0.57077396,0.011011264,0.00005106683],"about_ca_topic_score_codex":0.0024366444,"about_ca_topic_score_gemma":0.0038489467,"teacher_disagreement_score":0.02002063,"about_ca_system_score_codex":0.0027340387,"about_ca_system_score_gemma":0.0033151614,"threshold_uncertainty_score":0.06697571},"labels":[],"label_agreement":null},{"id":"W2101007911","doi":"10.1002/sec.213","title":"Digital credentials with privacy‐preserving delegation","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Computer science; Collusion; Delegation; Computer security; Malice; Certification; Security token; Cryptography; Certificate authority; Verifiable secret sharing; Public-key cryptography; Law; Encryption; Business","score_opus":0.005260355041786379,"score_gpt":0.20968399751026207,"score_spread":0.2044236424684757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101007911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031580236,0.0007687381,0.9428812,0.0013241487,0.00037157795,0.00019843306,0.00015123296,0.0011098882,0.021614473],"genre_scores_gemma":[0.8447667,0.0006249818,0.14136904,0.00036560712,0.00035563213,0.00016112391,0.00015886693,0.000115692295,0.012082456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9923534,0.002368194,0.0006825611,0.0009950867,0.0028986032,0.00070217106],"domain_scores_gemma":[0.9899672,0.002354534,0.0008557774,0.00543026,0.00076426275,0.00062795356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047074696,0.00051637244,0.0006461445,0.0010791704,0.0013634423,0.0045432188,0.0016680538,0.0013904043,0.004692375],"category_scores_gemma":[0.012020667,0.00045432628,0.0009432795,0.0013792844,0.004658383,0.008030164,0.007956848,0.0024053117,0.0018130825],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047612804,0.00012856096,0.00072383054,0.00025358394,0.00004475028,0.00043442572,0.00051771343,0.016589994,0.010528579,0.8693116,0.0036643404,0.09732656],"study_design_scores_gemma":[0.00027155376,0.00026455303,0.00044984906,0.00015654574,0.00009240825,0.00168373,0.00014375929,0.14037794,0.043364193,0.70410675,0.10897145,0.00011723068],"about_ca_topic_score_codex":0.00046990367,"about_ca_topic_score_gemma":0.0002240807,"teacher_disagreement_score":0.0047074696,"about_ca_system_score_codex":0.0012967162,"about_ca_system_score_gemma":0.0015655145,"threshold_uncertainty_score":0.024895787},"labels":[],"label_agreement":null},{"id":"W2101685889","doi":"10.1109/isit.2006.261795","title":"Secure Dot-product Protocol Using Trace Functions","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication source; Dot product; Protocol (science); Computer science; Overhead (engineering); TRACE (psycholinguistics); Product (mathematics); Universal composability; Computer network; Scheme (mathematics); Distributed computing; Theoretical computer science; Cryptography; Cryptographic protocol; Mathematics; Algorithm","score_opus":0.020177906813075835,"score_gpt":0.268593324097096,"score_spread":0.2484154172840202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101685889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03459894,0.00016325447,0.9510571,0.0005780473,0.00008252908,0.0004975783,0.00024219614,0.0025586416,0.010221788],"genre_scores_gemma":[0.7635632,0.0003283222,0.21345736,0.00032341332,0.00009770238,0.0014007271,0.00079793175,0.00038807932,0.019643323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906109,0.0031877907,0.00088767504,0.0013552444,0.002790523,0.0011678855],"domain_scores_gemma":[0.9867662,0.004463778,0.00084473117,0.0054109627,0.0018620577,0.00065218733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006249229,0.0010482845,0.0015681358,0.0009603496,0.0018024577,0.0038980818,0.0024441818,0.002295653,0.009450581],"category_scores_gemma":[0.011317585,0.0007792632,0.0010074256,0.0018639544,0.0035045191,0.010664785,0.008219868,0.0032446554,0.003066886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015095735,0.00035026722,0.0007308514,0.00030362836,0.000095453026,0.0006635349,0.00087849575,0.024578402,0.01619126,0.8799075,0.005152282,0.069638714],"study_design_scores_gemma":[0.000451631,0.00057079643,0.0002448459,0.000078988276,0.00008536256,0.00063222053,0.00021392958,0.31499198,0.051346812,0.60866064,0.022563415,0.0001593779],"about_ca_topic_score_codex":0.00094623596,"about_ca_topic_score_gemma":0.00060657994,"teacher_disagreement_score":0.009450581,"about_ca_system_score_codex":0.0015851664,"about_ca_system_score_gemma":0.0029271464,"threshold_uncertainty_score":0.033049524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.045704178790714714,"score_gpt":0.33703626263929365,"score_spread":0.29133208384857895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102859083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033214483,0.00071926706,0.9587056,0.0008260716,0.00018482597,0.00021470634,0.00012357306,0.0008753325,0.0051362514],"genre_scores_gemma":[0.8762312,0.00064240186,0.1171818,0.0005299965,0.00018514392,0.00021736784,0.00019391744,0.000044198794,0.004773957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966664,0.001271781,0.0002405428,0.00033313927,0.0011217736,0.00036632776],"domain_scores_gemma":[0.9952485,0.0017632856,0.0006079878,0.0016582869,0.0004705726,0.0002514042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029073223,0.00083235063,0.0010557908,0.0009003815,0.0010198666,0.0013904406,0.001229424,0.0016337935,0.0016036785],"category_scores_gemma":[0.0058555123,0.00031159728,0.0009626357,0.0009458061,0.0021663897,0.0038088427,0.005098089,0.0021591843,0.00070197234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002360116,0.00025671718,0.0022960354,0.0009857849,0.00043824344,0.0018520929,0.0017880535,0.15981907,0.14952168,0.43083695,0.0103336675,0.23951167],"study_design_scores_gemma":[0.00046333318,0.0017847435,0.00128645,0.0001821185,0.00031705614,0.0030866966,0.00046697268,0.64769065,0.11021257,0.18828861,0.04592172,0.0002990946],"about_ca_topic_score_codex":0.00018027828,"about_ca_topic_score_gemma":0.000191264,"teacher_disagreement_score":0.0029073223,"about_ca_system_score_codex":0.0005221594,"about_ca_system_score_gemma":0.0010407561,"threshold_uncertainty_score":0.015375555},"labels":[],"label_agreement":null},{"id":"W2104071065","doi":"10.1007/978-3-642-28496-0_18","title":"Another Look at Tightness","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical proof; Encryption; Computer security; Authentication (law); Scheme (mathematics); Theoretical computer science; Network security; Computer network; Mathematics","score_opus":0.016664275577869016,"score_gpt":0.23279366904240242,"score_spread":0.21612939346453341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104071065","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009823321,0.026009945,0.14117248,0.028246753,0.004088853,0.000037754733,0.00033920855,0.0005274217,0.7897543],"genre_scores_gemma":[0.4553997,0.026285877,0.059144344,0.02322789,0.011463029,0.00028898072,0.00061903015,0.0039380523,0.4196331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980584,0.0004655117,0.00008622215,0.00051322766,0.0005980273,0.00027859354],"domain_scores_gemma":[0.9967618,0.0014841729,0.00015987862,0.000747031,0.00058997376,0.00025708426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015467441,0.001455643,0.0017940396,0.0031757501,0.0045352057,0.005102323,0.0018671872,0.0019485089,0.04751846],"category_scores_gemma":[0.007892029,0.0010572583,0.001118575,0.0037978622,0.013214724,0.031038761,0.0050785094,0.013352905,0.006672252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009704506,0.00000620758,0.000020278676,0.00003291008,0.0000031261336,0.000009152335,0.00020218726,0.000117053736,0.000101633574,0.9878889,0.0063696573,0.005239133],"study_design_scores_gemma":[0.0000056896147,0.000011761856,0.000054183332,0.00006445257,0.000006477568,0.000037473044,0.00018621517,0.00022849462,0.000101389036,0.9488954,0.050398547,0.000010003113],"about_ca_topic_score_codex":0.00327067,"about_ca_topic_score_gemma":0.0025782282,"teacher_disagreement_score":0.04751846,"about_ca_system_score_codex":0.0037235601,"about_ca_system_score_gemma":0.0010560674,"threshold_uncertainty_score":0.15896511},"labels":[],"label_agreement":null},{"id":"W2104145890","doi":"10.1515/jmc.2009.003","title":"One-round secure comparison of integers","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Predicate (mathematical logic); Extension (predicate logic); Computer science; Common value auction; Proxy (statistics); Set (abstract data type); Theoretical computer science; Encryption; Cryptography; Discrete mathematics; Mathematics; Computer security; Programming language; Statistics","score_opus":0.034336978482490815,"score_gpt":0.3210987023680869,"score_spread":0.28676172388559606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104145890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29894742,0.0003067652,0.6769302,0.00158608,0.00018704993,0.0002711935,0.00026064378,0.00092349417,0.020587206],"genre_scores_gemma":[0.95669776,0.00007862543,0.039480608,0.00013247388,0.000040617942,0.000058228143,0.00008633898,0.000058027414,0.0033673428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99385035,0.0022130627,0.00035823518,0.0010143025,0.0018555104,0.0007084992],"domain_scores_gemma":[0.98817015,0.0058622365,0.0012397696,0.0037272556,0.0006754713,0.00032523158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004370697,0.00040409435,0.0008750495,0.00055469555,0.00079847727,0.0030604547,0.001823249,0.0008388982,0.004107859],"category_scores_gemma":[0.0107699875,0.00027432517,0.0007089015,0.0007344731,0.0031721895,0.0077200346,0.0034473797,0.0019653123,0.00066714536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018742474,0.00020058679,0.0020565898,0.00024525504,0.0001063182,0.00042342968,0.0008326874,0.043412592,0.023083502,0.8522704,0.0025838309,0.072910585],"study_design_scores_gemma":[0.00018941292,0.00046037853,0.00092909223,0.000081909995,0.000082391896,0.00045264838,0.00036419736,0.20954871,0.0850441,0.6922352,0.010520482,0.00009155978],"about_ca_topic_score_codex":0.00029931054,"about_ca_topic_score_gemma":0.00021812785,"teacher_disagreement_score":0.004370697,"about_ca_system_score_codex":0.0014799294,"about_ca_system_score_gemma":0.0011643764,"threshold_uncertainty_score":0.02311474},"labels":[],"label_agreement":null},{"id":"W2105494211","doi":"10.1007/978-3-642-22450-8_15","title":"Improved Access Control Mechanism in Vehicular Ad Hoc Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Access control; Computer science; Encryption; Computer network; Vehicular ad hoc network; Wireless ad hoc network; Scheme (mathematics); Control (management); Access time; Computer security; Telecommunications; Wireless; Artificial intelligence; Computer hardware","score_opus":0.01468769262553094,"score_gpt":0.23222651974793454,"score_spread":0.2175388271224036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105494211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043173254,0.0061776484,0.9387747,0.0003649393,0.0007271919,0.00011046645,0.00006911587,0.0014171388,0.009185513],"genre_scores_gemma":[0.88235044,0.0021559054,0.10325095,0.00013075845,0.0003629859,0.00010077218,0.00014868639,0.00007506442,0.01142449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982358,0.00046560625,0.00011535966,0.00019647944,0.00074535055,0.000241327],"domain_scores_gemma":[0.99849355,0.00047857547,0.00009446966,0.00044576818,0.0004301929,0.000057429108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014064688,0.0004945952,0.00081038766,0.00097195426,0.0005671119,0.0014072908,0.002176172,0.00086884614,0.0016437827],"category_scores_gemma":[0.0024378817,0.0002591716,0.00037547993,0.001008443,0.0007777616,0.0021711881,0.0011244612,0.0012243796,0.00045385907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005835886,0.00024031654,0.0008600749,0.00040787022,0.00011024875,0.0003942168,0.00030850677,0.12245419,0.07478552,0.40063345,0.007803867,0.3914182],"study_design_scores_gemma":[0.0000825268,0.00039603913,0.00086005474,0.00005636992,0.00013616469,0.0008724268,0.000097618315,0.8527148,0.026911326,0.08606115,0.03170791,0.00010364574],"about_ca_topic_score_codex":0.0008651171,"about_ca_topic_score_gemma":0.00064161356,"teacher_disagreement_score":0.002176172,"about_ca_system_score_codex":0.0006906323,"about_ca_system_score_gemma":0.0006135435,"threshold_uncertainty_score":0.0074382424},"labels":[],"label_agreement":null},{"id":"W2105890540","doi":"10.1109/dnsr.2004.1344713","title":"An authenticated broadcasting scheme for wireless ad hoc network","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless ad hoc network; Broadcasting (networking); Mobile ad hoc network; Scheme (mathematics); Broadcast communication network; Broadcast encryption; Signcryption; Atomic broadcast; Overhead (engineering); Block (permutation group theory); Distributed computing; Public-key cryptography; Wireless; Encryption; Telecommunications; Mathematics","score_opus":0.019044524374364453,"score_gpt":0.2678244584751866,"score_spread":0.24877993410082214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105890540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008206142,0.00079732714,0.9814586,0.00044014113,0.0003429881,0.0002562602,0.000092623486,0.0006948882,0.007711053],"genre_scores_gemma":[0.22402883,0.0017673823,0.7553745,0.00037333186,0.00050206546,0.0008401593,0.0004923987,0.00013671984,0.016484667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983803,0.0004720178,0.00012299484,0.00017180243,0.00074322306,0.00010962927],"domain_scores_gemma":[0.9990571,0.00015085035,0.00010078475,0.00031630645,0.00026504823,0.00011003133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001296602,0.000540008,0.0006690411,0.00075794384,0.0012305493,0.0010638853,0.0014479816,0.0011069978,0.0032966374],"category_scores_gemma":[0.002257917,0.00031398292,0.0005277072,0.0012397971,0.0010441566,0.0025950565,0.0021824266,0.0016708075,0.0013949005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021564147,0.00011565352,0.00031312785,0.00046261982,0.00008069145,0.00036428563,0.0007140816,0.017933473,0.057539575,0.67672694,0.00870346,0.23683046],"study_design_scores_gemma":[0.00044317605,0.0011258606,0.0005275225,0.00015281433,0.00022588005,0.0017559108,0.00021492828,0.33093247,0.043544453,0.27125418,0.34958962,0.00023320278],"about_ca_topic_score_codex":0.00051136414,"about_ca_topic_score_gemma":0.0004209304,"teacher_disagreement_score":0.0032966374,"about_ca_system_score_codex":0.0008473485,"about_ca_system_score_gemma":0.0011307617,"threshold_uncertainty_score":0.011028349},"labels":[],"label_agreement":null},{"id":"W2107642065","doi":"10.1109/ccc.2008.12","title":"Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gas meter prover; Soundness; Mathematical proof; Mathematics; Operator (biology); Quantum entanglement; Discrete mathematics; Algorithm; Theoretical computer science; Computer science; Quantum; Programming language","score_opus":0.03707795609743849,"score_gpt":0.2578911781674973,"score_spread":0.2208132220700588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107642065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08352469,0.0011678849,0.87185925,0.0014681206,0.00012198292,0.00014707074,0.00020581565,0.00051182543,0.040993378],"genre_scores_gemma":[0.86068,0.0007226748,0.13187584,0.0005949268,0.00017584713,0.00048363057,0.0001733634,0.00013491516,0.005158731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939359,0.0020392672,0.00032792764,0.00085729413,0.0020977652,0.0007418353],"domain_scores_gemma":[0.98371994,0.011352989,0.00088183815,0.0022315811,0.0012632369,0.0005504048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059256125,0.0010626728,0.0010625563,0.001849063,0.0016213839,0.0022804532,0.003959012,0.0016961964,0.0050403015],"category_scores_gemma":[0.015440195,0.0006361094,0.0017601606,0.0013914454,0.00757627,0.010391663,0.005544827,0.005664115,0.0005997182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028254542,0.000012161425,0.00011889731,0.000047872887,0.000013055607,0.00006519847,0.00019128968,0.0054159733,0.00085599825,0.9894326,0.00030942372,0.0035092644],"study_design_scores_gemma":[0.000025601119,0.000020146088,0.00011648508,0.000023074046,0.000014310859,0.000044447977,0.000031566105,0.07004783,0.00149652,0.9262855,0.0018736138,0.000020936293],"about_ca_topic_score_codex":0.0025725523,"about_ca_topic_score_gemma":0.0017452169,"teacher_disagreement_score":0.0059256125,"about_ca_system_score_codex":0.003732041,"about_ca_system_score_gemma":0.0020063664,"threshold_uncertainty_score":0.031337976},"labels":[],"label_agreement":null},{"id":"W2108167253","doi":"10.1109/iita.2008.87","title":"Threshold Cryptosystem Based Fair Off-Line E-cash","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Alberta Paraplegic Foundation","funders":"","keywords":"Electronic cash; Computer science; Tracing; Cryptosystem; Cryptography; Computer security; Encryption; Public-key cryptography; Payment; Operating system","score_opus":0.031111473557195866,"score_gpt":0.23666941394451516,"score_spread":0.20555794038731928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108167253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1605888,0.0007532581,0.82275844,0.0006289882,0.0001943349,0.00019072376,0.00007859616,0.00087289186,0.013934023],"genre_scores_gemma":[0.9632208,0.0002160828,0.0331482,0.00007593138,0.000029191855,0.00003159265,0.000028096569,0.000022241777,0.0032278805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998847,0.00024300917,0.00007840457,0.00017923757,0.0004105141,0.00024181421],"domain_scores_gemma":[0.9987748,0.0003884886,0.00015227273,0.00033141192,0.00026285186,0.00009013493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012499361,0.00026520324,0.00047226233,0.0009598081,0.0009581124,0.0018938286,0.00078601454,0.0007783852,0.0024690211],"category_scores_gemma":[0.0027225062,0.00016745672,0.0005030953,0.0008303718,0.0015835123,0.004789741,0.0010972472,0.00096856826,0.00030602506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067479647,0.00011194282,0.0014539827,0.00017747273,0.000050394978,0.00043545122,0.0005750155,0.054062054,0.029281193,0.81743693,0.0021411658,0.09359954],"study_design_scores_gemma":[0.0001586941,0.00039753845,0.00088441686,0.000088874025,0.000090282716,0.0009767207,0.00016505718,0.58652985,0.07491549,0.31127465,0.024379643,0.00013881417],"about_ca_topic_score_codex":0.00087261986,"about_ca_topic_score_gemma":0.00031623544,"teacher_disagreement_score":0.0024690211,"about_ca_system_score_codex":0.0015999211,"about_ca_system_score_gemma":0.0013474681,"threshold_uncertainty_score":0.011608303},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; 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","score_opus":0.011688910357513514,"score_gpt":0.24141323670064233,"score_spread":0.2297243263431288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111133028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08689311,0.0016997964,0.90357053,0.00066742464,0.00023091021,0.0004257389,0.00015547084,0.0012633122,0.0050936523],"genre_scores_gemma":[0.929877,0.0003492188,0.0673108,0.00010257247,0.000053530595,0.000109905435,0.00012427282,0.00003118549,0.0020415075],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99842095,0.00038711794,0.00015540364,0.0001420854,0.0005691321,0.00032523918],"domain_scores_gemma":[0.9986669,0.00025009835,0.00017378695,0.0005163013,0.00030999552,0.0000828641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013888256,0.00039429156,0.00070884643,0.0006388531,0.0010706547,0.001352244,0.0016233318,0.00060007494,0.0014323442],"category_scores_gemma":[0.0019874866,0.0002233397,0.0004755272,0.0009407596,0.0006844603,0.0035538834,0.0021878767,0.0008575635,0.0006295285],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024740794,0.00058948697,0.003476806,0.0006033805,0.0002797873,0.0018978073,0.0010141514,0.2358948,0.15881789,0.2339426,0.01784339,0.34316584],"study_design_scores_gemma":[0.00016194668,0.00029827602,0.0007934314,0.000049820545,0.00005889995,0.000875263,0.00026556302,0.88270444,0.057214342,0.040483683,0.017006593,0.00008769199],"about_ca_topic_score_codex":0.0010538438,"about_ca_topic_score_gemma":0.0012595921,"teacher_disagreement_score":0.0016233318,"about_ca_system_score_codex":0.0009642849,"about_ca_system_score_gemma":0.0012473048,"threshold_uncertainty_score":0.007344961},"labels":[],"label_agreement":null},{"id":"W2112383582","doi":"10.1109/icita.2005.62","title":"An Efficient Authentication Scheme with Fault Tolerance for Database Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Authentication (law); Checksum; Scheme (mathematics); Fault tolerance; Overhead (engineering); Digital signature; Data integrity; Computer network; Data Authentication Algorithm; Message authentication code; Error detection and correction; Authentication protocol; Database; Computer security; Cryptography; Distributed computing; Hash function; Operating system; Algorithm","score_opus":0.013253987854178568,"score_gpt":0.2613737850777717,"score_spread":0.24811979722359315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112383582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032234836,0.0014291268,0.9615256,0.00041219816,0.00024401423,0.00024331943,0.000062074585,0.0013737024,0.0024750342],"genre_scores_gemma":[0.7111904,0.0008163465,0.2822027,0.00021266082,0.00025129455,0.00019509178,0.00018001138,0.00007766345,0.0048738653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722666,0.000664241,0.000306272,0.00032098437,0.0010904224,0.00039138913],"domain_scores_gemma":[0.9971124,0.00045912346,0.00038169776,0.001260519,0.0006440619,0.0001422235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014671771,0.0006101455,0.00091289374,0.0012806169,0.0013730212,0.0016110467,0.0016986019,0.0012400339,0.0018565484],"category_scores_gemma":[0.0034012448,0.00033190395,0.00055683596,0.0015874675,0.00089585764,0.004339441,0.0022877357,0.0011770137,0.00075693254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017296481,0.0002889223,0.0013785716,0.0007312513,0.00016823494,0.0006227404,0.0006762417,0.054464955,0.14063352,0.28299737,0.009271013,0.5070375],"study_design_scores_gemma":[0.0005577265,0.0013594119,0.0014477145,0.00014798816,0.00033041023,0.0025573415,0.00018728341,0.6237417,0.16701037,0.10060306,0.1017328,0.00032427267],"about_ca_topic_score_codex":0.00046016328,"about_ca_topic_score_gemma":0.00023977348,"teacher_disagreement_score":0.0018565484,"about_ca_system_score_codex":0.00092990976,"about_ca_system_score_gemma":0.0009605633,"threshold_uncertainty_score":0.007759273},"labels":[],"label_agreement":null},{"id":"W2113110148","doi":"10.1007/978-3-319-42644-0","title":"Preserving Privacy Against Side-Channel Leaks","year":2016,"lang":"en","type":"book","venue":"Advances in information security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Side channel attack; Computer science; Computer security; Channel (broadcasting); Internet privacy; Computer network; Cryptography","score_opus":0.008299674300974717,"score_gpt":0.24389682684169578,"score_spread":0.23559715254072106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113110148","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028004294,0.012499459,0.7374239,0.0043997234,0.0013463403,0.00013859013,0.00055996596,0.0026504504,0.21297723],"genre_scores_gemma":[0.60135424,0.023751797,0.12209229,0.0017667711,0.001825908,0.00022234353,0.0010415742,0.0011232588,0.24682178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856347,0.00020433847,0.000058825237,0.000178353,0.00078894495,0.0002060307],"domain_scores_gemma":[0.9981501,0.00059176417,0.00010477075,0.00091432227,0.00019387672,0.00004520268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008128695,0.0011344932,0.00105926,0.0008194533,0.00072771957,0.0032110203,0.001219288,0.0013704677,0.010526623],"category_scores_gemma":[0.0029519997,0.0005566953,0.0007415384,0.0015423166,0.0017809125,0.0062198243,0.0027126302,0.0036462606,0.0068538617],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021288391,0.00010316857,0.00021684359,0.00046785557,0.00006087166,0.00037286882,0.00037248567,0.013529342,0.015919508,0.5375873,0.03465043,0.39650646],"study_design_scores_gemma":[0.00004426902,0.00009059415,0.00018800765,0.00020030723,0.00007443179,0.0014918918,0.000089431254,0.031136291,0.025589969,0.81193995,0.12910151,0.000053350686],"about_ca_topic_score_codex":0.0001598322,"about_ca_topic_score_gemma":0.00012559834,"teacher_disagreement_score":0.010526623,"about_ca_system_score_codex":0.0006579116,"about_ca_system_score_gemma":0.00077261665,"threshold_uncertainty_score":0.03521508},"labels":[],"label_agreement":null},{"id":"W2113183665","doi":"10.1109/isit.2001.936196","title":"Further results on the sphere decoder","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Rayleigh fading; Initialization; Lattice (music); Computational complexity theory; Gaussian; Upper and lower bounds; Lattice reduction; Multiuser detection; Fading; Mathematics; MIMO; Telecommunications; Physics; Detector","score_opus":0.032480260114452944,"score_gpt":0.22192953206667893,"score_spread":0.189449271952226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113183665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012114632,0.0021676365,0.9505621,0.0007258887,0.0002621199,0.0000736422,0.00016801417,0.000633291,0.03329258],"genre_scores_gemma":[0.31468952,0.007834753,0.63893867,0.0011634909,0.0009083638,0.000245531,0.0011314854,0.00064213795,0.03444602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809796,0.0006311647,0.000123207,0.00017001806,0.0007884809,0.00018909956],"domain_scores_gemma":[0.9953616,0.002949849,0.00015049918,0.0004183546,0.0010023098,0.00011749674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018579174,0.0013314481,0.0011430935,0.0011755729,0.00062478165,0.0014604012,0.000685769,0.0010654655,0.008024783],"category_scores_gemma":[0.009703398,0.00033140118,0.0010495295,0.0015516018,0.0014910941,0.0023459364,0.0018105686,0.0020936183,0.003613825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043919668,0.00012136448,0.00081882643,0.00052177516,0.00007947195,0.00035762228,0.00037195164,0.2670602,0.014523615,0.48776472,0.016796699,0.21114457],"study_design_scores_gemma":[0.000048551876,0.0001971229,0.0003712602,0.000084702784,0.000042406216,0.00048800622,0.000073782336,0.76343364,0.027179543,0.17928952,0.02872853,0.000062979685],"about_ca_topic_score_codex":0.0025331276,"about_ca_topic_score_gemma":0.0017205571,"teacher_disagreement_score":0.008024783,"about_ca_system_score_codex":0.0011928475,"about_ca_system_score_gemma":0.0014226732,"threshold_uncertainty_score":0.026845574},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005734647566967056,"score_gpt":0.2123785155253207,"score_spread":0.20664386795835363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113282491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056678575,0.0013606554,0.8989732,0.0020420353,0.000267555,0.00046826538,0.00055797,0.0050950623,0.03455652],"genre_scores_gemma":[0.60979074,0.0021658505,0.37583703,0.0006234664,0.00022114313,0.00028939045,0.0012846087,0.0004883606,0.009299528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973718,0.0006242317,0.00016238572,0.0002491127,0.0012982233,0.00029426365],"domain_scores_gemma":[0.9933176,0.0010092625,0.00076473027,0.00364566,0.0010634684,0.00019926582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023893474,0.0006776939,0.00049657334,0.0012251415,0.0011361814,0.002238152,0.0017849096,0.0014852096,0.0044652075],"category_scores_gemma":[0.006628482,0.0004440839,0.00048337883,0.0017736913,0.0019554752,0.0055260044,0.0033876447,0.002225671,0.0021426384],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011129281,0.00020567444,0.0040793805,0.0004510941,0.0001152415,0.00034799453,0.00038669328,0.054476496,0.037384085,0.58571965,0.02562662,0.2900941],"study_design_scores_gemma":[0.00034639044,0.0010717248,0.0027590727,0.00012179684,0.00015590967,0.002714355,0.00022052812,0.28114456,0.09213885,0.4490144,0.17012559,0.00018692014],"about_ca_topic_score_codex":0.0011934447,"about_ca_topic_score_gemma":0.001319722,"teacher_disagreement_score":0.0044652075,"about_ca_system_score_codex":0.0012592616,"about_ca_system_score_gemma":0.0020057764,"threshold_uncertainty_score":0.01493758},"labels":[],"label_agreement":null},{"id":"W2113488352","doi":"10.1109/lcn.2003.1243163","title":"Proxy encryptions for secure multicast key management","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multicast; Key management; Computer network; Proxy (statistics); Key (lock); Computer security; Proxy re-encryption; Public-key cryptography; Cryptography; Encryption","score_opus":0.011676524318160615,"score_gpt":0.2506840314790195,"score_spread":0.23900750716085892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113488352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024167413,0.0018815042,0.9630771,0.0007651408,0.00020873825,0.00017898876,0.000099689634,0.0005622946,0.009059121],"genre_scores_gemma":[0.710001,0.0014049473,0.27983415,0.00021742981,0.00018493336,0.00028008706,0.00019014004,0.00012123692,0.0077660554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980123,0.00065086945,0.00021475968,0.00013748487,0.00072649284,0.00025809702],"domain_scores_gemma":[0.99786276,0.00060587266,0.00024388428,0.0009472594,0.00024948193,0.00009085719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016835572,0.0004903932,0.0008456253,0.000679118,0.0010210138,0.0018442702,0.00093574816,0.0011510536,0.0031424772],"category_scores_gemma":[0.0049336315,0.00035352117,0.0006176323,0.00090597384,0.0010527957,0.0041905814,0.002340845,0.0014503035,0.0013228713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040297947,0.00007207248,0.00033258062,0.0001982446,0.000037719346,0.00045041027,0.0002596499,0.022234883,0.02196359,0.8647495,0.0053563323,0.08394211],"study_design_scores_gemma":[0.0002196374,0.00023910268,0.0003103827,0.00010744815,0.000069002315,0.0012631841,0.0001635892,0.38738686,0.0479775,0.5121821,0.04999605,0.00008505742],"about_ca_topic_score_codex":0.00017681695,"about_ca_topic_score_gemma":0.000194763,"teacher_disagreement_score":0.0031424772,"about_ca_system_score_codex":0.00091780483,"about_ca_system_score_gemma":0.0007027448,"threshold_uncertainty_score":0.01051265},"labels":[],"label_agreement":null},{"id":"W2113501016","doi":"10.5539/cis.v4n1p160","title":"A Dynamic Secret Sharing Scheme Based on Factorization","year":2011,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Secret sharing; Key (lock); Scheme (mathematics); Factorization; Shadow (psychology); Process (computing); Shamir's Secret Sharing; Theoretical computer science; Homomorphic secret sharing; Computer security; Algorithm; Cryptography; Operating system; Mathematics","score_opus":0.018355001438010186,"score_gpt":0.2301724239299391,"score_spread":0.21181742249192892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113501016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047117125,0.0007954071,0.9440593,0.00035731506,0.00015914181,0.00022818545,0.00017152444,0.0005590131,0.006552913],"genre_scores_gemma":[0.84456646,0.00059884094,0.14856417,0.00015516613,0.000095421296,0.00016543393,0.00020934656,0.00002951729,0.0056157755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843913,0.00026343772,0.00011750649,0.0004372062,0.00040197355,0.00034075705],"domain_scores_gemma":[0.9991623,0.0001490705,0.00014281303,0.00024955373,0.00017348824,0.00012270475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007745672,0.0006294937,0.0012936982,0.0006665654,0.0013593601,0.0013205293,0.0013509021,0.0011520875,0.0027800603],"category_scores_gemma":[0.0014695234,0.00032247556,0.000938263,0.0012112032,0.0010829716,0.004930259,0.002407607,0.0011438184,0.00063489407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015328471,0.0003030813,0.0012071237,0.00059315714,0.00013408496,0.0007158359,0.0010326378,0.096629344,0.15501174,0.48199248,0.0069575435,0.25389016],"study_design_scores_gemma":[0.00040768803,0.00077460974,0.00067235983,0.00008501532,0.00012426836,0.0020515167,0.00019082677,0.7654712,0.03987718,0.1618427,0.028197644,0.00030495165],"about_ca_topic_score_codex":0.0014793243,"about_ca_topic_score_gemma":0.0008588638,"teacher_disagreement_score":0.0027800603,"about_ca_system_score_codex":0.0014579978,"about_ca_system_score_gemma":0.001762498,"threshold_uncertainty_score":0.010578632},"labels":[],"label_agreement":null},{"id":"W2113651500","doi":"10.4218/etrij.16.0115.0630","title":"Message Expansion of Homomorphic Encryption Using Product Pairing","year":2015,"lang":"en","type":"article","venue":"ETRI Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Homomorphic encryption; Plaintext; Pairing; Encryption; Computer science; Cryptosystem; Theoretical computer science; Scheme (mathematics); Product (mathematics); Group (periodic table); Mathematics; Computer security; Physics","score_opus":0.07411779103717338,"score_gpt":0.28422116348667553,"score_spread":0.21010337244950217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113651500","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18470858,0.00036846605,0.7914684,0.0005300679,0.00015149891,0.00022659548,0.000077252,0.0007854179,0.021683743],"genre_scores_gemma":[0.79721564,0.0002571022,0.1952464,0.0001784831,0.00013830802,0.0002053887,0.00013338184,0.00008685093,0.006538511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984749,0.00044375786,0.00007977923,0.00020737648,0.00061553414,0.0001786964],"domain_scores_gemma":[0.9981949,0.0007053896,0.00012802277,0.00071559584,0.00017334687,0.00008268682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012893546,0.00033877703,0.0005307457,0.0005142569,0.0005799242,0.0007331165,0.0005840824,0.00052551745,0.002217266],"category_scores_gemma":[0.0023535565,0.0003130865,0.0006588092,0.00052200386,0.0013880077,0.003088426,0.002558065,0.0016317088,0.00087078847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075254653,0.0002584507,0.0015083809,0.00023182596,0.000044257504,0.0009732274,0.0010492923,0.026890744,0.06653765,0.75809646,0.004009603,0.13964754],"study_design_scores_gemma":[0.00020812961,0.0008558257,0.0013532124,0.00008275292,0.00006985988,0.0024831584,0.00021650232,0.34051165,0.15924054,0.46060836,0.034243796,0.00012630883],"about_ca_topic_score_codex":0.000095365336,"about_ca_topic_score_gemma":0.000088646804,"teacher_disagreement_score":0.002217266,"about_ca_system_score_codex":0.00041183515,"about_ca_system_score_gemma":0.00049050356,"threshold_uncertainty_score":0.0074175},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017410080012410265,"score_gpt":0.22436992740088307,"score_spread":0.2069598473884728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113717903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079137646,0.023833226,0.73300785,0.0021221724,0.0010422156,0.00016532594,0.00045702668,0.0009955694,0.15923902],"genre_scores_gemma":[0.7554826,0.013592643,0.15344565,0.00057678856,0.00077555084,0.00019068872,0.00058335246,0.0002635245,0.07508917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960476,0.00007443549,0.000025611715,0.000074947646,0.00016644236,0.0000538385],"domain_scores_gemma":[0.9997168,0.00011684806,0.00002940235,0.000096843934,0.000030224677,0.000009782952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032272158,0.00074505137,0.00070942193,0.00048380642,0.00038433622,0.0018709546,0.00058039365,0.0009224469,0.0042562475],"category_scores_gemma":[0.0010930331,0.00037097107,0.00047604076,0.0009958071,0.0012678655,0.005225388,0.0011218998,0.002061158,0.0014086303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009147751,0.000033796943,0.00004672637,0.00021986502,0.000014423685,0.000081631704,0.00006669985,0.0049620545,0.0061588357,0.9275509,0.0027447361,0.058028884],"study_design_scores_gemma":[0.000019915142,0.000070965456,0.00013132881,0.000058877555,0.000013800869,0.0004513272,0.000023248636,0.015849886,0.0069210115,0.95451415,0.021923097,0.000022442848],"about_ca_topic_score_codex":0.0001138068,"about_ca_topic_score_gemma":0.00013516369,"teacher_disagreement_score":0.0042562475,"about_ca_system_score_codex":0.0006281144,"about_ca_system_score_gemma":0.00034214352,"threshold_uncertainty_score":0.014238596},"labels":[],"label_agreement":null},{"id":"W2113761519","doi":"10.1007/978-3-642-19074-2_2","title":"Efficient Secure Two-Party Exponentiation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Exponentiation; Homomorphic encryption; Commitment scheme; Secure multi-party computation; Discrete logarithm; Oblivious transfer; Theoretical computer science; Multiplicative function; Encryption; Cryptography; Protocol (science); Public-key cryptography; Algorithm; Computer network; Mathematics","score_opus":0.01667961719754958,"score_gpt":0.2324526908362975,"score_spread":0.21577307363874793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113761519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022082461,0.001304388,0.9293895,0.0006128029,0.00032096985,0.00015422716,0.00040489665,0.0024494426,0.043281324],"genre_scores_gemma":[0.5474181,0.0020016723,0.3592237,0.00032671963,0.00034569288,0.00022030903,0.0014487383,0.00072840985,0.088286705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813205,0.00028663702,0.00014965182,0.00018689627,0.0009630937,0.00028172845],"domain_scores_gemma":[0.99823284,0.0005425602,0.000064616295,0.00091644266,0.00020021824,0.00004319852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282461,0.0011889356,0.0011252445,0.0008271036,0.0007920129,0.002757747,0.0013576283,0.0009699396,0.017253252],"category_scores_gemma":[0.0025966885,0.00058645254,0.0008203443,0.0015931207,0.0008538768,0.0049415664,0.004077958,0.0023391787,0.009609748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007845381,0.00030649413,0.00040114508,0.00063167146,0.00009630783,0.00035050767,0.00023578292,0.021389242,0.03869826,0.37369147,0.018569592,0.54484504],"study_design_scores_gemma":[0.0003274971,0.0002905376,0.00069855055,0.00015985093,0.0001320058,0.0019274285,0.00010705021,0.20332646,0.115885295,0.58738065,0.08965335,0.00011133583],"about_ca_topic_score_codex":0.000114933806,"about_ca_topic_score_gemma":0.00024777092,"teacher_disagreement_score":0.017253252,"about_ca_system_score_codex":0.0006772543,"about_ca_system_score_gemma":0.0007860415,"threshold_uncertainty_score":0.05771786},"labels":[],"label_agreement":null},{"id":"W2113876959","doi":"10.1109/cse.2009.157","title":"Combining Attribute-Based and Access Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Ontario Centres of Excellence","keywords":"Access control; System administrator; Computer science; Computer access control; Role-based access control; Attribute-based encryption; Encryption; Computer security; Set (abstract data type); Mandatory access control; Discretionary access control; Work (physics); Access structure; Control (management); Public-key cryptography; Cryptography; Secret sharing","score_opus":0.027337636119393636,"score_gpt":0.27537528173440784,"score_spread":0.2480376456150142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113876959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00521199,0.00040994614,0.99102545,0.0002841368,0.00006426046,0.000096143456,0.000016088497,0.00060458324,0.0022875385],"genre_scores_gemma":[0.40304467,0.0014074788,0.5864675,0.00046997485,0.00041504533,0.0002460004,0.00018928005,0.00020960245,0.007550461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98842806,0.0024981375,0.0013200385,0.0016869481,0.0054618875,0.0006049175],"domain_scores_gemma":[0.9923341,0.002077761,0.0005245763,0.003281056,0.0012995057,0.00048311715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008252184,0.0008125203,0.0012466456,0.0017078586,0.0012009369,0.005467065,0.00243958,0.0014906845,0.0022064163],"category_scores_gemma":[0.009446952,0.00076358474,0.0012301672,0.001973547,0.002633542,0.012030475,0.0072153667,0.003223103,0.0015584974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035179532,0.00030839266,0.002583231,0.00040093248,0.00029470393,0.00057812815,0.0010115423,0.074312486,0.02791935,0.60551596,0.0028888427,0.28383473],"study_design_scores_gemma":[0.00010427178,0.00050791726,0.0007422937,0.00012788507,0.00024345025,0.0010068008,0.0002173652,0.5159599,0.031861737,0.36654404,0.08247626,0.00020815105],"about_ca_topic_score_codex":0.0011258492,"about_ca_topic_score_gemma":0.00061623077,"teacher_disagreement_score":0.008252184,"about_ca_system_score_codex":0.0013685628,"about_ca_system_score_gemma":0.0016639552,"threshold_uncertainty_score":0.043642282},"labels":[],"label_agreement":null},{"id":"W2114912439","doi":"10.1109/ccc.2012.24","title":"The Hardness of Being Private","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Computer science; Context (archaeology); Communication complexity; Common value auction; Intersection (aeronautics); Function (biology); Conjecture; Differential privacy; Exponential function; Upper and lower bounds; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm","score_opus":0.01227805055454431,"score_gpt":0.23652132537786225,"score_spread":0.22424327482331793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114912439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21311995,0.0050380956,0.5972603,0.04137568,0.0003274058,0.00021147942,0.0021376505,0.000533974,0.13999546],"genre_scores_gemma":[0.9639185,0.0015302321,0.023332793,0.0014356801,0.00030513658,0.00021897072,0.00072743726,0.00019130831,0.008339918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869697,0.0037479883,0.00085355365,0.0034656432,0.0033342564,0.0016287793],"domain_scores_gemma":[0.9493309,0.035794985,0.0020876667,0.009691586,0.0020714272,0.0010233932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068368586,0.0007002825,0.002085457,0.0010703233,0.0045029474,0.008442911,0.002690273,0.0038999375,0.007969837],"category_scores_gemma":[0.0339753,0.0011746577,0.0020719927,0.0021387863,0.0135079445,0.02520485,0.0070463982,0.009016947,0.0014339855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016364228,0.00003729165,0.00066490367,0.00010189298,0.000037555754,0.000079442325,0.0007004772,0.004790076,0.00063009624,0.9778585,0.002234356,0.012701823],"study_design_scores_gemma":[0.00002261226,0.000016937996,0.0001863966,0.00001931554,0.000010469407,0.000109602624,0.0001073605,0.0068122586,0.0005772118,0.9882718,0.003850896,0.000015107957],"about_ca_topic_score_codex":0.0017043906,"about_ca_topic_score_gemma":0.00063258014,"teacher_disagreement_score":0.008442911,"about_ca_system_score_codex":0.0039564106,"about_ca_system_score_gemma":0.0021091609,"threshold_uncertainty_score":0.03615719},"labels":[],"label_agreement":null},{"id":"W2115256097","doi":"10.1145/2046707.2046784","title":"Practical PIR for electronic commerce","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Server; Revenue; Anonymity; Database; Bookkeeping; Private information retrieval; Database transaction; World Wide Web; Computer security; Business; Accounting","score_opus":0.07271614721868146,"score_gpt":0.31029620872023495,"score_spread":0.23758006150155347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115256097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008876137,0.0012510043,0.8918505,0.0037459258,0.00036057402,0.00044993052,0.0002172008,0.0018812999,0.09136745],"genre_scores_gemma":[0.47737694,0.0022069672,0.47524378,0.002587415,0.0008913714,0.0011480242,0.0007107514,0.00037099537,0.039463777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99240476,0.0028787635,0.00054844166,0.0010879305,0.0025252036,0.00055491173],"domain_scores_gemma":[0.9901427,0.0033795205,0.0004665001,0.00482591,0.0009703643,0.00021506504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005667564,0.00085263123,0.0013423907,0.0014065137,0.0024409296,0.0049945964,0.0030420637,0.003259469,0.016688928],"category_scores_gemma":[0.020156711,0.00084023253,0.001536817,0.0025192315,0.0035145665,0.014367979,0.0077265725,0.00496805,0.007248369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008738345,0.00009230923,0.00026419523,0.00020380039,0.000022298136,0.00014407067,0.00024841717,0.011558975,0.001233069,0.8953184,0.00959805,0.081228934],"study_design_scores_gemma":[0.000058057976,0.00008189189,0.00008941852,0.00006444722,0.000019441533,0.0004031981,0.000070569105,0.11079707,0.0015344316,0.8396178,0.047231313,0.000032408476],"about_ca_topic_score_codex":0.000785776,"about_ca_topic_score_gemma":0.00047895312,"teacher_disagreement_score":0.016688928,"about_ca_system_score_codex":0.0023647624,"about_ca_system_score_gemma":0.0024109522,"threshold_uncertainty_score":0.05583},"labels":[],"label_agreement":null},{"id":"W2116360492","doi":"10.1007/s12095-010-0039-6","title":"Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Secret sharing; Access structure; Overhead (engineering); Computer science; Converse; Decoding methods; Secure multi-party computation; Scheme (mathematics); Theoretical computer science; Context (archaeology); Mathematics; Cryptography; Algorithm","score_opus":0.02625024890392574,"score_gpt":0.2840280931100921,"score_spread":0.25777784420616634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116360492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12238964,0.0006305605,0.8574687,0.0018143825,0.00014091446,0.00017355966,0.00032657624,0.0005791339,0.0164765],"genre_scores_gemma":[0.9421973,0.0005115192,0.0443635,0.000264829,0.00013989207,0.00019128875,0.0001897015,0.00012100265,0.012021018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99352527,0.0016813035,0.0003364118,0.0011147595,0.0018271789,0.0015151392],"domain_scores_gemma":[0.9822474,0.010473962,0.0019690061,0.0040827617,0.0008384313,0.00038849114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004930533,0.001657302,0.0023745087,0.0011525857,0.0021465498,0.0032767134,0.0027767627,0.0038924168,0.003613992],"category_scores_gemma":[0.016974175,0.001347721,0.0013148611,0.0015027197,0.006796376,0.010203447,0.006410445,0.0048237983,0.0010098101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013598669,0.0001302004,0.0005296517,0.00025636255,0.00011057775,0.00055971637,0.0007885877,0.18977852,0.008981147,0.77935225,0.0024559246,0.015697125],"study_design_scores_gemma":[0.00011828468,0.00014738973,0.00019195105,0.00005052433,0.00006778547,0.00032039595,0.00008425304,0.43735427,0.008353303,0.551832,0.0013832396,0.00009653958],"about_ca_topic_score_codex":0.0011546336,"about_ca_topic_score_gemma":0.00096179225,"teacher_disagreement_score":0.004930533,"about_ca_system_score_codex":0.0029895313,"about_ca_system_score_gemma":0.0034349929,"threshold_uncertainty_score":0.026075423},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.036339330316432605,"score_gpt":0.2968752340972579,"score_spread":0.2605359037808253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118326624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2920678,0.000589723,0.70038605,0.0009532759,0.000046257683,0.00024881374,0.00040247772,0.0027441634,0.0025613923],"genre_scores_gemma":[0.88170767,0.00021395854,0.11600208,0.0001301677,0.00004457253,0.000074874515,0.00032559634,0.00013458569,0.0013665378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903555,0.0022402348,0.0013234554,0.0009771566,0.004263247,0.00084046595],"domain_scores_gemma":[0.9826225,0.008430656,0.0014325131,0.005415978,0.0017425771,0.0003558203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049346685,0.0007589792,0.0015178842,0.0007413275,0.00092343835,0.002481638,0.0018535851,0.0010536155,0.0014502835],"category_scores_gemma":[0.013776188,0.0005003082,0.0009924505,0.0012729615,0.0011453623,0.0052298787,0.0032850637,0.001410986,0.00047317252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057080504,0.0010512121,0.015619588,0.0006394408,0.00035343616,0.0018301662,0.0023544158,0.3993197,0.13205251,0.08125668,0.0077032833,0.35211158],"study_design_scores_gemma":[0.00011239023,0.00016449594,0.00075209566,0.000015683976,0.000045098634,0.0004090489,0.00025496102,0.9330346,0.039456617,0.024343006,0.001390265,0.000021710246],"about_ca_topic_score_codex":0.0018911185,"about_ca_topic_score_gemma":0.001627897,"teacher_disagreement_score":0.0049346685,"about_ca_system_score_codex":0.0016323886,"about_ca_system_score_gemma":0.0016782066,"threshold_uncertainty_score":0.026097357},"labels":[],"label_agreement":null},{"id":"W2118409148","doi":"10.1007/978-3-319-11659-4_10","title":"Isogeny-Based Quantum-Resistant Undeniable Signatures","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Scheme (mathematics); Post-quantum cryptography; Signature (topology); Quantum; Theoretical computer science; Elliptic curve; Cryptography; Computational complexity theory; Quantum algorithm; Quantum computer; Algorithm; Mathematics; Quantum mechanics; Physics; Pure mathematics","score_opus":0.013090216124037076,"score_gpt":0.23115940871573634,"score_spread":0.21806919259169927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118409148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11105038,0.0036881682,0.6765665,0.00467305,0.0016219894,0.00036799762,0.00061294204,0.0028743239,0.1985446],"genre_scores_gemma":[0.86037403,0.0015694692,0.081274875,0.00095359713,0.00049502554,0.00019786872,0.0005949655,0.00047327782,0.05406702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563783,0.00087313866,0.00020806752,0.0005516475,0.0021325403,0.00059684104],"domain_scores_gemma":[0.99646217,0.0011949153,0.00022008669,0.0014719367,0.0004994489,0.00015133985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017511409,0.0007802946,0.0014892359,0.0014047661,0.0015335068,0.003948007,0.0021087264,0.0021917422,0.011096581],"category_scores_gemma":[0.0052340575,0.00063032814,0.0010141636,0.0018577626,0.003594229,0.007789538,0.0053377645,0.005558751,0.004141608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029275013,0.00011781094,0.00017222551,0.00014103028,0.000027222422,0.00007595413,0.00020699095,0.008261501,0.006685482,0.92148864,0.005438356,0.057092085],"study_design_scores_gemma":[0.00009355915,0.00012988943,0.0001553063,0.00007001125,0.000037401733,0.00034982114,0.00009062566,0.04649083,0.016951596,0.9142675,0.021296052,0.0000673422],"about_ca_topic_score_codex":0.00025786378,"about_ca_topic_score_gemma":0.00026418193,"teacher_disagreement_score":0.011096581,"about_ca_system_score_codex":0.0018956872,"about_ca_system_score_gemma":0.0016127011,"threshold_uncertainty_score":0.037121713},"labels":[],"label_agreement":null},{"id":"W2119589135","doi":"10.29012/jpc.v2i2.591","title":"Polynomial-time Attack on Output Perturbation Sanitizers for Real-valued Databases","year":2011,"lang":"en","type":"article","venue":"Journal of Privacy and Confidentiality","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Impossibility; Binary number; Perturbation (astronomy); Adversary; Computer science; Upper and lower bounds; Time complexity; Mathematics; Theoretical computer science; Database; Algorithm; Computer security; Arithmetic; Law","score_opus":0.09398168476257879,"score_gpt":0.30958735054845077,"score_spread":0.21560566578587198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119589135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052873865,0.0012717868,0.94008905,0.0014544248,0.00007267063,0.00016332907,0.00023279185,0.000519388,0.0033227329],"genre_scores_gemma":[0.893736,0.001056983,0.10274302,0.00042297933,0.00017596043,0.00020493766,0.00022393944,0.00007060518,0.0013655496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98870975,0.0035527514,0.00093450415,0.0017574469,0.0037074876,0.0013379542],"domain_scores_gemma":[0.96194583,0.026591545,0.0027859001,0.0067850845,0.001316315,0.00057532475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008134549,0.0014774962,0.0024733795,0.0014733179,0.0012856991,0.0038766228,0.0035753488,0.002834556,0.0014801655],"category_scores_gemma":[0.031130597,0.00069520227,0.0017005622,0.0020441583,0.0041269483,0.010236241,0.006346095,0.0058312076,0.00042783818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002550943,0.00033618734,0.004917998,0.0011074706,0.00038076963,0.00086328236,0.001181681,0.37284157,0.023489866,0.5038362,0.0038985047,0.08459557],"study_design_scores_gemma":[0.00008839664,0.0001989173,0.00060072006,0.000091207614,0.00006202226,0.0005669411,0.00008800132,0.816405,0.014397613,0.16535792,0.0020930802,0.00005025131],"about_ca_topic_score_codex":0.00076535356,"about_ca_topic_score_gemma":0.00041817216,"teacher_disagreement_score":0.008134549,"about_ca_system_score_codex":0.0034807571,"about_ca_system_score_gemma":0.001927884,"threshold_uncertainty_score":0.04302007},"labels":[],"label_agreement":null},{"id":"W2119904820","doi":"10.1109/isit.2004.1365050","title":"Efficient key agreement and signature schemes using compact representations in GF(p/sup10/)","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"TRACE (psycholinguistics); Key (lock); Signature (topology); Reduction (mathematics); Digital signature; Computer science; Scheme (mathematics); Bandwidth (computing); Representation (politics); Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Telecommunications; Computer security; Mathematical analysis","score_opus":0.021809811831589986,"score_gpt":0.2861438186431697,"score_spread":0.2643340068115797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119904820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109096505,0.00094871194,0.87468463,0.00077703176,0.00019462622,0.0003350983,0.00017266639,0.0019459273,0.01184479],"genre_scores_gemma":[0.6241206,0.00046941044,0.3678784,0.00017117307,0.00014979127,0.0002981044,0.00051617523,0.00013665287,0.0062597315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997174,0.0009511983,0.00017776579,0.0003269317,0.0009820408,0.00038811774],"domain_scores_gemma":[0.99700963,0.00090295874,0.0004571571,0.0011785093,0.00032168147,0.00012997205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019309517,0.00054404547,0.000887273,0.00072403566,0.001103773,0.0019418475,0.001233466,0.001118427,0.0031974353],"category_scores_gemma":[0.004751381,0.0003308658,0.00052558613,0.0013754232,0.0014412778,0.0057625603,0.00280837,0.001799089,0.0016818406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015088745,0.00043046725,0.0009161528,0.0003673793,0.00008961335,0.0003143132,0.00087718596,0.024792742,0.06949317,0.5169131,0.007966497,0.37633047],"study_design_scores_gemma":[0.00082563976,0.001751756,0.0005314075,0.00013382791,0.00013520142,0.0016816255,0.0006465305,0.24688198,0.2322109,0.44951317,0.06548467,0.00020332966],"about_ca_topic_score_codex":0.0002704634,"about_ca_topic_score_gemma":0.00027991808,"teacher_disagreement_score":0.0031974353,"about_ca_system_score_codex":0.00083375926,"about_ca_system_score_gemma":0.0010115274,"threshold_uncertainty_score":0.010696471},"labels":[],"label_agreement":null},{"id":"W2120014373","doi":"10.1007/s00145-007-0327-2","title":"On Unconditionally Secure Distributed Oblivious Transfer","year":2007,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Oblivious transfer; Communication source; Computer science; Randomness; Server; Theoretical computer science; Impossibility; Set (abstract data type); Access structure; Secret sharing; Cryptography; Transfer (computing); Infimum and supremum; Upper and lower bounds; Discrete mathematics; Algorithm; Mathematics; Computer network; Parallel computing","score_opus":0.007361256692201161,"score_gpt":0.24629517356618422,"score_spread":0.23893391687398305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120014373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06455386,0.001302516,0.8357959,0.0062586507,0.001166435,0.00019906764,0.00039235284,0.0017484913,0.088582784],"genre_scores_gemma":[0.89155746,0.0013004461,0.048200928,0.0014484851,0.00082717807,0.00037405957,0.0004371307,0.0006917401,0.055162523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693406,0.0006141091,0.00014383584,0.00044019413,0.001155159,0.00071262295],"domain_scores_gemma":[0.99326515,0.004029569,0.00023565003,0.0018308,0.00041901448,0.00021976921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027001167,0.001597129,0.0021187621,0.0017187675,0.002985807,0.0035035815,0.0029353146,0.0028334914,0.012101383],"category_scores_gemma":[0.009258163,0.0011808077,0.0011965225,0.0026245634,0.0067196377,0.014001414,0.012320638,0.0066986894,0.0027382139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021211863,0.000037413498,0.000101004414,0.000055222004,0.000011612444,0.000074307485,0.00021340117,0.00652276,0.00084418186,0.9769866,0.002924794,0.0120165935],"study_design_scores_gemma":[0.000023345929,0.000017734646,0.00004061174,0.000017997547,0.000011938805,0.00003351835,0.000016220181,0.01781431,0.000758213,0.97874177,0.0025097565,0.000014527868],"about_ca_topic_score_codex":0.00096276455,"about_ca_topic_score_gemma":0.0009112582,"teacher_disagreement_score":0.012101383,"about_ca_system_score_codex":0.003208451,"about_ca_system_score_gemma":0.0019182777,"threshold_uncertainty_score":0.040483177},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0213364122456201,"score_gpt":0.24710699067022135,"score_spread":0.22577057842460124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121321202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02340347,0.012836283,0.68598604,0.023030002,0.00544707,0.00026877958,0.00035051323,0.00053566543,0.24814223],"genre_scores_gemma":[0.6511883,0.029847844,0.17904772,0.01045812,0.012285268,0.0009038491,0.0008860564,0.0013433621,0.11403939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9885069,0.0050913137,0.00067053264,0.0015809728,0.003106527,0.0010438247],"domain_scores_gemma":[0.98206836,0.0070411884,0.001030926,0.007308322,0.0020062402,0.0005449663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008951223,0.0019728183,0.0017280336,0.002565645,0.0042723324,0.0078664245,0.0037139056,0.005285153,0.011000594],"category_scores_gemma":[0.020528056,0.0013142552,0.001680529,0.0030672024,0.014385729,0.03724733,0.0111094965,0.0113935,0.006385627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030655272,0.000010625586,0.000034726938,0.000042973254,0.000006630641,0.00004499819,0.000085543004,0.000627133,0.00030619232,0.9902631,0.0027161685,0.005831329],"study_design_scores_gemma":[0.00001190448,0.000023928498,0.000043806478,0.00006653927,0.000009671225,0.00013238192,0.00004659308,0.0037344345,0.00068036444,0.97763807,0.017587366,0.000024876861],"about_ca_topic_score_codex":0.0009437401,"about_ca_topic_score_gemma":0.0006553355,"teacher_disagreement_score":0.011000594,"about_ca_system_score_codex":0.0029707048,"about_ca_system_score_gemma":0.002243581,"threshold_uncertainty_score":0.04733914},"labels":[],"label_agreement":null},{"id":"W2122545758","doi":"10.1007/978-3-540-73420-8_30","title":"A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Zero-knowledge proof; Computer science; Protocol (science); Complement (music); Theoretical computer science; Characterization (materials science); Monotone polygon; Property (philosophy); Discrete mathematics; Algorithm; Mathematics; Cryptography","score_opus":0.016604501674200793,"score_gpt":0.2607432510228545,"score_spread":0.2441387493486537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122545758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12413984,0.0014467977,0.6969322,0.0051672156,0.0004701123,0.0008426411,0.0017828133,0.0014831763,0.16773526],"genre_scores_gemma":[0.84770405,0.0011799474,0.10597078,0.0012059463,0.00058459054,0.0011780865,0.0017248185,0.00052400463,0.039927796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921687,0.0013934824,0.0005955879,0.0016057043,0.0029413668,0.0012950855],"domain_scores_gemma":[0.9784908,0.008465329,0.0019971386,0.0072443364,0.0023348024,0.001467568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004733506,0.0010828406,0.0014449079,0.0016275884,0.0033647236,0.00923563,0.007460149,0.0038034099,0.008858133],"category_scores_gemma":[0.018625854,0.001200225,0.0015777496,0.003743263,0.0052225753,0.015872972,0.008148861,0.011712163,0.002117207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012426646,0.00005319204,0.00031502426,0.00009492387,0.000013056097,0.00005242274,0.00025266915,0.003343947,0.000939628,0.98519206,0.002191148,0.0074276384],"study_design_scores_gemma":[0.000040239975,0.000052073407,0.0003587188,0.00006988816,0.000036839538,0.00030632774,0.00014209647,0.048339132,0.0024604315,0.9342221,0.0139287505,0.000043267064],"about_ca_topic_score_codex":0.0010646071,"about_ca_topic_score_gemma":0.0007673754,"teacher_disagreement_score":0.00923563,"about_ca_system_score_codex":0.0064315717,"about_ca_system_score_gemma":0.005062774,"threshold_uncertainty_score":0.046664476},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"eHealth; Computer science; Cloud computing; Access control; Cloud computing security; Computer security; Control (management); Operating system; Health care; Artificial intelligence","score_opus":0.019090334188943955,"score_gpt":0.27313497745300386,"score_spread":0.2540446432640599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123389487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042332463,0.0010184562,0.9503759,0.001030827,0.00015847625,0.00037223814,0.00014427556,0.00068132306,0.0038860121],"genre_scores_gemma":[0.8338256,0.0006674711,0.1619619,0.00033146335,0.00013623937,0.00013318368,0.0001790486,0.000027172153,0.0027378711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673706,0.0011495583,0.00019583246,0.00033894918,0.00095846155,0.0006201535],"domain_scores_gemma":[0.99745816,0.000735627,0.00027747542,0.000762337,0.00054814323,0.00021818547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037790989,0.0005295562,0.0007350203,0.0006478359,0.0010384688,0.0019130372,0.0018482658,0.0009117376,0.0016299573],"category_scores_gemma":[0.0035237884,0.00021030859,0.0005930354,0.0011703784,0.0013272889,0.003136,0.0033728885,0.0012772791,0.00042425605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012903807,0.0004808992,0.0066473642,0.0007235049,0.00022859461,0.001487624,0.00081894733,0.17866467,0.04442388,0.38151464,0.013612867,0.3701066],"study_design_scores_gemma":[0.00009823364,0.00039165097,0.001468514,0.00006292165,0.00007695703,0.0013699901,0.000340511,0.8811464,0.025013437,0.06998985,0.019964991,0.000076530494],"about_ca_topic_score_codex":0.0020673543,"about_ca_topic_score_gemma":0.0016796419,"teacher_disagreement_score":0.0037790989,"about_ca_system_score_codex":0.0009939196,"about_ca_system_score_gemma":0.0022337046,"threshold_uncertainty_score":0.019986033},"labels":[],"label_agreement":null},{"id":"W2123878079","doi":"10.1109/ntms.2008.ecp.100","title":"Towards Efficient Over-Encryption in Outsourced Databases Using Secret Sharing","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encryption; Computer science; On-the-fly encryption; 40-bit encryption; Scheme (mathematics); Outsourcing; Multiple encryption; Computer security; Attribute-based encryption; 56-bit encryption; Probabilistic encryption; Filesystem-level encryption; Key (lock); Client-side encryption; Computer network; Database; Public-key cryptography; Business; Mathematics","score_opus":0.06773369336050801,"score_gpt":0.29223910708430334,"score_spread":0.22450541372379534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123878079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068160586,0.00050983706,0.9279902,0.000388184,0.000029058241,0.0001281144,0.000044924207,0.00024627717,0.0025028589],"genre_scores_gemma":[0.7001498,0.0007674814,0.29574353,0.00016258904,0.000060538892,0.00012317035,0.00009287318,0.000087375345,0.0028127397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99505085,0.0019078626,0.0003353361,0.00036002672,0.0016806317,0.00066527247],"domain_scores_gemma":[0.9941723,0.0016854834,0.00057761784,0.0028170492,0.0005993755,0.00014822137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046388926,0.0005786587,0.0012679658,0.0005882078,0.0009482815,0.0024839977,0.0020643754,0.0009518874,0.0011937813],"category_scores_gemma":[0.0054720812,0.0005409084,0.00093140075,0.0015126799,0.0017507876,0.0078108055,0.004628121,0.002158306,0.00048580993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073883065,0.00030784303,0.0019031547,0.0003908807,0.00014098638,0.00067695277,0.0014002529,0.13325344,0.046392016,0.64404273,0.0033048084,0.16744813],"study_design_scores_gemma":[0.0001749571,0.00017522591,0.00038354303,0.00006701205,0.000075738324,0.00074557104,0.00039260162,0.71108204,0.054836717,0.22168063,0.010325899,0.000060034625],"about_ca_topic_score_codex":0.0007746267,"about_ca_topic_score_gemma":0.0004703859,"teacher_disagreement_score":0.0046388926,"about_ca_system_score_codex":0.0011840537,"about_ca_system_score_gemma":0.0015038913,"threshold_uncertainty_score":0.024533093},"labels":[],"label_agreement":null},{"id":"W2123976074","doi":"10.1109/mcetech.2008.26","title":"Anonymous Credentials for Privacy-Preserving E-learning","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Internet privacy; Computer security; Context (archaeology); Process (computing); Set (abstract data type); Information privacy; Order (exchange); Business","score_opus":0.031150365181702746,"score_gpt":0.2558398871678697,"score_spread":0.22468952198616696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123976074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122474115,0.0024597095,0.9536717,0.0041193855,0.00043994913,0.00030789297,0.00010093463,0.0005974444,0.026055574],"genre_scores_gemma":[0.7041748,0.0036673776,0.27696306,0.0012059308,0.0008193743,0.0007448786,0.00019451937,0.00012382044,0.0121061485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986999,0.0053363675,0.0010441919,0.0012240629,0.004476872,0.00091951125],"domain_scores_gemma":[0.9821478,0.0075539327,0.0013473907,0.006881989,0.001362179,0.00070675253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007530583,0.0006465369,0.0008442123,0.0014524299,0.0024845565,0.0053650867,0.0021029988,0.003300914,0.0031549134],"category_scores_gemma":[0.021168178,0.0006307662,0.0011692981,0.0018242794,0.0068899514,0.011693362,0.0067478498,0.0063922084,0.0013592682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006393899,0.000040297364,0.00015910839,0.0001119996,0.000012808461,0.00012354889,0.0002547812,0.0054104384,0.00089844305,0.9644912,0.0014515618,0.02698195],"study_design_scores_gemma":[0.000056934514,0.0000760301,0.00012530293,0.00013816582,0.000027748618,0.00038268106,0.00010643018,0.041185703,0.0039970493,0.9155383,0.03831434,0.00005128269],"about_ca_topic_score_codex":0.00057678705,"about_ca_topic_score_gemma":0.00032372124,"teacher_disagreement_score":0.007530583,"about_ca_system_score_codex":0.002240756,"about_ca_system_score_gemma":0.0035128503,"threshold_uncertainty_score":0.039826035},"labels":[],"label_agreement":null},{"id":"W2124950370","doi":"","title":"Traffic Filtering and Routing in Partially-Hidden Networks","year":2006,"lang":"en","type":"article","venue":"International journal of network security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Computer network; Routing (electronic design automation); Filter (signal processing); Routing protocol; Routing algorithm; Scheme (mathematics); Signature (topology); Distributed computing; Computer security; Database","score_opus":0.007041206065206528,"score_gpt":0.2318100980516862,"score_spread":0.22476889198647967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124950370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17661676,0.0002250478,0.8177071,0.0007057039,0.00004564656,0.000056158868,0.00009564614,0.0004779357,0.004070083],"genre_scores_gemma":[0.94786143,0.00015662637,0.049859013,0.00007669706,0.000043408956,0.00003546563,0.00008632581,0.000018234776,0.0018627819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978364,0.0005796259,0.00012469706,0.00027018873,0.0008422291,0.00034698777],"domain_scores_gemma":[0.995719,0.0015182681,0.00070769736,0.0014356843,0.0004225399,0.00019680068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018883636,0.00035402927,0.00064446207,0.00056642527,0.0010876372,0.0020362863,0.0010966716,0.0010478052,0.00086054887],"category_scores_gemma":[0.00446813,0.0003512857,0.00044374267,0.0008044775,0.002228675,0.0048978883,0.002054509,0.0010698589,0.0002203539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006590364,0.00009360423,0.0017680478,0.00012558559,0.000055876,0.00035974954,0.0008919439,0.30994728,0.031038271,0.5979313,0.0011960336,0.055933315],"study_design_scores_gemma":[0.000040897132,0.00006578527,0.00033920165,0.000013833692,0.00001734841,0.00009341558,0.000101626945,0.79211724,0.011388958,0.19382088,0.0019768793,0.00002397912],"about_ca_topic_score_codex":0.0018975718,"about_ca_topic_score_gemma":0.0013268301,"teacher_disagreement_score":0.0020362863,"about_ca_system_score_codex":0.0016422339,"about_ca_system_score_gemma":0.001579,"threshold_uncertainty_score":0.0119152665},"labels":[],"label_agreement":null},{"id":"W2125744175","doi":"10.1145/2517840.2517854","title":"Outsourced private information retrieval","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Server; Database; Database server; Private information retrieval; Protocol (science); Outsourcing; View; Cloud computing; Construct (python library); Scheme (mathematics); Computer network; Computer security; Database design; Operating system","score_opus":0.005844344413611245,"score_gpt":0.19260885133692737,"score_spread":0.18676450692331611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125744175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033474527,0.001136612,0.9339893,0.0015145638,0.00025188192,0.0003798066,0.0006554951,0.0034992408,0.025098631],"genre_scores_gemma":[0.70534575,0.0014177416,0.24109882,0.0009987708,0.0005018475,0.00044272814,0.0012873419,0.0005815917,0.048325498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942362,0.0008114342,0.00044354424,0.00083335204,0.0027032709,0.00097235094],"domain_scores_gemma":[0.98604286,0.0010091175,0.00061238185,0.010774961,0.0012485037,0.00031221227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022387304,0.00074693066,0.0016502732,0.0010316637,0.0014776897,0.004082965,0.004199882,0.0012590968,0.010174166],"category_scores_gemma":[0.006022488,0.00070368306,0.0012355054,0.0023764784,0.0027115934,0.009143112,0.008910011,0.0023836736,0.004787934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008851162,0.00040209846,0.0018446986,0.0006836668,0.00016602525,0.0007255952,0.0016691579,0.03606651,0.030385917,0.58584946,0.027044607,0.3142771],"study_design_scores_gemma":[0.00027173592,0.0003911402,0.0010866664,0.00015382729,0.00018906289,0.0014589417,0.00060387596,0.40902585,0.065941416,0.39128482,0.1293596,0.00023302442],"about_ca_topic_score_codex":0.0019790942,"about_ca_topic_score_gemma":0.0013383388,"teacher_disagreement_score":0.010174166,"about_ca_system_score_codex":0.002069294,"about_ca_system_score_gemma":0.0024877742,"threshold_uncertainty_score":0.03403592},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.03762996186804547,"score_gpt":0.26190458260586963,"score_spread":0.22427462073782417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125871822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116302995,0.0010385005,0.9768743,0.0011654665,0.00035701707,0.00050343154,0.00024403495,0.0020282536,0.006158645],"genre_scores_gemma":[0.70577866,0.0013236623,0.28102332,0.0007983283,0.00044977013,0.00062615966,0.0005394169,0.0001653894,0.009295307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99289703,0.001518476,0.00056431117,0.0008950247,0.003132729,0.0009924183],"domain_scores_gemma":[0.99499255,0.0008184034,0.0005191477,0.0020842573,0.0010457601,0.00053978345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037252235,0.000718117,0.0013953695,0.0013041501,0.0020479448,0.0044644577,0.003487999,0.0013875213,0.003176111],"category_scores_gemma":[0.004596601,0.0004067991,0.0009174052,0.0025152902,0.0022958412,0.0063175126,0.0044371216,0.002013543,0.0011210227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092765345,0.00032360476,0.0018865531,0.00048848626,0.00014245999,0.00048103704,0.00047293477,0.08931956,0.012076213,0.70561975,0.025707824,0.16255395],"study_design_scores_gemma":[0.0002476469,0.00032116854,0.00046965244,0.00008089711,0.000082082544,0.0007865813,0.0001621471,0.7269907,0.014588098,0.15350217,0.10264008,0.00012871274],"about_ca_topic_score_codex":0.004957242,"about_ca_topic_score_gemma":0.0022335239,"teacher_disagreement_score":0.004957242,"about_ca_system_score_codex":0.0031951987,"about_ca_system_score_gemma":0.0043277713,"threshold_uncertainty_score":0.023182869},"labels":[],"label_agreement":null},{"id":"W2126004052","doi":"10.1109/ccece.2007.248","title":"A Privacy-Preserving 3rd-Party Proxy for Transactions that Use Digital Credentials","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Password; Computer security; Collusion; Database transaction; Proxy (statistics); Private information retrieval; Internet privacy; Database; Business","score_opus":0.04583261546190425,"score_gpt":0.2820278531287599,"score_spread":0.23619523766685563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126004052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021645147,0.0005339699,0.96680945,0.00046465232,0.00016896545,0.00036717363,0.000075625714,0.0027655049,0.007169559],"genre_scores_gemma":[0.5196591,0.0006223007,0.4620809,0.00042073737,0.00018139239,0.00030207913,0.0002583896,0.00038640285,0.01608872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525684,0.0012014301,0.0005928494,0.00068459794,0.0017413517,0.0005228795],"domain_scores_gemma":[0.9916482,0.0007860514,0.00060353713,0.0059414455,0.00059527176,0.0004254769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038513294,0.0007116819,0.0013894287,0.00073285843,0.001802861,0.0047949897,0.0034738504,0.0023621528,0.004653352],"category_scores_gemma":[0.0062841163,0.00075025856,0.0013147696,0.0009947926,0.0021003794,0.009122603,0.004248408,0.0027313877,0.0028255521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014989899,0.0003831457,0.0027584087,0.0006423687,0.00014563091,0.0016682199,0.0014063545,0.021135319,0.06816622,0.6965467,0.0049106255,0.20073795],"study_design_scores_gemma":[0.00033187677,0.0011507948,0.0016010999,0.00025918963,0.00037359272,0.005124958,0.00034027814,0.3786043,0.16146226,0.1998188,0.25049856,0.00043432202],"about_ca_topic_score_codex":0.0005263729,"about_ca_topic_score_gemma":0.00048204954,"teacher_disagreement_score":0.0047949897,"about_ca_system_score_codex":0.0007723917,"about_ca_system_score_gemma":0.0015772607,"threshold_uncertainty_score":0.02036798},"labels":[],"label_agreement":null},{"id":"W2127303209","doi":"10.1002/sec.136","title":"Achieving non‐transferability in credential systems using hidden biometrics","year":2009,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Credential; Computer science; Computer security; Transferability; Biometrics; Key (lock); Oblivious transfer; Internet privacy; Cryptography; Machine learning","score_opus":0.015153823852515605,"score_gpt":0.2558492834808932,"score_spread":0.2406954596283776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127303209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.136827,0.00029833795,0.8534454,0.0007417372,0.00007980333,0.000107496555,0.000033499255,0.00061726576,0.007849402],"genre_scores_gemma":[0.9716635,0.000071946124,0.026029339,0.00008019751,0.000039958977,0.00005932311,0.00002057069,0.000024591405,0.0020106381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929134,0.0026128152,0.000476231,0.0009405422,0.0021978244,0.0008592256],"domain_scores_gemma":[0.97720146,0.010289333,0.0016938867,0.009123818,0.0010619778,0.00062956294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004580384,0.00048968766,0.000949081,0.0006646696,0.0013413638,0.002652059,0.0019015879,0.0021046374,0.0037144772],"category_scores_gemma":[0.015638532,0.00040546726,0.0006741102,0.0007124029,0.005538252,0.007378942,0.007960007,0.0032231063,0.0010603883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00116178,0.00040474997,0.0017667469,0.0002659238,0.00009169819,0.00085641694,0.0011677067,0.08590129,0.05686197,0.73235744,0.0018542632,0.117310055],"study_design_scores_gemma":[0.00015541572,0.00033558786,0.00055879884,0.000060992406,0.00003377562,0.0004878906,0.00013323477,0.46665806,0.05680197,0.46915093,0.0055453517,0.00007806019],"about_ca_topic_score_codex":0.00027347592,"about_ca_topic_score_gemma":0.000107542706,"teacher_disagreement_score":0.004580384,"about_ca_system_score_codex":0.0010631649,"about_ca_system_score_gemma":0.0009298929,"threshold_uncertainty_score":0.024223626},"labels":[],"label_agreement":null},{"id":"W2127915437","doi":"10.1002/sec.274","title":"An efficient and provably secure public key encryption scheme based on coding theory","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Computer science; Encryption; Scheme (mathematics); Theoretical computer science; Key (lock); Computer security; Coding (social sciences); Mathematics","score_opus":0.007862790053958521,"score_gpt":0.2289051696302583,"score_spread":0.2210423795762998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127915437","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032071486,0.0005018826,0.9552191,0.00096200645,0.00019970958,0.00032883018,0.00026816005,0.0005864984,0.0098623475],"genre_scores_gemma":[0.7180505,0.0006752368,0.27081507,0.00038277212,0.00013404716,0.0005244791,0.00052568293,0.000067390094,0.008824871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980471,0.0005830899,0.00012052828,0.00021138207,0.00079263555,0.00024530853],"domain_scores_gemma":[0.9988701,0.00038187482,0.00015645583,0.00031633562,0.00020308577,0.00007211557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127691,0.00052090787,0.0007245706,0.0007672624,0.00076251914,0.0013995289,0.0012592654,0.0012170792,0.0020777993],"category_scores_gemma":[0.002099561,0.00027065276,0.0006844697,0.0012057849,0.0012089993,0.002495956,0.0026672941,0.0017375463,0.00057328946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034302496,0.00017191035,0.00039618395,0.00037401676,0.000086222775,0.000528559,0.00031518578,0.038236562,0.045194477,0.8384733,0.0054505467,0.07042992],"study_design_scores_gemma":[0.0005837901,0.0004022821,0.00050282554,0.00015059691,0.00012614334,0.0012855888,0.000104742394,0.5237128,0.06853994,0.36800072,0.036381945,0.00020871872],"about_ca_topic_score_codex":0.000499267,"about_ca_topic_score_gemma":0.00039013792,"teacher_disagreement_score":0.0020777993,"about_ca_system_score_codex":0.0009870722,"about_ca_system_score_gemma":0.0019672615,"threshold_uncertainty_score":0.0071617365},"labels":[],"label_agreement":null},{"id":"W2128730223","doi":"10.1109/lcomm.2003.820094","title":"Cryptanalysis of scalable multicast security protocol","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Multicast; Computer network; Scalability; Collusion; Cryptanalysis; Protocol (science); Computer security; IP multicast; Xcast; Encryption; Operating system","score_opus":0.026952232434693687,"score_gpt":0.2964751144259913,"score_spread":0.2695228819912976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128730223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35873207,0.003244079,0.5652398,0.0068898946,0.00075336976,0.0005721825,0.00035659914,0.0018110513,0.062400896],"genre_scores_gemma":[0.9712605,0.0006026671,0.024078388,0.00024239573,0.000112655056,0.00015416046,0.00009548163,0.00003336174,0.0034203918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981054,0.00042738047,0.00008671325,0.00013666283,0.0009328288,0.00031098042],"domain_scores_gemma":[0.9986149,0.00063863053,0.00017884662,0.00036849428,0.00014709332,0.000052023013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012710419,0.0004853612,0.00053756655,0.00091608765,0.0010450558,0.0012234639,0.0007080444,0.0010257878,0.002432819],"category_scores_gemma":[0.0030802533,0.0002698792,0.00068077655,0.0009718798,0.0014966433,0.0023323938,0.0022543566,0.0015707136,0.00038132226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011750142,0.00013815156,0.0024944537,0.000359325,0.00021277742,0.0029722305,0.00081172027,0.08047903,0.059009545,0.76579946,0.012000104,0.07454821],"study_design_scores_gemma":[0.000341137,0.00049725873,0.0012357703,0.00012346187,0.00015720108,0.0036493873,0.00020736281,0.49563557,0.060201284,0.41765535,0.020179966,0.00011629459],"about_ca_topic_score_codex":0.00036776622,"about_ca_topic_score_gemma":0.0001910287,"teacher_disagreement_score":0.002432819,"about_ca_system_score_codex":0.0011656799,"about_ca_system_score_gemma":0.00085617433,"threshold_uncertainty_score":0.008457601},"labels":[],"label_agreement":null},{"id":"W2129349094","doi":"10.1109/icc.2008.296","title":"Provably Secure Self-Certified Partially Blind Signature Scheme from Bilinear Pairings","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blind signature; Revocation; Computer security; Computer science; Certificate; Public-key cryptography; Certification; Revocation list; Digital signature; Signature (topology); Ring signature; Certificate authority; Scheme (mathematics); Theoretical computer science; Mathematics; Encryption; Hash function; Political science","score_opus":0.022760157119644884,"score_gpt":0.22336446313717298,"score_spread":0.2006043060175281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129349094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04046911,0.0006733264,0.9369138,0.00065014354,0.00038588708,0.00022557373,0.00029864974,0.0012338286,0.01914975],"genre_scores_gemma":[0.746128,0.00080527423,0.23488306,0.00038789253,0.00031444628,0.00040724865,0.00055570435,0.00015126455,0.016367102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963159,0.0010790803,0.00029407153,0.00038568734,0.0016290424,0.00029626663],"domain_scores_gemma":[0.99767965,0.0005277377,0.00035398832,0.0008674593,0.0003896593,0.00018167093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020741038,0.0004497429,0.0010614243,0.0007608725,0.00093767635,0.0024794575,0.0010465382,0.0011013377,0.004027471],"category_scores_gemma":[0.0039042227,0.00042898534,0.000937024,0.0012420908,0.0013771495,0.0047916574,0.003989475,0.0017520649,0.0015691858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058924063,0.00014229832,0.0003708972,0.00043215594,0.00008142388,0.00041165922,0.0004813472,0.014603965,0.02469993,0.88190895,0.003706714,0.0725713],"study_design_scores_gemma":[0.00050991715,0.0007261144,0.00054014253,0.00013200304,0.00011144888,0.0022436786,0.000174106,0.19483812,0.06341344,0.65612906,0.08095574,0.00022632745],"about_ca_topic_score_codex":0.00015420861,"about_ca_topic_score_gemma":0.00013154921,"teacher_disagreement_score":0.004027471,"about_ca_system_score_codex":0.00074458047,"about_ca_system_score_gemma":0.0020923137,"threshold_uncertainty_score":0.013473153},"labels":[],"label_agreement":null},{"id":"W2129579538","doi":"10.1109/ipdps.2011.42","title":"Distributed Fine-Grained Access Control in Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encryption; Computer network; Access control; Wireless sensor network; Cryptography; Exploit; Key distribution in wireless sensor networks; Scheme (mathematics); Key (lock); Key distribution; Distributed computing; Computation; Wireless; Wireless network; Public-key cryptography; Computer security; Telecommunications","score_opus":0.02476817395386311,"score_gpt":0.2410375360081949,"score_spread":0.2162693620543318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129579538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02608151,0.0008884698,0.9707121,0.00033187505,0.000056805235,0.00013226217,0.000030175477,0.0003126219,0.0014541537],"genre_scores_gemma":[0.9074682,0.000491463,0.089834206,0.00011010238,0.000092454145,0.00017022669,0.000045847497,0.000025031191,0.0017623993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459875,0.0017538673,0.0004154877,0.0010927914,0.0016307308,0.00050834625],"domain_scores_gemma":[0.99262905,0.002839034,0.0010397964,0.002559848,0.00066987146,0.00026238072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004698457,0.00051302044,0.001135032,0.00075462606,0.0011085992,0.0019049565,0.0019663284,0.0013081303,0.0009210123],"category_scores_gemma":[0.006730802,0.00041218274,0.00051236217,0.0010465068,0.002748623,0.0053533465,0.0029353704,0.0012342904,0.00022320772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085436704,0.00020349798,0.0018635989,0.0004212067,0.00015026912,0.00049410935,0.0008113329,0.3318311,0.03483301,0.47959056,0.0032198646,0.14572708],"study_design_scores_gemma":[0.00010744271,0.00018230281,0.0004002941,0.000028565653,0.000029496212,0.00030882785,0.00008112413,0.8206211,0.006643632,0.16523772,0.006307332,0.000052114796],"about_ca_topic_score_codex":0.0012290804,"about_ca_topic_score_gemma":0.00091035827,"teacher_disagreement_score":0.004698457,"about_ca_system_score_codex":0.0015611523,"about_ca_system_score_gemma":0.0010241888,"threshold_uncertainty_score":0.024848104},"labels":[],"label_agreement":null},{"id":"W2129630717","doi":"10.1007/978-3-540-92803-4_8","title":"A Trust-Based Incentive Mechanism for E-Marketplaces","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Incentive; Trustworthiness; Mechanism (biology); Order (exchange); Computer science; Profit (economics); Business; Context (archaeology); Electronic markets; Forward auction; Internet privacy; Microeconomics; Marketing; The Internet; World Wide Web; Bidding","score_opus":0.01469078150418554,"score_gpt":0.23623748679862075,"score_spread":0.2215467052944352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129630717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019697329,0.0003700975,0.96054703,0.0015581063,0.00024893883,0.00033825796,0.0001292345,0.00079769286,0.016313288],"genre_scores_gemma":[0.69373244,0.00054677227,0.28291115,0.00030304622,0.0002919728,0.00045064194,0.0001615017,0.00013639357,0.021466037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546057,0.0017673216,0.00040006696,0.0005728561,0.001263161,0.0005361343],"domain_scores_gemma":[0.99168396,0.00379513,0.0007906336,0.0018901436,0.001089405,0.0007506901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00626383,0.0008040725,0.0015741797,0.0009356354,0.0020172237,0.0045543816,0.004508891,0.0043822885,0.010326598],"category_scores_gemma":[0.018880196,0.0009201707,0.0014961212,0.0018237924,0.002545909,0.012510565,0.005138565,0.004107707,0.0018396343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003808104,0.00020408598,0.00029895996,0.00017700972,0.000041479867,0.00018120599,0.00027555617,0.025877716,0.0032566292,0.90514016,0.005392651,0.058773864],"study_design_scores_gemma":[0.0002628197,0.00021454586,0.00015186299,0.00006154215,0.00004521095,0.00033624435,0.00007814874,0.32363486,0.0027614217,0.65390325,0.018483082,0.000067052424],"about_ca_topic_score_codex":0.00075330614,"about_ca_topic_score_gemma":0.00058686774,"teacher_disagreement_score":0.010326598,"about_ca_system_score_codex":0.0020436961,"about_ca_system_score_gemma":0.0023495727,"threshold_uncertainty_score":0.0345459},"labels":[],"label_agreement":null},{"id":"W2131189004","doi":"10.1109/hpcc.2008.82","title":"New ECDSA-Verifiable Multi-receiver Generalization Signcryption","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Alberta Paraplegic Foundation","funders":"","keywords":"Signcryption; Elliptic Curve Digital Signature Algorithm; Computer science; Encryption; Digital signature; Cryptography; Signature (topology); ElGamal signature scheme; Cryptographic primitive; Public-key cryptography; Theoretical computer science; Elliptic curve cryptography; Computer security; Mathematics; Cryptographic protocol; Blind signature; Hash function","score_opus":0.02878111533995474,"score_gpt":0.2340198192895301,"score_spread":0.20523870394957539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131189004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03825918,0.0010445728,0.94080323,0.0005059625,0.0004147294,0.00032910865,0.00036279924,0.0026450537,0.015635328],"genre_scores_gemma":[0.75922173,0.00074513175,0.21869764,0.00044649834,0.00021908924,0.0002675991,0.0007871951,0.00016385475,0.019451272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976004,0.00044850862,0.00020076345,0.0004291908,0.0010115649,0.00030957264],"domain_scores_gemma":[0.9977647,0.00034678882,0.00022088966,0.0009677608,0.0005504845,0.00014938647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012944851,0.00055644463,0.0011359595,0.0007558463,0.00074532477,0.0016931688,0.0013998009,0.0012585362,0.004026526],"category_scores_gemma":[0.0022641176,0.00032670726,0.0007970534,0.0010858715,0.0012335998,0.0031815656,0.0026165147,0.0019437992,0.00143667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014810741,0.0002665814,0.001955002,0.00052485906,0.00018673154,0.0013503318,0.00045737042,0.058081068,0.115384,0.46750617,0.015747717,0.3370593],"study_design_scores_gemma":[0.0005400917,0.0006257789,0.0013860011,0.00012029418,0.00021751676,0.0031291305,0.00009579381,0.6551138,0.12498964,0.10584091,0.107699744,0.0002413238],"about_ca_topic_score_codex":0.00070188503,"about_ca_topic_score_gemma":0.0004674735,"teacher_disagreement_score":0.004026526,"about_ca_system_score_codex":0.0008284347,"about_ca_system_score_gemma":0.0015463039,"threshold_uncertainty_score":0.013470113},"labels":[],"label_agreement":null},{"id":"W2132276043","doi":"10.1109/phycmp.1994.363696","title":"Quantum oblivious transfer is secure against all individual measurements","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Oblivious transfer; Cryptography; Computer science; Protocol (science); Cryptographic protocol; Cryptographic primitive; Upper and lower bounds; Quantum cryptography; Entropy (arrow of time); Theoretical computer science; Quantum; Quantum information; Mathematics; Computer security; Physics; Quantum mechanics","score_opus":0.08779008358151615,"score_gpt":0.2503000446871813,"score_spread":0.16250996110566518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132276043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18297343,0.00066759234,0.73253596,0.003968259,0.00012038491,0.00014466744,0.00028114248,0.0009063657,0.07840222],"genre_scores_gemma":[0.9658916,0.00048441807,0.025965534,0.00037432,0.00015218287,0.00017855279,0.00019361734,0.00015785295,0.0066018254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99340373,0.0015158874,0.0003052117,0.001042252,0.002598843,0.0011341958],"domain_scores_gemma":[0.9784424,0.014465349,0.0016741472,0.003906477,0.0011076808,0.0004039692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039445637,0.0012745247,0.0015121512,0.0016440019,0.0025814245,0.004174552,0.0016379054,0.002443431,0.0055936794],"category_scores_gemma":[0.012278143,0.0009326258,0.0016380426,0.0015174623,0.011227779,0.009590782,0.0057041678,0.00609621,0.0016799171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024024538,0.000055847464,0.00044934117,0.000113109716,0.00007850026,0.00016223759,0.00034278893,0.017452208,0.0034094702,0.9676976,0.0014078431,0.008590823],"study_design_scores_gemma":[0.000052641164,0.00007641282,0.00035306605,0.000030562547,0.000050270854,0.00024587117,0.000056256515,0.1299645,0.010994038,0.8555008,0.0026321926,0.000043373024],"about_ca_topic_score_codex":0.0011678399,"about_ca_topic_score_gemma":0.0005841047,"teacher_disagreement_score":0.0055936794,"about_ca_system_score_codex":0.0028492797,"about_ca_system_score_gemma":0.002039573,"threshold_uncertainty_score":0.02086109},"labels":[],"label_agreement":null},{"id":"W2132372495","doi":"10.1109/icpwc.1997.655542","title":"Nomadic computing and artificial intelligence","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mobile computing; Artificial intelligence; Computational intelligence; Data science; Telecommunications","score_opus":0.04170655924811153,"score_gpt":0.2552348112315883,"score_spread":0.21352825198347677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132372495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01772954,0.051970158,0.5064588,0.02283178,0.0037445347,0.00014879945,0.00024592952,0.0004842984,0.39638615],"genre_scores_gemma":[0.7210202,0.046197675,0.17309406,0.0047657904,0.0069601485,0.0005425586,0.00042571573,0.00019033633,0.046803504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969741,0.0014206071,0.00019019825,0.00052187877,0.0006484912,0.0002447981],"domain_scores_gemma":[0.9973144,0.0013842949,0.00022411553,0.0005026853,0.0003337077,0.00024081125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024404645,0.00075619464,0.0011490685,0.0021735467,0.0039556366,0.008054014,0.0010214136,0.0019454105,0.0058368584],"category_scores_gemma":[0.005264422,0.00040179215,0.0007212871,0.0032638358,0.009051333,0.009479864,0.0039749197,0.0035564508,0.001359417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005872189,0.0000031001773,0.000051961273,0.000038419694,0.000005904794,0.000033380147,0.00015719971,0.00045975886,0.00006017952,0.9916441,0.0015260024,0.0060141943],"study_design_scores_gemma":[0.000006158428,0.00000790001,0.0000891579,0.000044974815,0.0000067356573,0.00011362976,0.00015513404,0.0024249582,0.00008181471,0.954632,0.042426836,0.000010773347],"about_ca_topic_score_codex":0.0021312635,"about_ca_topic_score_gemma":0.001980514,"teacher_disagreement_score":0.008054014,"about_ca_system_score_codex":0.0028603275,"about_ca_system_score_gemma":0.0012460741,"threshold_uncertainty_score":0.020753205},"labels":[],"label_agreement":null},{"id":"W2136631923","doi":"10.1007/978-3-319-08506-7_4","title":"The Best of Both Worlds: Combining Information-Theoretic and Computational PIR for Communication Efficiency","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Server; Scheme (mathematics); Private information retrieval; Component (thermodynamics); Certificate; Computer network; Database; Computer security; Theoretical computer science","score_opus":0.009545955394705275,"score_gpt":0.23722258951430839,"score_spread":0.22767663411960312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136631923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017470611,0.0073420997,0.88351953,0.009470566,0.00071779185,0.00010622859,0.00017223421,0.00037134037,0.08082956],"genre_scores_gemma":[0.80796504,0.006964106,0.16583823,0.0018724476,0.002869388,0.0002507889,0.00019662731,0.00035982206,0.013683564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99042517,0.005061699,0.0003583348,0.0007977258,0.0027819995,0.0005750343],"domain_scores_gemma":[0.95959634,0.029661106,0.0012186302,0.0072201355,0.0018700345,0.00043379643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010946069,0.0015324171,0.0031244876,0.002729065,0.0018261585,0.007163769,0.004065683,0.0040462343,0.0076604323],"category_scores_gemma":[0.03681041,0.0009784176,0.0013985158,0.0029905546,0.012169798,0.02669953,0.008825992,0.0073865284,0.0018291032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009204864,0.000070573114,0.0001940018,0.00017428926,0.00003352023,0.000044070508,0.00008492325,0.021103842,0.0004890819,0.9420728,0.0032589964,0.032381967],"study_design_scores_gemma":[0.0000074127875,0.000025072306,0.000047382448,0.000042695454,0.0000122487845,0.000058668476,0.000026021444,0.060204502,0.0005669144,0.9374724,0.0015196699,0.000017075241],"about_ca_topic_score_codex":0.00030967084,"about_ca_topic_score_gemma":0.0003183669,"teacher_disagreement_score":0.010946069,"about_ca_system_score_codex":0.0023763664,"about_ca_system_score_gemma":0.001873669,"threshold_uncertainty_score":0.057889044},"labels":[],"label_agreement":null},{"id":"W2138820189","doi":"10.1109/pdgc.2010.5679887","title":"Enhanced implementation of the NTRUEncrypt algorithm using graphics cards","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"NTRU; Computer science; Parameterized complexity; Parallel computing; Cryptosystem; Encryption; Post-quantum cryptography; General-purpose computing on graphics processing units; Cryptography; CUDA; Graphics; Algorithm; Public-key cryptography; Theoretical computer science; Computer engineering; Computer graphics (images); Operating system","score_opus":0.011289032355668093,"score_gpt":0.28556639455627747,"score_spread":0.2742773622006094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138820189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111093074,0.0004268546,0.85412216,0.00025800514,0.00021927543,0.00018839572,0.00031158637,0.01385272,0.019527843],"genre_scores_gemma":[0.49619246,0.000168908,0.49536183,0.00012331695,0.000025573918,0.00012980153,0.00054707617,0.00047204603,0.0069790133],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993787,0.00014971719,0.00006438274,0.000063433494,0.00024488475,0.00009880858],"domain_scores_gemma":[0.9991547,0.00015687158,0.00005043372,0.000347848,0.00025750345,0.000032703374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004577464,0.0004335474,0.00052521046,0.00043859147,0.0002675675,0.001018732,0.0012759003,0.0005327394,0.005234728],"category_scores_gemma":[0.002220878,0.000215545,0.0003039478,0.0005150764,0.00032402194,0.0010943625,0.00059263373,0.00077758636,0.0019393648],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032793295,0.00044920217,0.0048917276,0.0004887408,0.0001474241,0.0017200197,0.00063644553,0.13933048,0.28430727,0.0906021,0.029809168,0.44433802],"study_design_scores_gemma":[0.00026712893,0.00032901854,0.0011256528,0.00003218276,0.00003015027,0.00070666015,0.000051263574,0.76741016,0.17996135,0.006005815,0.04402289,0.000057718036],"about_ca_topic_score_codex":0.0014974652,"about_ca_topic_score_gemma":0.0011900285,"teacher_disagreement_score":0.005234728,"about_ca_system_score_codex":0.0004958535,"about_ca_system_score_gemma":0.0006494073,"threshold_uncertainty_score":0.017511904},"labels":[],"label_agreement":null},{"id":"W2140036537","doi":"10.1109/icdcs.2009.21","title":"Distributed Key Generation for the Internet","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Public Safety and Security","keywords":"Computer science; Verifiable secret sharing; Asynchronous communication; The Internet; Protocol (science); Key (lock); Cryptography; Secret sharing; Public-key cryptography; Computer network; Computer security; Scheme (mathematics); Distributed computing; World Wide Web; Encryption; Mathematics","score_opus":0.026002666781663734,"score_gpt":0.25389502864773256,"score_spread":0.22789236186606882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140036537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009840503,0.004361769,0.946827,0.0040229354,0.0006214323,0.00020148045,0.00013759415,0.0012172435,0.032770045],"genre_scores_gemma":[0.48965603,0.004925372,0.48462254,0.0008724338,0.0006078158,0.0005958504,0.00040064327,0.00021182356,0.018107576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893314,0.00043081018,0.0000693345,0.00015752813,0.00032114322,0.00008809433],"domain_scores_gemma":[0.9992993,0.00021740193,0.00005785292,0.00027251441,0.00011582259,0.000037054233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013440216,0.00037255636,0.00042063938,0.00065762136,0.00092900556,0.001532949,0.00071786967,0.00085577834,0.004163151],"category_scores_gemma":[0.0024316865,0.0002411562,0.00036976163,0.00082712737,0.0010613302,0.0031378428,0.0016566782,0.0016057565,0.0011091982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006522195,0.000027964614,0.00013265785,0.00011728279,0.000012922182,0.00010211039,0.00011163669,0.010772004,0.004132993,0.87367654,0.011009412,0.09983919],"study_design_scores_gemma":[0.00009565153,0.00006633211,0.00012996986,0.000095359785,0.000023182927,0.0002594527,0.000046629277,0.13436243,0.004305316,0.7574457,0.10313229,0.00003770986],"about_ca_topic_score_codex":0.00038795994,"about_ca_topic_score_gemma":0.0003767097,"teacher_disagreement_score":0.004163151,"about_ca_system_score_codex":0.0014925906,"about_ca_system_score_gemma":0.0011851867,"threshold_uncertainty_score":0.013927102},"labels":[],"label_agreement":null},{"id":"W2140445848","doi":"10.1109/sfcs.1991.185350","title":"Subquadratic zero-knowledge","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Zero-knowledge proof; Zero (linguistics); Square root; Discrete mathematics; Combinatorics; Omega; Communication complexity; Order (exchange); Infinity; Mathematics; Square (algebra); Computer science; Arithmetic; Algorithm; Physics; Philosophy; Quantum mechanics; Cryptography","score_opus":0.02785612144037451,"score_gpt":0.23157093967653736,"score_spread":0.20371481823616286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140445848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09296747,0.0019083773,0.80171037,0.0052739047,0.00048021623,0.0002313189,0.0006715483,0.0045199753,0.092236735],"genre_scores_gemma":[0.78867316,0.0010413164,0.1745157,0.0011553467,0.0004707054,0.000337626,0.00072871044,0.0006809581,0.032396376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930634,0.0015763716,0.0002269819,0.0013672386,0.002497493,0.0012685341],"domain_scores_gemma":[0.97934157,0.011801199,0.0011926907,0.0056144744,0.0014207682,0.0006293117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027777944,0.00088926416,0.0013640898,0.0009648473,0.0017322924,0.0041426322,0.003171374,0.0015815233,0.02066809],"category_scores_gemma":[0.016177861,0.00069408154,0.0010457584,0.0013757233,0.0027180172,0.0124166375,0.005174455,0.0046034176,0.0040186993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011120307,0.0002100352,0.0005589269,0.0004970075,0.0000634352,0.00023379314,0.00037767435,0.07263439,0.008911929,0.7870082,0.019596394,0.1087962],"study_design_scores_gemma":[0.00009069127,0.00008714003,0.00030461565,0.000042198564,0.00003694297,0.00019687074,0.00007348683,0.3393803,0.0070202663,0.6386682,0.014050166,0.000049115002],"about_ca_topic_score_codex":0.0018717401,"about_ca_topic_score_gemma":0.0022596407,"teacher_disagreement_score":0.02066809,"about_ca_system_score_codex":0.004207149,"about_ca_system_score_gemma":0.0027667617,"threshold_uncertainty_score":0.06914163},"labels":[],"label_agreement":null},{"id":"W2140685585","doi":"10.1007/s10623-009-9334-7","title":"Comparing two pairing-based aggregate signature schemes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Pairing; Bilinear interpolation; Scheme (mathematics); Computer science; Signature (topology); Mathematics; Public-key cryptography; Theoretical computer science; Computer security; Statistics; Encryption; Physics","score_opus":0.026301828463056835,"score_gpt":0.2562259585936287,"score_spread":0.22992413013057184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140685585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49899897,0.002744888,0.4589945,0.0016285816,0.0008485254,0.000574768,0.00068848813,0.0011353513,0.034385968],"genre_scores_gemma":[0.92260814,0.00076104054,0.06941752,0.00019500585,0.000142489,0.0001608569,0.0005691848,0.00009605396,0.006049676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99120784,0.0030174765,0.00051468733,0.00046304477,0.0038261139,0.00097086455],"domain_scores_gemma":[0.98637486,0.0048863096,0.0010260778,0.00497293,0.0020938693,0.00064608036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061727175,0.00060770975,0.0011841801,0.0023248142,0.0012008661,0.0031167206,0.0015303239,0.002152787,0.004954096],"category_scores_gemma":[0.015510914,0.00038022565,0.00074524345,0.0029519952,0.001923051,0.00702604,0.004150193,0.0016323801,0.001320777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012207121,0.00080138864,0.008575736,0.0008240474,0.00038901344,0.00027926802,0.0013894513,0.10925676,0.042989794,0.5014073,0.0073329075,0.3145473],"study_design_scores_gemma":[0.0011052524,0.0061672963,0.006626966,0.00030859586,0.0005338197,0.0013785668,0.0016946095,0.49575004,0.07456703,0.3744487,0.037078023,0.00034118243],"about_ca_topic_score_codex":0.00038880744,"about_ca_topic_score_gemma":0.0003586785,"teacher_disagreement_score":0.0061727175,"about_ca_system_score_codex":0.001633103,"about_ca_system_score_gemma":0.0021090624,"threshold_uncertainty_score":0.03264481},"labels":[],"label_agreement":null},{"id":"W2141368734","doi":"10.1007/s10623-012-9770-7","title":"Combinatorial solutions providing improved security for the generalized Russian cards problem","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alice (programming language); Alice and Bob; Computer science; Set (abstract data type); Characterization (materials science); Theoretical computer science; Computer security; Mathematical economics; Mathematics; Programming language; Physics","score_opus":0.030845778076768953,"score_gpt":0.25751079346635564,"score_spread":0.2266650153895867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141368734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37299556,0.0009463643,0.50695497,0.0033690315,0.0004897027,0.00024056483,0.0006339049,0.00055879896,0.113811135],"genre_scores_gemma":[0.843517,0.0007171821,0.1346941,0.00060951494,0.0002571199,0.00021735826,0.00059358246,0.00016930753,0.019224776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984843,0.0007035052,0.00005713937,0.00018836984,0.00030374908,0.00026291405],"domain_scores_gemma":[0.99776006,0.0011746157,0.00022554879,0.00053224794,0.00016970493,0.00013784155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013614363,0.0010907463,0.0011456852,0.0010637925,0.0013007079,0.00283576,0.0016236021,0.0015616792,0.0074902195],"category_scores_gemma":[0.0053307815,0.0005080446,0.001099673,0.0014783252,0.0021819128,0.0032546392,0.0028497332,0.0032605212,0.0013330996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003389669,0.00009461794,0.00021737682,0.00010811635,0.00004089971,0.000076600416,0.00013214354,0.06603949,0.0024183276,0.8990429,0.0057968395,0.025693618],"study_design_scores_gemma":[0.00020389564,0.000094653675,0.00017464685,0.00004509681,0.00004238357,0.0001078632,0.00009237139,0.18450098,0.001741719,0.80641496,0.006544247,0.000037138245],"about_ca_topic_score_codex":0.000771944,"about_ca_topic_score_gemma":0.0010277247,"teacher_disagreement_score":0.0074902195,"about_ca_system_score_codex":0.0011090619,"about_ca_system_score_gemma":0.0014557671,"threshold_uncertainty_score":0.025057256},"labels":[],"label_agreement":null},{"id":"W2143043648","doi":"10.1145/2442829.2442870","title":"Deterministic unimodularity certification","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unimodular matrix; Integer (computer science); Mathematics; Discrete mathematics; Combinatorics; Bounded function; Modulo; Randomized algorithm; Algorithm; Computer science","score_opus":0.03023925100818718,"score_gpt":0.2596000367272592,"score_spread":0.229360785719072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143043648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17469385,0.00068984035,0.78118384,0.0030661607,0.00039744485,0.00037568584,0.0010095453,0.0067804167,0.031803247],"genre_scores_gemma":[0.85190034,0.00022636885,0.13746656,0.0006768988,0.00019906045,0.00033539822,0.0010032395,0.00042558523,0.00776661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.993141,0.0014359906,0.0003303068,0.0017001173,0.0021292646,0.0012633161],"domain_scores_gemma":[0.9791357,0.00834416,0.0012823906,0.0072131786,0.0034233807,0.0006012355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00335193,0.0005821646,0.0012536776,0.00083120895,0.0015652612,0.0029480178,0.0020142558,0.00136107,0.009463821],"category_scores_gemma":[0.02100262,0.0005309352,0.00075918244,0.0011225102,0.0029935162,0.005488077,0.005771347,0.0027127347,0.0028042172],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013005064,0.00041089568,0.0038638473,0.00044646987,0.0000980377,0.00032996753,0.00047615028,0.050948218,0.030572407,0.6556356,0.028702991,0.22721484],"study_design_scores_gemma":[0.00033341363,0.00027179,0.0010206341,0.000081953134,0.000052535204,0.0004110863,0.00015552771,0.3015969,0.049006168,0.6255703,0.021392604,0.00010713135],"about_ca_topic_score_codex":0.0009607839,"about_ca_topic_score_gemma":0.0012228464,"teacher_disagreement_score":0.009463821,"about_ca_system_score_codex":0.0018337693,"about_ca_system_score_gemma":0.0040772087,"threshold_uncertainty_score":0.031659603},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006610957988836975,"score_gpt":0.2277177245244399,"score_spread":0.2211067665356029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143772938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044898428,0.0072417236,0.8379041,0.0038165424,0.0008588335,0.00014362742,0.00028911364,0.00046042065,0.10438729],"genre_scores_gemma":[0.7642855,0.005286107,0.21034573,0.0009905827,0.001298647,0.00020726549,0.00027899558,0.00020900945,0.017098239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958864,0.0010716121,0.00025172083,0.00071798847,0.0016399896,0.00043238577],"domain_scores_gemma":[0.99470514,0.0019929837,0.00048259375,0.0016962904,0.0009125293,0.00021035182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832391,0.00093137904,0.00070897985,0.0021705849,0.0010176135,0.003570336,0.0012487265,0.0013373857,0.0049209087],"category_scores_gemma":[0.0082337065,0.000631393,0.0012960519,0.0013222754,0.0033285727,0.006625334,0.0034594678,0.004286138,0.0025067148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012725497,0.00003280644,0.00038280926,0.00009161096,0.000023163031,0.00013349824,0.00010275137,0.0050693057,0.0046184403,0.9576022,0.0021201794,0.029696012],"study_design_scores_gemma":[0.00003665025,0.00008617776,0.00024791906,0.000075045675,0.00003719554,0.0014436237,0.000059632595,0.070320636,0.008488052,0.8792057,0.039943326,0.00005596538],"about_ca_topic_score_codex":0.00030776593,"about_ca_topic_score_gemma":0.0001238065,"teacher_disagreement_score":0.0049209087,"about_ca_system_score_codex":0.0013009346,"about_ca_system_score_gemma":0.00088969246,"threshold_uncertainty_score":0.016462028},"labels":[],"label_agreement":null},{"id":"W2143848450","doi":"10.1109/iscas.2004.1328971","title":"A new digital signature scheme","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Alice (programming language); Digital signature; Computer science; Alice and Bob; Authentication (law); Computer security; Message authentication code; Signature (topology); Cryptography; Block (permutation group theory); Scheme (mathematics); Blind signature; Sign (mathematics); Hash function; Mathematics","score_opus":0.0064928491316626575,"score_gpt":0.20854069259552482,"score_spread":0.20204784346386218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143848450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016253332,0.009681309,0.8639302,0.004305143,0.0053511173,0.0009059182,0.0014489702,0.0022548768,0.09586903],"genre_scores_gemma":[0.22382776,0.008276448,0.6307512,0.0036878046,0.0027805013,0.00096779567,0.0023484074,0.00023956313,0.1271206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995168,0.0010100001,0.00049885106,0.00075469766,0.002166586,0.00040185798],"domain_scores_gemma":[0.9974661,0.0005039342,0.00025466445,0.00084303896,0.0006831299,0.00024909587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021052384,0.0007125465,0.0012020087,0.0016309749,0.0013789973,0.0033037236,0.0015479428,0.0022608894,0.007929899],"category_scores_gemma":[0.0039572506,0.00033333947,0.001043897,0.0023453827,0.001961011,0.008098424,0.0031945608,0.0030989526,0.006222068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003943721,0.00017086999,0.00047989725,0.00059233804,0.00009059142,0.00048701072,0.0004267063,0.0036269617,0.021492518,0.6881607,0.032643285,0.25143468],"study_design_scores_gemma":[0.00015623923,0.00028137362,0.00022843466,0.00010910398,0.00007420616,0.0019396199,0.00006177728,0.018885827,0.013123242,0.13386336,0.8311356,0.00014121218],"about_ca_topic_score_codex":0.0004057279,"about_ca_topic_score_gemma":0.0003747851,"teacher_disagreement_score":0.007929899,"about_ca_system_score_codex":0.0013763714,"about_ca_system_score_gemma":0.002068031,"threshold_uncertainty_score":0.02652812},"labels":[],"label_agreement":null},{"id":"W2146941523","doi":"10.1007/s10207-011-0129-2","title":"Generalizing cryptosystems based on the subset sum problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cryptosystem; Discrete logarithm; Computer science; Homomorphic encryption; Homomorphism; Hybrid cryptosystem; Cryptography; Subset sum problem; Lattice problem; Theoretical computer science; Random oracle; Oracle; Scheme (mathematics); Public-key cryptography; Encryption; Discrete mathematics; Computer security; Mathematics; Algorithm; Knapsack problem","score_opus":0.022872971244732646,"score_gpt":0.23372819310383516,"score_spread":0.21085522185910252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146941523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11119797,0.0010367068,0.84924763,0.0016199882,0.00053203246,0.00019370808,0.00015730044,0.00097121636,0.035043407],"genre_scores_gemma":[0.8192422,0.001691453,0.15930189,0.000742779,0.0009248328,0.00017830692,0.0005011442,0.0004344634,0.01698291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986094,0.00043151234,0.000086094034,0.0002213482,0.00047810475,0.00017351515],"domain_scores_gemma":[0.998033,0.0008229304,0.000120936114,0.0007756556,0.00017176296,0.00007569281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014698788,0.000870139,0.0012311238,0.0010070106,0.00088818785,0.0020084851,0.0009191687,0.0010325492,0.0038770053],"category_scores_gemma":[0.0039810445,0.00038112854,0.0012630703,0.0012906496,0.0017239355,0.0052553453,0.0034390076,0.0037183086,0.0012132031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003794083,0.00013974527,0.00038089108,0.00019225937,0.00008230547,0.00017816885,0.0002602686,0.066896334,0.010972992,0.83032227,0.004785313,0.08541006],"study_design_scores_gemma":[0.000054293047,0.00010883236,0.00013214258,0.00003085419,0.00003662789,0.00027314672,0.00003938025,0.13463576,0.0056406646,0.8524578,0.006566315,0.000024186802],"about_ca_topic_score_codex":0.00015817583,"about_ca_topic_score_gemma":0.00020812723,"teacher_disagreement_score":0.0038770053,"about_ca_system_score_codex":0.0007253185,"about_ca_system_score_gemma":0.0005629387,"threshold_uncertainty_score":0.012969911},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08650531738753572,"score_gpt":0.3112842504318411,"score_spread":0.22477893304430538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147096042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2512833,0.0022353823,0.737183,0.0005566169,0.00012600921,0.0004939297,0.0014432993,0.0016475391,0.0050308746],"genre_scores_gemma":[0.8287355,0.0007077953,0.16578898,0.00017659937,0.00006917861,0.00011413916,0.0010103176,0.0000798271,0.0033177943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726796,0.0004821637,0.00046208987,0.0004180977,0.00095682434,0.0004128777],"domain_scores_gemma":[0.99442166,0.0014427762,0.0006691289,0.0023561895,0.0008283594,0.0002817921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503159,0.00046051215,0.0013622955,0.0011594418,0.0007680148,0.0017241882,0.0011905414,0.0008651126,0.0018200099],"category_scores_gemma":[0.005602187,0.00028429343,0.000680365,0.0023788738,0.0007465378,0.0057885083,0.0031934618,0.00093585026,0.0012499456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038832573,0.0007388895,0.008767775,0.0013007004,0.00031698146,0.0015487174,0.0020502072,0.059811424,0.26601976,0.08083536,0.0121624125,0.56256455],"study_design_scores_gemma":[0.00035964767,0.0010125496,0.0033712955,0.00010393624,0.00018172861,0.0039485884,0.0015113514,0.70498025,0.2004911,0.062132426,0.021677798,0.00022930666],"about_ca_topic_score_codex":0.0016750037,"about_ca_topic_score_gemma":0.001874967,"teacher_disagreement_score":0.0018200099,"about_ca_system_score_codex":0.0008130555,"about_ca_system_score_gemma":0.0016521559,"threshold_uncertainty_score":0.0060884953},"labels":[],"label_agreement":null},{"id":"W2147181464","doi":"10.1109/tce.2003.1209533","title":"Pay-TV system with strong privacy and non-repudiation protection","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Ticket; Service provider; Internet privacy; Computer security; Business; Privacy protection; Service (business); Advertising; Computer science; Marketing","score_opus":0.010484328333851342,"score_gpt":0.2146471688029665,"score_spread":0.20416284046911515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147181464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11994773,0.0007257558,0.8265589,0.0013414831,0.00044351385,0.00066975714,0.0003208038,0.012263797,0.03772818],"genre_scores_gemma":[0.9401669,0.00016396282,0.04147753,0.00031964338,0.00022972253,0.00020600407,0.00021590256,0.00013832278,0.017082084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958812,0.0008651585,0.00035633764,0.0004475099,0.0016648644,0.00078487495],"domain_scores_gemma":[0.99229103,0.0014519504,0.0006032222,0.003280702,0.0017979671,0.00057508226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002629476,0.00031687977,0.0011262193,0.001024283,0.0019714688,0.0034254997,0.0019695153,0.0019188448,0.007605164],"category_scores_gemma":[0.0068350746,0.00039838033,0.0005897423,0.0011716484,0.0014928422,0.0043492317,0.005131267,0.0020344006,0.0030885332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003606448,0.0008741607,0.006583445,0.00067540305,0.00021995383,0.0016826788,0.0015806815,0.028242996,0.07646809,0.54938227,0.03589893,0.29478487],"study_design_scores_gemma":[0.0008245899,0.001222227,0.00392744,0.000111268804,0.00026319257,0.0036691634,0.00045374877,0.64834297,0.08386149,0.1374822,0.11947147,0.00037030506],"about_ca_topic_score_codex":0.0010610002,"about_ca_topic_score_gemma":0.0005013654,"teacher_disagreement_score":0.007605164,"about_ca_system_score_codex":0.000943996,"about_ca_system_score_gemma":0.002442277,"threshold_uncertainty_score":0.025441825},"labels":[],"label_agreement":null},{"id":"W2150388796","doi":"10.1109/ntms.2009.5384673","title":"Simple Dynamic Key Management in SQL Randomization","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; SQL; SQL injection; Cryptography; Stored procedure; Key (lock); Java; Scheme (mathematics); Database; Key management; Computer security; Simple (philosophy); Query by Example; World Wide Web; Programming language; Mathematics","score_opus":0.0050571784542297995,"score_gpt":0.2384039216314515,"score_spread":0.2333467431772217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150388796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022500431,0.0004593249,0.9624633,0.00043966234,0.00028984123,0.00049717963,0.00015622884,0.0058743255,0.0073195933],"genre_scores_gemma":[0.6903229,0.00041738528,0.29112053,0.0006350118,0.000335335,0.0006187202,0.00046937086,0.00062985683,0.015450903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99207884,0.0021848327,0.00089590816,0.0011568918,0.0026019197,0.0010815717],"domain_scores_gemma":[0.99398464,0.000974528,0.00078383763,0.0033448185,0.0006535634,0.00025855566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038754793,0.0006739975,0.00122624,0.0012127351,0.0014483106,0.002619735,0.0025195947,0.0015781117,0.0070427964],"category_scores_gemma":[0.0062897713,0.0005612163,0.0009853053,0.0011886503,0.002224211,0.00899166,0.0066295434,0.0020387676,0.0036479516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025622253,0.00043758968,0.0022452332,0.0006460083,0.00016819763,0.0011051936,0.00092557375,0.0133386785,0.12593554,0.5549068,0.013081543,0.2846474],"study_design_scores_gemma":[0.0006801777,0.001341765,0.0022068808,0.00028457303,0.00032311148,0.004148709,0.0003441138,0.20190185,0.29396543,0.3120169,0.18215942,0.0006271259],"about_ca_topic_score_codex":0.00022164703,"about_ca_topic_score_gemma":0.00015225788,"teacher_disagreement_score":0.0070427964,"about_ca_system_score_codex":0.0010837194,"about_ca_system_score_gemma":0.0012662399,"threshold_uncertainty_score":0.023560524},"labels":[],"label_agreement":null},{"id":"W2150405243","doi":"10.82308/39079","title":"Interactive hashing and reductions between Oblivious Transfer variants","year":2007,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Oblivious transfer; Computer science; Communication source; Theoretical computer science; Hash function; Cryptography; Upper and lower bounds; Cryptographic primitive; Coin flipping; String (physics); Entropy (arrow of time); Generality; Fraction (chemistry); Universal hashing; Cryptographic protocol; Computer security; Mathematics; Cryptographic hash function; Double hashing; Computer network; Statistics","score_opus":0.019550939997272487,"score_gpt":0.2457614452325192,"score_spread":0.22621050523524672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150405243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15300484,0.00061370904,0.79613125,0.0013380281,0.00013570805,0.00061408436,0.0005317402,0.0015034059,0.046127237],"genre_scores_gemma":[0.8986081,0.0003044599,0.08788681,0.00034281533,0.00011490389,0.00071666983,0.0005198348,0.0004440673,0.011062331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925256,0.0017356359,0.00044943212,0.0010184242,0.0029524243,0.001318484],"domain_scores_gemma":[0.9863941,0.0077675516,0.0006457437,0.0044886377,0.00045824595,0.00024564398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003418835,0.0006726951,0.0010427918,0.0010112884,0.001170418,0.0025644675,0.0031700658,0.0015596999,0.005959786],"category_scores_gemma":[0.014024079,0.00063680357,0.0025386673,0.0011287455,0.0054763393,0.006670182,0.006605814,0.0051388503,0.0012265414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035809234,0.00015810438,0.00076290953,0.00024189036,0.000051666626,0.00031251542,0.0008603987,0.04647906,0.0062814928,0.92162496,0.0017563034,0.02111253],"study_design_scores_gemma":[0.00007128797,0.0001368406,0.00045937407,0.000043402644,0.000048691934,0.00029657834,0.00017055654,0.106588066,0.016914327,0.86998034,0.0052345023,0.00005604579],"about_ca_topic_score_codex":0.00072583836,"about_ca_topic_score_gemma":0.00040186665,"teacher_disagreement_score":0.005959786,"about_ca_system_score_codex":0.0029812483,"about_ca_system_score_gemma":0.0016628521,"threshold_uncertainty_score":0.021630526},"labels":[],"label_agreement":null},{"id":"W2152971985","doi":"10.1142/s1793042110003770","title":"AN EFFICIENT SEVENTH POWER RESIDUE SYMBOL ALGORITHM","year":2010,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Legendre symbol; Quadratic residue; Reciprocity law; Cryptosystem; Euclidean algorithm; Cryptography; Residue (chemistry); Cyclotomic field; Residue field; Discrete mathematics; Arithmetic; Field (mathematics); Algorithm; Pure mathematics; Quadratic field; Quadratic equation","score_opus":0.003873487800447853,"score_gpt":0.2709308740261409,"score_spread":0.2670573862256931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152971985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041374452,0.0002927577,0.9311408,0.00047997772,0.00020327004,0.0002658656,0.00027796652,0.0028099369,0.023155069],"genre_scores_gemma":[0.270227,0.00027458597,0.7073351,0.00027925873,0.0001376725,0.0002925136,0.0011936853,0.00039378073,0.019866481],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840003,0.0002533289,0.00014115241,0.0002668551,0.00065785414,0.00028076622],"domain_scores_gemma":[0.998566,0.00030600114,0.00007922089,0.00049587956,0.00046562077,0.000087230124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010152676,0.0005939654,0.0010331938,0.0012841785,0.0008454722,0.0018045488,0.0015858526,0.00101572,0.009962892],"category_scores_gemma":[0.004457448,0.00025269698,0.00076180557,0.0011290691,0.0009897004,0.0024941403,0.0026511261,0.0014113844,0.0069047473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053764106,0.00021233436,0.001413824,0.00022598941,0.000059174396,0.00032686823,0.00041233381,0.021883147,0.024228241,0.3174342,0.018010825,0.6152555],"study_design_scores_gemma":[0.00040064627,0.00058402366,0.0008365098,0.000113020666,0.00008920358,0.0010400699,0.00039214073,0.40016192,0.054352976,0.46619305,0.07572358,0.00011291908],"about_ca_topic_score_codex":0.0008001705,"about_ca_topic_score_gemma":0.001097972,"teacher_disagreement_score":0.009962892,"about_ca_system_score_codex":0.0008300146,"about_ca_system_score_gemma":0.0025568728,"threshold_uncertainty_score":0.03332919},"labels":[],"label_agreement":null},{"id":"W2155834001","doi":"10.1016/j.tcs.2015.05.031","title":"A framework for non-interactive instance-dependent commitment schemes (NIC)","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Variety (cybernetics); Computer science; Theoretical computer science; Closure (psychology); Abstraction; Zero-knowledge proof; Artificial intelligence; Algorithm; Cryptography","score_opus":0.025976171992434783,"score_gpt":0.3073404757690739,"score_spread":0.2813643037766391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155834001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036390305,0.00034927743,0.97415155,0.0010264196,0.00023608223,0.00022355802,0.00021356951,0.0005313474,0.019629188],"genre_scores_gemma":[0.3483035,0.00116758,0.6149246,0.001000797,0.00060067984,0.0012748927,0.00069715,0.0004764199,0.031554338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934541,0.0020418526,0.00039095368,0.00117159,0.0021177258,0.0008238186],"domain_scores_gemma":[0.9933776,0.0018584104,0.00038263778,0.0030057796,0.0008464017,0.0005291857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005656064,0.0010001818,0.0013949402,0.0010402709,0.0027481606,0.00546921,0.007925616,0.002892725,0.009001664],"category_scores_gemma":[0.010016218,0.0010177734,0.001793156,0.0018894764,0.0040108534,0.009815192,0.008448247,0.008503485,0.00296789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022168339,0.00001974086,0.000040865176,0.00003753624,0.0000071303957,0.00003142171,0.00007856533,0.0038069692,0.00033185713,0.99008465,0.0012026537,0.004336511],"study_design_scores_gemma":[0.00003022654,0.000035369798,0.00006106919,0.000048701793,0.000026333853,0.00012379934,0.00006258463,0.09073285,0.0010472976,0.8812124,0.02658278,0.000036630212],"about_ca_topic_score_codex":0.0018279429,"about_ca_topic_score_gemma":0.0019968941,"teacher_disagreement_score":0.009001664,"about_ca_system_score_codex":0.004783748,"about_ca_system_score_gemma":0.0044821887,"threshold_uncertainty_score":0.03470868},"labels":[],"label_agreement":null},{"id":"W2157132257","doi":"10.1109/itcc.2004.1286625","title":"How to make e-cash with non-repudiation and anonymity","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Anonymity; Blind signature; Computer security; Non-repudiation; Computer science; Internet privacy; Digital signature; Cash; Public-key cryptography; Signature (topology); Service (business); Key (lock); Business; Encryption; Finance","score_opus":0.007014791654728065,"score_gpt":0.20066924857237595,"score_spread":0.19365445691764788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157132257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020788552,0.0012658113,0.913383,0.019930758,0.0020078905,0.00039402765,0.00015194046,0.0023272645,0.0397508],"genre_scores_gemma":[0.4449677,0.0018602558,0.5134204,0.0027733687,0.0010848102,0.000482285,0.00019723913,0.0005167776,0.03469707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99243826,0.0030923672,0.00054405374,0.0008236252,0.0022852519,0.0008164238],"domain_scores_gemma":[0.99065197,0.0027969691,0.00068501796,0.0031187125,0.0020967908,0.0006505155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073799277,0.00057581346,0.0008346981,0.001300496,0.0032738568,0.006292588,0.001506647,0.0038952872,0.0053800014],"category_scores_gemma":[0.022091605,0.0004723496,0.0010239396,0.001260673,0.0060578235,0.017105429,0.0040228376,0.0034190463,0.003999374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017249519,0.000075522315,0.00026237112,0.00013826737,0.00003496797,0.00018701243,0.0005035804,0.0069407285,0.0026015735,0.9115946,0.013492738,0.06399613],"study_design_scores_gemma":[0.00006406996,0.00004522922,0.00011527589,0.00006752612,0.000037886595,0.00026090493,0.00023068758,0.021406261,0.007521465,0.89760023,0.07255525,0.00009515473],"about_ca_topic_score_codex":0.0013450711,"about_ca_topic_score_gemma":0.0007837833,"teacher_disagreement_score":0.0073799277,"about_ca_system_score_codex":0.0012289961,"about_ca_system_score_gemma":0.0033823573,"threshold_uncertainty_score":0.0390293},"labels":[],"label_agreement":null},{"id":"W2157279580","doi":"10.1145/1314333.1314340","title":"Improved user authentication in off-the-record messaging","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Usability; Instant messaging; Authentication (law); Plug-in; Software; Variety (cybernetics); World Wide Web; Computer security; Cryptography; Internet privacy; Human–computer interaction","score_opus":0.009494069838954813,"score_gpt":0.248596979844635,"score_spread":0.23910291000568018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157279580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21373317,0.002471903,0.7095336,0.0030701172,0.001162923,0.00075953116,0.00018188026,0.016687764,0.052399233],"genre_scores_gemma":[0.8302843,0.00077878643,0.1228516,0.0006041246,0.0003771428,0.000105099374,0.00019176478,0.00060597487,0.044201296],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99051625,0.0037868998,0.0007056266,0.0010030883,0.002995567,0.0009925525],"domain_scores_gemma":[0.98538834,0.0035432167,0.0010526315,0.0072564622,0.002324484,0.00043489411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005249832,0.00093275815,0.001264705,0.0008983929,0.0015062081,0.0032484112,0.0023819255,0.0032628772,0.012763626],"category_scores_gemma":[0.016224282,0.0007412551,0.0008641055,0.00082490843,0.0013860664,0.0092610065,0.004910049,0.0021487856,0.007215873],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061856653,0.0015453084,0.0073988815,0.0010446381,0.00012200123,0.0038226785,0.005386095,0.008704384,0.18537194,0.11723019,0.029063132,0.63412505],"study_design_scores_gemma":[0.00078067696,0.005714919,0.012682328,0.00060821243,0.00059000874,0.013607024,0.0029157416,0.23218277,0.4413626,0.05758746,0.23124585,0.0007224008],"about_ca_topic_score_codex":0.0008707502,"about_ca_topic_score_gemma":0.0005634766,"teacher_disagreement_score":0.012763626,"about_ca_system_score_codex":0.0006752402,"about_ca_system_score_gemma":0.00051460037,"threshold_uncertainty_score":0.042698562},"labels":[],"label_agreement":null},{"id":"W2158245846","doi":"10.1109/ccece.2008.4564795","title":"Asymmetric disribution of computations in Internet Key Exchange Protocol","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Server; Protocol (science); IPsec; Key exchange; Computer network; The Internet; Key (lock); Computation; Scheme (mathematics); Distributed computing; Cryptography; Computer security; Encryption; Public-key cryptography; World Wide Web; Algorithm; Mathematics","score_opus":0.020607914300117165,"score_gpt":0.22019734581525072,"score_spread":0.19958943151513356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158245846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04053235,0.0019133183,0.9296699,0.0015032396,0.0005313639,0.0004714746,0.0001509963,0.00076916843,0.024458202],"genre_scores_gemma":[0.76722866,0.0016952946,0.21510933,0.0004952487,0.00048818713,0.0007217797,0.0003639261,0.00014680965,0.013750797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892641,0.0036484571,0.0009936147,0.0011461515,0.0038420954,0.0011055915],"domain_scores_gemma":[0.9946854,0.0012313962,0.0005620542,0.002459007,0.000900572,0.00016150893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003738076,0.00062401424,0.00077542977,0.0010426244,0.001555493,0.003066099,0.0017632095,0.0014173513,0.002609661],"category_scores_gemma":[0.0076319966,0.0004804923,0.0005493883,0.0015939182,0.0019011762,0.007324342,0.003552622,0.0026549376,0.0013695355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008779726,0.0001735832,0.0011487367,0.00039604737,0.000059187376,0.0006322696,0.0008444612,0.016828408,0.02427862,0.7926223,0.007124276,0.1550141],"study_design_scores_gemma":[0.00026134707,0.0005281371,0.0010563482,0.00023090784,0.00014728282,0.002469478,0.00042123467,0.3115718,0.08209246,0.5239145,0.077082284,0.00022426032],"about_ca_topic_score_codex":0.0005123277,"about_ca_topic_score_gemma":0.00043799213,"teacher_disagreement_score":0.003738076,"about_ca_system_score_codex":0.0015199424,"about_ca_system_score_gemma":0.0017458842,"threshold_uncertainty_score":0.019769073},"labels":[],"label_agreement":null},{"id":"W2158303681","doi":"10.1109/iccnc.2013.6504126","title":"Cloud-hosted key sharing towards secure and scalable mobile applications in clouds","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Scalability; Key (lock); Revocation; Data sharing; Key management; Computer network; Encryption; Distributed computing; Computer security; Database; Operating system","score_opus":0.03765016578818742,"score_gpt":0.2900395208622726,"score_spread":0.25238935507408516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158303681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08091066,0.0025798352,0.9046308,0.0008640228,0.00031312802,0.00041912493,0.0001626271,0.0014491755,0.008670654],"genre_scores_gemma":[0.90226,0.0005716991,0.09470132,0.00011824712,0.00007225468,0.00010934506,0.00009035713,0.000056529323,0.002020233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856454,0.0003378467,0.000080002785,0.00013225497,0.00042673602,0.00045861298],"domain_scores_gemma":[0.9984628,0.00032063376,0.0002021616,0.00045234116,0.00038998973,0.00017213494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014371079,0.0005631115,0.0009595526,0.0006330986,0.0016386253,0.0022683472,0.0017729823,0.0009955533,0.0022992152],"category_scores_gemma":[0.0028108093,0.0003373742,0.00057513005,0.0014709634,0.0011176692,0.0039213016,0.003800152,0.0012008271,0.00091726583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014205186,0.00032456202,0.0016563084,0.0005520267,0.00013978027,0.0015272414,0.0008227688,0.43348774,0.058058906,0.3295391,0.018200064,0.15427089],"study_design_scores_gemma":[0.00008264109,0.00009961975,0.00029609338,0.00003937789,0.000025162606,0.00034114902,0.00023432635,0.919126,0.01244727,0.05635444,0.010917514,0.000036473375],"about_ca_topic_score_codex":0.003119405,"about_ca_topic_score_gemma":0.0024472077,"teacher_disagreement_score":0.003119405,"about_ca_system_score_codex":0.0014556533,"about_ca_system_score_gemma":0.0019700788,"threshold_uncertainty_score":0.010561526},"labels":[],"label_agreement":null},{"id":"W2158964208","doi":"10.1109/icdcs.2005.72","title":"Scalable, Server-Passive, User-Anonymous Timed Release Cryptography","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Anonymity; Computer network; Network Time Protocol; Server; Key (lock); Communication source; Cryptography; Encryption; Lock (firearm); Scheme (mathematics); Computer security; Distributed computing; Operating system; Time synchronization","score_opus":0.007877911502497321,"score_gpt":0.21993837791099224,"score_spread":0.21206046640849494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158964208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023498397,0.00037107334,0.96679795,0.00043160067,0.00013266633,0.00020310195,0.00010042087,0.0007624103,0.0077024503],"genre_scores_gemma":[0.8019859,0.00070841884,0.18169697,0.00029023777,0.00025768066,0.00034876828,0.00023934426,0.00016115436,0.014311647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970566,0.0008079851,0.0002731615,0.0004077259,0.0010916828,0.00036281807],"domain_scores_gemma":[0.9945927,0.0012108092,0.00077120954,0.0025567438,0.00058802275,0.0002803383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00318611,0.0005653479,0.00090406206,0.0005832084,0.0010618666,0.002160114,0.0021882004,0.0011132678,0.0031005058],"category_scores_gemma":[0.0057946867,0.00037613843,0.0007506115,0.0012849584,0.0016682883,0.009814839,0.0038420619,0.002206726,0.001371652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00102217,0.0001583644,0.0006493875,0.00029118088,0.00006739601,0.0005222585,0.0006695203,0.04889155,0.043271203,0.8391571,0.0049654744,0.060334355],"study_design_scores_gemma":[0.00039008853,0.00068277953,0.00033925113,0.00008444627,0.0001259981,0.001410643,0.00027593813,0.38294968,0.08854473,0.47805163,0.046994317,0.00015050931],"about_ca_topic_score_codex":0.00017386745,"about_ca_topic_score_gemma":0.00013427115,"teacher_disagreement_score":0.00318611,"about_ca_system_score_codex":0.00094073225,"about_ca_system_score_gemma":0.0013359371,"threshold_uncertainty_score":0.016849935},"labels":[],"label_agreement":null},{"id":"W2158982627","doi":"10.1109/cloudcom.2012.6427591","title":"Character-based search with data confidentiality in the clouds","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scheme (mathematics); Encryption; Representation (politics); Hash function; Key (lock); Information retrieval; Confidentiality; Noise (video); Hash table; Data mining; Artificial intelligence; Image (mathematics); Computer security","score_opus":0.07505802641875069,"score_gpt":0.3106826824887575,"score_spread":0.23562465607000682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158982627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3108404,0.0020101087,0.6606497,0.0034291525,0.00022585392,0.000833358,0.00074467034,0.0035208175,0.01774606],"genre_scores_gemma":[0.89116853,0.0003280641,0.10377715,0.00020967607,0.000060521386,0.00014585216,0.0002356114,0.00015534264,0.003919085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887939,0.0027597395,0.0009555107,0.0009968502,0.0045258496,0.0019681987],"domain_scores_gemma":[0.97636783,0.005708035,0.001994315,0.0126980115,0.002513812,0.0007179807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005462483,0.0006006895,0.0020475753,0.0013890457,0.0035647983,0.0051018,0.0030231175,0.0022951444,0.004017068],"category_scores_gemma":[0.01671444,0.0007221709,0.00086545595,0.0049994797,0.003504456,0.014714519,0.0069892057,0.0019633651,0.0015699562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057894066,0.0009029357,0.007705712,0.0006377202,0.00022594293,0.0016605764,0.00292244,0.19053552,0.059822712,0.48341736,0.017856224,0.22852342],"study_design_scores_gemma":[0.00026906826,0.00026932807,0.00090228015,0.000059408285,0.00005589041,0.0008707533,0.00074671506,0.74930006,0.06758323,0.16379835,0.016027512,0.00011749241],"about_ca_topic_score_codex":0.006142792,"about_ca_topic_score_gemma":0.0026666007,"teacher_disagreement_score":0.006142792,"about_ca_system_score_codex":0.004158751,"about_ca_system_score_gemma":0.005137127,"threshold_uncertainty_score":0.030173957},"labels":[],"label_agreement":null},{"id":"W2159709434","doi":"10.1109/securecomm.2005.43","title":"Short Paper: Limitations of Key Escrow in Identity-Based Schemes in Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key escrow; Wireless ad hoc network; Computer science; Mobile ad hoc network; Computer network; Key (lock); Escrow; Computer security; Vehicular ad hoc network; Ad hoc wireless distribution service; Cryptography; Public-key cryptography; Optimized Link State Routing Protocol; Wireless; Telecommunications; Encryption","score_opus":0.024033399433216317,"score_gpt":0.2415399305731104,"score_spread":0.2175065311398941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159709434","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035663415,0.061937943,0.7347875,0.07998273,0.0087407455,0.00024796117,0.00029111528,0.00078281405,0.07756575],"genre_scores_gemma":[0.8328727,0.04637071,0.073642515,0.006236327,0.013146194,0.00031381962,0.00025239305,0.00046304264,0.026702294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870026,0.006346445,0.000488111,0.0012076398,0.0042401874,0.00071509875],"domain_scores_gemma":[0.9067743,0.07009407,0.00260556,0.010477155,0.008798771,0.001250113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012508634,0.0012141285,0.0015590154,0.0017058126,0.0031889386,0.006557055,0.004318658,0.0048122276,0.008775542],"category_scores_gemma":[0.062090106,0.0008595753,0.00088905654,0.0042488393,0.0067885495,0.032549735,0.004109613,0.0078262715,0.0033227075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037179852,0.00009664366,0.0012503118,0.000673788,0.00008054452,0.00027869001,0.00057323836,0.01906953,0.0011118468,0.85944206,0.037405968,0.07964564],"study_design_scores_gemma":[0.0000849119,0.00025591828,0.00033655032,0.00048470916,0.000100775964,0.0009074786,0.000453536,0.13011013,0.0020545782,0.7423927,0.122728795,0.000089824025],"about_ca_topic_score_codex":0.0010673546,"about_ca_topic_score_gemma":0.0006547787,"teacher_disagreement_score":0.012508634,"about_ca_system_score_codex":0.0037259154,"about_ca_system_score_gemma":0.0019012468,"threshold_uncertainty_score":0.06615275},"labels":[],"label_agreement":null},{"id":"W2160580401","doi":"10.1007/978-3-642-03298-1_1","title":"Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.008764984741395598,"score_gpt":0.22045521406982346,"score_spread":0.21169022932842788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160580401","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09233228,0.023400139,0.34875238,0.034362,0.0038240717,0.00020154219,0.0006752102,0.0004925246,0.49595982],"genre_scores_gemma":[0.77934605,0.010554611,0.08505445,0.0022704087,0.0022564188,0.00020947633,0.00039516145,0.00018299991,0.11973039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981205,0.00055926794,0.000090297086,0.00024210219,0.00075700926,0.00023087193],"domain_scores_gemma":[0.9978728,0.0011867482,0.00014347894,0.00044916433,0.0002387828,0.000109001776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001930519,0.00061481935,0.00079788064,0.0011550571,0.0024244518,0.0032368447,0.0010849,0.0021427567,0.007401164],"category_scores_gemma":[0.0062419213,0.00048815718,0.00051612593,0.0026689235,0.005337448,0.011269304,0.003402965,0.005504085,0.0021088608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003491726,0.000009170614,0.000026417982,0.000028104421,0.0000027492276,0.000025169153,0.00008646606,0.0006389114,0.00016918824,0.9845999,0.0026427559,0.011736316],"study_design_scores_gemma":[0.000007682749,0.0000057936495,0.000022302398,0.000010951927,0.000001965384,0.000039367707,0.000024691919,0.0013212073,0.00030117776,0.9878984,0.010360888,0.0000056629865],"about_ca_topic_score_codex":0.00064996484,"about_ca_topic_score_gemma":0.00045355954,"teacher_disagreement_score":0.007401164,"about_ca_system_score_codex":0.0018965933,"about_ca_system_score_gemma":0.0018104013,"threshold_uncertainty_score":0.024759352},"labels":[],"label_agreement":null},{"id":"W2161790848","doi":"10.1145/1368310.1368349","title":"Non-interactive conference key distribution and its applications","year":2008,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer security; Key distribution; Adversary; Anonymity; Communication source; Key (lock); Encryption; Computer security model; Provable security; Authentication (law); Key encapsulation; Public-key cryptography; Theoretical computer science; Computer network","score_opus":0.01790145095969897,"score_gpt":0.247313913456695,"score_spread":0.22941246249699604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161790848","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03937065,0.002780193,0.9176682,0.0021118366,0.0003522696,0.00017899308,0.000112095426,0.0007994198,0.036626272],"genre_scores_gemma":[0.866966,0.0014582494,0.11586516,0.0002894114,0.00037868053,0.00020766234,0.00016220828,0.0001224111,0.014550156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99521047,0.0016059828,0.00029955144,0.0007393275,0.0017256088,0.0004190559],"domain_scores_gemma":[0.9920582,0.0034944762,0.0006236416,0.002405543,0.0009507994,0.00046738808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028755234,0.00047384368,0.00060537655,0.0008852797,0.001268173,0.0023222498,0.0015172984,0.0011934305,0.0060435478],"category_scores_gemma":[0.0060158498,0.00037648494,0.0007189593,0.0016040555,0.0026435468,0.0048773726,0.0042610257,0.0026603055,0.0011553213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043135128,0.00010880296,0.0013238429,0.0002626828,0.000053192358,0.00035587858,0.00051162613,0.026039328,0.006485346,0.8846582,0.0031474133,0.07662228],"study_design_scores_gemma":[0.00017712159,0.00027826417,0.0008728109,0.000098301265,0.00007641807,0.0014756332,0.00034854052,0.28704512,0.037240766,0.5689085,0.1033669,0.000111630696],"about_ca_topic_score_codex":0.00057118473,"about_ca_topic_score_gemma":0.00027082005,"teacher_disagreement_score":0.0060435478,"about_ca_system_score_codex":0.0020390411,"about_ca_system_score_gemma":0.001082981,"threshold_uncertainty_score":0.020217717},"labels":[],"label_agreement":null},{"id":"W2162319199","doi":"10.1109/itcc.2005.7","title":"A dynamic method for handling the inference problem in multilevel secure databases","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Inference; Computer science; Database security; Set (abstract data type); Data mining; Key (lock); Database; Compromise; Artificial intelligence; Computer security","score_opus":0.03365967508308784,"score_gpt":0.34798752360990554,"score_spread":0.3143278485268177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162319199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014237703,0.000057701483,0.9973176,0.00014481161,0.000018415207,0.000053068048,0.000042465006,0.00040443565,0.00053767726],"genre_scores_gemma":[0.16190553,0.00024325865,0.8340212,0.00025647477,0.00015763835,0.0003060941,0.00020400756,0.00017379856,0.0027319517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99140865,0.0018068946,0.0007732441,0.001967152,0.0034405019,0.00060349907],"domain_scores_gemma":[0.9821262,0.008161363,0.0013391458,0.0065710833,0.0013528435,0.00044939775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069421646,0.0008530961,0.0013123333,0.0021342167,0.0023207776,0.0045237867,0.0051436066,0.002112371,0.0061040153],"category_scores_gemma":[0.019118447,0.00105446,0.0019798053,0.0022673265,0.0034308445,0.011667303,0.0071542244,0.005715354,0.0012929536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051845814,0.00020823117,0.0016193716,0.00026167854,0.00015687832,0.00033417557,0.0008195735,0.05127401,0.013173625,0.6318084,0.005647399,0.29417816],"study_design_scores_gemma":[0.00012838627,0.0001513435,0.00037289044,0.00008211628,0.00014301407,0.00081535976,0.00015947892,0.6012927,0.019578774,0.35562074,0.02152296,0.00013217398],"about_ca_topic_score_codex":0.0020127802,"about_ca_topic_score_gemma":0.0019798356,"teacher_disagreement_score":0.0069421646,"about_ca_system_score_codex":0.0020205614,"about_ca_system_score_gemma":0.0029127502,"threshold_uncertainty_score":0.036714137},"labels":[],"label_agreement":null},{"id":"W2162799363","doi":"10.1109/icc.2011.5962452","title":"PEKSrand: Providing Predicate Privacy in Public-Key Encryption with Keyword Search","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Predicate (mathematical logic); Computer science; Delegate; Encryption; Theoretical computer science; Information privacy; Key (lock); Scheme (mathematics); Computer security; Mathematics; Programming language","score_opus":0.06391744143917531,"score_gpt":0.23871292300703562,"score_spread":0.1747954815678603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162799363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027120179,0.00066467765,0.9634353,0.0009863905,0.00010723957,0.00026766653,0.00040729376,0.0018694649,0.0051417714],"genre_scores_gemma":[0.800125,0.0005857354,0.19203328,0.0005678783,0.00017633032,0.000356651,0.0005350148,0.00022252182,0.00539756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897474,0.0040027713,0.0008717463,0.0011283585,0.0030870428,0.0011627894],"domain_scores_gemma":[0.98708564,0.004437532,0.0011269866,0.006094611,0.0008594738,0.00039567813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069444105,0.00075774774,0.0019860978,0.0013291416,0.0016878729,0.0030448893,0.0027738726,0.0023632948,0.0027284955],"category_scores_gemma":[0.01633288,0.00079213636,0.0013277055,0.0029346156,0.0031728926,0.014066233,0.008150723,0.0031499115,0.001483524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026984022,0.00037838938,0.0024051364,0.0005389282,0.00022902066,0.00092396344,0.0012621059,0.06748589,0.025767285,0.6992415,0.01181733,0.18725204],"study_design_scores_gemma":[0.00052636757,0.0005644569,0.00074296934,0.00008735666,0.00013542044,0.0016606918,0.00024152681,0.42893526,0.04801981,0.48693243,0.03192438,0.00022936687],"about_ca_topic_score_codex":0.00069490954,"about_ca_topic_score_gemma":0.0005317574,"teacher_disagreement_score":0.0069444105,"about_ca_system_score_codex":0.0016020095,"about_ca_system_score_gemma":0.0030925765,"threshold_uncertainty_score":0.03672594},"labels":[],"label_agreement":null},{"id":"W2163538620","doi":"10.1007/978-3-642-38980-1_32","title":"Batch Proofs of Partial Knowledge","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Zero-knowledge proof; Computer science; Exploit; Logarithm; Discrete logarithm; Theoretical computer science; Simple (philosophy); Computation; Discrete mathematics; Algorithm; Mathematics; Cryptography; Public-key cryptography; Computer security; Encryption","score_opus":0.017102533764732926,"score_gpt":0.2479451974313729,"score_spread":0.23084266366663997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163538620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01962619,0.0037557466,0.814036,0.0031338958,0.00055236206,0.00017889099,0.0011087956,0.0019156708,0.1556924],"genre_scores_gemma":[0.6125335,0.003947243,0.22222951,0.00083838566,0.0014838796,0.0006051884,0.002316786,0.0012185358,0.15482682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968284,0.0010230129,0.00016857409,0.00044266917,0.0012735439,0.00026375093],"domain_scores_gemma":[0.98764867,0.0078184875,0.00043308956,0.0031884285,0.0006521919,0.00025925902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029647846,0.0012080312,0.0012250311,0.00122279,0.0011231407,0.0036312994,0.0023982134,0.0011763619,0.021110209],"category_scores_gemma":[0.010680604,0.0011992638,0.0012156159,0.001974603,0.0031536687,0.0098805735,0.003228962,0.004429242,0.0050491784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014813186,0.000027787268,0.00008085226,0.00022509632,0.000028273726,0.000049562008,0.00016970109,0.0039889934,0.0015303558,0.94146687,0.009140242,0.043144066],"study_design_scores_gemma":[0.00002548117,0.000021967397,0.00006377876,0.000038097838,0.000016411715,0.00005702041,0.00001358441,0.009506099,0.0020806678,0.9740825,0.014078422,0.00001591065],"about_ca_topic_score_codex":0.00057148974,"about_ca_topic_score_gemma":0.0005438503,"teacher_disagreement_score":0.021110209,"about_ca_system_score_codex":0.0024062446,"about_ca_system_score_gemma":0.0014011072,"threshold_uncertainty_score":0.070620656},"labels":[],"label_agreement":null},{"id":"W2163884364","doi":"10.1109/glocom.2010.5684004","title":"Credible-BGP: A Hybrid Cryptosystem to Secure BGP","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Border Gateway Protocol; Node (physics); Reachability; Overhead (engineering); Protocol (science); Routing protocol; Cryptosystem; The Internet; Cryptography; Computer security; Distributed computing; Routing (electronic design automation); Encryption; Operating system; Link-state routing protocol; Theoretical computer science; Engineering","score_opus":0.005576625640992113,"score_gpt":0.22199471716521318,"score_spread":0.21641809152422106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163884364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020892447,0.00039915356,0.9668638,0.0004378803,0.00016374474,0.00029078792,0.00020254534,0.0031370507,0.007612732],"genre_scores_gemma":[0.5583189,0.0005716124,0.43201992,0.0002297617,0.00012810441,0.00034740043,0.000639429,0.00038996065,0.007354952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816966,0.0004877527,0.00010309121,0.00016920593,0.000896946,0.00017336995],"domain_scores_gemma":[0.9972466,0.00061240204,0.00023705921,0.0014025008,0.00038966796,0.000111810135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023038404,0.00056935626,0.00050277624,0.001077709,0.0008981635,0.0016210264,0.0020508333,0.0011701817,0.0038847295],"category_scores_gemma":[0.0034191406,0.00043195506,0.00046467016,0.0009821245,0.0019646569,0.003489511,0.0025933452,0.0026423174,0.0011174589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010455673,0.00040494386,0.0017587846,0.0005746035,0.00016444745,0.0006709516,0.00041828176,0.084959865,0.060225084,0.5953361,0.0127356835,0.24170575],"study_design_scores_gemma":[0.00043416166,0.00075230876,0.00065954094,0.00008355713,0.00009025965,0.0012267127,0.00010353385,0.68858737,0.084120184,0.15674621,0.06704638,0.00014983577],"about_ca_topic_score_codex":0.00087816705,"about_ca_topic_score_gemma":0.0008283889,"teacher_disagreement_score":0.0038847295,"about_ca_system_score_codex":0.0010509713,"about_ca_system_score_gemma":0.0014597046,"threshold_uncertainty_score":0.01299572},"labels":[],"label_agreement":null},{"id":"W2165718612","doi":"10.1109/itcc.2004.1286560","title":"An integrated approach for database security and fault tolerance","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Fault tolerance; Checksum; Data integrity; Encryption; Authentication (law); Database; Data Authentication Algorithm; Data security; Computer network; Authentication protocol; Distributed computing; Computer security; Operating system","score_opus":0.01528910400892316,"score_gpt":0.2578761832529557,"score_spread":0.24258707924403253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165718612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00645694,0.0011064071,0.9866479,0.000494145,0.000094217896,0.00011775418,0.000015283296,0.0008847538,0.004182563],"genre_scores_gemma":[0.15047257,0.0013513888,0.842004,0.00048972236,0.0001695196,0.00017175615,0.00010484905,0.00013681599,0.0050993394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966671,0.00046397676,0.00021985102,0.0003876216,0.0020268243,0.00023471862],"domain_scores_gemma":[0.9977422,0.00027403844,0.00015848063,0.000990138,0.00074103934,0.000094201256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015296908,0.00068012904,0.00078329095,0.0016707607,0.0007079796,0.0020663706,0.0026050417,0.00137672,0.0019366321],"category_scores_gemma":[0.0025974694,0.0005617654,0.00092917914,0.0009836864,0.0011457644,0.0043067145,0.0025282586,0.0023350448,0.0010580326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025784876,0.0003754793,0.0015490738,0.0006536013,0.000271043,0.0005171198,0.00057184923,0.024031686,0.11405762,0.24231507,0.0043056146,0.611094],"study_design_scores_gemma":[0.00020142415,0.0018954286,0.0026268733,0.00059612765,0.0007104801,0.0051631653,0.0004486715,0.3197678,0.20393264,0.22247854,0.24187759,0.00030131242],"about_ca_topic_score_codex":0.00047839212,"about_ca_topic_score_gemma":0.0006512046,"teacher_disagreement_score":0.0026050417,"about_ca_system_score_codex":0.00094003434,"about_ca_system_score_gemma":0.0017482643,"threshold_uncertainty_score":0.0080899},"labels":[],"label_agreement":null},{"id":"W2167308232","doi":"10.1287/msom.1070.0167","title":"An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems","year":2007,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Swap (finance); Incentive; Protocol (science); Context (archaeology); Cryptography; Information sharing; Computer security; Risk analysis (engineering); Business; Finance","score_opus":0.022021456083220783,"score_gpt":0.2913068087294969,"score_spread":0.2692853526462761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167308232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020633468,0.00009080542,0.9740199,0.0014016744,0.000026754165,0.00029182478,0.00010243779,0.00014804286,0.0032850946],"genre_scores_gemma":[0.53573143,0.00018687076,0.4610278,0.00026284257,0.0000793794,0.0005828412,0.00011049058,0.00004190799,0.001976463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9795368,0.012589548,0.000979536,0.0024786717,0.0036082698,0.00080715574],"domain_scores_gemma":[0.94793653,0.027468592,0.007754737,0.014083362,0.0018413584,0.0009153867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015194342,0.00096693065,0.0014461951,0.002197503,0.0036161046,0.0040783896,0.0030520584,0.005083926,0.004249374],"category_scores_gemma":[0.04583786,0.0010459697,0.0018255599,0.0028449327,0.0067261616,0.012304413,0.008403543,0.00550848,0.00080479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042568689,0.00023066917,0.0022599502,0.0001970547,0.00013292595,0.00018682457,0.00060428784,0.11395879,0.0060507213,0.8064537,0.0016025179,0.06789691],"study_design_scores_gemma":[0.00029045678,0.00031711752,0.00070277776,0.00006206811,0.00004519118,0.00034890295,0.00023658264,0.32008868,0.0076378467,0.6634331,0.006755641,0.00008164218],"about_ca_topic_score_codex":0.0006038662,"about_ca_topic_score_gemma":0.00047436653,"teacher_disagreement_score":0.015194342,"about_ca_system_score_codex":0.0028473036,"about_ca_system_score_gemma":0.005718362,"threshold_uncertainty_score":0.0803563},"labels":[],"label_agreement":null},{"id":"W2167705508","doi":"10.1109/ccece.2007.251","title":"A Scalable Secure Multicast System","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Computer network; Scalability; Source-specific multicast; Xcast; Protocol Independent Multicast; Pragmatic General Multicast; IP multicast; Secure multicast; Distributed computing; Operating system","score_opus":0.009220260947206406,"score_gpt":0.2322739378878148,"score_spread":0.2230536769406084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167705508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053067643,0.0012422161,0.8666834,0.0033437782,0.0005726436,0.0009523652,0.00066751434,0.017559756,0.055910688],"genre_scores_gemma":[0.7158553,0.0011640966,0.25847787,0.00075614604,0.00047897693,0.0007042204,0.0010811209,0.00033048604,0.021151796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998575,0.00023154452,0.00010417377,0.00014095665,0.0008212435,0.00012716604],"domain_scores_gemma":[0.9991042,0.00015732419,0.00009362023,0.0003149088,0.00022246246,0.00010745739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011684308,0.00048471996,0.00051639584,0.0007220887,0.001333742,0.0012254105,0.0009030793,0.0009695427,0.005116996],"category_scores_gemma":[0.0019788248,0.00026680913,0.00040061414,0.0007307098,0.0006736234,0.0026515624,0.0031508682,0.00093661743,0.002197368],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076667557,0.00033987314,0.0024915496,0.0004543882,0.00014001314,0.0030769482,0.00071517826,0.06117822,0.07928215,0.33543253,0.07647691,0.43964553],"study_design_scores_gemma":[0.00039929894,0.0004673153,0.0012044102,0.00010221443,0.00012416662,0.0019649218,0.00019288131,0.63624144,0.028693615,0.13367757,0.19682273,0.00010944214],"about_ca_topic_score_codex":0.000656329,"about_ca_topic_score_gemma":0.0005324404,"teacher_disagreement_score":0.005116996,"about_ca_system_score_codex":0.0007089255,"about_ca_system_score_gemma":0.0011831913,"threshold_uncertainty_score":0.017118096},"labels":[],"label_agreement":null},{"id":"W2168255191","doi":"10.1109/isit.2006.261794","title":"Integrated DH-like Key Exchange Protocols from LUC, GH and XTR","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Authenticated Key Exchange; Key exchange; Computer science; Digital signature; Key (lock); Protocol (science); Scheme (mathematics); Computer network; Diffie–Hellman key exchange; Oakley protocol; Cryptographic protocol; Public-key cryptography; Cryptography; Computer security; Mathematics; Encryption","score_opus":0.015440140917293977,"score_gpt":0.23902618219328617,"score_spread":0.2235860412759922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168255191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07248087,0.001319355,0.8898614,0.0005471832,0.00026254085,0.00093535444,0.0002829886,0.00211144,0.03219886],"genre_scores_gemma":[0.5533476,0.00080334535,0.42702475,0.00033370644,0.00012346162,0.0006099254,0.0007116898,0.00012831515,0.01691716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983596,0.00044642176,0.00011447688,0.00020775515,0.0006948034,0.00017691308],"domain_scores_gemma":[0.998723,0.0002723505,0.00012930213,0.0006545915,0.0001348872,0.00008589632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023791501,0.0004073894,0.00047998392,0.0004821548,0.0004227053,0.0013605569,0.0016429886,0.000917282,0.00322016],"category_scores_gemma":[0.0021841305,0.0004016223,0.0005586785,0.00058332627,0.0013593426,0.0042742817,0.0037304831,0.0020765145,0.0013194921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013542837,0.00040837386,0.0017126632,0.0010913044,0.00017605639,0.0010571133,0.0012493599,0.0105837,0.1924143,0.55379385,0.0043265116,0.23183241],"study_design_scores_gemma":[0.00073566445,0.0026454905,0.0026656825,0.00030045267,0.00040129694,0.0044262535,0.00067026465,0.14518078,0.43154153,0.15820393,0.25286058,0.00036812053],"about_ca_topic_score_codex":0.0002175689,"about_ca_topic_score_gemma":0.00025894237,"teacher_disagreement_score":0.00322016,"about_ca_system_score_codex":0.0005775503,"about_ca_system_score_gemma":0.00075119216,"threshold_uncertainty_score":0.012582302},"labels":[],"label_agreement":null},{"id":"W2168586728","doi":"10.1109/cscwd.2009.4968090","title":"Zero-knowledge trust negotiation","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Credential; Computer science; Access control; Computer security; Database transaction; Authentication (law); Service provider; Zero-knowledge proof; Service (business); Credit card; Public key certificate; Negotiation; Flexibility (engineering); Protocol (science); The Internet; Information leakage; Computer network; Cryptography; World Wide Web; Public-key cryptography; Business","score_opus":0.011884479272523379,"score_gpt":0.24921150345217763,"score_spread":0.23732702417965426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168586728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016250314,0.00043182744,0.9240688,0.0024921873,0.00024003287,0.00030703304,0.00005758415,0.00031900636,0.055833217],"genre_scores_gemma":[0.85511464,0.0005313779,0.122095644,0.0004867979,0.00020027702,0.0004022898,0.0001043523,0.000068047186,0.020996606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9861269,0.005345947,0.0008805326,0.0017362966,0.0045602624,0.0013501326],"domain_scores_gemma":[0.98619336,0.0066789524,0.0010832705,0.0034641724,0.001788747,0.00079151796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008742979,0.0006895442,0.0011188798,0.0011285471,0.0027662143,0.007189801,0.0033556246,0.0038340276,0.0056353905],"category_scores_gemma":[0.023499997,0.00068137754,0.0010551733,0.00094838,0.005490576,0.011165753,0.0073667285,0.0038100665,0.0015892523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009242603,0.00005652439,0.0002361593,0.000075004515,0.00003558624,0.00041464804,0.0008797307,0.0072314907,0.0010867473,0.9619968,0.0017000544,0.026194783],"study_design_scores_gemma":[0.00006652113,0.0000678651,0.000114356306,0.00007435277,0.00003054646,0.00038612116,0.000294196,0.111731686,0.003412322,0.85804594,0.025713256,0.00006283347],"about_ca_topic_score_codex":0.0011212977,"about_ca_topic_score_gemma":0.00063297513,"teacher_disagreement_score":0.008742979,"about_ca_system_score_codex":0.0027477422,"about_ca_system_score_gemma":0.0036603664,"threshold_uncertainty_score":0.046237826},"labels":[],"label_agreement":null},{"id":"W2171959510","doi":"10.1145/2213977.2214051","title":"Characterizing pseudoentropy and simplifying pseudorandom generator constructions","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; Microsoft Research; National Science Foundation","keywords":"Pseudorandom number generator; Random variable; Entropy (arrow of time); Discrete mathematics; Mathematics; Probabilistic logic; Polynomial; Combinatorics; Algorithm; Statistics; Physics; Mathematical analysis","score_opus":0.015093601973281665,"score_gpt":0.23711426385277842,"score_spread":0.22202066187949676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171959510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28889868,0.00038497226,0.69679135,0.0020375364,0.000054777738,0.0001905996,0.0003668643,0.0005260933,0.010749045],"genre_scores_gemma":[0.9670949,0.00018011451,0.030092474,0.00024519107,0.000101693004,0.00018612639,0.00028897924,0.00012316807,0.0016872811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98802817,0.0047651455,0.0005259564,0.0014385171,0.0039850785,0.0012571841],"domain_scores_gemma":[0.90187573,0.072253816,0.0048392527,0.016960729,0.0022088748,0.0018616484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009063127,0.0009814117,0.0016403454,0.0017556888,0.0013472294,0.0038094816,0.0032303636,0.0023230587,0.0029906458],"category_scores_gemma":[0.07313815,0.0009071243,0.0013828026,0.0013618065,0.0065300865,0.010091411,0.009132206,0.0042928057,0.00052610185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060831447,0.00017540084,0.005724338,0.00017458995,0.00010965957,0.00046960832,0.0005092089,0.1734349,0.007718653,0.7935889,0.0014070856,0.016079398],"study_design_scores_gemma":[0.00007651489,0.0001614589,0.0011606705,0.000032762095,0.000036956382,0.00044013563,0.00006968083,0.41341582,0.006009473,0.57735777,0.0011878972,0.000050794923],"about_ca_topic_score_codex":0.00032394752,"about_ca_topic_score_gemma":0.00032067593,"teacher_disagreement_score":0.009063127,"about_ca_system_score_codex":0.0026071277,"about_ca_system_score_gemma":0.0014409629,"threshold_uncertainty_score":0.047930956},"labels":[],"label_agreement":null},{"id":"W2172220761","doi":"10.1109/issa.2011.6027517","title":"Efficient enforcement of dynamic cryptographic access control policies for outsourced data","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Encryption; Computer science; Outsourcing; Computer security; Access control; Service provider; Cryptography; Data security; Key management; Key (lock); Information privacy; Client-side encryption; Service (business); Business; On-the-fly encryption","score_opus":0.07722899591918905,"score_gpt":0.31598362179557116,"score_spread":0.2387546258763821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172220761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07261918,0.00046690062,0.9196179,0.00079633464,0.00008859967,0.0005046238,0.00011056671,0.002231717,0.003564266],"genre_scores_gemma":[0.80669,0.00039247362,0.19004549,0.00020043275,0.00006804874,0.00019659672,0.00016202666,0.0001547081,0.0020901735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858562,0.0042341533,0.0015318673,0.0010587721,0.0058246385,0.0014942762],"domain_scores_gemma":[0.96866703,0.008191363,0.0037280885,0.016188018,0.00277912,0.00044636126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011567774,0.000704413,0.001099087,0.0011763206,0.0014723444,0.0038325272,0.0026667109,0.0012001576,0.0016867266],"category_scores_gemma":[0.023910291,0.0008343605,0.00096391916,0.0011399742,0.0028159863,0.006711742,0.0047909957,0.0029622288,0.0006426463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019452986,0.0008733718,0.0054558543,0.00064264773,0.0002795692,0.0011654133,0.0019864393,0.0902615,0.09836473,0.45606947,0.0068299784,0.3361258],"study_design_scores_gemma":[0.0005616882,0.0003614445,0.001095976,0.00013658333,0.00012325656,0.00090017257,0.0004783526,0.6901591,0.16443346,0.1185951,0.022996837,0.00015811039],"about_ca_topic_score_codex":0.0012591839,"about_ca_topic_score_gemma":0.0010690866,"teacher_disagreement_score":0.011567774,"about_ca_system_score_codex":0.002188367,"about_ca_system_score_gemma":0.003833323,"threshold_uncertainty_score":0.061176956},"labels":[],"label_agreement":null},{"id":"W2174589003","doi":"10.1145/2567671","title":"The Hardness of Being Private","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Common value auction; Context (archaeology); Communication complexity; Intersection (aeronautics); Conjecture; Computer science; Function (biology); Differential privacy; Mathematics; Exponential function; Upper and lower bounds; Discrete mathematics; Theoretical computer science; Algorithm; Statistics","score_opus":0.010059507226578602,"score_gpt":0.24274215220299716,"score_spread":0.23268264497641855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174589003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2624708,0.0038737347,0.538134,0.04048564,0.00032774982,0.0002522018,0.003325521,0.00058206817,0.15054834],"genre_scores_gemma":[0.9622909,0.0011990272,0.023589553,0.0014924561,0.00032553903,0.00026244705,0.0009453902,0.00022061636,0.009674086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9840821,0.0049640476,0.0010473289,0.00414807,0.003937527,0.0018208929],"domain_scores_gemma":[0.9385724,0.040160943,0.002687565,0.014617746,0.0024832103,0.0014782645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006733706,0.0006591646,0.0020409215,0.0010200357,0.004178417,0.00791669,0.0030319458,0.004657521,0.009096149],"category_scores_gemma":[0.038747106,0.0011451407,0.0023720057,0.0019563427,0.011533905,0.023879286,0.0072393646,0.00919504,0.001584123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021686708,0.00005886904,0.0009860971,0.00014413462,0.000055466717,0.00013300635,0.00088134414,0.005898329,0.00098983,0.97333217,0.0032699052,0.0140340105],"study_design_scores_gemma":[0.00003164675,0.00002109045,0.0003249326,0.000022101336,0.000017053524,0.00018540976,0.00013999974,0.008735429,0.0006382281,0.9861626,0.00370015,0.00002130961],"about_ca_topic_score_codex":0.0016070687,"about_ca_topic_score_gemma":0.00062899647,"teacher_disagreement_score":0.009096149,"about_ca_system_score_codex":0.0032114629,"about_ca_system_score_gemma":0.0019725638,"threshold_uncertainty_score":0.03561163},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.017789636802649125,"score_gpt":0.250754521302626,"score_spread":0.23296488449997688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177209050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053352904,0.000294727,0.93402934,0.0004916609,0.0000826589,0.00015691231,0.00032489424,0.0015223916,0.009744519],"genre_scores_gemma":[0.6579852,0.00016736651,0.33476117,0.0005243026,0.00006881329,0.00016298401,0.00034057372,0.00009837516,0.005891276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985733,0.00026688233,0.00011277266,0.00028016252,0.0005412912,0.00022558348],"domain_scores_gemma":[0.997701,0.0003676707,0.0001429893,0.0015193003,0.00020329758,0.000065858396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087201025,0.0003283707,0.0005134245,0.00031802742,0.0003647891,0.0015059607,0.0011756502,0.0009926765,0.004683305],"category_scores_gemma":[0.0027735033,0.00031246623,0.0007345431,0.00037496895,0.001275297,0.0048428993,0.0033956636,0.0018722311,0.0013374622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000509425,0.0002575377,0.0017785057,0.0004191237,0.00011206688,0.0005396477,0.00045180228,0.04454598,0.12305775,0.6142939,0.007470474,0.20656379],"study_design_scores_gemma":[0.00014706199,0.00059781957,0.0012367828,0.00009263132,0.00007376056,0.0012745672,0.00011756872,0.42955202,0.16443242,0.36848652,0.03385859,0.00013028485],"about_ca_topic_score_codex":0.0001673386,"about_ca_topic_score_gemma":0.00022859799,"teacher_disagreement_score":0.004683305,"about_ca_system_score_codex":0.0006407868,"about_ca_system_score_gemma":0.0005790838,"threshold_uncertainty_score":0.01566726},"labels":[],"label_agreement":null},{"id":"W2178800862","doi":"10.2197/ipsjjip.23.570","title":"New Secret Sharing Schemes Realizing General Access Structures","year":2015,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Computer science; Secret sharing; Access structure; Secure multi-party computation; Homomorphic secret sharing; Verifiable secret sharing; Computer security; Computer network; Theoretical computer science; Distributed computing; Cryptography","score_opus":0.04172216416135151,"score_gpt":0.3144399746624166,"score_spread":0.2727178105010651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178800862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1450703,0.0012978399,0.8396673,0.0004478671,0.00019417841,0.00023054906,0.0002270691,0.0005036317,0.012361186],"genre_scores_gemma":[0.8431501,0.00068810344,0.15052591,0.00019025191,0.000099335586,0.00018815092,0.00022953225,0.000032878903,0.004895789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870753,0.00025936557,0.000117750234,0.00020090501,0.00045955915,0.0002549],"domain_scores_gemma":[0.99853337,0.00029477332,0.00023855947,0.00059119536,0.00022320493,0.00011891758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009659624,0.00043803724,0.0007784082,0.0007065985,0.0008291332,0.001348422,0.0012448432,0.00091107853,0.0018312198],"category_scores_gemma":[0.0016560387,0.00032131246,0.0007425149,0.001117188,0.0012673887,0.0051591974,0.002553016,0.001297088,0.00038997844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055963924,0.00015343464,0.00081668864,0.00036540584,0.00012606922,0.00035563984,0.00067455706,0.032558333,0.08594188,0.76604563,0.0025556118,0.10984722],"study_design_scores_gemma":[0.00043183033,0.00067716,0.0009292362,0.000109457156,0.00019626562,0.0015780511,0.00027109,0.3061373,0.088949844,0.55140555,0.049085297,0.0002290024],"about_ca_topic_score_codex":0.00024313803,"about_ca_topic_score_gemma":0.00022143286,"teacher_disagreement_score":0.0018312198,"about_ca_system_score_codex":0.00074090797,"about_ca_system_score_gemma":0.0009134906,"threshold_uncertainty_score":0.006126106},"labels":[],"label_agreement":null},{"id":"W2180500182","doi":"10.1007/978-3-319-12475-9_14","title":"RCCA-Secure Multi-use Bidirectional Proxy Re-encryption with Master Secret Security","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Proxy re-encryption; Random oracle; Ciphertext; Plaintext; Computer science; Proxy (statistics); Encryption; Computer security; Alice and Bob; Alice (programming language); Theoretical computer science; Public-key cryptography","score_opus":0.022225372027223144,"score_gpt":0.23565529303105534,"score_spread":0.2134299210038322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180500182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056479443,0.0031892203,0.86291873,0.00084970193,0.0008465862,0.00058348104,0.00081983116,0.009848311,0.06446462],"genre_scores_gemma":[0.821805,0.0008212271,0.13315526,0.00030569272,0.00019064815,0.00029107017,0.0008360322,0.00061421364,0.04198085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974458,0.0003865035,0.00019561993,0.00033274927,0.0010147588,0.0006246193],"domain_scores_gemma":[0.9980003,0.00020984649,0.00013099561,0.0012564209,0.00032474886,0.00007759561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512553,0.00075348635,0.0014206134,0.0008915501,0.0013174729,0.0028589321,0.0016788976,0.001104556,0.007754598],"category_scores_gemma":[0.0017840303,0.0005311407,0.0011832747,0.0012891311,0.0010888599,0.004251118,0.0038487785,0.0023863257,0.0055824844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013906441,0.0003467524,0.0007732914,0.0007374907,0.0002095203,0.000984638,0.0004897299,0.02639345,0.09653693,0.59148985,0.029530058,0.2511176],"study_design_scores_gemma":[0.00027001815,0.0004908852,0.00097041717,0.0002291704,0.00028700416,0.0038450146,0.000337109,0.4110438,0.2315471,0.2265611,0.12409488,0.0003234955],"about_ca_topic_score_codex":0.00052288926,"about_ca_topic_score_gemma":0.00063787604,"teacher_disagreement_score":0.007754598,"about_ca_system_score_codex":0.001122792,"about_ca_system_score_gemma":0.0019526427,"threshold_uncertainty_score":0.02594173},"labels":[],"label_agreement":null},{"id":"W2185939662","doi":"","title":"Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Asynchronous communication; Scheme (mathematics); Encryption; The Internet; Public-key cryptography; Key (lock); Computer security; Bilinear interpolation; Cryptography; Protocol (science); Computer network; Theoretical computer science; Distributed computing; Mathematics; World Wide Web","score_opus":0.015748029264598357,"score_gpt":0.2727249808000736,"score_spread":0.2569769515354753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185939662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019375506,0.0015698868,0.9794041,0.0011060939,0.00036628117,0.00021842943,0.00007268989,0.000435202,0.014889743],"genre_scores_gemma":[0.1822784,0.00401658,0.7927732,0.0008602655,0.001266562,0.0011638993,0.0004905347,0.0002599006,0.016890688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962198,0.0017327775,0.00022482722,0.0004522244,0.0011802156,0.00019019487],"domain_scores_gemma":[0.99694544,0.0012454361,0.00019350577,0.0011367489,0.00035439385,0.00012451137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035517614,0.0010797832,0.0009486841,0.00093721197,0.001505461,0.0026866014,0.001879757,0.0019592992,0.007724358],"category_scores_gemma":[0.0062079695,0.00062325347,0.0009445943,0.0018269331,0.0027237777,0.00682086,0.0029077083,0.005977536,0.003595213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048775015,0.000040888994,0.00008170257,0.00011058964,0.0000068325908,0.00007112754,0.00009047721,0.0028201018,0.0017184138,0.9641011,0.004556375,0.02635349],"study_design_scores_gemma":[0.00007772778,0.00008988763,0.00008489039,0.00010242294,0.000018408573,0.00023899708,0.00003554672,0.058190685,0.0036932721,0.84706426,0.09036479,0.000039138213],"about_ca_topic_score_codex":0.00027256127,"about_ca_topic_score_gemma":0.0002922149,"teacher_disagreement_score":0.007724358,"about_ca_system_score_codex":0.0020119988,"about_ca_system_score_gemma":0.0016875,"threshold_uncertainty_score":0.02584052},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2186319226","doi":"10.82308/31739","title":"Privacy-preserving personal information management","year":2010,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Vlaamse regering","keywords":"Computer science; Personally identifiable information; Internet privacy; Protocol (science); Private information retrieval; Computer security; Information privacy; World Wide Web","score_opus":0.010624486070314978,"score_gpt":0.2157600004576985,"score_spread":0.20513551438738353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186319226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024865132,0.006220062,0.9072827,0.00434552,0.00058635324,0.00057195924,0.0015286903,0.004123813,0.05047584],"genre_scores_gemma":[0.6831716,0.008697865,0.23048404,0.0021919366,0.0010113769,0.00064609764,0.0038439482,0.00034459497,0.069608465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926351,0.0019699875,0.0006174468,0.0010806579,0.0029731987,0.0007236243],"domain_scores_gemma":[0.9911376,0.0014611353,0.0006029331,0.0056515927,0.00091300503,0.00023375591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039793053,0.0007255476,0.0009482251,0.0017824967,0.0024666344,0.005160852,0.0023200908,0.0016942703,0.006240703],"category_scores_gemma":[0.008855261,0.0006063282,0.000984556,0.003668678,0.0016453625,0.007959329,0.005828334,0.0020978944,0.0034703393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005675356,0.00032933961,0.0038825092,0.0006020704,0.00017241466,0.0007304998,0.0021926234,0.017408773,0.01713947,0.26533085,0.05104772,0.64059615],"study_design_scores_gemma":[0.00010436948,0.00033314285,0.0024992793,0.0003124315,0.00019526402,0.0020783814,0.0016283963,0.21308428,0.0454139,0.3350968,0.39911684,0.00013688725],"about_ca_topic_score_codex":0.001638275,"about_ca_topic_score_gemma":0.0016051533,"teacher_disagreement_score":0.006240703,"about_ca_system_score_codex":0.001255686,"about_ca_system_score_gemma":0.0024445946,"threshold_uncertainty_score":0.02104485},"labels":[],"label_agreement":null},{"id":"W2186566763","doi":"10.22667/jowua.2013.06.31.039","title":"Preserving Multi-relational Outsourced Databases Confidentiality using Fragmentation and Encryption","year":2013,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Confidentiality; Encryption; Cloud computing; Computer science; Service provider; Computer security; Information sensitivity; Database; Access control; Internet privacy; Service (business); Business","score_opus":0.04189382961879806,"score_gpt":0.2833575692614476,"score_spread":0.24146373964264956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186566763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2040303,0.003472186,0.7817179,0.0014782405,0.00015379897,0.00016551143,0.00049498206,0.0011777331,0.007309368],"genre_scores_gemma":[0.9283908,0.00088388956,0.06620171,0.00022288483,0.00012796905,0.00005602557,0.00028540863,0.00012341757,0.0037078382],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955539,0.0007746703,0.00043388928,0.00054404064,0.0019878212,0.00070565206],"domain_scores_gemma":[0.9824929,0.0030745855,0.0013434123,0.011445095,0.0013638109,0.00028029107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002904888,0.0005930665,0.0015603914,0.0009977007,0.0011928424,0.0032178361,0.0018584074,0.0010926479,0.0027366234],"category_scores_gemma":[0.007866778,0.00071814616,0.0009996855,0.002323778,0.0016802641,0.008701014,0.0059683174,0.002231976,0.00076128775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023387985,0.0003701191,0.0076178387,0.0011192244,0.000589708,0.002174954,0.0021297114,0.08799039,0.12325787,0.35934407,0.011355592,0.4017117],"study_design_scores_gemma":[0.00024498312,0.0004330205,0.0026337462,0.0002452959,0.0003576094,0.00604663,0.0009426049,0.36729982,0.20053,0.40025827,0.020854259,0.00015385562],"about_ca_topic_score_codex":0.0005946046,"about_ca_topic_score_gemma":0.0005023357,"teacher_disagreement_score":0.0032178361,"about_ca_system_score_codex":0.0016327492,"about_ca_system_score_gemma":0.0015061364,"threshold_uncertainty_score":0.01536274},"labels":[],"label_agreement":null},{"id":"W2189043898","doi":"10.1109/cns.2015.7346877","title":"Integer arithmetic over ciphertext and homomorphic data aggregation","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homomorphic encryption; Computer science; Ciphertext; Server; Cloud computing; Integer (computer science); Encryption; Computation; Theoretical computer science; Computer security; Computer network; Algorithm; Operating system","score_opus":0.0795789560363762,"score_gpt":0.28437977061936837,"score_spread":0.20480081458299215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189043898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14922668,0.0011518052,0.81102914,0.0008555777,0.00027485072,0.00030559205,0.00029791266,0.0028637375,0.033994712],"genre_scores_gemma":[0.84771526,0.0004524714,0.14531438,0.00026944725,0.00013429778,0.00010163059,0.00021986463,0.000145032,0.005647582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974929,0.00050266867,0.00022650395,0.00028784847,0.001046463,0.00044367625],"domain_scores_gemma":[0.9974739,0.00066929514,0.00029058097,0.0012338982,0.00025176,0.000080574915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016159128,0.00052884925,0.0005404939,0.0007996259,0.00068136427,0.0022826283,0.00078324205,0.0005539928,0.0028218962],"category_scores_gemma":[0.0032278448,0.00025752548,0.00043986787,0.0011550615,0.002010237,0.005077399,0.0019831255,0.0010711122,0.0008167439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011628126,0.0003240754,0.001844261,0.0004091939,0.000067558634,0.00075419515,0.0005737798,0.032269962,0.06569732,0.7262259,0.0064353202,0.16423562],"study_design_scores_gemma":[0.00019630745,0.0006608979,0.001571381,0.00016431723,0.000115009105,0.0017269053,0.00029336018,0.27227077,0.32543182,0.3475491,0.049874052,0.0001461486],"about_ca_topic_score_codex":0.0004417641,"about_ca_topic_score_gemma":0.0004146437,"teacher_disagreement_score":0.0028218962,"about_ca_system_score_codex":0.0008341852,"about_ca_system_score_gemma":0.0011573447,"threshold_uncertainty_score":0.009440184},"labels":[],"label_agreement":null},{"id":"W2189936489","doi":"10.1007/978-3-642-38553-7_15","title":"Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Homomorphic encryption; Mathematical proof; Multiplication (music); Protocol (science); Theoretical computer science; Arithmetic; Covert; Commitment scheme; Encryption; Cryptography; Algorithm; Computer security; Mathematics; Combinatorics","score_opus":0.018080736637273196,"score_gpt":0.24687782885867943,"score_spread":0.22879709222140623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189936489","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11897031,0.0015806492,0.75234336,0.004462316,0.00076175004,0.00036658152,0.0005666744,0.001637774,0.11931066],"genre_scores_gemma":[0.88581353,0.0005776901,0.0863135,0.00047819645,0.0003839292,0.00030475968,0.00037272126,0.00028476736,0.025470853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969062,0.00066623074,0.0001280138,0.000497456,0.0012581256,0.0005439739],"domain_scores_gemma":[0.99711347,0.0014552685,0.00013590633,0.0010424947,0.00016161485,0.000091228576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015961583,0.00095164124,0.0014987777,0.00081200484,0.0017064072,0.0040159556,0.0018180566,0.002220858,0.009122844],"category_scores_gemma":[0.0053626704,0.0006020037,0.0014274475,0.0011585883,0.001800758,0.0057491427,0.005055523,0.004038676,0.002431364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004783943,0.00014413058,0.00028234147,0.00020995087,0.00009943772,0.00019133116,0.0001987032,0.029701458,0.01412824,0.8701448,0.009678528,0.07474266],"study_design_scores_gemma":[0.000068515,0.00008063007,0.00018626972,0.000051027877,0.00004995146,0.00017261488,0.000029936213,0.1638694,0.011218723,0.81795853,0.0062868795,0.00002756504],"about_ca_topic_score_codex":0.00017307945,"about_ca_topic_score_gemma":0.0003405837,"teacher_disagreement_score":0.009122844,"about_ca_system_score_codex":0.0017378242,"about_ca_system_score_gemma":0.0011046034,"threshold_uncertainty_score":0.030518949},"labels":[],"label_agreement":null},{"id":"W2193906675","doi":"10.1109/allerton.2015.7447122","title":"Lossless secure source coding: Yamamoto's setting","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Converse; Lossless compression; Coding (social sciences); Source model; Source code; Encoding (memory); Information source (mathematics); Computer science; Multi-source; Data source; Combinatorics; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Information retrieval; Artificial intelligence; Statistics; Data compression","score_opus":0.025592909573243665,"score_gpt":0.26563513830821656,"score_spread":0.24004222873497288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193906675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045325067,0.001159895,0.92105645,0.0035097739,0.00018235784,0.0000931613,0.00041141832,0.00014809026,0.02811382],"genre_scores_gemma":[0.84556735,0.0023631135,0.1319682,0.00084733905,0.00027671378,0.0003448886,0.00031892204,0.000083725325,0.018229831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753606,0.0010326091,0.000108725406,0.00050150097,0.00060180057,0.0002192737],"domain_scores_gemma":[0.9940554,0.0039758985,0.0005454685,0.0008669183,0.00033613289,0.00022007393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032208213,0.0012305188,0.0016455451,0.0008661853,0.0009442839,0.0026374727,0.0018483433,0.002157653,0.0026563623],"category_scores_gemma":[0.010495746,0.0006820019,0.0010166982,0.0015766203,0.004332518,0.0047734347,0.005325927,0.0047351103,0.00070322916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020231203,0.000037287627,0.00036620809,0.00010087419,0.000044106175,0.00031859917,0.00016427772,0.057046182,0.0016815709,0.93220466,0.0017686683,0.0060650855],"study_design_scores_gemma":[0.00013899888,0.000060850023,0.00013033736,0.000053889158,0.000035364807,0.0002820397,0.00007347884,0.3111004,0.0019783129,0.68275464,0.0033424406,0.000049240785],"about_ca_topic_score_codex":0.0010033008,"about_ca_topic_score_gemma":0.00058403926,"teacher_disagreement_score":0.0032208213,"about_ca_system_score_codex":0.0025000267,"about_ca_system_score_gemma":0.0015457114,"threshold_uncertainty_score":0.018139064},"labels":[],"label_agreement":null},{"id":"W2195657359","doi":"10.1109/ccc.2009.22","title":"Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gas meter prover; Soundness; Mathematical proof; Completeness (order theory); PSPACE; Quantum entanglement; Mathematics; Discrete mathematics; Theoretical computer science; Computer science; Algorithm; Computational complexity theory; Quantum; Programming language","score_opus":0.010434186052427638,"score_gpt":0.25803353929848377,"score_spread":0.24759935324605614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195657359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0734026,0.0011057692,0.88258845,0.0034155315,0.00013193992,0.00025688618,0.00020171804,0.0015545617,0.03734252],"genre_scores_gemma":[0.8889442,0.00073827914,0.09823803,0.00090909447,0.00022289134,0.0003800143,0.00020797842,0.0002919264,0.010067688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890485,0.0038482188,0.0003767547,0.0023011738,0.0027917349,0.0016336824],"domain_scores_gemma":[0.9657865,0.022054072,0.0024056125,0.0066290163,0.0021859696,0.0009387367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006410633,0.0012652146,0.0012694915,0.0010288919,0.0020762398,0.0035579654,0.00391187,0.0017353287,0.006885072],"category_scores_gemma":[0.020224461,0.0008863355,0.0018123604,0.00085055036,0.008260086,0.011543891,0.008453945,0.00714238,0.0012763044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026071264,0.00006464165,0.00028123433,0.0002953377,0.00006997039,0.00014433128,0.0008105882,0.018833216,0.003993012,0.958377,0.001235145,0.015634743],"study_design_scores_gemma":[0.00014437566,0.00013587228,0.00021963869,0.000069928916,0.00008413635,0.0001970459,0.000119747456,0.11499079,0.013727951,0.8623377,0.007892599,0.00008017368],"about_ca_topic_score_codex":0.0010459686,"about_ca_topic_score_gemma":0.00065412064,"teacher_disagreement_score":0.006885072,"about_ca_system_score_codex":0.0026655444,"about_ca_system_score_gemma":0.0023581358,"threshold_uncertainty_score":0.033903062},"labels":[],"label_agreement":null},{"id":"W2196084527","doi":"10.48550/arxiv.1512.03498","title":"A Secure Database System using Homomorphic Encryption Schemes","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; SQL; Confidentiality; Scheme (mathematics); Database; Cloud computing; Data integrity; Computer security; Operating system; Mathematics","score_opus":0.1263323318960173,"score_gpt":0.20417629301489967,"score_spread":0.07784396111888237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196084527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06471541,0.001445014,0.9193956,0.00076911936,0.00023206763,0.0005126993,0.00040310677,0.0064454256,0.0060815406],"genre_scores_gemma":[0.57766044,0.001863689,0.40978354,0.000434436,0.0002824792,0.00031859888,0.00085117266,0.0002012761,0.008604344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996618,0.00056870846,0.0004958566,0.0005550567,0.0015045265,0.0002578242],"domain_scores_gemma":[0.99737024,0.00035480954,0.00021677958,0.0015251468,0.00036412172,0.00016890846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344166,0.00045960725,0.0009379761,0.0008675386,0.0013649402,0.0036884593,0.0016998539,0.0013991711,0.0026395982],"category_scores_gemma":[0.002960749,0.0005898811,0.00069122,0.0012549261,0.0011906781,0.0060007283,0.0032665036,0.001603712,0.0020695718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014481517,0.0009444616,0.0044375183,0.00073039957,0.000339013,0.0023882557,0.0015047571,0.028136255,0.19248661,0.42132634,0.017124595,0.32913372],"study_design_scores_gemma":[0.00090004556,0.0016726427,0.003282982,0.00017741135,0.00042555112,0.00775549,0.0003748048,0.41145718,0.24483293,0.14455952,0.18421452,0.0003470046],"about_ca_topic_score_codex":0.0006273294,"about_ca_topic_score_gemma":0.00039265762,"teacher_disagreement_score":0.0036884593,"about_ca_system_score_codex":0.00084275316,"about_ca_system_score_gemma":0.0017605718,"threshold_uncertainty_score":0.01239723},"labels":[],"label_agreement":null},{"id":"W2199652847","doi":"10.1007/978-3-319-30976-7_9","title":"Ring-LWE Cryptography for the Number Theorist","year":2016,"lang":"en","type":"preprint","venue":"Association for Women in Mathematics series","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cryptography; Algebraic number; Learning with errors; Ring (chemistry); Modulo; Algebraic number field; Mathematics; Polynomial ring; Order (exchange); Discrete mathematics; Computer science; Polynomial; Algorithm; Mathematical analysis","score_opus":0.013172388540135267,"score_gpt":0.2651561325102328,"score_spread":0.25198374397009754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199652847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02499956,0.026067425,0.5614845,0.19487648,0.008918213,0.000085852276,0.000662219,0.001392519,0.18151319],"genre_scores_gemma":[0.62404186,0.01851383,0.2152585,0.015083791,0.023787446,0.00034404948,0.0006009314,0.000812162,0.101557486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978661,0.0009195941,0.00011111835,0.00044613215,0.00044786267,0.00020921085],"domain_scores_gemma":[0.9926605,0.00459244,0.00025475386,0.0015109675,0.00059189636,0.00038931775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005302003,0.0010347049,0.0012940839,0.0017472252,0.0026720809,0.0053351093,0.0012342515,0.002881285,0.011762137],"category_scores_gemma":[0.014490376,0.00048414618,0.00096958934,0.0017810939,0.0068682516,0.02048435,0.0049842815,0.010413974,0.0045008427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002450813,0.000012447153,0.00010046829,0.000035881712,0.0000047818057,0.00001819408,0.00007022076,0.00031802428,0.00018123433,0.9803657,0.008848903,0.010019478],"study_design_scores_gemma":[0.000008226488,0.0000072283747,0.000027320633,0.00001882254,0.0000024240812,0.000025359335,0.000016007605,0.0014040221,0.00021008747,0.98154485,0.016727766,0.000007875752],"about_ca_topic_score_codex":0.0003546209,"about_ca_topic_score_gemma":0.00023087581,"teacher_disagreement_score":0.011762137,"about_ca_system_score_codex":0.0030392103,"about_ca_system_score_gemma":0.0013437535,"threshold_uncertainty_score":0.039348304},"labels":[],"label_agreement":null},{"id":"W2200894508","doi":"10.1007/978-3-642-30904-5_10","title":"Efficient 1-Round Almost-Perfect Secure Message Transmission Protocols with Flexible Connectivity","year":2012,"lang":"en","type":"book-chapter","venue":"Mathematics in industry","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Communication source; Computer science; Disjoint sets; Transmission (telecommunications); Computer network; Key (lock); Bounded function; Node (physics); Adversary; Topology (electrical circuits); Discrete mathematics; Distributed computing; Mathematics; Combinatorics; Computer security; Telecommunications; Engineering","score_opus":0.03756530072822793,"score_gpt":0.28056009799011977,"score_spread":0.24299479726189183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200894508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048089918,0.0009921311,0.93174684,0.0004943936,0.00013624958,0.00017276779,0.0002574768,0.001318112,0.016792094],"genre_scores_gemma":[0.7764752,0.0009003022,0.20898734,0.00024757037,0.00014373353,0.00034062617,0.00038044885,0.00022504872,0.012299664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977876,0.00053643546,0.0001763597,0.000281826,0.00084770843,0.00036994953],"domain_scores_gemma":[0.9964982,0.0017012268,0.0003362488,0.0011767449,0.00020397635,0.00008354815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015385052,0.000994819,0.001352407,0.00088596443,0.0009163573,0.0017792518,0.0025347257,0.0014891231,0.0040455866],"category_scores_gemma":[0.004302116,0.00076897047,0.0007398007,0.0011694663,0.0013733631,0.0045318077,0.0037393477,0.0017771713,0.0010612028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067229476,0.00009746293,0.00028107106,0.00043103375,0.00008202898,0.00023479955,0.00034149387,0.19937617,0.023580201,0.61270064,0.0066301757,0.15557265],"study_design_scores_gemma":[0.00010203063,0.00023743926,0.00024539354,0.000068968344,0.00007381272,0.00043283773,0.000050367886,0.54764634,0.015271514,0.42737243,0.008432552,0.00006628397],"about_ca_topic_score_codex":0.00024250876,"about_ca_topic_score_gemma":0.0005363076,"teacher_disagreement_score":0.0040455866,"about_ca_system_score_codex":0.000967279,"about_ca_system_score_gemma":0.0010783894,"threshold_uncertainty_score":0.013533771},"labels":[],"label_agreement":null},{"id":"W2201916012","doi":"10.4086/toc.2018.v014a011","title":"","year":2018,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; University of Ottawa","keywords":"Computer science; Quantum computer; Gas meter prover; Soundness; Theoretical computer science; Encryption; Quantum entanglement; Computation; Qubit; Quantum algorithm; Algorithm; Quantum; Discrete mathematics; Mathematics; Quantum mechanics","score_opus":0.015333802026982236,"score_gpt":0.2533487615405014,"score_spread":0.23801495951351917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201916012","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042814054,0.00028492566,0.95926625,0.005179086,0.00075965904,0.00014320803,0.00020856007,0.00078554894,0.02909125],"genre_scores_gemma":[0.3199825,0.0010360907,0.6454457,0.0046811407,0.0014999934,0.0008837416,0.00092329236,0.0010568113,0.024490703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947278,0.0012597629,0.0002374448,0.00084992364,0.0022551008,0.00067010446],"domain_scores_gemma":[0.9888425,0.004299856,0.00046406698,0.004642432,0.0011998609,0.0005512885],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0043075504,0.0009278578,0.0012806839,0.0015880519,0.002601872,0.004304243,0.0045322464,0.003368858,0.022301203],"category_scores_gemma":[0.018653529,0.00074718444,0.002896397,0.0011913888,0.0064749187,0.009860814,0.009978514,0.007387085,0.007859625],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030594318,0.000041692165,0.0001041914,0.00010733488,0.000017867698,0.000077835895,0.00009254885,0.0024206187,0.0019905132,0.9825522,0.004126952,0.008437544],"study_design_scores_gemma":[0.000025714233,0.00006363812,0.00005952937,0.000048419242,0.00003019372,0.00017151416,0.000039050552,0.027692081,0.0051388396,0.93359035,0.033109643,0.00003103374],"about_ca_topic_score_codex":0.00052231416,"about_ca_topic_score_gemma":0.00056718104,"teacher_disagreement_score":0.9776988,"about_ca_system_score_codex":0.0015830118,"about_ca_system_score_gemma":0.002761172,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2224071963","doi":"10.4230/lipics.tqc.2015.147","title":"Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Random oracle; Computer science; Schnorr signature; Oracle; Quantum; Theoretical computer science; Quantum computer; Signature (topology); Cryptography; Provable security; Algorithm; Digital signature; Mathematics; Hash function; Encryption; Blind signature; Public-key cryptography; Computer security; Programming language; Quantum mechanics; Physics","score_opus":0.06318378054687857,"score_gpt":0.3127094173486242,"score_spread":0.2495256368017456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224071963","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056091864,0.00016834708,0.92992985,0.0020587111,0.0001162645,0.00010602754,0.00017740174,0.0010560335,0.010295524],"genre_scores_gemma":[0.8091501,0.0006038346,0.17860158,0.0007239921,0.00022078281,0.00026202085,0.00035466164,0.00037302927,0.009709939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951332,0.0014594728,0.00030120366,0.0008212409,0.0016046364,0.0006802848],"domain_scores_gemma":[0.994669,0.0022985023,0.0004104056,0.002155404,0.0002816032,0.00018502469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003191773,0.00067546713,0.0009180575,0.0007300966,0.0010483824,0.0029379898,0.0016400793,0.001849527,0.003227478],"category_scores_gemma":[0.007891372,0.00057965866,0.0016924097,0.001232685,0.0066573676,0.01058572,0.004119613,0.0058485107,0.0008955085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007520649,0.000037830778,0.00013024567,0.000039650924,0.000015973585,0.000109737484,0.00020083392,0.012995051,0.0027983712,0.97518265,0.00065147993,0.007763056],"study_design_scores_gemma":[0.000046882895,0.00003611673,0.000097256336,0.000015308078,0.00002717004,0.00009917397,0.000029963187,0.06483987,0.0105034495,0.91942436,0.0048453836,0.000035086185],"about_ca_topic_score_codex":0.00064533984,"about_ca_topic_score_gemma":0.00039043243,"teacher_disagreement_score":0.003227478,"about_ca_system_score_codex":0.0015787933,"about_ca_system_score_gemma":0.0015825815,"threshold_uncertainty_score":0.016879916},"labels":[],"label_agreement":null},{"id":"W2230840043","doi":"10.1007/978-3-642-33167-1_39","title":"PE(AR)2: Privacy-Enhanced Anonymous Authentication with Reputation and Revocation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blacklist; Computer science; Revocation; Computer security; Authentication (law); Blacklisting; Reputation; Anonymity; Benchmark (surveying); Vulnerability (computing); Scheme (mathematics); Internet privacy; Overhead (engineering); Operating system","score_opus":0.011987984929695994,"score_gpt":0.23541832147792385,"score_spread":0.22343033654822786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230840043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008895472,0.00045161406,0.9546918,0.00047309525,0.00067806646,0.00036921547,0.00033891315,0.006084427,0.028017381],"genre_scores_gemma":[0.53646725,0.0007803218,0.35835493,0.000552512,0.0004784052,0.00043987136,0.0011968894,0.001197616,0.10053211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730825,0.00072701817,0.00017776937,0.00052099105,0.0008142497,0.00045170306],"domain_scores_gemma":[0.9974483,0.00051177014,0.00012904147,0.0014834937,0.0003224525,0.00010497782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002229411,0.0010844613,0.0011634141,0.0007497215,0.0010651321,0.002723309,0.0025577669,0.002001016,0.011596056],"category_scores_gemma":[0.0056077917,0.00052149163,0.0010172762,0.00092794665,0.0013034721,0.00548437,0.005341561,0.002493711,0.008993436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011809997,0.00035367114,0.0005284596,0.00057098654,0.000119013515,0.0005327004,0.00046913262,0.03113328,0.026134258,0.4824627,0.053234026,0.40328076],"study_design_scores_gemma":[0.00021712051,0.00055355387,0.0005914428,0.00011143541,0.00014614547,0.0023922366,0.00017995083,0.3867113,0.05201043,0.43610495,0.1207586,0.00022285031],"about_ca_topic_score_codex":0.00051803555,"about_ca_topic_score_gemma":0.00055505923,"teacher_disagreement_score":0.011596056,"about_ca_system_score_codex":0.0007098578,"about_ca_system_score_gemma":0.00137099,"threshold_uncertainty_score":0.03879267},"labels":[],"label_agreement":null},{"id":"W2231275207","doi":"10.1007/978-3-642-57189-3_14","title":"Worst-Case Analysis of an Algorithm for Computing the Greatest Common Divisor of n Inputs","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Greatest common divisor; Divisor (algebraic geometry); Algorithm; Computer science; Exponentiation; Base (topology); Mathematics; Discrete mathematics","score_opus":0.022339118416732567,"score_gpt":0.2630942104361617,"score_spread":0.24075509201942916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231275207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087894835,0.002370402,0.86870086,0.0022479764,0.0002539494,0.0002872617,0.00072319794,0.001826779,0.035694655],"genre_scores_gemma":[0.598092,0.0016390469,0.37486458,0.00079627795,0.000786929,0.00047630392,0.001515083,0.0008917975,0.020938065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919992,0.0019464154,0.00041996452,0.0013659754,0.0029681784,0.0013002439],"domain_scores_gemma":[0.984073,0.011352758,0.00082161766,0.0021280344,0.0013146097,0.00030998272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005118729,0.002483838,0.0015100576,0.0030235946,0.0023694772,0.0069818962,0.0046644807,0.002472076,0.011139769],"category_scores_gemma":[0.01742561,0.0011643908,0.0024820014,0.0034144854,0.0032032705,0.009713208,0.0023053961,0.0027625023,0.002447281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027522969,0.00042181907,0.0045319563,0.0009955888,0.00047453406,0.0005319189,0.00040844706,0.47504282,0.015357321,0.32784593,0.020119218,0.15151815],"study_design_scores_gemma":[0.00006804869,0.00013749281,0.00044086954,0.00008012874,0.00014705822,0.00042368623,0.000084298765,0.7818089,0.005807691,0.2076548,0.0033037385,0.000043257845],"about_ca_topic_score_codex":0.0025009257,"about_ca_topic_score_gemma":0.004359825,"teacher_disagreement_score":0.011139769,"about_ca_system_score_codex":0.005086717,"about_ca_system_score_gemma":0.004398989,"threshold_uncertainty_score":0.037266254},"labels":[],"label_agreement":null},{"id":"W2237100638","doi":"10.1587/transinf.2015mup0008","title":"Application Authentication System with Efficiently Updatable Signature","year":2015,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Broadcasting (networking); Service provider; Authentication (law); Key (lock); Computer security; Computer network; Protocol (science); Service (business)","score_opus":0.009401317934923107,"score_gpt":0.20915703705375732,"score_spread":0.19975571911883422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237100638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0341302,0.00091723824,0.92472076,0.00054177706,0.0005631839,0.0008036798,0.00029573508,0.024986573,0.013040782],"genre_scores_gemma":[0.79606885,0.0006586685,0.1622645,0.000504493,0.0003945694,0.00092408183,0.0015079583,0.00042396004,0.03725287],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961117,0.0007330433,0.00065550226,0.0005794897,0.0014039716,0.0005163399],"domain_scores_gemma":[0.9957878,0.00042909957,0.00034764523,0.0015223394,0.0016459989,0.0002670921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018839883,0.00075070665,0.001175869,0.0014964539,0.0017022145,0.0026914696,0.0021464825,0.0016469738,0.0064117564],"category_scores_gemma":[0.0039686924,0.00052624376,0.00077214226,0.0011949104,0.00074422004,0.004681747,0.0037654622,0.0014628251,0.0063812453],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054240692,0.0007352421,0.004946741,0.00082343677,0.00030966083,0.0024058623,0.0010362328,0.03554669,0.17332017,0.14279297,0.04971531,0.5829436],"study_design_scores_gemma":[0.00065456575,0.001048599,0.0016005802,0.00009774366,0.0003663137,0.002624015,0.00015883196,0.6990504,0.14330678,0.028218884,0.12254745,0.00032580848],"about_ca_topic_score_codex":0.0013735424,"about_ca_topic_score_gemma":0.0006205376,"teacher_disagreement_score":0.0064117564,"about_ca_system_score_codex":0.0009631697,"about_ca_system_score_gemma":0.0023236943,"threshold_uncertainty_score":0.021449506},"labels":[],"label_agreement":null},{"id":"W2238904460","doi":"10.1145/2824233","title":"Attribute-Based Encryption for Circuits","year":2015,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Ciphertext; Attribute-based encryption; Encryption; Learning with errors; Theoretical computer science; Computer science; Ciphertext indistinguishability; Semantic security; Mathematics; Key (lock); Boolean circuit; Public-key cryptography; Malleability; Boolean function; Algorithm; Computer security","score_opus":0.07897727703077558,"score_gpt":0.2889504031054084,"score_spread":0.20997312607463287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238904460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029233338,0.0010378713,0.9446054,0.0020834894,0.00012157889,0.0001957331,0.000764616,0.00070291624,0.021255104],"genre_scores_gemma":[0.6700697,0.0015650901,0.31016943,0.00082093553,0.00023963915,0.0005707657,0.00084517087,0.0001420419,0.015577313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800426,0.00047367095,0.00015606282,0.00030798203,0.00080129085,0.00025676185],"domain_scores_gemma":[0.9974619,0.0011215134,0.0001721173,0.00092562137,0.00023822986,0.00008056396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012596373,0.00048772924,0.00071954535,0.0006508668,0.0010470604,0.0028095066,0.0011922126,0.0009936321,0.0048257266],"category_scores_gemma":[0.004854007,0.00030244642,0.0009344678,0.0015944784,0.0015865685,0.006071779,0.00232892,0.0033816933,0.0010255631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059011887,0.000024078661,0.00010965699,0.00006683817,0.0000065465792,0.000039060797,0.00012118607,0.007029821,0.001830083,0.9706035,0.002043895,0.018066231],"study_design_scores_gemma":[0.00004546968,0.000051513183,0.00015496128,0.000039466748,0.000017551969,0.00016927774,0.000034711433,0.080976844,0.0046500624,0.89320767,0.020629043,0.00002340266],"about_ca_topic_score_codex":0.00082408194,"about_ca_topic_score_gemma":0.00075984903,"teacher_disagreement_score":0.0048257266,"about_ca_system_score_codex":0.0029730024,"about_ca_system_score_gemma":0.0011817805,"threshold_uncertainty_score":0.021570742},"labels":[],"label_agreement":null},{"id":"W2241378342","doi":"10.3837/tiis.2015.04.008","title":"Enabling Fine-grained Access Control with Efficient Attribute Revocation and Policy Updating in Smart Grid","year":2015,"lang":"en","type":"article","venue":"KSII Transactions on Internet and Information Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Revocation; Access control; Smart grid; Grid; Distributed computing; Computer security; Computer network; Database; Operating system","score_opus":0.0181158097047365,"score_gpt":0.25053620289532014,"score_spread":0.23242039319058364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2241378342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10457413,0.00026586134,0.89011484,0.00035330592,0.0000857125,0.00022858127,0.00007241275,0.0024428612,0.0018623294],"genre_scores_gemma":[0.9545203,0.000076799,0.044516005,0.000056024364,0.000021369267,0.000045558,0.000046672678,0.000026437852,0.0006908147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968347,0.00084051583,0.00038154906,0.00057062024,0.000766433,0.00060620625],"domain_scores_gemma":[0.99365294,0.0012967909,0.0008848285,0.0032273938,0.0006439604,0.00029414718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476639,0.0003786545,0.0009328457,0.0005590871,0.00084599596,0.0014420789,0.0011233012,0.000658823,0.0008126686],"category_scores_gemma":[0.005535372,0.00029873126,0.00049158384,0.00092301355,0.0011523196,0.0040170373,0.0020293274,0.001420092,0.00028080362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002067188,0.0011797622,0.009024619,0.00031412518,0.00019004493,0.0010305713,0.0014178358,0.24951687,0.13796918,0.17523524,0.0056023602,0.41645226],"study_design_scores_gemma":[0.00007200817,0.00015841759,0.00086766004,0.00001708844,0.00003302404,0.00044434023,0.00014786774,0.9194025,0.038033746,0.03520619,0.005548003,0.00006915646],"about_ca_topic_score_codex":0.0016161358,"about_ca_topic_score_gemma":0.0012018884,"teacher_disagreement_score":0.002476639,"about_ca_system_score_codex":0.0007853609,"about_ca_system_score_gemma":0.0016638832,"threshold_uncertainty_score":0.013097823},"labels":[],"label_agreement":null},{"id":"W2242794960","doi":"10.1515/popets-2015-0008","title":"DP5: A Private Presence Service","year":2015,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Waterloo; Microsoft Research; National Science Foundation","keywords":"Computer science; Scalability; Forward secrecy; Computer security; Key (lock); Service (business); Secrecy; Private information retrieval; Internet privacy; Public-key cryptography; Database; Encryption; Business","score_opus":0.03369395441782197,"score_gpt":0.2595731491162577,"score_spread":0.2258791946984357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242794960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13624258,0.0013699381,0.75310695,0.0022797065,0.0007374446,0.0014771731,0.0027233171,0.04541964,0.056643277],"genre_scores_gemma":[0.9126622,0.0002652749,0.06526239,0.00059933204,0.00015992425,0.0003490133,0.0020185488,0.00042936087,0.01825395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99613684,0.0007440443,0.00044059084,0.00048537593,0.0015777699,0.00061539875],"domain_scores_gemma":[0.99551034,0.00078724936,0.0004907682,0.0021616092,0.0005952535,0.00045486784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002510533,0.0006519942,0.0007165536,0.0010839466,0.00104603,0.0033554283,0.0031235698,0.0021416568,0.01431948],"category_scores_gemma":[0.0062274886,0.0006747459,0.0005458031,0.00096513453,0.0012439785,0.0050516077,0.0071733524,0.0025075662,0.0046753143],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050855693,0.0012212754,0.010111398,0.0014094507,0.0002468336,0.0018112466,0.0013078708,0.019665623,0.08346104,0.4281189,0.0917281,0.3558327],"study_design_scores_gemma":[0.000789242,0.0016334015,0.0038281276,0.00023818275,0.00019586323,0.0032869533,0.00059894583,0.39599368,0.13748881,0.085552454,0.37001818,0.00037609955],"about_ca_topic_score_codex":0.0015098872,"about_ca_topic_score_gemma":0.00052854564,"teacher_disagreement_score":0.01431948,"about_ca_system_score_codex":0.0015900211,"about_ca_system_score_gemma":0.0014854402,"threshold_uncertainty_score":0.04790342},"labels":[],"label_agreement":null},{"id":"W2246110347","doi":"10.1109/cscloud.2015.30","title":"A Low Storage Phase Search Scheme Based on Bloom Filters for Encrypted Cloud Services","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Encryption; Bloom filter; Computer science; Cloud storage; Phrase search; Cloud computing; Key (lock); Scheme (mathematics); Ranking (information retrieval); Search engine; Information retrieval; Computer security; Computer network; Web search query; Mathematics","score_opus":0.035771108661908,"score_gpt":0.3012008414487805,"score_spread":0.26542973278687254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246110347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050605513,0.0010969972,0.93727726,0.00067009125,0.00019733532,0.00082120555,0.00044976152,0.0013916177,0.007490323],"genre_scores_gemma":[0.5426525,0.0009094992,0.44316387,0.00038183332,0.0001098285,0.00047712828,0.00057993236,0.000090509755,0.011634954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983352,0.0003377349,0.0002118601,0.00017393928,0.00069558324,0.00024572684],"domain_scores_gemma":[0.9981694,0.00039028694,0.0002248652,0.0005976788,0.00049545156,0.00012226104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012919706,0.00044137874,0.0010046135,0.0014305967,0.0017438957,0.0015356877,0.001513643,0.0010972463,0.0033855527],"category_scores_gemma":[0.0032583645,0.00032590562,0.00062288233,0.0020689406,0.0007999464,0.00454227,0.001749777,0.0009866022,0.0011899383],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020731906,0.0004875949,0.0020388253,0.0005435947,0.0001499357,0.00083922874,0.0008318866,0.02837325,0.17289843,0.3081782,0.019539176,0.4640467],"study_design_scores_gemma":[0.0005927318,0.0012788144,0.0015118013,0.00019820781,0.00020825991,0.0029438604,0.00043436396,0.62481916,0.16457559,0.11323632,0.08979206,0.00040887317],"about_ca_topic_score_codex":0.0031384933,"about_ca_topic_score_gemma":0.0029257468,"teacher_disagreement_score":0.0033855527,"about_ca_system_score_codex":0.0023781124,"about_ca_system_score_gemma":0.0032124934,"threshold_uncertainty_score":0.017254472},"labels":[],"label_agreement":null},{"id":"W2248085730","doi":"","title":"Lattice-Based FHE as Secure as PKE.","year":2013,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Homomorphic encryption; Learning with errors; Lattice problem; Lattice (music); Bounded function; Mathematics; Security parameter; Discrete mathematics; Public-key cryptography; Encryption; Cryptography; Algorithm; Computer science; Mathematical analysis; Computer security; Physics","score_opus":0.008786259248338202,"score_gpt":0.23345270487427983,"score_spread":0.22466644562594162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248085730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07177204,0.00081526703,0.85116845,0.0031899703,0.00044230165,0.00041310562,0.0009667166,0.0029919965,0.06824014],"genre_scores_gemma":[0.7983758,0.00027493373,0.18052013,0.0006894075,0.00013006298,0.00023490709,0.0006715407,0.0001992418,0.018903868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966265,0.0008735282,0.00015016494,0.00046035193,0.0014217121,0.00046768214],"domain_scores_gemma":[0.99623716,0.0015215165,0.00020640698,0.001606684,0.00027271014,0.0001555264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017528889,0.00040689722,0.0006935869,0.00053517317,0.0009152588,0.0026111223,0.0011386762,0.0010993739,0.009726905],"category_scores_gemma":[0.005491683,0.00028485994,0.00080385915,0.0006535337,0.0022352065,0.00556828,0.0033901718,0.0027025782,0.002588916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046124053,0.00016036732,0.00049414136,0.00016980572,0.000042833046,0.00012315423,0.00026849713,0.024645362,0.008747972,0.9094319,0.007184287,0.048270464],"study_design_scores_gemma":[0.00015417906,0.00016465625,0.00022975745,0.000046355104,0.00003241566,0.00030628324,0.0001102138,0.21824807,0.018981429,0.7444814,0.017200971,0.000044315406],"about_ca_topic_score_codex":0.00058976165,"about_ca_topic_score_gemma":0.00077106105,"teacher_disagreement_score":0.009726905,"about_ca_system_score_codex":0.0013804013,"about_ca_system_score_gemma":0.0014132129,"threshold_uncertainty_score":0.032539785},"labels":[],"label_agreement":null},{"id":"W2255779533","doi":"10.1007/978-3-642-39884-1_9","title":"Unconditionally-Secure Robust Secret Sharing with Minimum Share Size","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Secrecy; Computer science; Secure multi-party computation; Cheating; Scheme (mathematics); Verifiable secret sharing; Shamir's Secret Sharing; Information-theoretic security; Homomorphic secret sharing; Robustness (evolution); Computer security; Set (abstract data type); Theoretical computer science; Cryptography; Mathematics","score_opus":0.01554854089249214,"score_gpt":0.21788748413896264,"score_spread":0.2023389432464705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255779533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025389545,0.00041381395,0.9640159,0.0005139924,0.00012160528,0.000099385165,0.00018167269,0.0010214525,0.008242637],"genre_scores_gemma":[0.851873,0.00051030354,0.13445161,0.00031341024,0.00023473053,0.00022214094,0.0002994023,0.0002870431,0.011808493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962282,0.0006030509,0.000246384,0.0005864957,0.0018840517,0.00045184584],"domain_scores_gemma":[0.99520135,0.0016700214,0.00045206829,0.002216853,0.0003495166,0.000110190245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016359175,0.0010337421,0.0015837875,0.0005799585,0.0007340291,0.0020103909,0.0023905025,0.0016711226,0.003661946],"category_scores_gemma":[0.005273126,0.0006666966,0.0012287152,0.0010567623,0.0019149755,0.0056586363,0.0050009983,0.003046023,0.0017310953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010265775,0.00015242992,0.0002341137,0.00045505908,0.00016619553,0.00033736572,0.0002825006,0.12003872,0.096758015,0.643846,0.0050427984,0.1316602],"study_design_scores_gemma":[0.000117509626,0.00040289038,0.00022680749,0.000054127653,0.000082723614,0.0005821469,0.00004413959,0.37334943,0.056060337,0.56267816,0.006305693,0.0000960475],"about_ca_topic_score_codex":0.00017533616,"about_ca_topic_score_gemma":0.00014298882,"teacher_disagreement_score":0.003661946,"about_ca_system_score_codex":0.0010385959,"about_ca_system_score_gemma":0.0011080761,"threshold_uncertainty_score":0.012250483},"labels":[],"label_agreement":null},{"id":"W2279727250","doi":"","title":"Towards Cloud Data Warehouses of Multivalued Encrypted Values","year":2014,"lang":"en","type":"article","venue":"Journal of Information and Data Management","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Encryption; Cloud computing; Computer science; Overhead (engineering); Data redundancy; Schema (genetic algorithms); Redundancy (engineering); Data mining; Data warehouse; Sorting; Theoretical computer science; Database; Algorithm; Information retrieval; Computer network; Operating system","score_opus":0.03653760927259316,"score_gpt":0.29144704049273995,"score_spread":0.2549094312201468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279727250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12540886,0.0008982203,0.8610377,0.0008191007,0.000100330704,0.00034369412,0.0017058651,0.0071054646,0.002580836],"genre_scores_gemma":[0.3709569,0.00063133985,0.6211469,0.0002992212,0.000049132064,0.0001729538,0.0041596903,0.0005529019,0.0020309142],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702376,0.0005338039,0.000498658,0.00058007124,0.0011202394,0.00024341699],"domain_scores_gemma":[0.99435234,0.00072009856,0.00056981435,0.0030956732,0.0010459861,0.00021612094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003324777,0.00061656657,0.00085402734,0.0016060293,0.0008051539,0.0049106944,0.002672152,0.00055317103,0.0009840778],"category_scores_gemma":[0.0072508054,0.00082190457,0.0015202275,0.0038598818,0.0007957746,0.006831347,0.0035643734,0.0014541986,0.00073882414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023876445,0.0008537576,0.034141716,0.0012666379,0.00083121954,0.002656964,0.0034140358,0.15974863,0.12261755,0.178959,0.022204401,0.47091845],"study_design_scores_gemma":[0.0001732761,0.00037169608,0.0046133096,0.00021233916,0.00023733926,0.0011227622,0.0021052735,0.6867162,0.14554511,0.10546733,0.053319648,0.000115708914],"about_ca_topic_score_codex":0.0027124817,"about_ca_topic_score_gemma":0.0025333408,"teacher_disagreement_score":0.0049106944,"about_ca_system_score_codex":0.0010783498,"about_ca_system_score_gemma":0.0015311583,"threshold_uncertainty_score":0.01758331},"labels":[],"label_agreement":null},{"id":"W2290739497","doi":"10.1109/iscc.2015.7405519","title":"Encryption as a service for smart grid advanced metering infrastructure","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Smart grid; Encryption; Computer security; Computer science; Cloud computing; Software deployment; Service (business); Client-side encryption; Computer network; Access control; Engineering; On-the-fly encryption; Operating system; Business","score_opus":0.02261068856244714,"score_gpt":0.26726081232529536,"score_spread":0.24465012376284823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290739497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19960815,0.0042528124,0.740627,0.004767728,0.0008060983,0.0008944444,0.00069099583,0.010721114,0.037631743],"genre_scores_gemma":[0.93247277,0.0007652311,0.060613487,0.00030888364,0.00008191364,0.000107675296,0.00043922913,0.000116196476,0.0050945347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.0001828114,0.000049282997,0.000049091886,0.0002385982,0.00011580627],"domain_scores_gemma":[0.99911994,0.00018109017,0.000113911694,0.00026286044,0.00024769566,0.000074526004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009108407,0.00040040282,0.0003470985,0.00045547393,0.0006033085,0.0011539838,0.000606466,0.0008875808,0.003137631],"category_scores_gemma":[0.0018186581,0.00014203678,0.000407809,0.0005345876,0.00037149785,0.0023312755,0.0008894861,0.001006124,0.0010717324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013375131,0.0006163839,0.010172872,0.00071385887,0.00015183886,0.0016226921,0.0003890366,0.10039979,0.07283141,0.44609913,0.0716409,0.2940245],"study_design_scores_gemma":[0.00015686682,0.00026868773,0.0016479096,0.00005147864,0.000057717985,0.0008747851,0.000118030795,0.8493427,0.02725665,0.03567757,0.0844947,0.000052954598],"about_ca_topic_score_codex":0.0015792323,"about_ca_topic_score_gemma":0.0011198705,"teacher_disagreement_score":0.003137631,"about_ca_system_score_codex":0.0010488918,"about_ca_system_score_gemma":0.0012249576,"threshold_uncertainty_score":0.010496378},"labels":[],"label_agreement":null},{"id":"W2292779005","doi":"","title":"All-but-k Mercurial Commitments and their Applications †","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero-knowledge proof; Algebraic number; Cryptography; Mathematics; Discrete mathematics; Polynomial; Scheme (mathematics); Computer science; Computer security","score_opus":0.02385724918341221,"score_gpt":0.26162874790953006,"score_spread":0.23777149872611786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292779005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028893631,0.0007546874,0.9180452,0.0060045565,0.00040750185,0.00017620625,0.0002343425,0.0005378914,0.04494598],"genre_scores_gemma":[0.79768693,0.0009075829,0.18053672,0.001479117,0.00047954067,0.00034627639,0.0002865707,0.00030314436,0.017974164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927625,0.0027234107,0.0006007175,0.001203553,0.0020396023,0.00067020627],"domain_scores_gemma":[0.9867802,0.005946612,0.0011777441,0.0037442767,0.0017388609,0.0006122772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006240768,0.0006768958,0.0007665477,0.0010755874,0.0031935938,0.0042780116,0.0025296358,0.0024958574,0.0063977833],"category_scores_gemma":[0.018607942,0.00083538756,0.0013514626,0.0016857089,0.008975655,0.013410452,0.009120021,0.009194606,0.0018993258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021398972,0.000010668149,0.00009350992,0.00003086122,0.0000056985477,0.00004460175,0.00023572084,0.0021190813,0.00029568162,0.9927301,0.0007292065,0.003683509],"study_design_scores_gemma":[0.00001311609,0.000021759366,0.00007187905,0.000050195984,0.000009042324,0.00009802744,0.00014327066,0.015620809,0.0015300949,0.97234005,0.010067313,0.000034324836],"about_ca_topic_score_codex":0.0012013819,"about_ca_topic_score_gemma":0.00078935886,"teacher_disagreement_score":0.0063977833,"about_ca_system_score_codex":0.0029992955,"about_ca_system_score_gemma":0.0020375445,"threshold_uncertainty_score":0.03300476},"labels":[],"label_agreement":null},{"id":"W2295167940","doi":"10.1515/jmc-2018-0012","title":"Multi-prover proof of retrievability","year":2018,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Gas meter prover; Cryptography; Theoretical computer science; Retrievability; Scheme (mathematics); Protocol (science); Confidentiality; Discrete mathematics; Algorithm; Computer security; Mathematics; Mathematical proof; Computer network; Information retrieval","score_opus":0.03915340734756542,"score_gpt":0.3104437271759212,"score_spread":0.27129031982835583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295167940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06384251,0.0005320781,0.9082242,0.0041190083,0.0002271263,0.00025280952,0.0003955347,0.0019322394,0.02047457],"genre_scores_gemma":[0.91573733,0.00030035828,0.07715999,0.00076544855,0.00029891694,0.00024999585,0.00019094812,0.00024320438,0.005053847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97639674,0.009303385,0.0013569822,0.0033126262,0.0074564586,0.0021738783],"domain_scores_gemma":[0.85596764,0.098914996,0.0061036064,0.029670961,0.0072836373,0.0020591766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014124127,0.000954332,0.001933751,0.0018419763,0.0022230526,0.0046663936,0.0039913873,0.003163503,0.011267088],"category_scores_gemma":[0.057588127,0.0013685151,0.0024670346,0.0016752772,0.0070985425,0.010315526,0.009725141,0.007871313,0.0019134715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003216651,0.00012512214,0.0010865986,0.00041256752,0.000114460156,0.00043975966,0.0010919974,0.025058486,0.0067060655,0.94278884,0.0032707432,0.018583676],"study_design_scores_gemma":[0.00013811981,0.00011574488,0.00027881688,0.000104380575,0.00005369517,0.00048554575,0.00010949886,0.16966009,0.015468686,0.8070124,0.00649562,0.00007749171],"about_ca_topic_score_codex":0.00042066962,"about_ca_topic_score_gemma":0.00026693405,"teacher_disagreement_score":0.014124127,"about_ca_system_score_codex":0.0022999877,"about_ca_system_score_gemma":0.0028101304,"threshold_uncertainty_score":0.07469642},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Homomorphic encryption; Computer science; IBM; Encryption; Theoretical computer science; Parallel computing; Operating system","score_opus":0.06959331102854904,"score_gpt":0.30372368922318815,"score_spread":0.2341303781946391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295445672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051477406,0.0004638745,0.9082275,0.00031724139,0.00015037418,0.00022303082,0.0005751242,0.027397454,0.011168053],"genre_scores_gemma":[0.6003352,0.0002746164,0.38304874,0.0003536332,0.00009430618,0.00024443114,0.0014167078,0.0015006488,0.012731667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989442,0.00017438698,0.00007808431,0.00015503023,0.0004901193,0.00015806698],"domain_scores_gemma":[0.9988237,0.0002772156,0.000078583,0.00057877885,0.00018809993,0.000053591808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009569697,0.00044230724,0.00046979508,0.00046675728,0.00034382174,0.0011646005,0.0014036008,0.0006082637,0.009389476],"category_scores_gemma":[0.0027088288,0.00028358013,0.00045452145,0.00040941813,0.0006128387,0.002588164,0.0014274034,0.0011959927,0.003869016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018374585,0.00053656375,0.0040322347,0.000542584,0.0001918009,0.0007044874,0.0005058119,0.07615487,0.1361196,0.15320271,0.045646872,0.580525],"study_design_scores_gemma":[0.00021435655,0.00034286763,0.0010024023,0.000055477056,0.000048312144,0.00058127346,0.00008235041,0.6633407,0.24325801,0.048559275,0.042444244,0.0000708417],"about_ca_topic_score_codex":0.0005730816,"about_ca_topic_score_gemma":0.00068430277,"teacher_disagreement_score":0.009389476,"about_ca_system_score_codex":0.0006491316,"about_ca_system_score_gemma":0.0010117139,"threshold_uncertainty_score":0.031410992},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Apache (Canada)","funders":"","keywords":"Transparency (behavior); Computer science; Certificate; Computer security; Algorithm","score_opus":0.12732994180840815,"score_gpt":0.2974916278556979,"score_spread":0.17016168604728973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338858629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038173426,0.002452218,0.64606977,0.017922787,0.003541642,0.0018019918,0.02072824,0.04539278,0.22391711],"genre_scores_gemma":[0.8482567,0.0013565912,0.051822282,0.0028842206,0.0010135595,0.0008803107,0.01101961,0.0027876368,0.07997911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.977019,0.0052392646,0.0019231644,0.0027977407,0.009716713,0.0033041658],"domain_scores_gemma":[0.9037605,0.021889072,0.004417015,0.055751458,0.011903555,0.0022784183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0104161315,0.0010408702,0.0016231973,0.0018391563,0.0024561114,0.009624463,0.0036102745,0.0037230686,0.031534683],"category_scores_gemma":[0.07537174,0.0011222429,0.0010273966,0.0023107897,0.0030277732,0.021142296,0.0099716205,0.007371455,0.018855037],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021931373,0.00037359234,0.0037378285,0.0006992299,0.00010068651,0.0007975452,0.00091999944,0.0059093907,0.009023492,0.7311547,0.14349738,0.101593055],"study_design_scores_gemma":[0.00048336614,0.00022536085,0.0010688696,0.0003878062,0.00013859243,0.0014293585,0.000448789,0.031394403,0.038129825,0.6575138,0.26860803,0.0001717313],"about_ca_topic_score_codex":0.0014514059,"about_ca_topic_score_gemma":0.0011627183,"teacher_disagreement_score":0.031534683,"about_ca_system_score_codex":0.0027808563,"about_ca_system_score_gemma":0.009511325,"threshold_uncertainty_score":0.10549396},"labels":[],"label_agreement":null},{"id":"W2340943365","doi":"10.1007/978-3-319-24717-5_6","title":"Access Control for MHN","year":2015,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Access control; Encryption; Control (management); Computer network; Computer security; Artificial intelligence","score_opus":0.040867973811275875,"score_gpt":0.27536919277457866,"score_spread":0.23450121896330278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340943365","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045016836,0.037708525,0.5340568,0.0026372478,0.0036496131,0.00017693212,0.00022590447,0.0011609884,0.41588226],"genre_scores_gemma":[0.2636454,0.046850093,0.11442974,0.001925621,0.0053943754,0.0004575138,0.00052529405,0.00036789657,0.56640404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958426,0.000064758584,0.000020350551,0.000074728996,0.00021564409,0.000040160317],"domain_scores_gemma":[0.99978846,0.00007067028,0.000016568694,0.000064358224,0.000048499594,0.00001142606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035275254,0.0006536495,0.0003661167,0.0005175311,0.00047039395,0.0014282913,0.0007021811,0.0007658617,0.015650935],"category_scores_gemma":[0.00089052826,0.00020657429,0.00020402331,0.0006335114,0.0009954405,0.0026097316,0.0010441288,0.0016961715,0.0035960055],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003335928,0.0000381297,0.00006443884,0.0002460596,0.000009630774,0.00007843369,0.00016875709,0.005119541,0.00361338,0.60986096,0.039751258,0.3410161],"study_design_scores_gemma":[0.000010954759,0.000060830153,0.0002277226,0.00027397505,0.000014417981,0.0004312737,0.00008628706,0.036423665,0.002826326,0.41603285,0.5435834,0.000028293478],"about_ca_topic_score_codex":0.0010561192,"about_ca_topic_score_gemma":0.0008754431,"teacher_disagreement_score":0.015650935,"about_ca_system_score_codex":0.0010087154,"about_ca_system_score_gemma":0.0004432894,"threshold_uncertainty_score":0.052357554},"labels":[],"label_agreement":null},{"id":"W2345949370","doi":"10.1017/9781009283403.010","title":"Private Information Retrieval","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Information retrieval; Computer science; Content (measure theory); Private information retrieval; World Wide Web; Computer security; Mathematics","score_opus":0.013232303888835862,"score_gpt":0.18734929872346634,"score_spread":0.17411699483463047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345949370","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011914738,0.045635898,0.04427823,0.0074351984,0.0037163654,0.00040337245,0.009229436,0.0045429524,0.8835671],"genre_scores_gemma":[0.009264046,0.030379012,0.008843098,0.0016360997,0.0020720025,0.00011668633,0.011952623,0.0010324038,0.93470407],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917585,0.00006811181,0.000053561747,0.00009858938,0.00053137454,0.00007247595],"domain_scores_gemma":[0.9988237,0.00025764774,0.000044917404,0.00029656434,0.00049860607,0.00007857715],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008373021,0.0008142693,0.00086641556,0.0037732564,0.0007707837,0.0041571874,0.0010790331,0.0010385455,0.3016581],"category_scores_gemma":[0.0026663444,0.00043612564,0.0005455932,0.004933168,0.0005947511,0.0058425055,0.0012290657,0.0011178113,0.25213927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024382562,0.000024153667,0.000035320583,0.00041295585,0.0000067589017,0.000040446692,0.000060111222,0.00039671973,0.0009802215,0.027357455,0.6956858,0.27497563],"study_design_scores_gemma":[0.0000031881725,0.000010673283,0.00008492082,0.000087182656,0.000004174388,0.000084322906,0.000020638336,0.00031491907,0.00048591118,0.00783299,0.99106467,0.00000634437],"about_ca_topic_score_codex":0.0021231186,"about_ca_topic_score_gemma":0.002282134,"teacher_disagreement_score":0.3016581,"about_ca_system_score_codex":0.0021068137,"about_ca_system_score_gemma":0.0012983079,"threshold_uncertainty_score":0.99609995},"labels":[],"label_agreement":null},{"id":"W2349454829","doi":"","title":"Forward Secure Proxy Signature Scheme based on Bilinear Pairings","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Proxy (statistics); Computer science; Bilinear interpolation; Computer security; Forward secrecy; Scheme (mathematics); Signature (topology); Elliptic curve; Adversary; Theoretical computer science; Public-key cryptography; Mathematics; Pure mathematics","score_opus":0.009003198323566004,"score_gpt":0.22109497814059176,"score_spread":0.21209177981702576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2349454829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05862299,0.0027212847,0.90519387,0.000702921,0.0005290122,0.000422918,0.00042656725,0.0017985778,0.029581858],"genre_scores_gemma":[0.78235376,0.0025096703,0.18658154,0.00019214234,0.0002761264,0.00033928646,0.00068989315,0.00009280902,0.026964737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845076,0.00032636404,0.00013180301,0.0001925748,0.00068630255,0.00021222417],"domain_scores_gemma":[0.9993273,0.000099546334,0.00008251367,0.00023611261,0.000166119,0.000088424764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000779232,0.0005546171,0.0010699185,0.00075075205,0.0010061163,0.0016957863,0.0007364454,0.00083501113,0.0037657144],"category_scores_gemma":[0.0010922775,0.00031774983,0.00078034215,0.0013367415,0.00077196746,0.0032863738,0.0018723605,0.0013347593,0.0013635416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010110894,0.00027440485,0.0011361866,0.00074510695,0.00012638324,0.0010553105,0.00059672544,0.037014805,0.08310593,0.66658074,0.007956635,0.20039667],"study_design_scores_gemma":[0.00058750587,0.0012509899,0.0010048185,0.00015078021,0.00021709887,0.004235817,0.00021904336,0.3267616,0.18210234,0.2689693,0.2141352,0.0003654891],"about_ca_topic_score_codex":0.00038418238,"about_ca_topic_score_gemma":0.00023566574,"teacher_disagreement_score":0.0037657144,"about_ca_system_score_codex":0.00071980903,"about_ca_system_score_gemma":0.0016525798,"threshold_uncertainty_score":0.012597501},"labels":[],"label_agreement":null},{"id":"W2351529924","doi":"","title":"A Ring Signature Scheme Based on Bilinear Pairings","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ring signature; Computer science; Revocation; Digital signature; Computer security; Bilinear interpolation; Scheme (mathematics); Signature (topology); Public-key cryptography; Cryptography; Group signature; Blind signature; Merkle signature scheme; Set (abstract data type); Ring (chemistry); Theoretical computer science; Encryption; Mathematics; Hash function; Programming language; Overhead (engineering)","score_opus":0.005049577826510671,"score_gpt":0.20827120396408316,"score_spread":0.2032216261375725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2351529924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09012433,0.00546027,0.83588046,0.0017149212,0.0013672897,0.00085016445,0.0012097514,0.0020720284,0.061320737],"genre_scores_gemma":[0.60907584,0.0040809326,0.3529784,0.0005098615,0.0006678096,0.0004979461,0.00094533496,0.000120127974,0.031123716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839777,0.00034373128,0.00017359322,0.00029585772,0.00059876556,0.00019023495],"domain_scores_gemma":[0.99898905,0.00023811815,0.00015435163,0.00023522753,0.00022537522,0.00015795263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009920156,0.0005941579,0.0008212763,0.0011554335,0.0014332162,0.0019065085,0.0006232389,0.0010684462,0.0054119285],"category_scores_gemma":[0.0017154327,0.00028989042,0.0007948599,0.0019329056,0.0012459803,0.0040008044,0.0015653775,0.0011004228,0.0021699602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063879223,0.0002144043,0.00071975414,0.00053587405,0.000059946655,0.0006804741,0.0005687738,0.012677632,0.041585345,0.8135869,0.0077043027,0.12102786],"study_design_scores_gemma":[0.00031523072,0.0017603701,0.0010102921,0.00017516808,0.00013625553,0.004983006,0.00026751726,0.10130634,0.049471542,0.41307303,0.42716482,0.00033648874],"about_ca_topic_score_codex":0.00032524447,"about_ca_topic_score_gemma":0.00021209983,"teacher_disagreement_score":0.0054119285,"about_ca_system_score_codex":0.0006529627,"about_ca_system_score_gemma":0.0017350676,"threshold_uncertainty_score":0.018104672},"labels":[],"label_agreement":null},{"id":"W2381299836","doi":"","title":"Analysis and improvement of Wang threshold signature scheme","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Signature (topology); Scheme (mathematics); Schnorr signature; ElGamal signature scheme; Merkle signature scheme; Computer science; Security analysis; Insider; Public-key cryptography; Computer security; Key (lock); Ring signature; Blind signature; Mathematics; Algorithm; Theoretical computer science; Encryption; Political science","score_opus":0.0068125900542401075,"score_gpt":0.235568157677505,"score_spread":0.22875556762326488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2381299836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16639295,0.0029497896,0.7923942,0.0012786238,0.00037671754,0.0003403322,0.00027106144,0.0006234487,0.035372723],"genre_scores_gemma":[0.8509347,0.0019796928,0.13237938,0.0002222067,0.00016338978,0.000094600364,0.0003110183,0.0000407116,0.0138742775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880207,0.0001617091,0.00009508845,0.00018365188,0.00061588146,0.00014154497],"domain_scores_gemma":[0.99934226,0.000109303335,0.00010039635,0.00018231606,0.00021290405,0.000052817948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007943079,0.000338291,0.0004879955,0.0009485255,0.0004836727,0.00097240676,0.0008927947,0.00063407986,0.0023519536],"category_scores_gemma":[0.0020657503,0.00022681121,0.0007407721,0.0016031143,0.00086727,0.0031793402,0.0012903522,0.000980259,0.00054476544],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050601823,0.000098582284,0.0013560308,0.00037029455,0.00006788383,0.00048132514,0.00054854737,0.0394237,0.057084102,0.7220687,0.0044075106,0.1735873],"study_design_scores_gemma":[0.00026949318,0.0006197838,0.0023145794,0.00015542247,0.00018995565,0.0028046211,0.00022804724,0.51527506,0.0854443,0.30043647,0.09204097,0.00022130557],"about_ca_topic_score_codex":0.0009214077,"about_ca_topic_score_gemma":0.0003746388,"teacher_disagreement_score":0.0023519536,"about_ca_system_score_codex":0.0011762382,"about_ca_system_score_gemma":0.0013461687,"threshold_uncertainty_score":0.008534253},"labels":[],"label_agreement":null},{"id":"W2389278776","doi":"","title":"Certificateless Generalized Signcryption Scheme without Random Oracles","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Signcryption; Computer science; Bilinear interpolation; Scheme (mathematics); Random oracle; Public-key cryptography; Computer security; Computer security model; Computer network; Theoretical computer science; Encryption; Mathematics","score_opus":0.033044737988296366,"score_gpt":0.2689439696357497,"score_spread":0.2358992316474533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2389278776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074847504,0.0014495362,0.90900147,0.0006144838,0.00018589928,0.00022475138,0.00015216897,0.0004906922,0.013033552],"genre_scores_gemma":[0.904053,0.0010905463,0.08649739,0.00018623716,0.00010178225,0.0001341806,0.00021728461,0.000041829517,0.0076778377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757427,0.0008190766,0.00016780103,0.00038402987,0.0007138573,0.00034097108],"domain_scores_gemma":[0.9982603,0.00044654278,0.00023041746,0.0007524329,0.00020804336,0.00010234722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012915657,0.0005302517,0.0010727916,0.00052980485,0.0006075091,0.0017214697,0.0012622054,0.0010804515,0.002166796],"category_scores_gemma":[0.0026418765,0.00021938159,0.00086650887,0.0013495076,0.0016513837,0.005147517,0.0021667173,0.0017768448,0.00046576725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025070301,0.00007410188,0.00045254437,0.00024424918,0.000059594797,0.00038184546,0.0003228757,0.033822656,0.013845236,0.90331036,0.0011673955,0.046068426],"study_design_scores_gemma":[0.00033978166,0.0006886829,0.0007270248,0.00014631734,0.0001741141,0.0017742328,0.00013845162,0.41585147,0.035728384,0.5007281,0.043539762,0.00016371581],"about_ca_topic_score_codex":0.0005422501,"about_ca_topic_score_gemma":0.00030356468,"teacher_disagreement_score":0.002166796,"about_ca_system_score_codex":0.0010238152,"about_ca_system_score_gemma":0.0013759945,"threshold_uncertainty_score":0.007428348},"labels":[],"label_agreement":null},{"id":"W2389531604","doi":"","title":"New certificateless partially blind signature scheme","year":2010,"lang":"en","type":"article","venue":"Jisuanji yingyong yanjiu","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Alberta Paraplegic Foundation","funders":"","keywords":"Computer science; Blind signature; Scheme (mathematics); Signature (topology); Computer security; Key (lock); Public-key cryptography; Algorithm; Mathematics; Encryption","score_opus":0.021634334008876852,"score_gpt":0.26745435562992026,"score_spread":0.2458200216210434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2389531604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02594769,0.0012816759,0.9572813,0.00081041845,0.0005794247,0.00034763906,0.00030336773,0.0013101795,0.012138432],"genre_scores_gemma":[0.6020737,0.0018558928,0.36851627,0.000702675,0.00040775168,0.0004285587,0.00096325343,0.00010927918,0.024942594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99662685,0.0006968785,0.0003133548,0.00055237225,0.0014707963,0.00033972587],"domain_scores_gemma":[0.99815,0.00019981251,0.0002225463,0.00049476343,0.0007040407,0.0002288403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015076351,0.00051217317,0.0010258151,0.0012103497,0.001205457,0.0018097552,0.0015992457,0.0016643228,0.0024122198],"category_scores_gemma":[0.0026238433,0.00032861248,0.0009107079,0.0018480988,0.0011027089,0.005083675,0.0024459707,0.0019543858,0.0008585929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001555468,0.0002522017,0.0012756479,0.0009501269,0.00021165451,0.000915918,0.00092650997,0.033548407,0.09517038,0.53498834,0.014659559,0.31554565],"study_design_scores_gemma":[0.0011266134,0.0010883737,0.0009699847,0.0002063434,0.00031978317,0.004865362,0.00025941123,0.39091715,0.13460773,0.18287131,0.2822131,0.0005548506],"about_ca_topic_score_codex":0.0008572805,"about_ca_topic_score_gemma":0.00053259876,"teacher_disagreement_score":0.0024122198,"about_ca_system_score_codex":0.0012622217,"about_ca_system_score_gemma":0.003004203,"threshold_uncertainty_score":0.009158075},"labels":[],"label_agreement":null},{"id":"W2394050630","doi":"10.1109/jbhi.2017.2657458","title":"SecureMed: Secure Medical Computation Using GPU-Accelerated Homomorphic Encryption Scheme","year":2017,"lang":"en","type":"article","venue":"IEEE Journal of Biomedical and Health Informatics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphic encryption; Computer science; Encryption; Speedup; NTRU; Cloud computing; Scheme (mathematics); Computer security; Parallel computing; Public-key cryptography; Operating system","score_opus":0.0984655627217598,"score_gpt":0.3725424013267138,"score_spread":0.274076838604954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394050630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14508963,0.0013401206,0.81200117,0.00123606,0.00034425777,0.00037166456,0.0007490837,0.011785113,0.027082827],"genre_scores_gemma":[0.76921684,0.000351285,0.21696475,0.0003334182,0.000050324554,0.00015281544,0.00075205916,0.00019725572,0.011981235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996227,0.00008393408,0.000025544796,0.000034605382,0.00016585668,0.00006730145],"domain_scores_gemma":[0.99972373,0.000044640357,0.000023479257,0.00013639082,0.00004757301,0.000024216255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036654223,0.00031204472,0.00039510426,0.0003527146,0.00035169985,0.0007273947,0.00068187196,0.0005388583,0.005461758],"category_scores_gemma":[0.0008302242,0.00013539911,0.00034813583,0.0003458091,0.0004324826,0.0011133474,0.0011234008,0.0006230248,0.0013855096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036565114,0.00056464894,0.0048174257,0.0005653071,0.00022561621,0.0016928844,0.0005687165,0.11816458,0.18007585,0.163072,0.05828188,0.4683146],"study_design_scores_gemma":[0.00037698398,0.00043311648,0.0014003202,0.000046706056,0.000032744378,0.001210048,0.00006796612,0.818141,0.10525867,0.026708217,0.046263628,0.000060577277],"about_ca_topic_score_codex":0.00078718126,"about_ca_topic_score_gemma":0.0010973964,"teacher_disagreement_score":0.005461758,"about_ca_system_score_codex":0.0005103289,"about_ca_system_score_gemma":0.00083852577,"threshold_uncertainty_score":0.018271387},"labels":[],"label_agreement":null},{"id":"W2394678233","doi":"10.1007/978-3-662-48054-0_22","title":"Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cryptosystem; Computer science; Public-key cryptography; Key (lock); Public key cryptosystem; Theoretical computer science; Oblivious transfer; Transfer (computing); Computer security; Cryptography; Encryption; Parallel computing","score_opus":0.024984137885280547,"score_gpt":0.23405994637808883,"score_spread":0.20907580849280827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394678233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20575525,0.0012519377,0.67035854,0.0029724685,0.00047012942,0.0005093438,0.00054067204,0.0021948973,0.11594675],"genre_scores_gemma":[0.93881977,0.00065969315,0.029731454,0.00031476837,0.0002463373,0.0002819567,0.00032972186,0.00023586709,0.02938043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985663,0.0004386588,0.00008708402,0.00016296955,0.00053604704,0.0002088886],"domain_scores_gemma":[0.9984875,0.00071326795,0.00008962485,0.00055351184,0.00009538342,0.000060805298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011583185,0.00061664556,0.00090552674,0.0006891362,0.0008348738,0.0021819242,0.0010464416,0.0011428152,0.006316761],"category_scores_gemma":[0.0036507207,0.00042228663,0.00082252466,0.0006758103,0.0021083942,0.005087335,0.0031542731,0.0027290457,0.00183944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021050042,0.00007363653,0.00013470049,0.00016900964,0.000028054386,0.00010468827,0.00024726492,0.008596268,0.0063375016,0.95760673,0.0026572635,0.023834366],"study_design_scores_gemma":[0.00006854169,0.000065817025,0.00012385721,0.000035418267,0.000023595318,0.00015379464,0.000024924997,0.03149464,0.012545729,0.95084256,0.0046012085,0.00001983956],"about_ca_topic_score_codex":0.00009623438,"about_ca_topic_score_gemma":0.0000675476,"teacher_disagreement_score":0.006316761,"about_ca_system_score_codex":0.0011532793,"about_ca_system_score_gemma":0.00088060123,"threshold_uncertainty_score":0.021131635},"labels":[],"label_agreement":null},{"id":"W2394831982","doi":"10.6633/ijns.201107.13(1).06","title":"A Stamped Hidden-signature Scheme Utilizing The Elliptic Curve Discrete Logarithm Problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Blind signature; Computer science; Ring signature; Computer security; Digital signature; Schnorr signature; Signature (topology); ElGamal signature scheme; Anonymity; Merkle signature scheme; Theoretical computer science; Hash function; Mathematics","score_opus":0.031612332533807186,"score_gpt":0.237559682393297,"score_spread":0.20594734985948981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394831982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039253097,0.0009193467,0.94349813,0.0007134888,0.00031690442,0.00037636043,0.00030735903,0.0010903423,0.013524933],"genre_scores_gemma":[0.6632533,0.0012876494,0.3091896,0.0002327555,0.00018853231,0.0002687554,0.0006622536,0.00010079962,0.024816286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982169,0.00042443248,0.00014660094,0.00022401841,0.0007994424,0.00018854368],"domain_scores_gemma":[0.998678,0.00021177201,0.000203598,0.00053333136,0.00023749957,0.00013571722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012412777,0.00049847673,0.00087215897,0.00070721965,0.000951512,0.0018729503,0.001291244,0.001181816,0.0042215954],"category_scores_gemma":[0.0020327324,0.0002697434,0.0008466315,0.0015552626,0.001154014,0.0048381104,0.002635064,0.0018465108,0.0017843039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011291429,0.00036796342,0.00077017455,0.0007657093,0.00013670763,0.00062722596,0.0005506056,0.04829843,0.06300911,0.6481292,0.006951819,0.22926395],"study_design_scores_gemma":[0.0005705126,0.0010996981,0.0006672017,0.00014676074,0.00012609032,0.0020887929,0.00020739097,0.54492337,0.10285814,0.22617239,0.12088805,0.00025165727],"about_ca_topic_score_codex":0.00036007032,"about_ca_topic_score_gemma":0.00022976134,"teacher_disagreement_score":0.0042215954,"about_ca_system_score_codex":0.0010928082,"about_ca_system_score_gemma":0.0025443535,"threshold_uncertainty_score":0.014122605},"labels":[],"label_agreement":null},{"id":"W2395217781","doi":"","title":"The NOF Multiparty Communication Complexity of Composed Functions.","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Combinatorics; Physics; Function (biology); Mathematics; Biology","score_opus":0.09254566890006378,"score_gpt":0.2510488758012296,"score_spread":0.15850320690116582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395217781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40132204,0.0021659823,0.5295788,0.008921586,0.00033828887,0.0006467156,0.0015956297,0.0005187083,0.054912247],"genre_scores_gemma":[0.9477289,0.0005592717,0.043100134,0.00041139906,0.0002719166,0.00062724046,0.00046312576,0.00019271021,0.006645393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99317956,0.0025824662,0.0002466133,0.0010577578,0.0015039493,0.001429643],"domain_scores_gemma":[0.94751734,0.04341694,0.002460835,0.00438752,0.0011437002,0.0010737119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061762636,0.0012183384,0.0017264304,0.0012212326,0.0020156088,0.003302711,0.0037776865,0.0024867617,0.006602348],"category_scores_gemma":[0.031060806,0.00056625577,0.002135583,0.0012166365,0.0032913336,0.015118298,0.0041013546,0.004584915,0.0007920397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00151054,0.00030759448,0.0049069365,0.00060287665,0.0002901656,0.00043864475,0.00082620216,0.21816751,0.008051678,0.71292436,0.009481569,0.042492054],"study_design_scores_gemma":[0.00007250136,0.00011383681,0.0011183337,0.000043147626,0.0000584458,0.0001860366,0.00012252394,0.5886271,0.0029366417,0.40424374,0.0024414458,0.000036269306],"about_ca_topic_score_codex":0.0011777938,"about_ca_topic_score_gemma":0.0010306775,"teacher_disagreement_score":0.006602348,"about_ca_system_score_codex":0.0048227366,"about_ca_system_score_gemma":0.00226319,"threshold_uncertainty_score":0.034991503},"labels":[],"label_agreement":null},{"id":"W2395288854","doi":"","title":"Privacy-Preserving Data Publish-Subscribe Service on Cloud-based Platforms.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Publication; Computer security; Encryption; Information privacy; Service (business); Scheme (mathematics); Database; Business","score_opus":0.06187660414737324,"score_gpt":0.29404678921625904,"score_spread":0.23217018506888581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395288854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099472426,0.0012608643,0.87436503,0.0037391146,0.0006295091,0.0009408035,0.0007791234,0.0021484403,0.01666462],"genre_scores_gemma":[0.89684737,0.00055920804,0.095321536,0.00028469606,0.00018414872,0.0001984444,0.00045455704,0.000075446806,0.0060747066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950105,0.0011588088,0.00039315457,0.000533711,0.0022816164,0.00062213],"domain_scores_gemma":[0.99518186,0.0011060485,0.00053869246,0.0020132845,0.00075049256,0.00040956476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037130394,0.0005331115,0.0011122794,0.00077184435,0.0022531333,0.0036537119,0.0018939576,0.0014442214,0.0022001297],"category_scores_gemma":[0.006930396,0.0003782203,0.00092934776,0.0016438008,0.0011047045,0.005481034,0.00345706,0.002276855,0.0008827401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002014891,0.0007439085,0.0068932697,0.0005748389,0.0002587625,0.003169584,0.00081120414,0.08413465,0.057908397,0.6269652,0.026696756,0.18982856],"study_design_scores_gemma":[0.00014470376,0.00024803597,0.0009992574,0.00005651494,0.00007526717,0.0011295213,0.00034058501,0.79283875,0.040537413,0.11686936,0.0466827,0.00007802528],"about_ca_topic_score_codex":0.0017995755,"about_ca_topic_score_gemma":0.0013033102,"teacher_disagreement_score":0.0037130394,"about_ca_system_score_codex":0.0020171604,"about_ca_system_score_gemma":0.0031024946,"threshold_uncertainty_score":0.01963669},"labels":[],"label_agreement":null},{"id":"W2395604259","doi":"","title":"Secure Computation with Sublinear Amortized Work.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Sublinear function; Secure two-party computation; Computer science; Computation; Secure multi-party computation; Protocol (science); Theoretical computer science; Function (biology); Simple (philosophy); Security parameter; Algorithm; Cryptography; Mathematics; Discrete mathematics","score_opus":0.022317925406379703,"score_gpt":0.24630946952594637,"score_spread":0.22399154411956668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395604259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034535907,0.0008199465,0.93211,0.0033703612,0.00024507308,0.0006891334,0.0008118528,0.004466984,0.022950716],"genre_scores_gemma":[0.6212865,0.00087869266,0.35184684,0.00084268977,0.00037239626,0.001829149,0.0013916527,0.0015588076,0.01999334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989073,0.002405279,0.00080822135,0.0020610872,0.0040892237,0.0015631096],"domain_scores_gemma":[0.97648597,0.006474583,0.0011358713,0.014457933,0.00078626693,0.00065934577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055515068,0.0021764806,0.0019826633,0.0016639798,0.0025367818,0.006274738,0.0043527684,0.0030155557,0.014673007],"category_scores_gemma":[0.013641904,0.0011772055,0.0036260912,0.00275034,0.0057344995,0.020284534,0.00989207,0.0050749183,0.0054001985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002268064,0.00032731853,0.00090129283,0.00062168186,0.00024352425,0.00024984285,0.00042599527,0.046074163,0.017263252,0.8614157,0.009028596,0.06118067],"study_design_scores_gemma":[0.00030106408,0.00017673023,0.00020182878,0.00006448018,0.00014069994,0.0003080123,0.0000770448,0.18559287,0.019829195,0.78131545,0.011931464,0.00006118045],"about_ca_topic_score_codex":0.0006642403,"about_ca_topic_score_gemma":0.0008657521,"teacher_disagreement_score":0.014673007,"about_ca_system_score_codex":0.0044823866,"about_ca_system_score_gemma":0.0039887056,"threshold_uncertainty_score":0.049086034},"labels":[],"label_agreement":null},{"id":"W2396392723","doi":"","title":"One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries.","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robustness (evolution); Block (permutation group theory); Block size; Decoding methods; Theoretical computer science; Algorithm; Mathematics; Computer security","score_opus":0.014544555931499665,"score_gpt":0.21316719171036105,"score_spread":0.19862263577886138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396392723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040352147,0.0005979649,0.9430732,0.0013682632,0.00011798434,0.00057213416,0.00076319993,0.0021620318,0.010993047],"genre_scores_gemma":[0.60455287,0.00045451985,0.37999663,0.00090890663,0.00020420436,0.00091010623,0.0011419101,0.00048155064,0.011349394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99205375,0.0029284526,0.0005851071,0.001144468,0.0024137269,0.0008744032],"domain_scores_gemma":[0.977191,0.0058963937,0.0020672034,0.012801279,0.001435425,0.000608763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062942007,0.00077350764,0.0017078724,0.001054792,0.0017152008,0.002634271,0.0044646612,0.002852286,0.005885274],"category_scores_gemma":[0.02044416,0.0008725222,0.0013443871,0.0021687709,0.003695273,0.013276836,0.011584388,0.0036223826,0.0031715883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018886451,0.0003992494,0.0031851244,0.00070617604,0.0002638548,0.0009052722,0.002408338,0.04152606,0.057690896,0.68034333,0.0122699905,0.19841298],"study_design_scores_gemma":[0.00040046667,0.0013170276,0.0016058526,0.00015675719,0.00023878022,0.0020593794,0.0012000522,0.3968546,0.10344283,0.43892807,0.053391546,0.0004047008],"about_ca_topic_score_codex":0.0007886599,"about_ca_topic_score_gemma":0.00055426854,"teacher_disagreement_score":0.0062942007,"about_ca_system_score_codex":0.0014398051,"about_ca_system_score_gemma":0.002868401,"threshold_uncertainty_score":0.033287346},"labels":[],"label_agreement":null},{"id":"W2396907655","doi":"","title":"Re-Encryption-Based Key Management Towards Secure and Scalable Mobile Applications in Clouds.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Mobile cloud computing; Encryption; Client-side encryption; Scalability; Computer security; Mobile device; Key management; Cloud computing security; Computer network; Distributed computing; On-the-fly encryption; Database; Operating system","score_opus":0.01521569710605519,"score_gpt":0.25754269505890914,"score_spread":0.24232699795285395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396907655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030647082,0.0021959236,0.9580167,0.0012860976,0.00027554441,0.000241805,0.000103921215,0.0011093041,0.0061235745],"genre_scores_gemma":[0.84036785,0.0012381377,0.15248595,0.00030521746,0.0001371455,0.00013811415,0.00013670778,0.00010144119,0.0050893943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901855,0.00025321837,0.00007487913,0.00012406144,0.00032659105,0.0002026713],"domain_scores_gemma":[0.9987691,0.00025954217,0.00015366868,0.00041362146,0.0003185732,0.000085405445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012249873,0.0004999533,0.00063697295,0.00043615763,0.0009471537,0.0022626908,0.0015672037,0.0008930775,0.0021104428],"category_scores_gemma":[0.002218336,0.00027464263,0.00048373928,0.00083623215,0.0010209754,0.0037080492,0.0019246038,0.0014966477,0.0010130791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082997204,0.00030208877,0.0018018067,0.00048807173,0.00013380017,0.0011117979,0.0004956753,0.29893687,0.074263334,0.41277888,0.022083282,0.18677431],"study_design_scores_gemma":[0.00006329779,0.00008215376,0.00022290899,0.00004138849,0.000026408448,0.00033919778,0.00011242279,0.9046177,0.02301928,0.051656753,0.01979483,0.000023597053],"about_ca_topic_score_codex":0.0019344987,"about_ca_topic_score_gemma":0.0017683291,"teacher_disagreement_score":0.0022626908,"about_ca_system_score_codex":0.0014611698,"about_ca_system_score_gemma":0.0013126932,"threshold_uncertainty_score":0.010601521},"labels":[],"label_agreement":null},{"id":"W2397354107","doi":"10.4230/lipics.icalp.2016.31","title":"Block-Wise Non-Malleable Codes","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; University of Waterloo; Defense Advanced Research Projects Agency; U.S. Department of Defense; National Science Foundation","keywords":"Code word; Block (permutation group theory); Computer science; Function (biology); Adversary; Construct (python library); Block code; Theoretical computer science; Mathematics; Combinatorics; Discrete mathematics; Decoding methods; Computer security; Algorithm; Computer network","score_opus":0.010145184393490743,"score_gpt":0.23287103519973626,"score_spread":0.22272585080624552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397354107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049718987,0.0010132452,0.93456286,0.0011181715,0.0001655632,0.00016543172,0.0005309575,0.0007467469,0.0119780125],"genre_scores_gemma":[0.8225143,0.00097257405,0.15538774,0.00087185303,0.00017871665,0.00041327262,0.0007823917,0.0002264559,0.018652676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671066,0.00069128233,0.00022105523,0.0007768458,0.0010901254,0.0005100846],"domain_scores_gemma":[0.990311,0.003651646,0.0011578597,0.0031578697,0.0013847104,0.00033684168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015982853,0.0009030746,0.0009079752,0.0009887296,0.0008603783,0.0017560256,0.0018423954,0.0017574313,0.0030205746],"category_scores_gemma":[0.012072213,0.000523598,0.00068855,0.0011511764,0.0031270122,0.003974102,0.003035775,0.0031574247,0.0017581652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036819154,0.000047013862,0.0007790457,0.00018719138,0.000045910907,0.00021699736,0.00034227638,0.06736872,0.00812732,0.88420945,0.0030509834,0.03525689],"study_design_scores_gemma":[0.0000925901,0.0001722638,0.00028539702,0.000118531425,0.000035392124,0.00041037714,0.00007295688,0.33658373,0.013224568,0.63673043,0.012197897,0.000075797485],"about_ca_topic_score_codex":0.0015701961,"about_ca_topic_score_gemma":0.0013993925,"teacher_disagreement_score":0.0030205746,"about_ca_system_score_codex":0.0017665614,"about_ca_system_score_gemma":0.0019154643,"threshold_uncertainty_score":0.012817383},"labels":[],"label_agreement":null},{"id":"W2398056013","doi":"","title":"Efficient and Secure Delegation of Linear Algebra.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Homomorphic encryption; Delegation; Computer science; Multiplication (music); Matrix multiplication; Linear algebra; Encryption; Theoretical computer science; Oblivious transfer; Computation; Mathematics; Algorithm; Combinatorics; Computer security","score_opus":0.016324419076376485,"score_gpt":0.24484436062907758,"score_spread":0.22851994155270108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398056013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024088588,0.00030093107,0.9619621,0.00076997,0.00008254645,0.00025475226,0.00016150594,0.0007772503,0.011602348],"genre_scores_gemma":[0.7810126,0.00042298227,0.20381859,0.00028562266,0.00012680057,0.00033169295,0.00027749833,0.00017027833,0.013553996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921332,0.0024221158,0.0004082955,0.001001598,0.0029744129,0.0010604816],"domain_scores_gemma":[0.9908145,0.0018610433,0.00063241407,0.005923641,0.0004119662,0.0003564721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043470953,0.0006286926,0.001020493,0.0004895117,0.0018382295,0.002614568,0.0019939952,0.0012715141,0.0064193583],"category_scores_gemma":[0.010222072,0.00068249897,0.0014963306,0.0007934795,0.0037519773,0.007330544,0.008556291,0.003077512,0.0023638885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036758545,0.00026692037,0.0010136041,0.00028428677,0.00006793075,0.00036946326,0.0008227943,0.027662987,0.010941779,0.8986954,0.0045592594,0.05494805],"study_design_scores_gemma":[0.00012741855,0.00013957283,0.00048874546,0.00004746612,0.000052373514,0.00080121245,0.0001794107,0.1918251,0.033620555,0.75227803,0.02037512,0.00006502207],"about_ca_topic_score_codex":0.00080602797,"about_ca_topic_score_gemma":0.000862706,"teacher_disagreement_score":0.0064193583,"about_ca_system_score_codex":0.0020945936,"about_ca_system_score_gemma":0.0024817656,"threshold_uncertainty_score":0.022989929},"labels":[],"label_agreement":null},{"id":"W2398403423","doi":"10.1007/978-3-319-27239-9_9","title":"Zero-Knowledge Interactive Proof Systems for New Lattice Problems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Zero-knowledge proof; Computer science; Graph isomorphism; Lattice (music); Lattice problem; Equivalence (formal languages); Time complexity; Rational number; Discrete mathematics; Theoretical computer science; Graph; Mathematics; Algorithm; Cryptography","score_opus":0.041052607278986616,"score_gpt":0.28535220976825393,"score_spread":0.2442996024892673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398403423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01598642,0.0017402092,0.9307793,0.0026750637,0.00040268773,0.00015789358,0.00028468558,0.0013503815,0.04662336],"genre_scores_gemma":[0.5654421,0.0021681963,0.3892662,0.0008484158,0.001025856,0.0006101648,0.0008006788,0.0008985129,0.038939938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362755,0.002182028,0.00034433926,0.0007296952,0.0025037208,0.00061271887],"domain_scores_gemma":[0.97705007,0.016692517,0.00062844064,0.0036808443,0.0013455086,0.0006025423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052973856,0.0011412449,0.0014908584,0.0017248621,0.0027773872,0.007504484,0.00428306,0.0023026655,0.015476109],"category_scores_gemma":[0.018909436,0.0013274192,0.0020050167,0.0017983504,0.0062168688,0.014807887,0.007734312,0.010556174,0.003475566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005882873,0.000032638676,0.000049116315,0.00011189697,0.000015697202,0.000028804578,0.00022178241,0.0032656582,0.000498014,0.9781316,0.0029019394,0.014684031],"study_design_scores_gemma":[0.000036739388,0.000009886556,0.00001895432,0.000031997635,0.000011666219,0.000029378954,0.000018665301,0.016260654,0.0008759789,0.9778857,0.0048020356,0.000018288316],"about_ca_topic_score_codex":0.00056383305,"about_ca_topic_score_gemma":0.0007067234,"teacher_disagreement_score":0.015476109,"about_ca_system_score_codex":0.0037823766,"about_ca_system_score_gemma":0.002364255,"threshold_uncertainty_score":0.051772714},"labels":[],"label_agreement":null},{"id":"W2398731595","doi":"10.1007/978-3-642-32512-0_39","title":"A Discrepancy Lower Bound for Information Complexity","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Omega; Upper and lower bounds; Communication complexity; Combinatorics; Function (biology); Corollary; Binary logarithm; Mathematics; Discrete mathematics; Computer science; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.022587209215418395,"score_gpt":0.27325572793982056,"score_spread":0.25066851872440216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398731595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06780413,0.020783188,0.7133738,0.047602236,0.0033129097,0.00028460834,0.0033851995,0.0019301008,0.14152375],"genre_scores_gemma":[0.7282073,0.013293733,0.1780786,0.012092063,0.009001674,0.0015716491,0.0039364947,0.0026385563,0.051179923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.985908,0.0033817906,0.0004886321,0.0025429078,0.005664949,0.0020137208],"domain_scores_gemma":[0.8930738,0.08701688,0.0021243617,0.009830615,0.004218569,0.00373582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010615512,0.0039031345,0.0056540715,0.006351163,0.0035647966,0.009220502,0.010039981,0.008541067,0.020280607],"category_scores_gemma":[0.08310652,0.0025105618,0.0044726077,0.007978248,0.009378137,0.028722743,0.014412764,0.024841862,0.004157535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070211955,0.00025210486,0.0012885905,0.00066095736,0.00010539504,0.000144848,0.0003707253,0.033085935,0.0024163008,0.89685774,0.026690269,0.03742492],"study_design_scores_gemma":[0.0000679904,0.00007323573,0.00047789086,0.00014368688,0.000058826867,0.00014552377,0.000044775494,0.088727765,0.00080133247,0.90263045,0.0067761834,0.000052310523],"about_ca_topic_score_codex":0.002113678,"about_ca_topic_score_gemma":0.0013825531,"teacher_disagreement_score":0.020280607,"about_ca_system_score_codex":0.011808529,"about_ca_system_score_gemma":0.0038840245,"threshold_uncertainty_score":0.085677266},"labels":[],"label_agreement":null},{"id":"W2399232315","doi":"10.1007/978-3-319-69453-5_30","title":"Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Discrete logarithm; Finite field; Embedding; Pairing; Reduction (mathematics); Degree (music); Mathematics; Field (mathematics); Computation; Computer science; Cryptography; Theoretical computer science; Logarithm; Position (finance); Discrete mathematics; Algorithm; Pure mathematics; Public-key cryptography; Artificial intelligence; Encryption; Mathematical analysis; Physics; Geometry; Computer security; Quantum mechanics","score_opus":0.0196497490266571,"score_gpt":0.27695938077669513,"score_spread":0.257309631750038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399232315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4557613,0.0008689115,0.42691293,0.0066009853,0.00062850496,0.0004641497,0.0012083924,0.0038972807,0.10365751],"genre_scores_gemma":[0.87895864,0.00027173778,0.10215283,0.00035690825,0.00019809241,0.00011431791,0.0006358695,0.00039362386,0.016917946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981446,0.0003606254,0.000085133615,0.0002920361,0.0007563936,0.0003611847],"domain_scores_gemma":[0.99855405,0.0006464125,0.00008580795,0.00042112876,0.00017967181,0.00011293601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093090616,0.0007985089,0.0012614923,0.0007696754,0.001747889,0.002470957,0.0008772723,0.0012676965,0.011448288],"category_scores_gemma":[0.0042529227,0.00037985883,0.0010575942,0.0012764874,0.0015435235,0.0031313656,0.0030694955,0.0028100275,0.00357532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018131702,0.0005687059,0.003979887,0.0008690796,0.0001909251,0.0020514014,0.0014644106,0.1320842,0.024043212,0.5198639,0.04647841,0.26659268],"study_design_scores_gemma":[0.00035884595,0.00038142985,0.00085847627,0.00011123762,0.00008144149,0.0009995764,0.00065223256,0.25211054,0.030074688,0.68157727,0.032698814,0.00009545841],"about_ca_topic_score_codex":0.0011278366,"about_ca_topic_score_gemma":0.0012105204,"teacher_disagreement_score":0.011448288,"about_ca_system_score_codex":0.0015008278,"about_ca_system_score_gemma":0.0024362854,"threshold_uncertainty_score":0.03829837},"labels":[],"label_agreement":null},{"id":"W2399698160","doi":"","title":"Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Anonymity; Computer network; Communication source; Encryption; Network Time Protocol; Key (lock); Public-key cryptography; Broadcast encryption; Computer security; Scheme (mathematics); Operating system","score_opus":0.01804911491935102,"score_gpt":0.23951052844748588,"score_spread":0.22146141352813487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399698160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012340196,0.0004298735,0.97532237,0.0005282288,0.0001819662,0.00026871657,0.00015912126,0.00061239075,0.010157034],"genre_scores_gemma":[0.67095596,0.000743595,0.30641785,0.00036902854,0.00028209153,0.0006202307,0.0005018228,0.00016743905,0.019942015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748355,0.0007394849,0.00018009801,0.00025060138,0.0010689072,0.00027735444],"domain_scores_gemma":[0.99709105,0.00061194575,0.00032402505,0.0015656184,0.00025353392,0.00015386383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024554012,0.0004890915,0.000740338,0.0004041562,0.0009045718,0.0016884329,0.001534294,0.0010911765,0.003864608],"category_scores_gemma":[0.004403793,0.0003680773,0.0007827276,0.0010596268,0.0012393225,0.007855402,0.0044365465,0.002283783,0.0019128232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063812325,0.00016430457,0.00058782933,0.0003704787,0.0000740047,0.0006380307,0.0005392048,0.024563983,0.027291609,0.86043775,0.008424496,0.07627024],"study_design_scores_gemma":[0.00027451973,0.00051545055,0.00045552626,0.000095716925,0.00010581559,0.0019369478,0.00023054078,0.25578377,0.054057278,0.6056595,0.08077744,0.00010753598],"about_ca_topic_score_codex":0.0001505143,"about_ca_topic_score_gemma":0.00017882632,"teacher_disagreement_score":0.003864608,"about_ca_system_score_codex":0.0007457884,"about_ca_system_score_gemma":0.0012556661,"threshold_uncertainty_score":0.0129855275},"labels":[],"label_agreement":null},{"id":"W2400565204","doi":"","title":"Efficient Fully Homomorphic Encryption from (Standard) LWE","year":2011,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Microsoft Research; Israel Science Foundation; Weizmann Institute of Science; National Science Foundation","keywords":"Homomorphic encryption; Learning with errors; Security parameter; Encryption; Scheme (mathematics); Computer science; Communication complexity; Theoretical computer science; Public-key cryptography; Protocol (science); Dimension (graph theory); Reduction (mathematics); Cryptography; Commitment scheme; Construct (python library); Mathematics; Discrete mathematics; Algorithm; Computer security; Combinatorics; Computer network","score_opus":0.018190530829430777,"score_gpt":0.21872975642295095,"score_spread":0.20053922559352017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400565204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056113727,0.0003779635,0.9224684,0.00084397657,0.00014584971,0.00023820679,0.00043898087,0.0012217498,0.018151145],"genre_scores_gemma":[0.698369,0.00031844995,0.29016742,0.00047558016,0.00013527586,0.00028417425,0.0006460985,0.00016671428,0.009437291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759287,0.00047059305,0.00019039471,0.0003178232,0.0010083567,0.00042000177],"domain_scores_gemma":[0.9973399,0.0005772025,0.00017268003,0.0015584696,0.00023634524,0.00011540714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016616716,0.00038489042,0.0006941629,0.00046821494,0.00059060456,0.001826615,0.0011434217,0.0009895718,0.0031250163],"category_scores_gemma":[0.003079744,0.00041032932,0.0008062914,0.0006446526,0.0019085739,0.005735212,0.0057800272,0.002420109,0.0012425683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038243682,0.00019569376,0.0005680679,0.0003192525,0.00004668503,0.00035937494,0.0005591355,0.022042925,0.0318774,0.82770115,0.006105594,0.109842375],"study_design_scores_gemma":[0.00018139489,0.00039396182,0.0006376617,0.00009855236,0.00005486934,0.0011437275,0.0002306077,0.15126787,0.09760932,0.7143882,0.03385347,0.00014041421],"about_ca_topic_score_codex":0.00017916475,"about_ca_topic_score_gemma":0.00023426555,"teacher_disagreement_score":0.0031250163,"about_ca_system_score_codex":0.0007301112,"about_ca_system_score_gemma":0.0010342209,"threshold_uncertainty_score":0.010454178},"labels":[],"label_agreement":null},{"id":"W2402543755","doi":"","title":"Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication.","year":2014,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Bounded function; Combinatorics; Upper and lower bounds; Randomness; Discrete mathematics; Omega; Mathematics; Zero (linguistics); Physics; Quantum mechanics; Mathematical analysis","score_opus":0.011528643202834856,"score_gpt":0.25475263832535083,"score_spread":0.24322399512251597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402543755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12412802,0.0018555173,0.79185176,0.016056344,0.0002929886,0.00033794675,0.00040359923,0.0010029608,0.06407093],"genre_scores_gemma":[0.8453685,0.0008556841,0.1363599,0.0022396517,0.00034149212,0.0006527724,0.00037413154,0.00031436843,0.013493453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874371,0.0050455304,0.0005343796,0.0022893236,0.0035244802,0.0011690825],"domain_scores_gemma":[0.91227883,0.06881267,0.0040006004,0.011479372,0.002147395,0.001281173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010758939,0.0011591839,0.0012435184,0.001850729,0.0032434913,0.0050213,0.0033789515,0.0033731947,0.0078091095],"category_scores_gemma":[0.04815057,0.0009947058,0.0029228856,0.0014782337,0.00980022,0.022213131,0.0101864375,0.011133752,0.0012172121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008097619,0.00003967949,0.00033870988,0.000094315976,0.00002382115,0.000047856942,0.000356184,0.0047171977,0.0011335043,0.9869048,0.001064445,0.0051984503],"study_design_scores_gemma":[0.000032775406,0.00005473089,0.0001448732,0.000042804346,0.000029085684,0.000076525335,0.00007000961,0.034269974,0.003670581,0.95735174,0.004226378,0.00003044159],"about_ca_topic_score_codex":0.0010892194,"about_ca_topic_score_gemma":0.0007739061,"teacher_disagreement_score":0.010758939,"about_ca_system_score_codex":0.005234718,"about_ca_system_score_gemma":0.0027458784,"threshold_uncertainty_score":0.05689937},"labels":[],"label_agreement":null},{"id":"W2403185010","doi":"","title":"Imperfect Decryption and an Attack on the NTRU Encryption Scheme.","year":2003,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"NTRU; Padding; Computer science; Cryptosystem; Encryption; Public-key cryptography; Computer security; Theoretical computer science","score_opus":0.04247813839381644,"score_gpt":0.30886405416974355,"score_spread":0.26638591577592713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403185010","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41639537,0.0025590889,0.33703676,0.012165698,0.00067415455,0.0002780608,0.0005627569,0.0010893905,0.22923875],"genre_scores_gemma":[0.9728822,0.0005104133,0.016954051,0.00038962608,0.00009259494,0.00004799929,0.00008230625,0.000035535384,0.009005216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733436,0.0008994911,0.00011168547,0.00022146397,0.00095500273,0.0004780101],"domain_scores_gemma":[0.9957111,0.002285262,0.00043458815,0.0012593311,0.0001742021,0.00013549664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017684165,0.0004901717,0.00076344324,0.0005702866,0.0011714771,0.0014033888,0.00053248426,0.002393264,0.0023602354],"category_scores_gemma":[0.0071856086,0.00034691693,0.0008930639,0.00055908493,0.0022815296,0.004693928,0.0025697434,0.0025172613,0.00077115797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001057339,0.00011660787,0.0014198881,0.00013019645,0.00009744106,0.003078949,0.00082201743,0.02447617,0.015767977,0.91673356,0.007847259,0.028452625],"study_design_scores_gemma":[0.00024048788,0.0003332564,0.0023729426,0.00018288933,0.00010242307,0.006930613,0.0003218694,0.311094,0.049999043,0.5967533,0.031556234,0.00011299088],"about_ca_topic_score_codex":0.0007453006,"about_ca_topic_score_gemma":0.00055072474,"teacher_disagreement_score":0.002393264,"about_ca_system_score_codex":0.0011542889,"about_ca_system_score_gemma":0.0005246151,"threshold_uncertainty_score":0.009352386},"labels":[],"label_agreement":null},{"id":"W2403999494","doi":"","title":"IBAKE: Identity-Based Authenticated Key Exchange Protocol.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Authenticated Key Exchange; Computer security; Key (lock); Key exchange; Public-key cryptography; Identity (music); Authentication (law); Protocol (science); Encryption; Theoretical computer science","score_opus":0.03765234709929096,"score_gpt":0.30144897872614473,"score_spread":0.2637966316268538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403999494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006816634,0.0046199416,0.9168954,0.0035982132,0.0020863602,0.001445935,0.0016797568,0.0074961097,0.0553617],"genre_scores_gemma":[0.3552674,0.0061366516,0.5398882,0.005053558,0.0012643768,0.0042854543,0.006419357,0.0011120511,0.08057295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463344,0.001660594,0.00050386554,0.0005720761,0.0020314227,0.0005985229],"domain_scores_gemma":[0.9976947,0.00047204623,0.00037028515,0.0007059162,0.00041818825,0.0003389414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038578606,0.001042175,0.0012410424,0.0020258885,0.0019700974,0.003004413,0.003184814,0.0033326864,0.01035321],"category_scores_gemma":[0.0062654326,0.00047726618,0.0006648429,0.0023553912,0.0027699724,0.006596202,0.0074422727,0.0048225005,0.008920532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012876207,0.00024647103,0.00065469614,0.0011335893,0.00011117915,0.0009895436,0.0009307585,0.004755133,0.01823453,0.7048368,0.07302182,0.19379781],"study_design_scores_gemma":[0.00023294504,0.00031665585,0.0004546108,0.0002715022,0.00010563881,0.001962682,0.00018653195,0.028171653,0.019021802,0.30900258,0.64007473,0.00019867324],"about_ca_topic_score_codex":0.00057821407,"about_ca_topic_score_gemma":0.00044933407,"teacher_disagreement_score":0.01035321,"about_ca_system_score_codex":0.0012030161,"about_ca_system_score_gemma":0.0022172336,"threshold_uncertainty_score":0.034634948},"labels":[],"label_agreement":null},{"id":"W2405322972","doi":"10.1007/s00446-016-0284-9","title":"Secure multi-party computation in large networks","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Asynchronous communication; Computer science; Scalability; Computation; Protocol (science); Theory of computation; Latency (audio); Distributed computing; Security parameter; Secure multi-party computation; Communication complexity; Adversary; Fraction (chemistry); Theoretical computer science; Computer network; Cryptography; Computer security; Algorithm","score_opus":0.013609632210561154,"score_gpt":0.2581931113703358,"score_spread":0.24458347915977463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405322972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06454403,0.0010431967,0.9246077,0.0024064493,0.00016460306,0.000094173476,0.00007102935,0.000514693,0.006554221],"genre_scores_gemma":[0.9157827,0.00068695744,0.07572972,0.000151495,0.00018611933,0.00015884188,0.00009696493,0.00009701932,0.007110169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960479,0.0017149778,0.00022295746,0.00041203728,0.0012700178,0.00033209097],"domain_scores_gemma":[0.9869039,0.008218803,0.0006475733,0.0034061852,0.0005034608,0.0003201767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004331241,0.00051433506,0.0011192823,0.00070856785,0.0016739347,0.002925932,0.0012388958,0.0014342279,0.0026960892],"category_scores_gemma":[0.013306848,0.0006061664,0.00048120136,0.0012421411,0.002649223,0.006094757,0.003820467,0.0028327478,0.0007258049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085954997,0.00016413732,0.0013203598,0.00027408358,0.00007855255,0.00036528482,0.00035539886,0.30869326,0.0106921205,0.5884505,0.004713621,0.0840332],"study_design_scores_gemma":[0.00005248529,0.000030179317,0.00015917623,0.000014317652,0.000013892676,0.000074058844,0.000036044556,0.66048086,0.0035049245,0.33299592,0.0026280342,0.0000100963],"about_ca_topic_score_codex":0.00041415522,"about_ca_topic_score_gemma":0.00060113793,"teacher_disagreement_score":0.004331241,"about_ca_system_score_codex":0.0014480402,"about_ca_system_score_gemma":0.0011808043,"threshold_uncertainty_score":0.022906065},"labels":[],"label_agreement":null},{"id":"W2405997985","doi":"","title":"Sequential Secret Sharing as a New Hierarchical Access Structure.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secret sharing; Computer science; Access structure; Theoretical computer science; Context (archaeology); Verifiable secret sharing; Cryptography; Set (abstract data type); Computer security; Secure multi-party computation; Cryptographic primitive; Homomorphic secret sharing; Distributed computing; Cryptographic protocol; Programming language","score_opus":0.04896042530811537,"score_gpt":0.33207799164512714,"score_spread":0.2831175663370118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405997985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041661665,0.0004883778,0.9376341,0.0009797808,0.000116358155,0.0002747394,0.0002297005,0.00043528658,0.018180057],"genre_scores_gemma":[0.73167694,0.0006148661,0.2526374,0.0003756307,0.00015568102,0.00031341842,0.00024485873,0.000068722744,0.013912556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752873,0.0005897979,0.00018719792,0.0003834003,0.0010519952,0.00025888756],"domain_scores_gemma":[0.9966234,0.0008173549,0.00048016076,0.0015127977,0.00030691922,0.0002594152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017405852,0.00031650328,0.0004011503,0.0009183078,0.0012796774,0.0024164026,0.0014240912,0.0009988914,0.0041308026],"category_scores_gemma":[0.0036580558,0.00043007446,0.00078073045,0.0013757718,0.0030436579,0.005853306,0.003771649,0.002093414,0.0008115971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005257746,0.000027738362,0.00024644684,0.00005991972,0.0000130953285,0.000107596185,0.00035400846,0.0041058455,0.009388315,0.9691896,0.0008183477,0.01563665],"study_design_scores_gemma":[0.00006147821,0.0002457075,0.0006064815,0.00006497129,0.00005094784,0.0010328662,0.00022429088,0.11460595,0.016589964,0.8206862,0.045773532,0.00005767786],"about_ca_topic_score_codex":0.00069746556,"about_ca_topic_score_gemma":0.00082845835,"teacher_disagreement_score":0.0041308026,"about_ca_system_score_codex":0.0017025401,"about_ca_system_score_gemma":0.0015638593,"threshold_uncertainty_score":0.01381892},"labels":[],"label_agreement":null},{"id":"W2407643022","doi":"","title":"How to Compress (Reusable) Garbled Circuits.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ciphertext; IBM; Key (lock); Computer science; Encryption; Homomorphic encryption; Learning with errors; Electronic circuit; Multilinear map; Scheme (mathematics); Functional encryption; Multiplicative function; Boolean circuit; Theoretical computer science; Security parameter; Arithmetic; Algorithm; Mathematics; Computer network; Logic gate; Computer security; Electrical engineering; Engineering","score_opus":0.022166258531877262,"score_gpt":0.2505621489034478,"score_spread":0.22839589037157054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407643022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058467355,0.0021579273,0.91639084,0.0037049514,0.0004325634,0.0004594371,0.00077899673,0.0033140162,0.014293829],"genre_scores_gemma":[0.65934765,0.0025997546,0.31671646,0.0016556499,0.00040367406,0.0009572024,0.0014174387,0.0012464144,0.015655678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960376,0.00091186527,0.0003546854,0.00086676405,0.0013541866,0.0004749142],"domain_scores_gemma":[0.9799682,0.00882384,0.0012847937,0.008347494,0.0011772391,0.0003984649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037774995,0.0014022994,0.0016641541,0.0011742354,0.0010992618,0.0037054268,0.0022438264,0.0024173418,0.012316496],"category_scores_gemma":[0.035781574,0.0008042714,0.0016066541,0.0015663226,0.0029951392,0.019575054,0.00444811,0.0040079933,0.0034134635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000870903,0.000149159,0.0012957052,0.0011240052,0.00013812749,0.0003461713,0.00077191985,0.06314105,0.024110025,0.7167602,0.0072322367,0.1840605],"study_design_scores_gemma":[0.00010740793,0.0003059913,0.00025946888,0.00031539667,0.000106435145,0.0006161918,0.00022077655,0.08280316,0.034583397,0.8558099,0.024795562,0.00007625695],"about_ca_topic_score_codex":0.00045087014,"about_ca_topic_score_gemma":0.00041578303,"teacher_disagreement_score":0.012316496,"about_ca_system_score_codex":0.0018222235,"about_ca_system_score_gemma":0.0015853875,"threshold_uncertainty_score":0.041202784},"labels":[],"label_agreement":null},{"id":"W2408443837","doi":"10.1515/popets-2016-0006","title":"Efficient Server-Aided 2PC for Mobile Phones","year":2015,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Protocol (science); Secure two-party computation; Android (operating system); Computer security; Oblivious transfer; Server; Mobile device; Secure multi-party computation; Cryptography; Computer network; Operating system","score_opus":0.028590372939580954,"score_gpt":0.26872178035608135,"score_spread":0.2401314074165004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408443837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14949596,0.00056445575,0.8178753,0.0010791124,0.00024572166,0.0010776223,0.0005947099,0.010239545,0.01882752],"genre_scores_gemma":[0.8761715,0.00013292812,0.115161605,0.00023530262,0.000034776553,0.00041770728,0.00036860182,0.0002757749,0.007201792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964922,0.0009974851,0.0002161789,0.00037807677,0.0013187362,0.00059729797],"domain_scores_gemma":[0.9966307,0.0009121529,0.00021851464,0.0016288534,0.0005033965,0.00010638337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011451903,0.00076407753,0.0008200723,0.00036546073,0.0008589473,0.0013467009,0.0014686176,0.0014763571,0.010825916],"category_scores_gemma":[0.0038413866,0.0004679755,0.00046797533,0.00043440127,0.00085970835,0.0028672938,0.0027726,0.0015284627,0.0029495626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047983103,0.00079914345,0.004218025,0.0012337684,0.000209995,0.0029652466,0.0015433126,0.16192533,0.22524495,0.21021086,0.042380583,0.3444705],"study_design_scores_gemma":[0.0003824461,0.0008205184,0.001262664,0.00009519783,0.000063717256,0.0009048844,0.00029217338,0.75518346,0.14944373,0.057379454,0.034043,0.00012881088],"about_ca_topic_score_codex":0.0008652667,"about_ca_topic_score_gemma":0.0010796181,"teacher_disagreement_score":0.010825916,"about_ca_system_score_codex":0.00086095196,"about_ca_system_score_gemma":0.0011429247,"threshold_uncertainty_score":0.03621626},"labels":[],"label_agreement":null},{"id":"W2461759357","doi":"10.1109/tifs.2016.2585121","title":"Privacy-Preserving Outsourced Calculation on Floating Point Numbers","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Outsourcing; Floating point; Information leakage; Point (geometry); Integer (computer science); Computer security; Computer network; Operating system; Mathematics","score_opus":0.00987505309589181,"score_gpt":0.22083730557724554,"score_spread":0.21096225248135372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461759357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012929021,0.00047601372,0.97772574,0.00049676304,0.00013914422,0.0001284299,0.00023140345,0.0008118027,0.0070617734],"genre_scores_gemma":[0.61349046,0.0012263315,0.3731117,0.0005825499,0.00025203865,0.00040514523,0.0007890605,0.00046266746,0.009680056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930006,0.0011443996,0.00048258164,0.0008873766,0.003616359,0.00086867675],"domain_scores_gemma":[0.9932381,0.0011729355,0.00040704032,0.004262536,0.0007887433,0.00013049964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028820827,0.0008004596,0.0013804631,0.0008817095,0.001430517,0.0042463266,0.0028878767,0.0011621612,0.004204445],"category_scores_gemma":[0.0091825025,0.0005970496,0.0013031164,0.0019673803,0.0026808851,0.008284712,0.0053025363,0.002853541,0.0014808824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052894873,0.00009661385,0.0010567979,0.0003233661,0.00010652628,0.0009883214,0.00069767056,0.073110685,0.0154614365,0.7851386,0.008681161,0.11380996],"study_design_scores_gemma":[0.00012207506,0.00015937723,0.00041718638,0.00014702416,0.00007702938,0.0012439158,0.00032222224,0.43650442,0.051836092,0.45935813,0.04968313,0.00012948914],"about_ca_topic_score_codex":0.0020916169,"about_ca_topic_score_gemma":0.0010097793,"teacher_disagreement_score":0.0042463266,"about_ca_system_score_codex":0.0014819807,"about_ca_system_score_gemma":0.0026351518,"threshold_uncertainty_score":0.01524204},"labels":[],"label_agreement":null},{"id":"W2465446327","doi":"10.7146/brics.v10i37.21805","title":"Computational Collapse of Quantum State with Application to Oblivious Transfer","year":2003,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Research Foundation; Fonds Québécois de la Recherche sur la Nature et les Technologies; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Oblivious transfer; Commitment scheme; Quantum; Reduction (mathematics); State (computer science); String (physics); Security parameter; Quantum state; Quantum computer; Mathematics; Computer science; Discrete mathematics; Cryptography; Physics; Theoretical computer science; Quantum mechanics; Algorithm","score_opus":0.008778372300756532,"score_gpt":0.22922074504269022,"score_spread":0.22044237274193368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465446327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12008386,0.0003678482,0.83368003,0.0028479823,0.00016401146,0.0003209104,0.00013565192,0.00065735856,0.041742276],"genre_scores_gemma":[0.92713255,0.00029033556,0.06396608,0.00029544425,0.00015367448,0.0002879806,0.00007798739,0.00015488596,0.00764114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959013,0.0014982152,0.00019215343,0.0005171855,0.0013461896,0.0005449877],"domain_scores_gemma":[0.9942801,0.0031796116,0.00037031292,0.001476931,0.00036406482,0.0003289522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348491,0.00063550373,0.0011325382,0.0010875107,0.0018349374,0.0027304045,0.0020540203,0.0016618313,0.0044908994],"category_scores_gemma":[0.011856796,0.0006325033,0.0017483659,0.0009491795,0.008500706,0.0046784417,0.009045612,0.0065978677,0.0006420623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042203275,0.000017823526,0.00009647279,0.000030286532,0.000007687693,0.000063466614,0.00023273425,0.011720993,0.0010120304,0.9835324,0.00024345604,0.0030005581],"study_design_scores_gemma":[0.000017666507,0.000037894446,0.000098529,0.000012982129,0.0000063670186,0.00003341301,0.000039561495,0.13164845,0.00240034,0.8639709,0.0017094644,0.00002448337],"about_ca_topic_score_codex":0.0016089765,"about_ca_topic_score_gemma":0.0006661187,"teacher_disagreement_score":0.0044908994,"about_ca_system_score_codex":0.0029788963,"about_ca_system_score_gemma":0.002143399,"threshold_uncertainty_score":0.021613479},"labels":[],"label_agreement":null},{"id":"W2466629065","doi":"10.1145/2939918.2939932","title":"Shatter","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Malware; Key (lock); Synchronization (alternating current); Cryptography; Set (abstract data type); Computer network; Channel (broadcasting)","score_opus":0.008082395524358512,"score_gpt":0.20295341375161077,"score_spread":0.19487101822725225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466629065","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045187496,0.008673624,0.14327893,0.014037991,0.010238337,0.0007074667,0.002640303,0.018052096,0.7571839],"genre_scores_gemma":[0.32251167,0.004097124,0.031860232,0.008104701,0.00135518,0.0004111283,0.0032465798,0.0028740782,0.62553936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976739,0.00028932365,0.00009728299,0.00045440713,0.0011149807,0.00037010462],"domain_scores_gemma":[0.9957461,0.00085514976,0.0002470036,0.0014400346,0.0013251717,0.0003865708],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002071839,0.0012861228,0.000867573,0.0021745772,0.003194801,0.0030075968,0.002012833,0.0025373744,0.13655458],"category_scores_gemma":[0.009507157,0.00054472336,0.0007974025,0.0010984307,0.0025572693,0.00568249,0.005241705,0.0022575143,0.08286479],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012702122,0.00016218952,0.00401051,0.0006316555,0.000091547336,0.0014231156,0.0019572496,0.0030505494,0.016641574,0.14829731,0.41527256,0.40719151],"study_design_scores_gemma":[0.00008430676,0.00027884438,0.0019199699,0.0003464235,0.00005333026,0.0028376589,0.00087482226,0.008018982,0.012447416,0.050996397,0.9220147,0.00012721677],"about_ca_topic_score_codex":0.0018390906,"about_ca_topic_score_gemma":0.0021111309,"teacher_disagreement_score":0.8634454,"about_ca_system_score_codex":0.0012014427,"about_ca_system_score_gemma":0.0011995318,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2473784818","doi":"10.1109/bigdatasecurity-hpsc-ids.2016.43","title":"Authentication and Access Control in e-Health Systems in the Cloud","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Access control; Authentication (law); Computer access control; Cloud computing; Computer network; Computer security; Encryption; Overhead (engineering)","score_opus":0.019967274888847905,"score_gpt":0.28707554671645913,"score_spread":0.2671082718276112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473784818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14064011,0.0016149483,0.8488389,0.0011413058,0.00009813636,0.000465615,0.00005454241,0.00074655475,0.0063998657],"genre_scores_gemma":[0.9501366,0.00033743845,0.04761607,0.0000820257,0.000035303685,0.00007261753,0.000028782746,0.000015757181,0.0016752713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99359107,0.0026135314,0.0005292734,0.00064372626,0.001943014,0.00067941134],"domain_scores_gemma":[0.9943456,0.0019775713,0.0008277543,0.0019005162,0.00071364304,0.00023478863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042910166,0.00027747167,0.000593287,0.0010329521,0.001462426,0.002365433,0.0012284116,0.0010387978,0.0011321413],"category_scores_gemma":[0.0059947865,0.0003014501,0.000556975,0.00093890517,0.002492166,0.004729893,0.002197989,0.0011674534,0.00038827612],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024921945,0.00083844794,0.00949144,0.00066610903,0.00019194717,0.001762965,0.0027303342,0.05519067,0.13449077,0.4700958,0.0038184868,0.31823084],"study_design_scores_gemma":[0.00026926817,0.00065282424,0.004182861,0.00014670717,0.00020376765,0.0017447355,0.0007495982,0.74723047,0.13653155,0.08870276,0.019435914,0.00014958701],"about_ca_topic_score_codex":0.0023452311,"about_ca_topic_score_gemma":0.0010065914,"teacher_disagreement_score":0.0042910166,"about_ca_system_score_codex":0.0015690103,"about_ca_system_score_gemma":0.0023698513,"threshold_uncertainty_score":0.022693336},"labels":[],"label_agreement":null},{"id":"W2473908394","doi":"10.1016/j.dam.2016.05.029","title":"An efficient lattice reduction using reuse technique blockwisely on NTRU","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"NTRU; Lattice reduction; Mathematics; Reuse; Lattice (music); Reduction (mathematics); Algorithm; Mathematical optimization; Theoretical computer science; Computer science; Statistics; Cryptography; Geometry","score_opus":0.020177397056009887,"score_gpt":0.26982890482061617,"score_spread":0.2496515077646063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473908394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03890323,0.00045669838,0.92681867,0.0003678203,0.00045683692,0.00017457879,0.0004150475,0.0028192226,0.029587895],"genre_scores_gemma":[0.357542,0.0004186134,0.61047906,0.00041100694,0.00024142378,0.0002511763,0.0011428718,0.00085119053,0.028662704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893147,0.00020051474,0.000044457487,0.00016481408,0.00046339375,0.00019547217],"domain_scores_gemma":[0.9994747,0.00011879437,0.000025474412,0.0002320807,0.00010514496,0.000043904485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003187064,0.00079166243,0.0015238922,0.00085301965,0.0009415025,0.001107213,0.0011209261,0.0005111142,0.010783057],"category_scores_gemma":[0.0010753471,0.00035400782,0.0011623362,0.0011187478,0.0008477774,0.001660479,0.002281125,0.0016725018,0.0035854436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082939066,0.0005369405,0.00067270466,0.0006014693,0.00014513254,0.000531341,0.00033672494,0.036162794,0.07661165,0.30380672,0.03165525,0.54810995],"study_design_scores_gemma":[0.00025832534,0.0005189553,0.00066497264,0.00008532683,0.00018602094,0.0007835416,0.00023313436,0.47200894,0.06664203,0.4052272,0.053243406,0.00014814158],"about_ca_topic_score_codex":0.0013885272,"about_ca_topic_score_gemma":0.0025555138,"teacher_disagreement_score":0.010783057,"about_ca_system_score_codex":0.00041021142,"about_ca_system_score_gemma":0.0012780762,"threshold_uncertainty_score":0.03607291},"labels":[],"label_agreement":null},{"id":"W2474404021","doi":"","title":"New results on secure message transmission","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Communication source; Computer science; Adversary; Computer network; Communication complexity; Disjoint sets; Transmission (telecommunications); Adversary model; Reliability (semiconductor); Protocol (science); Upper and lower bounds; Set (abstract data type); Theoretical computer science; Mathematics; Computer security; Power (physics); Discrete mathematics","score_opus":0.016340466469582704,"score_gpt":0.2496590333087713,"score_spread":0.23331856683918858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474404021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011071842,0.004174046,0.89696693,0.0034435885,0.0011384094,0.00026884544,0.00036003708,0.00053332315,0.082042925],"genre_scores_gemma":[0.4564445,0.018185964,0.45315784,0.003651637,0.0051630195,0.001542347,0.001324646,0.0016415608,0.05888848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880036,0.0028165588,0.0009585958,0.0023873604,0.004364667,0.0014692364],"domain_scores_gemma":[0.9703418,0.019974563,0.0016949797,0.0050095674,0.0023254666,0.0006535976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0081127705,0.0026391728,0.002400487,0.004201278,0.0032585459,0.0072830217,0.004081364,0.004258538,0.013745476],"category_scores_gemma":[0.024681874,0.0016719995,0.003959548,0.005388275,0.009292288,0.028424816,0.0071114358,0.014220667,0.0041745952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009743303,0.00006161003,0.00014636645,0.00031539897,0.00003022788,0.00009453535,0.00030787953,0.010849267,0.0012610131,0.96212375,0.0034500659,0.02126249],"study_design_scores_gemma":[0.000066366825,0.00015055826,0.00017868173,0.0001955017,0.000076228804,0.0003018622,0.0001245038,0.08726339,0.0045461063,0.8686862,0.03833953,0.000071025424],"about_ca_topic_score_codex":0.0012984923,"about_ca_topic_score_gemma":0.00063100405,"teacher_disagreement_score":0.013745476,"about_ca_system_score_codex":0.004697625,"about_ca_system_score_gemma":0.0026730224,"threshold_uncertainty_score":0.045983255},"labels":[],"label_agreement":null},{"id":"W2487203936","doi":"10.1002/sec.1556","title":"Consent-based access control for secure and privacy-preserving health information exchange","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Provincial Foundation for Excellent Young Talents of Colleges and Universities of Anhui Province; Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Computer science; Computer security; Encryption; Access control; Health care; Internet privacy; Cryptography; Collusion; Information privacy; Business; Law","score_opus":0.023313360920629973,"score_gpt":0.2838272783142137,"score_spread":0.26051391739358376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487203936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009144714,0.0007043222,0.9840895,0.00082738453,0.00009667336,0.0004365398,0.00010281899,0.00040949328,0.0041886964],"genre_scores_gemma":[0.75026,0.0013462038,0.24064788,0.0005446497,0.00031801118,0.0009621229,0.00037611934,0.000068478716,0.00547648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97976923,0.009213642,0.0021450513,0.0020324755,0.0056333225,0.0012062794],"domain_scores_gemma":[0.98457724,0.006818149,0.0016773596,0.004088163,0.0021072014,0.00073193724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010836636,0.0007785651,0.0014522965,0.001614494,0.0018593966,0.0037295332,0.0024084938,0.0021047895,0.0036918565],"category_scores_gemma":[0.02354638,0.00050401996,0.0013867207,0.0024438344,0.0043864413,0.007201707,0.005390677,0.0030429172,0.0009474041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056316925,0.00017979702,0.0010483703,0.0005138318,0.00012741591,0.0007244407,0.0012282204,0.036417414,0.012669086,0.82481325,0.0050477334,0.116667144],"study_design_scores_gemma":[0.00037495547,0.00037866362,0.00057208515,0.00018805926,0.00013834074,0.0015859309,0.00028408587,0.4274295,0.015745375,0.5262911,0.026841711,0.00017026869],"about_ca_topic_score_codex":0.0013739968,"about_ca_topic_score_gemma":0.0007492212,"teacher_disagreement_score":0.010836636,"about_ca_system_score_codex":0.0021280453,"about_ca_system_score_gemma":0.005034229,"threshold_uncertainty_score":0.057310283},"labels":[],"label_agreement":null},{"id":"W2493876536","doi":"10.1515/popets-2016-0037","title":"Circuit-extension handshakes for Tor achieving forward secrecy in a quantum world","year":2016,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Handshake; Forward secrecy; Computer science; Encryption; Quantum cryptography; Protocol (science); Transport Layer Security; Extension (predicate logic); Computer security; Quantum; Cryptography; Secrecy; Cryptographic protocol; Computer network; Quantum information; Public-key cryptography; Physics; Asynchronous communication","score_opus":0.02672935299983758,"score_gpt":0.2593544542297092,"score_spread":0.23262510122987162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493876536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11898934,0.00036250867,0.86390144,0.00068377703,0.00013877822,0.00020888126,0.00008268694,0.00076905114,0.014863563],"genre_scores_gemma":[0.95345503,0.00012796398,0.042216696,0.0001659273,0.000039844927,0.00009017578,0.000037594084,0.000035776317,0.003830885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827766,0.00057084055,0.00011541599,0.0002472302,0.0004335439,0.00035526464],"domain_scores_gemma":[0.9978417,0.00078786287,0.00018563363,0.00088315597,0.00018218732,0.000119327175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018646102,0.00038084382,0.0006520442,0.0003279774,0.0010380953,0.0011327168,0.0012650543,0.0009949214,0.003950916],"category_scores_gemma":[0.0032592863,0.00024896677,0.0005049692,0.00032677953,0.0023788377,0.0036767689,0.0036060314,0.002055163,0.00053189025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010935095,0.00010272066,0.0005279819,0.00019470624,0.000056901765,0.00040581287,0.0007442416,0.04462572,0.035791676,0.8646435,0.0023721717,0.049441032],"study_design_scores_gemma":[0.0002561419,0.00058580824,0.0005049054,0.000107751,0.00011435106,0.0008522522,0.00033562465,0.5266165,0.11877845,0.322006,0.029635971,0.00020628131],"about_ca_topic_score_codex":0.00041507967,"about_ca_topic_score_gemma":0.0003428158,"teacher_disagreement_score":0.003950916,"about_ca_system_score_codex":0.0008283013,"about_ca_system_score_gemma":0.00078316365,"threshold_uncertainty_score":0.013217151},"labels":[],"label_agreement":null},{"id":"W2495523385","doi":"","title":"Resource Fairness and Composability of Cryptographic Protocols.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Universal composability; Composability; Impossibility; Commit; Protocol (science); Cryptography; Cryptographic primitive; Proof-of-work system; Cryptographic protocol; Computer security; Secure multi-party computation; Resource (disambiguation); Theoretical computer science; Distributed computing; Computer network; Cryptocurrency","score_opus":0.018219213927283345,"score_gpt":0.28220699548224276,"score_spread":0.2639877815549594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495523385","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021932552,0.00060745236,0.9503958,0.0012682846,0.00027615143,0.0001615543,0.00008434457,0.00059382454,0.024680153],"genre_scores_gemma":[0.8057753,0.0005941014,0.17794307,0.0005197048,0.0004043132,0.00045487,0.0002041727,0.00031077414,0.013793781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930099,0.0024091003,0.0005605667,0.001271353,0.0020736246,0.0006755606],"domain_scores_gemma":[0.9900865,0.004880024,0.0010018533,0.0028804995,0.00067005854,0.00048105026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007584075,0.0010121197,0.0008192401,0.0012649574,0.0028085636,0.0030663759,0.0019834049,0.0016626953,0.005142455],"category_scores_gemma":[0.015037615,0.00073552626,0.0017942156,0.0011400556,0.007982665,0.008658696,0.0042990246,0.0043307003,0.0008369715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004837476,0.000019428222,0.00015071403,0.00003837053,0.000012355124,0.000078816636,0.00020190568,0.0072647175,0.0010126382,0.9851245,0.00032324094,0.00572506],"study_design_scores_gemma":[0.0000332175,0.00004471758,0.00011592278,0.000036478392,0.000036921345,0.00014001159,0.000054910066,0.052207105,0.0043799006,0.9308497,0.012082577,0.000018512566],"about_ca_topic_score_codex":0.001743885,"about_ca_topic_score_gemma":0.0009570982,"teacher_disagreement_score":0.007584075,"about_ca_system_score_codex":0.002710157,"about_ca_system_score_gemma":0.0021607166,"threshold_uncertainty_score":0.04010892},"labels":[],"label_agreement":null},{"id":"W2502363053","doi":"10.1007/978-3-319-39381-0_6","title":"Anonymous Authentication with a Bi-directional Identity Federation in the Cloud","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Anonymity; Password; Identity management; Authentication (law); Architecture; Scheme (mathematics); Computer security; Identity (music); Bandwidth (computing); Computer network; Operating system","score_opus":0.012845550512057984,"score_gpt":0.24066395312849534,"score_spread":0.22781840261643735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502363053","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0441636,0.00052073976,0.93256193,0.0010439914,0.00049305335,0.0002454165,0.00024370993,0.002100239,0.01862734],"genre_scores_gemma":[0.8091644,0.00038371573,0.17558315,0.00023047208,0.0001839805,0.00017381091,0.00033058983,0.00012496312,0.013824962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952803,0.0012061883,0.0003492451,0.0007320809,0.0013062988,0.0011257847],"domain_scores_gemma":[0.995523,0.00049123185,0.0002402641,0.002877084,0.00057276915,0.00029562178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037808388,0.00055404246,0.0013490937,0.0008685307,0.0038252377,0.0050746775,0.0022678324,0.0019375806,0.004015839],"category_scores_gemma":[0.0036969464,0.0005516741,0.0011126434,0.0017459083,0.0016958499,0.008590101,0.010053313,0.0027196617,0.0029872565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018241052,0.00044261065,0.0020292948,0.0001670497,0.00010292204,0.0007210607,0.0008005774,0.04366506,0.017886713,0.7691073,0.017385479,0.14586776],"study_design_scores_gemma":[0.00012525874,0.00018227646,0.0005979562,0.00006967438,0.00010893944,0.00087074173,0.0005653054,0.6027235,0.022024944,0.34043393,0.032180395,0.00011705009],"about_ca_topic_score_codex":0.0020841784,"about_ca_topic_score_gemma":0.0018949448,"teacher_disagreement_score":0.0050746775,"about_ca_system_score_codex":0.0014297448,"about_ca_system_score_gemma":0.0030258377,"threshold_uncertainty_score":0.019995213},"labels":[],"label_agreement":null},{"id":"W2503661914","doi":"10.1007/978-3-319-33681-7_30","title":"Secure Management and Processing of Metered Data in the Cloud","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Expansive; Cloud computing; Smart grid; Computer science; Computer security; Encryption; Grid; Task (project management); Engineering; Systems engineering","score_opus":0.034547738394304355,"score_gpt":0.2556127912648558,"score_spread":0.22106505287055145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503661914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037816446,0.0051008645,0.8818141,0.0039475164,0.0012306314,0.00019197412,0.0003510798,0.003103266,0.066443965],"genre_scores_gemma":[0.8096579,0.007924815,0.120406136,0.000681481,0.0011007077,0.00011492903,0.000640256,0.00056672975,0.058907058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914646,0.00009557744,0.000048521637,0.00007759239,0.0005169406,0.00011489469],"domain_scores_gemma":[0.9993438,0.00015762416,0.000073980176,0.00032105044,0.00007642252,0.000027180873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005272226,0.00047285287,0.00035706474,0.0005319377,0.0005389438,0.002754929,0.0008453509,0.0006657959,0.0041843555],"category_scores_gemma":[0.0014242275,0.00033744966,0.00037389828,0.00094398204,0.0007584637,0.0029129384,0.0014680912,0.001357764,0.0023486842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040926712,0.0001272591,0.0016036915,0.00035256761,0.00008699139,0.0008517629,0.0006357114,0.04278437,0.04583596,0.4288045,0.043839738,0.43466827],"study_design_scores_gemma":[0.000058535832,0.00015113105,0.0017094967,0.00019795563,0.000057752102,0.0014882225,0.00032819144,0.37602893,0.07698215,0.3140588,0.22888593,0.000052886],"about_ca_topic_score_codex":0.0005779661,"about_ca_topic_score_gemma":0.0005291606,"teacher_disagreement_score":0.0041843555,"about_ca_system_score_codex":0.0006089717,"about_ca_system_score_gemma":0.000815326,"threshold_uncertainty_score":0.013998091},"labels":[],"label_agreement":null},{"id":"W2507172686","doi":"10.1007/s10623-017-0336-6","title":"Combinatorial repairability for threshold schemes","year":2017,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheme (mathematics); Set (abstract data type); Event (particle physics); Process (computing); Computer science; Protocol (science); Compromise; Mathematics; Mathematical optimization; Theoretical computer science","score_opus":0.05425319039236241,"score_gpt":0.3014853999421467,"score_spread":0.24723220954978425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507172686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29033196,0.0021026887,0.6135603,0.006383121,0.0003601792,0.00014827462,0.00094377843,0.0006065647,0.0855631],"genre_scores_gemma":[0.94556516,0.00096856046,0.028604284,0.0006716275,0.00036130936,0.00020505881,0.00055552105,0.00018944938,0.022878991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972952,0.0007484779,0.00016114992,0.00051955204,0.00093206536,0.00034363734],"domain_scores_gemma":[0.9893209,0.006342827,0.0011307274,0.002027497,0.00063462,0.0005434406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001919286,0.0008034146,0.0010473826,0.0016982064,0.0012627754,0.004642302,0.0015781132,0.0021883566,0.010121512],"category_scores_gemma":[0.014223489,0.0005866071,0.0011111324,0.001989473,0.0037353772,0.006104481,0.0029734897,0.004857643,0.0013416576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058802678,0.000020232921,0.00016143502,0.00006223483,0.000008774999,0.000033334913,0.00010617673,0.0066313744,0.0006782922,0.984295,0.0011923702,0.006752088],"study_design_scores_gemma":[0.000013153336,0.000009602559,0.000041304247,0.000013881275,0.0000055638984,0.00003694979,0.000017356691,0.01080992,0.0003878697,0.9877949,0.0008622114,0.000007245835],"about_ca_topic_score_codex":0.00069020194,"about_ca_topic_score_gemma":0.0005249212,"teacher_disagreement_score":0.010121512,"about_ca_system_score_codex":0.0026919958,"about_ca_system_score_gemma":0.0015465866,"threshold_uncertainty_score":0.03385985},"labels":[],"label_agreement":null},{"id":"W2511727682","doi":"10.1109/iscc.2016.7543875","title":"Blind decryption for cloud computing","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Cloud computing; Encryption; Homomorphic encryption; Computer security; Server; Service provider; Key (lock); Client-side encryption; Cloud computing security; Outsourcing; Data sharing; Service (business); On-the-fly encryption; Computer network; Operating system","score_opus":0.027625609879448752,"score_gpt":0.27630846159221784,"score_spread":0.24868285171276908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511727682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010572225,0.0041115414,0.95684373,0.0017157232,0.00048300112,0.00017487054,0.0001043454,0.0005944228,0.025400056],"genre_scores_gemma":[0.5762898,0.0052278773,0.38777086,0.0010541845,0.00063191017,0.00023013278,0.00019503215,0.00018327446,0.02841697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883693,0.0002923864,0.0000639436,0.00014283613,0.00051841926,0.0001454469],"domain_scores_gemma":[0.99931955,0.00021726417,0.000054302727,0.00025389082,0.00011803214,0.00003689891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006942542,0.0003949015,0.00047815498,0.00047161517,0.0007702792,0.0014802438,0.00047784907,0.0009373195,0.003143142],"category_scores_gemma":[0.00166256,0.00019900127,0.00048664236,0.0006182336,0.0011782016,0.0017373493,0.0013707157,0.0016034631,0.0015478905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020495037,0.00005890143,0.00030014114,0.00030168475,0.000032633823,0.00033542706,0.00016550158,0.023033157,0.026758006,0.80288136,0.012009516,0.13391878],"study_design_scores_gemma":[0.000065055196,0.00010255479,0.00036944784,0.0001270274,0.00003145978,0.0012339351,0.000100264944,0.39115915,0.03867767,0.48300457,0.08506816,0.000060730767],"about_ca_topic_score_codex":0.0005520928,"about_ca_topic_score_gemma":0.00048334434,"teacher_disagreement_score":0.003143142,"about_ca_system_score_codex":0.0010239205,"about_ca_system_score_gemma":0.0013148905,"threshold_uncertainty_score":0.010514796},"labels":[],"label_agreement":null},{"id":"W2514274716","doi":"10.1109/iscas.2016.7527455","title":"Efficient multiplication architecture over truncated polynomial ring for NTRUEncrypt system","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"NTRU; Cryptosystem; Homomorphic encryption; Computer science; Cryptography; Multiplication (music); Multiplier (economics); Irreducible polynomial; Arithmetic; Polynomial; Elliptic curve cryptography; Public-key cryptography; Mathematics; Encryption; Algorithm; Matrix polynomial; Combinatorics","score_opus":0.008731163922068503,"score_gpt":0.22602089655357546,"score_spread":0.21728973263150697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514274716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38417554,0.0020276995,0.5947574,0.0004250046,0.00023700298,0.00021187084,0.00021229619,0.0027395869,0.015213565],"genre_scores_gemma":[0.87886745,0.00037705532,0.11422948,0.00005644261,0.000053279466,0.000052327483,0.00017476178,0.00002767394,0.006161465],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998275,0.00003211677,0.000017246484,0.00003652718,0.00005975744,0.00002680441],"domain_scores_gemma":[0.9998615,0.000020715837,0.00003222712,0.000033799766,0.00004064281,0.000011172181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015653798,0.00029764275,0.00031287313,0.00030037828,0.0003497007,0.00041600087,0.0004898417,0.00024275306,0.0029994354],"category_scores_gemma":[0.00027104656,0.0001262146,0.00022142293,0.00029469797,0.00019081299,0.00081446714,0.00024149721,0.00028460287,0.00078955933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011763428,0.0001240544,0.0012857219,0.00043144997,0.00007817114,0.0010038527,0.00024733145,0.027027735,0.7033831,0.0415686,0.0043289084,0.21934482],"study_design_scores_gemma":[0.00030806172,0.0036499163,0.003063094,0.00010619521,0.00014888575,0.005175448,0.00014384733,0.35208356,0.56535625,0.013552851,0.05629674,0.00011517547],"about_ca_topic_score_codex":0.00038671447,"about_ca_topic_score_gemma":0.0006548311,"teacher_disagreement_score":0.0029994354,"about_ca_system_score_codex":0.00037203712,"about_ca_system_score_gemma":0.0004949534,"threshold_uncertainty_score":0.010034084},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008075333001502117,"score_gpt":0.20182184566174594,"score_spread":0.1937465126602438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514893051","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050693606,0.0035851356,0.016917387,0.0053818747,0.0031016346,0.00038211583,0.010717041,0.010956933,0.9438885],"genre_scores_gemma":[0.039315157,0.0036870267,0.014551778,0.0036653355,0.0009106296,0.00033602002,0.013713063,0.0034990793,0.920322],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990895,0.00009762628,0.000045757257,0.00029407238,0.00033728397,0.00013576887],"domain_scores_gemma":[0.9990295,0.000116667994,0.000076811615,0.0002618587,0.00027227693,0.00024286937],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078412663,0.0011766287,0.0008172141,0.0016070489,0.0019973838,0.003915534,0.0017106549,0.0020846783,0.59258264],"category_scores_gemma":[0.0023775536,0.00048926234,0.00070157443,0.0010744378,0.00081298035,0.0034068823,0.003949252,0.002283798,0.48752767],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047251064,0.00016578712,0.0013687055,0.00087230763,0.000035789482,0.00055781443,0.00037728963,0.00064384437,0.0056253076,0.06836636,0.5329304,0.38858387],"study_design_scores_gemma":[0.000029133038,0.000035185683,0.00042148496,0.000104680235,0.000007333784,0.00024136584,0.00006200455,0.00038263208,0.0008433161,0.0046436777,0.99321413,0.000014939275],"about_ca_topic_score_codex":0.0031654793,"about_ca_topic_score_gemma":0.0034292701,"teacher_disagreement_score":0.40741736,"about_ca_system_score_codex":0.001345153,"about_ca_system_score_gemma":0.0014071354,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2520099014","doi":"10.1007/978-3-319-45741-3_5","title":"Compiling Low Depth Circuits for Practical Secure Computation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computation; Electronic circuit; Parallel computing; Theoretical computer science; Computer engineering; Algorithm; Computational science; Electrical engineering","score_opus":0.029169682674387333,"score_gpt":0.2940969697394751,"score_spread":0.2649272870650877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520099014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046802178,0.0014740673,0.89232945,0.00095955754,0.00047679208,0.00015435516,0.00035105602,0.007073998,0.05037859],"genre_scores_gemma":[0.5130625,0.0018690783,0.44111678,0.00064673537,0.00031540546,0.00028591065,0.0010792789,0.0031246531,0.0384997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944514,0.00009190711,0.000043690674,0.00012715967,0.0002127727,0.0000792146],"domain_scores_gemma":[0.9991061,0.00047992222,0.000035645324,0.00028115886,0.000074422496,0.000022770708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035177177,0.0009404576,0.0006517951,0.00070874684,0.00054672104,0.0013327764,0.00089556695,0.00060632185,0.013761153],"category_scores_gemma":[0.002432383,0.0006922431,0.00094554067,0.0008811866,0.0009239528,0.0032343976,0.002073857,0.002858262,0.0034139568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022305595,0.00010539734,0.00048180658,0.00091656286,0.000049211314,0.00018836302,0.00042516182,0.036012888,0.026392557,0.42618057,0.016009303,0.49301514],"study_design_scores_gemma":[0.000052940162,0.00011315106,0.00028940316,0.00017300321,0.00008557201,0.00026284638,0.0000868846,0.0715667,0.028043373,0.8411354,0.05815094,0.00003985294],"about_ca_topic_score_codex":0.00040099164,"about_ca_topic_score_gemma":0.0009419592,"teacher_disagreement_score":0.013761153,"about_ca_system_score_codex":0.00092171103,"about_ca_system_score_gemma":0.0006191688,"threshold_uncertainty_score":0.046035647},"labels":[],"label_agreement":null},{"id":"W2528081940","doi":"10.1016/j.ins.2016.09.020","title":"Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms","year":2016,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Cloud computing; Encryption; Publication; Ciphertext; Overhead (engineering); Access control; Outsourcing; Service provider; Key (lock); Service (business); Internet privacy; Business","score_opus":0.10411020251660254,"score_gpt":0.2978934404222975,"score_spread":0.19378323790569496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528081940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22676614,0.0014143096,0.7443666,0.0035587936,0.00065643236,0.0005911242,0.0016702062,0.0068259956,0.0141504835],"genre_scores_gemma":[0.9586146,0.0003638492,0.035293777,0.00019226238,0.00014417348,0.000074320524,0.00045455302,0.00012243875,0.004740008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614835,0.00058583234,0.00035333968,0.00045750066,0.001614191,0.0008409225],"domain_scores_gemma":[0.993396,0.0012625234,0.00054990716,0.00331131,0.0010281932,0.00045207504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002921149,0.0005498587,0.0016714296,0.0010623544,0.002330467,0.0043422566,0.0021125376,0.0014322542,0.003445411],"category_scores_gemma":[0.006352397,0.00047048478,0.0007913947,0.0026443414,0.0011627787,0.0059718634,0.0039747325,0.0018334236,0.0017696813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006475492,0.00096916925,0.009461411,0.0007699876,0.0003255312,0.0028341732,0.0012023452,0.09379571,0.141064,0.38856184,0.040740933,0.31379935],"study_design_scores_gemma":[0.00027713482,0.00039562656,0.0016584417,0.00005132882,0.00015336266,0.0014401834,0.00075241865,0.71606517,0.09588735,0.15687725,0.026292,0.00014979416],"about_ca_topic_score_codex":0.002433245,"about_ca_topic_score_gemma":0.0019554445,"teacher_disagreement_score":0.0043422566,"about_ca_system_score_codex":0.0017395158,"about_ca_system_score_gemma":0.0033863604,"threshold_uncertainty_score":0.015448689},"labels":[],"label_agreement":null},{"id":"W2530989744","doi":"10.1016/j.tcs.2016.09.020","title":"Rate-limited secure function evaluation","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Technische Universität Darmstadt; Aarhus Universitet","keywords":"Function (biology); Computer science; Mathematics; Algorithm; Biology","score_opus":0.013407019797567228,"score_gpt":0.25250418889849796,"score_spread":0.23909716910093073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530989744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04494461,0.0011858561,0.91329426,0.0023938967,0.00031400114,0.00019992741,0.00033204292,0.0016455693,0.035689816],"genre_scores_gemma":[0.85885113,0.00086936774,0.111414455,0.0005568049,0.00043427592,0.00027301593,0.0003403485,0.00042349016,0.026837008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99224174,0.0027366676,0.00036111323,0.00066591456,0.0030429016,0.0009517378],"domain_scores_gemma":[0.9856719,0.0066817137,0.00057230075,0.0050451956,0.0015428928,0.000485984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006871714,0.0013863147,0.0019612703,0.0016234138,0.0011983276,0.0039450806,0.0021948207,0.0018244929,0.00980815],"category_scores_gemma":[0.022653999,0.00060564006,0.0011951142,0.0013157555,0.0028594327,0.0076629734,0.0060884226,0.003710678,0.003639734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012256806,0.00012697473,0.000638414,0.00020734768,0.000055755,0.0001603792,0.00013949862,0.034054022,0.0075322147,0.8514071,0.0069050374,0.09754761],"study_design_scores_gemma":[0.00011000826,0.00026380853,0.00024316327,0.000097202304,0.000060416358,0.0004490711,0.000031175638,0.26969838,0.017244026,0.7045877,0.0071591125,0.000055898065],"about_ca_topic_score_codex":0.00037126828,"about_ca_topic_score_gemma":0.00033565768,"teacher_disagreement_score":0.00980815,"about_ca_system_score_codex":0.0026412408,"about_ca_system_score_gemma":0.0021464406,"threshold_uncertainty_score":0.036341548},"labels":[],"label_agreement":null},{"id":"W2536913845","doi":"10.1145/2994620.2994633","title":"Elxa","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Plagiarism detection; Scalability; Confidentiality; Cloud computing; Incentive; Private information retrieval; Reuse; Computer security; Malware; World Wide Web; Information retrieval; Database","score_opus":0.007613324335468717,"score_gpt":0.20386058454910994,"score_spread":0.19624726021364122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536913845","genre_codex":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022432966,0.0024973606,0.300686,0.00313958,0.002068631,0.0015601018,0.01761113,0.47346792,0.17653635],"genre_scores_gemma":[0.22509703,0.002810244,0.31614566,0.0051931916,0.001147337,0.0020783,0.079324275,0.039986655,0.32821736],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997097,0.00036836212,0.00021382733,0.0006538834,0.0013215076,0.00034536768],"domain_scores_gemma":[0.99324244,0.0008592537,0.0003743859,0.0035190715,0.0016731739,0.00033166443],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032646225,0.0011647159,0.0009971661,0.0017314035,0.0016181807,0.0044317576,0.003486183,0.001434812,0.079223156],"category_scores_gemma":[0.00859264,0.0008012769,0.0010564176,0.0013589846,0.0010461574,0.006100525,0.0052573374,0.0021698363,0.068868764],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018299377,0.00044422472,0.004125193,0.0011438092,0.0001562749,0.0004420268,0.0006142913,0.0030703228,0.019085813,0.040945772,0.5596567,0.36848563],"study_design_scores_gemma":[0.00033692297,0.00030484964,0.003068813,0.00020785749,0.00007186843,0.0007263045,0.00021388267,0.023114584,0.028413942,0.024539005,0.9188924,0.00010963499],"about_ca_topic_score_codex":0.0017244107,"about_ca_topic_score_gemma":0.001788399,"teacher_disagreement_score":0.92077684,"about_ca_system_score_codex":0.0013563341,"about_ca_system_score_gemma":0.0021649944,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2537617025","doi":"10.1145/2976749.2989066","title":"POSTER","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Rectangle; Bounding overwatch; Gas meter prover; Protocol (science); Novelty; Construct (python library); Theoretical computer science; Adversary; Algorithm; Computer security; Mathematics; Artificial intelligence; Mathematical proof; Computer network","score_opus":0.010127662037242115,"score_gpt":0.2156332668236852,"score_spread":0.20550560478644309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537617025","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016132427,0.0036362978,0.4862857,0.013407014,0.016041871,0.00087495317,0.0047181756,0.019473838,0.43942982],"genre_scores_gemma":[0.14451063,0.0026321935,0.20452537,0.0038366385,0.0035550832,0.0004283062,0.010224623,0.0026930622,0.62759423],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807763,0.00039047774,0.00013347602,0.0005566131,0.00063391734,0.0002078316],"domain_scores_gemma":[0.9969031,0.0003259837,0.000113251146,0.0012451493,0.0009432876,0.0004692599],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018300758,0.0006949506,0.0006949662,0.001129287,0.0019782241,0.003875676,0.0018992743,0.001886548,0.16231914],"category_scores_gemma":[0.0033784376,0.0005184999,0.000981536,0.0009417183,0.0008100832,0.0039584106,0.004002897,0.0020977138,0.0891175],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008461047,0.0003144011,0.002667476,0.00047512283,0.00007636137,0.0007559398,0.00048358095,0.003949316,0.019664688,0.109243765,0.42638764,0.43513557],"study_design_scores_gemma":[0.00007389976,0.0001300216,0.00084374653,0.000083428364,0.000031895055,0.0007585576,0.00016450541,0.009757873,0.01075826,0.023043666,0.9543116,0.000042519303],"about_ca_topic_score_codex":0.001079286,"about_ca_topic_score_gemma":0.001104837,"teacher_disagreement_score":0.8376809,"about_ca_system_score_codex":0.001012888,"about_ca_system_score_gemma":0.0013540341,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2539737196","doi":"10.1109/icitis.2010.5689553","title":"Against mobile attacks in Mobile Ad-hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Key escrow; Computer security; Cryptography; Computer network; Mobile ad hoc network; ID-based cryptography; Cryptosystem; Scheme (mathematics); Wireless ad hoc network; Overhead (engineering); Public-key cryptography; Key distribution; Encryption; Telecommunications; Wireless; Mathematics","score_opus":0.0062197979078496045,"score_gpt":0.24207633000894124,"score_spread":0.23585653210109164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539737196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17045249,0.020293692,0.7102404,0.007865978,0.0014691384,0.00061002735,0.00018760333,0.0016181018,0.087262526],"genre_scores_gemma":[0.9543192,0.003978761,0.033813126,0.0005139847,0.0004964528,0.00018695816,0.00012724307,0.000034165227,0.0065300413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776137,0.00060216215,0.00012311214,0.0001653864,0.0011402742,0.00020765283],"domain_scores_gemma":[0.99681526,0.0010568761,0.00054912845,0.0008102484,0.0005926875,0.00017583466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018490042,0.00060365215,0.0007147136,0.0013886489,0.0013498873,0.0015702171,0.0008817145,0.002087403,0.0016233805],"category_scores_gemma":[0.0059915,0.00032546066,0.0002827071,0.0008164615,0.001486306,0.0041723144,0.0029445859,0.0012634047,0.0010218979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008900373,0.0002373857,0.004514137,0.0010359766,0.00031752148,0.0020357852,0.0012868632,0.08319841,0.058724836,0.32614192,0.014948575,0.50666857],"study_design_scores_gemma":[0.0003589771,0.0017377044,0.0033484942,0.0007010801,0.0002521084,0.007041305,0.0010742556,0.456937,0.052476518,0.30984536,0.16607936,0.0001478699],"about_ca_topic_score_codex":0.00027362304,"about_ca_topic_score_gemma":0.00021929228,"teacher_disagreement_score":0.002087403,"about_ca_system_score_codex":0.0005363766,"about_ca_system_score_gemma":0.0005797758,"threshold_uncertainty_score":0.009778619},"labels":[],"label_agreement":null},{"id":"W2539930818","doi":"10.1109/icta.2015.7426877","title":"Performance analysis of private information retrieval scheme based on homomorphic encryption","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Private information retrieval; Scheme (mathematics); Protocol (science); Computer security; Theoretical computer science; Information retrieval; Mathematics","score_opus":0.021663921895165545,"score_gpt":0.23265540864353826,"score_spread":0.2109914867483727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539930818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76935637,0.008530292,0.19333935,0.0012085905,0.00016907678,0.000437965,0.00041192674,0.0012567687,0.02528963],"genre_scores_gemma":[0.9930432,0.0007309754,0.0051844697,0.000034488407,0.000034931498,0.000040850162,0.000113635666,0.00002494067,0.0007926083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926093,0.002217926,0.00030505663,0.0005756251,0.0027207492,0.0015713717],"domain_scores_gemma":[0.98897564,0.005953891,0.0013085632,0.0018659477,0.0014889291,0.00040713738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040428117,0.0007515391,0.0015521337,0.0017351576,0.0012123042,0.0021748554,0.001669808,0.0013009625,0.002865744],"category_scores_gemma":[0.009114713,0.00038972366,0.0006231418,0.0018789583,0.0016463161,0.0047833286,0.0015185428,0.0010170761,0.000617228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058821496,0.00081090064,0.009784132,0.0008527547,0.00040194226,0.0006968658,0.00055655424,0.6906211,0.065204024,0.14099202,0.0056531252,0.07854446],"study_design_scores_gemma":[0.00010727029,0.0007495207,0.0012329702,0.000022011933,0.00007466118,0.00045470486,0.000080975486,0.9745515,0.012743377,0.00905546,0.0008733951,0.00005409704],"about_ca_topic_score_codex":0.0016062382,"about_ca_topic_score_gemma":0.000729341,"teacher_disagreement_score":0.0040428117,"about_ca_system_score_codex":0.0039570644,"about_ca_system_score_gemma":0.002085329,"threshold_uncertainty_score":0.028710663},"labels":[],"label_agreement":null},{"id":"W2540207648","doi":"10.1109/ths.2012.6459929","title":"Double Blind Comparisons Matching database records without database aggregation","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Matching (statistics); Secrecy; Anonymity; Protocol (science); Database; dBc; Subject (documents); Information retrieval; Computer security; World Wide Web; Statistics; Mathematics; Programming language","score_opus":0.06708979079374516,"score_gpt":0.31964622246470453,"score_spread":0.25255643167095937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540207648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033520926,0.00051997346,0.95440423,0.00056946144,0.0002775871,0.0008064682,0.0006341579,0.0020929778,0.0071741734],"genre_scores_gemma":[0.46851575,0.00042950702,0.518815,0.00059368537,0.00021964642,0.00092132,0.0010749248,0.00026961646,0.00916065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9719416,0.008030459,0.0032809828,0.0039147786,0.011254477,0.0015777505],"domain_scores_gemma":[0.9419199,0.014624978,0.0057033943,0.029864177,0.006806596,0.0010808451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011452903,0.0006781918,0.0019775454,0.0028136403,0.0020739026,0.0040071765,0.0028059538,0.001901435,0.0036345187],"category_scores_gemma":[0.03143035,0.0009251076,0.00077532337,0.004208242,0.002511559,0.009796329,0.008080014,0.0020832482,0.0023840351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005725736,0.0005260778,0.0065215733,0.0010074062,0.00031796796,0.0006185835,0.0014061118,0.018275358,0.07617042,0.33994263,0.0150901675,0.5343979],"study_design_scores_gemma":[0.0011133633,0.0021812716,0.0040351776,0.00035881743,0.0003520941,0.0027270706,0.0008152763,0.18167384,0.37520695,0.30214283,0.1288738,0.0005196021],"about_ca_topic_score_codex":0.0007502078,"about_ca_topic_score_gemma":0.00053204113,"teacher_disagreement_score":0.011452903,"about_ca_system_score_codex":0.0013049297,"about_ca_system_score_gemma":0.004622047,"threshold_uncertainty_score":0.060569465},"labels":[],"label_agreement":null},{"id":"W2548926719","doi":"10.5539/cis.v9n4p60","title":"Securing Healthcare Records in the Cloud Using Attribute-Based Encryption","year":2016,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Encryption; Cloud computing; Confidentiality; Computer security; Data sharing; Authentication (law); Health care; Information sharing; Internet privacy; World Wide Web","score_opus":0.027168069118732867,"score_gpt":0.27004527184450694,"score_spread":0.24287720272577407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548926719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06369325,0.0018437003,0.91776127,0.002685308,0.0002670232,0.00027216462,0.0003458831,0.0007317406,0.012399716],"genre_scores_gemma":[0.8044007,0.001958185,0.18687764,0.00027036358,0.00012169355,0.00012207506,0.00035858812,0.000030171175,0.0058606393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981359,0.00054277293,0.0002239573,0.00014685097,0.0007654239,0.00018505866],"domain_scores_gemma":[0.99820757,0.00030734052,0.0002710874,0.00087499747,0.00026686143,0.000072087394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013651255,0.00020152997,0.00042644155,0.00052023504,0.0007419572,0.0021091858,0.0008003249,0.00060232537,0.0011462031],"category_scores_gemma":[0.0027742127,0.00019534343,0.000582682,0.0010056185,0.00058110355,0.003399162,0.0015141179,0.0009929285,0.00085525337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007774738,0.0003671798,0.0061189863,0.00036705795,0.00013538987,0.0011846697,0.00090633106,0.060284413,0.07831708,0.45652735,0.016770003,0.37824398],"study_design_scores_gemma":[0.00010588782,0.000376666,0.003329707,0.00017367282,0.00008018065,0.002327767,0.00051591016,0.7234289,0.08198961,0.116698585,0.0708708,0.00010238912],"about_ca_topic_score_codex":0.0011674011,"about_ca_topic_score_gemma":0.0008560944,"teacher_disagreement_score":0.0021091858,"about_ca_system_score_codex":0.0008208933,"about_ca_system_score_gemma":0.0016879507,"threshold_uncertainty_score":0.007219553},"labels":[],"label_agreement":null},{"id":"W2549989740","doi":"10.1109/tcc.2016.2632110","title":"Game Theoretical Analysis on Acceptance of a Cloud Data Access Control System Based on Reputation","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Higher Education Discipline Innovation Project; Aalto-Yliopisto; National Natural Science Foundation of China","keywords":"Cloud computing; Reputation; Computer science; Cloud storage; Computer security; Reputation system; Collusion; Internet privacy; Business","score_opus":0.023887246882098912,"score_gpt":0.290081046527579,"score_spread":0.26619379964548007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549989740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28703037,0.00074905175,0.6345724,0.003870689,0.00016372943,0.0005077612,0.00023436257,0.00016505686,0.072706595],"genre_scores_gemma":[0.9870952,0.00016776613,0.008521506,0.00010708246,0.00003383213,0.000105430045,0.00002315275,0.000012777364,0.0039332565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730754,0.001328615,0.00009005111,0.0003042586,0.00035895786,0.00061063765],"domain_scores_gemma":[0.9910823,0.006084071,0.0008515967,0.00030388488,0.0010508829,0.00062725146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031271058,0.0009587905,0.0013129084,0.00096783944,0.0013551016,0.0026031444,0.0022535962,0.0024424363,0.006209611],"category_scores_gemma":[0.010383315,0.0005082214,0.001317454,0.0006138816,0.003030921,0.0034633148,0.0015117336,0.0026140832,0.0003553629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027290167,0.00017750432,0.003086698,0.0001459128,0.00009865462,0.00077419356,0.000653596,0.22502689,0.0043876152,0.7552465,0.0026282407,0.007501177],"study_design_scores_gemma":[0.000057466514,0.00013283115,0.0008746183,0.000016080226,0.000043573367,0.00012855296,0.00018127127,0.91679776,0.0002380052,0.080834284,0.00064729754,0.000048343405],"about_ca_topic_score_codex":0.010362756,"about_ca_topic_score_gemma":0.00491615,"teacher_disagreement_score":0.010362756,"about_ca_system_score_codex":0.004356165,"about_ca_system_score_gemma":0.0025577147,"threshold_uncertainty_score":0.031606317},"labels":[],"label_agreement":null},{"id":"W2550569116","doi":"10.1002/dac.3477","title":"Cryptanalysis of an identity‐based authenticated key exchange protocol","year":2017,"lang":"en","type":"preprint","venue":"International Journal of Communication Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Agence Nationale de la Recherche","keywords":"Computer security; Computer science; Authenticated Key Exchange; Key exchange; Oakley protocol; Adversary; Session key; Protocol (science); Key (lock); Cryptanalysis; Shared secret; Security association; Key distribution; Cryptography; Computer network; Public-key cryptography; Encryption; Cloud computing security; Network Access Control","score_opus":0.056177434084342066,"score_gpt":0.3834484004843725,"score_spread":0.32727096640003045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550569116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17945507,0.0006718208,0.7694576,0.0044275606,0.0005321823,0.00039775163,0.00023513286,0.0011347301,0.043688186],"genre_scores_gemma":[0.955886,0.00025792676,0.03806618,0.00019949977,0.0000702748,0.00011822732,0.00008288502,0.00005015182,0.005268864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963314,0.0011182594,0.0001838685,0.00033417775,0.0016229535,0.0004093744],"domain_scores_gemma":[0.99591476,0.0022478239,0.00036698408,0.0009624813,0.000413698,0.00009422253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00228551,0.00045811068,0.0006205199,0.0011328403,0.0013753984,0.0022248651,0.0010329954,0.0014748155,0.003812552],"category_scores_gemma":[0.0076583982,0.00038279514,0.0009658442,0.0009448383,0.0026631802,0.0031525416,0.0023414039,0.0026679083,0.00072318746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045327793,0.0000666493,0.0009653785,0.00010022884,0.00008511911,0.00101833,0.00049987575,0.045335397,0.00914189,0.91631275,0.0032914819,0.022729577],"study_design_scores_gemma":[0.0001427037,0.00012891283,0.0004261825,0.00007864014,0.00008708757,0.00094032194,0.000109297296,0.49201012,0.01881897,0.46758342,0.019604255,0.0000701438],"about_ca_topic_score_codex":0.0008241785,"about_ca_topic_score_gemma":0.00027620344,"teacher_disagreement_score":0.003812552,"about_ca_system_score_codex":0.0018486372,"about_ca_system_score_gemma":0.0014293691,"threshold_uncertainty_score":0.013412893},"labels":[],"label_agreement":null},{"id":"W2554001956","doi":"10.1109/mcc.2016.107","title":"Privacy-Preserving Access to Big Data in the Cloud","year":2016,"lang":"en","type":"article","venue":"IEEE Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science","keywords":"Cloud computing; Computer science; Cloud service provider; Computer security; Data access; Service provider; Heuristic; Cloud storage; Big data; Cloud computing security; Information privacy; Data security; Load balancing (electrical power); Database; Service (business); Distributed computing; Encryption; Operating system","score_opus":0.10439365865377577,"score_gpt":0.32562954972668245,"score_spread":0.2212358910729067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554001956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046120558,0.004010045,0.921968,0.006105458,0.00028654496,0.00018424634,0.00060325523,0.0012384374,0.01948347],"genre_scores_gemma":[0.8898572,0.0046437173,0.0967471,0.0011422356,0.0006926153,0.00019843175,0.00052634114,0.00015947572,0.0060329805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995754,0.0012642404,0.00026634338,0.00061054295,0.0015289033,0.0005759786],"domain_scores_gemma":[0.9898538,0.0038499623,0.000632458,0.0049047247,0.0005013567,0.00025760935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029927096,0.00058341917,0.0010254019,0.0008481701,0.001545565,0.0036191535,0.0017095944,0.0015298772,0.0020323677],"category_scores_gemma":[0.008976703,0.00052634586,0.000834122,0.0025610793,0.0023785478,0.008909025,0.004264264,0.0024100454,0.0009990261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092711096,0.00025465674,0.0038880082,0.00090834656,0.00018958823,0.0007884795,0.001030585,0.06261138,0.026797816,0.5912735,0.021916648,0.28941396],"study_design_scores_gemma":[0.00007473589,0.00015304334,0.001141732,0.00015328464,0.00006662811,0.0012450708,0.00049202243,0.32319158,0.030035155,0.59997034,0.043413956,0.00006249034],"about_ca_topic_score_codex":0.00052196404,"about_ca_topic_score_gemma":0.0006466413,"teacher_disagreement_score":0.0036191535,"about_ca_system_score_codex":0.0010890991,"about_ca_system_score_gemma":0.0019129871,"threshold_uncertainty_score":0.01582712},"labels":[],"label_agreement":null},{"id":"W2555689045","doi":"10.1007/978-3-319-49806-5_28","title":"Generic Construction of Certificateless Signcryption Scheme","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Signcryption; Random oracle; Computer science; Digital signature; Public-key cryptography; Encryption; Authentication (law); Scheme (mathematics); Cryptographic primitive; Bilinear interpolation; Cryptography; Confidentiality; Theoretical computer science; Computer security; Signature (topology); Computer network; Cryptographic protocol; Mathematics; Hash function","score_opus":0.022483752173570168,"score_gpt":0.23377559414349774,"score_spread":0.21129184196992756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555689045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04939665,0.0007429472,0.9005233,0.00065351365,0.00040143586,0.0005088104,0.00077004306,0.0030181184,0.04398515],"genre_scores_gemma":[0.7039423,0.0009043483,0.25929168,0.00034355285,0.00017660554,0.00039976634,0.00180258,0.00035588827,0.032783218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892634,0.00015261045,0.00007238346,0.00019752423,0.00043730068,0.00021381328],"domain_scores_gemma":[0.99944,0.0000625585,0.000037167334,0.00032876173,0.000079400255,0.000052089246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006113639,0.00062994857,0.0009475423,0.0008817486,0.0010650951,0.001589835,0.001366479,0.0011889872,0.008483646],"category_scores_gemma":[0.0010443626,0.00041484018,0.0010519625,0.001356823,0.001019788,0.0024298145,0.003213208,0.0017889098,0.0024142645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042157806,0.00018623304,0.00081240677,0.00053817773,0.000067350025,0.0005966827,0.00034129003,0.011151307,0.043536115,0.8008135,0.0107205855,0.13081478],"study_design_scores_gemma":[0.0005329313,0.00063323317,0.0017546685,0.00020827896,0.00028515828,0.0043578716,0.00016480825,0.13752936,0.141559,0.5470619,0.16567475,0.00023806946],"about_ca_topic_score_codex":0.0002526187,"about_ca_topic_score_gemma":0.00022865881,"teacher_disagreement_score":0.008483646,"about_ca_system_score_codex":0.0009294722,"about_ca_system_score_gemma":0.001068115,"threshold_uncertainty_score":0.028380632},"labels":[],"label_agreement":null},{"id":"W2562444902","doi":"10.1515/jmc-2016-0002","title":"Unconditionally secure signature schemes revisited","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Digital signature; Key (lock); Computer security; Public-key cryptography; Signature (topology); Robustness (evolution); Theoretical computer science; Public key infrastructure; Scheme (mathematics); Context (archaeology); Extension (predicate logic); Algorithm; Mathematics; Programming language; Encryption","score_opus":0.010639594115355061,"score_gpt":0.2518685554776877,"score_spread":0.24122896136233266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562444902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08762652,0.0027225527,0.841992,0.00974,0.00049416214,0.00025433593,0.00028467597,0.0010479912,0.05583774],"genre_scores_gemma":[0.92006713,0.0010666018,0.06562373,0.000808187,0.00044953628,0.00019724113,0.00017969939,0.00007825444,0.011529632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98543996,0.0052752146,0.0010333423,0.0016072417,0.005239042,0.0014051672],"domain_scores_gemma":[0.986497,0.0052156947,0.0015943451,0.004477852,0.0016652184,0.00055001385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007088712,0.0006938084,0.001052558,0.0012518448,0.0022653618,0.0051342086,0.0028532315,0.0035756358,0.0054049823],"category_scores_gemma":[0.011664879,0.0008232096,0.0016362944,0.0022297588,0.0075515816,0.014150704,0.0087930495,0.0076249684,0.001205975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025888385,0.0000119708675,0.00006296409,0.000029556246,0.0000064066517,0.000044579087,0.00018227483,0.0014457476,0.00065404206,0.99366874,0.00047519928,0.0033927232],"study_design_scores_gemma":[0.000051160445,0.00006343522,0.000085828586,0.00004941994,0.00001956371,0.00022931951,0.00010665681,0.023775335,0.0032647722,0.9533179,0.01900852,0.000028115297],"about_ca_topic_score_codex":0.00064886746,"about_ca_topic_score_gemma":0.0002691392,"teacher_disagreement_score":0.007088712,"about_ca_system_score_codex":0.0042330245,"about_ca_system_score_gemma":0.0024953505,"threshold_uncertainty_score":0.037489116},"labels":[],"label_agreement":null},{"id":"W2563685699","doi":"10.4103/2153-3539.197203","title":"Generating unique IDs from patient identification data using security models","year":2016,"lang":"en","type":"article","venue":"Journal of Pathology Informatics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Calgary Laboratory Services","funders":"","keywords":"Computer science; Encryption; Identification (biology); MD5; Hash function; Data sharing; Data security; Computer security; Software; Data science; Medicine","score_opus":0.04790604070085486,"score_gpt":0.28094781761643883,"score_spread":0.23304177691558398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563685699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031645354,0.00016483535,0.96221745,0.0004709863,0.00008548219,0.00027299311,0.0003922656,0.0022376776,0.002512878],"genre_scores_gemma":[0.5681901,0.00040121702,0.42534027,0.0001753764,0.00006298941,0.0003981933,0.0016207581,0.0001716245,0.003639455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965166,0.0012369831,0.00029993372,0.00040443486,0.0013285156,0.00021358448],"domain_scores_gemma":[0.98905236,0.005252008,0.0010874906,0.0030781424,0.0013463757,0.00018355282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044240705,0.0007013455,0.00056516926,0.0020763979,0.0006144948,0.0018718543,0.0010878101,0.0010509498,0.0027574203],"category_scores_gemma":[0.017327989,0.0004222673,0.0012156559,0.0011890886,0.0008919384,0.0047884746,0.002600771,0.001131031,0.0015900044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011244573,0.00042341516,0.015340856,0.00040854528,0.00018409206,0.0007744942,0.00096439035,0.37128222,0.01375386,0.14111257,0.00817855,0.44645262],"study_design_scores_gemma":[0.00004227159,0.00012948275,0.0006745334,0.000071236136,0.000035967038,0.00042791278,0.000111480906,0.90725535,0.017573962,0.066900685,0.006742483,0.00003468416],"about_ca_topic_score_codex":0.00092614745,"about_ca_topic_score_gemma":0.00074401585,"teacher_disagreement_score":0.0044240705,"about_ca_system_score_codex":0.0013072559,"about_ca_system_score_gemma":0.0021110724,"threshold_uncertainty_score":0.023396969},"labels":[],"label_agreement":null},{"id":"W2565821653","doi":"10.1109/focs.2016.51","title":"Exponential Lower Bounds for Monotone Span Programs","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Monotone polygon; Mathematics; Upper and lower bounds; Discrete mathematics; Function (biology); Exponential function; Combinatorics; Polynomial; Rank (graph theory); Monotonic function; Bernstein's theorem on monotone functions; Applied mathematics; Strongly monotone; Mathematical analysis","score_opus":0.018517350682269344,"score_gpt":0.24011443826557968,"score_spread":0.22159708758331034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565821653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098784186,0.002768531,0.81837004,0.00737741,0.0002052966,0.00023851551,0.0014552954,0.0019636513,0.06883712],"genre_scores_gemma":[0.80086863,0.0045433384,0.16388457,0.002371031,0.0010156792,0.00086476805,0.0019113051,0.0015050601,0.02303559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922599,0.0013389759,0.00024766297,0.0014170661,0.003066607,0.0016698043],"domain_scores_gemma":[0.9542636,0.035937835,0.0017961176,0.00442361,0.0025313694,0.0010475212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045134397,0.0022978014,0.0014123727,0.0026786013,0.0015362618,0.004449412,0.004512157,0.0019660222,0.014634938],"category_scores_gemma":[0.03305341,0.0010316328,0.0020438246,0.0029697064,0.004866565,0.022159139,0.0059989565,0.010638122,0.0017977733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037830303,0.00030564255,0.0020031747,0.00046128454,0.000057468562,0.00017603987,0.00036065516,0.045878194,0.0086229155,0.8893304,0.0071003297,0.045325596],"study_design_scores_gemma":[0.000040929222,0.00009648717,0.00046655216,0.00006454866,0.000042849097,0.000171306,0.00006652281,0.2134592,0.0069273,0.77299374,0.0056316126,0.000038962193],"about_ca_topic_score_codex":0.0012303488,"about_ca_topic_score_gemma":0.0016623377,"teacher_disagreement_score":0.014634938,"about_ca_system_score_codex":0.005165905,"about_ca_system_score_gemma":0.0022031404,"threshold_uncertainty_score":0.04895872},"labels":[],"label_agreement":null},{"id":"W2573545511","doi":"10.1112/s0024609300247371","title":"ELLIPTIC CURVES IN CRYPTOGRAPHY (London Mathematical Society Lecture Note Series 265)","year":2000,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Series (stratigraphy); Cryptography; Elliptic curve; Mathematics education; Mathematical economics; Calculus (dental); Pure mathematics; Algorithm; Medicine","score_opus":0.007469060712617936,"score_gpt":0.2213804906595581,"score_spread":0.21391142994694015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573545511","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001854995,0.61890846,0.034225587,0.017577067,0.015899073,0.00017463231,0.0027056006,0.0016835197,0.30697098],"genre_scores_gemma":[0.026844002,0.4253015,0.029175265,0.0020305652,0.015164057,0.00028608195,0.003325287,0.0009628944,0.49691036],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990416,0.00014019823,0.000080471145,0.00017484464,0.00046558052,0.000097256685],"domain_scores_gemma":[0.99895895,0.00032159133,0.0001278224,0.00017730445,0.00027814455,0.00013620825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017520481,0.0018316227,0.0017471361,0.0031954448,0.0007891497,0.0040604635,0.001043639,0.0011990886,0.0746297],"category_scores_gemma":[0.0031160852,0.0009489129,0.0006463662,0.0044222353,0.0016132701,0.006613162,0.0026322487,0.003975737,0.06374235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046425364,0.000024920431,0.00015151192,0.00050336187,0.000027371929,0.00006380913,0.00014083125,0.0006781874,0.00046494062,0.048242297,0.7226098,0.22704653],"study_design_scores_gemma":[0.000016649203,0.000023707133,0.0006533631,0.00043845718,0.000009483608,0.00031565104,0.000054202446,0.000540183,0.00023333413,0.051152185,0.9465453,0.000017654362],"about_ca_topic_score_codex":0.001994258,"about_ca_topic_score_gemma":0.002057029,"teacher_disagreement_score":0.0746297,"about_ca_system_score_codex":0.0021820404,"about_ca_system_score_gemma":0.0016159844,"threshold_uncertainty_score":0.2496612},"labels":[],"label_agreement":null},{"id":"W2574337155","doi":"10.1109/uic-atc-scalcom-cbdcom-iop-smartworld.2016.0150","title":"Scanning for Viruses on Encrypted Cloud Storage","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Malware; Encryption; Homomorphic encryption; Scalability; Computer security; Cloud storage; Service provider; Service (business); Operating system; Business","score_opus":0.031551141981932165,"score_gpt":0.273770841398912,"score_spread":0.24221969941697985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574337155","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88261884,0.0009165077,0.107697226,0.0005077642,0.000068513466,0.00012946353,0.00014985012,0.0013808466,0.0065309643],"genre_scores_gemma":[0.97442573,0.00020644334,0.02358289,0.000057729496,0.000015822725,0.000014569768,0.000055217257,0.00003803255,0.0016036271],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877685,0.00019506874,0.000091061665,0.0001370292,0.0005833365,0.00021662949],"domain_scores_gemma":[0.99656975,0.00089213485,0.00051490084,0.0012701227,0.00064319227,0.0001098619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055640057,0.0002788531,0.0007051095,0.00069416687,0.0008062553,0.0011980833,0.0006844505,0.0005578763,0.0011405629],"category_scores_gemma":[0.0031986146,0.00022629387,0.00032243587,0.00071916176,0.00085405255,0.0029392107,0.0012486551,0.00034202728,0.00052280206],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026834738,0.00039911352,0.025426932,0.00039218608,0.00016602497,0.0025589776,0.0014697072,0.06760018,0.5062453,0.050213296,0.007886852,0.33495793],"study_design_scores_gemma":[0.00004439765,0.00030576898,0.0044812793,0.000061332306,0.0000667573,0.0024976947,0.00057006493,0.40347132,0.5661984,0.013639811,0.008608142,0.000054941807],"about_ca_topic_score_codex":0.001326199,"about_ca_topic_score_gemma":0.0014178461,"teacher_disagreement_score":0.001326199,"about_ca_system_score_codex":0.0011073959,"about_ca_system_score_gemma":0.0008489006,"threshold_uncertainty_score":0.008034766},"labels":[],"label_agreement":null},{"id":"W2578217697","doi":"10.1145/2899000","title":"Securely Reinforcing Synchronization for Embedded Online Contests","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Eavesdropping; Computer security; CONTEST; Competitor analysis; Synchronization (alternating current); Asynchronous communication; Security analysis; Anonymity; Distributed computing; Computer network","score_opus":0.03488650103070727,"score_gpt":0.3068612307702629,"score_spread":0.2719747297395556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578217697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14111175,0.00021833387,0.84783006,0.00029366,0.0001020195,0.00021779774,0.0001177048,0.0009153341,0.009193246],"genre_scores_gemma":[0.9628721,0.00007799448,0.03385634,0.00006390803,0.000048653314,0.00009964864,0.000079088044,0.00007504062,0.0028272027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99679667,0.0008700854,0.00025244395,0.0007604846,0.00076855306,0.0005517839],"domain_scores_gemma":[0.99192226,0.003232153,0.0013619479,0.0021684247,0.00071468396,0.0006005022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024614527,0.00064357,0.0009063183,0.0005034253,0.0013858018,0.0019636352,0.0011929094,0.00069586217,0.004816031],"category_scores_gemma":[0.009828742,0.0003513887,0.0006327104,0.0005547556,0.0018005094,0.0037200858,0.0038633323,0.0015175231,0.00089363597],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018463255,0.00029995883,0.0035627193,0.00033149548,0.00010624524,0.0010197297,0.0017509491,0.15193447,0.0603074,0.6793086,0.0037391696,0.095793],"study_design_scores_gemma":[0.0001790628,0.0004924755,0.00082028314,0.000034497734,0.000068691064,0.00043159563,0.00033109565,0.76301694,0.02971821,0.1959523,0.00886892,0.00008592854],"about_ca_topic_score_codex":0.00060785806,"about_ca_topic_score_gemma":0.00069092,"teacher_disagreement_score":0.004816031,"about_ca_system_score_codex":0.0009796652,"about_ca_system_score_gemma":0.0013979605,"threshold_uncertainty_score":0.016111195},"labels":[],"label_agreement":null},{"id":"W2583896214","doi":"","title":"On a variant of multilinear modular hashing with applications to authentication and secrecy codes","year":2016,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Universal hashing; Multilinear map; Computer science; Theoretical computer science; Secrecy; Hash function; Universality (dynamical systems); Authentication (law); Modular design; Cryptography; Scheme (mathematics); Message authentication code; Binary code; Algorithm; Binary number; Double hashing; Mathematics; Computer security; Arithmetic; Hash table; Programming language","score_opus":0.006411805616823589,"score_gpt":0.24045548908951958,"score_spread":0.234043683472696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583896214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053021885,0.0014086138,0.9256471,0.0011243549,0.0002798212,0.00014141011,0.00012476197,0.00019726071,0.018054793],"genre_scores_gemma":[0.72141176,0.0018981865,0.26542208,0.00069245877,0.0008661373,0.00023977163,0.00018860822,0.00010638198,0.009174611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979498,0.00075029745,0.00014055813,0.00038099525,0.00052635785,0.00025199016],"domain_scores_gemma":[0.99615896,0.0018295345,0.00038086576,0.0009892497,0.00039525898,0.00024619242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022365905,0.00062860514,0.0008004458,0.0013090245,0.0012484405,0.0013461174,0.0011043851,0.0011184308,0.0024626157],"category_scores_gemma":[0.007865245,0.00032455652,0.000890354,0.0022361395,0.004942737,0.004116944,0.0060844244,0.0024707303,0.00058047747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043586188,0.000017108294,0.00024253641,0.000039743925,0.000005411587,0.00007930291,0.00015812683,0.007043819,0.0018030662,0.97484654,0.00056720845,0.015153605],"study_design_scores_gemma":[0.000029171433,0.00020688988,0.00026306097,0.000047186906,0.000015731106,0.0004232537,0.00009335037,0.091072954,0.003946338,0.89281714,0.01102177,0.00006307125],"about_ca_topic_score_codex":0.000638942,"about_ca_topic_score_gemma":0.00037869133,"teacher_disagreement_score":0.0024626157,"about_ca_system_score_codex":0.0009759408,"about_ca_system_score_gemma":0.00081856863,"threshold_uncertainty_score":0.011828363},"labels":[],"label_agreement":null},{"id":"W2585533418","doi":"10.1109/glocom.2016.7841770","title":"Efficient and Privacy-Preserving Smart Grid Downlink Communication Using Identity Based Signcryption","year":2016,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Signcryption; Computer science; Ciphertext; Computer network; Telecommunications link; Encryption; Smart grid; Scheme (mathematics); Overhead (engineering); Authentication (law); Public-key cryptography; Distributed computing; Computer security; Engineering; Mathematics","score_opus":0.025078935781667477,"score_gpt":0.2662361606044261,"score_spread":0.24115722482275864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585533418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065227,0.00047319132,0.92462647,0.0004132886,0.0001118849,0.00013191074,0.00010268742,0.0006940983,0.008219422],"genre_scores_gemma":[0.8916678,0.00041732818,0.10327799,0.00016724445,0.000064663225,0.00007736045,0.00015929474,0.00002916557,0.004139261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999131,0.00019932246,0.000070601585,0.00010231894,0.00037117078,0.00012553642],"domain_scores_gemma":[0.99911004,0.00016077145,0.00015327962,0.0003808141,0.00014647037,0.000048554262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054437487,0.00033408043,0.00066490314,0.00044378286,0.0006583532,0.00093990355,0.0005633657,0.00063447794,0.0013556494],"category_scores_gemma":[0.0012706189,0.00013576265,0.0002950263,0.00066855515,0.0007297463,0.0018128115,0.0014775933,0.00078219594,0.0005810997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013648698,0.00028137918,0.004030921,0.00043826227,0.00011378867,0.0013564172,0.00084456196,0.076699145,0.23093611,0.2566698,0.0064946506,0.42077014],"study_design_scores_gemma":[0.00022012094,0.0007474952,0.0013822176,0.00007703757,0.00010661603,0.0025231997,0.0003693132,0.63964725,0.26511058,0.041403025,0.04828169,0.00013151483],"about_ca_topic_score_codex":0.0005127259,"about_ca_topic_score_gemma":0.0004258371,"teacher_disagreement_score":0.0013556494,"about_ca_system_score_codex":0.00045693835,"about_ca_system_score_gemma":0.0006880587,"threshold_uncertainty_score":0.004535079},"labels":[],"label_agreement":null},{"id":"W2586842009","doi":"10.1007/s12652-017-0448-x","title":"Refined game-theoretic approach to improve authenticity of outsourced databases","year":2017,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University; Concordia University","funders":"","keywords":"Computer science; Stackelberg competition; Overhead (engineering); Cloud computing; Database","score_opus":0.05027293447581185,"score_gpt":0.3042806189884524,"score_spread":0.25400768451264055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586842009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025816418,0.00014493117,0.9690114,0.00047216174,0.000082686856,0.0001379551,0.00007451551,0.00019214585,0.0040677087],"genre_scores_gemma":[0.8190666,0.0002029323,0.17587885,0.00022516414,0.00011776011,0.00014615926,0.00010419108,0.00011045598,0.0041478276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99215746,0.003737343,0.000373028,0.0009777944,0.0018592575,0.000895041],"domain_scores_gemma":[0.9833708,0.008651834,0.0005841943,0.0040957485,0.0025564202,0.0007411655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007256259,0.00100089,0.0018938115,0.0010889828,0.0014126342,0.0032826352,0.004852151,0.0016624382,0.0053625843],"category_scores_gemma":[0.02540115,0.000670126,0.0013682102,0.0011628701,0.0026063009,0.008145802,0.0057707345,0.004535944,0.00066832994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004629108,0.00029888537,0.00062156306,0.00020093274,0.00009413362,0.0001842523,0.0005596741,0.2472576,0.005537193,0.70202523,0.0033842984,0.03937343],"study_design_scores_gemma":[0.00004891225,0.00008882774,0.00006807685,0.000018888184,0.000031133717,0.000055550674,0.00006952542,0.76159406,0.0015278128,0.23526385,0.0012117206,0.000021693835],"about_ca_topic_score_codex":0.0019115,"about_ca_topic_score_gemma":0.0018130591,"teacher_disagreement_score":0.007256259,"about_ca_system_score_codex":0.0023864622,"about_ca_system_score_gemma":0.004521756,"threshold_uncertainty_score":0.0383752},"labels":[],"label_agreement":null},{"id":"W2588959124","doi":"10.2196/medinform.5054","title":"Checking Questionable Entry of Personally Identifiable Information Encrypted by One-Way Hash Transformation","year":2017,"lang":"en","type":"article","venue":"JMIR Medical Informatics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Neurological Disorders and Stroke; National Social Science Fund of China; Oak Ridge Institute for Science and Education; National Institutes of Health; China Scholarship Council; U.S. Department of Energy","keywords":"Hash function; Computer science; Identifier; Encryption; Cryptographic hash function; Computer security; Programming language","score_opus":0.013280401858254697,"score_gpt":0.2694555665000675,"score_spread":0.25617516464181284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588959124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38105407,0.00014383173,0.61463743,0.00014692055,0.00006286887,0.00020809873,0.00033909734,0.0019268953,0.0014807838],"genre_scores_gemma":[0.8153761,0.000063933825,0.18303141,0.00004916523,0.000014875136,0.00009773413,0.000458368,0.000055714852,0.00085274706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947023,0.0013481923,0.0005137809,0.00088904065,0.002206579,0.0003401068],"domain_scores_gemma":[0.9801011,0.009429297,0.0026821082,0.004028233,0.0034569358,0.00030224377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034476304,0.00052991265,0.0008609921,0.0018181967,0.0009311026,0.001051465,0.0015560552,0.0007987383,0.0013851039],"category_scores_gemma":[0.020344827,0.00028912973,0.000791216,0.0012663074,0.0011560742,0.0018791266,0.0014247769,0.0006411667,0.00071777694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002573036,0.0006974975,0.1499955,0.0006311961,0.00038460083,0.0018736647,0.00242801,0.13728982,0.1025959,0.026207574,0.0047080615,0.5706152],"study_design_scores_gemma":[0.00007973931,0.0004979759,0.012231085,0.000041981053,0.00009135986,0.0016127665,0.00040420747,0.86845946,0.10265172,0.011478087,0.002356683,0.0000948912],"about_ca_topic_score_codex":0.0016366036,"about_ca_topic_score_gemma":0.001103497,"teacher_disagreement_score":0.0034476304,"about_ca_system_score_codex":0.00075588515,"about_ca_system_score_gemma":0.0017108887,"threshold_uncertainty_score":0.01823306},"labels":[],"label_agreement":null},{"id":"W2592139723","doi":"10.1016/j.jbi.2018.03.003","title":"Secure count query on encrypted genomic data","year":2018,"lang":"en","type":"article","venue":"Journal of Biomedical Informatics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Encryption; Outsourcing; Scalability; Overhead (engineering); Data mining; Trusted third party; Confidentiality; Secure multi-party computation; Data sharing; Information privacy; Computer security; Database; Cryptography","score_opus":0.029275237650364452,"score_gpt":0.28584815084421333,"score_spread":0.2565729131938489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592139723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4142588,0.0025210376,0.54513526,0.0112928515,0.0006954312,0.0005283253,0.0072198017,0.0055633355,0.012785163],"genre_scores_gemma":[0.950142,0.00042716178,0.040737078,0.00074141397,0.0002546247,0.00016283177,0.0024467586,0.00012325133,0.004964863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945884,0.0010446426,0.00046341235,0.0007676909,0.0023070097,0.0008288516],"domain_scores_gemma":[0.990781,0.004312445,0.00077892235,0.0028629426,0.0009989231,0.0002656562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002279468,0.0005474276,0.0016950187,0.0011626928,0.001036032,0.0032314307,0.0013016893,0.0013215886,0.0037876414],"category_scores_gemma":[0.011189073,0.00038952622,0.00059230224,0.0019738972,0.0013843686,0.0056113615,0.0039532287,0.0014143357,0.0017709825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010842782,0.0007489257,0.0142569905,0.0010345086,0.0003745541,0.0030795368,0.0015133233,0.11881687,0.081648454,0.39449045,0.06141954,0.31177402],"study_design_scores_gemma":[0.00049424614,0.00038928355,0.0021626505,0.00007506722,0.00013252205,0.0017196983,0.00057472003,0.6307649,0.057286095,0.29342753,0.012898888,0.00007445335],"about_ca_topic_score_codex":0.0014666924,"about_ca_topic_score_gemma":0.0012907456,"teacher_disagreement_score":0.0037876414,"about_ca_system_score_codex":0.0024071443,"about_ca_system_score_gemma":0.0024868844,"threshold_uncertainty_score":0.017465174},"labels":[],"label_agreement":null},{"id":"W2598288910","doi":"10.1007/978-3-319-49742-6_13","title":"RNS Approach in Lattice-Based Cryptography","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Lattice-based cryptography; Post-quantum cryptography; Cryptosystem; Homomorphic encryption; Discrete logarithm; Cryptography; Learning with errors; Key exchange; Computer science; Theoretical computer science; Quantum cryptography; Encryption; Mathematical proof; Lattice (music); Quantum computer; Neural cryptography; Mathematics; Quantum; Public-key cryptography; Algorithm; Computer security; Quantum information; Quantum mechanics; Physics","score_opus":0.030176508541835366,"score_gpt":0.24319572187400734,"score_spread":0.21301921333217197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598288910","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054828734,0.013032455,0.60340154,0.0037285439,0.0034169422,0.0000975103,0.00019259319,0.001017119,0.36963052],"genre_scores_gemma":[0.2765711,0.020055987,0.41300756,0.0020613805,0.0046537137,0.0003532485,0.0004721401,0.0008068326,0.28201807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986627,0.00041545634,0.000063937194,0.00010397092,0.0006822948,0.000071682305],"domain_scores_gemma":[0.9992046,0.00036174306,0.00004157263,0.00018760237,0.00016349214,0.000040985058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011022772,0.00089990423,0.00095619366,0.0013291631,0.00096196687,0.0031920625,0.0012459779,0.0012656618,0.012897269],"category_scores_gemma":[0.002558105,0.0004159894,0.000799317,0.0018138083,0.0033194008,0.0038820198,0.0013834777,0.0036178983,0.0069907946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009679052,0.0000104126275,0.0000114928325,0.000063015694,0.0000036585275,0.00000970409,0.000029425271,0.0025463703,0.00029517472,0.9655485,0.00485834,0.026614325],"study_design_scores_gemma":[0.0000064868455,0.000012707752,0.000013981847,0.000048836682,0.0000032919634,0.00005240921,0.000013350544,0.013112747,0.00048632672,0.9449083,0.041330792,0.000010778246],"about_ca_topic_score_codex":0.0007418943,"about_ca_topic_score_gemma":0.0006333004,"teacher_disagreement_score":0.012897269,"about_ca_system_score_codex":0.0022535352,"about_ca_system_score_gemma":0.0011505865,"threshold_uncertainty_score":0.043145716},"labels":[],"label_agreement":null},{"id":"W2604978221","doi":"10.1109/tc.2017.2690420","title":"Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação para a Ciência e a Tecnologia; Agence Nationale de la Recherche","keywords":"Computer science; SIMD; Parallel computing; Cryptography; Cryptosystem; Encryption; Arithmetic; Algorithm; Mathematics","score_opus":0.01975803306219012,"score_gpt":0.2602411233823112,"score_spread":0.24048309032012108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604978221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16383895,0.0008485292,0.80407166,0.00048099164,0.00023485362,0.000096282216,0.00013340171,0.0016236242,0.028671587],"genre_scores_gemma":[0.6345321,0.0004187688,0.3596027,0.00010550917,0.0001009973,0.00007656026,0.00016826874,0.00015474613,0.004840405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991667,0.00019055165,0.000045222492,0.000080525446,0.00041660573,0.00010027481],"domain_scores_gemma":[0.9988599,0.00036913535,0.000094694406,0.00041658388,0.00020006068,0.00005967923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070818514,0.0005138818,0.0004065603,0.0004982482,0.00042540312,0.0008396528,0.0006783162,0.00031681304,0.0026897436],"category_scores_gemma":[0.002729889,0.00017738128,0.0004345866,0.0004878355,0.0011368765,0.0016398653,0.0010407497,0.0012841871,0.00115617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010076701,0.00023193438,0.0015018865,0.0002845498,0.000038047536,0.00038899417,0.00028419928,0.16338314,0.092916556,0.47829017,0.006098405,0.2555744],"study_design_scores_gemma":[0.0001249008,0.00052113424,0.00050911127,0.00004681887,0.000022760058,0.00048937596,0.000078039084,0.7716258,0.100645855,0.10389916,0.021959692,0.00007740106],"about_ca_topic_score_codex":0.0005103776,"about_ca_topic_score_gemma":0.00068039354,"teacher_disagreement_score":0.0026897436,"about_ca_system_score_codex":0.00051866943,"about_ca_system_score_gemma":0.0007292805,"threshold_uncertainty_score":0.008998096},"labels":[],"label_agreement":null},{"id":"W2607608011","doi":"10.1109/iciht.2017.7899007","title":"Privacy-preserving querying mechanism on privately encrypted personal health records","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Encryption; Internet privacy; Computer science; Mechanism (biology); Computer security; Information privacy; Cryptography; Personally identifiable information","score_opus":0.04706662028263485,"score_gpt":0.304843204477797,"score_spread":0.25777658419516214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607608011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10090462,0.0004892557,0.8838556,0.0027618902,0.00015348775,0.0006666755,0.00063685706,0.0016346275,0.008896992],"genre_scores_gemma":[0.8817707,0.00039933203,0.10847202,0.0006440478,0.0001826442,0.0003668582,0.0004942547,0.0001282374,0.007541902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990914,0.0025843396,0.0010209993,0.0012350712,0.0034365428,0.00080912095],"domain_scores_gemma":[0.979189,0.0075885714,0.0021834262,0.008855987,0.0017693158,0.00041371625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008658275,0.0004490581,0.0012933336,0.0014434699,0.0015487493,0.0032804485,0.0026499524,0.0019176241,0.0027709946],"category_scores_gemma":[0.016721293,0.0004994541,0.0010689212,0.0022504989,0.002680398,0.009207255,0.0054084724,0.0015559789,0.000899785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025789696,0.0006672394,0.006852443,0.0005128945,0.00033459679,0.0025586192,0.004028161,0.036785327,0.104966335,0.6754386,0.010970324,0.15430643],"study_design_scores_gemma":[0.00080678944,0.0009513795,0.0028974484,0.0001682485,0.00031401168,0.004901431,0.0010874077,0.40218616,0.22982995,0.31443334,0.04213815,0.00028575852],"about_ca_topic_score_codex":0.0005235463,"about_ca_topic_score_gemma":0.0002880399,"teacher_disagreement_score":0.008658275,"about_ca_system_score_codex":0.0013958293,"about_ca_system_score_gemma":0.002123715,"threshold_uncertainty_score":0.045789897},"labels":[],"label_agreement":null},{"id":"W2611409414","doi":"10.1007/978-3-319-59041-7_3","title":"Privacy Preserving Discovery of Nearby-Friends","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Internet privacy; Computer science; World Wide Web","score_opus":0.015988520483272914,"score_gpt":0.24749179818276454,"score_spread":0.23150327769949164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611409414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15501796,0.002622248,0.81160986,0.003620749,0.0003883989,0.00025189764,0.0022473072,0.001975926,0.022265693],"genre_scores_gemma":[0.88502204,0.00111316,0.095717624,0.00037080894,0.00036972854,0.00009317273,0.0018044763,0.00018286316,0.015326183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557304,0.0008700542,0.00020945832,0.0010723422,0.0017295234,0.00054553594],"domain_scores_gemma":[0.98729545,0.0046665315,0.0007545558,0.0060262633,0.0008100674,0.00044711583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022352214,0.0006908453,0.0022151773,0.0015091692,0.0023407114,0.004167691,0.003944449,0.0024832936,0.0030618869],"category_scores_gemma":[0.015779976,0.00081793865,0.001269289,0.0029438944,0.0015914539,0.008407621,0.0061938083,0.0024632365,0.0016560567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023378113,0.0005211149,0.009396364,0.0006659875,0.0003544852,0.001871815,0.0019718176,0.07130787,0.02010806,0.51916605,0.03239793,0.33990064],"study_design_scores_gemma":[0.00011529543,0.00023163944,0.0014963207,0.00008331587,0.00019979425,0.0031940385,0.00055105495,0.5192973,0.02477128,0.42592627,0.024053805,0.000079856094],"about_ca_topic_score_codex":0.0009074723,"about_ca_topic_score_gemma":0.0012736958,"teacher_disagreement_score":0.004167691,"about_ca_system_score_codex":0.001066127,"about_ca_system_score_gemma":0.0016146078,"threshold_uncertainty_score":0.011821091},"labels":[],"label_agreement":null},{"id":"W2613168268","doi":"","title":"GenoDroid: Are Privacy-Preserving Genomic Tests Ready for Prime Time?","year":2012,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Homomorphic encryption; Computer science; Usability; Cryptography; Android (operating system); Oblivious transfer; Personal genomics; Encryption; Confidentiality; Genomics; Computer security; Genome; Human–computer interaction; Biology","score_opus":0.01789869734479337,"score_gpt":0.21882682379198395,"score_spread":0.20092812644719057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613168268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20373851,0.0051002875,0.7376674,0.015717864,0.0004787431,0.0004334709,0.0010221848,0.010225295,0.025616335],"genre_scores_gemma":[0.76147395,0.0013319437,0.22712865,0.0026704357,0.000121463105,0.00021388796,0.0007215556,0.00066370575,0.0056744055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920769,0.0035789637,0.00030316287,0.00095349917,0.0026186602,0.00046897147],"domain_scores_gemma":[0.98358315,0.0087837605,0.0009659197,0.005201814,0.0009710361,0.00049421634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075222524,0.00043859545,0.00067158433,0.000508017,0.0005244431,0.0024982176,0.0017578715,0.0015662436,0.0041483096],"category_scores_gemma":[0.027991312,0.00040671497,0.00041963972,0.00080852566,0.004677374,0.0075263437,0.003535614,0.0017136373,0.0010028783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029096215,0.0001567132,0.012120071,0.0010389397,0.00010724738,0.0008241553,0.003050447,0.0056175883,0.026438924,0.28253236,0.02087792,0.64432603],"study_design_scores_gemma":[0.00052435894,0.002281643,0.008820888,0.00063166063,0.00020396341,0.010629945,0.00271462,0.06693862,0.12460283,0.5305233,0.25184017,0.00028809614],"about_ca_topic_score_codex":0.0006352203,"about_ca_topic_score_gemma":0.00037480023,"teacher_disagreement_score":0.0075222524,"about_ca_system_score_codex":0.0007821103,"about_ca_system_score_gemma":0.00101982,"threshold_uncertainty_score":0.039781988},"labels":[],"label_agreement":null},{"id":"W2616664865","doi":"10.1109/icde.2017.117","title":"Secure Skyline Queries on Cloud Platform","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Institute of General Medical Sciences","keywords":"Computer science; Encryption; Cloud computing; Skyline; Scalability; Outsourcing; Database; Computer network; Data mining; Operating system","score_opus":0.025797988259749566,"score_gpt":0.2730244330343136,"score_spread":0.24722644477456404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616664865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20274168,0.00040157003,0.78635126,0.0011446552,0.00005887863,0.00040917002,0.0006737422,0.001541776,0.00667732],"genre_scores_gemma":[0.9220062,0.00021434337,0.07379686,0.00015710377,0.000046481346,0.00020032363,0.00043180946,0.00010853116,0.0030383358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960051,0.0009800093,0.00034128444,0.00053885893,0.0014052868,0.00072948507],"domain_scores_gemma":[0.9953236,0.001531512,0.0006113905,0.0015740315,0.0007488488,0.00021059926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027591584,0.00062947924,0.0010218945,0.00058076193,0.0013118003,0.002441371,0.0011457872,0.0011161892,0.0027318164],"category_scores_gemma":[0.0050779744,0.00029455248,0.0007313448,0.00093403074,0.0013307154,0.006200763,0.0032905797,0.0012258347,0.0008658849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037926373,0.00049081753,0.0047339657,0.00048514866,0.00023216462,0.0017084122,0.0018293122,0.31039575,0.13488722,0.3801385,0.014874636,0.14643148],"study_design_scores_gemma":[0.0002113212,0.0003509331,0.00075249467,0.000029047089,0.00003692865,0.00042399453,0.00055803795,0.82848233,0.046333056,0.11360675,0.009158768,0.000056403416],"about_ca_topic_score_codex":0.001974133,"about_ca_topic_score_gemma":0.0014490858,"teacher_disagreement_score":0.0027591584,"about_ca_system_score_codex":0.0014273797,"about_ca_system_score_gemma":0.0018855975,"threshold_uncertainty_score":0.014591992},"labels":[],"label_agreement":null},{"id":"W2618912166","doi":"10.1142/s0219749915500288","title":"Classical cryptographic protocols in a quantum world","year":2015,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum cryptography; Cryptography; Quantum; Cryptographic protocol; Function (biology); Quantum computer; Cryptographic primitive; Learning with errors","score_opus":0.04261534544974495,"score_gpt":0.32082280022915743,"score_spread":0.2782074547794125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618912166","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07129924,0.0018829992,0.8240797,0.012973318,0.00040402124,0.0002058075,0.00030173143,0.00030950984,0.08854382],"genre_scores_gemma":[0.80367815,0.002102025,0.17699619,0.0016643475,0.00071524276,0.00046784978,0.00023816802,0.00014159962,0.013996383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954194,0.0017279146,0.00024101566,0.00070225494,0.0014838952,0.00042556095],"domain_scores_gemma":[0.99446905,0.003075779,0.00040277798,0.0013834703,0.00050313404,0.00016570854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046064006,0.00056962954,0.0008537421,0.0010257884,0.0023400278,0.0040743765,0.0014270874,0.0026456509,0.0046283426],"category_scores_gemma":[0.007977493,0.0006772591,0.0011436598,0.001198388,0.009512107,0.015002679,0.0042781965,0.00494866,0.0011107716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007077039,0.0000050340464,0.000015312973,0.000016362455,0.0000023993553,0.000015054161,0.000059856913,0.00079412974,0.0002386619,0.9976273,0.00021551685,0.0010032926],"study_design_scores_gemma":[0.0000142668105,0.000011193226,0.00002730455,0.000012935351,0.000004455424,0.000020366511,0.000027403052,0.0065524266,0.0006502235,0.9890154,0.0036550283,0.00000900211],"about_ca_topic_score_codex":0.0006769858,"about_ca_topic_score_gemma":0.00030755447,"teacher_disagreement_score":0.0046283426,"about_ca_system_score_codex":0.0015633435,"about_ca_system_score_gemma":0.0016895634,"threshold_uncertainty_score":0.024361253},"labels":[],"label_agreement":null},{"id":"W2620198726","doi":"10.1109/tcc.2017.2709316","title":"Fast Phrase Search for Encrypted Cloud Storage","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Bloom filter; Encryption; Cloud computing; Cloud storage; Phrase search; Server; Phrase; Scheme (mathematics); Database; Computer security; Computer network; Information retrieval; Search engine; Web search query; Operating system; Search analytics; Artificial intelligence","score_opus":0.03585809685277283,"score_gpt":0.2986927561000363,"score_spread":0.26283465924726346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620198726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13533832,0.0015252378,0.85110676,0.0007461175,0.00021029763,0.00039328207,0.0007357152,0.0040057926,0.0059384927],"genre_scores_gemma":[0.5008398,0.0005894374,0.48945767,0.00028944682,0.000106244894,0.0001734664,0.00070015586,0.00019402227,0.0076496536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851483,0.00025777594,0.000158067,0.00016060859,0.0006766983,0.00023203876],"domain_scores_gemma":[0.9966899,0.0012989005,0.00033171484,0.0007714976,0.00080165744,0.00010625847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011447481,0.00047440073,0.001079373,0.0014359539,0.0012875563,0.0014121856,0.0011078275,0.00097249856,0.0046777893],"category_scores_gemma":[0.0047336924,0.0003989702,0.0005410853,0.0019174106,0.00080662227,0.0037442588,0.0019058689,0.0006377575,0.0018699042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002966444,0.00030714995,0.0046634483,0.00047529917,0.00013616744,0.0016713546,0.0009259235,0.018445944,0.17539884,0.084445916,0.02360351,0.68696],"study_design_scores_gemma":[0.0002788223,0.00090853486,0.0020373722,0.0001071466,0.00013518531,0.0037459328,0.0006505985,0.6847568,0.21877903,0.054157678,0.034300145,0.00014268588],"about_ca_topic_score_codex":0.0023690432,"about_ca_topic_score_gemma":0.0030095535,"teacher_disagreement_score":0.0046777893,"about_ca_system_score_codex":0.0009923243,"about_ca_system_score_gemma":0.002061966,"threshold_uncertainty_score":0.015648782},"labels":[],"label_agreement":null},{"id":"W2620415937","doi":"10.5430/air.v6n2p57","title":"A proposal of privacy preserving reinforcement learning for secure multiparty computation","year":2017,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Reinforcement learning; Computation; Encryption; Unsupervised learning; Artificial intelligence; Machine learning; Cloud computing; Supervised learning; Theoretical computer science; Algorithm; Computer security; Artificial neural network","score_opus":0.22074976536872212,"score_gpt":0.4530274687240633,"score_spread":0.23227770335534118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620415937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038257479,0.00030635955,0.9897198,0.0003851011,0.00008077417,0.000041531144,0.000019263742,0.00013072649,0.0054906504],"genre_scores_gemma":[0.714248,0.0009592607,0.2687062,0.00043729,0.00025772373,0.00032809324,0.00007233539,0.00009209934,0.014898955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989278,0.0004211337,0.00004212609,0.00024202158,0.000250278,0.00011655058],"domain_scores_gemma":[0.99924064,0.00035655987,0.000071180904,0.00009340907,0.0001436752,0.00009447815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014574281,0.00057304394,0.000843893,0.00041663568,0.00069258193,0.0011160132,0.0017292028,0.0012998179,0.0044390303],"category_scores_gemma":[0.0024649068,0.00028286994,0.0009293907,0.0005416571,0.0013157498,0.001474527,0.001487026,0.0017798328,0.0005914301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014480781,0.00010263262,0.00066469697,0.00017924556,0.0000905095,0.00030524898,0.00022258806,0.33315235,0.0040028673,0.5799546,0.004380364,0.076800086],"study_design_scores_gemma":[0.00003669141,0.000061539446,0.00006440219,0.000010004496,0.000011425744,0.00006961253,0.0000109763,0.9357793,0.0004697083,0.060108054,0.0033659884,0.0000124087865],"about_ca_topic_score_codex":0.0013809634,"about_ca_topic_score_gemma":0.00074939895,"teacher_disagreement_score":0.0044390303,"about_ca_system_score_codex":0.0010027259,"about_ca_system_score_gemma":0.0013513609,"threshold_uncertainty_score":0.01485002},"labels":[],"label_agreement":null},{"id":"W2620918839","doi":"10.1145/3019612.3019628","title":"Verifiable outsourced database in the cloud using game theory","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Stackelberg competition; Computer science; Database; Cloud computing; Service provider; View; Verifiable secret sharing; Upload; Database schema; Database design; Service (business); Computer security; World Wide Web","score_opus":0.04517780055848488,"score_gpt":0.2992082926374225,"score_spread":0.25403049207893763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620918839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03940207,0.00027332126,0.95435494,0.0004816865,0.000038808474,0.00019573592,0.00012667962,0.00020782162,0.0049189567],"genre_scores_gemma":[0.90272003,0.00032336797,0.09328136,0.00014511011,0.00002999212,0.00020321892,0.00008901224,0.00004364868,0.0031642485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965347,0.0016986757,0.00012487096,0.00044696536,0.0007039623,0.00049082824],"domain_scores_gemma":[0.996049,0.0026796854,0.00032825302,0.00043238624,0.00031525304,0.00019534207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034951982,0.000867101,0.001264254,0.0005570729,0.0008187087,0.0029949467,0.0019602168,0.0010986164,0.003479292],"category_scores_gemma":[0.006160581,0.00051718473,0.0012764698,0.0008557041,0.0018685581,0.004120124,0.0017569839,0.0018161132,0.0002689663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018028164,0.000077578705,0.0004406927,0.00007681351,0.00005744107,0.00012849337,0.00009933544,0.7466367,0.001789489,0.23717922,0.00091837114,0.012415558],"study_design_scores_gemma":[0.00002265734,0.000026223508,0.000051725452,0.000005625252,0.000011249705,0.00002332323,0.00001573812,0.9577246,0.00039291361,0.041267674,0.0004489999,0.000009299511],"about_ca_topic_score_codex":0.008330332,"about_ca_topic_score_gemma":0.0053737,"teacher_disagreement_score":0.008330332,"about_ca_system_score_codex":0.0040745083,"about_ca_system_score_gemma":0.004623734,"threshold_uncertainty_score":0.02956283},"labels":[],"label_agreement":null},{"id":"W2621248669","doi":"10.5555/1109557.1109588","title":"Cake cutting really is not a piece of cake","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Protocol (science); Bounding overwatch; Upper and lower bounds; Divide and conquer algorithms; Mathematics; Computer science; Value (mathematics); Combinatorics; Algorithm; Artificial intelligence; Statistics","score_opus":0.008784925928344135,"score_gpt":0.2371651895573972,"score_spread":0.2283802636290531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621248669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07885603,0.00039012855,0.8950524,0.003635575,0.00015499444,0.00021337604,0.00021947057,0.0007496653,0.020728348],"genre_scores_gemma":[0.6118445,0.0003846261,0.36587054,0.0007371986,0.00010712356,0.00037689085,0.00033833287,0.00042073848,0.019920105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950244,0.000961487,0.00027672082,0.0015987514,0.0013030238,0.00083567307],"domain_scores_gemma":[0.98487943,0.0074209706,0.0009596367,0.0055974685,0.00065605156,0.00048636223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030437142,0.0006970107,0.001643994,0.0004941647,0.002840028,0.004587442,0.00280599,0.0032860192,0.009609706],"category_scores_gemma":[0.017269488,0.0008653323,0.0018106772,0.0011911495,0.0055027334,0.015586082,0.004410712,0.006589812,0.001296539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005513646,0.00015066056,0.00096732395,0.0002823054,0.000104906234,0.0002451601,0.00060278043,0.061658464,0.00971879,0.8724631,0.00484226,0.048412777],"study_design_scores_gemma":[0.00010168453,0.00016293522,0.00034578456,0.00006247461,0.00006736215,0.00037868615,0.00031697552,0.1630714,0.012200974,0.8043595,0.018862559,0.000069763155],"about_ca_topic_score_codex":0.0022862593,"about_ca_topic_score_gemma":0.002275036,"teacher_disagreement_score":0.009609706,"about_ca_system_score_codex":0.0017930467,"about_ca_system_score_gemma":0.0022533059,"threshold_uncertainty_score":0.032147646},"labels":[],"label_agreement":null},{"id":"W2654917760","doi":"10.1109/ccece.2017.7946602","title":"An efficient solution to the socialist millionaires' problem","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Ciphertext; Plaintext; Computer science; Plaintext-aware encryption; Ciphertext indistinguishability; Semantic security; Cryptosystem; Encryption; Random oracle; Deterministic encryption; Theoretical computer science; Malleability; Homomorphic encryption; Hybrid cryptosystem; Adversary; Computer security; Protocol (science); Probabilistic encryption; Public-key cryptography; Attribute-based encryption","score_opus":0.019075070702944813,"score_gpt":0.286326157153557,"score_spread":0.26725108645061224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2654917760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09088936,0.0003631797,0.8310838,0.007441031,0.0002912792,0.00049901934,0.00031721746,0.0006205559,0.06849454],"genre_scores_gemma":[0.7119339,0.00026227187,0.25749335,0.00072740484,0.00016798305,0.00042870818,0.0002820265,0.00012993766,0.028574383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733895,0.0010992117,0.000111080735,0.00035714149,0.0007273068,0.00036642503],"domain_scores_gemma":[0.9979925,0.00094531954,0.00021802585,0.0005092759,0.00019507325,0.00013977746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021219815,0.0004081579,0.00070544024,0.0004319143,0.0020810983,0.0015995251,0.0018320751,0.0024419844,0.007468607],"category_scores_gemma":[0.005032882,0.0003159106,0.0008687559,0.00066804467,0.0020506245,0.004021466,0.0045979475,0.002440585,0.0010602408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022008833,0.00008977437,0.00034201154,0.00014764567,0.00005781087,0.00024829898,0.00062539655,0.020907734,0.0035479139,0.9194085,0.011047641,0.043357212],"study_design_scores_gemma":[0.00015882686,0.00011449485,0.00027043835,0.00004872495,0.00003727647,0.00041511387,0.00043359151,0.24215302,0.0071902834,0.69494873,0.054177783,0.000051677256],"about_ca_topic_score_codex":0.0008199282,"about_ca_topic_score_gemma":0.0009954456,"teacher_disagreement_score":0.007468607,"about_ca_system_score_codex":0.001021802,"about_ca_system_score_gemma":0.0018100189,"threshold_uncertainty_score":0.024985015},"labels":[],"label_agreement":null},{"id":"W2726160011","doi":"","title":"Un régime au concentré d'automate","year":2013,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science","score_opus":0.015671849175262022,"score_gpt":0.22317352502984592,"score_spread":0.2075016758545839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726160011","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10024323,0.0056282408,0.4630822,0.025550446,0.004868423,0.00031459265,0.0012386345,0.008102503,0.39097175],"genre_scores_gemma":[0.505639,0.00560053,0.08623948,0.0066736704,0.0075630704,0.0013294708,0.0011286279,0.0037417964,0.3820844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9822465,0.005166768,0.0004984592,0.004292631,0.005974231,0.0018214353],"domain_scores_gemma":[0.9840051,0.0074903313,0.0005695573,0.0040079993,0.002967688,0.000959458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057796272,0.0036444613,0.0048768655,0.0039762147,0.007919518,0.012191658,0.002752882,0.008359149,0.04512278],"category_scores_gemma":[0.01726909,0.0015350657,0.0038957237,0.003269974,0.0072324555,0.01144421,0.005976774,0.015874552,0.01675008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013529711,0.0003176441,0.0015320246,0.00048315636,0.00023312344,0.00055671134,0.00097415125,0.012795267,0.013420697,0.8482495,0.024446858,0.095637955],"study_design_scores_gemma":[0.0011052107,0.00062010007,0.005632918,0.00042011062,0.0002089593,0.001795716,0.00092990935,0.10435733,0.031072607,0.35679084,0.49675074,0.00031560144],"about_ca_topic_score_codex":0.016333554,"about_ca_topic_score_gemma":0.007167147,"teacher_disagreement_score":0.04512278,"about_ca_system_score_codex":0.010818949,"about_ca_system_score_gemma":0.0036121826,"threshold_uncertainty_score":0.15095073},"labels":[],"label_agreement":null},{"id":"W2733832709","doi":"10.1007/s00779-017-1056-7","title":"Utilizing fully homomorphic encryption to implement secure medical computation in smart cities","year":2017,"lang":"en","type":"article","venue":"Personal and Ubiquitous Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Computer science; Ciphertext; Encryption; Health care; Cryptography; Homomorphic secret sharing; Server; Computer security; Theoretical computer science; Computer network; Secure multi-party computation","score_opus":0.027320724414960525,"score_gpt":0.30247762368513426,"score_spread":0.2751568992701737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733832709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19126695,0.0003656258,0.79125893,0.000746247,0.0001427498,0.00013338054,0.00012785569,0.0011040855,0.014854175],"genre_scores_gemma":[0.92713,0.00012703339,0.0691797,0.00013313645,0.00002347086,0.000033127642,0.000058735237,0.000025149744,0.0032897126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966383,0.0000834942,0.000025201512,0.000038525617,0.000113828144,0.000075246426],"domain_scores_gemma":[0.9995234,0.00010318929,0.000039241986,0.00025037446,0.00006687266,0.000017010467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043519083,0.0001804518,0.00027078285,0.00024200592,0.00035185096,0.0007987543,0.0004734757,0.00051818124,0.0021734391],"category_scores_gemma":[0.0007129972,0.00016678758,0.00027987774,0.00028995232,0.00063641224,0.0014662726,0.0011066931,0.00046682984,0.0005770617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009049699,0.00033727763,0.0026839534,0.00024539552,0.0001126794,0.00088659616,0.00045848562,0.16950318,0.14423941,0.43943727,0.0066922894,0.23449849],"study_design_scores_gemma":[0.00009523268,0.00021797566,0.00090633956,0.00003097342,0.00004873426,0.0005542615,0.0001141398,0.77112234,0.11611593,0.09966241,0.011093602,0.000038070717],"about_ca_topic_score_codex":0.00038927328,"about_ca_topic_score_gemma":0.0005831259,"teacher_disagreement_score":0.0021734391,"about_ca_system_score_codex":0.0003046653,"about_ca_system_score_gemma":0.0006613765,"threshold_uncertainty_score":0.007270932},"labels":[],"label_agreement":null},{"id":"W2738534180","doi":"10.1186/s12920-017-0281-2","title":"PRESAGE: PRivacy-preserving gEnetic testing via SoftwAre Guard Extension","year":2017,"lang":"en","type":"article","venue":"BMC Medical Genomics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Institute of Biomedical Imaging and Bioengineering; National Human Genome Research Institute; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; U.S. National Library of Medicine; Patient-Centered Outcomes Research Institute","keywords":"Computer science; Homomorphic encryption; Plaintext; Encryption; Cloud computing; Outsourcing; Cryptography; Software; Implementation; Hash function; Distributed computing; Theoretical computer science; Computer security; Operating system; Software engineering","score_opus":0.04804617438262916,"score_gpt":0.2807342814887751,"score_spread":0.23268810710614596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738534180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1283992,0.0006719259,0.8548122,0.0007932072,0.000101852966,0.0003880186,0.00033157482,0.007398611,0.0071034413],"genre_scores_gemma":[0.91140026,0.00024971925,0.0845022,0.00024878813,0.000041982355,0.00012892403,0.00029338093,0.0001266387,0.0030081654],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981768,0.00043318642,0.000100584904,0.000241272,0.0007320921,0.0003161875],"domain_scores_gemma":[0.9971711,0.0008753394,0.00035575117,0.0012122665,0.0002554155,0.00013009703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016470647,0.00042178252,0.00047362628,0.0005214983,0.00044902257,0.0010491677,0.0012233771,0.0006931079,0.0027081333],"category_scores_gemma":[0.003231744,0.00022482607,0.0006409434,0.000467037,0.001959495,0.0028067424,0.0031128353,0.0013266602,0.0006325413],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034341672,0.0006185484,0.0104843,0.00067669863,0.00022322962,0.0032248374,0.00094585493,0.09809359,0.10299905,0.3128635,0.016842041,0.44959423],"study_design_scores_gemma":[0.0004356339,0.0012206193,0.0032706398,0.000111828616,0.00014402624,0.0032819414,0.0003135459,0.60779715,0.19129923,0.156934,0.035039354,0.00015208893],"about_ca_topic_score_codex":0.00064474996,"about_ca_topic_score_gemma":0.00047714153,"teacher_disagreement_score":0.0027081333,"about_ca_system_score_codex":0.00055531,"about_ca_system_score_gemma":0.0014546688,"threshold_uncertainty_score":0.009059608},"labels":[],"label_agreement":null},{"id":"W2739564306","doi":"10.1109/icc.2017.7997105","title":"CryptMDB: A practical encrypted MongoDB over big data","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Homomorphic encryption; Encryption; Cryptosystem; NoSQL; Relational database; Big data; Database; Confidentiality; Relational database management system; Computer security; Data access; Scalability; Data mining","score_opus":0.16002902865783727,"score_gpt":0.36410269514822874,"score_spread":0.20407366649039146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739564306","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09061988,0.0032345778,0.8812135,0.0019143937,0.00049820094,0.0006864467,0.0013212598,0.005265248,0.015246517],"genre_scores_gemma":[0.734301,0.0013003139,0.2511641,0.0005688582,0.00011520203,0.00031342823,0.0013989767,0.0002352801,0.010602787],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985241,0.00028871789,0.00014329735,0.00018155403,0.00064613984,0.0002162226],"domain_scores_gemma":[0.9983834,0.00020274983,0.00016233882,0.00080165634,0.0003267322,0.00012320266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001269867,0.00031585852,0.00060268375,0.000746002,0.0010382002,0.0015152055,0.0013129776,0.00075423997,0.0031458924],"category_scores_gemma":[0.00223638,0.00030424353,0.00044086695,0.0011755651,0.000871719,0.004297886,0.0027266727,0.0010089297,0.0010372334],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035904262,0.0008075236,0.0045318864,0.0013663319,0.0003164495,0.0011549075,0.0009506264,0.04065145,0.09375545,0.2711014,0.0506325,0.53114104],"study_design_scores_gemma":[0.0010754957,0.0009420368,0.002172245,0.0002147261,0.00016302476,0.003923013,0.0006654826,0.48514852,0.15584953,0.11856321,0.23101678,0.0002658867],"about_ca_topic_score_codex":0.0013354874,"about_ca_topic_score_gemma":0.0008001652,"teacher_disagreement_score":0.0031458924,"about_ca_system_score_codex":0.00091917656,"about_ca_system_score_gemma":0.0019776989,"threshold_uncertainty_score":0.010524094},"labels":[],"label_agreement":null},{"id":"W2740854940","doi":"10.1007/978-3-319-61273-7_3","title":"Another Look at Tightness II: Practical Issues in Cryptography","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Encryption; Mathematical proof; Seriousness; Theoretical computer science; Computer security; Strong cryptography; Mathematics; Law; Political science","score_opus":0.023362779384842845,"score_gpt":0.28884612868627657,"score_spread":0.26548334930143375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740854940","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009229818,0.07022695,0.34031588,0.11857993,0.010285776,0.000109059234,0.00029412512,0.00056869874,0.45038974],"genre_scores_gemma":[0.41979277,0.055949546,0.12779304,0.046087835,0.034308806,0.0004421986,0.0004317337,0.0023865148,0.31280756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962568,0.0014293068,0.00017005745,0.00050547207,0.0012182789,0.00042000768],"domain_scores_gemma":[0.9912322,0.0057176724,0.00033216985,0.0015299373,0.0008731069,0.00031491587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033014573,0.0013677177,0.0017590959,0.002609718,0.0040986077,0.007210351,0.0022318931,0.0039908886,0.024572682],"category_scores_gemma":[0.016720641,0.0012159889,0.0012377393,0.004022547,0.014486476,0.038149968,0.005095371,0.021781497,0.0059903297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001782836,0.000015126795,0.00002941587,0.00006395124,0.000004353157,0.000011751338,0.00012332978,0.00033074492,0.00014847441,0.97382325,0.014640665,0.010791149],"study_design_scores_gemma":[0.000005503026,0.000010830982,0.000032080676,0.00005707105,0.0000037094806,0.000035456706,0.000059218877,0.00043848626,0.00012329698,0.96656746,0.032657832,0.000009062665],"about_ca_topic_score_codex":0.0012140209,"about_ca_topic_score_gemma":0.000702557,"teacher_disagreement_score":0.024572682,"about_ca_system_score_codex":0.003962374,"about_ca_system_score_gemma":0.001370657,"threshold_uncertainty_score":0.082203746},"labels":[],"label_agreement":null},{"id":"W2744871542","doi":"10.1109/cse-euc.2017.193","title":"An Efficient CPA-Secure Encryption Scheme with Equality Test","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; ElGamal encryption; Scheme (mathematics); Ciphertext; Probabilistic encryption; Computer science; 40-bit encryption; Multiple encryption; Security token; Theoretical computer science; Adversary; Mathematics; Public-key cryptography; Computer security","score_opus":0.019639840815955725,"score_gpt":0.2852486645072005,"score_spread":0.2656088236912448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744871542","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030052524,0.0006156075,0.95798105,0.0006081564,0.00018790874,0.00030450898,0.0003665825,0.00062155863,0.009262089],"genre_scores_gemma":[0.7876342,0.0005286914,0.20166852,0.00024694926,0.00013266296,0.0003333302,0.00058916037,0.000059514772,0.008806991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709165,0.0007028433,0.0002738485,0.00045372764,0.0010659168,0.00041196603],"domain_scores_gemma":[0.99853265,0.00030634133,0.00016631045,0.00054616324,0.00035084912,0.00009770176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011272593,0.00047347345,0.00090306334,0.0005963646,0.0010262497,0.0016397334,0.0014925892,0.0009108997,0.0026548642],"category_scores_gemma":[0.0022055905,0.00031714726,0.0008140881,0.0013611919,0.0008753434,0.004840193,0.0030020885,0.0019660888,0.0010807888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000794625,0.00036960063,0.0014556953,0.00054289587,0.00013693006,0.00096159714,0.00042272583,0.030809123,0.049704533,0.7445577,0.008157208,0.16208743],"study_design_scores_gemma":[0.00056721264,0.0005691085,0.0012776223,0.00011237304,0.00021190106,0.0039056095,0.00023017639,0.5647202,0.0910019,0.27042875,0.066728264,0.0002468681],"about_ca_topic_score_codex":0.0006202887,"about_ca_topic_score_gemma":0.00030553676,"teacher_disagreement_score":0.0026548642,"about_ca_system_score_codex":0.0008118698,"about_ca_system_score_gemma":0.0018682729,"threshold_uncertainty_score":0.0088813305},"labels":[],"label_agreement":null},{"id":"W2745343546","doi":"10.1109/chase.2017.79","title":"Secure Sequence Similarity Search on Encrypted Genomic Data","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Zayed University; University of Manitoba","keywords":"Computer science; Encryption; Cloud computing; Scalability; Search engine indexing; Outsourcing; Hamming distance; Nearest neighbor search; Homomorphic encryption; Database; Data mining; Information retrieval; Computer security; Algorithm","score_opus":0.1853811758411292,"score_gpt":0.3649284143347509,"score_spread":0.17954723849362167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745343546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5447237,0.0006752027,0.44812673,0.00092535693,0.000077841345,0.00025433558,0.0007466924,0.00076517614,0.0037049204],"genre_scores_gemma":[0.9317753,0.0002121134,0.06575852,0.00008204447,0.000036641573,0.00007540062,0.00045064813,0.000020499521,0.0015888605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965539,0.00079282303,0.0003837913,0.00048431725,0.0013840826,0.0004009816],"domain_scores_gemma":[0.9942273,0.0025177826,0.0006482934,0.001783789,0.0006541274,0.0001687139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017879256,0.00028067167,0.0012358557,0.00086645683,0.0008289337,0.0013375973,0.0010828701,0.0009634854,0.001288987],"category_scores_gemma":[0.0069977096,0.00025514772,0.000593741,0.002019599,0.0008984785,0.0041146884,0.0019053031,0.00055531744,0.0006080157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052638003,0.0008154257,0.010765858,0.0006031771,0.0002690874,0.0019580643,0.001202531,0.4222689,0.1139777,0.14574037,0.0073706685,0.2897644],"study_design_scores_gemma":[0.00013973232,0.00026339077,0.000944109,0.0000134511,0.000028645012,0.0005842947,0.000210192,0.934014,0.02565898,0.03656806,0.0015535279,0.00002159593],"about_ca_topic_score_codex":0.0014909017,"about_ca_topic_score_gemma":0.0010754459,"teacher_disagreement_score":0.0017879256,"about_ca_system_score_codex":0.001328586,"about_ca_system_score_gemma":0.0020214934,"threshold_uncertainty_score":0.009639621},"labels":[],"label_agreement":null},{"id":"W2745390760","doi":"10.1145/3105970","title":"Securing Speech Noise Reduction in Outsourced Environment","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University at Albany","keywords":"Computer science; Encryption; Plaintext; Noise reduction; Cryptosystem; Speech recognition; Computer security; Artificial intelligence","score_opus":0.026787910022410835,"score_gpt":0.28393709931906186,"score_spread":0.25714918929665104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745390760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21778515,0.00047025658,0.77774274,0.00023433866,0.000078301615,0.0000642388,0.0000822482,0.0006761622,0.002866645],"genre_scores_gemma":[0.9158757,0.00037198703,0.08075504,0.00009621975,0.000057027075,0.000028945897,0.0000859967,0.000041355743,0.0026878174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986002,0.00023507162,0.00008027589,0.00022160487,0.00071691803,0.00014607153],"domain_scores_gemma":[0.99788195,0.0005655472,0.00027506088,0.00074602343,0.0004671506,0.000064248554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007784706,0.00054459804,0.00070431805,0.00036734468,0.00046900174,0.0007668545,0.0006556095,0.000590707,0.0010523149],"category_scores_gemma":[0.002507923,0.00017436619,0.0005183126,0.00036556998,0.0007417939,0.0012629727,0.00088362576,0.0005311225,0.00054190314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001463013,0.0002813662,0.0040194946,0.00038293583,0.00017130261,0.001605835,0.000886743,0.12644467,0.41769445,0.03197492,0.0025859438,0.4124893],"study_design_scores_gemma":[0.000048565762,0.0003086317,0.0014239975,0.000028493925,0.000086442196,0.001019142,0.00031300724,0.6729585,0.31013575,0.009412426,0.004218121,0.000046920155],"about_ca_topic_score_codex":0.0010180993,"about_ca_topic_score_gemma":0.0007730397,"teacher_disagreement_score":0.0010523149,"about_ca_system_score_codex":0.00041925287,"about_ca_system_score_gemma":0.0006724477,"threshold_uncertainty_score":0.0041169524},"labels":[],"label_agreement":null},{"id":"W2745796023","doi":"10.1007/s12095-017-0253-6","title":"Security of BLS and BGLS signatures in a multi-user setting","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; University of Waterloo; European Commission","keywords":"Computer science; Chemistry","score_opus":0.02860318381621792,"score_gpt":0.30377426839742083,"score_spread":0.27517108458120293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745796023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10647443,0.001028764,0.85045505,0.0028281584,0.00021236192,0.00020494252,0.00032054473,0.00079098856,0.03768476],"genre_scores_gemma":[0.9317751,0.00045345712,0.059394877,0.0005087316,0.00022784453,0.0001468951,0.0001720294,0.00014040429,0.0071807303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98753554,0.0033815766,0.0004619115,0.0019230798,0.0046832296,0.0020146077],"domain_scores_gemma":[0.98679745,0.0048935106,0.0012990697,0.005326053,0.0011229106,0.00056102365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043570916,0.0010483289,0.0014020109,0.0015981863,0.002046431,0.0055054165,0.0021264097,0.002500889,0.0038185476],"category_scores_gemma":[0.010689007,0.00074209506,0.00197869,0.0021071446,0.0062253913,0.013611204,0.008677688,0.0074974056,0.0011209383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025506812,0.00006688887,0.00035738436,0.00008690679,0.000046465044,0.00015736968,0.00031054651,0.033673458,0.0035705715,0.9455054,0.0017998414,0.014170208],"study_design_scores_gemma":[0.000038958136,0.00008087076,0.00028009494,0.00003719745,0.00003838492,0.0002857708,0.000121676916,0.14913796,0.006535874,0.8360955,0.007292783,0.00005502141],"about_ca_topic_score_codex":0.0015469842,"about_ca_topic_score_gemma":0.0009697625,"teacher_disagreement_score":0.0055054165,"about_ca_system_score_codex":0.0051258174,"about_ca_system_score_gemma":0.0031691196,"threshold_uncertainty_score":0.037190616},"labels":[],"label_agreement":null},{"id":"W2747115049","doi":"10.1007/978-3-319-72565-9_8","title":"Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Homomorphic encryption; Computer science; Encryption; Learning with errors; Reduction (mathematics); Ring (chemistry); Polynomial; Multiplication (music); Ciphertext; Arithmetic; Parallel computing; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.012101086962544534,"score_gpt":0.2557247016761423,"score_spread":0.24362361471359778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747115049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09860006,0.002178276,0.759851,0.0023524472,0.00072717963,0.00036710937,0.0007360658,0.0014188336,0.13376908],"genre_scores_gemma":[0.66345847,0.001546497,0.28555462,0.00038942214,0.0005209315,0.00027670737,0.0007792949,0.00043410796,0.047039784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917006,0.00022976643,0.00003818959,0.00010543136,0.0003203475,0.0001361612],"domain_scores_gemma":[0.9989504,0.000517131,0.000045191402,0.00035014318,0.00009570041,0.00004145763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090566144,0.0005959677,0.00081792264,0.00078457803,0.0011031689,0.002059602,0.0009789355,0.00072080194,0.010865321],"category_scores_gemma":[0.0025617285,0.00032028882,0.00095608254,0.0010470757,0.001433416,0.0024041508,0.002090375,0.0025356107,0.0024406302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025449577,0.0001801782,0.00020803793,0.00021943719,0.00003369543,0.00011862295,0.00028019,0.018774835,0.008679547,0.8413273,0.009290404,0.12063326],"study_design_scores_gemma":[0.00009725824,0.000089411384,0.00022355118,0.00004793516,0.00003348342,0.00023862667,0.00009794975,0.06566761,0.013710904,0.89848626,0.021273432,0.000033584318],"about_ca_topic_score_codex":0.00033716505,"about_ca_topic_score_gemma":0.00057390047,"teacher_disagreement_score":0.010865321,"about_ca_system_score_codex":0.00085140456,"about_ca_system_score_gemma":0.00066210306,"threshold_uncertainty_score":0.036348164},"labels":[],"label_agreement":null},{"id":"W2757168587","doi":"10.1016/j.future.2017.09.014","title":"A foggy research future: Advances and future opportunities in fog computing research","year":2017,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Mutual authentication; Elliptic curve cryptography; Fog computing; Authentication (law); Scheme (mathematics); Computation; Server; Cryptography; Discrete logarithm; Edge computing; Process (computing); Logarithm; Distributed computing; Cloud computing; Computer security; Computer network; Public-key cryptography; Encryption; Operating system; Algorithm; Mathematics","score_opus":0.19257126849334716,"score_gpt":0.3907063251667311,"score_spread":0.19813505667338394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757168587","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02583605,0.5738641,0.106628634,0.20669,0.009258658,0.0000992905,0.00033849195,0.00042730078,0.07685751],"genre_scores_gemma":[0.4533477,0.4405564,0.05509297,0.02819428,0.011127624,0.00011550787,0.00030961915,0.00013570674,0.011120206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942315,0.00015909348,0.000021576328,0.00009907341,0.00017858352,0.00011850288],"domain_scores_gemma":[0.9969702,0.0014286105,0.00015660713,0.00026012587,0.0006654537,0.000518951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002614833,0.00064288557,0.0008294292,0.0011069535,0.0014757224,0.006118146,0.0013233683,0.0032407192,0.0040330794],"category_scores_gemma":[0.0030329595,0.00022999849,0.00053190347,0.0018097898,0.003946372,0.01420665,0.0023445997,0.003743633,0.00082351564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014707654,0.00013820674,0.0025110063,0.0011191752,0.00006885028,0.0002284533,0.0007259085,0.0025006577,0.0017662848,0.5749887,0.05480216,0.36100352],"study_design_scores_gemma":[0.000021953792,0.00012588676,0.001576358,0.001000744,0.000053652857,0.0004512785,0.0015981919,0.008953322,0.0010728146,0.7222606,0.262828,0.000057354093],"about_ca_topic_score_codex":0.0019902182,"about_ca_topic_score_gemma":0.0027483462,"teacher_disagreement_score":0.006118146,"about_ca_system_score_codex":0.0019310364,"about_ca_system_score_gemma":0.003970252,"threshold_uncertainty_score":0.014010727},"labels":[],"label_agreement":null},{"id":"W2760015015","doi":"10.1007/978-3-030-29962-0_17","title":"An Efficiently Searchable Encrypted Data Structure for Range Queries","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Plaintext; Overhead (engineering); Cryptanalysis; Data structure; Theoretical computer science; Data mining; Database; Computer security","score_opus":0.03227953578566503,"score_gpt":0.3079968936761742,"score_spread":0.2757173578905092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760015015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07997707,0.0012114311,0.8943978,0.001270759,0.00035057147,0.0005164963,0.0031671268,0.008150786,0.010957815],"genre_scores_gemma":[0.5052357,0.0007447625,0.46790525,0.00051593623,0.00020483225,0.00053967396,0.0050362716,0.0010289745,0.018788597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981768,0.00022001234,0.00024802983,0.00020109069,0.00092809397,0.00022602075],"domain_scores_gemma":[0.99694103,0.00063122396,0.00023305381,0.001591319,0.0004936288,0.00010960871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092262006,0.00047025117,0.0009609203,0.0010504579,0.0006575644,0.0020187362,0.0014006076,0.0007057711,0.005289848],"category_scores_gemma":[0.0039594937,0.00051909627,0.00063052797,0.0017742037,0.00082742725,0.003973347,0.0036105646,0.0012838985,0.002428235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026683689,0.0006037195,0.0021652803,0.0008051412,0.00013885235,0.00063456426,0.0007632038,0.035128567,0.089486025,0.30652675,0.058821157,0.5022583],"study_design_scores_gemma":[0.0009182355,0.0010812959,0.0014762589,0.00020876792,0.00029682755,0.002140084,0.00038917986,0.4074038,0.13249333,0.33224043,0.12114449,0.0002073072],"about_ca_topic_score_codex":0.0008137379,"about_ca_topic_score_gemma":0.0009878696,"teacher_disagreement_score":0.005289848,"about_ca_system_score_codex":0.0012875998,"about_ca_system_score_gemma":0.0016542218,"threshold_uncertainty_score":0.017696321},"labels":[],"label_agreement":null},{"id":"W2765456579","doi":"10.1109/comapp.2017.8079737","title":"Improving Database Security in Cloud Computing by Fragmentation of Data","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Saudi Arabian Cultural Bureau","keywords":"Computer science; Encryption; Cloud computing; Client-side encryption; Confidentiality; Overhead (engineering); Computer security; Database; Outsourcing; Scheme (mathematics); Disk encryption hardware; Access control; Data security; Cloud storage; On-the-fly encryption; Operating system","score_opus":0.03359143587909309,"score_gpt":0.31162691086069516,"score_spread":0.2780354749816021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765456579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49015158,0.005651557,0.49480066,0.0018549007,0.000099339704,0.0004272961,0.00012638814,0.0011121017,0.0057762354],"genre_scores_gemma":[0.9208712,0.0006477985,0.077407114,0.00012755311,0.000027353664,0.000038340346,0.00006350948,0.00003156553,0.00078552443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943492,0.0019396215,0.00043924103,0.00044351065,0.0021428417,0.00068549585],"domain_scores_gemma":[0.98687965,0.0034549653,0.0013985306,0.006355563,0.0013782337,0.0005330387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004747454,0.00050778996,0.00096680946,0.00138374,0.0019019354,0.0021053345,0.002051178,0.0011670208,0.0011613861],"category_scores_gemma":[0.009438483,0.0005072409,0.00055437925,0.00243047,0.00180089,0.006378035,0.003448381,0.0010856609,0.000495225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032854108,0.0007422479,0.024351321,0.0007962345,0.00024269764,0.0017560959,0.0020853467,0.15364271,0.18055123,0.09817851,0.0059162695,0.5284519],"study_design_scores_gemma":[0.00038990754,0.0016978311,0.0075074956,0.00031855667,0.0002217941,0.006082399,0.0015243473,0.6992319,0.19134927,0.0671186,0.024383824,0.00017403206],"about_ca_topic_score_codex":0.0013169936,"about_ca_topic_score_gemma":0.0009774626,"teacher_disagreement_score":0.004747454,"about_ca_system_score_codex":0.0020259994,"about_ca_system_score_gemma":0.0016952616,"threshold_uncertainty_score":0.025107205},"labels":[],"label_agreement":null},{"id":"W2765702513","doi":"","title":"SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers","year":2014,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Homomorphic encryption; Computer science; Encryption; IBM; Theoretical computer science; Parallel computing; Operating system","score_opus":0.022021262104408364,"score_gpt":0.2750919079210929,"score_spread":0.25307064581668454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765702513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081511274,0.0004745177,0.87317675,0.00032584395,0.00015416312,0.0003306503,0.00058727025,0.028652161,0.014787328],"genre_scores_gemma":[0.64438283,0.00031560272,0.3379544,0.0002788278,0.00007552394,0.00025985867,0.0016403114,0.0010558225,0.014036802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991757,0.00012119854,0.00006310718,0.00010849961,0.0003912919,0.00014014351],"domain_scores_gemma":[0.99923706,0.00013475252,0.000048521822,0.0004499425,0.00009432288,0.00003545365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007133166,0.00044911375,0.0005512531,0.0005049815,0.0003357913,0.00088930177,0.0013400684,0.00044938267,0.007861882],"category_scores_gemma":[0.0013441555,0.00037451793,0.00052812614,0.00045805518,0.00073091284,0.0026677384,0.0015992846,0.001232749,0.002502143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019496414,0.00065215933,0.003531801,0.00059247075,0.00022652531,0.0008308123,0.0005330699,0.040862333,0.23915331,0.17744975,0.040869113,0.493349],"study_design_scores_gemma":[0.00037553706,0.0005045773,0.001955943,0.00006345274,0.00008851555,0.0008541659,0.00012124143,0.46537697,0.42019203,0.056108225,0.05426688,0.00009243578],"about_ca_topic_score_codex":0.00035727993,"about_ca_topic_score_gemma":0.0006339405,"teacher_disagreement_score":0.007861882,"about_ca_system_score_codex":0.00049909885,"about_ca_system_score_gemma":0.00085964735,"threshold_uncertainty_score":0.02630061},"labels":[],"label_agreement":null},{"id":"W2769184765","doi":"10.1093/comjnl/bxx112","title":"Efficient Ring Signature and Group Signature Schemes Based on q-ary Identification Protocols","year":2017,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ring signature; Group signature; Merkle signature scheme; Signature (topology); Digital signature; Computer science; Schnorr signature; ElGamal signature scheme; Blind signature; Ring (chemistry); Security parameter; Public-key cryptography; Algorithm; Mathematics; Theoretical computer science; Computer security; Cryptography; Encryption; Hash function","score_opus":0.017952554633990196,"score_gpt":0.27657176918863224,"score_spread":0.25861921455464204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769184765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05574517,0.0010076351,0.9282515,0.0006045724,0.00015109008,0.0003782809,0.00018403353,0.00059086835,0.013086779],"genre_scores_gemma":[0.6483924,0.0011381402,0.33572468,0.0003816235,0.00014944393,0.0005512716,0.000337047,0.00007985453,0.013245668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672925,0.0008060496,0.00024057564,0.00050913496,0.0013535265,0.00036150726],"domain_scores_gemma":[0.9984332,0.0003963017,0.0003135861,0.0005218648,0.00024028055,0.000094721494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017642095,0.0004695663,0.0007729716,0.0008763353,0.00080494303,0.0015100561,0.0014875478,0.0011649538,0.003103638],"category_scores_gemma":[0.0030373873,0.00031053825,0.00082112645,0.0013122951,0.0015512893,0.004405131,0.0027992334,0.0013696607,0.0011046171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003565215,0.00009655496,0.00024068505,0.0002331783,0.000050644743,0.0001737068,0.00037359458,0.03037698,0.04553754,0.8464778,0.0019639018,0.074118845],"study_design_scores_gemma":[0.0004987816,0.0005146834,0.000587813,0.00010043615,0.00012821879,0.0009243258,0.00014960219,0.45448175,0.09353683,0.39824036,0.05059962,0.00023761437],"about_ca_topic_score_codex":0.00044521075,"about_ca_topic_score_gemma":0.00037273185,"teacher_disagreement_score":0.003103638,"about_ca_system_score_codex":0.0012334877,"about_ca_system_score_gemma":0.0015893414,"threshold_uncertainty_score":0.010382712},"labels":[],"label_agreement":null},{"id":"W2770593179","doi":"10.1016/j.cose.2017.10.014","title":"Privacy preserving fine-grained location-based access control for mobile cloud","year":2017,"lang":"en","type":"article","venue":"Computers & Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Computer science; Encryption; Cloud computing; Access control; Computer security; Mobile cloud computing; Anonymity; Proxy re-encryption; Server; Attribute-based encryption; Outsourcing; Mobile device; Computer network; Mobile computing; Public-key cryptography; World Wide Web; Business","score_opus":0.023213549087158634,"score_gpt":0.3018504791962753,"score_spread":0.27863693010911667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770593179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11067254,0.00048125657,0.88397574,0.0003668389,0.000114525705,0.00015193099,0.00027595548,0.0014674957,0.0024936732],"genre_scores_gemma":[0.97596097,0.00007734708,0.02258617,0.000048675123,0.000030912717,0.000024024941,0.00007208908,0.000022119642,0.0011776248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703884,0.00042050096,0.0002102125,0.00054078834,0.0008257811,0.00096384337],"domain_scores_gemma":[0.9965155,0.0004883824,0.00034575694,0.0020120568,0.00044373935,0.00019446993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013637233,0.0004658794,0.0015143314,0.000535982,0.0012432738,0.002162652,0.0020484643,0.0008978667,0.0016812674],"category_scores_gemma":[0.0033072094,0.00035922017,0.0006606108,0.0010328926,0.0011427385,0.0030325225,0.0035710114,0.0012772803,0.00052522303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002894779,0.0007136822,0.0053548967,0.00025139865,0.0002060989,0.0007830399,0.0005931521,0.44053122,0.111968905,0.18370701,0.00876463,0.24423118],"study_design_scores_gemma":[0.000053235523,0.00020729618,0.0005795055,0.000011082096,0.000035890378,0.00024503432,0.000105477135,0.9445403,0.01299938,0.038979486,0.002212523,0.00003084364],"about_ca_topic_score_codex":0.0037258554,"about_ca_topic_score_gemma":0.0037166255,"teacher_disagreement_score":0.0037258554,"about_ca_system_score_codex":0.0012260684,"about_ca_system_score_gemma":0.0021341883,"threshold_uncertainty_score":0.008895755},"labels":[],"label_agreement":null},{"id":"W2775687559","doi":"10.1109/wcsp.2017.8170986","title":"Secure and privacy-preserving task announcement in vehicular cloud","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Signcryption; Computer science; Proxy re-encryption; Ciphertext; Cloud computing; Encryption; Scheme (mathematics); Proxy (statistics); Computer security; Computer network; Task (project management); Cryptography; Public-key cryptography; Engineering; Operating system","score_opus":0.015561110247446113,"score_gpt":0.2561537023368941,"score_spread":0.240592592089448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775687559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11674777,0.0013863632,0.8712142,0.0007586721,0.00033271397,0.00036749212,0.00030736814,0.0013543152,0.0075311163],"genre_scores_gemma":[0.9575239,0.00038298135,0.03887573,0.000077350895,0.000059293983,0.000066051274,0.00018671982,0.000029538098,0.0027984665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978102,0.00037907556,0.00014836476,0.00029494407,0.0007152011,0.0006522505],"domain_scores_gemma":[0.9983365,0.00023299397,0.000306007,0.0006441795,0.0002994285,0.00018097958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011243765,0.00050915044,0.0010370496,0.00056593365,0.0015881857,0.0017723166,0.001401535,0.0007406764,0.0009827081],"category_scores_gemma":[0.0018870097,0.00027506845,0.0005589081,0.0011712885,0.00072654674,0.0033664412,0.002623605,0.0011724394,0.0005625503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048787254,0.000494551,0.0070543713,0.0006668726,0.00025177098,0.0028140359,0.001659594,0.19660631,0.14458549,0.29089224,0.014623607,0.33547243],"study_design_scores_gemma":[0.0001930351,0.0005383576,0.0019354933,0.00006577605,0.00013242055,0.0012241686,0.0008765955,0.81946254,0.08974978,0.051776286,0.03390151,0.00014400376],"about_ca_topic_score_codex":0.002903927,"about_ca_topic_score_gemma":0.0021486834,"teacher_disagreement_score":0.002903927,"about_ca_system_score_codex":0.001152042,"about_ca_system_score_gemma":0.0022650105,"threshold_uncertainty_score":0.008358657},"labels":[],"label_agreement":null},{"id":"W2776464807","doi":"10.1109/cns.2017.8228682","title":"Privacy aware web services in the cloud","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Obfuscation; Cloud computing; Encryption; Computer security; Information privacy; Web service; Cloud computing security; Service provider; Privacy software; Internet privacy; Privacy by Design; Data security; Service (business); World Wide Web; Business","score_opus":0.019166607246165753,"score_gpt":0.2729056168925179,"score_spread":0.25373900964635215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776464807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076163575,0.0022938754,0.8770792,0.004144749,0.0002842831,0.00039227365,0.00035929558,0.016104054,0.023178743],"genre_scores_gemma":[0.7503593,0.0017688315,0.2341715,0.0012931462,0.00014628866,0.00013397612,0.00067683135,0.0009664089,0.010483659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964141,0.00077193027,0.0002557057,0.0003237992,0.0016862211,0.0005482232],"domain_scores_gemma":[0.9951089,0.00071135524,0.00036028115,0.0027068788,0.00074776926,0.00036481264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002632181,0.00056082755,0.00061764644,0.0008960885,0.0020230494,0.0043774005,0.0020339573,0.0016440965,0.0022627693],"category_scores_gemma":[0.004537665,0.00052152644,0.00087929744,0.0014401466,0.0016299472,0.006242614,0.0037960692,0.0029284342,0.0015805179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012453217,0.00075759465,0.008056714,0.0005477297,0.0002283545,0.0020324367,0.001078482,0.08633263,0.06817424,0.42050666,0.034253355,0.3767865],"study_design_scores_gemma":[0.00010816062,0.00013286473,0.0023422649,0.00016137339,0.00010493429,0.0009919604,0.00049013546,0.62939066,0.0632884,0.2088382,0.09403966,0.00011139867],"about_ca_topic_score_codex":0.011461063,"about_ca_topic_score_gemma":0.0063598813,"teacher_disagreement_score":0.011461063,"about_ca_system_score_codex":0.0016499402,"about_ca_system_score_gemma":0.0032833247,"threshold_uncertainty_score":0.022788703},"labels":[],"label_agreement":null},{"id":"W2782555766","doi":"10.1007/s11277-017-5187-y","title":"A New Gradual Secret Sharing Scheme with Diverse Access Structure","year":2018,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Secret sharing; Collusion; Access structure; Scheme (mathematics); Overhead (engineering); Order (exchange); Theoretical computer science; Computer security; Computer network; Cryptography; Mathematics","score_opus":0.05231008955860969,"score_gpt":0.3116768315132511,"score_spread":0.2593667419546414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782555766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09288173,0.0009558753,0.8939687,0.00059118686,0.00023871056,0.00026078155,0.00018565549,0.00063596497,0.010281335],"genre_scores_gemma":[0.84266096,0.00049519783,0.14801456,0.00027121382,0.00015347963,0.0002277381,0.00020012897,0.000053055806,0.007923649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980907,0.00047270558,0.000105910716,0.00036693772,0.0006466957,0.00031713684],"domain_scores_gemma":[0.9980714,0.00051678834,0.00023806372,0.00058937725,0.00033541647,0.0002490619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012079501,0.000573878,0.001049803,0.0007775927,0.0014171759,0.001243968,0.0020251628,0.0010217247,0.0020073662],"category_scores_gemma":[0.0025371814,0.00031746065,0.0007762556,0.0014008492,0.0015230486,0.003240881,0.004032212,0.0016748011,0.000565664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011972846,0.00020566175,0.00084184634,0.00039487903,0.00011718991,0.0003423346,0.000750255,0.037098426,0.10511069,0.7121893,0.0038471534,0.13790502],"study_design_scores_gemma":[0.0006783193,0.001594749,0.0011101733,0.00009094982,0.00026835417,0.0025720943,0.00025908966,0.56051326,0.05076937,0.34530604,0.036432073,0.00040545088],"about_ca_topic_score_codex":0.00051791925,"about_ca_topic_score_gemma":0.00042741932,"teacher_disagreement_score":0.0020251628,"about_ca_system_score_codex":0.0008689392,"about_ca_system_score_gemma":0.0017967101,"threshold_uncertainty_score":0.0067152977},"labels":[],"label_agreement":null},{"id":"W2782565858","doi":"10.1109/glocom.2017.8253982","title":"Achieving Privacy-Preserving Multi Dot-Product Query in Fog Computing-Enhanced IoT","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Homomorphic encryption; Scheme (mathematics); Enhanced Data Rates for GSM Evolution; Edge computing; Encryption; Computer network; Product (mathematics); Internet of Things; Dot product; Distributed computing; Computer security; Artificial intelligence","score_opus":0.036902152121639796,"score_gpt":0.303744507584078,"score_spread":0.26684235546243823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782565858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11275517,0.00093600515,0.881305,0.00046628088,0.00009331205,0.00021936251,0.00014043754,0.00045221648,0.0036321965],"genre_scores_gemma":[0.94841677,0.00026892143,0.050131615,0.00020544884,0.00004304253,0.000051061652,0.000074903175,0.000016359865,0.00079184584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772245,0.000516384,0.00015694009,0.00033729165,0.0008331159,0.00043368764],"domain_scores_gemma":[0.99842703,0.0005327846,0.00018367977,0.00050692697,0.00027004766,0.00007957261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001968312,0.0005322128,0.0010757708,0.0003976814,0.0010992812,0.0013821134,0.001254748,0.0010279552,0.00066304964],"category_scores_gemma":[0.0025514439,0.0002472963,0.0006692759,0.0010869188,0.0012566736,0.003958042,0.0024477874,0.0009585466,0.00013853266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027336366,0.0005861812,0.005572474,0.0006330057,0.0003647319,0.0027126053,0.00189343,0.30643997,0.13477969,0.2757499,0.011856924,0.25667748],"study_design_scores_gemma":[0.000099158955,0.00029851228,0.00072486664,0.000018001601,0.00006684152,0.0009600834,0.00022734734,0.9215621,0.022171518,0.049549114,0.004251811,0.00007060889],"about_ca_topic_score_codex":0.0019159456,"about_ca_topic_score_gemma":0.001399545,"teacher_disagreement_score":0.001968312,"about_ca_system_score_codex":0.00083962636,"about_ca_system_score_gemma":0.0011902358,"threshold_uncertainty_score":0.010409534},"labels":[],"label_agreement":null},{"id":"W2783296048","doi":"10.1109/mic.2018.112102323","title":"Secure Count Query on Encrypted Genomic Data: A Survey","year":2018,"lang":"en","type":"article","venue":"IEEE Internet Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Encryption; Cryptography; Computer security","score_opus":0.0595062693736322,"score_gpt":0.30010916896339923,"score_spread":0.24060289958976702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783296048","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060434014,0.65527153,0.2295609,0.009943393,0.00064447813,0.00047465484,0.00060628046,0.00056749996,0.042497218],"genre_scores_gemma":[0.4969446,0.44416043,0.04817953,0.0019257691,0.0011877328,0.00025207337,0.0011414984,0.000121185934,0.0060871765],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947625,0.0010432414,0.00044493593,0.00048051088,0.0028242741,0.0004446865],"domain_scores_gemma":[0.99544597,0.002550432,0.00034544285,0.00080741337,0.00072760996,0.00012309053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003461877,0.00070653285,0.0014283995,0.002054545,0.0007930657,0.0027866529,0.0017474149,0.0013309821,0.0030149568],"category_scores_gemma":[0.006995586,0.0005655888,0.0007739526,0.0036247014,0.0016214573,0.010943545,0.0024621414,0.0018067162,0.0014424579],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007324326,0.00028620337,0.005726953,0.004197742,0.00019128961,0.00051645044,0.00040598836,0.02512368,0.009097615,0.20392287,0.025081668,0.72471714],"study_design_scores_gemma":[0.0002535985,0.0014019165,0.008509267,0.0026998161,0.00028931684,0.012531695,0.0028241586,0.26629177,0.03949804,0.18876708,0.47667757,0.0002557926],"about_ca_topic_score_codex":0.0009487677,"about_ca_topic_score_gemma":0.00040339387,"teacher_disagreement_score":0.003461877,"about_ca_system_score_codex":0.0016909336,"about_ca_system_score_gemma":0.0016038975,"threshold_uncertainty_score":0.018308401},"labels":[],"label_agreement":null},{"id":"W2783446016","doi":"10.1515/popets-2018-0003","title":"Improved Strongly Deniable Authenticated Key Exchanges for Secure Messaging","year":2018,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Forward secrecy; Key exchange; Cryptography; Secrecy; Anonymity; Cryptosystem; Cryptographic primitive; Public-key cryptography; Key (lock); Asynchronous communication; Cryptographic protocol; Encryption; Computer network","score_opus":0.016915449120273485,"score_gpt":0.25855822330962347,"score_spread":0.24164277418934998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783446016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059292063,0.00037130024,0.9300708,0.00077826716,0.00016082122,0.00035965742,0.00014195293,0.0019679319,0.006857165],"genre_scores_gemma":[0.60730493,0.00032274163,0.38484994,0.0003557377,0.00007282878,0.0003434574,0.00034596486,0.00021171664,0.006192766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99097025,0.003687354,0.0009501756,0.00070818193,0.0031050397,0.00057902053],"domain_scores_gemma":[0.9883531,0.004092821,0.0011595115,0.0041757724,0.0018557509,0.00036309726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007008294,0.0006155578,0.0008058905,0.0009019554,0.0010395735,0.0025401746,0.0023122819,0.0017391541,0.0043151015],"category_scores_gemma":[0.014310089,0.0006211631,0.00077073777,0.0007945642,0.0021772585,0.006124682,0.0053217276,0.0034296855,0.0013078469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014006847,0.00029680916,0.0013558202,0.00066017563,0.000097931515,0.00055443955,0.0021238704,0.048734423,0.06559705,0.76702803,0.0043429113,0.1078079],"study_design_scores_gemma":[0.0006893545,0.0010878013,0.00070137443,0.0002007223,0.00015624265,0.0008045371,0.00052692735,0.51346385,0.11492198,0.29642558,0.07076451,0.00025711313],"about_ca_topic_score_codex":0.0005161798,"about_ca_topic_score_gemma":0.0003389573,"teacher_disagreement_score":0.007008294,"about_ca_system_score_codex":0.0011231567,"about_ca_system_score_gemma":0.0017500459,"threshold_uncertainty_score":0.037063897},"labels":[],"label_agreement":null},{"id":"W2786607496","doi":"10.1109/pccc.2017.8280497","title":"An efficient and secure scheme for smart home communication using identity-based signcryption","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Signcryption; Computer science; Cryptography; Secure communication; Encryption; Authentication (law); Computer security; Cryptographic primitive; Computer network; Overhead (engineering); Scheme (mathematics); Confidentiality; Forward secrecy; Message authentication code; Mutual authentication; Public-key cryptography; Cryptographic protocol","score_opus":0.03657126507319362,"score_gpt":0.32705510339063154,"score_spread":0.2904838383174379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786607496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05572716,0.00054703373,0.93152714,0.00069682667,0.0002592102,0.00042784412,0.00010637134,0.0012674475,0.009440908],"genre_scores_gemma":[0.71889424,0.0005905188,0.2664888,0.00024195472,0.00008910167,0.0003310393,0.0002594153,0.00005022788,0.013054669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896264,0.00023877813,0.00008688129,0.00011180382,0.00047757197,0.00012234024],"domain_scores_gemma":[0.99918085,0.00015410429,0.00013988093,0.00027380462,0.00019731189,0.000053982363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010188153,0.00041562805,0.0008017634,0.00064729864,0.0008542324,0.0008006693,0.0008157285,0.0012045221,0.0020749716],"category_scores_gemma":[0.0016139016,0.00017692927,0.0005852322,0.00073982036,0.0009914587,0.0024514077,0.0016130413,0.0010799541,0.00076287595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009667581,0.0005128448,0.0014396742,0.000524963,0.00014298416,0.0013038738,0.0010984819,0.02744534,0.20565654,0.42010888,0.009493967,0.33130565],"study_design_scores_gemma":[0.0007556482,0.0019899802,0.0017554522,0.00017258088,0.00029137346,0.004764605,0.00030070578,0.5234003,0.31651118,0.063122205,0.086594805,0.00034110295],"about_ca_topic_score_codex":0.00039901675,"about_ca_topic_score_gemma":0.00038599808,"teacher_disagreement_score":0.0020749716,"about_ca_system_score_codex":0.0007069835,"about_ca_system_score_gemma":0.0010884088,"threshold_uncertainty_score":0.0069414377},"labels":[],"label_agreement":null},{"id":"W2787711429","doi":"10.1109/vtcfall.2017.8288344","title":"PQuery: Achieving Privacy-Preserving Query with Communication Efficiency in Internet of Things","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Internet of Things; Scheme (mathematics); Service provider; Information privacy; Private information retrieval; Computer security; Service (business); The Internet; Privacy protection; Computer network; World Wide Web","score_opus":0.017114830638882597,"score_gpt":0.2576691086964369,"score_spread":0.2405542780575543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787711429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026103526,0.00089365663,0.96935755,0.0005529677,0.00009432492,0.00022089598,0.00010204901,0.00061361893,0.002061483],"genre_scores_gemma":[0.85800546,0.0008006761,0.13731857,0.00063083123,0.00018334563,0.00022118363,0.00020063814,0.000086365915,0.002552868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570197,0.0011492778,0.00026680637,0.0006240945,0.001626966,0.0006308595],"domain_scores_gemma":[0.9965731,0.0012089052,0.00034768987,0.0013334277,0.00039914175,0.00013771724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039243423,0.00069875724,0.001600978,0.00075549167,0.0015319758,0.0019204096,0.0024004574,0.0016256139,0.0011752973],"category_scores_gemma":[0.005441814,0.00037891738,0.00092281954,0.001761915,0.0024866574,0.006301847,0.005061425,0.0019205458,0.00041344968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002249032,0.0004702133,0.0022545168,0.0006337397,0.00026628893,0.0014311398,0.0014881385,0.12141154,0.108386986,0.44693962,0.014839256,0.2996296],"study_design_scores_gemma":[0.00022507268,0.0006112458,0.0007029495,0.000047158053,0.00010984072,0.0014620759,0.00037728978,0.7664706,0.04145025,0.17307068,0.015321821,0.00015094691],"about_ca_topic_score_codex":0.0010771167,"about_ca_topic_score_gemma":0.00060525857,"teacher_disagreement_score":0.0039243423,"about_ca_system_score_codex":0.0010757201,"about_ca_system_score_gemma":0.0015416304,"threshold_uncertainty_score":0.020754158},"labels":[],"label_agreement":null},{"id":"W2789745890","doi":"10.1155/2018/5816765","title":"A Secure and Scalable Data Communication Scheme in Smart Grids","year":2018,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Smart grid; Scheme (mathematics); Encryption; Computer security; Security analysis; Computer network; Secret sharing; Service provider; Secure communication; Access control; Architecture; Data sharing; Communications security; Distributed computing; Service (business); Cryptography; Database","score_opus":0.032139018812734996,"score_gpt":0.2991013545130991,"score_spread":0.2669623357003641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789745890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051744036,0.0005310468,0.9397926,0.0008727799,0.00013920991,0.00021660508,0.00009658665,0.0007816047,0.005825612],"genre_scores_gemma":[0.8528859,0.0003494294,0.14145494,0.00017436242,0.00006936511,0.0002465098,0.00015748081,0.000032009855,0.0046300073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989097,0.00028212735,0.00007792212,0.00016570851,0.00044355987,0.00012104986],"domain_scores_gemma":[0.99921596,0.00016953764,0.000107145104,0.00031079518,0.00014010974,0.00005642431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009103488,0.00036364017,0.00051084114,0.00043525035,0.0008868243,0.00082287315,0.00082678924,0.00068373856,0.0013629983],"category_scores_gemma":[0.0015385726,0.00019432003,0.00039387812,0.0009733921,0.0011477502,0.0026213836,0.0018369622,0.0010700404,0.00041227546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005339506,0.00013415253,0.00059441646,0.00022265589,0.00004868753,0.00042706676,0.0004921583,0.14326246,0.07111843,0.6373672,0.0066211787,0.1391776],"study_design_scores_gemma":[0.0001820785,0.00030042723,0.00031820138,0.000034409204,0.000029423078,0.00038726896,0.0001118719,0.79673743,0.026044741,0.15370408,0.022084555,0.00006554382],"about_ca_topic_score_codex":0.00062812516,"about_ca_topic_score_gemma":0.00045691806,"teacher_disagreement_score":0.0013629983,"about_ca_system_score_codex":0.00084388454,"about_ca_system_score_gemma":0.0010215042,"threshold_uncertainty_score":0.0061228275},"labels":[],"label_agreement":null},{"id":"W2789789243","doi":"10.3233/jcs-171103","title":"HardIDX: Practical and secure index with SGX in a malicious environment","year":2018,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Memory footprint; Software; Code (set theory); Index (typography); Information leakage; Computer security; Operating system; Embedded system; World Wide Web; Set (abstract data type)","score_opus":0.007252090349492954,"score_gpt":0.2338831207959884,"score_spread":0.22663103044649544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789789243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20615278,0.0022972324,0.72797716,0.0010586465,0.00031573666,0.000685379,0.0006950908,0.031993553,0.028824436],"genre_scores_gemma":[0.8277217,0.00044071785,0.15786994,0.00026262124,0.00005757459,0.00019008959,0.0006715324,0.00083857897,0.01194734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998104,0.00019832313,0.00019849077,0.00020895839,0.0010113914,0.0002788431],"domain_scores_gemma":[0.9975084,0.0004570662,0.00022075944,0.0014101473,0.0002695842,0.00013409607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243445,0.0005688786,0.00062351994,0.0006805112,0.0008366952,0.002216707,0.0017755885,0.00088494224,0.004203958],"category_scores_gemma":[0.0037566165,0.00045372688,0.00049901917,0.00057350483,0.0015559478,0.005088356,0.0041517997,0.0012737504,0.0019497966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039048772,0.0006587646,0.01208094,0.0013000868,0.00023297752,0.0021887566,0.0019726944,0.038995463,0.17534544,0.32918385,0.0459175,0.3882187],"study_design_scores_gemma":[0.0004499816,0.0011643919,0.00274225,0.00019905544,0.00011963007,0.0030260955,0.0004143069,0.566916,0.24864139,0.08689693,0.0892667,0.00016331124],"about_ca_topic_score_codex":0.0010107562,"about_ca_topic_score_gemma":0.000876372,"teacher_disagreement_score":0.004203958,"about_ca_system_score_codex":0.001099307,"about_ca_system_score_gemma":0.0014829132,"threshold_uncertainty_score":0.014063597},"labels":[],"label_agreement":null},{"id":"W2794288670","doi":"10.1007/978-3-319-76953-0_8","title":"Threshold Properties of Prime Power Subgroups with Application to Secure Integer Comparisons","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Homomorphic encryption; Computer science; Cryptosystem; Integer (computer science); Prime (order theory); Protocol (science); Ciphertext; Theoretical computer science; Computation; Scheme (mathematics); Public-key cryptography; Threshold cryptosystem; Cryptography; Encryption; Algorithm; Mathematics; Computer network; Public key cryptosystem; Combinatorics; Programming language","score_opus":0.01456418204859348,"score_gpt":0.2291311963667691,"score_spread":0.21456701431817563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794288670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22353818,0.004465552,0.63841915,0.0039795716,0.00081407937,0.00021553044,0.0005013834,0.0010721515,0.12699437],"genre_scores_gemma":[0.9304712,0.001911005,0.04693063,0.00037107678,0.000811194,0.00013339444,0.00025451553,0.00030237902,0.018814659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989969,0.00019906605,0.00007733435,0.00023718445,0.00033120217,0.00015833165],"domain_scores_gemma":[0.99627495,0.002497267,0.00026000224,0.000551269,0.00023504953,0.00018151186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012487242,0.00078266347,0.0010265973,0.0017178318,0.0010305003,0.004231071,0.0011604185,0.001038973,0.0074612373],"category_scores_gemma":[0.0075777145,0.0004944043,0.0010184515,0.0024015184,0.0033265215,0.008290465,0.0027886212,0.0037267685,0.0011690808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012116711,0.00003289048,0.0002188778,0.000064295054,0.000008642686,0.00007528899,0.0002780593,0.0025575503,0.0024382307,0.9747053,0.0014196597,0.018080095],"study_design_scores_gemma":[0.000016588361,0.000024652509,0.00008088544,0.000012116495,0.000009032037,0.000099414254,0.00005307117,0.008896772,0.0015698973,0.9865079,0.0027209078,0.000008748641],"about_ca_topic_score_codex":0.00029764473,"about_ca_topic_score_gemma":0.00022049743,"teacher_disagreement_score":0.0074612373,"about_ca_system_score_codex":0.0013980278,"about_ca_system_score_gemma":0.00058555196,"threshold_uncertainty_score":0.02496034},"labels":[],"label_agreement":null},{"id":"W2800569707","doi":"10.1007/s12095-018-0301-x","title":"Error analysis of weak Poly-LWE instances","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Learning with errors; Gaussian; Encryption; Distribution (mathematics); Error detection and correction; Algorithm; Computer science; Error analysis; Algebraic number; Mathematics; Cryptography; Applied mathematics; Physics; Mathematical analysis","score_opus":0.03121228252270323,"score_gpt":0.2987014544463359,"score_spread":0.26748917192363264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800569707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23667254,0.0014750068,0.7119199,0.007849488,0.00052437355,0.00018600846,0.0015001249,0.0012585758,0.03861397],"genre_scores_gemma":[0.917097,0.000628143,0.062258348,0.00085532933,0.00050992036,0.00028603288,0.0014677503,0.0007637355,0.0161339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99409395,0.0019059498,0.00028969217,0.0007643776,0.0017425413,0.0012034806],"domain_scores_gemma":[0.95683914,0.032025978,0.0018435008,0.0051930556,0.0026889637,0.0014093362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060932892,0.0015206757,0.0024387978,0.002326817,0.0022123514,0.004829669,0.004563178,0.002481834,0.01199229],"category_scores_gemma":[0.050798226,0.0008773399,0.0015625271,0.0025478944,0.0050684744,0.010600443,0.007220807,0.006297366,0.001471212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007469664,0.00014946374,0.0019186996,0.00023846184,0.000081070604,0.0001868951,0.0002731586,0.087020956,0.0009851371,0.8843064,0.009021786,0.015070973],"study_design_scores_gemma":[0.000056138295,0.00002621436,0.00017922124,0.000038582843,0.000022264989,0.00005004508,0.000055178734,0.23537216,0.00070122734,0.76252115,0.00095743086,0.00002036101],"about_ca_topic_score_codex":0.001891221,"about_ca_topic_score_gemma":0.0017432417,"teacher_disagreement_score":0.01199229,"about_ca_system_score_codex":0.0029994878,"about_ca_system_score_gemma":0.0024486925,"threshold_uncertainty_score":0.040118158},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016628936509888077,"score_gpt":0.25581643118246233,"score_spread":0.23918749467257425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801491268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08266494,0.0008437606,0.89695334,0.0038894862,0.00024931433,0.00024750276,0.0007115389,0.003884048,0.010555965],"genre_scores_gemma":[0.9455435,0.00029867282,0.049884833,0.0004426935,0.00012222034,0.00011952617,0.00030633065,0.00007592113,0.003206225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947916,0.0017955855,0.00031923375,0.0005191924,0.0019222043,0.0006522008],"domain_scores_gemma":[0.990348,0.0027116737,0.0008371227,0.005038556,0.0008329371,0.00023176307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030915237,0.00060724857,0.0009613901,0.00085764605,0.001086555,0.0022341742,0.0015149364,0.0015243464,0.0038499779],"category_scores_gemma":[0.008522593,0.00031368554,0.000674089,0.0017185998,0.0016783025,0.004537273,0.00301779,0.0028973483,0.0012931493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022530784,0.000808087,0.004262608,0.00039518345,0.00016846436,0.0011043944,0.00034768152,0.29193258,0.025840811,0.35416135,0.025936682,0.29278898],"study_design_scores_gemma":[0.00008817323,0.000082224666,0.00029591634,0.000024447396,0.000014613096,0.00029602193,0.000052663843,0.8908822,0.017279487,0.084634796,0.0063251397,0.000024305009],"about_ca_topic_score_codex":0.0009278428,"about_ca_topic_score_gemma":0.00064651994,"teacher_disagreement_score":0.0038499779,"about_ca_system_score_codex":0.0018122974,"about_ca_system_score_gemma":0.0023801597,"threshold_uncertainty_score":0.016349792},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.05255794342517325,"score_gpt":0.3334524473528274,"score_spread":0.2808945039276542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801958627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19742422,0.0020118665,0.7883007,0.0010469208,0.00013741716,0.000958919,0.00021393456,0.0043047303,0.005601278],"genre_scores_gemma":[0.8657269,0.0009397728,0.13044897,0.00014914856,0.00003628685,0.00032409627,0.00020400465,0.00013830315,0.0020324294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706984,0.0011090222,0.00014684052,0.00029648066,0.0011332579,0.00024462817],"domain_scores_gemma":[0.9959037,0.0016531583,0.0004394807,0.00085191336,0.0009442698,0.00020751441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036900626,0.000745469,0.00091432134,0.00061736006,0.00032140376,0.0012605115,0.0021997143,0.00095448387,0.0033338002],"category_scores_gemma":[0.008720457,0.00037236905,0.00048753727,0.0005829761,0.00071916793,0.0021617028,0.0014184843,0.0010559623,0.0011953111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003568576,0.0014205343,0.0070100757,0.0009230648,0.00034585927,0.00069041457,0.00014460151,0.58629924,0.020063192,0.019944418,0.006751638,0.35283846],"study_design_scores_gemma":[0.00016354817,0.00056430825,0.00034153627,0.000013282171,0.000029924871,0.00019496317,0.000017470044,0.98742074,0.008927232,0.0013838935,0.00092841755,0.000014769549],"about_ca_topic_score_codex":0.0012889176,"about_ca_topic_score_gemma":0.0006208787,"teacher_disagreement_score":0.0036900626,"about_ca_system_score_codex":0.0012040845,"about_ca_system_score_gemma":0.0012994931,"threshold_uncertainty_score":0.019515157},"labels":[],"label_agreement":null},{"id":"W2806023047","doi":"10.1007/978-3-319-93354-2_10","title":"Directional Distance-Bounding Identification","year":2018,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Identification (biology); Bounding overwatch; Computer science; Information retrieval; Artificial intelligence; Biology; Botany","score_opus":0.034449012851772716,"score_gpt":0.2910843220941728,"score_spread":0.2566353092424001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806023047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003550022,0.0034796835,0.86857104,0.00033398814,0.0008078036,0.0000525983,0.00019260698,0.0011912961,0.12182094],"genre_scores_gemma":[0.17888716,0.009250071,0.5831294,0.00086282607,0.000595325,0.00023753653,0.0019313343,0.0008527117,0.22425368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990121,0.00013384662,0.000044351942,0.00021771724,0.00049856654,0.00009345515],"domain_scores_gemma":[0.9993524,0.0001672459,0.00004504197,0.00023501368,0.00017134451,0.000029025949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503073,0.0011479963,0.00077133847,0.0012983413,0.0008538658,0.001761172,0.0015063717,0.0011368786,0.010764198],"category_scores_gemma":[0.0017622496,0.00051493256,0.00043196903,0.0016358334,0.0012633187,0.002831019,0.0033321069,0.0021631904,0.010417065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008350272,0.000035494842,0.00026106063,0.00021571203,0.000013995939,0.000086592416,0.00018354689,0.010195427,0.009500657,0.5251345,0.031728867,0.42256066],"study_design_scores_gemma":[0.000015611038,0.00012378916,0.00048785013,0.00030197593,0.00003489862,0.0014824421,0.00022211655,0.09915328,0.030405222,0.36634663,0.5013359,0.000090166635],"about_ca_topic_score_codex":0.00044980893,"about_ca_topic_score_gemma":0.0003549625,"teacher_disagreement_score":0.010764198,"about_ca_system_score_codex":0.00072522374,"about_ca_system_score_gemma":0.00063892314,"threshold_uncertainty_score":0.036009848},"labels":[],"label_agreement":null},{"id":"W2807633791","doi":"10.1109/tkde.2018.2857471","title":"Secure and Efficient Skyline Queries on Encrypted Data","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Institutes of Health; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Patient-Centered Outcomes Research Institute","keywords":"Computer science; Encryption; Cloud computing; Skyline; Scalability; Database; Outsourcing; Computer network; Data mining; Operating system","score_opus":0.02885223219186742,"score_gpt":0.2747359068435998,"score_spread":0.24588367465173236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807633791","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15149789,0.00029678323,0.84226245,0.00069112016,0.000032007625,0.00029603177,0.00063138775,0.001097796,0.003194551],"genre_scores_gemma":[0.83801925,0.00025048302,0.15802492,0.00014422093,0.00005103223,0.0002377427,0.0007288422,0.00014045667,0.002402951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509287,0.0013148164,0.00051182864,0.00059853046,0.0017483186,0.0007336594],"domain_scores_gemma":[0.99314356,0.0023869264,0.0009051582,0.0024539628,0.0009103302,0.00020015417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030287115,0.0006326549,0.001178503,0.00064045034,0.0010711699,0.0023985158,0.0013030643,0.0009972113,0.0018948412],"category_scores_gemma":[0.0072984686,0.00035511583,0.00081333093,0.0012575147,0.0012546333,0.005943774,0.0032840224,0.0011924254,0.0007991684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036762808,0.0005608113,0.0056375824,0.0005793499,0.00031024875,0.0012722018,0.0028565663,0.3116879,0.18238978,0.25950667,0.013616292,0.21790637],"study_design_scores_gemma":[0.00021702414,0.00040228036,0.00097249186,0.000030734427,0.00004472583,0.00051830645,0.00080550084,0.82289934,0.06958849,0.09675914,0.0077071134,0.00005481993],"about_ca_topic_score_codex":0.0012704143,"about_ca_topic_score_gemma":0.0013378544,"teacher_disagreement_score":0.0030287115,"about_ca_system_score_codex":0.0011341599,"about_ca_system_score_gemma":0.0016477352,"threshold_uncertainty_score":0.016017497},"labels":[],"label_agreement":null},{"id":"W280815280","doi":"10.1007/978-3-319-17470-9_2","title":"Generalizing Efficient Multiparty Computation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Oblivious transfer; Computer science; Verifiable secret sharing; Compiler; Mathematical proof; Overhead (engineering); Computation; Transformation (genetics); Theoretical computer science; Transfer (computing); Focus (optics); Secure multi-party computation; Protocol (science); Construct (python library); Communication source; Algorithm; Parallel computing; Programming language; Mathematics; Computer network; Set (abstract data type)","score_opus":0.035379816763865535,"score_gpt":0.27464301593401835,"score_spread":0.23926319917015282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W280815280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010522174,0.0014550755,0.8482741,0.0014373569,0.0007439975,0.00014259259,0.0002960973,0.0011162639,0.13601243],"genre_scores_gemma":[0.47724646,0.0053203176,0.36765864,0.0015433914,0.0018591022,0.0007900186,0.0015042875,0.002429885,0.1416479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834204,0.00038792807,0.000078396326,0.00033596685,0.0006352832,0.00022030072],"domain_scores_gemma":[0.99825555,0.0005427945,0.000054373882,0.0009696858,0.00012324058,0.00005435024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013308573,0.0014330517,0.0014436528,0.0013719512,0.001195651,0.0025059138,0.0022103942,0.0014257317,0.01257073],"category_scores_gemma":[0.0040832134,0.0007899345,0.002212323,0.002095897,0.0024366481,0.006420156,0.006491793,0.006517869,0.004805541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020857318,0.00002100283,0.000034509194,0.00008027088,0.000014786485,0.00002765323,0.000051884537,0.0058779707,0.0012361442,0.96564215,0.0032958188,0.023696985],"study_design_scores_gemma":[0.0000060012308,0.0000063641423,0.000040274936,0.000021149692,0.0000075481553,0.00003627478,0.000005448348,0.01798286,0.0007655237,0.9684436,0.01267772,0.000007293311],"about_ca_topic_score_codex":0.00044588928,"about_ca_topic_score_gemma":0.0004837815,"teacher_disagreement_score":0.01257073,"about_ca_system_score_codex":0.0016546691,"about_ca_system_score_gemma":0.00061653246,"threshold_uncertainty_score":0.042053282},"labels":[],"label_agreement":null},{"id":"W2808349928","doi":"10.1109/isps.2018.8379018","title":"Towards privacy and ownership preserving of outsourced health data in IoT-cloud context","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Outsourcing; Encryption; Computer science; Cloud computing; Computer security; Client-side encryption; Access control; Attribute-based encryption; Service provider; Context (archaeology); Information privacy; Service (business); On-the-fly encryption; Public-key cryptography; Business; Operating system","score_opus":0.09751251695423295,"score_gpt":0.33200321556005097,"score_spread":0.234490698605818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808349928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05032264,0.0008110729,0.943515,0.0010970038,0.00010862254,0.000085595275,0.00020094884,0.00020001772,0.0036589974],"genre_scores_gemma":[0.9131558,0.0007052005,0.083323605,0.00022769258,0.0001185479,0.000060808048,0.0001887827,0.000046739427,0.0021727877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679023,0.0009505656,0.00026400862,0.0005385195,0.0010466698,0.000410019],"domain_scores_gemma":[0.9939627,0.0012595127,0.0006125559,0.0033354785,0.0006118071,0.00021789288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002891806,0.00038479394,0.00079601887,0.00041457452,0.00090401166,0.0026664422,0.001417869,0.0008717149,0.0010719094],"category_scores_gemma":[0.006026403,0.00027399295,0.0008575799,0.0009377214,0.0017441482,0.00660613,0.0041294163,0.0016947857,0.0002944031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008175148,0.00029854392,0.0066987034,0.0004972544,0.00023921048,0.0013388178,0.001858907,0.085331306,0.03415981,0.69998986,0.006235065,0.162535],"study_design_scores_gemma":[0.00008289166,0.00021266821,0.0024470564,0.00010760226,0.00014723076,0.0016937886,0.0010170847,0.5630909,0.042102285,0.36664504,0.022380395,0.00007311034],"about_ca_topic_score_codex":0.0008752972,"about_ca_topic_score_gemma":0.00048743273,"teacher_disagreement_score":0.002891806,"about_ca_system_score_codex":0.000849168,"about_ca_system_score_gemma":0.0013901395,"threshold_uncertainty_score":0.015293539},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.024566234672122052,"score_gpt":0.2615881485768737,"score_spread":0.23702191390475164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2866028610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028482825,0.00040097756,0.93615156,0.0010384873,0.0003665579,0.0004025886,0.00059436634,0.0036761079,0.028886523],"genre_scores_gemma":[0.532029,0.00055019895,0.42829838,0.00097857,0.00020750049,0.00069211767,0.0011139557,0.000853515,0.03527673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754685,0.00056525215,0.00014615337,0.00038229531,0.0010375502,0.00032190146],"domain_scores_gemma":[0.99858296,0.00036047612,0.00013604978,0.0005175698,0.00021552772,0.00018731732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016957087,0.0005896116,0.0010322281,0.0007140596,0.0016217359,0.0022109046,0.0021292313,0.0012757672,0.008308574],"category_scores_gemma":[0.0036361332,0.00051882345,0.001113465,0.001097927,0.0027914618,0.0058073425,0.0065555857,0.0037246945,0.005889385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047251253,0.00018452964,0.00034982673,0.00029299964,0.00005735476,0.0003310972,0.00038822123,0.019210916,0.016020788,0.88850427,0.0116497325,0.062537715],"study_design_scores_gemma":[0.00026345512,0.00028976746,0.00020724423,0.00008220971,0.000054348497,0.0007393028,0.00015127186,0.1462456,0.053027228,0.7274542,0.07129535,0.00019007428],"about_ca_topic_score_codex":0.00043851745,"about_ca_topic_score_gemma":0.00063071126,"teacher_disagreement_score":0.008308574,"about_ca_system_score_codex":0.0009805682,"about_ca_system_score_gemma":0.002843514,"threshold_uncertainty_score":0.027794898},"labels":[],"label_agreement":null},{"id":"W2885860722","doi":"10.1109/icc.2018.8422734","title":"XRQuery: Achieving Communication-Efficient Privacy-Preserving Query for Fog-Enhanced IoT","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Internet of Things; Scheme (mathematics); Computer network; Computer security; Fog computing; Information privacy; Service provider; Private information retrieval; Service (business)","score_opus":0.019279244823238298,"score_gpt":0.27979672577814774,"score_spread":0.26051748095490945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885860722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045729313,0.0015912172,0.94470614,0.0007597513,0.00025491643,0.0003309082,0.00037210496,0.0016001516,0.0046554524],"genre_scores_gemma":[0.85893446,0.001077046,0.13362068,0.00094595755,0.00025799515,0.00020301087,0.00065482856,0.00013964514,0.004166347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974764,0.0004742035,0.00020090034,0.00040398713,0.00095359696,0.0004907643],"domain_scores_gemma":[0.99809355,0.0005381566,0.00018522401,0.0007132586,0.00035248266,0.00011739447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022661542,0.0007358218,0.0014074544,0.0006503977,0.0013946593,0.0018232256,0.0017667313,0.0013416307,0.0015310746],"category_scores_gemma":[0.003229926,0.00028478744,0.00094883464,0.0013836016,0.0013405356,0.0053651403,0.003743487,0.0015406148,0.0005058354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033256777,0.00064124534,0.003949276,0.0008584814,0.00042202347,0.0027413878,0.0023912257,0.11562299,0.21386448,0.2576299,0.04353582,0.3550175],"study_design_scores_gemma":[0.000294307,0.00074274186,0.0013075392,0.00005516381,0.00019293764,0.0021032263,0.00063401187,0.8175669,0.057202954,0.08739138,0.032304652,0.00020429412],"about_ca_topic_score_codex":0.0021888127,"about_ca_topic_score_gemma":0.0015303887,"teacher_disagreement_score":0.0022661542,"about_ca_system_score_codex":0.00095263415,"about_ca_system_score_gemma":0.0014037223,"threshold_uncertainty_score":0.011984706},"labels":[],"label_agreement":null},{"id":"W2886904996","doi":"10.1016/j.cmpb.2018.08.007","title":"Secure large-scale genome data storage and query","year":2018,"lang":"en","type":"article","venue":"Computer Methods and Programs in Biomedicine","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Center for Advancing Translational Sciences; National Institute of General Medical Sciences; National Heart, Lung, and Blood Institute; National Institutes of Health","keywords":"Computer science; Scalability; Cloud computing; Bottleneck; Search engine indexing; Big data; Speedup; Graph database; Graph; Distributed computing; Database; Data mining; Theoretical computer science; Information retrieval; Parallel computing; Operating system","score_opus":0.06295864043176615,"score_gpt":0.3642856515405157,"score_spread":0.30132701110874954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886904996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12787057,0.0017575234,0.8193789,0.006155004,0.0008888629,0.0004978092,0.004380255,0.024495719,0.014575342],"genre_scores_gemma":[0.8850043,0.00058673316,0.09446671,0.0014130408,0.00038644738,0.0004436167,0.0051807617,0.0009342921,0.011584056],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99459237,0.0009062474,0.0004853965,0.0007795948,0.0024753935,0.0007609272],"domain_scores_gemma":[0.98023957,0.003573748,0.0008419997,0.013810073,0.001208883,0.00032574678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002879955,0.0007897249,0.0013168914,0.001225474,0.0016071061,0.004003216,0.002663233,0.002095445,0.0065435977],"category_scores_gemma":[0.011728208,0.00056929275,0.0008479248,0.0024181183,0.0019161461,0.006877007,0.0073229866,0.0020556834,0.0052557765],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006471859,0.0005365994,0.0087191425,0.0006989404,0.0005355855,0.0015619552,0.0015317887,0.05000923,0.1195966,0.32211906,0.1206765,0.36754277],"study_design_scores_gemma":[0.00055071746,0.00035188082,0.002600325,0.00010093671,0.0002030459,0.0011329285,0.0007243281,0.37472045,0.17464544,0.3932158,0.051614653,0.00013940175],"about_ca_topic_score_codex":0.0014400382,"about_ca_topic_score_gemma":0.00111829,"teacher_disagreement_score":0.0065435977,"about_ca_system_score_codex":0.0017849922,"about_ca_system_score_gemma":0.0024837472,"threshold_uncertainty_score":0.021890521},"labels":[],"label_agreement":null},{"id":"W2887133168","doi":"10.4230/lipics.itcs.2019.53","title":"Secret Sharing with Binary Shares","year":2018,"lang":"en","type":"preprint","venue":"DR-NTU (Nanyang Technological University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; National Science Foundation","keywords":"Secret sharing; Secrecy; Information-theoretic security; Mathematics; Homomorphic secret sharing; Secure multi-party computation; Discrete mathematics; Shamir's Secret Sharing; Binary number; Impossibility; Combinatorics; Computer science; Cryptography; Algorithm; Computer security; Arithmetic; Law","score_opus":0.021657924396641434,"score_gpt":0.20945147189812202,"score_spread":0.18779354750148058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887133168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1914311,0.00086767337,0.7597693,0.0014971704,0.00016324848,0.00020052772,0.00041252165,0.00041140398,0.045246974],"genre_scores_gemma":[0.9386849,0.00035013637,0.055009395,0.00020950091,0.00008341234,0.000103255225,0.00014199544,0.000046362995,0.005371208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968521,0.0008815626,0.00016977443,0.0006352322,0.0009040179,0.0005573202],"domain_scores_gemma":[0.99727964,0.00084087864,0.0003026183,0.0012562423,0.00020436302,0.00011627032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021491465,0.0005509626,0.00075361924,0.0005095051,0.00091564824,0.0019290899,0.0014874005,0.0015370204,0.0035233265],"category_scores_gemma":[0.0064830123,0.0003855057,0.0009738698,0.00094656955,0.0030623495,0.0057447394,0.0040794862,0.002221642,0.00067292113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022942125,0.000035031488,0.00030171266,0.000088539986,0.000023385122,0.00011919711,0.0002826767,0.025800018,0.0069354977,0.9513443,0.00081989606,0.014020275],"study_design_scores_gemma":[0.0000702876,0.00014939747,0.00031597115,0.00006252045,0.000031947184,0.0003929026,0.000089455854,0.23371202,0.013756761,0.74272645,0.00863002,0.00006219076],"about_ca_topic_score_codex":0.00032809688,"about_ca_topic_score_gemma":0.00018921068,"teacher_disagreement_score":0.0035233265,"about_ca_system_score_codex":0.0016067956,"about_ca_system_score_gemma":0.00090769713,"threshold_uncertainty_score":0.011786699},"labels":[],"label_agreement":null},{"id":"W2887297155","doi":"10.1109/icc.2018.8422279","title":"EFRS:Enabling Efficient and Fine-Grained Range Search on Encrypted Spatial Data","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Encryption; Range query (database); Bottleneck; Cloud computing; Overhead (engineering); Exploit; Range (aeronautics); Data mining; Outsourcing; Spatial analysis; Web search query; Information retrieval; Search engine; Sargable; Computer network; Computer security; Mathematics","score_opus":0.047106547938685926,"score_gpt":0.29207032015220546,"score_spread":0.24496377221351953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887297155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08776928,0.0012081829,0.9034168,0.0003645988,0.00008590032,0.00021469418,0.00033203146,0.0012223803,0.005386142],"genre_scores_gemma":[0.85354614,0.0007964756,0.14134501,0.00012096848,0.000052233918,0.0000950238,0.00030603,0.00004865269,0.0036894449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985904,0.0002591139,0.00012734448,0.00017249749,0.0005903333,0.00026028987],"domain_scores_gemma":[0.9982863,0.00041275928,0.00020667262,0.0008124004,0.00021370052,0.00006809187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077849574,0.0003416722,0.00068163767,0.0007781283,0.00051989075,0.00089093146,0.0010376202,0.0007690533,0.001879971],"category_scores_gemma":[0.002551973,0.00020302257,0.00059765315,0.0014686896,0.0008323495,0.0042196014,0.0022321003,0.00081518927,0.00067986303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012277418,0.00039380038,0.0033160688,0.0006559776,0.000144396,0.0013809443,0.0011146069,0.16661029,0.19387074,0.2213985,0.008752864,0.40113398],"study_design_scores_gemma":[0.00015307164,0.0006731255,0.0012168322,0.000065415225,0.000066652385,0.003038869,0.00045555958,0.8078505,0.10816998,0.051777747,0.026394533,0.00013765291],"about_ca_topic_score_codex":0.0014091167,"about_ca_topic_score_gemma":0.0010100371,"teacher_disagreement_score":0.001879971,"about_ca_system_score_codex":0.00061645755,"about_ca_system_score_gemma":0.00091575726,"threshold_uncertainty_score":0.006289065},"labels":[],"label_agreement":null},{"id":"W2889101798","doi":"10.1109/ccece.2018.8447708","title":"A PIR Scheme to Improve the Computation Cost on the Client-Side of Smartphone Applications","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overhead (engineering); Client-side; Cryptography; Scheme (mathematics); Database; Server; Focus (optics); Private information retrieval; Database server; Cryptographic primitive; Computer network; Computer security; Cryptographic protocol; Operating system","score_opus":0.019393326874543204,"score_gpt":0.27572153238955993,"score_spread":0.2563282055150167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889101798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04436019,0.0034531453,0.9268763,0.0008857148,0.00046817752,0.0008291177,0.00021328857,0.0051753186,0.017738711],"genre_scores_gemma":[0.6646192,0.0013349358,0.3154794,0.0007256304,0.00033836483,0.00050568423,0.00046561036,0.00018785484,0.016343256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968256,0.0007158317,0.0002774812,0.000401826,0.0012739011,0.0005055017],"domain_scores_gemma":[0.9960672,0.0006672435,0.00026156742,0.0019454639,0.0009003364,0.00015817927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018058298,0.0009828794,0.001398858,0.00097252853,0.0011409889,0.0014677934,0.0023107359,0.0012874012,0.00728559],"category_scores_gemma":[0.004259254,0.00048351983,0.000820419,0.0011939161,0.00086191396,0.0051992093,0.0040697204,0.0019816132,0.003987895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002596644,0.000745558,0.0018320308,0.0014706207,0.00025147767,0.0013608558,0.00072636025,0.022759354,0.19565667,0.1431307,0.029083429,0.60038626],"study_design_scores_gemma":[0.00075648894,0.0025273957,0.0019948645,0.0002595812,0.00041781805,0.0071170647,0.00050450506,0.62915975,0.1901166,0.054536458,0.11224678,0.00036280864],"about_ca_topic_score_codex":0.00068279984,"about_ca_topic_score_gemma":0.00048765045,"teacher_disagreement_score":0.00728559,"about_ca_system_score_codex":0.0007668326,"about_ca_system_score_gemma":0.001490456,"threshold_uncertainty_score":0.024372756},"labels":[],"label_agreement":null},{"id":"W2891490313","doi":"10.1145/3145624","title":"Securing Communication Data in Pervasive Social Networking Based on Trust with KP-ABE","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Cyber-Physical Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Basic Research Program of Shaanxi Province; National Key Research and Development Program of China; Higher Education Discipline Innovation Project; Academy of Finland; National Natural Science Foundation of China","keywords":"Computer science; Dependability; Computer security; Scalability; Encryption; Access control; Ubiquitous computing; Flexibility (engineering); Database; Human–computer interaction","score_opus":0.03713237432394022,"score_gpt":0.2809267279897467,"score_spread":0.24379435366580648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891490313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1048731,0.00072764046,0.88308185,0.00087728683,0.00012004767,0.00032044054,0.00009090446,0.0006010387,0.009307697],"genre_scores_gemma":[0.9196554,0.00029907003,0.07741349,0.000104224695,0.000033051307,0.00009648479,0.00005361856,0.000024479214,0.0023202142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968989,0.00080812856,0.00032035663,0.00034171063,0.0012272078,0.0004036589],"domain_scores_gemma":[0.99775,0.00061138533,0.00035739245,0.0006852613,0.00044136035,0.00015449798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015704056,0.00047926573,0.0010039805,0.00048376815,0.0012893332,0.0017972344,0.0009886294,0.0008550386,0.0009195515],"category_scores_gemma":[0.0044490914,0.00029478647,0.00071150996,0.0006457573,0.001025275,0.005523811,0.0027938464,0.0013394437,0.0003719316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012930471,0.00051528617,0.0048903916,0.00065035454,0.00024446382,0.001869658,0.001922505,0.17601813,0.067808114,0.4989658,0.006517087,0.23930517],"study_design_scores_gemma":[0.00005883424,0.00016772628,0.00061785104,0.000040377763,0.00007280068,0.0008909231,0.00033305495,0.8696532,0.023248712,0.09593083,0.008926292,0.000059313446],"about_ca_topic_score_codex":0.0014596385,"about_ca_topic_score_gemma":0.0012506114,"teacher_disagreement_score":0.0017972344,"about_ca_system_score_codex":0.0014617612,"about_ca_system_score_gemma":0.0016059108,"threshold_uncertainty_score":0.010605872},"labels":[],"label_agreement":null},{"id":"W2891491123","doi":"10.1145/3220267.3220271","title":"Privacy-Preserving Personal Health Record (P3HR)","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; University of Windsor","keywords":"Revocation; Internet privacy; Health care; Computer security; Patient portal; Encryption; Computer science; Information privacy","score_opus":0.027721097389818733,"score_gpt":0.2854074170826188,"score_spread":0.2576863196928001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891491123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022316247,0.0020530233,0.94128597,0.0011853607,0.0002222371,0.00087710336,0.0014117343,0.012125533,0.018522808],"genre_scores_gemma":[0.6839727,0.002114958,0.29036018,0.002015401,0.00040122351,0.0005018385,0.0024010818,0.00033811262,0.017894465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572146,0.0013186882,0.00046897776,0.0007304217,0.0013984342,0.00036197255],"domain_scores_gemma":[0.9928034,0.001443813,0.000739534,0.004007774,0.00078041444,0.00022499578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002961788,0.00041638632,0.00052721077,0.00065208186,0.00080644357,0.0017573101,0.0016115031,0.0013289764,0.0038702658],"category_scores_gemma":[0.0059902165,0.00033164077,0.0007925433,0.0011933737,0.0007240595,0.0030387912,0.003473086,0.0010819029,0.0030249543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015147701,0.00033017425,0.00867636,0.0019506038,0.00031346842,0.0022470471,0.002429364,0.004724535,0.06384609,0.08502854,0.04272642,0.7862127],"study_design_scores_gemma":[0.00037378818,0.001631505,0.017548783,0.00050222676,0.0005277335,0.014050418,0.0009385006,0.12691614,0.24741496,0.053173788,0.5365589,0.00036325387],"about_ca_topic_score_codex":0.001000118,"about_ca_topic_score_gemma":0.0005110501,"teacher_disagreement_score":0.0038702658,"about_ca_system_score_codex":0.00037674973,"about_ca_system_score_gemma":0.0009536512,"threshold_uncertainty_score":0.015663624},"labels":[],"label_agreement":null},{"id":"W2892991540","doi":"10.4018/ijdwm.2018100103","title":"An Encryption Methodology for Enabling the Use of Data Warehouses on the Cloud","year":2018,"lang":"en","type":"article","venue":"International Journal of Data Warehousing and Mining","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Encryption; Computer science; Client-side encryption; Filesystem-level encryption; Cloud computing; Homomorphic encryption; On-the-fly encryption; 40-bit encryption; 56-bit encryption; Database; Computer security; Operating system","score_opus":0.5255598604403172,"score_gpt":0.4357902813132018,"score_spread":0.08976957912711542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892991540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04328583,0.0004971096,0.951938,0.00033394832,0.000031122996,0.0002671854,0.00007175113,0.00019216783,0.0033829377],"genre_scores_gemma":[0.47895104,0.0008192734,0.5177531,0.00012579965,0.000019007475,0.00011121872,0.00015308961,0.000027421922,0.0020400125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989563,0.00033262704,0.00011548091,0.00009458612,0.00040773014,0.000093219474],"domain_scores_gemma":[0.9989195,0.0002595961,0.00015887992,0.00034686385,0.0002806103,0.000034698744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014351548,0.00023984275,0.00020668421,0.00049289694,0.00044104643,0.0010512862,0.0005533543,0.0004026378,0.00086172955],"category_scores_gemma":[0.0019065193,0.0001785348,0.0004935339,0.0005670408,0.0004386076,0.0019309351,0.0007928322,0.0005829303,0.0002760668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034567638,0.00036305323,0.0034876368,0.0005394347,0.00012397341,0.000574044,0.0005383824,0.07201441,0.1725608,0.3250318,0.003352317,0.4210685],"study_design_scores_gemma":[0.00009903038,0.00091484166,0.0028662784,0.00017623408,0.00014424742,0.0030162393,0.00069000403,0.53754675,0.3198666,0.077426076,0.05715468,0.00009904663],"about_ca_topic_score_codex":0.00046801634,"about_ca_topic_score_gemma":0.0004672804,"teacher_disagreement_score":0.0014351548,"about_ca_system_score_codex":0.0005825834,"about_ca_system_score_gemma":0.0011197883,"threshold_uncertainty_score":0.0075899363},"labels":[],"label_agreement":null},{"id":"W2894418998","doi":"10.1109/iciot.2018.00024","title":"(WIP) Authenticated Key Management Protocols for Internet of Things","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Key (lock); Internet of Things; Key management; Computer network; The Internet; Computer security; World Wide Web; Cryptography","score_opus":0.024720623356858068,"score_gpt":0.2955838393131839,"score_spread":0.2708632159563258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894418998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030666308,0.0029550157,0.96668863,0.0010593203,0.0010984011,0.0005237321,0.0004177803,0.0015668136,0.022623662],"genre_scores_gemma":[0.2575173,0.007924727,0.6733173,0.002252509,0.00080932485,0.004303784,0.002678884,0.00047327156,0.050722856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982053,0.00047246963,0.0002500207,0.00020505447,0.00068418344,0.00018290352],"domain_scores_gemma":[0.9986528,0.00026377014,0.0002033563,0.00045103554,0.00037686276,0.000052092906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016814388,0.000745012,0.0004563705,0.00088703376,0.0014937316,0.0019998176,0.001456975,0.0017938482,0.007297149],"category_scores_gemma":[0.0042715757,0.00040507843,0.0006472656,0.0017822091,0.0010892599,0.0057024024,0.0027402015,0.0026295623,0.0055767274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043375388,0.00008156852,0.00035155582,0.0012544825,0.00007020222,0.0007425373,0.0005609246,0.0055824514,0.021029046,0.61713666,0.044248845,0.30850792],"study_design_scores_gemma":[0.0001505113,0.00036917548,0.00040881053,0.0003649068,0.000103749495,0.0026666962,0.0001992734,0.03910366,0.031297974,0.33247638,0.5927304,0.00012839214],"about_ca_topic_score_codex":0.00029183098,"about_ca_topic_score_gemma":0.0002562096,"teacher_disagreement_score":0.007297149,"about_ca_system_score_codex":0.0005309785,"about_ca_system_score_gemma":0.001310089,"threshold_uncertainty_score":0.02441144},"labels":[],"label_agreement":null},{"id":"W2896260134","doi":"10.1109/pst.2017.00056","title":"A Post-Quantum One Time Signature Using Bloom Filter","year":2017,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bloom filter; Computer science; Digital signature; Hash function; Signature (topology); Computer security; Adversary; Property (philosophy); Public-key cryptography; Quantum; Computer network; Mathematics; Encryption; Physics","score_opus":0.024636652099222955,"score_gpt":0.2568563270017464,"score_spread":0.23221967490252343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896260134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03814911,0.00023757771,0.94854486,0.00055669213,0.00017269448,0.00026484934,0.00032256008,0.0019165361,0.009835088],"genre_scores_gemma":[0.5292353,0.00044177336,0.45349568,0.00035689035,0.00012457666,0.00028207822,0.0005202509,0.00009531476,0.015448111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980812,0.00027926976,0.0001570684,0.00034335436,0.00093741145,0.00020162444],"domain_scores_gemma":[0.9982628,0.0003523616,0.00019939194,0.00067135936,0.00041468168,0.00009929493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010012429,0.00046018677,0.0007136668,0.00084564823,0.0011797785,0.0018431232,0.001264187,0.0014088341,0.00400307],"category_scores_gemma":[0.0019245261,0.00029883155,0.00071485667,0.0014459939,0.0011893315,0.004303156,0.0012067144,0.00089375646,0.0015988293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012007485,0.0002744055,0.002537523,0.00033641313,0.000104437546,0.0005321113,0.0003610828,0.021271817,0.1933565,0.5416362,0.008292317,0.23009643],"study_design_scores_gemma":[0.00033404995,0.00054564176,0.0010033936,0.00008541372,0.000121665325,0.0019864407,0.00012752131,0.42382017,0.33427712,0.1716264,0.065829955,0.00024220465],"about_ca_topic_score_codex":0.0014219384,"about_ca_topic_score_gemma":0.0014849933,"teacher_disagreement_score":0.00400307,"about_ca_system_score_codex":0.0015800865,"about_ca_system_score_gemma":0.0026933006,"threshold_uncertainty_score":0.013391614},"labels":[],"label_agreement":null},{"id":"W2896582760","doi":"10.1007/s12083-018-0691-8","title":"Secure, flexible and high-efficient similarity search over encrypted data in multiple clouds","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Encryption; Computer science; Similarity (geometry); Data mining; Information retrieval; Computer network; Artificial intelligence","score_opus":0.045437547255528864,"score_gpt":0.3103035509543397,"score_spread":0.26486600369881086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896582760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3373988,0.001254279,0.65586734,0.00076680654,0.00017907112,0.00024554977,0.00025257264,0.0008866299,0.0031489795],"genre_scores_gemma":[0.9417295,0.00019251241,0.05644133,0.000047755202,0.000045501805,0.00003650055,0.00013671968,0.000023427952,0.001346801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629563,0.0006098287,0.00036314226,0.00042285473,0.0017305565,0.00057792483],"domain_scores_gemma":[0.99558854,0.0013041275,0.0006064476,0.001536999,0.00072626583,0.00023767044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017652477,0.00043595358,0.0018812196,0.0010415824,0.0014577507,0.002319952,0.0019422049,0.0014233841,0.0010041767],"category_scores_gemma":[0.007033349,0.00053571747,0.00065804296,0.0022897949,0.0008890828,0.0051448923,0.0035471339,0.0010049333,0.00053948193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038101384,0.00071208656,0.007689322,0.0005288834,0.00039620075,0.0019119118,0.0007838613,0.47926384,0.08785422,0.08777164,0.008736611,0.32054123],"study_design_scores_gemma":[0.000074662195,0.00014202378,0.0006034568,0.000011284351,0.0000356321,0.00046382227,0.0002057824,0.96143216,0.015522625,0.020293092,0.0011900836,0.00002537193],"about_ca_topic_score_codex":0.0026711202,"about_ca_topic_score_gemma":0.0027035614,"teacher_disagreement_score":0.0026711202,"about_ca_system_score_codex":0.0012171129,"about_ca_system_score_gemma":0.002279786,"threshold_uncertainty_score":0.009335637},"labels":[],"label_agreement":null},{"id":"W2896989099","doi":"10.1080/02564602.2018.1531734","title":"Efficient Fully Homomorphic Encryption with Large Plaintext Space","year":2018,"lang":"en","type":"article","venue":"IETE Technical Review","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Development and Reform Commission; National Youth Foundation of China; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Plaintext; Encryption; Computer security","score_opus":0.011225472866937721,"score_gpt":0.26246640765832985,"score_spread":0.25124093479139215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896989099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034074765,0.012182897,0.9384867,0.000856011,0.00013651629,0.00012515343,0.0001400655,0.0006258776,0.013371972],"genre_scores_gemma":[0.6645952,0.015510981,0.30687347,0.00040816853,0.00038200986,0.000229241,0.00042180647,0.000106848405,0.011472282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841416,0.0004063065,0.000102383114,0.00018751709,0.00073371816,0.0001558618],"domain_scores_gemma":[0.9990213,0.0003075717,0.00010290333,0.00039990753,0.00014596264,0.000022261178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092464546,0.00038339302,0.0005898828,0.0005748741,0.00030810418,0.0013599143,0.000795822,0.00057391,0.001559679],"category_scores_gemma":[0.0016295445,0.00031884105,0.00047060993,0.0009960803,0.00082203693,0.0041784965,0.001385916,0.0012709027,0.00081208604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023360047,0.00014809474,0.0005191914,0.00072709966,0.000076912715,0.0004112727,0.00021488885,0.042209778,0.050790757,0.51405346,0.007791648,0.38282326],"study_design_scores_gemma":[0.00018282396,0.00040505757,0.0011532899,0.00022077798,0.00007683604,0.0021330393,0.00009769496,0.46753576,0.10852621,0.31533134,0.10420739,0.00012981356],"about_ca_topic_score_codex":0.0002067881,"about_ca_topic_score_gemma":0.00015737682,"teacher_disagreement_score":0.001559679,"about_ca_system_score_codex":0.00053109566,"about_ca_system_score_gemma":0.0008177103,"threshold_uncertainty_score":0.005217612},"labels":[],"label_agreement":null},{"id":"W2897151058","doi":"10.22331/q-2021-04-08-429","title":"Towards Quantum One-Time Memories from Stateless Hardware","year":2021,"lang":"en","type":"article","venue":"Quantum","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; Air Force Office of Scientific Research; University of Ottawa; National Science Foundation","keywords":"Computer science; Stateless protocol; Oblivious transfer; Universal composability; Theoretical computer science; Cryptography; Security token; Quantum cryptography; Quantum; Simple (philosophy); Quantum information; Computer security; Quantum mechanics; Physics; Cryptographic protocol","score_opus":0.02263662654152332,"score_gpt":0.2476120987113838,"score_spread":0.22497547216986047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897151058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10809279,0.0014260457,0.82422024,0.0073906216,0.00036242537,0.00018989223,0.00034415702,0.001019881,0.05695389],"genre_scores_gemma":[0.8612853,0.0010551545,0.1221839,0.0016332627,0.00035431463,0.00028298417,0.00022890564,0.00025836178,0.012717824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974183,0.00075147,0.00009107702,0.0003688651,0.0010453505,0.0003249485],"domain_scores_gemma":[0.99288905,0.0040239412,0.000593247,0.0018341847,0.00040808957,0.00025142028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026897679,0.00088983576,0.00089516514,0.0008808874,0.0011253008,0.0038358201,0.0024018143,0.0032978426,0.005628439],"category_scores_gemma":[0.010844979,0.0010779457,0.001349032,0.00063021673,0.0075224405,0.01053329,0.006491685,0.009644713,0.001386085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005238987,0.000020151416,0.00006266109,0.00005353088,0.0000064564742,0.000044881184,0.00012023973,0.0040763426,0.0012488255,0.9911199,0.0004933869,0.0027011097],"study_design_scores_gemma":[0.00004237904,0.000043761967,0.000039121835,0.00003749873,0.000008604112,0.000057411722,0.00003646229,0.035819665,0.0034964832,0.95693576,0.003464618,0.00001828794],"about_ca_topic_score_codex":0.0005263474,"about_ca_topic_score_gemma":0.00046899056,"teacher_disagreement_score":0.005628439,"about_ca_system_score_codex":0.0019169142,"about_ca_system_score_gemma":0.0015873241,"threshold_uncertainty_score":0.018828988},"labels":[],"label_agreement":null},{"id":"W2897276997","doi":"10.1145/3269206.3271791","title":"Secure Top-k Inner Product Retrieval","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Plaintext; Encryption; Product (mathematics); Cloud computing; Set (abstract data type); Data mining; Vulnerability (computing); Server; Information retrieval; Database; Computer network; Operating system; Computer security; Mathematics","score_opus":0.011398499469728195,"score_gpt":0.24413339049443833,"score_spread":0.23273489102471012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897276997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058826447,0.00090371026,0.92371047,0.00043015942,0.0001236792,0.00029828228,0.0005976747,0.0055436017,0.009565975],"genre_scores_gemma":[0.74360484,0.0007150171,0.24387704,0.00033509315,0.00017624664,0.00022614659,0.0014865544,0.00040854912,0.009170421],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944378,0.0007130072,0.0006518426,0.00071047264,0.0025429418,0.00094387366],"domain_scores_gemma":[0.98962885,0.0011371106,0.00065091817,0.007275527,0.0011228082,0.00018463765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001619743,0.0008743373,0.0021781733,0.0011081373,0.001339232,0.003252754,0.0018861827,0.0014532178,0.005935783],"category_scores_gemma":[0.007563971,0.00068012386,0.0012825625,0.002891468,0.0017022023,0.0066228895,0.004989416,0.001771253,0.006613861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022278908,0.00063674647,0.0036061364,0.0008266601,0.00036344526,0.00095615,0.00082948135,0.11621877,0.09496808,0.14168835,0.036143076,0.6015352],"study_design_scores_gemma":[0.00020217232,0.0004578176,0.0012932447,0.000060722472,0.00014780117,0.001993895,0.00033750397,0.71461564,0.12473393,0.13569306,0.020283764,0.00018045898],"about_ca_topic_score_codex":0.001280953,"about_ca_topic_score_gemma":0.0011125448,"teacher_disagreement_score":0.005935783,"about_ca_system_score_codex":0.0011169874,"about_ca_system_score_gemma":0.0026380483,"threshold_uncertainty_score":0.019857168},"labels":[],"label_agreement":null},{"id":"W2897693141","doi":"10.1016/j.tcs.2018.10.012","title":"Perennial secure multi-party computation of universal Turing machine","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Ben-Gurion University of the Negev; Israel Science Foundation","keywords":"Turing machine; Computer science; Computation; Theoretical computer science; Universal Turing machine; Set (abstract data type); Time hierarchy theorem; Model of computation; Super-recursive algorithm; Non-deterministic Turing machine; Theory of computation; Time complexity; Algorithm; Programming language","score_opus":0.011466911643908808,"score_gpt":0.258196179037084,"score_spread":0.24672926739317516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897693141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3092169,0.0010980784,0.6181961,0.0035065047,0.0006485139,0.00016728039,0.00042922643,0.001157533,0.06557991],"genre_scores_gemma":[0.95858335,0.00018474724,0.029040013,0.00016183197,0.0001155118,0.000074847085,0.00012468632,0.00006718475,0.01164778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873334,0.00038363787,0.00007762683,0.00024406564,0.0003063985,0.00025486478],"domain_scores_gemma":[0.99875355,0.00035261753,0.00007843642,0.0005725988,0.00012713204,0.00011562473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011579677,0.00034686498,0.0007664151,0.0005805417,0.0014216657,0.001651228,0.0010492296,0.0011059453,0.004468711],"category_scores_gemma":[0.003148208,0.0002443388,0.0006835939,0.00048298918,0.001410421,0.0032605848,0.0036431039,0.0017669778,0.00083667604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031972866,0.00006488722,0.0007835288,0.00013419415,0.000035887548,0.00019565228,0.0002530116,0.013100564,0.007850007,0.9527506,0.0027626096,0.021749415],"study_design_scores_gemma":[0.000044210305,0.00007717336,0.00047613945,0.000033901324,0.00003819954,0.00021734464,0.000048276408,0.19265571,0.013897508,0.7859566,0.0065220403,0.00003278861],"about_ca_topic_score_codex":0.0002177204,"about_ca_topic_score_gemma":0.0003261294,"teacher_disagreement_score":0.004468711,"about_ca_system_score_codex":0.00088164525,"about_ca_system_score_gemma":0.000978324,"threshold_uncertainty_score":0.014949322},"labels":[],"label_agreement":null},{"id":"W2899207447","doi":"10.1145/3285880","title":"Session details: Session 5D: Encrypted Search &amp; Computation 2","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Session (web analytics); Computer science; Encryption; Computation; World Wide Web; Computer network; Algorithm","score_opus":0.04643895305851897,"score_gpt":0.31847871800259847,"score_spread":0.2720397649440795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899207447","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003743211,0.0034474032,0.030232286,0.010226668,0.023897596,0.0016810935,0.021500565,0.010631532,0.89463973],"genre_scores_gemma":[0.04784647,0.0022631385,0.0060440386,0.0018484291,0.00603272,0.00047459544,0.013260548,0.002969508,0.9192605],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991738,0.0001307292,0.00003793629,0.00020318318,0.0002411052,0.00021326012],"domain_scores_gemma":[0.997519,0.0005280096,0.0000735304,0.00079961214,0.0005331225,0.00054686505],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011894414,0.0015100733,0.0022622494,0.0006855949,0.0026845376,0.0064290073,0.0012372431,0.003848051,0.8037461],"category_scores_gemma":[0.0036950677,0.0003901041,0.0016908892,0.0012058665,0.000827039,0.0031092404,0.0029731167,0.002655112,0.6240391],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055439316,0.00013135062,0.00029522367,0.0003087071,0.000035134173,0.00008313764,0.00003797196,0.00028958477,0.002909771,0.0047190967,0.9445047,0.04613096],"study_design_scores_gemma":[0.000093769915,0.00016672019,0.0007536069,0.00010520929,0.000025901829,0.00021343246,0.000052011794,0.0022882093,0.0047319857,0.0062628957,0.98527455,0.00003168224],"about_ca_topic_score_codex":0.0010388057,"about_ca_topic_score_gemma":0.0017408455,"teacher_disagreement_score":0.1962539,"about_ca_system_score_codex":0.0013585162,"about_ca_system_score_gemma":0.0014848235,"threshold_uncertainty_score":0.27993232},"labels":[],"label_agreement":null},{"id":"W2900520399","doi":"10.1109/iscc.2018.8538542","title":"Secret Sharing Schemes with Hidden Sets","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Secret sharing; Shamir's Secret Sharing; Cryptography; Computer science; Homomorphic secret sharing; Theoretical computer science; Set (abstract data type); Cryptographic primitive; Discrete mathematics; Secure multi-party computation; Scheme (mathematics); Mathematics; Authentication (law); Shared secret; Computer security; Cryptographic protocol","score_opus":0.015857403396782807,"score_gpt":0.24939381671595529,"score_spread":0.23353641331917246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900520399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034938943,0.0005891731,0.9545216,0.0009907852,0.00012008814,0.00033587875,0.0002012909,0.00053776725,0.0077644354],"genre_scores_gemma":[0.7726359,0.0006260251,0.21817744,0.00042313468,0.00025565363,0.0006863859,0.00031167362,0.00009369904,0.006790149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98112327,0.0060136653,0.0015124626,0.0029887983,0.006388331,0.0019734874],"domain_scores_gemma":[0.9684181,0.0151635725,0.0029158099,0.010960488,0.0016915743,0.0008505015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010941001,0.0014684736,0.0024942316,0.0015548917,0.0029313052,0.005148623,0.0044304496,0.0033692184,0.00471052],"category_scores_gemma":[0.02543123,0.0013313973,0.0029887029,0.002807598,0.0066555766,0.01688059,0.012538618,0.0063976017,0.001396232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005984052,0.00013652473,0.0005592536,0.00026836045,0.00011515805,0.00025554924,0.0009423797,0.046040855,0.006331528,0.91506076,0.0016063161,0.028084788],"study_design_scores_gemma":[0.00021585544,0.00024941002,0.00018291602,0.0001026948,0.00007320762,0.00042417293,0.00014267213,0.25129932,0.009046925,0.7311791,0.0069849743,0.00009878793],"about_ca_topic_score_codex":0.00056278176,"about_ca_topic_score_gemma":0.00040105512,"teacher_disagreement_score":0.010941001,"about_ca_system_score_codex":0.004021842,"about_ca_system_score_gemma":0.0027317319,"threshold_uncertainty_score":0.057862222},"labels":[],"label_agreement":null},{"id":"W2900722080","doi":"10.1080/17445760.2018.1550771","title":"How to encrypt a graph","year":2018,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Plaintext; Encryption; Ciphertext; Computer science; Communication source; Theoretical computer science; Graph; Algorithm; Computer network","score_opus":0.01845802772943096,"score_gpt":0.26887997929577445,"score_spread":0.2504219515663435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900722080","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008565285,0.00035487616,0.97632205,0.0008672422,0.00029462157,0.00039587522,0.000421689,0.0017927823,0.01098558],"genre_scores_gemma":[0.10341935,0.0008063925,0.87681603,0.00032442145,0.00008209185,0.00033426192,0.001205127,0.0005537098,0.016458528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993926,0.00009183797,0.000051626408,0.00016285572,0.00021976414,0.000081237624],"domain_scores_gemma":[0.9990735,0.00027694163,0.000054570908,0.00039063557,0.00016693443,0.00003732602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004168174,0.00069886446,0.00064561353,0.00066755305,0.000812283,0.0017846505,0.00063715753,0.0009467716,0.009567503],"category_scores_gemma":[0.002454306,0.00043724582,0.0009020633,0.00066145655,0.00091033016,0.0034054886,0.0010007385,0.0014555715,0.0045604603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028957232,0.00018784375,0.0007410273,0.0007055598,0.00009234365,0.00056971825,0.00049536984,0.02998258,0.043369602,0.36839414,0.03506941,0.52010286],"study_design_scores_gemma":[0.00016970925,0.00033344305,0.0007662519,0.00023128843,0.0001011918,0.0035099357,0.00038119088,0.21868122,0.06751384,0.48078743,0.22739638,0.00012807344],"about_ca_topic_score_codex":0.00076191005,"about_ca_topic_score_gemma":0.0010344682,"teacher_disagreement_score":0.009567503,"about_ca_system_score_codex":0.00068132044,"about_ca_system_score_gemma":0.0010423756,"threshold_uncertainty_score":0.032006502},"labels":[],"label_agreement":null},{"id":"W2900798344","doi":"10.1109/jbhi.2018.2881086","title":"Secure Similar Patients Query on Encrypted Genomic Data","year":2018,"lang":"en","type":"article","venue":"IEEE Journal of Biomedical and Health Informatics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Manitoba","funders":"","keywords":"Computer science; Outsourcing; Encryption; Scalability; Cloud computing; Information privacy; Adversary; Information sensitivity; Flexibility (engineering); Search engine indexing; Computer security; Database; Information retrieval","score_opus":0.05171110410745283,"score_gpt":0.32049662082300473,"score_spread":0.2687855167155519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900798344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25354037,0.0010365861,0.7297028,0.0025578442,0.0002544715,0.00058072037,0.002179752,0.0021165602,0.0080309715],"genre_scores_gemma":[0.9127799,0.00033720987,0.080910005,0.00044134495,0.00011803273,0.00015865796,0.0014052182,0.000064077445,0.0037856079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604636,0.0009252408,0.00037683066,0.00067486125,0.0014490555,0.0005275588],"domain_scores_gemma":[0.99416274,0.0024013952,0.00049784343,0.002254201,0.00050657603,0.00017726397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022586617,0.0004566651,0.0014424771,0.000682127,0.0009856955,0.0019235143,0.0012920832,0.0015603951,0.0031010895],"category_scores_gemma":[0.008653819,0.00025175957,0.0008751925,0.0015672595,0.0009094411,0.0046258434,0.0031581556,0.0011265395,0.0010208839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0071905837,0.0009312095,0.013341095,0.0007711682,0.00045836938,0.002974867,0.002583584,0.1867367,0.07112064,0.27058232,0.02691407,0.41639537],"study_design_scores_gemma":[0.00035569086,0.00044959274,0.0016414645,0.00003764706,0.00012536519,0.0025212665,0.0006245663,0.80195796,0.05026952,0.1310714,0.010879901,0.00006564912],"about_ca_topic_score_codex":0.0010429418,"about_ca_topic_score_gemma":0.00089419127,"teacher_disagreement_score":0.0031010895,"about_ca_system_score_codex":0.001285691,"about_ca_system_score_gemma":0.0020738177,"threshold_uncertainty_score":0.011945069},"labels":[],"label_agreement":null},{"id":"W2900940002","doi":"10.1007/978-3-319-89914-5_8","title":"Data Fragmentation Scheme: Improving Database Security in Cloud Computing","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Encryption; Cloud computing; Client-side encryption; Confidentiality; Overhead (engineering); Computer security; Scheme (mathematics); Disk encryption hardware; Data security; Access control; Database; Distributed computing; On-the-fly encryption; Operating system","score_opus":0.038453008803095476,"score_gpt":0.2847249718370037,"score_spread":0.2462719630339082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900940002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03144571,0.07270228,0.7802609,0.0090948185,0.004626681,0.00043363427,0.0005658382,0.0028377422,0.098032326],"genre_scores_gemma":[0.40927833,0.051629953,0.42220038,0.0024833845,0.002187641,0.0002760362,0.00086173875,0.0007951716,0.11028741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990644,0.00012395596,0.000043257605,0.0001172294,0.000531391,0.00011982632],"domain_scores_gemma":[0.99868566,0.0003266392,0.0000810986,0.00050988817,0.0003170488,0.00007967167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011672465,0.0006388784,0.0006571349,0.0010403745,0.0008547637,0.0022592635,0.001813514,0.0010378442,0.008036874],"category_scores_gemma":[0.0029643758,0.00032056557,0.0004911124,0.002694993,0.0011893689,0.006023964,0.0016594123,0.0027238594,0.0028422596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025180704,0.00012238306,0.0004245625,0.000624312,0.000028978127,0.000098426404,0.0002543023,0.009048487,0.010508177,0.3107415,0.05547859,0.6124184],"study_design_scores_gemma":[0.00011738837,0.00035464263,0.0010323287,0.0007261567,0.000095757896,0.002028921,0.00028068686,0.088561505,0.03697735,0.41734535,0.45239478,0.000085147556],"about_ca_topic_score_codex":0.00082238443,"about_ca_topic_score_gemma":0.00047871418,"teacher_disagreement_score":0.008036874,"about_ca_system_score_codex":0.001758206,"about_ca_system_score_gemma":0.0014363115,"threshold_uncertainty_score":0.026886046},"labels":[],"label_agreement":null},{"id":"W2904207032","doi":"10.1109/tpds.2018.2885519","title":"Enabling Encrypted Rich Queries in Distributed Key-Value Stores","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Scalability; Key (lock); Cryptography; Distributed computing; Information privacy; Database; Computer network; Computer security; Operating system","score_opus":0.01639953854860776,"score_gpt":0.24398053179766407,"score_spread":0.2275809932490563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904207032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16219735,0.00078493677,0.82440567,0.0004884979,0.00010969312,0.00037577294,0.0005059576,0.006267788,0.0048643406],"genre_scores_gemma":[0.8668681,0.00030668985,0.12833422,0.00015781095,0.00006331312,0.0001405164,0.00056427246,0.00021272068,0.0033522854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970693,0.00041987264,0.0003819192,0.00037445652,0.0013802524,0.0003743214],"domain_scores_gemma":[0.99438924,0.0012775388,0.00040963918,0.003025883,0.00072138,0.0001762421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018917279,0.00040037915,0.0008601111,0.00072381593,0.0008098061,0.0023586417,0.0023214722,0.0007516354,0.0020047484],"category_scores_gemma":[0.005642521,0.0004986435,0.00043868617,0.0013304049,0.0012329415,0.0076644314,0.0044393404,0.0012394896,0.0009642642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048613357,0.0013150584,0.012213636,0.00072504836,0.0002984572,0.002298381,0.0024145194,0.1378449,0.17188737,0.23935945,0.019453345,0.40732846],"study_design_scores_gemma":[0.00041478104,0.0005713335,0.0011463895,0.00007137648,0.00012296285,0.0012558213,0.00053691835,0.67671615,0.20424283,0.08712638,0.027664494,0.00013056288],"about_ca_topic_score_codex":0.0010323102,"about_ca_topic_score_gemma":0.0011294467,"teacher_disagreement_score":0.0023586417,"about_ca_system_score_codex":0.00088974164,"about_ca_system_score_gemma":0.0011556888,"threshold_uncertainty_score":0.01000458},"labels":[],"label_agreement":null},{"id":"W2907471780","doi":"10.1109/jiot.2018.2890728","title":"Toward Secure and Scalable Computation in Internet of Things Data Applications","year":2019,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Louisiana Board of Regents","keywords":"Computer science; Server; Homomorphic encryption; Scalability; Distributed computing; Encryption; Overhead (engineering); Cloud computing; Computer network; Correctness; The Internet; Database; Operating system; Algorithm","score_opus":0.026178002204809613,"score_gpt":0.27196970929709735,"score_spread":0.24579170709228773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907471780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05207889,0.0007002516,0.93694603,0.0010577396,0.0001228931,0.00024207181,0.00003065962,0.0009942298,0.007827277],"genre_scores_gemma":[0.6969794,0.00063974154,0.2977693,0.0002969769,0.00008724038,0.00025702608,0.00008599309,0.00010253504,0.0037817194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981895,0.00044989536,0.00012244319,0.00015270934,0.0008990715,0.00018637074],"domain_scores_gemma":[0.9985556,0.00037558578,0.0001134853,0.0006592144,0.00022851101,0.00006764784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017544758,0.00043522147,0.00042308442,0.0006357181,0.00097439747,0.0016123971,0.0012332434,0.00081700936,0.0012659596],"category_scores_gemma":[0.0030672099,0.00040616925,0.0006136561,0.0008447273,0.0016510746,0.003324538,0.0027880059,0.001695671,0.00053698174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061534386,0.00034209152,0.0019841692,0.0003881989,0.00011191367,0.0006117418,0.0007587312,0.113869704,0.09507623,0.61366874,0.0077220392,0.16485113],"study_design_scores_gemma":[0.00009471097,0.00019235877,0.00037436312,0.000047391877,0.000044729848,0.00032447683,0.00020988815,0.7951209,0.061404996,0.12381372,0.01832748,0.00004500627],"about_ca_topic_score_codex":0.0005177519,"about_ca_topic_score_gemma":0.00062586664,"teacher_disagreement_score":0.0017544758,"about_ca_system_score_codex":0.000758412,"about_ca_system_score_gemma":0.001260194,"threshold_uncertainty_score":0.009278655},"labels":[],"label_agreement":null},{"id":"W2907641663","doi":"10.2478/popets-2019-0007","title":"My Genome Belongs to Me: Controlling Third Party Computation on Genomic Data","year":2018,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Cryptography; Encryption; Outsourcing; Cryptographic primitive; Computation; Functional encryption; Secure multi-party computation; Protocol (science); Cloud computing; Function (biology); Cryptographic protocol; Theoretical computer science; Computer security; Medicine; Algorithm","score_opus":0.033434001251398934,"score_gpt":0.28267641860629644,"score_spread":0.2492424173548975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907641663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3031406,0.00084171345,0.65273285,0.0027366912,0.0002984078,0.0004373742,0.0006945888,0.027377212,0.011740487],"genre_scores_gemma":[0.918503,0.00016044277,0.07705951,0.00036338612,0.000058653804,0.0001844928,0.00036804707,0.00050519756,0.0027972418],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955568,0.0017461226,0.00024691896,0.00068655645,0.0011736526,0.0005899639],"domain_scores_gemma":[0.988893,0.005729006,0.0005462304,0.0038989852,0.00057992834,0.00035289951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003814902,0.000701148,0.0008265502,0.0007984251,0.0015280719,0.0036382677,0.0023223755,0.0011596069,0.0049445615],"category_scores_gemma":[0.011814707,0.0003628783,0.0007736156,0.0012351696,0.002161603,0.005400677,0.003437715,0.0018280473,0.0011870543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008069025,0.001016521,0.018631103,0.00094278454,0.00040666538,0.0023900128,0.0023633514,0.18918383,0.12593663,0.30481258,0.039213832,0.3070338],"study_design_scores_gemma":[0.00031794995,0.00031113814,0.0018311017,0.00008738047,0.00011286142,0.0003864643,0.0002890772,0.7565209,0.1256141,0.09828364,0.016148444,0.00009698867],"about_ca_topic_score_codex":0.002311311,"about_ca_topic_score_gemma":0.0018677623,"teacher_disagreement_score":0.0049445615,"about_ca_system_score_codex":0.0019387688,"about_ca_system_score_gemma":0.0017142073,"threshold_uncertainty_score":0.020175397},"labels":[],"label_agreement":null},{"id":"W2907648450","doi":"","title":"EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation for Machine Learning","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Correctness; Scalability; Secure multi-party computation; Compiler; Computation; Oblivious transfer; Theoretical computer science; Programming language; Operating system","score_opus":0.022021747716683374,"score_gpt":0.29779166401768536,"score_spread":0.275769916301002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907648450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012372231,0.00018412036,0.97433734,0.00036420734,0.000054148375,0.00023162067,0.00020274072,0.0065700687,0.0056834696],"genre_scores_gemma":[0.56283474,0.00042886878,0.4265169,0.00035425028,0.00008081355,0.0007151021,0.00077809935,0.0011188303,0.0071724295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981926,0.00051691546,0.000105191306,0.0002643997,0.00067787746,0.00024294657],"domain_scores_gemma":[0.9980021,0.0006590944,0.000116298754,0.0010211959,0.00013037892,0.00007081126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019924499,0.0007026979,0.0005314357,0.00053981296,0.00079805776,0.0017570416,0.0015079475,0.000886507,0.00619343],"category_scores_gemma":[0.0045466013,0.00047331688,0.00071773527,0.00059979677,0.0017247859,0.0035802808,0.0035147485,0.0027859863,0.001701508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005179086,0.00020164948,0.00084053806,0.00040917893,0.00008121186,0.00024821344,0.0003018642,0.10820714,0.024299627,0.71433955,0.013618831,0.13693425],"study_design_scores_gemma":[0.00012664107,0.00014001977,0.00019348985,0.00006241888,0.000037840884,0.00016992135,0.000046706667,0.61744493,0.04635648,0.31192294,0.023453925,0.000044679484],"about_ca_topic_score_codex":0.0006802684,"about_ca_topic_score_gemma":0.00085778127,"teacher_disagreement_score":0.00619343,"about_ca_system_score_codex":0.000812177,"about_ca_system_score_gemma":0.002100007,"threshold_uncertainty_score":0.020719111},"labels":[],"label_agreement":null},{"id":"W2907745774","doi":"10.2478/popets-2019-0015","title":"Private Evaluation of Decision Trees using Sublinear Cost","year":2018,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission","keywords":"Computer science; Decision tree; Tree (set theory); Search engine indexing; Merkle tree; Data mining; Plaintext; Node (physics); Tree traversal; Private information retrieval; K-ary tree; Theoretical computer science; Tree structure; Artificial intelligence; Cryptography; Binary tree; Algorithm; Computer network; Computer security; Encryption; Mathematics","score_opus":0.05467539119888374,"score_gpt":0.3264959237493081,"score_spread":0.2718205325504243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907745774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20608363,0.001148366,0.77111083,0.0022397393,0.00021135295,0.00040176418,0.00031750085,0.005146222,0.013340584],"genre_scores_gemma":[0.93124455,0.00012516355,0.06467484,0.0002055761,0.000059526134,0.0001271768,0.00013425261,0.00021990994,0.0032090542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98996323,0.00353633,0.0005084546,0.00091569056,0.003132755,0.0019435344],"domain_scores_gemma":[0.98036444,0.011448364,0.0011081698,0.004848127,0.0017134412,0.00051756226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004714213,0.00080223114,0.0012082671,0.000812942,0.001103323,0.0036040004,0.0024161222,0.0017394107,0.0092874775],"category_scores_gemma":[0.0154397655,0.00046826198,0.0011002593,0.0010464002,0.0022871862,0.007750651,0.0036451882,0.0028032362,0.0011529125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004502391,0.00075353734,0.003202204,0.00057419384,0.00019078591,0.0005694346,0.00048490553,0.5150346,0.031718906,0.25090072,0.009877016,0.18219125],"study_design_scores_gemma":[0.00011207002,0.0001993369,0.00023467767,0.000030480922,0.000040966133,0.00009642961,0.00006854847,0.86749977,0.015437416,0.11457809,0.0016753369,0.000026919104],"about_ca_topic_score_codex":0.0018149733,"about_ca_topic_score_gemma":0.0014998713,"teacher_disagreement_score":0.0092874775,"about_ca_system_score_codex":0.0043041836,"about_ca_system_score_gemma":0.002742655,"threshold_uncertainty_score":0.031229198},"labels":[],"label_agreement":null},{"id":"W2908229855","doi":"","title":"Bitforest: a Portable and Efficient Blockchain-Based Naming System","year":2018,"lang":"en","type":"article","venue":"Conference on Network and Service Management","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Blockchain; Scalability; Computer security; Public-key cryptography; Flexibility (engineering); Public key infrastructure; Cryptography; Distributed computing; Operating system; Encryption","score_opus":0.01435347362804693,"score_gpt":0.2144734568269922,"score_spread":0.20011998319894528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908229855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11838256,0.0006531438,0.84373915,0.00049748406,0.00023288492,0.0005794571,0.00067821844,0.017468235,0.017768944],"genre_scores_gemma":[0.77680504,0.00054739165,0.20627405,0.00013531021,0.000050495284,0.0003041149,0.0016615475,0.0005706022,0.0136515],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918956,0.00017655849,0.000054789085,0.000109117296,0.00037649865,0.0000934238],"domain_scores_gemma":[0.99867815,0.0002831894,0.00013083343,0.00050742785,0.0002256498,0.0001748192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010709368,0.00044518424,0.0006295189,0.00058696925,0.0011240023,0.0012687945,0.0016564613,0.00095381576,0.0049224054],"category_scores_gemma":[0.0023909882,0.00032457293,0.0003058754,0.0008902696,0.0008814667,0.0030536288,0.0019356175,0.0008332962,0.0014523503],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020473872,0.0005372141,0.004632862,0.00050237396,0.00011296847,0.0012599304,0.00059102057,0.37272656,0.08053399,0.0917264,0.024792101,0.42053717],"study_design_scores_gemma":[0.0003216183,0.000319568,0.00074945553,0.000036870504,0.000031391628,0.00048319827,0.000060162274,0.9124808,0.024734301,0.028078686,0.032610312,0.00009364617],"about_ca_topic_score_codex":0.004889188,"about_ca_topic_score_gemma":0.004576568,"teacher_disagreement_score":0.0049224054,"about_ca_system_score_codex":0.0007595475,"about_ca_system_score_gemma":0.0021276807,"threshold_uncertainty_score":0.016467154},"labels":[],"label_agreement":null},{"id":"W2913963738","doi":"10.1007/978-3-642-32284-6_1","title":"Guessing Secrecy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secrecy; Plaintext; Ciphertext; Computer science; Encryption; Information-theoretic security; Key (lock); Theoretical computer science; Forward secrecy; Mathematics; Computer security; Public-key cryptography","score_opus":0.0200394120471004,"score_gpt":0.2479136126494665,"score_spread":0.22787420060236613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913963738","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013385217,0.007553763,0.22201523,0.011441276,0.001887465,0.0001274615,0.0008468701,0.00087051553,0.74187225],"genre_scores_gemma":[0.4808148,0.013704741,0.05760105,0.0026582237,0.0022576828,0.00028428613,0.0020624497,0.0009917112,0.43962502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857783,0.0004456107,0.000072943745,0.00023730073,0.00050976314,0.00015657824],"domain_scores_gemma":[0.9975877,0.0012130361,0.0000867388,0.00090047496,0.0001589739,0.00005315283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013131034,0.001153482,0.0008959412,0.0012034114,0.0016436097,0.0038424507,0.00088884484,0.0019477282,0.031046841],"category_scores_gemma":[0.0059825047,0.0007355791,0.0008512285,0.001498418,0.0046472093,0.009306763,0.0034270673,0.005627871,0.013510294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047851627,0.00001615477,0.000096151925,0.000111175425,0.000013728534,0.000051095914,0.0003277757,0.0014438389,0.000542538,0.9386496,0.020114563,0.038585607],"study_design_scores_gemma":[0.000008630549,0.000014551758,0.00006396298,0.00012118714,0.000014018773,0.00014303485,0.00007977817,0.0028503109,0.0016226997,0.9279681,0.06709789,0.000015709566],"about_ca_topic_score_codex":0.00038801727,"about_ca_topic_score_gemma":0.00030968498,"teacher_disagreement_score":0.031046841,"about_ca_system_score_codex":0.0015605772,"about_ca_system_score_gemma":0.0009706444,"threshold_uncertainty_score":0.10386205},"labels":[],"label_agreement":null},{"id":"W2915016908","doi":"10.14778/3291264.3291274","title":"Shrinkwrap","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Differential privacy; SQL; Padding; Set (abstract data type); Cardinality (data modeling); Query optimization; Operator (biology); Sargable; Database; Web search query; Information retrieval; Data mining; Computer security; Search engine","score_opus":0.00835529035135328,"score_gpt":0.21258179589086773,"score_spread":0.20422650553951446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915016908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08722324,0.0011092887,0.84083855,0.00162802,0.00042680613,0.00087127334,0.0059055127,0.03306601,0.028931312],"genre_scores_gemma":[0.653122,0.0007750051,0.30625153,0.0010430326,0.00021503265,0.0008986903,0.01275988,0.0020563095,0.022878533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954791,0.0006863637,0.00037191235,0.001180129,0.0016119716,0.0006704156],"domain_scores_gemma":[0.98805094,0.0009400927,0.00048334082,0.009171895,0.0009815223,0.00037218106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038023498,0.00060661806,0.0009623868,0.00092180335,0.0017181311,0.0030611735,0.002854032,0.000981797,0.00642528],"category_scores_gemma":[0.008791732,0.00066691905,0.0010736863,0.0019360901,0.0014531526,0.010344595,0.008603562,0.0020189572,0.0032568304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026924233,0.00071186956,0.012577213,0.0008144046,0.0002976019,0.0007670246,0.0012333527,0.03470449,0.042451225,0.27445248,0.12302597,0.506272],"study_design_scores_gemma":[0.00024897404,0.0007762559,0.0041524973,0.00015641272,0.00016441387,0.0022819238,0.000697344,0.27039433,0.08645682,0.2616713,0.3727831,0.00021674976],"about_ca_topic_score_codex":0.0015639613,"about_ca_topic_score_gemma":0.001045898,"teacher_disagreement_score":0.00642528,"about_ca_system_score_codex":0.0009974274,"about_ca_system_score_gemma":0.0026784076,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2918363463","doi":"10.1109/jiot.2019.2902483","title":"Pystin: Enabling Secure LBS in Smart Cities With Privacy-Preserving Top-$k$ Spatial–Textual Query","year":2019,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; New Brunswick Innovation Foundation","keywords":"Computer science; Homomorphic encryption; Scalability; Location-based service; Cloud computing; Hash function; Search engine indexing; Encryption; Security analysis; Computer security; Computer network; Database; Information retrieval","score_opus":0.010391700315626182,"score_gpt":0.2238920892264113,"score_spread":0.2135003889107851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918363463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1440327,0.0018943242,0.8303115,0.0011535677,0.00025835485,0.0006595863,0.0015532146,0.0065233447,0.013613358],"genre_scores_gemma":[0.8871551,0.00055398134,0.10637949,0.00025097645,0.00006473823,0.00014338964,0.0010477888,0.00008957584,0.0043149483],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99808013,0.00028614825,0.0001988005,0.00022850679,0.0008510339,0.0003553871],"domain_scores_gemma":[0.9982906,0.00022948933,0.00021936317,0.0008962825,0.00025076562,0.00011353787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010942629,0.00038477356,0.0009785527,0.0006908683,0.0011215957,0.0016488526,0.0017097612,0.0008058782,0.0025383304],"category_scores_gemma":[0.0024395857,0.00022342149,0.0005267466,0.0018231214,0.0011542201,0.0051690503,0.0045652166,0.0010258665,0.001126259],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003953098,0.0006036869,0.0074908407,0.0010868215,0.0002386641,0.0025872476,0.0021189637,0.08994966,0.16196516,0.19549362,0.03400267,0.5005097],"study_design_scores_gemma":[0.00027554805,0.0006088018,0.0018309382,0.00007570168,0.00007961679,0.0027246824,0.0011783369,0.7744312,0.099403135,0.0573943,0.06179804,0.00019970545],"about_ca_topic_score_codex":0.0031809546,"about_ca_topic_score_gemma":0.002738727,"teacher_disagreement_score":0.0031809546,"about_ca_system_score_codex":0.0012680944,"about_ca_system_score_gemma":0.0018063369,"threshold_uncertainty_score":0.009200692},"labels":[],"label_agreement":null},{"id":"W2921249631","doi":"10.1109/tifs.2019.2903651","title":"Secure Approximate String Matching for Privacy-Preserving Record Linkage","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bloom filter; Computer science; Homomorphic encryption; Approximate string matching; Encryption; Matching (statistics); Theoretical computer science; String searching algorithm; String (physics); Protocol (science); Record linkage; Computer security; Cryptography; Data mining; Pattern matching; Computer network; Artificial intelligence; Mathematics","score_opus":0.009779452813707932,"score_gpt":0.22270519682584808,"score_spread":0.21292574401214015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921249631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035129275,0.00018844202,0.96038294,0.00058864726,0.000048168084,0.00016135573,0.00015036293,0.0006703744,0.0026804775],"genre_scores_gemma":[0.7144869,0.0002588819,0.28033695,0.00031637528,0.00009260027,0.00034574862,0.00033837158,0.00011734104,0.0037068748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98507255,0.0049992786,0.001386819,0.0017136204,0.005887142,0.0009405406],"domain_scores_gemma":[0.97764844,0.0071043465,0.0024079382,0.010952431,0.001430649,0.00045614547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076802415,0.00042701958,0.001321137,0.0013359669,0.0016919329,0.0038428192,0.0024503144,0.0025871522,0.0024808084],"category_scores_gemma":[0.023049813,0.00062419125,0.0010678383,0.0027065726,0.0028128093,0.0088570155,0.007874255,0.0027435499,0.0011670153],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011487457,0.0003508953,0.0022686783,0.00032623712,0.00014656482,0.00065779075,0.001385081,0.08436114,0.036015883,0.70244634,0.0039243195,0.16696842],"study_design_scores_gemma":[0.00018139672,0.00038479958,0.00066535105,0.000084446656,0.00008764807,0.0010648475,0.00035518265,0.47165683,0.08994923,0.42247677,0.012971694,0.0001219016],"about_ca_topic_score_codex":0.0002943419,"about_ca_topic_score_gemma":0.00021398955,"teacher_disagreement_score":0.0076802415,"about_ca_system_score_codex":0.0018602011,"about_ca_system_score_gemma":0.0026248032,"threshold_uncertainty_score":0.040617466},"labels":[],"label_agreement":null},{"id":"W2923059398","doi":"10.1007/s10916-019-1229-1","title":"Achieving Efficient and Privacy-Preserving k-NN Query for Outsourced eHealthcare Data","year":2019,"lang":"en","type":"article","venue":"Journal of Medical Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Cloud computing; Encryption; Homomorphic encryption; Server; Information privacy; Service provider; Database; Computer security; Service (business); Computer network","score_opus":0.04143562652102641,"score_gpt":0.3197968179257512,"score_spread":0.2783611914047248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923059398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1512175,0.002380199,0.82928777,0.002144132,0.00029648718,0.00043181458,0.00387868,0.002519055,0.007844345],"genre_scores_gemma":[0.86318207,0.00070478546,0.12713604,0.00046146582,0.00012880348,0.00010981417,0.0032171377,0.00010452104,0.0049552773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538726,0.0006341802,0.0003979489,0.00072674564,0.002060185,0.00079373294],"domain_scores_gemma":[0.99594903,0.0009298601,0.000302994,0.0021169705,0.00057808036,0.00012305881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002339095,0.0007199627,0.0024513179,0.0006290963,0.0012799577,0.0028141006,0.002202936,0.0014147285,0.0034713552],"category_scores_gemma":[0.0052560284,0.0004953067,0.0013730165,0.0022957646,0.0010887863,0.005210873,0.006224465,0.0014256096,0.0012019296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004618747,0.001005418,0.020247241,0.0020638083,0.00074195914,0.00187325,0.0020084144,0.19533424,0.07821418,0.103694245,0.04646886,0.5437297],"study_design_scores_gemma":[0.00015978569,0.0002769617,0.002782614,0.000051086692,0.00014063071,0.0017396547,0.0011693437,0.8827774,0.02609408,0.077076696,0.0076439255,0.00008777655],"about_ca_topic_score_codex":0.0043039666,"about_ca_topic_score_gemma":0.0058187013,"teacher_disagreement_score":0.0043039666,"about_ca_system_score_codex":0.0014666658,"about_ca_system_score_gemma":0.0032598176,"threshold_uncertainty_score":0.012370467},"labels":[],"label_agreement":null},{"id":"W2924179447","doi":"10.1145/3292006.3300044","title":"Deep Neural Networks Classification over Encrypted Data","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"MNIST database; Computer science; Convolutional neural network; Encryption; Artificial intelligence; Scalability; Deep learning; Machine learning; Cloud computing; Sigmoid function; Information privacy; Focus (optics); Artificial neural network; Big data; Data mining; Database","score_opus":0.03187189209935371,"score_gpt":0.26467897352186703,"score_spread":0.23280708142251333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924179447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36134827,0.0010577464,0.62480325,0.0013775013,0.0002556314,0.00012683474,0.0007199198,0.004744194,0.005566635],"genre_scores_gemma":[0.92991585,0.00037034228,0.06509781,0.00017886753,0.000058077312,0.00005493,0.00064229255,0.0000678011,0.0036140676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993581,0.000105174615,0.000057449077,0.00013886532,0.00021174573,0.00012866959],"domain_scores_gemma":[0.99900985,0.00031508814,0.00015098916,0.00024499244,0.0002468228,0.000032125256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078659336,0.00074686017,0.00051496224,0.0004948647,0.0003264168,0.0007658664,0.0009461931,0.0007390791,0.0012538801],"category_scores_gemma":[0.0031297407,0.00029315084,0.00047559946,0.00059021293,0.00051818544,0.0018891196,0.0007564973,0.0014568606,0.00046500424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003668572,0.0001672206,0.003246143,0.000092756556,0.000065412,0.00022452108,0.00007880793,0.771158,0.0114927385,0.008686418,0.004555995,0.19986512],"study_design_scores_gemma":[0.0000032548357,0.000011289416,0.0001450993,0.0000028539948,0.0000027882545,0.000010868207,0.000006484061,0.9935489,0.0041303597,0.0018856912,0.00025000714,0.000002390479],"about_ca_topic_score_codex":0.00839971,"about_ca_topic_score_gemma":0.0075374786,"teacher_disagreement_score":0.00839971,"about_ca_system_score_codex":0.0015053549,"about_ca_system_score_gemma":0.0008963981,"threshold_uncertainty_score":0.016701639},"labels":[],"label_agreement":null},{"id":"W2924204293","doi":"10.5539/cis.v12n2p35","title":"Secure Multi-User k-Means Clustering Based on Encrypted IoT Data","year":2019,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Encryption; Upload; Cluster analysis; Scheme (mathematics); Focus (optics); Raw data; Data mining; Cloud computing; Information privacy; Computer security; World Wide Web; Artificial intelligence","score_opus":0.02180424587607648,"score_gpt":0.2589392594779331,"score_spread":0.23713501360185663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924204293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09195567,0.0002910631,0.90261286,0.0005007786,0.00012694123,0.00024998345,0.000293459,0.0009983111,0.002970999],"genre_scores_gemma":[0.8576179,0.00021534965,0.1378521,0.00012649338,0.000050329938,0.0002074498,0.0004351282,0.000060797556,0.0034345544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955279,0.000876008,0.0004256242,0.00080074684,0.0018361505,0.00053358765],"domain_scores_gemma":[0.996411,0.00049798645,0.00036575086,0.0017120106,0.0008502705,0.00016304312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015598246,0.00068997603,0.0013287574,0.0010687719,0.0026199166,0.0013772217,0.0021563875,0.0013158602,0.0010747827],"category_scores_gemma":[0.0049658865,0.00039568738,0.0010300124,0.0018260559,0.0012172827,0.0041028606,0.003681878,0.0010228485,0.0006747947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002989487,0.00040828314,0.0063021984,0.00034078606,0.00042000553,0.0008240769,0.0016865042,0.5229949,0.049433116,0.13977578,0.010979877,0.26384503],"study_design_scores_gemma":[0.000065253706,0.00008228861,0.0006828077,0.000013319787,0.000029962606,0.00033328123,0.00023208321,0.9511407,0.018879574,0.025963133,0.002510538,0.00006704758],"about_ca_topic_score_codex":0.0037129002,"about_ca_topic_score_gemma":0.0033379458,"teacher_disagreement_score":0.0037129002,"about_ca_system_score_codex":0.0021731248,"about_ca_system_score_gemma":0.0024714295,"threshold_uncertainty_score":0.015767217},"labels":[],"label_agreement":null},{"id":"W2937199800","doi":"10.1145/3309074.3309081","title":"Lightweight authentication for MQTT to improve the security of IoT communication","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"Division of Electrical, Communications and Cyber Systems; Public Safety Canada; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"MQTT; Computer science; Message queue; Computer network; Authentication protocol; Authentication (law); Message authentication code; Key (lock); Protocol (science); Computer security; Internet of Things; Cryptography","score_opus":0.007089981486044667,"score_gpt":0.24307844769947407,"score_spread":0.2359884662134294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937199800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05660122,0.001532279,0.92920727,0.00084987574,0.00050196063,0.00028487397,0.000059936297,0.0021730422,0.008789501],"genre_scores_gemma":[0.88621706,0.0007926497,0.103408225,0.00037374443,0.00030400656,0.00016041071,0.00012343792,0.00013013557,0.008490285],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988398,0.00027366445,0.000119351214,0.00013079759,0.00051027146,0.0001262122],"domain_scores_gemma":[0.9983941,0.00034521197,0.00018438871,0.00045450445,0.0005615465,0.00006029633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011035511,0.00047428926,0.00048443425,0.00068947126,0.0007827944,0.001125978,0.0008520416,0.00093118334,0.0029647595],"category_scores_gemma":[0.0028302409,0.00016924155,0.00053511525,0.00059712614,0.0006745671,0.0026126562,0.0015984534,0.001238854,0.0011244991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010085419,0.00021929697,0.004182615,0.0007793486,0.00012796395,0.0011972861,0.0008511188,0.016684126,0.5583353,0.17280374,0.007467084,0.23634356],"study_design_scores_gemma":[0.00020844601,0.0016363136,0.0039297133,0.0002217758,0.0002912345,0.003132343,0.00032583793,0.49772313,0.3207406,0.07631294,0.09525224,0.00022529256],"about_ca_topic_score_codex":0.0005403182,"about_ca_topic_score_gemma":0.00038028872,"teacher_disagreement_score":0.0029647595,"about_ca_system_score_codex":0.0006105856,"about_ca_system_score_gemma":0.000819084,"threshold_uncertainty_score":0.009918153},"labels":[],"label_agreement":null},{"id":"W2937861079","doi":"10.1007/978-3-030-16458-4_20","title":"Improved Efficiency of a Linearly Homomorphic Cryptosystem","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cryptosystem; Paillier cryptosystem; Homomorphic encryption; Computer science; Prime (order theory); Algorithm; Cryptography; Mathematics; Computer security; Combinatorics; Hybrid cryptosystem; Encryption","score_opus":0.011277399367874209,"score_gpt":0.22198251014711806,"score_spread":0.21070511077924386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937861079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34479532,0.0024747618,0.511888,0.0020368467,0.0004843364,0.00022438321,0.0006973872,0.0067216745,0.13067725],"genre_scores_gemma":[0.8711276,0.0007338784,0.09194592,0.00022252402,0.00029987487,0.00009078633,0.0004001351,0.00042765477,0.03475157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984528,0.00041850941,0.00007870003,0.00017175706,0.000665982,0.00021230617],"domain_scores_gemma":[0.99870884,0.00055670115,0.000044347868,0.00050294405,0.00013782192,0.000049404454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680857,0.0006052064,0.00073219556,0.0008380456,0.00058115483,0.0017553312,0.0009525969,0.0007499337,0.011793782],"category_scores_gemma":[0.0015500062,0.00031558037,0.00038545698,0.0012525652,0.0010401501,0.0032793123,0.001618804,0.0012183337,0.0038707678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023302364,0.0005660118,0.0010463148,0.00040974162,0.00009193448,0.00039997275,0.00023698481,0.037316125,0.16903238,0.4610359,0.019097485,0.30843684],"study_design_scores_gemma":[0.00044347616,0.00071102806,0.0014218804,0.000066871224,0.0001703438,0.0012363942,0.00009103042,0.47825554,0.32404184,0.15973426,0.033703204,0.00012410422],"about_ca_topic_score_codex":0.00031028612,"about_ca_topic_score_gemma":0.0002361599,"teacher_disagreement_score":0.011793782,"about_ca_system_score_codex":0.000863496,"about_ca_system_score_gemma":0.00083241967,"threshold_uncertainty_score":0.039454162},"labels":[],"label_agreement":null},{"id":"W2940107935","doi":"10.1109/iccnc.2019.8685509","title":"Toward Secure Resource Allocation in Mobile Cloud Computing: A Matching Game","year":2019,"lang":"en","type":"article","venue":"2019 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cloud computing; Resource allocation; Matching (statistics); Resource (disambiguation); Distributed computing; Mobile cloud computing; Mobile computing; Resource management (computing); Computer security; Computer network; Operating system","score_opus":0.041652902538048216,"score_gpt":0.29466582658355595,"score_spread":0.25301292404550774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940107935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05665412,0.00018482261,0.92828983,0.0011221967,0.0000525263,0.00028885197,0.00006974297,0.00007339434,0.013264534],"genre_scores_gemma":[0.88934606,0.00032721795,0.104766384,0.000292784,0.00007081948,0.00034057765,0.000049477934,0.000035213092,0.0047714342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816555,0.0010554562,0.000058913945,0.00023064532,0.00026308213,0.00022640005],"domain_scores_gemma":[0.9986754,0.00078198494,0.00014941135,0.00007386586,0.00011863045,0.0002007279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024657242,0.0009312921,0.0013392136,0.0005398387,0.00091722916,0.0021426233,0.0015228232,0.0021241675,0.0024362702],"category_scores_gemma":[0.0039790277,0.00044219109,0.00093391334,0.0008071839,0.0020571777,0.0024043017,0.0025479428,0.001901224,0.00034123386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025690818,0.00019362509,0.0006718435,0.00015008562,0.00008630389,0.00033018005,0.0003330727,0.5975651,0.0043950593,0.37923256,0.0020494435,0.014735835],"study_design_scores_gemma":[0.00004110197,0.000049443963,0.00006168189,0.0000100129855,0.000009531387,0.000031689102,0.00004336115,0.9318896,0.00023753005,0.06694354,0.0006726403,0.000010031614],"about_ca_topic_score_codex":0.002853792,"about_ca_topic_score_gemma":0.0018381656,"teacher_disagreement_score":0.002853792,"about_ca_system_score_codex":0.0019233685,"about_ca_system_score_gemma":0.0026618063,"threshold_uncertainty_score":0.013955057},"labels":[],"label_agreement":null},{"id":"W2942909684","doi":"10.5539/mas.v13n5p130","title":"Applications of Algebraic Geometry in Cryptography","year":2019,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Word (group theory); Computer science; Cryptography; Encryption; Algebraic geometry; Linguistics; Algebraic number; Applied linguistics; Algebra over a field; Mathematics education; Mathematics; Geometry; Computer security; Philosophy; Pure mathematics","score_opus":0.005087784160370673,"score_gpt":0.2198995877733003,"score_spread":0.21481180361292962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942909684","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03926425,0.11078025,0.29584566,0.029896544,0.0048515466,0.00013688592,0.00040656386,0.00029092366,0.51852745],"genre_scores_gemma":[0.7866063,0.06826745,0.09342089,0.0032427907,0.011023581,0.00019709885,0.00029928825,0.00014123968,0.036801346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789953,0.0009329131,0.00014480438,0.00026434954,0.0006072906,0.00015117241],"domain_scores_gemma":[0.9977888,0.0013076473,0.00016998453,0.00025789923,0.00038132997,0.000094288174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014491534,0.00082034315,0.000704691,0.0028153907,0.0022304624,0.0030751093,0.00048467098,0.0012211144,0.006123272],"category_scores_gemma":[0.0046130065,0.00037585705,0.000993477,0.0028634325,0.0055727703,0.005161824,0.0028426233,0.0032969303,0.0019350344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068426334,0.00000709086,0.00011234413,0.00006381464,0.000005907551,0.000052074352,0.00011904761,0.0011431415,0.00017797059,0.98738015,0.0017255202,0.009206106],"study_design_scores_gemma":[0.0000054114494,0.000016851915,0.00010810634,0.000039518152,0.000003294305,0.0001425653,0.000050326067,0.0019064788,0.00017216874,0.9700291,0.027514856,0.000011222583],"about_ca_topic_score_codex":0.0012225233,"about_ca_topic_score_gemma":0.0005940084,"teacher_disagreement_score":0.006123272,"about_ca_system_score_codex":0.0026439577,"about_ca_system_score_gemma":0.0011318205,"threshold_uncertainty_score":0.020484388},"labels":[],"label_agreement":null},{"id":"W2948987039","doi":"10.1109/cybermatics_2018.2018.00088","title":"An Efficient and Privacy-Preserving $k$-NN Query Scheme for eHealthcare Data","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Cloud computing; Scheme (mathematics); Server; Information privacy; Tree (set theory); Theoretical computer science; Data mining; Computer security; Computer network; Mathematics","score_opus":0.06849594026020164,"score_gpt":0.3556121880910582,"score_spread":0.28711624783085654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948987039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07699438,0.0014806829,0.9098526,0.0016105341,0.00025635643,0.00057855307,0.0007931164,0.0006281347,0.0078055942],"genre_scores_gemma":[0.797654,0.00074892386,0.19240355,0.00044648547,0.00008184883,0.00023499325,0.00075733865,0.000037096223,0.0076357494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971384,0.0005998523,0.0003028,0.0004274689,0.001236213,0.000295282],"domain_scores_gemma":[0.9983181,0.00032200597,0.00021401509,0.000725543,0.00033534213,0.000085076725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014098308,0.00028116256,0.0010045475,0.0005007414,0.0014094671,0.0009987387,0.0014218396,0.001304475,0.0020726041],"category_scores_gemma":[0.0030912242,0.0002042746,0.00066659966,0.0013351693,0.00087816705,0.004171954,0.0032613364,0.0011469682,0.0007495768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026923963,0.00056889607,0.0053619705,0.0012380907,0.00031542976,0.0017321855,0.0021999103,0.07970038,0.15660276,0.24894276,0.02465266,0.4759926],"study_design_scores_gemma":[0.00040106676,0.0008714288,0.0037504486,0.000106999185,0.00020238759,0.006623575,0.0013229374,0.7122411,0.10446971,0.10365241,0.065926485,0.00043136097],"about_ca_topic_score_codex":0.0014973903,"about_ca_topic_score_gemma":0.0013547281,"teacher_disagreement_score":0.0020726041,"about_ca_system_score_codex":0.0013799466,"about_ca_system_score_gemma":0.0013493353,"threshold_uncertainty_score":0.010012269},"labels":[],"label_agreement":null},{"id":"W2949109729","doi":"","title":"Large Universe Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Traitor tracing; Attribute-based encryption; Traceability; Encryption; Ciphertext; Key (lock); Computer security; Access control; Overhead (engineering); Database; Public-key cryptography; Operating system; Software engineering","score_opus":0.011705749169046225,"score_gpt":0.24977428949183525,"score_spread":0.238068540322789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949109729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03241012,0.00039067265,0.95693237,0.00024410708,0.00009119936,0.00025254782,0.00019647635,0.00406343,0.00541909],"genre_scores_gemma":[0.7568123,0.00040730461,0.23576294,0.00023896448,0.00012522117,0.00021602542,0.00046973946,0.00026390952,0.005703545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973585,0.00044351537,0.00030733517,0.00047534404,0.0010371207,0.0003781969],"domain_scores_gemma":[0.99627614,0.00063517585,0.00033376558,0.0019910075,0.000535821,0.0002280842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013099356,0.0005003542,0.0011698278,0.000715664,0.0010567794,0.0023517725,0.0017665614,0.0008818591,0.0027445378],"category_scores_gemma":[0.0038372688,0.00038763738,0.000854287,0.0014119907,0.0010290081,0.006928001,0.0032186022,0.002028662,0.0013292828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022193359,0.0006576123,0.0021710056,0.00055333483,0.00016344881,0.0017449213,0.0010748467,0.07001184,0.15924473,0.4343393,0.012420538,0.31539905],"study_design_scores_gemma":[0.00022601022,0.00028303568,0.00070027023,0.000057251742,0.000086967666,0.0010988687,0.00010195457,0.7450782,0.1354699,0.082184285,0.034549057,0.00016425166],"about_ca_topic_score_codex":0.0012749357,"about_ca_topic_score_gemma":0.0007704183,"teacher_disagreement_score":0.0027445378,"about_ca_system_score_codex":0.0010382961,"about_ca_system_score_gemma":0.0015841653,"threshold_uncertainty_score":0.00918138},"labels":[],"label_agreement":null},{"id":"W2949137963","doi":"","title":"Compactly Hiding Linear Spans: Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Soundness; Mathematical proof; Random oracle; Constant (computer programming); Zero-knowledge proof; Computer science; Security parameter; Cryptography; Theoretical computer science; Mathematics; Gas meter prover; Group (periodic table); Discrete mathematics; Algorithm; Encryption; Public-key cryptography; Programming language","score_opus":0.022895647305090375,"score_gpt":0.259055910327477,"score_spread":0.23616026302238663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949137963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07428898,0.0010572152,0.90201163,0.0026939223,0.00030011358,0.0002436646,0.0003766659,0.004284871,0.014742946],"genre_scores_gemma":[0.8821126,0.00073225616,0.10311155,0.0007505546,0.00028568672,0.00033568512,0.00041218507,0.0007543917,0.011505075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99502975,0.0011856968,0.00026672898,0.0010459452,0.0017025141,0.0007693485],"domain_scores_gemma":[0.98439366,0.008544332,0.0008501518,0.0048451833,0.0008027209,0.0005639991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003031123,0.001642919,0.0016486283,0.00095766975,0.0015592048,0.004122529,0.0026704294,0.002568193,0.009096197],"category_scores_gemma":[0.017525986,0.0014409772,0.0014871483,0.0013106002,0.005040208,0.013435895,0.012542906,0.0070087546,0.003644174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015175838,0.0002403304,0.00099235,0.00064603385,0.000112966,0.00043256336,0.0012120599,0.053159174,0.02747083,0.8447881,0.0061443425,0.06328373],"study_design_scores_gemma":[0.00010634271,0.00010042779,0.00014844177,0.0000662861,0.00005533322,0.00014024982,0.000105578765,0.08834318,0.01589761,0.8899889,0.0049982388,0.000049440656],"about_ca_topic_score_codex":0.00054489553,"about_ca_topic_score_gemma":0.0006047324,"teacher_disagreement_score":0.009096197,"about_ca_system_score_codex":0.0023366672,"about_ca_system_score_gemma":0.0018778748,"threshold_uncertainty_score":0.03042984},"labels":[],"label_agreement":null},{"id":"W2949234615","doi":"","title":"Functional Encryption for Inner Product Predicates from Learning with Errors.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Encryption; Scheme (mathematics); Computer science; Bilinear interpolation; Theoretical computer science; Learning with errors; Probabilistic encryption; Lattice (music); Identity (music); Mathematics; Algorithm; Computer security","score_opus":0.02731640463955579,"score_gpt":0.23638325127767076,"score_spread":0.20906684663811498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949234615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026207779,0.00028813723,0.96221936,0.0011004288,0.00014404424,0.00012875289,0.0002422537,0.00040961214,0.009259677],"genre_scores_gemma":[0.76169205,0.0004909692,0.22479667,0.0005956297,0.00026393577,0.0003622915,0.00049652305,0.00017634196,0.011125562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933407,0.0021060125,0.00052909914,0.0006747446,0.0026454593,0.00070414646],"domain_scores_gemma":[0.9907244,0.0033389893,0.00085198286,0.0038863753,0.00081082596,0.00038749265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053634285,0.000587885,0.00084333913,0.00074442895,0.0012898443,0.0034701347,0.0016611962,0.0014508525,0.003715365],"category_scores_gemma":[0.011307537,0.00039293696,0.0013579929,0.0010880004,0.0038356562,0.01217895,0.005635756,0.004629441,0.0013847406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015954109,0.00005439492,0.0002877996,0.00009566675,0.00001837327,0.0001029186,0.0003332595,0.0064484808,0.003113787,0.9633667,0.0015091116,0.024509953],"study_design_scores_gemma":[0.00006556025,0.00015357875,0.00018290548,0.00005146673,0.000033758177,0.00039784424,0.00014109034,0.075911894,0.01476038,0.89319396,0.015053834,0.000053779702],"about_ca_topic_score_codex":0.00039121206,"about_ca_topic_score_gemma":0.00023596971,"teacher_disagreement_score":0.0053634285,"about_ca_system_score_codex":0.0016209116,"about_ca_system_score_gemma":0.0017916366,"threshold_uncertainty_score":0.028364897},"labels":[],"label_agreement":null},{"id":"W2949284374","doi":"10.4230/lipics.itc.2020.7","title":"Leakage-Resilient Non-Malleable Secret Sharing in Non-compartmentalized Models","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Ministry of Education, India; Natural Sciences and Engineering Research Council of Canada; Nanyang Technological University; Division of Mathematical Sciences; National Science Foundation","keywords":"Secret sharing; Leakage (economics); Adversary; Computer science; Information leakage; Access structure; Secure multi-party computation; Affine transformation; Homomorphic secret sharing; Bounded function; Cryptography; Computer security; Theoretical computer science; Mathematics","score_opus":0.06001100688107449,"score_gpt":0.19681011245095492,"score_spread":0.13679910556988042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949284374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112783834,0.00084943237,0.87581784,0.0012692926,0.0000745366,0.00017897597,0.00039749307,0.00095408567,0.0076745246],"genre_scores_gemma":[0.95437026,0.0005894298,0.0374564,0.00032840483,0.000078230136,0.00017029718,0.00024166817,0.00016823645,0.006597018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941514,0.0017478216,0.00043284192,0.0012823845,0.0012855086,0.0011000228],"domain_scores_gemma":[0.983023,0.008190983,0.0018775549,0.0053766975,0.0009257875,0.00060598075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043629953,0.0014489279,0.0023780908,0.0013408114,0.001537961,0.0041106106,0.0031901638,0.0030681458,0.0043655084],"category_scores_gemma":[0.016579272,0.0010604742,0.0034831841,0.0017351924,0.0047800518,0.013475722,0.0067150877,0.0056710993,0.0011884323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040935865,0.000088866844,0.00046250736,0.00026643748,0.00013274209,0.00031558433,0.0005294903,0.2097081,0.006734688,0.7720858,0.0011090563,0.008157277],"study_design_scores_gemma":[0.000054736574,0.00008223676,0.000106403386,0.000055335175,0.00005145793,0.00016350365,0.00006406902,0.4867783,0.0046538627,0.5064055,0.0015201328,0.00006462597],"about_ca_topic_score_codex":0.001637684,"about_ca_topic_score_gemma":0.0009560525,"teacher_disagreement_score":0.0051090736,"about_ca_system_score_codex":0.0051090736,"about_ca_system_score_gemma":0.0024774312,"threshold_uncertainty_score":0.037069082},"labels":[],"label_agreement":null},{"id":"W2949285224","doi":"","title":"Noninteractive two-channel message authentication based on hybrid-collision resistant hash functions.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Computer network; Message authentication code; Computer security; Protocol (science); Hash-based message authentication code; Key (lock); Hash chain; Collision resistance; Channel (broadcasting); Context (archaeology); Authentication (law); Cryptographic hash function; Cryptography; Perfect hash function","score_opus":0.013372456032269959,"score_gpt":0.26228215504186864,"score_spread":0.24890969900959867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949285224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011081118,0.00026485123,0.9846348,0.0001800074,0.00008279286,0.00012723467,0.000032895623,0.00035728485,0.0032389842],"genre_scores_gemma":[0.7554147,0.00047687197,0.23329557,0.00022902508,0.00012335714,0.00033293094,0.00015353569,0.00009117202,0.009882794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997322,0.00094623707,0.00010617286,0.00034994117,0.0009759546,0.00029970647],"domain_scores_gemma":[0.9952068,0.0022013236,0.00045825145,0.0015527001,0.0003873251,0.00019354852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028022951,0.0006449896,0.00081433676,0.00066132547,0.00091877725,0.0020367894,0.002658215,0.0014891792,0.003351191],"category_scores_gemma":[0.0057657682,0.00047918258,0.000866719,0.0007344472,0.0035803297,0.005841398,0.0034758383,0.0019536307,0.0012536801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003274828,0.00010798011,0.00043430124,0.00015851656,0.000069514834,0.0002757479,0.000390051,0.03624335,0.010669448,0.92452306,0.0018299167,0.024970656],"study_design_scores_gemma":[0.00011984063,0.0003247192,0.0002063965,0.000035955105,0.00006668959,0.00047317139,0.00009722786,0.6599391,0.022065675,0.3038275,0.012775345,0.000068461726],"about_ca_topic_score_codex":0.00040166345,"about_ca_topic_score_gemma":0.00032986456,"teacher_disagreement_score":0.003351191,"about_ca_system_score_codex":0.0010300963,"about_ca_system_score_gemma":0.0009773192,"threshold_uncertainty_score":0.0148201585},"labels":[],"label_agreement":null},{"id":"W2949361893","doi":"","title":"Localised Multisecret Sharing.","year":2015,"lang":"en","type":"preprint","venue":"BIROn (Birkbeck, University of London)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheme (mathematics); Range (aeronautics); Set (abstract data type); Key (lock); Context (archaeology); Information sharing; Secret sharing; Order (exchange); Supply chain; Theoretical computer science; Computer security; Mathematics; Cryptography; Business","score_opus":0.02867527655641538,"score_gpt":0.22326397360534792,"score_spread":0.19458869704893253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949361893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06999714,0.0072442656,0.810774,0.0036728415,0.0010989744,0.00040688858,0.001636471,0.0037123174,0.10145703],"genre_scores_gemma":[0.9216949,0.0010278998,0.029397894,0.0005847236,0.00034182917,0.00018689441,0.0006877668,0.00022680208,0.045851275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977245,0.00061764015,0.00012686462,0.00046460898,0.0006047382,0.00046170835],"domain_scores_gemma":[0.9954609,0.0010102594,0.0003064256,0.002605041,0.00036087033,0.0002564448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015246768,0.00072290556,0.0013304334,0.0007307697,0.0011367232,0.0027282462,0.001664792,0.0015042695,0.015929742],"category_scores_gemma":[0.0046601146,0.00045707144,0.00075398985,0.0011665323,0.0018814701,0.006666452,0.006418787,0.002764158,0.0054726186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002204628,0.00027073125,0.0010844561,0.0008031733,0.00019530357,0.000523515,0.0006010039,0.02374777,0.0227057,0.7769834,0.032632675,0.13824764],"study_design_scores_gemma":[0.00022009773,0.00019929794,0.00047103036,0.00012736979,0.00010754475,0.00072834897,0.00011105091,0.10365567,0.017964205,0.8339991,0.042330187,0.0000860537],"about_ca_topic_score_codex":0.00041204187,"about_ca_topic_score_gemma":0.00046497319,"teacher_disagreement_score":0.015929742,"about_ca_system_score_codex":0.0019007499,"about_ca_system_score_gemma":0.0010857017,"threshold_uncertainty_score":0.053290248},"labels":[],"label_agreement":null},{"id":"W2949422853","doi":"","title":"How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Verifiable secret sharing; Delegate; Computer science; Delegation; Theoretical computer science; Computation; Encryption; Cryptography; Scheme (mathematics); Function (biology); Cryptographic primitive; Computer security; Algorithm; Mathematics; Cryptographic protocol; Programming language; Law","score_opus":0.04026779600464832,"score_gpt":0.2518847595403582,"score_spread":0.2116169635357099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949422853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00988158,0.0005988753,0.9786476,0.0022149147,0.00024242718,0.00021147716,0.00019499662,0.000695383,0.0073128026],"genre_scores_gemma":[0.58939314,0.0013310232,0.39560905,0.0012143851,0.00037589125,0.0006239029,0.0007190042,0.00037698657,0.0103566665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99274325,0.0026479787,0.0005282006,0.0009238838,0.002464556,0.00069224247],"domain_scores_gemma":[0.98416877,0.007820825,0.00083377596,0.0059799566,0.00077963993,0.00041700483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071332552,0.00071134156,0.0011555342,0.00082167087,0.0020040332,0.0059357863,0.0025969972,0.0027004187,0.005261002],"category_scores_gemma":[0.020131232,0.0008342659,0.002328376,0.0015638191,0.006424212,0.017860854,0.007978799,0.007976535,0.0015056704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015292998,0.00006354263,0.0003789946,0.00015811529,0.000036950092,0.00016798779,0.00039902807,0.012056956,0.0022800665,0.9481904,0.00346537,0.032649714],"study_design_scores_gemma":[0.000057562276,0.00004694549,0.00015643393,0.000075997064,0.000043043794,0.00021651799,0.00006151185,0.09986367,0.009490773,0.8749872,0.014953691,0.000046641813],"about_ca_topic_score_codex":0.001421221,"about_ca_topic_score_gemma":0.0009857283,"teacher_disagreement_score":0.0071332552,"about_ca_system_score_codex":0.0031670476,"about_ca_system_score_gemma":0.002986071,"threshold_uncertainty_score":0.037724733},"labels":[],"label_agreement":null},{"id":"W2949485271","doi":"","title":"Public Key Encryption with Keyword Search Revisited.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scheme (mathematics); Encryption; Inefficiency; Keyword search; Key (lock); Computer security; Public-key cryptography; Channel (broadcasting); Theoretical computer science; Information retrieval; Computer network; Mathematics","score_opus":0.03917362331164062,"score_gpt":0.26339280718228103,"score_spread":0.2242191838706404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949485271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028165467,0.034598347,0.6878684,0.038558453,0.0033091018,0.00033412487,0.00057609857,0.0006082908,0.20598169],"genre_scores_gemma":[0.8265107,0.013379343,0.10714302,0.0046313284,0.0020286024,0.0002589338,0.00038150567,0.00014842668,0.04551817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996256,0.0012704261,0.00028131777,0.00043993938,0.001366705,0.0003856044],"domain_scores_gemma":[0.9964474,0.0014022839,0.0003618758,0.0013137892,0.0003861947,0.0000886037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023720239,0.00047568037,0.0008394855,0.0007018366,0.0010503823,0.0027775683,0.0014908357,0.0024142344,0.004463182],"category_scores_gemma":[0.00878737,0.00040740066,0.0005360924,0.0020449639,0.0029829694,0.0151095735,0.0031646113,0.004430247,0.0024550464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008839933,0.000015669288,0.00009993712,0.0001698231,0.000010354753,0.00019792609,0.00014432218,0.0014691108,0.0015813148,0.9611328,0.005227791,0.029862428],"study_design_scores_gemma":[0.00006681777,0.00008189854,0.00016087387,0.00010785276,0.000026029722,0.0024433525,0.00017927327,0.019517556,0.006621053,0.88061297,0.09014352,0.000038824655],"about_ca_topic_score_codex":0.0004388395,"about_ca_topic_score_gemma":0.00034554116,"teacher_disagreement_score":0.004463182,"about_ca_system_score_codex":0.0016952213,"about_ca_system_score_gemma":0.0016559141,"threshold_uncertainty_score":0.014930904},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029499625455188267,"score_gpt":0.2660163876203529,"score_spread":0.23651676216516462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949495942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18089975,0.0019743273,0.804149,0.0012363215,0.00017828694,0.0003747885,0.00034099116,0.0018200831,0.009026414],"genre_scores_gemma":[0.98034805,0.00028999388,0.017299755,0.000057483197,0.000027192918,0.00007235583,0.00009918906,0.000022342403,0.0017835483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982083,0.00045847867,0.0001286275,0.000184749,0.00070773595,0.00031207083],"domain_scores_gemma":[0.99661535,0.0009793733,0.0004270449,0.0012891392,0.0004951351,0.00019392934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013524913,0.000403496,0.00085683295,0.0005531932,0.0009885281,0.0010462507,0.0011321203,0.0009671298,0.0028388319],"category_scores_gemma":[0.0038383736,0.0002718968,0.00037626558,0.001092078,0.0011093625,0.00420219,0.002778106,0.0010299173,0.00084624876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002902846,0.0004805536,0.0043424424,0.00074932387,0.00020279351,0.0012848519,0.00081826537,0.34727055,0.09933606,0.24843356,0.010739604,0.2834392],"study_design_scores_gemma":[0.00015378013,0.00031950005,0.00040235926,0.00004157272,0.000037462025,0.0005752592,0.00010694984,0.8875338,0.035517894,0.068965666,0.0062934025,0.000052386913],"about_ca_topic_score_codex":0.0009261796,"about_ca_topic_score_gemma":0.001020778,"teacher_disagreement_score":0.0028388319,"about_ca_system_score_codex":0.0010073498,"about_ca_system_score_gemma":0.0025812234,"threshold_uncertainty_score":0.009496808},"labels":[],"label_agreement":null},{"id":"W2949665773","doi":"","title":"Hierarchical deterministic Bitcoin wallets that tolerate key leakage.","year":2014,"lang":"en","type":"preprint","venue":"QUT ePrints (Queensland University of Technology)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Computer security; Computer science; Key (lock); Public-key cryptography; Audit; Leakage (economics); The Internet; Business; Accounting; Economics; World Wide Web; Encryption","score_opus":0.013989545278457454,"score_gpt":0.21396123463805516,"score_spread":0.19997168935959772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949665773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40613788,0.0015113527,0.55368733,0.0019233404,0.0004484238,0.00047563104,0.00095559657,0.0031314641,0.03172893],"genre_scores_gemma":[0.95579624,0.0002061926,0.036602095,0.00021478644,0.000059190665,0.00016067502,0.00038140107,0.00017117574,0.0064083436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974178,0.0008466536,0.00016241925,0.00035703607,0.0005726696,0.00064342475],"domain_scores_gemma":[0.9875881,0.0050201635,0.0012249014,0.0044174823,0.000866985,0.00088237744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027100258,0.0006867831,0.0015469916,0.0008600631,0.0018729032,0.0026372932,0.0017376769,0.0018024961,0.006595071],"category_scores_gemma":[0.014464504,0.00060458604,0.0005370155,0.0013475335,0.0019576587,0.0060432553,0.00495059,0.0022087062,0.0017112675],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033183794,0.00033810144,0.0018997903,0.00031812376,0.00014314892,0.0004940021,0.00054806075,0.10334083,0.021249987,0.79664516,0.014247484,0.057456918],"study_design_scores_gemma":[0.00026624213,0.00036063325,0.00041964435,0.00009861374,0.00006361131,0.00032652883,0.0002191799,0.34507698,0.013352375,0.63153446,0.008224163,0.000057536196],"about_ca_topic_score_codex":0.0003504887,"about_ca_topic_score_gemma":0.0007215992,"teacher_disagreement_score":0.006595071,"about_ca_system_score_codex":0.0010471167,"about_ca_system_score_gemma":0.0013281653,"threshold_uncertainty_score":0.022062719},"labels":[],"label_agreement":null},{"id":"W2949890371","doi":"","title":"On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations.","year":2011,"lang":"en","type":"preprint","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Université de Montréal; University of Waterloo; Centre de Recherches Mathématiques","keywords":"Amortized analysis; Zero-knowledge proof; Multiplicative function; Commitment scheme; Discrete mathematics; Mathematics; Gas meter prover; Homomorphic encryption; Finite field; Logarithm; Algebraic number; Binary logarithm; Discrete logarithm; Zero (linguistics); Combinatorics; Computer science; Data structure; Algorithm; Cryptography; Mathematical proof","score_opus":0.2626209991603881,"score_gpt":0.4193453232256077,"score_spread":0.15672432406521958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949890371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079144076,0.008135802,0.75464505,0.02082206,0.0013161435,0.00067891105,0.002380743,0.0011154359,0.13176188],"genre_scores_gemma":[0.73395616,0.007023794,0.20390499,0.0034899951,0.0024538562,0.0020306818,0.0024723662,0.00094538386,0.043722704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9861178,0.0054468066,0.0009112225,0.0021031087,0.0036835524,0.001737556],"domain_scores_gemma":[0.92376006,0.06353526,0.0020982432,0.007803789,0.0016353966,0.0011672047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01010284,0.0022247126,0.003573143,0.002467795,0.0037612913,0.009845774,0.005695394,0.004106757,0.017067173],"category_scores_gemma":[0.04569715,0.0016402253,0.0037456485,0.004175031,0.007921421,0.03206608,0.010971725,0.013750479,0.0027249698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013013682,0.00004783865,0.00021749237,0.00015279138,0.000064322085,0.000053656873,0.00021468868,0.008947496,0.0004532457,0.9732328,0.0054862746,0.010999265],"study_design_scores_gemma":[0.000022888009,0.000015379816,0.00006510613,0.000028261195,0.000019790268,0.00004828711,0.000030938547,0.023543863,0.00019984126,0.97413266,0.0018779044,0.000015074664],"about_ca_topic_score_codex":0.0016898409,"about_ca_topic_score_gemma":0.0014074952,"teacher_disagreement_score":0.017067173,"about_ca_system_score_codex":0.0074654045,"about_ca_system_score_gemma":0.004895493,"threshold_uncertainty_score":0.05709535},"labels":[],"label_agreement":null},{"id":"W2949982754","doi":"","title":"Compact Accumulator using Lattices.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Accumulator (cryptography); Mathematical proof; Computer science; Chinese remainder theorem; Possession (linguistics); Integer (computer science); Set (abstract data type); Scheme (mathematics); Algorithm; Discrete mathematics; Mathematics; Theoretical computer science; Programming language; Mathematical analysis","score_opus":0.04581020450018873,"score_gpt":0.31717089790005487,"score_spread":0.2713606933998661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949982754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023661455,0.0014770423,0.9425738,0.0020767276,0.0004120148,0.0004278809,0.0006083377,0.0019085169,0.026854165],"genre_scores_gemma":[0.44891438,0.0011592864,0.5261126,0.0009032644,0.0004835997,0.00071080617,0.0008803281,0.00041675585,0.020419028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99094886,0.002760934,0.00075566734,0.001446014,0.0034162079,0.0006722532],"domain_scores_gemma":[0.9874752,0.004983168,0.0014175838,0.00456166,0.0009175161,0.0006448911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048040934,0.0009978671,0.0012265174,0.0016216224,0.0028620292,0.0076410086,0.0025251098,0.0021319177,0.010790307],"category_scores_gemma":[0.017494002,0.0008768155,0.0016756521,0.0023438726,0.0062253177,0.022815444,0.0111361975,0.005804285,0.004123861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001997076,0.00005191195,0.00017688744,0.0001705094,0.000026975777,0.00007778317,0.0003030963,0.004285196,0.0033784166,0.96406674,0.002492181,0.024770508],"study_design_scores_gemma":[0.000080728685,0.00015661864,0.0000721911,0.00010106496,0.000031716638,0.0003318685,0.00010004272,0.028294645,0.015253021,0.91765696,0.037848484,0.00007255989],"about_ca_topic_score_codex":0.0004881353,"about_ca_topic_score_gemma":0.00051556533,"teacher_disagreement_score":0.010790307,"about_ca_system_score_codex":0.0026052215,"about_ca_system_score_gemma":0.0028034572,"threshold_uncertainty_score":0.03609723},"labels":[],"label_agreement":null},{"id":"W2950259505","doi":"","title":"Quantum One-Time Memories from Stateless Hardware","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Stateless protocol; Computer science; Oblivious transfer; Cryptography; Simple (philosophy); Quantum; Universal composability; Theoretical computer science; Composability; Programming language; Physics; Algorithm; Cryptographic protocol; Quantum mechanics; State (computer science)","score_opus":0.032199288086200144,"score_gpt":0.266768905432742,"score_spread":0.23456961734654186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950259505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10097781,0.0012040731,0.8253466,0.004222752,0.00031528823,0.000216492,0.0005182023,0.0009728951,0.06622595],"genre_scores_gemma":[0.8820689,0.0011139493,0.098486565,0.0007466637,0.00036257657,0.00031904518,0.00035051556,0.00027722787,0.016274719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986337,0.00031784544,0.000079125755,0.00021555307,0.0005637484,0.0001899405],"domain_scores_gemma":[0.99606365,0.0020091706,0.00031643364,0.0012762652,0.0002051098,0.00012942246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013769167,0.0006972183,0.00081493874,0.0006453819,0.0011530789,0.0036661096,0.0016164206,0.001865173,0.008723582],"category_scores_gemma":[0.0068153446,0.00069884415,0.001158035,0.00058099837,0.0056127505,0.009901008,0.0049814377,0.0053139944,0.0012813495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004144758,0.000016464255,0.000049471186,0.00005301373,0.0000043494865,0.00004163362,0.00007689904,0.0033783736,0.0013084974,0.99175596,0.000542632,0.0027312692],"study_design_scores_gemma":[0.000026715146,0.00003258476,0.000048104554,0.000033762284,0.000008272494,0.00006819648,0.000023312034,0.022424491,0.004660918,0.9691882,0.0034718802,0.000013531659],"about_ca_topic_score_codex":0.000362228,"about_ca_topic_score_gemma":0.0003920786,"teacher_disagreement_score":0.008723582,"about_ca_system_score_codex":0.0015041507,"about_ca_system_score_gemma":0.0012100305,"threshold_uncertainty_score":0.029183328},"labels":[],"label_agreement":null},{"id":"W2950330863","doi":"","title":"Deterministic Computations on a PRAM with Static Processor and Memory Faults","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Parallel computing; Computer science; Constant (computer programming); Slowdown; Binary logarithm; Preprocessor; Computation; Fraction (chemistry); Algorithm; Discrete mathematics; Mathematics","score_opus":0.06596616443463868,"score_gpt":0.2075479969844381,"score_spread":0.14158183254979942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950330863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67872,0.00016486485,0.31357902,0.0005321253,0.00004643207,0.00009716484,0.00031530295,0.0007839419,0.0057612127],"genre_scores_gemma":[0.9466756,0.00008783081,0.051001977,0.00005840112,0.000017838296,0.0000915593,0.00014931665,0.00004676824,0.0018706602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925786,0.00021145894,0.000039139777,0.0001309135,0.00018271385,0.0001778548],"domain_scores_gemma":[0.99737895,0.001322778,0.0002956638,0.0006256511,0.00026618995,0.00011078292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053660106,0.00044829896,0.0007451639,0.00023713463,0.0007388385,0.0007572774,0.0014526927,0.0008196286,0.001735051],"category_scores_gemma":[0.0038149795,0.00035811574,0.0007028359,0.00041380693,0.0016210474,0.0014234362,0.0010419193,0.0010241888,0.00023478118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031927106,0.00006208341,0.0013520408,0.000058693346,0.000029086337,0.0002520457,0.0001020586,0.9450057,0.005736774,0.044094473,0.00026331414,0.0027244957],"study_design_scores_gemma":[0.000050963616,0.000045598652,0.00014911935,0.0000030386855,0.000008023618,0.000025393396,0.000015651163,0.98169404,0.0022896552,0.0154190175,0.00029225377,0.000007192339],"about_ca_topic_score_codex":0.0035597426,"about_ca_topic_score_gemma":0.001815674,"teacher_disagreement_score":0.0035597426,"about_ca_system_score_codex":0.0007649868,"about_ca_system_score_gemma":0.0011447273,"threshold_uncertainty_score":0.0070780516},"labels":[],"label_agreement":null},{"id":"W2950525928","doi":"","title":"Information-Theoretically Secure Voting Without an Honest Majority","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Correctness; Computer science; Computer security; Protocol (science); Voting; Ballot; Cryptography; Internet privacy; Law; Algorithm; Political science","score_opus":0.011234327692040542,"score_gpt":0.2525672033103528,"score_spread":0.24133287561831226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950525928","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053303976,0.0002893021,0.90260816,0.002353314,0.00031692756,0.00035820823,0.00037611034,0.0007865674,0.039607584],"genre_scores_gemma":[0.7703746,0.00026566224,0.20429535,0.00061911833,0.0002476955,0.0004658588,0.00044546093,0.00014406085,0.02314224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912531,0.0027791746,0.0005979896,0.0010339766,0.0034492437,0.000886396],"domain_scores_gemma":[0.98920536,0.0041437834,0.00088207435,0.004126441,0.0012266096,0.00041573163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004571032,0.0007334268,0.0012453337,0.0008089835,0.0018371721,0.0030794323,0.0024272732,0.0018774254,0.006172644],"category_scores_gemma":[0.011753908,0.00053829286,0.001100112,0.001106028,0.003494718,0.0048640645,0.0041404534,0.002797843,0.0023173003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000661368,0.00012644357,0.0005292054,0.00017751165,0.0000960142,0.00019436027,0.00042998153,0.02987407,0.005333321,0.91769826,0.004774197,0.040105257],"study_design_scores_gemma":[0.00035016387,0.00015315408,0.00018725108,0.00005288872,0.00007525797,0.00015887049,0.00006814642,0.17906433,0.012906293,0.79248863,0.014441423,0.00005353201],"about_ca_topic_score_codex":0.00054615387,"about_ca_topic_score_gemma":0.00052908773,"teacher_disagreement_score":0.006172644,"about_ca_system_score_codex":0.0014236701,"about_ca_system_score_gemma":0.002409056,"threshold_uncertainty_score":0.024174213},"labels":[],"label_agreement":null},{"id":"W2950596278","doi":"","title":"Privacy-aware Attribute-based Encryption with User Accountability.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Ciphertext; Attribute-based encryption; Computer science; Encryption; Computer security; Access control; Accountability; Key (lock); Scheme (mathematics); Public-key cryptography; Access structure; Cryptography; Secret sharing; Mathematics; Political science","score_opus":0.017089669886696076,"score_gpt":0.2629797871105366,"score_spread":0.24589011722384052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950596278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007925552,0.0005439207,0.97734046,0.0010795168,0.0002036045,0.00016918649,0.0001939396,0.00044485694,0.01209885],"genre_scores_gemma":[0.64300126,0.0013211853,0.3368638,0.00076315616,0.0003443607,0.00041810708,0.00047816744,0.00009920367,0.016710732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507254,0.0016072623,0.0003457522,0.0004084355,0.0021176548,0.00044828397],"domain_scores_gemma":[0.99516946,0.0011837041,0.0004809624,0.0024923165,0.00045660016,0.00021696337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003145861,0.00048232762,0.0007506283,0.00057723175,0.001166813,0.002590467,0.0017150881,0.0013893282,0.0024442016],"category_scores_gemma":[0.0063090203,0.00038281397,0.00100836,0.0014623809,0.001958613,0.006867338,0.0046992735,0.003932287,0.0013896981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018247268,0.00008250927,0.00045172326,0.00016096662,0.000033721168,0.00026883665,0.00025227715,0.0070996718,0.006763815,0.93965095,0.00471258,0.040340398],"study_design_scores_gemma":[0.00008759733,0.0001475645,0.00047246992,0.0000868419,0.00007609143,0.0016057192,0.00011698165,0.15061092,0.029264875,0.71873057,0.098729014,0.000071364135],"about_ca_topic_score_codex":0.00027239474,"about_ca_topic_score_gemma":0.0002796449,"teacher_disagreement_score":0.003145861,"about_ca_system_score_codex":0.0009149458,"about_ca_system_score_gemma":0.0017838972,"threshold_uncertainty_score":0.016637087},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.21278045914273222,"score_gpt":0.4159124099031242,"score_spread":0.203131950760392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950776700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12321783,0.005461779,0.6567808,0.046017427,0.001714167,0.00040114037,0.00082515046,0.0011090491,0.16447273],"genre_scores_gemma":[0.929047,0.0019746113,0.05111698,0.0021762296,0.00060413766,0.00025036916,0.0004438812,0.00017095756,0.014215779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919451,0.0026694208,0.0003859872,0.0012732652,0.0025567769,0.0011694875],"domain_scores_gemma":[0.9643012,0.018918386,0.0016240628,0.012113664,0.0024218806,0.0006208285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007631679,0.000755497,0.0009218275,0.00058865314,0.0016134928,0.005669381,0.0016412125,0.00410243,0.013827117],"category_scores_gemma":[0.033801246,0.00095556484,0.00097301614,0.0008314458,0.006665057,0.022821998,0.0052577564,0.0062993034,0.004758602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027055887,0.00010132489,0.00040342307,0.00018812963,0.000032484175,0.00018044726,0.0001814753,0.012658125,0.0014720395,0.9533693,0.008773091,0.02236948],"study_design_scores_gemma":[0.00007307906,0.000049418348,0.00009227687,0.00007529206,0.000010489292,0.00016963639,0.00009574215,0.028398141,0.0023719235,0.95874023,0.009901241,0.00002253093],"about_ca_topic_score_codex":0.00050047203,"about_ca_topic_score_gemma":0.0003490444,"teacher_disagreement_score":0.013827117,"about_ca_system_score_codex":0.0018002797,"about_ca_system_score_gemma":0.0021794527,"threshold_uncertainty_score":0.046256304},"labels":[],"label_agreement":null},{"id":"W2950780165","doi":"10.48550/arxiv.1502.03708","title":"Provably weak instances of Ring-LWE","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Learning with errors; Cryptosystem; Ring (chemistry); Mathematics; Cyclotomic field; Polynomial ring; Discrete mathematics; Algebraic number field; Class (philosophy); Ring of integers; Lattice (music); Lattice problem; Combinatorics; Cryptography; Computer science; Polynomial; Algorithm; Physics","score_opus":0.08063473467926398,"score_gpt":0.19107313671449203,"score_spread":0.11043840203522805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950780165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40964583,0.0016330702,0.45300856,0.03370013,0.001041687,0.0005122659,0.004477205,0.0053554093,0.09062588],"genre_scores_gemma":[0.8962514,0.0005865437,0.08062723,0.002309061,0.0005848716,0.00036946873,0.0024188412,0.00044969635,0.01640292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516064,0.0013235492,0.00038316267,0.0010396952,0.0013367245,0.0007561506],"domain_scores_gemma":[0.97991335,0.013990962,0.0010103342,0.0034405144,0.00095715333,0.0006876505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034035926,0.00091792893,0.0011635581,0.0006711349,0.001776313,0.0033357926,0.0018607324,0.0024781276,0.011416267],"category_scores_gemma":[0.021276398,0.0006310206,0.0016570126,0.00090744987,0.0030129992,0.010601933,0.0047918274,0.006590396,0.0022510139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015689022,0.00046389268,0.005538612,0.0009986034,0.00019910243,0.0006615515,0.00083017675,0.06602645,0.013724108,0.7697519,0.04908861,0.09114814],"study_design_scores_gemma":[0.00021084351,0.00014631303,0.00082351215,0.00007865051,0.00007008062,0.0006237684,0.00038778968,0.13367231,0.015362423,0.8282218,0.020339184,0.000063276704],"about_ca_topic_score_codex":0.0006363786,"about_ca_topic_score_gemma":0.00092261477,"teacher_disagreement_score":0.011416267,"about_ca_system_score_codex":0.0017680151,"about_ca_system_score_gemma":0.0014050812,"threshold_uncertainty_score":0.0381912},"labels":[],"label_agreement":null},{"id":"W2950879282","doi":"","title":"PEKSrand: Providing Predicate Privacy in Public-key Encryption with Keyword Search.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Predicate (mathematical logic); Computer science; Delegate; Encryption; Theoretical computer science; Property (philosophy); Scheme (mathematics); Computer security; Mathematics","score_opus":0.0250938705522213,"score_gpt":0.2579563578888173,"score_spread":0.23286248733659604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950879282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027105398,0.0011280274,0.95853823,0.0012438657,0.00017256878,0.00033720594,0.0007178437,0.0025833985,0.008173469],"genre_scores_gemma":[0.78372777,0.0006301625,0.2047733,0.0006467872,0.00018000216,0.00032637242,0.0008337476,0.000213074,0.008668822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936016,0.0023731198,0.0005109082,0.0006882026,0.0021369932,0.00068920397],"domain_scores_gemma":[0.993159,0.0018535531,0.0006775768,0.0036433265,0.00044635133,0.0002202774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272837,0.0006193887,0.0013331503,0.0010977434,0.0012542509,0.0027754412,0.0022955725,0.0020874904,0.002952505],"category_scores_gemma":[0.012599872,0.0006523361,0.00091226905,0.0021297955,0.002652536,0.012455335,0.006798852,0.0027487539,0.001630447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027353403,0.0003227138,0.0021399825,0.0006348588,0.00021853889,0.0007599794,0.00096293475,0.044184018,0.031349886,0.6988562,0.02046252,0.19737305],"study_design_scores_gemma":[0.00050706463,0.00050352036,0.0010954031,0.00012174177,0.00015073469,0.0018177282,0.00026967042,0.38481402,0.06947258,0.48915544,0.051884394,0.00020761967],"about_ca_topic_score_codex":0.00057747716,"about_ca_topic_score_gemma":0.0005285033,"teacher_disagreement_score":0.004272837,"about_ca_system_score_codex":0.0017636879,"about_ca_system_score_gemma":0.002554777,"threshold_uncertainty_score":0.022597194},"labels":[],"label_agreement":null},{"id":"W2950888016","doi":"10.1142/s012905412050001x","title":"Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS","year":2020,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Secure multi-party computation; Computation; Computer network; Algorithm","score_opus":0.0368566705093553,"score_gpt":0.33961078080682344,"score_spread":0.3027541102974681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950888016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011007929,0.00041012335,0.9809629,0.0006413218,0.000092051465,0.00015328509,0.0001156066,0.00032497026,0.0062918267],"genre_scores_gemma":[0.49396297,0.0007645711,0.49655637,0.0005691664,0.0001993459,0.00040163085,0.00026809398,0.00020508328,0.007072634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931137,0.002321754,0.00040135076,0.001405506,0.002085353,0.0006722399],"domain_scores_gemma":[0.993804,0.0025094296,0.00045318418,0.002594795,0.00042511596,0.00021355897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005399251,0.0010123671,0.001614345,0.00093394046,0.0013818206,0.0036736974,0.003067016,0.0026705067,0.0032387713],"category_scores_gemma":[0.0090852985,0.0009796657,0.0020940357,0.0014046591,0.0037630228,0.008521764,0.0084496485,0.006314897,0.0018585975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018978181,0.00006120956,0.00016680856,0.00016880107,0.000050596154,0.00019474316,0.0002608035,0.04092454,0.0050965105,0.92866874,0.0015993696,0.022618137],"study_design_scores_gemma":[0.00008308869,0.00008337746,0.00010686812,0.000060513426,0.0000430558,0.00019524939,0.000053216176,0.3053695,0.009262334,0.67609674,0.008583182,0.00006287842],"about_ca_topic_score_codex":0.000748805,"about_ca_topic_score_gemma":0.0004869966,"teacher_disagreement_score":0.005399251,"about_ca_system_score_codex":0.0019494356,"about_ca_system_score_gemma":0.002014441,"threshold_uncertainty_score":0.02855432},"labels":[],"label_agreement":null},{"id":"W2950940133","doi":"","title":"Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cryptosystem; Learning with errors; Oblivious transfer; Computer science; Public key cryptosystem; Public-key cryptography; Integer (computer science); Key (lock); Theoretical computer science; Quantum; Transfer (computing); Cryptography; Discrete mathematics; Mathematics; Algorithm; Encryption; Computer security; Physics; Quantum mechanics; Parallel computing","score_opus":0.027679791595706608,"score_gpt":0.25015450251888444,"score_spread":0.22247471092317783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950940133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08545298,0.0004959186,0.8801325,0.0012626933,0.00024757453,0.00038812376,0.00024316371,0.00076805137,0.031008927],"genre_scores_gemma":[0.90454924,0.00027534188,0.08423834,0.0003776215,0.00015697307,0.00030842796,0.00023036257,0.00011083167,0.0097527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996546,0.0012158807,0.00022695243,0.0004908863,0.0011799951,0.00034033306],"domain_scores_gemma":[0.9963012,0.0012734045,0.00035300115,0.0016041925,0.00031232025,0.00015589339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023705368,0.000548776,0.0007772971,0.00074188295,0.0009175347,0.0019955605,0.0014394397,0.0011221295,0.0036624018],"category_scores_gemma":[0.0070851385,0.0002984082,0.00097547454,0.00055814016,0.0036329788,0.0059248568,0.0037440704,0.0025801125,0.0010920194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099834266,0.000047040638,0.00016768386,0.00007112604,0.000019174997,0.00006459926,0.00014152173,0.0069779153,0.0036014756,0.980143,0.00058166403,0.008084841],"study_design_scores_gemma":[0.000056001427,0.00010931993,0.000109460554,0.000028534727,0.000022400453,0.00018988343,0.000036165588,0.06946017,0.015638657,0.90823233,0.0060931677,0.00002393091],"about_ca_topic_score_codex":0.000117262454,"about_ca_topic_score_gemma":0.0000787333,"teacher_disagreement_score":0.0036624018,"about_ca_system_score_codex":0.0011579065,"about_ca_system_score_gemma":0.000962477,"threshold_uncertainty_score":0.012536764},"labels":[],"label_agreement":null},{"id":"W2951114148","doi":"","title":"Comparing Two Pairing-Based Aggregate Signature Schemes.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Pairing; Bilinear interpolation; Computer science; Scheme (mathematics); Signature (topology); Oracle; Public-key cryptography; Mathematics; Computer security; Encryption; Physics","score_opus":0.023364742972495516,"score_gpt":0.273729136393664,"score_spread":0.25036439342116845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951114148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38090074,0.010240529,0.5140349,0.0032604178,0.0014532852,0.0009298249,0.0012351485,0.0010397827,0.086905256],"genre_scores_gemma":[0.9303164,0.0015991892,0.06057275,0.00026127094,0.00015597824,0.0001774056,0.00062697637,0.000056260815,0.0062338626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98684955,0.005128085,0.00058069924,0.0006495868,0.005962999,0.0008291245],"domain_scores_gemma":[0.98546696,0.0058659418,0.0014289608,0.004794238,0.0017397732,0.00070411654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008823102,0.0006504745,0.0010415338,0.0022051078,0.001323548,0.00442242,0.0012536359,0.0020582224,0.005936399],"category_scores_gemma":[0.01950784,0.0003322905,0.00078064785,0.0038219753,0.0029365444,0.00944197,0.0064461445,0.0019211674,0.0017643959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004590899,0.00031251757,0.0050169183,0.00071786763,0.00021930986,0.0001944305,0.0009933199,0.033558857,0.014662653,0.77330714,0.005235809,0.16119027],"study_design_scores_gemma":[0.0006760901,0.002226777,0.0035968788,0.0003163355,0.00026455714,0.001192648,0.00095914985,0.18497546,0.046682157,0.6963024,0.062628664,0.0001788553],"about_ca_topic_score_codex":0.00028700673,"about_ca_topic_score_gemma":0.00022180982,"teacher_disagreement_score":0.008823102,"about_ca_system_score_codex":0.0019927202,"about_ca_system_score_gemma":0.001609351,"threshold_uncertainty_score":0.046661556},"labels":[],"label_agreement":null},{"id":"W2951197100","doi":"10.48550/arxiv.1109.3235","title":"A new spin on quantum cryptography: Avoiding trapdoors and embracing public keys","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key (lock); Computer science; Public-key cryptography; Quantum cryptography; Cryptography; Authentication (law); Computer security; Characterization (materials science); Quantum; Encryption; Quantum information; Quantum mechanics; Physics","score_opus":0.09741861104258608,"score_gpt":0.1951782432662092,"score_spread":0.09775963222362312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951197100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01368873,0.006096649,0.74510956,0.056701716,0.0038763452,0.00014436858,0.00013864739,0.0006119323,0.17363207],"genre_scores_gemma":[0.59060377,0.011104663,0.32900736,0.017165434,0.007520264,0.0005963367,0.00013275434,0.0011752485,0.042694233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99455476,0.0023775368,0.00020823361,0.00056729926,0.0016441834,0.00064795674],"domain_scores_gemma":[0.9841039,0.008324455,0.0006711667,0.0054012476,0.00080200954,0.0006972323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007366334,0.0012601082,0.0014862544,0.0026725917,0.005450094,0.009339279,0.0035231037,0.008134729,0.009390208],"category_scores_gemma":[0.020434555,0.001029062,0.0018532702,0.0020828727,0.030224761,0.034486122,0.010677249,0.015332754,0.0027477462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010440898,0.000009056074,0.000024997207,0.000021087817,0.0000026375901,0.000024963165,0.000074818505,0.00021491158,0.00014707097,0.9958346,0.0010677067,0.0025677898],"study_design_scores_gemma":[0.0000098894325,0.000019719848,0.000014453032,0.00004086613,0.000004666023,0.000050271945,0.000041830448,0.001810662,0.00027530116,0.98354524,0.014173183,0.000013927781],"about_ca_topic_score_codex":0.0007205407,"about_ca_topic_score_gemma":0.00066173903,"teacher_disagreement_score":0.009390208,"about_ca_system_score_codex":0.0024434868,"about_ca_system_score_gemma":0.0019326931,"threshold_uncertainty_score":0.038957357},"labels":[],"label_agreement":null},{"id":"W2951238142","doi":"","title":"CRYSTALS - Kyber: A CCA-secure Module-Lattice-Based KEM","year":2017,"lang":"en","type":"preprint","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","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; Key exchange; NIST; Cryptographic primitive; Learning with errors; Cryptography; Encryption; Theoretical computer science; Ciphertext; Public-key cryptography; Computer security; Cryptographic protocol","score_opus":0.11139067283204332,"score_gpt":0.3754857750845648,"score_spread":0.26409510225252153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951238142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027646853,0.00042335072,0.9379545,0.0010524775,0.00037691317,0.00040560975,0.0006083642,0.0040707258,0.027461292],"genre_scores_gemma":[0.52251464,0.0005944504,0.43820274,0.0010184707,0.00022437768,0.0007312642,0.0011811819,0.000922571,0.034610316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741423,0.00060570025,0.00015549114,0.0004169125,0.0010674064,0.00034027197],"domain_scores_gemma":[0.9985267,0.0003777977,0.00013952352,0.0005409614,0.0002136348,0.00020129724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017581802,0.00060084154,0.0010851083,0.00071329356,0.0016629258,0.002341953,0.0021341252,0.0013229172,0.008646123],"category_scores_gemma":[0.0038214147,0.00055222964,0.0011844926,0.0011135691,0.0028717467,0.0060360846,0.006713809,0.0039006653,0.006412401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050526287,0.0001934584,0.00036190558,0.00032767773,0.000060763257,0.00033405487,0.00042692217,0.019101137,0.016406734,0.88335365,0.011984958,0.066943526],"study_design_scores_gemma":[0.000263931,0.00030689262,0.0002090434,0.00008619325,0.00005474598,0.0007338598,0.00014935371,0.13284914,0.050173435,0.74224913,0.072730996,0.0001932845],"about_ca_topic_score_codex":0.00040862293,"about_ca_topic_score_gemma":0.0005841044,"teacher_disagreement_score":0.008646123,"about_ca_system_score_codex":0.0009732947,"about_ca_system_score_gemma":0.0029538402,"threshold_uncertainty_score":0.028924167},"labels":[],"label_agreement":null},{"id":"W2951244793","doi":"","title":"SecureMed: Secure Medical Computation using GPU-Accelerated Homomorphic Encryption Scheme.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Speedup; Encryption; Scheme (mathematics); Cloud computing; Computation; Computer security; Parallel computing; Algorithm; Operating system","score_opus":0.0437951450094653,"score_gpt":0.3112288715510061,"score_spread":0.2674337265415408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951244793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091515295,0.0020010911,0.85577136,0.0016286375,0.0004659197,0.0005056122,0.0013640551,0.012497139,0.034250956],"genre_scores_gemma":[0.702566,0.00051033485,0.27792686,0.0004578097,0.00006961213,0.00025482054,0.0014764353,0.0003171229,0.016421018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995059,0.00012185991,0.000029795237,0.000041355626,0.00022214859,0.00007901464],"domain_scores_gemma":[0.99959797,0.00006973926,0.000032989086,0.00020565452,0.000059593323,0.00003407297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005415923,0.00039523272,0.00039543607,0.00042764898,0.00038089807,0.0008216759,0.00083584577,0.0006825588,0.0065263663],"category_scores_gemma":[0.0012838128,0.00018381244,0.00039622185,0.0004204866,0.00057037576,0.0013117833,0.0014753157,0.00075662317,0.0020389317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039855093,0.00051558047,0.004814317,0.00067661796,0.00027732566,0.0015825058,0.0005775384,0.10146229,0.12726112,0.23030406,0.08769564,0.44084743],"study_design_scores_gemma":[0.0004926939,0.0004072551,0.0014628293,0.000059584927,0.000037013957,0.001144883,0.00007077026,0.7938013,0.08631935,0.053615525,0.06253073,0.000058014062],"about_ca_topic_score_codex":0.00075036474,"about_ca_topic_score_gemma":0.001344448,"teacher_disagreement_score":0.0065263663,"about_ca_system_score_codex":0.0006294937,"about_ca_system_score_gemma":0.0008901771,"threshold_uncertainty_score":0.021832943},"labels":[],"label_agreement":null},{"id":"W2951247826","doi":"","title":"Efficient Consistency Proofs for Generalized Queries on a Committed Database.","year":2004,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Computer science; Database; Range tree; View; Data structure; Range (aeronautics); Range query (database); Alias; Theoretical computer science; Protocol (science); Rectangle; Consistency (knowledge bases); Information retrieval; Mathematics; Database design; Web search query; Sargable; Tree structure; Programming language; Search engine; Interval tree","score_opus":0.027707611027542347,"score_gpt":0.2841236627902481,"score_spread":0.25641605176270577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951247826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070718145,0.000235866,0.986896,0.00090533466,0.0001083645,0.00026471697,0.00044581387,0.0012905811,0.0027815553],"genre_scores_gemma":[0.3289344,0.00070771656,0.6547616,0.001696027,0.0007106321,0.0011556069,0.0021229947,0.0010530038,0.008858061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9746875,0.0071750632,0.00213658,0.0036381416,0.010587096,0.0017757284],"domain_scores_gemma":[0.88626266,0.06257777,0.005489977,0.03524285,0.008952817,0.0014739796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017445853,0.0011212511,0.0016422574,0.0012752479,0.002444275,0.0060952273,0.0057044085,0.0023593789,0.007497994],"category_scores_gemma":[0.07984451,0.0017125027,0.0028691662,0.0025585152,0.004258542,0.019640766,0.012528988,0.0076510026,0.002627938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061145716,0.000226651,0.0013410193,0.00078011624,0.0002678524,0.0005076345,0.0013125445,0.02657963,0.012042552,0.86305445,0.013286181,0.0799899],"study_design_scores_gemma":[0.00036062856,0.00022035849,0.00039016493,0.00012151491,0.00018556151,0.000540454,0.0002916838,0.1347436,0.019348765,0.8232391,0.020457663,0.000100581005],"about_ca_topic_score_codex":0.0012897323,"about_ca_topic_score_gemma":0.001140714,"teacher_disagreement_score":0.017445853,"about_ca_system_score_codex":0.0024890134,"about_ca_system_score_gemma":0.0052604657,"threshold_uncertainty_score":0.09226358},"labels":[],"label_agreement":null},{"id":"W2951345862","doi":"","title":"On the Structure of Unconditional UC Hybrid Protocols.","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Protocol (science); Ideal (ethics); Computation; Power (physics); Nothing; Secure multi-party computation; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Physics; Quantum mechanics; Medicine; Political science","score_opus":0.023719821844464514,"score_gpt":0.2926158362625936,"score_spread":0.26889601441812905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951345862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14584604,0.0015373533,0.75348437,0.0059756828,0.0002672717,0.00026158334,0.00071108836,0.0010819267,0.0908346],"genre_scores_gemma":[0.9131729,0.00076457334,0.0661007,0.00076181086,0.00026401866,0.00038648673,0.0006089435,0.0002321384,0.017708508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969253,0.0009901471,0.00016747834,0.0006107614,0.00080153137,0.0005048137],"domain_scores_gemma":[0.99078923,0.0049332133,0.00094789435,0.0020254944,0.000759778,0.00054445537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032325368,0.00058618793,0.00086968846,0.0017033508,0.0030678557,0.0043363147,0.00196715,0.002099605,0.0098482985],"category_scores_gemma":[0.010514064,0.00069728773,0.0010860953,0.0020607891,0.0060536587,0.014203351,0.007165346,0.004768888,0.0013420417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019513427,0.0000068780705,0.000063549094,0.00001905953,0.000004129636,0.000029185769,0.00014003039,0.0010346874,0.00021501722,0.99686015,0.00028184158,0.0013258657],"study_design_scores_gemma":[0.000011411232,0.000016135336,0.00006040221,0.000019113553,0.000008713688,0.000041122512,0.00005341916,0.011754027,0.00043723264,0.98493445,0.002655806,0.000008285207],"about_ca_topic_score_codex":0.0007055743,"about_ca_topic_score_gemma":0.0005115726,"teacher_disagreement_score":0.0098482985,"about_ca_system_score_codex":0.0024938602,"about_ca_system_score_gemma":0.001261712,"threshold_uncertainty_score":0.03294581},"labels":[],"label_agreement":null},{"id":"W2951443613","doi":"","title":"Succinct Randomized Encodings and their Applications.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Plaintext; Obfuscation; Bounded function; Computer science; Cryptography; Theoretical computer science; Encoding (memory); ENCODE; Encryption; Secure multi-party computation; Simple (philosophy); Complexity class; Function (biology); Computation; Time complexity; Mathematics; Algorithm; Ciphertext","score_opus":0.007846166356152841,"score_gpt":0.23193023580274644,"score_spread":0.2240840694465936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951443613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081190895,0.0021873969,0.9704129,0.0024042455,0.00036310553,0.0003187969,0.00082015543,0.0016606128,0.013713651],"genre_scores_gemma":[0.34755757,0.004669272,0.6225622,0.0023758244,0.0009561423,0.0021605026,0.002845934,0.0010734323,0.015799114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895857,0.003792044,0.0008945951,0.0017846794,0.0031650825,0.00077794923],"domain_scores_gemma":[0.97163785,0.018027347,0.0017862436,0.0070587974,0.001069478,0.00042037302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059903073,0.0016680674,0.0013568037,0.0017213975,0.0014383388,0.004554838,0.0028296732,0.0028940206,0.008147755],"category_scores_gemma":[0.03166199,0.0013347262,0.0024625864,0.002891358,0.00516272,0.013791692,0.005570263,0.009010149,0.0022382236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001572502,0.000070098096,0.0002222923,0.00021628046,0.00002700997,0.000108992914,0.0001773508,0.0203146,0.0015964406,0.94948083,0.0025411614,0.025087744],"study_design_scores_gemma":[0.00006379966,0.000057704736,0.000065691245,0.00013765675,0.00003062055,0.00018277507,0.00004147447,0.07443985,0.0039622183,0.9088619,0.012114667,0.000041585292],"about_ca_topic_score_codex":0.0010621474,"about_ca_topic_score_gemma":0.00087436684,"teacher_disagreement_score":0.008147755,"about_ca_system_score_codex":0.0042922897,"about_ca_system_score_gemma":0.0028297822,"threshold_uncertainty_score":0.031680167},"labels":[],"label_agreement":null},{"id":"W2951478224","doi":"","title":"Attribute-Based Encryption for Circuits.","year":2013,"lang":"en","type":"preprint","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Ciphertext; Encryption; Computer science; Attribute-based encryption; Theoretical computer science; Public-key cryptography; Ciphertext indistinguishability; Key (lock); Malleability; Mathematics; Discrete mathematics; Computer security","score_opus":0.02602160993020867,"score_gpt":0.26127834956645607,"score_spread":0.2352567396362474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951478224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012686612,0.0024530662,0.95237625,0.003171585,0.00027091758,0.00020605978,0.00082614436,0.0006235352,0.027385809],"genre_scores_gemma":[0.534548,0.003921289,0.43162313,0.0018834373,0.00058536936,0.0007773351,0.0013734441,0.00019671819,0.025091188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975103,0.00065711973,0.00017678515,0.00036225285,0.0010433433,0.00025010356],"domain_scores_gemma":[0.9970452,0.0013428254,0.00021824017,0.0010789159,0.00022798331,0.00008687727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017522415,0.00068756705,0.00075948675,0.0008377275,0.0011565803,0.0032255077,0.0015551435,0.001326199,0.006371614],"category_scores_gemma":[0.006169784,0.00038373677,0.0012620197,0.001892079,0.0022312955,0.008892099,0.0028878986,0.0048359274,0.0017155267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030957635,0.000016029178,0.00006898283,0.00006939391,0.000007097693,0.00003164985,0.00007522308,0.0023926373,0.0009583769,0.9823224,0.0020942332,0.011933076],"study_design_scores_gemma":[0.000026502976,0.00003633627,0.000106568295,0.00004495484,0.000015391248,0.00020663907,0.000027018586,0.028180456,0.0024579999,0.9425884,0.026293062,0.000016764323],"about_ca_topic_score_codex":0.00067237235,"about_ca_topic_score_gemma":0.00074014335,"teacher_disagreement_score":0.006371614,"about_ca_system_score_codex":0.0031064688,"about_ca_system_score_gemma":0.0011469857,"threshold_uncertainty_score":0.022539139},"labels":[],"label_agreement":null},{"id":"W2951495502","doi":"","title":"Finding shortest lattice vectors faster using quantum search","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Lattice problem; Quantum; Quantum algorithm; Computer science; Heuristic; Lattice (music); Mathematics; Discrete mathematics; Algorithm; Mathematical optimization; Cryptography; Physics; Quantum mechanics","score_opus":0.05176874913598306,"score_gpt":0.31067210604021656,"score_spread":0.2589033569042335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951495502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1645717,0.0010046836,0.7988437,0.0025290982,0.00030132805,0.00021790246,0.00023028743,0.0017143607,0.030586934],"genre_scores_gemma":[0.65223426,0.00040859837,0.34003383,0.00047139238,0.00012268769,0.000173649,0.00030488762,0.00039071773,0.005859995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997962,0.00070295745,0.000108540866,0.00031470633,0.00071409857,0.00019768221],"domain_scores_gemma":[0.9960705,0.002546654,0.00023059535,0.0007326405,0.00027046498,0.00014910691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015554196,0.00044954036,0.0010813047,0.001129081,0.000826779,0.0020259751,0.0013106201,0.0011034113,0.01120787],"category_scores_gemma":[0.008073104,0.00041582246,0.000872617,0.0013752445,0.0019605078,0.0043801693,0.0019453983,0.0025139218,0.001489767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006263298,0.00035350295,0.0011972465,0.000429672,0.000101985715,0.000097209704,0.00024031334,0.17620668,0.014457286,0.66378444,0.009221592,0.13328378],"study_design_scores_gemma":[0.00014758973,0.00010398494,0.00014890623,0.000037777358,0.000012677131,0.000061753155,0.00007212621,0.54946095,0.0052236775,0.44010794,0.0045972834,0.00002538902],"about_ca_topic_score_codex":0.0011424691,"about_ca_topic_score_gemma":0.0017078919,"teacher_disagreement_score":0.01120787,"about_ca_system_score_codex":0.0014417699,"about_ca_system_score_gemma":0.0018003869,"threshold_uncertainty_score":0.037494063},"labels":[],"label_agreement":null},{"id":"W2951710497","doi":"","title":"Short One-Time Signatures.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Signature (topology); Scheme (mathematics); Elliptic Curve Digital Signature Algorithm; Modular design; Digital signature; Mathematical proof; Merkle signature scheme; Digital Signature Algorithm; Distributed computing; Embedded system; Theoretical computer science; Algorithm; Public-key cryptography; Blind signature; Computer network; Computer security; Elliptic curve cryptography; Mathematics; Programming language; Encryption","score_opus":0.015127431682303561,"score_gpt":0.2540988927991087,"score_spread":0.23897146111680512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951710497","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032998554,0.0013099741,0.9471263,0.0007723973,0.0010307232,0.0002754031,0.00048365496,0.0018038179,0.014199063],"genre_scores_gemma":[0.48504186,0.001134612,0.47946146,0.0006376401,0.0009874984,0.00039433298,0.001206767,0.0002842169,0.03085173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965366,0.0006927124,0.0003575583,0.0005534572,0.0015071026,0.0003525674],"domain_scores_gemma":[0.990167,0.0016170298,0.0012974836,0.0047366563,0.0013790687,0.0008028038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022457405,0.00069097563,0.0007996399,0.0009797352,0.000936157,0.0025375867,0.0017700832,0.00155527,0.00743266],"category_scores_gemma":[0.00556734,0.00040424537,0.00086667394,0.0017218704,0.0017751246,0.008785226,0.003180327,0.002484177,0.0032817943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013314182,0.00018978705,0.00088186824,0.0005351671,0.000080556485,0.00035460776,0.00038110025,0.00814469,0.07636625,0.6860719,0.008684007,0.2169786],"study_design_scores_gemma":[0.00028726013,0.0014448799,0.0007930675,0.00014810891,0.00015919589,0.0030881641,0.00016743358,0.09624333,0.16678463,0.40613523,0.32450214,0.00024660738],"about_ca_topic_score_codex":0.00021102607,"about_ca_topic_score_gemma":0.00021806297,"teacher_disagreement_score":0.00743266,"about_ca_system_score_codex":0.0009920615,"about_ca_system_score_gemma":0.0013728341,"threshold_uncertainty_score":0.024864733},"labels":[],"label_agreement":null},{"id":"W2951833204","doi":"10.48550/arxiv.1305.7360","title":"Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Parallelism (grammar); Computer science; Parallel computing; Task parallelism; Automated theorem proving; Data parallelism; Theoretical computer science; Distributed computing","score_opus":0.039841457104653574,"score_gpt":0.17683713658797992,"score_spread":0.13699567948332636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951833204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03014149,0.0004114743,0.96109056,0.000812481,0.000047201363,0.00019368438,0.00010008428,0.0040071737,0.0031957803],"genre_scores_gemma":[0.67862505,0.000556271,0.31443003,0.0003051272,0.00015348892,0.0004099718,0.00033871047,0.0009733232,0.0042079897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98231137,0.0062482273,0.0011356344,0.002827001,0.0057296343,0.0017481414],"domain_scores_gemma":[0.95302826,0.025985802,0.0023694292,0.014740096,0.002355174,0.0015213327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010337545,0.001073584,0.0013431701,0.0013266185,0.0022261846,0.005580129,0.00544471,0.0019096824,0.004422556],"category_scores_gemma":[0.03582182,0.002338868,0.0019960268,0.0014145196,0.006881372,0.013148369,0.013793626,0.0055571697,0.0012654709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010576895,0.0003976473,0.006038497,0.0010286559,0.000433032,0.0018024787,0.0052819033,0.232124,0.021145558,0.5955804,0.0049601053,0.13015005],"study_design_scores_gemma":[0.00012367411,0.000082624145,0.00042696044,0.00006757466,0.00010288539,0.0002552918,0.00017563594,0.35463518,0.009135278,0.62557065,0.009370449,0.000053762353],"about_ca_topic_score_codex":0.0031580594,"about_ca_topic_score_gemma":0.0044088573,"teacher_disagreement_score":0.010337545,"about_ca_system_score_codex":0.002366348,"about_ca_system_score_gemma":0.0036518567,"threshold_uncertainty_score":0.05467081},"labels":[],"label_agreement":null},{"id":"W2951843693","doi":"","title":"Pairing-Based Onion Routing with Improved Forward Secrecy.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Anonymity; Routing (electronic design automation); Secrecy; Directory; Computer network; Identity (music); Node (physics); Key (lock); Scheme (mathematics); Computer security; Static routing; Multipath routing; Forward secrecy; Routing protocol; Public-key cryptography; Mathematics; Encryption; Engineering","score_opus":0.013220778612189723,"score_gpt":0.23395324253124478,"score_spread":0.22073246391905504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951843693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023004316,0.00079879386,0.92391443,0.0011013797,0.0007826217,0.00026308975,0.00023368378,0.00076640595,0.04913521],"genre_scores_gemma":[0.717905,0.0013881391,0.23897272,0.00089364295,0.00055391964,0.0004610526,0.0006490562,0.00027781428,0.03889864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970999,0.0010431149,0.00017129678,0.00038158652,0.0009494283,0.0003546846],"domain_scores_gemma":[0.9975521,0.00064131164,0.0002561958,0.0011885858,0.0002370242,0.00012481332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019067725,0.0006704358,0.0006580744,0.00077860814,0.0015255518,0.0019726802,0.0013878247,0.0011702552,0.0056837616],"category_scores_gemma":[0.0033264188,0.00031244778,0.0009163612,0.0009622992,0.0019408698,0.0065172077,0.0059918524,0.0027592832,0.0018903707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031789782,0.000085345644,0.00040408788,0.00021706239,0.00006214821,0.00029960295,0.00047051837,0.015000055,0.010708535,0.90827805,0.005407328,0.058749497],"study_design_scores_gemma":[0.00014628231,0.00042438277,0.00040888248,0.00013431675,0.0001347995,0.0012768361,0.00024391888,0.10424889,0.046205405,0.6741529,0.17249896,0.00012433018],"about_ca_topic_score_codex":0.000272809,"about_ca_topic_score_gemma":0.00028193594,"teacher_disagreement_score":0.0056837616,"about_ca_system_score_codex":0.001005731,"about_ca_system_score_gemma":0.00092888036,"threshold_uncertainty_score":0.01901406},"labels":[],"label_agreement":null},{"id":"W2951928662","doi":"10.48550/arxiv.1509.02944","title":"Making Existential-Unforgeable Signatures Strongly Unforgeable in the\\n Quantum Random-Oracle Model","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Oracle; Computer science; Quantum; Theoretical computer science; Programming language; Physics; Computer security; Quantum mechanics; Encryption; Public-key cryptography","score_opus":0.1361977957367334,"score_gpt":0.2312860374559138,"score_spread":0.0950882417191804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951928662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08301084,0.00017778607,0.89705634,0.0024787586,0.00013880026,0.00013485274,0.00024247558,0.0016183432,0.01514178],"genre_scores_gemma":[0.83396196,0.00043994503,0.1490028,0.0006872919,0.00020249093,0.00024480408,0.00041200427,0.00037273736,0.0146760065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965353,0.0008333675,0.00018927475,0.00069295196,0.0011117418,0.0006374875],"domain_scores_gemma":[0.9962269,0.0014002573,0.0003042865,0.0017178004,0.0001846422,0.0001660898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020665072,0.00063107384,0.00076367246,0.0006478232,0.00095948315,0.0027906678,0.001799884,0.0019204736,0.0034613046],"category_scores_gemma":[0.0054084826,0.0004918925,0.0015969003,0.0009958773,0.0058603887,0.009330341,0.0038240678,0.005073404,0.0010077313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084457206,0.000048258393,0.00013228203,0.000032728767,0.00001311442,0.000116900585,0.00020739995,0.012681274,0.0031427937,0.9751106,0.00076267007,0.007667578],"study_design_scores_gemma":[0.000050532002,0.000043881573,0.00014138571,0.0000143142315,0.00002705805,0.000111873145,0.000036739086,0.09190374,0.010924244,0.8906413,0.0060657286,0.00003920284],"about_ca_topic_score_codex":0.00088343385,"about_ca_topic_score_gemma":0.0005968545,"teacher_disagreement_score":0.0034613046,"about_ca_system_score_codex":0.0015777549,"about_ca_system_score_gemma":0.0015863238,"threshold_uncertainty_score":0.0115792155},"labels":[],"label_agreement":null},{"id":"W2951945251","doi":"10.1016/j.ins.2019.06.028","title":"Functional broadcast encryption with applications to data sharing for cloud storage","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud storage; Computer network; Data sharing; Cloud computing; Computer security; Distributed computing; Operating system","score_opus":0.06645863801017185,"score_gpt":0.30029264660059096,"score_spread":0.2338340085904191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951945251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028582538,0.0012216633,0.95018893,0.0010198014,0.00034791048,0.0000984663,0.00010208669,0.0009967949,0.017441886],"genre_scores_gemma":[0.6716171,0.00153928,0.2931496,0.0003419947,0.00042904727,0.00012323415,0.0002140042,0.00028472205,0.03230105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.00010133621,0.000023514942,0.000041594725,0.00014763215,0.00005711813],"domain_scores_gemma":[0.9992005,0.00023298422,0.000042772022,0.00026692342,0.000221532,0.000035273548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028175,0.00048940466,0.00044673143,0.00046873806,0.0007149551,0.0012307749,0.0006733882,0.0008638436,0.004379319],"category_scores_gemma":[0.001776033,0.0001867715,0.00046786334,0.0007977655,0.0008741961,0.00137401,0.0009045463,0.0012391018,0.0012764734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005353144,0.00018987007,0.0007403659,0.00027753,0.00004346444,0.00044848153,0.0004109113,0.0450797,0.043180417,0.6901605,0.0130533585,0.20588002],"study_design_scores_gemma":[0.00006892904,0.00024159926,0.0005240618,0.00009001726,0.00007525808,0.0010907354,0.00016739193,0.54253596,0.050606787,0.3545651,0.049984664,0.000049495688],"about_ca_topic_score_codex":0.00077756896,"about_ca_topic_score_gemma":0.0010847822,"teacher_disagreement_score":0.004379319,"about_ca_system_score_codex":0.0006876467,"about_ca_system_score_gemma":0.0006712749,"threshold_uncertainty_score":0.014650345},"labels":[],"label_agreement":null},{"id":"W2952003592","doi":"10.48550/arxiv.1404.6898","title":"Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; European Regional Development Fund; Latvijas Universitate; European Commission; National Science Foundation","keywords":"Mathematical proof; Quantum; Computer science; Random oracle; Oracle; Theoretical computer science; Adversary; Discrete mathematics; Mathematics; Computer security; Quantum mechanics; Physics; Encryption; Public-key cryptography; Programming language","score_opus":0.08635545933498931,"score_gpt":0.20955552885845774,"score_spread":0.12320006952346843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952003592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1544196,0.0028256297,0.7664095,0.019330451,0.00036789052,0.00036356528,0.0005033097,0.0015481445,0.05423186],"genre_scores_gemma":[0.93627936,0.0015410085,0.052997187,0.001016509,0.00046182555,0.00029969533,0.00018018534,0.00034825777,0.0068760533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9836769,0.005665148,0.0009827751,0.0023040054,0.0055259103,0.0018452657],"domain_scores_gemma":[0.9029755,0.067229465,0.0034981833,0.022684565,0.0022904712,0.0013218736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01263062,0.0010139568,0.002333095,0.002272614,0.005420145,0.008384492,0.0036546479,0.0054465514,0.007761814],"category_scores_gemma":[0.05201967,0.0022450662,0.0031683892,0.0017580865,0.019406281,0.031106507,0.011727577,0.014350283,0.001544535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009570374,0.000026394815,0.00019588052,0.000073874886,0.000028123595,0.00008606952,0.00040182433,0.008081599,0.00085936446,0.9827088,0.0010146397,0.0064277216],"study_design_scores_gemma":[0.000030770647,0.000013705481,0.000055097513,0.000030749467,0.000012799169,0.000049066097,0.000044868822,0.020772057,0.0012485257,0.97621775,0.0015037777,0.000020728317],"about_ca_topic_score_codex":0.0015873022,"about_ca_topic_score_gemma":0.00066181284,"teacher_disagreement_score":0.01263062,"about_ca_system_score_codex":0.0046019997,"about_ca_system_score_gemma":0.003493086,"threshold_uncertainty_score":0.06679791},"labels":[],"label_agreement":null},{"id":"W2952499149","doi":"10.48550/arxiv.1310.3486","title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Asynchronous communication; Computation; Computer science; Latency (audio); Secure multi-party computation; Communication complexity; Binary logarithm; Theoretical computer science; Function (biology); Distributed computing; Algorithm; Computer network; Mathematics; Discrete mathematics","score_opus":0.03998496174303398,"score_gpt":0.18580017958423548,"score_spread":0.1458152178412015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952499149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903458,0.00015506262,0.9843024,0.00042088446,0.00010386086,0.00013109764,0.000096521435,0.0010463408,0.0038403189],"genre_scores_gemma":[0.47609058,0.00022154552,0.5133579,0.0005048593,0.0001540744,0.00046337227,0.0002763365,0.00024094728,0.008690352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973598,0.00079636084,0.0001587888,0.00044248468,0.000908532,0.00033406742],"domain_scores_gemma":[0.9977089,0.001127628,0.00014436942,0.00065240514,0.00021182878,0.0001547988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026717058,0.00063475914,0.0011090846,0.00057635264,0.0010668768,0.0018161909,0.002573355,0.0017310493,0.005431112],"category_scores_gemma":[0.0053872727,0.00039711143,0.0007084703,0.0011741661,0.0012190517,0.0033364093,0.0045165196,0.0020025526,0.001626844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010686446,0.00038940524,0.00085177226,0.0003405372,0.000097641125,0.00040829697,0.0005299718,0.18646818,0.026724672,0.5442017,0.016586198,0.22233306],"study_design_scores_gemma":[0.00014139712,0.000093139686,0.000072636125,0.000013949153,0.00001394358,0.00008864402,0.000032931148,0.83210653,0.006257691,0.15453072,0.0066292486,0.0000192293],"about_ca_topic_score_codex":0.0005143937,"about_ca_topic_score_gemma":0.00089706713,"teacher_disagreement_score":0.005431112,"about_ca_system_score_codex":0.0008120764,"about_ca_system_score_gemma":0.001100981,"threshold_uncertainty_score":0.018168867},"labels":[],"label_agreement":null},{"id":"W2952698068","doi":"10.1109/icde.2019.00066","title":"Joins Over Encrypted Data with Fine Granular Security","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Encryption; Computer science; Column (typography); Row; Construct (python library); Database; Data mining; Computer security; Computer network; Programming language","score_opus":0.012833027317995615,"score_gpt":0.23357715102686433,"score_spread":0.2207441237088687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952698068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16378196,0.00046339218,0.8261613,0.000722519,0.00012347967,0.000301148,0.0004858875,0.0029923173,0.004967963],"genre_scores_gemma":[0.7766207,0.00025555174,0.21947904,0.00022126413,0.00012730934,0.000156123,0.00050954346,0.00026656632,0.0023639598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99127966,0.001048546,0.0014710467,0.0009412638,0.004456931,0.000802572],"domain_scores_gemma":[0.9803854,0.0039139437,0.0017526905,0.0123640075,0.0011783493,0.0004056001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004659973,0.00049803144,0.0010438652,0.0010586153,0.0012305962,0.0047351597,0.0012969039,0.0009566858,0.0015708542],"category_scores_gemma":[0.010032676,0.00084360404,0.0009829117,0.0015386121,0.0026497797,0.011025175,0.0066529736,0.0021838674,0.00095036323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003380108,0.0008095419,0.017321512,0.00065105426,0.00031996222,0.0014773902,0.0025112028,0.124125876,0.19620071,0.38314727,0.0072596697,0.2627957],"study_design_scores_gemma":[0.00025077368,0.00062005024,0.003226484,0.00013225322,0.00015245366,0.0017673008,0.0007113536,0.42894843,0.17097677,0.35968402,0.033353046,0.0001771635],"about_ca_topic_score_codex":0.0006897989,"about_ca_topic_score_gemma":0.0007585905,"teacher_disagreement_score":0.0047351597,"about_ca_system_score_codex":0.0010912337,"about_ca_system_score_gemma":0.0014462529,"threshold_uncertainty_score":0.024644554},"labels":[],"label_agreement":null},{"id":"W2952986985","doi":"10.48550/arxiv.1308.4218","title":"Private Outsourcing of Polynomial Evaluation and Matrix Multiplication using Multilinear Maps","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Outsourcing; Computer science; Matrix multiplication; Multiplication (music); Computation; Function (biology); Polynomial; Construct (python library); Theoretical computer science; Matrix (chemical analysis); Algorithm; Computer network; Mathematics","score_opus":0.08226381328476551,"score_gpt":0.237712091717057,"score_spread":0.1554482784322915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952986985","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113291785,0.00036398697,0.8682193,0.0013244608,0.000098046425,0.00021388079,0.00032941552,0.0010589898,0.015100134],"genre_scores_gemma":[0.9153249,0.0002513467,0.076100394,0.0001781275,0.00007457316,0.00016611148,0.00017986663,0.000111764726,0.007612907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958592,0.0015169644,0.00022095403,0.0005309129,0.0011332823,0.00073874724],"domain_scores_gemma":[0.99474466,0.0015032626,0.0004465216,0.0028177358,0.0002970965,0.00019089361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002508442,0.00063771283,0.0010085832,0.0005020332,0.0013040531,0.002813089,0.0014849867,0.0010227549,0.0041958992],"category_scores_gemma":[0.008481377,0.00048965943,0.00089113566,0.0015816025,0.002839075,0.006486081,0.00771209,0.0026451743,0.0010853151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000537028,0.00012368211,0.00067452615,0.00016276137,0.000045803296,0.00022395939,0.00047385914,0.0621683,0.0053280336,0.86307496,0.003317355,0.06386965],"study_design_scores_gemma":[0.00011223223,0.00015686134,0.00031686833,0.000037287802,0.000031961907,0.00025273187,0.000096663716,0.34293136,0.023695853,0.6220615,0.010251795,0.000054971322],"about_ca_topic_score_codex":0.0009426101,"about_ca_topic_score_gemma":0.0005468456,"teacher_disagreement_score":0.0041958992,"about_ca_system_score_codex":0.0025852432,"about_ca_system_score_gemma":0.0023214866,"threshold_uncertainty_score":0.018757343},"labels":[],"label_agreement":null},{"id":"W2953055425","doi":"","title":"Location-Proof System based on Secure Multi-Party Computations.","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Gas meter prover; Mathematical proof; Computer science; Honesty; Adversary; Computation; Computer security; Protocol (science); Theoretical computer science; Signature (topology); Secure two-party computation; Automated theorem proving; Cryptography; Secure multi-party computation; Algorithm; Mathematics; Law","score_opus":0.022242529229172067,"score_gpt":0.2744471361385328,"score_spread":0.2522046069093607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953055425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005755754,0.0004447704,0.97998,0.0004503202,0.00026268273,0.0005075327,0.0003284552,0.004231599,0.008038869],"genre_scores_gemma":[0.37068236,0.00073925697,0.5999426,0.0005192226,0.0003782233,0.0011913867,0.0013030132,0.00048759283,0.024756413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940158,0.0013190885,0.0005572225,0.0012564715,0.002229781,0.0006217123],"domain_scores_gemma":[0.9936511,0.0017135477,0.00045862028,0.0031170063,0.0006722756,0.00038755272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027514386,0.000939545,0.0019739133,0.0015440639,0.0032264367,0.004338687,0.004065631,0.0024708984,0.016133068],"category_scores_gemma":[0.0075196614,0.0008448279,0.0017361391,0.0017635982,0.0020855663,0.008119969,0.010869601,0.0030123347,0.008819821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012412703,0.00041856355,0.0010438499,0.00090030336,0.00032504584,0.0011405832,0.00067810045,0.021935053,0.031458966,0.7448135,0.021272082,0.17477266],"study_design_scores_gemma":[0.0007429572,0.00059392094,0.0006612629,0.00018645097,0.00031789995,0.0017680547,0.00015058405,0.40068135,0.065745324,0.36538482,0.16352439,0.00024298574],"about_ca_topic_score_codex":0.0008022858,"about_ca_topic_score_gemma":0.00081603485,"teacher_disagreement_score":0.016133068,"about_ca_system_score_codex":0.0019795273,"about_ca_system_score_gemma":0.0044161426,"threshold_uncertainty_score":0.053970516},"labels":[],"label_agreement":null},{"id":"W2953273138","doi":"","title":"Construction of a Hybrid (Hierarchical) Identity-Based Encryption Protocol Secure Against Adaptive Attacks.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Probabilistic encryption; Multiple encryption; Protocol (science); Attribute-based encryption; Ciphertext; Computer security; Authentication protocol; Public-key cryptography; Bilinear interpolation; Theoretical computer science; Deterministic encryption; Key (lock)","score_opus":0.01562312116514008,"score_gpt":0.2779227232041006,"score_spread":0.2622996020389605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953273138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06111512,0.00019597863,0.9260309,0.00040829525,0.000092572605,0.00039501447,0.0002583491,0.0009200295,0.010583825],"genre_scores_gemma":[0.5818618,0.00013937944,0.40667513,0.00020267,0.0000261357,0.00038361072,0.0005590487,0.00007611288,0.010076106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892443,0.00022120295,0.00009754157,0.00020110469,0.00041635818,0.00013937106],"domain_scores_gemma":[0.99878925,0.00021900315,0.00015755517,0.0005704951,0.00016002197,0.000103754275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009789645,0.0003088718,0.00046046567,0.00046106384,0.0006684793,0.00088128116,0.0011207744,0.0007397312,0.0032746585],"category_scores_gemma":[0.0013476895,0.00033242264,0.0005745058,0.0005082408,0.0011361283,0.002299957,0.003492087,0.0012838017,0.0011159222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033474131,0.00022918543,0.001457013,0.0004366339,0.00012421158,0.00087305007,0.00069367915,0.024403984,0.12636362,0.76737803,0.005419263,0.07228656],"study_design_scores_gemma":[0.0002609165,0.0005326493,0.0021266534,0.00009772759,0.00018762346,0.001823941,0.00033781727,0.5078951,0.13759454,0.28578717,0.06321181,0.00014401747],"about_ca_topic_score_codex":0.000315479,"about_ca_topic_score_gemma":0.0003703864,"teacher_disagreement_score":0.0032746585,"about_ca_system_score_codex":0.0006665835,"about_ca_system_score_gemma":0.00089849514,"threshold_uncertainty_score":0.010954797},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015301872275892718,"score_gpt":0.2526773690943855,"score_spread":0.23737549681849276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953289753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28893563,0.0019779697,0.6603856,0.00048235577,0.0002569727,0.000316698,0.00045965784,0.004979278,0.042205833],"genre_scores_gemma":[0.675435,0.00047711827,0.31596518,0.000122442,0.00005611275,0.00012734065,0.0003949579,0.000113611255,0.007308192],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999803,0.00003419495,0.0000121290295,0.000024298082,0.000087631524,0.000038711678],"domain_scores_gemma":[0.9998405,0.000035836627,0.000028781067,0.000040645293,0.00003912997,0.000015188819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014661459,0.00046013834,0.000361183,0.0003761336,0.0003127237,0.00064585573,0.0005922249,0.00024261422,0.004755035],"category_scores_gemma":[0.0003270105,0.00015468428,0.00023948538,0.00052903907,0.00022076628,0.000727903,0.00031235366,0.0004081828,0.0014504403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012881758,0.00023615173,0.0016602012,0.0006719924,0.000103816026,0.00059591944,0.0001356543,0.075590126,0.43539882,0.06505444,0.015608923,0.40365574],"study_design_scores_gemma":[0.00041565998,0.0024437185,0.0023503017,0.00011246782,0.00012750375,0.0019741138,0.00011845787,0.4794904,0.4053343,0.01207799,0.09543236,0.00012276976],"about_ca_topic_score_codex":0.0006748748,"about_ca_topic_score_gemma":0.0016353755,"teacher_disagreement_score":0.004755035,"about_ca_system_score_codex":0.00059959583,"about_ca_system_score_gemma":0.0008221955,"threshold_uncertainty_score":0.015907228},"labels":[],"label_agreement":null},{"id":"W2955105335","doi":"10.1007/978-3-030-44223-1_27","title":"A Note on the Instantiability of the Quantum Random Oracle","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Computer science; Standard Model (mathematical formulation); Hash function; Oracle; Mathematical proof; Provable security; Quantum; Theoretical computer science; Cryptography; Computer security; Encryption; Mathematics; Public-key cryptography; Quantum mechanics; Programming language; Physics","score_opus":0.01809138364689299,"score_gpt":0.23870501825698553,"score_spread":0.22061363461009253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955105335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013257802,0.01669742,0.52348816,0.017937412,0.0048672566,0.00011455543,0.00045330328,0.00046149112,0.42272267],"genre_scores_gemma":[0.6690856,0.02277515,0.20156084,0.0077372505,0.011880958,0.0005043031,0.00082282204,0.0010924548,0.08454062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951521,0.0019948282,0.00030219427,0.0009996721,0.001170767,0.00038039518],"domain_scores_gemma":[0.9896618,0.0074861194,0.00019860934,0.0021641848,0.00030767435,0.00018168445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005092304,0.0011908256,0.0020879614,0.0014824958,0.002398567,0.0053110765,0.0025185116,0.0028610076,0.010730838],"category_scores_gemma":[0.014499887,0.0012651839,0.0031354318,0.0021675972,0.014055589,0.018466469,0.006924974,0.013482088,0.0022552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006686697,0.0000029029611,0.000016916996,0.000013821728,0.000002809517,0.000019527059,0.000028459997,0.00017969494,0.00006726156,0.9967452,0.00086834526,0.0020483648],"study_design_scores_gemma":[0.0000038630324,0.000004625217,0.000026451502,0.000011123289,0.000003529286,0.000031912077,0.000005639783,0.0007670847,0.00011530305,0.99331796,0.005707044,0.000005556335],"about_ca_topic_score_codex":0.0014850624,"about_ca_topic_score_gemma":0.00069545646,"teacher_disagreement_score":0.010730838,"about_ca_system_score_codex":0.0022573918,"about_ca_system_score_gemma":0.0011440652,"threshold_uncertainty_score":0.03589821},"labels":[],"label_agreement":null},{"id":"W2955869759","doi":"10.1109/tsc.2019.2924372","title":"Achieve Efficient and Verifiable Conjunctive and Fuzzy Queries over Encrypted Data in Cloud","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Verifiable secret sharing; Fuzzy logic; Conjunctive query; Data mining; Computer security; Database; Information retrieval; Computer network; Artificial intelligence; Relational database; Set (abstract data type); Operating system","score_opus":0.010499051071177934,"score_gpt":0.23716911042889752,"score_spread":0.22667005935771958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955869759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12799057,0.0010572849,0.86343396,0.00069439586,0.000084752035,0.00036353272,0.00049741706,0.0010898724,0.0047881454],"genre_scores_gemma":[0.9109611,0.00046617474,0.08623835,0.00020418465,0.000049026145,0.00010289427,0.00025490267,0.000032690637,0.0016907479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695265,0.00042133968,0.00034259362,0.0004676878,0.0012335212,0.00058217056],"domain_scores_gemma":[0.9966613,0.0013179391,0.00043993795,0.0009333555,0.0005364463,0.00011101182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018321797,0.0005028975,0.0011748748,0.0006227517,0.0009874419,0.0019271757,0.0016915237,0.0010837333,0.0014798541],"category_scores_gemma":[0.0049748146,0.000293325,0.0008499285,0.0012435231,0.0011904683,0.004959854,0.0023928757,0.00124699,0.00042930627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036447423,0.0005645348,0.005255842,0.0009938414,0.00033344343,0.0026169554,0.0019165182,0.1546018,0.20232008,0.25785112,0.009512935,0.36038816],"study_design_scores_gemma":[0.00016885075,0.00023527065,0.00085519184,0.000045350534,0.000086404514,0.0009473761,0.00036317398,0.8549666,0.09195418,0.045912124,0.004382012,0.00008342552],"about_ca_topic_score_codex":0.0027399946,"about_ca_topic_score_gemma":0.0020610502,"teacher_disagreement_score":0.0027399946,"about_ca_system_score_codex":0.0013597116,"about_ca_system_score_gemma":0.0018688659,"threshold_uncertainty_score":0.009865463},"labels":[],"label_agreement":null},{"id":"W2958006931","doi":"10.1109/icc.2019.8761762","title":"Online Advertising with Verifiable Fairness","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Computer science; Upload; Collusion; Online advertising; Transparency (behavior); Verifiable secret sharing; Scheme (mathematics); Computer security; Advertising; Argument (complex analysis); Internet privacy; Business; The Internet; World Wide Web","score_opus":0.005647338406847486,"score_gpt":0.20693100085509183,"score_spread":0.20128366244824436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958006931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09106861,0.0011613953,0.87856185,0.0018109806,0.00034195636,0.00067460607,0.0005247495,0.0018107716,0.024045082],"genre_scores_gemma":[0.94422424,0.00026730914,0.049225662,0.000247693,0.00017213194,0.00017033922,0.00017130266,0.00008234003,0.00543899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891862,0.002980136,0.00066512823,0.0017488927,0.0034672837,0.0019523673],"domain_scores_gemma":[0.97752565,0.010209405,0.0023606042,0.0074846447,0.0018581327,0.00056154665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066321036,0.0008492048,0.001425579,0.0012793258,0.0023726071,0.003943041,0.00279517,0.0022364927,0.0042242925],"category_scores_gemma":[0.019201072,0.0005559158,0.0010876547,0.0017449661,0.0033577734,0.008965121,0.0043079923,0.003459627,0.0009985875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022275078,0.00061746244,0.002929037,0.00048811283,0.00015660888,0.00074856635,0.00083926326,0.11493442,0.024798568,0.7122142,0.006963609,0.13308269],"study_design_scores_gemma":[0.0004712093,0.00027637265,0.0006905832,0.000079903344,0.00015081494,0.00070980366,0.00011829114,0.59910065,0.029483404,0.35767543,0.011091456,0.00015207783],"about_ca_topic_score_codex":0.0017557725,"about_ca_topic_score_gemma":0.001092954,"teacher_disagreement_score":0.0066321036,"about_ca_system_score_codex":0.0033696922,"about_ca_system_score_gemma":0.005199431,"threshold_uncertainty_score":0.035074353},"labels":[],"label_agreement":null},{"id":"W2959468741","doi":"10.1109/icc.2019.8761769","title":"Towards Private and Efficient Ad Impression Aggregation in Mobile Advertising","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Computer science; Ballot; Homomorphic encryption; Cryptography; Computer security; Encryption; Impression; Voting; Overhead (engineering); Cryptosystem; Mobile device; Hamming distance; Electronic voting; Computer network; World Wide Web; Algorithm; Operating system","score_opus":0.0055337132290720365,"score_gpt":0.23385653309932522,"score_spread":0.22832281987025319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2959468741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09386647,0.0007984569,0.8980381,0.00048904936,0.000107531916,0.00029892576,0.00014175248,0.00089714717,0.0053626313],"genre_scores_gemma":[0.8873168,0.00026035082,0.10844005,0.00011043275,0.000108321794,0.00008845395,0.00014159456,0.000036653368,0.0034973556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949885,0.0016928123,0.00033454245,0.00055202027,0.0017958663,0.0006362786],"domain_scores_gemma":[0.99496835,0.0009964438,0.00069627474,0.0025030163,0.0006320456,0.00020393665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027224375,0.00067658396,0.0010768679,0.0010609698,0.0010655249,0.002326723,0.0015681455,0.0009692753,0.0013432271],"category_scores_gemma":[0.004954636,0.00046846695,0.0007371883,0.0013525106,0.0011827433,0.0040969066,0.0041087233,0.0016022559,0.0007911665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002606942,0.0006306364,0.0038781697,0.00042776315,0.0002098791,0.00084533705,0.0015312844,0.052273087,0.15260875,0.27127895,0.0061618257,0.5075473],"study_design_scores_gemma":[0.0002561439,0.0006618905,0.002091468,0.000062445055,0.00015947848,0.0011542508,0.0004386615,0.74725556,0.11178262,0.11795621,0.018034533,0.00014673252],"about_ca_topic_score_codex":0.0006405541,"about_ca_topic_score_gemma":0.00050940114,"teacher_disagreement_score":0.0027224375,"about_ca_system_score_codex":0.0010166807,"about_ca_system_score_gemma":0.0009967573,"threshold_uncertainty_score":0.0143978},"labels":[],"label_agreement":null},{"id":"W2962149853","doi":"10.1109/icc.2019.8761643","title":"Achieving Efficient and Privacy-Preserving Top-k Query Over Vertically Distributed Data Sources","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Information privacy; Distributed database; Query optimization; Information retrieval; Distributed computing; Computer security","score_opus":0.015189164076449296,"score_gpt":0.24753969381768642,"score_spread":0.23235052974123713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962149853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044960894,0.00047870888,0.9504575,0.0005053368,0.000048294794,0.00021617943,0.0005012694,0.0007172629,0.0021145793],"genre_scores_gemma":[0.76688033,0.00051133026,0.229149,0.00028949432,0.00009996109,0.0001723211,0.00091053086,0.00006256515,0.0019245197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475586,0.0009106571,0.00056652236,0.0008789784,0.002173342,0.0007147127],"domain_scores_gemma":[0.99540085,0.0010300428,0.00053679687,0.0021097495,0.00076669484,0.00015585059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023346439,0.0006012196,0.0016031219,0.00095571455,0.0016674624,0.0023772188,0.0015957686,0.0013709468,0.0012773193],"category_scores_gemma":[0.0050730645,0.0003845596,0.0012066569,0.002784863,0.0010319006,0.005895597,0.004917741,0.0012791606,0.0006874543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002082075,0.00055056706,0.011743884,0.0012002368,0.00059710816,0.002462302,0.0025019378,0.12298818,0.26419818,0.17637466,0.018332608,0.39696822],"study_design_scores_gemma":[0.00022320906,0.0004393173,0.0026485582,0.00005626981,0.00018783509,0.0027338096,0.0014237757,0.8196523,0.07941728,0.077871114,0.015167597,0.00017896105],"about_ca_topic_score_codex":0.002143697,"about_ca_topic_score_gemma":0.001480007,"teacher_disagreement_score":0.0023772188,"about_ca_system_score_codex":0.0009017096,"about_ca_system_score_gemma":0.0020868548,"threshold_uncertainty_score":0.012346923},"labels":[],"label_agreement":null},{"id":"W2962746473","doi":"10.1109/icc.2019.8761802","title":"Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Upload; Computer science; Private information retrieval; Computer network; Computer security; World Wide Web","score_opus":0.013180770584288352,"score_gpt":0.22300462277726196,"score_spread":0.20982385219297361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962746473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08107825,0.00061444036,0.8983657,0.0015389199,0.00009608054,0.00025281403,0.0004192957,0.0007597404,0.016874852],"genre_scores_gemma":[0.79990554,0.00074490014,0.19108374,0.0004873281,0.00023035023,0.0006969687,0.0004010598,0.000253465,0.006196509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669087,0.0009758785,0.00014904904,0.00041605803,0.0011959746,0.0005721409],"domain_scores_gemma":[0.983497,0.009390941,0.0016576548,0.0029624735,0.001921957,0.0005699694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025650715,0.0009929636,0.0012510874,0.0011883028,0.0011673499,0.002311931,0.0025868507,0.0018322826,0.0031106062],"category_scores_gemma":[0.019132588,0.00050451286,0.00073378574,0.0020051864,0.0028205425,0.004378914,0.003482304,0.0028962384,0.0010835454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049620104,0.00016966919,0.0005484709,0.00029842203,0.000036370293,0.00023921988,0.00029860451,0.15721959,0.020419387,0.77304804,0.0048493356,0.042376693],"study_design_scores_gemma":[0.00012776823,0.0002202173,0.0001946179,0.000057908914,0.000029688068,0.0004242284,0.000081231934,0.647314,0.01691396,0.3298267,0.004727932,0.000081668404],"about_ca_topic_score_codex":0.0010864318,"about_ca_topic_score_gemma":0.00075215707,"teacher_disagreement_score":0.0031106062,"about_ca_system_score_codex":0.0022702678,"about_ca_system_score_gemma":0.0031330467,"threshold_uncertainty_score":0.016472042},"labels":[],"label_agreement":null},{"id":"W2962835979","doi":"10.1145/3371123","title":"A probabilistic separation logic","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; McGill University; University of Wisconsin-Madison; National Science Foundation","keywords":"Soundness; Probabilistic logic; Mathematical proof; Probabilistic CTL; Probabilistic argumentation; Independence (probability theory)","score_opus":0.013394098237960375,"score_gpt":0.27735756396492733,"score_spread":0.26396346572696694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962835979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049503734,0.00033445976,0.9724151,0.0017360955,0.000117883916,0.00013038435,0.00051899435,0.0009317919,0.018864904],"genre_scores_gemma":[0.3011384,0.0007896192,0.67312896,0.0028664398,0.0005848532,0.00045923257,0.0010351383,0.00028728228,0.019710092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572253,0.00093272893,0.0004085953,0.0010482633,0.0015511354,0.000336678],"domain_scores_gemma":[0.9966462,0.0016893843,0.0002906479,0.0004454617,0.00067492196,0.000253329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003768454,0.00080803275,0.00061524345,0.0016318006,0.0020917433,0.0033529769,0.0017842861,0.001273742,0.006932293],"category_scores_gemma":[0.005620138,0.0007946706,0.0019483718,0.0013635292,0.004275703,0.0075884084,0.004008688,0.0047076684,0.0015630777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036879945,0.000031980122,0.00015488052,0.00009104574,0.000019171308,0.00009301179,0.00015303757,0.0029620037,0.0010754494,0.9746568,0.0021315683,0.01859403],"study_design_scores_gemma":[0.00003204715,0.000030762036,0.000100582234,0.000034881396,0.000029946186,0.00020401952,0.000037352464,0.029144008,0.0021355702,0.9401916,0.028035164,0.000024077865],"about_ca_topic_score_codex":0.0021085297,"about_ca_topic_score_gemma":0.0017683762,"teacher_disagreement_score":0.006932293,"about_ca_system_score_codex":0.0022205294,"about_ca_system_score_gemma":0.0032550304,"threshold_uncertainty_score":0.023190796},"labels":[],"label_agreement":null},{"id":"W2963053811","doi":"10.2478/popets-2019-0052","title":"StealthDB: a Scalable Encrypted Database with Full SQL Query Support","year":2019,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; SQL; Scalability; Cloud computing; Database; Cryptography; Operating system; Computer security","score_opus":0.009965959042160794,"score_gpt":0.22660953802119574,"score_spread":0.21664357897903494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963053811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24372378,0.003523785,0.46601194,0.0013352628,0.0004914104,0.0010719427,0.007341418,0.25108865,0.025411867],"genre_scores_gemma":[0.8416279,0.00086858275,0.130312,0.0006607672,0.00013316568,0.00032800518,0.012371776,0.003990561,0.009707176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976036,0.00026631236,0.00025122688,0.00036608262,0.001255737,0.0002569757],"domain_scores_gemma":[0.99691427,0.00041748592,0.00018086557,0.001718507,0.00047508295,0.00029376647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017255365,0.00074313255,0.0007281708,0.0011095416,0.00055567484,0.002018767,0.0038419415,0.00055542355,0.0057996935],"category_scores_gemma":[0.0035075494,0.00076662697,0.00050694507,0.0011810294,0.0007794935,0.004102163,0.0037564558,0.0011936255,0.00304418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011424629,0.0021894544,0.02178033,0.0013142728,0.00087164756,0.0022148658,0.0009933144,0.0479576,0.19875135,0.043916862,0.25381067,0.41477504],"study_design_scores_gemma":[0.0021002667,0.00091385335,0.0057776594,0.00011718102,0.00024215213,0.0018920861,0.00036582537,0.67676073,0.18780826,0.02312004,0.100650765,0.0002511178],"about_ca_topic_score_codex":0.0027311333,"about_ca_topic_score_gemma":0.0016879684,"teacher_disagreement_score":0.0057996935,"about_ca_system_score_codex":0.0007304202,"about_ca_system_score_gemma":0.0014604998,"threshold_uncertainty_score":0.019401848},"labels":[],"label_agreement":null},{"id":"W2963326234","doi":"10.1515/jmc-2018-0012","title":"Multi-prover proof of retrievability","year":2018,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Server; Retrievability; Gas meter prover; Confidentiality; Scheme (mathematics); Protocol (science); Theoretical computer science; Cryptography; Computer security; Mathematical proof; Computer network; Information retrieval; Mathematics","score_opus":0.24871903777022059,"score_gpt":0.540984659911541,"score_spread":0.2922656221413204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963326234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03736804,0.0007571679,0.9219503,0.005536767,0.0002829234,0.00024820448,0.00057910057,0.0017736226,0.03150398],"genre_scores_gemma":[0.8174486,0.00073197973,0.16803318,0.0016885267,0.00057118037,0.0005366106,0.0004317853,0.00047063568,0.010087521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97995996,0.007065235,0.0012346331,0.003508934,0.0062836986,0.0019475654],"domain_scores_gemma":[0.8897599,0.078852296,0.0043607317,0.02020852,0.005180048,0.0016385551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013514949,0.0012647815,0.0021636619,0.0019401079,0.002602022,0.0050285757,0.004069643,0.0034292112,0.011575645],"category_scores_gemma":[0.057674173,0.0016723736,0.0032902542,0.001955225,0.008056826,0.011633443,0.010053531,0.009688646,0.002534599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012749064,0.00006553318,0.0005134662,0.00027824452,0.000063475636,0.0002437655,0.0008231446,0.011407575,0.0029407267,0.9697082,0.0029812506,0.010847163],"study_design_scores_gemma":[0.00010117088,0.000058304646,0.00016172412,0.00008742936,0.00003669608,0.0003246038,0.00006602442,0.08098233,0.0061136694,0.9052346,0.0067784768,0.000054964807],"about_ca_topic_score_codex":0.00069517153,"about_ca_topic_score_gemma":0.0005067557,"teacher_disagreement_score":0.013514949,"about_ca_system_score_codex":0.0027318136,"about_ca_system_score_gemma":0.003507576,"threshold_uncertainty_score":0.07147473},"labels":[],"label_agreement":null},{"id":"W2963526330","doi":"10.4230/lipics.tqc.2019.2","title":"Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Zero (linguistics); Mathematics; Measure (data warehouse); Discrete mathematics; Function (biology); Upper and lower bounds; State (computer science); Boolean function; Algorithm; Combinatorics; Computer science","score_opus":0.03387183656975885,"score_gpt":0.2957106843187253,"score_spread":0.2618388477489665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963526330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09168064,0.0015417561,0.8755586,0.0059795883,0.00019202338,0.000149149,0.00030587576,0.00047790213,0.02411441],"genre_scores_gemma":[0.8665668,0.000827222,0.12339226,0.0012903126,0.00044766176,0.0003288694,0.00026389185,0.00024188864,0.0066412194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878633,0.0030681752,0.0005355735,0.002216548,0.0044678375,0.0018486249],"domain_scores_gemma":[0.9142737,0.06294719,0.0049956073,0.012042819,0.0037500083,0.001990798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00857149,0.0012396614,0.001370884,0.002431918,0.0018410307,0.004998363,0.0041292966,0.0026964738,0.005489678],"category_scores_gemma":[0.042311598,0.00073131337,0.002162427,0.0023883465,0.012482456,0.019153455,0.007825905,0.008355684,0.0007098114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008560854,0.000046093508,0.0006189684,0.00006652548,0.000021925684,0.000041043044,0.00016533204,0.016696336,0.0013834081,0.97200847,0.0007485801,0.008117782],"study_design_scores_gemma":[0.000023666322,0.00007350131,0.00039408187,0.000023698822,0.000020948552,0.00009113401,0.00005730329,0.10756659,0.0030969388,0.88633317,0.0022824358,0.00003645741],"about_ca_topic_score_codex":0.0017268634,"about_ca_topic_score_gemma":0.0009688372,"teacher_disagreement_score":0.00857149,"about_ca_system_score_codex":0.0066725938,"about_ca_system_score_gemma":0.0030886596,"threshold_uncertainty_score":0.048413277},"labels":[],"label_agreement":null},{"id":"W2964182525","doi":"10.2478/popets-2019-0041","title":"Mesh: A Supply Chain Solution with Locally Private Blockchain Transactions","year":2019,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical proof; Anonymity; Verifiable secret sharing; Discrete logarithm; Computer security; Random oracle; Blockchain; Cryptography; Encryption; Public-key cryptography; Theoretical computer science; Set (abstract data type); Mathematics","score_opus":0.008161560654313482,"score_gpt":0.21036536065738326,"score_spread":0.20220380000306978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964182525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12922654,0.0004435681,0.85209686,0.00082613056,0.00015746706,0.0006109208,0.00028015827,0.0038368385,0.012521612],"genre_scores_gemma":[0.7580291,0.00025605422,0.22955924,0.00010865867,0.000055066055,0.000279389,0.00031194367,0.000109158136,0.011291352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924505,0.00022491287,0.00006340414,0.00013938027,0.00023859384,0.000088703884],"domain_scores_gemma":[0.99932325,0.00016396049,0.00009865679,0.00024350722,0.00007255331,0.00009807928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087679015,0.00031356025,0.00051946525,0.00049400836,0.00064572034,0.0013530235,0.0016576604,0.0013173819,0.0075557213],"category_scores_gemma":[0.0016546383,0.00024171743,0.00035103795,0.0008094234,0.00063128676,0.0022839743,0.0031237807,0.0007486327,0.0011896256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022527238,0.0007204939,0.002666738,0.00065036037,0.0002019109,0.0016843319,0.00089522934,0.3314635,0.06420156,0.1740316,0.0142314015,0.40700012],"study_design_scores_gemma":[0.00030255775,0.0006315269,0.0004718376,0.000053085223,0.00004752633,0.00036394116,0.00020946334,0.9119589,0.012586704,0.046464484,0.026864666,0.000045329445],"about_ca_topic_score_codex":0.0010583894,"about_ca_topic_score_gemma":0.000960422,"teacher_disagreement_score":0.0075557213,"about_ca_system_score_codex":0.0006141037,"about_ca_system_score_gemma":0.0011179019,"threshold_uncertainty_score":0.025276423},"labels":[],"label_agreement":null},{"id":"W2971100669","doi":"10.2478/popets-2019-0061","title":"A Bit More Than a Bit Is More Than a Bit Better","year":2019,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Download; Server; Upload; Protocol (science); Theoretical computer science; Bit (key); Computer network; Arithmetic; Computer security; Mathematics; World Wide Web","score_opus":0.011529467433412632,"score_gpt":0.24311865470086869,"score_spread":0.23158918726745606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971100669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14044723,0.005862529,0.7253743,0.029774494,0.0011558544,0.000297598,0.0010147328,0.001551413,0.09452186],"genre_scores_gemma":[0.86168355,0.0022726585,0.11171737,0.0030312748,0.00076940586,0.00029116558,0.00042963497,0.0007464744,0.019058613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887056,0.0050898804,0.00052393024,0.0019208266,0.0028350207,0.0009247755],"domain_scores_gemma":[0.92816967,0.04284589,0.004230905,0.019325772,0.003973601,0.0014541503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008465236,0.00079020736,0.0017147036,0.0018569848,0.002815566,0.0085036205,0.003409344,0.0038045752,0.01975653],"category_scores_gemma":[0.049642984,0.0008940456,0.0011647901,0.0032470466,0.008031736,0.02386047,0.0048030214,0.006009745,0.0054010493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006946994,0.00017507607,0.0013083207,0.00043174953,0.00013700932,0.00017729292,0.0004972137,0.020739751,0.004859105,0.91070455,0.012286849,0.04798837],"study_design_scores_gemma":[0.00007309225,0.00017660926,0.00035147104,0.00013353536,0.000094914605,0.0005387756,0.00027579625,0.085765645,0.007276891,0.886225,0.01899642,0.000091808055],"about_ca_topic_score_codex":0.0009962156,"about_ca_topic_score_gemma":0.00059911143,"teacher_disagreement_score":0.01975653,"about_ca_system_score_codex":0.002316609,"about_ca_system_score_gemma":0.0023395447,"threshold_uncertainty_score":0.06609213},"labels":[],"label_agreement":null},{"id":"W2971408387","doi":"10.1186/s12911-019-0867-z","title":"A privacy-preserving distributed filtering framework for NLP artifacts","year":2019,"lang":"en","type":"article","venue":"BMC Medical Informatics and Decision Making","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Center for Advancing Translational Sciences; National Institute of Biomedical Imaging and Bioengineering; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; University of Manitoba; National Institutes of Health; Cancer Prevention and Research Institute of Texas","keywords":"Health informatics; Computer science; Artificial intelligence; Natural language processing; Protected health information; Information retrieval; Machine learning; Medicine; Public health; Health policy","score_opus":0.030841291999970027,"score_gpt":0.3188505267025306,"score_spread":0.28800923470256057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971408387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017157467,0.000046239908,0.9969332,0.00016360579,0.000012551971,0.000095724914,0.000047299047,0.00059693883,0.00038867604],"genre_scores_gemma":[0.13444684,0.00016916973,0.8603066,0.0002684424,0.00008679391,0.000393082,0.0004748407,0.00021150995,0.0036427842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9883736,0.0035073995,0.0011472562,0.0021177486,0.004175751,0.00067824364],"domain_scores_gemma":[0.9834547,0.005878846,0.0013125389,0.006557236,0.002287212,0.00050944544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013417508,0.00095660234,0.0014414364,0.0027519162,0.0030292948,0.005234857,0.003774673,0.0031156747,0.00338702],"category_scores_gemma":[0.01516491,0.0007976632,0.002979334,0.002195277,0.0029510132,0.00873905,0.006789929,0.0035936267,0.0015311044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006508849,0.00047067372,0.0021816287,0.00044786977,0.00025767533,0.0010944619,0.0019296241,0.11160607,0.022123508,0.4886307,0.008019288,0.3625877],"study_design_scores_gemma":[0.00007066538,0.00013041691,0.0004566555,0.000065365704,0.00009952433,0.00057407696,0.00027897544,0.7037386,0.01629095,0.25950682,0.018707333,0.00008071433],"about_ca_topic_score_codex":0.0029209894,"about_ca_topic_score_gemma":0.0025946046,"teacher_disagreement_score":0.013417508,"about_ca_system_score_codex":0.0024306758,"about_ca_system_score_gemma":0.0041617476,"threshold_uncertainty_score":0.07095945},"labels":[],"label_agreement":null},{"id":"W2972500166","doi":"10.1016/j.procs.2019.08.059","title":"Performance Evaluation of CP-ABE Schemes under Constrained Devices","year":2019,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Cloud computing; Encryption; Server; Cryptography; Key (lock); Computer security; Internet of Things; Access control; Delegation; Public-key cryptography; The Internet; Computer network; World Wide Web; Operating system","score_opus":0.02282997514148371,"score_gpt":0.26858123720653515,"score_spread":0.24575126206505143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972500166","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7968863,0.007684159,0.16203952,0.0017670041,0.00059465796,0.00082529767,0.0009992486,0.0013431383,0.027860655],"genre_scores_gemma":[0.97919184,0.0007119686,0.018657448,0.00007853423,0.0000324766,0.000085828586,0.00029429124,0.00002845998,0.0009192586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926537,0.00253856,0.00054152176,0.0005752895,0.0019967104,0.0016941375],"domain_scores_gemma":[0.98831743,0.006157266,0.001164449,0.0015554649,0.0022709563,0.0005344383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041216523,0.0011055366,0.0019298227,0.0009951437,0.0015508056,0.0024313685,0.0015374171,0.0016322822,0.0027350164],"category_scores_gemma":[0.011388837,0.00021392488,0.0006031282,0.0013343659,0.0010996887,0.0033538328,0.001864335,0.0009685299,0.0005481769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011050556,0.0014000473,0.0061736675,0.0016067824,0.0005777523,0.0009106373,0.00031441503,0.75264204,0.044185903,0.041070845,0.008130455,0.13193695],"study_design_scores_gemma":[0.0002557471,0.0016179738,0.0014025223,0.00006839628,0.000102406746,0.0007388377,0.0002308018,0.9677922,0.019284425,0.005788349,0.002644289,0.000074080155],"about_ca_topic_score_codex":0.0026530975,"about_ca_topic_score_gemma":0.0012746431,"teacher_disagreement_score":0.0041216523,"about_ca_system_score_codex":0.002603968,"about_ca_system_score_gemma":0.0024972137,"threshold_uncertainty_score":0.021797597},"labels":[],"label_agreement":null},{"id":"W2973121604","doi":"10.1109/tpds.2019.2940945","title":"Enabling Encrypted Boolean Queries in Geographically Distributed Databases","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Louisiana Board of Regents","keywords":"Computer science; Scalability; Encryption; Server; Distributed database; Database; Outsourcing; Private information retrieval; Computer network; Computer security","score_opus":0.01593452215068129,"score_gpt":0.23438066521691725,"score_spread":0.21844614306623597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973121604","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27226952,0.00065540895,0.71842664,0.0009637715,0.00006348102,0.00028627875,0.00028300117,0.0023814945,0.004670459],"genre_scores_gemma":[0.9429991,0.00020638538,0.054635208,0.00013890232,0.000027268667,0.00010683295,0.00016522327,0.00007130019,0.0016497569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99527466,0.0013470398,0.00061788014,0.00046539353,0.0018465079,0.00044846462],"domain_scores_gemma":[0.99345076,0.002102424,0.00076743425,0.0027813467,0.0007135814,0.00018453444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026683994,0.00035986493,0.0007460165,0.00053683994,0.00096637575,0.0020648914,0.0016011945,0.00085855566,0.0015008206],"category_scores_gemma":[0.006836797,0.0003808832,0.00044142667,0.001030486,0.0014874402,0.007704515,0.0044230437,0.0009878973,0.00055383577],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046844315,0.0008136506,0.013571631,0.0007551426,0.00021583479,0.0046548257,0.003460268,0.16561724,0.21835671,0.3003445,0.009874983,0.27765083],"study_design_scores_gemma":[0.00034684647,0.00048516536,0.001716544,0.00005177239,0.000108798704,0.0017797254,0.0010725925,0.72218984,0.1578102,0.09591337,0.018427135,0.00009804233],"about_ca_topic_score_codex":0.0010969986,"about_ca_topic_score_gemma":0.00079206575,"teacher_disagreement_score":0.0026683994,"about_ca_system_score_codex":0.0012129471,"about_ca_system_score_gemma":0.001154885,"threshold_uncertainty_score":0.014111996},"labels":[],"label_agreement":null},{"id":"W2973379834","doi":"10.1109/access.2019.2942414","title":"Security and Efficiency Enhanced Revocable Access Control for Fog-Based Smart Grid System","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer security; Access control; Smart grid; Grid; Computer network; Engineering","score_opus":0.012917120490205675,"score_gpt":0.27301413928333607,"score_spread":0.2600970187931304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973379834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2938495,0.0018899031,0.6855098,0.00065076136,0.00032557655,0.0002846847,0.00017556462,0.0026768213,0.014637488],"genre_scores_gemma":[0.9939659,0.00012690037,0.005046263,0.00005112234,0.000018366416,0.000018013083,0.00003349387,0.000010023745,0.00072991475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894017,0.00019216693,0.00008669031,0.00021473294,0.00032123036,0.0002449971],"domain_scores_gemma":[0.99930537,0.00011567604,0.00012204374,0.00020320837,0.0002026833,0.000051156367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071483786,0.00048056786,0.0008398924,0.00041328635,0.0009779428,0.0012267932,0.0012336511,0.00070558744,0.0011346055],"category_scores_gemma":[0.0012430258,0.00016227017,0.00055221835,0.00040497282,0.0007594563,0.0023206086,0.0013716905,0.00059169455,0.00024163909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036743707,0.00061413413,0.008819974,0.0007528139,0.00043293426,0.003961827,0.0017844451,0.402545,0.1390869,0.14676109,0.01656419,0.2750023],"study_design_scores_gemma":[0.000098294644,0.00022147471,0.0008939751,0.000021777598,0.000057785983,0.0006311264,0.00015103795,0.9695328,0.010676541,0.012149442,0.0055046016,0.00006111955],"about_ca_topic_score_codex":0.0034302643,"about_ca_topic_score_gemma":0.002160736,"teacher_disagreement_score":0.0034302643,"about_ca_system_score_codex":0.0008325672,"about_ca_system_score_gemma":0.00085986813,"threshold_uncertainty_score":0.006820619},"labels":[],"label_agreement":null},{"id":"W2978198527","doi":"","title":"There Are 10 Types of Vectors (and Polynomials): Efficient Zero-Knowledge Proofs of \"One-Hotness\" via Polynomials with One Zero.","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Gas meter prover; Verifiable secret sharing; Mathematical proof; Zero-knowledge proof; Soundness; Computer science; Theoretical computer science; Protocol (science); Discrete mathematics; Bounded function; Cryptography; Mathematics; Algorithm","score_opus":0.017834018620228882,"score_gpt":0.24612121799265374,"score_spread":0.22828719937242486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978198527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030935215,0.0009633052,0.95083123,0.001473606,0.00027844,0.0002342271,0.00017547666,0.0018715423,0.013236948],"genre_scores_gemma":[0.6754873,0.0011764925,0.30915782,0.0008332761,0.00027056306,0.00045264102,0.00052193494,0.00042805314,0.0116719175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992831,0.0025560672,0.00049055414,0.0012117709,0.0019328584,0.0009777101],"domain_scores_gemma":[0.989122,0.0040251273,0.0012268758,0.0044037844,0.0008378831,0.00038433424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062916456,0.0009017873,0.0008283794,0.0009616704,0.0015487404,0.0039984207,0.0030762267,0.0023028639,0.00896846],"category_scores_gemma":[0.016232595,0.000981682,0.0011177821,0.0012080169,0.0053002103,0.014076196,0.0064084223,0.005498088,0.0027436295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050328264,0.0001237282,0.00089201797,0.0005193886,0.00009099407,0.00018272769,0.0007082504,0.0049321945,0.011213375,0.87451595,0.0045410492,0.101777],"study_design_scores_gemma":[0.00019020094,0.0006643453,0.0006548095,0.00026069835,0.00017909282,0.0007927632,0.000463763,0.06514625,0.0938619,0.78016126,0.057379015,0.00024598834],"about_ca_topic_score_codex":0.00050499785,"about_ca_topic_score_gemma":0.0005376063,"teacher_disagreement_score":0.00896846,"about_ca_system_score_codex":0.0013596326,"about_ca_system_score_gemma":0.002360434,"threshold_uncertainty_score":0.033273757},"labels":[],"label_agreement":null},{"id":"W2979871440","doi":"10.1007/s10115-019-01405-7","title":"$${\\textsf {SecDM}}$$: privacy-preserving data outsourcing framework with differential privacy","year":2019,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Manitoba; McGill University","funders":"","keywords":"Computer science; Cloud computing; Homomorphic encryption; Encryption; Differential privacy; Information privacy; Outsourcing; Scalability; Computer security; Service provider; Cryptosystem; Database; Data mining; Service (business); Business","score_opus":0.01773065424694377,"score_gpt":0.24963610835367206,"score_spread":0.2319054541067283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979871440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061459383,0.00039035047,0.9715802,0.0025355928,0.00016562128,0.00012877311,0.0004104868,0.001076323,0.01756672],"genre_scores_gemma":[0.5754619,0.001451655,0.3825494,0.0012626549,0.00028457283,0.0003643726,0.00083232054,0.00049090665,0.037302226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997267,0.0006421304,0.00010048451,0.0003246205,0.0011259313,0.00053984585],"domain_scores_gemma":[0.99891615,0.00018604312,0.00007539415,0.0004941,0.00021072563,0.000117593125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023889078,0.00064664474,0.00088333286,0.0010251836,0.0016955232,0.0039007156,0.0030718397,0.0013570731,0.009276581],"category_scores_gemma":[0.002183534,0.00051780697,0.0009339511,0.002472636,0.0025691285,0.0065380693,0.00725035,0.0037972939,0.0032489996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000746729,0.000058607635,0.00007672725,0.0000624556,0.000010967233,0.00010148224,0.000097960605,0.0054799127,0.00151983,0.95403063,0.009958215,0.028528713],"study_design_scores_gemma":[0.000047417954,0.000054152282,0.00013526836,0.00004031562,0.000026842039,0.00048049277,0.00011371343,0.12327073,0.006675471,0.81652975,0.052570757,0.000055185326],"about_ca_topic_score_codex":0.002280348,"about_ca_topic_score_gemma":0.0022870807,"teacher_disagreement_score":0.009276581,"about_ca_system_score_codex":0.0022938247,"about_ca_system_score_gemma":0.0031417815,"threshold_uncertainty_score":0.031033218},"labels":[],"label_agreement":null},{"id":"W2979943645","doi":"10.1515/jmc-2018-0039","title":"Privacy-preserving verifiable delegation of polynomial and matrix functions","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Computer science; Verifiable secret sharing; Theoretical computer science; Delegation; Homomorphic encryption; Security parameter; Outsourcing; Functional encryption; Secure multi-party computation; Boolean circuit; Encryption; Cryptography; Boolean function; Computer security; Ciphertext; Algorithm; Programming language","score_opus":0.009955474349203255,"score_gpt":0.2534273374824649,"score_spread":0.24347186313326163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979943645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12784885,0.00038569883,0.86197376,0.0010270037,0.000097661075,0.00015359103,0.00028464655,0.0011730518,0.0070557604],"genre_scores_gemma":[0.961317,0.00014923596,0.035079863,0.00013745928,0.0000541723,0.00008361565,0.00013589307,0.00004704641,0.0029956982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949626,0.001200334,0.0002769135,0.0008090758,0.0018809045,0.00087015034],"domain_scores_gemma":[0.99117213,0.0032642302,0.00080426125,0.0039290558,0.00055743195,0.00027277865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00278095,0.00047944003,0.0011658225,0.000475001,0.0008089423,0.0021931943,0.001745069,0.0013678767,0.0025935017],"category_scores_gemma":[0.009901204,0.0003928201,0.00110927,0.00096107327,0.0023834808,0.004512073,0.0049871723,0.002731984,0.000519436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014124966,0.00037331434,0.0021186147,0.00036044637,0.00013343293,0.00080827414,0.0007621599,0.14399171,0.03728453,0.7237886,0.0034236463,0.08554273],"study_design_scores_gemma":[0.00018118188,0.00024263594,0.0007418909,0.000069717265,0.00007112521,0.00047725826,0.00010320921,0.62947744,0.08165227,0.2789238,0.007979567,0.00007992979],"about_ca_topic_score_codex":0.00089237705,"about_ca_topic_score_gemma":0.0004947478,"teacher_disagreement_score":0.00278095,"about_ca_system_score_codex":0.0019502094,"about_ca_system_score_gemma":0.0014235263,"threshold_uncertainty_score":0.014707208},"labels":[],"label_agreement":null},{"id":"W2982290828","doi":"10.1109/ccst.2019.8888435","title":"Securing GOOSE: The Return of One-Time Pads","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Goose; Computer science; IEC 61850; Encryption; Computer security; Latency (audio); Spoofing attack; Embedded system; Automation; Computer network; Engineering; Telecommunications","score_opus":0.00692723076408486,"score_gpt":0.19785566050076203,"score_spread":0.19092842973667717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982290828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31468123,0.0016261736,0.6524502,0.0012523123,0.00044996262,0.00039113473,0.00020758584,0.0033575613,0.025583936],"genre_scores_gemma":[0.95445234,0.0004939612,0.03752984,0.00016769186,0.000047007405,0.00004646104,0.000115359704,0.000097435804,0.007049925],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987589,0.00030909266,0.00009529659,0.00013895793,0.0005130181,0.00018473303],"domain_scores_gemma":[0.99684286,0.0008050916,0.00044434762,0.0014898287,0.00035716323,0.00006065538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008040702,0.00040212183,0.00037855777,0.00043617634,0.00034407736,0.0014338018,0.00066515116,0.000556403,0.0032319836],"category_scores_gemma":[0.0040738736,0.00017291712,0.00035978534,0.00043919942,0.0009571521,0.0029279357,0.0011662046,0.00068161916,0.0014309142],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025415462,0.00029554745,0.009679904,0.0011701012,0.00018509549,0.002417184,0.0016037695,0.019553607,0.30580872,0.2202812,0.007166641,0.42929667],"study_design_scores_gemma":[0.00010022205,0.001435347,0.0025506234,0.0001630245,0.0001585124,0.005198351,0.0007005557,0.06662125,0.8037717,0.03778784,0.0814196,0.00009304273],"about_ca_topic_score_codex":0.00015390542,"about_ca_topic_score_gemma":0.000115965006,"teacher_disagreement_score":0.0032319836,"about_ca_system_score_codex":0.00027311067,"about_ca_system_score_gemma":0.0003730868,"threshold_uncertainty_score":0.010812044},"labels":[],"label_agreement":null},{"id":"W2982517141","doi":"10.1109/dasc/picom/cbdcom/cyberscitech.2019.00066","title":"Practical Key Recovery Model for Self-Sovereign Identity Based Digital Wallets","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cryptocurrency; Identity management; Computer science; Computer security; Digital identity; Identity (music); Key (lock); Key management; Context (archaeology); Cryptography; Digital signature; Digital Signature Algorithm; Internet privacy; Authentication (law); Access control","score_opus":0.024351981378007582,"score_gpt":0.2746333846168669,"score_spread":0.25028140323885933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982517141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037572525,0.00011279505,0.950194,0.00072985596,0.0000590018,0.00014470636,0.000072955256,0.00019079192,0.010923384],"genre_scores_gemma":[0.9239431,0.00018484808,0.06209132,0.00014934903,0.00004693948,0.00019335348,0.00009766714,0.00004049849,0.013253054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975631,0.0007931379,0.00014318759,0.00043464452,0.0006628489,0.00040310953],"domain_scores_gemma":[0.9974917,0.0012339615,0.00027328805,0.00052820565,0.00034331423,0.0001296043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027763732,0.00043779827,0.00083213096,0.0005629577,0.0011662452,0.0024259272,0.0023500223,0.0021305995,0.00757817],"category_scores_gemma":[0.0054668426,0.00028304098,0.00076248456,0.00071719615,0.002343741,0.0072762608,0.003517858,0.0024847856,0.001129017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002084455,0.0000641871,0.0001210382,0.00008694574,0.000019148394,0.0003962561,0.00037729202,0.12550493,0.0039996053,0.8543289,0.0018940785,0.01299922],"study_design_scores_gemma":[0.00006493559,0.00008818473,0.00004957313,0.000018687473,0.000011828064,0.00018323571,0.0001179744,0.7718269,0.0021226918,0.22189566,0.003592821,0.000027518914],"about_ca_topic_score_codex":0.0007669415,"about_ca_topic_score_gemma":0.00054081,"teacher_disagreement_score":0.00757817,"about_ca_system_score_codex":0.0015235861,"about_ca_system_score_gemma":0.0013971266,"threshold_uncertainty_score":0.025351465},"labels":[],"label_agreement":null},{"id":"W2982581272","doi":"10.14778/3364324.3364332","title":"Secure multi-party functional dependency discovery","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Profiling (computer programming); Computation; Secure two-party computation; Cryptography; Dependency (UML); Functional dependency; Access control; Distributed computing; Secure multi-party computation; Cryptographic protocol; Semantics (computer science); Data anonymization; Theoretical computer science; Computer security; Data mining; Information privacy; Algorithm; Relational database; Programming language; Artificial intelligence","score_opus":0.011561321195034262,"score_gpt":0.2036494168363956,"score_spread":0.19208809564136134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982581272","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037540406,0.00019296694,0.9580129,0.0008948948,0.000043686603,0.00020567393,0.00028885782,0.000862561,0.0019581937],"genre_scores_gemma":[0.83522624,0.00022616966,0.16009943,0.00024522474,0.00006728341,0.0002826408,0.00064918166,0.00012186914,0.0030819413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9896729,0.0028780333,0.0008797057,0.0015679928,0.0040412624,0.00096007297],"domain_scores_gemma":[0.9707474,0.009495327,0.0024609691,0.01523483,0.001550925,0.00051059836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072818934,0.00068291445,0.0014719934,0.0012353873,0.0024015605,0.0031854543,0.0026568044,0.0018669553,0.002437499],"category_scores_gemma":[0.018734915,0.00082868105,0.0017206216,0.001766126,0.0025091686,0.008888927,0.008121251,0.0030643665,0.0010456648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016032466,0.0004312751,0.008699136,0.0005531913,0.00034412197,0.0014467945,0.0011519237,0.14102416,0.040613968,0.5046613,0.01086373,0.28860712],"study_design_scores_gemma":[0.00008090894,0.00014371568,0.0010295728,0.000048520254,0.00009006647,0.0009226298,0.00033053404,0.60544753,0.042025138,0.33798394,0.011829557,0.000067887515],"about_ca_topic_score_codex":0.0005193014,"about_ca_topic_score_gemma":0.0006742149,"teacher_disagreement_score":0.0072818934,"about_ca_system_score_codex":0.0017549619,"about_ca_system_score_gemma":0.0030597127,"threshold_uncertainty_score":0.0385108},"labels":[],"label_agreement":null},{"id":"W2982682504","doi":"10.1109/jsait.2020.3017054","title":"Erasable Bit Commitment From Temporary Quantum Trust","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université de Montréal; Perimeter Institute; University of Waterloo","funders":"Industry Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Communication source; Commit; Commitment scheme; Computer science; Computer security; Protocol (science); Third party; Trusted third party; Cryptography; Cryptographic protocol; Node (physics); Adversarial system; Bit (key); Computer network; Internet privacy","score_opus":0.015256136464743468,"score_gpt":0.22594976497196748,"score_spread":0.210693628507224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982682504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023307519,0.00039778187,0.9491409,0.001280621,0.0003757954,0.00017783121,0.00016123177,0.00035970754,0.024798566],"genre_scores_gemma":[0.7415285,0.00075100776,0.23170313,0.0010778412,0.0004103046,0.0007551354,0.00026966838,0.00031407856,0.02319028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941795,0.0018910747,0.00038184092,0.00077625574,0.0019048289,0.0008665165],"domain_scores_gemma":[0.99125975,0.0025877487,0.0007556205,0.004185092,0.0008104804,0.0004013093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035198694,0.00068869896,0.0010661955,0.000882405,0.002098212,0.0037843122,0.0027713412,0.0025988373,0.0071868096],"category_scores_gemma":[0.011894711,0.00065998844,0.0012253743,0.0014181188,0.0060775424,0.010932382,0.0082595665,0.0064754733,0.0022270044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080223916,0.00001951813,0.000055020373,0.00004674112,0.000007644648,0.00013291568,0.00019077223,0.0057049533,0.00214341,0.98473966,0.00088415545,0.0059950654],"study_design_scores_gemma":[0.00006120116,0.00009586458,0.00006982363,0.0000633416,0.000017780361,0.00021679142,0.00008987567,0.06868747,0.0058707497,0.9085337,0.016229559,0.00006374519],"about_ca_topic_score_codex":0.0004641347,"about_ca_topic_score_gemma":0.00035857625,"teacher_disagreement_score":0.0071868096,"about_ca_system_score_codex":0.0016671141,"about_ca_system_score_gemma":0.0019914224,"threshold_uncertainty_score":0.024042249},"labels":[],"label_agreement":null},{"id":"W2983092601","doi":"10.1145/3338466.3358925","title":"Verifiable Computation using Smart Contracts","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Verifiable secret sharing; Stateful firewall; Cloud computing; Protocol (science); Computer security; Computation; Solidity; Outsourcing; Secure multi-party computation; Smart contract; Secure two-party computation; Cryptographic protocol; Distributed computing; Cryptography; Programming language; Operating system","score_opus":0.01587647017135103,"score_gpt":0.24672601113964188,"score_spread":0.23084954096829086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983092601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017053824,0.0001994629,0.9705364,0.00081624143,0.000092493414,0.00025896073,0.00012307517,0.0010489365,0.009870514],"genre_scores_gemma":[0.5673165,0.00063309725,0.41720128,0.00050232525,0.00013689356,0.00072374655,0.0003707952,0.00045519226,0.012660201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894828,0.003594413,0.00083582563,0.0013917626,0.00370822,0.0009869847],"domain_scores_gemma":[0.98581195,0.0062803165,0.0011804041,0.0052545276,0.0011110506,0.00036187994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007475846,0.00079983356,0.0009208338,0.0010628464,0.0019269647,0.0049092686,0.0021672456,0.0023714055,0.005353408],"category_scores_gemma":[0.017042808,0.0008987191,0.0015491571,0.0017702349,0.008174816,0.012087715,0.0054478617,0.004725944,0.001883852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021751226,0.00004212006,0.00031309432,0.000101076526,0.000026573834,0.00014771728,0.00041605276,0.015697146,0.0056491373,0.9538137,0.0011893273,0.02238671],"study_design_scores_gemma":[0.00016093056,0.00016729806,0.00018626606,0.000094324656,0.00005226539,0.00026071485,0.00008880203,0.20380966,0.028513469,0.7409167,0.02565291,0.00009662875],"about_ca_topic_score_codex":0.0018269339,"about_ca_topic_score_gemma":0.0010163777,"teacher_disagreement_score":0.007475846,"about_ca_system_score_codex":0.002879758,"about_ca_system_score_gemma":0.003804836,"threshold_uncertainty_score":0.039536536},"labels":[],"label_agreement":null},{"id":"W2983235682","doi":"10.1145/3338498.3358640","title":"There Are 10 Types of Vectors (and Polynomials)","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Verifiable secret sharing; Gas meter prover; Mathematical proof; Soundness; Computer science; Theoretical computer science; Protocol (science); Succinctness; Bounded function; Discrete mathematics; Mathematics; Programming language","score_opus":0.0067553331225208985,"score_gpt":0.20708019902213123,"score_spread":0.20032486589961035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983235682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06460386,0.0018250507,0.8960311,0.0021122536,0.0004938038,0.00040925614,0.0009352099,0.004563171,0.029026277],"genre_scores_gemma":[0.67077553,0.0013130308,0.2968662,0.0007801892,0.00019859546,0.0005738867,0.0018814615,0.0007686438,0.026842425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939387,0.0014492224,0.00061948167,0.001160773,0.001942367,0.00088955427],"domain_scores_gemma":[0.9951143,0.0013412682,0.0006509854,0.0021498862,0.0005385305,0.00020495009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030013735,0.0009016615,0.0008816389,0.00089283974,0.0015318312,0.0028818222,0.0025045876,0.0015749307,0.014024289],"category_scores_gemma":[0.006969671,0.0008748827,0.0011743344,0.0013347619,0.003214583,0.009993105,0.004582128,0.0032685038,0.0044636074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080320355,0.0001453459,0.0020930008,0.00054223504,0.00008769589,0.00033004014,0.0006407561,0.0057653887,0.014061544,0.786581,0.008720201,0.18022954],"study_design_scores_gemma":[0.00022729395,0.00069445174,0.0011847931,0.00033734247,0.00014064406,0.0011415214,0.00066168176,0.051281277,0.0854676,0.6637698,0.19477126,0.00032253392],"about_ca_topic_score_codex":0.0006782997,"about_ca_topic_score_gemma":0.0009398942,"teacher_disagreement_score":0.014024289,"about_ca_system_score_codex":0.0013439839,"about_ca_system_score_gemma":0.001574451,"threshold_uncertainty_score":0.04691589},"labels":[],"label_agreement":null},{"id":"W2984195392","doi":"10.1145/3319535.3354219","title":"SAMPL","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Office of Experimental Program to Stimulate Competitive Research; Army Research Office; Australian Government; New Mexico State University; National Science Foundation","keywords":"Transparency (behavior); Audit; Business; Information privacy; Safeguarding; Computer security; Confidentiality; Internet privacy; Computer science; Accounting","score_opus":0.004741601653623746,"score_gpt":0.1959307799747768,"score_spread":0.19118917832115304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984195392","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032477144,0.0015947538,0.09906771,0.0062048836,0.0029317315,0.00056361064,0.014263443,0.058065984,0.8140602],"genre_scores_gemma":[0.0478637,0.0021033662,0.05023367,0.003721826,0.0011275136,0.0005535473,0.03055882,0.014505416,0.84933215],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720484,0.00053333753,0.00021100235,0.0006163602,0.0010430795,0.00039130892],"domain_scores_gemma":[0.99505687,0.0006626936,0.00025765834,0.0021705565,0.0013664225,0.00048582978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023371796,0.0013884142,0.000819157,0.0023169133,0.0021567806,0.0077338587,0.0032083169,0.0030807792,0.48468673],"category_scores_gemma":[0.008207523,0.0008715683,0.0010785682,0.0023193825,0.0010824465,0.007849455,0.0069852485,0.0026354138,0.41601658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027689166,0.000097455595,0.00085349334,0.0005148812,0.00002787031,0.00038800258,0.00038735388,0.00089601835,0.002481751,0.103395,0.5967623,0.29391894],"study_design_scores_gemma":[0.000018277664,0.00002344212,0.0001886609,0.00008320804,0.0000058063397,0.00023309558,0.000071754985,0.0010912891,0.0010395555,0.014144746,0.98308384,0.000016352818],"about_ca_topic_score_codex":0.0018905965,"about_ca_topic_score_gemma":0.0018065304,"teacher_disagreement_score":0.48468673,"about_ca_system_score_codex":0.0016666204,"about_ca_system_score_gemma":0.0025895354,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2986668581","doi":"10.1109/jiot.2019.2953144","title":"Context-Aware Adaptive Remote Access for IoT Applications","year":2019,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Context (archaeology); Access control; Ubiquitous computing; Context awareness; Edge computing; The Internet; Distributed computing; Enhanced Data Rates for GSM Evolution; Data access; Internet of Things; Computer security; Computer network; Telecommunications; World Wide Web; Human–computer interaction; Database","score_opus":0.02847633461750033,"score_gpt":0.29500605984006956,"score_spread":0.26652972522256924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986668581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10303221,0.003842172,0.8801298,0.00054757134,0.00027666223,0.00030242733,0.000074052805,0.0014615988,0.010333519],"genre_scores_gemma":[0.97300774,0.0005475018,0.02507897,0.000100232144,0.00006434758,0.00005979857,0.00004248591,0.00001584663,0.0010831825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991934,0.00020836238,0.000072047056,0.00012254613,0.0002630345,0.00014061603],"domain_scores_gemma":[0.99939835,0.00014843632,0.00007814484,0.00020107905,0.00011910076,0.000054865483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059163506,0.00034732049,0.00043868157,0.00032183086,0.0006362722,0.0008394727,0.000804402,0.000531423,0.0012418092],"category_scores_gemma":[0.0015315806,0.00014050986,0.0003543482,0.00035666773,0.0005061728,0.0019430952,0.0015970598,0.0010268922,0.00031929126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015204705,0.0006039518,0.0047600428,0.00072356395,0.00014889297,0.0015443612,0.0010138756,0.119561896,0.25897267,0.18406102,0.009813212,0.417276],"study_design_scores_gemma":[0.00008478636,0.00034804567,0.0018098162,0.00007598396,0.00008647495,0.0013250947,0.00023132234,0.88965935,0.042735938,0.038500283,0.025062876,0.00007994637],"about_ca_topic_score_codex":0.00053348026,"about_ca_topic_score_gemma":0.0005686632,"teacher_disagreement_score":0.0012418092,"about_ca_system_score_codex":0.00036325437,"about_ca_system_score_gemma":0.0005138213,"threshold_uncertainty_score":0.004154265},"labels":[],"label_agreement":null},{"id":"W2987473969","doi":"10.1109/tnsm.2019.2952462","title":"An Extended Framework of Privacy-Preserving Computation With Flexible Access Control","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Postdoctoral Program for Innovative Talents; Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; China Postdoctoral Science Foundation; Academy of Finland; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Access control; Cloud computing; Information privacy; Computation; Upload; Division (mathematics); Cryptography; Multiplication (music); Distributed computing; Security analysis; Computer network; Computer security; Algorithm","score_opus":0.011460808517467386,"score_gpt":0.26026823834325036,"score_spread":0.24880742982578297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987473969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016214237,0.00058976683,0.97448164,0.0005618883,0.000112625065,0.0001451818,0.00012322795,0.00028832178,0.007483154],"genre_scores_gemma":[0.735839,0.0011137432,0.25286198,0.00033933722,0.0002987321,0.0002862022,0.00017374527,0.000090870286,0.008996387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99452317,0.0014231524,0.00036239112,0.0011126191,0.001743307,0.000835437],"domain_scores_gemma":[0.99695957,0.0009420838,0.00023077984,0.0011921542,0.00047078592,0.0002046658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032254648,0.00059920736,0.0010365882,0.0010018675,0.0016015788,0.0035717613,0.0024516596,0.0013373883,0.0034479878],"category_scores_gemma":[0.005077404,0.0003376804,0.0015528315,0.0021856867,0.0033339695,0.0062316163,0.0036575536,0.0026441403,0.0006888447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019036734,0.00006218973,0.00037353425,0.000098121105,0.00003956685,0.00026908642,0.00033621132,0.06299809,0.004682608,0.8952128,0.0020148184,0.033722516],"study_design_scores_gemma":[0.00008314286,0.00014876267,0.0001951981,0.000033815046,0.000043662334,0.00035749035,0.0000854431,0.57069904,0.004491957,0.40525624,0.01853987,0.0000653848],"about_ca_topic_score_codex":0.0023225457,"about_ca_topic_score_gemma":0.001045593,"teacher_disagreement_score":0.0035717613,"about_ca_system_score_codex":0.0018782787,"about_ca_system_score_gemma":0.0029252935,"threshold_uncertainty_score":0.017058074},"labels":[],"label_agreement":null},{"id":"W2990372367","doi":"10.1109/access.2019.2954043","title":"Achieving Efficient and Privacy-Preserving Multi-Keyword Conjunctive Query Over Cloud","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; New Brunswick Innovation Foundation","keywords":"Computer science; Cloud computing; Encryption; Query optimization; Web search query; Homomorphic encryption; Query expansion; Sargable; Web query classification; Range query (database); Keyword search; Scheme (mathematics); Data mining; Information retrieval; Database; Computer security; Search engine","score_opus":0.02232121973034711,"score_gpt":0.2899361421350249,"score_spread":0.26761492240467777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990372367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05397971,0.0010346998,0.93757653,0.00067554764,0.000084446554,0.0003232455,0.00052022515,0.0009938102,0.0048116404],"genre_scores_gemma":[0.84774053,0.0007445882,0.14783445,0.00038179982,0.00011358764,0.00015952095,0.0004470796,0.0000650627,0.0025132957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937279,0.0010786663,0.00056216907,0.00086157914,0.0026325868,0.0011370594],"domain_scores_gemma":[0.9957385,0.0015100604,0.00045139831,0.0012337737,0.0008147225,0.00025148073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002621274,0.0006963886,0.0019029177,0.00089935435,0.0016244806,0.0024912828,0.0020811756,0.001186982,0.0017001332],"category_scores_gemma":[0.0055865757,0.00037935164,0.0011108113,0.003072218,0.0010464336,0.0057327407,0.003301931,0.0012626649,0.0006552843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028679986,0.00083701167,0.00723054,0.0012217668,0.0005265122,0.0028405588,0.0021244655,0.17768276,0.18950586,0.2341258,0.025101408,0.3559353],"study_design_scores_gemma":[0.000164344,0.00033510607,0.00091461063,0.000027578524,0.00013250574,0.0020751436,0.00054172147,0.8838218,0.045950755,0.057570018,0.008363595,0.00010290645],"about_ca_topic_score_codex":0.004125249,"about_ca_topic_score_gemma":0.0031171325,"teacher_disagreement_score":0.004125249,"about_ca_system_score_codex":0.0014865262,"about_ca_system_score_gemma":0.0030895171,"threshold_uncertainty_score":0.013862789},"labels":[],"label_agreement":null},{"id":"W2990561397","doi":"10.1093/comjnl/bxz128","title":"A Multivariate Blind Ring Signature Scheme","year":2019,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"University of Wollongong; Concordia University of Edmonton","keywords":"Ring signature; Blind signature; Computer science; Anonymity; Digital signature; Cryptography; Ring (chemistry); Electronic voting; Scheme (mathematics); Signature (topology); Public-key cryptography; Computer security; Theoretical computer science; Encryption; Voting; Mathematics","score_opus":0.014653300505028798,"score_gpt":0.2441769203272032,"score_spread":0.2295236198221744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990561397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10629419,0.0006373489,0.8556506,0.0016570434,0.00051115034,0.00047096962,0.0011659757,0.0026693547,0.03094332],"genre_scores_gemma":[0.79349786,0.00047943433,0.18130088,0.00038052126,0.00028772274,0.00021691233,0.00060879486,0.00009156571,0.023136353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982754,0.00044524172,0.00016650118,0.0003089607,0.0005583879,0.00024556994],"domain_scores_gemma":[0.9985655,0.00020735654,0.00030472578,0.00045973837,0.0002577797,0.00020489287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012304398,0.00038309343,0.0007893389,0.00081736094,0.0008859112,0.0016979891,0.000878088,0.0010990917,0.008181875],"category_scores_gemma":[0.0017125119,0.00019074114,0.0005788457,0.0011687,0.0011337256,0.0029318235,0.0020196857,0.0011451592,0.0022103167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089093245,0.00024815873,0.00072702405,0.00033600794,0.00005398676,0.00028209013,0.0003050734,0.018385246,0.097154364,0.75777024,0.0089026755,0.11494423],"study_design_scores_gemma":[0.000552466,0.001283365,0.0016005007,0.00008488735,0.00012221611,0.0019592976,0.00013734734,0.29114836,0.1608134,0.33390975,0.20793489,0.0004535664],"about_ca_topic_score_codex":0.0002724485,"about_ca_topic_score_gemma":0.00016951078,"teacher_disagreement_score":0.008181875,"about_ca_system_score_codex":0.0008291095,"about_ca_system_score_gemma":0.0013258979,"threshold_uncertainty_score":0.027371109},"labels":[],"label_agreement":null},{"id":"W2991484241","doi":"10.5539/jmr.v11n6p77","title":"Provable Security of The Generalized ElGamal Signature Scheme","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"ElGamal encryption; ElGamal signature scheme; Merkle signature scheme; Schnorr signature; Random oracle; Ring signature; Mathematics; Signature (topology); Scheme (mathematics); Digital Signature Algorithm; Theoretical computer science; Blind signature; Digital signature; Computer science; Public-key cryptography; Computer security; Hash function; Encryption","score_opus":0.04062193731039122,"score_gpt":0.33820434009889333,"score_spread":0.2975824027885021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991484241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23459597,0.008056601,0.62770313,0.008912819,0.0013628252,0.00045622772,0.0015316328,0.00203845,0.11534231],"genre_scores_gemma":[0.9489132,0.0014504889,0.036252577,0.00086365326,0.00051554694,0.00020596356,0.00041467158,0.00008949819,0.011294399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557686,0.0009870178,0.00025348758,0.0010258405,0.0015873102,0.00056950795],"domain_scores_gemma":[0.9967649,0.0014223314,0.0003327521,0.0008483795,0.00042374883,0.00020800963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017825689,0.0008032749,0.0011270167,0.00075953885,0.001785371,0.004002509,0.001495206,0.001545409,0.0039956737],"category_scores_gemma":[0.0038593686,0.00053846167,0.0015316155,0.0010651428,0.0045466167,0.0058573503,0.0044246353,0.0046651866,0.00087511155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031612537,0.00007079845,0.0002840087,0.00030244052,0.00009872956,0.0007202789,0.00079807336,0.006708983,0.0104202805,0.9581244,0.0030238212,0.019132169],"study_design_scores_gemma":[0.00019795606,0.00012334091,0.000479399,0.000083785344,0.00009824642,0.00086876185,0.00015023038,0.023944214,0.014511291,0.92914397,0.030292649,0.00010615831],"about_ca_topic_score_codex":0.00067818817,"about_ca_topic_score_gemma":0.000415,"teacher_disagreement_score":0.004002509,"about_ca_system_score_codex":0.0021362281,"about_ca_system_score_gemma":0.0024622679,"threshold_uncertainty_score":0.015499532},"labels":[],"label_agreement":null},{"id":"W2996014072","doi":"10.1109/iemcon.2019.8936186","title":"Application of Blockchain to Patient-Centric Access Control in Medical Data Management Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Blockchain; Encryption; Computer science; Access control; Computer security; Data sharing; Attribute-based encryption; Enforcement; Role-based access control; Public-key cryptography","score_opus":0.012595649410774552,"score_gpt":0.2680978775533673,"score_spread":0.2555022281425927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996014072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08695668,0.0009330344,0.8969762,0.00293274,0.00019831397,0.00031963224,0.00009611141,0.0006806315,0.010906635],"genre_scores_gemma":[0.92196965,0.0005787566,0.0731528,0.0001463827,0.00006557356,0.00009834645,0.000064623644,0.000028978648,0.0038949004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976284,0.0011099657,0.00015475132,0.00019756713,0.0007086036,0.00020078478],"domain_scores_gemma":[0.9973686,0.0011444512,0.00019801849,0.0005688218,0.000503276,0.00021690887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031693818,0.00021389408,0.00042617394,0.000508757,0.00086242036,0.0012521424,0.00067084195,0.0008335861,0.0025845093],"category_scores_gemma":[0.004763512,0.00019488354,0.00029027928,0.00067749986,0.00089608296,0.0016840975,0.0019304298,0.0007917178,0.00032684466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005713557,0.00032565938,0.0038451015,0.00032087616,0.00012764552,0.0013332039,0.0010111965,0.3977793,0.031080596,0.33550578,0.004399357,0.22369994],"study_design_scores_gemma":[0.00010440255,0.00021213849,0.0003613984,0.00005162631,0.00002818655,0.00026551855,0.000092932045,0.8685781,0.013344048,0.097169556,0.019760774,0.00003138469],"about_ca_topic_score_codex":0.0019376121,"about_ca_topic_score_gemma":0.0016668309,"teacher_disagreement_score":0.0031693818,"about_ca_system_score_codex":0.0007047635,"about_ca_system_score_gemma":0.0018180055,"threshold_uncertainty_score":0.016761541},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key exchange; Quantum computer; Network packet; Testbed; Cryptography; Computer network; Distributed computing; Public-key cryptography; Computer engineering; Quantum; Algorithm; Encryption","score_opus":0.013379104501830772,"score_gpt":0.2306112219525647,"score_spread":0.21723211745073392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999209598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44211417,0.0049072355,0.27199855,0.004043781,0.0026443582,0.00045270514,0.0030341435,0.020910537,0.24989446],"genre_scores_gemma":[0.9562747,0.0003776736,0.027432602,0.00035433922,0.00015258085,0.00009573849,0.0016095605,0.0011525806,0.012550257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928483,0.0024970903,0.0002807769,0.0004644669,0.0029428215,0.0009665815],"domain_scores_gemma":[0.99072814,0.002972772,0.00027414967,0.0038358099,0.001831284,0.00035786768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00531018,0.0008013902,0.0011970111,0.0010517436,0.00092064554,0.003083635,0.0020322236,0.0018807317,0.026451258],"category_scores_gemma":[0.015922545,0.0002801856,0.00051285664,0.0013170814,0.0018435154,0.005689137,0.003225719,0.001959082,0.0059210435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040041534,0.0011113277,0.0046110125,0.0013722384,0.00021703725,0.0001972334,0.00030685982,0.20936498,0.024462964,0.48171875,0.050992552,0.22164088],"study_design_scores_gemma":[0.00022237854,0.0014458039,0.0016893225,0.00024570158,0.00008138206,0.00019288236,0.0002329537,0.69108397,0.06728812,0.19487141,0.042541213,0.00010493954],"about_ca_topic_score_codex":0.0006687463,"about_ca_topic_score_gemma":0.000735788,"teacher_disagreement_score":0.026451258,"about_ca_system_score_codex":0.0019295793,"about_ca_system_score_gemma":0.0019067308,"threshold_uncertainty_score":0.08848828},"labels":[],"label_agreement":null},{"id":"W2999709511","doi":"10.1109/pst47121.2019.8949049","title":"Achieving Privacy-Preserving Edit Distance Query in Cloud and Its Application to Genomic Data","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Cloud computing; Edit distance; Outsourcing; Encryption; Server; Block (permutation group theory); Information privacy; Scheme (mathematics); Computation; Distributed computing; Theoretical computer science; Database; Data mining; Computer security; Computer network; Algorithm; Operating system; Mathematics","score_opus":0.017491418143577485,"score_gpt":0.25836815504245947,"score_spread":0.24087673689888198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999709511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05157736,0.0007384783,0.94299245,0.0012138026,0.000108658496,0.00025554394,0.00029216087,0.00055372645,0.0022678396],"genre_scores_gemma":[0.8577238,0.00055218977,0.1385468,0.00031675285,0.0001077422,0.0001534644,0.00035073757,0.00004607248,0.0022024594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994304,0.0013794415,0.00044394901,0.0009752438,0.002255372,0.0006419944],"domain_scores_gemma":[0.9939038,0.0016347795,0.00059872295,0.0028597396,0.00074625,0.00025676723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029937795,0.0005010224,0.0012525092,0.00073373335,0.0015776796,0.0019708234,0.0018070533,0.0015739803,0.0012207929],"category_scores_gemma":[0.0068959147,0.00026845981,0.0009758236,0.0020834913,0.001326441,0.0046270248,0.0038246145,0.0016333674,0.0004330934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00260633,0.00066341,0.007132037,0.0005702363,0.0002750479,0.002960084,0.00169808,0.18818347,0.11101516,0.37696776,0.013592513,0.2943359],"study_design_scores_gemma":[0.00014818012,0.0003121848,0.0010506096,0.000029938186,0.00007419637,0.0025742233,0.00039930546,0.83404213,0.05756889,0.093290895,0.010407713,0.00010173408],"about_ca_topic_score_codex":0.0019278299,"about_ca_topic_score_gemma":0.0011257076,"teacher_disagreement_score":0.0029937795,"about_ca_system_score_codex":0.0016590371,"about_ca_system_score_gemma":0.0025266344,"threshold_uncertainty_score":0.015832782},"labels":[],"label_agreement":null},{"id":"W3002779531","doi":"10.1109/tcc.2020.2968893","title":"DNA Similarity Search With Access Control Over Encrypted Cloud Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; DNA computing; Cloud computing; Cluster analysis; Similarity (geometry); Data mining; Outsourcing; Nearest neighbor search; Theoretical computer science; Algorithm; Computer security; Artificial intelligence; Image (mathematics)","score_opus":0.06466991155781597,"score_gpt":0.3027607503170469,"score_spread":0.23809083875923093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002779531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17870986,0.00055250333,0.81454515,0.0004542045,0.000084399726,0.0002671659,0.0003696603,0.0009665055,0.0040504625],"genre_scores_gemma":[0.9228529,0.00015183842,0.074035764,0.00011149769,0.00003300256,0.00008122505,0.00020595308,0.00003367852,0.002494207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964251,0.0005512196,0.0004106039,0.00065670535,0.0013048965,0.0006513376],"domain_scores_gemma":[0.99566,0.0013095349,0.0005594226,0.0015477452,0.0007331732,0.00019014782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013095365,0.00039388638,0.0010048533,0.0007416314,0.00095078204,0.0017443525,0.0015259854,0.0008472052,0.0021540516],"category_scores_gemma":[0.0054427586,0.00022650693,0.00064091716,0.0018421664,0.0009354255,0.003596667,0.0021410547,0.00088206877,0.00057200686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039293496,0.0006260482,0.0058397497,0.0003886947,0.00013276824,0.0011378466,0.000848725,0.2671663,0.11652585,0.22451338,0.006303187,0.37258816],"study_design_scores_gemma":[0.000135692,0.00028993818,0.0005427597,0.000015639598,0.000033160377,0.00058097544,0.00013651024,0.9066215,0.04187457,0.04570468,0.0040284675,0.00003611839],"about_ca_topic_score_codex":0.0022273753,"about_ca_topic_score_gemma":0.0017970204,"teacher_disagreement_score":0.0022273753,"about_ca_system_score_codex":0.001544102,"about_ca_system_score_gemma":0.00210507,"threshold_uncertainty_score":0.011203289},"labels":[],"label_agreement":null},{"id":"W3003329346","doi":"10.1007/978-3-030-44223-1_12","title":"Decryption Failure Is More Likely After Success","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Computer science; Adversary; Standardization; NIST; Encryption; Computer security; Key (lock); Semantic security; Public-key cryptography; Theoretical computer science; Algorithm; Attribute-based encryption; Natural language processing","score_opus":0.011590249955672193,"score_gpt":0.2366903117644272,"score_spread":0.225100061808755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003329346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887687,0.0019515455,0.014572517,0.0035716528,0.0010575531,0.00018530576,0.0056905197,0.0007944026,0.08448942],"genre_scores_gemma":[0.98608404,0.00038367874,0.0009674194,0.00035831303,0.0003572674,0.000027784688,0.0013185398,0.00017862757,0.010324289],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797267,0.0003372477,0.00023197227,0.00037170397,0.0004955599,0.0005907271],"domain_scores_gemma":[0.969215,0.01512281,0.0077473465,0.0038486395,0.0015890771,0.0024770806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017589687,0.00040948179,0.0006909124,0.0012658703,0.0007821938,0.0014629604,0.00039009535,0.00123846,0.039411396],"category_scores_gemma":[0.025267944,0.00014261369,0.0005898294,0.0009031219,0.0007708656,0.0017810091,0.001115546,0.0015945825,0.008023307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005707864,0.0007560851,0.74577653,0.0008201339,0.00023314683,0.0058196005,0.0009652127,0.003573112,0.010165179,0.017775852,0.043444145,0.16496316],"study_design_scores_gemma":[0.00038255213,0.0032915985,0.72894764,0.0005998003,0.0006456094,0.053504195,0.0033862148,0.01354764,0.026395645,0.07456781,0.0944666,0.00026462701],"about_ca_topic_score_codex":0.0006438464,"about_ca_topic_score_gemma":0.00060559297,"teacher_disagreement_score":0.039411396,"about_ca_system_score_codex":0.00038331552,"about_ca_system_score_gemma":0.00045749953,"threshold_uncertainty_score":0.13184428},"labels":[],"label_agreement":null},{"id":"W3004178638","doi":"10.1007/s10623-021-00857-9","title":"A scalable post-quantum hash-based group signature","year":2021,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Computer science; Scalability; Group signature; Signature (topology); Computer network; Computer security; Mathematics; Public-key cryptography; Database; Encryption","score_opus":0.019475789153454746,"score_gpt":0.23896928683658733,"score_spread":0.2194934976831326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004178638","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033675157,0.00056662067,0.9443347,0.00090496044,0.0005758028,0.00046870238,0.0007834615,0.0043606884,0.0143299205],"genre_scores_gemma":[0.5368488,0.00037795206,0.43687043,0.0006155546,0.000513931,0.00042806513,0.0016092533,0.00030812036,0.022427866],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974675,0.00039133066,0.00014348769,0.00039547993,0.0013288457,0.0002733523],"domain_scores_gemma":[0.99801505,0.00029942946,0.00012241189,0.0010156555,0.00039083662,0.00015661228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010686456,0.00074252835,0.0016462691,0.0008700478,0.000994575,0.0019447013,0.0019647887,0.0012289382,0.012595144],"category_scores_gemma":[0.0023391608,0.00039438365,0.00074681174,0.0014635343,0.0010894041,0.0036372084,0.0045958287,0.0014182742,0.005531549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026990813,0.00064491195,0.001261528,0.0005582919,0.00020550934,0.0004079292,0.00026905574,0.052262675,0.121717766,0.28051108,0.033773735,0.5056885],"study_design_scores_gemma":[0.00061106804,0.0010026194,0.00072128186,0.00005481777,0.00014497731,0.00070420787,0.000143102,0.66707736,0.065365724,0.22272143,0.04129929,0.00015413795],"about_ca_topic_score_codex":0.0007126932,"about_ca_topic_score_gemma":0.0010205986,"teacher_disagreement_score":0.012595144,"about_ca_system_score_codex":0.0010021419,"about_ca_system_score_gemma":0.0024361752,"threshold_uncertainty_score":0.04213494},"labels":[],"label_agreement":null},{"id":"W3005846473","doi":"10.4018/ijsst.2019070101","title":"Constraint-Based Privacy Preserving-Path Computation Element","year":2019,"lang":"en","type":"article","venue":"International Journal of Smart Security Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Path (computing); Shortest path problem; Theoretical computer science; Computation; Computer network; Homomorphic secret sharing; Secure multi-party computation; Topology (electrical circuits); Distributed computing; Mathematics; Algorithm; Graph","score_opus":0.011329636354646972,"score_gpt":0.2638498947974363,"score_spread":0.25252025844278936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005846473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020022605,0.00014837082,0.9692768,0.00034441138,0.000053925836,0.000228992,0.00036872047,0.0010274011,0.0085287765],"genre_scores_gemma":[0.5018456,0.0003077729,0.48505682,0.00026590296,0.000069675734,0.00027903728,0.0008836997,0.00020208448,0.011089364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974982,0.00048675778,0.00016644773,0.00052714127,0.0010001577,0.0003211851],"domain_scores_gemma":[0.99686086,0.00072156213,0.00019824979,0.0017040465,0.00040157436,0.0001138355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010729501,0.0004921772,0.00084375235,0.00053777744,0.0012480749,0.0022037525,0.0025469433,0.0012083511,0.006653125],"category_scores_gemma":[0.0036559256,0.0003204562,0.0010168164,0.0016020157,0.0014297285,0.004404851,0.00360898,0.0021937485,0.0018592037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009908465,0.0003102973,0.0010332349,0.00038587963,0.00013611016,0.0006585449,0.0005335514,0.12200706,0.0381979,0.63210136,0.012367677,0.19127744],"study_design_scores_gemma":[0.00011147428,0.00025096285,0.0003095889,0.00003816785,0.000064589374,0.0009069162,0.00015843447,0.66614133,0.06686081,0.22665899,0.038413715,0.00008502494],"about_ca_topic_score_codex":0.0014631498,"about_ca_topic_score_gemma":0.0015699293,"teacher_disagreement_score":0.006653125,"about_ca_system_score_codex":0.0011424517,"about_ca_system_score_gemma":0.0021979075,"threshold_uncertainty_score":0.02225691},"labels":[],"label_agreement":null},{"id":"W3006329246","doi":"10.4018/ijsst.2019070102","title":"Fully Homomorphic Encryption Without Noise","year":2019,"lang":"en","type":"article","venue":"International Journal of Smart Security Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"Homomorphic encryption; Computer science; Ciphertext; Encryption; Scheme (mathematics); Probabilistic encryption; Reduction (mathematics); Theoretical computer science; Deterministic encryption; Cryptosystem; Noise (video); Algorithm; Arithmetic; Mathematics; Computer security; Image (mathematics); Artificial intelligence","score_opus":0.007657240425800848,"score_gpt":0.23976052937137216,"score_spread":0.2321032889455713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006329246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085343786,0.0015544445,0.9016754,0.00030254762,0.00018082664,0.00015040745,0.000279009,0.00091340614,0.009600197],"genre_scores_gemma":[0.78460896,0.00077345304,0.20427813,0.00029607126,0.000129437,0.00011667648,0.00039315232,0.0000669175,0.009337146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874324,0.00019993928,0.000094465264,0.00019522462,0.0006521196,0.000115101284],"domain_scores_gemma":[0.998787,0.00022971208,0.000118015596,0.0006315158,0.00019537065,0.0000384327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004930962,0.00032735858,0.0006742316,0.00028259715,0.00032584718,0.0010298888,0.0006626918,0.0006760229,0.0015717467],"category_scores_gemma":[0.0012628549,0.00022788398,0.00036836974,0.00040127555,0.0005138845,0.0030196386,0.0014058655,0.0007897738,0.00076306507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011314586,0.00030497494,0.0012270071,0.00082431943,0.00015544068,0.0012819974,0.00046813916,0.03065514,0.2963272,0.33489057,0.004118664,0.32861504],"study_design_scores_gemma":[0.00019800711,0.0013188855,0.0024781253,0.00019894747,0.0001564714,0.006701706,0.00013573808,0.4421159,0.30919284,0.17063032,0.06668135,0.00019173123],"about_ca_topic_score_codex":0.000088776156,"about_ca_topic_score_gemma":0.00009508076,"teacher_disagreement_score":0.0015717467,"about_ca_system_score_codex":0.00023408716,"about_ca_system_score_gemma":0.0005056127,"threshold_uncertainty_score":0.0052580237},"labels":[],"label_agreement":null},{"id":"W3007870404","doi":"10.1109/tcc.2020.2975175","title":"Towards Secure and Efficient Equality Conjunction Search Over Outsourced Databases","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encryption; Conjunction (astronomy); Bloom filter; Class (philosophy); Set (abstract data type); Ciphertext; Database; Cloud computing; Filter (signal processing); False positive paradox; Upload; Theoretical computer science; Data mining; Algorithm; Computer security; Programming language","score_opus":0.05208532687788587,"score_gpt":0.2945851023141564,"score_spread":0.24249977543627055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007870404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10419839,0.0011074486,0.8869993,0.000597412,0.00004133072,0.00024365331,0.000625721,0.0024386754,0.003747973],"genre_scores_gemma":[0.7696989,0.0006703599,0.22553122,0.00029864616,0.0000891543,0.0001492396,0.0009620955,0.00016593163,0.0024343769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992504,0.0015779368,0.0006870914,0.0008035866,0.0033865832,0.0010408312],"domain_scores_gemma":[0.9925485,0.0030887332,0.00073967414,0.0025737295,0.00080157444,0.00024778224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029166415,0.0007834425,0.0022931776,0.0013676124,0.001022322,0.003707501,0.002610884,0.0010535964,0.002725829],"category_scores_gemma":[0.008899659,0.00074904127,0.0011173743,0.004030347,0.0015588121,0.0076208743,0.00620684,0.002255321,0.001168326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037927502,0.000732392,0.006932095,0.000708017,0.0002930078,0.0013023381,0.0011419588,0.20684244,0.052739,0.17241095,0.012282676,0.54082245],"study_design_scores_gemma":[0.00021551693,0.00021385057,0.0008017114,0.00003077767,0.00007665579,0.0006200915,0.00041149958,0.87969834,0.026788607,0.086892165,0.0042038495,0.00004690426],"about_ca_topic_score_codex":0.003495261,"about_ca_topic_score_gemma":0.002890205,"teacher_disagreement_score":0.003707501,"about_ca_system_score_codex":0.0015385923,"about_ca_system_score_gemma":0.0035343578,"threshold_uncertainty_score":0.015424907},"labels":[],"label_agreement":null},{"id":"W3011469608","doi":"10.4018/ijsst.2020010101","title":"An End to End Cloud Computing Privacy Framework Using Blind Processing","year":2020,"lang":"en","type":"article","venue":"International Journal of Smart Security Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"Computer science; Encryption; Cloud computing; Database; Key (lock); Computer security; Access control; Information privacy; Revocation; Overhead (engineering)","score_opus":0.03591876565679413,"score_gpt":0.3230828479955975,"score_spread":0.28716408233880336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011469608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009852324,0.00040144403,0.97859806,0.0012082272,0.00014408496,0.00027724466,0.00014542155,0.001122221,0.008250847],"genre_scores_gemma":[0.5774919,0.0007776884,0.40671566,0.0008056635,0.00019791508,0.00026250602,0.00034990636,0.0002764309,0.01312241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969747,0.0005869721,0.00017704799,0.0004893662,0.0012083335,0.0005635599],"domain_scores_gemma":[0.9984061,0.00019792981,0.000114410715,0.0005799438,0.00041334258,0.00028835167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025516588,0.0005812631,0.0009127824,0.000665492,0.0025752638,0.004693538,0.0032706903,0.0018834549,0.002836283],"category_scores_gemma":[0.002239409,0.0004480885,0.0010959525,0.0011178746,0.0016719359,0.005659841,0.0057442905,0.002833059,0.0013108255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006500035,0.0004034297,0.0012545584,0.00020766346,0.00010751884,0.0013707749,0.0005787597,0.05631331,0.015374691,0.8309198,0.01935887,0.07346066],"study_design_scores_gemma":[0.000058416168,0.000101986145,0.0003578632,0.000059759044,0.00004453843,0.00083231356,0.0002634,0.7770257,0.011828598,0.1631329,0.046220623,0.000073871146],"about_ca_topic_score_codex":0.00376236,"about_ca_topic_score_gemma":0.0030844412,"teacher_disagreement_score":0.004693538,"about_ca_system_score_codex":0.0017294069,"about_ca_system_score_gemma":0.0034148637,"threshold_uncertainty_score":0.013494611},"labels":[],"label_agreement":null},{"id":"W3012040108","doi":"10.1109/southeastcon42311.2019.9020398","title":"A Public Key Encryption System Derived from the Pascal Parallelogram","year":2019,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Knapsack problem; Cryptosystem; Public-key cryptography; Key (lock); Computer science; Key encapsulation; Cryptography; Encryption; Pascal (unit); Theoretical computer science; Hybrid cryptosystem; Mathematics; Key distribution; Computer security; Algorithm","score_opus":0.024187043664101696,"score_gpt":0.20824685119218092,"score_spread":0.1840598075280792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012040108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015533644,0.00086858164,0.90790075,0.0014988106,0.000814013,0.00051090505,0.00044533084,0.0019172849,0.07051068],"genre_scores_gemma":[0.3441088,0.0015471276,0.6150406,0.0007622684,0.0004902845,0.0005476743,0.0008409601,0.00033672957,0.036325503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930525,0.00013411054,0.00005411656,0.00010794805,0.00031530365,0.0000832339],"domain_scores_gemma":[0.9995921,0.00007817982,0.0000430326,0.00014574578,0.000111814756,0.000029218152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004885037,0.00041220218,0.0004841607,0.0007490245,0.0010381463,0.0013690776,0.0007515892,0.00063573994,0.005777652],"category_scores_gemma":[0.001722086,0.00025203434,0.0005503217,0.0011256809,0.0010335866,0.0022636016,0.0014721832,0.0015813359,0.0033880894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003145847,0.00010388604,0.00026190028,0.00029800335,0.000021985976,0.00064156496,0.000300772,0.0118909255,0.016960202,0.74413157,0.020496579,0.20457806],"study_design_scores_gemma":[0.00025072065,0.00039759552,0.00053777645,0.00010696516,0.000043347238,0.0031326683,0.000118106655,0.15387723,0.040552363,0.28579614,0.5150471,0.00013993485],"about_ca_topic_score_codex":0.0007807706,"about_ca_topic_score_gemma":0.00055251527,"teacher_disagreement_score":0.005777652,"about_ca_system_score_codex":0.0007060808,"about_ca_system_score_gemma":0.0013374903,"threshold_uncertainty_score":0.019328177},"labels":[],"label_agreement":null},{"id":"W3012333974","doi":"10.1109/tvt.2020.2980777","title":"DAPA: A Decentralized, Accountable, and Privacy-Preserving Architecture for Car Sharing Services","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of New Brunswick; University of Waterloo","funders":"","keywords":"Computer security; Accountability; Server; Single point of failure; Service provider; Computer science; Verifiable secret sharing; Information privacy; Service (business); Secret sharing; Internet privacy; Cryptography; Computer network; Business; Law","score_opus":0.01404856140169075,"score_gpt":0.23726524651607467,"score_spread":0.22321668511438392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012333974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098337,0.0005398686,0.88305503,0.00072539155,0.00015604803,0.0006696531,0.00032706358,0.0095503945,0.006639509],"genre_scores_gemma":[0.8559304,0.0002268183,0.13734166,0.00019399927,0.000048208974,0.0003580276,0.0003962829,0.000099765835,0.0054048626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900216,0.00021111651,0.00006953145,0.00023535112,0.0003194155,0.00016249396],"domain_scores_gemma":[0.9988324,0.00015571133,0.00014248134,0.00041360583,0.00026714333,0.00018857772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010445307,0.0005274088,0.00055298756,0.00048045564,0.0013004688,0.0016811009,0.0031061869,0.0010653406,0.0023464542],"category_scores_gemma":[0.0014965144,0.00042051103,0.00057078694,0.0006124971,0.0010557239,0.0027397366,0.0034676574,0.0015650473,0.0007669211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018009751,0.00088660413,0.009935033,0.0007731579,0.00033488005,0.0015902312,0.001101375,0.46910757,0.06870843,0.17695594,0.028335158,0.24047066],"study_design_scores_gemma":[0.0001269879,0.0002527709,0.001007174,0.000018382241,0.000065221815,0.0003418966,0.00008816251,0.94472075,0.009521951,0.018286461,0.025510881,0.00005946595],"about_ca_topic_score_codex":0.0041622026,"about_ca_topic_score_gemma":0.0028474864,"teacher_disagreement_score":0.0041622026,"about_ca_system_score_codex":0.0012554491,"about_ca_system_score_gemma":0.0027444947,"threshold_uncertainty_score":0.009108961},"labels":[],"label_agreement":null},{"id":"W3012623189","doi":"10.14778/3407790.3407814","title":"Efficient oblivious database joins","year":2020,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Cloud computing; Encryption; Sorting; Join (topology); Logarithm; Data structure; Computational complexity theory","score_opus":0.018108163619771928,"score_gpt":0.21146538441976953,"score_spread":0.1933572207999976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012623189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07248522,0.0003801025,0.90821916,0.000678727,0.000063222404,0.0002093174,0.00031701408,0.003583484,0.014063794],"genre_scores_gemma":[0.7214936,0.00049975986,0.26161098,0.0003484457,0.00009634837,0.00042159963,0.0006793338,0.00050546334,0.014344476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634486,0.0006459061,0.00032698616,0.00056416314,0.0016029509,0.0005151501],"domain_scores_gemma":[0.99366885,0.0018901043,0.00056075904,0.003393351,0.0003538353,0.00013306421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019823953,0.0005273394,0.0009840357,0.0006031894,0.0014605925,0.0033290049,0.0026537434,0.0010159783,0.005212275],"category_scores_gemma":[0.0055096606,0.000718838,0.0008787439,0.0011175505,0.0018479212,0.0067079477,0.005476726,0.002379631,0.00228931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00154744,0.00035987824,0.002042537,0.00049653056,0.00008908953,0.00018786384,0.0008306731,0.07277702,0.08316534,0.6367787,0.007943929,0.19378096],"study_design_scores_gemma":[0.00025554025,0.00032728573,0.00067619886,0.00005692669,0.00009044326,0.000456692,0.00025166676,0.38171637,0.13462794,0.45252207,0.028944792,0.000074098214],"about_ca_topic_score_codex":0.0004540916,"about_ca_topic_score_gemma":0.00064098404,"teacher_disagreement_score":0.005212275,"about_ca_system_score_codex":0.0014796681,"about_ca_system_score_gemma":0.0020867991,"threshold_uncertainty_score":0.017436802},"labels":[],"label_agreement":null},{"id":"W3014805183","doi":"10.1007/s00037-004-0183-5","title":"Non-Automatizability of Bounded-Depth Frege Proofs","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Bounded function; Corollary; Mathematical proof; Mathematics; Argument (complex analysis); Discrete mathematics; Polynomial","score_opus":0.03632872527826129,"score_gpt":0.2831419397445236,"score_spread":0.24681321446626234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014805183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30651912,0.0028486752,0.5697082,0.010228063,0.0003989476,0.00021832854,0.0008208258,0.003328905,0.10592901],"genre_scores_gemma":[0.95441324,0.00071952003,0.032089513,0.00083846174,0.00025554135,0.00014156601,0.0003568526,0.00046685652,0.010718533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99198604,0.002552146,0.00040226267,0.0013627084,0.0021688403,0.0015278881],"domain_scores_gemma":[0.9453525,0.040834688,0.0020434884,0.008318434,0.0022965162,0.0011544229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059653055,0.0015089838,0.0022850565,0.0024591836,0.003633519,0.0073532397,0.003962978,0.0036025965,0.012610584],"category_scores_gemma":[0.04104402,0.0018750981,0.0031741112,0.0020180573,0.009157188,0.025328888,0.008861161,0.009933736,0.0018162748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021702408,0.00004679512,0.0004132135,0.00015355462,0.000044646134,0.00012335565,0.0004800481,0.003701344,0.0014230466,0.9823814,0.0019760588,0.009039493],"study_design_scores_gemma":[0.000024648352,0.000011958045,0.00007599202,0.000017950399,0.000020926085,0.00008176744,0.00003126544,0.004498123,0.0011181104,0.99270564,0.00139608,0.000017489352],"about_ca_topic_score_codex":0.0010542836,"about_ca_topic_score_gemma":0.00112546,"teacher_disagreement_score":0.012610584,"about_ca_system_score_codex":0.0037616522,"about_ca_system_score_gemma":0.0025270514,"threshold_uncertainty_score":0.042186618},"labels":[],"label_agreement":null},{"id":"W3016862388","doi":"10.1109/eurosp48549.2020.00046","title":"SoK: Delegation and Revocation, the Missing Links in the Web's Chain of Trust","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Revocation; Delegation; Computer science; Computer security; Trust anchor; World Wide Web; Trust management (information system); Chain (unit); Computer network; Business; Computational trust; Programming language; Political science","score_opus":0.028741285236512003,"score_gpt":0.26249322892313826,"score_spread":0.23375194368662625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016862388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04380709,0.0021647492,0.8718111,0.007383984,0.0005071641,0.00031269647,0.00029426173,0.00082870387,0.072890304],"genre_scores_gemma":[0.838414,0.0021737232,0.12708814,0.0005218294,0.00032123385,0.00027970193,0.00026471546,0.00031425394,0.030622423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99389875,0.0020745236,0.00043213848,0.00075487496,0.0022668731,0.0005727701],"domain_scores_gemma":[0.99180955,0.0022679078,0.0015317522,0.0022569625,0.00139848,0.0007353858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050117085,0.00070528523,0.0007996998,0.0019069223,0.0025451754,0.006581277,0.0015346536,0.0020860813,0.0046191015],"category_scores_gemma":[0.013852616,0.00043571673,0.000785322,0.0023644012,0.0062388843,0.0107756285,0.003761822,0.0026268112,0.001409542],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006661777,0.000030037865,0.0007139683,0.00014401137,0.000015459855,0.00017724243,0.00030833285,0.010350344,0.0014900755,0.9490509,0.0039437367,0.033709165],"study_design_scores_gemma":[0.000025256923,0.000058193255,0.00067055604,0.00013168983,0.000025427114,0.00052560115,0.00046437056,0.066592805,0.0030737044,0.8626743,0.065703616,0.00005435745],"about_ca_topic_score_codex":0.002160475,"about_ca_topic_score_gemma":0.0015765678,"teacher_disagreement_score":0.006581277,"about_ca_system_score_codex":0.004004808,"about_ca_system_score_gemma":0.0020967885,"threshold_uncertainty_score":0.029057026},"labels":[],"label_agreement":null},{"id":"W3020923604","doi":"10.1109/jiot.2020.2992349","title":"Secure and Efficient <i>k</i> NN Classification for Industrial Internet of Things","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"Sichuan Province Science and Technology Support Program; State Key Laboratory of Cryptography; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Encryption; Server; Data mining; Anomaly detection; The Internet; Computer network; Operating system","score_opus":0.048497483068774015,"score_gpt":0.25876879244513323,"score_spread":0.2102713093763592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020923604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07501893,0.0006444849,0.917531,0.000394624,0.00018227035,0.00013724729,0.00030321965,0.0013299717,0.004458301],"genre_scores_gemma":[0.81893784,0.00034272685,0.17595215,0.0001735342,0.00005473478,0.00010049961,0.0007436642,0.0000602522,0.003634586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.00013011582,0.000088391665,0.00020958183,0.00044221527,0.00012125015],"domain_scores_gemma":[0.99905366,0.00014014644,0.00014417381,0.00038560477,0.00023992253,0.00003633058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005977511,0.00048173737,0.0006819879,0.00057818537,0.00091505604,0.0008653232,0.00080599607,0.00063384627,0.001000615],"category_scores_gemma":[0.0019807036,0.00018850785,0.00044073086,0.00082130096,0.0005586902,0.0019644352,0.0010898758,0.00074760005,0.0006089534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009671499,0.0002469785,0.0077893236,0.00030495008,0.00011623294,0.00052632747,0.00031524658,0.13088365,0.055402074,0.041587833,0.016263362,0.7455969],"study_design_scores_gemma":[0.000030721283,0.00013254638,0.0018257477,0.000025911988,0.000032282114,0.00050945184,0.00019908862,0.9235132,0.03778367,0.028739307,0.0071687326,0.00003938725],"about_ca_topic_score_codex":0.0017393775,"about_ca_topic_score_gemma":0.0028349105,"teacher_disagreement_score":0.0017393775,"about_ca_system_score_codex":0.00081465655,"about_ca_system_score_gemma":0.0008758999,"threshold_uncertainty_score":0.005910814},"labels":[],"label_agreement":null},{"id":"W3021086181","doi":"10.1109/host45689.2020.9300288","title":"CPU and GPU Accelerated Fully Homomorphic Encryption","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Homomorphic encryption; Parallel computing; Speedup; Boolean function; Encryption; Multiplication (music); Theoretical computer science; Algorithm; Mathematics","score_opus":0.05261334098454339,"score_gpt":0.2637540250673369,"score_spread":0.21114068408279352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021086181","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6090767,0.0029886295,0.29271773,0.001335879,0.00062323856,0.00016175295,0.001082605,0.00682807,0.085185386],"genre_scores_gemma":[0.89490455,0.0003268477,0.09627297,0.00013403571,0.00003643845,0.00006144133,0.00057344354,0.00020893328,0.0074812574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995497,0.000081377264,0.000018799634,0.00006543002,0.00020213398,0.000082571314],"domain_scores_gemma":[0.999605,0.00008439717,0.000023032102,0.00014298972,0.00011450332,0.00003007214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465058,0.00046976306,0.00037032057,0.00040203155,0.00030998423,0.0008755974,0.000718575,0.00046503104,0.0059403623],"category_scores_gemma":[0.0011005632,0.00016643698,0.00028482,0.00064970006,0.00035260915,0.0011762113,0.0006259722,0.00063239055,0.00083451],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033971954,0.0006259412,0.008137722,0.0006033086,0.00020854661,0.001088594,0.00040809094,0.3494173,0.15343674,0.12603877,0.048990685,0.30764708],"study_design_scores_gemma":[0.00012093121,0.00024541887,0.0012556444,0.000025987003,0.000021163158,0.00021537152,0.00005279527,0.9366415,0.03762735,0.0082287,0.015543742,0.000021510765],"about_ca_topic_score_codex":0.003214398,"about_ca_topic_score_gemma":0.00352144,"teacher_disagreement_score":0.0059403623,"about_ca_system_score_codex":0.00064606534,"about_ca_system_score_gemma":0.00077213155,"threshold_uncertainty_score":0.019872427},"labels":[],"label_agreement":null},{"id":"W3022856335","doi":"10.1109/tsc.2020.2992303","title":"Achieving Practical Symmetric Searchable Encryption With Search Pattern Privacy Over Cloud","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Pseudorandom function family; Cloud computing; Symmetric-key algorithm; Identifier; Overhead (engineering); Scheme (mathematics); Bloom filter; Theoretical computer science; Pseudorandom generator; Security analysis; Cryptography; Computer security; Computer network; Public-key cryptography; Mathematics","score_opus":0.03250516878725188,"score_gpt":0.2827424459918655,"score_spread":0.2502372772046136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022856335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055162106,0.0011768313,0.92995965,0.0010576518,0.00010815429,0.0003466827,0.00069084374,0.0010386555,0.0104593765],"genre_scores_gemma":[0.90571135,0.0008431902,0.0882555,0.00036092126,0.000073292045,0.00022441207,0.00045756623,0.00007109924,0.0040026708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662375,0.00059414114,0.00036259298,0.000428851,0.0011985949,0.0007920257],"domain_scores_gemma":[0.9971131,0.0007222545,0.00035966194,0.0012514944,0.0004325453,0.00012091226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015622072,0.00078057573,0.0012727439,0.0006163565,0.0011018893,0.0021713937,0.0015375225,0.001149213,0.0031485988],"category_scores_gemma":[0.004237619,0.00033830616,0.000998137,0.0018640778,0.0009515184,0.005312699,0.0033627814,0.0014499866,0.0010663931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016977576,0.0004393727,0.003730676,0.0010078604,0.00020648568,0.0017864447,0.0007570637,0.18896636,0.071621664,0.45805946,0.017876351,0.2538505],"study_design_scores_gemma":[0.0002013358,0.00020435684,0.0006245648,0.0000804009,0.0000756556,0.0016201062,0.00024943848,0.80398697,0.040286787,0.13681655,0.015767459,0.00008631888],"about_ca_topic_score_codex":0.0014354016,"about_ca_topic_score_gemma":0.0012514098,"teacher_disagreement_score":0.0031485988,"about_ca_system_score_codex":0.0013738459,"about_ca_system_score_gemma":0.0031159131,"threshold_uncertainty_score":0.010533094},"labels":[],"label_agreement":null},{"id":"W3023005106","doi":"10.1007/978-3-030-64834-3_7","title":"Privacy-Preserving Pattern Matching on Encrypted Data","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Plaintext; Computer science; Ciphertext; Encryption; Matching (statistics); Pattern matching; Constant (computer programming); Theoretical computer science; Key (lock); Data mining; Computer security; Artificial intelligence; Mathematics","score_opus":0.03910779902451039,"score_gpt":0.26762151969396664,"score_spread":0.22851372066945624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023005106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059796263,0.0007457379,0.92946297,0.00051045214,0.00013035946,0.00014128741,0.00037157687,0.0010906825,0.007750614],"genre_scores_gemma":[0.6208657,0.0013732394,0.356226,0.00023117152,0.00015135288,0.00012644428,0.0010342418,0.00027981563,0.0197121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978592,0.00037066967,0.00018959382,0.00034139585,0.0009930615,0.00024605726],"domain_scores_gemma":[0.9971583,0.0008767559,0.00019744728,0.0015000749,0.00022836935,0.000039082875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010271599,0.00042095184,0.0008882365,0.0008551947,0.00046297704,0.0015366479,0.0013782902,0.00084412744,0.002397642],"category_scores_gemma":[0.004603098,0.00044918674,0.00077674916,0.0024765236,0.00080434146,0.0038947153,0.0018724815,0.0009952546,0.001313299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079096714,0.00023240624,0.0016293238,0.00048304236,0.000151047,0.00057000277,0.00030633333,0.06852156,0.04045955,0.19887903,0.010323942,0.6776528],"study_design_scores_gemma":[0.00006295568,0.00024932757,0.0007737942,0.000055883298,0.00007362687,0.0017815155,0.000108735345,0.47844955,0.074835755,0.43040204,0.013174961,0.000031920576],"about_ca_topic_score_codex":0.00039171265,"about_ca_topic_score_gemma":0.00031963905,"teacher_disagreement_score":0.002397642,"about_ca_system_score_codex":0.0004969626,"about_ca_system_score_gemma":0.0007523843,"threshold_uncertainty_score":0.008020937},"labels":[],"label_agreement":null},{"id":"W3023078125","doi":"","title":"Further Study on Proxy Authorization and Its Scheme","year":2012,"lang":"en","type":"article","venue":"Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009, Revised Papers, Part 2","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Alberta Paraplegic Foundation","funders":"","keywords":"Proxy (statistics); Computer security; Computer science; Anonymity; Authorization; Authorization certificate; Multicast; Delegate; Public-key cryptography; Certificate authority; Encryption","score_opus":0.07782972888127962,"score_gpt":0.31089621365165887,"score_spread":0.23306648477037925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023078125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06584186,0.0062257713,0.7568413,0.0054938053,0.0011048855,0.00028241347,0.00022120659,0.00048743418,0.16350134],"genre_scores_gemma":[0.88944787,0.004499998,0.07365312,0.00041623358,0.0007559699,0.00009830568,0.00016504651,0.000071693794,0.03089164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781215,0.0007098604,0.00015388776,0.00027038783,0.00074446667,0.0003091241],"domain_scores_gemma":[0.9979949,0.0005733278,0.00015981098,0.00076742936,0.00035829542,0.00014622111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013867451,0.00030042784,0.00054343545,0.0007656775,0.0013492974,0.0019730183,0.0007785496,0.0009006303,0.0068021817],"category_scores_gemma":[0.0031541982,0.00014592936,0.0008862114,0.0015287334,0.0018445617,0.00697909,0.0013206217,0.0019819734,0.00096270087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000635928,0.000026451846,0.00040482247,0.000102946826,0.000009369764,0.00014344847,0.0002622549,0.0032529642,0.0025096154,0.94994414,0.0016205712,0.041659735],"study_design_scores_gemma":[0.00006250571,0.0002345166,0.0007886635,0.00013919371,0.000047227295,0.0016676179,0.00038951804,0.11027129,0.01799647,0.6656359,0.20268445,0.00008275853],"about_ca_topic_score_codex":0.00085825886,"about_ca_topic_score_gemma":0.00026067262,"teacher_disagreement_score":0.0068021817,"about_ca_system_score_codex":0.0016131841,"about_ca_system_score_gemma":0.0011760035,"threshold_uncertainty_score":0.022755504},"labels":[],"label_agreement":null},{"id":"W3023180869","doi":"10.4230/lipics.tqc.2020.8","title":"Simpler Proofs of Quantumness","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Canadian Institute for Advanced Research; Multidisciplinary University Research Initiative; European Commission; Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley; National Science Foundation","keywords":"Mathematical proof; Computer science; Oracle; Learning with errors; Theoretical computer science; Random oracle; Hash function; Cryptography; Heuristic; Property (philosophy); Cryptographic primitive; Function (biology); Quantum computer; Quantum; Algorithm; Cryptographic protocol; Mathematics; Encryption; Public-key cryptography; Artificial intelligence; Computer security; Programming language","score_opus":0.037655001637565966,"score_gpt":0.2865085311426028,"score_spread":0.2488535295050368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023180869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031787384,0.0056385235,0.78574896,0.015749827,0.0029270258,0.00031296327,0.0008906456,0.002040634,0.15490398],"genre_scores_gemma":[0.6339608,0.004008899,0.30472723,0.007438681,0.0026597728,0.00075865135,0.0009543084,0.0011173456,0.044374418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923855,0.002427336,0.00045005232,0.0014497702,0.002569954,0.00071737036],"domain_scores_gemma":[0.9782727,0.012660192,0.00086343323,0.0057480833,0.001967885,0.00048774536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007110254,0.0010184806,0.0011508446,0.0019046955,0.0018966618,0.0050403876,0.002547268,0.002668887,0.031719387],"category_scores_gemma":[0.020642605,0.00073833775,0.0020352034,0.0013016652,0.006326619,0.013487511,0.007393958,0.007818874,0.004887346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003060447,0.000034904435,0.00006067671,0.000206848,0.00001598532,0.000077317854,0.00018755916,0.0008668968,0.0018042128,0.98339945,0.0036353536,0.009679984],"study_design_scores_gemma":[0.000045668254,0.00004877498,0.000100152036,0.00007695102,0.00001221127,0.00011172595,0.000044297733,0.0030874605,0.0034885874,0.9642024,0.028748246,0.000033569002],"about_ca_topic_score_codex":0.0004927452,"about_ca_topic_score_gemma":0.00040923434,"teacher_disagreement_score":0.031719387,"about_ca_system_score_codex":0.0025217887,"about_ca_system_score_gemma":0.0016889112,"threshold_uncertainty_score":0.10611194},"labels":[],"label_agreement":null},{"id":"W3028617919","doi":"","title":"Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for General Adversary Structures.","year":2009,"lang":"en","type":"preprint","venue":"BIROn (Birkbeck, University of London)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secret sharing; Overhead (engineering); Computer science; Access structure; Scheme (mathematics); Adversary; Monotone polygon; Transmission (telecommunications); Decoding methods; Connection (principal bundle); Set (abstract data type); Theoretical computer science; Computer network; Mathematics; Computer security; Algorithm; Cryptography; Telecommunications","score_opus":0.022021410402547487,"score_gpt":0.2328595851750756,"score_spread":0.21083817477252811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028617919","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16421838,0.00065769075,0.81933147,0.0008989558,0.000059828195,0.00023664856,0.00015688305,0.00019052622,0.014249621],"genre_scores_gemma":[0.9185724,0.0005688148,0.07554131,0.00011437725,0.000046280602,0.0001745769,0.00012833538,0.000036006095,0.004817868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976286,0.00081163226,0.00011816428,0.00037173548,0.00076528214,0.00030446716],"domain_scores_gemma":[0.9904585,0.0056982,0.0013835564,0.0019771701,0.0002959569,0.00018657384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022564256,0.0005574036,0.0007165461,0.00048498058,0.0009593328,0.00137641,0.001061028,0.0014278466,0.002050607],"category_scores_gemma":[0.012266416,0.00040631872,0.0007881885,0.0007160679,0.0034670215,0.0050920215,0.002488392,0.0024282315,0.0003860969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036191993,0.000053488424,0.00045962632,0.00022778011,0.000044203956,0.00031754602,0.0005178136,0.08553938,0.021410016,0.88027537,0.0005090582,0.010283749],"study_design_scores_gemma":[0.00010654022,0.0003137594,0.00048361742,0.0000686647,0.00006316767,0.0009711229,0.00013618908,0.47341618,0.034539234,0.48415443,0.0056788754,0.00006827071],"about_ca_topic_score_codex":0.00038641246,"about_ca_topic_score_gemma":0.0003121459,"teacher_disagreement_score":0.0022564256,"about_ca_system_score_codex":0.0016607502,"about_ca_system_score_gemma":0.001330353,"threshold_uncertainty_score":0.012049615},"labels":[],"label_agreement":null},{"id":"W3028657456","doi":"","title":"Mitigating Multi-Target Attacks in Hash-based Signatures.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Stateful firewall; Computer science; Merkle tree; Stateless protocol; Hash chain; Cryptographic hash function; SHA-2; Merkle signature scheme; Signature (topology); Theoretical computer science; SWIFFT; Security of cryptographic hash functions; Hash tree; Double hashing; Algorithm; Digital signature; Mathematics; Computer security; Blind signature","score_opus":0.03576303966685685,"score_gpt":0.2996902907414388,"score_spread":0.263927251074582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028657456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10677027,0.0020728589,0.862488,0.0023114015,0.0004760109,0.00031011886,0.00020863538,0.001762329,0.023600494],"genre_scores_gemma":[0.92058045,0.0005665011,0.06834772,0.00040197943,0.00019697021,0.00009703996,0.00018105954,0.00014451718,0.009483757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939215,0.0016368398,0.00026284065,0.00054972,0.0029010207,0.0007281643],"domain_scores_gemma":[0.9868036,0.005718835,0.0010796357,0.004659096,0.0012951057,0.00044375737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032918372,0.0009982887,0.0014760366,0.0012045675,0.001473877,0.002323399,0.0014850639,0.002951608,0.0047239396],"category_scores_gemma":[0.017294932,0.0006803417,0.0007129333,0.0011508595,0.0017110695,0.0069863508,0.008794454,0.0034153615,0.0027098402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004139434,0.00056077616,0.006708966,0.00080718304,0.0005116044,0.0013960307,0.0012724577,0.12231873,0.10003878,0.3636067,0.020586682,0.37805265],"study_design_scores_gemma":[0.00018001265,0.0010871781,0.0012992766,0.00012277764,0.00017680501,0.002976629,0.0005212571,0.6041608,0.1143322,0.25851107,0.01653069,0.00010128001],"about_ca_topic_score_codex":0.00022824842,"about_ca_topic_score_gemma":0.000284307,"teacher_disagreement_score":0.0047239396,"about_ca_system_score_codex":0.00078763854,"about_ca_system_score_gemma":0.0012419831,"threshold_uncertainty_score":0.017409086},"labels":[],"label_agreement":null},{"id":"W3028868347","doi":"","title":"Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Signature (topology); Identity (music); Ring signature; Computer science; Scheme (mathematics); Class (philosophy); Cryptography; Theoretical computer science; Computer security; Digital signature; Mathematics; Physics; Artificial intelligence","score_opus":0.011091837605074205,"score_gpt":0.26113453190413816,"score_spread":0.25004269429906395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028868347","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026173562,0.00038833136,0.9597203,0.0003155564,0.00012892664,0.00022432324,0.00018326618,0.0008816572,0.011984113],"genre_scores_gemma":[0.49732485,0.00047362712,0.4909623,0.00036424914,0.00008184093,0.0003194539,0.0005679654,0.00014467779,0.009760957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970354,0.00084360124,0.00024118785,0.00049941085,0.00091021525,0.0004702805],"domain_scores_gemma":[0.9967996,0.0006598764,0.0003797868,0.001553782,0.00032534337,0.00028160578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028030148,0.0004950372,0.00075697765,0.00094671163,0.0012097049,0.0019267576,0.0015819714,0.0014224288,0.0022470935],"category_scores_gemma":[0.0055430075,0.00053824286,0.0011286745,0.0013788267,0.0022876814,0.004570405,0.0061290287,0.0024858804,0.0010134121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007828374,0.00005325033,0.0004297168,0.00013070586,0.000025276458,0.00016974514,0.0003429427,0.0051409206,0.0055031236,0.9404323,0.0021756135,0.045518145],"study_design_scores_gemma":[0.00009829167,0.00026652662,0.00074460875,0.00014670048,0.00009844403,0.0013407329,0.00021543574,0.09660482,0.05237865,0.7426979,0.10526857,0.00013932955],"about_ca_topic_score_codex":0.00028611333,"about_ca_topic_score_gemma":0.00018244697,"teacher_disagreement_score":0.0028030148,"about_ca_system_score_codex":0.001184716,"about_ca_system_score_gemma":0.0018283353,"threshold_uncertainty_score":0.014823914},"labels":[],"label_agreement":null},{"id":"W3028979399","doi":"","title":"Superposition Attacks on Cryptographic Protocols","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Strategic Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Research Foundation; Sino-Danish Center; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Gas meter prover; Computer science; Cryptographic primitive; Theoretical computer science; Quantum computer; Cryptographic protocol; Secure two-party computation; Zero-knowledge proof; Commitment scheme; Universal composability; Superposition principle; Cryptography; Random oracle; Protocol (science); Quantum; Secure multi-party computation; Mathematical proof; Mathematics; Computer security; Public-key cryptography; Quantum mechanics; Encryption","score_opus":0.05924123788750958,"score_gpt":0.3040941299214514,"score_spread":0.24485289203394184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028979399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09574336,0.0007739275,0.8453405,0.002874368,0.00018404526,0.00029390512,0.0002980878,0.0008984027,0.05359339],"genre_scores_gemma":[0.9095294,0.0011551011,0.07704826,0.00067545724,0.00033080697,0.0004171569,0.00026530027,0.00019347135,0.010384986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9844855,0.0052498775,0.00093081506,0.0020228927,0.005659946,0.0016510179],"domain_scores_gemma":[0.98515344,0.0073875613,0.0010337445,0.005479393,0.0005044088,0.0004415382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005402678,0.0013894816,0.001509862,0.0016855107,0.002436217,0.0054356316,0.0020535365,0.003910176,0.0054102195],"category_scores_gemma":[0.015637923,0.0011510185,0.0026737712,0.0023674953,0.011953707,0.015409423,0.011296289,0.0074682604,0.0009320856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004544594,0.000020726857,0.00012425848,0.00003355515,0.000018103976,0.000068453606,0.0001751851,0.0077860113,0.001971686,0.9866002,0.00036362634,0.002792807],"study_design_scores_gemma":[0.000038430488,0.000052606905,0.000115826784,0.000028895869,0.000024439556,0.00010730815,0.00004582277,0.06872727,0.0033381984,0.92399806,0.0034968941,0.000026281048],"about_ca_topic_score_codex":0.001014935,"about_ca_topic_score_gemma":0.0005398284,"teacher_disagreement_score":0.0054356316,"about_ca_system_score_codex":0.0035321855,"about_ca_system_score_gemma":0.0018323576,"threshold_uncertainty_score":0.02857244},"labels":[],"label_agreement":null},{"id":"W3029155370","doi":"","title":"How to Efficiently Evaluate RAM Programs with Malicious Security.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Overhead (engineering); Protocol (science); Oblivious transfer; State (computer science); Computer security; Cryptography; Operating system; Algorithm","score_opus":0.014500793030646757,"score_gpt":0.25511020854317995,"score_spread":0.2406094155125332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029155370","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07706588,0.0004012883,0.9032946,0.002095467,0.00014441682,0.00050710666,0.00028242747,0.0057867467,0.010421976],"genre_scores_gemma":[0.6884526,0.00027204244,0.3034952,0.0005354471,0.00009985526,0.0004808761,0.00056922267,0.0012856302,0.004809169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900181,0.004278705,0.00047469267,0.0012129658,0.0030683281,0.0009471024],"domain_scores_gemma":[0.9741262,0.013030736,0.0014723678,0.009586295,0.0013080596,0.0004763936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006534276,0.0010516408,0.0011228246,0.0007846757,0.0009811644,0.0033307518,0.0024297312,0.0019095442,0.008682854],"category_scores_gemma":[0.032703537,0.00085294695,0.0014571582,0.0007196863,0.0027593237,0.010341335,0.0044898316,0.003245723,0.00247673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022250551,0.0006090714,0.009036974,0.0012946662,0.0005633554,0.00065233896,0.00081527524,0.116352625,0.09990819,0.4598833,0.014846061,0.29381314],"study_design_scores_gemma":[0.00017759828,0.00036988547,0.001043395,0.000120687786,0.00011585099,0.0005489817,0.00020539161,0.53456205,0.07997659,0.37414393,0.008651984,0.000083691004],"about_ca_topic_score_codex":0.00056641473,"about_ca_topic_score_gemma":0.00083068915,"teacher_disagreement_score":0.008682854,"about_ca_system_score_codex":0.0017487154,"about_ca_system_score_gemma":0.0025628947,"threshold_uncertainty_score":0.034556985},"labels":[],"label_agreement":null},{"id":"W3029391407","doi":"","title":"Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems.","year":2009,"lang":"en","type":"preprint","venue":"Research Online (University of Wollongong)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Credential; Computer science; Scheme (mathematics); Signature (topology); Set (abstract data type); Digital signature; Theoretical computer science; Merkle signature scheme; Computer security; Commitment scheme; Encryption; Blind signature; Public-key cryptography; Algorithm; Cryptography; Mathematics; Hash function; Programming language","score_opus":0.040553949717729534,"score_gpt":0.3029641077864294,"score_spread":0.2624101580686999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029391407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016790332,0.0034756977,0.9417297,0.0024086363,0.0005908032,0.00018680739,0.00013201592,0.0004959275,0.03419012],"genre_scores_gemma":[0.74073,0.0036864055,0.23693429,0.0007070254,0.00069399993,0.00029763888,0.00015738032,0.000098533535,0.016694797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614465,0.0012214361,0.00030276756,0.0005938141,0.001492638,0.0002446327],"domain_scores_gemma":[0.99465984,0.0028030283,0.00040957448,0.0013091468,0.00052092335,0.00029752907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002955467,0.00047991026,0.00060998736,0.0012914877,0.0015882961,0.003919317,0.0014384435,0.0026062822,0.004611161],"category_scores_gemma":[0.012170388,0.0005484047,0.0013760914,0.0021247035,0.005296815,0.008018594,0.00400138,0.0048742355,0.0011794576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013366754,0.000009049264,0.000098519246,0.000034161956,0.000007081138,0.00007379475,0.00016175787,0.00434663,0.00046162118,0.98571235,0.0004148982,0.008666871],"study_design_scores_gemma":[0.000010732207,0.000025185345,0.000054440156,0.000034977227,0.000009955636,0.00020628214,0.000049987208,0.05370785,0.0012576992,0.92901284,0.015612507,0.000017557271],"about_ca_topic_score_codex":0.001203361,"about_ca_topic_score_gemma":0.0005425582,"teacher_disagreement_score":0.004611161,"about_ca_system_score_codex":0.0022918864,"about_ca_system_score_gemma":0.001684857,"threshold_uncertainty_score":0.016628861},"labels":[],"label_agreement":null},{"id":"W3029579384","doi":"","title":"Boneh-Boyen signatures and the Strong Diffie-Hellman problem.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Converse; Pairing; Signature (topology); Discrete logarithm; Computer science; Logarithm; Scheme (mathematics); Theoretical computer science; Discrete mathematics; Mathematics; Encryption; Public-key cryptography; Physics; Computer security","score_opus":0.00838453022260436,"score_gpt":0.23657231488722116,"score_spread":0.2281877846646168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029579384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17740452,0.005533079,0.7129168,0.02358104,0.0011848711,0.0005279374,0.00053799583,0.00079850684,0.07751529],"genre_scores_gemma":[0.7920761,0.0016484249,0.18524654,0.0013978826,0.00052442844,0.00025322146,0.00039407806,0.00008992129,0.018369414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99166685,0.0032185155,0.00043507392,0.0009897888,0.0030855038,0.0006042762],"domain_scores_gemma":[0.98548234,0.006915058,0.0018531793,0.0041434634,0.000945541,0.0006602798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061563635,0.0006457123,0.0009408,0.0010800358,0.0034684946,0.0036863552,0.0017775199,0.0026105684,0.0076593584],"category_scores_gemma":[0.020422485,0.0007751701,0.00084392517,0.0027584212,0.0066801673,0.017164277,0.00856675,0.0057967473,0.0017758582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046228833,0.00007075183,0.0007449331,0.00017361756,0.000039185124,0.00022995326,0.00040541615,0.007998627,0.0016856833,0.9324987,0.0052262056,0.050464656],"study_design_scores_gemma":[0.00007410755,0.000106886386,0.00032985708,0.0000506288,0.000019682027,0.00050580135,0.00023381962,0.04039392,0.0063745542,0.931567,0.02030698,0.000036855832],"about_ca_topic_score_codex":0.0008561552,"about_ca_topic_score_gemma":0.0006931141,"teacher_disagreement_score":0.0076593584,"about_ca_system_score_codex":0.0021917848,"about_ca_system_score_gemma":0.0031596348,"threshold_uncertainty_score":0.03255838},"labels":[],"label_agreement":null},{"id":"W3029599730","doi":"","title":"Zero-Knowledge Interactive Proof Systems for New Lattice Problems.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Zero-knowledge proof; Graph isomorphism; Lattice (music); Lattice problem; Equivalence (formal languages); Mathematics; Rational number; Discrete mathematics; Computer science; Gas meter prover; Time complexity; Theoretical computer science; Graph; Cryptography; Algorithm","score_opus":0.04712534424237986,"score_gpt":0.3094885024980233,"score_spread":0.26236315825564344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029599730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013482023,0.0007351594,0.9576919,0.0043791896,0.00029599978,0.00026316452,0.0003128985,0.0006325056,0.022207145],"genre_scores_gemma":[0.453556,0.0012429071,0.52097607,0.001751191,0.0010784247,0.00059585646,0.0013467493,0.0005675355,0.018885287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892151,0.003681225,0.0005278226,0.0020582483,0.0035518245,0.0009658267],"domain_scores_gemma":[0.9664972,0.02470038,0.0013726642,0.0054799537,0.0010881962,0.00086155836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065182424,0.00087051134,0.0012201796,0.0012417176,0.0028571752,0.006123971,0.003680799,0.0024914441,0.018501822],"category_scores_gemma":[0.03250105,0.00084025745,0.0023377824,0.001603283,0.007568898,0.020180874,0.01121019,0.011109853,0.002282129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045078417,0.000054711756,0.00013021054,0.00016190534,0.000025660229,0.000049740473,0.00019991421,0.0060798037,0.00043673356,0.9774779,0.0026806593,0.012657574],"study_design_scores_gemma":[0.000038628088,0.000018214574,0.000041380717,0.00003457033,0.000013937445,0.00007041568,0.00006325808,0.03205818,0.0010383886,0.9599182,0.0066887303,0.000016211103],"about_ca_topic_score_codex":0.00096512586,"about_ca_topic_score_gemma":0.0012986152,"teacher_disagreement_score":0.018501822,"about_ca_system_score_codex":0.0044016987,"about_ca_system_score_gemma":0.0032624153,"threshold_uncertainty_score":0.061894774},"labels":[],"label_agreement":null},{"id":"W3029610118","doi":"","title":"Computational Soundness of Coinductive Symbolic Security under Active Attacks.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Soundness; Computer science; Encryption; TRACE (psycholinguistics); Theoretical computer science; Symmetric-key algorithm; Ciphertext; Mathematics; Computer security; Public-key cryptography; Programming language","score_opus":0.023887036101168498,"score_gpt":0.288980556139148,"score_spread":0.26509352003797954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029610118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087906696,0.00036534853,0.8885933,0.0030699633,0.00017123327,0.00027942442,0.00036950113,0.0011072023,0.018137252],"genre_scores_gemma":[0.95517415,0.00023995328,0.038744822,0.0006840504,0.00016371338,0.00024660034,0.00032137084,0.00016738393,0.004257864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986233,0.003559339,0.0008471576,0.0030815753,0.004559707,0.0017191145],"domain_scores_gemma":[0.95871055,0.025177283,0.0023056562,0.009464762,0.003244055,0.0010977233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007652664,0.0010309416,0.001370937,0.0015685068,0.0020318707,0.0047882884,0.0033568686,0.0026457414,0.0049393135],"category_scores_gemma":[0.032060772,0.00092338247,0.003328916,0.001187884,0.01387422,0.014030779,0.0072098738,0.007862031,0.000761176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014758806,0.000066848384,0.00063373917,0.00011571334,0.000057191428,0.00016714512,0.00043784518,0.01914107,0.0021109825,0.97085166,0.0007117646,0.0055584214],"study_design_scores_gemma":[0.00005342983,0.00005884444,0.000151659,0.00002958424,0.000047831203,0.00013662223,0.00006343316,0.09176675,0.004128226,0.9019198,0.0016176892,0.00002612703],"about_ca_topic_score_codex":0.001927107,"about_ca_topic_score_gemma":0.0014091791,"teacher_disagreement_score":0.007652664,"about_ca_system_score_codex":0.003989996,"about_ca_system_score_gemma":0.003244256,"threshold_uncertainty_score":0.040471673},"labels":[],"label_agreement":null},{"id":"W3029797213","doi":"","title":"How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Permutation (music); Computer science; Protocol (science); Generalization; Function (biology); Task (project management); Constant (computer programming); Theoretical computer science; Topology (electrical circuits); Electronic circuit; Mathematics; Combinatorics","score_opus":0.04051566078317991,"score_gpt":0.30665683227799584,"score_spread":0.2661411714948159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029797213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051943464,0.00039226245,0.9864305,0.00074014877,0.00006187292,0.00018807358,0.00009521248,0.0005872484,0.0063103703],"genre_scores_gemma":[0.36373827,0.0010351918,0.6224583,0.0006797025,0.00023594876,0.0007884278,0.000340347,0.00046788124,0.010255956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99445385,0.0020766922,0.0002866599,0.000829821,0.0016472841,0.0007057246],"domain_scores_gemma":[0.9921159,0.0032889738,0.00033418112,0.003822194,0.0002977615,0.00014086935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00567321,0.0009588197,0.0011703226,0.00091332826,0.0015750277,0.003770671,0.003189366,0.00265767,0.0055318004],"category_scores_gemma":[0.012210307,0.0010075258,0.00238971,0.0013498688,0.005354832,0.013113605,0.006847989,0.008036323,0.0016059399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009545482,0.00005661528,0.0001692869,0.00016754585,0.000035437384,0.00011505938,0.00022897658,0.023289869,0.0036694033,0.9398867,0.0019995382,0.03028612],"study_design_scores_gemma":[0.0000595672,0.00008211215,0.000120553595,0.00006698361,0.000054585245,0.00020327934,0.000042669482,0.15304233,0.009065061,0.8209784,0.016247796,0.000036710848],"about_ca_topic_score_codex":0.0007661526,"about_ca_topic_score_gemma":0.0007490434,"teacher_disagreement_score":0.00567321,"about_ca_system_score_codex":0.0027427503,"about_ca_system_score_gemma":0.0020878161,"threshold_uncertainty_score":0.03000319},"labels":[],"label_agreement":null},{"id":"W3030048089","doi":"","title":"Provably Secure and Practical Onion Routing.","year":2011,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Universal composability; Protocol (science); Key exchange; Routing protocol; Anonymity; Forward secrecy; Computer network; Cryptography; Cryptographic protocol; Key (lock); Computer security; Distributed computing; Routing (electronic design automation); Encryption; Public-key cryptography","score_opus":0.03031414333458102,"score_gpt":0.28352900400269937,"score_spread":0.2532148606681183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030048089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04698002,0.00026890886,0.8966199,0.0021243582,0.00037158825,0.00044262194,0.00030198126,0.0017991046,0.05109162],"genre_scores_gemma":[0.8313611,0.00035564767,0.14706105,0.00079883105,0.0002006648,0.00041088177,0.00048263624,0.00036712337,0.018962016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435896,0.0019043064,0.00036144085,0.0007883099,0.0018943286,0.0006927336],"domain_scores_gemma":[0.99386483,0.0020139604,0.0007361525,0.002451456,0.00072935247,0.0002043218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003713985,0.00061053474,0.00049282337,0.00055536797,0.001599899,0.0030920825,0.0016407501,0.0013897357,0.00613824],"category_scores_gemma":[0.007976131,0.0003463043,0.00094877003,0.0005084128,0.0033649157,0.008562333,0.0058935406,0.002958367,0.0011962815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031104044,0.00010163335,0.0005582189,0.00023566885,0.00004828364,0.00021926878,0.0005159679,0.021105662,0.009183906,0.92527115,0.0054211766,0.037028033],"study_design_scores_gemma":[0.000075702395,0.00024484424,0.0004640415,0.0001527777,0.000093180206,0.000557155,0.0004823256,0.19071405,0.06391705,0.68050385,0.062716454,0.000078540244],"about_ca_topic_score_codex":0.00059897784,"about_ca_topic_score_gemma":0.0004662968,"teacher_disagreement_score":0.00613824,"about_ca_system_score_codex":0.0017311663,"about_ca_system_score_gemma":0.0015443005,"threshold_uncertainty_score":0.020534456},"labels":[],"label_agreement":null},{"id":"W3030138413","doi":"","title":"CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random oracle; Computer science; Encryption; Standard Model (mathematical formulation); Authenticated encryption; 56-bit encryption; Ciphertext; Theoretical computer science; Probabilistic encryption; Computer security; Public-key cryptography; Geography","score_opus":0.02424680553053885,"score_gpt":0.2708609997526018,"score_spread":0.24661419422206296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030138413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018798439,0.00079257094,0.93329513,0.0013809835,0.00024929314,0.00045580504,0.00043810392,0.0017742194,0.042815387],"genre_scores_gemma":[0.72697425,0.0007859557,0.2439999,0.0007582544,0.00026501354,0.00089480716,0.0008804432,0.0004928661,0.024948513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189126,0.0026276933,0.00033030607,0.0007740463,0.0032711686,0.0011055435],"domain_scores_gemma":[0.9918555,0.0018785695,0.0003710188,0.004861884,0.0007812916,0.00025164936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005160365,0.0010522873,0.0014579472,0.0013228328,0.0013107206,0.004527563,0.0032745216,0.0020068886,0.0073825098],"category_scores_gemma":[0.011123088,0.0006134406,0.0012255494,0.0020911123,0.0032259522,0.008842631,0.007656489,0.0039677164,0.0035642446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005366439,0.00018472645,0.00036538515,0.00018147772,0.00008208123,0.0001945732,0.00023678821,0.014625028,0.00685077,0.92600805,0.011041035,0.039693423],"study_design_scores_gemma":[0.0002951354,0.000131797,0.0002772358,0.00008226631,0.00010198643,0.00050082663,0.000096492906,0.23485719,0.032423716,0.6891029,0.04203912,0.000091351554],"about_ca_topic_score_codex":0.00095379795,"about_ca_topic_score_gemma":0.0009028362,"teacher_disagreement_score":0.0073825098,"about_ca_system_score_codex":0.0021359134,"about_ca_system_score_gemma":0.003287769,"threshold_uncertainty_score":0.02729094},"labels":[],"label_agreement":null},{"id":"W3030283145","doi":"","title":"Enhanced Chosen-Ciphertext Security and Applications.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Encryption; Ciphertext; Computer science; Randomness; Oracle; Random oracle; Theoretical computer science; Scheme (mathematics); Algorithm; Computer security; Mathematics; Public-key cryptography; Programming language","score_opus":0.011227091624300968,"score_gpt":0.2551027824598083,"score_spread":0.2438756908355073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030283145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026124239,0.0083324,0.88060206,0.00593983,0.0007241969,0.00030688092,0.00044482204,0.00045285086,0.07707284],"genre_scores_gemma":[0.76817244,0.006660383,0.1986754,0.0016955648,0.0011892767,0.00039519335,0.0005101161,0.00017865107,0.02252307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99187016,0.0025141211,0.00058752036,0.0013647723,0.0030602415,0.0006030819],"domain_scores_gemma":[0.9889148,0.0049201394,0.0008153891,0.003960917,0.00097143085,0.00041733705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044436837,0.0010979056,0.0010707128,0.0016762703,0.0014312956,0.004739283,0.0018720913,0.0025301496,0.005367823],"category_scores_gemma":[0.012921026,0.0006788724,0.001863266,0.0026261916,0.006167735,0.014405885,0.0063841,0.007854826,0.0019179855],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005033699,0.000027890976,0.00021449898,0.00012157938,0.000020086854,0.00014711879,0.00014145765,0.0035692772,0.0012224972,0.9828005,0.0010490713,0.01063568],"study_design_scores_gemma":[0.00003192034,0.00008483418,0.00029416702,0.00014439068,0.00003277709,0.0010542913,0.00007343957,0.035020553,0.0051405975,0.92217773,0.03590351,0.000041864285],"about_ca_topic_score_codex":0.0004964664,"about_ca_topic_score_gemma":0.00027503778,"teacher_disagreement_score":0.005367823,"about_ca_system_score_codex":0.0031841025,"about_ca_system_score_gemma":0.0014171773,"threshold_uncertainty_score":0.02350074},"labels":[],"label_agreement":null},{"id":"W3030425602","doi":"","title":"A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC).","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Variety (cybernetics); Theoretical computer science; Abstraction; Closure (psychology); Artificial intelligence","score_opus":0.023888310154628032,"score_gpt":0.3142618442050231,"score_spread":0.29037353405039507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030425602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002050722,0.0006489294,0.96949446,0.0029332016,0.00023332535,0.00024823478,0.00021244171,0.00026287968,0.02391582],"genre_scores_gemma":[0.27122754,0.0018942396,0.70338184,0.0026549944,0.0008813818,0.0019574189,0.00058450835,0.00032222745,0.017095828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99064785,0.0040662577,0.000588408,0.0017878929,0.0021785793,0.00073089637],"domain_scores_gemma":[0.98960054,0.00483755,0.00086123514,0.0033200516,0.00072624726,0.0006544762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009035475,0.0014033788,0.001146314,0.0018255936,0.0036342612,0.006770501,0.0055961628,0.004246177,0.008007205],"category_scores_gemma":[0.014076235,0.001238615,0.0028342353,0.002044203,0.012391724,0.016166162,0.008878591,0.013901634,0.0019930066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003171989,0.000007723906,0.00001724731,0.000019374314,0.0000032454584,0.000018839917,0.00007146208,0.00063665706,0.00010486029,0.99775594,0.00037179765,0.0009897355],"study_design_scores_gemma":[0.000012116587,0.000016474612,0.000037518206,0.00004175782,0.000010520118,0.00008343058,0.000051236137,0.0077913664,0.00032319454,0.9756723,0.015942523,0.000017479546],"about_ca_topic_score_codex":0.0013261548,"about_ca_topic_score_gemma":0.0012305107,"teacher_disagreement_score":0.009035475,"about_ca_system_score_codex":0.004641324,"about_ca_system_score_gemma":0.0039890697,"threshold_uncertainty_score":0.047784686},"labels":[],"label_agreement":null},{"id":"W3030584426","doi":"","title":"IO-DSSE: Scaling Dynamic Searchable Encryption to Millions of Indexes By Improving Locality.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Locality; Computer science; Encryption; Scaling; Locality of reference; Theoretical computer science; Parallel computing; Computer security; Cache; Mathematics","score_opus":0.008312299165336077,"score_gpt":0.2656345531389091,"score_spread":0.257322253973573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030584426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31284356,0.011505547,0.56250566,0.0042862436,0.0014123215,0.0005602401,0.004559105,0.05725571,0.04507156],"genre_scores_gemma":[0.77558,0.0011482218,0.2009583,0.0007926471,0.00034304278,0.00026131223,0.0039147544,0.0017365365,0.0152652],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99761117,0.00044210898,0.0002129595,0.0003667635,0.00097102945,0.00039591672],"domain_scores_gemma":[0.99155676,0.0015315705,0.00033251094,0.0052970997,0.00088939327,0.0003926403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016912259,0.00081233337,0.0014878637,0.0016995489,0.0010878682,0.0022314803,0.0036144827,0.00121374,0.008978892],"category_scores_gemma":[0.011019556,0.0004809187,0.00064101187,0.0029373555,0.001263655,0.008985972,0.0049472256,0.0019143022,0.0042858673],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036705274,0.0015249129,0.006831208,0.0008699446,0.00035605874,0.00035951912,0.0005555711,0.09006902,0.07084277,0.09103597,0.13678002,0.59710455],"study_design_scores_gemma":[0.00076383096,0.0011778952,0.0015112184,0.00010239954,0.00018841507,0.0007507678,0.00041099373,0.7414713,0.0677498,0.13088536,0.054855835,0.00013216879],"about_ca_topic_score_codex":0.0018337483,"about_ca_topic_score_gemma":0.0036082768,"teacher_disagreement_score":0.008978892,"about_ca_system_score_codex":0.0012937826,"about_ca_system_score_gemma":0.0022379253,"threshold_uncertainty_score":0.030037403},"labels":[],"label_agreement":null},{"id":"W3031625817","doi":"","title":"Exclusion-Intersection Encryption.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; Computer science; Ciphertext; Computer security; Cryptography; Attribute-based encryption; Intersection (aeronautics); Public-key cryptography; Theoretical computer science; Engineering","score_opus":0.013748257548284914,"score_gpt":0.25828966322121755,"score_spread":0.24454140567293264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031625817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047869172,0.003539077,0.7329692,0.003808807,0.00097269693,0.00051599497,0.002569131,0.0016964521,0.20605943],"genre_scores_gemma":[0.8014333,0.0017865413,0.11790324,0.0011494346,0.00044360105,0.00054305646,0.003879723,0.0002528498,0.0726082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982874,0.00039326673,0.00015249931,0.00023869412,0.0006425,0.00028574158],"domain_scores_gemma":[0.99880564,0.00029603226,0.00014723427,0.00043000776,0.00024238553,0.000078621975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008792212,0.00041353385,0.0006723993,0.0006809378,0.0011914014,0.0021968987,0.00082639384,0.000755044,0.012892747],"category_scores_gemma":[0.0020385212,0.00018306958,0.0005071031,0.0014494584,0.0011440514,0.0043520206,0.00287474,0.0021316956,0.005365489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005500384,0.00012787714,0.0006036921,0.0001923895,0.000023662791,0.00029761504,0.00025809192,0.003984296,0.005191719,0.8838756,0.022008253,0.08288669],"study_design_scores_gemma":[0.00013762988,0.00013078215,0.0006619275,0.000092564725,0.00003176055,0.0018500185,0.00014622719,0.057398994,0.019380402,0.6763984,0.24371812,0.000053194803],"about_ca_topic_score_codex":0.00050450326,"about_ca_topic_score_gemma":0.00040102913,"teacher_disagreement_score":0.012892747,"about_ca_system_score_codex":0.0011855972,"about_ca_system_score_gemma":0.000895105,"threshold_uncertainty_score":0.043130577},"labels":[],"label_agreement":null},{"id":"W3032477875","doi":"10.1145/3519935.3520073","title":"Quantum garbled circuits","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of Toronto; European Commission","keywords":"Quantum computer; Cryptography; Computer science; Quantum algorithm; Theoretical computer science; Quantum cryptography; Quantum; Reduction (mathematics); Computation; Oblivious transfer; Encoding (memory); Discrete mathematics; Mathematics; Quantum information; Algorithm; Quantum mechanics; Physics","score_opus":0.030172873138232276,"score_gpt":0.26715074593108185,"score_spread":0.23697787279284957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032477875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02775671,0.010086291,0.81781286,0.005506245,0.0019320482,0.0004277646,0.0008594934,0.001018651,0.13459994],"genre_scores_gemma":[0.7649697,0.011871889,0.1656592,0.004327127,0.0013787337,0.00085043,0.000984786,0.0003526217,0.049605533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997781,0.0006577181,0.00014148929,0.0005475225,0.0005914072,0.0002808205],"domain_scores_gemma":[0.9982875,0.00085202773,0.000118633914,0.00048170384,0.00017088809,0.00008915419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013193375,0.00087250554,0.0012664222,0.0010049571,0.0012954712,0.004092413,0.0011451527,0.0020305484,0.007923074],"category_scores_gemma":[0.0056833625,0.0006277026,0.0010006607,0.0017371617,0.004399956,0.0077510797,0.0032489658,0.0043852837,0.0016413775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023482558,0.000008908895,0.000030632844,0.00006213248,0.0000062729328,0.000025156063,0.00003838308,0.0010578843,0.0005761642,0.99086916,0.00087748084,0.0064243744],"study_design_scores_gemma":[0.000020083358,0.00002763849,0.00004147941,0.00006893606,0.000012039625,0.000099373814,0.000019237028,0.0061838604,0.0019682173,0.9694381,0.022105085,0.000015917516],"about_ca_topic_score_codex":0.00038650108,"about_ca_topic_score_gemma":0.0003311621,"teacher_disagreement_score":0.007923074,"about_ca_system_score_codex":0.0014361673,"about_ca_system_score_gemma":0.0011546953,"threshold_uncertainty_score":0.026505291},"labels":[],"label_agreement":null},{"id":"W3032659344","doi":"10.1007/978-3-030-51938-4_12","title":"Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Chaining; Hash function; NIST; Cryptography; Theoretical computer science; Computer security; Distributed computing","score_opus":0.009392661269025862,"score_gpt":0.22482405453817106,"score_spread":0.2154313932691452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032659344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021521764,0.0024123252,0.93990934,0.0048337546,0.0009649898,0.00019664635,0.00019145495,0.0015601023,0.028409712],"genre_scores_gemma":[0.47324088,0.002075308,0.4712835,0.0013247019,0.0018110293,0.00021105177,0.00038029772,0.0007358676,0.0489374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99465585,0.0012828583,0.00033941213,0.001114125,0.0019720504,0.0006357287],"domain_scores_gemma":[0.9931865,0.0014878698,0.00024052823,0.00391508,0.00088322547,0.00028668693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038814463,0.0008739699,0.0021536518,0.0015484514,0.002180133,0.0060556303,0.005484099,0.0030442295,0.0080205025],"category_scores_gemma":[0.010102278,0.0007634666,0.0012342464,0.003556865,0.0049132095,0.015876079,0.008487157,0.005571296,0.0030664864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034221658,0.00008829055,0.0002974087,0.00011600262,0.00003429731,0.00016448616,0.0002583393,0.0105837835,0.003884175,0.850794,0.008054694,0.12538217],"study_design_scores_gemma":[0.000059186797,0.000117951065,0.0001281043,0.00005477936,0.000049526378,0.0004851959,0.0001309747,0.18771414,0.006278694,0.7697185,0.035200216,0.00006273613],"about_ca_topic_score_codex":0.0007642822,"about_ca_topic_score_gemma":0.0006232692,"teacher_disagreement_score":0.0080205025,"about_ca_system_score_codex":0.00304397,"about_ca_system_score_gemma":0.0027645917,"threshold_uncertainty_score":0.02683121},"labels":[],"label_agreement":null},{"id":"W3033122328","doi":"10.1007/978-981-15-4374-6_5","title":"Secure Keyword Search","year":2020,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Cryptography; Keyword search; Class (philosophy); Set (abstract data type); Cryptographic primitive; Information retrieval; Cloud computing; Data mining; Computer security; Cryptographic protocol; Artificial intelligence; Operating system; Programming language","score_opus":0.017851557591969294,"score_gpt":0.2171703175616005,"score_spread":0.1993187599696312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033122328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01476383,0.009897219,0.5055945,0.0028615983,0.0011915034,0.0003938533,0.0048317183,0.009414801,0.45105106],"genre_scores_gemma":[0.21438192,0.012979709,0.21729569,0.001378729,0.0008323277,0.0003727453,0.013938302,0.0022781403,0.5365425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990657,0.0001018137,0.000059860376,0.00017149166,0.0004867116,0.00011436419],"domain_scores_gemma":[0.99911124,0.00033367824,0.00004981979,0.00030341963,0.00016383802,0.000037944083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038807944,0.0008924251,0.0009369329,0.001634763,0.00084210944,0.0024889838,0.0011645289,0.0010169239,0.06332612],"category_scores_gemma":[0.0025909129,0.0004748642,0.00059042365,0.0029324426,0.00082802825,0.0055235364,0.0022994364,0.0012147803,0.051402457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031189667,0.00009616649,0.0002537807,0.0006329846,0.000046825273,0.0002564403,0.0001836598,0.0050636865,0.012420647,0.1698637,0.17755492,0.6333153],"study_design_scores_gemma":[0.000068923044,0.00011274972,0.00039836223,0.00025523084,0.000058919337,0.0023090218,0.00025859705,0.055984758,0.025182258,0.36432958,0.5509766,0.0000650691],"about_ca_topic_score_codex":0.001018,"about_ca_topic_score_gemma":0.0012724373,"teacher_disagreement_score":0.06332612,"about_ca_system_score_codex":0.000969467,"about_ca_system_score_gemma":0.0011340717,"threshold_uncertainty_score":0.21184695},"labels":[],"label_agreement":null},{"id":"W3033302425","doi":"10.1007/978-981-15-4374-6_2","title":"Basic Techniques for Data Security","year":2020,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptographic primitive; Cryptography; Computer security; Theoretical computer science; Cryptographic protocol; Data security; Encryption","score_opus":0.03400705930246765,"score_gpt":0.25349102178069804,"score_spread":0.2194839624782304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033302425","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010598704,0.04193304,0.14577486,0.0020144882,0.0026602673,0.0001640061,0.0002655973,0.00088946853,0.8052385],"genre_scores_gemma":[0.01896974,0.049487416,0.05730069,0.0013711869,0.0020728507,0.0003258579,0.00038525448,0.00043891498,0.869648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960333,0.00004438767,0.0000144649,0.000048714996,0.00025198318,0.000037107737],"domain_scores_gemma":[0.9997478,0.000104219565,0.000011607405,0.00006965539,0.00005434735,0.000012421757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000298231,0.001593589,0.00060036354,0.0015851936,0.0010743057,0.002457543,0.001394095,0.0011536996,0.04028243],"category_scores_gemma":[0.0007250392,0.0005673498,0.00055084284,0.0019722644,0.0020882117,0.004239129,0.0014422553,0.0030976157,0.029591236],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019669416,0.00004657387,0.00003311097,0.00047504465,0.000009511509,0.00006532624,0.000402909,0.0007295315,0.0035966993,0.65532047,0.1214735,0.21782774],"study_design_scores_gemma":[0.0000047602284,0.000018539406,0.00004866777,0.00013453502,0.0000048763727,0.00017529029,0.000046540015,0.0006536996,0.0011293609,0.1312042,0.8665716,0.000007879676],"about_ca_topic_score_codex":0.00043089667,"about_ca_topic_score_gemma":0.0005241482,"teacher_disagreement_score":0.04028243,"about_ca_system_score_codex":0.00094510475,"about_ca_system_score_gemma":0.0007372171,"threshold_uncertainty_score":0.13475817},"labels":[],"label_agreement":null},{"id":"W3034013008","doi":"10.18280/isi.250210","title":"Secret Sharing with Reduced Share Size and Data Integrity","year":2020,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Data integrity; Data sharing; Computer security; Internet privacy; Medicine","score_opus":0.03977279335677188,"score_gpt":0.2555925090184146,"score_spread":0.21581971566164276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034013008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10888712,0.000545308,0.8827516,0.0004727234,0.000101431346,0.00017447768,0.00017747682,0.00060241285,0.006287391],"genre_scores_gemma":[0.9068428,0.0003136515,0.08757996,0.000102979466,0.00013125205,0.0001302053,0.0002047339,0.000057113888,0.004637266],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975541,0.00034730235,0.00017046917,0.0005324681,0.0010596886,0.00033596499],"domain_scores_gemma":[0.99594915,0.0008452215,0.00061282114,0.0018807148,0.00057930505,0.00013276679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071115076,0.00059562246,0.0009884213,0.00059505337,0.000890466,0.0014891727,0.0016395546,0.00096631877,0.0022695907],"category_scores_gemma":[0.00408099,0.00030837688,0.00082820974,0.001326513,0.0013537059,0.004837598,0.003088018,0.00094091333,0.0007027431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001667611,0.00033920517,0.0027960914,0.0006051018,0.00027158912,0.0017479806,0.0012386867,0.15725593,0.36482087,0.17018576,0.0037977751,0.29527333],"study_design_scores_gemma":[0.00015907717,0.0009718528,0.0010709764,0.000055488366,0.00014806808,0.003052284,0.00036109798,0.63767654,0.2683151,0.07059256,0.017447004,0.00014990407],"about_ca_topic_score_codex":0.00042471313,"about_ca_topic_score_gemma":0.0002594757,"teacher_disagreement_score":0.0022695907,"about_ca_system_score_codex":0.0006963823,"about_ca_system_score_gemma":0.00090696965,"threshold_uncertainty_score":0.007592559},"labels":[],"label_agreement":null},{"id":"W3037400974","doi":"10.4230/lipics.itc.2020.7","title":"Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Leakage (economics); Secret sharing; Affine transformation; Bounded function; Mathematics; Access structure; Oracle; Computer science; Information leakage; Random oracle; Discrete mathematics; Topology (electrical circuits); Cryptography; Encryption; Combinatorics; Algorithm; Computer network; Public-key cryptography; Pure mathematics; Mathematical analysis","score_opus":0.028446762039231927,"score_gpt":0.2550328808854351,"score_spread":0.22658611884620314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037400974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06521232,0.0011454695,0.9232182,0.001064766,0.000112586386,0.00020475454,0.00035025435,0.0007258023,0.0079658395],"genre_scores_gemma":[0.9461171,0.00089098886,0.045517955,0.0003983149,0.000097810866,0.00020393371,0.00022815002,0.00014891352,0.0063968776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934683,0.002087659,0.00038507825,0.0013222236,0.001535184,0.0012014043],"domain_scores_gemma":[0.9833965,0.0076732575,0.0019360252,0.0056537064,0.00078847463,0.0005519766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049448875,0.001552246,0.0022453556,0.0012499106,0.0015704466,0.0038198754,0.00345965,0.0033387155,0.0050428603],"category_scores_gemma":[0.018159077,0.0010574325,0.0035282385,0.0017517371,0.005348669,0.01643522,0.0069781747,0.006304977,0.0011676563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003143429,0.00008168031,0.0003843477,0.0002764746,0.00013554448,0.00027062153,0.0005071387,0.14046113,0.0072220825,0.8400273,0.0013401064,0.008979331],"study_design_scores_gemma":[0.000056236695,0.0001387285,0.00013373836,0.0000808414,0.00007515346,0.0002869569,0.00008283699,0.43460274,0.006837599,0.5545959,0.003032413,0.00007703891],"about_ca_topic_score_codex":0.0010538438,"about_ca_topic_score_gemma":0.00058054057,"teacher_disagreement_score":0.0050428603,"about_ca_system_score_codex":0.0046199937,"about_ca_system_score_gemma":0.0021149556,"threshold_uncertainty_score":0.03352058},"labels":[],"label_agreement":null},{"id":"W3037789107","doi":"10.1109/tdsc.2020.3004442","title":"Achieving Efficient and Privacy-Preserving Exact Set Similarity Search over Encrypted Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Nearest neighbor search; Data mining; Set (abstract data type); Similarity (geometry); Tree (set theory); Information privacy; Server; Theoretical computer science; Mathematics; Computer security; Artificial intelligence; Image (mathematics); Computer network","score_opus":0.05970768965338365,"score_gpt":0.2883740473154003,"score_spread":0.22866635766201665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037789107","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102827005,0.00073690177,0.8913261,0.00034364776,0.0000606155,0.00017777937,0.00044685398,0.00056675175,0.0035142126],"genre_scores_gemma":[0.81835896,0.00057368836,0.1777987,0.00013928865,0.000059382575,0.00012105682,0.0006342495,0.00003090288,0.0022838253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710554,0.00045614797,0.0003545471,0.00037523123,0.0013754194,0.000333192],"domain_scores_gemma":[0.9974511,0.0006465076,0.0003713871,0.0010669415,0.0003710676,0.00009297167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010411509,0.0003787348,0.0012507698,0.0010062908,0.0007907611,0.0012210667,0.0012542546,0.0008187559,0.0011105832],"category_scores_gemma":[0.003955088,0.00025354527,0.0007222521,0.0027557074,0.0006430323,0.0043854793,0.0023585686,0.00085986854,0.00053212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017982293,0.0006781578,0.0060304203,0.0007492068,0.00028436058,0.0011043346,0.0009332774,0.152307,0.1468862,0.17191517,0.009871519,0.50744206],"study_design_scores_gemma":[0.00016379505,0.00046861498,0.0014196215,0.00003746559,0.00008190154,0.0023636757,0.00030694823,0.8394365,0.08241216,0.06456394,0.0086658895,0.00007953158],"about_ca_topic_score_codex":0.00091957295,"about_ca_topic_score_gemma":0.00081991614,"teacher_disagreement_score":0.0012542546,"about_ca_system_score_codex":0.00071596756,"about_ca_system_score_gemma":0.0017283575,"threshold_uncertainty_score":0.005506158},"labels":[],"label_agreement":null},{"id":"W3041392953","doi":"10.1007/s10207-020-00511-w","title":"A secure architecture for TCP/UDP-based cloud communications","year":2020,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Cloud computing; Computer network; Computer security; Datagram; Transport Layer Security; Encryption; Cloud computing security; Cryptographic protocol; Cryptography; Network packet; Operating system","score_opus":0.01827435196548375,"score_gpt":0.27710849185698416,"score_spread":0.2588341398915004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041392953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04186922,0.0009116534,0.92203355,0.0010578335,0.0007125054,0.00094044843,0.00018024152,0.020519374,0.011775163],"genre_scores_gemma":[0.74354714,0.0009247293,0.23419058,0.0005728006,0.00031331767,0.00050543307,0.00054007623,0.0015610107,0.017844912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975204,0.0003906578,0.00027654326,0.00021159051,0.0010954671,0.00050526106],"domain_scores_gemma":[0.9978125,0.00018195555,0.00019489415,0.00083610683,0.00068096595,0.00029356492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022379032,0.00088217924,0.00082141685,0.0013819508,0.00211521,0.0042642197,0.002694287,0.0014041628,0.0033972696],"category_scores_gemma":[0.0030802917,0.0008884519,0.000798897,0.00090003066,0.0013506184,0.003354368,0.0034557479,0.0029914193,0.0022971719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028815821,0.0009696848,0.0067225285,0.0007214874,0.0003613812,0.0027736018,0.0016025668,0.05810079,0.14106275,0.3587233,0.061621558,0.36445868],"study_design_scores_gemma":[0.00024470477,0.00073079637,0.0017510859,0.00020249093,0.00035342036,0.001307353,0.0002270011,0.7223937,0.12749489,0.049165923,0.095860384,0.00026831974],"about_ca_topic_score_codex":0.0043180897,"about_ca_topic_score_gemma":0.003279563,"teacher_disagreement_score":0.0043180897,"about_ca_system_score_codex":0.0017113318,"about_ca_system_score_gemma":0.0033478322,"threshold_uncertainty_score":0.012416661},"labels":[],"label_agreement":null},{"id":"W3043125119","doi":"10.1007/978-3-030-55304-3_1","title":"Lattice Blind Signatures with Forward Security","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer security; Computer science; Blind signature; Digital signature; Key (lock); Electronic voting; Encryption; Public-key cryptography; Voting; Hash function; Law; Political science","score_opus":0.01681857118055318,"score_gpt":0.2632167991532807,"score_spread":0.24639822797272753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043125119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03528429,0.00091761275,0.87250197,0.0068342392,0.001734153,0.00023322074,0.00080343493,0.0025767453,0.07911433],"genre_scores_gemma":[0.73169124,0.00092899124,0.19735646,0.0022370454,0.0017977966,0.0004971406,0.0007084395,0.0007365657,0.06404632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99175316,0.0025380584,0.00046287072,0.0010366987,0.0031349834,0.0010742245],"domain_scores_gemma":[0.992014,0.0031049564,0.0006011182,0.0024592895,0.0011950479,0.0006257009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037804458,0.0014836744,0.0022684075,0.0021609068,0.0037415917,0.0074404133,0.0019505472,0.0036541633,0.015087855],"category_scores_gemma":[0.011580386,0.0010140897,0.0016334227,0.0027155676,0.006256043,0.01271332,0.008949624,0.008311246,0.009208444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004570045,0.000081281745,0.00008685118,0.000077923985,0.000015494323,0.00005579943,0.00010249833,0.0054231132,0.0016624718,0.9662653,0.0050612525,0.02071098],"study_design_scores_gemma":[0.000051711526,0.000024569732,0.000013000865,0.000013434295,0.000006800642,0.000059965598,0.000020105412,0.012424309,0.0022990224,0.9812077,0.0038541714,0.000025135098],"about_ca_topic_score_codex":0.0005782854,"about_ca_topic_score_gemma":0.00038586714,"teacher_disagreement_score":0.015087855,"about_ca_system_score_codex":0.0029112024,"about_ca_system_score_gemma":0.003385033,"threshold_uncertainty_score":0.05047387},"labels":[],"label_agreement":null},{"id":"W3044604834","doi":"10.1109/tcc.2020.3010915","title":"Fine-Grained Query Authorization With Integrity Verification Over Encrypted Spatial Data in Cloud Storage","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Queen's University","funders":"Natural Science Basic Research Program of Shaanxi Province; Major Scientific and Technological Special Project of Guizhou Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Query optimization; Cloud computing; Merkle tree; Encryption; Transformation (genetics); Database; Sargable; Data mining; Web search query; Information retrieval; Cryptography; Computer network; Algorithm; Search engine; Cryptographic hash function; Operating system","score_opus":0.04028419365098237,"score_gpt":0.27068716861489533,"score_spread":0.23040297496391296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044604834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13809508,0.001341432,0.8511417,0.0007035163,0.00016741177,0.00041092682,0.0002993619,0.0024829928,0.0053576594],"genre_scores_gemma":[0.94397265,0.00028087822,0.05260756,0.00010882769,0.00006309465,0.000062219624,0.00017857776,0.000053255917,0.0026729822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962375,0.0005062395,0.00043878047,0.00051754963,0.0016693583,0.00063052046],"domain_scores_gemma":[0.99588424,0.0005077209,0.00047025454,0.002136523,0.00080783357,0.00019341135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013782765,0.00041692946,0.001053493,0.0008220381,0.001573814,0.001962035,0.0017249133,0.0008842402,0.0020905053],"category_scores_gemma":[0.0032702908,0.00030587486,0.00052385486,0.0016621224,0.0012963377,0.0074696667,0.003350933,0.00096739794,0.00079278724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037617122,0.0004591549,0.008000963,0.0006956975,0.00019121157,0.002745689,0.0021408799,0.10593441,0.22893856,0.2322128,0.011638045,0.40328085],"study_design_scores_gemma":[0.00013912562,0.00048228705,0.0019474018,0.000058525802,0.00010029216,0.0023216393,0.00059717696,0.8120918,0.11585578,0.03990076,0.026322665,0.00018253428],"about_ca_topic_score_codex":0.002910992,"about_ca_topic_score_gemma":0.0017369988,"teacher_disagreement_score":0.002910992,"about_ca_system_score_codex":0.001481326,"about_ca_system_score_gemma":0.0016053612,"threshold_uncertainty_score":0.01074779},"labels":[],"label_agreement":null},{"id":"W3048531936","doi":"10.23977/jeis.2020.51003","title":"An efficient revocable ID-Based key insulated signature scheme to achieve authentication of smart meter","year":2020,"lang":"en","type":"article","venue":"Journal of Electronics and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Smart meter; Smart grid; Key (lock); Public-key cryptography; Scheme (mathematics); Authentication (law); Computer science; Computer network; Signature (topology); Computer security; Smart card; Computation; Message authentication code; Cryptography; Engineering; Encryption; Electrical engineering; Mathematics; Algorithm","score_opus":0.008188697765211759,"score_gpt":0.24182700703937499,"score_spread":0.23363830927416324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048531936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045680568,0.0013540785,0.9411206,0.00066092156,0.00042174512,0.00024697423,0.00010721908,0.0009659625,0.009441856],"genre_scores_gemma":[0.8485636,0.00069736753,0.1400347,0.00032701014,0.00014233548,0.00015049202,0.0002695603,0.000063854524,0.009750982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984018,0.000489166,0.0001668265,0.00025209447,0.0005072867,0.0001828544],"domain_scores_gemma":[0.9990478,0.0001256195,0.0001641011,0.00030823087,0.00027105515,0.00008309945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008459234,0.0005971413,0.00089346356,0.0005859193,0.0007301599,0.0007072173,0.0013472121,0.0008167891,0.0019142294],"category_scores_gemma":[0.0016857096,0.0002665686,0.0007158066,0.0008651039,0.0007939882,0.0029936954,0.0021516585,0.0011352022,0.0009102316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017901122,0.0003346568,0.0013347145,0.0007993541,0.00020210296,0.0012682815,0.0011937775,0.05387597,0.22616948,0.37870345,0.0130712,0.32125685],"study_design_scores_gemma":[0.0005650502,0.0012543882,0.0007324849,0.00011652678,0.00019974537,0.0040129744,0.00029781734,0.7154396,0.12753037,0.073615216,0.075874925,0.00036091826],"about_ca_topic_score_codex":0.00041755053,"about_ca_topic_score_gemma":0.00031245252,"teacher_disagreement_score":0.0019142294,"about_ca_system_score_codex":0.00068192265,"about_ca_system_score_gemma":0.0012911563,"threshold_uncertainty_score":0.006403744},"labels":[],"label_agreement":null},{"id":"W30539646","doi":"10.1007/978-3-642-37899-7_3","title":"Emergency Mobile Access to Personal Health Records Stored on an Untrusted Cloud","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cloud computing; Computer security; Internet privacy; Operating system","score_opus":0.028417384672233807,"score_gpt":0.3002675208677383,"score_spread":0.27185013619550447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30539646","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50089186,0.010181859,0.27067596,0.0083528785,0.00223414,0.00026915994,0.0013910012,0.0044269757,0.20157623],"genre_scores_gemma":[0.9478102,0.0023057058,0.009035562,0.00042356053,0.0004249925,0.000026658847,0.0004113967,0.00008683769,0.03947518],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997873,0.000033021213,0.000012747516,0.000027240487,0.00007477854,0.000064974425],"domain_scores_gemma":[0.99939847,0.00026698696,0.00005914077,0.00015755884,0.000063572894,0.000054241904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002657758,0.00016238098,0.00023123667,0.00021773804,0.0003655081,0.00080568163,0.0006255055,0.0005069342,0.007567831],"category_scores_gemma":[0.0013403549,0.00012439783,0.00018254145,0.00041374742,0.00027014592,0.0014547395,0.001365593,0.0006700347,0.0017786685],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023188593,0.0003033466,0.008896873,0.00072316616,0.000088319226,0.010369542,0.0033420627,0.008936065,0.07771481,0.08633311,0.123487025,0.6774869],"study_design_scores_gemma":[0.00024647728,0.0009753583,0.02891085,0.00079257356,0.00016265897,0.022798013,0.0043161334,0.18149993,0.081384614,0.103921205,0.57483923,0.00015298797],"about_ca_topic_score_codex":0.00034160085,"about_ca_topic_score_gemma":0.00037027962,"teacher_disagreement_score":0.007567831,"about_ca_system_score_codex":0.00020891237,"about_ca_system_score_gemma":0.00018429471,"threshold_uncertainty_score":0.025316894},"labels":[],"label_agreement":null},{"id":"W3054670476","doi":"","title":"Lattice Blind Signatures with Forward Security","year":2020,"lang":"en","type":"book-chapter","venue":"Research Online (University of Wollongong)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Computer security; Blind signature; Digital signature; Key (lock); Electronic voting; Public-key cryptography; Encryption; Voting; Hash function; Law","score_opus":0.04732304134334875,"score_gpt":0.2832489974292591,"score_spread":0.23592595608591033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3054670476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009469864,0.011881972,0.5472556,0.0045423512,0.004464436,0.00019974398,0.0009767953,0.002853111,0.41835615],"genre_scores_gemma":[0.17802814,0.011275671,0.32234105,0.0018168003,0.0024575775,0.00035422877,0.0015526998,0.0011479327,0.48102584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986004,0.00021223431,0.000063294996,0.00019837767,0.000813753,0.000111859146],"domain_scores_gemma":[0.9993868,0.00020260549,0.000040222672,0.000180469,0.00012823862,0.000061701736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009186548,0.0008480695,0.0006789232,0.001141725,0.001269067,0.0035770193,0.0007399914,0.0013104391,0.024535641],"category_scores_gemma":[0.0017767772,0.0005696771,0.00087393966,0.0022864433,0.0025443728,0.005318316,0.0027339256,0.003600336,0.0135155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052663305,0.00002349203,0.000038582093,0.00011265953,0.000006287162,0.000049417475,0.00010292533,0.001776186,0.0017142767,0.8321965,0.027010912,0.13691606],"study_design_scores_gemma":[0.000017501288,0.000032428405,0.000048471364,0.00006674099,0.00000526442,0.00033892758,0.00003446805,0.006777553,0.0029269296,0.6222797,0.36744294,0.000029083525],"about_ca_topic_score_codex":0.0005834981,"about_ca_topic_score_gemma":0.00039850207,"teacher_disagreement_score":0.024535641,"about_ca_system_score_codex":0.002079849,"about_ca_system_score_gemma":0.0016944807,"threshold_uncertainty_score":0.08207983},"labels":[],"label_agreement":null},{"id":"W3081268221","doi":"10.1109/isit44484.2020.9174519","title":"On the Randomized Babai Point","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Integer (computer science); Point (geometry); Mathematics; Randomized algorithm; Gaussian; Discrete mathematics; Algorithm; Combinatorics; Mathematical optimization; Computer science","score_opus":0.017347322367826153,"score_gpt":0.2106632343562866,"score_spread":0.19331591198846043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081268221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017532058,0.0013637667,0.96777844,0.002216857,0.00022332628,0.00008492547,0.00016452606,0.00043505605,0.010201009],"genre_scores_gemma":[0.69341713,0.0032351692,0.28196916,0.0022045018,0.0014520643,0.0012112781,0.0005832531,0.0007496149,0.015177908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863679,0.0072034043,0.00036479376,0.0018660605,0.003201032,0.0009969536],"domain_scores_gemma":[0.91308296,0.07214011,0.003921009,0.0055265515,0.0042426107,0.0010868439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01858262,0.0022344699,0.003484272,0.0037818698,0.0025349522,0.0032399723,0.0031620206,0.004608047,0.0067652413],"category_scores_gemma":[0.08614669,0.0017342782,0.0020925256,0.003251901,0.011081562,0.011437986,0.006884671,0.008830687,0.002165694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026451098,0.00003634542,0.0006856334,0.000110695306,0.000073128365,0.00014229861,0.00016669378,0.10596948,0.0008534111,0.87400097,0.0033853839,0.014311389],"study_design_scores_gemma":[0.00007181401,0.00008301862,0.00018434247,0.00008397109,0.000024991521,0.000113105,0.00004124852,0.39504942,0.00077311444,0.6010068,0.0025148613,0.00005322446],"about_ca_topic_score_codex":0.002198942,"about_ca_topic_score_gemma":0.0011595219,"teacher_disagreement_score":0.01858262,"about_ca_system_score_codex":0.0025518711,"about_ca_system_score_gemma":0.0029746634,"threshold_uncertainty_score":0.09827548},"labels":[],"label_agreement":null},{"id":"W3081538755","doi":"10.1002/ett.4102","title":"ECS‐CP‐ABE: A lightweight elliptic curve signcryption scheme based on ciphertext‐policy attribute‐based encryption to secure downlink multicast communication in edge envisioned advanced metering infrastructure networks","year":2020,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Signcryption; Computer science; Ciphertext; Computer network; Multicast; Secure communication; Encryption; Forward secrecy; Elliptic curve cryptography; Public-key cryptography; Distributed computing; Computer security","score_opus":0.01652144138896864,"score_gpt":0.2685074615235339,"score_spread":0.2519860201345652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081538755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07526603,0.0005188697,0.91483134,0.000692966,0.00027201883,0.00030456966,0.000097404816,0.0006499581,0.007366795],"genre_scores_gemma":[0.90203696,0.00033007722,0.09302318,0.00018036304,0.00009958353,0.00015446644,0.00010796183,0.000029310078,0.0040381034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860257,0.00044942572,0.00011398568,0.00013492574,0.00050737686,0.00019172608],"domain_scores_gemma":[0.9990588,0.00018166979,0.00015446017,0.00031734456,0.00020074943,0.00008690606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010955527,0.0003198003,0.0005433718,0.00049271045,0.00071487535,0.0009314123,0.00083546597,0.00081542233,0.0014228101],"category_scores_gemma":[0.0015193368,0.00015977399,0.0005136974,0.00053342764,0.0010081241,0.002034939,0.0018461524,0.001489077,0.0005474208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011656831,0.0005948338,0.0018584862,0.000385481,0.00016589231,0.0014507272,0.00066068856,0.09226331,0.1978397,0.5387647,0.009985985,0.15486443],"study_design_scores_gemma":[0.00015557116,0.0005513662,0.0006945355,0.00006861323,0.00006271249,0.0010725202,0.00013709038,0.8191024,0.0916126,0.056582596,0.029850466,0.00010957862],"about_ca_topic_score_codex":0.00037478955,"about_ca_topic_score_gemma":0.00027671718,"teacher_disagreement_score":0.0014228101,"about_ca_system_score_codex":0.00071267824,"about_ca_system_score_gemma":0.0010143283,"threshold_uncertainty_score":0.0057938695},"labels":[],"label_agreement":null},{"id":"W3082002037","doi":"10.1109/embc44109.2020.9175792","title":"A Secure Privacy Preserving Cloud-based Framework for Sharing Electronic Health Data","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Cloud computing; Encryption; Outsourcing; Computer security; Server; Access control; Data sharing; Information privacy; Cloud storage; Attribute-based encryption; Database; Computer network; Public-key cryptography; Operating system","score_opus":0.07584777313754498,"score_gpt":0.3314666321816465,"score_spread":0.25561885904410153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082002037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013929936,0.00058661704,0.9721994,0.0017117048,0.00018491445,0.0006286977,0.00030233257,0.00094739365,0.009508999],"genre_scores_gemma":[0.46885937,0.0009892273,0.5130645,0.00048710097,0.00016752514,0.00043313578,0.0005317778,0.00012556893,0.01534178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972366,0.00064339495,0.00020409576,0.00033494388,0.0011991588,0.0003817111],"domain_scores_gemma":[0.9987275,0.00016742914,0.00012652192,0.00042853196,0.00027728511,0.00027267114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024161648,0.00038555177,0.00072455883,0.00079506787,0.0022295052,0.0036898018,0.0025904605,0.0015310826,0.003279122],"category_scores_gemma":[0.0019440657,0.0003575096,0.0011912328,0.0011948352,0.0014426201,0.003207576,0.0044024196,0.0017312504,0.0012595976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046636103,0.00033380088,0.00122351,0.0002454416,0.00013037556,0.0029295739,0.00082904863,0.06660898,0.022095686,0.8239994,0.0160961,0.06504176],"study_design_scores_gemma":[0.00013440338,0.00024886182,0.00092712964,0.0001254737,0.00008121861,0.0029798017,0.00043731753,0.7000676,0.014936618,0.15771832,0.122189954,0.0001533267],"about_ca_topic_score_codex":0.0049914336,"about_ca_topic_score_gemma":0.0053996197,"teacher_disagreement_score":0.0049914336,"about_ca_system_score_codex":0.0018822396,"about_ca_system_score_gemma":0.0042213025,"threshold_uncertainty_score":0.013656676},"labels":[],"label_agreement":null},{"id":"W3082420143","doi":"","title":"Secure Multi-party Computation of Differentially Private Median","year":2020,"lang":"en","type":"article","venue":"USENIX Security Symposium","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computation; Computer security; Secure multi-party computation; Cryptography; Algorithm","score_opus":0.018434014743727356,"score_gpt":0.24050211361648072,"score_spread":0.22206809887275336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082420143","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0953386,0.0002679065,0.89033675,0.0010417139,0.0002105734,0.00014311529,0.00054618734,0.0016730812,0.010442],"genre_scores_gemma":[0.8720192,0.00009018071,0.11950632,0.00019998554,0.00009009354,0.0001733833,0.00043732446,0.00013319241,0.007350304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968624,0.0007370491,0.00020684599,0.00060450356,0.00096234854,0.00062680244],"domain_scores_gemma":[0.9973037,0.00079647097,0.00016919932,0.0013377961,0.00024019352,0.00015262302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024295591,0.00052693195,0.0017314934,0.0005829369,0.0014401473,0.0027794589,0.00199476,0.001658013,0.0074656024],"category_scores_gemma":[0.0053524147,0.00049491617,0.001255109,0.0011397353,0.0014356524,0.0031335144,0.005615133,0.0022864563,0.0017700588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004141179,0.00035242978,0.002370081,0.00024785395,0.00025485596,0.00038399248,0.0004013728,0.25063092,0.029210852,0.5516149,0.010556537,0.14983507],"study_design_scores_gemma":[0.00022958558,0.00017517747,0.0003496175,0.000025320265,0.00003674263,0.00013220946,0.00005607526,0.6427517,0.01920663,0.3329574,0.004045515,0.000034064084],"about_ca_topic_score_codex":0.00055528485,"about_ca_topic_score_gemma":0.0010418097,"teacher_disagreement_score":0.0074656024,"about_ca_system_score_codex":0.00222983,"about_ca_system_score_gemma":0.0019800805,"threshold_uncertainty_score":0.024974942},"labels":[],"label_agreement":null},{"id":"W3088451060","doi":"10.1109/mce.2020.3024512","title":"Artificially Intelligent Electronic Money","year":2020,"lang":"en","type":"article","venue":"IEEE Consumer Electronics Magazine","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Electronic cash; Computer science; Anonymity; Computer security; Cash; Encryption; Cryptography; Authentication (law); Payment; Electronic money; Cryptocurrency; Scheme (mathematics); Internet privacy; Business; Finance; World Wide Web","score_opus":0.019462965109936396,"score_gpt":0.2406390205145529,"score_spread":0.22117605540461652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088451060","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3514077,0.00046980288,0.53975916,0.0022608181,0.0004936694,0.00027990356,0.00025362798,0.0013445049,0.10373084],"genre_scores_gemma":[0.92909694,0.00020619696,0.057795707,0.00020709283,0.0000604806,0.00013298013,0.000121906356,0.0000578284,0.0123209525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945706,0.00020467021,0.000029931622,0.000081339545,0.00015220564,0.00007490149],"domain_scores_gemma":[0.9983992,0.00075016374,0.00016382449,0.00038548926,0.0001962451,0.000105116385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065003696,0.00033121198,0.00032784548,0.00040408032,0.0007526657,0.0017289042,0.0008246027,0.0010024399,0.006286356],"category_scores_gemma":[0.0052779303,0.00020571593,0.00030041407,0.00037091097,0.0018320098,0.0027268738,0.0016831236,0.00092564855,0.00075844344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032370607,0.00014152545,0.0018503881,0.00015204593,0.000032637454,0.00033261644,0.000330073,0.19985092,0.014208301,0.721526,0.0044962587,0.056755617],"study_design_scores_gemma":[0.00006123037,0.0001371114,0.000760844,0.00003003731,0.000021820455,0.00028811477,0.0001124368,0.785686,0.008089033,0.1799627,0.024813883,0.00003678806],"about_ca_topic_score_codex":0.0002994801,"about_ca_topic_score_gemma":0.0002727838,"teacher_disagreement_score":0.006286356,"about_ca_system_score_codex":0.00076389045,"about_ca_system_score_gemma":0.00052650267,"threshold_uncertainty_score":0.02102995},"labels":[],"label_agreement":null},{"id":"W3089626165","doi":"10.1109/tdsc.2020.3027579","title":"Enabling Efficient, Secure and Privacy-Preserving Mobile Cloud Storage","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Cloud computing; Encryption; Cloud storage; Overhead (engineering); Computer network; Verifiable secret sharing; Scheme (mathematics); Mobile device; Distributed computing; Computer security; Operating system","score_opus":0.0158812799605622,"score_gpt":0.23286554689242162,"score_spread":0.2169842669318594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089626165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16159573,0.0031227877,0.82105875,0.0009616992,0.00022789986,0.00038069926,0.00040230528,0.0020437161,0.010206386],"genre_scores_gemma":[0.9428755,0.00075892766,0.05315422,0.000107259526,0.00008433731,0.000074024494,0.00016598887,0.000031648276,0.0027482172],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921966,0.000085304986,0.00005536885,0.00008693946,0.00034806906,0.00020460285],"domain_scores_gemma":[0.9992404,0.00009934705,0.00010059485,0.0003730003,0.00013970221,0.00004697466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003375682,0.00037153135,0.0005213492,0.00051153963,0.0009643321,0.001102243,0.0011146436,0.0006542366,0.0014519092],"category_scores_gemma":[0.0010303918,0.00021928204,0.0003998476,0.0010322719,0.00073712575,0.003043759,0.0026954378,0.0006950307,0.00061334035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014475817,0.0001972193,0.0044742343,0.0007845294,0.00013803662,0.0019486838,0.0007884372,0.06063518,0.35121334,0.24877633,0.013140438,0.31645605],"study_design_scores_gemma":[0.00013753856,0.00043583167,0.0018526529,0.000095893294,0.00011859867,0.0028523328,0.0005143493,0.5999958,0.28799903,0.049276277,0.056584902,0.00013694081],"about_ca_topic_score_codex":0.0012448599,"about_ca_topic_score_gemma":0.001143161,"teacher_disagreement_score":0.0014519092,"about_ca_system_score_codex":0.00075390976,"about_ca_system_score_gemma":0.0012849983,"threshold_uncertainty_score":0.0054700375},"labels":[],"label_agreement":null},{"id":"W3091369864","doi":"10.1016/j.csi.2020.103489","title":"An efficient multivariate threshold ring signature scheme","year":2020,"lang":"en","type":"article","venue":"Computer Standards & Interfaces","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"Australian Research Council; Concordia University of Edmonton","keywords":"Ring signature; Signature (topology); Computer science; Protocol (science); Algorithm; Scheme (mathematics); Schnorr signature; Multivariate statistics; Identification (biology); Ring (chemistry); Mathematics; Blind signature; Encryption; Computer network; Public-key cryptography; Machine learning","score_opus":0.01840735275007331,"score_gpt":0.28255700798516453,"score_spread":0.2641496552350912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091369864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15580334,0.0013174913,0.80719376,0.0017148162,0.00038999974,0.0003554466,0.0009391114,0.0032643971,0.029021597],"genre_scores_gemma":[0.81514204,0.000639973,0.16026711,0.00028099274,0.00016548352,0.00011881912,0.00077623356,0.00016931628,0.022440013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.00016420895,0.00008166666,0.00016265984,0.00047530618,0.00017143184],"domain_scores_gemma":[0.9993319,0.000110792666,0.00010247281,0.00026197464,0.00010820201,0.000084712585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006980501,0.0004631421,0.0007683826,0.0005807766,0.00061913044,0.0014866628,0.00077236374,0.00063573814,0.006589032],"category_scores_gemma":[0.0013331654,0.00026635063,0.0004462303,0.0012316897,0.0005379495,0.003287772,0.0020231102,0.0012824013,0.0022599215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001955718,0.0004340512,0.0011593204,0.0004777948,0.000088359295,0.00031535857,0.0002847063,0.03041408,0.13534312,0.5238952,0.012885506,0.29274672],"study_design_scores_gemma":[0.00062568445,0.0009133366,0.0021004328,0.00010354004,0.00022146717,0.0020479641,0.00016232612,0.3634257,0.13962491,0.3977928,0.0927318,0.00025007242],"about_ca_topic_score_codex":0.00025601132,"about_ca_topic_score_gemma":0.00032346396,"teacher_disagreement_score":0.006589032,"about_ca_system_score_codex":0.0009435567,"about_ca_system_score_gemma":0.0016318393,"threshold_uncertainty_score":0.022042513},"labels":[],"label_agreement":null},{"id":"W3092431601","doi":"10.48550/arxiv.2010.03465","title":"Hiding the Access Pattern is Not Enough: Exploiting Search Pattern Leakage in Searchable Encryption","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Information leakage; Encryption; Limiting; Set (abstract data type); Computer security; Symmetric-key algorithm; Public-key cryptography","score_opus":0.22122970717531404,"score_gpt":0.24424405794788684,"score_spread":0.0230143507725728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092431601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43079156,0.002233055,0.5520307,0.004768732,0.000093833376,0.00016193607,0.00046341933,0.0013185062,0.008138357],"genre_scores_gemma":[0.97629887,0.0002912947,0.022005271,0.00025637235,0.000034172645,0.000030015999,0.000079663194,0.00004461699,0.0009596692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915275,0.0037543834,0.00064134435,0.00058660505,0.0026140946,0.00087606057],"domain_scores_gemma":[0.97642875,0.012329825,0.0020922548,0.007997708,0.0008024536,0.0003489784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046850587,0.00055438635,0.0011204996,0.0009067031,0.0010030847,0.002049292,0.0013078557,0.0018553821,0.0010058461],"category_scores_gemma":[0.021811258,0.0006493999,0.000868386,0.0018463974,0.003284851,0.010493992,0.004447016,0.0028569659,0.00049069646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003353781,0.0007115538,0.024847241,0.0007175683,0.00049378036,0.0028700472,0.0027784326,0.14338805,0.084708475,0.4175025,0.008922121,0.3097065],"study_design_scores_gemma":[0.00016171257,0.0003663652,0.0029153812,0.00013160562,0.0001344815,0.0035516832,0.00051451195,0.68663585,0.06754387,0.23002581,0.007887366,0.00013137312],"about_ca_topic_score_codex":0.0006309644,"about_ca_topic_score_gemma":0.00047280462,"teacher_disagreement_score":0.0046850587,"about_ca_system_score_codex":0.0015164677,"about_ca_system_score_gemma":0.001222635,"threshold_uncertainty_score":0.024777234},"labels":[],"label_agreement":null},{"id":"W3093259370","doi":"10.1109/icbc51069.2021.9461070","title":"PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks","year":2021,"lang":"en","type":"preprint","venue":"2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Public Works and Government Services Canada; University of Waterloo; Royal Bank of Canada","keywords":"Computer science; Hash function; Digital signature; Cryptography; Computer security; Authentication (law); Digital Signature Algorithm; Elliptic Curve Digital Signature Algorithm; Credential; Quantum; Public key infrastructure; Public-key cryptography; Theoretical computer science; Encryption; Elliptic curve cryptography; Physics","score_opus":0.04948060463771533,"score_gpt":0.3071640441469687,"score_spread":0.2576834395092534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093259370","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20233662,0.00042394196,0.7151328,0.0011421941,0.00034618165,0.0010254784,0.00059945026,0.029979018,0.049014337],"genre_scores_gemma":[0.82865924,0.00032909057,0.13890123,0.00028281266,0.00007842033,0.00037838164,0.0007168359,0.00088842056,0.02976557],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988501,0.00022283795,0.000055731274,0.00009882981,0.000551977,0.00022041537],"domain_scores_gemma":[0.9985896,0.00020337175,0.000100820245,0.00069244846,0.00020495783,0.00020881675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012411429,0.00035009583,0.00030067167,0.0004800265,0.00067533035,0.0013827375,0.0011094386,0.00080370094,0.009837229],"category_scores_gemma":[0.0021850378,0.000299124,0.00024153726,0.00048391457,0.0011436478,0.0027008476,0.002519445,0.0009907834,0.002283847],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003230784,0.0008949026,0.004394009,0.0005136693,0.00007814454,0.001187994,0.0011055452,0.116917536,0.10323209,0.28511778,0.0393021,0.4440254],"study_design_scores_gemma":[0.000810918,0.0011586446,0.0019406606,0.00012863483,0.000052075175,0.00072187127,0.00020938196,0.64316905,0.08392674,0.10573663,0.16197988,0.00016557207],"about_ca_topic_score_codex":0.0023669254,"about_ca_topic_score_gemma":0.0024811341,"teacher_disagreement_score":0.009837229,"about_ca_system_score_codex":0.0006269021,"about_ca_system_score_gemma":0.002005322,"threshold_uncertainty_score":0.032908857},"labels":[],"label_agreement":null},{"id":"W3094390539","doi":"10.1109/jiot.2020.3033337","title":"Cryptanalysis and Improvement of a Pairing-Free Certificateless Aggregate Signature in Healthcare Wireless Medical Sensor Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Xidian University; National Natural Science Foundation of China","keywords":"Computer science; Random oracle; Wireless sensor network; Computer network; Computer security; Vulnerability (computing); Signature (topology); Scheme (mathematics); Public-key cryptography; Encryption; Mathematics","score_opus":0.015455768909726386,"score_gpt":0.2406687916291643,"score_spread":0.2252130227194379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094390539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066142574,0.0010164649,0.92642,0.0008267159,0.00029063778,0.00019674483,0.000060185623,0.00039731874,0.0046493467],"genre_scores_gemma":[0.85412455,0.0007631867,0.14145184,0.00023902982,0.00017167666,0.00011512851,0.00011450831,0.000030732088,0.002989352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956714,0.00142366,0.00030260405,0.0004426098,0.0018108672,0.00034893333],"domain_scores_gemma":[0.9976489,0.00085865136,0.00025715606,0.00071784004,0.00039020096,0.00012732163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026439342,0.00053194526,0.00088557194,0.0008899367,0.00073171424,0.0011598477,0.0010672377,0.0010370011,0.0010783004],"category_scores_gemma":[0.0056351447,0.00030505855,0.001115409,0.0012480399,0.001803016,0.0029661788,0.0025066193,0.0018833292,0.00034608116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015956361,0.00031995916,0.002884894,0.0005212999,0.00022826438,0.0012737158,0.0011973124,0.17044465,0.08459935,0.5310937,0.0045845853,0.2012566],"study_design_scores_gemma":[0.00024807377,0.000902021,0.00086220884,0.00007818116,0.00012636965,0.0018257749,0.00014211876,0.83679533,0.05591019,0.090008005,0.012956224,0.00014544073],"about_ca_topic_score_codex":0.00036132956,"about_ca_topic_score_gemma":0.00016669648,"teacher_disagreement_score":0.0026439342,"about_ca_system_score_codex":0.0010846478,"about_ca_system_score_gemma":0.0016623448,"threshold_uncertainty_score":0.013982594},"labels":[],"label_agreement":null},{"id":"W3100371214","doi":"10.1016/j.procs.2020.10.070","title":"An Effective and Efficient Technique for Supporting Privacy-Preserving Keyword-Based Search over Encrypted Data in Clouds","year":2020,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; University of Manitoba","keywords":"Computer science; Encryption; Plaintext; Cloud computing; Keyword search; Information retrieval; Matching (statistics); Database; Computer security","score_opus":0.03024980591145811,"score_gpt":0.31985418431925433,"score_spread":0.28960437840779624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100371214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06251638,0.0023931493,0.926937,0.0004133225,0.00013035267,0.0004082433,0.0005946692,0.0032067595,0.003400122],"genre_scores_gemma":[0.5139424,0.0015010453,0.4807621,0.00012758147,0.00011024906,0.00014984778,0.000710832,0.000101155754,0.002594766],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967437,0.0004673568,0.00034713408,0.00026382288,0.0018679702,0.00031007882],"domain_scores_gemma":[0.99675757,0.0007242483,0.00047499378,0.0013145464,0.00062797376,0.00010078712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012067708,0.0005394231,0.0010308214,0.0020196289,0.0011381241,0.0013346722,0.0010015512,0.00068894186,0.0013510268],"category_scores_gemma":[0.004249782,0.00033146626,0.00073452,0.0028292346,0.00064841716,0.0040308447,0.0016479746,0.0006733346,0.0010792135],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016437917,0.00051309395,0.006083651,0.0010132198,0.0002849989,0.0016432933,0.0010446683,0.03376065,0.23451301,0.04954006,0.01507796,0.65488154],"study_design_scores_gemma":[0.00022566252,0.00070955156,0.003866917,0.0001373684,0.00026758682,0.008848009,0.0010480144,0.57307225,0.3405739,0.029783405,0.041262034,0.00020526965],"about_ca_topic_score_codex":0.0032518066,"about_ca_topic_score_gemma":0.0027423368,"teacher_disagreement_score":0.0032518066,"about_ca_system_score_codex":0.0006795805,"about_ca_system_score_gemma":0.00228184,"threshold_uncertainty_score":0.0064657927},"labels":[],"label_agreement":null},{"id":"W3100957129","doi":"10.1007/s13389-020-00250-7","title":"Removable weak keys for discrete logarithm-based cryptography","year":2020,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Electronics and Information technology","keywords":"Public-key cryptography; Cryptosystem; Cryptography; Discrete logarithm; Prime (order theory); Key (lock); Security parameter; Elliptic curve cryptography; Set (abstract data type)","score_opus":0.013287265691632822,"score_gpt":0.21860072871977637,"score_spread":0.20531346302814354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100957129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08042666,0.0029440215,0.8798778,0.0031510487,0.0014604364,0.00030782996,0.00043307152,0.0015201538,0.029878959],"genre_scores_gemma":[0.7761319,0.002373506,0.16568768,0.00085999793,0.0011547457,0.00044342445,0.0008870092,0.00051116024,0.051950555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680495,0.00064864836,0.00034579867,0.00044399564,0.0012800068,0.0004765775],"domain_scores_gemma":[0.9942409,0.00179151,0.0004130917,0.0027118279,0.0005276569,0.00031514387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025224448,0.0011109044,0.0014642829,0.0014237115,0.0020270718,0.004780394,0.002618971,0.0018423891,0.0078111794],"category_scores_gemma":[0.009811809,0.0009287543,0.0012560645,0.001721272,0.0036184574,0.012817146,0.008607788,0.007041679,0.0043772655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001104573,0.00022192985,0.00039587336,0.00042976096,0.00007408227,0.00038154513,0.00047317933,0.0069914996,0.01914278,0.8571057,0.007583572,0.10609548],"study_design_scores_gemma":[0.00019550497,0.00024389225,0.00015866179,0.00010540447,0.000074975556,0.0004958903,0.00015465776,0.028969279,0.020672848,0.92409754,0.024740955,0.000090347436],"about_ca_topic_score_codex":0.00018902242,"about_ca_topic_score_gemma":0.0002504837,"teacher_disagreement_score":0.0078111794,"about_ca_system_score_codex":0.0012000472,"about_ca_system_score_gemma":0.0016017382,"threshold_uncertainty_score":0.026131034},"labels":[],"label_agreement":null},{"id":"W3102182498","doi":"10.1109/dasc-picom-cbdcom-cyberscitech49142.2020.00098","title":"Secure Count Query on Encrypted Heterogeneous Data","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Encryption; Outsourcing; Cloud computing; Confidentiality; Query optimization; Information privacy; Data mining; Database; Cryptography; Computer network; Computer security","score_opus":0.06265270707303688,"score_gpt":0.26314680666826,"score_spread":0.20049409959522313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102182498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.338463,0.00067599205,0.64903784,0.001751093,0.00011237341,0.0002956486,0.0012727533,0.002051985,0.0063392296],"genre_scores_gemma":[0.95213497,0.00015818363,0.044903085,0.00018808237,0.000051057945,0.000100191945,0.00053884723,0.000054661068,0.0018709197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612373,0.00067962083,0.00036779273,0.0005318531,0.0017060089,0.00059100735],"domain_scores_gemma":[0.99562126,0.001717946,0.00046655568,0.001629122,0.00044650264,0.0001186081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016312592,0.00045547824,0.0011873235,0.00062732585,0.0010263162,0.0022048287,0.0011227999,0.00094229676,0.0017354732],"category_scores_gemma":[0.005321912,0.00022081805,0.0005759842,0.0013257035,0.0012247167,0.005067477,0.0034313663,0.00093347434,0.0006266778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0076031997,0.00060320104,0.011424638,0.00062814425,0.00030915512,0.0034471632,0.001762664,0.2212514,0.1734549,0.2954894,0.020303618,0.2637226],"study_design_scores_gemma":[0.00019916114,0.0003120413,0.0011215822,0.000028637427,0.000057275745,0.0010306288,0.00037060486,0.8175101,0.081557855,0.09035793,0.0074103298,0.000043848093],"about_ca_topic_score_codex":0.0009389118,"about_ca_topic_score_gemma":0.0005762409,"teacher_disagreement_score":0.0022048287,"about_ca_system_score_codex":0.0014932752,"about_ca_system_score_gemma":0.0011877216,"threshold_uncertainty_score":0.010834515},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019910224597495207,"score_gpt":0.2479268264051,"score_spread":0.2280166018076048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105676249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047897704,0.00028722355,0.9364586,0.0010166881,0.00013520852,0.00017447659,0.00011195718,0.0003164918,0.0136016635],"genre_scores_gemma":[0.80803967,0.00034454837,0.18118007,0.0003404112,0.00013845069,0.0002695076,0.00013860659,0.00007462133,0.009474187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966665,0.0008232485,0.00020660406,0.0005033656,0.0014612211,0.00033905578],"domain_scores_gemma":[0.9964799,0.00118184,0.00032319923,0.0016458743,0.00025283205,0.00011634606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022159996,0.0005583777,0.0010860225,0.00038336488,0.0013840563,0.0017370905,0.0017031934,0.0014374952,0.002485469],"category_scores_gemma":[0.0057679745,0.00044510126,0.00088511093,0.00091049314,0.0035273854,0.005065537,0.0037823226,0.0021497244,0.0007332318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010558571,0.000046580528,0.0001920944,0.00009293155,0.000027384456,0.00012067424,0.00019555014,0.023611428,0.0057363813,0.9506119,0.0009249097,0.018334668],"study_design_scores_gemma":[0.000073125644,0.000068855355,0.00011931146,0.000019981377,0.000022172,0.000115026676,0.00003585685,0.29950795,0.01237305,0.6813215,0.0063142166,0.000028992825],"about_ca_topic_score_codex":0.0003487585,"about_ca_topic_score_gemma":0.00037965918,"teacher_disagreement_score":0.002485469,"about_ca_system_score_codex":0.0007936357,"about_ca_system_score_gemma":0.0015043468,"threshold_uncertainty_score":0.011719465},"labels":[],"label_agreement":null},{"id":"W3107860977","doi":"10.1109/ccece47787.2020.9255710","title":"PMTRU: An Efficient and Resistant Variant of the NTRU Public Key Cryptosystem","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"NTRU; Cryptosystem; Computer science; Public key cryptosystem; Public-key cryptography; Hybrid cryptosystem; Key (lock); Encryption; Theoretical computer science; Computer security","score_opus":0.022383422711762753,"score_gpt":0.2068636535705546,"score_spread":0.18448023085879187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107860977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05493729,0.0008944623,0.92706114,0.0006050442,0.00024813367,0.0002718523,0.00011591634,0.0026570065,0.013209139],"genre_scores_gemma":[0.71885234,0.00056494295,0.27430877,0.0002653035,0.0002126706,0.00020322688,0.00019017655,0.00022677715,0.0051758615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976489,0.0007699911,0.0001389044,0.00032474662,0.0008822412,0.00023520048],"domain_scores_gemma":[0.99789006,0.0005407024,0.00023713594,0.0010225561,0.00021195495,0.00009762288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012369863,0.00042042648,0.0008902424,0.00078385137,0.0007823078,0.0011496017,0.0013534913,0.00080799655,0.002193218],"category_scores_gemma":[0.0039363997,0.0003093881,0.00043407423,0.0007652292,0.0014713213,0.0036246325,0.002024176,0.0024526978,0.00078437664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001300608,0.00029837355,0.001103414,0.0005865311,0.00013841614,0.0010309642,0.00043799958,0.03557687,0.13009702,0.5756315,0.010380231,0.24341805],"study_design_scores_gemma":[0.0004534682,0.001407261,0.0011493355,0.00013863375,0.000131216,0.0058990633,0.00017417263,0.5513903,0.21928689,0.13200521,0.08771946,0.00024501357],"about_ca_topic_score_codex":0.00021003844,"about_ca_topic_score_gemma":0.00021855129,"teacher_disagreement_score":0.002193218,"about_ca_system_score_codex":0.0005254175,"about_ca_system_score_gemma":0.0008599513,"threshold_uncertainty_score":0.0073370337},"labels":[],"label_agreement":null},{"id":"W3107988267","doi":"10.22331/q-2023-07-06-1047","title":"Composably secure device-independent encryption with certified deletion","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; QuantERA; Centre for Quantum Technologies; Ministry of Education, India; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Research Foundation; Ministry of Education - Singapore; National Science Foundation; National University of Singapore; Agence Nationale de la Recherche","keywords":"Computer science; Certification; Encryption; MAGIC (telescope); Protocol (science); Task (project management); Magic square; Theoretical computer science; Cryptographic protocol; Property (philosophy); Computer security; Arithmetic; Cryptography; Mathematics; Combinatorics; Engineering; Physics; Political science","score_opus":0.024365957521598557,"score_gpt":0.25083466393523607,"score_spread":0.2264687064136375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107988267","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059805803,0.00016829047,0.9244664,0.00095864275,0.00016392689,0.00026549687,0.00014613509,0.00046022687,0.013565137],"genre_scores_gemma":[0.82855064,0.00017910982,0.16092266,0.0004715703,0.00010407664,0.00036076983,0.00017020218,0.00013656242,0.0091044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946313,0.0014533559,0.00031080222,0.0012075425,0.001725674,0.0006714036],"domain_scores_gemma":[0.9925493,0.0031879449,0.00068846025,0.0028341073,0.00045829703,0.00028188856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003175397,0.000860405,0.001144125,0.00043211342,0.0011670864,0.002565419,0.0028552331,0.0017190679,0.0025042994],"category_scores_gemma":[0.008761412,0.00049621897,0.0012926715,0.0006935671,0.0044399053,0.0072114025,0.0059695994,0.004751013,0.00090793794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033115773,0.00015133596,0.00058208295,0.00012525186,0.00004720345,0.000481616,0.00048434988,0.036636755,0.013776217,0.9331742,0.001249128,0.012960813],"study_design_scores_gemma":[0.00021422056,0.00022742133,0.00019985365,0.000040189825,0.000062443425,0.0005169527,0.00012220399,0.40660822,0.03796171,0.5454991,0.008454141,0.00009355507],"about_ca_topic_score_codex":0.0005288941,"about_ca_topic_score_gemma":0.00050260324,"teacher_disagreement_score":0.003175397,"about_ca_system_score_codex":0.0015430151,"about_ca_system_score_gemma":0.002006666,"threshold_uncertainty_score":0.01679331},"labels":[],"label_agreement":null},{"id":"W3110590623","doi":"","title":"Removable Weak Keys for Discrete Logarithm Based Cryptography.","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete logarithm; Cryptosystem; Public-key cryptography; Cryptography; Logarithm; Mathematics; Theoretical computer science; Discrete mathematics; Computer science; Key (lock); Security parameter; Encryption; Computer security","score_opus":0.0279654450418157,"score_gpt":0.27929919213903637,"score_spread":0.25133374709722067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110590623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04752962,0.001914492,0.9167501,0.0032035806,0.0003924261,0.00049095246,0.00040903225,0.00047404654,0.028835788],"genre_scores_gemma":[0.62234205,0.002323959,0.35318264,0.0008896008,0.0006530287,0.0010412803,0.00066999847,0.00028816823,0.018609233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955195,0.0010884863,0.00040301832,0.00059988076,0.0019672364,0.00042174515],"domain_scores_gemma":[0.98769134,0.005851821,0.0012335335,0.004023677,0.00076263375,0.00043694125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044693644,0.0012923472,0.0011634944,0.002256068,0.0025932365,0.0042221085,0.0022132043,0.0018773038,0.006949519],"category_scores_gemma":[0.02253116,0.00073075364,0.0014566899,0.002382523,0.0058662365,0.017880095,0.0074392306,0.0072906236,0.0030898668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011790592,0.00004198131,0.0006925751,0.00024069693,0.00002062932,0.00010360543,0.00021233836,0.0046667466,0.0030561318,0.95884556,0.0024372577,0.02956456],"study_design_scores_gemma":[0.000021785665,0.00007005469,0.0001372473,0.00006642494,0.000020820047,0.00036773956,0.00012019954,0.01976511,0.005609696,0.9578667,0.015923897,0.000030197201],"about_ca_topic_score_codex":0.00016370617,"about_ca_topic_score_gemma":0.00017159608,"teacher_disagreement_score":0.006949519,"about_ca_system_score_codex":0.0018914768,"about_ca_system_score_gemma":0.0015500688,"threshold_uncertainty_score":0.02363652},"labels":[],"label_agreement":null},{"id":"W3112174315","doi":"10.4230/lipics.ccc.2021.30","title":"Fractional Certificates for Bounded Functions","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; University of Waterloo; Ministry of Education - Singapore; National Research Foundation; Agence Nationale de la Recherche; National Science Foundation","keywords":"Gadget; Communication complexity; Upper and lower bounds; Mathematics; Adversary; Constant (computer programming); Computation; Quantum; Discrete mathematics; Quantum computer; Bounded function; Adversary model; Secure two-party computation; Theoretical computer science; Computer science; Combinatorics; Secure multi-party computation; Algorithm; Quantum mechanics","score_opus":0.14709959573935694,"score_gpt":0.20481189339526432,"score_spread":0.05771229765590738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112174315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17829461,0.0016236191,0.76436996,0.0061307536,0.0002440233,0.00016483989,0.0009847251,0.0010517049,0.04713573],"genre_scores_gemma":[0.9372641,0.0009784698,0.050998412,0.0008075402,0.00047757165,0.00021586168,0.00048216057,0.00029823818,0.008477809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560237,0.0011224746,0.00018671992,0.0010870851,0.0013597845,0.00064156926],"domain_scores_gemma":[0.97502315,0.017907914,0.0011142086,0.00390704,0.0013093774,0.0007383048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032131227,0.0008479894,0.0017379376,0.0025285124,0.0026549262,0.0068151504,0.0019014684,0.0019188784,0.008902527],"category_scores_gemma":[0.031246036,0.0005746298,0.002533114,0.00227872,0.0070978166,0.0128514245,0.004586828,0.005428251,0.001312977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066046916,0.000014102868,0.00025754655,0.000045295736,0.0000071535455,0.000049203663,0.00013258283,0.007658447,0.00058794353,0.9855635,0.0010375266,0.004580575],"study_design_scores_gemma":[0.000019249896,0.000017056804,0.00015249291,0.000026234842,0.000013538363,0.00006739146,0.00003707239,0.042668592,0.0013322892,0.9526779,0.0029686494,0.000019580224],"about_ca_topic_score_codex":0.0023603723,"about_ca_topic_score_gemma":0.0010699185,"teacher_disagreement_score":0.008902527,"about_ca_system_score_codex":0.005335924,"about_ca_system_score_gemma":0.0020559074,"threshold_uncertainty_score":0.038715065},"labels":[],"label_agreement":null},{"id":"W3112250879","doi":"10.1109/tpds.2020.3042695","title":"Privacy-Preserving Similarity Search With Efficient Updates in Distributed Key-Value Stores","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Homomorphic encryption; Speedup; Encryption; Cloud computing; Hash function; Nearest neighbor search; Locality-sensitive hashing; Similarity (geometry); Key (lock); Data mining; ElGamal encryption; Leverage (statistics); Theoretical computer science; Distributed computing; Public-key cryptography; Hash table; Computer network; Computer security; Parallel computing","score_opus":0.023356389890738804,"score_gpt":0.239407286401864,"score_spread":0.21605089651112522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112250879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12636973,0.0006875673,0.8665228,0.0005413463,0.00010238125,0.000457729,0.00020975998,0.0023927374,0.0027159124],"genre_scores_gemma":[0.84928674,0.00023604008,0.14743361,0.00013597756,0.000074295975,0.0002582008,0.00021619104,0.000100207544,0.0022587515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920398,0.001602192,0.0008734808,0.0012093714,0.003427987,0.0008471478],"domain_scores_gemma":[0.98884785,0.002983424,0.0010474276,0.0055250074,0.0012688516,0.00032742467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045484533,0.0006867609,0.0018925464,0.0013293296,0.0017870527,0.0037071102,0.0031397855,0.0016003668,0.0017675406],"category_scores_gemma":[0.012469055,0.00084913435,0.0007881239,0.0025250425,0.0019946527,0.010517919,0.0062234183,0.0022303192,0.00069145916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041368883,0.0011890198,0.006984875,0.0005380215,0.0003354811,0.0014093522,0.0020274303,0.2106755,0.08529492,0.30746412,0.0071501895,0.37279415],"study_design_scores_gemma":[0.00047243055,0.00057183264,0.00070697075,0.000041187304,0.000121860074,0.0007493544,0.00033356436,0.7888406,0.07544462,0.12506634,0.0075368686,0.00011441715],"about_ca_topic_score_codex":0.001449493,"about_ca_topic_score_gemma":0.0011522642,"teacher_disagreement_score":0.0045484533,"about_ca_system_score_codex":0.0013659383,"about_ca_system_score_gemma":0.0029164224,"threshold_uncertainty_score":0.024054825},"labels":[],"label_agreement":null},{"id":"W3114866676","doi":"10.1109/isncc49221.2020.9297294","title":"Decentralized and Privacy-Preserving Key Management Model","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Key (lock); Computer science; Key management; Computer security; Information privacy; Cryptography","score_opus":0.025803856448011857,"score_gpt":0.23268945686245252,"score_spread":0.20688560041444065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114866676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04109927,0.00025188763,0.90998536,0.003956016,0.00015168509,0.0006367548,0.00067095377,0.000509336,0.04273885],"genre_scores_gemma":[0.71683806,0.0005290904,0.23741107,0.0006146706,0.0003007585,0.0011991103,0.0004754191,0.00008421127,0.042547613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946115,0.0013006565,0.00032606017,0.0010763732,0.0021553081,0.000530105],"domain_scores_gemma":[0.99596405,0.0012421205,0.0005300399,0.0012424445,0.00064957514,0.00037178298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003621202,0.000533892,0.00090739666,0.0010061815,0.0020605968,0.0037864465,0.0036347483,0.002614476,0.006349048],"category_scores_gemma":[0.004553476,0.0004923419,0.0009308268,0.0017365168,0.0030939807,0.007838707,0.0031774894,0.002224933,0.0017877596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001122097,0.00011031855,0.0002104789,0.000071453636,0.00002456083,0.00035756573,0.0003000763,0.05010412,0.003370239,0.9342253,0.0023529439,0.008760692],"study_design_scores_gemma":[0.00027184223,0.00015735421,0.00018338786,0.00003060536,0.00003232977,0.00042298925,0.000116101,0.40044862,0.0032133907,0.57084256,0.02421741,0.00006343344],"about_ca_topic_score_codex":0.0012825179,"about_ca_topic_score_gemma":0.0011653606,"teacher_disagreement_score":0.006349048,"about_ca_system_score_codex":0.0022347504,"about_ca_system_score_gemma":0.0037861841,"threshold_uncertainty_score":0.021239698},"labels":[],"label_agreement":null},{"id":"W3114894140","doi":"10.1038/s41586-021-03998-y","title":"Experimental relativistic zero-knowledge proofs","year":2021,"lang":"en","type":"article","venue":"Nature","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Mathematical proof; Gas meter prover; Statement (logic); Identification (biology); Realization (probability); Protocol (science); Key (lock); Automated theorem proving","score_opus":0.010544839706068732,"score_gpt":0.2786765133970456,"score_spread":0.26813167369097685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114894140","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25748628,0.001399823,0.27791333,0.01189995,0.0017753703,0.0002532733,0.000822202,0.0014624292,0.4469873],"genre_scores_gemma":[0.9569263,0.00033870066,0.025922162,0.00075638865,0.00042090658,0.00012598053,0.00019248412,0.00018338415,0.015133676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961708,0.0016476767,0.00012485417,0.00043139764,0.0012489394,0.0003763955],"domain_scores_gemma":[0.9845389,0.009175509,0.0007597264,0.0039370116,0.0010549376,0.00053394865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042406325,0.0008333499,0.000812966,0.0010536049,0.0019846058,0.003041027,0.0027037545,0.0023586382,0.024458641],"category_scores_gemma":[0.018262362,0.00068270974,0.0006524956,0.00087099883,0.0052755354,0.0074066524,0.0029197799,0.004609734,0.0015407703],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060282837,0.00005489134,0.00012147276,0.000039049388,0.000007583292,0.000018911163,0.00008337489,0.000570995,0.000565962,0.9956275,0.0012808552,0.0015692356],"study_design_scores_gemma":[0.0000672229,0.000046787485,0.00016934668,0.000027974264,0.000012407231,0.00009271886,0.000050464485,0.005978792,0.0022347153,0.98788667,0.00341571,0.000017285567],"about_ca_topic_score_codex":0.00030670152,"about_ca_topic_score_gemma":0.0003297859,"teacher_disagreement_score":0.024458641,"about_ca_system_score_codex":0.0017395937,"about_ca_system_score_gemma":0.0013098582,"threshold_uncertainty_score":0.081822336},"labels":[],"label_agreement":null},{"id":"W3116767319","doi":"","title":"CPU and GPU accelerated fully homomorphic encryption","year":2019,"lang":"en","type":"article","venue":"Mspace (University of Manitoba)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Homomorphic encryption; Parallel computing; Speedup; Boolean function; Encryption; Multiplication (music); Theoretical computer science; Algorithm; Mathematics","score_opus":0.014937805909673803,"score_gpt":0.18617388089903383,"score_spread":0.17123607498936003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116767319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68456423,0.0022585834,0.21436805,0.0011446277,0.0005281629,0.00015861269,0.0010045225,0.006249533,0.08972363],"genre_scores_gemma":[0.8961846,0.00032099138,0.09269435,0.00015477947,0.000027734714,0.000061826606,0.0006699069,0.00019284726,0.009692875],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959916,0.000072739225,0.000017038303,0.000055376786,0.00016503531,0.00009062355],"domain_scores_gemma":[0.9995939,0.000087204986,0.000021857706,0.000142592,0.00012598169,0.000028523624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026849104,0.00041839405,0.0003322056,0.00038189287,0.0003475023,0.00088488206,0.00068571937,0.00040520704,0.0057926103],"category_scores_gemma":[0.0010692944,0.00015977703,0.00032932186,0.00062481855,0.0003370675,0.0011264527,0.00057617226,0.00058709295,0.00089987455],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033882172,0.0006277101,0.010208117,0.0006009935,0.00022814535,0.0011875592,0.00048663391,0.32803333,0.15101795,0.122427054,0.051348016,0.33044627],"study_design_scores_gemma":[0.00014634979,0.00028508072,0.0015688887,0.00003145744,0.000027125587,0.00024064611,0.000084374245,0.9304619,0.04168277,0.00750773,0.017938685,0.000024992074],"about_ca_topic_score_codex":0.0048998734,"about_ca_topic_score_gemma":0.006628269,"teacher_disagreement_score":0.0057926103,"about_ca_system_score_codex":0.0007814178,"about_ca_system_score_gemma":0.0010475492,"threshold_uncertainty_score":0.019378245},"labels":[],"label_agreement":null},{"id":"W3117326304","doi":"10.1109/isncc49221.2020.9297354","title":"LCA-ABE: Lightweight Context-Aware Encryption for Android Applications","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Encryption; Computer security; Android (operating system); Access control; Client-side encryption; Authorization; On-the-fly encryption; Operating system","score_opus":0.023473141673016153,"score_gpt":0.24270279683402687,"score_spread":0.21922965516101073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117326304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23257136,0.0060385573,0.7161766,0.0015603391,0.0006173012,0.0012027012,0.00057188625,0.016010687,0.025250474],"genre_scores_gemma":[0.91712296,0.000865255,0.07390445,0.00021825903,0.00006320738,0.00017031377,0.00025915419,0.00013977359,0.0072566643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928147,0.00012513777,0.00008365487,0.00006794778,0.00027166933,0.00017012651],"domain_scores_gemma":[0.9993148,0.000097183874,0.00007883998,0.00029617638,0.00014645554,0.00006660559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004566076,0.0005766219,0.0005375614,0.0004644498,0.0005797808,0.0010457205,0.0006551723,0.0005480996,0.00191369],"category_scores_gemma":[0.0015014596,0.0001971275,0.00039646518,0.00020336453,0.0003636551,0.0024786356,0.0016467802,0.0011457463,0.0009663992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002639267,0.0008031953,0.006276591,0.0012724694,0.00023079093,0.002751677,0.0011955494,0.024525147,0.37012547,0.103146434,0.029415848,0.4576175],"study_design_scores_gemma":[0.0002708524,0.0010726656,0.0060561416,0.00023456177,0.00020615057,0.004049951,0.0005023641,0.5315401,0.3129444,0.027191486,0.11566555,0.0002657946],"about_ca_topic_score_codex":0.0009670062,"about_ca_topic_score_gemma":0.0012364397,"teacher_disagreement_score":0.00191369,"about_ca_system_score_codex":0.0004265316,"about_ca_system_score_gemma":0.0007603289,"threshold_uncertainty_score":0.006401956},"labels":[],"label_agreement":null},{"id":"W3117506726","doi":"10.1109/sp40001.2021.00096","title":"Compact Certificates of Collective Knowledge","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Axela (Canada); University of Waterloo","funders":"","keywords":"Certificate; Computer science; Scheme (mathematics); Computer security; Block (permutation group theory); Authorization certificate; Certificate authority; Theoretical computer science; Public-key cryptography; Mathematics; Encryption","score_opus":0.034946948643303305,"score_gpt":0.27616591201417606,"score_spread":0.24121896337087276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117506726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04694988,0.0009285421,0.9264464,0.0012868432,0.00033869673,0.00058776146,0.00059650175,0.0039142175,0.018951174],"genre_scores_gemma":[0.69386417,0.00075883634,0.28951585,0.0003418023,0.00030019225,0.00060611474,0.001137491,0.0004172967,0.013058341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908343,0.0021034142,0.0006218368,0.0011922165,0.0043128827,0.00093536166],"domain_scores_gemma":[0.95999324,0.009168241,0.0032445174,0.022331985,0.003771794,0.0014902016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066551096,0.0007686375,0.0012734254,0.0015896072,0.0017975047,0.0053086616,0.0027055277,0.0018344981,0.010078248],"category_scores_gemma":[0.02853483,0.0007813772,0.0010933523,0.0025489563,0.004498098,0.015945775,0.008800766,0.003458927,0.002295284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083027035,0.0001734054,0.0017661391,0.00048886775,0.000073240255,0.00032266998,0.00069139095,0.072492,0.0067013092,0.7705585,0.008446443,0.13745573],"study_design_scores_gemma":[0.00042032858,0.000644766,0.0006493478,0.0002988665,0.00009724369,0.000712668,0.0002562878,0.19529605,0.018781781,0.6948588,0.087880455,0.00010332837],"about_ca_topic_score_codex":0.0013949171,"about_ca_topic_score_gemma":0.0010638498,"teacher_disagreement_score":0.010078248,"about_ca_system_score_codex":0.0024350004,"about_ca_system_score_gemma":0.0031857465,"threshold_uncertainty_score":0.035196006},"labels":[],"label_agreement":null},{"id":"W3118687947","doi":"10.1109/jiot.2020.3048976","title":"A Privacy-Aware and Traceable Fine-Grained Data Delivery System in Cloud-Assisted Healthcare IIoT","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Computer security; Delegation; Encryption; Information privacy; Key (lock); Security analysis","score_opus":0.04006252163608502,"score_gpt":0.274281342301214,"score_spread":0.23421882066512895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118687947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05834414,0.0008241216,0.9342732,0.0010100455,0.0002054461,0.00033911897,0.00017627688,0.0015924744,0.003235132],"genre_scores_gemma":[0.9034205,0.000447163,0.09231477,0.0004357602,0.00007421927,0.00011604894,0.00019415031,0.000033453372,0.0029640282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885523,0.00023654546,0.0001296428,0.00023454399,0.0003499511,0.00019400204],"domain_scores_gemma":[0.9991148,0.00015983357,0.00014512264,0.0002568775,0.00020121304,0.00012220786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089633145,0.000302113,0.000700633,0.00036522266,0.0009689383,0.0012774098,0.0012490031,0.0010162513,0.0013047333],"category_scores_gemma":[0.0016210497,0.00016640777,0.00042760678,0.0007648822,0.00048016472,0.0022902894,0.0027108353,0.0008303287,0.00041016057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030088285,0.00065030897,0.0064263064,0.00094001327,0.00023511742,0.0026435456,0.0018230437,0.12681237,0.15557976,0.12308003,0.023641068,0.5551596],"study_design_scores_gemma":[0.00016077592,0.0006256458,0.0016283586,0.00006724969,0.00010159592,0.0020879526,0.00046839958,0.9037337,0.044343356,0.01983053,0.026825706,0.00012675834],"about_ca_topic_score_codex":0.0018497135,"about_ca_topic_score_gemma":0.0011969365,"teacher_disagreement_score":0.0018497135,"about_ca_system_score_codex":0.00090204645,"about_ca_system_score_gemma":0.0015803581,"threshold_uncertainty_score":0.0065448284},"labels":[],"label_agreement":null},{"id":"W3121567526","doi":"10.2196/22158","title":"A Privacy-Preserving Log-Rank Test for the Kaplan-Meier Estimator With Secure Multiparty Computation: Algorithm Development and Validation","year":2021,"lang":"en","type":"article","venue":"JMIR Medical Informatics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Bundesministerium für Bildung und Forschung","keywords":"Computer science; Data exchange; Secure multi-party computation; Estimator; Rank (graph theory); Algorithm; Computation; The Internet; Data mining; Database; Mathematics; Statistics","score_opus":0.018284777851328406,"score_gpt":0.2808967903223941,"score_spread":0.2626120124710657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121567526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03089222,0.00006855924,0.9660995,0.00025357722,0.000023608634,0.00027930332,0.000099860576,0.0014477117,0.00083569274],"genre_scores_gemma":[0.5569285,0.000062843035,0.44112185,0.00010829492,0.000031229472,0.00062605954,0.00025374943,0.00015854479,0.0007089094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918434,0.00425705,0.0004091603,0.00086087367,0.002211266,0.00041821867],"domain_scores_gemma":[0.9775115,0.01565247,0.0014758791,0.002997537,0.0020140228,0.00034850618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007483732,0.00054218573,0.0006201882,0.00076337345,0.00050692866,0.0013865742,0.0012196596,0.0011650232,0.0028262497],"category_scores_gemma":[0.040379044,0.00023592226,0.00070101034,0.00055553764,0.0010966543,0.0011602095,0.0020182387,0.0018112169,0.00066712464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023442865,0.00050341076,0.011852793,0.0003566848,0.0002117098,0.00073547236,0.00039970884,0.56977236,0.019546025,0.06187029,0.004510017,0.32789728],"study_design_scores_gemma":[0.000090324116,0.0001856851,0.00077021203,0.000015770429,0.000012158768,0.00017917396,0.00002411193,0.97896427,0.00770182,0.011270343,0.0007708382,0.000015257145],"about_ca_topic_score_codex":0.0010439263,"about_ca_topic_score_gemma":0.00062838144,"teacher_disagreement_score":0.007483732,"about_ca_system_score_codex":0.0009403676,"about_ca_system_score_gemma":0.002824397,"threshold_uncertainty_score":0.03957826},"labels":[],"label_agreement":null},{"id":"W3122422767","doi":"","title":"Efficient Oblivious Database Joins","year":2020,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Joins; Verifiable secret sharing; sort; Delegate; Cloud computing; Theoretical computer science; Database; Programming language","score_opus":0.015867856659425444,"score_gpt":0.18658368244233028,"score_spread":0.17071582578290484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122422767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07883975,0.00040116746,0.89629644,0.0006389467,0.0000770139,0.00023594135,0.00041695064,0.0044487207,0.018645076],"genre_scores_gemma":[0.752025,0.0004120157,0.22940102,0.00036350134,0.00008175805,0.00042715302,0.0007664544,0.00055811263,0.015964907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966407,0.00056170276,0.00027263857,0.00055132597,0.0014656883,0.00050783483],"domain_scores_gemma":[0.9949869,0.0015117386,0.00044341455,0.0026200537,0.00031478715,0.00012318029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016664404,0.00057234336,0.0009328764,0.0005664917,0.0013851257,0.0030586133,0.0026967751,0.001034488,0.00646946],"category_scores_gemma":[0.004604744,0.0006798659,0.00096248346,0.0010202494,0.0016822658,0.005821168,0.0051966305,0.0022444136,0.0024193344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018111204,0.00040312903,0.0019619986,0.00059595547,0.00010348304,0.00021385758,0.0009273095,0.0980238,0.093403414,0.6103562,0.008553165,0.1836465],"study_design_scores_gemma":[0.00026956887,0.00037794834,0.0006411383,0.00005439223,0.00008208315,0.00039147155,0.00023511576,0.45931637,0.13509111,0.37323123,0.030234424,0.00007509171],"about_ca_topic_score_codex":0.00052468985,"about_ca_topic_score_gemma":0.0007120147,"teacher_disagreement_score":0.00646946,"about_ca_system_score_codex":0.0014656516,"about_ca_system_score_gemma":0.00192946,"threshold_uncertainty_score":0.021642506},"labels":[],"label_agreement":null},{"id":"W3123813322","doi":"","title":"Reusable Garbled Circuits and Succinct Functional Encryption","year":2012,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Encryption; Learning with errors; Computer science; 40-bit encryption; Theoretical computer science; Multiple encryption; Ciphertext; Probabilistic encryption; Obfuscation; Attribute-based encryption; Key (lock); Security parameter; Public-key cryptography; Computer security","score_opus":0.020333928409235938,"score_gpt":0.21670293571131172,"score_spread":0.1963690073020758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123813322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02588616,0.0018911989,0.95727265,0.0010272885,0.00017392152,0.0001293005,0.00021778434,0.0006224803,0.012779261],"genre_scores_gemma":[0.7353978,0.00515014,0.24001507,0.001019017,0.00033023805,0.00059163745,0.0007370368,0.00027612533,0.016482944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812907,0.00046967747,0.00017141702,0.00034679737,0.00057113403,0.00031186664],"domain_scores_gemma":[0.9971819,0.0014585495,0.0003030296,0.00076092506,0.00021032247,0.00008534375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014651889,0.0009252539,0.0007641096,0.0008656724,0.0005785457,0.002286467,0.0010820172,0.0014574968,0.0030822104],"category_scores_gemma":[0.0047811675,0.00061305834,0.0014493521,0.0010319473,0.0034563327,0.006226814,0.0023752,0.0039796326,0.0008207392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087255874,0.000031555544,0.0001597405,0.00016923626,0.000017354068,0.00019165699,0.00016705273,0.023037508,0.0052768546,0.9538698,0.000675878,0.016316054],"study_design_scores_gemma":[0.00005855141,0.00014018294,0.00012697018,0.00016620518,0.000035465877,0.00041135098,0.000053853993,0.07986925,0.01960506,0.8839585,0.015524447,0.000050119757],"about_ca_topic_score_codex":0.00045834432,"about_ca_topic_score_gemma":0.00033165058,"teacher_disagreement_score":0.0030822104,"about_ca_system_score_codex":0.0015900203,"about_ca_system_score_gemma":0.000996714,"threshold_uncertainty_score":0.011536419},"labels":[],"label_agreement":null},{"id":"W3124691586","doi":"","title":"Functional Re-encryption and Collusion-Resistant Obfuscation","year":2011,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Obfuscation; Collusion; Encryption; Computer science; Computer security; Public-key cryptography; Theoretical computer science; Key (lock); Cryptography; 40-bit encryption; Function (biology); Ciphertext; Business","score_opus":0.03610540747462432,"score_gpt":0.22590137904639535,"score_spread":0.18979597157177103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124691586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09273814,0.0016044079,0.86894226,0.0016422964,0.0003611581,0.000198808,0.00028827335,0.0027753876,0.031449288],"genre_scores_gemma":[0.91425264,0.0006450553,0.06702222,0.00027840093,0.00018209602,0.00011294464,0.00027260432,0.00029887806,0.016935105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967188,0.0007784567,0.00021394936,0.0005031931,0.0011552153,0.0006302992],"domain_scores_gemma":[0.99233866,0.001731577,0.00054497796,0.004631281,0.00062159594,0.0001318424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00203259,0.0013069211,0.0011761446,0.0014148646,0.001189647,0.0021851822,0.0013518739,0.0018323488,0.0058082594],"category_scores_gemma":[0.007246215,0.0006403148,0.0012212755,0.0013875325,0.0026868787,0.0054657925,0.004213585,0.0022906885,0.0028043317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008131796,0.00010544412,0.0010895953,0.00040320278,0.00009243823,0.000845729,0.0007127038,0.021998605,0.033723958,0.80283487,0.0062435213,0.13113669],"study_design_scores_gemma":[0.0000975852,0.00029662362,0.0007862566,0.00021779427,0.00014721738,0.0029293562,0.00017779578,0.17776094,0.1712379,0.6219824,0.024218554,0.00014759666],"about_ca_topic_score_codex":0.00026910688,"about_ca_topic_score_gemma":0.00018432317,"teacher_disagreement_score":0.0058082594,"about_ca_system_score_codex":0.00085702154,"about_ca_system_score_gemma":0.00076687825,"threshold_uncertainty_score":0.019430578},"labels":[],"label_agreement":null},{"id":"W3125170070","doi":"10.1109/globecom42002.2020.9322502","title":"Efficient Privacy-Preserving Similarity Range Query based on Pre-Computed Distances in eHealthcare","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Range query (database); Encryption; Cloud computing; Query optimization; Outsourcing; Web search query; Sargable; Data mining; Web query classification; Information retrieval; Query expansion; Information privacy; Similarity (geometry); Search engine; Computer security; Artificial intelligence","score_opus":0.026411048338916776,"score_gpt":0.26401692059415716,"score_spread":0.23760587225524038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125170070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06700971,0.0013402088,0.9277029,0.00046869452,0.000076249344,0.00024557998,0.00021463074,0.00058746623,0.0023545716],"genre_scores_gemma":[0.8269006,0.0007516341,0.16884312,0.00019392683,0.00010057376,0.00017796455,0.00046783965,0.00004069671,0.002523582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931189,0.0016693335,0.0005949017,0.0010457197,0.0030088348,0.00056231685],"domain_scores_gemma":[0.9964742,0.0011024992,0.00036596108,0.0012107304,0.0006990343,0.00014742656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022490688,0.00049050356,0.0015511299,0.0010817024,0.0010543499,0.001591751,0.0019549197,0.0011272217,0.0013254201],"category_scores_gemma":[0.0064077815,0.0003351999,0.0008828667,0.002694979,0.0010299982,0.0053184424,0.0031394286,0.001260855,0.00045790986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026292766,0.0005935819,0.005387172,0.0007528087,0.0002808611,0.00144624,0.001680208,0.17604929,0.107855946,0.15974988,0.008316694,0.535258],"study_design_scores_gemma":[0.00021578229,0.00084863236,0.0019609137,0.000038788858,0.00010248295,0.0022974757,0.00062478794,0.87029433,0.061418857,0.051406674,0.010635955,0.00015531355],"about_ca_topic_score_codex":0.0019928776,"about_ca_topic_score_gemma":0.0009127354,"teacher_disagreement_score":0.0022490688,"about_ca_system_score_codex":0.0012038426,"about_ca_system_score_gemma":0.0015379302,"threshold_uncertainty_score":0.011894345},"labels":[],"label_agreement":null},{"id":"W3125782344","doi":"","title":"How to Run Turing Machines on Encrypted Data","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Turing machine; Functional encryption; Turing machine examples; Computer science; Encryption; Theoretical computer science; Universal Turing machine; Time hierarchy theorem; Cryptography; Homomorphic encryption; Scheme (mathematics); Non-deterministic Turing machine; Super-recursive algorithm; Construct (python library); Block (permutation group theory); NSPACE; Turing; Key (lock); Algorithm; Mathematics; Computation; Computer network; Computer security; Ciphertext; Programming language","score_opus":0.03098249483124182,"score_gpt":0.25057277832082486,"score_spread":0.21959028348958304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125782344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062332198,0.0003161128,0.91768456,0.0038937274,0.00045322193,0.00020777894,0.00018818404,0.002813989,0.012110149],"genre_scores_gemma":[0.61245716,0.00037413763,0.37664145,0.0005235184,0.000138522,0.00032423163,0.0003666691,0.0006962036,0.008478225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647325,0.0015537267,0.00038061134,0.00047267645,0.0007849623,0.00033472563],"domain_scores_gemma":[0.9909724,0.0036822122,0.00037477392,0.003826478,0.00080339634,0.0003408264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003599322,0.00051109906,0.00070448086,0.00043191962,0.0014279833,0.003856208,0.00151173,0.0016910173,0.006153047],"category_scores_gemma":[0.01636105,0.0006036193,0.0014110041,0.0005446253,0.0037724874,0.010706296,0.0027884264,0.0028566765,0.002170939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033648172,0.0001089237,0.001637772,0.0003187836,0.00012663176,0.0002626685,0.00070119684,0.067320116,0.009509341,0.8647759,0.007898974,0.04700327],"study_design_scores_gemma":[0.00009256217,0.00008740408,0.00021281962,0.0000947415,0.000059826845,0.00021581078,0.00018121793,0.2615118,0.030523617,0.68425226,0.022706607,0.0000612432],"about_ca_topic_score_codex":0.0008089037,"about_ca_topic_score_gemma":0.00056893885,"teacher_disagreement_score":0.006153047,"about_ca_system_score_codex":0.0011790892,"about_ca_system_score_gemma":0.001402465,"threshold_uncertainty_score":0.020583987},"labels":[],"label_agreement":null},{"id":"W3127318453","doi":"10.1109/isit45174.2021.9517958","title":"Information-theoretic Key Encapsulation and its Application to Secure Communication","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Key encapsulation; Computer science; Encryption; Plaintext; 40-bit encryption; Theoretical computer science; Pre-shared key; Probabilistic encryption; Encapsulation (networking); Symmetric-key algorithm; Hybrid cryptosystem; Alice and Bob; Public-key cryptography; Ciphertext; Pseudorandom number generator; Key distribution; Computer security; Algorithm; Alice (programming language)","score_opus":0.00763743576824291,"score_gpt":0.2369186243191703,"score_spread":0.22928118855092738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127318453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005613359,0.0016542852,0.9741212,0.0012010157,0.00014067291,0.000088680514,0.000041157604,0.00017102585,0.016968545],"genre_scores_gemma":[0.52876437,0.0055363234,0.45631006,0.00073153863,0.0006400602,0.00063112006,0.00017615678,0.00013718345,0.0070731617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994101,0.0021042544,0.00049438246,0.00078368746,0.002132972,0.00038366174],"domain_scores_gemma":[0.99432606,0.0029751733,0.00052994734,0.0015744002,0.00047426316,0.00012013503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004929918,0.0011007378,0.0008928069,0.0014001223,0.0012059807,0.0038484237,0.0019128679,0.0022737505,0.0017665168],"category_scores_gemma":[0.009638653,0.00081150903,0.0020733934,0.0020435893,0.0084693795,0.009837285,0.0048407605,0.005181979,0.001045002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002072276,0.000013779869,0.00006847651,0.00007023656,0.000012419962,0.00008879055,0.00016749962,0.006878702,0.00092366186,0.9836453,0.00047567036,0.0076346463],"study_design_scores_gemma":[0.000026240421,0.00005982111,0.000081338854,0.0000766159,0.000023896162,0.00026943785,0.000045331468,0.09419301,0.0048946273,0.8885246,0.011763742,0.00004127375],"about_ca_topic_score_codex":0.0007284995,"about_ca_topic_score_gemma":0.0002351894,"teacher_disagreement_score":0.004929918,"about_ca_system_score_codex":0.0027221309,"about_ca_system_score_gemma":0.0014194179,"threshold_uncertainty_score":0.026072204},"labels":[],"label_agreement":null},{"id":"W3127866986","doi":"10.1109/icsip49896.2020.9339338","title":"Dynamic Searchable Symmetric Encryption with Full Forward Privacy","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Mount Royal University","funders":"","keywords":"Computer science; Encryption; Plaintext; Scheme (mathematics); Symmetric-key algorithm; Computer security; Parallelizable manifold; Information leakage; Cloud computing; Private information retrieval; Security analysis; Theoretical computer science; Public-key cryptography; Algorithm; Mathematics","score_opus":0.014836663763363477,"score_gpt":0.2331390979295453,"score_spread":0.2183024341661818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127866986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020013945,0.0009597369,0.966724,0.000854537,0.00009878837,0.00024408306,0.00039278367,0.0005934191,0.010118814],"genre_scores_gemma":[0.8042551,0.0009896214,0.18237469,0.00048312536,0.00015852366,0.0003860431,0.00047751406,0.00009587587,0.010779466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595755,0.0009515486,0.00038563908,0.00054960593,0.0015995748,0.000556031],"domain_scores_gemma":[0.9964659,0.00078198686,0.0003698783,0.001839657,0.00042689295,0.000115533636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021876248,0.0007175923,0.0012085947,0.0009074308,0.00093508064,0.0021582854,0.0020274075,0.001324994,0.003009366],"category_scores_gemma":[0.0040979595,0.00043099013,0.0011301646,0.002263541,0.0015522313,0.0069680507,0.003807125,0.0022949588,0.0010244044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066598225,0.00020874341,0.0008475514,0.00046278196,0.00010479085,0.0006551034,0.00041419093,0.054384094,0.023835042,0.7899514,0.008075295,0.12039506],"study_design_scores_gemma":[0.00028294005,0.00037038876,0.0004698627,0.000107911,0.00010589014,0.0022346538,0.00018594207,0.4678886,0.03214875,0.45740783,0.038672805,0.00012441237],"about_ca_topic_score_codex":0.0006493624,"about_ca_topic_score_gemma":0.00068624725,"teacher_disagreement_score":0.003009366,"about_ca_system_score_codex":0.0015088768,"about_ca_system_score_gemma":0.0024845907,"threshold_uncertainty_score":0.011569381},"labels":[],"label_agreement":null},{"id":"W3131045898","doi":"10.1109/tcc.2021.3059026","title":"Enabling Secure and Versatile Packet Inspection With Probable Cause Privacy for Outsourced Middlebox","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Deep packet inspection; Header; Payload (computing); Network packet; Encryption; Cloud computing; Server; Computer security; Computer network; Security token; MD5; Operating system; Hash function","score_opus":0.024105453304371534,"score_gpt":0.24607147056399326,"score_spread":0.22196601725962173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131045898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14643726,0.00035214823,0.8458139,0.00053796195,0.000062108025,0.00022437077,0.00022188645,0.0019634904,0.004386779],"genre_scores_gemma":[0.9606779,0.00016152339,0.037017956,0.00011181252,0.000030777283,0.000058272606,0.00013472972,0.00004815734,0.0017588658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997454,0.00045238002,0.00023281487,0.00038778488,0.0009826797,0.00049033907],"domain_scores_gemma":[0.9927146,0.0012748796,0.0006756203,0.004650421,0.0004654141,0.00021905477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021155162,0.0004638435,0.00094181165,0.0005722978,0.00087327615,0.0019465587,0.0014818606,0.00086276105,0.0015314346],"category_scores_gemma":[0.004518132,0.00039993855,0.00069516356,0.0007475516,0.0014075321,0.004500648,0.004543663,0.0014931884,0.0006054349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030695493,0.0005604331,0.015736146,0.00057698897,0.00027464758,0.003499204,0.0025904158,0.08423544,0.2189814,0.33128574,0.009891135,0.3292989],"study_design_scores_gemma":[0.00014873805,0.00033642733,0.0025281042,0.000067065856,0.0001455466,0.0017282283,0.00058859534,0.7390675,0.15243153,0.09115763,0.011692311,0.00010833428],"about_ca_topic_score_codex":0.0007411438,"about_ca_topic_score_gemma":0.000555535,"teacher_disagreement_score":0.0021155162,"about_ca_system_score_codex":0.0009742452,"about_ca_system_score_gemma":0.0013783147,"threshold_uncertainty_score":0.01118809},"labels":[],"label_agreement":null},{"id":"W3131894619","doi":"10.48550/arxiv.2102.09651","title":"Obfuscated Access and Search Patterns in Searchable Encryption","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Overhead (engineering); Obfuscation; Scheme (mathematics); Cloud computing; Symmetric-key algorithm; Web search query; Database; Outsourcing; Computer network; Computer security; Search engine; Public-key cryptography; Information retrieval; Operating system","score_opus":0.1097151670440809,"score_gpt":0.22300542704133094,"score_spread":0.11329025999725005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131894619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3302824,0.0036629385,0.65648955,0.0012844721,0.00010788395,0.00029346,0.0004468317,0.0019208775,0.005511521],"genre_scores_gemma":[0.9508052,0.0005747767,0.046573825,0.0001296504,0.000040841813,0.0000991037,0.00013279752,0.000047859477,0.00159591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99342924,0.0019910082,0.00082552584,0.00066475547,0.0019202711,0.0011691983],"domain_scores_gemma":[0.9840681,0.005511641,0.0017025959,0.007930921,0.0005663697,0.00022024708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037985004,0.0008145366,0.0014872036,0.0012195598,0.00088202336,0.001408747,0.0015522408,0.0015403873,0.0012627767],"category_scores_gemma":[0.011299074,0.0006862231,0.0013252982,0.0020246452,0.0030815585,0.008675199,0.003901101,0.002454133,0.0005098877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039588893,0.0007024362,0.01137255,0.001128095,0.00036561518,0.001714543,0.002112367,0.18074973,0.07184862,0.37958103,0.0048186723,0.34164736],"study_design_scores_gemma":[0.00038232087,0.0010984992,0.0034988138,0.00029055035,0.00026136008,0.0034257248,0.00040743608,0.58379596,0.10811201,0.2842206,0.014297293,0.0002094415],"about_ca_topic_score_codex":0.0007418632,"about_ca_topic_score_gemma":0.00045376518,"teacher_disagreement_score":0.0037985004,"about_ca_system_score_codex":0.0013868859,"about_ca_system_score_gemma":0.0012963988,"threshold_uncertainty_score":0.020088613},"labels":[],"label_agreement":null},{"id":"W3132863693","doi":"10.1109/dependsys51298.2020.00012","title":"HBD-Authority: Streaming Access Control Model for Hadoop","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Access control; Big data; Computer security; Cryptocurrency; Cloud computing; Kerberos; Scalability; Analytics; Transparency (behavior); Correctness; Authentication (law); Database; World Wide Web; Operating system","score_opus":0.06627123151628216,"score_gpt":0.3026333548524988,"score_spread":0.23636212333621665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132863693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091849165,0.00013717996,0.98547965,0.0004779301,0.00007289172,0.00027829973,0.0002150429,0.0010498837,0.0031042348],"genre_scores_gemma":[0.6584602,0.00048048893,0.3303676,0.00036966483,0.00019011319,0.00073123514,0.0007208516,0.0002240538,0.008455782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492973,0.0014744682,0.00059072365,0.00079742365,0.001775318,0.00043229724],"domain_scores_gemma":[0.9950322,0.0019591483,0.0004533202,0.0013166108,0.0008663818,0.00037235618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051610474,0.00052316644,0.0005958212,0.0011876136,0.0013301864,0.0045036552,0.0026149782,0.0015045876,0.0024829523],"category_scores_gemma":[0.00845905,0.00049083045,0.0015848503,0.0009881115,0.0027283086,0.0074762558,0.0030246712,0.0027159487,0.0007726674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000316511,0.00019372338,0.0023951617,0.00021815185,0.000055337936,0.00053704134,0.0011196116,0.093548656,0.0063580996,0.8479331,0.003976491,0.043348067],"study_design_scores_gemma":[0.00008252989,0.00011110451,0.0002686738,0.00005651236,0.000046627167,0.00038646784,0.0001679634,0.6981941,0.0051664957,0.27109486,0.02434462,0.00008001505],"about_ca_topic_score_codex":0.0049219057,"about_ca_topic_score_gemma":0.0031863102,"teacher_disagreement_score":0.0051610474,"about_ca_system_score_codex":0.0021047285,"about_ca_system_score_gemma":0.0032394177,"threshold_uncertainty_score":0.027294576},"labels":[],"label_agreement":null},{"id":"W3134041340","doi":"10.1109/tetc.2021.3052377","title":"Secure Data Sharing With Flexible User Access Privilege Update in Cloud-Assisted IoMT","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Computer network; Privilege (computing); Data sharing; Computer security; Operating system","score_opus":0.06268017862076933,"score_gpt":0.32957241774004853,"score_spread":0.2668922391192792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134041340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15549466,0.0007706661,0.83629185,0.000631264,0.00014436146,0.00023511218,0.00014366268,0.00063262053,0.0056557707],"genre_scores_gemma":[0.9786375,0.00012642087,0.02010702,0.00006965987,0.000034542132,0.000038268914,0.000046316163,0.0000128242755,0.00092731725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687815,0.00071535044,0.0002867223,0.0005021917,0.00095559104,0.0006620126],"domain_scores_gemma":[0.9973018,0.00048162034,0.00039634827,0.0012333642,0.00036329307,0.00022352677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013030668,0.00034867457,0.0010113573,0.00047862768,0.0013240409,0.0014283009,0.0011712065,0.00088472734,0.0009804056],"category_scores_gemma":[0.0030978068,0.0002118692,0.00064682035,0.0011152682,0.001301333,0.0040627224,0.004125796,0.0009917137,0.00032292624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003029289,0.00056284724,0.007686969,0.00047343457,0.00024056385,0.0053311144,0.0026167643,0.22186288,0.13878079,0.38395175,0.007796423,0.22766726],"study_design_scores_gemma":[0.0001317954,0.0004053292,0.0016605371,0.000052263596,0.000091699236,0.003327432,0.0004886693,0.86525345,0.038909823,0.076130785,0.013395057,0.00015305354],"about_ca_topic_score_codex":0.0012258213,"about_ca_topic_score_gemma":0.00079323765,"teacher_disagreement_score":0.0014283009,"about_ca_system_score_codex":0.0008899863,"about_ca_system_score_gemma":0.0012102044,"threshold_uncertainty_score":0.00689131},"labels":[],"label_agreement":null},{"id":"W3134573374","doi":"10.1109/icde53745.2022.00168","title":"Equi-Joins over Encrypted Data for Series of Queries","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 38th International Conference on Data Engineering (ICDE)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encryption; Computer science; Filesystem-level encryption; Joins; On-the-fly encryption; 56-bit encryption; Probabilistic encryption; 40-bit encryption; Client-side encryption; Multiple encryption; Database; Scheme (mathematics); Transitive closure; Computer security; Theoretical computer science; Mathematics; Programming language","score_opus":0.11199287177288754,"score_gpt":0.31047512583243503,"score_spread":0.1984822540595475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134573374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42209446,0.0018210725,0.557108,0.0017900905,0.0002379165,0.0006477964,0.00254528,0.00521076,0.008544623],"genre_scores_gemma":[0.82262266,0.00044318684,0.17010854,0.0003241033,0.00011653618,0.00023403378,0.0023424425,0.00034185025,0.0034666827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9881655,0.0017301996,0.001924916,0.0017274133,0.0054826657,0.0009692535],"domain_scores_gemma":[0.97969806,0.0050325813,0.0020275114,0.011043602,0.0018393765,0.00035886525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007085843,0.00079280086,0.0011543499,0.0010557742,0.0016030784,0.0027250785,0.0018661229,0.0011346455,0.0023806659],"category_scores_gemma":[0.015559234,0.0005776043,0.0010647826,0.0018994937,0.0021703134,0.01201473,0.003967183,0.0020094018,0.00078072265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052387,0.0012076712,0.03419502,0.001305782,0.00063660316,0.0023167757,0.0030195164,0.14905813,0.1285862,0.2322476,0.023756843,0.41843113],"study_design_scores_gemma":[0.0004051445,0.0009404188,0.006500596,0.00012533866,0.00020421759,0.0037656003,0.0012947808,0.5190813,0.19071549,0.23717374,0.03964809,0.00014535754],"about_ca_topic_score_codex":0.0008025373,"about_ca_topic_score_gemma":0.0011163667,"teacher_disagreement_score":0.007085843,"about_ca_system_score_codex":0.0016729842,"about_ca_system_score_gemma":0.0021554509,"threshold_uncertainty_score":0.037473977},"labels":[],"label_agreement":null},{"id":"W3134710142","doi":"10.1007/978-3-030-70881-8_12","title":"Pisces: A New Zero-Knowledge Protocol for Blockchain Privacy","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero-knowledge proof; Computer science; Gas meter prover; Cryptography; Blockchain; Anonymity; Protocol (science); Verifiable secret sharing; Cryptographic protocol; Theoretical computer science; Hash function; Encryption; Computer security; Programming language; Mathematics","score_opus":0.03576689538066626,"score_gpt":0.3034397396076183,"score_spread":0.26767284422695203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134710142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126888035,0.00085192255,0.9497714,0.0013140842,0.0007960733,0.00033401098,0.00057009055,0.0031704695,0.03050318],"genre_scores_gemma":[0.48654595,0.0026814886,0.3857943,0.0012252503,0.0007560428,0.0015602651,0.0020813495,0.0013684338,0.11798704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976241,0.00055308914,0.00015466804,0.0003057201,0.0010927322,0.00026965374],"domain_scores_gemma":[0.9980393,0.00069783384,0.0001043493,0.0007878565,0.00022667125,0.00014407882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001937588,0.0007997471,0.0010927692,0.0008528576,0.0015702223,0.003037672,0.0026052438,0.0021483982,0.013237826],"category_scores_gemma":[0.0038712146,0.0006371144,0.00067633577,0.0015032701,0.002560899,0.007644659,0.0062729158,0.004394658,0.004715837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008192497,0.00014179476,0.00025170133,0.00037316393,0.00006709846,0.00039958506,0.00043717198,0.018931169,0.012467834,0.7502707,0.025693512,0.190147],"study_design_scores_gemma":[0.00020202603,0.00018706569,0.0001357463,0.00010174222,0.00006595129,0.00047426025,0.00009479746,0.13467304,0.024642715,0.7162142,0.12312194,0.00008646806],"about_ca_topic_score_codex":0.000530139,"about_ca_topic_score_gemma":0.00061239494,"teacher_disagreement_score":0.013237826,"about_ca_system_score_codex":0.0010446621,"about_ca_system_score_gemma":0.001830264,"threshold_uncertainty_score":0.04428494},"labels":[],"label_agreement":null},{"id":"W3134872094","doi":"10.1109/tsc.2021.3065240","title":"Achieving Efficient and Privacy-Preserving Set Containment Search Over Encrypted Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Bloom filter; Set operations; Cloud computing; Containment (computer programming); Set (abstract data type); Outsourcing; Tree (set theory); Computer security; Data mining; Database; Computer network","score_opus":0.0349615736369783,"score_gpt":0.29283229670172073,"score_spread":0.25787072306474246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134872094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115770064,0.0013026492,0.87340593,0.0007557003,0.000072688155,0.0002579062,0.0006296199,0.0009879806,0.006817496],"genre_scores_gemma":[0.8026969,0.00090552616,0.19211191,0.00027255312,0.000073624615,0.00015661339,0.0007863702,0.00005430551,0.002942266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613416,0.00065237697,0.00041293367,0.00041914615,0.0018564737,0.00052492245],"domain_scores_gemma":[0.99438345,0.0018492511,0.0006869409,0.002185636,0.00076083594,0.0001339077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666618,0.00044047463,0.0013373806,0.0010104106,0.0010240619,0.0016210111,0.0013543642,0.00081074337,0.0013874968],"category_scores_gemma":[0.006141267,0.00029328364,0.0007822221,0.0026180085,0.00091650366,0.0056419033,0.0029382927,0.0011580907,0.000715213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016833252,0.0007425571,0.0061960337,0.0010120323,0.00028953655,0.0013359147,0.0018134725,0.12977722,0.1287923,0.25033185,0.015127575,0.46289816],"study_design_scores_gemma":[0.00018319004,0.00061201316,0.001646904,0.000084239735,0.00013501637,0.0029716666,0.00067566475,0.7485768,0.131637,0.09650094,0.01686266,0.00011384795],"about_ca_topic_score_codex":0.0009768328,"about_ca_topic_score_gemma":0.00085846905,"teacher_disagreement_score":0.001666618,"about_ca_system_score_codex":0.000932948,"about_ca_system_score_gemma":0.0021770182,"threshold_uncertainty_score":0.008814037},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035684365324399094,"score_gpt":0.3087632272387393,"score_spread":0.27307886191434017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135750780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04421851,0.012810111,0.7850614,0.012622843,0.00067897217,0.0002878164,0.00035427575,0.0008424033,0.14312364],"genre_scores_gemma":[0.8542841,0.009406897,0.11331141,0.0025158885,0.0006000338,0.00030125992,0.00031464236,0.00014300193,0.019122731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964134,0.0012378687,0.00018303159,0.00044074134,0.0013000816,0.0004248696],"domain_scores_gemma":[0.99641055,0.0013116474,0.00030281284,0.0015373155,0.00035364713,0.000084069085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029875748,0.00046104824,0.00047055786,0.00090926304,0.0016411461,0.0035865153,0.0011636679,0.0023477683,0.0042179264],"category_scores_gemma":[0.0064097675,0.00034753393,0.0008878717,0.001041963,0.0033680592,0.009062382,0.003168014,0.0034061638,0.0011728174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055930785,0.000030850555,0.00034512798,0.00023884665,0.000016401757,0.00015337982,0.00035703988,0.00247912,0.0044042547,0.9420827,0.0036499202,0.046186425],"study_design_scores_gemma":[0.00002800576,0.00015287849,0.00069081015,0.0004361248,0.000046689645,0.0010454354,0.00038158492,0.03650314,0.0216554,0.78874314,0.15025425,0.000062486164],"about_ca_topic_score_codex":0.00039362532,"about_ca_topic_score_gemma":0.0002615382,"teacher_disagreement_score":0.0042179264,"about_ca_system_score_codex":0.0018997389,"about_ca_system_score_gemma":0.0018232603,"threshold_uncertainty_score":0.0158},"labels":[],"label_agreement":null},{"id":"W3137402753","doi":"10.1137/21m140729x","title":"QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; University of Ottawa","keywords":"Zero-knowledge proof; Qubit; Mathematical proof; Quantum complexity theory; Quantum computer; Quantum; Mathematics; Discrete mathematics; Computer science; Conjecture; Quantum mechanics; Physics","score_opus":0.04762198329204018,"score_gpt":0.20278713751726749,"score_spread":0.1551651542252273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137402753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07371849,0.0011900249,0.88181543,0.009539381,0.0003350262,0.00025052775,0.00057512714,0.0012771994,0.031298768],"genre_scores_gemma":[0.84996516,0.0010935139,0.13419321,0.001625631,0.0007156771,0.00047223835,0.00076735776,0.00049507426,0.010672084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494135,0.0014098287,0.00022569954,0.0011192907,0.0017735062,0.0005303836],"domain_scores_gemma":[0.96505797,0.026056234,0.0012920214,0.00509709,0.0017901096,0.00070659805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003692686,0.0010514946,0.0017405205,0.0012224092,0.001928273,0.0035450428,0.0033661888,0.00214637,0.010512903],"category_scores_gemma":[0.027578551,0.00088156085,0.0028264257,0.0012583481,0.006399299,0.009334908,0.009591978,0.012876936,0.0014508174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011219583,0.000098194374,0.0006211636,0.00032658168,0.000044149852,0.00019708717,0.00064361066,0.027496733,0.0030325903,0.94822294,0.0030815245,0.016123146],"study_design_scores_gemma":[0.000039487997,0.0000391282,0.00013784348,0.00003478843,0.00002491824,0.000086210166,0.000073145944,0.06713931,0.004101954,0.9248173,0.0034722956,0.00003354286],"about_ca_topic_score_codex":0.0017536309,"about_ca_topic_score_gemma":0.0013734389,"teacher_disagreement_score":0.010512903,"about_ca_system_score_codex":0.0027177292,"about_ca_system_score_gemma":0.0025229705,"threshold_uncertainty_score":0.035169244},"labels":[],"label_agreement":null},{"id":"W3156257889","doi":"10.48550/arxiv.2010.03465","title":"Hiding the Access Pattern is Not Enough: Exploiting Search Pattern\\n Leakage in Searchable Encryption","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encryption; Computer science; Leakage (economics); Computer network; Computer security","score_opus":0.2213888094989828,"score_gpt":0.24431835682910735,"score_spread":0.02292954733012456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156257889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41566515,0.0027954301,0.55433047,0.0064078933,0.00016851608,0.00013251322,0.00050401286,0.0016698001,0.018326238],"genre_scores_gemma":[0.97798437,0.0005610986,0.018507278,0.00039254915,0.00006572998,0.00003047161,0.0001193104,0.000069189075,0.0022698534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995634,0.0016244296,0.00029536,0.00037890952,0.0014292574,0.0006379052],"domain_scores_gemma":[0.9881138,0.0055412245,0.0009779425,0.0046925214,0.00043835654,0.00023625279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025389497,0.00046218614,0.0007497232,0.000636543,0.0009780918,0.0019699952,0.0010518548,0.0013481419,0.0015126271],"category_scores_gemma":[0.013570695,0.0004911763,0.0005940053,0.0014503483,0.0030101917,0.008061133,0.0041664145,0.002570434,0.0006455668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020072113,0.00053500617,0.01458766,0.0004956011,0.00023072089,0.0021652458,0.0022254616,0.07639783,0.052182153,0.5443158,0.014306236,0.29055116],"study_design_scores_gemma":[0.00014551941,0.00032919948,0.0028967264,0.00011879498,0.00010989056,0.0029079458,0.00056352164,0.58832365,0.050711088,0.33789682,0.015880711,0.00011607686],"about_ca_topic_score_codex":0.0008087766,"about_ca_topic_score_gemma":0.00058086956,"teacher_disagreement_score":0.0025389497,"about_ca_system_score_codex":0.0014277067,"about_ca_system_score_gemma":0.0012471237,"threshold_uncertainty_score":0.013427436},"labels":[],"label_agreement":null},{"id":"W3157837978","doi":"10.1155/2021/5553256","title":"Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Key Research and Development Projects of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Univariate; Protocol (science); Theoretical computer science; Information retrieval; Multivariate statistics; Medicine; Machine learning","score_opus":0.006373482725630177,"score_gpt":0.22592991027396842,"score_spread":0.21955642754833823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157837978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054523617,0.0005404318,0.93497574,0.0010181846,0.0001005122,0.0005070594,0.00022257328,0.00087542774,0.007236423],"genre_scores_gemma":[0.79815876,0.00061099237,0.19139679,0.00046555733,0.00014107434,0.000564447,0.00043804216,0.00006166616,0.00816266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962303,0.0009751224,0.00031966218,0.00055438746,0.0013726713,0.0005478192],"domain_scores_gemma":[0.9971167,0.0010303478,0.000395168,0.0010197258,0.00032117646,0.00011691809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027624208,0.00044328437,0.0009322792,0.00065736036,0.0010394864,0.0014361994,0.001964496,0.0013407283,0.0022870002],"category_scores_gemma":[0.0043258667,0.0003767783,0.00072590174,0.001105919,0.0013359817,0.0066934535,0.0039999667,0.0019161779,0.00063924596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015180969,0.00069275143,0.0015597665,0.0008319532,0.00018320118,0.0014050783,0.0015277478,0.049630534,0.09258143,0.6324458,0.010038546,0.2075851],"study_design_scores_gemma":[0.0009086592,0.0010723969,0.0010105639,0.00009663332,0.00017663349,0.0022004102,0.0004591628,0.61649305,0.17089963,0.17297699,0.03341973,0.0002861595],"about_ca_topic_score_codex":0.0004959144,"about_ca_topic_score_gemma":0.00030961947,"teacher_disagreement_score":0.0027624208,"about_ca_system_score_codex":0.0010911885,"about_ca_system_score_gemma":0.002326858,"threshold_uncertainty_score":0.014609277},"labels":[],"label_agreement":null},{"id":"W3158107828","doi":"10.1109/jiot.2021.3075540","title":"Verifiable and Secure SVM Classification for Cloud-Based Health Monitoring Services","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"China Scholarship Council; Natural Science Foundation of Hunan Province; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Verifiable secret sharing; Cloud computing; Mathematical proof; Computer science; Notation; Confidentiality; Algorithm; Theoretical computer science; Computer security; Mathematics; Arithmetic; Programming language","score_opus":0.02750303236781765,"score_gpt":0.2860992746113809,"score_spread":0.25859624224356326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158107828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09100304,0.0007761648,0.8970105,0.00196798,0.00031041531,0.00035563522,0.0005915934,0.0035642532,0.0044204914],"genre_scores_gemma":[0.92298555,0.00020025052,0.0737656,0.00026331798,0.00015196108,0.00013389152,0.00040258904,0.000075699594,0.002021083],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99456644,0.0011391108,0.0005290599,0.000885566,0.0020699059,0.00080998824],"domain_scores_gemma":[0.9883725,0.0029505321,0.0019955859,0.0048840847,0.0013993137,0.0003980319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029001806,0.0006645904,0.0011788943,0.0007345659,0.0014831044,0.0023373321,0.0021734352,0.0015440373,0.0029743311],"category_scores_gemma":[0.01047248,0.0003690805,0.0007201329,0.0010004148,0.0012050327,0.0041941525,0.003442598,0.002302569,0.0014423219],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046778847,0.0009260613,0.013982431,0.00043815663,0.00031665794,0.0016730203,0.0009988198,0.13932544,0.095027246,0.20194665,0.025012482,0.5156752],"study_design_scores_gemma":[0.00012276828,0.00016193611,0.0013708121,0.000040166906,0.00005502604,0.00039194388,0.000085408334,0.91481096,0.043327697,0.034468185,0.005107376,0.00005771863],"about_ca_topic_score_codex":0.0018437499,"about_ca_topic_score_gemma":0.001315988,"teacher_disagreement_score":0.0029743311,"about_ca_system_score_codex":0.0022488215,"about_ca_system_score_gemma":0.0026916182,"threshold_uncertainty_score":0.016316414},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.036040342662557255,"score_gpt":0.330014678386462,"score_spread":0.29397433572390474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158731422","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029648256,0.00043435965,0.9641164,0.00054792105,0.00016768317,0.00026573482,0.00018530803,0.00031410926,0.004320216],"genre_scores_gemma":[0.7762978,0.0005682031,0.21590973,0.00031632688,0.00010785393,0.000259365,0.00038021398,0.00004646683,0.006114019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785596,0.00057140534,0.00021145992,0.0002448988,0.00088589365,0.00023034566],"domain_scores_gemma":[0.9987895,0.0003027751,0.00017485721,0.0003988221,0.00025812045,0.00007588207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011867333,0.00035703206,0.00059764576,0.000519418,0.0007571952,0.0009533996,0.0009951034,0.0005589736,0.0013392102],"category_scores_gemma":[0.002866499,0.00018655046,0.00058605336,0.0011335241,0.0006965755,0.0029934365,0.0017770622,0.0012162577,0.0005564375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093367574,0.0002960286,0.0015495828,0.00042489756,0.00010695874,0.0011595938,0.00077775226,0.06591012,0.116632566,0.5729099,0.012293199,0.22700574],"study_design_scores_gemma":[0.00022859803,0.0005205336,0.0012377248,0.000107762426,0.00010953536,0.0025365625,0.00022887025,0.73967624,0.09016244,0.1245272,0.04046286,0.00020172705],"about_ca_topic_score_codex":0.00055816676,"about_ca_topic_score_gemma":0.00045994535,"teacher_disagreement_score":0.0013392102,"about_ca_system_score_codex":0.0008764572,"about_ca_system_score_gemma":0.0012429056,"threshold_uncertainty_score":0.00635916},"labels":[],"label_agreement":null},{"id":"W3162638080","doi":"10.1007/978-3-030-75245-3_24","title":"Non-interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"Viet Nam National University Ho Chi Minh City; Agence Nationale de la Recherche; European Commission","keywords":"Computer science; Random oracle; Encryption; Semantic security; Theoretical computer science; Cryptosystem; Server; Public-key cryptography; Threshold cryptosystem; Ciphertext; Standard Model (mathematical formulation); Discrete logarithm; Computer security; Computer network; Attribute-based encryption","score_opus":0.01697826202774497,"score_gpt":0.25201385858266684,"score_spread":0.23503559655492187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162638080","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052960284,0.0015516172,0.8180837,0.0012939618,0.00042129587,0.00014678044,0.0003107511,0.0018916435,0.123340085],"genre_scores_gemma":[0.7965851,0.0015027516,0.12774009,0.0004073974,0.0003175033,0.00020815355,0.0003759666,0.00060776644,0.07225529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985185,0.00020825541,0.00006313963,0.00025074012,0.00067698676,0.00028246746],"domain_scores_gemma":[0.9987866,0.00042970688,0.00006915884,0.00047315613,0.00015357498,0.00008779946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088373816,0.0008547483,0.0006774508,0.00083428464,0.00090542965,0.003648172,0.0013566299,0.0012412617,0.00695929],"category_scores_gemma":[0.0025442082,0.00056848075,0.00069702003,0.0015497834,0.0021858332,0.0065513733,0.0038571935,0.0040117525,0.00267592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019168474,0.000048483384,0.00012608801,0.00011688323,0.000015672575,0.00006231977,0.00017479295,0.007405419,0.010477381,0.94182664,0.0044410457,0.035113614],"study_design_scores_gemma":[0.000045258865,0.00007046372,0.00019573461,0.000033705586,0.000018703498,0.00024487975,0.00005259923,0.1067829,0.019829579,0.8504268,0.0222595,0.00004000397],"about_ca_topic_score_codex":0.0003207123,"about_ca_topic_score_gemma":0.0004146235,"teacher_disagreement_score":0.00695929,"about_ca_system_score_codex":0.0016270083,"about_ca_system_score_gemma":0.0012653141,"threshold_uncertainty_score":0.023281157},"labels":[],"label_agreement":null},{"id":"W3163561067","doi":"10.1109/tsc.2021.3081350","title":"Efficient Privacy-Preserving Similarity Range Query With Quadsector Tree in eHealthcare","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Outsourcing; Range query (database); Tree (set theory); Data mining; Information privacy; Computer security; Information retrieval; Web search query; Web query classification; Search engine","score_opus":0.016543313998073343,"score_gpt":0.25330689143122664,"score_spread":0.2367635774331533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163561067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09625809,0.0012556929,0.8953774,0.00095836923,0.00010863821,0.00036256967,0.0004338278,0.0006813425,0.0045642164],"genre_scores_gemma":[0.9017185,0.00045906502,0.09476835,0.0002911876,0.00006235521,0.0001462404,0.00037959017,0.000027427019,0.0021472753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566984,0.001209827,0.00040762773,0.0006019162,0.0014714994,0.00063932774],"domain_scores_gemma":[0.99689984,0.00107962,0.00034364744,0.0010190238,0.00049374875,0.00016401148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021640428,0.00042638628,0.0011816983,0.0007803556,0.0011349629,0.0014401397,0.0014099637,0.001184826,0.0017761328],"category_scores_gemma":[0.0050683664,0.0002656213,0.0008447837,0.0018022474,0.0009341866,0.0055117668,0.0035122142,0.001284737,0.00050939317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030449315,0.000555125,0.0054717707,0.0007001482,0.00030950533,0.001769273,0.0023502314,0.1589851,0.10148842,0.32514948,0.0135704875,0.3866055],"study_design_scores_gemma":[0.00020417884,0.00066430157,0.0013335698,0.000054147218,0.00009770622,0.0023168612,0.00049655815,0.8315258,0.034259565,0.11829955,0.010595807,0.00015191744],"about_ca_topic_score_codex":0.0010731448,"about_ca_topic_score_gemma":0.0005516704,"teacher_disagreement_score":0.0021640428,"about_ca_system_score_codex":0.0011590293,"about_ca_system_score_gemma":0.0014418208,"threshold_uncertainty_score":0.011444628},"labels":[],"label_agreement":null},{"id":"W3163835182","doi":"10.1007/978-3-030-99253-8_9","title":"Categorical composable cryptography","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; University of Ottawa","keywords":"Computer science; Theoretical computer science; Cryptography; Bipartite graph; Financial cryptography; Computer security; Set (abstract data type); Modular design; String (physics); Programming language; Mathematics; Public-key cryptography; Encryption","score_opus":0.014220224505262526,"score_gpt":0.23349144187826407,"score_spread":0.21927121737300154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163835182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02506331,0.0023928478,0.6872822,0.002615322,0.00074690365,0.0001210434,0.0003584681,0.0010826152,0.28033736],"genre_scores_gemma":[0.74013114,0.0025788224,0.14636463,0.0011324122,0.0005109944,0.000327931,0.0006642383,0.0004018521,0.10788791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897325,0.00029060393,0.000048642985,0.00019103564,0.00039915543,0.00009734079],"domain_scores_gemma":[0.9991074,0.0003406884,0.000045624525,0.00029510594,0.00013237205,0.000078837744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008499868,0.00041453537,0.00043288292,0.0009224636,0.0011663747,0.0031596783,0.0009627293,0.0008991346,0.008707667],"category_scores_gemma":[0.0015232046,0.00026582775,0.000714828,0.00087830436,0.0037506693,0.005326488,0.0022952144,0.0027336746,0.0019684732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031381096,0.000002049866,0.000017117387,0.000011802062,0.0000011260396,0.0000066751822,0.000046891193,0.0005255508,0.00022293633,0.99679923,0.00040887858,0.0019545762],"study_design_scores_gemma":[0.0000029975945,0.000008652108,0.000027853988,0.000012270612,0.00000241871,0.000035299938,0.000023935027,0.004115085,0.00060394336,0.963055,0.032108042,0.000004640636],"about_ca_topic_score_codex":0.00080523797,"about_ca_topic_score_gemma":0.00049661216,"teacher_disagreement_score":0.008707667,"about_ca_system_score_codex":0.002591709,"about_ca_system_score_gemma":0.0010080981,"threshold_uncertainty_score":0.029130042},"labels":[],"label_agreement":null},{"id":"W3165430365","doi":"10.1007/978-3-030-75248-4_24","title":"Group Encryption: Full Dynamicity, Message Filtering and Code-Based Instantiation","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Ministry of Education, India","keywords":"Computer science; Encryption; Code (set theory); Programming language; Group (periodic table); Theoretical computer science; Computer security","score_opus":0.0136483921077029,"score_gpt":0.2297850883350434,"score_spread":0.2161366962273405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165430365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01522245,0.0009707311,0.9620317,0.0004996724,0.00018224178,0.00014531647,0.00013790824,0.0026286263,0.018181272],"genre_scores_gemma":[0.45660922,0.0016145547,0.5009929,0.0004253578,0.00032424252,0.00028328807,0.0006304281,0.0014270181,0.03769301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980557,0.0004215183,0.00013121268,0.00034485612,0.00073270424,0.000314034],"domain_scores_gemma":[0.99762744,0.00045423518,0.00009799215,0.001533133,0.00021847215,0.00006879405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014235834,0.00081221457,0.0010742081,0.0009422446,0.000850263,0.0029369018,0.0014531187,0.001289569,0.0043435018],"category_scores_gemma":[0.0034201383,0.0006212164,0.0010050534,0.0013711427,0.0019973437,0.006058406,0.0033072631,0.0022506882,0.0027713715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034545132,0.00012489448,0.00038503608,0.00020655578,0.000037850365,0.00015130028,0.00033494027,0.014581912,0.014653797,0.6915073,0.011541409,0.26612964],"study_design_scores_gemma":[0.0000824173,0.00015687782,0.0003567165,0.00010260374,0.00008063919,0.0009688815,0.0000806745,0.18082327,0.036316685,0.71728635,0.06367176,0.000073104566],"about_ca_topic_score_codex":0.00043137855,"about_ca_topic_score_gemma":0.00039531037,"teacher_disagreement_score":0.0043435018,"about_ca_system_score_codex":0.0012232623,"about_ca_system_score_gemma":0.0010654889,"threshold_uncertainty_score":0.01453048},"labels":[],"label_agreement":null},{"id":"W3167757819","doi":"10.1145/3433210.3453103","title":"Low-Cost Hiding of the Query Pattern","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Query optimization; Range query (database); Encryption; Padding; Sargable; Web search query; Query expansion; Plaintext; Spatial query; Online aggregation; Smoothing; Web query classification; Overhead (engineering); Data mining; Theoretical computer science; Database; Information retrieval; Computer security; Search engine","score_opus":0.01306696105036377,"score_gpt":0.22349951930483047,"score_spread":0.21043255825446672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167757819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31279877,0.001737051,0.66419655,0.00092113286,0.00012801537,0.00041520238,0.00048661427,0.012438785,0.006877817],"genre_scores_gemma":[0.9426832,0.0001930924,0.05336845,0.000115605726,0.000039734015,0.000052891326,0.00024555513,0.00017556667,0.0031258606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647516,0.00039064337,0.00026592085,0.0004214131,0.0018751937,0.00057158875],"domain_scores_gemma":[0.9828819,0.0028907752,0.0010428727,0.011976178,0.0009535638,0.00025473814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014085277,0.0006388516,0.0010564871,0.000765907,0.00075249653,0.0013124294,0.0014754919,0.000757552,0.003094984],"category_scores_gemma":[0.0068880725,0.00048304565,0.00069643575,0.0011881075,0.0011233441,0.005003875,0.0024721657,0.0012668015,0.0016434282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030913758,0.0005040253,0.010280241,0.0006498711,0.000271164,0.00077860313,0.00088648027,0.035624765,0.3669668,0.06789494,0.009728083,0.5033236],"study_design_scores_gemma":[0.00019831482,0.00097234664,0.0065430757,0.00007709314,0.00019983383,0.0027752144,0.00036720413,0.5233705,0.3963723,0.04561985,0.023341225,0.0001630175],"about_ca_topic_score_codex":0.0008720368,"about_ca_topic_score_gemma":0.00059049006,"teacher_disagreement_score":0.003094984,"about_ca_system_score_codex":0.0009862526,"about_ca_system_score_gemma":0.0013286017,"threshold_uncertainty_score":0.010353684},"labels":[],"label_agreement":null},{"id":"W3168081317","doi":"10.1007/978-3-030-78372-3_17","title":"Password Protected Secret Sharing from Lattices","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Password; Computer science; Secret sharing; Server; Computer security; Shared secret; Zero-knowledge password proof; One-time password; Encryption; Password policy; Computer network; Cryptography","score_opus":0.020924660005316956,"score_gpt":0.2418055103353354,"score_spread":0.22088085033001845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168081317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05148281,0.0014715483,0.8149683,0.0016570874,0.00052051945,0.0002553864,0.0006750672,0.0023466202,0.12662265],"genre_scores_gemma":[0.78966606,0.0013689443,0.13064022,0.0003926494,0.00039120216,0.0003109017,0.0007614997,0.00072128425,0.07574726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983878,0.00038693566,0.00007761389,0.0001629698,0.0007580502,0.00022671322],"domain_scores_gemma":[0.9976895,0.0009535706,0.0001213628,0.0009649844,0.00017089992,0.00009978634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118445,0.0007067422,0.0010302161,0.0008148024,0.0011872776,0.0026555664,0.0011632667,0.0010039356,0.014669546],"category_scores_gemma":[0.0039238073,0.00058013486,0.0007362303,0.0016218642,0.0020879493,0.004493004,0.004584628,0.0025010568,0.0046036798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002539131,0.00006618635,0.000105715684,0.00015854888,0.000017695193,0.00015480876,0.00021538127,0.014709427,0.005879945,0.891614,0.0094333505,0.077390976],"study_design_scores_gemma":[0.00004564337,0.00005783784,0.000053722746,0.0000486964,0.000008693528,0.00023333672,0.00004340658,0.04428912,0.006628429,0.93416494,0.014398331,0.00002789732],"about_ca_topic_score_codex":0.00027971133,"about_ca_topic_score_gemma":0.00029846624,"teacher_disagreement_score":0.014669546,"about_ca_system_score_codex":0.0011274226,"about_ca_system_score_gemma":0.0008856311,"threshold_uncertainty_score":0.04907447},"labels":[],"label_agreement":null},{"id":"W3168804","doi":"","title":"Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases.","year":2009,"lang":"en","type":"article","venue":"Network and Distributed System Security Symposium","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Cryptography; Key (lock); Private information retrieval; Protocol (science); Information privacy; Database; Computer security; Computation; Cryptographic primitive; Secure multi-party computation; Distributed database; Information sensitivity; Cryptographic protocol; Distributed computing; Algorithm","score_opus":0.017368739219064636,"score_gpt":0.26339243087163244,"score_spread":0.24602369165256782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037004333,0.00031606882,0.98872656,0.0015819101,0.00010501867,0.00040894622,0.00012258645,0.00030179956,0.0047367075],"genre_scores_gemma":[0.40819126,0.0010742341,0.57102996,0.0013312096,0.00051644584,0.0023013602,0.00055725616,0.000174626,0.014823703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9774869,0.008869027,0.0015065285,0.0023547548,0.008453317,0.0013293927],"domain_scores_gemma":[0.9862099,0.006067295,0.0008976797,0.0054321,0.0009082973,0.0004845774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014368607,0.0013473192,0.0019919171,0.0011565,0.0027152838,0.0072263945,0.005393961,0.004394971,0.0054280967],"category_scores_gemma":[0.016721684,0.0009029816,0.0026836314,0.0029501182,0.0052962704,0.014669195,0.0059705838,0.006503459,0.002128269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016455157,0.00010017528,0.00027218417,0.00015850281,0.00006091022,0.0003996863,0.00032609983,0.026013365,0.0016064651,0.9582425,0.0032657615,0.009389799],"study_design_scores_gemma":[0.00021407777,0.00015630331,0.00009185093,0.00005833848,0.00006132617,0.0005790011,0.0001198634,0.35302293,0.0027467639,0.6222253,0.020671247,0.000053023952],"about_ca_topic_score_codex":0.0011141447,"about_ca_topic_score_gemma":0.001143674,"teacher_disagreement_score":0.014368607,"about_ca_system_score_codex":0.0035262608,"about_ca_system_score_gemma":0.0037048901,"threshold_uncertainty_score":0.075989366},"labels":[],"label_agreement":null},{"id":"W3169388419","doi":"10.1016/j.micpro.2021.104280","title":"Area and power efficient post-quantum cryptosystem for IoT resource-constrained devices","year":2021,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Computer science; Cryptosystem; Field-programmable gate array; Cryptography; Modular design; Power analysis; Embedded system; Computer security; Operating system","score_opus":0.008653303085412848,"score_gpt":0.21614896748544807,"score_spread":0.20749566440003522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169388419","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37570173,0.0023630336,0.56852174,0.001760763,0.00032990432,0.00012910199,0.00033055968,0.0006552633,0.050207853],"genre_scores_gemma":[0.96618414,0.00030276654,0.026212558,0.00008577035,0.00003867337,0.000021960881,0.000058183916,0.000018784855,0.0070770667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999851,0.000021213411,0.000007322627,0.000027479042,0.00006105207,0.00003199432],"domain_scores_gemma":[0.99984634,0.000046304405,0.000020799896,0.000039468177,0.00003733413,0.000009675174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016984422,0.0001802573,0.0002387376,0.00018781623,0.0003723474,0.0004812025,0.00034364514,0.00024051513,0.0050703194],"category_scores_gemma":[0.00037696783,0.00009682302,0.00014696605,0.00032422962,0.00030743456,0.00095945573,0.0004484419,0.00042441726,0.0003917584],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011689744,0.00026762031,0.0013198393,0.000441989,0.000083517545,0.00038234072,0.000185163,0.07608866,0.31517863,0.42276955,0.010952767,0.1711609],"study_design_scores_gemma":[0.00013076865,0.0004582899,0.001672125,0.000057170888,0.00006324119,0.0008732188,0.000113056165,0.7340307,0.122618094,0.121574804,0.018356686,0.000051818417],"about_ca_topic_score_codex":0.00021024622,"about_ca_topic_score_gemma":0.00058663957,"teacher_disagreement_score":0.0050703194,"about_ca_system_score_codex":0.00033380536,"about_ca_system_score_gemma":0.00050879753,"threshold_uncertainty_score":0.016961932},"labels":[],"label_agreement":null},{"id":"W3173588045","doi":"10.1109/tbdata.2021.3089986","title":"SOREL: Efficient and Secure ORE-based Range Query over Outsourced Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Big Data","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Scalability; Encryption; Cloud computing; Range query (database); Outsourcing; Scheme (mathematics); Big data; Query optimization; Sargable; Database; Distributed computing; Computer security; Data mining; Web search query; Operating system; Information retrieval; Search engine","score_opus":0.08136779334271013,"score_gpt":0.27963554450835715,"score_spread":0.19826775116564702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173588045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100972876,0.0013898859,0.8851867,0.00061139,0.00011823277,0.0004499845,0.0005622723,0.0032788594,0.0074298447],"genre_scores_gemma":[0.8246819,0.00070251466,0.16766404,0.0003250054,0.00009691065,0.00017299486,0.0007806113,0.00012845849,0.005447646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731785,0.00042875632,0.000268591,0.00024914864,0.0012757768,0.0004599134],"domain_scores_gemma":[0.99687344,0.0005824864,0.00039295756,0.001572997,0.0004480835,0.00012999942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018359587,0.00044535956,0.0012605187,0.00084520556,0.0006953113,0.001367863,0.0016114671,0.00068469637,0.0022897644],"category_scores_gemma":[0.0035252823,0.00031974423,0.0007482861,0.0013032666,0.0010587999,0.005856037,0.00405325,0.0011904371,0.00082752627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033258577,0.00071961404,0.0043351823,0.00095987745,0.0002695294,0.0013820641,0.0014245966,0.0889556,0.15341033,0.19643271,0.021757398,0.52702725],"study_design_scores_gemma":[0.0004375731,0.0011303324,0.0019514817,0.00008555227,0.00012696245,0.0023378474,0.0006187803,0.7703734,0.11920422,0.06757429,0.03594564,0.0002138881],"about_ca_topic_score_codex":0.0009486538,"about_ca_topic_score_gemma":0.00088511565,"teacher_disagreement_score":0.0022897644,"about_ca_system_score_codex":0.00082496385,"about_ca_system_score_gemma":0.0016384225,"threshold_uncertainty_score":0.009709597},"labels":[],"label_agreement":null},{"id":"W3174675643","doi":"10.1109/aiiot52608.2021.9454223","title":"Batching Anonymous and Non-Anonymous Membership Proofs for Blockchain Applications","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Anonymity; Theoretical computer science; Discrete logarithm; Zero-knowledge proof; Proof-of-work system; Set (abstract data type); Scheme (mathematics); Cryptography; Computer security; Blockchain; Mathematics; Public-key cryptography; Encryption","score_opus":0.011759796796710326,"score_gpt":0.2456615449824501,"score_spread":0.23390174818573978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174675643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027433492,0.00038622686,0.96355015,0.00043661977,0.00012545577,0.00032913097,0.00015429912,0.0032391641,0.0043454655],"genre_scores_gemma":[0.6615946,0.00044071086,0.3247676,0.00018237515,0.00016816397,0.0003516409,0.0003462546,0.00035430252,0.0117943045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613816,0.0010703208,0.00034645863,0.00061390473,0.0014807456,0.00035031734],"domain_scores_gemma":[0.99086386,0.0033159247,0.00079476123,0.003480062,0.0010943558,0.000451033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038698928,0.00043073835,0.00060019275,0.0005053819,0.001328484,0.0028050574,0.0018927177,0.00166258,0.0059652235],"category_scores_gemma":[0.009183605,0.0004752915,0.00065962784,0.0007632294,0.0013709677,0.005953433,0.0038307072,0.0018694369,0.0015441504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026857601,0.00049100677,0.0022238737,0.000865411,0.00013415345,0.0017202852,0.0016955442,0.0827774,0.07526096,0.4948569,0.010137016,0.32715172],"study_design_scores_gemma":[0.0002505299,0.000605889,0.00073380047,0.0001262854,0.00007647313,0.0010312612,0.00027206008,0.5585613,0.084186904,0.29306749,0.06094632,0.00014162474],"about_ca_topic_score_codex":0.0010822234,"about_ca_topic_score_gemma":0.00093102676,"teacher_disagreement_score":0.0059652235,"about_ca_system_score_codex":0.0013426968,"about_ca_system_score_gemma":0.002035093,"threshold_uncertainty_score":0.020466208},"labels":[],"label_agreement":null},{"id":"W3174826346","doi":"10.1007/978-3-030-81293-5_9","title":"The “Quantum Annoying” Property of Password-Authenticated Key Exchange Protocols","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Password; Random oracle; Discrete logarithm; Theoretical computer science; Quantum computer; Oracle; Computer security; Quantum; Adversary; Protocol (science); Encryption; Public-key cryptography; Quantum mechanics; Physics","score_opus":0.030300945464490782,"score_gpt":0.2673557013913502,"score_spread":0.2370547559268594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174826346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066300385,0.0026914375,0.76016706,0.006893202,0.0014735567,0.00017310998,0.00022364121,0.0010120461,0.1610655],"genre_scores_gemma":[0.9009388,0.002117202,0.05322813,0.001286985,0.0011097986,0.00025835904,0.0001630644,0.0003265787,0.040571056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655116,0.0011411983,0.00022398203,0.0005306609,0.0011525049,0.0004006315],"domain_scores_gemma":[0.9917282,0.004105155,0.0004951004,0.0028236173,0.00059924554,0.00024867494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002467524,0.00066259137,0.0008561172,0.0005911294,0.0020186382,0.0041389554,0.0013910221,0.0022656766,0.0062820865],"category_scores_gemma":[0.010985089,0.000678929,0.0006357657,0.0012624544,0.0071305144,0.011036307,0.0032600223,0.0060693473,0.0019695847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012961178,0.000020108515,0.00009418,0.00007213315,0.000009296039,0.00007960644,0.00027528193,0.0012987405,0.0026414404,0.9772843,0.003054386,0.015040933],"study_design_scores_gemma":[0.000025754074,0.00004866781,0.00010501886,0.000028103175,0.000018339288,0.00024708174,0.00006363189,0.011906224,0.005021547,0.9660511,0.016459586,0.000024857725],"about_ca_topic_score_codex":0.00025395997,"about_ca_topic_score_gemma":0.00016124971,"teacher_disagreement_score":0.0062820865,"about_ca_system_score_codex":0.0008802011,"about_ca_system_score_gemma":0.0012347226,"threshold_uncertainty_score":0.021015704},"labels":[],"label_agreement":null},{"id":"W3176170052","doi":"10.1109/aiiot52608.2021.9454203","title":"Mutually Private Verifiable Machine Learning As-a-service: A Distributed Approach","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Correctness; Machine learning; Verifiable secret sharing; Commit; Artificial intelligence; Distributed computing; Service (business); Service provider; Usability; Software engineering; Human–computer interaction; Database; Programming language; Set (abstract data type)","score_opus":0.012463127689052944,"score_gpt":0.22226255120529712,"score_spread":0.20979942351624417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176170052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032132522,0.00013804529,0.99260336,0.00084413117,0.00006152349,0.00017161705,0.000039180322,0.0011640559,0.0017648693],"genre_scores_gemma":[0.36856866,0.0006014345,0.6207979,0.00070995436,0.00035528807,0.00069557456,0.00022177961,0.00058155076,0.00746784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9839144,0.006602964,0.00096077495,0.0021914726,0.0051169572,0.0012135076],"domain_scores_gemma":[0.9541655,0.018579144,0.0024268993,0.018933108,0.004563589,0.0013317862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016556095,0.0009900753,0.0014902736,0.001769166,0.0025529866,0.00759108,0.0048644226,0.0030520628,0.006448481],"category_scores_gemma":[0.031941786,0.0012461755,0.0017563968,0.0012359481,0.005396855,0.014031549,0.010977077,0.00640739,0.0020255588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004155711,0.0001862044,0.0006905262,0.00029757107,0.000103394515,0.0005077805,0.00072212546,0.054685142,0.009163646,0.8458928,0.0048094084,0.082525685],"study_design_scores_gemma":[0.00016298807,0.00013544607,0.000107790096,0.00007571919,0.00008080423,0.0003256755,0.00014156639,0.4557946,0.012159576,0.5075665,0.023380825,0.00006840757],"about_ca_topic_score_codex":0.0014157493,"about_ca_topic_score_gemma":0.0013402624,"teacher_disagreement_score":0.016556095,"about_ca_system_score_codex":0.0032841112,"about_ca_system_score_gemma":0.006049563,"threshold_uncertainty_score":0.08755809},"labels":[],"label_agreement":null},{"id":"W3181633825","doi":"10.36227/techrxiv.12094152.v1","title":"Privacy Preservation in Big Data using Web Log Analyzer and Attribute Based Encryption","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Encryption; Computer science; Computer security; Client-side encryption; Hacker; On-the-fly encryption; Filesystem-level encryption; Cloud computing; Homomorphic encryption; World Wide Web; Operating system","score_opus":0.24561846618973268,"score_gpt":0.3276718956289597,"score_spread":0.08205342943922703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181633825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055282164,0.00071590155,0.937419,0.0007481763,0.0001049573,0.00010859823,0.00035947532,0.0015681387,0.0036935436],"genre_scores_gemma":[0.844722,0.00070541905,0.15030846,0.00025755446,0.000155799,0.0001338329,0.0005595037,0.000113200025,0.0030443268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666107,0.0009830772,0.00030173888,0.0005045408,0.0012818333,0.0002676559],"domain_scores_gemma":[0.9936959,0.0014189592,0.0005592229,0.003650328,0.0005030887,0.00017244778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022895518,0.00033960212,0.0006944322,0.0010260523,0.0008016851,0.0027643773,0.0008345418,0.0007018239,0.0010222144],"category_scores_gemma":[0.0055693355,0.0002696755,0.0008862274,0.002068535,0.0011166742,0.005032853,0.0020884105,0.0014366906,0.0005304645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018168257,0.00064184476,0.011145219,0.0005742112,0.00033938128,0.0022250768,0.0013199914,0.06398401,0.09405485,0.35913193,0.011468317,0.45329842],"study_design_scores_gemma":[0.0001063599,0.0002686786,0.0036056335,0.00008599269,0.0000989115,0.0030088697,0.00050095824,0.6353192,0.10934238,0.22568645,0.021873325,0.00010324408],"about_ca_topic_score_codex":0.00040749504,"about_ca_topic_score_gemma":0.00028846972,"teacher_disagreement_score":0.0027643773,"about_ca_system_score_codex":0.0006551844,"about_ca_system_score_gemma":0.0010684218,"threshold_uncertainty_score":0.012108445},"labels":[],"label_agreement":null},{"id":"W3184781063","doi":"10.3390/electronics10151777","title":"Word-Based Systolic Processor for Field Multiplication and Squaring Suitable for Cryptographic Processors in Resource-Constrained IoT Systems","year":2021,"lang":"en","type":"article","venue":"Electronics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cryptography; Multiplication (music); Word (group theory); Embedded system; Cryptographic primitive; Field (mathematics); Cryptographic protocol; Elliptic curve cryptography; Flexibility (engineering); Distributed computing; Computer hardware; Computer network; Computer security; Public-key cryptography; Encryption; Mathematics","score_opus":0.01222762772403247,"score_gpt":0.24960592013342667,"score_spread":0.2373782924093942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184781063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14503655,0.0011277798,0.8349116,0.0002937868,0.00025830395,0.00022274032,0.0001714258,0.0024594998,0.015518364],"genre_scores_gemma":[0.65953016,0.0005916304,0.3291034,0.0002972362,0.000120814315,0.0001664567,0.00039540132,0.00010732472,0.009687505],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998634,0.000027092496,0.00001910656,0.00002307438,0.000050832303,0.00001663609],"domain_scores_gemma":[0.999767,0.000044898683,0.000044885965,0.000045487803,0.000085427535,0.000012222554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017588439,0.0004120089,0.0002456724,0.00030955335,0.00024999576,0.0005560245,0.0006170992,0.0002545609,0.0042792913],"category_scores_gemma":[0.0004385522,0.00014559855,0.0002340778,0.0005775201,0.00021610431,0.00079892296,0.0003343111,0.00040183423,0.0013675244],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082755,0.00028749314,0.001718592,0.0006067893,0.000079751786,0.00070641236,0.00025114222,0.026526129,0.52009636,0.052293643,0.008210638,0.38839546],"study_design_scores_gemma":[0.00025633365,0.005199865,0.002298561,0.00017471802,0.00023772438,0.003183096,0.00022527554,0.31686622,0.5595402,0.019381993,0.09253434,0.00010161418],"about_ca_topic_score_codex":0.00019002336,"about_ca_topic_score_gemma":0.0005078965,"teacher_disagreement_score":0.0042792913,"about_ca_system_score_codex":0.00026230433,"about_ca_system_score_gemma":0.00064207666,"threshold_uncertainty_score":0.014315665},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015669185750342797,"score_gpt":0.24463128426005337,"score_spread":0.22896209850971058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184916135","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027374052,0.47820112,0.09261448,0.024017315,0.0018458038,0.00017749795,0.0005992302,0.0004963864,0.374674],"genre_scores_gemma":[0.25865752,0.63914394,0.045477934,0.0061653904,0.0020740614,0.00025481568,0.0017092342,0.00026550516,0.046251558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979353,0.00064922724,0.00016498104,0.00029171936,0.0007277886,0.00023091935],"domain_scores_gemma":[0.9976482,0.0010811426,0.00016326628,0.00036621024,0.0005776678,0.00016350218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342545,0.00047605234,0.0007263536,0.0037620093,0.0018765443,0.005486646,0.0011225021,0.0018240311,0.0068895924],"category_scores_gemma":[0.0041943514,0.00045307985,0.0005283784,0.0071341274,0.0020983596,0.014738636,0.0031107292,0.0018764721,0.002093158],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024252244,0.000045104884,0.0014400848,0.0010173387,0.000017098313,0.00016825389,0.0010126359,0.00086517015,0.00031924288,0.7987668,0.019988636,0.17633535],"study_design_scores_gemma":[0.0000024802816,0.000029901976,0.00080520083,0.000849693,0.000008814756,0.0006416787,0.0009615868,0.0016934422,0.00027160902,0.16680096,0.8279139,0.00002081334],"about_ca_topic_score_codex":0.0014897784,"about_ca_topic_score_gemma":0.0009901914,"teacher_disagreement_score":0.0068895924,"about_ca_system_score_codex":0.0023380439,"about_ca_system_score_gemma":0.0027436935,"threshold_uncertainty_score":0.023047924},"labels":[],"label_agreement":null},{"id":"W3185315936","doi":"10.2478/popets-2021-0059","title":"You May Also Like... Privacy: Recommendation Systems Meet PIR","year":2021,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Collusion; Protocol (science); Private information retrieval; Collaborative filtering; Consumption (sociology); Matrix decomposition; Theoretical computer science; Recommender system; Computer security; Information retrieval; Business","score_opus":0.021207601739329635,"score_gpt":0.25862365343180804,"score_spread":0.2374160516924784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185315936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045889415,0.0006793805,0.90481424,0.009600296,0.00017945278,0.0004254038,0.00032009196,0.004038034,0.034053586],"genre_scores_gemma":[0.78002805,0.00062519964,0.20231324,0.0023234657,0.00023527864,0.00034730165,0.00034562778,0.00035327772,0.013428542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.987668,0.005057165,0.00060998637,0.0013091705,0.0041544177,0.001201217],"domain_scores_gemma":[0.97636175,0.008601485,0.0012563212,0.011039917,0.0020428153,0.00069780246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009596041,0.00050980534,0.0010715832,0.0006182003,0.0024336618,0.0054623927,0.0017092606,0.0035831053,0.01079766],"category_scores_gemma":[0.02929415,0.0008174268,0.0008778492,0.0010375758,0.0027134947,0.010827209,0.005357441,0.0039001505,0.0069809835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015562152,0.00052345975,0.007892136,0.00058525166,0.00022417461,0.0006035209,0.002058764,0.035537224,0.033175092,0.54669815,0.031063732,0.34008226],"study_design_scores_gemma":[0.00036740841,0.00091881055,0.0027383557,0.00018942113,0.00018969031,0.0015831551,0.0010264384,0.38099158,0.06515269,0.42710683,0.11954763,0.00018793647],"about_ca_topic_score_codex":0.0018663025,"about_ca_topic_score_gemma":0.0010548608,"teacher_disagreement_score":0.01079766,"about_ca_system_score_codex":0.0011180158,"about_ca_system_score_gemma":0.0023615214,"threshold_uncertainty_score":0.050749302},"labels":[],"label_agreement":null},{"id":"W3186306330","doi":"10.4230/lipics.ccc.2021.30","title":"On Query-To-Communication Lifting for Adversary Bounds","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Communication complexity; Mathematics; Gadget; Adversary; Constant (computer programming); Computation; Quantum; Discrete mathematics; Secure two-party computation; Quantum computer; Bounded function; Theoretical computer science; Computer science; Combinatorics; Secure multi-party computation; Algorithm; Quantum mechanics","score_opus":0.012678107947237451,"score_gpt":0.2669322982956679,"score_spread":0.25425419034843044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186306330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036223628,0.00079178927,0.9042105,0.005631358,0.00036840673,0.00033750045,0.00033061393,0.00059302704,0.051513206],"genre_scores_gemma":[0.81040895,0.0018920195,0.15987825,0.003435118,0.0019518312,0.0012817553,0.0005640781,0.0007246529,0.019863322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98391634,0.004330596,0.0006733562,0.0026236624,0.005679739,0.002776285],"domain_scores_gemma":[0.9496573,0.03458267,0.002276972,0.009791799,0.0022354648,0.0014557673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012685358,0.0021531088,0.0020032313,0.0027826233,0.0033014023,0.0069403998,0.004626761,0.0034664862,0.016656594],"category_scores_gemma":[0.03889777,0.0012990958,0.0056491117,0.0028822303,0.009956924,0.025941364,0.014789012,0.017765906,0.0028418663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052255393,0.000057444213,0.00018207953,0.00007417433,0.00001882574,0.00006865619,0.00017902807,0.0068188272,0.0012822555,0.98378307,0.0010532404,0.006430132],"study_design_scores_gemma":[0.00002491942,0.00007685171,0.00019246698,0.000044131466,0.00003647141,0.00008121796,0.000048401078,0.07644757,0.0023432414,0.91682583,0.0038414057,0.000037499205],"about_ca_topic_score_codex":0.0020341878,"about_ca_topic_score_gemma":0.00076526863,"teacher_disagreement_score":0.016656594,"about_ca_system_score_codex":0.007394546,"about_ca_system_score_gemma":0.00276693,"threshold_uncertainty_score":0.06708741},"labels":[],"label_agreement":null},{"id":"W3188417046","doi":"10.32920/ryerson.14644056.v1","title":"Theory and application of encrypted sequential data processing: search and computation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Computer science; Encryption; Cloud computing; Cloud storage; Bloom filter; Phrase search; Scheme (mathematics); Database; Theoretical computer science; Information retrieval; Computer security; Algorithm; Search engine; Operating system","score_opus":0.04898824992731103,"score_gpt":0.3365900516937144,"score_spread":0.2876018017664034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188417046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009189606,0.0058839396,0.94949263,0.0027078863,0.00037157562,0.00018765093,0.00021650667,0.00025438974,0.031695694],"genre_scores_gemma":[0.3610731,0.015807746,0.5917335,0.0014081156,0.0015998544,0.0013237172,0.000549469,0.00021602782,0.026288435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710387,0.0008028004,0.0003159486,0.00058066746,0.0009770103,0.00021964342],"domain_scores_gemma":[0.99557614,0.0028038935,0.00028620995,0.000784158,0.00045895347,0.00009064372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014997,0.0010802874,0.0011580985,0.0024856534,0.0012882898,0.0054622893,0.0021178466,0.0023363626,0.0064665526],"category_scores_gemma":[0.0074488735,0.00080709474,0.0022158623,0.004008052,0.00584376,0.0071298084,0.0023359926,0.0036323934,0.0015399248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036133482,0.000025273566,0.00027062793,0.00022586832,0.000026764816,0.000093344825,0.000093567105,0.030178092,0.00092796166,0.94911796,0.001628118,0.01737644],"study_design_scores_gemma":[0.00002867618,0.000041083313,0.0001486004,0.000075605516,0.000020738544,0.00019273505,0.00004448037,0.31006083,0.0013907554,0.67217255,0.015793677,0.000030312445],"about_ca_topic_score_codex":0.0031205602,"about_ca_topic_score_gemma":0.0013755648,"teacher_disagreement_score":0.0064665526,"about_ca_system_score_codex":0.003594091,"about_ca_system_score_gemma":0.0022240651,"threshold_uncertainty_score":0.026077032},"labels":[],"label_agreement":null},{"id":"W3189558819","doi":"10.1109/icc42927.2021.9500795","title":"A Novel Privacy-Preserving Neural Network Computing Approach for E-Health Information System","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Homomorphic encryption; Computer science; Cloud computing; Encryption; Information privacy; Collusion; Computer security; Health informatics; Health care; Data mining","score_opus":0.028306142328085346,"score_gpt":0.26175003924340284,"score_spread":0.2334438969153175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189558819","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015661936,0.00024120432,0.97821873,0.000472399,0.00005876074,0.000065155575,0.000050936083,0.0003297287,0.004901102],"genre_scores_gemma":[0.8465067,0.00041939077,0.14483353,0.00028923407,0.0000702053,0.00011229586,0.00010979742,0.000037557806,0.0076211942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916255,0.0001549772,0.000053705375,0.00022070963,0.0002897642,0.00011824793],"domain_scores_gemma":[0.9996327,0.000078097,0.000045445922,0.000101055295,0.00011825292,0.000024503637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006047716,0.00035656334,0.0004967388,0.00037956942,0.00077574205,0.001047189,0.0012831576,0.00081130833,0.0020067492],"category_scores_gemma":[0.0010943125,0.00019567469,0.00059595297,0.0005473259,0.0006460755,0.002089115,0.0012098218,0.0010685165,0.00031748548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041863392,0.00023619761,0.0025846926,0.00022776224,0.00013581757,0.00054587063,0.00026511165,0.5431111,0.031195123,0.18326686,0.005297225,0.23271564],"study_design_scores_gemma":[0.0000058595815,0.0000263149,0.000114313145,0.000004063151,0.000010624264,0.000071444185,0.000014047267,0.98391044,0.0028773246,0.011647321,0.001310531,0.000007634934],"about_ca_topic_score_codex":0.003932326,"about_ca_topic_score_gemma":0.00328951,"teacher_disagreement_score":0.003932326,"about_ca_system_score_codex":0.0012481451,"about_ca_system_score_gemma":0.0013670577,"threshold_uncertainty_score":0.009056032},"labels":[],"label_agreement":null},{"id":"W3189763337","doi":"10.1016/j.cose.2021.102432","title":"Achieve efficient position-heap-based privacy-preserving substring-of-keyword query over cloud","year":2021,"lang":"en","type":"article","venue":"Computers & Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Substring; Computer science; Heap (data structure); Keyword search; Cloud computing; Encryption; Inverted index; Information retrieval; Theoretical computer science; Database; Data structure; Computer security; Algorithm; Search engine indexing","score_opus":0.00968859770412619,"score_gpt":0.23670410710597548,"score_spread":0.22701550940184928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189763337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17951773,0.00453086,0.7925157,0.001590103,0.0004916132,0.0006200471,0.003594798,0.010255835,0.0068833604],"genre_scores_gemma":[0.86578345,0.00081960356,0.12560926,0.000482462,0.00016374557,0.00012862333,0.002219247,0.00025518477,0.004538401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995533,0.0003182686,0.00033811523,0.0007900705,0.0016761513,0.00134435],"domain_scores_gemma":[0.9968695,0.0006591433,0.00024900126,0.0013772582,0.00062603084,0.00021907096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013633255,0.0010732133,0.0038884252,0.0012762077,0.0018982693,0.002834722,0.0027921586,0.0012285496,0.003355226],"category_scores_gemma":[0.003780742,0.0005701334,0.0010514156,0.0040501677,0.0008911837,0.005785927,0.0055962605,0.0013623611,0.0013901606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008021141,0.0013775713,0.011485485,0.0017460794,0.0005975887,0.0016026142,0.001565098,0.09822274,0.19257067,0.11661352,0.057930626,0.50826687],"study_design_scores_gemma":[0.00043948658,0.00056090433,0.0017180751,0.000043035583,0.00027172855,0.0013908475,0.00088850636,0.829657,0.080215566,0.07371981,0.010955623,0.00013945698],"about_ca_topic_score_codex":0.0060366085,"about_ca_topic_score_gemma":0.006882415,"teacher_disagreement_score":0.0060366085,"about_ca_system_score_codex":0.001675459,"about_ca_system_score_gemma":0.0055946694,"threshold_uncertainty_score":0.012156367},"labels":[],"label_agreement":null},{"id":"W3189950886","doi":"10.3390/app11156938","title":"Energy-Efficient Word-Serial Processor for Field Multiplication and Squaring Suitable for Lightweight Authentication Schemes in RFID-Based IoT Applications","year":2021,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Elliptic curve cryptography; Multiplication (music); Radio-frequency identification; Authentication (law); Cryptography; Embedded system; Efficient energy use; Computer hardware; Computer security; Encryption; Public-key cryptography; Engineering","score_opus":0.017559337490152396,"score_gpt":0.26696890370026555,"score_spread":0.24940956621011315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189950886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109250665,0.0005989837,0.8768715,0.00014108804,0.00011521025,0.00018590952,0.00007799383,0.001989629,0.0107690105],"genre_scores_gemma":[0.7014778,0.0003958127,0.2898135,0.00016380426,0.000059463106,0.00015720411,0.0002603804,0.00011778615,0.0075541455],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981457,0.00003413038,0.000022719565,0.000031892414,0.00007664687,0.000020039546],"domain_scores_gemma":[0.9997197,0.000055679924,0.00006227559,0.000068193476,0.000084457824,0.000009563123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001826022,0.00033864498,0.00024407917,0.00033926297,0.00025308903,0.0004249656,0.00058370805,0.0002275956,0.0033069928],"category_scores_gemma":[0.00043413942,0.00015047312,0.00024261631,0.0004959454,0.00024934518,0.00066547876,0.00028579734,0.0003177862,0.0011421323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006072456,0.00020619883,0.0016910891,0.00064859434,0.00006817234,0.0005860922,0.00025753563,0.023666395,0.6153575,0.055749696,0.0046813698,0.29648006],"study_design_scores_gemma":[0.00020754203,0.0026186907,0.0021584316,0.00013794094,0.00018027164,0.0029360529,0.00012592168,0.26310512,0.6338278,0.015578776,0.0790421,0.0000813885],"about_ca_topic_score_codex":0.00015216718,"about_ca_topic_score_gemma":0.000375765,"teacher_disagreement_score":0.0033069928,"about_ca_system_score_codex":0.00023534149,"about_ca_system_score_gemma":0.00059548224,"threshold_uncertainty_score":0.01106298},"labels":[],"label_agreement":null},{"id":"W3190306355","doi":"10.1109/tnsm.2021.3103509","title":"Efficient Inter-Cloud Authentication and Micropayment Protocol for IoT Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Computer science; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic","score_opus":0.017430615025691737,"score_gpt":0.2640005757143076,"score_spread":0.24656996068861584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190306355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023451485,0.0026922063,0.9620667,0.00066477427,0.0005029351,0.00041623213,0.0002423063,0.0027235944,0.007239717],"genre_scores_gemma":[0.7423553,0.0029472483,0.23686634,0.00050839595,0.000423,0.00057780364,0.00084297697,0.00023102592,0.015247916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983272,0.00032571764,0.00019546255,0.00026850024,0.00050412165,0.0003790021],"domain_scores_gemma":[0.99859446,0.00019101294,0.0001485369,0.0005768999,0.00041234406,0.00007665942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010377162,0.0010637703,0.0011131909,0.0011579522,0.0019067663,0.0021802408,0.0017832326,0.0010011289,0.0040646093],"category_scores_gemma":[0.002082935,0.00032623633,0.00072143116,0.0013989913,0.00063374545,0.004823574,0.0034871653,0.0015229565,0.002225908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003429252,0.0004868182,0.0038785222,0.0008816753,0.0002969099,0.0016181346,0.00064190605,0.0711884,0.097966656,0.28273064,0.0389764,0.49790466],"study_design_scores_gemma":[0.000086793465,0.00043136324,0.0010484112,0.00009712196,0.00016287282,0.0015765796,0.00032334108,0.84123445,0.06969101,0.035298035,0.04991248,0.00013756425],"about_ca_topic_score_codex":0.001984519,"about_ca_topic_score_gemma":0.0013031772,"teacher_disagreement_score":0.0040646093,"about_ca_system_score_codex":0.001398274,"about_ca_system_score_gemma":0.00167183,"threshold_uncertainty_score":0.013597488},"labels":[],"label_agreement":null},{"id":"W3190854914","doi":"10.1109/jiot.2021.3066307","title":"Efficient and Privacy-Preserving Decision Tree Classification for Health Monitoring Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"China Scholarship Council; Natural Science Foundation of Hunan Province; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Decision tree; Decision tree learning; Data mining; Information privacy; Leverage (statistics); Theoretical computer science; Computer security; Machine learning","score_opus":0.03977284672047998,"score_gpt":0.314853644560147,"score_spread":0.275080797839667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190854914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042514484,0.00042224603,0.95456886,0.0006251638,0.00005219174,0.00014038787,0.00021131911,0.00056703517,0.00089836965],"genre_scores_gemma":[0.8515213,0.0003309641,0.14621891,0.00021334583,0.0000678697,0.00014684985,0.00048318712,0.000033424752,0.0009841796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554586,0.001419977,0.0004481462,0.0005915688,0.0015218265,0.0004726353],"domain_scores_gemma":[0.99387604,0.003464531,0.0006617835,0.0010585894,0.00076083036,0.00017814395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033471596,0.0005136976,0.000915873,0.0007270569,0.0008850941,0.0013449173,0.0013450134,0.00093956117,0.0012791089],"category_scores_gemma":[0.009963127,0.00028392344,0.00091934693,0.0013165866,0.00076340616,0.0031905763,0.0015657247,0.0015725289,0.00042986343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015330641,0.00042726746,0.0068553756,0.00030797554,0.00014751217,0.00043789062,0.0003754833,0.4324026,0.018223042,0.07254956,0.006767171,0.45997307],"study_design_scores_gemma":[0.000024162087,0.00008552041,0.0003313232,0.000008970214,0.000014363372,0.00012023529,0.000021797756,0.9740389,0.003731197,0.020782907,0.00083014386,0.000010481263],"about_ca_topic_score_codex":0.0014336872,"about_ca_topic_score_gemma":0.0009923966,"teacher_disagreement_score":0.0033471596,"about_ca_system_score_codex":0.0014795123,"about_ca_system_score_gemma":0.0019435347,"threshold_uncertainty_score":0.017701685},"labels":[],"label_agreement":null},{"id":"W3191008542","doi":"10.1109/tdsc.2021.3101120","title":"Towards Practical and Privacy-Preserving Multi-Dimensional Range Query Over Cloud","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Intersection (aeronautics); Predicate (mathematical logic); Point cloud; Data mining; Theoretical computer science; Range query (database); Big data; Information privacy; Server; Computer security; Algorithm; Information retrieval; Computer network; Artificial intelligence; Search engine","score_opus":0.027779216036727967,"score_gpt":0.2862058883541309,"score_spread":0.25842667231740296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191008542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020769553,0.0013770037,0.972179,0.0010723093,0.00012320119,0.00028677494,0.00033901774,0.00073150464,0.0031216382],"genre_scores_gemma":[0.69498444,0.001966881,0.29727054,0.0010377268,0.0003139851,0.00043126268,0.0009297838,0.00009303146,0.002972353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99222213,0.0016963151,0.00071469176,0.0010833682,0.0031789565,0.0011045773],"domain_scores_gemma":[0.9937093,0.0018052462,0.0005098658,0.0025511023,0.0012076001,0.00021683995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033942827,0.00070287404,0.0017583175,0.0009317305,0.0017069596,0.0030236708,0.0027608974,0.0017329314,0.0016706159],"category_scores_gemma":[0.0075750183,0.00043852607,0.0013425255,0.0028840387,0.0012671666,0.008934601,0.0069675557,0.002846949,0.00078400044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020109247,0.0006595308,0.0052146497,0.00096839224,0.00029914684,0.0019408605,0.001769057,0.15141894,0.08240777,0.35033762,0.030409083,0.37256408],"study_design_scores_gemma":[0.00015240494,0.00030526938,0.0007006212,0.00005410358,0.00006865519,0.0019647938,0.00069689314,0.8751464,0.02381474,0.08052998,0.016470186,0.000095870935],"about_ca_topic_score_codex":0.0016716174,"about_ca_topic_score_gemma":0.0010059999,"teacher_disagreement_score":0.0033942827,"about_ca_system_score_codex":0.0011039444,"about_ca_system_score_gemma":0.0021858946,"threshold_uncertainty_score":0.017950833},"labels":[],"label_agreement":null},{"id":"W3192747111","doi":"10.1109/icc42927.2021.9500639","title":"On Secure and Efficient Data Sharing for Smart Grids: An Anti-Collusion Scheme","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Research and Development; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Collusion; Computer science; Smart grid; Computer security; Paillier cryptosystem; Secret sharing; Encryption; Security analysis; Cryptography; Scheme (mathematics); Cloud computing; Energy consumption; Computer network; Data sharing; Public-key cryptography; Hybrid cryptosystem; Business","score_opus":0.051636132111431046,"score_gpt":0.3008038624532432,"score_spread":0.24916773034181217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192747111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082457334,0.001039277,0.907977,0.0011529827,0.00014530282,0.00038925643,0.00012838542,0.0003332015,0.006377294],"genre_scores_gemma":[0.90015334,0.000669093,0.09510172,0.00025968417,0.00009866676,0.00023442954,0.00013305862,0.00003509868,0.0033150618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953069,0.0016184098,0.0003325282,0.0006544718,0.0014412553,0.00064639933],"domain_scores_gemma":[0.99641705,0.0011594801,0.00058850687,0.0011562458,0.00047934585,0.00019919833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002406535,0.00081616157,0.0014656892,0.0011463227,0.0022325178,0.0017012189,0.0018061936,0.0013477011,0.0013589853],"category_scores_gemma":[0.004261044,0.00041337206,0.0011503049,0.0023911882,0.0024341424,0.0046532587,0.0046997415,0.0020171278,0.00043262655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001709297,0.00034100856,0.002136937,0.00041447635,0.00031109244,0.0014638285,0.0023565902,0.14016922,0.07709749,0.6327474,0.006858726,0.1343939],"study_design_scores_gemma":[0.0002731234,0.00053052953,0.00061997597,0.000061606246,0.000116644274,0.0018077835,0.00021791625,0.8251599,0.020769436,0.13814639,0.012094394,0.00020228034],"about_ca_topic_score_codex":0.001258157,"about_ca_topic_score_gemma":0.0008613946,"teacher_disagreement_score":0.002406535,"about_ca_system_score_codex":0.0017678451,"about_ca_system_score_gemma":0.0023423622,"threshold_uncertainty_score":0.012826681},"labels":[],"label_agreement":null},{"id":"W3193291579","doi":"","title":"Improved OT Extension for Transferring Short Secrets.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Sublinear function; Extension (predicate logic); Generalization; Computation; Factor (programming language); Security parameter; Computer science; Block (permutation group theory); Provable security; Work (physics); Protocol (science); Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Cryptography; Combinatorics; Physics; Mathematical analysis","score_opus":0.028033694392838458,"score_gpt":0.275520161173267,"score_spread":0.24748646678042854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193291579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035205107,0.00057056267,0.9329419,0.00061249465,0.00048923434,0.000695576,0.00041104518,0.0027845895,0.026289377],"genre_scores_gemma":[0.67838657,0.0007571362,0.293013,0.00070665224,0.00039042873,0.0010134235,0.0010068847,0.00062811346,0.024097817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958254,0.0006286413,0.0003430082,0.00059409393,0.0018489467,0.0007600034],"domain_scores_gemma":[0.9938811,0.0012149032,0.00041760388,0.0035350206,0.00065194693,0.0002993825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021590148,0.0010266267,0.0013217058,0.0010535497,0.0016810354,0.0018695624,0.0026490754,0.0015192623,0.009228552],"category_scores_gemma":[0.007516391,0.0006285393,0.0017481544,0.0014863642,0.002490156,0.008997011,0.011113593,0.004526173,0.0035157392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015388874,0.00046206376,0.0019821366,0.0009276648,0.000118608674,0.0011177231,0.0015879914,0.03080478,0.064363234,0.6311648,0.012821363,0.25311077],"study_design_scores_gemma":[0.00038507525,0.0013799402,0.0017018412,0.00033550893,0.00035631712,0.003365018,0.0005715729,0.26084873,0.09884682,0.5025024,0.1293575,0.00034940703],"about_ca_topic_score_codex":0.0008445804,"about_ca_topic_score_gemma":0.00062453037,"teacher_disagreement_score":0.009228552,"about_ca_system_score_codex":0.0015121066,"about_ca_system_score_gemma":0.0022655257,"threshold_uncertainty_score":0.030872583},"labels":[],"label_agreement":null},{"id":"W3193336782","doi":"","title":"Functional Encryption: New Perspectives and Lower Bounds.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Functional encryption; Encryption; Computer science; Theoretical computer science; Computation; Exploit; Key (lock); Upper and lower bounds; Computer security; Algorithm; Mathematics; Ciphertext","score_opus":0.02247108557450471,"score_gpt":0.2501553859783875,"score_spread":0.22768430040388277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193336782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013060539,0.014175331,0.9056695,0.011337224,0.0007337003,0.00007019914,0.00018012484,0.00022853758,0.054544847],"genre_scores_gemma":[0.7068206,0.01806703,0.24721679,0.005522154,0.003472294,0.0007503424,0.00059770956,0.0006952629,0.01685784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98571026,0.004701349,0.00079669215,0.0022250286,0.005311311,0.0012554165],"domain_scores_gemma":[0.954504,0.034787927,0.0016775884,0.0058395774,0.0021583403,0.0010326009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012127474,0.0024962386,0.0018528961,0.0031539793,0.002611794,0.00801531,0.0035986926,0.0047248206,0.007197801],"category_scores_gemma":[0.03778247,0.001111253,0.0030542284,0.0026837396,0.012184562,0.033777457,0.009087459,0.021608094,0.0020984893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022840597,0.000017941336,0.0000934287,0.000082042665,0.000009436441,0.000023900746,0.00008042575,0.0020071685,0.00033107624,0.9928283,0.0006742233,0.0038291248],"study_design_scores_gemma":[0.000007981304,0.00003448711,0.00006068814,0.00007998987,0.000014280482,0.00007230088,0.0000361557,0.01619561,0.00096860976,0.97590804,0.0066052694,0.000016629518],"about_ca_topic_score_codex":0.00066955975,"about_ca_topic_score_gemma":0.00041226778,"teacher_disagreement_score":0.012127474,"about_ca_system_score_codex":0.005487445,"about_ca_system_score_gemma":0.001803879,"threshold_uncertainty_score":0.06413698},"labels":[],"label_agreement":null},{"id":"W3193480646","doi":"","title":"Amortizing Garbled Circuits","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Overhead (engineering); Computation; Security parameter; Secure multi-party computation; Oblivious transfer; Cryptography; Electronic circuit; Arithmetic; Computer security; Computer engineering; Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.017623788529937717,"score_gpt":0.25708928340711223,"score_spread":0.23946549487717453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193480646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060229108,0.00056958577,0.92596424,0.0012716657,0.00018767455,0.00020595001,0.00018676076,0.0012362847,0.010148808],"genre_scores_gemma":[0.799851,0.00041579118,0.19114089,0.00042412785,0.00015379055,0.00033175762,0.00022714252,0.00028883314,0.0071666962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362904,0.0022783587,0.00038317541,0.0011047429,0.0017523762,0.0008522508],"domain_scores_gemma":[0.98584855,0.008028891,0.000859716,0.0042201905,0.0006255886,0.00041711354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039692526,0.001544841,0.0015582577,0.001218242,0.0010130826,0.0036388899,0.00247034,0.0016057113,0.0071260086],"category_scores_gemma":[0.012692652,0.00062122283,0.0019112462,0.0014090657,0.0040485235,0.009206399,0.004765463,0.0040043993,0.0012015884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013223345,0.00018859428,0.0010985599,0.00041845496,0.00016502058,0.0003606881,0.000247203,0.21010591,0.01773089,0.7192091,0.0024749183,0.04667835],"study_design_scores_gemma":[0.00009326411,0.00017620462,0.00013713619,0.00006441466,0.00007444626,0.00020718879,0.000038088794,0.39741096,0.01642972,0.5817427,0.0035872608,0.000038540413],"about_ca_topic_score_codex":0.00030671293,"about_ca_topic_score_gemma":0.00039279799,"teacher_disagreement_score":0.0071260086,"about_ca_system_score_codex":0.002224612,"about_ca_system_score_gemma":0.0013307458,"threshold_uncertainty_score":0.023838878},"labels":[],"label_agreement":null},{"id":"W3193505954","doi":"","title":"On Protecting Cryptographic Keys Against Continual Leakage.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Adversary; Cryptography; Information leakage; Homomorphic encryption; Computer security; Computation; Side channel attack; Encryption; Security token; Theoretical computer science; Algorithm","score_opus":0.011982207259601349,"score_gpt":0.2512281170499217,"score_spread":0.23924590979032034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193505954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021220062,0.00529092,0.9433323,0.0028275254,0.00045042287,0.0002895996,0.00019914332,0.0010927957,0.025297303],"genre_scores_gemma":[0.59775096,0.013447241,0.3570695,0.0026257932,0.0014302423,0.00085119193,0.00070714235,0.0006369979,0.025480984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952484,0.0010618997,0.0002994803,0.00076134707,0.0019892934,0.0006396634],"domain_scores_gemma":[0.98970836,0.002857455,0.00074176316,0.0059631397,0.0005517057,0.00017756331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033181736,0.0023283416,0.0016156058,0.001868455,0.0021412412,0.0028586169,0.0024550043,0.0030481827,0.006232567],"category_scores_gemma":[0.008929131,0.0010399366,0.0016600279,0.0026399926,0.009925744,0.017749986,0.010817658,0.0074660764,0.0035769036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018605223,0.00008330036,0.00054885854,0.0007489593,0.00011919011,0.00027380293,0.00039136127,0.016845334,0.013197006,0.88143814,0.00432413,0.081843846],"study_design_scores_gemma":[0.000081755046,0.00048672015,0.0006557226,0.00035400406,0.00017479341,0.0018364334,0.00019862413,0.059300207,0.035420462,0.85399497,0.047374584,0.00012170447],"about_ca_topic_score_codex":0.00034684894,"about_ca_topic_score_gemma":0.00027335368,"teacher_disagreement_score":0.006232567,"about_ca_system_score_codex":0.0019656154,"about_ca_system_score_gemma":0.0015824904,"threshold_uncertainty_score":0.020850003},"labels":[],"label_agreement":null},{"id":"W3193856494","doi":"10.48550/arxiv.1412.8766","title":"Quantum homomorphic encryption for circuits of low $T$-gate complexity","year":2014,"lang":"en","type":"preprint","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Probabilistic encryption; Theoretical computer science; Ciphertext; Encryption; Plaintext; Homomorphic encryption; Multiple encryption; Quantum computer; Computer science; Homomorphic secret sharing; Attribute-based encryption; Ciphertext indistinguishability; Mathematics; Cryptography; Deterministic encryption; Quantum; Algorithm; Public-key cryptography; Secure multi-party computation; Computer network; Quantum mechanics; Physics","score_opus":0.03786632930087028,"score_gpt":0.272549198165,"score_spread":0.23468286886412973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193856494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063873,0.0005224066,0.9152794,0.0013395332,0.00009175112,0.00023065944,0.00017920775,0.00039149667,0.018092617],"genre_scores_gemma":[0.7452275,0.00077428966,0.2444773,0.00070606894,0.000168994,0.0005420776,0.00023966699,0.00014370169,0.0077203675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998175,0.00039635703,0.00013079745,0.00030391398,0.0006709547,0.0003229457],"domain_scores_gemma":[0.9966815,0.0017371717,0.00036382308,0.00087444496,0.00023431408,0.00010875582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013960985,0.0005212014,0.0007417349,0.00068433996,0.00085632806,0.002755457,0.0012245517,0.0013347797,0.003519254],"category_scores_gemma":[0.0049311602,0.00043000068,0.0013249688,0.0009102881,0.003007334,0.0073734717,0.0024645997,0.0041633667,0.0005123656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046488512,0.000030226514,0.00007597872,0.000057206064,0.0000076599135,0.000044552933,0.00010526131,0.0073844423,0.003368497,0.9806552,0.00055459264,0.007669793],"study_design_scores_gemma":[0.000094772106,0.00011768568,0.00025526853,0.000045148074,0.00002498269,0.00018667137,0.00004420087,0.14309749,0.013807281,0.8344697,0.007813742,0.00004305447],"about_ca_topic_score_codex":0.0005705199,"about_ca_topic_score_gemma":0.000571597,"teacher_disagreement_score":0.003519254,"about_ca_system_score_codex":0.0029981039,"about_ca_system_score_gemma":0.0018519934,"threshold_uncertainty_score":0.021752834},"labels":[],"label_agreement":null},{"id":"W3193950766","doi":"","title":"FleXOR: Flexible garbling for XOR gates that beats free-XOR.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Bell (Canada)","funders":"","keywords":"XOR gate; Computer science; Bitwise operation; Cryptography; Exclusive or; Key (lock); Hash function; Government (linguistics); Theoretical computer science; Algorithm; Logic gate; Computer security; Programming language","score_opus":0.03717708644604003,"score_gpt":0.2869611467285073,"score_spread":0.24978406028246727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193950766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02168133,0.0011354975,0.94827443,0.000537238,0.00036970622,0.00029600033,0.00033572497,0.007460601,0.019909445],"genre_scores_gemma":[0.5985901,0.0009930981,0.36851925,0.0008859872,0.00022404808,0.00052150403,0.00083610235,0.0016573743,0.027772592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978623,0.0005445999,0.00016747866,0.0004159954,0.0006874868,0.00032218877],"domain_scores_gemma":[0.99789715,0.0006603031,0.00019688856,0.0009898985,0.00016489925,0.00009093558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002113878,0.0012864892,0.001039467,0.0009934055,0.0009617561,0.0024669524,0.0022827184,0.0013010585,0.015754344],"category_scores_gemma":[0.0053569023,0.0007215511,0.0013755228,0.00085549336,0.0020266185,0.0074353726,0.0036324193,0.0027278077,0.003751197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024601682,0.00020437462,0.00077397714,0.00069084036,0.00016671901,0.00047142836,0.00031007917,0.03091548,0.051750835,0.6274058,0.013750549,0.27109972],"study_design_scores_gemma":[0.00032996142,0.0008884988,0.00034657473,0.00028065528,0.00021203274,0.0011214718,0.00010774624,0.21462415,0.16876002,0.5374266,0.0757332,0.00016909011],"about_ca_topic_score_codex":0.00030661555,"about_ca_topic_score_gemma":0.00059242925,"teacher_disagreement_score":0.015754344,"about_ca_system_score_codex":0.0008999479,"about_ca_system_score_gemma":0.0011026091,"threshold_uncertainty_score":0.0527035},"labels":[],"label_agreement":null},{"id":"W3194688402","doi":"","title":"Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima.","year":2009,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Subtraction; Computation; Maxima and minima; Multiplication (music); Integer (computer science); Adder; Function (biology); Selection (genetic algorithm); Common value auction; Secure multi-party computation; Theoretical computer science; Algorithm; Arithmetic; Mathematics; Artificial intelligence; Programming language; Latency (audio)","score_opus":0.016989484626085495,"score_gpt":0.2754775934787398,"score_spread":0.2584881088526543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194688402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021223946,0.000605151,0.96709096,0.00054523535,0.0001007247,0.0001736184,0.000090177935,0.00047244588,0.009697645],"genre_scores_gemma":[0.5414239,0.00076670805,0.4481484,0.00040840506,0.0001213452,0.00037487832,0.00020363032,0.00020594322,0.008346666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776244,0.0009255154,0.00014090711,0.00024294379,0.0007256885,0.00020241938],"domain_scores_gemma":[0.9973826,0.0012982814,0.0001835629,0.0008536561,0.00019323647,0.00008863748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028987236,0.0008546969,0.001100235,0.0011366421,0.0007663074,0.0023173552,0.0020456675,0.0014358794,0.0067241425],"category_scores_gemma":[0.0066229617,0.0005999057,0.001338419,0.0013346837,0.0021470534,0.006172451,0.0027859015,0.0032667476,0.0010499031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002088042,0.000073044626,0.00018725194,0.00016601947,0.00004138104,0.00012033677,0.00013205461,0.046902508,0.00907477,0.91029936,0.0011278965,0.03166652],"study_design_scores_gemma":[0.00011238331,0.00022638535,0.00013172967,0.00010001433,0.000056111894,0.00027690057,0.000045252767,0.27361405,0.027599048,0.68579555,0.011993266,0.000049269995],"about_ca_topic_score_codex":0.00019237676,"about_ca_topic_score_gemma":0.0003083213,"teacher_disagreement_score":0.0067241425,"about_ca_system_score_codex":0.0013388398,"about_ca_system_score_gemma":0.0007427563,"threshold_uncertainty_score":0.022494495},"labels":[],"label_agreement":null},{"id":"W3195052898","doi":"","title":"Reproducible Circularly-Secure Bit Encryption: Applications and Realizations.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Encryption; Probabilistic encryption; 40-bit encryption; 56-bit encryption; Computer science; Deterministic encryption; Multiple encryption; Theoretical computer science; Plaintext-aware encryption; Semantic security; Cryptographic primitive; Attribute-based encryption; Mathematics; Cryptography; Public-key cryptography; Algorithm; Computer security; Cryptographic protocol","score_opus":0.025590842349408234,"score_gpt":0.2749388412211416,"score_spread":0.24934799887173337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195052898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07262171,0.0005448446,0.90198964,0.0009472383,0.00015468283,0.00018880932,0.00029129852,0.0004902514,0.02277161],"genre_scores_gemma":[0.8680899,0.0005534423,0.1237622,0.00027869994,0.0001172162,0.00030759172,0.00034438257,0.00013502366,0.006411587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725634,0.000702699,0.00022098946,0.00035825343,0.0011160556,0.000345714],"domain_scores_gemma":[0.9961265,0.0012383031,0.00047506392,0.001562461,0.00038477647,0.00021294593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002394806,0.0006124236,0.0007593177,0.00084411376,0.0015222069,0.0024419355,0.0012134885,0.0016573786,0.0037823946],"category_scores_gemma":[0.0052393065,0.0005690237,0.001652982,0.0011168438,0.0035923868,0.0037042322,0.0040914104,0.0035988993,0.0009114953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050987957,0.000021251739,0.0001287695,0.000039609873,0.000008789239,0.0000931288,0.0001318755,0.0031595894,0.002392899,0.9905517,0.00031162178,0.003109789],"study_design_scores_gemma":[0.000084177205,0.00009909687,0.00018616831,0.000038481216,0.000032314903,0.00037329033,0.000059939575,0.059228648,0.016442187,0.9154587,0.007951355,0.000045505574],"about_ca_topic_score_codex":0.0002812398,"about_ca_topic_score_gemma":0.00021640184,"teacher_disagreement_score":0.0037823946,"about_ca_system_score_codex":0.0021525484,"about_ca_system_score_gemma":0.0010662179,"threshold_uncertainty_score":0.015617907},"labels":[],"label_agreement":null},{"id":"W3196154141","doi":"","title":"Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Correctness; Random oracle; Oracle; Secure multi-party computation; Protocol (science); Covert; Computer security; Gas meter prover; Oblivious transfer; Theoretical computer science; Security parameter; Key (lock); Standard Model (mathematical formulation); Cryptography; Mathematical proof; Public-key cryptography; Algorithm; Encryption; Mathematics; Programming language","score_opus":0.01821909496241206,"score_gpt":0.2712479273512521,"score_spread":0.25302883238884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196154141","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070048203,0.0005009302,0.9845525,0.0008602512,0.0002028574,0.00021626145,0.00008940383,0.0006730388,0.005899868],"genre_scores_gemma":[0.39142877,0.0009082787,0.59589875,0.0012129794,0.00038512817,0.0008257114,0.00039395905,0.00047114855,0.008475229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914294,0.0033942384,0.0004933278,0.0012148478,0.0028487775,0.000619435],"domain_scores_gemma":[0.98937476,0.004980941,0.0006311562,0.0042318595,0.0005578285,0.00022340126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075970064,0.0015721815,0.0014810235,0.001759988,0.0010784643,0.004801602,0.003096211,0.003012833,0.0058421623],"category_scores_gemma":[0.017267326,0.0010371251,0.0023536885,0.0020526717,0.0060835825,0.014942854,0.007536666,0.00801191,0.001410288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015286723,0.000058001995,0.0001536568,0.0001711857,0.000044663746,0.00009247979,0.00018704355,0.012246126,0.004914873,0.9615902,0.0012157167,0.019173091],"study_design_scores_gemma":[0.0001719439,0.0001531338,0.00008778795,0.000115798786,0.00006177102,0.00023863104,0.00004678489,0.107498065,0.016200617,0.86035335,0.01501101,0.00006106184],"about_ca_topic_score_codex":0.00034807823,"about_ca_topic_score_gemma":0.00037112247,"teacher_disagreement_score":0.0075970064,"about_ca_system_score_codex":0.0020051608,"about_ca_system_score_gemma":0.0022749905,"threshold_uncertainty_score":0.040177226},"labels":[],"label_agreement":null},{"id":"W3196527158","doi":"10.1109/jiot.2021.3110300","title":"Privacy-Preserving Keyword Similarity Search Over Encrypted Spatial Data in Cloud Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Range query (database); Web search query; Access control; Nearest neighbor search; Outsourcing; Information retrieval; Database; Data mining; Search engine; Computer security; Web query classification","score_opus":0.044335387308895205,"score_gpt":0.30887360378259987,"score_spread":0.2645382164737047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196527158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1297116,0.0013615604,0.86277944,0.00049916335,0.000072623305,0.00016523889,0.0002505106,0.0007315643,0.004428236],"genre_scores_gemma":[0.9533355,0.00046792038,0.044585507,0.00010250147,0.000041349576,0.00006153811,0.000116739706,0.000026998288,0.0012619703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617934,0.0007747408,0.00034187012,0.00058475323,0.001568893,0.0005504313],"domain_scores_gemma":[0.9972139,0.0008732024,0.00039119084,0.00094356143,0.00044815557,0.00012992456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013125045,0.00038987823,0.0010684619,0.0006635923,0.0009498807,0.001542003,0.0013693841,0.0007512108,0.0009875275],"category_scores_gemma":[0.0046480563,0.00027817997,0.0007144769,0.0020043184,0.001158031,0.0045541395,0.002216031,0.0007616883,0.0004176025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024500352,0.00043425322,0.004425099,0.0007401129,0.00017682057,0.0018253638,0.0012491598,0.33894363,0.093589656,0.29730403,0.0066051153,0.25225675],"study_design_scores_gemma":[0.0000860071,0.0002609462,0.00058538624,0.0000233641,0.00004908634,0.0010579798,0.0002377336,0.9109782,0.025036171,0.057491843,0.004132897,0.00006032382],"about_ca_topic_score_codex":0.0027910583,"about_ca_topic_score_gemma":0.0014185795,"teacher_disagreement_score":0.0027910583,"about_ca_system_score_codex":0.0011155317,"about_ca_system_score_gemma":0.0018398068,"threshold_uncertainty_score":0.008093774},"labels":[],"label_agreement":null},{"id":"W3197184949","doi":"","title":"Sign rank vs Discrepancy.","year":2019,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Sign (mathematics); Mathematics; Rank (graph theory); Combinatorics; Matrix (chemical analysis); Discrete mathematics; Communication complexity","score_opus":0.008636706996466733,"score_gpt":0.2001555040813435,"score_spread":0.19151879708487676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197184949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17481318,0.0058617503,0.700585,0.021475825,0.00087178935,0.00014251492,0.0010507666,0.0009953536,0.09420377],"genre_scores_gemma":[0.92196536,0.0017475706,0.061599843,0.0018110017,0.0008481901,0.00017559211,0.00046212153,0.00026811825,0.011122285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99465865,0.0017127949,0.00022699579,0.001005409,0.0018581036,0.00053805404],"domain_scores_gemma":[0.9719207,0.017707799,0.0021851691,0.005502832,0.0016650618,0.0010184693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032544336,0.00076178956,0.00087949727,0.001012986,0.001409804,0.0031314162,0.0013285651,0.002103478,0.007049973],"category_scores_gemma":[0.029559242,0.00046320856,0.00062673126,0.0013247164,0.006931837,0.012693865,0.0043033212,0.006063735,0.0016125845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025269564,0.000043670618,0.0010334351,0.00011459179,0.000010841724,0.000068742855,0.00017595096,0.0056869546,0.002498541,0.96678,0.0028573666,0.020477213],"study_design_scores_gemma":[0.00003608173,0.00015529477,0.00061320426,0.000042310407,0.000014361548,0.0003648079,0.00010303047,0.030373339,0.0041268826,0.9553713,0.00876814,0.000031288193],"about_ca_topic_score_codex":0.00046328097,"about_ca_topic_score_gemma":0.00035631342,"teacher_disagreement_score":0.007049973,"about_ca_system_score_codex":0.0016881797,"about_ca_system_score_gemma":0.0011448332,"threshold_uncertainty_score":0.023584545},"labels":[],"label_agreement":null},{"id":"W3197558738","doi":"","title":"Compact Ring Signatures from Learning With Errors.","year":2021,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ring signature; Ring (chemistry); Computer science; Anonymity; Signature (topology); Sign (mathematics); Identity (music); Cryptography; Function (biology); Computer security; Digital signature; Theoretical computer science; Mathematics; Physics; Geometry","score_opus":0.013334096394039428,"score_gpt":0.2460657678444619,"score_spread":0.23273167145042248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197558738","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03844825,0.0016857645,0.9357169,0.001843803,0.00042052998,0.0001378461,0.0007956839,0.0013522601,0.019598905],"genre_scores_gemma":[0.7869935,0.002200454,0.17556831,0.00070412346,0.0009058704,0.00024283421,0.001901583,0.0004758092,0.031007465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938974,0.0015451032,0.00042272545,0.001023545,0.0025581003,0.0005531528],"domain_scores_gemma":[0.9707238,0.013213385,0.003958102,0.009119487,0.0020407736,0.0009444567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003597106,0.0010700964,0.0015297077,0.0016317539,0.0011418,0.0036969148,0.001986821,0.0025533948,0.008184921],"category_scores_gemma":[0.04005442,0.000670394,0.0009330142,0.001964638,0.004049431,0.011595067,0.007759725,0.004132023,0.002890977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041603774,0.000050914077,0.0006581892,0.0002157612,0.0000500306,0.00018647217,0.00028029355,0.0405459,0.0022373202,0.8671589,0.00511028,0.08308986],"study_design_scores_gemma":[0.00004158631,0.000089091875,0.00016766685,0.000062853665,0.000019358215,0.00026443435,0.000053042902,0.077392645,0.0040055173,0.9088833,0.008991381,0.000029163122],"about_ca_topic_score_codex":0.00039765125,"about_ca_topic_score_gemma":0.00037667286,"teacher_disagreement_score":0.008184921,"about_ca_system_score_codex":0.0013599045,"about_ca_system_score_gemma":0.0016213112,"threshold_uncertainty_score":0.027381241},"labels":[],"label_agreement":null},{"id":"W3197610636","doi":"10.1007/978-3-030-88238-9_4","title":"Post-quantum Key-Blinding for Authentication in Anonymity Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blinding; Computer science; Anonymity; Authentication (law); Key (lock); Computer security; Internet privacy; Medicine","score_opus":0.017605154456151496,"score_gpt":0.25560346677721996,"score_spread":0.23799831232106847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197610636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01194975,0.0020230599,0.9431573,0.00092688925,0.00067807327,0.00011675638,0.000112744485,0.00074475474,0.040290575],"genre_scores_gemma":[0.6484734,0.0033664673,0.25066307,0.0006764013,0.0007349625,0.00030478128,0.00020404368,0.0004910552,0.0950859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988102,0.00037330404,0.000053300046,0.00019167342,0.00041308597,0.00015844086],"domain_scores_gemma":[0.9988726,0.0004916322,0.00006337229,0.000409791,0.00012527424,0.00003741947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010167239,0.00058949355,0.0007665765,0.0005446089,0.0014323026,0.0023006857,0.0013090695,0.0017742654,0.01204405],"category_scores_gemma":[0.002455747,0.0003748228,0.00067059207,0.0008918471,0.0028428289,0.005079097,0.0023625595,0.0027300646,0.0040969243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014908177,0.000045094483,0.00006792078,0.00015949798,0.000013841951,0.00007171142,0.00014123005,0.0063663507,0.008515788,0.9226038,0.0058919364,0.05597374],"study_design_scores_gemma":[0.00002357146,0.000085763786,0.00012985017,0.000053159292,0.000021613067,0.0003014064,0.00005853855,0.09081962,0.013159693,0.86537826,0.02991656,0.000051991436],"about_ca_topic_score_codex":0.00023806003,"about_ca_topic_score_gemma":0.0002965596,"teacher_disagreement_score":0.01204405,"about_ca_system_score_codex":0.0012490752,"about_ca_system_score_gemma":0.00088827754,"threshold_uncertainty_score":0.04029131},"labels":[],"label_agreement":null},{"id":"W319908677","doi":"10.1007/978-3-642-55220-5_22","title":"Non-Interactive Secure Computation Based on Cut-and-Choose","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Oblivious transfer; Protocol (science); Encryption; Homomorphic encryption; Random oracle; Cheating; Secure multi-party computation; Computation; Key (lock); Secure two-party computation; Computer security; Public-key cryptography; Theoretical computer science; Cryptography; Algorithm","score_opus":0.009336624494466228,"score_gpt":0.24490798204613615,"score_spread":0.2355713575516699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W319908677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02968404,0.00043009137,0.9371199,0.0007158933,0.00021283464,0.00023988732,0.00024853056,0.0017874074,0.0295613],"genre_scores_gemma":[0.6646907,0.00048077476,0.304074,0.0003724354,0.00019885442,0.0005321266,0.00055552466,0.0005794408,0.028516183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724007,0.0005908927,0.00014648176,0.00055540603,0.0010317201,0.00043540035],"domain_scores_gemma":[0.99719894,0.0011674211,0.000105084575,0.001133516,0.00024056624,0.00015440024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011938204,0.00088604423,0.0019444793,0.0011271514,0.0021069953,0.003060628,0.0021666226,0.0011411394,0.009554786],"category_scores_gemma":[0.0038319991,0.0005945624,0.0018821079,0.0015506491,0.0031582308,0.0054493523,0.0056336513,0.0036390265,0.002507689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059319433,0.00012811794,0.00035176857,0.0001421977,0.000070012495,0.00012694526,0.00027951048,0.01519662,0.0057561276,0.90147066,0.0074574235,0.06842746],"study_design_scores_gemma":[0.000097789234,0.00008219168,0.00015261001,0.000028581962,0.000051379524,0.00017137635,0.000042228836,0.17151886,0.006462543,0.81495476,0.0063939593,0.000043786637],"about_ca_topic_score_codex":0.00096793997,"about_ca_topic_score_gemma":0.0015417162,"teacher_disagreement_score":0.009554786,"about_ca_system_score_codex":0.0019452687,"about_ca_system_score_gemma":0.0023548051,"threshold_uncertainty_score":0.031963885},"labels":[],"label_agreement":null},{"id":"W3199117713","doi":"10.1109/compsac51774.2021.00167","title":"Addressing Audit and Accountability Issues in Self-Sovereign Identity Blockchain Systems Using Archival Science Principles","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Blockchain; Accountability; Audit; Identity (music); Sovereignty; Computer science; Accounting; Computer security; Political science; Business; Law; Philosophy","score_opus":0.07018406105241047,"score_gpt":0.33264741902249717,"score_spread":0.2624633579700867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199117713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034281645,0.00034487943,0.9529346,0.0033597208,0.00017210153,0.00030423663,0.00006101444,0.00041843692,0.008123425],"genre_scores_gemma":[0.74569315,0.000678878,0.24375077,0.0004718661,0.00021503595,0.0004691167,0.00014106464,0.00014521641,0.008434907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.979661,0.009513953,0.0018120115,0.0021093409,0.0054227584,0.0014808407],"domain_scores_gemma":[0.93552434,0.02663289,0.00639031,0.02263006,0.007091557,0.0017309601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028453743,0.0005086028,0.0012238327,0.002203934,0.003963672,0.011443255,0.0030842505,0.0036898612,0.0029758743],"category_scores_gemma":[0.055547774,0.0009463468,0.0012922081,0.0024028507,0.009102087,0.02152469,0.012286184,0.005406241,0.00076905545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093960974,0.00009167064,0.0010437351,0.00011962699,0.000027796912,0.00021927131,0.0010098342,0.014782884,0.0017956571,0.952986,0.0009872706,0.026842263],"study_design_scores_gemma":[0.00010297045,0.00013142845,0.00024108765,0.00014393311,0.000052435258,0.00026102245,0.0004173683,0.16436084,0.0084634125,0.80606306,0.019692978,0.00006953058],"about_ca_topic_score_codex":0.0018173747,"about_ca_topic_score_gemma":0.0015915843,"teacher_disagreement_score":0.028453743,"about_ca_system_score_codex":0.002655209,"about_ca_system_score_gemma":0.009203959,"threshold_uncertainty_score":0.15047956},"labels":[],"label_agreement":null},{"id":"W3199128408","doi":"10.1007/978-3-662-63958-0_29","title":"Publicly Verifiable and Secrecy Preserving Periodic Auctions","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Transparency (behavior); Computer science; Verifiable secret sharing; Exploit; Common value auction; Price discovery; Order (exchange); Secrecy; Protocol (science); Smart contract; Computer security; Forward secrecy; Market liquidity; Public-key cryptography; Business; Finance; Microeconomics; Futures contract; Economics; Blockchain","score_opus":0.016030168853823256,"score_gpt":0.23158182680885647,"score_spread":0.21555165795503323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199128408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12872772,0.0015922453,0.66768384,0.0037129163,0.000631448,0.0002770711,0.00073807494,0.0018047735,0.19483197],"genre_scores_gemma":[0.8754969,0.0009604092,0.05181355,0.0002636143,0.00038320187,0.00020433162,0.000444495,0.00029585915,0.07013746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964799,0.0008877644,0.00018083779,0.0004503008,0.0014377079,0.00056357327],"domain_scores_gemma":[0.9882256,0.0056718714,0.0008825657,0.004160422,0.0007292852,0.0003302294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029376782,0.0009510262,0.0014410644,0.0006894315,0.00136825,0.0067919483,0.0030212468,0.0026084858,0.009076314],"category_scores_gemma":[0.014053284,0.0010422568,0.0010013975,0.0016979486,0.0029057483,0.009925897,0.0025550008,0.005618837,0.0027285756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046004835,0.00013645552,0.00017390224,0.00010847325,0.000027450538,0.00020173685,0.00017777052,0.017891953,0.0026376743,0.93888867,0.0048477277,0.034448147],"study_design_scores_gemma":[0.00007203649,0.00006032263,0.00011132593,0.000025350499,0.000017931352,0.00023461628,0.000029194724,0.039442707,0.0016994373,0.95395195,0.0043319864,0.000023184122],"about_ca_topic_score_codex":0.0004233727,"about_ca_topic_score_gemma":0.0003004579,"teacher_disagreement_score":0.009076314,"about_ca_system_score_codex":0.0016386245,"about_ca_system_score_gemma":0.002192202,"threshold_uncertainty_score":0.030363321},"labels":[],"label_agreement":null},{"id":"W3199898834","doi":"10.1504/ijsn.2021.10041097","title":"Impact of Post-Quantum Hybrid Certificates on PKI, Common Libraries, and Protocols","year":2021,"lang":"en","type":"article","venue":"International Journal of Security and Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Entrust (Canada); University of Ottawa","funders":"","keywords":"Public key infrastructure; Computer science; Revocation list; Certificate authority; Certificate; Computer security; Cryptography; Public-key cryptography; Certification; Public key certificate; Key management; Revocation; Encryption; Operating system; Theoretical computer science; Overhead (engineering)","score_opus":0.01715488933543705,"score_gpt":0.2937394684433007,"score_spread":0.2765845791078636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199898834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89257073,0.002227438,0.06746838,0.0015113655,0.00034808248,0.0004945061,0.00030695857,0.0034753273,0.031597227],"genre_scores_gemma":[0.9830085,0.00032093207,0.014406989,0.00014955517,0.000038970884,0.000054123313,0.00013375658,0.00028353912,0.001603611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9670743,0.011609621,0.001864484,0.0021706752,0.014440011,0.0028409702],"domain_scores_gemma":[0.8386814,0.09082022,0.010391804,0.043488167,0.014780125,0.0018382771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016196169,0.0011419756,0.00095786783,0.001795373,0.0024109327,0.0038346068,0.002872558,0.0016267736,0.0058773146],"category_scores_gemma":[0.08856843,0.00069178705,0.00088707736,0.0019686213,0.0035540524,0.010925393,0.004894016,0.0029362496,0.00093408773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005301008,0.00253082,0.0635074,0.0028228934,0.00050360506,0.0021247137,0.002028464,0.37246746,0.10497791,0.12375161,0.006907404,0.31307673],"study_design_scores_gemma":[0.00046655786,0.006149561,0.035801012,0.00067834125,0.0008836428,0.0034082576,0.0026154795,0.52611655,0.33037925,0.054790244,0.038096197,0.00061491324],"about_ca_topic_score_codex":0.0031624294,"about_ca_topic_score_gemma":0.0024563263,"teacher_disagreement_score":0.016196169,"about_ca_system_score_codex":0.004016576,"about_ca_system_score_gemma":0.002855501,"threshold_uncertainty_score":0.08565462},"labels":[],"label_agreement":null},{"id":"W3202691700","doi":"10.1007/978-3-030-88418-5_1","title":"More Efficient Post-quantum KEMTLS with Pre-distributed Public Keys","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum; Computer security; Distributed computing; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.012078580367377379,"score_gpt":0.2292305578338348,"score_spread":0.21715197746645742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202691700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0501746,0.0006638598,0.8803501,0.0011937295,0.00071787374,0.00035809836,0.00070266007,0.0045235404,0.06131556],"genre_scores_gemma":[0.5613554,0.00038649532,0.37890902,0.00077255984,0.00034213418,0.00029656242,0.0011842931,0.0010502416,0.055703357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976768,0.00054343033,0.00018335455,0.0003522755,0.0008285378,0.00041566527],"domain_scores_gemma":[0.99773395,0.0005702071,0.00009283224,0.0012433907,0.00025300856,0.00010656371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001644888,0.00084281544,0.0014587861,0.0007661522,0.0012026253,0.0027633524,0.001961582,0.0011481757,0.04050768],"category_scores_gemma":[0.0033461275,0.0005733029,0.0012372679,0.0013696307,0.0015983224,0.0058044908,0.004411198,0.002195441,0.012811188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019596983,0.00046112412,0.0005137069,0.00065980834,0.00015781443,0.00027292996,0.00039620098,0.02417174,0.036679987,0.6706884,0.02424567,0.23979302],"study_design_scores_gemma":[0.0006883632,0.0004456529,0.0005910617,0.00013329624,0.00015254546,0.0007177833,0.00026591096,0.1713549,0.06043284,0.7094146,0.05563948,0.00016352572],"about_ca_topic_score_codex":0.00047033638,"about_ca_topic_score_gemma":0.0010559799,"teacher_disagreement_score":0.04050768,"about_ca_system_score_codex":0.0012086004,"about_ca_system_score_gemma":0.0017447543,"threshold_uncertainty_score":0.1355117},"labels":[],"label_agreement":null},{"id":"W3202895739","doi":"10.1007/s00453-023-01150-y","title":"Algebraic Restriction Codes and Their Applications","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Oblivious transfer; Cryptography; Theoretical computer science; Computer science; Secret sharing; Linear code; Bounded function; Communication source; Function (biology); Context (archaeology); Discrete mathematics; Mathematics; Finite field; Block code; Algorithm; Decoding methods","score_opus":0.010293395459974677,"score_gpt":0.22777116782859544,"score_spread":0.21747777236862076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202895739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14586456,0.0014712947,0.7793333,0.0039790547,0.00031886782,0.00019141329,0.00017327005,0.0004646923,0.068203576],"genre_scores_gemma":[0.9104357,0.00086322724,0.08015188,0.00055706187,0.00038261665,0.00025659264,0.0001536941,0.00007210199,0.007127122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967853,0.0011389273,0.00016157431,0.0004737134,0.0011372787,0.00030316744],"domain_scores_gemma":[0.9867421,0.008383151,0.0009070769,0.0020154726,0.0014215066,0.00053074985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020085825,0.0004488407,0.00062020385,0.0012754101,0.0011709081,0.001760391,0.0009762243,0.0014936051,0.003169683],"category_scores_gemma":[0.013931323,0.00035950556,0.0006914716,0.0011338914,0.00488583,0.0033308752,0.00435746,0.003968523,0.0007658887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049181403,0.000027803397,0.0003487469,0.000055235,0.000007282268,0.0000882705,0.00019198254,0.012247551,0.0009655556,0.9737224,0.0005965215,0.011699491],"study_design_scores_gemma":[0.000023293598,0.000059937553,0.00012174724,0.000042703323,0.000007836764,0.0002558354,0.00006497113,0.06586044,0.0027312266,0.9238719,0.0069334437,0.000026668396],"about_ca_topic_score_codex":0.0006217391,"about_ca_topic_score_gemma":0.00025861128,"teacher_disagreement_score":0.003169683,"about_ca_system_score_codex":0.0016135912,"about_ca_system_score_gemma":0.0012723894,"threshold_uncertainty_score":0.011707425},"labels":[],"label_agreement":null},{"id":"W3203234318","doi":"","title":"BOREALIS: Building Block for Sealed Bid Auctions on Blockchains","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homomorphic encryption; Computer science; Secure multi-party computation; Encryption; Theoretical computer science; Cryptography; Integer (computer science); Ciphertext; ElGamal encryption; Computation; Symmetric-key algorithm; Computer security; Public-key cryptography; Algorithm","score_opus":0.023148517385478,"score_gpt":0.2904831080331036,"score_spread":0.2673345906476256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203234318","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014779241,0.00015805083,0.96132404,0.000318657,0.000099155295,0.00044935718,0.0003154796,0.0076494534,0.014906553],"genre_scores_gemma":[0.609357,0.00039710055,0.36801496,0.00030824548,0.00011345202,0.0011998457,0.0010653152,0.001282727,0.018261308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973367,0.00078292924,0.00015952674,0.00031576777,0.0010404425,0.00036460947],"domain_scores_gemma":[0.997867,0.0006404614,0.00019226353,0.0008713964,0.00021219134,0.0002166465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002455358,0.0007194693,0.0008960637,0.00056197774,0.0009517483,0.0025219256,0.0023719762,0.001136103,0.01625059],"category_scores_gemma":[0.0052955337,0.00083747815,0.0011363638,0.0006681892,0.0014662783,0.004325553,0.0046324152,0.0022381223,0.0068455734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012081782,0.00036144332,0.0010778804,0.00052105595,0.00013410645,0.000714406,0.00055790413,0.16356207,0.026861532,0.70076746,0.013444256,0.09078973],"study_design_scores_gemma":[0.0003467279,0.0002818245,0.00022747561,0.00007883479,0.000046742694,0.0002692578,0.00006638365,0.6387843,0.01957623,0.2921473,0.04810411,0.00007076983],"about_ca_topic_score_codex":0.0011096178,"about_ca_topic_score_gemma":0.0011455581,"teacher_disagreement_score":0.01625059,"about_ca_system_score_codex":0.0011451964,"about_ca_system_score_gemma":0.0019774025,"threshold_uncertainty_score":0.05436361},"labels":[],"label_agreement":null},{"id":"W3204236126","doi":"10.55859/ijiss.1187756","title":"Supersingular Isogeny-based Ring Signature","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Yükseköğretim Kurulu; University of Waterloo; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Orta Doğu Teknik Üniversitesi","keywords":"Ring signature; Isogeny; Digital signature; Anonymity; Ring (chemistry); Blind signature; Cryptography; Computer science; Merkle signature scheme; Signature (topology); ElGamal signature scheme; Schnorr signature; Mathematics; Computer security; Hash function; Elliptic curve; Pure mathematics","score_opus":0.008246541514450477,"score_gpt":0.2614937945213778,"score_spread":0.2532472530069273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204236126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14158918,0.0005236328,0.8326313,0.00052441517,0.00010662899,0.0002647896,0.00023995523,0.0013855167,0.022734536],"genre_scores_gemma":[0.8436306,0.00040394862,0.14485507,0.00018517359,0.00009812227,0.000118126656,0.0004253458,0.00010774506,0.010175786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969062,0.0005370967,0.00019087503,0.00056670106,0.0014238632,0.0003753219],"domain_scores_gemma":[0.9972721,0.0003717019,0.00038655856,0.0013892591,0.00044067504,0.00013968695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012876709,0.00028892525,0.0007119909,0.0007967641,0.0007340323,0.0014933455,0.0013629515,0.0006956626,0.0036000349],"category_scores_gemma":[0.0021756596,0.00020613374,0.0005947437,0.0009209899,0.0018026968,0.004381673,0.0026241217,0.0014660368,0.0016092577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006912733,0.00019638821,0.0012462159,0.00025432487,0.00006476851,0.00043010153,0.0008061735,0.028643556,0.089836545,0.750357,0.0028078966,0.124665834],"study_design_scores_gemma":[0.00017261726,0.0010937458,0.0011295832,0.000066861154,0.00010483504,0.0017052831,0.0004836796,0.2857948,0.2869455,0.35849383,0.06375959,0.00024971217],"about_ca_topic_score_codex":0.00041311048,"about_ca_topic_score_gemma":0.00027883425,"teacher_disagreement_score":0.0036000349,"about_ca_system_score_codex":0.0008795727,"about_ca_system_score_gemma":0.0012438507,"threshold_uncertainty_score":0.012043297},"labels":[],"label_agreement":null},{"id":"W3205729875","doi":"","title":"Type 2 Structure-Preserving Signature Schemes Revisited.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bilinear interpolation; Medicine; Statistics; Mathematics","score_opus":0.012547767710343284,"score_gpt":0.2628137755039502,"score_spread":0.2502660077936069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205729875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2541441,0.009236523,0.6175455,0.011110073,0.0031265279,0.00052517117,0.0008372323,0.0011871579,0.10228779],"genre_scores_gemma":[0.88207304,0.00250303,0.09573464,0.0013543367,0.0006078217,0.00014204397,0.00027639046,0.000067564346,0.017241262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978161,0.0007135746,0.000113692324,0.00027283622,0.0007938181,0.00028991184],"domain_scores_gemma":[0.99635905,0.0010821724,0.0004162945,0.0015031841,0.00042368617,0.000215618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024333317,0.00049759087,0.00059188914,0.00090123806,0.0014085424,0.003888953,0.0014603169,0.0020270515,0.004507122],"category_scores_gemma":[0.004453269,0.00035218216,0.00083682284,0.0019282529,0.0020690823,0.007570027,0.0024689469,0.0035236443,0.0013104834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029979227,0.00007396944,0.00092950225,0.00018370766,0.000034401506,0.00029062186,0.00038205055,0.0035251623,0.006949448,0.94465107,0.003935646,0.038744584],"study_design_scores_gemma":[0.00012569131,0.0003240136,0.0007068394,0.00010166433,0.00006149193,0.0017394664,0.00022897215,0.03239044,0.023939952,0.8637329,0.07656969,0.000078956975],"about_ca_topic_score_codex":0.00018079953,"about_ca_topic_score_gemma":0.00015795654,"teacher_disagreement_score":0.004507122,"about_ca_system_score_codex":0.0015517628,"about_ca_system_score_gemma":0.001080537,"threshold_uncertainty_score":0.015077829},"labels":[],"label_agreement":null},{"id":"W3206679013","doi":"","title":"Riding on Asymmetry: Efficient ABE for Branching Programs.","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Functional encryption; Ciphertext; Encryption; Theoretical computer science; Learning with errors; Security token; Secret sharing; Attribute-based encryption; Homomorphic encryption; Homomorphic secret sharing; 40-bit encryption; Public-key cryptography; Algorithm; Computer security; Cryptography","score_opus":0.02244870409367549,"score_gpt":0.27697311127158747,"score_spread":0.25452440717791197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206679013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07082988,0.00054269854,0.915212,0.000969553,0.00010154053,0.0002367198,0.0002595224,0.0014383132,0.01040968],"genre_scores_gemma":[0.77500176,0.00040981633,0.21592924,0.00030081242,0.00010097252,0.00026392998,0.0003722705,0.00023777121,0.0073835254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967997,0.0009575286,0.00015006919,0.00043970539,0.0011034581,0.0005495605],"domain_scores_gemma":[0.99454546,0.0025271527,0.0004327241,0.001888048,0.00034297368,0.00026362113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027729534,0.0006500333,0.0011166693,0.0005781342,0.0010831712,0.0021561915,0.0015963309,0.0013427001,0.003591464],"category_scores_gemma":[0.009540068,0.00045177207,0.0011925942,0.0008536011,0.0019271501,0.006655993,0.0042454517,0.0033330794,0.0012116728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010611893,0.00021754652,0.0011707132,0.00023158103,0.00006381958,0.00031651577,0.0005745323,0.043290954,0.02795418,0.80579865,0.004498725,0.11482155],"study_design_scores_gemma":[0.00014594983,0.00020461608,0.00030799198,0.00006391662,0.00005719676,0.00043960364,0.00009701978,0.3349477,0.02439109,0.6261429,0.013154726,0.000047253685],"about_ca_topic_score_codex":0.0005550732,"about_ca_topic_score_gemma":0.00055662525,"teacher_disagreement_score":0.003591464,"about_ca_system_score_codex":0.0015075218,"about_ca_system_score_gemma":0.0015565465,"threshold_uncertainty_score":0.014664948},"labels":[],"label_agreement":null},{"id":"W3206968728","doi":"10.1109/tcc.2021.3120110","title":"Searchable Encryption With Autonomous Path Delegation Function and Its Application in Healthcare Cloud","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Delegate; Plaintext; Computer security; Cloud computing; Outsourcing; Delegation; Ciphertext; Private information retrieval; Path (computing); Overhead (engineering); Cryptographic primitive; Cryptography; Computer network; Cryptographic protocol; Business","score_opus":0.01551474387496041,"score_gpt":0.24601506472537926,"score_spread":0.23050032085041885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206968728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09899814,0.0028470124,0.8871247,0.0015149032,0.00016654078,0.00023094614,0.00015660105,0.0006609916,0.008300102],"genre_scores_gemma":[0.9421312,0.00087488635,0.054204397,0.00015169905,0.000053869633,0.00005768267,0.00007449757,0.000016192207,0.002435604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985417,0.00046859114,0.00012973702,0.0001815124,0.00046345466,0.00021499555],"domain_scores_gemma":[0.99911183,0.00025064446,0.0001222189,0.00029135082,0.00015557987,0.000068368856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009429991,0.00027918536,0.0005578104,0.00050088105,0.0005921837,0.0010093556,0.00075137726,0.00064540905,0.0011552403],"category_scores_gemma":[0.0018736074,0.0001360636,0.0005334851,0.0009070111,0.0008446854,0.0024978053,0.0013995509,0.0009306255,0.00023622025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018614808,0.00039669854,0.003362551,0.00066161744,0.00016997632,0.001876814,0.0008004197,0.1680098,0.06496595,0.38736925,0.009901387,0.36062413],"study_design_scores_gemma":[0.00016761509,0.0005058946,0.0011141937,0.0000561888,0.00008376579,0.0022311318,0.00024326575,0.8840669,0.03653612,0.05909439,0.0158006,0.000100010824],"about_ca_topic_score_codex":0.0013396121,"about_ca_topic_score_gemma":0.00085242046,"teacher_disagreement_score":0.0013396121,"about_ca_system_score_codex":0.00103038,"about_ca_system_score_gemma":0.0015450543,"threshold_uncertainty_score":0.007476032},"labels":[],"label_agreement":null},{"id":"W3207612168","doi":"10.1007/978-3-030-88323-2_4","title":"Security Analysis of DGM and GM Group Signature Schemes Instantiated with XMSS-T","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Merkle tree; Stateful firewall; Hash function; Computer science; Digital signature; Signature (topology); Merkle signature scheme; Theoretical computer science; Computer network; Hash chain; Computer security; Mathematics; Blind signature","score_opus":0.008342640998972353,"score_gpt":0.22136974513797242,"score_spread":0.21302710413900006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207612168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5866274,0.0015999065,0.33823025,0.0023543695,0.00022634158,0.00050444837,0.0013309089,0.0024585063,0.066667855],"genre_scores_gemma":[0.97842133,0.00018058602,0.016409945,0.00014155594,0.00007427685,0.000059329752,0.00039041688,0.00009906193,0.0042234748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579763,0.001140462,0.00015829067,0.00044294272,0.00141893,0.0010417815],"domain_scores_gemma":[0.9944371,0.0025014952,0.00044764555,0.0019437355,0.0004735948,0.00019640285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028058765,0.0005827967,0.00074897485,0.0012564247,0.0012487984,0.002935129,0.0013650202,0.0012324337,0.0061258785],"category_scores_gemma":[0.0067922026,0.0003202867,0.0011847566,0.001186597,0.0023053521,0.0040926384,0.003029773,0.001700873,0.0011181857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019376936,0.00014999682,0.003465893,0.00027243618,0.00009684282,0.00033403112,0.00042371644,0.06520349,0.018761517,0.85916406,0.0055629453,0.04462741],"study_design_scores_gemma":[0.00015151463,0.0003321047,0.0023880126,0.00012389048,0.00013136341,0.0008070641,0.00030048747,0.4703312,0.026156006,0.48402756,0.015184069,0.00006679152],"about_ca_topic_score_codex":0.0007095835,"about_ca_topic_score_gemma":0.00051825435,"teacher_disagreement_score":0.0061258785,"about_ca_system_score_codex":0.003197154,"about_ca_system_score_gemma":0.0019263393,"threshold_uncertainty_score":0.023197055},"labels":[],"label_agreement":null},{"id":"W3208101893","doi":"10.1007/978-3-030-90567-5_35","title":"Verifiable Obtained Random Subsets for Improving SPHINCS+","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"NIST; Verifiable secret sharing; Computer science; Hash function; Digital signature; Cryptography; Theoretical computer science; Standardization; Computation; Algorithm; Set (abstract data type); Computer security","score_opus":0.013122364782367344,"score_gpt":0.2334616501309755,"score_spread":0.22033928534860817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208101893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0617087,0.0006829976,0.8733279,0.0019174003,0.0007424875,0.0007843656,0.0022922542,0.013085695,0.045458212],"genre_scores_gemma":[0.5980087,0.00038076774,0.35835275,0.0012182221,0.00054882606,0.0008951563,0.004701672,0.0015123343,0.034381516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99479204,0.0012504692,0.00026718256,0.00087222096,0.0020847637,0.00073329423],"domain_scores_gemma":[0.99287605,0.001962033,0.00024501275,0.0039874217,0.0006819873,0.00024751064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024220934,0.00125231,0.0015567294,0.000880725,0.0013796772,0.0020386649,0.0027411648,0.0011587958,0.014905888],"category_scores_gemma":[0.007829412,0.00059524504,0.0014258927,0.001091789,0.0017248761,0.0034608424,0.007086675,0.0030123105,0.005101914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039675157,0.00061643985,0.0016793063,0.0006246497,0.0001642123,0.00031533992,0.0003706218,0.055361025,0.029737402,0.4744851,0.058232423,0.37444592],"study_design_scores_gemma":[0.000467379,0.0006653646,0.00075751403,0.000155671,0.00018309617,0.0005057805,0.00013813497,0.38040027,0.043085173,0.5278982,0.0456702,0.00007317992],"about_ca_topic_score_codex":0.0010036951,"about_ca_topic_score_gemma":0.0016313787,"teacher_disagreement_score":0.014905888,"about_ca_system_score_codex":0.0016087044,"about_ca_system_score_gemma":0.0033546248,"threshold_uncertainty_score":0.049865186},"labels":[],"label_agreement":null},{"id":"W3208437746","doi":"10.1109/ccece53047.2021.9569200","title":"Indistinguishability and Non-deterministic Encryption of the Quantum Safe Multivariate Polynomial Public Key Cryptographic System","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"","keywords":"Univariate; Public-key cryptography; Encryption; Cryptography; Mathematics; Polynomial; Key (lock); Discrete mathematics; Multivariate statistics; Computer science; Algorithm; Statistics; Computer security","score_opus":0.013237950682174725,"score_gpt":0.22291448420415122,"score_spread":0.2096765335219765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208437746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16417918,0.0018318513,0.79674363,0.002500143,0.0001703203,0.00016936885,0.00037063728,0.00031778778,0.033717114],"genre_scores_gemma":[0.94872546,0.00095336314,0.043231096,0.00027729926,0.00015607325,0.00012717668,0.00016702192,0.00004445899,0.006318062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723154,0.00081886153,0.0001717005,0.00036714037,0.0010388525,0.00037193781],"domain_scores_gemma":[0.9979658,0.0010357886,0.00027226628,0.00049068447,0.0001605241,0.000074997646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973222,0.00034850574,0.0005794336,0.0005274902,0.0009229801,0.002005074,0.0009207763,0.0011450999,0.0022535697],"category_scores_gemma":[0.0048492695,0.00026506776,0.00086689374,0.0005381961,0.00283295,0.004143201,0.0021775165,0.0023810577,0.0004240895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006684507,0.000018859155,0.00019351467,0.000056208617,0.000012720489,0.00010827843,0.00012858846,0.0076838117,0.0026891357,0.98293674,0.0003335118,0.0057718265],"study_design_scores_gemma":[0.00004255906,0.0000807505,0.000424154,0.000040725165,0.00002536446,0.00027717315,0.00004401711,0.11242307,0.01012505,0.8708884,0.0055906163,0.00003804005],"about_ca_topic_score_codex":0.00058780203,"about_ca_topic_score_gemma":0.00029162268,"teacher_disagreement_score":0.0022535697,"about_ca_system_score_codex":0.0018849103,"about_ca_system_score_gemma":0.0012913,"threshold_uncertainty_score":0.013676047},"labels":[],"label_agreement":null},{"id":"W3208671521","doi":"10.1007/978-3-031-17143-7_15","title":"Mixed-Technique Multi-Party Computations Composed of Two-Party Computations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homomorphic encryption; Computer science; Secure multi-party computation; Computation; Theoretical computer science; Secure two-party computation; Encryption; Set (abstract data type); Oblivious transfer; Multiplicative function; Secret sharing; Construct (python library); Communication complexity; Computer security; Computer network; Cryptography; Algorithm; Mathematics","score_opus":0.030368300369527233,"score_gpt":0.2780407050033518,"score_spread":0.2476724046338246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208671521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017267814,0.000345618,0.9625691,0.00016533272,0.00014632002,0.00019985485,0.00007200836,0.0007589039,0.01847498],"genre_scores_gemma":[0.4015981,0.00042130952,0.5644581,0.00018238589,0.00016554148,0.00036599362,0.0002535609,0.00032794478,0.032227136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979944,0.00058971153,0.00011757563,0.00029973406,0.00075975223,0.00023892375],"domain_scores_gemma":[0.99773276,0.00072007196,0.000090613736,0.0011187482,0.00024712234,0.00009063741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015677776,0.000901314,0.0009794342,0.0006536402,0.0010955735,0.002696766,0.0016073756,0.0011765171,0.012198476],"category_scores_gemma":[0.003096931,0.00069762144,0.0015698441,0.0011185186,0.0011225737,0.004129832,0.0039661997,0.0024039128,0.0040636966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012636125,0.0002527289,0.00083571917,0.0007596538,0.00028169193,0.00062359276,0.0003580751,0.023456119,0.07178221,0.6930845,0.0053840093,0.20191808],"study_design_scores_gemma":[0.00021798168,0.00071343506,0.0007999105,0.00020747418,0.0003006455,0.0019137064,0.000104775936,0.47340673,0.096607566,0.37572023,0.049900457,0.00010706257],"about_ca_topic_score_codex":0.00011224298,"about_ca_topic_score_gemma":0.00025361901,"teacher_disagreement_score":0.012198476,"about_ca_system_score_codex":0.0005751566,"about_ca_system_score_gemma":0.00073088356,"threshold_uncertainty_score":0.040807962},"labels":[],"label_agreement":null},{"id":"W3209252692","doi":"10.1007/978-3-030-90567-5_1","title":"Leakage Resilient Cheating Detectable Secret Sharing Schemes","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Computer science; Secure multi-party computation; Access structure; Homomorphic secret sharing; Cryptography; Theoretical computer science; Cheating; Shamir's Secret Sharing; Adversary; Compiler; Computer security; Verifiable secret sharing; Set (abstract data type); Programming language","score_opus":0.016733130514906425,"score_gpt":0.24294874280422302,"score_spread":0.22621561228931658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209252692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0778082,0.0019073092,0.8892665,0.0016946157,0.0003294457,0.00020483175,0.00021260472,0.0028824212,0.02569411],"genre_scores_gemma":[0.90410286,0.0007233804,0.07764941,0.00035837022,0.000177237,0.00011416009,0.000166844,0.00018148212,0.016526295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952415,0.0011829839,0.00020620384,0.0005169282,0.0022515708,0.00060080463],"domain_scores_gemma":[0.99059993,0.0038887435,0.0007670897,0.0038725394,0.00066047505,0.00021119598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023543134,0.001131379,0.0011337488,0.00097429444,0.0009321216,0.0021229994,0.0025253575,0.0019726774,0.004404466],"category_scores_gemma":[0.007670087,0.0008013212,0.00073194026,0.0013895319,0.0021004793,0.004085599,0.0044308174,0.0046109003,0.0013923044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015891464,0.00044578404,0.00076530594,0.00054857455,0.00016196174,0.00062067545,0.00078489684,0.10529263,0.06866195,0.56897974,0.011428231,0.24072117],"study_design_scores_gemma":[0.00019461756,0.0006513516,0.00048201284,0.0001626974,0.00012972469,0.0014480277,0.00009638537,0.4856866,0.07881973,0.417074,0.015144717,0.00011019329],"about_ca_topic_score_codex":0.00016011683,"about_ca_topic_score_gemma":0.00014700305,"teacher_disagreement_score":0.004404466,"about_ca_system_score_codex":0.0015729399,"about_ca_system_score_gemma":0.00096463255,"threshold_uncertainty_score":0.014734387},"labels":[],"label_agreement":null},{"id":"W3209551251","doi":"10.1137/19m1291145","title":"Lattice Reformulation Cuts","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Lattice (music); Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.012825745521170521,"score_gpt":0.24685454925083142,"score_spread":0.2340288037296609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209551251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04089172,0.00044705265,0.8789774,0.0008868576,0.0002549369,0.0003233282,0.0006821574,0.00071103557,0.076825485],"genre_scores_gemma":[0.3404179,0.00047854803,0.6355808,0.0006448263,0.00014589797,0.0006422842,0.0016466544,0.00066905626,0.019774083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881077,0.0002920783,0.000057398123,0.00023674662,0.00041796893,0.00018515711],"domain_scores_gemma":[0.998738,0.0006131474,0.00010064884,0.00022688272,0.000243766,0.000077633114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012863373,0.0007861665,0.00069759716,0.0008032607,0.00075263955,0.0023004385,0.0010538889,0.00073486485,0.023378527],"category_scores_gemma":[0.0050730817,0.00041488922,0.001117219,0.0007495882,0.0015444498,0.0026178702,0.0016872133,0.0034939442,0.0031195397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014941477,0.00012137898,0.0002910584,0.00023634959,0.000027113989,0.00014387618,0.0002388329,0.08666534,0.0040330645,0.8150392,0.008071223,0.084983125],"study_design_scores_gemma":[0.000090973685,0.0002200181,0.0001833841,0.00013754758,0.000024055907,0.000121126875,0.00026906148,0.2635063,0.007432162,0.6907509,0.037236735,0.000027755514],"about_ca_topic_score_codex":0.0011179157,"about_ca_topic_score_gemma":0.0015740591,"teacher_disagreement_score":0.023378527,"about_ca_system_score_codex":0.0012516422,"about_ca_system_score_gemma":0.001132488,"threshold_uncertainty_score":0.07820892},"labels":[],"label_agreement":null},{"id":"W3210576683","doi":"","title":"Tight Bounds for Simon's Algorithm.","year":2020,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptanalysis; Computer science; Algorithm; Quantum algorithm; Quantum; Cryptography","score_opus":0.026137396383050564,"score_gpt":0.2791080035786509,"score_spread":0.2529706071956003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210576683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13595402,0.014107208,0.67273337,0.012500134,0.0014216122,0.00047073426,0.0018737512,0.0038799816,0.15705912],"genre_scores_gemma":[0.8331819,0.004667061,0.13794188,0.0019931162,0.0013979228,0.00065403763,0.0016210312,0.0018210158,0.01672191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97800386,0.0036531563,0.00071120856,0.0025563482,0.010604498,0.0044709384],"domain_scores_gemma":[0.9237129,0.05189452,0.0042669256,0.01227339,0.005352523,0.002499736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011177071,0.0030156174,0.002648714,0.006194458,0.0036747064,0.009015442,0.00433069,0.0039729527,0.02021222],"category_scores_gemma":[0.07005477,0.0013459534,0.002574435,0.006259874,0.0078046373,0.021711057,0.0073775183,0.009747231,0.004469084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061628415,0.00015342455,0.0010383785,0.00027410578,0.0000823193,0.00007112221,0.00019067536,0.035095934,0.002336764,0.9266148,0.010700453,0.022825735],"study_design_scores_gemma":[0.000060556933,0.000101492435,0.0006343308,0.00010419565,0.000057301455,0.0001583267,0.0000680386,0.09632322,0.0031031934,0.8909541,0.008373941,0.00006129805],"about_ca_topic_score_codex":0.0023654825,"about_ca_topic_score_gemma":0.003041848,"teacher_disagreement_score":0.02021222,"about_ca_system_score_codex":0.009606389,"about_ca_system_score_gemma":0.0048928177,"threshold_uncertainty_score":0.069699585},"labels":[],"label_agreement":null},{"id":"W3210597498","doi":"10.1109/brains52497.2021.9569788","title":"Data Capsule: A Self-Contained Data Model as an Access Policy Enforcement Strategy","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Enforcement; Computer security; Data modeling; Database","score_opus":0.16182439899253995,"score_gpt":0.40504051987604195,"score_spread":0.243216120883502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210597498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007987532,0.00019979649,0.98136294,0.0012795747,0.00011536248,0.00022705684,0.00019468897,0.0005075533,0.008125517],"genre_scores_gemma":[0.3634139,0.00096515357,0.60519207,0.0010523552,0.00027474272,0.0010133482,0.0013378385,0.0005087232,0.026241958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919225,0.002431777,0.00089401315,0.0012795856,0.0028276404,0.000644476],"domain_scores_gemma":[0.98764473,0.0022666466,0.0008645627,0.0071147718,0.0013042709,0.00080502295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008358138,0.0005449685,0.0010726633,0.0015686824,0.0018197638,0.008129125,0.0042032516,0.0026630799,0.0039161346],"category_scores_gemma":[0.009136147,0.0007520732,0.001663077,0.002358865,0.0058053937,0.01785031,0.006742527,0.0042445264,0.0016500745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051854004,0.00004374848,0.00031611123,0.000058515703,0.000018355171,0.00013778372,0.00028464923,0.0065782913,0.0012109908,0.9801183,0.0015655163,0.009615992],"study_design_scores_gemma":[0.00011938182,0.00019088152,0.00024454945,0.00016623914,0.00008585885,0.000610497,0.0002995985,0.22362767,0.01236648,0.5972927,0.16487654,0.00011962969],"about_ca_topic_score_codex":0.002544149,"about_ca_topic_score_gemma":0.001505489,"teacher_disagreement_score":0.008358138,"about_ca_system_score_codex":0.0023496356,"about_ca_system_score_gemma":0.0046191826,"threshold_uncertainty_score":0.044202566},"labels":[],"label_agreement":null},{"id":"W3211268411","doi":"","title":"Post-Quantum Key-Blinding for Authentication in Anonymity Networks.","year":2021,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Anonymity; Computer science; Blinding; Computer security; Authentication (law); Public-key cryptography; Key (lock); Rendezvous; Computer network; Engineering","score_opus":0.0184934084659512,"score_gpt":0.2762658638232204,"score_spread":0.25777245535726917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211268411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052636717,0.0033924447,0.9336474,0.0038010539,0.0013587739,0.00025420726,0.00018724988,0.0010766375,0.051018596],"genre_scores_gemma":[0.50521404,0.00493852,0.4190278,0.00347302,0.0015748702,0.00063697057,0.00042126645,0.000680634,0.064032845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494463,0.0020419422,0.00021649172,0.00070341135,0.0016226122,0.0004709543],"domain_scores_gemma":[0.99534225,0.0013688898,0.0003496039,0.0023557118,0.0004487952,0.00013488944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004080583,0.0009706075,0.0010395295,0.0010142061,0.0030122346,0.0029124513,0.0021805812,0.0031759525,0.018311158],"category_scores_gemma":[0.010391834,0.00050853373,0.0013937107,0.0016759416,0.0065958835,0.011481199,0.0046505146,0.0049014874,0.0053721913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085227635,0.00003600192,0.00009378178,0.00017878445,0.00001959314,0.000091528644,0.00012129612,0.0019568854,0.0017279858,0.95932466,0.008711576,0.027652718],"study_design_scores_gemma":[0.00002365193,0.000052130083,0.000088254754,0.000058277845,0.000016855915,0.00030412414,0.000039358973,0.020347418,0.004360428,0.9374526,0.037211478,0.000045572808],"about_ca_topic_score_codex":0.0007207202,"about_ca_topic_score_gemma":0.0008268889,"teacher_disagreement_score":0.018311158,"about_ca_system_score_codex":0.0026155096,"about_ca_system_score_gemma":0.001782097,"threshold_uncertainty_score":0.061257005},"labels":[],"label_agreement":null},{"id":"W3211971641","doi":"","title":"Verifiable Obtained Random Subsets for Improving SPHINCS","year":2021,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"NIST; Verifiable secret sharing; Computer science; Hash function; Digital signature; Cryptography; Standardization; Theoretical computer science; Computation; Algorithm; Set (abstract data type); Computer security","score_opus":0.01530762856471051,"score_gpt":0.2551167513221477,"score_spread":0.23980912275743715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211971641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11714077,0.00074599934,0.84925646,0.0011510963,0.00031878272,0.0009048372,0.0006449181,0.010140594,0.01969661],"genre_scores_gemma":[0.806904,0.00020813826,0.18392004,0.00034518226,0.00015829553,0.00034222697,0.0012763647,0.0006442368,0.0062014083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906267,0.00341839,0.00056470017,0.0010176698,0.0035210655,0.00085149915],"domain_scores_gemma":[0.98523754,0.0031607372,0.0012375624,0.008630405,0.0014149995,0.0003187618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005648876,0.0008441476,0.0010935934,0.0008814932,0.00076130836,0.0022660065,0.0024454214,0.0009982511,0.009656498],"category_scores_gemma":[0.015162424,0.00045875763,0.0009044394,0.0007116172,0.0016221775,0.004930477,0.0048880884,0.0021722731,0.003361337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004704123,0.0005212919,0.0044697495,0.00053416315,0.00016482463,0.0004677151,0.00042519835,0.074902676,0.10635218,0.38794538,0.014001145,0.40551153],"study_design_scores_gemma":[0.00065871124,0.0022761673,0.0017143489,0.00019172032,0.00016497765,0.001355572,0.0002242438,0.5080951,0.24114779,0.177655,0.06632306,0.0001933709],"about_ca_topic_score_codex":0.00038993437,"about_ca_topic_score_gemma":0.00033830435,"teacher_disagreement_score":0.009656498,"about_ca_system_score_codex":0.0013045974,"about_ca_system_score_gemma":0.0018034144,"threshold_uncertainty_score":0.032304168},"labels":[],"label_agreement":null},{"id":"W3212510710","doi":"10.1109/tdsc.2021.3128073","title":"Privacy-Preserving Proof-of-Location With Security Against Geo-Tampering","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Mathematics; Mathematical proof; Computer science; Discrete mathematics; Theoretical computer science; Arithmetic; Geometry","score_opus":0.011133100045737823,"score_gpt":0.22633361400972168,"score_spread":0.21520051396398387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212510710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010811419,0.0010646249,0.9499707,0.0017328113,0.00043229677,0.00040358945,0.0017390386,0.014109074,0.019736432],"genre_scores_gemma":[0.62702525,0.0015650922,0.33479166,0.0019131268,0.0005049027,0.0011736165,0.0033093877,0.0020149436,0.027701944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995424,0.0011391857,0.00041963058,0.00078599964,0.0015430067,0.00068828696],"domain_scores_gemma":[0.9894106,0.0022377903,0.0006761457,0.006309765,0.0011092448,0.00025632262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299925,0.0012467068,0.0014367494,0.0011292245,0.0014652197,0.0045336476,0.0037711437,0.0025987977,0.021642417],"category_scores_gemma":[0.017167237,0.0010062692,0.001233809,0.0018904085,0.001932752,0.0073169298,0.0074099586,0.0030672767,0.015757862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014590231,0.00026083126,0.0015868797,0.0014998735,0.00017566193,0.0015401972,0.0011600524,0.05381806,0.02959189,0.6021589,0.091459416,0.21528922],"study_design_scores_gemma":[0.0003724321,0.00036787748,0.0003902091,0.0002837703,0.00013016694,0.0022040666,0.000305744,0.26342097,0.0957345,0.40957835,0.22701214,0.00019972191],"about_ca_topic_score_codex":0.00064780284,"about_ca_topic_score_gemma":0.00061076053,"teacher_disagreement_score":0.021642417,"about_ca_system_score_codex":0.0010855761,"about_ca_system_score_gemma":0.003304523,"threshold_uncertainty_score":0.07240111},"labels":[],"label_agreement":null},{"id":"W3212550377","doi":"10.23977/jeis.2021.060211","title":"Efficient identity based ring signature scheme in prime order group","year":2021,"lang":"en","type":"article","venue":"Journal of Electronics and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ring signature; Group signature; Correctness; Anonymity; Signature (topology); Merkle signature scheme; Scheme (mathematics); Prime (order theory); Ring (chemistry); Group (periodic table); Identity (music); Computer science; ElGamal signature scheme; Overhead (engineering); Algorithm; Digital signature; Theoretical computer science; Mathematics; Blind signature; Public-key cryptography; Computer security; Combinatorics; Encryption; Hash function; Programming language","score_opus":0.005119252066539045,"score_gpt":0.2385358183647776,"score_spread":0.23341656629823856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212550377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09264992,0.00076534256,0.8878533,0.00042366193,0.00018769037,0.00020056528,0.00016887614,0.0010455388,0.016705027],"genre_scores_gemma":[0.8177097,0.0006012172,0.17140636,0.00011334209,0.00009830254,0.000110080815,0.0002600495,0.000033708326,0.009667261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890435,0.00026825606,0.000057728503,0.00017897319,0.00046740228,0.00012331997],"domain_scores_gemma":[0.9995333,0.00007749499,0.00007270143,0.0001575152,0.0001212758,0.00003774305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014285,0.00026886887,0.00044040766,0.00046164083,0.00070811424,0.0010038973,0.0007409412,0.00050427654,0.0020844114],"category_scores_gemma":[0.0009574348,0.00014057968,0.00036446322,0.0007741809,0.0005272841,0.0023319111,0.0009874575,0.00073501683,0.0006758071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009963581,0.00022011496,0.0019692685,0.00044417952,0.00007440958,0.0008160846,0.00078098057,0.062484767,0.1244406,0.5671332,0.006305657,0.2343343],"study_design_scores_gemma":[0.00038880127,0.0011488406,0.0013038509,0.000058224407,0.00012860223,0.0024820317,0.00028534807,0.60828155,0.15885289,0.15462531,0.07227375,0.00017076424],"about_ca_topic_score_codex":0.00046157968,"about_ca_topic_score_gemma":0.0003602684,"teacher_disagreement_score":0.0020844114,"about_ca_system_score_codex":0.0005536489,"about_ca_system_score_gemma":0.0012300425,"threshold_uncertainty_score":0.006973028},"labels":[],"label_agreement":null},{"id":"W3212683876","doi":"10.1007/978-3-030-92548-2_8","title":"GMMT: A Revocable Group Merkle Multi-tree Signature Scheme","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Merkle tree; Group signature; Computer science; Scheme (mathematics); Tree (set theory); Group (periodic table); Computer security; Ring signature; Computer network; Digital signature; Mathematics; Cryptography; Hash function; Public-key cryptography; Combinatorics; Cryptographic hash function; Physics; Encryption","score_opus":0.01833215298826052,"score_gpt":0.26309401199586174,"score_spread":0.24476185900760122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212683876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14759064,0.0033592796,0.7832184,0.003299262,0.0014118911,0.0007553205,0.003706028,0.022220759,0.03443841],"genre_scores_gemma":[0.8155014,0.00089910225,0.14949854,0.00085542694,0.00024636553,0.00031347698,0.0018558296,0.00076105807,0.030068845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985122,0.00025618917,0.00011422216,0.00026102638,0.00061628077,0.00024003047],"domain_scores_gemma":[0.99852705,0.00015425788,0.00016763725,0.0007779588,0.00020539344,0.0001676123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090914994,0.00050955295,0.00095385296,0.0006138761,0.00076304324,0.0017266012,0.0010537428,0.001258315,0.005289943],"category_scores_gemma":[0.0021084002,0.00031243227,0.00042819174,0.0008958452,0.00095688726,0.0033388217,0.0038659554,0.0021868765,0.003222216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003253685,0.00027827485,0.0011832356,0.0009929963,0.00012554487,0.0009562338,0.0007843532,0.014830855,0.15390971,0.3669072,0.045488577,0.41128933],"study_design_scores_gemma":[0.0010024288,0.0013501516,0.0017628376,0.00024634312,0.0001856416,0.0040457947,0.00031125487,0.09009999,0.20446092,0.37780076,0.31833816,0.00039577452],"about_ca_topic_score_codex":0.00025664258,"about_ca_topic_score_gemma":0.00025008016,"teacher_disagreement_score":0.005289943,"about_ca_system_score_codex":0.0009702519,"about_ca_system_score_gemma":0.0013348496,"threshold_uncertainty_score":0.017696619},"labels":[],"label_agreement":null},{"id":"W3213275511","doi":"10.1007/978-3-030-90456-2_5","title":"Amortizing Rate-1 OT and Applications to PIR and PSI","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Security parameter; Communication source; Homomorphic encryption; Algorithm; Group (periodic table); Theoretical computer science; Encryption; Discrete mathematics; Cryptography; Mathematics; Computer network","score_opus":0.016506355082970568,"score_gpt":0.252182351647094,"score_spread":0.23567599656412344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213275511","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010817437,0.0024015661,0.9320423,0.0012006457,0.00090382894,0.00019492234,0.00021894732,0.0017225416,0.05049777],"genre_scores_gemma":[0.41421646,0.0044091768,0.50268596,0.0010700789,0.0031819288,0.0006409318,0.0005303786,0.0016962308,0.071568854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949427,0.00140602,0.00026249693,0.00064425106,0.0020148999,0.000729643],"domain_scores_gemma":[0.9875093,0.006260069,0.00076511444,0.0038814924,0.0012552005,0.0003287835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053134975,0.0024111588,0.002602455,0.0027188978,0.002468994,0.0044783545,0.004000263,0.0027890918,0.0127916625],"category_scores_gemma":[0.022003813,0.00076900196,0.0023166232,0.004776666,0.0050543603,0.0063146516,0.0077741817,0.005839127,0.004125596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002199095,0.00014650974,0.0003557009,0.00015458968,0.000039109174,0.00013367819,0.00017816781,0.054381587,0.0028381662,0.7967141,0.012340548,0.13249792],"study_design_scores_gemma":[0.000022805752,0.00008873483,0.00015862413,0.00007209042,0.000048098023,0.00038230894,0.000063965555,0.32548305,0.0030034527,0.6609116,0.009708018,0.000057285008],"about_ca_topic_score_codex":0.0016828057,"about_ca_topic_score_gemma":0.0020142684,"teacher_disagreement_score":0.0127916625,"about_ca_system_score_codex":0.0037613874,"about_ca_system_score_gemma":0.0029480278,"threshold_uncertainty_score":0.04279238},"labels":[],"label_agreement":null},{"id":"W3213704572","doi":"10.1145/3474123.3486756","title":"Privacy-enhanced OptiSwap","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer security; Computer science; Protocol (science); Composability; Trusted third party; Digital goods; Confidentiality; Information exchange; Universal composability; Internet privacy; Smart contract; Cryptographic protocol; Cryptography; World Wide Web; Telecommunications; Distributed computing","score_opus":0.011760779468207336,"score_gpt":0.23820249556699394,"score_spread":0.2264417160987866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213704572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030163934,0.00023391006,0.9573075,0.0008232551,0.00012875786,0.00028204152,0.00014723162,0.00079537043,0.010117986],"genre_scores_gemma":[0.7369427,0.00034863112,0.25093442,0.00054895255,0.00008630369,0.00031474547,0.00019704347,0.00017217902,0.010454951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99346113,0.0017593838,0.00041162537,0.0010579064,0.0025066603,0.00080324424],"domain_scores_gemma":[0.99094206,0.0024699958,0.0007571807,0.0046337135,0.00095104333,0.0002459918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050043045,0.00062859827,0.0010133905,0.00066052645,0.0020023172,0.0029824716,0.003028477,0.0016923371,0.0033032887],"category_scores_gemma":[0.009894176,0.0005453385,0.0012860469,0.0011762707,0.0038810335,0.007910805,0.005905577,0.0038932927,0.0008530912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005605071,0.0001505842,0.0012931227,0.00026828947,0.00007111249,0.0004202431,0.00051884877,0.04485829,0.021125842,0.8599757,0.0039016071,0.0668559],"study_design_scores_gemma":[0.00013800246,0.00019303261,0.00046884813,0.00006327627,0.000090648755,0.00082365406,0.00013035581,0.39745012,0.049311157,0.5201144,0.031138381,0.00007815089],"about_ca_topic_score_codex":0.0007957781,"about_ca_topic_score_gemma":0.00061566435,"teacher_disagreement_score":0.0050043045,"about_ca_system_score_codex":0.0016774876,"about_ca_system_score_gemma":0.0032420242,"threshold_uncertainty_score":0.026465595},"labels":[],"label_agreement":null},{"id":"W3213751516","doi":"10.1101/2021.11.10.468090","title":"Secure federated Boolean count queries using fully-homomorphic cryptography","year":2021,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Homomorphic encryption; Cryptography; Encryption; Set operations; Benchmarking; Theoretical computer science; Set (abstract data type); Computer security","score_opus":0.016100112599286738,"score_gpt":0.2181251747493397,"score_spread":0.20202506215005298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213751516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079738736,0.00054254447,0.90786314,0.0010306127,0.00010789388,0.00029340768,0.00087970484,0.004756444,0.0047876686],"genre_scores_gemma":[0.8694997,0.00019017968,0.12588231,0.0003525509,0.000066992645,0.00030297096,0.0005741741,0.00017553187,0.0029556921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927443,0.0018751583,0.0006412114,0.00089830806,0.0029841573,0.00085690187],"domain_scores_gemma":[0.98880774,0.004284684,0.0008130871,0.0048479238,0.0009589698,0.00028757355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004111444,0.00066648854,0.001387976,0.00090144377,0.0009780751,0.0031606578,0.0020940565,0.0015537611,0.0049479883],"category_scores_gemma":[0.012982638,0.00048114292,0.0012166128,0.0013724059,0.0015285668,0.006877369,0.0054829526,0.0022646529,0.0016139523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034193574,0.00066062884,0.005436587,0.00063697493,0.0002609944,0.0010490936,0.0012465715,0.19976988,0.05630843,0.4524098,0.01495611,0.26384556],"study_design_scores_gemma":[0.00023750745,0.00024010713,0.00053663173,0.00007039318,0.00004889464,0.00044919478,0.00017556564,0.7473869,0.040295333,0.20351891,0.006959063,0.000081472],"about_ca_topic_score_codex":0.0005547707,"about_ca_topic_score_gemma":0.0004813014,"teacher_disagreement_score":0.0049479883,"about_ca_system_score_codex":0.0017038616,"about_ca_system_score_gemma":0.0020717385,"threshold_uncertainty_score":0.021743655},"labels":[],"label_agreement":null},{"id":"W3213827288","doi":"10.1145/3460120.3484557","title":"Secure Multi-party Computation of Differentially Private Heavy Hitters","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"H2020 Industrial Leadership; European Commission","keywords":"Computer science; Mobile device; Computation; Computer security; World Wide Web; Programming language","score_opus":0.019031821282146675,"score_gpt":0.25478475370552134,"score_spread":0.23575293242337467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213827288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19508924,0.0007351553,0.7878406,0.0029657502,0.0002464742,0.00019554958,0.0011505774,0.0029010435,0.008875568],"genre_scores_gemma":[0.96146303,0.00013295027,0.033408366,0.00034392453,0.0001373148,0.00013848735,0.00042738405,0.00011129852,0.0038373717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925922,0.0019901523,0.00043808267,0.0015129643,0.0018474716,0.0016192799],"domain_scores_gemma":[0.98103184,0.009763598,0.0010565628,0.0065974155,0.00092111906,0.0006295021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041111982,0.00083054905,0.0022927981,0.0008353795,0.0017030833,0.0038382658,0.0027357747,0.0020061715,0.0059620976],"category_scores_gemma":[0.019773437,0.00073965895,0.0013103456,0.0016778246,0.002839955,0.0062840628,0.0084146205,0.0031884992,0.0022857625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066450615,0.0004340641,0.0055839377,0.00051714806,0.00043181432,0.0010788082,0.0009411668,0.28780434,0.022351092,0.52469355,0.018057428,0.13146164],"study_design_scores_gemma":[0.00028913238,0.00013828962,0.00040256087,0.00003921828,0.00004483039,0.000240149,0.00006425062,0.5577946,0.010358375,0.42893398,0.001648798,0.00004580772],"about_ca_topic_score_codex":0.00063030625,"about_ca_topic_score_gemma":0.00088355545,"teacher_disagreement_score":0.0059620976,"about_ca_system_score_codex":0.0021913345,"about_ca_system_score_gemma":0.002539787,"threshold_uncertainty_score":0.021742344},"labels":[],"label_agreement":null},{"id":"W3215025367","doi":"10.2478/popets-2022-0021","title":"Privacy-preserving FairSwap: Fairness and privacy interplay","year":2021,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Computer security; Swap (finance); Universal composability; Confidentiality; Internet privacy; Cryptography; Composability; Protocol (science); Cryptographic protocol; Business","score_opus":0.013471505558433886,"score_gpt":0.2568485977791237,"score_spread":0.24337709222068984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215025367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044322733,0.00013675667,0.94812745,0.00089910306,0.000090511494,0.00016312933,0.000098787474,0.00097269134,0.005188805],"genre_scores_gemma":[0.82112306,0.00013587347,0.17222519,0.00037196858,0.0001430329,0.00019282913,0.000107127,0.00015865853,0.005542252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98899394,0.0043524173,0.00063155347,0.0019265445,0.0027825546,0.0013129549],"domain_scores_gemma":[0.9788031,0.009572393,0.00090352533,0.008168462,0.0017673676,0.00078519183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01209957,0.00059633394,0.001363667,0.00091284636,0.0033388394,0.0045163333,0.0027885414,0.0016727111,0.0046881353],"category_scores_gemma":[0.02250772,0.00066873804,0.00130752,0.0014023874,0.0061733285,0.008667746,0.007101783,0.0035317542,0.00064595364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005948715,0.00014908312,0.0012021802,0.00011398225,0.000066865185,0.00029630627,0.00065534073,0.049226318,0.0080542285,0.8893743,0.002737116,0.047529377],"study_design_scores_gemma":[0.00009136646,0.00007460136,0.00019018177,0.000025027415,0.000057037505,0.00018950917,0.0000779032,0.35816857,0.013706506,0.61999846,0.007377243,0.00004368769],"about_ca_topic_score_codex":0.0021922896,"about_ca_topic_score_gemma":0.0012569502,"teacher_disagreement_score":0.01209957,"about_ca_system_score_codex":0.0025093725,"about_ca_system_score_gemma":0.0044255387,"threshold_uncertainty_score":0.0639894},"labels":[],"label_agreement":null},{"id":"W3215622318","doi":"10.2478/popets-2022-0027","title":"Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier","year":2021,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Zero-knowledge proof; Hash function; Gas meter prover; Discrete mathematics; Computer science; Function (biology); Zero (linguistics); Argument (complex analysis); Arithmetic; Mathematics; Combinatorics; Theoretical computer science; Cryptography; Algorithm; Programming language; Mathematical proof","score_opus":0.02300912344232564,"score_gpt":0.26497746243344783,"score_spread":0.2419683389911222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215622318","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0206687,0.0002845401,0.95028937,0.0012415276,0.00020665959,0.00050159125,0.0006961245,0.013682246,0.012429287],"genre_scores_gemma":[0.59959865,0.00042944693,0.37816355,0.0009596769,0.00024709734,0.0007472789,0.001532197,0.0024631706,0.015858883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99173707,0.0026555029,0.0004732183,0.0010393289,0.003237302,0.00085755304],"domain_scores_gemma":[0.9884925,0.005547193,0.00062722806,0.0041943085,0.0007890698,0.00034976733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005527836,0.000983775,0.0014746245,0.0013478243,0.0014397805,0.0053543546,0.0040434506,0.0026302175,0.022711024],"category_scores_gemma":[0.015869375,0.00103324,0.0019900564,0.0011790656,0.0034396693,0.010204319,0.008984728,0.0056605362,0.006130133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018278647,0.00032683075,0.00092355855,0.0007529595,0.00016061151,0.00051502103,0.0007569367,0.037822865,0.027684186,0.7862933,0.017740631,0.12519516],"study_design_scores_gemma":[0.00044269962,0.00024800797,0.00027047057,0.00018140378,0.0001042928,0.00030031928,0.00014992233,0.42286262,0.066420294,0.47847193,0.030396516,0.0001515668],"about_ca_topic_score_codex":0.0009198231,"about_ca_topic_score_gemma":0.000835966,"teacher_disagreement_score":0.022711024,"about_ca_system_score_codex":0.0028708023,"about_ca_system_score_gemma":0.0028003545,"threshold_uncertainty_score":0.075975895},"labels":[],"label_agreement":null},{"id":"W3216458761","doi":"10.1109/itw48936.2021.9611471","title":"Hybrid Encryption in Correlated Randomness Model","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Key encapsulation; Encryption; Computer science; Ciphertext; Theoretical computer science; Key (lock); Attribute-based encryption; Ciphertext indistinguishability; Probabilistic encryption; Key generation; Hybrid cryptosystem; Pseudorandom number generator; Deterministic encryption; Symmetric-key algorithm; Public-key cryptography; Algorithm; Mathematics; Computer security; Statistics","score_opus":0.011145273813322825,"score_gpt":0.22408493857324996,"score_spread":0.21293966475992712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216458761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050807506,0.0002769897,0.9371404,0.00061906676,0.000066367815,0.0001750815,0.00025221932,0.0002068873,0.010455427],"genre_scores_gemma":[0.8818389,0.00045864977,0.10790264,0.0002842083,0.00009692736,0.0003747761,0.00028156416,0.00006560573,0.008696791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946516,0.002053347,0.00028602954,0.00076654897,0.0015314679,0.00071105245],"domain_scores_gemma":[0.99603844,0.0015170044,0.00040862514,0.0014496992,0.00041987762,0.00016637765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031026793,0.00069703197,0.0012677418,0.0007237407,0.0008972085,0.0022800246,0.0021620092,0.0014023728,0.0027732698],"category_scores_gemma":[0.0035147052,0.00039359528,0.0015198714,0.0011583031,0.0026947432,0.005869605,0.0029084035,0.002382465,0.0006962844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005872085,0.000025300458,0.00022081948,0.00003901105,0.000025152262,0.00020342125,0.00011636745,0.028710984,0.002050075,0.965965,0.0004970116,0.0020880005],"study_design_scores_gemma":[0.00006954045,0.0000843786,0.00019859412,0.000021216347,0.00003677495,0.0002956762,0.000065988555,0.49227488,0.0035507951,0.49940115,0.0039497986,0.000051223473],"about_ca_topic_score_codex":0.0010943229,"about_ca_topic_score_gemma":0.00073549786,"teacher_disagreement_score":0.0031026793,"about_ca_system_score_codex":0.0017919367,"about_ca_system_score_gemma":0.00155912,"threshold_uncertainty_score":0.016408682},"labels":[],"label_agreement":null},{"id":"W3216567109","doi":"10.5383/juspn.15.02.006","title":"An Effective and Efficient Framework for Fast Privacy-Preserving Keyword Search on Encrypted Outsourced Cloud Data","year":2021,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Encryption; Cloud computing; Keyword search; Information retrieval; Database; Service provider; Service (business); Computer security; Operating system","score_opus":0.03049799837850337,"score_gpt":0.3047207283369527,"score_spread":0.2742227299584493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216567109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009592275,0.00040330697,0.9864942,0.00024394735,0.000040024643,0.00022301803,0.00030184354,0.0018753872,0.0008258734],"genre_scores_gemma":[0.3829517,0.00079596444,0.6106584,0.00021045952,0.00010437098,0.00034414994,0.0010595304,0.00026455376,0.003610794],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9954691,0.00082401594,0.00045332225,0.0006255946,0.002133027,0.00049495965],"domain_scores_gemma":[0.99618995,0.0008515862,0.00032734594,0.0017699867,0.0006971784,0.00016393344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026965598,0.00074075157,0.0018894784,0.0017412638,0.0010932012,0.0031692237,0.002325897,0.0012903762,0.0023718702],"category_scores_gemma":[0.006693609,0.00065410003,0.001428022,0.002788169,0.0012303718,0.007687691,0.0035370672,0.0014889373,0.0014680875],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001539055,0.00058386364,0.0038444928,0.000644991,0.0002472805,0.0011540024,0.0007286688,0.29179102,0.05080122,0.26368874,0.022336178,0.36264044],"study_design_scores_gemma":[0.0000811405,0.0001444808,0.0002549492,0.000022829832,0.00004168315,0.0006481673,0.00012325446,0.9301821,0.01155853,0.04872391,0.008163041,0.000056015644],"about_ca_topic_score_codex":0.008330593,"about_ca_topic_score_gemma":0.0068981946,"teacher_disagreement_score":0.008330593,"about_ca_system_score_codex":0.0020446116,"about_ca_system_score_gemma":0.005074829,"threshold_uncertainty_score":0.01656419},"labels":[],"label_agreement":null},{"id":"W3216694898","doi":"10.1145/3491086.3492469","title":"A zero-knowledge proof system for OpenLibra","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Zero-knowledge proof; Mathematical proof; Blockchain; Computer science; Proof of concept; Database transaction; Cryptocurrency; Template; Cash; Computer security; Theoretical computer science; Data science; Cryptography; Mathematics; Programming language; Business; Operating system; Finance","score_opus":0.022867229685585744,"score_gpt":0.26232815351337496,"score_spread":0.23946092382778922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216694898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075162216,0.00039311734,0.9645606,0.0006932752,0.00024677208,0.0003576801,0.00024237488,0.012222041,0.013767839],"genre_scores_gemma":[0.28621176,0.0006886037,0.6826188,0.00087177753,0.0004063192,0.0008133629,0.0010341601,0.002492306,0.02486298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933357,0.002062683,0.00063290755,0.0008916392,0.0024460722,0.0006309044],"domain_scores_gemma":[0.991178,0.003734186,0.0005788153,0.0027973617,0.0011408153,0.0005708095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057111634,0.0005706311,0.0010981618,0.0012665965,0.0018474286,0.007210279,0.0034751613,0.0023452535,0.013190551],"category_scores_gemma":[0.0152157415,0.000999336,0.0012790121,0.00092885335,0.0039311126,0.010215175,0.0117959,0.0051071495,0.007372303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035309172,0.00025411393,0.0005380284,0.00057279796,0.00005957111,0.0006012866,0.0011093802,0.00916451,0.01599186,0.85576254,0.010356044,0.10523674],"study_design_scores_gemma":[0.0002980027,0.00030866393,0.00028747343,0.0004069052,0.00009622136,0.0012385529,0.00017644124,0.12609054,0.0480557,0.54988873,0.27294204,0.00021070783],"about_ca_topic_score_codex":0.0005620645,"about_ca_topic_score_gemma":0.0005414315,"teacher_disagreement_score":0.013190551,"about_ca_system_score_codex":0.001327459,"about_ca_system_score_gemma":0.0030371174,"threshold_uncertainty_score":0.04412675},"labels":[],"label_agreement":null},{"id":"W3216908060","doi":"10.1109/tcc.2021.3131287","title":"Efficient and Privacy-Preserving Similar Patients Query Scheme Over Outsourced Genomic Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Outsourcing; Server; Security analysis; Tree (set theory); Information privacy; Query optimization; Scheme (mathematics); Cryptography; Computer security; Database; Computer network","score_opus":0.02638046970385046,"score_gpt":0.25847261499864194,"score_spread":0.23209214529479147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216908060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14683397,0.0014265032,0.8392717,0.0019191843,0.00017990243,0.000761334,0.002169087,0.0014995374,0.005938865],"genre_scores_gemma":[0.9027933,0.00055269036,0.091268204,0.0004969953,0.00008258385,0.000192371,0.0013012532,0.000064115375,0.0032485027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937065,0.0014020529,0.00056531705,0.0009440871,0.0023287707,0.0010532484],"domain_scores_gemma":[0.9952336,0.0010156484,0.00058516493,0.002118241,0.00073519,0.00031220104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025574737,0.00046656514,0.0014976306,0.0010028281,0.0013938826,0.0018414302,0.0019518511,0.0012497081,0.0021473598],"category_scores_gemma":[0.006231421,0.0003121399,0.001212078,0.0033479487,0.0010568373,0.004735497,0.0041915104,0.0013189411,0.0007359851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00489683,0.0007459546,0.013639748,0.00080348906,0.00045508033,0.0025191195,0.0031249532,0.13341951,0.08952642,0.31705087,0.0282525,0.40556544],"study_design_scores_gemma":[0.00061469903,0.0008320226,0.004752514,0.0000755452,0.00026454232,0.005744488,0.0013815471,0.739079,0.06133017,0.1538326,0.031816594,0.00027626724],"about_ca_topic_score_codex":0.002792804,"about_ca_topic_score_gemma":0.0017414687,"teacher_disagreement_score":0.002792804,"about_ca_system_score_codex":0.0017886865,"about_ca_system_score_gemma":0.003220111,"threshold_uncertainty_score":0.013525367},"labels":[],"label_agreement":null},{"id":"W3217202355","doi":"10.1145/3486609.3487205","title":"HACCLE: metaprogramming for secure multi-party computation","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Intelligence Advanced Research Projects Activity; NIH Office of the Director; Office of the Director of National Intelligence","keywords":"Computer science; Cryptography; Secure multi-party computation; Metaprogramming; Java; Computation; Class (philosophy); Computer security; Distributed computing; Programming language; Artificial intelligence","score_opus":0.03951224209862809,"score_gpt":0.3039421432383307,"score_spread":0.2644299011397026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217202355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003528944,0.00059888174,0.9730978,0.0003837717,0.00017163856,0.0001294394,0.00018580654,0.013748774,0.008154922],"genre_scores_gemma":[0.2115634,0.0009825927,0.7655305,0.0009997676,0.00028334284,0.0010619513,0.0008688418,0.004478285,0.014231218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982768,0.00062411634,0.00013075852,0.00023190206,0.0005067782,0.0002295028],"domain_scores_gemma":[0.99744296,0.0010451371,0.0001429534,0.001055828,0.00017645102,0.00013666817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029910153,0.000860468,0.00068231265,0.0006851625,0.0009199699,0.0023131191,0.0020811697,0.0011870165,0.009750688],"category_scores_gemma":[0.004623543,0.00071835006,0.0014542319,0.00075518,0.0020882257,0.004321979,0.0030226847,0.003564517,0.003334735],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057938136,0.00016002718,0.000959343,0.0007809164,0.00012542757,0.00033405592,0.0004029822,0.056585077,0.013571663,0.72294784,0.037202932,0.16635042],"study_design_scores_gemma":[0.00014481627,0.0001352626,0.00027174412,0.00020093212,0.000055461547,0.00034414683,0.000062097344,0.35499,0.018169021,0.4650274,0.16052127,0.000077812234],"about_ca_topic_score_codex":0.0007905855,"about_ca_topic_score_gemma":0.0012213413,"teacher_disagreement_score":0.009750688,"about_ca_system_score_codex":0.0010514321,"about_ca_system_score_gemma":0.0013392708,"threshold_uncertainty_score":0.032619298},"labels":[],"label_agreement":null},{"id":"W3217711427","doi":"10.5195/ledger.2021.239","title":"A Decentralized Identity-Based Blockchain Solution for Privacy-Preserving Licensing of Individual-Controlled Data to Prevent Unauthorized Secondary Data Usage","year":2021,"lang":"en","type":"article","venue":"Ledger","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Identity management; Encryption; Data sharing; Trusted third party; Information privacy; Scalability; Authentication (law); Data integrity; Data management; Access control; Database","score_opus":0.08590079576805562,"score_gpt":0.3396634986113576,"score_spread":0.25376270284330193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217711427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029170781,0.00031503435,0.95112514,0.0009839099,0.00014176668,0.00034520339,0.000107095635,0.0013292199,0.016481759],"genre_scores_gemma":[0.7155136,0.00042094226,0.24645732,0.0003928964,0.00007730231,0.0003820093,0.0002605374,0.0001252746,0.03637012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860305,0.00033853736,0.000068515845,0.0002257415,0.00057954126,0.00018467162],"domain_scores_gemma":[0.99891627,0.00019203045,0.00012315807,0.00034606297,0.00025955713,0.0001629421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013357933,0.0002641565,0.0003561102,0.00042585272,0.0011795335,0.0013388246,0.0013794998,0.0012392954,0.0064604864],"category_scores_gemma":[0.001847323,0.00019934405,0.0002737441,0.0005335082,0.00080705935,0.0029327786,0.0025937743,0.0010716665,0.0018830542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066451886,0.0005208517,0.0015855831,0.00043686864,0.000078504214,0.0008826567,0.0011023396,0.068533115,0.07926545,0.433611,0.016957598,0.3963615],"study_design_scores_gemma":[0.00033612616,0.0007507309,0.0005864409,0.00013160592,0.00005994957,0.0011058181,0.00031223186,0.6294477,0.0614112,0.14115378,0.16459626,0.00010809792],"about_ca_topic_score_codex":0.0009471925,"about_ca_topic_score_gemma":0.0014422286,"teacher_disagreement_score":0.0064604864,"about_ca_system_score_codex":0.0008078145,"about_ca_system_score_gemma":0.0024126228,"threshold_uncertainty_score":0.021612465},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04780136964815156,"score_gpt":0.2858845172483337,"score_spread":0.23808314760018212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34785529","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009805077,0.0021238206,0.9358369,0.0029410506,0.0003652565,0.00040018177,0.000357171,0.0005515987,0.04761893],"genre_scores_gemma":[0.64275956,0.00448968,0.31248242,0.0011436892,0.000582651,0.0007098781,0.0007326126,0.00023320934,0.036866296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99283534,0.0025525624,0.0004396529,0.0011421912,0.0023490523,0.0006811735],"domain_scores_gemma":[0.9908194,0.0026615108,0.000498901,0.00522388,0.0004355694,0.0003606597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004303315,0.0010136724,0.0013953621,0.00072270865,0.0015435698,0.003634978,0.0026874114,0.001928841,0.011468014],"category_scores_gemma":[0.008896807,0.00074535666,0.0018448716,0.0019234648,0.003733004,0.007441579,0.0075073433,0.004452041,0.0028136682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061309824,0.000047910795,0.0003085562,0.0002922555,0.000041398856,0.0001716529,0.00021313912,0.01314001,0.0016311908,0.95848346,0.0029253354,0.022683876],"study_design_scores_gemma":[0.000031724187,0.00006118766,0.00018361927,0.0001016134,0.00003584709,0.00039215095,0.00009538716,0.12226203,0.0043382864,0.8295241,0.042948905,0.000025123438],"about_ca_topic_score_codex":0.0007997425,"about_ca_topic_score_gemma":0.0008491183,"teacher_disagreement_score":0.011468014,"about_ca_system_score_codex":0.0024802622,"about_ca_system_score_gemma":0.0025559245,"threshold_uncertainty_score":0.03836435},"labels":[],"label_agreement":null},{"id":"W360525378","doi":"","title":"Efficient Privacy Preserving Set Operations (情報セキュリティ)","year":2011,"lang":"en","type":"article","venue":"India Software Engineering Conference","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Set (abstract data type); Information privacy; Computer security; Programming language","score_opus":0.03137190091532279,"score_gpt":0.22512775929126524,"score_spread":0.19375585837594245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W360525378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055042308,0.00039867987,0.9327684,0.0005594523,0.00016742788,0.00022821363,0.0005517813,0.001395052,0.008888784],"genre_scores_gemma":[0.5687536,0.0003937079,0.4182294,0.0003016656,0.00019571358,0.00025379442,0.0009053131,0.000183137,0.010783647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965867,0.00068323885,0.00025968312,0.00053140963,0.0013534903,0.00058547227],"domain_scores_gemma":[0.99623364,0.0012342825,0.0002772083,0.0017246851,0.00037929398,0.00015091286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015815729,0.0007119665,0.0011988408,0.0008759884,0.0009032092,0.0030281038,0.0017111803,0.0011482468,0.004166703],"category_scores_gemma":[0.003913067,0.0005708718,0.0013424436,0.0018601508,0.0013750343,0.004266312,0.0038809483,0.00280607,0.001483341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012885516,0.00056064606,0.0010042866,0.00040393005,0.00014098149,0.00024132534,0.00040076106,0.056471672,0.028831149,0.45410043,0.012217495,0.44433874],"study_design_scores_gemma":[0.00012649872,0.0005113287,0.0005856799,0.00004465357,0.00010021303,0.000681613,0.00014332419,0.2828572,0.042552598,0.6581126,0.014212024,0.000072259594],"about_ca_topic_score_codex":0.0006136956,"about_ca_topic_score_gemma":0.0006079829,"teacher_disagreement_score":0.004166703,"about_ca_system_score_codex":0.0008571012,"about_ca_system_score_gemma":0.0016104548,"threshold_uncertainty_score":0.013938963},"labels":[],"label_agreement":null},{"id":"W36205663","doi":"","title":"Attribute-Based Encryption with Key Cloning Protection.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Encryption; Computer science; Security token; Computer security; Attribute-based encryption; Probabilistic encryption; Scheme (mathematics); Key (lock); Ciphertext; Delegation; Theoretical computer science; Public-key cryptography; Mathematics; Law; Political science","score_opus":0.02518052485577259,"score_gpt":0.23503246103927405,"score_spread":0.20985193618350145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36205663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024267795,0.0016784283,0.95883524,0.0016746215,0.00037690287,0.00023292062,0.00021844296,0.000429378,0.012286328],"genre_scores_gemma":[0.7902995,0.001333208,0.19566283,0.0006599223,0.000281811,0.0002965408,0.00029567807,0.00006192072,0.011108578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99408865,0.0020437744,0.0005220467,0.0005740868,0.002402662,0.00036875738],"domain_scores_gemma":[0.9896498,0.0028892714,0.0011915051,0.0051439144,0.00077714643,0.00034842626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041317367,0.00037907326,0.00091757445,0.00056007784,0.001106233,0.0030558896,0.0021017801,0.0016882047,0.0029336265],"category_scores_gemma":[0.0105990935,0.00036775743,0.0009820758,0.0017277638,0.002328573,0.0069113225,0.0033379523,0.0034485545,0.0014536628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003184881,0.00007976145,0.00094058935,0.00028070514,0.000069897826,0.00041872376,0.00041080473,0.008419075,0.009112581,0.9345555,0.0031072607,0.042286765],"study_design_scores_gemma":[0.0001968385,0.0002558675,0.00076595874,0.0002049029,0.00017444948,0.0031327012,0.00020850373,0.16930023,0.04767739,0.69034123,0.087654896,0.00008694215],"about_ca_topic_score_codex":0.000252824,"about_ca_topic_score_gemma":0.00014125004,"teacher_disagreement_score":0.0041317367,"about_ca_system_score_codex":0.0013855294,"about_ca_system_score_gemma":0.0013616729,"threshold_uncertainty_score":0.021850944},"labels":[],"label_agreement":null},{"id":"W377584222","doi":"10.1007/978-3-319-17957-5_12","title":"Efficient Privacy-Preserving Identity Scheme for Electronic Validation of Phase 1 Clinical Trials","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Children's Hospital of Eastern Ontario; University of Ottawa","funders":"","keywords":"Identity (music); Scheme (mathematics); Representation (politics); Clinical trial; Computer science; Internet privacy; Drug trial; Computer security; Phase (matter); Medicine; Political science; Mathematics; Law","score_opus":0.1058539292591914,"score_gpt":0.4028307970031386,"score_spread":0.2969768677439472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W377584222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024573097,0.0008010449,0.964749,0.0010485075,0.000259659,0.0005591811,0.00094313995,0.0012480658,0.005818383],"genre_scores_gemma":[0.72737706,0.00051247637,0.26201734,0.0005186266,0.0002494869,0.0005643806,0.001505823,0.00010680344,0.0071479953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98070854,0.0108060585,0.0013360013,0.0016706842,0.0039303415,0.0015482729],"domain_scores_gemma":[0.9678789,0.013999572,0.0021739767,0.013189022,0.0021772713,0.0005813454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012833742,0.00064690365,0.002099758,0.0013768644,0.0016211801,0.003966384,0.0029495626,0.0024801404,0.0052968175],"category_scores_gemma":[0.03368982,0.0007189976,0.0014264149,0.002030501,0.0014322597,0.0052938284,0.0057636364,0.002971555,0.0023811574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037004647,0.00043590838,0.0030276775,0.0006171589,0.00043620844,0.0006896129,0.0007838057,0.078770995,0.0241376,0.41497445,0.017026713,0.45539945],"study_design_scores_gemma":[0.00052028074,0.00061707693,0.0013199337,0.00015820446,0.00020229565,0.0016172597,0.00022309533,0.51432455,0.030919313,0.43174955,0.018211212,0.00013725969],"about_ca_topic_score_codex":0.00040190876,"about_ca_topic_score_gemma":0.00039504023,"teacher_disagreement_score":0.012833742,"about_ca_system_score_codex":0.0017064625,"about_ca_system_score_gemma":0.004382917,"threshold_uncertainty_score":0.06787217},"labels":[],"label_agreement":null},{"id":"W4200104696","doi":"10.1155/2021/7941233","title":"Achieve Efficient and Privacy-Preserving Compound Substring Query over Cloud","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Substring; Computer science; Homomorphic encryption; Encryption; Cloud computing; Theoretical computer science; Heap (data structure); Data mining; Data structure; Computer security; Algorithm","score_opus":0.009903673948360971,"score_gpt":0.23106778857178134,"score_spread":0.22116411462342037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200104696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13650651,0.0010887845,0.85507554,0.0005613669,0.000082794824,0.00032269544,0.00059515674,0.0017383016,0.004028778],"genre_scores_gemma":[0.8750269,0.00049579353,0.12090983,0.00021510235,0.00006677364,0.00010794344,0.0005848103,0.000056201323,0.002536631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973616,0.00035006757,0.00027548615,0.00038470433,0.0010770105,0.00055111764],"domain_scores_gemma":[0.996678,0.0008807444,0.000366302,0.0013886289,0.00051490957,0.00017140844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015602495,0.0005478102,0.0016300024,0.0009748135,0.0012929179,0.0016660169,0.0013433383,0.00094562856,0.0014980722],"category_scores_gemma":[0.0036273645,0.0002436611,0.0007903516,0.0023955465,0.00073094486,0.0051559852,0.0031289537,0.0010003748,0.00063035515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031440656,0.000808994,0.009352864,0.00065825525,0.00028360198,0.0015368076,0.0013900383,0.11361581,0.18412293,0.16406965,0.015700733,0.5053162],"study_design_scores_gemma":[0.00017565355,0.00048523836,0.0016594684,0.000031388903,0.000099459816,0.0016665305,0.0004073423,0.8155931,0.11378278,0.053720433,0.012283312,0.00009518176],"about_ca_topic_score_codex":0.0018355455,"about_ca_topic_score_gemma":0.0013405221,"teacher_disagreement_score":0.0018355455,"about_ca_system_score_codex":0.0010199536,"about_ca_system_score_gemma":0.0024520762,"threshold_uncertainty_score":0.008251548},"labels":[],"label_agreement":null},{"id":"W4200366918","doi":"10.1109/pst52912.2021.9647830","title":"EPSim-GS: Efficient and Privacy-Preserving Similarity Range Query over Genomic Sequences","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of New Brunswick","funders":"National Research Council","keywords":"Computer science; Homomorphic encryption; Paillier cryptosystem; Hash function; Encryption; Similarity (geometry); Locality-sensitive hashing; Range query (database); Cloud computing; Data mining; Server; Nearest neighbor search; Theoretical computer science; Hash table; Information retrieval; Cryptosystem; Web search query; Search engine; Computer security; Artificial intelligence; Web query classification; Computer network","score_opus":0.016918895520420467,"score_gpt":0.24629492845394965,"score_spread":0.22937603293352918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200366918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11685497,0.0011235519,0.86935335,0.0010573663,0.00014668217,0.0006227482,0.0016066663,0.0035826522,0.0056520198],"genre_scores_gemma":[0.81765014,0.0005644586,0.17453928,0.000513916,0.00011248597,0.00028582694,0.002221394,0.00009287127,0.0040196106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964736,0.0006199772,0.00032791102,0.0005770097,0.0015701767,0.00043140675],"domain_scores_gemma":[0.99643445,0.00083996606,0.00036215247,0.001774055,0.0004174237,0.00017196753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002025636,0.0005651784,0.0012592665,0.0011813506,0.0008834633,0.0015253143,0.0018727187,0.0013185316,0.0019478459],"category_scores_gemma":[0.005578862,0.00028857013,0.00086262997,0.0026729552,0.0012099082,0.00471141,0.0053895037,0.0013248009,0.00070886506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036468322,0.0006431798,0.008134359,0.00073133584,0.00032974264,0.00164183,0.0014600412,0.13236107,0.13861687,0.20756777,0.022102352,0.48276463],"study_design_scores_gemma":[0.0005312645,0.00096797996,0.0032492403,0.00005506199,0.00011330475,0.0026478332,0.0007846898,0.7421545,0.114872895,0.10420089,0.030224293,0.00019807284],"about_ca_topic_score_codex":0.0014599729,"about_ca_topic_score_gemma":0.000943474,"teacher_disagreement_score":0.002025636,"about_ca_system_score_codex":0.0011335036,"about_ca_system_score_gemma":0.001981718,"threshold_uncertainty_score":0.010712683},"labels":[],"label_agreement":null},{"id":"W4200435041","doi":"10.1109/pst52912.2021.9647740","title":"Updatable Linear Map Commitments and Their Applications in Elementary Databases","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Commit; Computer science; Feature (linguistics); Database; Property (philosophy); The Internet; Theoretical computer science; Computer security; World Wide Web","score_opus":0.023193347367560617,"score_gpt":0.27086821065230987,"score_spread":0.24767486328474925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200435041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03808707,0.00062287925,0.947773,0.0007160615,0.00010624943,0.00018361861,0.00014753087,0.0015131023,0.010850519],"genre_scores_gemma":[0.73308706,0.0008776876,0.25467184,0.00029861764,0.0001581791,0.00030214843,0.00026009924,0.0003009468,0.010043483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966552,0.00087383756,0.00024294558,0.0005059338,0.0013199273,0.00040197233],"domain_scores_gemma":[0.9937309,0.002340189,0.00035666095,0.0028228888,0.00055430975,0.00019512382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025919173,0.00059311173,0.00067020964,0.0007969969,0.0010735681,0.002653043,0.002087134,0.0011614935,0.005483943],"category_scores_gemma":[0.008226479,0.0006506271,0.00069375546,0.0015716539,0.0028321822,0.0067235595,0.005245023,0.003439897,0.0014224829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048420156,0.00010611167,0.0010298608,0.00028484265,0.000033356766,0.0003950212,0.0007410276,0.027143488,0.013078367,0.8367343,0.0027927936,0.117176615],"study_design_scores_gemma":[0.00014221997,0.00035788142,0.00052868953,0.00013160262,0.00007277199,0.0009166702,0.0004836934,0.26833087,0.088638686,0.58933854,0.050918367,0.00013993336],"about_ca_topic_score_codex":0.0006993555,"about_ca_topic_score_gemma":0.00043931222,"teacher_disagreement_score":0.005483943,"about_ca_system_score_codex":0.0013607058,"about_ca_system_score_gemma":0.0011392697,"threshold_uncertainty_score":0.018345654},"labels":[],"label_agreement":null},{"id":"W4200538585","doi":"10.1007/s11432-020-2940-8","title":"Labrador: towards fair and auditable data sharing in cloud computing with long-term privacy","year":2021,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computer security; Collusion; Cloud computing; Verifiable secret sharing; Encryption; Homomorphic encryption; Data sharing; Information privacy; Leverage (statistics); Incentive; Task (project management); Adversary; Internet privacy; Business","score_opus":0.037862471598246905,"score_gpt":0.30471055108909045,"score_spread":0.26684807949084355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200538585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037745893,0.00093012035,0.93860936,0.0037491394,0.000488827,0.00063067937,0.00036813522,0.008167122,0.009310745],"genre_scores_gemma":[0.70819527,0.00046930264,0.26977256,0.0015647076,0.00021531511,0.00027733782,0.0005786289,0.0006881015,0.01823878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98534214,0.006105602,0.0006022576,0.0015974739,0.0040803854,0.0022720883],"domain_scores_gemma":[0.98366934,0.0025106561,0.00092868373,0.00991639,0.001833093,0.0011418256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014660712,0.0008825324,0.0021711004,0.0010804938,0.0030265255,0.0075850333,0.0050367727,0.0027241495,0.0067246268],"category_scores_gemma":[0.020350784,0.0008175475,0.0010952428,0.0015827578,0.0038689005,0.013626673,0.014055464,0.0054285596,0.0027298697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047731823,0.0011148104,0.003110924,0.00045652632,0.0003460847,0.00072959834,0.0010348757,0.06234464,0.021416876,0.6010222,0.047914427,0.25573584],"study_design_scores_gemma":[0.00027329338,0.00035778666,0.00051500695,0.00010902442,0.00007890231,0.0004138266,0.000403205,0.6496292,0.023280703,0.29625824,0.028547883,0.00013292152],"about_ca_topic_score_codex":0.0030718062,"about_ca_topic_score_gemma":0.0033356037,"teacher_disagreement_score":0.014660712,"about_ca_system_score_codex":0.002402029,"about_ca_system_score_gemma":0.007898062,"threshold_uncertainty_score":0.0775342},"labels":[],"label_agreement":null},{"id":"W4200554845","doi":"10.3390/a14120362","title":"Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Norm (philosophy); Mathematics; Algorithm; Lattice problem; Computer science; Combinatorics; Mathematical optimization; Discrete mathematics","score_opus":0.021799614808538828,"score_gpt":0.25792646635235533,"score_spread":0.23612685154381652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200554845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018948672,0.00057172636,0.9682916,0.0009327139,0.00015649645,0.00014523721,0.00030241755,0.0023725643,0.00827861],"genre_scores_gemma":[0.20137559,0.0006542757,0.78663254,0.00057028397,0.00025024934,0.00049607194,0.0018667799,0.0009236046,0.0072305533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543023,0.0009702473,0.00036060426,0.0009938531,0.0016402785,0.0006048074],"domain_scores_gemma":[0.9919958,0.004106785,0.0006668819,0.0021382594,0.0007972707,0.00029509317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688773,0.0016547471,0.001938909,0.0012191347,0.0015332301,0.0031011943,0.002977939,0.0015774056,0.012048613],"category_scores_gemma":[0.014387047,0.00078060286,0.0021859559,0.0023878033,0.0019420506,0.009848908,0.004335284,0.0057152803,0.003884405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010416119,0.0005867155,0.0014185172,0.00097125856,0.00016723065,0.00017134586,0.0006515099,0.21388823,0.011739359,0.38328105,0.027689818,0.3583933],"study_design_scores_gemma":[0.0002512697,0.00014300145,0.00022437333,0.000063610285,0.000031651987,0.00018400032,0.00017004464,0.5167359,0.007516301,0.46277827,0.011843282,0.000058314712],"about_ca_topic_score_codex":0.0016306333,"about_ca_topic_score_gemma":0.0020952187,"teacher_disagreement_score":0.012048613,"about_ca_system_score_codex":0.002137241,"about_ca_system_score_gemma":0.0025288514,"threshold_uncertainty_score":0.04030657},"labels":[],"label_agreement":null},{"id":"W4205196355","doi":"10.5539/cis.v15n1p66","title":"Dual Fine-Grained Public-Key Searchable Encryption from Lattices","year":2022,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Keyword search; Scheme (mathematics); Encryption; Access control; Learning with errors; Key (lock); Dual (grammatical number); Public-key cryptography; Delegation; Computer security; Theoretical computer science; Information retrieval","score_opus":0.019533829862051422,"score_gpt":0.2390073405759783,"score_spread":0.21947351071392687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205196355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080846936,0.0006371812,0.9066988,0.0007499185,0.00010157071,0.00022562894,0.0003427083,0.0007334485,0.009663772],"genre_scores_gemma":[0.82444024,0.00031231844,0.1694934,0.00027089537,0.00007367826,0.00025431646,0.0002517816,0.00007835901,0.0048249834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769825,0.00058555097,0.00021954518,0.00034653593,0.0007784562,0.00037165827],"domain_scores_gemma":[0.9978002,0.00063391763,0.00028977645,0.0009173283,0.0001948936,0.00016397216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013508217,0.00038235553,0.0008683069,0.00063854264,0.00076497183,0.0020517998,0.0010242249,0.0009410317,0.002241589],"category_scores_gemma":[0.0035704258,0.00034135135,0.000824945,0.0009399076,0.0021726752,0.0046928655,0.0037649164,0.0020312152,0.000706945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039070216,0.00012106332,0.00042477873,0.00018145924,0.000025718067,0.00024669844,0.00035403325,0.036995247,0.023571583,0.8940112,0.002084153,0.041593295],"study_design_scores_gemma":[0.0002092404,0.00023668984,0.00027893228,0.000059246177,0.00002747342,0.0005727902,0.00011352826,0.3453926,0.026284892,0.61127096,0.015441768,0.00011184558],"about_ca_topic_score_codex":0.0004207356,"about_ca_topic_score_gemma":0.00033631574,"teacher_disagreement_score":0.002241589,"about_ca_system_score_codex":0.0013013051,"about_ca_system_score_gemma":0.0012149098,"threshold_uncertainty_score":0.009441674},"labels":[],"label_agreement":null},{"id":"W4206950731","doi":"10.36227/techrxiv.17283899.v1","title":"A code based hybrid signcryption scheme","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Signcryption; Key encapsulation; Ciphertext; Computer science; Encryption; Code (set theory); McEliece cryptosystem; Theoretical computer science; Ciphertext indistinguishability; Signature (topology); Scheme (mathematics); Hybrid cryptosystem; Semantic security; Public-key cryptography; Mathematics; Symmetric-key algorithm; Attribute-based encryption; Computer network; Malleability; Programming language","score_opus":0.024179432295385675,"score_gpt":0.25516476989993303,"score_spread":0.23098533760454737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206950731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06495289,0.00034288483,0.91179657,0.00079866784,0.00016751033,0.0003950033,0.00058625976,0.0011900241,0.019770104],"genre_scores_gemma":[0.66986233,0.00037510472,0.30025145,0.00050438487,0.00008689444,0.0004362825,0.0008069527,0.00011146395,0.027565217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850696,0.00032184858,0.0001017853,0.00031229432,0.0005466398,0.00021054232],"domain_scores_gemma":[0.99856275,0.00026463525,0.00017136495,0.0005779245,0.00030304203,0.00012027356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009930804,0.0004995065,0.0006071595,0.00067003624,0.0007414914,0.0015675953,0.0012363155,0.0016246538,0.0039461413],"category_scores_gemma":[0.0016483841,0.00021627253,0.0006607333,0.0011583406,0.0012754543,0.0026400879,0.0026213573,0.00155741,0.0016132441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004828453,0.00018275689,0.0009850363,0.00027073827,0.00008158784,0.00055717723,0.00054565736,0.025616484,0.06619404,0.79791874,0.005695893,0.101469114],"study_design_scores_gemma":[0.0004074884,0.00071691873,0.0013364076,0.00012131058,0.00016269818,0.0023625805,0.00014727839,0.385319,0.13285325,0.3460336,0.1302759,0.00026354933],"about_ca_topic_score_codex":0.00055891415,"about_ca_topic_score_gemma":0.00037972466,"teacher_disagreement_score":0.0039461413,"about_ca_system_score_codex":0.00080517546,"about_ca_system_score_gemma":0.0013000316,"threshold_uncertainty_score":0.013201177},"labels":[],"label_agreement":null},{"id":"W4206998261","doi":"10.1109/gcwkshps52748.2021.9682053","title":"Secure Aggregation in Federated Learning via Multiparty Homomorphic Encryption","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Globecom Workshops (GC Wkshps)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Homomorphic encryption; Correctness; Encryption; Node (physics); Homomorphic secret sharing; Scheme (mathematics); Key (lock); Theoretical computer science; Learning with errors; Secure multi-party computation; Aggregate (composite); Distributed computing; Computation; Algorithm; Computer network; Computer security; Mathematics","score_opus":0.011646058689321448,"score_gpt":0.23577560323192823,"score_spread":0.22412954454260678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206998261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03701674,0.00011996453,0.96001935,0.00023145389,0.000027760205,0.000067612105,0.00006405189,0.00085821777,0.0015946857],"genre_scores_gemma":[0.8629906,0.00008179158,0.13453585,0.00010118934,0.000031066378,0.000108131826,0.00007701148,0.00005371374,0.002020619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656856,0.0012432538,0.00025602058,0.0004972436,0.0010051258,0.0004297203],"domain_scores_gemma":[0.9946307,0.0018294054,0.00040891967,0.002526611,0.00044247956,0.00016180144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004263353,0.00038901562,0.0012697744,0.0006421923,0.0010162015,0.0017809015,0.0015284845,0.0011571667,0.0013428854],"category_scores_gemma":[0.006105491,0.00038438002,0.0007637099,0.0010233574,0.0014439353,0.00430465,0.0036899226,0.0017535617,0.00048193792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011428484,0.00037796597,0.002077198,0.00016268724,0.00012786931,0.0006529869,0.00069078105,0.48182583,0.016747372,0.29146037,0.0036672994,0.20106684],"study_design_scores_gemma":[0.00003611981,0.00006630709,0.00022318687,0.000012320514,0.000010698063,0.0001245211,0.000041768453,0.870635,0.009436125,0.118246995,0.0011497379,0.000017234994],"about_ca_topic_score_codex":0.000735528,"about_ca_topic_score_gemma":0.0006026174,"teacher_disagreement_score":0.004263353,"about_ca_system_score_codex":0.0012743755,"about_ca_system_score_gemma":0.001175364,"threshold_uncertainty_score":0.022547066},"labels":[],"label_agreement":null},{"id":"W4210294901","doi":"10.36227/techrxiv.17283899","title":"A code based hybrid signcryption scheme","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Signcryption; Ciphertext; Key encapsulation; Computer science; Code (set theory); Encryption; Theoretical computer science; McEliece cryptosystem; Scheme (mathematics); Signature (topology); Ciphertext indistinguishability; Semantic security; Public-key cryptography; Mathematics; Symmetric-key algorithm; Attribute-based encryption; Computer network; Malleability; Programming language","score_opus":0.024179432295385675,"score_gpt":0.25516476989993303,"score_spread":0.23098533760454737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210294901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066345245,0.00033428348,0.9105624,0.0007719967,0.00016024252,0.00038943742,0.00058349525,0.0011988106,0.019654175],"genre_scores_gemma":[0.6675453,0.00037478402,0.3026381,0.00048082715,0.00008227752,0.00042966104,0.0007891432,0.00010745276,0.027552482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858034,0.00030363086,0.00009616815,0.00029172256,0.000530218,0.00019796133],"domain_scores_gemma":[0.9986324,0.000256208,0.00016545881,0.0005436969,0.00028833642,0.00011389031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009690883,0.0004886108,0.00059466413,0.0006504373,0.0007310692,0.0015489653,0.0012189518,0.0015899074,0.0039094556],"category_scores_gemma":[0.0015818442,0.0002057179,0.0006366601,0.0011480591,0.0012448912,0.0025998051,0.0025563452,0.0014794286,0.0015452133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047688305,0.00018290289,0.0010185319,0.00027266488,0.00008065726,0.00054850464,0.0005456115,0.02586868,0.06786344,0.79240674,0.0056236414,0.105111696],"study_design_scores_gemma":[0.0004044596,0.0007333987,0.001391202,0.00011864436,0.00016303803,0.002340568,0.00015045228,0.3894556,0.13429469,0.34087887,0.1298123,0.00025678534],"about_ca_topic_score_codex":0.0005505423,"about_ca_topic_score_gemma":0.00037942003,"teacher_disagreement_score":0.0039094556,"about_ca_system_score_codex":0.0007823525,"about_ca_system_score_gemma":0.0012778164,"threshold_uncertainty_score":0.013078451},"labels":[],"label_agreement":null},{"id":"W4210816550","doi":"10.1109/globecom46510.2021.9685446","title":"Towards Privacy-Preserving Online Medical Monitoring with Reverse Skyline Query","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Skyline; Upload; Server; Cloud computing; Encryption; Information privacy; Security analysis; Outsourcing; Computer network; Computer security; Data mining; World Wide Web","score_opus":0.05804981012093408,"score_gpt":0.3268422918141902,"score_spread":0.26879248169325615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210816550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036173567,0.00051703455,0.95888203,0.0011518742,0.00006429118,0.00023306152,0.0001576716,0.000872572,0.0019478127],"genre_scores_gemma":[0.84647954,0.00032004833,0.1498339,0.0006239378,0.00016648856,0.000180713,0.00024911226,0.00006236585,0.0020838191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931631,0.0024621703,0.00050904794,0.0011423182,0.0019020952,0.0008212456],"domain_scores_gemma":[0.9889544,0.003666465,0.0015699471,0.004396006,0.0010598315,0.00035330077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050707255,0.0006978615,0.001296952,0.000762723,0.0012889482,0.0025366105,0.0024921729,0.0022348121,0.0013192684],"category_scores_gemma":[0.008746004,0.000536142,0.0011678505,0.0013174847,0.0020264874,0.0076892194,0.0060464386,0.0027453967,0.0005801555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004762522,0.0009435065,0.011155947,0.00074075506,0.0004602864,0.0026345453,0.0036998263,0.12556578,0.15354973,0.35359678,0.015968913,0.32692143],"study_design_scores_gemma":[0.00028034832,0.00050410535,0.0012989374,0.000034831515,0.00013000051,0.002163316,0.0005058986,0.8435884,0.048132833,0.09170163,0.011544227,0.000115428826],"about_ca_topic_score_codex":0.0008662286,"about_ca_topic_score_gemma":0.0004332016,"teacher_disagreement_score":0.0050707255,"about_ca_system_score_codex":0.00088405947,"about_ca_system_score_gemma":0.0017350139,"threshold_uncertainty_score":0.026816905},"labels":[],"label_agreement":null},{"id":"W4212851045","doi":"10.1109/tifs.2022.3152395","title":"Efficient and Privacy-Preserving Similarity Query With Access Control in eHealthcare","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Similarity (geometry); Query optimization; Information retrieval; Information privacy; Query expansion; Data mining; Artificial intelligence; Computer security","score_opus":0.010564409672217816,"score_gpt":0.23399056112468486,"score_spread":0.22342615145246705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212851045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025050292,0.0005214047,0.97026056,0.0006317824,0.000043245404,0.00034545996,0.00023804874,0.0008865739,0.002022665],"genre_scores_gemma":[0.7064987,0.00048664835,0.28838173,0.00054618425,0.00013456674,0.00045621739,0.0007580538,0.00007058507,0.0026673265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98996043,0.0032099392,0.0010653402,0.0014763017,0.0034144248,0.0008735619],"domain_scores_gemma":[0.99418664,0.002329559,0.00055004004,0.0017876312,0.0008731766,0.00027289163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005592828,0.00049775594,0.0016778174,0.0015567747,0.0011724193,0.0022604289,0.0031441522,0.0016833481,0.0013783613],"category_scores_gemma":[0.009708027,0.000366675,0.0012574035,0.003670986,0.0016665022,0.0068171523,0.00513304,0.0015014482,0.0004509563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020920031,0.00081121305,0.00421728,0.0005470437,0.00023293121,0.00092398224,0.0019405576,0.10381303,0.041353077,0.37782565,0.012088076,0.45415515],"study_design_scores_gemma":[0.0002505831,0.00050503114,0.0010369031,0.000037433303,0.00009708367,0.001003406,0.00034371865,0.8161105,0.024422482,0.14369649,0.012377295,0.00011906994],"about_ca_topic_score_codex":0.0028655545,"about_ca_topic_score_gemma":0.0009721733,"teacher_disagreement_score":0.005592828,"about_ca_system_score_codex":0.0016659764,"about_ca_system_score_gemma":0.0017876645,"threshold_uncertainty_score":0.02957803},"labels":[],"label_agreement":null},{"id":"W4220732665","doi":"10.1007/978-3-030-99277-4_22","title":"Towards Post-Quantum Key-Updatable Public-Key Encryption via Supersingular Isogenies","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptosystem; Encryption; Forward secrecy; Symmetric-key algorithm; Public-key cryptography; Key encapsulation; Discrete logarithm; Theoretical computer science; Secrecy; Computer security; Key (lock)","score_opus":0.016129514259756065,"score_gpt":0.22846537243721513,"score_spread":0.21233585817745906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220732665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034459796,0.00096751994,0.8971567,0.0012609973,0.0006347887,0.0001429664,0.00024302896,0.0015726709,0.063561596],"genre_scores_gemma":[0.6661163,0.0015960358,0.26295552,0.0010261118,0.0006116938,0.00023805925,0.0007146857,0.0011881052,0.06555346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998415,0.0003082134,0.00008763766,0.0002478679,0.000687069,0.0002541814],"domain_scores_gemma":[0.99838185,0.00039604236,0.00008311647,0.0009061956,0.00018390529,0.000049009777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012826353,0.00087181956,0.0010862398,0.0005888453,0.0009874443,0.002842926,0.0013932626,0.0013001481,0.01047288],"category_scores_gemma":[0.0029069022,0.0007058894,0.000887541,0.0010064509,0.0029103665,0.0065747052,0.004600176,0.004449852,0.005018542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121130666,0.00004327949,0.000072812814,0.00009705612,0.000014364204,0.000074996366,0.00015565327,0.004245498,0.0052534062,0.9534834,0.0039610397,0.03247729],"study_design_scores_gemma":[0.0000364118,0.000058397363,0.00010454888,0.00003709605,0.000017021299,0.0001952035,0.00005091896,0.0466608,0.015178662,0.9178369,0.019788345,0.000035596117],"about_ca_topic_score_codex":0.00023595283,"about_ca_topic_score_gemma":0.00028851896,"teacher_disagreement_score":0.01047288,"about_ca_system_score_codex":0.0009852288,"about_ca_system_score_gemma":0.0007809637,"threshold_uncertainty_score":0.035035312},"labels":[],"label_agreement":null},{"id":"W4220858282","doi":"10.36227/techrxiv.19315202","title":"Survey on Fully Homomorphic Encryption, Theory, and Applications","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"Horizon 2020 Framework Programme; Technische Universität Dresden; Deutsche Forschungsgemeinschaft; European Commission","keywords":"Homomorphic encryption; Computer science; Cloud computing; Encryption; Theoretical computer science; State (computer science); Software; Computational science; Computer security; Distributed computing; Algorithm; Operating system","score_opus":0.02422468823543357,"score_gpt":0.2704031590893046,"score_spread":0.24617847085387107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220858282","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058311387,0.64775246,0.2588931,0.00575991,0.0015245718,0.00013083547,0.00044526905,0.0003672974,0.079295546],"genre_scores_gemma":[0.09086513,0.80339307,0.084750056,0.0032945438,0.004689136,0.00022588683,0.0007986944,0.00013801418,0.01184542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829584,0.0004067602,0.00019393685,0.0002292508,0.0007395305,0.00013461366],"domain_scores_gemma":[0.9977825,0.001510789,0.0001041627,0.00030883527,0.00024349053,0.000050208022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018893364,0.0010221355,0.0012553983,0.0030831671,0.00088239147,0.0027519425,0.0009927223,0.0014628968,0.0056455396],"category_scores_gemma":[0.0035244448,0.0007330928,0.0007662011,0.004664007,0.0019824668,0.0070862155,0.0018747117,0.0031413229,0.0022586992],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059203336,0.00012110731,0.0006022676,0.0039194673,0.00006235705,0.0002726568,0.00024594204,0.0046286937,0.0024745257,0.5581416,0.022983795,0.40648845],"study_design_scores_gemma":[0.000017277382,0.00019513132,0.0009700056,0.002079027,0.000053856034,0.0028269961,0.00016171832,0.014839404,0.004634194,0.45614615,0.5179878,0.00008844176],"about_ca_topic_score_codex":0.0005190327,"about_ca_topic_score_gemma":0.00031784616,"teacher_disagreement_score":0.0056455396,"about_ca_system_score_codex":0.0013399541,"about_ca_system_score_gemma":0.0013962813,"threshold_uncertainty_score":0.018886209},"labels":[],"label_agreement":null},{"id":"W4220913602","doi":"10.5539/cis.v15n2p68","title":"Multi-Issuer Attribute-based Anonymous Credential with Traceability and Revocation","year":2022,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Credential; Issuer; Revocation; Computer science; Computer security; Traceability; Certification; Password; Scheme (mathematics); Revocation list; Anonymity; Service (business); Certificate; Computer network; Certificate authority; Overhead (engineering); Business; Public-key cryptography; Theoretical computer science; Software engineering; Encryption; Operating system","score_opus":0.011295272960035017,"score_gpt":0.22972161641560193,"score_spread":0.2184263434555669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220913602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035019323,0.0003476889,0.9573464,0.0005850901,0.00015781607,0.00033929848,0.00013545419,0.0012791218,0.004789738],"genre_scores_gemma":[0.8351433,0.00027599192,0.15609173,0.0002556635,0.00020840572,0.00023175092,0.00018624499,0.00010119235,0.0075057484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98668575,0.004262331,0.0015251138,0.0021805565,0.004010797,0.0013354452],"domain_scores_gemma":[0.9766722,0.0051148385,0.002400957,0.012246158,0.00230613,0.0012598032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007986907,0.0006492711,0.0015988073,0.0018013186,0.0023282475,0.0038504936,0.0037283201,0.002544162,0.0025881825],"category_scores_gemma":[0.016220212,0.0005471141,0.0018906955,0.0023361272,0.0031113457,0.01279,0.007112066,0.003582147,0.0011319758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012183124,0.00066367583,0.0041898047,0.0004967383,0.0002680732,0.0016021784,0.0025533366,0.040776223,0.028543215,0.71610624,0.0044962415,0.19908604],"study_design_scores_gemma":[0.00040538472,0.00089857,0.0013691362,0.00013722124,0.00038031887,0.005246506,0.00047122533,0.54158294,0.059324853,0.3272258,0.06243893,0.00051913224],"about_ca_topic_score_codex":0.0006057275,"about_ca_topic_score_gemma":0.00033685355,"teacher_disagreement_score":0.007986907,"about_ca_system_score_codex":0.0015678245,"about_ca_system_score_gemma":0.002390565,"threshold_uncertainty_score":0.04223931},"labels":[],"label_agreement":null},{"id":"W4221100634","doi":"10.3390/cryptography6020015","title":"Tightly Secure PKE Combiner in the Quantum Random Oracle Model","year":2022,"lang":"en","type":"article","venue":"Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random oracle; Computer science; Oracle; Encryption; Quantum; Theoretical computer science; Cryptography; Implementation; Computer security; Public-key cryptography; Physics; Quantum mechanics; Programming language","score_opus":0.013621035112211407,"score_gpt":0.22661535039348787,"score_spread":0.21299431528127646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221100634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06935374,0.0010245657,0.8908134,0.0027183392,0.00018807688,0.00026322258,0.00034465772,0.0015079376,0.033786036],"genre_scores_gemma":[0.9106656,0.0005915189,0.07607555,0.00066373515,0.0002241939,0.00022780783,0.0001755807,0.00012820266,0.011247866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994436,0.0017149675,0.0002677886,0.00088287005,0.001971611,0.0007266163],"domain_scores_gemma":[0.9966132,0.0011958226,0.00036488747,0.0013485389,0.00027589363,0.00020171939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00376631,0.00082500756,0.0015788632,0.00089361763,0.0011651253,0.0036952468,0.0014719331,0.0025317385,0.0045312317],"category_scores_gemma":[0.004937484,0.0006500965,0.0011368538,0.0011255109,0.0033413393,0.008578771,0.0066852975,0.00338816,0.002453049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031546794,0.00008055745,0.0004506845,0.00009880691,0.00008637781,0.0006088586,0.00027930315,0.013797984,0.00969509,0.9566874,0.00217924,0.015720319],"study_design_scores_gemma":[0.0002102795,0.0002395737,0.0003093353,0.00006753184,0.00009690496,0.0011163563,0.00010413671,0.18209915,0.016888756,0.7822484,0.016516764,0.0001028752],"about_ca_topic_score_codex":0.00028981856,"about_ca_topic_score_gemma":0.00022954174,"teacher_disagreement_score":0.0045312317,"about_ca_system_score_codex":0.0008475181,"about_ca_system_score_gemma":0.00081475783,"threshold_uncertainty_score":0.019918382},"labels":[],"label_agreement":null},{"id":"W4224293245","doi":"10.25046/aj070216","title":"Leakage-abuse Attacks Against Forward Private Searchable Symmetric Encryption","year":2022,"lang":"en","type":"article","venue":"Advances in Science Technology and Engineering Systems Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Mount Royal University","funders":"","keywords":"Encryption; Computer security; Symmetric-key algorithm; Computer science; Leakage (economics); Computer network; Medicine; Internet privacy; Public-key cryptography","score_opus":0.006387528571099501,"score_gpt":0.2387360690858914,"score_spread":0.2323485405147919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224293245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11897775,0.0016874972,0.8613097,0.002601097,0.00014003679,0.0002712989,0.00031667907,0.001178826,0.013517221],"genre_scores_gemma":[0.9527069,0.00050777284,0.04282037,0.00026440536,0.00006010646,0.00011740595,0.000096600015,0.00004738855,0.0033791305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9889536,0.0036180466,0.00088966097,0.0007608824,0.0043658167,0.0014120574],"domain_scores_gemma":[0.9862948,0.004880071,0.0012929772,0.0063339635,0.0009682613,0.00022998858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044002505,0.00085576775,0.0016321851,0.0013388819,0.0014885631,0.0025208439,0.0018598877,0.0019783606,0.0018958307],"category_scores_gemma":[0.013195362,0.00074959215,0.0017034895,0.0022473233,0.002917518,0.0100842165,0.0063969134,0.0030395759,0.00069476257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014642932,0.0003727145,0.004304782,0.0005160268,0.00033364253,0.0010043618,0.001428589,0.070845135,0.044463146,0.69785583,0.006377482,0.17103407],"study_design_scores_gemma":[0.0002032501,0.00034407407,0.001021598,0.00012963968,0.00016341935,0.00260606,0.00028225724,0.55419385,0.104239926,0.31828603,0.018362753,0.00016722248],"about_ca_topic_score_codex":0.0006702646,"about_ca_topic_score_gemma":0.0003658004,"teacher_disagreement_score":0.0044002505,"about_ca_system_score_codex":0.002672986,"about_ca_system_score_gemma":0.0023621325,"threshold_uncertainty_score":0.023271024},"labels":[],"label_agreement":null},{"id":"W4225832365","doi":"10.1109/jiot.2022.3158321","title":"PMRQ: Achieving Efficient and Privacy-Preserving Multidimensional Range Query in eHealthcare","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Range query (database); Homomorphic encryption; Intersection (aeronautics); Information privacy; Theoretical computer science; Cloud computing; Outsourcing; Data mining; Scheme (mathematics); Tree (set theory); Information retrieval; Computer security; Web search query","score_opus":0.01644908160508885,"score_gpt":0.2561891364062873,"score_spread":0.23974005480119848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225832365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042328008,0.00079706527,0.9517193,0.00072409114,0.00006204422,0.0002510997,0.0003041449,0.0009199248,0.0028943282],"genre_scores_gemma":[0.7865774,0.00069784146,0.20907134,0.00041694625,0.000084203086,0.0002839186,0.0006006749,0.00006269454,0.0022050145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938899,0.0017603085,0.00052330096,0.00079983426,0.0023186633,0.0007078594],"domain_scores_gemma":[0.99628264,0.0011468469,0.00040898717,0.0015233951,0.00049013353,0.00014798105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031756733,0.00039118258,0.0011104684,0.00083284575,0.0011192689,0.001783341,0.0020294462,0.0011794132,0.0011959369],"category_scores_gemma":[0.006284766,0.000311679,0.0009182286,0.0022991782,0.0011161291,0.006441291,0.0054943585,0.0016360467,0.00054923334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016802332,0.00059827964,0.005167145,0.00063821883,0.00023149145,0.0015407653,0.002360911,0.10966529,0.0809384,0.3144267,0.016330173,0.46642247],"study_design_scores_gemma":[0.00023543603,0.00075237325,0.001960987,0.00007311631,0.0001108189,0.0028390249,0.0009881662,0.79426235,0.06666891,0.10946632,0.022449434,0.00019307909],"about_ca_topic_score_codex":0.0013172847,"about_ca_topic_score_gemma":0.0005197909,"teacher_disagreement_score":0.0031756733,"about_ca_system_score_codex":0.0010870425,"about_ca_system_score_gemma":0.0013622573,"threshold_uncertainty_score":0.0167948},"labels":[],"label_agreement":null},{"id":"W4226062551","doi":"10.1515/jmc-2022-0002","title":"A code-based hybrid signcryption scheme","year":2023,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Impact Fund; Silicon Valley Community Foundation","keywords":"Signcryption; Key encapsulation; Ciphertext; Computer science; Code (set theory); Encryption; McEliece cryptosystem; Theoretical computer science; Ciphertext indistinguishability; Scheme (mathematics); Signature (topology); Public-key cryptography; Hybrid cryptosystem; Mathematics; Symmetric-key algorithm; Computer network; Malleability; Programming language","score_opus":0.05729437724278092,"score_gpt":0.3073742563585063,"score_spread":0.2500798791157254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226062551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12657687,0.00035550172,0.8444238,0.0010589359,0.00027055075,0.00040845558,0.000434746,0.0040495163,0.022421688],"genre_scores_gemma":[0.81369233,0.0002100036,0.15921012,0.00036869475,0.00009524681,0.00027286966,0.0004842608,0.00022684164,0.025439598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800926,0.00043769952,0.00013420563,0.00027179194,0.0008574605,0.0002896893],"domain_scores_gemma":[0.99701774,0.0005470491,0.0002601021,0.0011850762,0.000767945,0.00022215399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012507555,0.0004883924,0.00068136427,0.0009464907,0.0008364246,0.0022381574,0.0010531633,0.0017068653,0.0036779565],"category_scores_gemma":[0.0026567096,0.00025472115,0.0005708699,0.0010540918,0.0014726018,0.0027605377,0.0030052313,0.0012313131,0.0018752321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001022012,0.00033443994,0.0015753171,0.00025407714,0.00008116698,0.00064225355,0.00070588803,0.04400797,0.100231,0.70683527,0.00886835,0.13544229],"study_design_scores_gemma":[0.0004344315,0.0004998326,0.00093846425,0.00012179837,0.00010306075,0.001083968,0.00010075423,0.5702053,0.14888899,0.19828756,0.07912902,0.00020682989],"about_ca_topic_score_codex":0.00096899044,"about_ca_topic_score_gemma":0.00046305402,"teacher_disagreement_score":0.0036779565,"about_ca_system_score_codex":0.0011443802,"about_ca_system_score_gemma":0.0014770194,"threshold_uncertainty_score":0.012304008},"labels":[],"label_agreement":null},{"id":"W4230460386","doi":"10.1007/978-981-15-4374-6_4","title":"Secure Deduplication","year":2020,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Data deduplication; Computer science; Encryption; Plaintext; Cloud computing; Database; Computer security; Operating system","score_opus":0.01222127581604011,"score_gpt":0.20301322777302838,"score_spread":0.19079195195698828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230460386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027660184,0.012071043,0.7136337,0.0024894853,0.003787868,0.0005030014,0.0021789891,0.006186825,0.2314889],"genre_scores_gemma":[0.32594037,0.012279104,0.19407006,0.0020111408,0.0020509944,0.0005111753,0.005167926,0.0020678458,0.4559014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992888,0.000105961226,0.000056762896,0.000116609386,0.00036580113,0.00006599781],"domain_scores_gemma":[0.9979305,0.0004157252,0.000066353736,0.0012560347,0.00029260843,0.00003872277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008619378,0.0008259353,0.00060340593,0.0011025376,0.00086508004,0.0019632753,0.0011336688,0.00059784966,0.019815449],"category_scores_gemma":[0.0024920697,0.00045873554,0.0003967762,0.0015786062,0.0007943382,0.0043028677,0.0021649161,0.0014521893,0.010021827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026844678,0.00009805249,0.0003697866,0.00066387345,0.00005177806,0.00040475986,0.00035975734,0.0076441583,0.01542628,0.26568618,0.12099032,0.5880366],"study_design_scores_gemma":[0.000066763685,0.00015314572,0.00047523234,0.00030069356,0.00007964031,0.0024258043,0.00019251858,0.03741555,0.052306596,0.29531506,0.6111875,0.00008150684],"about_ca_topic_score_codex":0.00015345847,"about_ca_topic_score_gemma":0.00022381506,"teacher_disagreement_score":0.019815449,"about_ca_system_score_codex":0.0005124694,"about_ca_system_score_gemma":0.0006387368,"threshold_uncertainty_score":0.066289246},"labels":[],"label_agreement":null},{"id":"W4233276659","doi":"10.4018/978-1-7998-8954-0.ch019","title":"An End to End Cloud Computing Privacy Framework Using Blind Processing","year":2021,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"Computer science; Encryption; Cloud computing; Key (lock); Computer security; Database; Revocation; Information privacy; Access control; Outsourcing; Overhead (engineering)","score_opus":0.03582763014538802,"score_gpt":0.30325159917937267,"score_spread":0.26742396903398463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233276659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006344677,0.00082777615,0.9738573,0.001394696,0.00019834368,0.00022581653,0.00014257726,0.0012228764,0.015785959],"genre_scores_gemma":[0.42265028,0.002001418,0.5431593,0.0011070729,0.0003205359,0.00029481147,0.00043506498,0.00046244965,0.029569073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997884,0.00041904917,0.00010858528,0.00032821356,0.00088977313,0.00037032398],"domain_scores_gemma":[0.99907076,0.0001313599,0.000063241285,0.0003593755,0.00020596635,0.0001692912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019853693,0.0006291488,0.0008185289,0.000594536,0.0022830192,0.0050270306,0.0032031043,0.0018874024,0.003899619],"category_scores_gemma":[0.0015554634,0.0004517927,0.0010542836,0.0012067086,0.0017277654,0.0057124845,0.005218593,0.0033253124,0.0019790865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003428322,0.00024011185,0.000536631,0.00019137745,0.0000578,0.0008258613,0.00034866104,0.03000069,0.010014445,0.8569197,0.022455899,0.07806592],"study_design_scores_gemma":[0.000046423444,0.00008723668,0.00036597616,0.00010614703,0.000039496346,0.0010954131,0.00025190535,0.600669,0.012323666,0.27451846,0.11042217,0.00007408237],"about_ca_topic_score_codex":0.003115383,"about_ca_topic_score_gemma":0.002484963,"teacher_disagreement_score":0.0050270306,"about_ca_system_score_codex":0.0018461471,"about_ca_system_score_gemma":0.0028232394,"threshold_uncertainty_score":0.013394833},"labels":[],"label_agreement":null},{"id":"W4236190974","doi":"10.1007/978-0-387-39940-9_2827","title":"Incoherency Bounds","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.013499373714464642,"score_gpt":0.22775445370707634,"score_spread":0.2142550799926117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236190974","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011275712,0.011647446,0.18661682,0.007905179,0.0014007266,0.000050860755,0.0005612535,0.00053219864,0.78000975],"genre_scores_gemma":[0.5542836,0.018611211,0.06818209,0.0040904465,0.004577578,0.00061441946,0.0016472735,0.0018056124,0.34618774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966696,0.0005621125,0.00012234856,0.0007820445,0.0013744301,0.0004894565],"domain_scores_gemma":[0.9926836,0.0041670534,0.0002835215,0.0017286786,0.0008164777,0.00032058303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020109718,0.0015937831,0.0018027484,0.0024223502,0.0030857231,0.0054160394,0.002812352,0.00216818,0.032785937],"category_scores_gemma":[0.009933787,0.0008510294,0.0011440581,0.003133912,0.006706591,0.013972769,0.0053247246,0.011068547,0.007421889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015585318,0.000011351511,0.000033505486,0.000035415687,0.00000465802,0.000015109871,0.000068730114,0.0003656772,0.00012439779,0.9835001,0.007980881,0.007844541],"study_design_scores_gemma":[0.000003993138,0.000005145582,0.000040312767,0.000023116603,0.0000067678043,0.000035278103,0.000014662858,0.0011630916,0.0002138378,0.98340595,0.015081945,0.0000058858104],"about_ca_topic_score_codex":0.0012699533,"about_ca_topic_score_gemma":0.00105583,"teacher_disagreement_score":0.032785937,"about_ca_system_score_codex":0.0034533395,"about_ca_system_score_gemma":0.0016672156,"threshold_uncertainty_score":0.10967982},"labels":[],"label_agreement":null},{"id":"W4237639947","doi":"10.14722/ndss.2020.24150","title":"Secure Sublinear Time Differentially Private Median Computation","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission","keywords":"Computation; Computer science; Sublinear function; Algorithm; Mathematics; Discrete mathematics","score_opus":0.01370538585817148,"score_gpt":0.21806257629040104,"score_spread":0.20435719043222955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237639947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05833563,0.0029619585,0.8951241,0.008850642,0.0010834653,0.00035222297,0.003608198,0.006035596,0.023648225],"genre_scores_gemma":[0.8849373,0.0008910689,0.095718525,0.0020570618,0.0006771735,0.000441649,0.0018236545,0.00040101423,0.013052637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935254,0.001401847,0.00036183617,0.0013794389,0.0018425593,0.0014890049],"domain_scores_gemma":[0.98921025,0.0053379308,0.0006455968,0.0036693672,0.00076718477,0.00036955127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003645618,0.001324138,0.0025470753,0.0008011688,0.0019487601,0.0039336504,0.0025257068,0.00215929,0.011899841],"category_scores_gemma":[0.015443347,0.0006465298,0.00129961,0.0023394434,0.002272748,0.0070191463,0.00708263,0.0042874548,0.005000296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007726375,0.00048945483,0.0026783121,0.00077164295,0.00033764867,0.00058827584,0.0004797335,0.2076186,0.014594974,0.4528547,0.07700761,0.2348526],"study_design_scores_gemma":[0.0004564844,0.00018483838,0.00035621566,0.000065757486,0.00005602843,0.00026609466,0.00008830547,0.5387771,0.00672684,0.4451323,0.0078372685,0.000052712105],"about_ca_topic_score_codex":0.0012455336,"about_ca_topic_score_gemma":0.0022320407,"teacher_disagreement_score":0.011899841,"about_ca_system_score_codex":0.0035575307,"about_ca_system_score_gemma":0.0052720034,"threshold_uncertainty_score":0.03980887},"labels":[],"label_agreement":null},{"id":"W4239692971","doi":"10.1109/glocom.2014.7417029","title":"A Novel Privacy-Preserving Set Aggregation Scheme for Smart Grid Communications","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Nanyang Technological University","keywords":"Computer science; Scheme (mathematics); Random oracle; Smart grid; Data aggregator; Set (abstract data type); Distributed computing; Grid; Oracle; Information privacy; Computer network; Encryption; Computer security; Wireless sensor network; Public-key cryptography; Mathematics; Engineering","score_opus":0.101263160890229,"score_gpt":0.34499327181195727,"score_spread":0.24373011092172825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239692971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026740639,0.0005907341,0.9670382,0.0005133609,0.00017742436,0.00023629489,0.00022138591,0.00075702526,0.0037249888],"genre_scores_gemma":[0.80261785,0.00048054708,0.19160806,0.00031798898,0.00024485987,0.00024506895,0.0003583717,0.000037879294,0.0040893317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975592,0.00064181915,0.00020453712,0.0003701,0.000959222,0.0002651131],"domain_scores_gemma":[0.99772495,0.0004836588,0.00029400364,0.0010482025,0.0003246249,0.0001245897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014696607,0.00058371975,0.0010187698,0.0007026266,0.0013730851,0.0012402849,0.0016470867,0.0010096023,0.0015659021],"category_scores_gemma":[0.0026793925,0.00025379486,0.00073029316,0.0015285244,0.0007785484,0.003603858,0.0023695573,0.0014999498,0.00050408556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014871305,0.00045794676,0.0026263548,0.0006065158,0.00026538246,0.0011054304,0.0015130466,0.11199918,0.10905106,0.40805772,0.013597985,0.3492323],"study_design_scores_gemma":[0.00020271538,0.0006153139,0.0011238784,0.00005636901,0.00013887639,0.0016829681,0.00027893708,0.77657086,0.045722727,0.13547432,0.037982676,0.00015021703],"about_ca_topic_score_codex":0.00043591473,"about_ca_topic_score_gemma":0.0003674382,"teacher_disagreement_score":0.0016470867,"about_ca_system_score_codex":0.00081729906,"about_ca_system_score_gemma":0.0010663957,"threshold_uncertainty_score":0.007772386},"labels":[],"label_agreement":null},{"id":"W4243460794","doi":"10.32920/ryerson.14644056","title":"Theory and application of encrypted sequential data processing: search and computation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Computer science; Encryption; Cloud computing; Cloud storage; Phrase search; Bloom filter; Scheme (mathematics); Database; Theoretical computer science; Information retrieval; Algorithm; Computer security; Search engine; Operating system","score_opus":0.04898824992731103,"score_gpt":0.3365900516937144,"score_spread":0.2876018017664034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243460794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009189606,0.0058839396,0.94949263,0.0027078863,0.00037157562,0.00018765093,0.00021650667,0.00025438974,0.031695694],"genre_scores_gemma":[0.3610731,0.015807746,0.5917335,0.0014081156,0.0015998544,0.0013237172,0.000549469,0.00021602782,0.026288435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710387,0.0008028004,0.0003159486,0.00058066746,0.0009770103,0.00021964342],"domain_scores_gemma":[0.99557614,0.0028038935,0.00028620995,0.000784158,0.00045895347,0.00009064372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014997,0.0010802874,0.0011580985,0.0024856534,0.0012882898,0.0054622893,0.0021178466,0.0023363626,0.0064665526],"category_scores_gemma":[0.0074488735,0.00080709474,0.0022158623,0.004008052,0.00584376,0.0071298084,0.0023359926,0.0036323934,0.0015399248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036133482,0.000025273566,0.00027062793,0.00022586832,0.000026764816,0.000093344825,0.000093567105,0.030178092,0.00092796166,0.94911796,0.001628118,0.01737644],"study_design_scores_gemma":[0.00002867618,0.000041083313,0.0001486004,0.000075605516,0.000020738544,0.00019273505,0.00004448037,0.31006083,0.0013907554,0.67217255,0.015793677,0.000030312445],"about_ca_topic_score_codex":0.0031205602,"about_ca_topic_score_gemma":0.0013755648,"teacher_disagreement_score":0.0064665526,"about_ca_system_score_codex":0.003594091,"about_ca_system_score_gemma":0.0022240651,"threshold_uncertainty_score":0.026077032},"labels":[],"label_agreement":null},{"id":"W4246518626","doi":"10.22215/etd/2011-07315","title":"Techniques for enhancing the performance of secure sockets layer-based systems","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Computer science; Layer (electronics); Operating system; Nanotechnology; Materials science","score_opus":0.018314938267008495,"score_gpt":0.2598362328170315,"score_spread":0.241521294550023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246518626","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11411853,0.002099958,0.85539544,0.0008536624,0.00051609473,0.00024333526,0.00008969348,0.013860802,0.0128225135],"genre_scores_gemma":[0.80285126,0.0012828037,0.18716428,0.0001415904,0.00028662392,0.00012873598,0.00016378505,0.00094311405,0.0070378347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971349,0.0007906407,0.0003270224,0.00014857958,0.0011784752,0.00042037427],"domain_scores_gemma":[0.99240935,0.0025342575,0.00050628383,0.0032765435,0.0010900444,0.00018342404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027861267,0.001274288,0.0006675279,0.0014205261,0.0010769259,0.0028345601,0.001601867,0.00075520336,0.00788952],"category_scores_gemma":[0.010989711,0.00065645383,0.00052505586,0.0012968249,0.0010512437,0.0052799215,0.0027319358,0.0018267644,0.0023174786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026446602,0.00043931958,0.0050297845,0.0008748494,0.00017514199,0.00048769687,0.0013824648,0.055080876,0.24635136,0.093493566,0.0136020705,0.5804384],"study_design_scores_gemma":[0.00027266247,0.0010278258,0.0015989993,0.00014819913,0.0002560234,0.0009186725,0.00042216392,0.5970789,0.30846426,0.05176404,0.03793286,0.000115396026],"about_ca_topic_score_codex":0.0004919066,"about_ca_topic_score_gemma":0.00074520515,"teacher_disagreement_score":0.00788952,"about_ca_system_score_codex":0.0008098762,"about_ca_system_score_gemma":0.0009299461,"threshold_uncertainty_score":0.026393056},"labels":[],"label_agreement":null},{"id":"W4247577452","doi":"10.4018/978-1-7998-7705-9.ch026","title":"An Encryption Methodology for Enabling the Use of Data Warehouses on the Cloud","year":2020,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Encryption; Filesystem-level encryption; Cloud computing; Computer science; Client-side encryption; Homomorphic encryption; On-the-fly encryption; 56-bit encryption; 40-bit encryption; Database; Computer security; Operating system","score_opus":0.3304720163788717,"score_gpt":0.34975982568072206,"score_spread":0.019287809301850367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247577452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02221828,0.0018346433,0.9648384,0.00051718863,0.000065125896,0.00025828756,0.00009447159,0.0002541302,0.009919454],"genre_scores_gemma":[0.28511986,0.0034588822,0.7025659,0.00021770876,0.000041492,0.00014750987,0.00027855043,0.00005968868,0.008110425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993376,0.00019328574,0.00006175592,0.00007347524,0.000284625,0.00004923564],"domain_scores_gemma":[0.9994931,0.0001385178,0.00007042278,0.00015711415,0.0001219502,0.000018753892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861891,0.0003140039,0.0001981617,0.0005299026,0.0003634428,0.0012704337,0.0006123392,0.00046948396,0.0015792053],"category_scores_gemma":[0.0010579707,0.00019468891,0.00049933104,0.00074280653,0.00043386116,0.0019265587,0.0007698269,0.0007428536,0.000583281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016095363,0.00021081428,0.0012860582,0.0006587881,0.00007850848,0.00040544066,0.00037239885,0.033817165,0.095069334,0.3775853,0.0053000827,0.48505515],"study_design_scores_gemma":[0.00007585801,0.00072627835,0.0026122741,0.0004367006,0.00013475199,0.0048414655,0.00073751545,0.40465334,0.2570486,0.13983506,0.18879563,0.00010247667],"about_ca_topic_score_codex":0.00040478024,"about_ca_topic_score_gemma":0.00040643883,"teacher_disagreement_score":0.0015792053,"about_ca_system_score_codex":0.0006456105,"about_ca_system_score_gemma":0.00090037077,"threshold_uncertainty_score":0.0052829385},"labels":[],"label_agreement":null},{"id":"W4247608663","doi":"10.1145/3234200.3234218","title":"Dynam-IX","year":2018,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"European Commission; National Science Foundation","keywords":"Computer science; Programming language","score_opus":0.010063653358010575,"score_gpt":0.24143727117441893,"score_spread":0.23137361781640836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247608663","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068818196,0.004535508,0.21540457,0.07736995,0.044385865,0.0009457909,0.12955628,0.08948894,0.43143126],"genre_scores_gemma":[0.0884513,0.0054813395,0.20400414,0.012343487,0.0072946344,0.0013553054,0.1523316,0.0698691,0.4588691],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955314,0.0014956178,0.0002962107,0.00059675676,0.0018055501,0.00027453256],"domain_scores_gemma":[0.9762166,0.0077285934,0.0004620747,0.0053814165,0.009040925,0.001170318],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0070540193,0.0009841007,0.0010238186,0.002244452,0.0011427118,0.0038495206,0.0021586725,0.0008030606,0.29082695],"category_scores_gemma":[0.032157663,0.00064088416,0.0008056275,0.0027650227,0.00062414777,0.007607489,0.0028106277,0.0028188266,0.09405306],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012607113,0.000029204783,0.00031503945,0.00014718196,0.00001699631,0.000039707436,0.00007092482,0.0011232097,0.0004110345,0.026685493,0.9192231,0.05181198],"study_design_scores_gemma":[0.000034754845,0.0000115394805,0.0003237357,0.00008902231,0.00000969574,0.00009682596,0.00008886115,0.0039342875,0.00077476545,0.0137456115,0.9808672,0.000023646966],"about_ca_topic_score_codex":0.006172065,"about_ca_topic_score_gemma":0.0069194995,"teacher_disagreement_score":0.7091731,"about_ca_system_score_codex":0.0032578167,"about_ca_system_score_gemma":0.0031552329,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4248610630","doi":"10.1007/978-1-4419-5906-5_239","title":"Commitment","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Political science","score_opus":0.03590798324223105,"score_gpt":0.2205606415337264,"score_spread":0.18465265829149535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248610630","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014580402,0.00035484432,0.033947654,0.0018903023,0.0009027545,0.00013999127,0.0007022427,0.0004884153,0.96011585],"genre_scores_gemma":[0.04515962,0.0006473143,0.00939271,0.0009964799,0.00046722087,0.00025011538,0.0011499516,0.0005735103,0.9413632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988036,0.00020402051,0.000049327173,0.00033804958,0.0004576103,0.0001474522],"domain_scores_gemma":[0.99881303,0.0002474496,0.00004822689,0.00046038727,0.0003310282,0.000099974764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008808211,0.00089141895,0.0005823622,0.0009031654,0.0022973216,0.004150678,0.0017331386,0.0011000617,0.2173543],"category_scores_gemma":[0.0033162897,0.0005431719,0.0006181381,0.0010548523,0.002098166,0.005709961,0.003238545,0.0046557086,0.10595244],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039365153,0.000025857475,0.000033789114,0.00006565676,0.000004699485,0.00002617485,0.00016382123,0.00016295923,0.00063296646,0.87538147,0.08385948,0.03960383],"study_design_scores_gemma":[0.000018353132,0.000020800115,0.00008001851,0.000051015162,0.0000075710996,0.00010700954,0.00013377672,0.00053350383,0.001471537,0.49825776,0.49930307,0.000015561089],"about_ca_topic_score_codex":0.0008835719,"about_ca_topic_score_gemma":0.0008509398,"teacher_disagreement_score":0.2173543,"about_ca_system_score_codex":0.0015166468,"about_ca_system_score_gemma":0.0013383535,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4249782409","doi":"10.1007/978-1-4419-1530-6_4","title":"Using Keys","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Public-key cryptography; Computer science; Computer security; Key (lock); Key exchange; Key distribution; Digital signature; Cryptography; Symmetric-key algorithm; Pre-shared key; Public key infrastructure; Shared secret; Key management; Encryption","score_opus":0.05164285597628524,"score_gpt":0.263317873261307,"score_spread":0.21167501728502178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249782409","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00161896,0.008951203,0.07700594,0.002515979,0.0026761238,0.00013381054,0.00025167,0.0006838027,0.9061625],"genre_scores_gemma":[0.03095712,0.011591712,0.026351571,0.0012123167,0.00076681044,0.00018257693,0.0003317164,0.00053112063,0.92807496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921286,0.00015775628,0.000043508648,0.00016102477,0.0003420548,0.000082795545],"domain_scores_gemma":[0.9995246,0.00012666153,0.000024580795,0.00020252756,0.00009758808,0.000024048828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054297724,0.001477065,0.000580003,0.0012988397,0.0014219107,0.0051811505,0.0012064845,0.0013300964,0.056130163],"category_scores_gemma":[0.0017818749,0.00060495205,0.0006062773,0.00137287,0.0028450354,0.011796633,0.0032099017,0.0030405165,0.04251531],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002383191,0.000019143672,0.000038942704,0.00020974972,0.0000088936295,0.000046311896,0.00039457832,0.0002782668,0.0016399769,0.80668473,0.07147283,0.119182706],"study_design_scores_gemma":[0.000005281117,0.000015648196,0.000033632317,0.00012825274,0.000008227292,0.00018766188,0.00008990481,0.00031172787,0.0018337783,0.17439012,0.8229841,0.000011686272],"about_ca_topic_score_codex":0.0005556417,"about_ca_topic_score_gemma":0.00064753985,"teacher_disagreement_score":0.056130163,"about_ca_system_score_codex":0.0013936256,"about_ca_system_score_gemma":0.0011508919,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4251764382","doi":"10.22215/etd/2011-09214","title":"Privacy enforcement Architectures for an e-Business Environment","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Enforcement; Computer science; Internet privacy; Computer security; Political science; Law","score_opus":0.02621725455703745,"score_gpt":0.2631644865552788,"score_spread":0.23694723199824136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251764382","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05503771,0.0006051184,0.9053872,0.0039702444,0.00018077572,0.00040969905,0.00016800761,0.0093171345,0.024924066],"genre_scores_gemma":[0.5771857,0.0008075743,0.39074537,0.0009344666,0.00013141263,0.00023974266,0.00069214887,0.0006310327,0.028632512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99678385,0.00081502466,0.00037618255,0.00039871875,0.0011304097,0.0004958554],"domain_scores_gemma":[0.99557304,0.0010229677,0.00038077758,0.0017567794,0.00086338265,0.00040300787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050407844,0.0003757786,0.000448143,0.00072146684,0.0018260907,0.00643964,0.0021149092,0.0021513165,0.0053012106],"category_scores_gemma":[0.0055722287,0.0006821231,0.00074286957,0.0008478796,0.0016876439,0.009156125,0.004356926,0.0035554236,0.0018247301],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086654647,0.00081304344,0.004662233,0.00033987968,0.00012948713,0.0006722678,0.001965488,0.044348642,0.027355503,0.7023451,0.015751585,0.20075028],"study_design_scores_gemma":[0.00018478103,0.00025905517,0.0014709124,0.000220159,0.00016467822,0.00049000897,0.0008536337,0.57063127,0.046569347,0.25307205,0.12599464,0.000089500696],"about_ca_topic_score_codex":0.0029503775,"about_ca_topic_score_gemma":0.0037800004,"teacher_disagreement_score":0.00643964,"about_ca_system_score_codex":0.0014380072,"about_ca_system_score_gemma":0.002825238,"threshold_uncertainty_score":0.026658535},"labels":[],"label_agreement":null},{"id":"W4253346429","doi":"10.4018/978-1-7998-7705-9.ch014","title":"Fully Homomorphic Encryption Without Noise","year":2020,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"Homomorphic encryption; Computer science; Ciphertext; Encryption; Scheme (mathematics); Probabilistic encryption; Reduction (mathematics); Theoretical computer science; Deterministic encryption; Noise (video); Algorithm; Cryptosystem; Bootstrapping (finance); Arithmetic; Mathematics; Computer security; Image (mathematics); Artificial intelligence","score_opus":0.018812824221120572,"score_gpt":0.2305338972476174,"score_spread":0.21172107302649681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253346429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04245357,0.004226723,0.88481855,0.0005409496,0.0003597132,0.00016534446,0.00035231898,0.001408291,0.06567459],"genre_scores_gemma":[0.5253199,0.005121275,0.36343604,0.0006060512,0.000251631,0.00018699165,0.0008648022,0.0002458144,0.103967406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958414,0.00007040856,0.00002334377,0.000071705836,0.0002165692,0.000033920118],"domain_scores_gemma":[0.99965286,0.00008713847,0.000024267756,0.00016298796,0.000058184458,0.000014498334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000256278,0.0003113042,0.0004029342,0.0002853941,0.00025473424,0.001187169,0.0004808277,0.00048916094,0.0042853057],"category_scores_gemma":[0.00058413215,0.00019030842,0.00027788256,0.00042312962,0.0004807798,0.0027595456,0.001022248,0.00079501176,0.0022819117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023155446,0.00012910854,0.00027023934,0.0006391491,0.000036119174,0.00047382317,0.00031182394,0.00871102,0.10935635,0.48837942,0.007079633,0.3843817],"study_design_scores_gemma":[0.00007555755,0.00057152775,0.0014868265,0.00029329606,0.0000693617,0.0059695127,0.00014296877,0.14593291,0.14360557,0.3146923,0.38704365,0.0001164276],"about_ca_topic_score_codex":0.000085568565,"about_ca_topic_score_gemma":0.0001018218,"teacher_disagreement_score":0.0042853057,"about_ca_system_score_codex":0.0003075357,"about_ca_system_score_gemma":0.0003511317,"threshold_uncertainty_score":0.0143357515},"labels":[],"label_agreement":null},{"id":"W4255021787","doi":"10.46586/tches.v2020.i3.269-306","title":"Parameterized Hardware Accelerators for Lattice-Based Cryptography and Their Application to the HW/SW Co-Design of qTESLA","year":2020,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Computer science; Parameterized complexity; Field-programmable gate array; Cryptography; Software; Parallel computing; Computer hardware; Embedded system; Algorithm; Operating system","score_opus":0.03786901518055814,"score_gpt":0.26109118965989436,"score_spread":0.22322217447933623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255021787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117974706,0.0011660011,0.83790594,0.00060494104,0.00037238124,0.00044118502,0.00040286462,0.015172918,0.025959026],"genre_scores_gemma":[0.6861586,0.00030021832,0.30219033,0.0003176687,0.00006951225,0.00035939892,0.000523088,0.0006044472,0.009476725],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935836,0.00012402887,0.000051550494,0.00009595146,0.00025378398,0.0001163013],"domain_scores_gemma":[0.99918324,0.00020233545,0.0001234157,0.00026195642,0.0001705739,0.00005846175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065415085,0.0006391448,0.00027483513,0.00052349345,0.00035193865,0.0011788887,0.0015272384,0.00042239288,0.01036867],"category_scores_gemma":[0.001701307,0.00034016656,0.000405435,0.00036773414,0.0005247481,0.0015370359,0.0008130446,0.0012525945,0.0028110044],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028779476,0.0004746637,0.005037947,0.001100764,0.00019083677,0.00085322384,0.0006440883,0.115355484,0.32950845,0.15890248,0.026290175,0.358764],"study_design_scores_gemma":[0.00041375577,0.0022408965,0.0015339319,0.00015128503,0.00010108307,0.0007858859,0.00013122866,0.52519643,0.32215598,0.023050973,0.12410268,0.00013591126],"about_ca_topic_score_codex":0.0006310624,"about_ca_topic_score_gemma":0.0012195958,"teacher_disagreement_score":0.01036867,"about_ca_system_score_codex":0.00087788684,"about_ca_system_score_gemma":0.0012541446,"threshold_uncertainty_score":0.034686685},"labels":[],"label_agreement":null},{"id":"W4256585855","doi":"10.1007/978-0-387-39940-9_3359","title":"Public-Key Encryption","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key (lock); Encryption; Public-key cryptography; Computer security; Political science; Computer science","score_opus":0.029859959857753898,"score_gpt":0.2288142187184877,"score_spread":0.1989542588607338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256585855","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019934631,0.042284545,0.1371454,0.0021526855,0.0017035675,0.00029326612,0.0017293356,0.002507699,0.81018996],"genre_scores_gemma":[0.042792346,0.061351947,0.09673208,0.0019152978,0.0013187499,0.00033613594,0.005003861,0.0008110319,0.78973854],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994923,0.000055436274,0.000033770146,0.00009788533,0.00027609445,0.000044532066],"domain_scores_gemma":[0.9997489,0.00007045981,0.00001607711,0.000086342574,0.00006555305,0.000012681635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038100834,0.00122074,0.0008232119,0.0014391876,0.0007580233,0.0029086622,0.0009799742,0.0009565267,0.050193176],"category_scores_gemma":[0.00085704395,0.00047821517,0.00046077013,0.0025544541,0.00097498717,0.0043551247,0.0014394979,0.0021125195,0.053197995],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038879458,0.00010105811,0.00010994388,0.00065401185,0.000024754732,0.00016201334,0.00021256728,0.0008587368,0.004176033,0.2675119,0.22275765,0.5033925],"study_design_scores_gemma":[0.000010805222,0.00002521853,0.00020436643,0.0002131267,0.000011929669,0.00084452366,0.000028960045,0.00087356777,0.0029892076,0.10085503,0.8939246,0.000018663519],"about_ca_topic_score_codex":0.00028868485,"about_ca_topic_score_gemma":0.00043537174,"teacher_disagreement_score":0.050193176,"about_ca_system_score_codex":0.0008303176,"about_ca_system_score_gemma":0.0008762668,"threshold_uncertainty_score":0.1679129},"labels":[],"label_agreement":null},{"id":"W4281609508","doi":"10.1016/j.dcan.2022.05.021","title":"3-Multi ranked encryption with enhanced security in cloud computing","year":2022,"lang":"en","type":"article","venue":"Digital Communications and Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Institute for Information and Communications Technology Promotion; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning","keywords":"Computer science; Encryption; Overhead (engineering); Scheme (mathematics); Cloud computing; Keyword search; Computer security; Key (lock); Information retrieval; Mathematics","score_opus":0.014641744861409603,"score_gpt":0.24112318280038703,"score_spread":0.22648143793897743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281609508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13202623,0.00434614,0.842832,0.0020073191,0.00022044648,0.0005244506,0.00049546896,0.0014349351,0.016112944],"genre_scores_gemma":[0.93748814,0.000711666,0.05890887,0.00022369553,0.00006899911,0.000098954464,0.0001291203,0.00004349719,0.002327075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529946,0.0014976427,0.00038107316,0.0003938674,0.0014320053,0.0009959206],"domain_scores_gemma":[0.9959488,0.0009100795,0.00051323813,0.0019105779,0.0005089649,0.00020826691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026799263,0.0006443233,0.0011973497,0.0009692143,0.0014435194,0.0023604543,0.0016084365,0.0012588216,0.0021514834],"category_scores_gemma":[0.004266176,0.0003883831,0.00096489093,0.0018660892,0.0014704613,0.0070656287,0.0035543581,0.001838205,0.0008554339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014873652,0.00038956094,0.0034820603,0.0006505553,0.0001471337,0.0010532037,0.0007471717,0.16378605,0.047127593,0.59879667,0.010787038,0.17154571],"study_design_scores_gemma":[0.00013747971,0.00038692032,0.0010199399,0.000117297386,0.00007202126,0.0016393998,0.0002565541,0.8007537,0.026303308,0.15151668,0.017634911,0.00016171085],"about_ca_topic_score_codex":0.0025413914,"about_ca_topic_score_gemma":0.0018177866,"teacher_disagreement_score":0.0026799263,"about_ca_system_score_codex":0.0024123485,"about_ca_system_score_gemma":0.003284038,"threshold_uncertainty_score":0.017502904},"labels":[],"label_agreement":null},{"id":"W4283775510","doi":"10.1145/3477531","title":"Accountable Private Set Cardinality for Distributed Measurement","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Privacy and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Set operations; Computer security; Bloom filter; Set (abstract data type); Anonymity; Overhead (engineering); Adversary; Cardinality (data modeling); Distributed computing; Theoretical computer science; Computer network; Algorithm; Data mining","score_opus":0.045551619407016034,"score_gpt":0.27021143913678264,"score_spread":0.22465981972976662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283775510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031590387,0.00012422916,0.992285,0.00039959323,0.00007326578,0.00013291907,0.00009906037,0.00085481623,0.0028721066],"genre_scores_gemma":[0.3782503,0.0004136337,0.612756,0.0004934526,0.00031413097,0.0012771386,0.00045923397,0.00036854166,0.0056675114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98588055,0.004102137,0.0011954374,0.002086296,0.005789645,0.00094585004],"domain_scores_gemma":[0.9787901,0.0064698416,0.0020488093,0.01077275,0.0013605881,0.00055793015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008150715,0.0012436102,0.0013090955,0.0014485712,0.002445588,0.005189174,0.004401866,0.001995361,0.0053611724],"category_scores_gemma":[0.022816762,0.0010393744,0.0019004769,0.0024243365,0.005380723,0.014355209,0.0110003445,0.0071780304,0.0015560582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001758648,0.00008415343,0.00053939736,0.00012308362,0.000044072454,0.00012092521,0.00033730603,0.030014008,0.005252307,0.9299564,0.0022057367,0.031146754],"study_design_scores_gemma":[0.00007848356,0.00012928415,0.0002688804,0.00008208229,0.000052095078,0.00025788922,0.00011581907,0.29219586,0.016398434,0.66581595,0.024510523,0.00009476498],"about_ca_topic_score_codex":0.0011101306,"about_ca_topic_score_gemma":0.0009315512,"teacher_disagreement_score":0.008150715,"about_ca_system_score_codex":0.0034493692,"about_ca_system_score_gemma":0.0036364358,"threshold_uncertainty_score":0.043105602},"labels":[],"label_agreement":null},{"id":"W4285154716","doi":"10.1109/tifs.2022.3188147","title":"Toward Privacy-Preserving Aggregate Reverse Skyline Query With Strong Security","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Sargable; Query optimization; Online aggregation; Web query classification; Web search query; Skyline; Encryption; Query expansion; Range query (database); Bloom filter; Query language; Information retrieval; RDF query language; Database; Data mining; Computer network; Search engine","score_opus":0.01286306222578367,"score_gpt":0.21446288907127098,"score_spread":0.2015998268454873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285154716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061000958,0.00055882265,0.93224925,0.0010917212,0.00005667387,0.00025662917,0.0003452896,0.0014195573,0.003021121],"genre_scores_gemma":[0.8330235,0.00043037377,0.1625101,0.0005207419,0.00014199397,0.00022325922,0.00053080346,0.00010172442,0.0025175153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99198455,0.0021002803,0.0006081418,0.0011596493,0.003142142,0.0010051887],"domain_scores_gemma":[0.9905439,0.0028076835,0.0010762371,0.003787569,0.0014795368,0.00030508012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004450418,0.000724301,0.0017140883,0.0010510435,0.0016431952,0.0033134287,0.0020997778,0.0017490933,0.0016060821],"category_scores_gemma":[0.008957685,0.0005110623,0.0011492738,0.0024995047,0.0022736238,0.009217183,0.0063058315,0.0022887364,0.0007934936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002821367,0.0005074773,0.006928535,0.0006516875,0.0003002227,0.0018168751,0.0026753594,0.1579221,0.14315635,0.4248315,0.015582895,0.24280564],"study_design_scores_gemma":[0.00017373121,0.00030249543,0.000697541,0.00003197996,0.00008700228,0.0015676946,0.0006645938,0.8241644,0.04913115,0.113229774,0.00984536,0.00010430819],"about_ca_topic_score_codex":0.0012557183,"about_ca_topic_score_gemma":0.00079156505,"teacher_disagreement_score":0.004450418,"about_ca_system_score_codex":0.0015350612,"about_ca_system_score_gemma":0.0027803946,"threshold_uncertainty_score":0.023536384},"labels":[],"label_agreement":null},{"id":"W4285230782","doi":"10.1109/tcsi.2022.3176966","title":"DPCrypto: Acceleration of Post-Quantum Cryptography Using Dot-Product Instructions on GPUs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Computer science; Matrix multiplication; Dot product; Parallel computing; Cryptography; Multiplication (music); Convolution (computer science); Throughput; Key exchange; Polynomial; Computational science; Theoretical computer science; Encryption; Algorithm; Public-key cryptography; Mathematics; Quantum","score_opus":0.025371841364453893,"score_gpt":0.23310095023692137,"score_spread":0.20772910887246748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285230782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27218798,0.0009917978,0.6290355,0.0007362154,0.00043131947,0.00035179072,0.00094953564,0.032993384,0.06232257],"genre_scores_gemma":[0.70219594,0.000301504,0.28019777,0.00022974347,0.00006161334,0.00021921772,0.0010324233,0.0007659211,0.014995881],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996879,0.000048615064,0.000020154948,0.000041267886,0.00012673189,0.00007546053],"domain_scores_gemma":[0.9997111,0.000061950326,0.000024404248,0.00011624664,0.00006368745,0.000022567012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024663252,0.0005642833,0.00037161406,0.00046337236,0.0003089787,0.0007129459,0.00084131374,0.0004238991,0.007478864],"category_scores_gemma":[0.00086498895,0.00020181458,0.0002678424,0.00048415773,0.00038035944,0.0009803692,0.000668457,0.0007849614,0.001852555],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019235251,0.00048927456,0.00309479,0.00038594264,0.00009957351,0.0005623852,0.00044367235,0.06167026,0.22816966,0.1217279,0.0512673,0.5301657],"study_design_scores_gemma":[0.00028457775,0.0003443191,0.0013521505,0.000036704958,0.000022584925,0.0003037568,0.000040989766,0.64180005,0.2907509,0.012809634,0.05219036,0.00006400603],"about_ca_topic_score_codex":0.0019275123,"about_ca_topic_score_gemma":0.0019810589,"teacher_disagreement_score":0.007478864,"about_ca_system_score_codex":0.00069725484,"about_ca_system_score_gemma":0.0008923154,"threshold_uncertainty_score":0.025019288},"labels":[],"label_agreement":null},{"id":"W4285620293","doi":"10.5753/sbseg.2020.19228","title":"Post-quantum signature with preimage chameleon hashing","year":2020,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Hash function; Generalization; Computer science; Signature (topology); Theoretical computer science; Hash chain; Scheme (mathematics); Merkle signature scheme; Digital signature; Discrete mathematics; Mathematics; Blind signature; Computer security","score_opus":0.010093725716421158,"score_gpt":0.20118593836561188,"score_spread":0.1910922126491907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285620293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029049689,0.00041334814,0.9563616,0.0005824972,0.00030781733,0.00023690022,0.00010480681,0.00078083266,0.012162558],"genre_scores_gemma":[0.7238715,0.0004828942,0.25883463,0.00048981037,0.00043530867,0.0002856209,0.00022323169,0.0001964381,0.015180438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579155,0.0009438592,0.00024979864,0.00068655435,0.0018752685,0.00045296754],"domain_scores_gemma":[0.99496585,0.00096311583,0.00035298587,0.0030290454,0.0005236642,0.00016531955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021661979,0.00072115514,0.001169014,0.0008448839,0.0013051454,0.0021581561,0.0020047256,0.002453348,0.005838231],"category_scores_gemma":[0.0053694625,0.00046627678,0.0011806295,0.0010376449,0.0034615165,0.0077336244,0.00448726,0.0028587284,0.0026321008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003922798,0.00010556235,0.0005945212,0.00019677475,0.000044451015,0.0003050196,0.00035557811,0.017605804,0.015685305,0.885376,0.0024231207,0.076915614],"study_design_scores_gemma":[0.00015207537,0.0006025703,0.0005536462,0.00006681888,0.00006739473,0.0013683247,0.00012213086,0.21439914,0.0627332,0.68084943,0.038857933,0.00022732255],"about_ca_topic_score_codex":0.00034085283,"about_ca_topic_score_gemma":0.00026111412,"teacher_disagreement_score":0.005838231,"about_ca_system_score_codex":0.0012156108,"about_ca_system_score_gemma":0.0014839343,"threshold_uncertainty_score":0.019530892},"labels":[],"label_agreement":null},{"id":"W4287868577","doi":"10.48550/arxiv.2002.05097","title":"EncDBDB: Searchable Encrypted, Fast, Compressed, In-Memory Database\\n using Enclaves","year":2020,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Column (typography); Plaintext; Overhead (engineering); Database; Outsourcing; Cryptography; Cloud computing; Computer security; Computer network; Operating system","score_opus":0.14250328529997228,"score_gpt":0.22078829183032406,"score_spread":0.07828500653035178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287868577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14254923,0.005091844,0.61131394,0.0015171045,0.0005573217,0.00072915485,0.006946351,0.19336958,0.03792538],"genre_scores_gemma":[0.78524625,0.0026423396,0.15257806,0.0009510439,0.00015885191,0.0004899366,0.013097012,0.007762321,0.037074223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873227,0.00012142119,0.00013484266,0.00014769286,0.00066975557,0.00019399943],"domain_scores_gemma":[0.99756914,0.0002870913,0.00018879076,0.0014761536,0.00030752821,0.00017119249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069061684,0.00065765774,0.00049827626,0.00089289324,0.0005254611,0.0023069254,0.0017705534,0.00056429405,0.0077293436],"category_scores_gemma":[0.0035860604,0.00047495478,0.00028971166,0.0011213442,0.0008437917,0.004906197,0.004557405,0.00093835685,0.0033696105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004199448,0.0007344524,0.008344444,0.0015536596,0.00032128533,0.0016652961,0.0013880883,0.023523055,0.17973681,0.12333264,0.24017763,0.41502327],"study_design_scores_gemma":[0.00063270883,0.00041782545,0.0025469074,0.00021833293,0.000074191754,0.0020444533,0.00042030026,0.15385954,0.41532922,0.024283597,0.39999828,0.00017464429],"about_ca_topic_score_codex":0.002034906,"about_ca_topic_score_gemma":0.0015650257,"teacher_disagreement_score":0.0077293436,"about_ca_system_score_codex":0.00090977945,"about_ca_system_score_gemma":0.0013079197,"threshold_uncertainty_score":0.02585727},"labels":[],"label_agreement":null},{"id":"W4289223923","doi":"10.1038/s41598-022-15843-x","title":"A new quantum-safe multivariate polynomial public key digital signature algorithm","year":2022,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"","keywords":"Key (lock); Multivariate statistics; Computer science; Signature (topology); Polynomial; Public-key cryptography; Algorithm; Digital signature; Digital Signature Algorithm; Mathematics; Computer security; Machine learning","score_opus":0.013220681113495631,"score_gpt":0.2273426681343498,"score_spread":0.21412198702085417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289223923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017901989,0.0002493388,0.970763,0.0008853259,0.0002021739,0.00019033223,0.00021434494,0.0024550885,0.0071383095],"genre_scores_gemma":[0.27385592,0.00027837782,0.7117535,0.0005367119,0.00015093792,0.00024388854,0.0007937044,0.00022705276,0.012159972],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998409,0.00018676014,0.00011115855,0.0003174819,0.0007496494,0.00022596167],"domain_scores_gemma":[0.9992974,0.00010673822,0.00007892873,0.00021629928,0.00020442782,0.00009611366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006560958,0.0004978632,0.0008314755,0.0006967301,0.00090777065,0.0015774146,0.0018730706,0.0010231424,0.0057288962],"category_scores_gemma":[0.0017210108,0.0003187049,0.00067410636,0.0009447401,0.00082886143,0.0032433819,0.0023256273,0.001722099,0.0017836977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069182273,0.00029769682,0.0016040201,0.00026942647,0.0001031005,0.00043379745,0.00025646092,0.059174538,0.050372317,0.340164,0.017954081,0.5286787],"study_design_scores_gemma":[0.0003637266,0.00019469344,0.00033045406,0.000031073363,0.00005242888,0.0006394452,0.000053162763,0.7934507,0.038124148,0.103742756,0.06291884,0.000098597266],"about_ca_topic_score_codex":0.0010724606,"about_ca_topic_score_gemma":0.0011680613,"teacher_disagreement_score":0.0057288962,"about_ca_system_score_codex":0.0012842445,"about_ca_system_score_gemma":0.0024274935,"threshold_uncertainty_score":0.019165099},"labels":[],"label_agreement":null},{"id":"W4289539871","doi":"10.48550/arxiv.2103.05792","title":"Equi-Joins Over Encrypted Data for Series of Queries","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Waterloo","funders":"","keywords":"Encryption; Joins; Computer science; Filesystem-level encryption; Probabilistic encryption; 56-bit encryption; On-the-fly encryption; Multiple encryption; 40-bit encryption; Transitive closure; Client-side encryption; Scheme (mathematics); Theoretical computer science; Database; Computer security; Mathematics; Discrete mathematics","score_opus":0.13401256458900104,"score_gpt":0.2166980514141212,"score_spread":0.08268548682512017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289539871","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55914104,0.002248419,0.41540888,0.002681924,0.00027715683,0.00065269344,0.0037494563,0.0054694945,0.010370972],"genre_scores_gemma":[0.8670418,0.0004444374,0.12568939,0.0003131172,0.000101660095,0.00019338724,0.0027521187,0.0003218619,0.0031421985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891775,0.0018399995,0.0016123825,0.0014704486,0.004935344,0.00096422364],"domain_scores_gemma":[0.97905767,0.005277556,0.001966766,0.011596194,0.0017417064,0.00036014523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073091,0.00076363096,0.0010842445,0.0010008361,0.0016300009,0.00275333,0.0016857514,0.0012311372,0.0025360787],"category_scores_gemma":[0.016272185,0.00047998645,0.0010214433,0.0020065305,0.0021193177,0.011436838,0.003553868,0.0021175446,0.0008343621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057589216,0.0013791911,0.03676472,0.0014405153,0.000658297,0.002119281,0.002605597,0.17072512,0.12045043,0.25369754,0.033046827,0.37135357],"study_design_scores_gemma":[0.00048427284,0.0009164857,0.006918017,0.00012608434,0.00019889137,0.0034071812,0.0011404913,0.5008254,0.1827066,0.26087826,0.042260364,0.00013792433],"about_ca_topic_score_codex":0.0007984308,"about_ca_topic_score_gemma":0.0011141368,"teacher_disagreement_score":0.0073091,"about_ca_system_score_codex":0.0018964019,"about_ca_system_score_gemma":0.0022489543,"threshold_uncertainty_score":0.038654625},"labels":[],"label_agreement":null},{"id":"W4290994019","doi":"10.1109/icc45855.2022.9839017","title":"Achieving Privacy-Preserving Weighted Similarity Range Query over Outsourced eHealthcare Data","year":2022,"lang":"en","type":"article","venue":"ICC 2022 - IEEE International Conference on Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Range query (database); Encryption; Information retrieval; Data mining; Cloud computing; Similarity (geometry); Query optimization; Nearest neighbor search; Homomorphic encryption; Leverage (statistics); Information privacy; Web search query; Web query classification; Outsourcing; Theoretical computer science; Search engine; Artificial intelligence; Computer security","score_opus":0.20822705533436842,"score_gpt":0.3896952466490169,"score_spread":0.18146819131464847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290994019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0712661,0.0008831095,0.92094654,0.0008123852,0.00008230234,0.0003426005,0.0005597434,0.00080631877,0.004300826],"genre_scores_gemma":[0.8997813,0.00063070736,0.09532422,0.0003871075,0.00011906937,0.00022295554,0.00076779706,0.00006017087,0.002706628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99243003,0.0016349277,0.00078033557,0.0010746316,0.0032049122,0.0008751429],"domain_scores_gemma":[0.99378306,0.0018425777,0.00065531273,0.0024390225,0.0010777811,0.00020216405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034230147,0.00072078756,0.0017497122,0.00095533684,0.0010318765,0.0019374093,0.0018573357,0.0012696178,0.0017903176],"category_scores_gemma":[0.010474141,0.00032132256,0.0011611865,0.0025319988,0.0010528809,0.0067877974,0.005088477,0.0015286978,0.00067913864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023265798,0.0005207307,0.007665345,0.0010975467,0.00040181965,0.0022644082,0.0024875386,0.18581267,0.101118416,0.23949277,0.014298702,0.4425135],"study_design_scores_gemma":[0.0002129172,0.0005084921,0.0014545672,0.00004623209,0.00010656775,0.0020644756,0.0008880841,0.835434,0.050574157,0.09782577,0.010769153,0.000115535986],"about_ca_topic_score_codex":0.0014651673,"about_ca_topic_score_gemma":0.0007280431,"teacher_disagreement_score":0.0034230147,"about_ca_system_score_codex":0.0009970499,"about_ca_system_score_gemma":0.0016234461,"threshold_uncertainty_score":0.018102884},"labels":[],"label_agreement":null},{"id":"W4290996364","doi":"10.1109/icc45855.2022.9838995","title":"Securing E-Petition: A Privacy-Preserving Fine-Grained Electronic Petition System for Health and Political Petitions","year":2022,"lang":"en","type":"article","venue":"ICC 2022 - IEEE International Conference on Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer security; Internet privacy; Traceability; Anonymity; Cheating; Identity (music); Masking (illustration)","score_opus":0.06392920799831146,"score_gpt":0.3457327182788429,"score_spread":0.2818035102805314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290996364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11707431,0.0004484304,0.84855974,0.0009894257,0.00041525584,0.00089166954,0.000351404,0.017545637,0.013724063],"genre_scores_gemma":[0.8920387,0.0002092832,0.09027323,0.00047713946,0.00013535297,0.00032653834,0.0005867251,0.00016617702,0.015786901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970901,0.00076030666,0.00040760002,0.0005539777,0.0008194141,0.00036855316],"domain_scores_gemma":[0.9947503,0.0008021043,0.00055513246,0.0029859643,0.00057490135,0.0003316542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019511925,0.0004151519,0.00092289917,0.0006654508,0.0013516723,0.002081864,0.0016196589,0.001975118,0.0047562155],"category_scores_gemma":[0.0051792213,0.00034022072,0.0005550102,0.00073538744,0.001292168,0.0037205508,0.0038511904,0.0015597674,0.0019895553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037613653,0.0010064745,0.010991078,0.0007021518,0.00021096297,0.0045076073,0.0025308642,0.033247784,0.14382342,0.10955551,0.027325436,0.6623373],"study_design_scores_gemma":[0.00066913874,0.0018972632,0.009862807,0.000191974,0.00027153298,0.005955401,0.00064276473,0.5963276,0.18778889,0.042830408,0.1531368,0.00042551468],"about_ca_topic_score_codex":0.0008339058,"about_ca_topic_score_gemma":0.0004221574,"teacher_disagreement_score":0.0047562155,"about_ca_system_score_codex":0.000498548,"about_ca_system_score_gemma":0.0011420839,"threshold_uncertainty_score":0.015911102},"labels":[],"label_agreement":null},{"id":"W4291907974","doi":"10.1109/icccs55155.2022.9846785","title":"Digital Signature Performance of a New Quantum Safe Multivariate Polynomial Public Key Algorithm","year":2022,"lang":"en","type":"article","venue":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Computer science; Public-key cryptography; NIST; Byte; Theoretical computer science; Digital signature; Algorithm; Merkle signature scheme; Blind signature; Key (lock); Schnorr signature; Modular exponentiation; Hash function; Computer security; Computer hardware","score_opus":0.03904912373797201,"score_gpt":0.2607799866318216,"score_spread":0.2217308628938496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291907974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9411907,0.0006318339,0.045747276,0.00047436176,0.00010415525,0.00009946302,0.000296801,0.003171073,0.008284322],"genre_scores_gemma":[0.9780271,0.00010479926,0.020104334,0.000053181902,0.000014721733,0.00002035472,0.00032572617,0.00006090826,0.0012888815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974673,0.00033277262,0.00018377871,0.00037686437,0.0012280684,0.00041120747],"domain_scores_gemma":[0.9963839,0.0010998319,0.00046738217,0.00097331405,0.0007508897,0.0003245756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019137677,0.00046674217,0.0008660639,0.0009739528,0.000548092,0.0013524289,0.0011045834,0.0008373045,0.0035183295],"category_scores_gemma":[0.0063740653,0.0001660638,0.00034995034,0.0013736939,0.00075299107,0.0030038687,0.0010916746,0.00077171664,0.0004902488],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010694695,0.0013925891,0.02259238,0.00047373885,0.00036732078,0.00047756077,0.0003723673,0.49190873,0.1458666,0.031215286,0.007194697,0.28744408],"study_design_scores_gemma":[0.000284845,0.0011212578,0.0030685337,0.000012295351,0.000043470704,0.00020056321,0.000057288322,0.9230059,0.067062244,0.0021353774,0.0029619436,0.00004639969],"about_ca_topic_score_codex":0.0023634466,"about_ca_topic_score_gemma":0.0014208981,"teacher_disagreement_score":0.0035183295,"about_ca_system_score_codex":0.0019188721,"about_ca_system_score_gemma":0.0013694469,"threshold_uncertainty_score":0.013922393},"labels":[],"label_agreement":null},{"id":"W4292264668","doi":"10.1109/tdsc.2022.3199326","title":"A Comparison of Four Notions of Isomorphism-Based Security for Graphs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Graph homomorphism; Notation; Theoretical computer science; Computer science; Graph; Computational complexity theory; Discrete mathematics; Isomorphism (crystallography); Graph automorphism; Graph property; Adversary; Combinatorics; Mathematics; Algorithm; Line graph; Voltage graph","score_opus":0.032440064605695824,"score_gpt":0.28622477444507316,"score_spread":0.25378470983937734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292264668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08119909,0.0038307167,0.84622496,0.012304522,0.0005427221,0.0005442506,0.00061004935,0.0008639259,0.053879812],"genre_scores_gemma":[0.75928557,0.0038066672,0.22737886,0.0017820676,0.0009324157,0.0005608979,0.0007899341,0.00037658127,0.0050870413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9796912,0.008105482,0.0016556135,0.0037468518,0.0048009693,0.0019999063],"domain_scores_gemma":[0.93974537,0.03373716,0.0052594813,0.01589582,0.0026957064,0.0026663733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01269157,0.0019184421,0.0018710099,0.005692869,0.003183054,0.010578416,0.00474592,0.0048134928,0.005286577],"category_scores_gemma":[0.036450233,0.0013832524,0.0045341034,0.0056520617,0.021031592,0.0359649,0.013715218,0.011113211,0.00076854153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014076721,0.0000741617,0.0005126037,0.00019507372,0.0000435358,0.000042048152,0.0003887426,0.006919639,0.0008037868,0.97851,0.0011289141,0.011240721],"study_design_scores_gemma":[0.000040267078,0.00018418836,0.00069130084,0.00014571333,0.0000739241,0.00028068502,0.00039833033,0.025296938,0.0020555488,0.963078,0.0076733637,0.000081823404],"about_ca_topic_score_codex":0.0012305246,"about_ca_topic_score_gemma":0.00090706814,"teacher_disagreement_score":0.01269157,"about_ca_system_score_codex":0.0060064644,"about_ca_system_score_gemma":0.004147585,"threshold_uncertainty_score":0.067120254},"labels":[],"label_agreement":null},{"id":"W4293253938","doi":"10.1109/pst55820.2022.9851964","title":"An Efficient, Verifiable, and Dynamic Searchable Symmetric Encryption with Forward Privacy","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Computer science; Cloud computing; Server; Encryption; Verifiable secret sharing; Symmetric-key algorithm; Construct (python library); Scheme (mathematics); Cloud server; Private information retrieval; Completeness (order theory); Security analysis; Computer security; Cryptography; Theoretical computer science; Computer network; Public-key cryptography; Operating system; Mathematics","score_opus":0.006678385294092209,"score_gpt":0.23177530682642628,"score_spread":0.22509692153233407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293253938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017252825,0.0006684657,0.9725586,0.0011598619,0.0001440216,0.00033842836,0.00058157864,0.00072981336,0.0065663294],"genre_scores_gemma":[0.70548004,0.0010530859,0.2799575,0.0005587462,0.00021288455,0.00048151758,0.00087565015,0.000106212865,0.011274408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935179,0.0012959638,0.0005406556,0.00081113534,0.0030931872,0.000741209],"domain_scores_gemma":[0.9953751,0.0011670826,0.00040644227,0.0022188625,0.00067967514,0.00015292743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036289142,0.0007021734,0.0013665394,0.0010338845,0.001283281,0.002325529,0.0031443497,0.0017007459,0.002420452],"category_scores_gemma":[0.0058827577,0.00068837544,0.0014788159,0.0019844086,0.002060193,0.007733291,0.0048340666,0.0027174952,0.0010159231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009856739,0.00035637396,0.0014189738,0.00063007034,0.00015439162,0.00090883806,0.00063343433,0.04804747,0.044789072,0.7493019,0.013666605,0.1391072],"study_design_scores_gemma":[0.0005794592,0.00046658047,0.0008186158,0.00015220437,0.00020266906,0.0027431652,0.00017980245,0.6254068,0.071198665,0.25174066,0.04629256,0.00021880568],"about_ca_topic_score_codex":0.001176863,"about_ca_topic_score_gemma":0.0011713983,"teacher_disagreement_score":0.0036289142,"about_ca_system_score_codex":0.0020937307,"about_ca_system_score_gemma":0.004209673,"threshold_uncertainty_score":0.019191742},"labels":[],"label_agreement":null},{"id":"W4294016308","doi":"10.48550/arxiv.2107.12407","title":"Selective MPC: Distributed Computation of Differentially Private\\n Key-Value Statistics","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada","keywords":"Computation; Computer science; Key (lock); Server; Noise (video); Secure multi-party computation; Value (mathematics); Theoretical computer science; Distributed computing; Algorithm; Artificial intelligence; Computer network; Computer security; Machine learning","score_opus":0.0356058748239668,"score_gpt":0.1928175394153083,"score_spread":0.1572116645913415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294016308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06585629,0.00021386302,0.92862576,0.00037332674,0.00003467549,0.00012482778,0.00015032082,0.0020241619,0.0025967387],"genre_scores_gemma":[0.90214586,0.00013177618,0.09562959,0.00015622922,0.000054793778,0.00013204274,0.00014665462,0.00010181552,0.0015011547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960789,0.0011549927,0.00021232561,0.000715877,0.0014126645,0.0004253007],"domain_scores_gemma":[0.9888087,0.003014284,0.00092761737,0.0064446786,0.0005573871,0.00024739045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030398648,0.00055305584,0.00089485646,0.0005814368,0.0009658267,0.0016777384,0.0022545916,0.000732303,0.0013867068],"category_scores_gemma":[0.009425812,0.00040976916,0.0005595925,0.0010682493,0.0022123093,0.003519831,0.0051057325,0.001434667,0.0006087364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001865977,0.00030023546,0.010954332,0.00043099868,0.00029451447,0.00078052894,0.00090854976,0.25532922,0.070239946,0.3374401,0.008447834,0.31300768],"study_design_scores_gemma":[0.00006852513,0.00015990353,0.0007493245,0.000020258869,0.000039181563,0.00025634814,0.00006470503,0.8538509,0.04743877,0.09348268,0.0038398649,0.000029519439],"about_ca_topic_score_codex":0.00090051745,"about_ca_topic_score_gemma":0.0011860636,"teacher_disagreement_score":0.0030398648,"about_ca_system_score_codex":0.0013579354,"about_ca_system_score_gemma":0.0022266973,"threshold_uncertainty_score":0.016076565},"labels":[],"label_agreement":null},{"id":"W4297173301","doi":"10.48550/arxiv.1505.03110","title":"Near-optimal bounds on bounded-round quantum communication complexity of\\n disjointness","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; National Science Foundation","keywords":"Communication complexity; Upper and lower bounds; Corollary; Bounded function; Mathematics; Quantum; Quantum information science; Omega; Logarithm; Function (biology); Discrete mathematics; Quantum information; Computational complexity theory; Combinatorics; Physics; Algorithm; Quantum mechanics; Mathematical analysis; Quantum entanglement","score_opus":0.16017047485281916,"score_gpt":0.22978787054716,"score_spread":0.06961739569434083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297173301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119284265,0.0019447664,0.8251354,0.0070064324,0.00029036865,0.0003027782,0.00061697105,0.0010268275,0.04439223],"genre_scores_gemma":[0.79378456,0.0014284244,0.19113761,0.0012492948,0.0004580717,0.00080987625,0.00052793673,0.0007121252,0.009892058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98757184,0.00397151,0.000450867,0.0024145374,0.003451699,0.0021395367],"domain_scores_gemma":[0.9402543,0.044425327,0.0019020981,0.010671538,0.001426022,0.001320824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009070754,0.0019107459,0.0020902785,0.0015226825,0.0022916617,0.005666022,0.005276942,0.0029136976,0.010247635],"category_scores_gemma":[0.03930022,0.0011647309,0.0027457178,0.001653684,0.00783936,0.01722271,0.009693405,0.009885179,0.0017386168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009868824,0.00018522584,0.0007393794,0.00039918607,0.00009658433,0.00017386324,0.00046005467,0.0900038,0.011545855,0.86176157,0.004518234,0.029129378],"study_design_scores_gemma":[0.00007971268,0.00009736581,0.0002947619,0.00006998998,0.000052234886,0.00010936322,0.00007132857,0.35905075,0.008635254,0.6289169,0.0025612104,0.00006111952],"about_ca_topic_score_codex":0.001370623,"about_ca_topic_score_gemma":0.0014744378,"teacher_disagreement_score":0.010247635,"about_ca_system_score_codex":0.006171328,"about_ca_system_score_gemma":0.0038039393,"threshold_uncertainty_score":0.04797131},"labels":[],"label_agreement":null},{"id":"W4298423519","doi":"","title":"Cryptographic Protocol to Establish Trusted History of Interactions","year":2006,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cryptographic protocol; Cryptography; Computer science; Protocol (science); Computer security; Cryptographic primitive; Medicine","score_opus":0.010798778780712441,"score_gpt":0.22427323921517622,"score_spread":0.21347446043446378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298423519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024155565,0.00058100664,0.9488475,0.0016162548,0.00066643656,0.0006091497,0.000444853,0.0026578845,0.020421304],"genre_scores_gemma":[0.7347735,0.00065430516,0.22670192,0.0005701987,0.00053125987,0.0010947516,0.00096221035,0.00042802174,0.03428376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930594,0.0017508882,0.00070126046,0.00087271864,0.0027623086,0.00085340627],"domain_scores_gemma":[0.97210914,0.00715509,0.0017682851,0.013989861,0.003310732,0.0016669178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067451177,0.00089908054,0.0014101838,0.0027626494,0.003485249,0.004530939,0.0027673892,0.0025840618,0.009659322],"category_scores_gemma":[0.020142632,0.0010681368,0.0010671477,0.0025005296,0.0036769416,0.012390621,0.009090319,0.005675785,0.0055084303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005933937,0.00011557943,0.0006824395,0.00019149411,0.00006494936,0.00032637946,0.0008366377,0.005293331,0.007931724,0.92769176,0.007494718,0.04877763],"study_design_scores_gemma":[0.00042541194,0.000529618,0.0005669533,0.00024412092,0.00020589672,0.00096731284,0.00039927004,0.14921463,0.046715118,0.71505535,0.085476786,0.00019952236],"about_ca_topic_score_codex":0.0006363874,"about_ca_topic_score_gemma":0.00065787026,"teacher_disagreement_score":0.009659322,"about_ca_system_score_codex":0.0020327226,"about_ca_system_score_gemma":0.0047855214,"threshold_uncertainty_score":0.03567201},"labels":[],"label_agreement":null},{"id":"W4300023864","doi":"10.1007/978-1-4419-5906-5_148","title":"Identity-Based Encryption","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Encryption; Identity (music); Computer science; Computer security; Sociology; Art; Aesthetics","score_opus":0.03146300829601379,"score_gpt":0.23160575991134275,"score_spread":0.20014275161532896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300023864","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001795817,0.02584143,0.09249198,0.0015322207,0.0019576945,0.00012323668,0.00024453676,0.0005306952,0.8754824],"genre_scores_gemma":[0.031470645,0.028238077,0.027847087,0.00088814023,0.00087139243,0.00011513437,0.0005249431,0.00020970257,0.9098348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995988,0.000060769213,0.000019229485,0.000058093934,0.00022369018,0.00003950103],"domain_scores_gemma":[0.99983656,0.000044151235,0.000008730676,0.000058421476,0.000042910866,0.000009184175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028953218,0.0008956647,0.0005011122,0.00096674,0.000878964,0.00218922,0.00073455536,0.0008333256,0.027576784],"category_scores_gemma":[0.0006435408,0.00034675654,0.00033215684,0.0015963484,0.0011598533,0.0037399319,0.0012647621,0.0022543308,0.021361616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001866025,0.000051387262,0.000047126698,0.00026582959,0.000008163449,0.00007089623,0.00027416224,0.0007465535,0.002207454,0.57320744,0.11441811,0.30868417],"study_design_scores_gemma":[0.000005386058,0.000022131708,0.000094573676,0.00017044802,0.000006799706,0.00035918906,0.000051496547,0.0011329975,0.0024869496,0.12644747,0.8692104,0.000012132658],"about_ca_topic_score_codex":0.00045307554,"about_ca_topic_score_gemma":0.0007213421,"teacher_disagreement_score":0.027576784,"about_ca_system_score_codex":0.0010754275,"about_ca_system_score_gemma":0.00084851484,"threshold_uncertainty_score":0.092253506},"labels":[],"label_agreement":null},{"id":"W4307812414","doi":"10.1093/comjnl/bxac132","title":"The Need for Being Explicit: Failed Attempts to Construct Implicit Certificates from Lattices","year":2022,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Certificate; Computer security; Construct (python library); Public-key cryptography; NIST; Cryptographic primitive; Cryptanalysis; Cryptography; Emulation; Encryption; Theoretical computer science; Computer network; Cryptographic protocol","score_opus":0.02261532536164305,"score_gpt":0.25521682204278007,"score_spread":0.23260149668113703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307812414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09694265,0.0010669805,0.8620927,0.011008176,0.0004969353,0.00023060144,0.00012565269,0.0011645037,0.026871772],"genre_scores_gemma":[0.73478204,0.00076691504,0.2555775,0.00081437523,0.00018999865,0.00023443607,0.0001390146,0.00036987083,0.007125881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98570096,0.0072226464,0.0008268486,0.0012076559,0.0040713474,0.00097056734],"domain_scores_gemma":[0.9326032,0.026289033,0.0021550832,0.031974755,0.005419367,0.00155858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014136335,0.0005290028,0.0011840346,0.0009888229,0.0031533663,0.0061629578,0.0025378282,0.0028564294,0.003515363],"category_scores_gemma":[0.05444675,0.00095545285,0.0010563844,0.0013425542,0.012869283,0.017998166,0.011070526,0.009405452,0.0015486025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009696234,0.00003903923,0.00028108968,0.00010350499,0.000009840585,0.00006453278,0.00097309746,0.0043478804,0.0015890644,0.97014076,0.0017045961,0.02064963],"study_design_scores_gemma":[0.000095420044,0.0001804075,0.00014787362,0.00022850839,0.000018806979,0.0003099056,0.0005663993,0.03628973,0.014271367,0.9034595,0.044308297,0.00012382021],"about_ca_topic_score_codex":0.000617016,"about_ca_topic_score_gemma":0.00045232923,"teacher_disagreement_score":0.014136335,"about_ca_system_score_codex":0.0023006091,"about_ca_system_score_gemma":0.0026463417,"threshold_uncertainty_score":0.07476097},"labels":[],"label_agreement":null},{"id":"W4307823777","doi":"10.1145/3560827.3563377","title":"PROBONITE","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphic encryption; Computer science; Interpretability; Node (physics); Decision tree; Tree (set theory); Protocol (science); Scheme (mathematics); Theoretical computer science; Machine learning; Artificial intelligence; Bootstrapping (finance); Cryptography; Encryption; Data mining; Algorithm; Computer network; Mathematics","score_opus":0.007839732248458676,"score_gpt":0.19800276417867668,"score_spread":0.190163031930218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307823777","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010356685,0.001845395,0.32731277,0.0069909994,0.0023102993,0.0013538338,0.018322617,0.095029056,0.53647834],"genre_scores_gemma":[0.18375918,0.0020300446,0.12889993,0.004967732,0.00093322364,0.0019489052,0.031921297,0.026782094,0.6187575],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968574,0.0006989851,0.00020727584,0.00054214575,0.0012278795,0.00046628236],"domain_scores_gemma":[0.99552816,0.0011354425,0.0002233266,0.0018464911,0.0009754519,0.00029116447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024453471,0.0009986736,0.0008186389,0.0013159128,0.001801322,0.0042039165,0.0020918974,0.0019110334,0.19710518],"category_scores_gemma":[0.0081753535,0.00075118826,0.0007453806,0.0011790448,0.0011249047,0.008210481,0.0058209007,0.0033869783,0.096195705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011652703,0.00029488202,0.0015685564,0.00081617973,0.000061314844,0.0005368598,0.00045201872,0.0024096551,0.0060256557,0.27031705,0.43873236,0.27762017],"study_design_scores_gemma":[0.00006971792,0.000083123574,0.00044950072,0.00016649521,0.000018254046,0.0005095222,0.000103903185,0.010729717,0.007230151,0.077697724,0.9028817,0.000060311097],"about_ca_topic_score_codex":0.0016292157,"about_ca_topic_score_gemma":0.0020427404,"teacher_disagreement_score":0.19710518,"about_ca_system_score_codex":0.001488148,"about_ca_system_score_gemma":0.0021337792,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4308381125","doi":"10.1145/3548606.3560559","title":"Selective MPC","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computation; Key (lock); Server; Noise (video); Secure multi-party computation; Protocol (science); Distributed computing; Theoretical computer science; Algorithm; Artificial intelligence; Computer network; Computer security","score_opus":0.026691047266389538,"score_gpt":0.2549065721040585,"score_spread":0.22821552483766894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308381125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084119916,0.00051328744,0.8921136,0.0012459,0.00011949108,0.00046585282,0.0006247905,0.004930615,0.01586649],"genre_scores_gemma":[0.9315379,0.00019042191,0.0615952,0.0003738766,0.00007961348,0.0003014063,0.00033071297,0.00024862337,0.0053421347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915855,0.0018293491,0.0006030888,0.0018274563,0.0031255344,0.0010290908],"domain_scores_gemma":[0.97819155,0.0042127534,0.0012875956,0.014410317,0.0015514698,0.0003462472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033623949,0.0007724303,0.0011611704,0.0005736314,0.0013512515,0.0022173559,0.0025443027,0.001119123,0.0044385246],"category_scores_gemma":[0.013814756,0.0005787031,0.00080842443,0.0011158474,0.0021195072,0.0062503894,0.0073638703,0.0024441236,0.0020247588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021439404,0.00041478514,0.0132437805,0.0009177236,0.0003681598,0.0011226526,0.0015510885,0.12024326,0.095490694,0.41520235,0.019185051,0.3301165],"study_design_scores_gemma":[0.00011771012,0.00039589553,0.0019759594,0.000087821965,0.00014145137,0.0013237231,0.0002988529,0.64491165,0.108011894,0.21190329,0.030740209,0.00009151507],"about_ca_topic_score_codex":0.0010113448,"about_ca_topic_score_gemma":0.0009986274,"teacher_disagreement_score":0.0044385246,"about_ca_system_score_codex":0.001463285,"about_ca_system_score_gemma":0.0028197675,"threshold_uncertainty_score":0.01778227},"labels":[],"label_agreement":null},{"id":"W4308868546","doi":"10.3390/cryptography6040055","title":"Improving User Privacy in Identity-Based Encryption Environments","year":2022,"lang":"en","type":"article","venue":"Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Collusion; Computer security; Public-key cryptography; Encryption; Key (lock); Ciphertext; Cryptography; Public key infrastructure; Identity (music); Business","score_opus":0.009999869954478643,"score_gpt":0.22544759615746304,"score_spread":0.2154477262029844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308868546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035259467,0.001493557,0.95269823,0.0011117082,0.000079242185,0.00013043813,0.000038800077,0.0009641851,0.008224355],"genre_scores_gemma":[0.85351235,0.0015437757,0.13907345,0.00028515354,0.00010620045,0.00012390729,0.000077179175,0.000115539784,0.0051624468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878406,0.0057329116,0.0005385952,0.0012150517,0.003082912,0.0015898843],"domain_scores_gemma":[0.98922706,0.0039510983,0.00085464306,0.004752337,0.0007861359,0.0004287934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006732734,0.0012242134,0.0012931229,0.0009058456,0.0023716886,0.005282634,0.00286179,0.002956982,0.0027428702],"category_scores_gemma":[0.012545653,0.00086004834,0.0012328207,0.0013670811,0.0032075285,0.015053824,0.010112091,0.004695414,0.0016031311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089067064,0.0004238566,0.0030497846,0.00049198436,0.0001366212,0.00083294493,0.0015924947,0.09303135,0.019541379,0.72159505,0.0047631282,0.15365079],"study_design_scores_gemma":[0.00012034227,0.0003514038,0.0008130703,0.00013615203,0.00010962619,0.0012075631,0.0005492104,0.55620855,0.034091838,0.3766962,0.029609472,0.00010660148],"about_ca_topic_score_codex":0.00058783736,"about_ca_topic_score_gemma":0.0003161245,"teacher_disagreement_score":0.006732734,"about_ca_system_score_codex":0.0013716435,"about_ca_system_score_gemma":0.0017821888,"threshold_uncertainty_score":0.035606503},"labels":[],"label_agreement":null},{"id":"W4309845020","doi":"10.48550/arxiv.2007.00033","title":"Traceable Policy-Based Signatures and Instantiation from Lattices","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Innovates; National Research Foundation","keywords":"Traceability; Computer security; Signature (topology); Computer science; Identity (music); Digital signature; Encryption; Modular design; Scheme (mathematics); Group signature; Key (lock); Public-key cryptography; Theoretical computer science; Mathematics; Software engineering; Physics; Hash function; Programming language","score_opus":0.060219650896263105,"score_gpt":0.19056402459215857,"score_spread":0.13034437369589547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309845020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013065088,0.0003041666,0.97100484,0.0015600303,0.0001295559,0.00017993576,0.00024471752,0.000704397,0.01280723],"genre_scores_gemma":[0.46884197,0.0007393053,0.5142035,0.0009745051,0.00037846144,0.00069221447,0.0007126009,0.00052152126,0.012935995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863296,0.005005403,0.001072383,0.0024765395,0.003965077,0.0011510674],"domain_scores_gemma":[0.9857755,0.005930716,0.0009438157,0.005582798,0.0010739804,0.0006932505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072260527,0.0010614035,0.001294021,0.001557258,0.0026521601,0.007287397,0.0026953418,0.0024769516,0.0061998083],"category_scores_gemma":[0.022058252,0.00115201,0.0031750528,0.0021132766,0.0122175375,0.01618473,0.0111055365,0.009394875,0.0018126147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023380386,0.000015483909,0.000061188795,0.00002926316,0.0000063996426,0.000042016596,0.00019288727,0.0027120118,0.00033691345,0.99156076,0.00034648392,0.0046732575],"study_design_scores_gemma":[0.000022052127,0.000017726597,0.00002309296,0.000021588077,0.000006406784,0.00006036704,0.000038789374,0.011093643,0.001320058,0.9808152,0.006560225,0.000020937656],"about_ca_topic_score_codex":0.0012915523,"about_ca_topic_score_gemma":0.0007186969,"teacher_disagreement_score":0.007287397,"about_ca_system_score_codex":0.004646662,"about_ca_system_score_gemma":0.003317631,"threshold_uncertainty_score":0.03821546},"labels":[],"label_agreement":null},{"id":"W4311166090","doi":"10.1145/3564625.3564635","title":"ArchiveSafe LT: Secure Long-term Archiving System","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vector Institute; McMaster University","funders":"","keywords":"Computer science; Confidentiality; Cryptography; Computer security; Adversarial system; Cryptographic primitive; Secret sharing; Private information retrieval; Term (time); Information sharing; Key (lock); Cryptographic protocol; World Wide Web","score_opus":0.008910140707389097,"score_gpt":0.21331002655873804,"score_spread":0.20439988585134894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311166090","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057117257,0.0010393227,0.8466498,0.0009392956,0.00020238607,0.0009770025,0.0011662003,0.07202221,0.01988657],"genre_scores_gemma":[0.6882627,0.0005318149,0.28112188,0.00066227576,0.000161671,0.0007696396,0.0019438441,0.0014498697,0.02509633],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743265,0.00047005573,0.00024726958,0.00036537243,0.0012351495,0.00024948403],"domain_scores_gemma":[0.996139,0.00055952795,0.000493159,0.0018884385,0.0006993939,0.00022049948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029871545,0.0007197305,0.00073934253,0.0011177778,0.0016297726,0.002897234,0.0028532923,0.0018026883,0.008916033],"category_scores_gemma":[0.0049103056,0.0004725847,0.00086904934,0.0008271773,0.001464806,0.0048168493,0.003892642,0.002152149,0.003949852],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006142961,0.0010325995,0.008918649,0.0016220665,0.0005106155,0.002492448,0.0028840806,0.050640527,0.13356888,0.22594376,0.09492988,0.47131354],"study_design_scores_gemma":[0.000703424,0.00166645,0.0035385615,0.00032935978,0.0003493842,0.003737184,0.0004665178,0.48137864,0.23725794,0.053348277,0.21677025,0.00045402328],"about_ca_topic_score_codex":0.0018016512,"about_ca_topic_score_gemma":0.0011112262,"teacher_disagreement_score":0.008916033,"about_ca_system_score_codex":0.0017355855,"about_ca_system_score_gemma":0.0025538565,"threshold_uncertainty_score":0.029827058},"labels":[],"label_agreement":null},{"id":"W4312125889","doi":"10.3390/app122412720","title":"A Localized Bloom Filter-Based CP-ABE in Smart Healthcare","year":2022,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Encryption; Attribute-based encryption; Computer security; Computer science; Cloud computing; Ciphertext; Internet privacy; Cryptography; Client-side encryption; Health care; The Internet; Access control; On-the-fly encryption; Public-key cryptography; World Wide Web; Political science","score_opus":0.026619458411482444,"score_gpt":0.26041858577884786,"score_spread":0.2337991273673654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312125889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020546542,0.0020314602,0.9643853,0.0010721338,0.00024709126,0.00039787166,0.0003714867,0.0010740875,0.009874046],"genre_scores_gemma":[0.52348095,0.0028036886,0.45642254,0.00086832396,0.00020768458,0.0004872164,0.00096821383,0.000085477375,0.014676002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778455,0.00053682964,0.00023468236,0.00039136488,0.0007416435,0.00031096736],"domain_scores_gemma":[0.9990994,0.00023730245,0.00009675911,0.00016843736,0.00031007032,0.000088218294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235725,0.00056675414,0.0013011334,0.0007531752,0.0013164142,0.002260175,0.001452885,0.0015251007,0.0027364187],"category_scores_gemma":[0.0022005434,0.00033482845,0.0010082475,0.0013704312,0.0007609069,0.0041206446,0.00175055,0.0013376335,0.0012336058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001816481,0.0004948679,0.00261784,0.0006303314,0.00019262504,0.0010228254,0.00063876587,0.18854192,0.06874151,0.3245217,0.021899397,0.38888168],"study_design_scores_gemma":[0.00008883834,0.00021509164,0.0004302655,0.000072063776,0.000056069828,0.000542151,0.00014738715,0.88914806,0.022871464,0.05560683,0.030728383,0.00009337591],"about_ca_topic_score_codex":0.0065575484,"about_ca_topic_score_gemma":0.004882701,"teacher_disagreement_score":0.0065575484,"about_ca_system_score_codex":0.0025748818,"about_ca_system_score_gemma":0.0042644343,"threshold_uncertainty_score":0.018682122},"labels":[],"label_agreement":null},{"id":"W4312296236","doi":"10.1109/seed55351.2022.00013","title":"Accelerating Polynomial Multiplication for Homomorphic Encryption on GPUs","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Speedup; Parallel computing; Homomorphic encryption; Modular arithmetic; Matrix multiplication; Multiplication (music); Encryption; Lattice reduction; Cryptography; Algorithm; Mathematics; Quantum","score_opus":0.03598468610296573,"score_gpt":0.26069553035877097,"score_spread":0.22471084425580523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312296236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37566465,0.0009685605,0.5790919,0.0005691531,0.00022932242,0.00011594384,0.0003173683,0.0062645185,0.036778674],"genre_scores_gemma":[0.73078495,0.00028810688,0.26172134,0.00014573279,0.000040987914,0.00009207466,0.00039486415,0.0003170362,0.0062149945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997192,0.000046390003,0.000014647464,0.000031104675,0.00013207119,0.00005659968],"domain_scores_gemma":[0.9996985,0.00008905919,0.000022944387,0.00009914401,0.000073057236,0.000017285687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023779098,0.0004918259,0.0003396981,0.00039324086,0.00029832628,0.00063710654,0.00063266006,0.00031654674,0.004743286],"category_scores_gemma":[0.0011226331,0.00017303934,0.00043182372,0.00055998657,0.00037094508,0.00093899644,0.0005626265,0.00072026736,0.0011974239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011825296,0.00043881597,0.005301734,0.00048634564,0.00014625753,0.00065656507,0.0005522687,0.20284317,0.20818675,0.15533258,0.026377691,0.3984953],"study_design_scores_gemma":[0.00013255775,0.00021732267,0.0009864883,0.000028123975,0.000023503437,0.00019547618,0.000068004774,0.89824563,0.06347728,0.018860616,0.01774013,0.000024922212],"about_ca_topic_score_codex":0.0020682614,"about_ca_topic_score_gemma":0.004111573,"teacher_disagreement_score":0.004743286,"about_ca_system_score_codex":0.00064853916,"about_ca_system_score_gemma":0.0007594255,"threshold_uncertainty_score":0.01586783},"labels":[],"label_agreement":null},{"id":"W4312305644","doi":"10.1109/itc-cscc55581.2022.9895015","title":"BLS12-381 Pairing Implementation with RAM Footprint Smaller than 4KB","year":2022,"lang":"en","type":"article","venue":"2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Swine Innovation Porc","keywords":"Computer science; Encryption; Cryptography; Pairing; Elliptic curve cryptography; Arduino; Signature (topology); Embedded system; Computer network; Theoretical computer science; Computer security; Public-key cryptography; Mathematics","score_opus":0.060429229446500775,"score_gpt":0.30135087693667445,"score_spread":0.24092164749017367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312305644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3418635,0.0022526653,0.5612933,0.0007646458,0.0010208961,0.00084761594,0.0007991035,0.023256838,0.0679013],"genre_scores_gemma":[0.880543,0.0002922724,0.09895292,0.00025080887,0.00011358529,0.000312911,0.00068575173,0.00043159796,0.018417241],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928087,0.00015235525,0.00008083505,0.00010963193,0.00023122542,0.00014501449],"domain_scores_gemma":[0.99934167,0.00007818185,0.000096213575,0.00024005327,0.00018553276,0.00005835086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050419103,0.0006648026,0.0005055913,0.0006409058,0.0005271778,0.0006489704,0.0008321548,0.0004232595,0.016864723],"category_scores_gemma":[0.00091028505,0.00023587051,0.00024494174,0.00047214684,0.0003026564,0.0017052467,0.00084494863,0.0004933131,0.0057193353],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004716978,0.00066157826,0.0052407742,0.0016877084,0.0001447401,0.00098822,0.0008738523,0.008957496,0.4166124,0.042930745,0.028180249,0.4890053],"study_design_scores_gemma":[0.0004918391,0.0044310717,0.0034211548,0.000113756236,0.00010678342,0.0022590458,0.00025812106,0.045542482,0.7497135,0.009213478,0.18429871,0.00015006891],"about_ca_topic_score_codex":0.00014153613,"about_ca_topic_score_gemma":0.00018473066,"teacher_disagreement_score":0.016864723,"about_ca_system_score_codex":0.00027264754,"about_ca_system_score_gemma":0.0006048748,"threshold_uncertainty_score":0.05641812},"labels":[],"label_agreement":null},{"id":"W4312544130","doi":"10.1109/tifs.2022.3231785","title":"SetRkNN: Efficient and Privacy-Preserving Set Reverse kNN Query in Cloud","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China; China Postdoctoral Science Foundation; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Homomorphic encryption; Information privacy; Outsourcing; Private information retrieval; Bloom filter; Set (abstract data type); Data mining; Computer security; Computer network","score_opus":0.010277479024432103,"score_gpt":0.21780201262614662,"score_spread":0.20752453360171452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312544130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10776809,0.001240644,0.87937695,0.00077237183,0.00016778598,0.0005794764,0.0014310658,0.0026512786,0.0060123587],"genre_scores_gemma":[0.6912748,0.00053418457,0.30048183,0.00040946886,0.000075401425,0.00024389055,0.0019248253,0.0001300811,0.0049255034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959699,0.0005953781,0.00036525488,0.00073820574,0.0018486253,0.00048278706],"domain_scores_gemma":[0.9969867,0.0005147244,0.00026783685,0.0016461303,0.00044034104,0.00014419106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019438158,0.00049959216,0.0015948731,0.00096604857,0.0017024899,0.001702755,0.0024148237,0.0011660969,0.0021576982],"category_scores_gemma":[0.0043092486,0.00033776427,0.00088816916,0.002701947,0.0011969187,0.006329467,0.00433245,0.0011529295,0.0007455755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032344195,0.0007013823,0.006563935,0.0007799356,0.00027427002,0.000980934,0.0017921778,0.17296568,0.0777338,0.15170725,0.026108874,0.5571574],"study_design_scores_gemma":[0.00022008333,0.00043909822,0.0017503179,0.000045200068,0.00007566382,0.0013608524,0.0007660612,0.84865564,0.04557907,0.081404075,0.01954338,0.00016060892],"about_ca_topic_score_codex":0.005688784,"about_ca_topic_score_gemma":0.005961826,"teacher_disagreement_score":0.005688784,"about_ca_system_score_codex":0.0019619574,"about_ca_system_score_gemma":0.002638672,"threshold_uncertainty_score":0.014235079},"labels":[],"label_agreement":null},{"id":"W4312617070","doi":"10.1109/tdsc.2022.3227650","title":"Multi-Client Boolean File Retrieval With Adaptable Authorization Switching for Secure Cloud Search Services","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Program of Shanghai Academic Research Leader; Shanghai Rising-Star Program; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Cloud storage; Initialization; Database; Theoretical computer science; Operating system; Programming language","score_opus":0.016528263604722256,"score_gpt":0.24141054355497776,"score_spread":0.2248822799502555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312617070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15784946,0.0031598806,0.7233316,0.0013988828,0.0003550593,0.0011714584,0.00285322,0.08881497,0.0210655],"genre_scores_gemma":[0.83690304,0.0003931987,0.14830792,0.00058927876,0.00012094543,0.00028616984,0.0024230345,0.0008522589,0.010124102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782455,0.00030122636,0.00026053956,0.00036642168,0.000795461,0.00045186022],"domain_scores_gemma":[0.9976737,0.00039631987,0.00011940713,0.0012460737,0.00041936396,0.00014511758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011344721,0.0006430697,0.0012931598,0.0008375599,0.0010435674,0.0022033039,0.0023004233,0.00090948783,0.008736051],"category_scores_gemma":[0.0041191694,0.00034020923,0.000582042,0.00143534,0.00075653486,0.0051842653,0.0028587854,0.0011372403,0.0044797426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049714474,0.0009950597,0.005968352,0.0007682179,0.00023729779,0.001256968,0.00061984174,0.04977603,0.11894565,0.053834658,0.104329415,0.6582972],"study_design_scores_gemma":[0.00043047604,0.0002388461,0.0018651241,0.000034993664,0.00005990477,0.0009234707,0.0002756003,0.86474234,0.0709229,0.024016002,0.03631305,0.00017722927],"about_ca_topic_score_codex":0.005921106,"about_ca_topic_score_gemma":0.0059414324,"teacher_disagreement_score":0.008736051,"about_ca_system_score_codex":0.0014443514,"about_ca_system_score_gemma":0.0019554426,"threshold_uncertainty_score":0.029224992},"labels":[],"label_agreement":null},{"id":"W4312706139","doi":"10.1109/access.2022.3219049","title":"A Survey of Deep Learning Architectures for Privacy-Preserving Machine Learning With Fully Homomorphic Encryption","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Georgia State University; Georgia Institute of Technology; Beijing Institute of Technology; National Science Foundation; Microsoft; University of Alberta","keywords":"Homomorphic encryption; Computer science; Encryption; Information privacy; Deep learning; Artificial intelligence; Computer security","score_opus":0.03216643586524822,"score_gpt":0.27873746141644223,"score_spread":0.246571025551194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312706139","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020535383,0.068868354,0.88662285,0.003070542,0.00026605415,0.0001674686,0.00028505415,0.00083689444,0.019347439],"genre_scores_gemma":[0.571982,0.099942066,0.31021315,0.0021521777,0.0005590414,0.00048918114,0.0011370669,0.0003329639,0.013192308],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998314,0.00048955926,0.00015235248,0.00021423517,0.0006923574,0.00013745706],"domain_scores_gemma":[0.9983461,0.0007291854,0.00010574886,0.000497445,0.0002801947,0.0000413775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026577811,0.0009311532,0.00090663007,0.00088106113,0.00043378613,0.0019299788,0.0013215049,0.0011697114,0.0021880714],"category_scores_gemma":[0.0049424767,0.0005682151,0.00078758074,0.0013809386,0.0010573106,0.0042227157,0.0018970201,0.0031214282,0.0008836354],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022573888,0.00018387478,0.0021888711,0.001756681,0.00020259083,0.00011541121,0.00015719456,0.098471195,0.005777562,0.28932318,0.012051652,0.5895461],"study_design_scores_gemma":[0.000051686366,0.0005133177,0.0015345328,0.0009092234,0.00011236611,0.00081820984,0.000118443466,0.6669357,0.020528173,0.21394958,0.09444116,0.000087597065],"about_ca_topic_score_codex":0.0008479883,"about_ca_topic_score_gemma":0.0009899829,"teacher_disagreement_score":0.0026577811,"about_ca_system_score_codex":0.0018325339,"about_ca_system_score_gemma":0.0013483963,"threshold_uncertainty_score":0.014055908},"labels":[],"label_agreement":null},{"id":"W4312764393","doi":"10.1109/qce53715.2022.00067","title":"Benchmark Performance of a New Quantum-Safe Multivariate Polynomial Digital Signature Algorithm","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Quantum Computing and Engineering (QCE)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"","keywords":"Public-key cryptography; Computer science; Digital signature; NIST; Cryptosystem; Key (lock); Algorithm; Cryptography; Theoretical computer science; Post-quantum cryptography; Polynomial; Encryption; Mathematics; Hash function; Computer security","score_opus":0.018851660385930728,"score_gpt":0.24782276840271752,"score_spread":0.2289711080167868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312764393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9244386,0.0013828212,0.047729854,0.0005620888,0.00024125965,0.00024453574,0.00093685085,0.004210475,0.020253507],"genre_scores_gemma":[0.9640477,0.00019564184,0.032538544,0.0000712999,0.000021998525,0.000049197795,0.0011815998,0.000111851085,0.0017822536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973838,0.0004417604,0.00019424866,0.00037641742,0.0012027117,0.00040099243],"domain_scores_gemma":[0.99640024,0.00084524916,0.00018955058,0.0009919629,0.0013349673,0.00023795133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016663658,0.00053905405,0.00084232,0.00093630777,0.0007561899,0.0009898678,0.0013376971,0.0007323024,0.0029677039],"category_scores_gemma":[0.0047156606,0.00019864828,0.00041167438,0.0014107891,0.00079485273,0.0022914906,0.0012027319,0.00088969595,0.000661805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009575032,0.001497637,0.015687654,0.0009093568,0.0005377225,0.0005665052,0.0004250609,0.4905419,0.09849233,0.06289256,0.023651717,0.29522252],"study_design_scores_gemma":[0.00034600633,0.0014854259,0.0030837327,0.000016919907,0.00005464584,0.000188211,0.00008359988,0.9055474,0.07653816,0.0052267574,0.007373901,0.000055301694],"about_ca_topic_score_codex":0.0035067548,"about_ca_topic_score_gemma":0.0019732886,"teacher_disagreement_score":0.0035067548,"about_ca_system_score_codex":0.0016598183,"about_ca_system_score_gemma":0.0019264193,"threshold_uncertainty_score":0.01204294},"labels":[],"label_agreement":null},{"id":"W4313025490","doi":"10.1109/tdsc.2022.3211870","title":"PRkNN: Efficient and Privacy-Preserving Reverse kNN Query Over Encrypted Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encryption; Cloud computing; Query optimization; Information privacy; Data mining; Information retrieval; Computer security","score_opus":0.023735008290448337,"score_gpt":0.25276980778736413,"score_spread":0.2290347994969158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313025490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05937933,0.0008099061,0.9314344,0.0005833201,0.00013526618,0.00044039334,0.0012455786,0.0010711534,0.004900624],"genre_scores_gemma":[0.765772,0.0007325711,0.22565947,0.00037707906,0.00008849759,0.00030533955,0.0017282867,0.00010599698,0.0052307807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596137,0.00061021716,0.0004486694,0.00062240864,0.0017707048,0.0005866929],"domain_scores_gemma":[0.99662846,0.00078689895,0.0004100156,0.0014147279,0.0006462048,0.00011364086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019121887,0.0004913988,0.0011861117,0.0007847339,0.0010689257,0.0014190814,0.0017382446,0.00087650097,0.0015670544],"category_scores_gemma":[0.0061979224,0.00027556246,0.00077431224,0.0019413502,0.0009909964,0.00547475,0.0033400771,0.0012352172,0.0007261179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025240076,0.00043953842,0.0064296704,0.0009841613,0.00023911275,0.0018120625,0.0018711487,0.19721416,0.12173447,0.20545408,0.02553937,0.43575817],"study_design_scores_gemma":[0.00015931475,0.00036775653,0.0015823672,0.00006187578,0.00006652586,0.0019664643,0.00064464076,0.8424059,0.051041935,0.07928528,0.022265334,0.00015261186],"about_ca_topic_score_codex":0.002896486,"about_ca_topic_score_gemma":0.0029803198,"teacher_disagreement_score":0.002896486,"about_ca_system_score_codex":0.0013042098,"about_ca_system_score_gemma":0.002042371,"threshold_uncertainty_score":0.010112762},"labels":[],"label_agreement":null},{"id":"W4313066984","doi":"10.1109/iscas48785.2022.9937306","title":"Lightweight and CCA2-Secure Hardware Implementation of Binary Ring-LWE","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Cryptosystem; Computer science; Cryptography; Field-programmable gate array; Side channel attack; Virtex; Embedded system; Binary number; Computer hardware; Computer security; Mathematics; Arithmetic","score_opus":0.01810657573184832,"score_gpt":0.266981463705849,"score_spread":0.2488748879740007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313066984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16962552,0.0019109241,0.7852562,0.00054638804,0.0004038114,0.0004679695,0.00053439336,0.009696216,0.031558525],"genre_scores_gemma":[0.8699167,0.00024816804,0.12122251,0.00020937185,0.00005294729,0.00015852884,0.00036746552,0.00014196886,0.0076823696],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994716,0.00007908965,0.000053998796,0.00008657742,0.00016121722,0.00014759148],"domain_scores_gemma":[0.9995689,0.00007114876,0.00006719009,0.0001438081,0.00012221746,0.000026687429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034995817,0.0005697436,0.00041694893,0.00072306825,0.0004320553,0.0008074374,0.0010393754,0.00039290625,0.008953783],"category_scores_gemma":[0.00076082896,0.00023701506,0.00032921953,0.00040976857,0.00035619063,0.0015045782,0.0007233963,0.00049583317,0.002079103],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029812811,0.00043670047,0.0040556556,0.0014299781,0.00022066626,0.0013123079,0.00038229837,0.043844998,0.45315042,0.07746634,0.019038698,0.3956806],"study_design_scores_gemma":[0.0005830366,0.0028965645,0.0029027713,0.00019520956,0.00020725525,0.0028604115,0.00017023218,0.29991278,0.58637714,0.019007482,0.08469289,0.00019420889],"about_ca_topic_score_codex":0.0003737949,"about_ca_topic_score_gemma":0.00081297685,"teacher_disagreement_score":0.008953783,"about_ca_system_score_codex":0.00041677745,"about_ca_system_score_gemma":0.0007143428,"threshold_uncertainty_score":0.02995336},"labels":[],"label_agreement":null},{"id":"W4313128548","doi":"10.1007/978-3-031-23690-7_2","title":"DKS-PKI: A Distributed Key Server Architecture for Public Key Infrastructure","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Public key infrastructure; Certificate authority; Computer science; Public-key cryptography; Revocation list; Public key certificate; Root certificate; Computer security; Implicit certificate; Computer network; Certificate; Key (lock); Encryption","score_opus":0.015670505110888678,"score_gpt":0.230875222144177,"score_spread":0.2152047170332883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313128548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080972565,0.001961289,0.87861586,0.0009830603,0.0008130095,0.00035894557,0.0012076629,0.05072157,0.057241347],"genre_scores_gemma":[0.2671143,0.0039138063,0.58218366,0.00077881635,0.00045543816,0.0005694492,0.0051211733,0.0041776025,0.1356858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927694,0.00009094649,0.000055315926,0.00011298942,0.00034772969,0.00011618508],"domain_scores_gemma":[0.99939704,0.00008655793,0.0000377809,0.00024390894,0.00015482209,0.00007980008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079448626,0.0008042446,0.00065546297,0.0010445735,0.0008745739,0.0027603498,0.0023673174,0.001108698,0.014720756],"category_scores_gemma":[0.0012848446,0.0008131701,0.00046324386,0.0018479009,0.0011153702,0.0053169797,0.0023554785,0.0027714823,0.013115883],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008379981,0.00027723872,0.0006266935,0.00096630317,0.00006982508,0.0002319591,0.0004309304,0.011291369,0.041416537,0.40359285,0.14241748,0.39784086],"study_design_scores_gemma":[0.00022280145,0.00026197056,0.00067986414,0.00014201168,0.00010836285,0.0010291885,0.00014427803,0.11908227,0.07447946,0.14767545,0.6560267,0.00014757783],"about_ca_topic_score_codex":0.00096588646,"about_ca_topic_score_gemma":0.00090800336,"teacher_disagreement_score":0.014720756,"about_ca_system_score_codex":0.0015782478,"about_ca_system_score_gemma":0.0017232775,"threshold_uncertainty_score":0.049245894},"labels":[],"label_agreement":null},{"id":"W4313531829","doi":"10.1016/j.adhoc.2022.103077","title":"Fully privacy-preserving location recommendation in outsourced environments","year":2023,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China; Special Project for Research and Development in Key areas of Guangdong Province; China Postdoctoral Science Foundation; Jinan University; Guangzhou Municipal Science and Technology Project; National Natural Science Foundation of China","keywords":"Computer science; Internet privacy; Computer security","score_opus":0.016456265091177806,"score_gpt":0.2430033897240144,"score_spread":0.22654712463283658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313531829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09684305,0.0008352493,0.89409226,0.00078241026,0.00010221374,0.00014980095,0.0013796744,0.0013077271,0.0045076804],"genre_scores_gemma":[0.9058267,0.0005127488,0.0869198,0.00021455732,0.00008624108,0.00006822211,0.0011130234,0.000105395855,0.005153377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499524,0.0010866672,0.00033694613,0.00095839205,0.0017420847,0.00088065676],"domain_scores_gemma":[0.9872026,0.0019391989,0.0007105335,0.008907092,0.0009200646,0.00032046175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025346014,0.0008747423,0.0024627014,0.00066312077,0.0011689434,0.002865331,0.0035387336,0.0014554102,0.0028446366],"category_scores_gemma":[0.0075219744,0.0009713082,0.000971342,0.0029328135,0.0013732094,0.0070203966,0.005374658,0.0017003542,0.0016877926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029740396,0.0005309948,0.007385299,0.00050261064,0.00043933568,0.0010627237,0.0007399307,0.52361804,0.018943941,0.105247535,0.014894824,0.32366076],"study_design_scores_gemma":[0.00011530409,0.00019600273,0.00084399316,0.000031020536,0.00006363811,0.00060434354,0.00031105333,0.8970255,0.010924296,0.085613035,0.0042255754,0.000046148845],"about_ca_topic_score_codex":0.004737554,"about_ca_topic_score_gemma":0.004401427,"teacher_disagreement_score":0.004737554,"about_ca_system_score_codex":0.0011186721,"about_ca_system_score_gemma":0.0027367545,"threshold_uncertainty_score":0.013404369},"labels":[],"label_agreement":null},{"id":"W4313992145","doi":"10.36227/techrxiv.19315202.v5","title":"Survey on Fully Homomorphic Encryption, Theory, and Applications","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"Horizon 2020 Framework Programme; Technische Universität Dresden; Deutsche Forschungsgemeinschaft; European Commission","keywords":"Homomorphic encryption; Computer science; Cloud computing; Encryption; Theoretical computer science; State (computer science); Software; Computer security; Distributed computing; Computational science; Algorithm; Operating system","score_opus":0.04251822493009432,"score_gpt":0.28351882431494835,"score_spread":0.24100059938485402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313992145","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058201333,0.6476289,0.25900763,0.0057380176,0.001521509,0.0001311215,0.00044476567,0.00036676254,0.079341196],"genre_scores_gemma":[0.0906472,0.8036397,0.08473059,0.0032861088,0.004685407,0.000225831,0.0007992093,0.00013835548,0.011847706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829346,0.00040721372,0.0001945913,0.00022959923,0.00074013334,0.00013500055],"domain_scores_gemma":[0.9977729,0.0015172559,0.00010451004,0.0003103336,0.0002446702,0.00005032268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018961554,0.0010247817,0.0012612628,0.0030959242,0.00088265806,0.0027568305,0.0009959817,0.0014659201,0.0056587975],"category_scores_gemma":[0.003533886,0.00073597213,0.0007699743,0.0046810335,0.0019874517,0.007090414,0.0018829851,0.0031480496,0.0022728085],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005942197,0.0001215009,0.0006023749,0.0039283787,0.000062540144,0.000272661,0.00024586986,0.0046545775,0.002483394,0.556328,0.022923358,0.4083179],"study_design_scores_gemma":[0.000017334758,0.00019632126,0.00097256625,0.0020888147,0.000054071123,0.002837564,0.00016164577,0.014889035,0.0046589584,0.4569758,0.51705915,0.00008874139],"about_ca_topic_score_codex":0.000518096,"about_ca_topic_score_gemma":0.00031743041,"teacher_disagreement_score":0.0056587975,"about_ca_system_score_codex":0.0013438879,"about_ca_system_score_gemma":0.0013967375,"threshold_uncertainty_score":0.018930614},"labels":[],"label_agreement":null},{"id":"W4315567939","doi":"10.1186/s13059-022-02841-5","title":"Sequre: a high-performance framework for secure multiparty computation enables biomedical data sharing","year":2023,"lang":"en","type":"article","venue":"Genome biology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Human Genome Research Institute; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; University of Victoria","keywords":"Computer science; Codebase; Python (programming language); Secure multi-party computation; Computation; Usability; Compiler; Cryptography; Data sharing; Set (abstract data type); Syntax; Distributed computing; Programming language; Source code; Operating system; Artificial intelligence; Algorithm","score_opus":0.07977739006853787,"score_gpt":0.33131282477141805,"score_spread":0.2515354347028802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315567939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049739913,0.00046859126,0.8896322,0.0004605049,0.00016448952,0.00022429277,0.00090668246,0.09724837,0.0059208605],"genre_scores_gemma":[0.29337028,0.0013999431,0.653076,0.0017477692,0.00031786668,0.0016389643,0.008559807,0.021268483,0.018620938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975439,0.000589533,0.00017622887,0.00035428815,0.0009949324,0.00034110315],"domain_scores_gemma":[0.99827826,0.00057702913,0.00012345854,0.00062161585,0.0002293141,0.00017037895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028763658,0.0011537222,0.0009446991,0.00086953974,0.001012372,0.0021580288,0.0031778656,0.0014844623,0.012860399],"category_scores_gemma":[0.0050017717,0.00097101164,0.0017447193,0.00080559833,0.0017337335,0.0034741869,0.004124264,0.0036585096,0.0074115475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029455046,0.0006169093,0.0036370566,0.0016056394,0.00062698877,0.0014969493,0.0009445244,0.09217574,0.09808595,0.3719205,0.2166057,0.2093386],"study_design_scores_gemma":[0.00038912005,0.00031018443,0.00118984,0.00017463157,0.00010134185,0.00090244116,0.000082957864,0.50114787,0.09403629,0.15000375,0.25136757,0.000293976],"about_ca_topic_score_codex":0.0017496038,"about_ca_topic_score_gemma":0.0016432969,"teacher_disagreement_score":0.012860399,"about_ca_system_score_codex":0.0010809323,"about_ca_system_score_gemma":0.0021550867,"threshold_uncertainty_score":0.043022275},"labels":[],"label_agreement":null},{"id":"W4315630225","doi":"10.1109/globecom48099.2022.10000715","title":"Secure and Distributed Access Control for Dynamic Pervasive Edge Computing Services","year":2022,"lang":"en","type":"article","venue":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Edge computing; Ubiquitous computing; Distributed computing; Access control; Context-aware pervasive systems; Enhanced Data Rates for GSM Evolution; Computer network; Computer security; Operating system; Telecommunications","score_opus":0.02364015779418623,"score_gpt":0.3061354620481124,"score_spread":0.28249530425392616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315630225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035813037,0.00033971737,0.95976037,0.00022323563,0.00007538447,0.00011660085,0.000030693303,0.00074280245,0.0028981739],"genre_scores_gemma":[0.9527858,0.00016978584,0.044831008,0.00007347441,0.000056765417,0.00009517212,0.0000511353,0.000029100136,0.0019077524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981516,0.00034003184,0.000111307025,0.00033697698,0.00071980763,0.00034032742],"domain_scores_gemma":[0.99856037,0.0003864685,0.00018321477,0.000407553,0.00035749484,0.00010496565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135393,0.00049283775,0.0005661247,0.0006703441,0.0011144112,0.0014419786,0.0012218223,0.00063568,0.0015496329],"category_scores_gemma":[0.0028239256,0.00020044264,0.00042721056,0.0005361637,0.0012366459,0.002278447,0.0018467446,0.0011931435,0.00037309979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011208488,0.00037400413,0.0022529678,0.00023419809,0.00009542677,0.00061097275,0.00059111184,0.34719038,0.06549934,0.32632497,0.008506362,0.24719931],"study_design_scores_gemma":[0.000053840045,0.000096868294,0.00028150747,0.00000891617,0.000015374264,0.00009081251,0.000056560944,0.9684254,0.006376493,0.02010837,0.004467564,0.000018315168],"about_ca_topic_score_codex":0.002786649,"about_ca_topic_score_gemma":0.0022302861,"teacher_disagreement_score":0.002786649,"about_ca_system_score_codex":0.0012644461,"about_ca_system_score_gemma":0.0012688682,"threshold_uncertainty_score":0.009174287},"labels":[],"label_agreement":null},{"id":"W4315647960","doi":"10.3390/info14010044","title":"A Shannon-Theoretic Approach to the Storage–Retrieval Trade-Off in PIR Systems","year":2023,"lang":"en","type":"article","venue":"Information","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Codebook; Computer science; Code rate; Coding (social sciences); Theoretical computer science; Random access; Algorithm; Code (set theory); Scheme (mathematics); Mathematics; Decoding methods; Set (abstract data type); Statistics; Computer network","score_opus":0.013469915997715775,"score_gpt":0.22567219010190961,"score_spread":0.21220227410419384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315647960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028166289,0.0019765487,0.939261,0.0014690025,0.00013978044,0.000095289,0.0000997184,0.00015841587,0.02863389],"genre_scores_gemma":[0.9056275,0.0026197436,0.08241062,0.00044900415,0.00043214703,0.0002751482,0.000071168964,0.00012262816,0.007991996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965557,0.0014248061,0.00018064021,0.0003418876,0.0010841576,0.00041282526],"domain_scores_gemma":[0.98928154,0.0074886256,0.0006111272,0.0015378665,0.0009192168,0.00016166978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039743683,0.0010840109,0.001228752,0.0014142321,0.0013124357,0.0039586397,0.0021659383,0.0020208738,0.005477986],"category_scores_gemma":[0.01676097,0.0006768849,0.00067080586,0.0014688057,0.0047459225,0.0070679504,0.0036463973,0.002541609,0.00083454256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088344976,0.00004221362,0.00021059463,0.00022689876,0.000032645185,0.00015624071,0.00021872348,0.10137606,0.0049615735,0.877875,0.0010485445,0.013763181],"study_design_scores_gemma":[0.00002280094,0.0001770268,0.0002003686,0.00008297009,0.000029784263,0.0003202318,0.000116534844,0.5574122,0.005074034,0.43403068,0.0024517868,0.00008153402],"about_ca_topic_score_codex":0.0006005278,"about_ca_topic_score_gemma":0.00037614725,"teacher_disagreement_score":0.005477986,"about_ca_system_score_codex":0.002334325,"about_ca_system_score_gemma":0.0010580361,"threshold_uncertainty_score":0.021018684},"labels":[],"label_agreement":null},{"id":"W4317927042","doi":"10.1007/978-3-031-22969-5_17","title":"Short-lived Zero-Knowledge Proofs and Signatures","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical proof; Gas meter prover; Soundness; Computer science; Verifiable secret sharing; Theoretical computer science; Computation; Algorithm; Overhead (engineering); Zero-knowledge proof; Cryptography; Programming language; Mathematics","score_opus":0.020286219034343505,"score_gpt":0.2551109071273008,"score_spread":0.23482468809295728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317927042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021801794,0.021559818,0.69223183,0.008983878,0.002341026,0.0001444227,0.00054825697,0.0013254982,0.25106347],"genre_scores_gemma":[0.65381765,0.016971009,0.098515555,0.0017374243,0.0024729741,0.00032129494,0.0008253634,0.00083617,0.22450262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748,0.00079099013,0.00017216291,0.00035305414,0.0009676193,0.00023622924],"domain_scores_gemma":[0.99322057,0.0042216815,0.0003387479,0.0016162284,0.0004472999,0.00015543685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002091562,0.00091143756,0.000912425,0.0014048422,0.0017755277,0.0058796275,0.0017431497,0.002372834,0.013599967],"category_scores_gemma":[0.009382405,0.0009704123,0.00078850973,0.002698027,0.0065705185,0.018392738,0.0038187942,0.0055483016,0.0053349654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002517275,0.000010405866,0.000029400415,0.00011028674,0.000005233176,0.000035642253,0.00021619264,0.000663244,0.000341897,0.9745311,0.0039219907,0.02010927],"study_design_scores_gemma":[0.0000033984975,0.0000061145834,0.00001139028,0.000024739775,0.0000030960941,0.00007080865,0.00001905909,0.0006624576,0.00048251933,0.9848433,0.013866665,0.0000064029523],"about_ca_topic_score_codex":0.00018675583,"about_ca_topic_score_gemma":0.00014587064,"teacher_disagreement_score":0.013599967,"about_ca_system_score_codex":0.0020999468,"about_ca_system_score_gemma":0.0013158582,"threshold_uncertainty_score":0.045496404},"labels":[],"label_agreement":null},{"id":"W4317928322","doi":"10.1007/978-3-031-22972-5_12","title":"Instantiability of Classical Random-Oracle-Model Encryption Transforms","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Encryption; Computer science; Hash function; Theoretical computer science; Functional encryption; Plaintext; Cryptography; Semantic security; Public-key cryptography; Obfuscation; Concrete security; Mathematical proof; Mathematics; Algorithm; Ciphertext; Computer security; Attribute-based encryption","score_opus":0.016451760449138028,"score_gpt":0.2462147380908453,"score_spread":0.22976297764170728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317928322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14460593,0.0012474344,0.72152066,0.0032118848,0.00042808626,0.00014852169,0.0006274885,0.0010337469,0.12717617],"genre_scores_gemma":[0.94185513,0.0006857171,0.039326776,0.000512465,0.0002909851,0.000116565396,0.0005994018,0.00033182267,0.016281236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957196,0.0012495642,0.0002745706,0.00081006595,0.0013112429,0.00063492154],"domain_scores_gemma":[0.9945438,0.002628371,0.00026416229,0.002045311,0.0003467156,0.0001717218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002790741,0.00072342803,0.0013256113,0.00084582315,0.0011164587,0.004404255,0.0015900945,0.0018263488,0.00812811],"category_scores_gemma":[0.010684746,0.00055184396,0.0018870851,0.0011801876,0.0039164377,0.011469321,0.0040496946,0.005085255,0.00179068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047915528,0.000018184566,0.0000665269,0.00001786989,0.0000063393936,0.000042316533,0.000057839396,0.00162082,0.00040338957,0.99332076,0.0005524848,0.0038454498],"study_design_scores_gemma":[0.000013234579,0.000009209315,0.000043913737,0.0000073004,0.000006453846,0.000079893776,0.00001389885,0.010338072,0.0010059607,0.9872437,0.0012312906,0.0000070505976],"about_ca_topic_score_codex":0.00029935793,"about_ca_topic_score_gemma":0.00019239692,"teacher_disagreement_score":0.00812811,"about_ca_system_score_codex":0.0017193272,"about_ca_system_score_gemma":0.0008429431,"threshold_uncertainty_score":0.027191222},"labels":[],"label_agreement":null},{"id":"W4318619120","doi":"10.1007/978-981-19-9697-9_13","title":"Mutual Authentication Protocol in a Distributed Heterogeneous Environment: A Blockchain-Based Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Authentication protocol; Computer science; Public key infrastructure; Authentication (law); Lightweight Extensible Authentication Protocol; Protocol (science); Blockchain; Data Authentication Algorithm; Computer security; Public-key cryptography; Single point of failure; Challenge-Handshake Authentication Protocol; Identity (music); Mutual authentication; Key (lock); Computer network; Encryption","score_opus":0.035884070196393406,"score_gpt":0.27420623883519996,"score_spread":0.23832216863880656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318619120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019735044,0.0008748174,0.9589774,0.0005600035,0.00013177829,0.00014498392,0.00007111414,0.0002587528,0.019246],"genre_scores_gemma":[0.75617886,0.0018499473,0.21528949,0.00011596934,0.00016398638,0.00032470358,0.00015593569,0.00007878642,0.025842387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998719,0.00052800815,0.00005422343,0.00017288748,0.0004205892,0.00010534186],"domain_scores_gemma":[0.9989489,0.00057307706,0.00006625638,0.00023759548,0.00012154682,0.00005270605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013447695,0.00036058505,0.00087703945,0.0005794253,0.0014224905,0.0017206349,0.0015224115,0.0016301925,0.003451138],"category_scores_gemma":[0.0019476635,0.0002760589,0.00047471758,0.0014326655,0.0017763957,0.0037046438,0.0025338563,0.0015403719,0.00084383675],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025825438,0.00013274388,0.00036673644,0.00021044543,0.00006480355,0.00044932077,0.000463338,0.1661844,0.011285248,0.7118474,0.0034159466,0.10532131],"study_design_scores_gemma":[0.00005775145,0.00011250681,0.00016313231,0.000039361745,0.00003981122,0.00023056542,0.00010014459,0.682466,0.004860967,0.29722857,0.014663424,0.00003788466],"about_ca_topic_score_codex":0.0009119535,"about_ca_topic_score_gemma":0.0011327649,"teacher_disagreement_score":0.003451138,"about_ca_system_score_codex":0.00082996086,"about_ca_system_score_gemma":0.001389872,"threshold_uncertainty_score":0.011545181},"labels":[],"label_agreement":null},{"id":"W4319985907","doi":"10.17760/d20467209","title":"Applications of doubly efficient private information retrieval","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Computer science; Stateless protocol; Encryption; Secure multi-party computation; Private information retrieval; Server; Overhead (engineering); Computer network; Cryptography; Leverage (statistics); Database; Computer security; Operating system; Network packet","score_opus":0.005954257803142122,"score_gpt":0.24289819997840123,"score_spread":0.2369439421752591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319985907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036499735,0.0032258653,0.9275598,0.0026341164,0.00016044517,0.00027945015,0.00022910343,0.0014708632,0.027940564],"genre_scores_gemma":[0.6920749,0.0031700633,0.28884912,0.0007089634,0.00042746827,0.00027359664,0.00036135738,0.0002665954,0.013868008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970835,0.0007046318,0.00021463634,0.00042856994,0.0012034681,0.00036511288],"domain_scores_gemma":[0.99267286,0.0028152133,0.00050255493,0.0032337059,0.00065487786,0.00012079183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018796247,0.0005415755,0.0010741706,0.0009966185,0.0009712397,0.0021319839,0.0024232653,0.0012872185,0.005136615],"category_scores_gemma":[0.008371201,0.0004025326,0.0008152266,0.0021928384,0.002332073,0.006138648,0.0042832326,0.0021955757,0.0015611323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053621095,0.0002067371,0.0012814722,0.00054479763,0.00007897275,0.00034764002,0.00086371903,0.076247446,0.019173028,0.61813587,0.011349036,0.271235],"study_design_scores_gemma":[0.000108290005,0.00023784359,0.00033723697,0.00008499342,0.000058972237,0.0009134065,0.000300876,0.40263432,0.034877792,0.5217611,0.038604632,0.00008046256],"about_ca_topic_score_codex":0.0009280263,"about_ca_topic_score_gemma":0.0007772645,"teacher_disagreement_score":0.005136615,"about_ca_system_score_codex":0.0017121221,"about_ca_system_score_gemma":0.0011601703,"threshold_uncertainty_score":0.017183661},"labels":[],"label_agreement":null},{"id":"W4320843188","doi":"10.4230/lipics.itc.2025.2","title":"Powerful Primitives in the Bounded Quantum Storage Model","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Encryption; Bounded function; Theoretical computer science; Quantum; Computer security; Mathematics; Physics; Quantum mechanics","score_opus":0.11982814241291655,"score_gpt":0.21008771203115198,"score_spread":0.09025956961823543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320843188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10847314,0.000791724,0.84444535,0.0048737526,0.00019751785,0.00019041811,0.0005480917,0.0010776989,0.039402273],"genre_scores_gemma":[0.9294902,0.000582713,0.059789263,0.00042863586,0.00019395398,0.0003305238,0.00020791938,0.0001499325,0.008826965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967804,0.0009432939,0.00014915515,0.00041588413,0.0012497054,0.0004616354],"domain_scores_gemma":[0.9930362,0.003303329,0.0004519003,0.0026410166,0.00033397583,0.00023360763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026230435,0.0006873154,0.0011206724,0.00090065773,0.0017132538,0.0034033372,0.0021610176,0.0020184328,0.006854985],"category_scores_gemma":[0.006551792,0.0006910412,0.0011802174,0.0011461595,0.006047579,0.012861651,0.006897512,0.0048660985,0.0012329374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063503896,0.000011462899,0.00003883774,0.000037067894,0.0000061361684,0.00004639832,0.000094302886,0.008289783,0.0017267655,0.986973,0.0005647644,0.0021480941],"study_design_scores_gemma":[0.00004852238,0.000042676893,0.000044492084,0.000021441594,0.000012875961,0.000101786885,0.000041866017,0.06910885,0.004622524,0.9211251,0.004800025,0.000029772229],"about_ca_topic_score_codex":0.0006947728,"about_ca_topic_score_gemma":0.0003541636,"teacher_disagreement_score":0.006854985,"about_ca_system_score_codex":0.0021212164,"about_ca_system_score_gemma":0.0015734094,"threshold_uncertainty_score":0.022932172},"labels":[],"label_agreement":null},{"id":"W4320925590","doi":"10.1515/jmc-2022-0010","title":"Plactic key agreement (insecure?)","year":2023,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Key (lock); Public-key cryptography; Computer science; Division (mathematics); Byte; Cryptography; Theoretical computer science; Computer security; Arithmetic; Mathematics; Encryption; Programming language","score_opus":0.02542509089501993,"score_gpt":0.279011769400209,"score_spread":0.25358667850518907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320925590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12608773,0.0012858681,0.6294005,0.024728414,0.0017398226,0.00042699097,0.0011604936,0.0052995062,0.20987076],"genre_scores_gemma":[0.93395853,0.0005420639,0.03956151,0.0026105328,0.0005877599,0.00030583036,0.0007822652,0.00045408044,0.021197485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900525,0.0020626702,0.00076335506,0.0021369727,0.00320168,0.0017827987],"domain_scores_gemma":[0.98194134,0.0054455553,0.001313219,0.008193319,0.0024587025,0.0006478689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005715801,0.00061273354,0.0011307148,0.0008745786,0.0039051108,0.005480584,0.0019203768,0.0037953174,0.02247415],"category_scores_gemma":[0.022337398,0.0008178498,0.0010696118,0.0012774306,0.006344453,0.01642468,0.010596624,0.006947291,0.007909536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042007104,0.00006529195,0.00078240695,0.00012737191,0.000040473864,0.00055181293,0.00059226976,0.0030202921,0.0029453032,0.95126355,0.017107528,0.023083637],"study_design_scores_gemma":[0.00007799709,0.00008025402,0.00023090917,0.00009338466,0.000025754754,0.0008060044,0.0003069634,0.020358352,0.008546365,0.9183856,0.051030334,0.000058033427],"about_ca_topic_score_codex":0.00076741853,"about_ca_topic_score_gemma":0.00039432367,"teacher_disagreement_score":0.02247415,"about_ca_system_score_codex":0.002076214,"about_ca_system_score_gemma":0.0016479887,"threshold_uncertainty_score":0.07518351},"labels":[],"label_agreement":null},{"id":"W4321843892","doi":"10.1109/icatiece56365.2022.10047214","title":"Development of Flexible, Sharing and Leasing a Car Using MERN Stack","year":2022,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Renting; Reservation; Computer science; Workflow; Scalability; Engineering; Database","score_opus":0.05410240215118887,"score_gpt":0.2745374746395068,"score_spread":0.22043507248831792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321843892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16249561,0.0007647389,0.7463157,0.001019557,0.00038926842,0.0011746316,0.0007355951,0.02828977,0.058815185],"genre_scores_gemma":[0.33664313,0.0006502477,0.6137979,0.00028684855,0.000027799091,0.00029172693,0.002666572,0.0019699298,0.04366594],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943095,0.000066239016,0.00003597484,0.000099822864,0.0002781555,0.00008875246],"domain_scores_gemma":[0.9994216,0.000040826388,0.000027141517,0.00019780526,0.00022385047,0.00008872015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041082,0.00041632858,0.0003249454,0.000347724,0.0005042408,0.001270003,0.0022651043,0.0005453611,0.003841175],"category_scores_gemma":[0.0012168898,0.00040802913,0.00059953984,0.00027735054,0.0003464235,0.0027045503,0.0014613166,0.00075230794,0.0018441543],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007680306,0.0007727732,0.011319986,0.0010840929,0.00020346846,0.0022438136,0.0015989471,0.051179662,0.19528331,0.04810518,0.038322043,0.6491186],"study_design_scores_gemma":[0.00015756409,0.0006901311,0.005215903,0.00018527488,0.00016122681,0.0013855364,0.0011045879,0.40945044,0.13485672,0.00838286,0.43821126,0.00019851765],"about_ca_topic_score_codex":0.0060267597,"about_ca_topic_score_gemma":0.008057345,"teacher_disagreement_score":0.0060267597,"about_ca_system_score_codex":0.0006221006,"about_ca_system_score_gemma":0.0020260292,"threshold_uncertainty_score":0.012849987},"labels":[],"label_agreement":null},{"id":"W4323519519","doi":"10.1109/tdsc.2023.3253786","title":"Multi-Client Secure and Efficient DPF-Based Keyword Search for Cloud Storage","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Bloom filter; Encryption; Server; Cloud computing; Computer network; Cloud storage; Hash function; Distributed computing; Computer security","score_opus":0.028521564702901975,"score_gpt":0.27460165775526607,"score_spread":0.24608009305236409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323519519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07823107,0.0020084148,0.90955025,0.00052764156,0.00012898877,0.0004209653,0.00034803795,0.0044862903,0.004298435],"genre_scores_gemma":[0.8779344,0.000383081,0.116799474,0.0001485649,0.000051980027,0.00020711741,0.00024720104,0.00008442415,0.004143607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976254,0.00031669743,0.00020839502,0.0003313808,0.0011447204,0.0003735253],"domain_scores_gemma":[0.9975847,0.00037853763,0.00022565393,0.0010692374,0.0005838793,0.00015792127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090179854,0.00064081425,0.0016940065,0.0008524042,0.001731313,0.0016323616,0.0029033374,0.0012694134,0.0030622985],"category_scores_gemma":[0.0025643518,0.00037827762,0.0006709734,0.0018956916,0.00086631934,0.004918371,0.0029672398,0.0010106325,0.0011700623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004322436,0.00047300925,0.0050185653,0.0011772116,0.00030228595,0.0023696676,0.0010097198,0.13982123,0.15273273,0.13091251,0.01930057,0.54256004],"study_design_scores_gemma":[0.00013802639,0.00026120915,0.0006347174,0.000038060636,0.000059329435,0.0016540161,0.0002010123,0.90024143,0.06374465,0.023346692,0.009550161,0.00013072776],"about_ca_topic_score_codex":0.0028715872,"about_ca_topic_score_gemma":0.0020995121,"teacher_disagreement_score":0.0030622985,"about_ca_system_score_codex":0.0020902068,"about_ca_system_score_gemma":0.0022991737,"threshold_uncertainty_score":0.015165567},"labels":[],"label_agreement":null},{"id":"W4324007040","doi":"10.14722/ndss.2023.23198","title":"Faster Secure Comparisons with Offline Phase for Efficient Private Set Intersection","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada","keywords":"Intersection (aeronautics); Computer science; Set (abstract data type); Phase (matter); Computer security; Programming language; Engineering; Transport engineering","score_opus":0.03392953163281381,"score_gpt":0.3047480124436365,"score_spread":0.27081848081082266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324007040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07132423,0.0008109993,0.90186965,0.0011217431,0.0003381425,0.0007971949,0.0006681967,0.007119124,0.015950667],"genre_scores_gemma":[0.7691943,0.00025999796,0.21808195,0.00050230854,0.00023716857,0.0008182943,0.0009477428,0.0009602597,0.008997947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98338,0.0052458476,0.0011631958,0.0024357738,0.0056246677,0.00215046],"domain_scores_gemma":[0.9639036,0.013717028,0.0026987954,0.016315104,0.0025954295,0.0007700876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008522621,0.0011443911,0.0020526883,0.0014188598,0.0023560512,0.004150264,0.0041236,0.002259071,0.015539955],"category_scores_gemma":[0.021880226,0.0011228791,0.0012280873,0.0020224229,0.003718787,0.020957822,0.012084909,0.006314298,0.004210497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051121893,0.0009910341,0.0029047085,0.000744049,0.00024245212,0.00048460928,0.0013577038,0.055521514,0.058101743,0.59035283,0.018704,0.26548317],"study_design_scores_gemma":[0.0008885002,0.0013832984,0.0008011328,0.00013864339,0.00015277193,0.0009661096,0.00051212637,0.3915271,0.1170407,0.45483685,0.031458832,0.00029397922],"about_ca_topic_score_codex":0.00071996957,"about_ca_topic_score_gemma":0.0005763802,"teacher_disagreement_score":0.015539955,"about_ca_system_score_codex":0.0028115807,"about_ca_system_score_gemma":0.0050361324,"threshold_uncertainty_score":0.051986277},"labels":[],"label_agreement":null},{"id":"W4324123615","doi":"10.23977/jeis.2023.080101","title":"A Public Key Searchable Encryption Method Based on Multiple Keywords","year":2023,"lang":"en","type":"article","venue":"Journal of Electronics and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Encryption; Key (lock); Padding; Construct (python library); Index (typography); Computer security; Probabilistic encryption; Information retrieval; Data mining; Computer network; World Wide Web","score_opus":0.028716611274096398,"score_gpt":0.2884307881790744,"score_spread":0.259714176904978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324123615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034213547,0.003728895,0.94737846,0.0007450016,0.0003375162,0.0002823926,0.00034679973,0.0015814714,0.011385873],"genre_scores_gemma":[0.73320705,0.0022444744,0.244875,0.00033196638,0.0001575036,0.00036390004,0.00045469162,0.000115461015,0.01825004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990258,0.00016794153,0.00009907993,0.00019234956,0.00041098482,0.00010380359],"domain_scores_gemma":[0.99946743,0.00011058843,0.000080834405,0.00015308517,0.00015088655,0.000037237074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004920794,0.00047548866,0.0006681058,0.0007236545,0.0006587574,0.0008651208,0.0009040806,0.00071183924,0.0027304837],"category_scores_gemma":[0.0012813056,0.00022667804,0.0006101781,0.0010733518,0.0005275415,0.003823038,0.0009373467,0.00077978097,0.0010060353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014357074,0.00027835034,0.0016829063,0.0013481589,0.00017777168,0.0013363886,0.00060853164,0.03726885,0.17609003,0.24853669,0.017578539,0.51365805],"study_design_scores_gemma":[0.00072009483,0.0010605084,0.0015896336,0.00018196339,0.00021253579,0.010244035,0.0002690558,0.5913637,0.17431925,0.0785349,0.14111808,0.00038613268],"about_ca_topic_score_codex":0.0007205461,"about_ca_topic_score_gemma":0.00048443745,"teacher_disagreement_score":0.0027304837,"about_ca_system_score_codex":0.0006523115,"about_ca_system_score_gemma":0.0010542932,"threshold_uncertainty_score":0.009134412},"labels":[],"label_agreement":null},{"id":"W4360866285","doi":"10.1007/s10207-023-00678-y","title":"A typology of secure multicast communication over 5 G/6 G networks","year":2023,"lang":"en","type":"article","venue":"International Journal of Information Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Signcryption; Pragmatic General Multicast; Xcast; Public-key cryptography; Encryption; IP multicast; Protocol Independent Multicast; Digital signature; Cryptography; Computer security; Hash function","score_opus":0.007796838734247098,"score_gpt":0.27488740793150224,"score_spread":0.26709056919725516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360866285","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103328355,0.0018484801,0.43390307,0.008842267,0.0009412523,0.0006336444,0.0009350406,0.0009853583,0.44858247],"genre_scores_gemma":[0.85173625,0.0020563775,0.09806979,0.0012736492,0.00059343467,0.0008860029,0.0005657665,0.00035161985,0.044467133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968652,0.0010064117,0.00019822155,0.00036945316,0.000923503,0.00063720526],"domain_scores_gemma":[0.9962399,0.0013952176,0.00038065488,0.0011300696,0.0005661009,0.0002880201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018593558,0.0006245176,0.0006686224,0.003488508,0.0047606686,0.008207097,0.0021430433,0.0043092156,0.012700811],"category_scores_gemma":[0.0047827065,0.00048659783,0.00089950295,0.0038158693,0.0056623425,0.008883078,0.0036463295,0.0030748553,0.00211135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002179546,0.00001085323,0.00028991688,0.000025456677,0.0000028564186,0.00020357389,0.0003403046,0.0007524474,0.00032828242,0.99077857,0.0020576683,0.0051881922],"study_design_scores_gemma":[0.000025198264,0.00003961454,0.00032734606,0.00009858766,0.000011214383,0.0013582605,0.001045973,0.014638272,0.0008118375,0.9290037,0.052611113,0.000028801369],"about_ca_topic_score_codex":0.0020110635,"about_ca_topic_score_gemma":0.0013608893,"teacher_disagreement_score":0.012700811,"about_ca_system_score_codex":0.002870203,"about_ca_system_score_gemma":0.0013878563,"threshold_uncertainty_score":0.042488515},"labels":[],"label_agreement":null},{"id":"W4360993846","doi":"10.1109/tifs.2023.3262147","title":"PGSim: Efficient and Privacy-Preserving Graph Similarity Query Over Encrypted Data in Cloud","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Basic Research Program of Shaanxi Province; Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Theoretical computer science; Encryption; Graph database; Data mining; Graph; Computer security","score_opus":0.019783120723265313,"score_gpt":0.2517840148312841,"score_spread":0.23200089410801877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360993846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12414901,0.00042565164,0.8655102,0.0010017507,0.00008918209,0.00039482577,0.00086944044,0.0032304635,0.004329437],"genre_scores_gemma":[0.876715,0.00021974748,0.119642705,0.0002431353,0.000039983966,0.00010252474,0.0007228685,0.000075334174,0.0022386864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974921,0.00050656375,0.00019976385,0.00040655752,0.0010643065,0.00033084143],"domain_scores_gemma":[0.9966575,0.00072979165,0.00032481027,0.0017586562,0.00038090235,0.00014831242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017495089,0.0003952565,0.0008397948,0.0007930294,0.0010397543,0.0014359567,0.0015602814,0.0010688672,0.0015346169],"category_scores_gemma":[0.0043362756,0.00024240935,0.0007062195,0.0015691067,0.0010984527,0.0049899085,0.0033160914,0.001045481,0.0005421798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025058761,0.0005924833,0.006887135,0.0004397113,0.00022247383,0.0016096644,0.0013568073,0.15482287,0.097287685,0.2780177,0.02241795,0.43383965],"study_design_scores_gemma":[0.00017419497,0.0003404511,0.0014890011,0.000025701795,0.000047952384,0.0012174217,0.00042050285,0.81203425,0.06895089,0.10462731,0.010593109,0.000079250494],"about_ca_topic_score_codex":0.0022442609,"about_ca_topic_score_gemma":0.001595101,"teacher_disagreement_score":0.0022442609,"about_ca_system_score_codex":0.0013800366,"about_ca_system_score_gemma":0.002074321,"threshold_uncertainty_score":0.010012925},"labels":[],"label_agreement":null},{"id":"W4362496259","doi":"10.1109/tdsc.2023.3263974","title":"Efficient and Accurate Cloud-Assisted Medical Pre-Diagnosis With Privacy Preservation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Encryption; Computer science; Cloud computing; Server; Mahalanobis distance; Tree (set theory); Theoretical computer science; Metric (unit); Data mining; Information retrieval; Algorithm; Artificial intelligence; Mathematics; Computer security; World Wide Web; Combinatorics","score_opus":0.02045732974857327,"score_gpt":0.26307866519701295,"score_spread":0.24262133544843967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362496259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052119818,0.0013148505,0.9384103,0.0011850657,0.00014389896,0.00027137433,0.0010445435,0.0018899662,0.0036202474],"genre_scores_gemma":[0.7756966,0.00080581516,0.21898893,0.0003546312,0.00013932979,0.00012198262,0.0014631238,0.00006358327,0.0023660033],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977962,0.00035943976,0.00021256371,0.00041405956,0.0009505726,0.0002672044],"domain_scores_gemma":[0.996971,0.00065621006,0.00037920746,0.0013760709,0.0004753588,0.00014203867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053742,0.00051996286,0.0010881278,0.0007137355,0.00082349236,0.0017839558,0.0016433077,0.000860726,0.0019448133],"category_scores_gemma":[0.004499879,0.00032175754,0.00087374606,0.0013520573,0.0005859634,0.0025676824,0.003258529,0.0011459275,0.0010126889],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029044796,0.00050965726,0.01836868,0.0006999712,0.00028085883,0.002373722,0.0007338834,0.11034005,0.07070747,0.055771604,0.023734923,0.7135746],"study_design_scores_gemma":[0.00012436154,0.00024211152,0.0032921373,0.000047521702,0.00009219274,0.0032805395,0.00033746994,0.8995686,0.054878626,0.027364463,0.010701928,0.00007002533],"about_ca_topic_score_codex":0.0021424133,"about_ca_topic_score_gemma":0.0022115484,"teacher_disagreement_score":0.0021424133,"about_ca_system_score_codex":0.0009905716,"about_ca_system_score_gemma":0.0024310437,"threshold_uncertainty_score":0.007187128},"labels":[],"label_agreement":null},{"id":"W4362653996","doi":"10.1109/tsc.2023.3264710","title":"SecBerg: Secure and Practical Iceberg Queries in Cloud","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Secret sharing; Encryption; Overhead (engineering); Materialized view; Database; Homomorphic encryption; Analytics; Cryptography; View; Computer security; Operating system; Database design","score_opus":0.017417511878690953,"score_gpt":0.2780257320390476,"score_spread":0.2606082201603567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362653996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08308983,0.00082251045,0.8982869,0.0011804722,0.00018341832,0.0007144892,0.00064427813,0.0040762736,0.011001783],"genre_scores_gemma":[0.82671756,0.0004761942,0.1661826,0.00042334892,0.00009549932,0.00028744517,0.00071794743,0.00021228609,0.0048871036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579924,0.0008324717,0.00039378757,0.00043229887,0.0018202319,0.0007219828],"domain_scores_gemma":[0.9932059,0.0016984999,0.0006415845,0.0032781216,0.0009156531,0.00026017983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004289644,0.0006658074,0.0010421651,0.0008787736,0.0015045633,0.0026074375,0.001870051,0.0011229904,0.0027313617],"category_scores_gemma":[0.006528444,0.00040420413,0.00064884085,0.0015143703,0.0024763742,0.007797399,0.004396467,0.0020225402,0.0010089052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032151248,0.0005593679,0.004200415,0.0004344305,0.00014510614,0.0007062503,0.0011750112,0.12746647,0.05472117,0.5299046,0.025860487,0.25161153],"study_design_scores_gemma":[0.0002683988,0.0006059705,0.00070192886,0.00006369774,0.000060368286,0.0007543694,0.00047941197,0.7059762,0.069656245,0.190359,0.030963661,0.000110737434],"about_ca_topic_score_codex":0.0016587307,"about_ca_topic_score_gemma":0.0011932509,"teacher_disagreement_score":0.004289644,"about_ca_system_score_codex":0.0016807312,"about_ca_system_score_gemma":0.0035346448,"threshold_uncertainty_score":0.022686064},"labels":[],"label_agreement":null},{"id":"W4362676747","doi":"10.1049/cmu2.12607","title":"A new code‐based digital signature based on the McEliece cryptosystem","year":2023,"lang":"en","type":"article","venue":"IET Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"McEliece cryptosystem; Cryptosystem; Digital signature; Computer science; Public-key cryptography; Merkle signature scheme; Theoretical computer science; Signature (topology); Code (set theory); Algorithm; Key (lock); Key generation; Digital Signature Algorithm; Cryptography; Blind signature; Encryption; Mathematics; Computer security","score_opus":0.04070257753481336,"score_gpt":0.27442732495645344,"score_spread":0.2337247474216401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362676747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038791366,0.002036837,0.93414366,0.0011748847,0.0008861444,0.0005143697,0.00031039622,0.0015744352,0.020567903],"genre_scores_gemma":[0.53413224,0.0015500124,0.4388306,0.0005472174,0.0005750561,0.00033441986,0.0005186061,0.000102282174,0.02340955],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970715,0.00047497166,0.00023859923,0.00041656318,0.001600306,0.00019805695],"domain_scores_gemma":[0.99838674,0.0002379158,0.0002481918,0.00038503367,0.0005934181,0.00014879463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008507242,0.0005011886,0.000801661,0.0019342335,0.00071290584,0.0016739953,0.0012800558,0.0016256665,0.0031650958],"category_scores_gemma":[0.0022739323,0.0002114599,0.0005083786,0.0019034196,0.0011400519,0.0030375146,0.0014078096,0.0013315819,0.0011750315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011916509,0.00023116873,0.0012482887,0.000646533,0.00010419442,0.0012833574,0.0003252893,0.027372353,0.19033438,0.33537173,0.0143726,0.42751855],"study_design_scores_gemma":[0.0005079128,0.0008359034,0.0014484302,0.00015822054,0.000107431704,0.0072292658,0.000099826146,0.50617814,0.22887869,0.056625657,0.19756,0.00037051234],"about_ca_topic_score_codex":0.0008316605,"about_ca_topic_score_gemma":0.00059932185,"teacher_disagreement_score":0.0031650958,"about_ca_system_score_codex":0.0011623944,"about_ca_system_score_gemma":0.0015831686,"threshold_uncertainty_score":0.010588288},"labels":[],"label_agreement":null},{"id":"W4365151054","doi":"10.1016/j.csi.2023.103746","title":"Efficient and privacy-preserving similar electronic medical records query for large-scale ehealthcare systems","year":2023,"lang":"en","type":"article","venue":"Computer Standards & Interfaces","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Set (abstract data type); Scale (ratio); Scheme (mathematics); Information retrieval; Tree (set theory); Data mining","score_opus":0.014142270737098938,"score_gpt":0.29997897373890564,"score_spread":0.2858367030018067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365151054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1943273,0.0017615011,0.793676,0.0015378804,0.00016791065,0.00060355756,0.0018116927,0.0027516014,0.003362613],"genre_scores_gemma":[0.892467,0.00032066592,0.10249622,0.00031797632,0.00012985167,0.000084297615,0.0019629975,0.000060769435,0.002160155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448425,0.0010631827,0.0004680242,0.0009132123,0.0025107332,0.00056056445],"domain_scores_gemma":[0.9945082,0.0014473879,0.0004072438,0.0027891253,0.0006802797,0.0001677985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026755151,0.0005016747,0.0018996728,0.00096649874,0.0013771318,0.0025093537,0.0025445216,0.0013558238,0.002176142],"category_scores_gemma":[0.0065392405,0.00047920816,0.0010711884,0.0022878947,0.0009205482,0.0044070007,0.0036799037,0.0011715898,0.00077677803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006813165,0.0017023792,0.01844139,0.00083830213,0.00067682203,0.0015159148,0.0015341233,0.13645059,0.17783289,0.05802132,0.027916063,0.56825703],"study_design_scores_gemma":[0.00021886232,0.00060460315,0.0030309372,0.000015649031,0.00015307097,0.0013252882,0.00056721835,0.93462074,0.031597823,0.02235595,0.005452626,0.00005728071],"about_ca_topic_score_codex":0.002106935,"about_ca_topic_score_gemma":0.0024589966,"teacher_disagreement_score":0.0026755151,"about_ca_system_score_codex":0.0009325578,"about_ca_system_score_gemma":0.0026401167,"threshold_uncertainty_score":0.014149666},"labels":[],"label_agreement":null},{"id":"W4365934948","doi":"10.1007/978-3-031-30589-4","title":"Advances in Cryptology – EUROCRYPT 2023","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Santa Barbara; University of Haifa; Institut Universitaire de France; Aalto-Yliopisto; KU Leuven; Technische Universiteit Eindhoven; University of Melbourne; University of California, San Diego; Bar-Ilan University; Durham University; Universiteit Leiden; Université du Luxembourg; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; University of Edinburgh; Johns Hopkins University; Florida State University; Microsoft Research; Indian Institute of Science; York University; Intel Corporation","keywords":"Computer science; Cryptography; Key (lock); Public-key cryptography; Theoretical computer science; Computer security; Encryption","score_opus":0.012538791290674187,"score_gpt":0.2632252774280891,"score_spread":0.2506864861374149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365934948","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032053352,0.065651506,0.05285839,0.010633666,0.02240378,0.00020305827,0.0012598848,0.0027340404,0.8410503],"genre_scores_gemma":[0.020250885,0.025987789,0.01422626,0.0015838795,0.0049870834,0.000083415754,0.001461385,0.00097510073,0.93044424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991053,0.00012888324,0.0000365949,0.000110904955,0.00052618195,0.0000921485],"domain_scores_gemma":[0.999303,0.00013683097,0.000053908083,0.00017722383,0.00021516645,0.00011382722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001292383,0.0014274917,0.00083722675,0.0018264402,0.00059788814,0.003756554,0.0008625507,0.0017378762,0.085693724],"category_scores_gemma":[0.0017470737,0.00048327702,0.00041397777,0.0021861359,0.0007717531,0.0043756133,0.0015752967,0.0034308562,0.07492743],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012893249,0.00006662736,0.0000807842,0.00031235555,0.000020823256,0.000052230225,0.00002040432,0.0012519539,0.0018852513,0.07470076,0.52689457,0.39458534],"study_design_scores_gemma":[0.00002610474,0.000052646443,0.00026579798,0.00014169187,0.000009496522,0.00022254237,0.000008578378,0.0022828123,0.0018257813,0.018617343,0.97653586,0.000011279667],"about_ca_topic_score_codex":0.0007597108,"about_ca_topic_score_gemma":0.00083941437,"teacher_disagreement_score":0.085693724,"about_ca_system_score_codex":0.0016120694,"about_ca_system_score_gemma":0.0013971638,"threshold_uncertainty_score":0.28667402},"labels":[],"label_agreement":null},{"id":"W4366307844","doi":"10.1007/978-3-031-30872-7_8","title":"Unlinkable Policy-Based Sanitizable Signatures","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.017185614919197244,"score_gpt":0.25173951234884917,"score_spread":0.23455389742965194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366307844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03277768,0.0007169416,0.88395125,0.0013278557,0.0007914212,0.00025742222,0.00035151004,0.007633602,0.07219234],"genre_scores_gemma":[0.69758457,0.00094016595,0.2058865,0.00082358153,0.0004337272,0.0004484068,0.0009931229,0.0016881448,0.09120174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995346,0.00092903967,0.00032326617,0.0006045962,0.0021879082,0.00060927623],"domain_scores_gemma":[0.9897254,0.0033124369,0.00057585957,0.0049532843,0.0011065782,0.0003263663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025848784,0.00080101506,0.0010062989,0.0012842091,0.0012348655,0.0042489646,0.0021230853,0.0019157213,0.010757091],"category_scores_gemma":[0.009017445,0.00079352566,0.00056912785,0.0015606268,0.0030926205,0.00901964,0.0056809783,0.0058751167,0.0074234805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089529617,0.0003483042,0.00039406843,0.0002614173,0.00003584745,0.00017572808,0.00062198227,0.022341508,0.016308278,0.72543114,0.012968277,0.22021814],"study_design_scores_gemma":[0.00013591399,0.00019183877,0.0001625491,0.00012018607,0.00004767991,0.0003287085,0.00011944927,0.14464942,0.042895414,0.7519031,0.0593727,0.00007299184],"about_ca_topic_score_codex":0.00030213804,"about_ca_topic_score_gemma":0.00030558917,"teacher_disagreement_score":0.010757091,"about_ca_system_score_codex":0.0016856117,"about_ca_system_score_gemma":0.0017309801,"threshold_uncertainty_score":0.035986066},"labels":[],"label_agreement":null},{"id":"W4367593108","doi":"10.1007/978-3-031-31371-4_6","title":"Credibility in Private Set Membership","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Communication source; Credibility; Computer science; Soundness; Password; Set (abstract data type); Logarithm; Protocol (science); Theoretical computer science; Private information retrieval; Computer security; Construct (python library); Discrete mathematics; Algorithm; Computer network; Mathematics; Programming language","score_opus":0.03978685205691578,"score_gpt":0.2708716261121927,"score_spread":0.2310847740552769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367593108","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044435013,0.006986575,0.4644716,0.029570563,0.0011377068,0.0001069445,0.00051369745,0.00040218496,0.45237577],"genre_scores_gemma":[0.88177514,0.0031852038,0.033414554,0.0010485261,0.002667335,0.00021729355,0.00028605742,0.00029071074,0.07711518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954091,0.0021214113,0.00016237961,0.00052091473,0.0015117031,0.00027444673],"domain_scores_gemma":[0.96330583,0.031002527,0.0008755466,0.0029741044,0.0013544846,0.00048749146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004989643,0.00061903015,0.0013465392,0.0016826462,0.0024383385,0.0059888423,0.0016292724,0.0033883194,0.014456757],"category_scores_gemma":[0.03985673,0.0008689413,0.0008006884,0.0030359887,0.008444728,0.016764522,0.0035901056,0.008623175,0.002286428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017866054,0.000005369025,0.000048294874,0.000023791174,0.0000025434504,0.0000151231525,0.000098524266,0.0012391664,0.000055150213,0.99033445,0.0019218602,0.0062379297],"study_design_scores_gemma":[0.0000029442328,0.0000020379134,0.0000174819,0.0000069965113,0.0000013534968,0.000015621761,0.000012347122,0.0024932052,0.000046620753,0.9958509,0.0015481829,0.0000023175385],"about_ca_topic_score_codex":0.0006510969,"about_ca_topic_score_gemma":0.00037657432,"teacher_disagreement_score":0.014456757,"about_ca_system_score_codex":0.003894164,"about_ca_system_score_gemma":0.0009841856,"threshold_uncertainty_score":0.048362672},"labels":[],"label_agreement":null},{"id":"W4367701204","doi":"10.4230/lipics.icalp.2023.115","title":"Population Protocols with Unordered Data","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Population; Geodetic datum; Computation; Theoretical computer science; Formalism (music); Expressive power; Sequence (biology); Constant (computer programming); Programming language","score_opus":0.2323712200109445,"score_gpt":0.24086456503985915,"score_spread":0.008493345028914634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367701204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06135248,0.0002458792,0.9266787,0.0013177108,0.000108669796,0.00019285368,0.0003788245,0.0005036445,0.009221239],"genre_scores_gemma":[0.77740186,0.0003868522,0.20964421,0.00052303396,0.00016183124,0.0008530538,0.0004926606,0.00016028316,0.010376201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938024,0.002228642,0.00058115984,0.0012821342,0.0016001082,0.00050552463],"domain_scores_gemma":[0.9866398,0.0067240647,0.0013073221,0.0037240877,0.0010413649,0.00056336954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042359075,0.0005093038,0.00080661493,0.00089898333,0.0017103642,0.0036378182,0.0021265391,0.001459797,0.0028360672],"category_scores_gemma":[0.013316111,0.00043230975,0.00093511486,0.0011485082,0.0045607723,0.011329093,0.005477448,0.003005643,0.00055146904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006605701,0.00002441414,0.000298757,0.000041360683,0.000012485849,0.00010483076,0.00050111476,0.008719646,0.0017485337,0.9824892,0.0005160802,0.0054774806],"study_design_scores_gemma":[0.00006328529,0.000071047914,0.00011864182,0.00004173578,0.000028908591,0.00016233897,0.00026702098,0.11132926,0.007818906,0.8638632,0.016195256,0.000040296152],"about_ca_topic_score_codex":0.0010318633,"about_ca_topic_score_gemma":0.00080141163,"teacher_disagreement_score":0.0042359075,"about_ca_system_score_codex":0.0019409262,"about_ca_system_score_gemma":0.0018894146,"threshold_uncertainty_score":0.02240187},"labels":[],"label_agreement":null},{"id":"W4375802464","doi":"10.1109/tsc.2023.3273208","title":"PPOLQ: Privacy-Preserving Optimal Location Query With Multiple-Condition Filter in Outsourced Environments","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Homomorphic encryption; Paillier cryptosystem; Outsourcing; Cloud computing; Encryption; Location-based service; Information privacy; Scheme (mathematics); Masking (illustration); Protocol (science); Data mining; Computer network; Computer security; Public-key cryptography","score_opus":0.013283387205266402,"score_gpt":0.23680976822990105,"score_spread":0.22352638102463465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375802464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024073923,0.00033817813,0.97164494,0.0003880259,0.000056830544,0.00021679548,0.0002800284,0.001481563,0.0015197254],"genre_scores_gemma":[0.7919086,0.0004145056,0.20185398,0.00045787322,0.00012879368,0.00032765896,0.00071668345,0.00015704375,0.0040348447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945058,0.0009914313,0.0003601586,0.0009773328,0.0023731568,0.0007921601],"domain_scores_gemma":[0.9952872,0.0014906435,0.0006117344,0.0018941424,0.0005011053,0.00021525218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00376694,0.0007764991,0.0020613433,0.0007904582,0.0013107904,0.0019482559,0.0026944934,0.001755606,0.002535092],"category_scores_gemma":[0.006865946,0.00046390956,0.0011425894,0.0017983255,0.0018011858,0.006351741,0.005260161,0.0016093748,0.000741837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003507987,0.00055829575,0.004889624,0.000760924,0.00032691404,0.0016397318,0.0016958793,0.2977977,0.05684032,0.24164678,0.02121195,0.36912382],"study_design_scores_gemma":[0.000328428,0.00036020172,0.0008203964,0.000028611828,0.00006612454,0.0007846219,0.00027314344,0.9027905,0.020970074,0.064530686,0.008942224,0.00010502156],"about_ca_topic_score_codex":0.0039011494,"about_ca_topic_score_gemma":0.0018447373,"teacher_disagreement_score":0.0039011494,"about_ca_system_score_codex":0.0016947606,"about_ca_system_score_gemma":0.003243522,"threshold_uncertainty_score":0.01992172},"labels":[],"label_agreement":null},{"id":"W4377966882","doi":"10.1109/access.2023.3279395","title":"Composable Anonymous Proof-of-Location With User-Controlled Offline Access","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Automated theorem proving; Computer science; Overhead (engineering); Notation; Algorithm; Discrete mathematics; Mathematics; Information retrieval; Programming language; Arithmetic","score_opus":0.03354479945893045,"score_gpt":0.31433947976743587,"score_spread":0.2807946803085054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377966882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007793091,0.00017904118,0.9662299,0.0004932421,0.00021876062,0.00032385282,0.0005015919,0.015231859,0.009028675],"genre_scores_gemma":[0.48443556,0.00034942143,0.47709554,0.00071289175,0.0003855564,0.001016331,0.0016365572,0.0033204646,0.031047706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9815205,0.00463874,0.0015660094,0.0036286726,0.0061847297,0.00246135],"domain_scores_gemma":[0.9576606,0.013032823,0.0016005563,0.023060674,0.0034692036,0.0011762328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008433748,0.0018763123,0.002892975,0.0013231875,0.002777925,0.007244829,0.006032727,0.0031653096,0.019148337],"category_scores_gemma":[0.029371606,0.0016580076,0.002565568,0.0018516744,0.0038706758,0.013092628,0.017819973,0.0042595067,0.008741764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023962895,0.00066314806,0.0018323616,0.0008354102,0.00027724053,0.0021358079,0.0014389992,0.075018935,0.017153475,0.6856799,0.031065244,0.18150324],"study_design_scores_gemma":[0.00028224147,0.00013818832,0.0001932601,0.00009685993,0.00015298663,0.00054867094,0.00012589595,0.4197875,0.028944729,0.5137496,0.035845373,0.00013475321],"about_ca_topic_score_codex":0.0014961397,"about_ca_topic_score_gemma":0.0018381062,"teacher_disagreement_score":0.019148337,"about_ca_system_score_codex":0.002480761,"about_ca_system_score_gemma":0.0049907276,"threshold_uncertainty_score":0.06405759},"labels":[],"label_agreement":null},{"id":"W4378213708","doi":"10.1117/12.2675431","title":"Digital signature and hash algorithms used in Bitcoin and Ethereum","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Elliptic Curve Digital Signature Algorithm; Hash function; Computer science; Digital signature; Digital Signature Algorithm; Merkle signature scheme; ElGamal signature scheme; Merkle tree; Cryptography; Cryptographic hash function; Algorithm; Schnorr signature; Public-key cryptography; Elliptic curve cryptography; Computer security; Theoretical computer science; Blind signature; Encryption","score_opus":0.014057322472745123,"score_gpt":0.2387163776303457,"score_spread":0.22465905515760057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378213708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030560864,0.008452072,0.8920616,0.002068427,0.001103745,0.0007807926,0.00060754945,0.0020041533,0.062360853],"genre_scores_gemma":[0.4986673,0.008150131,0.43197522,0.001509707,0.0005798706,0.00081926456,0.0012028016,0.00046007158,0.056635667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948767,0.0012698134,0.00057953736,0.00085307396,0.0020434975,0.0003773717],"domain_scores_gemma":[0.9967601,0.0007910104,0.00034245965,0.0010665038,0.0009010357,0.00013897732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024517097,0.0006704582,0.00065457216,0.0017342451,0.001092953,0.0025693928,0.0010210128,0.0019316595,0.0058616],"category_scores_gemma":[0.005383597,0.00039205488,0.00073336007,0.0030582207,0.0021875852,0.0048854332,0.0016049532,0.002034513,0.0033384678],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054448686,0.00013839235,0.0017314684,0.00087802805,0.000066077315,0.0005167837,0.0008185838,0.010924685,0.021734936,0.5917137,0.0075250766,0.3634077],"study_design_scores_gemma":[0.00017607333,0.0007523524,0.0018036297,0.00048151542,0.00008590675,0.0032732587,0.0004503949,0.05257143,0.10077351,0.24053352,0.59882355,0.00027487855],"about_ca_topic_score_codex":0.0010130131,"about_ca_topic_score_gemma":0.0004587734,"teacher_disagreement_score":0.0058616,"about_ca_system_score_codex":0.0014030795,"about_ca_system_score_gemma":0.0014349362,"threshold_uncertainty_score":0.019609034},"labels":[],"label_agreement":null},{"id":"W4378976252","doi":"10.1109/tetc.2023.3280470","title":"An Optimized Hardware Implementation of Modular Multiplication of Binary Ring LWE","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cryptography; Modular arithmetic; Learning with errors; Multiplication (music); Field-programmable gate array; Parallel computing; Modular design; Side channel attack; Embedded system; Computer engineering; Computer hardware; Algorithm; Operating system; Mathematics","score_opus":0.027886741393300638,"score_gpt":0.3279709954624198,"score_spread":0.30008425406911915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378976252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17568763,0.0012450475,0.7955022,0.00035479455,0.0003067956,0.0002992209,0.00034749217,0.0067363596,0.019520473],"genre_scores_gemma":[0.6938407,0.00022982001,0.29841343,0.0001372051,0.00006418831,0.00012537974,0.0003724528,0.00011248265,0.0067044413],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996964,0.000041888223,0.000029198383,0.000055975073,0.00011549738,0.00006107495],"domain_scores_gemma":[0.9997588,0.000043845444,0.000042096843,0.00006462157,0.00007343333,0.000017232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021759981,0.0004288725,0.0003574002,0.00050182006,0.00029589757,0.0005439879,0.0008061485,0.00025921979,0.0065157884],"category_scores_gemma":[0.0005765395,0.00020335385,0.00026621655,0.0004408056,0.00021353136,0.00077883375,0.00038142843,0.00037212332,0.0017611226],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012305082,0.00029470495,0.0025893792,0.0006234253,0.000118645476,0.0007031514,0.0001945228,0.02990535,0.37662208,0.038496718,0.011922088,0.53729945],"study_design_scores_gemma":[0.00043563894,0.0030462847,0.003361543,0.00012152076,0.00014089275,0.0026769345,0.000109625624,0.4180545,0.4933253,0.010753666,0.067818865,0.0001552076],"about_ca_topic_score_codex":0.0005027391,"about_ca_topic_score_gemma":0.0010638316,"teacher_disagreement_score":0.0065157884,"about_ca_system_score_codex":0.0003448887,"about_ca_system_score_gemma":0.0007041439,"threshold_uncertainty_score":0.021797538},"labels":[],"label_agreement":null},{"id":"W4379618860","doi":"10.1109/access.2023.3283503","title":"A Communication-Efficient Local Differentially Private Algorithm in Federated Optimization","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Mitacs","keywords":"Computer science; Optimization algorithm; Algorithm design; Distributed computing; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.022438044518114566,"score_gpt":0.28885597424572806,"score_spread":0.2664179297276135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379618860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011546482,0.0001261192,0.98659885,0.00023967707,0.000022656066,0.000035174904,0.000032287233,0.0003526467,0.0010459853],"genre_scores_gemma":[0.61079484,0.00017859905,0.3839787,0.0003657534,0.0000624775,0.00026221797,0.00017048005,0.00012222868,0.0040647467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792576,0.00081710226,0.00009078212,0.00042209137,0.00047542076,0.00026891034],"domain_scores_gemma":[0.9972249,0.0016390905,0.00026322476,0.00047929413,0.00026694348,0.0001265526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030368604,0.0008372116,0.0015616645,0.00062095386,0.00082577276,0.0012414013,0.0023885928,0.0018507739,0.0015742838],"category_scores_gemma":[0.006057416,0.00043252198,0.0007522251,0.0011295908,0.0015662124,0.0022570707,0.0023943502,0.0019150048,0.00048635944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047944515,0.00016881387,0.0006116897,0.0000920957,0.00007077808,0.0001131598,0.00017118848,0.83171564,0.0038568375,0.062387563,0.0026936007,0.09763925],"study_design_scores_gemma":[0.00003396301,0.000035318066,0.00004015499,0.0000045854003,0.0000061307605,0.000019099567,0.000007502244,0.9814104,0.0008869508,0.01719353,0.000356203,0.0000062250856],"about_ca_topic_score_codex":0.0019152045,"about_ca_topic_score_gemma":0.0017322436,"teacher_disagreement_score":0.0030368604,"about_ca_system_score_codex":0.0018556189,"about_ca_system_score_gemma":0.0022743184,"threshold_uncertainty_score":0.01606065},"labels":[],"label_agreement":null},{"id":"W4380086873","doi":"10.2196/44700","title":"Secure Comparisons of Single Nucleotide Polymorphisms Using Secure Multiparty Computation: Method Development","year":2023,"lang":"en","type":"article","venue":"JMIR Bioinformatics and Biotechnology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institutes of Health; National Science Foundation","keywords":"Jaccard index; Computer science; Secure multi-party computation; Set (abstract data type); Similarity (geometry); Intersection (aeronautics); Bloom filter; Computation; Single-nucleotide polymorphism; Data mining; Theoretical computer science; Computer security; Cryptography; Computer network; Biology; Genetics; Algorithm; Genotype; Artificial intelligence","score_opus":0.03366898749568177,"score_gpt":0.2928690265915594,"score_spread":0.25920003909587763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380086873","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020107012,0.00010035412,0.996852,0.00017045613,0.000020679816,0.00008589253,0.000019636176,0.00019132628,0.00054895756],"genre_scores_gemma":[0.16956863,0.00037707295,0.8268121,0.00018187235,0.0001240581,0.00062982534,0.00010845169,0.00017338202,0.0020246967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924419,0.0035546992,0.0003521059,0.00080682366,0.0024614169,0.0003830612],"domain_scores_gemma":[0.9807647,0.011639332,0.00095320446,0.0040955315,0.002145651,0.00040161822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008286224,0.00078384875,0.0011893666,0.0013632702,0.0010807378,0.0023527225,0.0024795344,0.0016926652,0.0044046002],"category_scores_gemma":[0.026589924,0.00069526356,0.0018698358,0.0014735395,0.0022964727,0.0032316656,0.0050335694,0.0031965203,0.0017914369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036692998,0.00029963892,0.0036405665,0.0003043464,0.00021336746,0.00044025132,0.00041444864,0.2922166,0.0076478994,0.40327123,0.0050181565,0.28616664],"study_design_scores_gemma":[0.000028409995,0.00003810727,0.00016781516,0.000022592585,0.000014000871,0.00013305817,0.000028322807,0.92078525,0.0025881378,0.07410384,0.0020712013,0.000019264164],"about_ca_topic_score_codex":0.00088761334,"about_ca_topic_score_gemma":0.00079792656,"teacher_disagreement_score":0.008286224,"about_ca_system_score_codex":0.0016402886,"about_ca_system_score_gemma":0.0032648956,"threshold_uncertainty_score":0.04382223},"labels":[],"label_agreement":null},{"id":"W4382999347","doi":"10.1109/tdsc.2023.3291715","title":"PHRkNN: Efficient and Privacy-Preserving Reverse kNN Query Over High-Dimensional Data in Cloud","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Query optimization; Homomorphic encryption; Scheme (mathematics); Range query (database); Information privacy; Outsourcing; Big data; Sargable; Data mining; Private information retrieval; Web search query; Information retrieval; Computer security; Search engine; Mathematics","score_opus":0.023675178659607516,"score_gpt":0.2630985343970592,"score_spread":0.2394233557374517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382999347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06297181,0.0007291824,0.92947453,0.0008140395,0.00011550608,0.00043134473,0.0008303448,0.0012368291,0.0033964228],"genre_scores_gemma":[0.7975739,0.0006271818,0.19588558,0.00048710298,0.00008700979,0.00034045766,0.0010628325,0.00009637151,0.003839497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471503,0.0010109249,0.0005299912,0.00096626737,0.002016062,0.00076164585],"domain_scores_gemma":[0.99521685,0.0011863004,0.0005115543,0.002313667,0.00057858357,0.00019302254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028026523,0.00050113676,0.00147753,0.0006188189,0.0014589716,0.0016994091,0.002329587,0.0013437459,0.0016460598],"category_scores_gemma":[0.006704539,0.00036701915,0.0011025207,0.0019352916,0.0015003083,0.0068993345,0.004709396,0.0017239429,0.00066013215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027053973,0.0005740978,0.0070773135,0.0010216213,0.00030700112,0.0013319112,0.0020475478,0.2430336,0.09847856,0.32213834,0.02164163,0.299643],"study_design_scores_gemma":[0.0001877876,0.00039384633,0.0012696879,0.00004526566,0.000060862483,0.0012307557,0.00040291535,0.8459096,0.037261315,0.10115901,0.011924299,0.00015467801],"about_ca_topic_score_codex":0.002626705,"about_ca_topic_score_gemma":0.0019810335,"teacher_disagreement_score":0.0028026523,"about_ca_system_score_codex":0.0016853655,"about_ca_system_score_gemma":0.0029455086,"threshold_uncertainty_score":0.014822006},"labels":[],"label_agreement":null},{"id":"W4384009799","doi":"10.1109/icbc56567.2023.10174895","title":"vPass: Publicly Verifiable Fair Exchange Protocol for Vehicle Passports","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Victoria","funders":"","keywords":"Computer security; Computer science; Discrete logarithm; Encryption; ElGamal encryption; Zero-knowledge proof; Trusted third party; Confidentiality; Adversary; Verifiable secret sharing; Protocol (science); Public-key cryptography; Cryptography","score_opus":0.04643280499336127,"score_gpt":0.3151212848564187,"score_spread":0.26868847986305744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384009799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0392435,0.0003554431,0.942322,0.0014950875,0.0002567324,0.0007330196,0.00056804245,0.002672194,0.012353939],"genre_scores_gemma":[0.87976533,0.00039173473,0.10454447,0.00039109006,0.00011179525,0.0008574948,0.00089543697,0.00019794113,0.012844677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626833,0.0012039961,0.00022172803,0.0005045012,0.0013129575,0.00048847083],"domain_scores_gemma":[0.9962358,0.001383059,0.00042431263,0.0012160512,0.00048346823,0.00025736255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036458883,0.0005030418,0.0008286427,0.00071438705,0.0016035852,0.0024465374,0.0023262105,0.0020034257,0.006027257],"category_scores_gemma":[0.008416877,0.00048995845,0.00074566295,0.00087539596,0.0028417949,0.0052954336,0.005524704,0.0023810372,0.0012295722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000794727,0.00012808341,0.0008951877,0.00029491272,0.0000993946,0.0011460653,0.0012358922,0.07280338,0.011352422,0.8229863,0.011865488,0.07639813],"study_design_scores_gemma":[0.00044833543,0.00037464348,0.00052121095,0.00013649107,0.00009120211,0.00054090976,0.00031100042,0.39077738,0.02468136,0.48840597,0.093555376,0.00015605558],"about_ca_topic_score_codex":0.0022977097,"about_ca_topic_score_gemma":0.0014556221,"teacher_disagreement_score":0.006027257,"about_ca_system_score_codex":0.0016206183,"about_ca_system_score_gemma":0.0037588314,"threshold_uncertainty_score":0.020163178},"labels":[],"label_agreement":null},{"id":"W4384026500","doi":"10.1109/icbc56567.2023.10174952","title":"Fast Computation of Multi-Scalar Multiplication for Pairing-Based zkSNARK Applications","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Scalar (mathematics); Pairing; Computer science; Elliptic curve; Algorithm; Theoretical computer science; Mathematics; Arithmetic; Discrete mathematics; Pure mathematics; Physics","score_opus":0.03646746391441193,"score_gpt":0.30359297251850154,"score_spread":0.2671255086040896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384026500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044116043,0.00041918692,0.9374786,0.0004472536,0.00022235414,0.00028505808,0.00019120655,0.004356444,0.012483927],"genre_scores_gemma":[0.7158083,0.00033262512,0.2700942,0.00017433421,0.00015531063,0.00025007164,0.0005394304,0.00030719422,0.0123385135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704045,0.00068094605,0.0002471568,0.00049504195,0.0010422833,0.00049417454],"domain_scores_gemma":[0.9978884,0.0005404254,0.00014291471,0.0009140258,0.00038006966,0.00013416789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017931535,0.0007499913,0.0012535576,0.0009711888,0.0016280434,0.0026505613,0.0017103757,0.0010610351,0.010132937],"category_scores_gemma":[0.0040805037,0.0005105834,0.0010508413,0.0011333493,0.0012331805,0.0051929587,0.004970424,0.0019620995,0.003722156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027567223,0.0004912852,0.0031266576,0.0006959225,0.00016948441,0.00095368404,0.0011590366,0.056230508,0.049484346,0.50337625,0.013344595,0.36821145],"study_design_scores_gemma":[0.00028287363,0.00047235997,0.0009288803,0.00012994725,0.00009996027,0.0007668705,0.00029014502,0.5717029,0.09379015,0.29734138,0.03405047,0.00014408027],"about_ca_topic_score_codex":0.0007814916,"about_ca_topic_score_gemma":0.0012837731,"teacher_disagreement_score":0.010132937,"about_ca_system_score_codex":0.0015733774,"about_ca_system_score_gemma":0.0022548481,"threshold_uncertainty_score":0.033898056},"labels":[],"label_agreement":null},{"id":"W4384705347","doi":"10.1109/ipdps54959.2023.00084","title":"TurboHE: Accelerating Fully Homomorphic Encryption Using FPGA Clusters","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Field-programmable gate array; Encryption; Homomorphic encryption; Cloud computing; Reconfigurable computing; Embedded system; Hardware acceleration; Throughput; Computer hardware; Operating system; Wireless","score_opus":0.061713989082544045,"score_gpt":0.27785449954543523,"score_spread":0.21614051046289118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384705347","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55979484,0.0019929549,0.3850325,0.00044070018,0.0004469888,0.0004066219,0.0005603729,0.02009769,0.031227296],"genre_scores_gemma":[0.8721803,0.00031049686,0.11751228,0.000120183526,0.000030420064,0.000105518295,0.00046643385,0.00015174912,0.009122565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997192,0.000038846672,0.000014735003,0.000042532163,0.000112624395,0.000071991126],"domain_scores_gemma":[0.9996984,0.000067822344,0.000033678654,0.00009056818,0.00007533987,0.00003415272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030272885,0.00052048103,0.00031413205,0.0004930435,0.00027587105,0.0005362171,0.0009358306,0.00024734653,0.005606141],"category_scores_gemma":[0.0006817654,0.00019790624,0.00028135403,0.0004610476,0.00029010387,0.0011174801,0.0006072483,0.0005622805,0.0011331799],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003953272,0.000569854,0.007615096,0.00066578,0.00023287132,0.0013309055,0.00045842642,0.19405265,0.23623982,0.038061164,0.03695314,0.47986707],"study_design_scores_gemma":[0.0004504485,0.0020579018,0.0040048575,0.00006419494,0.00006403762,0.0006564879,0.00016285686,0.74993193,0.193527,0.0053751715,0.04360367,0.00010148182],"about_ca_topic_score_codex":0.002277958,"about_ca_topic_score_gemma":0.0028250956,"teacher_disagreement_score":0.005606141,"about_ca_system_score_codex":0.0004930313,"about_ca_system_score_gemma":0.0007764006,"threshold_uncertainty_score":0.018754423},"labels":[],"label_agreement":null},{"id":"W4385009000","doi":"10.1007/978-3-031-32415-4_29","title":"Fides: A System for Verifiable Computation Using Smart Contracts","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Server; Verifiable secret sharing; Delegation; Computation; Smart contract; Cryptography; Theoretical computer science; Secret sharing; Cloud computing; Protocol (science); Computer security; Distributed computing; Database transaction; Computer network; Operating system; Algorithm; Database; Programming language","score_opus":0.03359754693691474,"score_gpt":0.2690848659029016,"score_spread":0.23548731896598685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385009000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009933753,0.00046231516,0.89907867,0.0006157061,0.0004955242,0.00028676115,0.0010614247,0.062500566,0.02556538],"genre_scores_gemma":[0.36357287,0.001013934,0.5131329,0.0015929152,0.0005308396,0.0010005715,0.0036549855,0.013333493,0.10216744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814475,0.00045883175,0.000129023,0.00028473296,0.0007379054,0.0002447364],"domain_scores_gemma":[0.9973871,0.00084830134,0.00012171599,0.0012740232,0.00020879437,0.00016006896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022513599,0.0009651502,0.0010823301,0.0013216812,0.0011257628,0.0032588353,0.0027906268,0.0018421182,0.029416706],"category_scores_gemma":[0.005479623,0.0011731258,0.0008872071,0.0011029462,0.0023020788,0.007904505,0.0052130064,0.0034882014,0.01125528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018418169,0.00023584397,0.000849972,0.0004717208,0.00010179466,0.00028052073,0.00065296586,0.009724568,0.019478772,0.5700305,0.12306627,0.2732653],"study_design_scores_gemma":[0.00054844044,0.00030404632,0.00048053978,0.000156892,0.00012703489,0.0005839185,0.00010386882,0.20996073,0.069929406,0.39452788,0.32307947,0.00019774081],"about_ca_topic_score_codex":0.00072146964,"about_ca_topic_score_gemma":0.00073741167,"teacher_disagreement_score":0.029416706,"about_ca_system_score_codex":0.00091463106,"about_ca_system_score_gemma":0.0014546743,"threshold_uncertainty_score":0.0984087},"labels":[],"label_agreement":null},{"id":"W4385009902","doi":"10.1007/978-3-031-32415-4_10","title":"Privacy-Preserving Post-quantum Credentials for Digital Payments","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Computer science; Credential; Homomorphic encryption; Commitment scheme; Computer security; Encryption; Random oracle; Zero-knowledge proof; Theoretical computer science; Quantum computer; Quantum; Learning with errors; Cryptography; Public-key cryptography","score_opus":0.026521137398159242,"score_gpt":0.26834902734974836,"score_spread":0.2418278899515891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385009902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049166787,0.0011849856,0.8780662,0.002636905,0.0007789932,0.00020166735,0.0003398552,0.0008979476,0.06672662],"genre_scores_gemma":[0.89036435,0.0009267523,0.07317004,0.00046188774,0.00046145386,0.00013166851,0.00019919194,0.00017867018,0.034105834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968058,0.0008470246,0.00019767098,0.00043727012,0.0011264805,0.0005857781],"domain_scores_gemma":[0.99531806,0.0018251429,0.00021488554,0.0020769117,0.0003671649,0.00019788124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025343674,0.0005651553,0.0010370249,0.00063969387,0.0020200557,0.004692166,0.0018332091,0.002075243,0.010676952],"category_scores_gemma":[0.009070582,0.0005550105,0.00084032904,0.001406294,0.004062666,0.008335991,0.0041993037,0.0047542094,0.003403793],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011330785,0.000047677797,0.00006159659,0.00006033175,0.0000072581397,0.00006541096,0.00010051193,0.0038380055,0.0017485205,0.96619093,0.0022060073,0.02556042],"study_design_scores_gemma":[0.000024246243,0.000032878484,0.000060992446,0.000024044668,0.000007770279,0.0001327129,0.000029135588,0.023179155,0.00257228,0.9670746,0.0068434463,0.000018910114],"about_ca_topic_score_codex":0.00029083635,"about_ca_topic_score_gemma":0.00030316063,"teacher_disagreement_score":0.010676952,"about_ca_system_score_codex":0.0015276704,"about_ca_system_score_gemma":0.0017091752,"threshold_uncertainty_score":0.035717964},"labels":[],"label_agreement":null},{"id":"W4385012192","doi":"10.1007/978-3-031-32415-4_31","title":"Dispute-Free Scalable Open Vote Network Using zk-SNARKs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Scalability; Leader election; Implementation; Verifiable secret sharing; Computation; Smart contract; Zero-knowledge proof; Homomorphic encryption; Voting; Protocol (science); Distributed computing; Theoretical computer science; Computer security; Cryptography; Algorithm; Programming language; Encryption; Operating system; Blockchain","score_opus":0.03244561749592349,"score_gpt":0.2704134622859956,"score_spread":0.2379678447900721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385012192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15412006,0.0006228652,0.7845771,0.0020504168,0.0008459999,0.00068078976,0.0014940869,0.0098807,0.045727924],"genre_scores_gemma":[0.9255502,0.00019057839,0.059588205,0.00022175831,0.0001345276,0.00025579712,0.0010181672,0.00036129088,0.012679516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976502,0.0004163231,0.00015148704,0.00040004996,0.0008513093,0.00053063704],"domain_scores_gemma":[0.99447435,0.0015930855,0.00034875103,0.0024761327,0.0006712784,0.00043645958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001814259,0.0005252395,0.0017786345,0.0009747326,0.0028614593,0.0036016104,0.0028962328,0.0013907301,0.011660225],"category_scores_gemma":[0.0059781647,0.0005047676,0.0007320707,0.0014552522,0.0017940225,0.008245974,0.0085449815,0.0028386617,0.0025331513],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042201723,0.00096774974,0.0018426575,0.00048085788,0.00017824536,0.00062959467,0.00085162546,0.099008895,0.029259823,0.5566356,0.04919475,0.25673002],"study_design_scores_gemma":[0.00041386997,0.000248823,0.00041244677,0.000044668206,0.000088648674,0.00021785965,0.00032887748,0.6045005,0.0130175855,0.36590332,0.014735518,0.00008800462],"about_ca_topic_score_codex":0.0013327124,"about_ca_topic_score_gemma":0.0020980092,"teacher_disagreement_score":0.011660225,"about_ca_system_score_codex":0.0016107614,"about_ca_system_score_gemma":0.002466124,"threshold_uncertainty_score":0.039007306},"labels":[],"label_agreement":null},{"id":"W4385080367","doi":"10.1109/sp46215.2023.10179396","title":"Private Collaborative Data Cleaning via Non-Equi PSI","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Bank of Canada","keywords":"Bloom filter; Computer science; Intersection (aeronautics); Exploit; Information leakage; Differential privacy; Set (abstract data type); Data mining; Private information retrieval; Information privacy; Protocol (science); Filter (signal processing); Pseudorandom function family; Data set; Theoretical computer science; Pseudorandom number generator; Computer security; Algorithm; Engineering; Artificial intelligence","score_opus":0.0315260257843025,"score_gpt":0.29141120508091534,"score_spread":0.2598851792966128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385080367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015142231,0.0001687215,0.98074853,0.0004991655,0.000043867385,0.000131639,0.00014979462,0.0009663139,0.0021496927],"genre_scores_gemma":[0.6005765,0.00026067207,0.3922273,0.00066054874,0.00011430245,0.00036419037,0.00069530524,0.00031283122,0.004788217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9810097,0.004848649,0.0012010578,0.004328159,0.006536809,0.0020756717],"domain_scores_gemma":[0.9527924,0.011484119,0.0026777484,0.029929476,0.0025326493,0.0005835819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009810693,0.0008895488,0.002031223,0.0012722355,0.0022335388,0.0044805147,0.005604703,0.002916629,0.004612356],"category_scores_gemma":[0.028437449,0.001142356,0.0021678384,0.0026647511,0.0042201323,0.011834152,0.013834233,0.0050537917,0.0015227586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014511836,0.0006840836,0.006781829,0.0006016071,0.00043743788,0.00044540898,0.0019030913,0.12005441,0.033303767,0.51110375,0.007079114,0.3161543],"study_design_scores_gemma":[0.00013356382,0.00048350918,0.001307441,0.00007818851,0.00014029347,0.0011756514,0.00039702424,0.55725026,0.08512544,0.33904797,0.0147168925,0.00014375229],"about_ca_topic_score_codex":0.00076964457,"about_ca_topic_score_gemma":0.0006202172,"teacher_disagreement_score":0.009810693,"about_ca_system_score_codex":0.0023412216,"about_ca_system_score_gemma":0.004118651,"threshold_uncertainty_score":0.051884472},"labels":[],"label_agreement":null},{"id":"W4385269624","doi":"10.1109/wimob58348.2023.10187725","title":"Multivariate Polynomial Public Key Digital Signature Algorithm: Semi-covariance Analysis and Performance Test over 5G Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"McGill University; Carleton University","keywords":"Computer science; Robustness (evolution); Algorithm; Covariance; Digital signature; Post-quantum cryptography; Cryptography; Public-key cryptography; Digital Signature Algorithm; Key (lock); NIST; Encryption; Multivariate statistics; Theoretical computer science; Mathematics; Statistics; Machine learning; Hash function; Computer network; Computer security; Speech recognition","score_opus":0.009142360387115633,"score_gpt":0.21826289615607603,"score_spread":0.2091205357689604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385269624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8911408,0.00052621646,0.10142739,0.00046566201,0.00006360804,0.000109829816,0.00036529326,0.00082192436,0.0050791986],"genre_scores_gemma":[0.9906356,0.000075741766,0.008699002,0.000018647637,0.000010496901,0.00002110959,0.00019728889,0.000019219842,0.00032291177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670535,0.0009100328,0.00017017458,0.00030795924,0.0014713479,0.00043520777],"domain_scores_gemma":[0.9898539,0.005066669,0.0013983564,0.0013119299,0.002091983,0.00027705432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028291214,0.00044255456,0.00044151713,0.0011458468,0.0005819943,0.0008386052,0.0006149893,0.00055613526,0.0012755158],"category_scores_gemma":[0.015002073,0.00013741922,0.00038013124,0.0012630257,0.0006988325,0.0017436624,0.0008277849,0.0007201868,0.0002637971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033280354,0.0007427763,0.053419136,0.00037552076,0.00029816787,0.0004991732,0.00047884625,0.678287,0.036255497,0.03908717,0.005275911,0.18195267],"study_design_scores_gemma":[0.000031310083,0.00039646198,0.0059156353,0.000009573345,0.000022910179,0.00017563289,0.00007482301,0.97694707,0.013648549,0.0022220209,0.0005276738,0.000028233424],"about_ca_topic_score_codex":0.0036086075,"about_ca_topic_score_gemma":0.0019426644,"teacher_disagreement_score":0.0036086075,"about_ca_system_score_codex":0.001448696,"about_ca_system_score_gemma":0.0014201724,"threshold_uncertainty_score":0.014962018},"labels":[],"label_agreement":null},{"id":"W4385387792","doi":"10.18280/ria.370325","title":"A Novel Approach for Ticket Generation and Validation Using RSA and Keccak Algorithms","year":2023,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ticket; Computer science; Algorithm; Computer security","score_opus":0.12721367381241605,"score_gpt":0.3084807319716128,"score_spread":0.18126705815919675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385387792","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020613698,0.00015035986,0.99400216,0.00011016857,0.00009153158,0.00012228555,0.000031421885,0.00068502006,0.00274564],"genre_scores_gemma":[0.1002552,0.00031192886,0.89050776,0.0001602316,0.0001242975,0.00022943801,0.00018151564,0.00019023944,0.008039379],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99478734,0.0012933462,0.0003540799,0.0007633654,0.0024817425,0.00032016472],"domain_scores_gemma":[0.99607205,0.00079268415,0.00025283414,0.0016657378,0.0011114544,0.00010537444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029585767,0.0009078515,0.0011308269,0.0022984946,0.0018829046,0.0022973828,0.002369617,0.0017987099,0.008398586],"category_scores_gemma":[0.0064046434,0.0008616422,0.0014011053,0.0020378588,0.0015002799,0.0042553023,0.0027449855,0.0025605883,0.0048041455],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062503526,0.00025458375,0.0009076663,0.0003649489,0.00016859245,0.00035645373,0.0003392287,0.05394871,0.050552655,0.40433013,0.008544234,0.47960773],"study_design_scores_gemma":[0.00025079979,0.00036696845,0.0004649364,0.000116459785,0.00011475948,0.0015712682,0.000100367615,0.7124003,0.04672946,0.17477778,0.062923454,0.00018343567],"about_ca_topic_score_codex":0.0015699085,"about_ca_topic_score_gemma":0.0020814182,"teacher_disagreement_score":0.008398586,"about_ca_system_score_codex":0.0012101831,"about_ca_system_score_gemma":0.0031000755,"threshold_uncertainty_score":0.02809608},"labels":[],"label_agreement":null},{"id":"W4385414743","doi":"10.1007/978-3-031-35535-6_2","title":"A Survey on Homomorphic Encryption for Financial Cryptography Workout","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Homomorphic encryption; Cloud computing; Computer science; Scalability; Popularity; Computer security; Cryptography; Encryption; Cloud computing security; Database; Operating system","score_opus":0.05376607521807684,"score_gpt":0.25543370525227405,"score_spread":0.20166763003419722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385414743","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003952707,0.6401076,0.064471215,0.0038184745,0.004075718,0.00013452033,0.0005829648,0.00063882896,0.28221792],"genre_scores_gemma":[0.02874908,0.7137041,0.041396912,0.0026203196,0.0047283527,0.00013965304,0.0017641557,0.00046345702,0.206434],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945873,0.00007708912,0.000040661016,0.00008219275,0.00029014936,0.000051237952],"domain_scores_gemma":[0.99933547,0.0003248102,0.00003116086,0.000114771865,0.00016013207,0.00003363148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000673782,0.0008174797,0.00089099124,0.0035504403,0.00068499113,0.002789421,0.0007248147,0.0008914699,0.026447633],"category_scores_gemma":[0.0014311043,0.00067916006,0.0005792279,0.007828827,0.0008523433,0.0057238927,0.0011682615,0.0023799231,0.014813217],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036026257,0.00012979023,0.00020726403,0.0014608144,0.000017943134,0.00006417857,0.00010572692,0.0014113012,0.0018044155,0.12516953,0.121124886,0.7484683],"study_design_scores_gemma":[0.000008029617,0.000059153375,0.00040277708,0.0008651026,0.000014511206,0.0006174237,0.00004645176,0.0018225217,0.0015121235,0.07436833,0.9202584,0.000025253748],"about_ca_topic_score_codex":0.00048868556,"about_ca_topic_score_gemma":0.0006051911,"teacher_disagreement_score":0.026447633,"about_ca_system_score_codex":0.0011098165,"about_ca_system_score_gemma":0.0008843792,"threshold_uncertainty_score":0.08847612},"labels":[],"label_agreement":null},{"id":"W4385516966","doi":"10.1109/tsc.2023.3301712","title":"Non-Interactive Multi-Client Searchable Symmetric Encryption With Small Client Storage","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Timestamp; Client-side; Cryptography; Scheme (mathematics); Symmetric-key algorithm; Server-side; Database; Computer security; Computer network; Public-key cryptography","score_opus":0.02565265784873051,"score_gpt":0.2608581540584238,"score_spread":0.23520549620969328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385516966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057781544,0.0011856756,0.9279787,0.0007070273,0.000101631784,0.0006748555,0.0005292227,0.0034197501,0.007621647],"genre_scores_gemma":[0.84950554,0.00049640104,0.13868023,0.00022826751,0.000076364435,0.00045586348,0.0005360367,0.00012986237,0.009891495],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9953767,0.00074556685,0.0005918068,0.0005770087,0.0019789839,0.0007299577],"domain_scores_gemma":[0.99188095,0.0012616111,0.00077541696,0.004700077,0.0010910507,0.0002909145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017580714,0.0007595862,0.0016601234,0.00088364095,0.0013252054,0.0018761264,0.0036381485,0.0012162392,0.0059693106],"category_scores_gemma":[0.004788125,0.0005586828,0.0010626145,0.0022545306,0.0013186566,0.007857934,0.0051905597,0.0017953961,0.002180577],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045962525,0.0009642344,0.0042031286,0.0013744907,0.00037379723,0.0024035492,0.0011863968,0.11111803,0.191665,0.31371146,0.020552622,0.347851],"study_design_scores_gemma":[0.0004884619,0.0006667841,0.001030176,0.000081259604,0.00015158724,0.0036651888,0.00037796865,0.7866494,0.117437735,0.06654654,0.022667808,0.00023721585],"about_ca_topic_score_codex":0.0015051392,"about_ca_topic_score_gemma":0.0014163704,"teacher_disagreement_score":0.0059693106,"about_ca_system_score_codex":0.0022425053,"about_ca_system_score_gemma":0.003437037,"threshold_uncertainty_score":0.019969344},"labels":[],"label_agreement":null},{"id":"W4385522546","doi":"10.56553/popets-2023-0107","title":"Trifecta: Faster High-Throughput Three-Party Computation over WAN Using Multi-Fan-In Logic Gates","year":2023,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Bank of Canada; Amazon Web Services","keywords":"Precomputation; Computer science; Computation; Throughput; Latency (audio); Computer network; Constant (computer programming); Reduction (mathematics); Wide area network; Distributed computing; Algorithm; Telecommunications; Mathematics","score_opus":0.04713547527083255,"score_gpt":0.3015057539636992,"score_spread":0.25437027869286666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385522546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10607928,0.0005561738,0.86903006,0.00043633583,0.00016678413,0.00034596428,0.00021712294,0.0069541386,0.01621419],"genre_scores_gemma":[0.83041286,0.000246766,0.16261242,0.00022137412,0.000039923285,0.0002645073,0.0003718643,0.0002618359,0.0055684214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990938,0.00024678308,0.000055748267,0.00014091747,0.00027136097,0.0001915449],"domain_scores_gemma":[0.9989574,0.0003096135,0.00012248213,0.00044831808,0.00010106613,0.000061054314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012741601,0.0006095073,0.0006056236,0.0005884315,0.0008329092,0.00122413,0.0014465317,0.00055511104,0.0052467096],"category_scores_gemma":[0.001163142,0.00024687368,0.0006900781,0.0005460753,0.0009647475,0.0029305345,0.001669003,0.0013011763,0.00091703515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028631934,0.0007740961,0.0022497822,0.00079372776,0.0002808169,0.0010963115,0.0006305375,0.0960017,0.23898917,0.29773098,0.023402737,0.3351869],"study_design_scores_gemma":[0.00032186534,0.00086265925,0.0005278931,0.000060682436,0.00010450015,0.0006912201,0.000118651355,0.7800405,0.13433065,0.05375746,0.029094843,0.00008903601],"about_ca_topic_score_codex":0.00057632243,"about_ca_topic_score_gemma":0.0007118342,"teacher_disagreement_score":0.0052467096,"about_ca_system_score_codex":0.0006613246,"about_ca_system_score_gemma":0.00087038276,"threshold_uncertainty_score":0.017551959},"labels":[],"label_agreement":null},{"id":"W4385654123","doi":"10.1007/978-3-031-38554-4_17","title":"LaBRADOR: Compact Proofs for R1CS from Module-SIS","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematical proof; Hash function; Computer science; Cryptography; Combinatorial proof; Lattice (music); Proof of concept; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language; Physics","score_opus":0.02655264426282843,"score_gpt":0.25747748549641464,"score_spread":0.2309248412335862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01798469,0.0030293916,0.76108307,0.0027232252,0.0008531442,0.00017445818,0.0013661435,0.0047223037,0.2080635],"genre_scores_gemma":[0.57990485,0.0044818493,0.22057709,0.0024910965,0.0015843618,0.0007082353,0.003071657,0.004724733,0.18245605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846953,0.00052187435,0.00006475798,0.0002203833,0.00058194087,0.0001415085],"domain_scores_gemma":[0.9971528,0.0017398173,0.00012724618,0.00054474187,0.00033715452,0.00009833367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016348728,0.0021603876,0.0010454884,0.0020116675,0.001150414,0.0030007001,0.0017929068,0.0010997453,0.03778248],"category_scores_gemma":[0.004892992,0.0010078081,0.0018035218,0.0017242834,0.0021345385,0.007102337,0.0037980927,0.0048036007,0.01274175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009549347,0.000047981976,0.00010552598,0.00037291663,0.000037111913,0.00010833425,0.00024828126,0.0021089523,0.002912192,0.9156968,0.02275015,0.055516247],"study_design_scores_gemma":[0.000037288755,0.000053989,0.0001457168,0.00009467452,0.000039879407,0.00019647741,0.000040281746,0.0068627046,0.0056223483,0.9367602,0.050104488,0.000042049727],"about_ca_topic_score_codex":0.00045138618,"about_ca_topic_score_gemma":0.0005208225,"teacher_disagreement_score":0.03778248,"about_ca_system_score_codex":0.0018297998,"about_ca_system_score_gemma":0.0008841605,"threshold_uncertainty_score":0.12639505},"labels":[],"label_agreement":null},{"id":"W4385654206","doi":"10.1007/978-3-031-38557-5_23","title":"Snowblind: A Threshold Blind Signature in Pairing-Free Groups","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pairing; Random oracle; Blind signature; Schnorr signature; Discrete logarithm; Ring signature; Signature (topology); Theoretical computer science; Mathematical proof; Algorithm; Public-key cryptography; Computer security; Mathematics; Encryption","score_opus":0.024402712206333707,"score_gpt":0.24855270673121407,"score_spread":0.22414999452488038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017800039,0.0005661788,0.95308995,0.00053715776,0.000782637,0.00023813624,0.00039431604,0.006041055,0.02055052],"genre_scores_gemma":[0.41869476,0.0011777631,0.50039357,0.00087913463,0.0006897088,0.0004918556,0.001285487,0.0020725331,0.074315205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981901,0.00033960067,0.000111413494,0.00027143216,0.0008361768,0.0002513257],"domain_scores_gemma":[0.998946,0.00028865784,0.00006373188,0.0004186291,0.00014941762,0.00013355559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012640421,0.0008615079,0.0011827743,0.0012163103,0.0011689088,0.0028375997,0.001385383,0.0012807784,0.011910335],"category_scores_gemma":[0.0026727456,0.0005856507,0.0009536221,0.001819148,0.0022086545,0.0052560233,0.0049982136,0.002795287,0.0060088877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016997644,0.0002879476,0.0004399363,0.0004391426,0.000083851606,0.00030208396,0.00078235514,0.016120365,0.044297673,0.513957,0.037973013,0.38361678],"study_design_scores_gemma":[0.0003310697,0.00063140737,0.00034660948,0.000118093034,0.00006803019,0.00062587886,0.0001570897,0.09961095,0.051031146,0.73324394,0.11370745,0.00012828466],"about_ca_topic_score_codex":0.00029118426,"about_ca_topic_score_gemma":0.00027238278,"teacher_disagreement_score":0.011910335,"about_ca_system_score_codex":0.0008268802,"about_ca_system_score_gemma":0.0014183263,"threshold_uncertainty_score":0.039844096},"labels":[],"label_agreement":null},{"id":"W4385654366","doi":"10.1007/978-3-031-38545-2_25","title":"Anamorphic Signatures: Secrecy from a Dictator Who Only Permits Authentication!","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Secrecy; Dictator; Computer science; Authentication (law); Computer security; Law; Political science","score_opus":0.01628950245837511,"score_gpt":0.24092188075640647,"score_spread":0.22463237829803137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654366","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011363449,0.004063565,0.31297114,0.021810777,0.005595841,0.000114877024,0.0006095298,0.0018958498,0.641575],"genre_scores_gemma":[0.29682812,0.0039632395,0.061568283,0.0033846532,0.002281447,0.00024635045,0.0005016063,0.0013657394,0.6298605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.00028064204,0.000042034422,0.00018784755,0.00033059766,0.00016823024],"domain_scores_gemma":[0.998872,0.00040459345,0.00005110527,0.00045679265,0.00015657478,0.000058950358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001159909,0.0010565012,0.00056773354,0.00048967905,0.0021544727,0.0037248465,0.0011323866,0.0026218938,0.018367544],"category_scores_gemma":[0.0030423023,0.0010034327,0.0006702144,0.0007837502,0.0050983015,0.013099555,0.0030718793,0.006390337,0.019321091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056324938,0.000023268762,0.00003368368,0.000055441706,0.0000045872775,0.000052180207,0.00028386436,0.00042036574,0.0009640492,0.9324058,0.0401823,0.025518203],"study_design_scores_gemma":[0.000014722296,0.000023585739,0.000039664843,0.000052752494,0.00000572852,0.00021196256,0.00008556216,0.0022402327,0.002382409,0.87025535,0.12466473,0.000023328168],"about_ca_topic_score_codex":0.00043684503,"about_ca_topic_score_gemma":0.00036089338,"teacher_disagreement_score":0.018367544,"about_ca_system_score_codex":0.0011812403,"about_ca_system_score_gemma":0.0013667452,"threshold_uncertainty_score":0.061445594},"labels":[],"label_agreement":null},{"id":"W4385654399","doi":"10.1007/978-3-031-38554-4_23","title":"$$ \\textsf{DualMS}$$: Efficient Lattice-Based Two-Round Multi-signature with Trapdoor-Free Simulation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Lattice (music); Signature (topology); Theoretical computer science; Algorithm; Physics; Mathematics; Geometry","score_opus":0.025721801543019982,"score_gpt":0.2691981119559343,"score_spread":0.24347631041291432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017148454,0.00031713466,0.9384091,0.00072665676,0.00029027625,0.00021292752,0.00055023504,0.011801644,0.03054349],"genre_scores_gemma":[0.5103838,0.00031094972,0.45087442,0.00044620867,0.00012434981,0.0005431993,0.0012294723,0.002367392,0.03372017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794453,0.00048616886,0.00008895883,0.00027331407,0.00083686406,0.00037008323],"domain_scores_gemma":[0.998439,0.0005017931,0.000069217305,0.00066969806,0.00019782441,0.0001224187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578628,0.0009245384,0.0014927385,0.0008172939,0.0013842402,0.0028355871,0.0023620191,0.0012068058,0.020239674],"category_scores_gemma":[0.0026344114,0.00069717015,0.0010167733,0.0011057836,0.0015794984,0.0036427819,0.0048606014,0.0029847568,0.0111831445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012673006,0.00046828703,0.00033375603,0.00033213175,0.000078045385,0.00015451587,0.00022366081,0.07030228,0.025788903,0.58920974,0.034041166,0.2778002],"study_design_scores_gemma":[0.00019197437,0.00015564033,0.000109809924,0.000053883872,0.000024279467,0.00019895029,0.000048349906,0.5947572,0.024251895,0.35634556,0.023762027,0.000100468824],"about_ca_topic_score_codex":0.0010507565,"about_ca_topic_score_gemma":0.001285617,"teacher_disagreement_score":0.020239674,"about_ca_system_score_codex":0.0015856299,"about_ca_system_score_gemma":0.0028149423,"threshold_uncertainty_score":0.06770849},"labels":[],"label_agreement":null},{"id":"W4385654497","doi":"10.1007/978-3-031-38557-5_22","title":"Fully Adaptive Schnorr Threshold Signatures","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random oracle; Discrete logarithm; Computer science; Schnorr signature; Signature (topology); Logarithm; Theoretical computer science; Simple (philosophy); Concrete security; Adversary; Scheme (mathematics); Discrete mathematics; Algorithm; Mathematics; Cryptography; Digital signature; Public-key cryptography; Computer security; Hash function","score_opus":0.021734287114679614,"score_gpt":0.2415970008238664,"score_spread":0.21986271370918678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385654497","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03333488,0.0016370544,0.8264542,0.001217156,0.0005753955,0.00011477833,0.0005871287,0.00423161,0.13184778],"genre_scores_gemma":[0.6049845,0.0019175934,0.21019742,0.000831115,0.00047675922,0.00015227201,0.00089959794,0.0009466256,0.17959408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990189,0.00010121453,0.000042382722,0.00016541997,0.00053951767,0.00013260354],"domain_scores_gemma":[0.99881697,0.00024619926,0.000070695125,0.00059798267,0.00021798382,0.000050128336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198702,0.00056615594,0.00045076865,0.0006092765,0.00046108582,0.0014204951,0.00093051814,0.00067612116,0.012867842],"category_scores_gemma":[0.0016031609,0.00041216286,0.0003395257,0.0010678642,0.0008745956,0.0032593883,0.002065415,0.0018108815,0.0060745934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003621214,0.00007180991,0.00026688853,0.00023632568,0.0000345985,0.00006833166,0.00016386538,0.011900542,0.062475216,0.5930167,0.018646868,0.31275663],"study_design_scores_gemma":[0.000049107864,0.00018982441,0.0006046745,0.00008045417,0.000046344587,0.00072883605,0.00007694003,0.09358608,0.101670854,0.66189027,0.14098367,0.000092942275],"about_ca_topic_score_codex":0.00016791752,"about_ca_topic_score_gemma":0.00023118794,"teacher_disagreement_score":0.012867842,"about_ca_system_score_codex":0.0007365349,"about_ca_system_score_gemma":0.0005630756,"threshold_uncertainty_score":0.04304719},"labels":[],"label_agreement":null},{"id":"W4385711891","doi":"10.1007/978-3-031-40003-2_20","title":"Post-Quantum Signatures in DNSSEC via Request-Based Fragmentation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Network packet; Digital signature; Computer network; Public-key cryptography; Byte; Computer security; Hash function; Encryption; Computer hardware","score_opus":0.0138422749043201,"score_gpt":0.2523390335573309,"score_spread":0.2384967586530108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385711891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13579196,0.0010107594,0.8157532,0.0016094442,0.00056582375,0.00050813414,0.0003372012,0.005164736,0.03925866],"genre_scores_gemma":[0.9066749,0.00022848559,0.07989052,0.00028992072,0.00014715912,0.00014395818,0.00025625975,0.0002532136,0.012115421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498653,0.0013161661,0.00032909116,0.0004664895,0.0019060881,0.000995637],"domain_scores_gemma":[0.989837,0.0027240666,0.00045767758,0.0058754184,0.000860678,0.00024516386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041283634,0.00052427745,0.0016656456,0.0011064311,0.002130199,0.003722743,0.0016891074,0.0021110384,0.009089361],"category_scores_gemma":[0.008481252,0.0006640545,0.00068300136,0.0018289448,0.0033462371,0.008058826,0.006503197,0.0027539912,0.0036463768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018893051,0.00052336854,0.0021236762,0.00030128538,0.0000826139,0.0005547252,0.00083216286,0.038637344,0.022595305,0.6496777,0.012582764,0.2701996],"study_design_scores_gemma":[0.00016827401,0.00037858874,0.00075784745,0.00011043723,0.00007099808,0.0009868861,0.00046075057,0.32591704,0.050654598,0.60373276,0.016630536,0.00013134771],"about_ca_topic_score_codex":0.0005954459,"about_ca_topic_score_gemma":0.00070941815,"teacher_disagreement_score":0.009089361,"about_ca_system_score_codex":0.0018400326,"about_ca_system_score_gemma":0.0025960119,"threshold_uncertainty_score":0.030406892},"labels":[],"label_agreement":null},{"id":"W4385737670","doi":"10.1016/j.ins.2023.119480","title":"Efficient and privacy-preserving tree-based inference via additive homomorphic encryption","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Shanxi Provincial Key Research and Development Project; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Inference; Ciphertext; Encryption; Data mining; Theoretical computer science; Interpretability; Scheme (mathematics); Artificial intelligence; Machine learning; Computer security","score_opus":0.025700730386582514,"score_gpt":0.27346101720839755,"score_spread":0.24776028682181503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385737670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020485265,0.0002778266,0.97437084,0.0005665274,0.00007771235,0.00008768829,0.00048044845,0.0011422132,0.002511458],"genre_scores_gemma":[0.7388282,0.00049490324,0.25293243,0.00062026427,0.0002316839,0.00019934739,0.0011245061,0.00022602487,0.0053426847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916501,0.0021518192,0.0005427596,0.0013791448,0.0031310383,0.0011452057],"domain_scores_gemma":[0.9822275,0.0089601,0.00083682785,0.0063250717,0.0012824729,0.00036799943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003662252,0.00076287525,0.0026430138,0.0012543054,0.0014390176,0.003529652,0.0036436094,0.0021237482,0.0034115906],"category_scores_gemma":[0.014099927,0.0010392928,0.0021663206,0.0021372216,0.002014571,0.008689863,0.0065049906,0.004311375,0.0015085118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015431495,0.00060944335,0.0031121382,0.00049045094,0.0004550138,0.000675271,0.00081420067,0.17021121,0.020679576,0.52898234,0.013907393,0.25851992],"study_design_scores_gemma":[0.00010539107,0.000142605,0.0004833618,0.00003875058,0.0001196814,0.0004905065,0.00009240274,0.57689005,0.011642548,0.40738678,0.002545206,0.00006285415],"about_ca_topic_score_codex":0.001209039,"about_ca_topic_score_gemma":0.0017717016,"teacher_disagreement_score":0.003662252,"about_ca_system_score_codex":0.0014881139,"about_ca_system_score_gemma":0.004120787,"threshold_uncertainty_score":0.019368112},"labels":[],"label_agreement":null},{"id":"W4386206332","doi":"10.2139/ssrn.4549523","title":"Group Encryption: Full Dynamicity, Message Filtering and Code-Based Instantiation","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Encryption; Computer science; Code (set theory); Group (periodic table); Programming language; Theoretical computer science; Computer security; Chemistry","score_opus":0.01695076090410354,"score_gpt":0.24886701333877118,"score_spread":0.23191625243466762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386206332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04032766,0.00048730292,0.94518334,0.0009561573,0.00013608068,0.0001841642,0.0002162275,0.0028018209,0.009707294],"genre_scores_gemma":[0.7415967,0.0005202743,0.2431,0.00048253086,0.00026347078,0.00024363994,0.00051669014,0.0008546961,0.012422125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950152,0.0011581028,0.0003675911,0.0008871589,0.0015566137,0.0010153993],"domain_scores_gemma":[0.98930526,0.0018161882,0.000491932,0.0072883368,0.0007776661,0.00032062654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030202817,0.0008366725,0.0016619033,0.0013913269,0.0014540462,0.0042923065,0.0020506089,0.002130348,0.0032402296],"category_scores_gemma":[0.009795099,0.00081005646,0.001328796,0.0018683589,0.0027930336,0.008807654,0.005797948,0.002968679,0.0020025393],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009368725,0.0002728301,0.001397164,0.00018515832,0.00006852401,0.00027731722,0.00050479744,0.03129502,0.017533205,0.7713516,0.008536466,0.1676411],"study_design_scores_gemma":[0.00013180471,0.00018255418,0.0004984001,0.00007539385,0.00010561214,0.0007774465,0.000090851325,0.2689534,0.028364196,0.68428326,0.016454427,0.00008264924],"about_ca_topic_score_codex":0.00075008016,"about_ca_topic_score_gemma":0.0006343818,"teacher_disagreement_score":0.0042923065,"about_ca_system_score_codex":0.0016589012,"about_ca_system_score_gemma":0.0022888223,"threshold_uncertainty_score":0.015972972},"labels":[],"label_agreement":null},{"id":"W4386212571","doi":"10.1109/siu59756.2023.10223951","title":"Finding Islands on Encrypted Graphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Homomorphic encryption; Cloud computing; Encryption; Computation; Overhead (engineering); Graph; Computer security; Distributed computing; Information privacy; Theoretical computer science; Computer network; Algorithm; Operating system","score_opus":0.02691616466073273,"score_gpt":0.26716502657259017,"score_spread":0.24024886191185743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386212571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4508655,0.00072655093,0.5365921,0.0010068459,0.00004306686,0.00027027214,0.0012457822,0.0012102873,0.008039652],"genre_scores_gemma":[0.8291357,0.0005324237,0.16401322,0.0001355629,0.000035444053,0.00007708195,0.0011493751,0.00016087458,0.0047602584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928075,0.00019675941,0.00004804226,0.00016484938,0.00020731795,0.00010232218],"domain_scores_gemma":[0.9953963,0.002377623,0.0004994526,0.0012071334,0.00037008856,0.00014932948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045966243,0.00045728587,0.0006036723,0.0014041127,0.00078324316,0.0012166423,0.00082592154,0.0006203664,0.0017381782],"category_scores_gemma":[0.0047935653,0.0003276171,0.0004990822,0.0012077752,0.0010901407,0.0035495565,0.0019308921,0.0008279194,0.00041100074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009902657,0.00022158529,0.013426775,0.0007290069,0.0002490303,0.0013102085,0.0022138054,0.42833802,0.03931244,0.2551163,0.009642682,0.24844983],"study_design_scores_gemma":[0.00004327188,0.00008791699,0.0018818851,0.00005236797,0.00007267169,0.0005823088,0.0005187491,0.6687327,0.020641584,0.30012953,0.007235718,0.000021185206],"about_ca_topic_score_codex":0.0030231546,"about_ca_topic_score_gemma":0.0033463007,"teacher_disagreement_score":0.0030231546,"about_ca_system_score_codex":0.0006924598,"about_ca_system_score_gemma":0.0006057904,"threshold_uncertainty_score":0.0060111284},"labels":[],"label_agreement":null},{"id":"W4386450022","doi":"10.1109/iccc57788.2023.10233605","title":"Two-Server Private Information Retrieval with High Throughput and Logarithmic Bandwidth","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Research and Development; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Bandwidth (computing); Logarithm; Computer network; Information retrieval; Operating system; Mathematics; Wireless","score_opus":0.008641755904155734,"score_gpt":0.21821615624300555,"score_spread":0.20957440033884983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386450022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03087963,0.00051270804,0.95964915,0.00043898678,0.000053043874,0.00039351906,0.00010072796,0.0031808193,0.0047914614],"genre_scores_gemma":[0.7921916,0.0003345358,0.19882387,0.0002556818,0.00010995941,0.00048511347,0.00033255096,0.0001648902,0.0073017976],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964886,0.00055875257,0.00021978145,0.00044436063,0.0017815206,0.0005070629],"domain_scores_gemma":[0.9970118,0.0006918784,0.000260752,0.0015157661,0.0003917385,0.00012801283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016169001,0.00076652097,0.0015875568,0.00094186986,0.0010196004,0.002214819,0.0028049762,0.0013634872,0.004861665],"category_scores_gemma":[0.004139724,0.0005410915,0.0007096163,0.0016717846,0.0014054539,0.006365066,0.0041348594,0.0019586605,0.0035847367],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039320877,0.0011045032,0.0028115718,0.0011070055,0.00019100288,0.0012448985,0.00093084347,0.13876642,0.21527225,0.22612876,0.014597003,0.3939137],"study_design_scores_gemma":[0.00033951568,0.0004657673,0.0004568426,0.00003225382,0.000059999107,0.0012772861,0.00015847101,0.84503055,0.092114195,0.04872362,0.011213827,0.0001276788],"about_ca_topic_score_codex":0.0005577254,"about_ca_topic_score_gemma":0.00034647272,"teacher_disagreement_score":0.004861665,"about_ca_system_score_codex":0.0014635664,"about_ca_system_score_gemma":0.0013074222,"threshold_uncertainty_score":0.016263843},"labels":[],"label_agreement":null},{"id":"W4386919909","doi":"10.1109/icaiss58487.2023.10250739","title":"An Enhanced Mechanism for Securing Patient Vital Health Information in Public Cloud","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Impact","funders":"","keywords":"Cloud computing; Computer science; Cloud computing security; Server; Computer security; Upload; Flexibility (engineering); Data sharing; Software deployment; Information privacy; Data security; Internet privacy; Cloud storage; World Wide Web; Encryption","score_opus":0.0180904180631255,"score_gpt":0.2631382213952598,"score_spread":0.24504780333213427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386919909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1524334,0.00313786,0.79943705,0.0066948454,0.0016637535,0.0027424828,0.001218916,0.009848108,0.02282357],"genre_scores_gemma":[0.9104092,0.0006486163,0.07503139,0.0009239362,0.0005182034,0.00040294073,0.00065930944,0.00008415411,0.011322252],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996682,0.0008585295,0.00037643802,0.00047761586,0.0010616216,0.00054383336],"domain_scores_gemma":[0.9932596,0.0010337277,0.00084645685,0.0027113059,0.0017278773,0.00042094226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034565988,0.00043328688,0.00074025476,0.0015447476,0.0013527032,0.0023799865,0.002352597,0.0017196031,0.004897642],"category_scores_gemma":[0.005695782,0.0003134383,0.00073138665,0.0011860355,0.000825724,0.0039346595,0.003199109,0.0013021984,0.0019850582],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057932306,0.0021317177,0.022197401,0.0015494532,0.0006573405,0.0051654945,0.0023435012,0.023593282,0.17098267,0.22110794,0.057231896,0.48724598],"study_design_scores_gemma":[0.0011710224,0.002854813,0.017004937,0.0004960445,0.000916129,0.011235406,0.0009145154,0.5156678,0.1821324,0.053751495,0.21314411,0.000711254],"about_ca_topic_score_codex":0.001063979,"about_ca_topic_score_gemma":0.0006654648,"teacher_disagreement_score":0.004897642,"about_ca_system_score_codex":0.0014255933,"about_ca_system_score_gemma":0.0021894616,"threshold_uncertainty_score":0.018280447},"labels":[],"label_agreement":null},{"id":"W4387135604","doi":"10.18280/ijsse.130408","title":"A Multi-Round Zero Knowledge Proof Algorithm for Secure IoT and Blockchain Environments","year":2023,"lang":"en","type":"article","venue":"International Journal of Safety and Security Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Gas meter prover; Computer science; Cryptography; Scalability; Algorithm; Mathematical proof; Robustness (evolution); Cryptographic primitive; Theoretical computer science; Zero-knowledge proof; Cryptographic protocol; Distributed computing; Mathematics; Database","score_opus":0.010828908778041418,"score_gpt":0.24694652150028823,"score_spread":0.23611761272224682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387135604","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003380725,0.00017413561,0.99234176,0.00023560706,0.0000837285,0.00018189017,0.000078478595,0.0005771014,0.0029466713],"genre_scores_gemma":[0.39037248,0.0005837152,0.5990598,0.00026960555,0.00011258311,0.00069311354,0.0003631861,0.00019883466,0.008346652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980531,0.00052813365,0.00014779328,0.0003731342,0.0006948179,0.00020307144],"domain_scores_gemma":[0.9978542,0.0010742192,0.00021926811,0.00044887012,0.0002882074,0.00011520794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019708225,0.0006817605,0.0008574471,0.0007049916,0.0012878242,0.0019273609,0.0020941612,0.0016781634,0.006991635],"category_scores_gemma":[0.0061674044,0.0004723573,0.0007934062,0.00080453383,0.0015104257,0.0032350759,0.0030996276,0.0022546623,0.0020009237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005286374,0.00015604815,0.00079545093,0.0006570333,0.00009662983,0.0007092749,0.0004954237,0.24948467,0.02144773,0.431942,0.009062724,0.2846243],"study_design_scores_gemma":[0.00015292542,0.0001985878,0.00013014344,0.00010277115,0.00003114685,0.0005505582,0.000056798446,0.8018855,0.011083016,0.16481295,0.020920241,0.00007543929],"about_ca_topic_score_codex":0.0010805195,"about_ca_topic_score_gemma":0.0013636844,"teacher_disagreement_score":0.006991635,"about_ca_system_score_codex":0.0010458296,"about_ca_system_score_gemma":0.0027049554,"threshold_uncertainty_score":0.02338934},"labels":[],"label_agreement":null},{"id":"W4387197046","doi":"10.1109/jiot.2023.3320666","title":"A Searchable Symmetric Encryption-Based Privacy Protection Scheme for Cloud-Assisted Mobile Crowdsourcing","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Crowdsourcing; Cloud computing; Big data; Outsourcing; Mobile device; Mobile cloud computing; Mobile computing; Data mining; Distributed computing; Computer network; World Wide Web","score_opus":0.03968041544219819,"score_gpt":0.2878748802859994,"score_spread":0.2481944648438012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387197046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06622853,0.0010543057,0.92236215,0.0012151642,0.00024104143,0.00039049285,0.0007662421,0.00084569614,0.0068963007],"genre_scores_gemma":[0.93882114,0.00044853592,0.055349384,0.00025124796,0.00007190464,0.00015810765,0.0003568831,0.000035005713,0.0045078667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978429,0.0004850117,0.00018420049,0.00028992625,0.00075387344,0.00044394456],"domain_scores_gemma":[0.99786323,0.0005553817,0.00026463656,0.0006900617,0.00048531653,0.000141365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012250283,0.00058890955,0.0011930373,0.00081966334,0.0014259232,0.0012215455,0.00173316,0.0009888532,0.0019502838],"category_scores_gemma":[0.0039665294,0.00025542764,0.0010104616,0.0017130295,0.0008627763,0.0037318678,0.002912897,0.0011291864,0.00060039846],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022497019,0.00053726626,0.0031815202,0.0006604836,0.0002557755,0.0016645297,0.001440432,0.3090472,0.056809496,0.29621524,0.027225278,0.30071312],"study_design_scores_gemma":[0.000117164505,0.00020176944,0.00047123185,0.000031842825,0.000052601332,0.0006424366,0.00019961453,0.93857026,0.01036507,0.041677076,0.007595907,0.00007502627],"about_ca_topic_score_codex":0.0035811872,"about_ca_topic_score_gemma":0.0023825841,"teacher_disagreement_score":0.0035811872,"about_ca_system_score_codex":0.0016584977,"about_ca_system_score_gemma":0.0030623407,"threshold_uncertainty_score":0.012033284},"labels":[],"label_agreement":null},{"id":"W4387319355","doi":"10.1109/jsen.2023.3320071","title":"Vehicular Edge-Based Approach for Optimizing Urban Data Privacy","year":2023,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Ciphertext; Vehicular ad hoc network; Overhead (engineering); Distributed computing; Enhanced Data Rates for GSM Evolution; Encryption; Broadcasting (networking); Computer network; Wireless ad hoc network; Artificial intelligence; Wireless; Telecommunications","score_opus":0.07317715219876275,"score_gpt":0.2938501206280292,"score_spread":0.22067296842926643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387319355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040488716,0.00023540617,0.9527358,0.00019228598,0.00003611396,0.000043936256,0.00006949534,0.00017393456,0.0060242773],"genre_scores_gemma":[0.901163,0.00021393604,0.093694314,0.000106352985,0.00002195128,0.000038060665,0.00016304417,0.000037598456,0.0045617325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952114,0.00012734008,0.000019258325,0.00008940494,0.00014249599,0.00010026897],"domain_scores_gemma":[0.9996935,0.00009971976,0.00003141726,0.000059369213,0.00009083718,0.000025138843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055102195,0.0004423285,0.0005138514,0.00042700287,0.0004532084,0.0009091274,0.0008813709,0.0005555183,0.0015645861],"category_scores_gemma":[0.0009608622,0.00018907398,0.00041552586,0.000537248,0.00044679895,0.0011253217,0.0011317068,0.000599423,0.00031144018],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022719355,0.00007698774,0.001287667,0.000050811344,0.000033131342,0.00016982759,0.00007399871,0.88142055,0.01523796,0.039771996,0.0016776815,0.059972234],"study_design_scores_gemma":[0.000005050321,0.000034274388,0.000099466066,0.0000024875376,0.000005553128,0.000045322384,0.000025153133,0.9907623,0.0032114547,0.0046170256,0.0011873196,0.0000046015407],"about_ca_topic_score_codex":0.0012198027,"about_ca_topic_score_gemma":0.0015409346,"teacher_disagreement_score":0.0015645861,"about_ca_system_score_codex":0.0006150274,"about_ca_system_score_gemma":0.0008135453,"threshold_uncertainty_score":0.0052340627},"labels":[],"label_agreement":null},{"id":"W4387323432","doi":"10.4230/lipics.fsttcs.2023.23","title":"Bounded Simultaneous Messages","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; Natural Sciences and Engineering Research Council of Canada; European Commission; Israel Science Foundation; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Bounded function; Computation; Computer science; Polynomial; Function (biology); Product (mathematics); Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Algorithm","score_opus":0.08730286493886212,"score_gpt":0.19727473526627082,"score_spread":0.1099718703274087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387323432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122255415,0.0006305498,0.8235808,0.009361013,0.0003418827,0.00040060235,0.00052536547,0.0011566951,0.04174769],"genre_scores_gemma":[0.89209014,0.0002900179,0.095067084,0.0012868049,0.00027386658,0.00055203756,0.00024385,0.00027866554,0.0099176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99023366,0.0037438262,0.00043526082,0.0021198662,0.0023562778,0.0011111484],"domain_scores_gemma":[0.9493218,0.033882987,0.0030433445,0.010033603,0.0024226594,0.0012955953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076383194,0.0010064025,0.0014246033,0.0007544355,0.0026601902,0.0040597348,0.0037909877,0.003018321,0.009926469],"category_scores_gemma":[0.036241718,0.00091540656,0.0015936428,0.0009994693,0.0064436044,0.020988468,0.0072883843,0.0062223477,0.0013952598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002075503,0.00004645746,0.0003131687,0.00011617473,0.000023834698,0.00013709161,0.0003710792,0.008829961,0.0021139786,0.9815725,0.0013415478,0.0049266876],"study_design_scores_gemma":[0.00005269771,0.00006510737,0.00007916108,0.000023860948,0.000021872098,0.00013829737,0.00012997289,0.055744726,0.0029806583,0.9360937,0.0046493486,0.000020681779],"about_ca_topic_score_codex":0.00083118875,"about_ca_topic_score_gemma":0.00060264126,"teacher_disagreement_score":0.009926469,"about_ca_system_score_codex":0.003126566,"about_ca_system_score_gemma":0.00248714,"threshold_uncertainty_score":0.040395796},"labels":[],"label_agreement":null},{"id":"W4387415142","doi":"10.1109/tsc.2023.3322432","title":"A Secure Satellite-Edge Computing Framework for Collaborative Line Outage Identification in Smart Grid","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China; Natural Science Foundation of Shenzhen City; Chinese University of Hong Kong, Shenzhen","keywords":"Computer science; Homomorphic encryption; Theoretical computer science; Encryption; Computer security","score_opus":0.025535924770675334,"score_gpt":0.296692298927999,"score_spread":0.27115637415732363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387415142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020053849,0.00024358455,0.97075224,0.00038938326,0.00005470864,0.00024493726,0.000103458886,0.002799963,0.005357823],"genre_scores_gemma":[0.6317156,0.00036801965,0.36120912,0.00020536991,0.00006359795,0.0003545173,0.0004180949,0.00016079564,0.005504773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992518,0.00017548335,0.000066781,0.00012195773,0.00026378292,0.00012022622],"domain_scores_gemma":[0.9995486,0.00008969024,0.00004293039,0.00017063906,0.00007409618,0.00007396874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011342976,0.00041133372,0.00050937664,0.0004257009,0.0009687412,0.0017353154,0.00160299,0.0008077249,0.0025545547],"category_scores_gemma":[0.0012359598,0.000248519,0.0006258463,0.00046718665,0.0008350294,0.002297433,0.0021947601,0.0010838205,0.00075817166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005947455,0.00029618165,0.0020304953,0.00024009848,0.00008640635,0.0011538914,0.0010245965,0.22335206,0.024173053,0.60964125,0.01740603,0.12000126],"study_design_scores_gemma":[0.00006189709,0.000070846494,0.00019818047,0.000022436292,0.000025963336,0.00016918182,0.00010172786,0.93315154,0.007249614,0.03540075,0.023518708,0.000029226378],"about_ca_topic_score_codex":0.004481708,"about_ca_topic_score_gemma":0.0053505925,"teacher_disagreement_score":0.004481708,"about_ca_system_score_codex":0.0009750206,"about_ca_system_score_gemma":0.0016623068,"threshold_uncertainty_score":0.008911252},"labels":[],"label_agreement":null},{"id":"W4387857486","doi":"10.56553/popets-2024-0030","title":"SoK: Metadata-Protecting Communication Systems","year":2023,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Royal Bank of Canada","keywords":"Metadata; Leverage (statistics); Computer science; Computer security; World Wide Web; Internet privacy; Data science","score_opus":0.02799871483513381,"score_gpt":0.2624466578205641,"score_spread":0.23444794298543029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387857486","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028149398,0.0036435798,0.88545644,0.003929136,0.00075513404,0.00057439297,0.001099721,0.017856251,0.058535922],"genre_scores_gemma":[0.7167061,0.006633493,0.2374245,0.002620538,0.00097149,0.0006461997,0.0027468398,0.0018965127,0.030354254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934378,0.0017872918,0.00076244655,0.00085660466,0.00240056,0.0007552927],"domain_scores_gemma":[0.98387146,0.0028239547,0.0014847246,0.00978945,0.0015570854,0.00047330558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005405062,0.00082109205,0.0009352647,0.0024229195,0.0028626064,0.0063666045,0.0024250261,0.0022703046,0.007039152],"category_scores_gemma":[0.01347552,0.00077519333,0.0010379021,0.0028799647,0.004896306,0.017843608,0.009680785,0.0031897451,0.004869265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054650486,0.00008783862,0.002530604,0.0010106225,0.00008754224,0.00030881414,0.0014236976,0.009411179,0.010308501,0.7839817,0.022369174,0.16793385],"study_design_scores_gemma":[0.00015600814,0.00028436686,0.0013698225,0.0004898924,0.00017195841,0.0014092542,0.0007922993,0.066601604,0.041653704,0.5139327,0.37294883,0.00018956255],"about_ca_topic_score_codex":0.0010854676,"about_ca_topic_score_gemma":0.0006645562,"teacher_disagreement_score":0.007039152,"about_ca_system_score_codex":0.002037243,"about_ca_system_score_gemma":0.0031437026,"threshold_uncertainty_score":0.028585076},"labels":[],"label_agreement":null},{"id":"W4387870310","doi":"10.1109/iccworkshops57953.2023.10283585","title":"Post-Quantum Based Oblivious Transfer for Authentication in Heterogeneous Internet of Everything","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Oblivious transfer; Authentication (law); Encryption; Protocol (science); Computer security; Computer network; Resilience (materials science); Quantum computer; The Internet; Quantum; Authentication protocol; Distributed computing; Cryptography; Operating system","score_opus":0.02002460383265886,"score_gpt":0.2562308634278776,"score_spread":0.23620625959521874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.269109,0.00032594203,0.71989775,0.0005136201,0.00007834734,0.0002541678,0.00008515536,0.0009398579,0.008796207],"genre_scores_gemma":[0.9705916,0.00007189781,0.02756695,0.0000505028,0.000009109565,0.000058887705,0.00003733654,0.00002526895,0.0015884025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999278,0.000260928,0.000042809865,0.00008151373,0.00022456622,0.00011219411],"domain_scores_gemma":[0.9990075,0.0003043691,0.000104206774,0.0004625475,0.00008429254,0.000037031015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009785957,0.00020094974,0.00036057612,0.00024128915,0.0005820112,0.0006032107,0.000690028,0.0004211152,0.001796298],"category_scores_gemma":[0.0017456083,0.00012517782,0.00029341705,0.00026548785,0.0009939909,0.0022880374,0.0018438295,0.00075495365,0.00029149593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014918527,0.00038841495,0.0033551005,0.0006712121,0.00015073473,0.0011131488,0.0009245817,0.11502966,0.24171318,0.49929017,0.004151844,0.13172008],"study_design_scores_gemma":[0.00010702548,0.0008424583,0.00116944,0.000051792904,0.00006535396,0.0006408553,0.00021268366,0.6388262,0.22609179,0.12437495,0.0075387633,0.00007868913],"about_ca_topic_score_codex":0.0001634432,"about_ca_topic_score_gemma":0.00022606291,"teacher_disagreement_score":0.001796298,"about_ca_system_score_codex":0.0003882234,"about_ca_system_score_gemma":0.0006681634,"threshold_uncertainty_score":0.006009221},"labels":[],"label_agreement":null},{"id":"W4387870721","doi":"10.1109/icc45041.2023.10279780","title":"An Efficient Post-Quantum Multi-Signature Scheme for the Internet of Vehicles","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Digital signature; ElGamal signature scheme; Computer science; Merkle signature scheme; Schnorr signature; Public-key cryptography; Signature (topology); Blind signature; Hash function; Cryptography; Post-quantum cryptography; Algorithm; Theoretical computer science; Computer network; Computer security; Mathematics; Encryption","score_opus":0.02517896709289361,"score_gpt":0.28622518472524106,"score_spread":0.2610462176323474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09692233,0.00089329144,0.890053,0.00092158245,0.00022966249,0.00039320925,0.0002206455,0.00091644004,0.009449847],"genre_scores_gemma":[0.869382,0.00023794307,0.124824554,0.00017931651,0.00005882229,0.00014882004,0.00023057722,0.000024461684,0.0049133664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829906,0.00043152037,0.00008981327,0.00019355888,0.0007943364,0.00019165537],"domain_scores_gemma":[0.9988318,0.00016487969,0.00019500562,0.0004066678,0.00029645275,0.00010510519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091837556,0.00034674234,0.0006462208,0.000514401,0.0010559144,0.00093498884,0.0013286833,0.00095921534,0.0021568227],"category_scores_gemma":[0.001732002,0.00015309513,0.0004331694,0.0008294098,0.00079036364,0.0026980808,0.0017375778,0.0013363067,0.0006130017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016079615,0.00040388058,0.0021513775,0.0006276564,0.00010842908,0.0003989745,0.00040949712,0.08473348,0.18191512,0.3620722,0.008941741,0.35662964],"study_design_scores_gemma":[0.00027714678,0.0010941346,0.0008556051,0.000045622568,0.00005455455,0.00094591454,0.0001443409,0.7942655,0.10527313,0.06057113,0.036272846,0.0002000408],"about_ca_topic_score_codex":0.0005642185,"about_ca_topic_score_gemma":0.00057875057,"teacher_disagreement_score":0.0021568227,"about_ca_system_score_codex":0.0011108123,"about_ca_system_score_gemma":0.0016166229,"threshold_uncertainty_score":0.008059502},"labels":[],"label_agreement":null},{"id":"W4387929276","doi":"10.48550/arxiv.2310.14565","title":"PEPSI: Practically Efficient Private Set Intersection in the Unbalanced Setting","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Royal Bank of Canada","keywords":"Cardinality (data modeling); Intersection (aeronautics); Computer science; Set (abstract data type); Protocol (science); Function (biology); Process (computing); Proof-of-work system; Encryption; Theoretical computer science; Work (physics); Computer network; Distributed computing; Data mining; Computer security; Operating system; Engineering","score_opus":0.08822039702408106,"score_gpt":0.2201779984123946,"score_spread":0.13195760138831353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387929276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055041123,0.00023874424,0.92483544,0.0010454168,0.000078178826,0.00032305147,0.0006165821,0.0030437787,0.014777656],"genre_scores_gemma":[0.7904643,0.0002744772,0.19807172,0.00034335413,0.00007959568,0.00065958634,0.0014430769,0.0004973051,0.008166489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99336666,0.0019726884,0.00032608962,0.0008626013,0.0023979638,0.0010739965],"domain_scores_gemma":[0.9901428,0.0037055428,0.00062891364,0.0045513688,0.00062796916,0.00034347278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00373196,0.00076702517,0.0011261302,0.0008968133,0.0021201395,0.0030613656,0.0029671253,0.0016738701,0.008734779],"category_scores_gemma":[0.0112916455,0.00073771254,0.0007516436,0.0017393485,0.0028764096,0.011771612,0.010502403,0.004031982,0.002409785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025817475,0.00036121384,0.0024602972,0.00039541893,0.000114440576,0.00047349688,0.0009832933,0.07877731,0.03917897,0.72755635,0.018531712,0.12858582],"study_design_scores_gemma":[0.00026189687,0.000299116,0.00056387886,0.000056945293,0.000055185217,0.0005358852,0.00035034746,0.43785822,0.05325388,0.47477734,0.031896446,0.00009086945],"about_ca_topic_score_codex":0.00070509,"about_ca_topic_score_gemma":0.00069472246,"teacher_disagreement_score":0.008734779,"about_ca_system_score_codex":0.002162717,"about_ca_system_score_gemma":0.0024617305,"threshold_uncertainty_score":0.02922082},"labels":[],"label_agreement":null},{"id":"W4388017378","doi":"10.1109/jiot.2023.3328382","title":"Flexible and Fine-Grained Access Control for EHR in Blockchain-Assisted E-Healthcare Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Access control; Security token; Ciphertext; Data access; Encryption; Permission; Computer network; Computer security; Database","score_opus":0.039795426738658206,"score_gpt":0.3141759498446544,"score_spread":0.2743805231059962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388017378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16715336,0.00048996793,0.82505196,0.00076901965,0.00009239789,0.0004369273,0.00021472503,0.00080502307,0.004986561],"genre_scores_gemma":[0.978675,0.0001282974,0.018989855,0.000066390414,0.00002270918,0.000088938454,0.00008845318,0.000012220288,0.0019280883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963121,0.0012200067,0.00032308654,0.00056186365,0.0009740369,0.0006089545],"domain_scores_gemma":[0.995758,0.0013141177,0.0005697289,0.0014808468,0.0005472674,0.00033005534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026792078,0.00032415264,0.0006521443,0.00055095047,0.0011358876,0.0013030965,0.0012055534,0.0010299408,0.002250183],"category_scores_gemma":[0.004162813,0.00022997438,0.0003324423,0.0009068106,0.0013178387,0.003658638,0.0031377191,0.0009349817,0.0005336165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029467384,0.0006941694,0.008039487,0.0005121355,0.0001618272,0.002239188,0.0021151477,0.31270713,0.11414111,0.25405982,0.0061433655,0.2962399],"study_design_scores_gemma":[0.00016079146,0.0003721503,0.0008318007,0.00003924104,0.000033634817,0.0005491791,0.00019948704,0.89613515,0.027325818,0.06632517,0.007960067,0.00006754531],"about_ca_topic_score_codex":0.00120708,"about_ca_topic_score_gemma":0.0009931556,"teacher_disagreement_score":0.0026792078,"about_ca_system_score_codex":0.0008761808,"about_ca_system_score_gemma":0.0017531494,"threshold_uncertainty_score":0.014169216},"labels":[],"label_agreement":null},{"id":"W4388019285","doi":"10.1007/978-981-99-7563-1_3","title":"Traceable Policy-Based Signatures with Delegation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Public-key cryptography; Digital signature; Merkle signature scheme; Scheme (mathematics); Computer security; Delegation; Ring signature; Signature (topology); Blind signature; Traceability; Theoretical computer science; Key (lock); Hash function; Encryption; Mathematics; Law; Political science","score_opus":0.013656848037047335,"score_gpt":0.23817411134878097,"score_spread":0.22451726331173363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388019285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038733727,0.00015510386,0.98147625,0.00025428628,0.0002127766,0.00013527084,0.00012742153,0.0049174274,0.008848036],"genre_scores_gemma":[0.40838555,0.0005340038,0.5468786,0.00050218287,0.0002993318,0.0005202914,0.0008769896,0.0018839583,0.040119134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99070615,0.0020430605,0.000854781,0.0014712097,0.0038867374,0.0010381019],"domain_scores_gemma":[0.9881272,0.0032565803,0.0004863933,0.0068720886,0.0009408478,0.00031693757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043181125,0.0012256784,0.0017750394,0.001242092,0.0014896876,0.0050454237,0.0035583375,0.0021391057,0.010228148],"category_scores_gemma":[0.011823685,0.001239273,0.0015764995,0.0020162016,0.0035730954,0.010244888,0.0077817696,0.0067224386,0.0056334264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000774349,0.00042378777,0.0003496161,0.00032254713,0.00009600443,0.00022102012,0.0004839252,0.038262337,0.010555569,0.64115006,0.012173083,0.29518765],"study_design_scores_gemma":[0.00013466137,0.00018219091,0.000100612975,0.00008504195,0.00007085302,0.00033418316,0.00007604798,0.18672828,0.035683773,0.7428465,0.033674456,0.000083445775],"about_ca_topic_score_codex":0.00080186623,"about_ca_topic_score_gemma":0.000618187,"teacher_disagreement_score":0.010228148,"about_ca_system_score_codex":0.0018832136,"about_ca_system_score_gemma":0.0032452785,"threshold_uncertainty_score":0.034216583},"labels":[],"label_agreement":null},{"id":"W4388093981","doi":"10.1007/978-981-99-7563-1_21","title":"Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Calgary","funders":"","keywords":"Cheating; Computer science; Secret sharing; Leakage (economics); Computer security; Information leakage; Theoretical computer science; Algorithm; Cryptography","score_opus":0.02254604923057493,"score_gpt":0.24370310518250954,"score_spread":0.2211570559519346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388093981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16492237,0.00719512,0.71279037,0.014864608,0.0012910257,0.0008738053,0.0034727992,0.0044488613,0.09014105],"genre_scores_gemma":[0.904552,0.003391741,0.07422748,0.0017704801,0.0015433525,0.00089108327,0.0012883528,0.0010940146,0.011241387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9881279,0.002583041,0.0004006775,0.0019688755,0.004238579,0.00268089],"domain_scores_gemma":[0.8560066,0.119738095,0.0043401276,0.013277245,0.004304866,0.0023331142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010255695,0.004532918,0.0050603054,0.0029693365,0.0025960342,0.007809006,0.007933411,0.005248333,0.016391173],"category_scores_gemma":[0.06219262,0.0021209356,0.0031780303,0.0040168446,0.006415865,0.016813127,0.009897993,0.009677617,0.0023355237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055454387,0.00085145805,0.0027243786,0.001929169,0.0005970417,0.00076420535,0.0009465821,0.3926944,0.03824236,0.4059828,0.027529914,0.12219228],"study_design_scores_gemma":[0.0002034677,0.00037573813,0.0008196309,0.0002449458,0.00025093014,0.0005002227,0.0001341509,0.59301895,0.009667274,0.39172184,0.0029560935,0.00010678829],"about_ca_topic_score_codex":0.0010767084,"about_ca_topic_score_gemma":0.0012704259,"teacher_disagreement_score":0.016391173,"about_ca_system_score_codex":0.0077570193,"about_ca_system_score_gemma":0.0050523677,"threshold_uncertainty_score":0.056281388},"labels":[],"label_agreement":null},{"id":"W4388733982","doi":"10.1007/s10623-023-01322-5","title":"Unconditionally secure non-malleable secret sharing and circular external difference families","year":2023,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Secret sharing; Construct (python library); Theoretical computer science; Relation (database); Computer science; Code (set theory); Scheme (mathematics); Secure multi-party computation; Algebraic number; Computer security; Type (biology); Mathematics; Cryptography; Computer network; Programming language; Data mining","score_opus":0.020179994465163435,"score_gpt":0.23656166278674562,"score_spread":0.21638166832158218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388733982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24704498,0.0005720802,0.7140029,0.0014203873,0.00016503161,0.000100051875,0.00026387247,0.00051882304,0.03591192],"genre_scores_gemma":[0.95809114,0.00027433631,0.02929644,0.00030754463,0.00010146437,0.00008799687,0.00015165888,0.00009917787,0.011590326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977323,0.0005501402,0.00013902747,0.00040740884,0.0006918467,0.0004791944],"domain_scores_gemma":[0.9952734,0.0020887263,0.00051622814,0.0012899934,0.00057733845,0.00025429396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020212096,0.00053988805,0.0007162173,0.0009533228,0.0014057022,0.0020776836,0.0011080639,0.0012894499,0.0037997894],"category_scores_gemma":[0.0067794444,0.0003847655,0.000801791,0.0010272039,0.0034141303,0.0051162504,0.0036901645,0.0026648245,0.00087976555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023987867,0.000025349253,0.00016143596,0.000031837684,0.000009224738,0.000062846535,0.00015263169,0.0052653067,0.0025714447,0.98281026,0.0005154878,0.008154366],"study_design_scores_gemma":[0.000041821448,0.000063185966,0.00010348232,0.000023949822,0.000015044654,0.00018944214,0.00004644158,0.043976646,0.0065999813,0.94607484,0.0028284115,0.00003672893],"about_ca_topic_score_codex":0.0004496132,"about_ca_topic_score_gemma":0.00027421612,"teacher_disagreement_score":0.0037997894,"about_ca_system_score_codex":0.0016815052,"about_ca_system_score_gemma":0.0015003113,"threshold_uncertainty_score":0.012711585},"labels":[],"label_agreement":null},{"id":"W4388818935","doi":"10.1016/j.future.2023.11.016","title":"Blockchain-assisted verifiable certificate-based searchable encryption against untrusted cloud server for Industrial Internet of Things","year":2023,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Yibin Science and Technology Planning Program; Fundamental Research Funds for the Central Universities; Shanxi Provincial Key Research and Development Project; National Natural Science Foundation of China","keywords":"Computer science; Verifiable secret sharing; Encryption; Computer security; Correctness; Cloud computing; Ciphertext; Cryptographic primitive; Security analysis; Cryptography; Outsourcing; The Internet; Symmetric-key algorithm; Public-key cryptography; Computer network; Cryptographic protocol; World Wide Web; Operating system; Algorithm","score_opus":0.09749307487727549,"score_gpt":0.2612194594676245,"score_spread":0.163726384590349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388818935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22146343,0.0012428731,0.745804,0.0015939848,0.0006392258,0.0005449358,0.0006923871,0.0033594703,0.024659622],"genre_scores_gemma":[0.9893985,0.00009641112,0.0077287275,0.000051344876,0.00001814575,0.000031745927,0.00011198571,0.000018558996,0.002544722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981591,0.0003714555,0.00009041717,0.00022319234,0.00067962595,0.00047615683],"domain_scores_gemma":[0.9975095,0.0006870743,0.00019079831,0.0008260089,0.00063640845,0.00015009101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011945029,0.000330774,0.0008914588,0.0004996139,0.0010468484,0.001095163,0.0012942392,0.0010228329,0.0056669917],"category_scores_gemma":[0.0030325253,0.00023220699,0.00034402945,0.0006760738,0.0008057899,0.0024417334,0.002353197,0.001092879,0.0008895603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003908405,0.00065440335,0.0044771708,0.0007441811,0.00021193882,0.0017564668,0.0007102025,0.39547637,0.07883113,0.22846258,0.024549717,0.26021755],"study_design_scores_gemma":[0.00015984947,0.0003221996,0.00039311548,0.000033465203,0.000039332077,0.00027132404,0.00007998546,0.9416166,0.016762814,0.036032382,0.004249481,0.000039471786],"about_ca_topic_score_codex":0.002313073,"about_ca_topic_score_gemma":0.003656848,"teacher_disagreement_score":0.0056669917,"about_ca_system_score_codex":0.00086246966,"about_ca_system_score_gemma":0.0027767695,"threshold_uncertainty_score":0.018958032},"labels":[],"label_agreement":null},{"id":"W4388857541","doi":"10.1145/3576915.3623147","title":"Grotto: Screaming fast (2+1)-PC or ℤ2n via (2,2)-DPFs","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Cisco Systems","keywords":"Computer science; Piecewise; Theoretical computer science; Polynomial; Algorithm; Discrete mathematics; Mathematics","score_opus":0.022051933289042824,"score_gpt":0.26104319108766044,"score_spread":0.23899125779861763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388857541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016735192,0.00041142292,0.94101375,0.00036097152,0.00025306863,0.00020016305,0.00054345804,0.023547057,0.016934829],"genre_scores_gemma":[0.40838534,0.0004411596,0.5582237,0.00068173866,0.00020335864,0.0005033667,0.0014811095,0.005914342,0.024165927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982951,0.0002374504,0.000078696314,0.00032445163,0.0007014464,0.0003628488],"domain_scores_gemma":[0.99841523,0.00047786208,0.00009008426,0.0007029308,0.00020252632,0.00011123423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012788787,0.0011796352,0.0011580008,0.00081849337,0.0009028564,0.0027350595,0.0025271694,0.0013038936,0.03015766],"category_scores_gemma":[0.006122001,0.0005845588,0.0010384514,0.0012066914,0.0016456423,0.004779099,0.004368152,0.0025182972,0.0075632194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019428591,0.00019649316,0.0017780939,0.00048324288,0.00009365804,0.00040779455,0.00036471523,0.074768834,0.01866353,0.26003197,0.048047356,0.5932214],"study_design_scores_gemma":[0.00039728574,0.0004263884,0.0005203342,0.00013633222,0.000054378263,0.0004908049,0.00016720414,0.6116666,0.03938004,0.26862267,0.07800688,0.00013104567],"about_ca_topic_score_codex":0.0031273984,"about_ca_topic_score_gemma":0.0046606744,"teacher_disagreement_score":0.03015766,"about_ca_system_score_codex":0.0015278858,"about_ca_system_score_gemma":0.002285994,"threshold_uncertainty_score":0.10088742},"labels":[],"label_agreement":null},{"id":"W4388858952","doi":"10.1145/3576915.3623095","title":"Level Up: Private Non-Interactive Decision Tree Evaluation using Levelled Homomorphic Encryption","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homomorphic encryption; Computer science; Interpretability; Decision tree; Popularity; Private information retrieval; Context (archaeology); Service provider; Simplicity; Service (business); Encryption; Usability; Tree (set theory); Machine learning; Computer security; Artificial intelligence; Business; Human–computer interaction","score_opus":0.1128803222603234,"score_gpt":0.3446378706443711,"score_spread":0.23175754838404772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388858952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028250985,0.00038370016,0.9619325,0.0004905169,0.00009184706,0.00023712816,0.00036203236,0.0029770585,0.005274333],"genre_scores_gemma":[0.73664695,0.0002441938,0.2552565,0.0003574219,0.00007671765,0.00022084055,0.0007731136,0.0003831998,0.006041045],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99486816,0.0018317795,0.00037884634,0.00040952783,0.0019383886,0.0005733596],"domain_scores_gemma":[0.99437076,0.0026141547,0.00028886783,0.0017024545,0.0007355922,0.00028810932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042415326,0.0004902728,0.0011212309,0.0007503712,0.0006228161,0.0022238132,0.0017443597,0.0011636534,0.0084774885],"category_scores_gemma":[0.010833722,0.00035960943,0.00086312706,0.0007737115,0.0011161296,0.0044559757,0.0037847564,0.0019945113,0.0021944928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002342521,0.0006467368,0.0028064249,0.0004392384,0.00016843037,0.0007569857,0.0005094633,0.12905717,0.020413242,0.3041806,0.02318263,0.51549655],"study_design_scores_gemma":[0.00016790348,0.00030062313,0.00037163426,0.000047385874,0.000030173742,0.00035288572,0.000057771897,0.76392126,0.0137094725,0.21525314,0.005748647,0.0000390386],"about_ca_topic_score_codex":0.00083204336,"about_ca_topic_score_gemma":0.00092377275,"teacher_disagreement_score":0.0084774885,"about_ca_system_score_codex":0.0014807894,"about_ca_system_score_gemma":0.0017259783,"threshold_uncertainty_score":0.02836001},"labels":[],"label_agreement":null},{"id":"W4389010994","doi":"10.1007/978-3-031-48615-9_10","title":"Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Università Bocconi; Chinese University of Hong Kong; European Commission; National Science Foundation","keywords":"Computer science; Degree (music); Encryption; Pseudorandom number generator; Public-key cryptography; Theoretical computer science; Key (lock); Cryptography; Pseudorandom function family; Scheme (mathematics); Context (archaeology); Symmetric-key algorithm; Generator (circuit theory); Algorithm; Computer security; Mathematics","score_opus":0.03330693155059561,"score_gpt":0.253333217140938,"score_spread":0.22002628559034237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389010994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041543197,0.020648187,0.7026116,0.005481371,0.00078413787,0.00012120382,0.00024738646,0.0007424861,0.22782041],"genre_scores_gemma":[0.71288735,0.012359118,0.13680652,0.0010638164,0.0012975585,0.00022216082,0.0002866209,0.0002875153,0.1347894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993488,0.00021539579,0.00002384149,0.00010048687,0.00023591354,0.000075593794],"domain_scores_gemma":[0.9991874,0.00047753414,0.00004877872,0.00020107593,0.000059784204,0.000025388907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007582299,0.00058145315,0.000645024,0.00071234955,0.0006374573,0.0018264967,0.00071337476,0.0007833111,0.005480917],"category_scores_gemma":[0.0020057696,0.00027812322,0.00039398568,0.0010300325,0.0025618307,0.0036335483,0.0012029507,0.0027870475,0.0023694716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003917051,0.000018257475,0.000053379295,0.00007076,0.0000043215937,0.000028178987,0.000054136402,0.002238199,0.00092224823,0.9576842,0.00331079,0.035576247],"study_design_scores_gemma":[0.000023325985,0.00002701674,0.00008007048,0.000024568753,0.000005822366,0.00018407512,0.0000138808045,0.006516853,0.001451627,0.96562463,0.026035957,0.000012265185],"about_ca_topic_score_codex":0.00020572965,"about_ca_topic_score_gemma":0.00024520766,"teacher_disagreement_score":0.005480917,"about_ca_system_score_codex":0.0009939636,"about_ca_system_score_gemma":0.0004941923,"threshold_uncertainty_score":0.018335462},"labels":[],"label_agreement":null},{"id":"W4389027105","doi":"10.1007/978-3-031-48618-0_11","title":"Lower Bounds on Assumptions Behind Registration-Based Encryption","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Obfuscation; Black box; Theoretical computer science; Cryptography; Public-key cryptography; Key (lock); Computer security; Artificial intelligence","score_opus":0.02521222336775681,"score_gpt":0.26161020030616955,"score_spread":0.23639797693841275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389027105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03769048,0.009287303,0.7687883,0.020007066,0.0018982152,0.0005477526,0.0029783847,0.001871397,0.1569311],"genre_scores_gemma":[0.7738826,0.017063782,0.13382731,0.0062529542,0.006540924,0.0021007566,0.00533257,0.0029377637,0.052061353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97214985,0.008773256,0.0013188461,0.003341725,0.008795565,0.0056207823],"domain_scores_gemma":[0.7228554,0.2297818,0.00645527,0.026701916,0.010409295,0.0037964014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022114558,0.0072554275,0.0072503397,0.0062516215,0.0064652506,0.015413816,0.013292368,0.008208805,0.03280148],"category_scores_gemma":[0.12233285,0.004668332,0.0062943827,0.008956009,0.012308968,0.051212702,0.018176613,0.030684851,0.010436829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018939753,0.00040593266,0.0012790614,0.00092290505,0.0002305482,0.00041145508,0.0005751892,0.06418299,0.0031256184,0.85581213,0.027022706,0.044137493],"study_design_scores_gemma":[0.00008960651,0.00010093513,0.00027727758,0.00023149076,0.00016644914,0.0002491737,0.00013430727,0.11736276,0.002027928,0.87486655,0.0044203796,0.00007313296],"about_ca_topic_score_codex":0.0018991261,"about_ca_topic_score_gemma":0.0015419929,"teacher_disagreement_score":0.03280148,"about_ca_system_score_codex":0.012361556,"about_ca_system_score_gemma":0.0055098566,"threshold_uncertainty_score":0.116954386},"labels":[],"label_agreement":null},{"id":"W4389515554","doi":"10.1109/tsusc.2023.3277876","title":"Non-Interactive DSSE for Medical Data Sharing With Forward and Backward Privacy","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Timestamp; Encryption; Cloud computing; Theoretical computer science; Scheme (mathematics); Data mining; Computer security; Mathematics","score_opus":0.02632683891577764,"score_gpt":0.3035771797045984,"score_spread":0.27725034078882077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389515554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04170239,0.00086982216,0.9504743,0.00082853733,0.00008135156,0.00028782227,0.00039959708,0.0010256852,0.0043304367],"genre_scores_gemma":[0.8520282,0.00042651605,0.14117782,0.00036869882,0.00007300059,0.00021286274,0.00045289873,0.00006005386,0.005199911],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952815,0.0011351992,0.00048119665,0.00073542667,0.0017355274,0.0006309977],"domain_scores_gemma":[0.99414176,0.0016482746,0.00047046883,0.0028237987,0.00068679755,0.00022893916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023616494,0.00049827766,0.0012733454,0.0007021165,0.0011252182,0.0016754862,0.00229976,0.0011761928,0.0036917934],"category_scores_gemma":[0.007761814,0.00035683368,0.00089782133,0.0021729327,0.0011766314,0.0069223507,0.004762108,0.0014394274,0.0010330038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002650259,0.0005194159,0.0061707026,0.0006696768,0.00024635094,0.0015919314,0.0016272116,0.09782106,0.07522781,0.3493129,0.013238399,0.4509243],"study_design_scores_gemma":[0.00017620304,0.00045824007,0.0010457746,0.000044699467,0.00008022941,0.0028258895,0.00046653664,0.7725837,0.05771347,0.14302516,0.021448543,0.00013154805],"about_ca_topic_score_codex":0.0010022961,"about_ca_topic_score_gemma":0.000998059,"teacher_disagreement_score":0.0036917934,"about_ca_system_score_codex":0.0013737627,"about_ca_system_score_gemma":0.0020027908,"threshold_uncertainty_score":0.012489796},"labels":[],"label_agreement":null},{"id":"W4389539753","doi":"10.14778/3626292.3626293","title":"Cryptographically Secure Private Record Linkage using Locality-Sensitive Hashing","year":2023,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Locality-sensitive hashing; Locality; Plaintext; Cryptography; Theoretical computer science; Encryption; Differential privacy; Hash table; Computer security; Data mining","score_opus":0.02040080730661333,"score_gpt":0.24468185188577368,"score_spread":0.22428104457916034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389539753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026684362,0.00045532902,0.9643377,0.00081233983,0.00010315861,0.0003399684,0.00027684082,0.003071852,0.003918459],"genre_scores_gemma":[0.6854567,0.0005216208,0.304816,0.00075667,0.00016529785,0.000595152,0.00074343075,0.00035792604,0.0065872897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.986845,0.0028514252,0.0014269701,0.002015477,0.005568951,0.001292246],"domain_scores_gemma":[0.98166454,0.0028993103,0.0019013941,0.011585645,0.0015026885,0.00044639598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006301199,0.0007764983,0.0014847316,0.0012653321,0.0019149209,0.004179796,0.005790414,0.002645276,0.004114626],"category_scores_gemma":[0.013944587,0.0010008634,0.0019036952,0.0028007007,0.003448681,0.014553937,0.0110467365,0.0037251154,0.0033908996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019982425,0.000935132,0.004920434,0.0009175034,0.00038286057,0.0006990973,0.0018918149,0.07274734,0.050617345,0.6046746,0.0128906425,0.24732506],"study_design_scores_gemma":[0.00068439724,0.0011850154,0.0010957855,0.000160794,0.00029552245,0.0021902495,0.0005340605,0.40519163,0.1417673,0.38361746,0.06291392,0.00036381942],"about_ca_topic_score_codex":0.0005433534,"about_ca_topic_score_gemma":0.0003812325,"teacher_disagreement_score":0.006301199,"about_ca_system_score_codex":0.0021597985,"about_ca_system_score_gemma":0.003357368,"threshold_uncertainty_score":0.0333243},"labels":[],"label_agreement":null},{"id":"W4389543403","doi":"10.1109/csnet59123.2023.10339750","title":"Privacy-Preserving Attribute-Based Access Control with Non-Monotonic Access Structure","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Access control; Collusion; Computer science; Computer security; Identity (music); Context (archaeology); Encryption; Set (abstract data type); Cloud computing; Monotonic function; Attribute-based encryption; Information privacy; Public-key cryptography; Business","score_opus":0.022152252771503313,"score_gpt":0.28951101830170684,"score_spread":0.26735876553020355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389543403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027098292,0.00041233652,0.9684913,0.000373359,0.000052893403,0.00016577156,0.00012219792,0.0004718714,0.0028119967],"genre_scores_gemma":[0.7873182,0.00060708786,0.20796306,0.00020477251,0.00016047295,0.00025120834,0.0002356751,0.000053754367,0.0032057664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895754,0.002650488,0.0012357145,0.0014584172,0.0043380097,0.00074203167],"domain_scores_gemma":[0.98909724,0.0026408907,0.0014689914,0.0049026795,0.0015021204,0.00038794428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00515395,0.0005826115,0.0012992481,0.0009457691,0.0013194839,0.0041258275,0.0021600309,0.0010691676,0.0012618882],"category_scores_gemma":[0.008072477,0.0005091706,0.001216414,0.0016895762,0.0024409925,0.0077370135,0.0031691,0.0028554273,0.000634085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006793678,0.00046964886,0.0018912423,0.00038386736,0.00021939809,0.00073369796,0.00091292337,0.06382071,0.047439605,0.7560924,0.0023932292,0.12496392],"study_design_scores_gemma":[0.00018748766,0.0004357934,0.0006844404,0.000073487696,0.00012376493,0.0014056468,0.00021606746,0.59199476,0.05038423,0.33602494,0.018338703,0.00013068032],"about_ca_topic_score_codex":0.0008927559,"about_ca_topic_score_gemma":0.00067776494,"teacher_disagreement_score":0.00515395,"about_ca_system_score_codex":0.0012320317,"about_ca_system_score_gemma":0.002629002,"threshold_uncertainty_score":0.027257025},"labels":[],"label_agreement":null},{"id":"W4389609606","doi":"10.1145/3626760","title":"Waffle: An Online Oblivious Datastore for Protecting Data Access Patterns","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universitas Brawijaya","keywords":"Computer science; Overhead (engineering); Benchmark (surveying); Adversary; Flexibility (engineering); Data access; Bandwidth (computing); Database; Distributed computing; Computer network; Operating system; Computer security","score_opus":0.3094247226058124,"score_gpt":0.395503019242454,"score_spread":0.08607829663664163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389609606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1352917,0.0028376295,0.79538685,0.0017719049,0.00041278303,0.0008176987,0.0018435159,0.043655075,0.0179828],"genre_scores_gemma":[0.8468665,0.00073872885,0.13333403,0.0007397102,0.00014001253,0.0005870848,0.0015239472,0.0018431343,0.014226918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972838,0.00046506638,0.00024885472,0.00045146505,0.0011151406,0.00043567785],"domain_scores_gemma":[0.98686326,0.001826457,0.0006704905,0.009627723,0.0007228612,0.00028926486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020993932,0.0010543258,0.00091313216,0.0012424546,0.0014133462,0.0021047867,0.0039399914,0.0013564102,0.0066295844],"category_scores_gemma":[0.008618623,0.0007704382,0.00082993833,0.0011220729,0.0030384012,0.009715975,0.007185211,0.002717954,0.002315535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032023743,0.0008259228,0.011315472,0.0014051773,0.0006476273,0.0012001165,0.0018628832,0.10181806,0.109029196,0.15012635,0.08296312,0.53560376],"study_design_scores_gemma":[0.00035780406,0.0008276007,0.0018822994,0.00021110832,0.00018006786,0.0014913429,0.00038270548,0.60420257,0.17013076,0.13624148,0.08384022,0.0002519934],"about_ca_topic_score_codex":0.0014460235,"about_ca_topic_score_gemma":0.0018561594,"teacher_disagreement_score":0.0066295844,"about_ca_system_score_codex":0.0013290744,"about_ca_system_score_gemma":0.0021212727,"threshold_uncertainty_score":0.022178173},"labels":[],"label_agreement":null},{"id":"W4389815252","doi":"10.1038/s41598-023-48475-w","title":"Oblivious network intrusion detection systems","year":2023,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Intrusion detection system; Data mining","score_opus":0.013033743112665554,"score_gpt":0.22713864229257785,"score_spread":0.2141048991799123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389815252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053042326,0.0006613597,0.92440313,0.00048131708,0.00014356784,0.0002631127,0.00022580233,0.0057454635,0.015033918],"genre_scores_gemma":[0.74888337,0.00055719056,0.2369577,0.0005578211,0.00008049414,0.00032337624,0.00043321293,0.00023545438,0.011971321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978389,0.00041175316,0.00020379254,0.00039788987,0.0008147071,0.00033299538],"domain_scores_gemma":[0.9976036,0.0005495169,0.00023860775,0.0012280454,0.00031552502,0.00006478467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228951,0.00046645972,0.00071668986,0.0006644207,0.0006321688,0.0019560067,0.0019168797,0.00073600793,0.0035179064],"category_scores_gemma":[0.0033468078,0.00034338265,0.0004530268,0.0005765186,0.0012626498,0.004123079,0.0027198093,0.0013899589,0.0012636484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009194708,0.00039522894,0.0026992555,0.00052969524,0.00021664207,0.0003661695,0.000432059,0.09874203,0.08718968,0.43631074,0.015462801,0.35673618],"study_design_scores_gemma":[0.00014701886,0.00033726307,0.0005819885,0.00006620222,0.00008491216,0.0005429299,0.00007498362,0.6672058,0.12780885,0.16697071,0.036114037,0.00006534839],"about_ca_topic_score_codex":0.0005026296,"about_ca_topic_score_gemma":0.00046401442,"teacher_disagreement_score":0.0035179064,"about_ca_system_score_codex":0.000923222,"about_ca_system_score_gemma":0.0010577565,"threshold_uncertainty_score":0.01176852},"labels":[],"label_agreement":null},{"id":"W4390044946","doi":"10.1109/icmct60483.2023.00015","title":"A High Speed Post-Quantum Digital Signature At 180 Sig/Sec On ARM Cortex-M4","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; NIST; Digital signature; Digital Signature Algorithm; Signature (topology); ARM architecture; Key (lock); Flash memory; Elliptic Curve Digital Signature Algorithm; Digital signal processing; Computer engineering; Algorithm; Computer hardware; Public-key cryptography; Mathematics; Hash function; Elliptic curve cryptography; Operating system; Speech recognition","score_opus":0.010637981712795124,"score_gpt":0.22403715455864184,"score_spread":0.21339917284584672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390044946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4303139,0.00035744894,0.5460615,0.0006351206,0.00024809164,0.00032790098,0.00024544704,0.0075176447,0.0142929675],"genre_scores_gemma":[0.76672846,0.00010909385,0.22437687,0.00014974321,0.00003414213,0.000082606115,0.000204869,0.00010357977,0.008210665],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996636,0.000060806717,0.00002396937,0.000047983038,0.00015019326,0.000053578082],"domain_scores_gemma":[0.99969864,0.00006345749,0.000039573224,0.000064545384,0.00010320718,0.000030629464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038083218,0.00034565467,0.00031154914,0.0005274993,0.0003193299,0.0006053636,0.0009864141,0.00043237957,0.0042112423],"category_scores_gemma":[0.00072078314,0.00012990764,0.00017755541,0.0003847545,0.00023324946,0.0007073589,0.0003482329,0.00044485318,0.0007488093],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020516114,0.000502181,0.0044791056,0.00033396872,0.00020151738,0.00077655393,0.0002961741,0.028304731,0.49527445,0.028955918,0.008721357,0.4301025],"study_design_scores_gemma":[0.00045186165,0.0037020124,0.0051697292,0.000044698398,0.00015412648,0.0012751782,0.00009101287,0.3940915,0.54662734,0.005737571,0.042541232,0.00011372032],"about_ca_topic_score_codex":0.0006788083,"about_ca_topic_score_gemma":0.0010850173,"teacher_disagreement_score":0.0042112423,"about_ca_system_score_codex":0.0005785181,"about_ca_system_score_gemma":0.00079450133,"threshold_uncertainty_score":0.014088035},"labels":[],"label_agreement":null},{"id":"W4390533396","doi":"10.1109/tsc.2023.3349298","title":"Privacy-Preserving Convolutional Neural Network Classification Scheme With Multiple Keys","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Key Research and Development Projects of Shaanxi Province; National College Students Innovation and Entrepreneurship Training Program; Innovation Scientists and Technicians Troop Construction Projects of Henan Province; Natural Science Foundation of Henan Province; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Convolutional neural network; Activation function; Cryptosystem; Information privacy; Encryption; Functional encryption; Public-key cryptography; Theoretical computer science; Ciphertext; Artificial intelligence; Data mining; Computer security; Artificial neural network","score_opus":0.02040361260747392,"score_gpt":0.2485578780755709,"score_spread":0.22815426546809697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390533396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065442085,0.0005123355,0.9140571,0.0019308685,0.00027506947,0.00052801357,0.00066038815,0.0028569757,0.013737193],"genre_scores_gemma":[0.9208416,0.00030948126,0.0695076,0.00038527139,0.00008349964,0.00047026688,0.00041985215,0.00008432719,0.007898143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578273,0.00079970533,0.00039117763,0.00085869705,0.0013143459,0.000853406],"domain_scores_gemma":[0.996271,0.0007934552,0.00045935618,0.0019489469,0.00037090053,0.00015631356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186861,0.0007515047,0.0010389225,0.0007480636,0.0015001519,0.0026234677,0.002115317,0.0016763256,0.003848981],"category_scores_gemma":[0.0053643924,0.00045816766,0.001205755,0.0013194984,0.0018212274,0.005562669,0.0050351555,0.0031146856,0.0012513966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017282938,0.000371852,0.0023717468,0.00039351036,0.00018550428,0.0011210858,0.00078927784,0.091778055,0.04901347,0.6594533,0.013392482,0.17940153],"study_design_scores_gemma":[0.0003309907,0.00029598284,0.00081293157,0.000091067945,0.00012943636,0.0010194099,0.00013146416,0.6881976,0.07114777,0.21701618,0.020688232,0.00013888745],"about_ca_topic_score_codex":0.0012806668,"about_ca_topic_score_gemma":0.0010120445,"teacher_disagreement_score":0.003848981,"about_ca_system_score_codex":0.0027224116,"about_ca_system_score_gemma":0.003093632,"threshold_uncertainty_score":0.019752562},"labels":[],"label_agreement":null},{"id":"W4390590513","doi":"10.1007/978-3-031-51583-5_3","title":"Zero-Knowledge Proofs for SIDH Variants with Masked Degree or Torsion","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Mathematical proof; Computer science; Zero-knowledge proof; Mathematics; Elliptic curve; Pure mathematics","score_opus":0.03247622963168733,"score_gpt":0.26681730639192397,"score_spread":0.23434107676023663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390590513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081065394,0.00347928,0.7527684,0.008192227,0.001719867,0.0002757619,0.0014262284,0.0029796648,0.14809324],"genre_scores_gemma":[0.8776797,0.0017023571,0.08110311,0.0016516955,0.0010807227,0.00019907477,0.0009137497,0.0009345189,0.034735046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485683,0.0011639692,0.0003037536,0.00076003425,0.0020439208,0.00087155396],"domain_scores_gemma":[0.98357415,0.009518163,0.00055704766,0.0048493356,0.0010596554,0.00044166588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039285105,0.0011499325,0.0012553462,0.0014675076,0.0024486738,0.004951215,0.00232552,0.0019728641,0.015346796],"category_scores_gemma":[0.014930989,0.0010139351,0.0017058793,0.0020340898,0.006147623,0.01416753,0.0077171866,0.0063874163,0.0043257065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013236167,0.000047880374,0.00026775635,0.00019913907,0.000026564843,0.00019024576,0.00043800968,0.0014088006,0.0017351414,0.9644324,0.007830496,0.023291145],"study_design_scores_gemma":[0.000023795896,0.00001898593,0.0000612732,0.000043126005,0.000023282933,0.00019965257,0.000049733582,0.0033338354,0.0023565646,0.98724616,0.006621909,0.000021791426],"about_ca_topic_score_codex":0.00047098016,"about_ca_topic_score_gemma":0.0004947744,"teacher_disagreement_score":0.015346796,"about_ca_system_score_codex":0.0024506266,"about_ca_system_score_gemma":0.0023404162,"threshold_uncertainty_score":0.051340163},"labels":[],"label_agreement":null},{"id":"W4390738791","doi":"10.3390/info15010040","title":"Secure Genomic String Search with Parallel Homomorphic Encryption","year":2024,"lang":"en","type":"article","venue":"Information","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Homomorphic encryption; Cryptography; Speedup; Theoretical computer science; Cryptographic primitive; Encryption; String (physics); Parallel computing; Instruction set; Distributed computing; Computer engineering; Cryptographic protocol; Algorithm; Computer network; Mathematics","score_opus":0.009144588783346355,"score_gpt":0.2141576374807494,"score_spread":0.20501304869740306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390738791","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14512697,0.0007637718,0.8331529,0.0006622927,0.00014421243,0.0001812654,0.00042607263,0.0048693265,0.014673274],"genre_scores_gemma":[0.6607599,0.00024577824,0.33228943,0.000208906,0.000040924187,0.00014015714,0.00062866864,0.00015972716,0.005526436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991875,0.00018228294,0.000061404055,0.00012477473,0.00033138104,0.000112630434],"domain_scores_gemma":[0.9992417,0.00020444838,0.000057284396,0.00034244705,0.0001211817,0.000032941996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062295265,0.000360294,0.00040542264,0.0005233844,0.00047820585,0.0011480066,0.0008895683,0.00062664464,0.0031105753],"category_scores_gemma":[0.0018673651,0.0001951405,0.0004769244,0.00073375116,0.00063118956,0.001831185,0.0012698367,0.00063896575,0.0009864531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013413534,0.00036862606,0.0043326872,0.00033057516,0.00012929691,0.0007771974,0.0005250707,0.18975155,0.08251694,0.20903824,0.017965034,0.49292335],"study_design_scores_gemma":[0.00017487374,0.0002814198,0.0008072142,0.000031021595,0.000030551197,0.0005033869,0.00009853285,0.8321041,0.07373949,0.07526161,0.016924229,0.000043573582],"about_ca_topic_score_codex":0.002025504,"about_ca_topic_score_gemma":0.0027598487,"teacher_disagreement_score":0.0031105753,"about_ca_system_score_codex":0.0009321359,"about_ca_system_score_gemma":0.0012793196,"threshold_uncertainty_score":0.010405958},"labels":[],"label_agreement":null},{"id":"W4390741694","doi":"10.1007/978-3-031-50594-2_20","title":"Committed Private Information Retrieval","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Verifiable secret sharing; Server; Correctness; Scheme (mathematics); Computer science; Private information retrieval; Theoretical computer science; Algorithm; Computer network; Computer security; Mathematics; Programming language","score_opus":0.01072638707777102,"score_gpt":0.2302576960657688,"score_spread":0.21953130898799778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390741694","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018765712,0.007759467,0.6053203,0.0037327423,0.0011389666,0.0002798773,0.0012467416,0.00370172,0.35805443],"genre_scores_gemma":[0.39130697,0.006471017,0.15760489,0.0017202077,0.0013201616,0.00024154747,0.004721233,0.0019160764,0.43469787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981975,0.00030205306,0.00009547264,0.00024740517,0.0009897829,0.00016782309],"domain_scores_gemma":[0.99733424,0.00064994453,0.000084137144,0.0015836878,0.00028532612,0.0000626611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011025822,0.0006755946,0.00090419815,0.0016286246,0.0011359748,0.0041132327,0.0018086144,0.0010573448,0.03277258],"category_scores_gemma":[0.005238173,0.00051107985,0.0005196017,0.0027507688,0.0017468452,0.007812754,0.0032776573,0.0023809853,0.015410837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010878598,0.00006271252,0.00012406308,0.00020734298,0.000020850983,0.00007134481,0.00022232118,0.0024748666,0.003072883,0.69574183,0.042399894,0.25549316],"study_design_scores_gemma":[0.000022208382,0.00003524732,0.0001270671,0.00007513973,0.000021691443,0.00036864183,0.00008041114,0.016320348,0.008367344,0.84545076,0.12910827,0.00002285992],"about_ca_topic_score_codex":0.00042034758,"about_ca_topic_score_gemma":0.00048479086,"teacher_disagreement_score":0.03277258,"about_ca_system_score_codex":0.0015268917,"about_ca_system_score_gemma":0.0012582415,"threshold_uncertainty_score":0.109635174},"labels":[],"label_agreement":null},{"id":"W4390747554","doi":"10.1007/978-3-031-50594-2_9","title":"Making an Asymmetric PAKE Quantum-Annoying by Hiding Group Elements","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; National Research Council Canada","funders":"","keywords":"Discrete logarithm; Computer science; Random oracle; Theoretical computer science; Password; Logarithm; Protocol (science); Quantum; Key exchange; Encryption; Computer security; Mathematics; Public-key cryptography; Quantum mechanics; Physics","score_opus":0.03144301422876767,"score_gpt":0.28756138028667794,"score_spread":0.2561183660579103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390747554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26914394,0.00058282685,0.45347515,0.009895386,0.0015047609,0.00022466504,0.00029944928,0.001800731,0.26307312],"genre_scores_gemma":[0.8803879,0.00046602054,0.03707101,0.000544044,0.00023870831,0.00006914909,0.00008150661,0.0003290873,0.08081258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874806,0.00017057442,0.0000373851,0.00014028353,0.00057664205,0.00032705546],"domain_scores_gemma":[0.99832743,0.0004460895,0.00012404445,0.00079891353,0.0001736936,0.00012992187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506382,0.0006676749,0.0006273432,0.00045242257,0.0017433588,0.002573196,0.00092016894,0.0019473558,0.01584235],"category_scores_gemma":[0.0032062437,0.00056184246,0.00077525026,0.000589293,0.0044051353,0.0067100804,0.0035461192,0.0038149778,0.004042842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002764465,0.000099985846,0.00021554183,0.000092306494,0.000027073795,0.00021678327,0.0005430304,0.0041976646,0.022590756,0.94204146,0.004627564,0.0250715],"study_design_scores_gemma":[0.000055497232,0.00016481611,0.00030721305,0.00006033488,0.000054826407,0.00048865937,0.00040709073,0.025249634,0.048392687,0.89566094,0.029080706,0.00007751424],"about_ca_topic_score_codex":0.00024449025,"about_ca_topic_score_gemma":0.00031290358,"teacher_disagreement_score":0.01584235,"about_ca_system_score_codex":0.00054619135,"about_ca_system_score_gemma":0.0007406817,"threshold_uncertainty_score":0.052997947},"labels":[],"label_agreement":null},{"id":"W4390770714","doi":"10.1145/3639448","title":"Multiparty Computation: To Secure Privacy, Do the Math","year":2023,"lang":"en","type":"article","venue":"Queue","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computation; Computer science; Secure multi-party computation; Set (abstract data type); Theoretical computer science; Basis (linear algebra); Secure two-party computation; Computer security; Algorithm; Mathematics; Programming language","score_opus":0.02103817089424194,"score_gpt":0.28075468345460214,"score_spread":0.2597165125603602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390770714","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004308392,0.011693075,0.80289924,0.056176484,0.0033897173,0.00020659552,0.00055246503,0.0015195528,0.11925446],"genre_scores_gemma":[0.43444076,0.023899104,0.41653022,0.022588065,0.0085260365,0.0010746615,0.0010599209,0.0012746967,0.09060651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961486,0.0014130734,0.00020646678,0.00073424523,0.0012810117,0.00021666297],"domain_scores_gemma":[0.9954821,0.001735994,0.0002589931,0.0018873737,0.00039961401,0.0002359925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044786646,0.0010903713,0.001261461,0.0014647027,0.002728756,0.0065257135,0.0013502936,0.0033313658,0.01451024],"category_scores_gemma":[0.013651384,0.00077895774,0.0014843724,0.0019688369,0.012730226,0.015939094,0.005064177,0.008754065,0.010366977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030620493,0.000022751012,0.000094666866,0.00011908224,0.000019504114,0.000031478812,0.00014435139,0.0009771683,0.00023193464,0.9550077,0.014501453,0.02881921],"study_design_scores_gemma":[0.000014370018,0.000010071941,0.00003619961,0.000056746943,0.000006841898,0.000048057875,0.000025020943,0.0036228795,0.00044947868,0.95433885,0.041379448,0.000011943536],"about_ca_topic_score_codex":0.00083112187,"about_ca_topic_score_gemma":0.000539073,"teacher_disagreement_score":0.01451024,"about_ca_system_score_codex":0.00177702,"about_ca_system_score_gemma":0.0022266454,"threshold_uncertainty_score":0.048541605},"labels":[],"label_agreement":null},{"id":"W4390856984","doi":"10.1109/edcc61798.2024.00017","title":"Oblivious Turing Machine","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Council; Bombardier","keywords":"Computer science; Homomorphic encryption; Turing machine; Theoretical computer science; Cryptosystem; Turing; Encryption; Computation; Computer security; Programming language","score_opus":0.007218858917271612,"score_gpt":0.22634655578844187,"score_spread":0.21912769687117026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390856984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021201758,0.0009176391,0.9251624,0.003142532,0.00032681416,0.00048810118,0.00045808067,0.0024409005,0.045861855],"genre_scores_gemma":[0.6123742,0.0012878986,0.3502373,0.0011107952,0.0003306525,0.0012281437,0.00061718817,0.000347758,0.032466087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665475,0.0010080991,0.00022313053,0.0006295814,0.0009142847,0.0005701778],"domain_scores_gemma":[0.99629813,0.001470852,0.0002003137,0.0015530536,0.0003480132,0.00012963133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019711263,0.0007437553,0.0014070871,0.00058729947,0.0017887377,0.003001759,0.0027554806,0.0019747026,0.006401467],"category_scores_gemma":[0.0072144144,0.00057698204,0.0013055028,0.0008175475,0.0047781444,0.006594593,0.0037246004,0.0038599481,0.0031040497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017196733,0.000053132604,0.00021311353,0.00021976695,0.000041790852,0.00013686472,0.00032182987,0.0158508,0.0037389765,0.9532392,0.0043172985,0.021695217],"study_design_scores_gemma":[0.00011083345,0.000119706005,0.0001527101,0.0000713904,0.00004007244,0.00016122388,0.000052344378,0.109572165,0.010749407,0.8481995,0.030716479,0.000054203174],"about_ca_topic_score_codex":0.0007588577,"about_ca_topic_score_gemma":0.00057715195,"teacher_disagreement_score":0.006401467,"about_ca_system_score_codex":0.0020268604,"about_ca_system_score_gemma":0.0028177144,"threshold_uncertainty_score":0.021415055},"labels":[],"label_agreement":null},{"id":"W4391317167","doi":"10.18280/mmep.110125","title":"Enhancing Security in Online Voting Systems: A Cryptographic Approach Utilizing Galois Fields","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gandhi Institute of Technology and Management","keywords":"Cryptography; Computer science; Voting; Computer security; Cryptographic primitive; Theoretical computer science; Cryptographic protocol; Political science","score_opus":0.02228536389087382,"score_gpt":0.22213939422144235,"score_spread":0.19985403033056853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391317167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022652345,0.00016205768,0.9701663,0.00030466457,0.000055311095,0.00008788231,0.00002817572,0.00010025446,0.006443004],"genre_scores_gemma":[0.88955665,0.0004499255,0.10403337,0.000110998655,0.00010455011,0.00012906731,0.00004485966,0.000030149595,0.0055404697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977982,0.0011500185,0.00008250166,0.00018706144,0.00055043446,0.00023175681],"domain_scores_gemma":[0.9984457,0.0006998899,0.00019673152,0.00045847136,0.00014190948,0.00005729283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022326612,0.0005331196,0.00060103484,0.00089824444,0.00078890694,0.0023125294,0.0010236093,0.0011124001,0.0031483592],"category_scores_gemma":[0.003653764,0.0002815741,0.000923966,0.00078748213,0.0021558048,0.0036834073,0.0017772737,0.0013986056,0.0007919166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011391757,0.000074456824,0.00067531434,0.000102104736,0.000027514525,0.00013734846,0.00017840884,0.17121845,0.009168767,0.7865162,0.0007682308,0.031019345],"study_design_scores_gemma":[0.000027337559,0.00020265442,0.00023332945,0.00004378565,0.000018318737,0.00016974576,0.00007117789,0.747529,0.0056968057,0.23869058,0.0072876676,0.000029599403],"about_ca_topic_score_codex":0.00047265724,"about_ca_topic_score_gemma":0.00042151439,"teacher_disagreement_score":0.0031483592,"about_ca_system_score_codex":0.0009967197,"about_ca_system_score_gemma":0.0012650334,"threshold_uncertainty_score":0.011807561},"labels":[],"label_agreement":null},{"id":"W4391725765","doi":"10.1007/978-3-031-52477-6_2","title":"Fundamental Data Security Technologies","year":2023,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blockchain; Computer science; Verifiable secret sharing; Credential; Cryptography; Computer security; Hash function; Zero-knowledge proof; Theoretical computer science; Programming language","score_opus":0.03920200299913822,"score_gpt":0.24959989832718865,"score_spread":0.21039789532805042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391725765","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014362403,0.02526431,0.087862164,0.0030822672,0.0031757536,0.00016709378,0.00028488768,0.0005645533,0.8781627],"genre_scores_gemma":[0.020781167,0.030864034,0.030524708,0.0017405761,0.0018929989,0.00028118622,0.000429794,0.00025556437,0.91323006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946564,0.00006226381,0.000017406326,0.00008297721,0.00032164122,0.0000500132],"domain_scores_gemma":[0.99969363,0.00010461791,0.00001691503,0.00008545264,0.00007930301,0.00002014461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041792192,0.0012359935,0.00050903007,0.0013366363,0.0010123256,0.003350527,0.0012698694,0.0013296296,0.029810375],"category_scores_gemma":[0.0008814188,0.0005074687,0.0004113735,0.0013624344,0.0023077554,0.0042897314,0.0016819255,0.0035307708,0.020779725],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010448949,0.000033431756,0.000035879355,0.00022864988,0.0000048267807,0.00003672597,0.00024645426,0.00038953454,0.0025751463,0.80451965,0.07935405,0.11256515],"study_design_scores_gemma":[0.0000034466575,0.000018264822,0.00005262173,0.0001374215,0.000003831294,0.00015569475,0.000044731773,0.0006065921,0.0018787772,0.13009772,0.8669936,0.0000071813824],"about_ca_topic_score_codex":0.00037430966,"about_ca_topic_score_gemma":0.00043606042,"teacher_disagreement_score":0.029810375,"about_ca_system_score_codex":0.0015652679,"about_ca_system_score_gemma":0.0012858411,"threshold_uncertainty_score":0.099725604},"labels":[],"label_agreement":null},{"id":"W4391920153","doi":"10.1007/978-3-031-53368-6_17","title":"Secure Function Extensions to Additively Homomorphic Cryptosystems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Homomorphic encryption; Cryptosystem; Computer science; Theoretical computer science; Function (biology); Computer security; Programming language; Cryptography; Arithmetic; Algebra over a field; Encryption; Mathematics; Pure mathematics","score_opus":0.015022319798282622,"score_gpt":0.23233770174614768,"score_spread":0.21731538194786507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391920153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19299151,0.0052411724,0.4847778,0.0023693284,0.0011930263,0.00020589882,0.00022927806,0.002432662,0.3105592],"genre_scores_gemma":[0.8560098,0.003193249,0.04180085,0.00027363273,0.0006110899,0.000107771644,0.00018798737,0.00024702228,0.09756872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993911,0.00011503411,0.000032829306,0.000061540515,0.00031012035,0.000089342255],"domain_scores_gemma":[0.9993861,0.00023877867,0.00003415928,0.00023515255,0.00006704672,0.0000387295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045531418,0.0006962977,0.00045953886,0.0005806083,0.0005517569,0.0019279077,0.0005387176,0.0006248027,0.0058273394],"category_scores_gemma":[0.0011785267,0.0004176332,0.0003952904,0.0006783159,0.0012641215,0.0033754413,0.0017248121,0.0024555882,0.0022348259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011575393,0.000085238775,0.00008490119,0.00010362468,0.000011359578,0.00014393669,0.00028421814,0.005311049,0.011875724,0.9099055,0.0036644891,0.06841427],"study_design_scores_gemma":[0.000051380164,0.00018082232,0.00031872792,0.000082997554,0.000026541682,0.0006985,0.00008993642,0.024506075,0.027869638,0.8755546,0.07058931,0.00003155879],"about_ca_topic_score_codex":0.000080909675,"about_ca_topic_score_gemma":0.00010111402,"teacher_disagreement_score":0.0058273394,"about_ca_system_score_codex":0.00062520156,"about_ca_system_score_gemma":0.00034265115,"threshold_uncertainty_score":0.019494414},"labels":[],"label_agreement":null},{"id":"W4392153309","doi":"10.1109/globecom54140.2023.10437005","title":"SES2: A Secure and Efficient Symmetric Searchable Encryption Scheme for Structured Data","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Encryption; Scheme (mathematics); Symmetric-key algorithm; Computer security; Computer network; Theoretical computer science; Public-key cryptography; Mathematics","score_opus":0.05475155937034299,"score_gpt":0.30600273299997516,"score_spread":0.2512511736296322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392153309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05253086,0.0024459183,0.92365247,0.0017157728,0.0003945634,0.001104139,0.0018855475,0.0027224731,0.013548161],"genre_scores_gemma":[0.75117093,0.0017618148,0.22110024,0.0010288004,0.00018342507,0.00097553135,0.0035254227,0.00018110304,0.020072835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971782,0.00070251594,0.00033738345,0.00025351378,0.0012167861,0.00031168485],"domain_scores_gemma":[0.9979498,0.00038077854,0.0002780754,0.00086085056,0.00041037932,0.00012012901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021097711,0.0006425465,0.0008738783,0.0010850137,0.00079256925,0.0016453767,0.0012203046,0.001054139,0.0028263652],"category_scores_gemma":[0.0031343575,0.00036915793,0.00095971033,0.0015910147,0.0011272841,0.004659062,0.003016208,0.0016205828,0.0015935752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027013284,0.0004987048,0.0027777427,0.001323225,0.00037324202,0.0016349951,0.0011127646,0.038985733,0.14952347,0.49972442,0.039982837,0.2613615],"study_design_scores_gemma":[0.0011415546,0.001758003,0.0023461452,0.0002711457,0.00017723523,0.004047211,0.0005997992,0.36892474,0.17135124,0.21930227,0.22964716,0.00043350618],"about_ca_topic_score_codex":0.0006193473,"about_ca_topic_score_gemma":0.0005930583,"teacher_disagreement_score":0.0028263652,"about_ca_system_score_codex":0.0010638665,"about_ca_system_score_gemma":0.0022133947,"threshold_uncertainty_score":0.011157632},"labels":[],"label_agreement":null},{"id":"W4392158147","doi":"10.1109/globecom54140.2023.10436872","title":"Towards Efficient and Privacy-Preserving Federated Learning for HMM Training","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Basic Research Program of Shaanxi Province; Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Hidden Markov model; Training (meteorology); Federated learning; Training set; Artificial intelligence; Computer security","score_opus":0.04535319499859307,"score_gpt":0.28444805413508734,"score_spread":0.23909485913649425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015630065,0.00014462243,0.98204803,0.00026609603,0.000041717332,0.00006817852,0.00014185657,0.0010047307,0.00065472536],"genre_scores_gemma":[0.7711114,0.00019059143,0.22525458,0.00028011075,0.00006736228,0.00019515841,0.00042676568,0.0001103574,0.0023637132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941539,0.002210597,0.00051428174,0.00115475,0.0012981767,0.0006683672],"domain_scores_gemma":[0.98752904,0.0045934496,0.00082307926,0.0057101515,0.0009635527,0.00038065677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046246187,0.00078081974,0.0015648671,0.00075103866,0.0014578841,0.0019130143,0.0026164127,0.0019345566,0.0022594205],"category_scores_gemma":[0.016014758,0.00059146306,0.0011623856,0.0013440805,0.0014790215,0.005076349,0.0053769327,0.0030748143,0.0010275195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016883053,0.00045513804,0.0036958398,0.00026550953,0.00018462137,0.0005162227,0.00087435474,0.48054177,0.024673115,0.19719084,0.0066302614,0.283284],"study_design_scores_gemma":[0.000042539148,0.000067823,0.00020454108,0.000015071525,0.00001673395,0.00017038686,0.000053397685,0.92978597,0.00822669,0.060261425,0.0011290425,0.000026415426],"about_ca_topic_score_codex":0.0014272757,"about_ca_topic_score_gemma":0.0013322061,"teacher_disagreement_score":0.0046246187,"about_ca_system_score_codex":0.0013903201,"about_ca_system_score_gemma":0.0029904724,"threshold_uncertainty_score":0.024457633},"labels":[],"label_agreement":null},{"id":"W4392158245","doi":"10.1109/globecom54140.2023.10437929","title":"Efficient and Privacy-Preserving Eclipse Query Over Encrypted Data","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Encryption; Eclipse; Query optimization; Information retrieval; Computer security","score_opus":0.044498443855342025,"score_gpt":0.2907747249848673,"score_spread":0.24627628112952527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22913596,0.0013509371,0.75404364,0.0015548894,0.000120132885,0.00050782814,0.0022435207,0.0016012928,0.009441792],"genre_scores_gemma":[0.9150244,0.00039161497,0.07930356,0.00024224201,0.000062464605,0.00013316445,0.0013913402,0.00006484416,0.0033863941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950708,0.00088793394,0.0005764503,0.00066192815,0.0019360691,0.0008668742],"domain_scores_gemma":[0.99424225,0.0017807224,0.0006188335,0.0024907843,0.0007020646,0.00016535868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026023325,0.00045867174,0.0012569963,0.0008469611,0.0011256031,0.0019591239,0.0015322033,0.0010872512,0.0014078893],"category_scores_gemma":[0.0068460465,0.0003189882,0.0008257763,0.0020726556,0.000992165,0.0079037165,0.0044200444,0.0015295699,0.00057075126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004625366,0.00071307627,0.017120754,0.00080773234,0.00032630112,0.002432259,0.003090907,0.11067722,0.107174166,0.34690633,0.021291997,0.38483384],"study_design_scores_gemma":[0.00039413542,0.0006006031,0.004497649,0.00008080045,0.00013034929,0.0032886993,0.0014543714,0.70982116,0.10694726,0.14174579,0.030852199,0.00018705467],"about_ca_topic_score_codex":0.0011692585,"about_ca_topic_score_gemma":0.0010020144,"teacher_disagreement_score":0.0026023325,"about_ca_system_score_codex":0.0013633671,"about_ca_system_score_gemma":0.0019695002,"threshold_uncertainty_score":0.013762653},"labels":[],"label_agreement":null},{"id":"W4392158768","doi":"10.1109/globecom54140.2023.10437667","title":"ERQ: An Efficient Range Query Scheme Under Local Differential Privacy","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differential privacy; Computer science; Range (aeronautics); Scheme (mathematics); Differential (mechanical device); Range query (database); Theoretical computer science; Information retrieval; Sargable; Data mining; Web search query; Mathematics; Search engine; Physics","score_opus":0.02511657099382504,"score_gpt":0.2678386364916113,"score_spread":0.2427220654977863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015608362,0.00053442456,0.9782614,0.00036640585,0.0000895666,0.00027462977,0.00024702458,0.0011080876,0.0035101539],"genre_scores_gemma":[0.7208721,0.00081134925,0.26789793,0.00069029524,0.00019929024,0.0006485961,0.0006725244,0.00015034611,0.008057527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99390775,0.0015577622,0.00042322645,0.0009365819,0.0024576385,0.0007170289],"domain_scores_gemma":[0.9955409,0.0013288695,0.0005095144,0.0016921666,0.0007285849,0.00019999182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029183284,0.00067771587,0.0020572932,0.0011621846,0.0013095544,0.0015617774,0.00317926,0.0017752226,0.0025994033],"category_scores_gemma":[0.0069265445,0.00034885426,0.0010075575,0.0025692533,0.0018536495,0.0052535958,0.0074996166,0.0018495541,0.0012859318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022062196,0.000410375,0.001493092,0.0007488377,0.00022837128,0.0012808391,0.0015586012,0.13478571,0.10752106,0.30010226,0.016285993,0.4333786],"study_design_scores_gemma":[0.00047080652,0.0008828796,0.0008439964,0.00007785001,0.00011047826,0.0021660393,0.00052997004,0.785205,0.03880175,0.14002107,0.030599676,0.00029045422],"about_ca_topic_score_codex":0.0010172253,"about_ca_topic_score_gemma":0.00053976564,"teacher_disagreement_score":0.00317926,"about_ca_system_score_codex":0.0012999102,"about_ca_system_score_gemma":0.0014270943,"threshold_uncertainty_score":0.015433788},"labels":[],"label_agreement":null},{"id":"W4392249554","doi":"10.1007/978-3-031-54776-8_4","title":"Fair Private Set Intersection Using Smart Contracts","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Intersection (aeronautics); Set (abstract data type); Programming language; Transport engineering; Engineering","score_opus":0.023351956413623007,"score_gpt":0.26079645800884615,"score_spread":0.23744450159522315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392249554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03429709,0.00035677387,0.91316223,0.0008656989,0.00018494503,0.00015075224,0.00019491345,0.0009257197,0.049861737],"genre_scores_gemma":[0.6770975,0.00050850975,0.27484682,0.00025713362,0.00019564548,0.0003315475,0.0003907083,0.0004966432,0.045875452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957937,0.0010668588,0.00018744277,0.0006217813,0.0016928118,0.0006373969],"domain_scores_gemma":[0.9953518,0.0020525772,0.00016626866,0.0018130849,0.0003747926,0.00024141082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035553072,0.0006676067,0.001808424,0.0014154136,0.003099439,0.0057831793,0.0028938982,0.0015891115,0.013538713],"category_scores_gemma":[0.0076175146,0.00094500795,0.0016490158,0.0028388763,0.004081368,0.0127052665,0.0087041035,0.0050474466,0.002520911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001283316,0.00004967533,0.000083103136,0.000029272216,0.000012172418,0.000022442118,0.00012268317,0.007201552,0.00075217505,0.96332973,0.001651995,0.026616774],"study_design_scores_gemma":[0.00002366398,0.000022028413,0.000034050532,0.000014593046,0.000013300077,0.000035000692,0.00003428112,0.044813115,0.0016588125,0.94873565,0.0046018204,0.0000136998415],"about_ca_topic_score_codex":0.00091431744,"about_ca_topic_score_gemma":0.000785273,"teacher_disagreement_score":0.013538713,"about_ca_system_score_codex":0.0031132882,"about_ca_system_score_gemma":0.0029158043,"threshold_uncertainty_score":0.045291543},"labels":[],"label_agreement":null},{"id":"W4392767434","doi":"10.1186/s42400-023-00187-4","title":"Practical solutions in fully homomorphic encryption: a survey analyzing existing acceleration methods","year":2024,"lang":"en","type":"article","venue":"Cybersecurity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Computer science; Acceleration; Encryption; Data mining; Computer security; Physics","score_opus":0.18061193895337746,"score_gpt":0.4232438815701642,"score_spread":0.24263194261678672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392767434","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034075852,0.2543832,0.65672976,0.0036947771,0.000896403,0.0005239159,0.00025197308,0.0012294226,0.048214678],"genre_scores_gemma":[0.45799166,0.15756927,0.37267858,0.00093144877,0.0011585308,0.0004562402,0.0006656139,0.00028467746,0.008264008],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960871,0.0010244022,0.00035588432,0.00040816935,0.0017580318,0.00036651522],"domain_scores_gemma":[0.99441,0.0028951287,0.00044925316,0.001376378,0.0007661808,0.00010311569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002909708,0.0016658233,0.0010280262,0.0026340154,0.0007660489,0.002145931,0.0016918925,0.0012734709,0.0063180937],"category_scores_gemma":[0.009995397,0.00068341964,0.0011220953,0.0032755877,0.0013539535,0.006031672,0.0023531567,0.0023302187,0.0017832137],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003478475,0.00024036785,0.0016595025,0.0027994108,0.00010164138,0.00015847728,0.00025464335,0.019325687,0.0056678583,0.17513247,0.0093891015,0.784923],"study_design_scores_gemma":[0.00043396698,0.0020708262,0.0044615073,0.0050384756,0.00033939045,0.0061320052,0.0011736578,0.31928152,0.033859275,0.2762484,0.35067973,0.0002812347],"about_ca_topic_score_codex":0.0005574772,"about_ca_topic_score_gemma":0.00041870488,"teacher_disagreement_score":0.0063180937,"about_ca_system_score_codex":0.0011383308,"about_ca_system_score_gemma":0.0014696368,"threshold_uncertainty_score":0.021136105},"labels":[],"label_agreement":null},{"id":"W4392878815","doi":"10.1515/jmc-2022-0029","title":"The dihedral hidden subgroup problem","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Dihedral group; Coset; Quantum algorithm; Mathematics; Dihedral angle; Discrete mathematics; Quantum; Algorithm; Pure mathematics; Group (periodic table); Quantum mechanics","score_opus":0.01215892878859508,"score_gpt":0.26512857328252964,"score_spread":0.25296964449393455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392878815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36751273,0.0010920354,0.5191341,0.015763415,0.00061881443,0.000553176,0.0010237907,0.0010958789,0.093206026],"genre_scores_gemma":[0.95763123,0.00038706278,0.028617585,0.0011169857,0.0003257604,0.00022857034,0.00052916916,0.00014035501,0.011023291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943094,0.0016213674,0.00032357938,0.001117812,0.0017139186,0.0009137831],"domain_scores_gemma":[0.9709762,0.018125717,0.0012901895,0.006889665,0.0015627091,0.0011555179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037750008,0.0006592357,0.0012707012,0.00089190324,0.0022153745,0.0036576267,0.002402869,0.0027759958,0.012998497],"category_scores_gemma":[0.026579231,0.00045062538,0.0012455899,0.001208213,0.006149348,0.009336734,0.006603402,0.005388382,0.0019345125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032245103,0.000086295375,0.0014174443,0.00014050858,0.000036855403,0.000105671825,0.0005097897,0.008438482,0.0019542002,0.96158624,0.0058502853,0.019551827],"study_design_scores_gemma":[0.000072421135,0.0000727224,0.00021972205,0.00003477121,0.00001882034,0.00010109494,0.00022483952,0.04318322,0.003916108,0.94802696,0.004105806,0.000023464436],"about_ca_topic_score_codex":0.0011135633,"about_ca_topic_score_gemma":0.00078459864,"teacher_disagreement_score":0.012998497,"about_ca_system_score_codex":0.0018957035,"about_ca_system_score_gemma":0.002007118,"threshold_uncertainty_score":0.04348427},"labels":[],"label_agreement":null},{"id":"W4392902703","doi":"10.1109/tsc.2024.3376203","title":"EPSet: Efficient and Privacy-Preserving Set Similarity Range Query Over Encrypted Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Range query (database); Encryption; Set (abstract data type); Similarity (geometry); Range (aeronautics); Information privacy; Query optimization; Data mining; Theoretical computer science; Information retrieval; Web search query; Sargable; Computer security; Search engine; Artificial intelligence","score_opus":0.032285111092386944,"score_gpt":0.2907963364408818,"score_spread":0.25851122534849486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392902703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053478304,0.0009939387,0.9380049,0.0006314458,0.00014393311,0.0005400542,0.0009656312,0.0012319771,0.0040097865],"genre_scores_gemma":[0.8516996,0.00079162384,0.14094378,0.00040816164,0.00014958813,0.00036200142,0.0013325578,0.00006660501,0.0042462074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944535,0.0010241675,0.0006536663,0.000654593,0.0026489699,0.0005650979],"domain_scores_gemma":[0.9948949,0.00132264,0.0005854407,0.002206518,0.0007970122,0.00019353033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023549495,0.00052780204,0.001510054,0.0012488288,0.0010811697,0.001615166,0.0018921565,0.0011981598,0.0019753547],"category_scores_gemma":[0.0073136166,0.00028186472,0.00091689796,0.002619847,0.00094273454,0.006222513,0.004663914,0.0013490039,0.000786828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030945772,0.0007211474,0.006326977,0.0010336277,0.00041956664,0.002005368,0.0018662625,0.12958871,0.09698231,0.19683474,0.024171948,0.5369547],"study_design_scores_gemma":[0.00027423495,0.0009011596,0.002267987,0.000073211544,0.000116497176,0.003376968,0.0007364895,0.8281776,0.06214923,0.078491606,0.023246866,0.00018826297],"about_ca_topic_score_codex":0.001363178,"about_ca_topic_score_gemma":0.000794532,"teacher_disagreement_score":0.0023549495,"about_ca_system_score_codex":0.0011143964,"about_ca_system_score_gemma":0.0015589737,"threshold_uncertainty_score":0.012454331},"labels":[],"label_agreement":null},{"id":"W4392908482","doi":"10.1109/tdsc.2024.3376084","title":"Achieving Practical and Privacy-Preserving kNN Query Over Encrypted Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Information privacy; Query optimization; Data mining; Computer security","score_opus":0.038100542285316945,"score_gpt":0.31124048703686114,"score_spread":0.2731399447515442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392908482","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045723263,0.0014466401,0.9326158,0.00230912,0.0002882895,0.00034626923,0.0033076631,0.0027014958,0.011261487],"genre_scores_gemma":[0.7483432,0.0014562935,0.23020045,0.0013106083,0.00033782667,0.00031169428,0.0051886956,0.00038238414,0.012468823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99345666,0.0010359421,0.0005901061,0.0011471466,0.0027620473,0.0010080643],"domain_scores_gemma":[0.9947732,0.0014559397,0.00034255482,0.0024577633,0.00083579926,0.00013470757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025710869,0.0011326607,0.0018979252,0.0010270195,0.0017201,0.002924768,0.0021201435,0.0020708002,0.005157861],"category_scores_gemma":[0.011266159,0.0005582934,0.0010639436,0.002909246,0.0014144374,0.0078086182,0.0054617636,0.0022025441,0.0033765147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028181265,0.00069983664,0.004911692,0.0012246759,0.0003455596,0.0017099452,0.0013825997,0.26876774,0.046552807,0.18468149,0.07523421,0.41167125],"study_design_scores_gemma":[0.00011690899,0.0001770243,0.0006881628,0.000050425362,0.000047946283,0.0010856852,0.0006516314,0.80444235,0.022123387,0.15769772,0.012848968,0.00006987369],"about_ca_topic_score_codex":0.0038628532,"about_ca_topic_score_gemma":0.0045450265,"teacher_disagreement_score":0.005157861,"about_ca_system_score_codex":0.0017161383,"about_ca_system_score_gemma":0.0029483752,"threshold_uncertainty_score":0.01725477},"labels":[],"label_agreement":null},{"id":"W4392930159","doi":"10.1007/978-3-031-54075-2_6","title":"Privacy-Preserving Data Search in Cloud Storage","year":2024,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Cloud storage; Database; Operating system","score_opus":0.0430207278768205,"score_gpt":0.27133135636590533,"score_spread":0.22831062848908484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392930159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030081775,0.040688094,0.75708735,0.0068280804,0.0014699694,0.00021676469,0.0010900777,0.0015351938,0.16100271],"genre_scores_gemma":[0.58643556,0.03534532,0.18842699,0.0014474158,0.0012799471,0.0001786138,0.0010863127,0.0007361661,0.18506363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993511,0.00010478152,0.00003430299,0.000083764084,0.00032808166,0.0000979362],"domain_scores_gemma":[0.99916077,0.0003912989,0.0000408599,0.0002964189,0.0000867758,0.0000238283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006192219,0.00042577175,0.000749635,0.00061263633,0.00079446845,0.002707228,0.0012537434,0.0009513462,0.0076820655],"category_scores_gemma":[0.002311391,0.00035480317,0.0005062973,0.003000987,0.0012959254,0.0054773134,0.0013315977,0.0017535592,0.002440765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020139958,0.000073524636,0.0002689686,0.00047316746,0.000021819029,0.00015292506,0.0002485183,0.022903906,0.0060509057,0.6640055,0.04529213,0.26030722],"study_design_scores_gemma":[0.000030244071,0.0000951893,0.0003521596,0.00018924625,0.00002866618,0.0010844198,0.00023743486,0.18951468,0.015483762,0.6393391,0.15360771,0.000037409503],"about_ca_topic_score_codex":0.0011504655,"about_ca_topic_score_gemma":0.0010477528,"teacher_disagreement_score":0.0076820655,"about_ca_system_score_codex":0.0012755917,"about_ca_system_score_gemma":0.001435599,"threshold_uncertainty_score":0.02569902},"labels":[],"label_agreement":null},{"id":"W4393028968","doi":"10.29007/8cqg","title":"Data Security in the Cloud Using pTree-based Homomorphic Intrinsic Data Encryption System (pHIDES)","year":2024,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Cloud computing; Client-side encryption; Data security; Computer security; On-the-fly encryption; Operating system","score_opus":0.080960305153916,"score_gpt":0.3143764751420236,"score_spread":0.2334161699881076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393028968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09852886,0.0018063834,0.88324463,0.00089781557,0.00017696091,0.00031141512,0.00031285704,0.0013541107,0.013367014],"genre_scores_gemma":[0.820536,0.0012388405,0.17239577,0.00022736672,0.000054726024,0.00013449673,0.0002906138,0.000046986046,0.0050752605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990452,0.00021375694,0.00008901839,0.00013411914,0.00037395707,0.00014398395],"domain_scores_gemma":[0.99913687,0.00015994474,0.00013461917,0.00035799746,0.00016446607,0.00004615907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006452368,0.00026929448,0.00037780698,0.0005201579,0.00059688545,0.0012714906,0.0006767536,0.00045324836,0.0015830639],"category_scores_gemma":[0.0013703828,0.00014827131,0.00048702842,0.0007082111,0.0006305721,0.002824369,0.0014063477,0.00082700554,0.00054549164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012550859,0.00033213408,0.0063188,0.0007134673,0.00020744972,0.0018932128,0.0010657654,0.04634337,0.20171428,0.28649437,0.0139697725,0.43969226],"study_design_scores_gemma":[0.00023048946,0.0012624217,0.0039700554,0.00022319137,0.00011049016,0.0069032293,0.00066600804,0.49684608,0.3247381,0.0689186,0.09593754,0.00019378428],"about_ca_topic_score_codex":0.0007071058,"about_ca_topic_score_gemma":0.0006804049,"teacher_disagreement_score":0.0015830639,"about_ca_system_score_codex":0.00071196345,"about_ca_system_score_gemma":0.0009244089,"threshold_uncertainty_score":0.0052958727},"labels":[],"label_agreement":null},{"id":"W4393094652","doi":"10.34190/iccws.19.1.2054","title":"On The Zero-Trust Intranet Certification Problem","year":2024,"lang":"en","type":"article","venue":"International Conference on Cyber Warfare and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Society of Intestinal Research","funders":"","keywords":"Certification; Zero (linguistics); Intranet; Business; Computer science; World Wide Web; The Internet; Management; Economics; Philosophy; Linguistics","score_opus":0.03673024923766276,"score_gpt":0.2788194873246132,"score_spread":0.24208923808695043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393094652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073756486,0.033692714,0.64991194,0.041355867,0.0014057005,0.00048595,0.00017617708,0.00072325213,0.19849196],"genre_scores_gemma":[0.77871776,0.034015898,0.15623024,0.0072951987,0.001465609,0.00035972596,0.0003433878,0.00023299662,0.021339072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98884445,0.004074081,0.00086431653,0.0012976562,0.0040040095,0.00091548916],"domain_scores_gemma":[0.97688645,0.014885166,0.0015131761,0.0027436768,0.0034704763,0.00050103915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008324741,0.00046124237,0.00076895254,0.0015691925,0.0024057934,0.0055367504,0.002228021,0.004683429,0.0039045878],"category_scores_gemma":[0.02336168,0.00056874444,0.0009435676,0.0025509743,0.006691152,0.014616061,0.0034976301,0.0053138887,0.0011265412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004312039,0.00004030094,0.00072810514,0.0004271982,0.000017921422,0.0005043321,0.0007283232,0.007991601,0.0005933758,0.9116853,0.005809776,0.07143065],"study_design_scores_gemma":[0.00006273624,0.00012966948,0.0013046627,0.0018669155,0.00006791037,0.0030974052,0.0021816266,0.04465211,0.0040894346,0.78746474,0.15499383,0.000088987355],"about_ca_topic_score_codex":0.003101868,"about_ca_topic_score_gemma":0.0023781022,"teacher_disagreement_score":0.008324741,"about_ca_system_score_codex":0.002813541,"about_ca_system_score_gemma":0.004187681,"threshold_uncertainty_score":0.044025958},"labels":[],"label_agreement":null},{"id":"W4394951493","doi":"10.1007/s10878-024-01158-2","title":"Differentially private submodular maximization with a cardinality constraint over the integer lattice","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Theory of computation; Combinatorics; Integer lattice; Cardinality (data modeling); Mathematics; Integer programming; Discrete mathematics; Integer (computer science); Constraint (computer-aided design); Subadditivity; Radical of an integer; Computer science; Mathematical optimization; Prime factor; Algorithm; Physics; Half-integer; Prime (order theory)","score_opus":0.0077886032852589136,"score_gpt":0.2270130398989737,"score_spread":0.2192244366137148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394951493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08612706,0.00083220965,0.88753384,0.005048582,0.00021517609,0.00014347903,0.0015530281,0.000499033,0.01804753],"genre_scores_gemma":[0.8245882,0.0007679913,0.16426855,0.0006259053,0.00036602232,0.00021300737,0.00067892997,0.00015566277,0.0083357645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587005,0.0022507978,0.00012715535,0.000551787,0.00066585856,0.0005343259],"domain_scores_gemma":[0.9919051,0.0056532375,0.00050394033,0.0012551841,0.00029440311,0.00038813762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052060876,0.0009400007,0.0021520364,0.00064217765,0.0007519159,0.0039262217,0.0021052915,0.0016143917,0.0034105221],"category_scores_gemma":[0.015031399,0.0007555427,0.0008008914,0.0020062919,0.0021796643,0.0053569837,0.0029147507,0.0034743373,0.000692062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010520159,0.00029435952,0.0007036985,0.0002956609,0.0000985493,0.00029407165,0.00016478189,0.3411817,0.0034016797,0.60531205,0.011435199,0.035766255],"study_design_scores_gemma":[0.00012553293,0.00006601948,0.00010198895,0.000029595172,0.000016989261,0.000116189134,0.000047634792,0.5782884,0.0012114525,0.41815272,0.0018216711,0.000021908798],"about_ca_topic_score_codex":0.0009663063,"about_ca_topic_score_gemma":0.0013628263,"teacher_disagreement_score":0.0052060876,"about_ca_system_score_codex":0.0029889443,"about_ca_system_score_gemma":0.003135727,"threshold_uncertainty_score":0.027532756},"labels":[],"label_agreement":null},{"id":"W4395017388","doi":"10.1109/tdsc.2024.3392424","title":"MaskCrypt: Federated Learning With Selective Homomorphic Encryption","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Computer security; Theoretical computer science","score_opus":0.008515883368515574,"score_gpt":0.21966704186343017,"score_spread":0.2111511584949146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395017388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016845148,0.00024357771,0.97369564,0.0005744072,0.00009555347,0.00015849255,0.00023934511,0.004963645,0.0031840785],"genre_scores_gemma":[0.7069952,0.0003060359,0.28416017,0.0007704866,0.000115506096,0.0002762433,0.0006133965,0.00022189472,0.006541077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700075,0.0009060703,0.00023169465,0.00045339172,0.001008585,0.00039949853],"domain_scores_gemma":[0.9956564,0.0009678212,0.00032394045,0.0025331357,0.0003533808,0.00016540826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032334817,0.0006483377,0.0009361967,0.00085790927,0.00076042925,0.0018170244,0.0025403777,0.0017618638,0.003375446],"category_scores_gemma":[0.0069557936,0.0004102965,0.0008772998,0.0010105984,0.0016048363,0.0061797565,0.003646082,0.0021736876,0.0011659025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017254686,0.00075711985,0.00240464,0.00029083854,0.00018617802,0.0005744578,0.00029396423,0.17772469,0.02155549,0.3116611,0.027213233,0.45561284],"study_design_scores_gemma":[0.00012200244,0.00022652569,0.0002868227,0.000029429828,0.000022940529,0.00035286858,0.00003263997,0.81781435,0.022317419,0.15003818,0.008713149,0.000043723703],"about_ca_topic_score_codex":0.00093186233,"about_ca_topic_score_gemma":0.0009160305,"teacher_disagreement_score":0.003375446,"about_ca_system_score_codex":0.0010224311,"about_ca_system_score_gemma":0.0022175405,"threshold_uncertainty_score":0.017100453},"labels":[],"label_agreement":null},{"id":"W4395048765","doi":"10.52783/jes.2550","title":"Zero-Trust Cryptographic Protocols and Differential Privacy Techniques for Scalable Secure Multi-Party Computation in Big Data Analytics","year":2024,"lang":"en","type":"article","venue":"Journal of Electrical Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Differential privacy; Computer science; Scalability; Zero-knowledge proof; Secure multi-party computation; Cryptography; Computation; Secure two-party computation; Big data; Analytics; Cryptographic protocol; Computer security; Algorithm; Data mining; Database","score_opus":0.07884463885551152,"score_gpt":0.33567532435274766,"score_spread":0.25683068549723614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395048765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005373453,0.0010469762,0.98734623,0.0010386839,0.00015853143,0.00011841352,0.000030459174,0.0001606814,0.0047265575],"genre_scores_gemma":[0.65767807,0.0034212011,0.33042938,0.00094698946,0.00050132343,0.000629852,0.00016729493,0.00013416015,0.0060917544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917327,0.0028275552,0.0006405607,0.000939271,0.0033027423,0.0005571966],"domain_scores_gemma":[0.9898347,0.0044778404,0.0008699913,0.0035234413,0.0010479328,0.00024605409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075727566,0.0010366663,0.0010018527,0.0015244482,0.0019005437,0.0044223084,0.0028543102,0.0023385389,0.002176838],"category_scores_gemma":[0.016067956,0.0009813107,0.0019830775,0.0018199241,0.0059229946,0.012541536,0.006636688,0.008138997,0.0008876599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078190795,0.00004146761,0.00023407215,0.00016289634,0.000039899787,0.00013544022,0.00026183156,0.019914519,0.0028129725,0.94796216,0.0014360149,0.026920483],"study_design_scores_gemma":[0.000055611818,0.00013614252,0.00013425916,0.00012948373,0.000044018296,0.00031887705,0.00013311034,0.249931,0.008716304,0.726584,0.013746948,0.00007018156],"about_ca_topic_score_codex":0.0005813903,"about_ca_topic_score_gemma":0.0004260915,"teacher_disagreement_score":0.0075727566,"about_ca_system_score_codex":0.0029820532,"about_ca_system_score_gemma":0.0023838843,"threshold_uncertainty_score":0.040049016},"labels":[],"label_agreement":null},{"id":"W4395093918","doi":"10.1007/978-3-031-57725-3_11","title":"Laconic Branching Programs from the Diffie-Hellman Assumption","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Computer science; Branching (polymer chemistry); Diffie–Hellman key exchange; Theoretical computer science; Programming language; Parallel computing; Computer security; Public-key cryptography; Key exchange; Encryption","score_opus":0.016875847602112942,"score_gpt":0.24036655782663377,"score_spread":0.22349071022452083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395093918","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065632306,0.0026474092,0.3141104,0.008308632,0.0007724055,0.000075219774,0.00048691547,0.0005643914,0.6074024],"genre_scores_gemma":[0.81128633,0.0031702549,0.056712467,0.002112495,0.0011527331,0.00021751845,0.0006971227,0.0005902767,0.124060705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993686,0.00016567083,0.000023466844,0.00009273514,0.0002466559,0.00010288493],"domain_scores_gemma":[0.9983034,0.0010700169,0.000072787654,0.0002427975,0.00019570281,0.000115311916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884909,0.0006522155,0.00060443225,0.00086998224,0.0012798213,0.002925829,0.0010151762,0.0013154604,0.01184957],"category_scores_gemma":[0.0040283375,0.00039642304,0.0007298802,0.0012355484,0.003340628,0.00767792,0.0024547684,0.0064953184,0.001824763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005368452,0.0000037647958,0.000011181113,0.0000071182594,6.422644e-7,0.000010030249,0.00003825288,0.00023085596,0.00007903122,0.9970573,0.00067654357,0.0018800228],"study_design_scores_gemma":[0.0000025322695,0.0000014335172,0.000009406145,0.0000036583667,6.7253245e-7,0.00000908041,0.0000065058907,0.00072234444,0.00008457704,0.9970613,0.0020965044,0.000001960778],"about_ca_topic_score_codex":0.0010491767,"about_ca_topic_score_gemma":0.0006743248,"teacher_disagreement_score":0.01184957,"about_ca_system_score_codex":0.0021728291,"about_ca_system_score_gemma":0.0011425818,"threshold_uncertainty_score":0.039640784},"labels":[],"label_agreement":null},{"id":"W4395093967","doi":"10.1007/978-3-031-57725-3_12","title":"Rate-1 Fully Local Somewhere Extractable Hashing from DDH","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Hash function; Computer security","score_opus":0.01355304379525028,"score_gpt":0.23344386112954613,"score_spread":0.21989081733429586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395093967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031683348,0.003045029,0.9211716,0.000879697,0.0007662517,0.00043652774,0.0018890607,0.010460648,0.029667718],"genre_scores_gemma":[0.54288054,0.0015402016,0.38740224,0.0010425402,0.0007794642,0.0006748268,0.004491851,0.0014777785,0.059710573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982533,0.00023562007,0.00011555007,0.00024320661,0.0009287507,0.00022353507],"domain_scores_gemma":[0.99816006,0.00033179438,0.00008233386,0.0011920842,0.00017436096,0.000059386108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007397178,0.0008597964,0.0016168178,0.0008565345,0.00073438673,0.0015582289,0.0017903041,0.0010332922,0.014945414],"category_scores_gemma":[0.0034560876,0.0005314383,0.00071159506,0.0014194173,0.0009884222,0.0034745766,0.006080781,0.0018083474,0.008213344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010298259,0.00020387393,0.0008017914,0.00090951787,0.00009719887,0.00022500406,0.00033178733,0.026056247,0.03378355,0.23024204,0.047881063,0.6584381],"study_design_scores_gemma":[0.00034919876,0.0007501717,0.0012138436,0.00027899185,0.00016339167,0.0015755157,0.00019820395,0.23971574,0.08132636,0.57186574,0.10232254,0.00024026175],"about_ca_topic_score_codex":0.0003618575,"about_ca_topic_score_gemma":0.0005717185,"teacher_disagreement_score":0.014945414,"about_ca_system_score_codex":0.0008200981,"about_ca_system_score_gemma":0.0011814254,"threshold_uncertainty_score":0.04999739},"labels":[],"label_agreement":null},{"id":"W4395099386","doi":"10.1007/978-3-031-48679-1_7","title":"A Lower Bound on the Share Size of Leakage-Resilient Secret-Sharing Schemes","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Calgary","funders":"","keywords":"Secret sharing; Leakage (economics); Computer science; Computer security; Computer network; Cryptography; Economics","score_opus":0.08522619291068442,"score_gpt":0.29410665663809415,"score_spread":0.20888046372740973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16528958,0.007592354,0.6668099,0.016341088,0.0015306387,0.0010037019,0.003453908,0.0049999743,0.13297887],"genre_scores_gemma":[0.83622617,0.0040983967,0.12034923,0.0026354145,0.0015656938,0.0011047109,0.0018598995,0.0014651911,0.030695334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99153405,0.0018052731,0.00033204386,0.0014034056,0.0032773835,0.0016478683],"domain_scores_gemma":[0.9525567,0.032956462,0.0014698257,0.010457748,0.0015759878,0.0009832322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006274955,0.0031229835,0.0041452926,0.0016577715,0.0030777857,0.0063007628,0.0059526376,0.0045604627,0.019796195],"category_scores_gemma":[0.029815037,0.0017074164,0.0024756263,0.0035927847,0.004724464,0.019894622,0.008690183,0.008554588,0.0037924214],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049010804,0.00063271663,0.0011324658,0.0013264054,0.00035038617,0.0005803655,0.0007654525,0.15391941,0.053085048,0.57426745,0.042707797,0.16633151],"study_design_scores_gemma":[0.00029870795,0.00035751346,0.0006345232,0.00021809178,0.00023456436,0.00068346376,0.00012910436,0.2944186,0.019816583,0.6713368,0.011759443,0.00011256967],"about_ca_topic_score_codex":0.00063908333,"about_ca_topic_score_gemma":0.00075915636,"teacher_disagreement_score":0.019796195,"about_ca_system_score_codex":0.005354558,"about_ca_system_score_gemma":0.0038410602,"threshold_uncertainty_score":0.06622487},"labels":[],"label_agreement":null},{"id":"W4395959428","doi":"10.1007/978-3-031-58751-1_15","title":"Evaluating the Security of CRYSTALS-Dilithium in the Quantum Random Oracle Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dilithium; Random oracle; Computer science; Oracle; Quantum; Theoretical computer science; Computer security; Quantum mechanics; Software engineering; Physics; Encryption; Public-key cryptography","score_opus":0.040601552413976255,"score_gpt":0.31294021067523736,"score_spread":0.27233865826126114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395959428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6513947,0.0025835994,0.2461469,0.0112903835,0.00037869514,0.00018702581,0.00051668717,0.0006048548,0.08689702],"genre_scores_gemma":[0.9862866,0.00035100162,0.009286092,0.00015453434,0.00011247341,0.00003730363,0.000115956755,0.000068289664,0.003587707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936614,0.0034249355,0.0001625394,0.00037749344,0.0014058211,0.0009678068],"domain_scores_gemma":[0.97333413,0.021249626,0.0011399417,0.0023540582,0.00094520085,0.0009769873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008429155,0.000819148,0.0018023092,0.00119842,0.0013649741,0.005456254,0.0021489114,0.0028461516,0.005969806],"category_scores_gemma":[0.028499257,0.00042834095,0.0007884289,0.00094888033,0.0064481786,0.010904776,0.0045218286,0.0034429382,0.0006821582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007157676,0.00008562684,0.0008676,0.00010514699,0.00004305358,0.00010277651,0.00011795371,0.078997225,0.0010121829,0.909144,0.001739245,0.0070695058],"study_design_scores_gemma":[0.000050640272,0.00008364136,0.00022008925,0.0000310079,0.00001607319,0.00004637295,0.00009896651,0.35252908,0.0011558569,0.6450386,0.0007007932,0.000028971226],"about_ca_topic_score_codex":0.0024610606,"about_ca_topic_score_gemma":0.0015544705,"teacher_disagreement_score":0.008429155,"about_ca_system_score_codex":0.0036792972,"about_ca_system_score_gemma":0.0023489995,"threshold_uncertainty_score":0.044578135},"labels":[],"label_agreement":null},{"id":"W4395960800","doi":"10.1007/978-3-031-58751-1_10","title":"Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Oblivious transfer; Transfer (computing); Theoretical computer science; Parallel computing; Algorithm; Cryptography","score_opus":0.011098575829499536,"score_gpt":0.23300852091148277,"score_spread":0.22190994508198325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395960800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039738175,0.0006065305,0.9227287,0.0013472809,0.00028723796,0.00021697537,0.0002719058,0.0023095708,0.032493576],"genre_scores_gemma":[0.8548142,0.00044922493,0.11352946,0.00036351342,0.0002063524,0.0003275178,0.00021941373,0.0004981178,0.029592175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996958,0.00076626876,0.00014388403,0.00047041042,0.0009733577,0.0006880098],"domain_scores_gemma":[0.99625105,0.0016648982,0.00019745134,0.0015070661,0.00022877075,0.00015076474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018430225,0.0013117921,0.0017531192,0.0008978157,0.0014124674,0.0026296845,0.0022823014,0.0022794944,0.006285764],"category_scores_gemma":[0.005699283,0.00076837785,0.001042166,0.0010398404,0.0030885863,0.0062052542,0.0055195745,0.0033490416,0.0028323156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012610399,0.00016717546,0.0002914747,0.00029605033,0.00009709796,0.00023005906,0.0003481602,0.07858425,0.0160086,0.83594567,0.00864721,0.05812314],"study_design_scores_gemma":[0.0001519094,0.00017361107,0.00015117867,0.00006382283,0.000059683767,0.00033874804,0.000047888883,0.4228478,0.02263351,0.5474364,0.00601932,0.00007612021],"about_ca_topic_score_codex":0.00038827056,"about_ca_topic_score_gemma":0.0003565637,"teacher_disagreement_score":0.006285764,"about_ca_system_score_codex":0.0017470737,"about_ca_system_score_gemma":0.0021778375,"threshold_uncertainty_score":0.021027923},"labels":[],"label_agreement":null},{"id":"W4395961664","doi":"10.1007/978-3-031-58751-1_3","title":"Lower-Bounds on Public-Key Operations in PIR","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Computer security","score_opus":0.020453317320518742,"score_gpt":0.2557224155052344,"score_spread":0.23526909818471564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395961664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026760114,0.019680837,0.6343614,0.017493377,0.002272785,0.0005334443,0.0023588685,0.0027835565,0.2937556],"genre_scores_gemma":[0.6523254,0.026676787,0.19902179,0.006264694,0.009224082,0.0024187814,0.003968078,0.0038256468,0.096274815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9743171,0.0067025763,0.0012613961,0.0028333913,0.008744635,0.0061409916],"domain_scores_gemma":[0.9033282,0.07576334,0.0025426208,0.011176026,0.004969669,0.0022201608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0143676335,0.0066085556,0.0066032363,0.006838623,0.0060710735,0.020293752,0.011346764,0.0065752007,0.040636342],"category_scores_gemma":[0.06329077,0.0034180114,0.0048575234,0.011136665,0.009929244,0.04594501,0.014180783,0.022715377,0.013714049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00098492,0.00040201005,0.00048371276,0.000954761,0.000106143445,0.00012720717,0.00039950685,0.028821556,0.001617773,0.8729684,0.025746059,0.06738802],"study_design_scores_gemma":[0.000058211546,0.000069052934,0.00017464953,0.00021411166,0.00010617647,0.00015476589,0.00009129725,0.053293318,0.001186324,0.9377892,0.0068107354,0.00005212011],"about_ca_topic_score_codex":0.002010326,"about_ca_topic_score_gemma":0.0032484762,"teacher_disagreement_score":0.040636342,"about_ca_system_score_codex":0.011263481,"about_ca_system_score_gemma":0.007307294,"threshold_uncertainty_score":0.13594204},"labels":[],"label_agreement":null},{"id":"W4396535419","doi":"10.1109/tifs.2024.3394678","title":"Revocable and Privacy-Preserving Bilateral Access Control for Cloud Data Sharing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Computer security; Access control; Information privacy; Internet privacy; Data sharing; Operating system","score_opus":0.03604402686750368,"score_gpt":0.28956397093915315,"score_spread":0.25351994407164946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396535419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02618914,0.00032061985,0.96994656,0.00023425976,0.000056996934,0.00012890673,0.000067542256,0.00041145875,0.0026445857],"genre_scores_gemma":[0.9217819,0.00023428156,0.074708916,0.00017788372,0.0000636656,0.00014706224,0.00009851894,0.000040261442,0.0027475695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993775,0.0017477482,0.00044421628,0.0013144747,0.0019887679,0.00072979444],"domain_scores_gemma":[0.9960828,0.00092597737,0.0006656195,0.0014905693,0.00061551644,0.00021944758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031990223,0.0005602783,0.001055488,0.0005272314,0.0011419337,0.0018158944,0.002401652,0.0011384918,0.0019398088],"category_scores_gemma":[0.00590427,0.00031351094,0.0010216613,0.0007684174,0.0015067109,0.0049720774,0.0033165766,0.0017630275,0.00047859552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014817914,0.00033138096,0.0024769113,0.0004788103,0.00025828835,0.00074958126,0.0014548129,0.16085999,0.06925638,0.5010208,0.0038863963,0.25774488],"study_design_scores_gemma":[0.00015885015,0.00028460973,0.00044714415,0.000035083645,0.00007298961,0.00073146506,0.00019613712,0.83818805,0.02108369,0.12619664,0.012478701,0.00012662345],"about_ca_topic_score_codex":0.0014566365,"about_ca_topic_score_gemma":0.0008510525,"teacher_disagreement_score":0.0031990223,"about_ca_system_score_codex":0.0011068275,"about_ca_system_score_gemma":0.0015409323,"threshold_uncertainty_score":0.016918242},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4396542922","doi":"10.1109/icicce61720.2023.00008","title":"Privacy-Preserving, Low-Storage, and High-Quality Image Processing in IoT and Clouds","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Cloud computing; Internet of Things; Cloud storage; Computer security; Quality (philosophy); Information privacy; Operating system","score_opus":0.02091445790298512,"score_gpt":0.29356964267430824,"score_spread":0.2726551847713231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396542922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1800256,0.0071696267,0.79888606,0.0018084885,0.00032425555,0.0001261666,0.00020327634,0.00094756344,0.010508987],"genre_scores_gemma":[0.9238604,0.0018673072,0.07093276,0.0001766993,0.0001275838,0.00002950909,0.00011350807,0.00004640245,0.0028457968],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989786,0.00013760827,0.00005428053,0.00013005994,0.00048672044,0.00021270035],"domain_scores_gemma":[0.9989955,0.0001664696,0.00018425223,0.0003871365,0.00021166768,0.000055020955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006916641,0.00034521948,0.00046183274,0.0004256437,0.0009204728,0.0012466825,0.00094109,0.0005338849,0.001090622],"category_scores_gemma":[0.0011229385,0.00020412217,0.0004747316,0.00116795,0.0009412747,0.0032101565,0.0011417397,0.0009127824,0.0004042415],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016731649,0.00031214717,0.004934065,0.00096315215,0.00015767699,0.0017127554,0.0005453255,0.07597792,0.25055847,0.31655285,0.015838437,0.33077404],"study_design_scores_gemma":[0.000073791074,0.00028323656,0.0029021862,0.000104946004,0.000099797435,0.0021579994,0.00054725306,0.6050263,0.25992984,0.09998815,0.028774643,0.00011188076],"about_ca_topic_score_codex":0.0020366674,"about_ca_topic_score_gemma":0.0012290773,"teacher_disagreement_score":0.0020366674,"about_ca_system_score_codex":0.0008398684,"about_ca_system_score_gemma":0.00095031795,"threshold_uncertainty_score":0.0060937405},"labels":[],"label_agreement":null},{"id":"W4396575008","doi":"10.1109/tifs.2024.3396384","title":"Performance Enhanced Secure Spatial Keyword Similarity Query With Arbitrary Spatial Ranges","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Range query (database); Encryption; Overhead (engineering); Spatial query; Scheme (mathematics); Data mining; Similarity (geometry); Web search query; Theoretical computer science; Information retrieval; Web query classification; Computer security; Search engine; Image (mathematics); Artificial intelligence","score_opus":0.005573976300173532,"score_gpt":0.19731588815720846,"score_spread":0.19174191185703493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396575008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51086086,0.0026689789,0.46962813,0.00110024,0.00019814335,0.00041951725,0.00039921296,0.0034758598,0.011248996],"genre_scores_gemma":[0.9712676,0.000258535,0.027070025,0.00008194444,0.000032733242,0.00004610808,0.00015326943,0.00002592615,0.0010638138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634284,0.00061046425,0.00035517494,0.0003774572,0.0016633393,0.00065080513],"domain_scores_gemma":[0.99547064,0.0015415538,0.00048522456,0.0015357533,0.000735579,0.00023124156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020704258,0.00046379794,0.0014023139,0.00069206604,0.00093998056,0.0013631599,0.0011767396,0.00092690263,0.0024810007],"category_scores_gemma":[0.005689763,0.00022907386,0.0005076791,0.0012143534,0.00088647194,0.0049662967,0.0031731925,0.0009291295,0.0005951861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008751301,0.0011178473,0.012714212,0.00093833485,0.00034165158,0.0017503833,0.0013933064,0.25366476,0.2728851,0.09840681,0.011013387,0.33702287],"study_design_scores_gemma":[0.00027636637,0.00071427156,0.0011350104,0.0000184854,0.00007188713,0.0015425714,0.0002883776,0.9145673,0.0657971,0.011601481,0.0038973142,0.00008977986],"about_ca_topic_score_codex":0.0021017713,"about_ca_topic_score_gemma":0.001100068,"teacher_disagreement_score":0.0024810007,"about_ca_system_score_codex":0.0011684769,"about_ca_system_score_gemma":0.0018233523,"threshold_uncertainty_score":0.010949612},"labels":[],"label_agreement":null},{"id":"W4396758636","doi":"10.1145/3589334.3645658","title":"IDEA-DAC: Integrity-Driven Editing for Accountable Decentralized Anonymous Credentials via ZK-JSON","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"JSON; Computer science; Data integrity; Operating system; World Wide Web; Computer security","score_opus":0.024416557425106893,"score_gpt":0.30095869114661955,"score_spread":0.27654213372151265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396758636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018265158,0.0001896583,0.9299017,0.00048892736,0.0005385279,0.00036856197,0.00059190806,0.03113737,0.018518131],"genre_scores_gemma":[0.729664,0.00021015151,0.22432111,0.00037472078,0.00024499407,0.0002659157,0.0011474156,0.0033056254,0.040466025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949692,0.0008909191,0.0003001682,0.00072161626,0.002278079,0.0008400117],"domain_scores_gemma":[0.9907768,0.0016839933,0.00036090345,0.0055883857,0.0009911115,0.00059886504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032885864,0.0007611441,0.0012461216,0.0012087759,0.0016708497,0.004275061,0.0028075112,0.0014757519,0.021675143],"category_scores_gemma":[0.014135944,0.00054128806,0.0008886513,0.0011674227,0.0022294077,0.0060418984,0.008028147,0.003126896,0.007570277],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002196831,0.0005703629,0.0014380409,0.00038754148,0.00011389083,0.0005555597,0.0008624444,0.027511712,0.019282963,0.5285391,0.051401835,0.36713976],"study_design_scores_gemma":[0.00033443555,0.00024302294,0.00051461085,0.000106802654,0.000105394,0.00059501943,0.00021476297,0.41102895,0.053256612,0.44635022,0.08706519,0.00018488616],"about_ca_topic_score_codex":0.0011851619,"about_ca_topic_score_gemma":0.0018506566,"teacher_disagreement_score":0.021675143,"about_ca_system_score_codex":0.0014506688,"about_ca_system_score_gemma":0.0030750933,"threshold_uncertainty_score":0.07251054},"labels":[],"label_agreement":null},{"id":"W4396853406","doi":"10.1109/fnwf58287.2023.10520409","title":"INGR Roadmap Security and Privacy Chapter","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Rogers Communications (Canada); Brock University; Shared Services Canada","funders":"","keywords":"Computer science; Internet privacy; Computer security; Information privacy","score_opus":0.015714590013838944,"score_gpt":0.24168563600108436,"score_spread":0.22597104598724543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396853406","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008153639,0.107646026,0.014033601,0.09634213,0.01820661,0.00020751909,0.0007954227,0.0011226067,0.76083064],"genre_scores_gemma":[0.026701668,0.17804106,0.020267945,0.031267136,0.010094213,0.00041637043,0.0027824792,0.00074613135,0.729683],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969121,0.00077078113,0.00013318342,0.00042329764,0.0013319427,0.0004285813],"domain_scores_gemma":[0.9966304,0.0010956213,0.00008200512,0.0004900325,0.0012911464,0.0004107966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045170877,0.0012296465,0.0007091907,0.0019287987,0.0024071122,0.0075105424,0.0019470656,0.008448131,0.090215884],"category_scores_gemma":[0.0051468555,0.00049597543,0.0007687089,0.0018918872,0.0025714708,0.010743066,0.003883272,0.007155163,0.05153336],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023750437,0.000048358754,0.00009613095,0.00033766805,0.0000071027566,0.000076435856,0.00019738218,0.0004518806,0.000308526,0.35136783,0.47882047,0.16826446],"study_design_scores_gemma":[0.0000016379875,0.000012395175,0.000050674204,0.0002868656,0.0000023706812,0.00006397864,0.0000812847,0.00013703517,0.00008809666,0.02430789,0.9749628,0.000005100761],"about_ca_topic_score_codex":0.005827375,"about_ca_topic_score_gemma":0.0039306753,"teacher_disagreement_score":0.090215884,"about_ca_system_score_codex":0.0039370246,"about_ca_system_score_gemma":0.0066306647,"threshold_uncertainty_score":0.30180222},"labels":[],"label_agreement":null},{"id":"W4396965857","doi":"10.1007/978-1-0716-3989-4_4","title":"Secure Federated Boolean Count Queries Using Fully-Homomorphic Cryptography","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Cryptography; Theoretical computer science; Computer security; Encryption","score_opus":0.01711794278039755,"score_gpt":0.24309337968092218,"score_spread":0.22597543690052463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396965857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13734633,0.0013509695,0.8132005,0.001844629,0.00042040934,0.00039689423,0.0019206569,0.008092682,0.03542695],"genre_scores_gemma":[0.8586436,0.00041383534,0.12226804,0.00058172154,0.00025017242,0.00035571557,0.0014102992,0.00038600247,0.015690718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518824,0.00085697725,0.0003367156,0.00067227875,0.0020880317,0.00085779856],"domain_scores_gemma":[0.99524873,0.001561248,0.00030312102,0.0021881391,0.0005618338,0.0001369228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002109693,0.00090199703,0.0021205551,0.0013958631,0.001299039,0.004580893,0.0019772714,0.0015956106,0.0065224837],"category_scores_gemma":[0.0055211163,0.0005844223,0.0009740192,0.0023494777,0.0018118444,0.010897839,0.0063864174,0.0024935235,0.002528077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022531315,0.00052443333,0.0013695348,0.00043900282,0.00015795346,0.00044022343,0.00047360308,0.023565566,0.027064357,0.6689505,0.021530205,0.25323153],"study_design_scores_gemma":[0.00029849343,0.0002702341,0.000560156,0.000108870125,0.0001046375,0.000980914,0.00018349869,0.23250917,0.049056105,0.70010334,0.015727285,0.00009739587],"about_ca_topic_score_codex":0.00039898558,"about_ca_topic_score_gemma":0.00039877035,"teacher_disagreement_score":0.0065224837,"about_ca_system_score_codex":0.0024207998,"about_ca_system_score_gemma":0.0019352933,"threshold_uncertainty_score":0.02181983},"labels":[],"label_agreement":null},{"id":"W4399358836","doi":"10.1016/j.tcs.2024.114678","title":"Group encryption: Full dynamicity, message filtering and code-based instantiation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Key Research and Development Program of China; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Xi’an Jiaotong-Liverpool University; Shanghai Jiao Tong University; Ministry of Education - Singapore; University of Wollongong; Nanyang Technological University; University of Calgary","keywords":"Encryption; Computer science; Ciphertext; Theoretical computer science; Substring; Code (set theory); Group (periodic table); Group signature; Computer security; Programming language; Public-key cryptography; Data structure","score_opus":0.008000793048411788,"score_gpt":0.2405117744760298,"score_spread":0.23251098142761803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399358836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045002032,0.0004541242,0.9401731,0.0011718482,0.00013046262,0.00015758933,0.00020452532,0.0017856659,0.010920596],"genre_scores_gemma":[0.78000724,0.0005288163,0.20528708,0.00052824145,0.0002746264,0.00021644517,0.00046306296,0.00067302986,0.012021574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499774,0.0012037973,0.00033037533,0.0009262442,0.0015109897,0.001030895],"domain_scores_gemma":[0.989047,0.002264917,0.0005640422,0.0067744963,0.0009682677,0.00038132514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032386635,0.0008153544,0.0016176616,0.0014521948,0.0017147027,0.0041365228,0.0020313621,0.002206992,0.0030180914],"category_scores_gemma":[0.010501486,0.0007617689,0.0013656158,0.0018520233,0.0033252256,0.010187144,0.0055951625,0.003137986,0.0015470181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052492257,0.00016621745,0.0009631756,0.00011469108,0.000044733788,0.0001872367,0.00040680732,0.02149095,0.009049082,0.87914073,0.0046614055,0.08324995],"study_design_scores_gemma":[0.00008018676,0.00012027704,0.00033787778,0.000057262747,0.00007362457,0.00053155434,0.00007421454,0.19208084,0.015309902,0.78032506,0.010945565,0.00006370819],"about_ca_topic_score_codex":0.0008529494,"about_ca_topic_score_gemma":0.0006999976,"teacher_disagreement_score":0.0041365228,"about_ca_system_score_codex":0.0018359562,"about_ca_system_score_gemma":0.002484742,"threshold_uncertainty_score":0.017127872},"labels":[],"label_agreement":null},{"id":"W4399573658","doi":"10.1109/tifs.2024.3413630","title":"Secure Similarity Queries Over Vertically Distributed Data via TEE-Enhanced Cloud Computing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Similarity (geometry); Distributed database; Distributed computing; Information retrieval; Artificial intelligence; Operating system","score_opus":0.012001385470473276,"score_gpt":0.24599303702627817,"score_spread":0.2339916515558049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399573658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074272655,0.00024896633,0.9207111,0.00052318483,0.000047728783,0.00020446374,0.000112487505,0.0006745776,0.0032048025],"genre_scores_gemma":[0.89388174,0.00013886362,0.10431631,0.00011868361,0.000038538903,0.000087858425,0.00012478129,0.000037122,0.001256112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954184,0.0010440886,0.000296626,0.00052092655,0.0021281985,0.00059171196],"domain_scores_gemma":[0.99421084,0.0013957267,0.0007217908,0.0026224968,0.0008119353,0.00023717637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023849811,0.0004109874,0.00087148027,0.00064774044,0.0011083574,0.0017909092,0.0013690783,0.0008349753,0.0012751968],"category_scores_gemma":[0.0075741936,0.00028617174,0.0006190107,0.0013601319,0.0016049966,0.004363743,0.0046409625,0.0014506909,0.00045919121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016351312,0.0004841874,0.0045250347,0.00024906412,0.00011598615,0.0008662163,0.001082756,0.34371153,0.09969799,0.33396432,0.005406551,0.20826118],"study_design_scores_gemma":[0.00007559083,0.0001825552,0.00038324326,0.000011982835,0.000016191543,0.000353006,0.00015547477,0.9239688,0.026582973,0.04446464,0.0037717442,0.00003383857],"about_ca_topic_score_codex":0.0013988301,"about_ca_topic_score_gemma":0.0009897895,"teacher_disagreement_score":0.0023849811,"about_ca_system_score_codex":0.0012667002,"about_ca_system_score_gemma":0.0019724418,"threshold_uncertainty_score":0.012613118},"labels":[],"label_agreement":null},{"id":"W4399971959","doi":"10.29012/jpc.873","title":"Private Query Release via the Johnson-Lindenstrauss Transform","year":2024,"lang":"en","type":"article","venue":"Journal of Privacy and Confidentiality","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.01374124547713643,"score_gpt":0.26278040313545475,"score_spread":0.24903915765831833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399971959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024387008,0.00021008079,0.96931386,0.00090826896,0.00006557672,0.00016664767,0.00029871543,0.0009827643,0.0036670463],"genre_scores_gemma":[0.70673084,0.00035385974,0.28185245,0.0009143425,0.0003032079,0.0010167265,0.0005970771,0.00033404375,0.007897531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98106223,0.0051809144,0.0010494654,0.0023753275,0.008260173,0.002071924],"domain_scores_gemma":[0.9744324,0.013546882,0.0016149174,0.008027429,0.001662851,0.0007155452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010180314,0.0012722828,0.0030883981,0.0014319555,0.0015171148,0.005088515,0.0042569875,0.0027006932,0.0038238696],"category_scores_gemma":[0.037656162,0.0010008448,0.002442872,0.0024639047,0.004035691,0.011032352,0.010245014,0.005098483,0.001641647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011754666,0.00035228315,0.0013480847,0.0001959751,0.00015964618,0.00031331833,0.0006821481,0.111514345,0.023554059,0.7783593,0.005748011,0.07659735],"study_design_scores_gemma":[0.00019924116,0.00025150485,0.0003324595,0.000024273813,0.00004548554,0.00025573702,0.00008973585,0.60767335,0.0133479,0.3744072,0.003284164,0.00008892042],"about_ca_topic_score_codex":0.00075316796,"about_ca_topic_score_gemma":0.00051972555,"teacher_disagreement_score":0.010180314,"about_ca_system_score_codex":0.0030279963,"about_ca_system_score_gemma":0.0029461193,"threshold_uncertainty_score":0.053839266},"labels":[],"label_agreement":null},{"id":"W4400046408","doi":"10.55496/dcmq1559","title":"Of Square Pegs and Round Holes: Towards a New Paradigm of Database Protection","year":2008,"lang":"en","type":"article","venue":"Indian Journal of Law and Technology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Square (algebra); Database; Computer science; Geometry; Mathematics","score_opus":0.023009142162979595,"score_gpt":0.24142932785930907,"score_spread":0.21842018569632948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400046408","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010688491,0.003953714,0.7652575,0.05033274,0.0012011755,0.00024557972,0.00012898375,0.0005025709,0.16768925],"genre_scores_gemma":[0.5152584,0.006370107,0.39235273,0.015610232,0.003339587,0.0012047924,0.00020118967,0.00070118275,0.06496181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9814238,0.008010357,0.0011195523,0.00305146,0.0052510286,0.0011437673],"domain_scores_gemma":[0.9623939,0.017338408,0.0018681806,0.0148634305,0.0024033345,0.0011328339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022115413,0.0007460987,0.0016824228,0.00297997,0.006756257,0.022086604,0.005535377,0.012058322,0.008812741],"category_scores_gemma":[0.040632892,0.0013676604,0.0021428454,0.0029702657,0.056111276,0.05560316,0.014552966,0.01217704,0.0025468937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067229385,0.0000043548275,0.000025285099,0.000010906486,0.0000013381353,0.000019280076,0.00032450567,0.00017714959,0.00004128224,0.9952159,0.00064931595,0.003523872],"study_design_scores_gemma":[0.000015601308,0.000017567305,0.00002445118,0.0000650951,0.0000046136647,0.00009063972,0.00022565183,0.0014728318,0.00021769876,0.955915,0.041936193,0.000014671442],"about_ca_topic_score_codex":0.002223078,"about_ca_topic_score_gemma":0.0011191741,"teacher_disagreement_score":0.022115413,"about_ca_system_score_codex":0.0043765153,"about_ca_system_score_gemma":0.005308669,"threshold_uncertainty_score":0.11695886},"labels":[],"label_agreement":null},{"id":"W4400066380","doi":"10.1016/j.jisa.2024.103823","title":"Statistical privacy protection for secure data access control in cloud","year":2024,"lang":"en","type":"article","venue":"Journal of Information Security and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; MacEwan University; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Anonymity; Computer security; Access control; Encryption; Cloud computing; Collusion; Service provider; Information privacy; Plaintext; Internet privacy; Service (business); Business","score_opus":0.02879603709366838,"score_gpt":0.3217090203671873,"score_spread":0.2929129832735189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400066380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029158365,0.0007053512,0.9631415,0.0012383845,0.00009283097,0.00015096577,0.0001636583,0.00046586798,0.0048830374],"genre_scores_gemma":[0.9115121,0.0007210099,0.08489335,0.00034360625,0.00019733867,0.00024491316,0.00015461278,0.000052451807,0.0018806946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98507696,0.004656387,0.0010838909,0.0015220704,0.006423731,0.0012370127],"domain_scores_gemma":[0.9852069,0.0053902823,0.0017683319,0.005719021,0.0015365856,0.00037894674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006087358,0.00063282775,0.0011654105,0.0012811793,0.0019000571,0.0033615688,0.0020765816,0.0014220718,0.0014330578],"category_scores_gemma":[0.014194594,0.00059171993,0.0015154277,0.0027635705,0.0037363076,0.006460603,0.0037990387,0.0027083328,0.0006426944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004957168,0.00016121219,0.0022703134,0.0002701813,0.00011772926,0.0004283105,0.0006609763,0.08362935,0.017500775,0.8241425,0.0034640506,0.06685881],"study_design_scores_gemma":[0.00007898098,0.00020911009,0.000696936,0.00006879639,0.00006911494,0.00067759294,0.00018538818,0.61184824,0.017606756,0.35341603,0.0150689315,0.00007418997],"about_ca_topic_score_codex":0.00092157675,"about_ca_topic_score_gemma":0.00050087937,"teacher_disagreement_score":0.006087358,"about_ca_system_score_codex":0.0029683812,"about_ca_system_score_gemma":0.004461852,"threshold_uncertainty_score":0.032193422},"labels":[],"label_agreement":null},{"id":"W4400119981","doi":"10.1145/3634737.3637641","title":"ALLOSAUR: Accumulator with Low-Latency Oblivious Sublinear Anonymous credential Updates with Revocations","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Clarendon Fund","keywords":"Accumulator (cryptography); Computer science; Credential; Sublinear function; Latency (audio); Computer network; Mathematics; Algorithm; Telecommunications; Combinatorics","score_opus":0.005661986153565929,"score_gpt":0.22617645750405138,"score_spread":0.22051447135048546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400119981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031870514,0.0007375977,0.9394534,0.00042632796,0.00026448723,0.0004774856,0.00027500666,0.01683146,0.009663618],"genre_scores_gemma":[0.6319728,0.0003058281,0.35154185,0.00048346806,0.00018460522,0.0005381212,0.00044492085,0.0008094207,0.013719004],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619174,0.0009775226,0.0003118306,0.0006007958,0.0013811988,0.0005368093],"domain_scores_gemma":[0.9952093,0.0012607508,0.00044802885,0.0023319032,0.00042911433,0.0003209561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024803,0.0009030448,0.0015979505,0.0014912254,0.0014174532,0.002939637,0.0036571352,0.0013818226,0.008867671],"category_scores_gemma":[0.009832112,0.0006483417,0.0009248723,0.0015300754,0.0019562151,0.0069830096,0.006706213,0.0020403448,0.0039840294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003562309,0.0006917069,0.0014447893,0.0006317364,0.00017749923,0.0007843166,0.0006222119,0.10987665,0.042365924,0.34966487,0.020587754,0.4695903],"study_design_scores_gemma":[0.00030424938,0.00063284807,0.0002651451,0.000108731925,0.000072359,0.00085501047,0.00011568141,0.7491569,0.05640604,0.15463783,0.03728469,0.00016040569],"about_ca_topic_score_codex":0.0006382743,"about_ca_topic_score_gemma":0.0008013418,"teacher_disagreement_score":0.008867671,"about_ca_system_score_codex":0.0010417402,"about_ca_system_score_gemma":0.0026499007,"threshold_uncertainty_score":0.02966535},"labels":[],"label_agreement":null},{"id":"W4400224674","doi":"10.1007/978-3-031-64381-1_6","title":"Efficient Oblivious Transfer for One-Sided Active Adaptive Adversaries","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Oblivious transfer; Transfer (computing); Theoretical computer science; Algorithm; Cryptography; Parallel computing","score_opus":0.021218451101663625,"score_gpt":0.24139921630755481,"score_spread":0.2201807652058912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400224674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0365612,0.00044777946,0.939058,0.00060906884,0.00014350007,0.00014489214,0.00014006498,0.0012596722,0.021635804],"genre_scores_gemma":[0.885037,0.00044572045,0.08178426,0.00024156975,0.00014085547,0.00026155513,0.00020132119,0.0002826837,0.031604968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838614,0.00039066494,0.000071066475,0.0002378424,0.0005527997,0.00036145025],"domain_scores_gemma":[0.99659663,0.0018759186,0.00015190673,0.0011331383,0.00016734748,0.00007496864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011442221,0.0008322785,0.0010739511,0.00054677034,0.0008421314,0.0019551672,0.0017984419,0.0013758248,0.0058555063],"category_scores_gemma":[0.0038144684,0.00059015135,0.00072151946,0.00072975014,0.0021455768,0.0049304254,0.0042133424,0.0034264666,0.0016854063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008659026,0.00020970244,0.00027319606,0.0002533001,0.00007438792,0.00017820652,0.00032338858,0.14813931,0.028550485,0.6861086,0.008737703,0.1262858],"study_design_scores_gemma":[0.000059279355,0.000090433496,0.00011794955,0.000029963288,0.000025120285,0.0001413874,0.000033233748,0.5676428,0.012289603,0.41624698,0.0032976111,0.000025594447],"about_ca_topic_score_codex":0.00031719444,"about_ca_topic_score_gemma":0.00032117893,"teacher_disagreement_score":0.0058555063,"about_ca_system_score_codex":0.0012218759,"about_ca_system_score_gemma":0.0010132036,"threshold_uncertainty_score":0.01958859},"labels":[],"label_agreement":null},{"id":"W4400505604","doi":"10.1007/s12243-024-01052-2","title":"A revocable attribute-based access control with non-monotonic access structure","year":2024,"lang":"en","type":"article","venue":"Annals of Telecommunications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Access control; Access structure; Monotonic function; Computer science; Computer access control; Mathematics; Computer security; Secret sharing; Cryptography","score_opus":0.05536424829678215,"score_gpt":0.36110725499152274,"score_spread":0.3057430066947406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400505604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035690103,0.00058128714,0.9549753,0.00046893003,0.00016535778,0.00025850168,0.00025833037,0.0034239718,0.0041783066],"genre_scores_gemma":[0.70658135,0.00053704187,0.2809872,0.0004731655,0.00024695575,0.00038803992,0.00041441046,0.00030806358,0.010063761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99074894,0.0018006313,0.0009895293,0.0017659202,0.0036971546,0.0009977972],"domain_scores_gemma":[0.989514,0.0027166565,0.0007548755,0.004580707,0.0019265331,0.00050730526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005749434,0.0007227589,0.0019456334,0.0016397218,0.0015157156,0.0052861334,0.0037427081,0.001811798,0.0032626188],"category_scores_gemma":[0.009647889,0.00081527,0.0017075569,0.002066345,0.0040956344,0.007897804,0.004909474,0.0042815716,0.0013983599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002260563,0.0004623039,0.0010122932,0.0004671168,0.00018560875,0.00060999766,0.0008864586,0.032138605,0.054656804,0.75032365,0.005046163,0.15195046],"study_design_scores_gemma":[0.0005294337,0.0010921935,0.0005246773,0.00014315364,0.00035810078,0.0015662521,0.00019204823,0.5152176,0.05791433,0.39794394,0.024188308,0.0003299495],"about_ca_topic_score_codex":0.0018899487,"about_ca_topic_score_gemma":0.00094760547,"teacher_disagreement_score":0.005749434,"about_ca_system_score_codex":0.0017870978,"about_ca_system_score_gemma":0.0035747886,"threshold_uncertainty_score":0.030406296},"labels":[],"label_agreement":null},{"id":"W4400692708","doi":"10.1007/s12095-024-00723-0","title":"Uni/multi variate polynomial embeddings for zkSNARKs","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random variate; Polynomial; Mathematics; Computer science; Algebra over a field; Pure mathematics; Statistics; Mathematical analysis; Random variable","score_opus":0.034453706021442834,"score_gpt":0.31400243489403484,"score_spread":0.279548728872592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400692708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24986754,0.00031920595,0.72466266,0.0010619984,0.00008346098,0.00033807565,0.0005563203,0.0020416745,0.021069057],"genre_scores_gemma":[0.8735296,0.00023619394,0.11891851,0.00018823161,0.000052332973,0.00014230829,0.0005126346,0.0003247723,0.0060954103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968599,0.0007753751,0.00023219142,0.00047537565,0.0012030784,0.0004540615],"domain_scores_gemma":[0.9933348,0.0038887467,0.00059726904,0.0014546167,0.0005105902,0.00021392686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018497312,0.0003561411,0.0005179605,0.0007768276,0.0009066923,0.0028438885,0.0009941033,0.0008093937,0.01123058],"category_scores_gemma":[0.009375467,0.00034737214,0.0012568496,0.0007407015,0.001994798,0.00660263,0.002903706,0.0027281942,0.0013220154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043731736,0.00009842489,0.000933857,0.00028620273,0.000025137691,0.00019236615,0.0004202258,0.035928056,0.0076030795,0.91439706,0.001494501,0.03818381],"study_design_scores_gemma":[0.00009203312,0.00021158082,0.00055108086,0.00008415285,0.00006682992,0.0002566332,0.0001980441,0.17085254,0.033220615,0.7835394,0.0108631,0.0000640167],"about_ca_topic_score_codex":0.0010026672,"about_ca_topic_score_gemma":0.0011368797,"teacher_disagreement_score":0.01123058,"about_ca_system_score_codex":0.0025410883,"about_ca_system_score_gemma":0.0017324729,"threshold_uncertainty_score":0.03757006},"labels":[],"label_agreement":null},{"id":"W4400910433","doi":"10.1109/icde60146.2024.00444","title":"Secure Normal Form: Mediation Among Cross Cryptographic Leakages in Encrypted Databases","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Computer science; Cryptography; Encryption; Mediation; Cryptographic primitive; Database; Computer security; Cryptographic protocol; Political science","score_opus":0.013238243708088572,"score_gpt":0.2764637752106046,"score_spread":0.26322553150251604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400910433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05325375,0.00029970237,0.93829817,0.00082112965,0.0000680037,0.00032503976,0.00017294484,0.0032332204,0.003528127],"genre_scores_gemma":[0.7543105,0.00048527218,0.23693286,0.00047543392,0.000114451366,0.0002478556,0.00044859012,0.00068966154,0.0062953774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9846746,0.004668769,0.0023022867,0.0017523888,0.005358542,0.0012434475],"domain_scores_gemma":[0.97357947,0.004410178,0.001980572,0.017168742,0.0024342502,0.00042679778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010436268,0.0007768024,0.0013182434,0.0013407667,0.0017069156,0.0068783686,0.002628942,0.0011598753,0.0034821897],"category_scores_gemma":[0.026943447,0.0008492436,0.0011955559,0.0019846607,0.0045882477,0.02386868,0.008532644,0.002592942,0.0011890845],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014420811,0.000509931,0.0089609865,0.00032493458,0.00015133452,0.00089775724,0.0032190927,0.031097282,0.025147019,0.6423486,0.0066101556,0.27929083],"study_design_scores_gemma":[0.00016103605,0.0004089287,0.0013029699,0.00011484257,0.00015098981,0.0023811995,0.0008843328,0.28741196,0.10089229,0.5700621,0.036037505,0.00019185578],"about_ca_topic_score_codex":0.0012077063,"about_ca_topic_score_gemma":0.0008742323,"teacher_disagreement_score":0.010436268,"about_ca_system_score_codex":0.0020928204,"about_ca_system_score_gemma":0.002783874,"threshold_uncertainty_score":0.055192888},"labels":[],"label_agreement":null},{"id":"W4401024599","doi":"10.24963/ijcai.2024/643","title":"DUQ: Dual Uncertainty Quantification for Text-Video Retrieval","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Granularity; Detector; Vulnerability (computing); Computer science; Code (set theory); Computer security; Telecommunications; Programming language","score_opus":0.028264264348632308,"score_gpt":0.2910528206028006,"score_spread":0.26278855625416825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401024599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059805755,0.0006241791,0.9914868,0.00018637184,0.00002805426,0.00006828777,0.00014237377,0.00051247247,0.00097081816],"genre_scores_gemma":[0.6496095,0.00095728337,0.3430683,0.0004916266,0.00023953913,0.00037463004,0.0009198188,0.00022297117,0.004116396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721116,0.0006317826,0.00018912698,0.00053144345,0.0012373117,0.00019925293],"domain_scores_gemma":[0.9968899,0.0016198835,0.0003988597,0.00042550612,0.00055210263,0.00011379627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028420691,0.00108445,0.0013317056,0.0018787332,0.0005487433,0.0018901223,0.0024687238,0.001258746,0.002151239],"category_scores_gemma":[0.0115752295,0.0004966638,0.00090524246,0.0017297701,0.0011096194,0.0050289147,0.0033830197,0.0016769017,0.00062196224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042736394,0.00017511312,0.0020354493,0.0003692028,0.00013817826,0.0001950397,0.00030915995,0.47687522,0.016748812,0.07614628,0.0072286166,0.4193516],"study_design_scores_gemma":[0.000009701904,0.000046815694,0.00019860527,0.000010427004,0.000014956746,0.000050589577,0.000017762628,0.9784776,0.0026694187,0.016875245,0.0016089077,0.00001992217],"about_ca_topic_score_codex":0.0046312497,"about_ca_topic_score_gemma":0.0030087752,"teacher_disagreement_score":0.0046312497,"about_ca_system_score_codex":0.0021961639,"about_ca_system_score_gemma":0.0013696972,"threshold_uncertainty_score":0.015934348},"labels":[],"label_agreement":null},{"id":"W4401602366","doi":"10.1007/978-3-031-68376-3_3","title":"Aggregating Falcon Signatures with LaBRADOR","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Falcon; Computer science; Programming language","score_opus":0.00974100736351193,"score_gpt":0.22804665023501147,"score_spread":0.21830564287149953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401602366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068802975,0.0010943826,0.84823644,0.0015022104,0.0010492291,0.00042491,0.0011842215,0.028552294,0.04915338],"genre_scores_gemma":[0.6391509,0.00039758757,0.31640616,0.0010642532,0.00055539305,0.0003318153,0.0029805903,0.0021788713,0.036934353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912737,0.0021969106,0.0005559827,0.0012031208,0.0033283394,0.0014419485],"domain_scores_gemma":[0.98904735,0.0013100515,0.00044204417,0.007535915,0.0014707885,0.00019398723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036171027,0.0014000136,0.002652493,0.0023350604,0.0017928317,0.0043833246,0.0020140968,0.0016022582,0.014363388],"category_scores_gemma":[0.009170416,0.00081242004,0.0013795596,0.003262563,0.0015285537,0.0070138276,0.007369449,0.0017959954,0.008645048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025415188,0.000434338,0.0027711885,0.0003330109,0.00030975146,0.0004412039,0.00044668064,0.025528796,0.019775415,0.16234435,0.053219866,0.73185384],"study_design_scores_gemma":[0.00023544212,0.00056576636,0.0009858402,0.00014940284,0.00023582368,0.00095471804,0.0005010053,0.31063414,0.10456241,0.4874961,0.09348091,0.00019842348],"about_ca_topic_score_codex":0.000925862,"about_ca_topic_score_gemma":0.0016928586,"teacher_disagreement_score":0.014363388,"about_ca_system_score_codex":0.0015210487,"about_ca_system_score_gemma":0.0021502594,"threshold_uncertainty_score":0.048050284},"labels":[],"label_agreement":null},{"id":"W4401685062","doi":"10.1016/j.jisa.2024.103861","title":"Secure similar patients query with homomorphically evaluated thresholds","year":2024,"lang":"en","type":"article","venue":"Journal of Information Security and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Medicine; Computer science; Mathematics","score_opus":0.0039706818323746364,"score_gpt":0.21630091827503883,"score_spread":0.2123302364426642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401685062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19398364,0.00073064317,0.7843538,0.0023613079,0.0002619736,0.00079461717,0.0012721418,0.0020993524,0.014142563],"genre_scores_gemma":[0.9536637,0.00014594982,0.040351514,0.00035191255,0.000079198064,0.00023197893,0.0004263329,0.00006621009,0.0046831705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99178183,0.0019667423,0.0008052389,0.00123509,0.0028756342,0.0013354074],"domain_scores_gemma":[0.9908585,0.0028189817,0.00093037303,0.004248019,0.0008022138,0.0003418536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038653165,0.000522824,0.0013606967,0.0007990257,0.0012151443,0.0030194132,0.0017560851,0.0018460319,0.0041084853],"category_scores_gemma":[0.009529648,0.00045051525,0.0010312948,0.001230616,0.0018909016,0.006729163,0.006166472,0.0021697062,0.0015748566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0059807748,0.0008236629,0.006323346,0.0005804803,0.0004185914,0.0031559207,0.0029014044,0.07590551,0.07725793,0.61956453,0.014061866,0.193026],"study_design_scores_gemma":[0.0008031388,0.0009750412,0.0021967664,0.00009899977,0.00022683803,0.0032054873,0.0008154625,0.48307166,0.10025803,0.38670725,0.02142388,0.00021744429],"about_ca_topic_score_codex":0.0007534275,"about_ca_topic_score_gemma":0.00046583833,"teacher_disagreement_score":0.0041084853,"about_ca_system_score_codex":0.0017381931,"about_ca_system_score_gemma":0.0024918197,"threshold_uncertainty_score":0.020442009},"labels":[],"label_agreement":null},{"id":"W4401692016","doi":"10.1109/isit57864.2024.10619282","title":"Secure Inference for Vertically Partitioned Data Using Multiparty Homomorphic Encryption","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Computer science; Encryption; Homomorphic secret sharing; Inference; Theoretical computer science; Computer network; Cryptography; Secret sharing; Computer security; Artificial intelligence","score_opus":0.11996833771864,"score_gpt":0.36425608268792226,"score_spread":0.24428774496928224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401692016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011674699,0.000061728446,0.98575217,0.0005564877,0.000033248398,0.00011796354,0.00014173618,0.00036814436,0.0012937839],"genre_scores_gemma":[0.7439417,0.0001717434,0.25078884,0.00034526933,0.00009314785,0.0005307473,0.0003997978,0.0000929044,0.003635813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941245,0.0017560135,0.00056412275,0.00082097115,0.002184216,0.0005502158],"domain_scores_gemma":[0.98819494,0.0033195878,0.00091945805,0.0066513787,0.00071093923,0.00020375125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004768748,0.00053459837,0.0011408459,0.0006091061,0.0014878318,0.0024740559,0.0020472996,0.0015489645,0.0023731107],"category_scores_gemma":[0.009400264,0.00065624557,0.0010488554,0.0009564274,0.0018451334,0.007045517,0.0063219895,0.0038222643,0.0008469356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009347375,0.000349385,0.0025985937,0.00021040058,0.0001936204,0.0010825739,0.0008819311,0.12560758,0.03314031,0.69319075,0.0069438224,0.13486625],"study_design_scores_gemma":[0.000118512624,0.00012315199,0.0004100727,0.000027919106,0.000038845286,0.00041412376,0.00011777756,0.7042902,0.024780942,0.26457304,0.0050506853,0.000054710832],"about_ca_topic_score_codex":0.0007379347,"about_ca_topic_score_gemma":0.00072260184,"teacher_disagreement_score":0.004768748,"about_ca_system_score_codex":0.001196624,"about_ca_system_score_gemma":0.002174482,"threshold_uncertainty_score":0.025219858},"labels":[],"label_agreement":null},{"id":"W4401719239","doi":"10.1109/icbc59979.2024.10634398","title":"Compliance Design Options for Offline CBDCs: Balancing Privacy and AML/CFT","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Compliance (psychology); Computer science; Internet privacy; Computer security; Business; Psychology","score_opus":0.06747304434129542,"score_gpt":0.3106402041619519,"score_spread":0.2431671598206565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401719239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26512685,0.00073071907,0.6039286,0.0037673572,0.0001444792,0.0020202475,0.00024838749,0.0009214121,0.123111956],"genre_scores_gemma":[0.8381225,0.0002219432,0.1544506,0.0005610884,0.000043656888,0.00072284153,0.000104208375,0.00012603203,0.005647157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96660477,0.018168634,0.0015578872,0.002168921,0.009296795,0.0022029737],"domain_scores_gemma":[0.9624684,0.016925609,0.005548937,0.009315809,0.0048588556,0.00088238076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018835722,0.0006933718,0.00050143444,0.0014339915,0.0014774842,0.007374997,0.0014297189,0.0025696836,0.0059380988],"category_scores_gemma":[0.02859738,0.00046800278,0.0007859254,0.0009506512,0.0040336326,0.0076541784,0.0036496313,0.002659841,0.001101791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007788925,0.0007608589,0.009400252,0.00064012053,0.000100243,0.00041043773,0.0018814324,0.022281962,0.024041653,0.7057741,0.0030221168,0.230908],"study_design_scores_gemma":[0.0007819945,0.0062452736,0.010569489,0.0021900006,0.00044717913,0.0030573925,0.006546601,0.1699146,0.1846094,0.4810145,0.13424142,0.00038216572],"about_ca_topic_score_codex":0.0005028196,"about_ca_topic_score_gemma":0.00055675313,"teacher_disagreement_score":0.018835722,"about_ca_system_score_codex":0.0029783794,"about_ca_system_score_gemma":0.003304377,"threshold_uncertainty_score":0.099614024},"labels":[],"label_agreement":null},{"id":"W4401730190","doi":"10.1007/978-3-642-27739-9_148-2","title":"Identity-Based Encryption: Historical Perspective and Hierarchical Systems","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Perspective (graphical); Identity (music); Encryption; Computer science; Sociology; Computer security; Art; Aesthetics; Artificial intelligence","score_opus":0.019180818413421608,"score_gpt":0.24576566233991962,"score_spread":0.226584843926498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401730190","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037794875,0.1456909,0.07927145,0.0070172697,0.0022546106,0.00007830443,0.00015415564,0.00021284661,0.76154107],"genre_scores_gemma":[0.2199199,0.24772958,0.06303766,0.0044262866,0.0047496823,0.00019397707,0.0003720455,0.00026368743,0.45930716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942976,0.00015489894,0.00003287745,0.00009926842,0.00021285101,0.00007030504],"domain_scores_gemma":[0.99944276,0.00029873603,0.000036744477,0.00009971938,0.000096085576,0.000026097066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006889944,0.0006633628,0.00041056762,0.0011802629,0.001312129,0.0048572724,0.001031817,0.001633246,0.009046805],"category_scores_gemma":[0.001503305,0.00041862286,0.0002815765,0.0029068303,0.005009502,0.0073250355,0.0012902459,0.003429881,0.0042038686],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028641587,0.000006173399,0.000019119969,0.000041428437,9.072201e-7,0.000011091462,0.00016046983,0.0002474873,0.00007022352,0.9779268,0.0061524203,0.015361047],"study_design_scores_gemma":[0.000003479701,0.000018483048,0.00013460156,0.00017365991,0.0000036004176,0.00018081882,0.00015443747,0.0013602744,0.0003341297,0.6089332,0.38869387,0.000009336857],"about_ca_topic_score_codex":0.0021547629,"about_ca_topic_score_gemma":0.0016621739,"teacher_disagreement_score":0.009046805,"about_ca_system_score_codex":0.0028578478,"about_ca_system_score_gemma":0.0013937027,"threshold_uncertainty_score":0.030264556},"labels":[],"label_agreement":null},{"id":"W4401770362","doi":"10.1007/s00145-024-09515-4","title":"Randomness Recoverable Secret Sharing Schemes","year":2024,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Cryptographic primitive; Cryptography; Theoretical computer science; Encryption; Computer science; Secret sharing; Access structure; SSS*; Mathematics; Discrete mathematics; Algorithm; Cryptographic protocol; Computer security; Statistics; Artificial intelligence","score_opus":0.010958444194108708,"score_gpt":0.26604172345676796,"score_spread":0.2550832792626593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401770362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10248788,0.0021935967,0.8377168,0.0043469393,0.00047285852,0.0005895082,0.0012560484,0.0028146347,0.04812167],"genre_scores_gemma":[0.8767764,0.0008223408,0.091145836,0.0006891579,0.00031703184,0.00032426853,0.0009770783,0.0002261763,0.028721716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940864,0.0015174398,0.0003270412,0.00080805534,0.0023334573,0.00092757295],"domain_scores_gemma":[0.99208176,0.002735003,0.000662671,0.0037968208,0.0004069664,0.00031684936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033871874,0.0009061931,0.0015168829,0.0010794449,0.001658148,0.0026244097,0.0032269536,0.002604789,0.00958142],"category_scores_gemma":[0.0068768244,0.00079213444,0.001305718,0.0017545101,0.002393806,0.006108692,0.006170898,0.004341401,0.002826181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013015802,0.00022576457,0.00048497473,0.0003264341,0.0001499331,0.0003663394,0.00047882274,0.03619047,0.019885056,0.87159467,0.007624313,0.061371643],"study_design_scores_gemma":[0.0005974053,0.00039095304,0.00043909065,0.00014319936,0.00016300626,0.00071346725,0.00009939071,0.16635472,0.04181326,0.7655706,0.023534909,0.00017998517],"about_ca_topic_score_codex":0.0002477943,"about_ca_topic_score_gemma":0.00025127086,"teacher_disagreement_score":0.00958142,"about_ca_system_score_codex":0.0018849972,"about_ca_system_score_gemma":0.00195973,"threshold_uncertainty_score":0.032053053},"labels":[],"label_agreement":null},{"id":"W4401943215","doi":"10.1109/tsc.2024.3451165","title":"An Efficient and Multi-Private Key Secure Aggregation Scheme for Federated Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Scheme (mathematics); Key (lock); Public-key cryptography; Distributed computing; Computer network; Theoretical computer science; Computer security; Encryption","score_opus":0.014416861733340301,"score_gpt":0.2711689967980994,"score_spread":0.25675213506475913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401943215","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020131318,0.00019040599,0.97735685,0.00026651533,0.000044624,0.000097111486,0.00008280539,0.000865235,0.000964995],"genre_scores_gemma":[0.8329864,0.00017264402,0.16358678,0.00021090286,0.0000484806,0.0001823133,0.00021412602,0.000055103883,0.0025432184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962458,0.000870101,0.00042779496,0.0007480024,0.0012687531,0.00043955704],"domain_scores_gemma":[0.99674916,0.0006160122,0.00037402636,0.001562804,0.0005208465,0.00017716653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028194268,0.00066498993,0.0015630963,0.0009229915,0.0016347776,0.0016739187,0.002436495,0.0016444206,0.0016360461],"category_scores_gemma":[0.005643626,0.00036371886,0.0011952723,0.0015861334,0.0012528754,0.0058865575,0.0051053716,0.0021572507,0.0005801559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015143842,0.00046365638,0.003048577,0.0002792138,0.00026947891,0.0007417034,0.0009697523,0.27029505,0.03141033,0.26433092,0.0092838155,0.41739312],"study_design_scores_gemma":[0.00006442685,0.00009842921,0.00028592665,0.000016461194,0.000033546006,0.00032221046,0.00005981831,0.8984591,0.012913919,0.08512452,0.0025658647,0.000055800625],"about_ca_topic_score_codex":0.0008794885,"about_ca_topic_score_gemma":0.0006880685,"teacher_disagreement_score":0.0028194268,"about_ca_system_score_codex":0.0013959402,"about_ca_system_score_gemma":0.0019434089,"threshold_uncertainty_score":0.014910758},"labels":[],"label_agreement":null},{"id":"W4401981046","doi":"10.1007/978-3-642-27739-9_239-2","title":"Commitment","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Business; Computer science","score_opus":0.019663841417417196,"score_gpt":0.23327240838527863,"score_spread":0.21360856696786143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401981046","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089379866,0.0001914341,0.018674582,0.0019103106,0.00086265994,0.00013251667,0.0008165253,0.00052899227,0.9759891],"genre_scores_gemma":[0.022390332,0.00031057931,0.0047630426,0.00087491126,0.00035135736,0.00019318215,0.0010497118,0.0005275208,0.9695393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985876,0.0002431257,0.00005008453,0.00039597403,0.0005450197,0.0001782145],"domain_scores_gemma":[0.99828005,0.00031793417,0.000059302347,0.0006507951,0.00053025555,0.00016171849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009917105,0.0009299354,0.0006372881,0.0009732655,0.0026388955,0.004702651,0.002030814,0.0013164594,0.34759733],"category_scores_gemma":[0.0041319584,0.0005639158,0.0006685386,0.0010743022,0.0018427769,0.0058154888,0.0037514002,0.0048586694,0.20039457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058255922,0.000034509238,0.000046942005,0.00007228189,0.0000051365996,0.000033912325,0.00019808872,0.000153588,0.0007386103,0.76907516,0.18640731,0.04317622],"study_design_scores_gemma":[0.000018424393,0.000018757239,0.00008578198,0.000046301247,0.0000063217085,0.00008607307,0.00015384477,0.00043302862,0.0011143566,0.30958688,0.6884356,0.000014633613],"about_ca_topic_score_codex":0.0012882843,"about_ca_topic_score_gemma":0.0013114817,"teacher_disagreement_score":0.34759733,"about_ca_system_score_codex":0.001697189,"about_ca_system_score_gemma":0.0015409199,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4402157326","doi":"10.1109/icc51166.2024.10622238","title":"Federated Unlearning with Multiple Client Partitions","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science","score_opus":0.011670050821759747,"score_gpt":0.2324092969783063,"score_spread":0.22073924615654655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402157326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09346133,0.00028372463,0.89878315,0.0003539271,0.000053148036,0.00016771279,0.00010511565,0.005285391,0.0015065569],"genre_scores_gemma":[0.7980523,0.00007879245,0.198636,0.0003022259,0.000027358636,0.00018916132,0.00040239506,0.00018450171,0.0021272383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982357,0.00055038836,0.00011670699,0.00047478447,0.0003706545,0.00025164708],"domain_scores_gemma":[0.99566793,0.0015541968,0.00024404227,0.0016165746,0.000694883,0.00022238596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025134103,0.0011985581,0.0016511338,0.0007184624,0.0011433843,0.0015170499,0.002630863,0.0015469725,0.0018324387],"category_scores_gemma":[0.008719624,0.0005944009,0.000844172,0.00094003114,0.0011957568,0.0049100188,0.003228572,0.0023911723,0.0006429211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008061624,0.0004699094,0.004273436,0.00006892718,0.000078315585,0.00020635276,0.00025801157,0.63535655,0.00527226,0.008471103,0.0034613872,0.34127754],"study_design_scores_gemma":[0.000014502422,0.00003167783,0.000078551275,0.0000027352344,0.0000046987643,0.000026862512,0.000021370408,0.9929208,0.0022017995,0.004465314,0.00022684978,0.0000048204697],"about_ca_topic_score_codex":0.00476537,"about_ca_topic_score_gemma":0.0054035983,"teacher_disagreement_score":0.00476537,"about_ca_system_score_codex":0.0016394985,"about_ca_system_score_gemma":0.002141124,"threshold_uncertainty_score":0.013292313},"labels":[],"label_agreement":null},{"id":"W4402157495","doi":"10.1109/icc51166.2024.10622289","title":"An Efficient Range Sum Query Scheme Under Local Differential Privacy","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Differential privacy; Computer science; Scheme (mathematics); Range (aeronautics); Range query (database); Query optimization; Information retrieval; Differential (mechanical device); Query expansion; Sargable; Web search query; Data mining; Mathematics; Search engine","score_opus":0.014694425141889124,"score_gpt":0.26459541649478996,"score_spread":0.24990099135290084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402157495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028324267,0.0005472518,0.96280336,0.00058101764,0.000092824404,0.00036377955,0.00030752516,0.0011632583,0.0058167526],"genre_scores_gemma":[0.8323145,0.00043435613,0.15855879,0.00049946626,0.00012187333,0.00045250266,0.000424403,0.000075620716,0.007118636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938105,0.0014716075,0.00042156695,0.001062954,0.0025437577,0.0006897776],"domain_scores_gemma":[0.9958901,0.0011177231,0.00045069357,0.0016352776,0.0006799327,0.00022637173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025947073,0.00064525096,0.0019651114,0.0009413348,0.0016993354,0.0019831322,0.0028285875,0.0016299908,0.0024801546],"category_scores_gemma":[0.006540647,0.0003754189,0.0009821057,0.002636472,0.0015309397,0.0057199756,0.0072303913,0.0017650225,0.0010588267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020744875,0.00043021698,0.002744838,0.0007551797,0.0002559445,0.0013130774,0.0021834017,0.101615265,0.11102344,0.3778143,0.011571465,0.38821846],"study_design_scores_gemma":[0.00043840508,0.0006383801,0.00095727254,0.000068540365,0.00017135966,0.0020474114,0.0006323409,0.7420048,0.052041728,0.17481394,0.025937097,0.00024867003],"about_ca_topic_score_codex":0.0009498567,"about_ca_topic_score_gemma":0.0005796794,"teacher_disagreement_score":0.0028285875,"about_ca_system_score_codex":0.0017311787,"about_ca_system_score_gemma":0.0018831905,"threshold_uncertainty_score":0.0137223005},"labels":[],"label_agreement":null},{"id":"W4402264280","doi":"10.1109/sp54263.2024.00095","title":"More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Collusion; Computer science; Computer network; Computer security; Business; Industrial organization","score_opus":0.024153889336624088,"score_gpt":0.29267158998017945,"score_spread":0.26851770064355535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402264280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09467201,0.0007188674,0.887415,0.0028818827,0.00017667985,0.00025046646,0.00008399983,0.0014580456,0.012343027],"genre_scores_gemma":[0.90396625,0.00030441428,0.088473104,0.00055772555,0.0001652728,0.00014869211,0.000082826424,0.00017843189,0.006123302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99035954,0.0036954617,0.0005227033,0.001751287,0.0024504338,0.0012206107],"domain_scores_gemma":[0.98017335,0.0064610913,0.0014472626,0.009787432,0.0013433245,0.00078745495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066900617,0.0006816734,0.001784557,0.00080600986,0.0018262229,0.0041366015,0.0025216846,0.0022511906,0.0042326343],"category_scores_gemma":[0.024388982,0.0007883613,0.0012609828,0.0010112686,0.003683575,0.010291614,0.0081646005,0.0042508915,0.0017306654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023550985,0.0005429928,0.0060672993,0.00049074774,0.00022637358,0.0017471071,0.0018221905,0.24762945,0.03975209,0.53879297,0.0081659,0.1524078],"study_design_scores_gemma":[0.00011647936,0.0003893866,0.00044207607,0.000056036042,0.000052449264,0.00047284385,0.00014393216,0.79678845,0.012195495,0.18099792,0.008266827,0.00007812161],"about_ca_topic_score_codex":0.0009868089,"about_ca_topic_score_gemma":0.00072584156,"teacher_disagreement_score":0.0066900617,"about_ca_system_score_codex":0.0013533965,"about_ca_system_score_gemma":0.0023068222,"threshold_uncertainty_score":0.03538084},"labels":[],"label_agreement":null},{"id":"W4402642689","doi":"10.3390/electronics13183716","title":"A Maneuver in the Trade-Off Space of Federated Learning Aggregation Frameworks Secured with Polymorphic Encryption: PolyFLAM and PolyFLAP Frameworks","year":2024,"lang":"en","type":"article","venue":"Electronics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cegep de Sept Iles; Université du Québec à Chicoutimi; Université du Québec à Rimouski","funders":"","keywords":"Encryption; Space (punctuation); Computer science; Business; Distributed computing; Computer network; Operating system","score_opus":0.004863525027485286,"score_gpt":0.21925267561620726,"score_spread":0.21438915058872196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402642689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042959556,0.0006954163,0.94975185,0.0015263477,0.00006536786,0.00011005204,0.000099296856,0.001351783,0.0034403994],"genre_scores_gemma":[0.77727747,0.000371177,0.21858652,0.0004464403,0.000049481492,0.00019942391,0.00018153113,0.00014724328,0.0027407012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934331,0.0027948113,0.0003907978,0.0009868782,0.0016132584,0.00078111986],"domain_scores_gemma":[0.9925592,0.002211075,0.0004605159,0.0036623697,0.0007707675,0.000336101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008379578,0.00083949545,0.0012936784,0.00067218917,0.0011923845,0.003912855,0.002822959,0.001700142,0.002019061],"category_scores_gemma":[0.013514922,0.00051781384,0.0015222961,0.0008286653,0.0019386082,0.008084739,0.005724851,0.0036314998,0.00048080494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076969486,0.0002769323,0.00300679,0.00017476681,0.00018031495,0.0006097527,0.0004710869,0.41059816,0.0056009023,0.40521318,0.0055066845,0.16759177],"study_design_scores_gemma":[0.000027196982,0.000081966675,0.00021776633,0.00003072238,0.000016519167,0.00017985188,0.00006546892,0.89919317,0.0024132794,0.09517363,0.0025776383,0.00002271405],"about_ca_topic_score_codex":0.0021831796,"about_ca_topic_score_gemma":0.0020262105,"teacher_disagreement_score":0.008379578,"about_ca_system_score_codex":0.0018837883,"about_ca_system_score_gemma":0.0022955725,"threshold_uncertainty_score":0.044315994},"labels":[],"label_agreement":null},{"id":"W4402674324","doi":"10.1109/csf61375.2024.00040","title":"On Separation Logic, Computational Independence, and Pseudorandomness","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Agence Nationale de la Recherche","keywords":"Pseudorandomness; Independence (probability theory); Computer science; Separation (statistics); Algorithm; Mathematics; Machine learning; Pseudorandom number generator; Statistics","score_opus":0.012846029877037958,"score_gpt":0.28934277653012586,"score_spread":0.2764967466530879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402674324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029590817,0.0047059995,0.90244716,0.007727314,0.00025503273,0.0000830686,0.00024639352,0.0002584456,0.05468583],"genre_scores_gemma":[0.7840127,0.00671834,0.1863902,0.00383787,0.0020958376,0.00036963844,0.0005853258,0.00028140916,0.015708698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99533033,0.0017194983,0.0002706728,0.0007550825,0.0013884543,0.0005359701],"domain_scores_gemma":[0.9870499,0.009869414,0.00073036976,0.0010327814,0.00091065746,0.00040703086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048966613,0.0011498979,0.00094226934,0.0025372645,0.0020669883,0.0035033536,0.0015223556,0.0019418141,0.00400188],"category_scores_gemma":[0.01025029,0.000644269,0.0020259155,0.0023537255,0.012537687,0.012610347,0.005174892,0.007951508,0.00076697324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023873976,0.000018159713,0.00012246222,0.000040113566,0.000008180223,0.00006882492,0.00013687092,0.0017208176,0.00032019246,0.9933775,0.00040264294,0.0037604126],"study_design_scores_gemma":[0.000010485609,0.000017876162,0.000082271836,0.000020088382,0.0000085703305,0.000067925,0.000022424874,0.005586698,0.0003579649,0.9913674,0.002446217,0.000012068965],"about_ca_topic_score_codex":0.0016689403,"about_ca_topic_score_gemma":0.00089197536,"teacher_disagreement_score":0.0048966613,"about_ca_system_score_codex":0.0028399632,"about_ca_system_score_gemma":0.0017115917,"threshold_uncertainty_score":0.02589631},"labels":[],"label_agreement":null},{"id":"W4402835406","doi":"10.1109/vtc2024-spring62846.2024.10683685","title":"Leveraging Group Secret Sharing Technology for FD-RAN: A Lightweight AKA Mechanism","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"AKA; Computer science; Ran; Mechanism (biology); Group (periodic table); Secret sharing; Computer security; Computer network; Cryptography; Chemistry","score_opus":0.01609238956264582,"score_gpt":0.24602838771491975,"score_spread":0.22993599815227392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402835406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011191904,0.00030167404,0.98463124,0.00025881326,0.00010975808,0.00019252233,0.000033971,0.0005560002,0.0027241765],"genre_scores_gemma":[0.7532374,0.00071980763,0.2390044,0.0002543187,0.00026167955,0.0005567491,0.00014490877,0.00007134595,0.005749333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955249,0.0012427354,0.0005214813,0.0006880069,0.0015085685,0.00051433203],"domain_scores_gemma":[0.9948125,0.0016108,0.0010405246,0.0015934021,0.00069069065,0.00025215346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042504217,0.0008262139,0.0012158336,0.0016305549,0.0019889912,0.0025048568,0.0026130863,0.0018916207,0.002028246],"category_scores_gemma":[0.0055106874,0.00049730565,0.0010334989,0.0015826095,0.0024864825,0.0071830507,0.006190264,0.00295993,0.0009961335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007990522,0.00033137915,0.0012168612,0.0005567654,0.00016717002,0.0011060023,0.0014778422,0.04050384,0.09486664,0.69476026,0.003242147,0.16097204],"study_design_scores_gemma":[0.00022166701,0.00060039834,0.00048780575,0.00014580443,0.00021539663,0.001909307,0.00031938363,0.6747832,0.0771254,0.20482366,0.03904802,0.00032004542],"about_ca_topic_score_codex":0.0006223613,"about_ca_topic_score_gemma":0.00042780495,"teacher_disagreement_score":0.0042504217,"about_ca_system_score_codex":0.0013409479,"about_ca_system_score_gemma":0.002092218,"threshold_uncertainty_score":0.02247864},"labels":[],"label_agreement":null},{"id":"W4402924914","doi":"10.20935/acadquant7353","title":"Homomorphic polynomial public key with the Barrett transformation for digital signature","year":2024,"lang":"en","type":"article","venue":"Academia quantum.","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"","keywords":"Digital signature; Key (lock); Signature (topology); Homomorphic encryption; Public-key cryptography; Polynomial; Transformation (genetics); Computer science; Mathematics; Computer security; Biology; Encryption; Genetics; Mathematical analysis","score_opus":0.01554694756659171,"score_gpt":0.23772690886744854,"score_spread":0.22217996130085682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402924914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008713082,0.0022430548,0.9519289,0.0013493678,0.00034659027,0.00026926555,0.00013525222,0.0007837124,0.034230735],"genre_scores_gemma":[0.37294745,0.003439245,0.5916703,0.001117255,0.000556763,0.00063204963,0.00042235895,0.0002834206,0.028931133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707747,0.00080479094,0.00015972913,0.00039889442,0.0013546788,0.0002044243],"domain_scores_gemma":[0.9989297,0.0002684479,0.00009440138,0.0005104288,0.0001622821,0.000034709254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014946444,0.0006950983,0.000563395,0.0011739503,0.0008685307,0.0019275151,0.0009880431,0.0012235834,0.0063563893],"category_scores_gemma":[0.0040829554,0.00042016807,0.0011138417,0.0017939849,0.0024903624,0.0047920668,0.002184122,0.003696971,0.0050515505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073359646,0.00003212729,0.00012775118,0.00010641638,0.000017348719,0.00011191559,0.00014793893,0.0038590191,0.004383587,0.90953267,0.0029500527,0.078657895],"study_design_scores_gemma":[0.00009441093,0.00023741086,0.00033270242,0.00009953986,0.00004034801,0.0010592174,0.00008957182,0.07926215,0.028644865,0.7349171,0.15510745,0.00011523976],"about_ca_topic_score_codex":0.00049406156,"about_ca_topic_score_gemma":0.00037904855,"teacher_disagreement_score":0.0063563893,"about_ca_system_score_codex":0.0013543313,"about_ca_system_score_gemma":0.0013198981,"threshold_uncertainty_score":0.021264255},"labels":[],"label_agreement":null},{"id":"W4402969916","doi":"","title":"[Short Paper] Privacy-Preserving Distributed Spectral Centrality Measures based on Fully Homomorphic Encryption","year":2024,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Homomorphic encryption; Computer science; Centrality; Encryption; Information privacy; Computer security; Mathematics","score_opus":0.023858347423963366,"score_gpt":0.23860841425801405,"score_spread":0.21475006683405068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402969916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03796354,0.00034772718,0.9528177,0.0010573613,0.000324649,0.000110577894,0.00026966067,0.0005793531,0.0065293433],"genre_scores_gemma":[0.8525913,0.00048552064,0.13624296,0.00061246066,0.00047931023,0.00014899389,0.00038936923,0.0002068601,0.008843299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981439,0.0005286942,0.000080067985,0.00045730587,0.0005977565,0.00019226773],"domain_scores_gemma":[0.99430853,0.002458727,0.0004661454,0.0016364796,0.0007956071,0.00033453005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013292067,0.00054741924,0.001237905,0.0007130634,0.0007980775,0.0020103287,0.0016110683,0.0010587535,0.004174066],"category_scores_gemma":[0.0075122667,0.0003372882,0.000636365,0.001191436,0.0016402269,0.0041443305,0.0021744561,0.0020598941,0.0011950317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056244736,0.00020448232,0.0005546613,0.00021076071,0.000091577305,0.00017408576,0.0002304885,0.06503634,0.01802105,0.7892442,0.013096677,0.11257338],"study_design_scores_gemma":[0.00008179584,0.00018441715,0.00044797023,0.000028300954,0.00003530158,0.00032031955,0.000060287974,0.4735396,0.011078524,0.50737274,0.006793153,0.000057620913],"about_ca_topic_score_codex":0.00034933552,"about_ca_topic_score_gemma":0.00037163583,"teacher_disagreement_score":0.004174066,"about_ca_system_score_codex":0.0009358253,"about_ca_system_score_gemma":0.0010148126,"threshold_uncertainty_score":0.01396358},"labels":[],"label_agreement":null},{"id":"W4403175140","doi":"10.62056/ay4fbn2hd","title":"Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions","year":2024,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Artificial intelligence; Machine learning","score_opus":0.056259069229930486,"score_gpt":0.3674961435503306,"score_spread":0.31123707432040015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403175140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40522292,0.0025687357,0.4522746,0.008507518,0.00089748576,0.00015161866,0.0012461824,0.01288202,0.11624905],"genre_scores_gemma":[0.77290493,0.0009384236,0.19950229,0.0011379399,0.00019914446,0.00018914355,0.0010704156,0.0014570019,0.022600684],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998708,0.00020187424,0.00007068215,0.00023174702,0.0004722824,0.00031532717],"domain_scores_gemma":[0.99520594,0.0013672522,0.00035166473,0.0025695593,0.0002738624,0.0002317655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008216791,0.0008028514,0.0008248617,0.0006934538,0.0012823939,0.0023596394,0.0019136829,0.0013574117,0.02188141],"category_scores_gemma":[0.0075178854,0.0005949201,0.0011529553,0.0014454473,0.0021122573,0.009478897,0.0028540727,0.0021939657,0.005670666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002186499,0.00032751085,0.0048153005,0.0008687593,0.00016052302,0.0003131603,0.00031053217,0.1284907,0.027904062,0.36466494,0.046748895,0.4232092],"study_design_scores_gemma":[0.00025885188,0.00068241457,0.0018301843,0.0001960566,0.00009886854,0.0007193674,0.00034161622,0.38965258,0.04673261,0.4990691,0.060275793,0.00014262497],"about_ca_topic_score_codex":0.0016664856,"about_ca_topic_score_gemma":0.0033032321,"teacher_disagreement_score":0.02188141,"about_ca_system_score_codex":0.001448303,"about_ca_system_score_gemma":0.0016703304,"threshold_uncertainty_score":0.07320058},"labels":[],"label_agreement":null},{"id":"W4403241495","doi":"10.1007/978-3-032-06754-8_10","title":"The Role of Piracy in Quantum Proofs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of Ottawa; U.S. Department of Energy; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematical proof; Quantum; Theoretical physics; Mathematics; Quantum mechanics; Physics; Geometry","score_opus":0.008345677766497773,"score_gpt":0.2343428065097155,"score_spread":0.22599712874321773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403241495","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02273342,0.021547822,0.26045313,0.02806098,0.0041099237,0.00012496884,0.00024423428,0.00054650503,0.66217905],"genre_scores_gemma":[0.8253587,0.011827886,0.05354146,0.00428668,0.0067582005,0.0002778419,0.00012931993,0.00052060647,0.09729929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993425,0.003373762,0.00024314957,0.0006160958,0.0017692511,0.0005726964],"domain_scores_gemma":[0.97362196,0.01965385,0.0008039308,0.004385071,0.0010533031,0.00048179505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005662488,0.0009038097,0.0017986277,0.0020371093,0.0044613983,0.007744012,0.0028690011,0.0061123674,0.015310602],"category_scores_gemma":[0.029363632,0.0013880824,0.0011640138,0.0023740896,0.023825029,0.026874568,0.0052481266,0.009317074,0.0030131268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072630464,0.0000048956,0.000011227619,0.000025735471,0.0000016038274,0.000012916357,0.000074007585,0.00020777014,0.00004410614,0.9958688,0.0012463913,0.0024953478],"study_design_scores_gemma":[0.0000044354865,0.0000037112115,0.0000074331656,0.000016055776,0.0000014991576,0.000024628847,0.000012171588,0.00070497993,0.00006342115,0.9952603,0.0038967715,0.000004636777],"about_ca_topic_score_codex":0.000648107,"about_ca_topic_score_gemma":0.00039938325,"teacher_disagreement_score":0.015310602,"about_ca_system_score_codex":0.0030181748,"about_ca_system_score_gemma":0.0014603169,"threshold_uncertainty_score":0.051219106},"labels":[],"label_agreement":null},{"id":"W4403619985","doi":"10.1007/978-3-031-75757-0_12","title":"ChronoCloak: An Integrated Solution for Mitigating Premature Disclosure in Oblivious Digital Dissemination","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Computer network; Internet privacy","score_opus":0.010763875765774448,"score_gpt":0.25785332497138225,"score_spread":0.2470894492056078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619985","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038204912,0.0036728848,0.8976418,0.0018642577,0.0013747374,0.0006091855,0.0005531578,0.034195278,0.021883858],"genre_scores_gemma":[0.5655923,0.0016812184,0.3819435,0.0015713741,0.00060854515,0.00040417098,0.00090890966,0.0014599701,0.04583001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980888,0.000315208,0.00013587705,0.00032576348,0.0008228194,0.00031149056],"domain_scores_gemma":[0.9956994,0.0008049746,0.00043529627,0.0019990932,0.0007388172,0.00032249396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022466818,0.000900197,0.0009792625,0.0014003456,0.0015597437,0.0034500854,0.003145571,0.0018885595,0.010865414],"category_scores_gemma":[0.0067341244,0.0004967315,0.00045748925,0.0011072224,0.001415357,0.0057490063,0.005598368,0.0024642914,0.003096308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020579763,0.0005835895,0.0017375571,0.0007278264,0.00017473382,0.00035751713,0.0007348539,0.011732444,0.036056533,0.06695866,0.05678793,0.8220903],"study_design_scores_gemma":[0.0010734737,0.001771382,0.0015045005,0.00041772734,0.00057560863,0.0016605646,0.00085400156,0.44698378,0.14743836,0.14718571,0.25021622,0.0003187077],"about_ca_topic_score_codex":0.0012762368,"about_ca_topic_score_gemma":0.0025617834,"teacher_disagreement_score":0.010865414,"about_ca_system_score_codex":0.0010258524,"about_ca_system_score_gemma":0.003537128,"threshold_uncertainty_score":0.036348462},"labels":[],"label_agreement":null},{"id":"W4403724102","doi":"10.1109/dsaa61799.2024.10722785","title":"AddShare+: Efficient Selective Additive Secret Sharing Approach for Private Federated Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Secret sharing; Computer security; Theoretical computer science; Cryptography","score_opus":0.016598818895617266,"score_gpt":0.25216403460677056,"score_spread":0.2355652157111533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403724102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041085355,0.00038920017,0.94587076,0.00040856036,0.00008342154,0.00016906923,0.00042104672,0.009298033,0.0022745384],"genre_scores_gemma":[0.7010094,0.00018032249,0.29344344,0.00038527139,0.000051568895,0.00020693227,0.0010539782,0.00031049378,0.0033585287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997159,0.00090975355,0.00019084752,0.0006143274,0.00079207076,0.00033393232],"domain_scores_gemma":[0.9951283,0.0010735284,0.00023479514,0.0030197802,0.0003652744,0.00017832928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036860977,0.0009728025,0.0013463219,0.00086786103,0.0010877438,0.0019353983,0.0032632526,0.0014896019,0.0033978424],"category_scores_gemma":[0.008057093,0.00045705965,0.0011485039,0.0010188902,0.0012757132,0.0054565077,0.005369399,0.002136409,0.0011649472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013838233,0.00074395526,0.0048711374,0.0003154205,0.00035273915,0.0003009178,0.00040346786,0.37303773,0.017372435,0.05151492,0.01787768,0.5318257],"study_design_scores_gemma":[0.00007472207,0.00012217363,0.00030524933,0.000016366615,0.000026518102,0.00017284276,0.00006092075,0.9378606,0.011675408,0.04492791,0.0047260993,0.000031210402],"about_ca_topic_score_codex":0.001594432,"about_ca_topic_score_gemma":0.0025652018,"teacher_disagreement_score":0.0036860977,"about_ca_system_score_codex":0.0011869791,"about_ca_system_score_gemma":0.0024692358,"threshold_uncertainty_score":0.019494176},"labels":[],"label_agreement":null},{"id":"W4403746584","doi":"10.4230/lipics.isaac.2024.36","title":"Kernelization Complexity of Solution Discovery Problems","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universität Bremen","keywords":"Simple (philosophy); Computer science; Priority queue; Queue; Computer network; Philosophy","score_opus":0.10195804989015682,"score_gpt":0.19724671120474788,"score_spread":0.09528866131459106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403746584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44338807,0.0016157144,0.52946234,0.008987322,0.000118108976,0.00058147113,0.0025183728,0.0018831196,0.011445416],"genre_scores_gemma":[0.87052965,0.00093603996,0.118947,0.00055006356,0.00019403966,0.0007309124,0.0028980577,0.00059558975,0.004618634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898189,0.0035043778,0.0007260252,0.0025126752,0.0018669064,0.0015711599],"domain_scores_gemma":[0.93684506,0.050207067,0.0037688606,0.0054026837,0.0020137043,0.0017626187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071095205,0.0017367335,0.0034272335,0.0016527027,0.0017250832,0.007266399,0.0048955,0.0037299977,0.009622458],"category_scores_gemma":[0.05077574,0.0010950806,0.0026595867,0.0031879747,0.0038708341,0.016403679,0.0059897196,0.005076736,0.0009756028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029975786,0.000873324,0.009196209,0.0017294876,0.0004939879,0.00054543593,0.0020653026,0.5071474,0.008874695,0.3453195,0.0139485365,0.10680853],"study_design_scores_gemma":[0.00017188932,0.00012847681,0.0008397127,0.000040289695,0.00008136949,0.00022953193,0.00030106946,0.6979312,0.0021245873,0.2963928,0.0017229808,0.000036189096],"about_ca_topic_score_codex":0.0022850698,"about_ca_topic_score_gemma":0.0013668804,"teacher_disagreement_score":0.009622458,"about_ca_system_score_codex":0.005489668,"about_ca_system_score_gemma":0.0035421082,"threshold_uncertainty_score":0.039830446},"labels":[],"label_agreement":null},{"id":"W4404385876","doi":"10.1145/3698038.3698557","title":"Pack: Towards Communication-Efficient Homomorphic Encryption in Federated Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Young Scientists Fund; Health and Medical Research Fund; Universitas Brawijaya","keywords":"Homomorphic encryption; Computer science; Encryption; Computer security","score_opus":0.014318651445044088,"score_gpt":0.2560109964373299,"score_spread":0.24169234499228578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404385876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017422004,0.0002512899,0.979191,0.00022726454,0.000053853928,0.00008363363,0.00009791385,0.0015754928,0.0010975839],"genre_scores_gemma":[0.7518377,0.0002582223,0.24326515,0.00037730476,0.000074591764,0.00023004625,0.0003344028,0.00016584281,0.0034567446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593437,0.0013628023,0.00030199488,0.00058690255,0.0012754244,0.0005384272],"domain_scores_gemma":[0.99440163,0.0015635726,0.00042828242,0.0029489691,0.0004905138,0.00016702843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004508121,0.0007910704,0.0014881854,0.00085233443,0.0007692032,0.00208641,0.002624798,0.0016477604,0.0020246308],"category_scores_gemma":[0.010427629,0.00056613924,0.0007701442,0.0012926988,0.0015991948,0.0056262114,0.005801979,0.002496006,0.00093584985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015772022,0.0005484189,0.00250254,0.0003642888,0.00022379683,0.0005286478,0.0004626175,0.36775732,0.0160405,0.2070715,0.012283315,0.3906399],"study_design_scores_gemma":[0.000078557896,0.00010952859,0.00018744684,0.00002183647,0.000017548022,0.0001927899,0.000043985277,0.91349,0.008823131,0.07470878,0.0023020948,0.000024351772],"about_ca_topic_score_codex":0.0008005347,"about_ca_topic_score_gemma":0.0007673941,"teacher_disagreement_score":0.004508121,"about_ca_system_score_codex":0.0009753421,"about_ca_system_score_gemma":0.0019161262,"threshold_uncertainty_score":0.0238415},"labels":[],"label_agreement":null},{"id":"W4404515307","doi":"10.1145/3689945.3694806","title":"vFHE: Verifiable Fully Homomorphic Encryption","year":2023,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Universitas Brawijaya","keywords":"Homomorphic encryption; Verifiable secret sharing; Computer science; Homomorphic secret sharing; Encryption; Computer security; Theoretical computer science; Programming language","score_opus":0.014211935982596503,"score_gpt":0.22603691086308608,"score_spread":0.21182497488048957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404515307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015995227,0.0008849504,0.9444272,0.0012022707,0.00018716123,0.00031130816,0.00096263445,0.015566588,0.020462688],"genre_scores_gemma":[0.67294335,0.0010002609,0.30524665,0.0009034846,0.00014104237,0.00030197646,0.0022187524,0.0017571707,0.015487211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616385,0.0010593635,0.00037370017,0.00042766024,0.0014432323,0.00053219014],"domain_scores_gemma":[0.9927873,0.0025542954,0.0003692791,0.0037069789,0.0004605888,0.000121590805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039406777,0.0005372086,0.00068950345,0.00080994965,0.0008501022,0.003347678,0.0028756969,0.0016578229,0.008981718],"category_scores_gemma":[0.012468404,0.0007192029,0.0008644175,0.00077810226,0.0028458852,0.011332716,0.0051456243,0.0031983121,0.0025237626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049349724,0.00012132611,0.0013188359,0.00042621515,0.00007869599,0.00029918822,0.0004119156,0.019800792,0.009376054,0.7811428,0.023004575,0.16352609],"study_design_scores_gemma":[0.00017022561,0.000203112,0.00061300653,0.00024584663,0.000064258005,0.0007425462,0.00014989199,0.20550723,0.052876625,0.64479995,0.09449801,0.00012934911],"about_ca_topic_score_codex":0.0013489453,"about_ca_topic_score_gemma":0.0013726216,"teacher_disagreement_score":0.008981718,"about_ca_system_score_codex":0.0014379052,"about_ca_system_score_gemma":0.0019531231,"threshold_uncertainty_score":0.03004682},"labels":[],"label_agreement":null},{"id":"W4404633002","doi":"10.1016/j.cosrev.2024.100689","title":"From accuracy to approximation: A survey on approximate homomorphic encryption and its applications","year":2024,"lang":"en","type":"article","venue":"Computer Science Review","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China; Office of Naval Research; National Sanitarium Association; National Science Foundation","keywords":"Homomorphic encryption; Computer science; Encryption; Theoretical computer science; Information retrieval; Computer security","score_opus":0.044176192015990386,"score_gpt":0.31947310453596217,"score_spread":0.2752969125199718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404633002","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058127595,0.7873069,0.17842413,0.0059527587,0.001127851,0.00006649353,0.00020008047,0.00015396206,0.020955097],"genre_scores_gemma":[0.1237284,0.78890824,0.07582306,0.0020244073,0.004919312,0.00010413627,0.00034118112,0.00009787381,0.0040533748],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958333,0.00087902125,0.00041206638,0.0005249884,0.002138177,0.00021250153],"domain_scores_gemma":[0.9914581,0.0060581416,0.0003623916,0.0011454701,0.0008789575,0.00009697477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029803312,0.00094144786,0.002176663,0.002773891,0.0006641352,0.0038787131,0.0016447119,0.0018734284,0.0028545803],"category_scores_gemma":[0.011359074,0.0006738205,0.0009517922,0.0068343333,0.0029271746,0.0099245105,0.002456107,0.0035303985,0.000916943],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000130179,0.00010803092,0.0014093249,0.0042393077,0.00009535795,0.000114822535,0.00022043436,0.011670437,0.0014136593,0.42117515,0.012925097,0.5464982],"study_design_scores_gemma":[0.000058483725,0.00040108376,0.001817278,0.0026559527,0.00015030733,0.0028297312,0.00039773426,0.06763776,0.0050544785,0.6304355,0.2884219,0.00013961553],"about_ca_topic_score_codex":0.0010358617,"about_ca_topic_score_gemma":0.00055359036,"teacher_disagreement_score":0.0038787131,"about_ca_system_score_codex":0.0020783097,"about_ca_system_score_gemma":0.0018764274,"threshold_uncertainty_score":0.015761733},"labels":[],"label_agreement":null},{"id":"W4404734773","doi":"10.1016/j.tcs.2024.115006","title":"Sign-then-encrypt with security enhancement and compressed ciphertext","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Sign (mathematics); Ciphertext; Semantic security; Computer science; Computer security; Mathematics; Attribute-based encryption; Public-key cryptography","score_opus":0.005328427276776619,"score_gpt":0.22753379544122562,"score_spread":0.222205368164449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404734773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095500104,0.00055013364,0.8712295,0.002639106,0.00094587146,0.0007024399,0.000570033,0.0026928096,0.02516988],"genre_scores_gemma":[0.8035392,0.00038692058,0.17377172,0.000416207,0.00042159774,0.00020087224,0.00060709665,0.0003098154,0.020346545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997542,0.00046796066,0.0001363954,0.00029319915,0.0010630831,0.0004973037],"domain_scores_gemma":[0.9965904,0.0007121022,0.00017848233,0.0017514881,0.00058586936,0.0001818381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014023468,0.0007460045,0.0010337313,0.000810094,0.0010024436,0.0014571811,0.00072533503,0.0013845612,0.0074282708],"category_scores_gemma":[0.005515956,0.00038488145,0.000998696,0.0008893463,0.001827702,0.0041839383,0.0028886292,0.002142821,0.002716574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00270159,0.00058290764,0.0022120092,0.0005326952,0.00015805433,0.0024579414,0.00062326476,0.036697637,0.10526614,0.58250237,0.02114865,0.24511677],"study_design_scores_gemma":[0.00035320863,0.0006732262,0.0013135276,0.00012708092,0.00022480274,0.004733141,0.00022283431,0.4213053,0.25744808,0.28363866,0.029774625,0.00018562532],"about_ca_topic_score_codex":0.0005196708,"about_ca_topic_score_gemma":0.0006608476,"teacher_disagreement_score":0.0074282708,"about_ca_system_score_codex":0.0007684962,"about_ca_system_score_gemma":0.0022183815,"threshold_uncertainty_score":0.02485001},"labels":[],"label_agreement":null},{"id":"W4404778166","doi":"10.1007/978-3-031-78017-2_9","title":"Low-Degree Security of the Planted Random Subgraph Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Degree (music); Computer science; Theoretical computer science; Physics","score_opus":0.012135042290964519,"score_gpt":0.22152508906843252,"score_spread":0.209390046777468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404778166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3850406,0.0030797524,0.47485623,0.0172334,0.0005371835,0.00019378147,0.0023619172,0.0015428596,0.11515419],"genre_scores_gemma":[0.95763415,0.0013466947,0.026788468,0.0008678156,0.00042417517,0.00017135708,0.0007828021,0.00023249155,0.011751947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971643,0.001077863,0.00008256239,0.0005890395,0.00063491875,0.00045123472],"domain_scores_gemma":[0.98701406,0.009162216,0.0006871611,0.002283886,0.0004212755,0.00043148053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019796113,0.0009670044,0.0014326492,0.0009864321,0.0014200724,0.003623773,0.0026807792,0.0022077006,0.0058399774],"category_scores_gemma":[0.009813407,0.0006741834,0.0010618793,0.0014268081,0.0034730595,0.007911617,0.0035742112,0.0043994593,0.0015761384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075859844,0.0001117103,0.00059402245,0.0002664153,0.00007784719,0.0001520669,0.00028831977,0.07259442,0.0069723795,0.8760505,0.0105717955,0.031561974],"study_design_scores_gemma":[0.00006197899,0.000026905826,0.00015220295,0.000026908006,0.00001809206,0.00010262585,0.000033863074,0.059676316,0.0019402906,0.93562657,0.002317098,0.000017166012],"about_ca_topic_score_codex":0.0007498565,"about_ca_topic_score_gemma":0.0007671344,"teacher_disagreement_score":0.0058399774,"about_ca_system_score_codex":0.002556609,"about_ca_system_score_gemma":0.0012171153,"threshold_uncertainty_score":0.019536674},"labels":[],"label_agreement":null},{"id":"W4404803098","doi":"10.1515/jmc-2023-0012","title":"Revocable policy-based chameleon hash using lattices","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; National Research Council Canada","funders":"University of Waterloo; Impact Fund; Silicon Valley Community Foundation","keywords":"Hash function; Computer science; Computer security; Theoretical computer science","score_opus":0.03226791542826929,"score_gpt":0.32149749840684977,"score_spread":0.2892295829785805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404803098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10890998,0.0008593222,0.85302174,0.002285526,0.0005846163,0.00043043273,0.00044778798,0.0040955404,0.02936505],"genre_scores_gemma":[0.9115374,0.00025950072,0.075717166,0.00032179113,0.00014117382,0.0001886587,0.00021740467,0.00021479191,0.0114022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99301624,0.0019859073,0.00045609983,0.0009001151,0.0026573283,0.0009842518],"domain_scores_gemma":[0.9901106,0.0032091036,0.00074508117,0.004333759,0.0009678596,0.0006335975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038216526,0.00055804866,0.0013332576,0.0009803482,0.0021066223,0.0038852275,0.0018141286,0.0023488766,0.008532616],"category_scores_gemma":[0.010510394,0.0005372638,0.0012512048,0.0010784997,0.0044730296,0.009043625,0.006578569,0.0035944427,0.0029174292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009308601,0.00016353182,0.0008587688,0.00015645428,0.000049554033,0.00028671403,0.0004921369,0.04377092,0.012996859,0.8982385,0.004035113,0.038020577],"study_design_scores_gemma":[0.00024513266,0.0002613224,0.00022873489,0.00008126803,0.000037834325,0.00035944063,0.00020441588,0.36982185,0.036197282,0.56691295,0.025452508,0.00019721397],"about_ca_topic_score_codex":0.0015156997,"about_ca_topic_score_gemma":0.00080273964,"teacher_disagreement_score":0.008532616,"about_ca_system_score_codex":0.0025329827,"about_ca_system_score_gemma":0.0026923146,"threshold_uncertainty_score":0.028544426},"labels":[],"label_agreement":null},{"id":"W4404883959","doi":"10.1007/978-3-031-78020-2_11","title":"On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Functional encryption; Black box; Encryption; Key (lock); Theoretical computer science; Computer security; Artificial intelligence; Ciphertext","score_opus":0.034951451313318234,"score_gpt":0.242765956206546,"score_spread":0.20781450489322778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404883959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15147671,0.006641049,0.59011656,0.016663007,0.0012302707,0.00019819118,0.0012676017,0.000594875,0.23181166],"genre_scores_gemma":[0.8824414,0.0044732825,0.06919214,0.0014376582,0.0017763225,0.0003760143,0.0008312588,0.00040973898,0.039062165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973074,0.00076885667,0.0001060068,0.0003609743,0.0010278098,0.00042887617],"domain_scores_gemma":[0.98377985,0.013407989,0.0004575007,0.0013372329,0.0007026965,0.00031474102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029591054,0.001259975,0.0018693348,0.0012161459,0.0014816519,0.004773822,0.002143947,0.002007586,0.010832097],"category_scores_gemma":[0.016523728,0.0007115771,0.0014213943,0.0018496291,0.0048371507,0.01731049,0.0033794749,0.0077446313,0.0016399333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011205429,0.0000406607,0.00015871269,0.00007445754,0.000013732706,0.000040927265,0.000098309545,0.008433702,0.00055283704,0.97709036,0.0037643032,0.009620079],"study_design_scores_gemma":[0.000012807015,0.000012225609,0.0000788243,0.000014332975,0.000005841956,0.00002629476,0.000012898836,0.020591343,0.00022714966,0.9778937,0.0011158265,0.000008747955],"about_ca_topic_score_codex":0.0014290818,"about_ca_topic_score_gemma":0.0010251148,"teacher_disagreement_score":0.010832097,"about_ca_system_score_codex":0.004110597,"about_ca_system_score_gemma":0.0022754634,"threshold_uncertainty_score":0.036237},"labels":[],"label_agreement":null},{"id":"W4404903165","doi":"10.1007/978-3-031-78023-3_8","title":"Secure Computation with Parallel Calls to 2-Ary Functions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Parallel computing; Programming language","score_opus":0.012501993343634651,"score_gpt":0.23959426685975815,"score_spread":0.2270922735161235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404903165","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112821676,0.0014991985,0.7227427,0.0010231468,0.0007231517,0.00021515893,0.00034451587,0.00576242,0.15486811],"genre_scores_gemma":[0.72875917,0.0011095776,0.18022655,0.00041493014,0.0005119059,0.00033427557,0.00051813375,0.0014405298,0.086685054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987674,0.00022852722,0.00006717541,0.0001595091,0.00048668854,0.00029068402],"domain_scores_gemma":[0.99910057,0.0003134141,0.00004553089,0.00043447726,0.0000666309,0.000039444454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070514076,0.0012752254,0.00093455246,0.00081015454,0.0012850246,0.002794179,0.00088073086,0.0010978956,0.010968746],"category_scores_gemma":[0.0017172006,0.00072401075,0.0011059522,0.0013639156,0.0017847746,0.004762847,0.0032273708,0.002232983,0.004283595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095097255,0.0001361041,0.00044028062,0.00024923228,0.0000582413,0.00023734309,0.00044640893,0.022179144,0.02377041,0.7744382,0.015321647,0.16177195],"study_design_scores_gemma":[0.00014318537,0.000151924,0.00040041306,0.000061970335,0.000052121584,0.0003833429,0.00006900498,0.088954486,0.037652057,0.8265845,0.045481812,0.00006507671],"about_ca_topic_score_codex":0.00044196626,"about_ca_topic_score_gemma":0.0006258484,"teacher_disagreement_score":0.010968746,"about_ca_system_score_codex":0.0012209638,"about_ca_system_score_gemma":0.000825792,"threshold_uncertainty_score":0.03669411},"labels":[],"label_agreement":null},{"id":"W4405499710","doi":"10.22331/q-2024-12-17-1568","title":"Fiat-Shamir for Proofs Lacks a Proof Even in the Presence of Shared Entanglement","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Université de Montréal","funders":"","keywords":"Mathematical proof; Quantum entanglement; Computer science; Mathematics; Quantum mechanics; Physics; Quantum","score_opus":0.028076876596124796,"score_gpt":0.2966855235275915,"score_spread":0.2686086469314667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405499710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024012657,0.0032107655,0.8212427,0.04333199,0.0020941743,0.00029182792,0.001254398,0.002759331,0.10180227],"genre_scores_gemma":[0.64804894,0.0032586223,0.29118896,0.0138958655,0.0030252165,0.0009400866,0.0015254775,0.0015072624,0.036609586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98637307,0.0046555577,0.0008643302,0.0026503105,0.0040593212,0.0013973976],"domain_scores_gemma":[0.9334628,0.045559954,0.0021732477,0.014110918,0.0035676763,0.0011253938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017923066,0.0016291405,0.0019527883,0.0029754925,0.005395148,0.007614819,0.0036978105,0.0068137986,0.017844526],"category_scores_gemma":[0.05823624,0.0014878856,0.0048417714,0.002759699,0.014630841,0.03852257,0.01219647,0.01598845,0.00450682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004827369,0.000026560827,0.00012976684,0.00016950663,0.000032538133,0.000109207016,0.0002980142,0.0010358641,0.00035485823,0.9838795,0.005873897,0.0080420915],"study_design_scores_gemma":[0.00002200137,0.000013570882,0.000025771658,0.00004444704,0.0000110321025,0.0000773041,0.00002089466,0.00326978,0.00038983652,0.99168956,0.004421357,0.000014296998],"about_ca_topic_score_codex":0.001114769,"about_ca_topic_score_gemma":0.0010552347,"teacher_disagreement_score":0.017923066,"about_ca_system_score_codex":0.003716661,"about_ca_system_score_gemma":0.0045369435,"threshold_uncertainty_score":0.09478742},"labels":[],"label_agreement":null},{"id":"W4405717558","doi":"10.1109/tdsc.2024.3521396","title":"Accurate, Secure, and Efficient Semi-Constrained Navigation Over Encrypted City Maps","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Computer security; Cryptography","score_opus":0.011976739952560052,"score_gpt":0.24859856098935149,"score_spread":0.23662182103679144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04395411,0.0003777078,0.94549876,0.0003225617,0.00007568924,0.00023322731,0.0006085451,0.0028799088,0.006049431],"genre_scores_gemma":[0.6891082,0.00041713272,0.30255058,0.00014643588,0.000040898445,0.0002501973,0.0010835201,0.00016675008,0.0062362454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889416,0.00016709638,0.00010090131,0.00018906822,0.00041610503,0.00023276445],"domain_scores_gemma":[0.9983663,0.00031820734,0.00015528714,0.00081542373,0.00026165886,0.000083063744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046932756,0.0007747831,0.00096730987,0.0004968449,0.00086366874,0.0013039378,0.0015084529,0.00075091585,0.0025827535],"category_scores_gemma":[0.0029285944,0.00029685604,0.0005345728,0.00087731227,0.0007902454,0.0028237847,0.004166163,0.0011486356,0.0011844034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096095813,0.00020200912,0.0036375292,0.00065344153,0.00010680164,0.00058403297,0.0009378189,0.42302415,0.043791223,0.12104136,0.017501084,0.38755953],"study_design_scores_gemma":[0.000037114565,0.00012827423,0.0004537276,0.000032644595,0.00002097635,0.00028747812,0.00021890443,0.9443849,0.01674988,0.027585566,0.010055541,0.00004498587],"about_ca_topic_score_codex":0.0040240716,"about_ca_topic_score_gemma":0.0070545175,"teacher_disagreement_score":0.0040240716,"about_ca_system_score_codex":0.00093889394,"about_ca_system_score_gemma":0.0025023024,"threshold_uncertainty_score":0.00864017},"labels":[],"label_agreement":null},{"id":"W4405723639","doi":"10.17223/20710410/61/4","title":"ID-based public key cryptographic systems","year":2023,"lang":"en","type":"article","venue":"PRIKLADNAYa DISKRETNAYa MATEMATIKA","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Réseau québécois de recherche sur la douleur; Russian Science Foundation; Israel Science Foundation","keywords":"Computer science; Key escrow; Public-key cryptography; Key (lock); Cryptography; Key management; Computer security; Cryptosystem; Digital signature; Cryptographic primitive; Certificate authority; Implicit certificate; Encryption; Theoretical computer science; Cryptographic protocol","score_opus":0.029094326504591525,"score_gpt":0.2452209430846775,"score_spread":0.21612661658008597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405723639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054842494,0.01678332,0.8882448,0.0033801598,0.0010491618,0.00035583836,0.00035306788,0.0012394316,0.08310998],"genre_scores_gemma":[0.32938716,0.033744514,0.57679826,0.0021335795,0.0019414091,0.00075566367,0.0010756935,0.00023340173,0.053930283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671185,0.00081813365,0.0003593977,0.0005020519,0.0012778066,0.00033073907],"domain_scores_gemma":[0.9977556,0.00069686974,0.00019809305,0.0008670009,0.00038993504,0.00009261937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026504982,0.0008568562,0.0009169644,0.002049209,0.0019006416,0.005019242,0.0017170954,0.0020471993,0.0070067113],"category_scores_gemma":[0.0043322197,0.00064015895,0.0009072972,0.0028991438,0.002914102,0.009481476,0.00444492,0.0037156278,0.0058811717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027759128,0.000021915783,0.000072828894,0.00017591722,0.000008881789,0.00006327912,0.00011751169,0.001395315,0.0013763281,0.9569812,0.0036909704,0.036068045],"study_design_scores_gemma":[0.000053111602,0.000096769596,0.00012647583,0.00020206327,0.000033729506,0.0008908807,0.0000869866,0.024332568,0.010096147,0.59415287,0.36985585,0.00007251137],"about_ca_topic_score_codex":0.00032163394,"about_ca_topic_score_gemma":0.00016572008,"teacher_disagreement_score":0.0070067113,"about_ca_system_score_codex":0.0023321353,"about_ca_system_score_gemma":0.0016499825,"threshold_uncertainty_score":0.023439765},"labels":[],"label_agreement":null},{"id":"W4406110764","doi":"10.37256/cnc.3120255530","title":"A Novel Approach to Enhance the Security and Efficiency of Binary Ring-LWE for IoT Resource-Constrained","year":2025,"lang":"en","type":"article","venue":"Computer Networks and Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encryption; Shuffling; Cryptography; Side channel attack; Quantum computer; Computation; Learning with errors; Distributed computing; Theoretical computer science; Computer engineering; Computer network; Quantum; Computer security; Algorithm","score_opus":0.015456914019828258,"score_gpt":0.2701407660104506,"score_spread":0.2546838519906224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406110764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07186104,0.00047540708,0.920476,0.0003043078,0.000072097966,0.00007582366,0.000040830364,0.00047336848,0.006221074],"genre_scores_gemma":[0.68632215,0.0002443233,0.3095756,0.00014733814,0.000047232566,0.000055465465,0.000047795576,0.000041421452,0.0035187386],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996124,0.00011861816,0.000021894204,0.000060907834,0.00013712395,0.000049078797],"domain_scores_gemma":[0.9995821,0.00012650188,0.00005764165,0.0001267087,0.00007631109,0.00003078038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054479815,0.00034241713,0.0003869381,0.00044865807,0.00044066526,0.0005746495,0.00063435786,0.0004002933,0.00220969],"category_scores_gemma":[0.0010645894,0.00014948848,0.0003119742,0.00042862538,0.00066738506,0.001656212,0.0009231099,0.0005712563,0.0004762675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081388146,0.00030207649,0.0014438996,0.00041982307,0.00010024235,0.00036841302,0.00027727048,0.07719498,0.38116503,0.23272635,0.0029908824,0.30219716],"study_design_scores_gemma":[0.0000920347,0.0005343699,0.00055872387,0.00003988804,0.00004014032,0.0010234634,0.000071366216,0.7955968,0.14248773,0.046483513,0.012993761,0.00007818008],"about_ca_topic_score_codex":0.00013365991,"about_ca_topic_score_gemma":0.00024417925,"teacher_disagreement_score":0.00220969,"about_ca_system_score_codex":0.00026777777,"about_ca_system_score_gemma":0.00038614494,"threshold_uncertainty_score":0.007392168},"labels":[],"label_agreement":null},{"id":"W4406142074","doi":"10.1137/1.9781611978322.94","title":"Almost Tight Bounds for Differentially Private Densest Subgraph","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.038392247405787894,"score_gpt":0.236894613695728,"score_spread":0.1985023662899401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406142074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042645868,0.00750181,0.87066907,0.010936722,0.00064532814,0.00030571458,0.0012017906,0.0016827689,0.064410895],"genre_scores_gemma":[0.72584236,0.010142402,0.21983287,0.006727793,0.0026403677,0.00081112015,0.0017321678,0.0016268454,0.030643994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98934233,0.0027004532,0.00030382533,0.0022678534,0.0040277177,0.0013577928],"domain_scores_gemma":[0.9538065,0.0320156,0.0017173158,0.009161944,0.00184023,0.0014583011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008563544,0.0031331093,0.0040434008,0.0020755127,0.002661681,0.008164597,0.0064553344,0.004487641,0.011658126],"category_scores_gemma":[0.044608872,0.0017121785,0.0029529217,0.0049993284,0.007060478,0.025536338,0.010962446,0.015362478,0.0036729644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008533257,0.00037962696,0.0010778209,0.0007869258,0.00016807651,0.00023238287,0.00047266792,0.09607822,0.005143377,0.79228777,0.024135685,0.078384236],"study_design_scores_gemma":[0.000068943365,0.000102560174,0.0002916751,0.00011753245,0.00008449542,0.00028971094,0.00007002686,0.1448824,0.0031715338,0.8415591,0.00931831,0.000043768978],"about_ca_topic_score_codex":0.0010827886,"about_ca_topic_score_gemma":0.0010917797,"teacher_disagreement_score":0.011658126,"about_ca_system_score_codex":0.0076156184,"about_ca_system_score_gemma":0.0029711993,"threshold_uncertainty_score":0.055255413},"labels":[],"label_agreement":null},{"id":"W4406238693","doi":"10.1007/978-3-030-71522-9_239","title":"Commitment","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Political science","score_opus":0.015412705622892726,"score_gpt":0.23011152174044733,"score_spread":0.2146988161175546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406238693","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085931347,0.00019270886,0.017725732,0.0017648764,0.0008119841,0.00012432352,0.0007792022,0.0004903482,0.9772515],"genre_scores_gemma":[0.021424523,0.00031423755,0.0045955097,0.0008187997,0.00033264566,0.00017811675,0.001009515,0.00049979414,0.970827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863595,0.00023188682,0.000048644375,0.00038219788,0.0005311289,0.00017008228],"domain_scores_gemma":[0.99836725,0.00029927012,0.00005681671,0.0006117204,0.0005093456,0.00015560408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009558653,0.0009315628,0.0006313987,0.0009812644,0.0025968764,0.0046893763,0.001996116,0.0012912736,0.3499782],"category_scores_gemma":[0.0039729,0.00054760795,0.0006501454,0.0010887303,0.0018065132,0.0057167006,0.0036689774,0.0046843207,0.19951925],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005601565,0.000034132852,0.000045901743,0.00007209481,0.000004955034,0.00003347889,0.00019261526,0.00015433753,0.0007177115,0.77042264,0.18406536,0.04420073],"study_design_scores_gemma":[0.0000173123,0.000017956541,0.00008375543,0.000046118523,0.0000060148145,0.00008530658,0.00014903124,0.00042157978,0.0010636693,0.30211586,0.69597936,0.000013947342],"about_ca_topic_score_codex":0.0012847737,"about_ca_topic_score_gemma":0.0013293377,"teacher_disagreement_score":0.3499782,"about_ca_system_score_codex":0.0016899317,"about_ca_system_score_gemma":0.0015115443,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4406238788","doi":"10.1007/978-3-030-71522-9_69","title":"Certificate","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.05583982160351332,"score_gpt":0.24672277470319515,"score_spread":0.19088295309968184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406238788","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077159464,0.00021767893,0.013684369,0.0013556005,0.00080779253,0.00018668264,0.0024278318,0.0018353345,0.97871315],"genre_scores_gemma":[0.015211701,0.00041723487,0.0037745454,0.00047851566,0.00024485064,0.00013861993,0.003230152,0.00067009754,0.97583425],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877924,0.00015087845,0.00004191362,0.00028701223,0.00055749464,0.00018349923],"domain_scores_gemma":[0.99834406,0.00023084634,0.00005795598,0.0006715095,0.0005582914,0.00013732453],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007462316,0.0010289418,0.000795576,0.0015298765,0.0015584172,0.00460442,0.0016244511,0.0012653755,0.43405557],"category_scores_gemma":[0.0039970744,0.00041047958,0.0006452162,0.0018526369,0.0012044453,0.0051622307,0.0028972838,0.0027220375,0.34626734],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109513836,0.00006655387,0.000101294754,0.00015030864,0.0000048448137,0.00006192562,0.00011817217,0.00039767387,0.0011552498,0.3919049,0.506982,0.09894757],"study_design_scores_gemma":[0.000021416678,0.000017571023,0.00008707488,0.000039967807,0.0000043467453,0.00012362942,0.000039032013,0.00035542375,0.0016122779,0.0447457,0.9529439,0.000009596702],"about_ca_topic_score_codex":0.0021906798,"about_ca_topic_score_gemma":0.0020340618,"teacher_disagreement_score":0.43405557,"about_ca_system_score_codex":0.0017782004,"about_ca_system_score_gemma":0.0023993817,"threshold_uncertainty_score":0.80725104},"labels":[],"label_agreement":null},{"id":"W4406239007","doi":"10.1007/978-3-030-71522-9_1475","title":"Private Range Queries","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Range (aeronautics); Computer science; Materials science; Composite material","score_opus":0.01295960121772903,"score_gpt":0.22126524733396596,"score_spread":0.20830564611623692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406239007","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031156007,0.004896216,0.19541039,0.0027380115,0.00073961995,0.00019215253,0.0015719449,0.002122059,0.789214],"genre_scores_gemma":[0.0825318,0.009035083,0.084423326,0.0019029086,0.0010036827,0.00027156595,0.004477449,0.0013801876,0.8149739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894136,0.00015174922,0.000044001576,0.00017572069,0.0005873881,0.00009969159],"domain_scores_gemma":[0.99923146,0.00029159727,0.000026494927,0.00028376086,0.00013708517,0.000029615632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056965806,0.0010036018,0.0007717307,0.0012333773,0.0010529191,0.0039552627,0.0011834849,0.0010693173,0.081139475],"category_scores_gemma":[0.002544541,0.00053919636,0.0005732455,0.0027920178,0.0012931253,0.008530346,0.0024495614,0.0027366404,0.040813487],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058779147,0.000056541052,0.00008094954,0.00020054339,0.000008421816,0.000052194966,0.0002194714,0.0013015565,0.00216607,0.5971095,0.16585147,0.2328945],"study_design_scores_gemma":[0.000016141159,0.000023423781,0.000114244605,0.00011397167,0.0000118937805,0.00040630938,0.000098267905,0.0053442367,0.0028331566,0.38135126,0.6096691,0.000018021781],"about_ca_topic_score_codex":0.00061385526,"about_ca_topic_score_gemma":0.0007360125,"teacher_disagreement_score":0.081139475,"about_ca_system_score_codex":0.0013728315,"about_ca_system_score_gemma":0.00076084567,"threshold_uncertainty_score":0.2714386},"labels":[],"label_agreement":null},{"id":"W4406241486","doi":"10.1007/978-3-030-71522-9_148","title":"Identity-Based Encryption: Historical Perspective and Hierarchical Systems","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Perspective (graphical); Identity (music); Encryption; Computer science; Sociology; Computer security; Art; Aesthetics; Artificial intelligence","score_opus":0.01601934330556115,"score_gpt":0.24330713266805543,"score_spread":0.22728778936249427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406241486","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036740776,0.14507319,0.07772357,0.006797391,0.002260007,0.00007769133,0.00015413958,0.00021279784,0.76402724],"genre_scores_gemma":[0.21179828,0.2476216,0.06265523,0.004314634,0.0046980567,0.0001872188,0.00037525358,0.0002633552,0.4680864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994312,0.00015311016,0.00003324678,0.00009887429,0.00021395029,0.00006956489],"domain_scores_gemma":[0.9994375,0.0002993822,0.000037058933,0.00010118762,0.00009817191,0.000026626547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068526046,0.0006673396,0.0004148255,0.0011976355,0.0012988719,0.0048683714,0.0010332429,0.0016194314,0.00942169],"category_scores_gemma":[0.0015027119,0.00042039767,0.00028091128,0.0029369395,0.0048689763,0.0073126396,0.0013024638,0.0034150095,0.0043611852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029331172,0.000006309287,0.000019221285,0.000043490138,9.2277736e-7,0.0000114616605,0.0001619338,0.00025015319,0.00007382874,0.97671586,0.0064015957,0.016312372],"study_design_scores_gemma":[0.0000034434106,0.000018691715,0.00013246633,0.00017903082,0.0000035976466,0.00018698767,0.00015249079,0.0013564228,0.0003388836,0.59524083,0.4023777,0.000009415543],"about_ca_topic_score_codex":0.0021013843,"about_ca_topic_score_gemma":0.0016352074,"teacher_disagreement_score":0.00942169,"about_ca_system_score_codex":0.00284789,"about_ca_system_score_gemma":0.0013900243,"threshold_uncertainty_score":0.031518638},"labels":[],"label_agreement":null},{"id":"W4406241510","doi":"10.1007/978-3-030-71522-9_79","title":"Identity Verification Protocol","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Protocol (science); Computer science; Identity (music); Computer security; Art; Medicine; Aesthetics","score_opus":0.018730086909722922,"score_gpt":0.28394962086766573,"score_spread":0.2652195339579428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406241510","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004875996,0.0015972209,0.41152143,0.0025285047,0.0012085097,0.000767389,0.0018740322,0.0024651054,0.57316196],"genre_scores_gemma":[0.19283988,0.0037079344,0.15609099,0.0017936984,0.0004950657,0.0013361376,0.0042025,0.00076233345,0.6387715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988574,0.00027103088,0.000055850007,0.0002044575,0.00047078103,0.00014049545],"domain_scores_gemma":[0.9991973,0.00023986002,0.000035771485,0.00032313683,0.00016496584,0.00003900089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009192085,0.0007547476,0.0005662012,0.0009833664,0.001935506,0.0029134012,0.0011628872,0.0012813654,0.05039573],"category_scores_gemma":[0.002149788,0.00041628632,0.00045805564,0.0014367835,0.0013478647,0.0046453197,0.003094297,0.0029128941,0.028268058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006516501,0.000062581385,0.000060153627,0.00014139981,0.00000739844,0.000093443785,0.00018441079,0.0009501063,0.0025120715,0.8529441,0.045460362,0.09751887],"study_design_scores_gemma":[0.000041613046,0.00006502454,0.0001459596,0.00014079928,0.000026865559,0.0004911904,0.00011165004,0.0090572005,0.013623336,0.441843,0.53441495,0.00003838293],"about_ca_topic_score_codex":0.00057518954,"about_ca_topic_score_gemma":0.00052834966,"teacher_disagreement_score":0.05039573,"about_ca_system_score_codex":0.0009662842,"about_ca_system_score_gemma":0.0016596628,"threshold_uncertainty_score":0.16859049},"labels":[],"label_agreement":null},{"id":"W4406257454","doi":"10.1007/978-3-030-71522-9_95","title":"Schnorr Identification Protocol","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Identification (biology); Protocol (science); Medicine; Biology","score_opus":0.0142982923824648,"score_gpt":0.2664348048967796,"score_spread":0.2521365125143148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406257454","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066201687,0.002709956,0.26266116,0.002819009,0.0008883777,0.0003425578,0.00091247953,0.002457849,0.7205884],"genre_scores_gemma":[0.17231235,0.005533712,0.09982925,0.0016999634,0.0005878237,0.00048403442,0.0017041236,0.0007148231,0.71713394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928135,0.00012928552,0.00003089665,0.00010120298,0.00036188253,0.00009548265],"domain_scores_gemma":[0.99951816,0.00013960665,0.000028132965,0.00017099288,0.00011622498,0.00002689853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005547487,0.0009098349,0.00049978937,0.0012945622,0.0016984377,0.0021241736,0.0009705954,0.0010765884,0.039295744],"category_scores_gemma":[0.0012821754,0.00042211157,0.0003692628,0.0018997623,0.001396774,0.004088522,0.0018733141,0.0023439918,0.020479338],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061400795,0.000036283967,0.00003623569,0.00015440368,0.000008534835,0.000074056356,0.00017855916,0.0014956159,0.003975269,0.85711557,0.041860804,0.09500324],"study_design_scores_gemma":[0.000019576386,0.000054307795,0.000116394964,0.000104284445,0.000027104186,0.00042291908,0.000114534276,0.0067557245,0.015543743,0.5131688,0.46362218,0.000050427218],"about_ca_topic_score_codex":0.0006719867,"about_ca_topic_score_gemma":0.00086207985,"teacher_disagreement_score":0.039295744,"about_ca_system_score_codex":0.0013010299,"about_ca_system_score_gemma":0.0015029967,"threshold_uncertainty_score":0.13145733},"labels":[],"label_agreement":null},{"id":"W4406257831","doi":"10.1007/978-3-030-71522-9_250","title":"Elliptic Curve Public-Key Encryption Schemes","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key (lock); Public-key cryptography; Encryption; Computer science; Political science; Computer security","score_opus":0.02174738287935571,"score_gpt":0.23146816019442215,"score_spread":0.20972077731506644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406257831","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028002195,0.017864885,0.09539607,0.0023846612,0.0017786806,0.00012891614,0.0004760815,0.00081051997,0.87836003],"genre_scores_gemma":[0.03343229,0.024120685,0.03140545,0.00075003057,0.0008924315,0.000093580304,0.0007087304,0.00030402947,0.9082927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996118,0.000044651963,0.00001425019,0.000044698998,0.0002529906,0.000031614163],"domain_scores_gemma":[0.9997341,0.00009604522,0.00001507659,0.0000795987,0.000061064035,0.000014078078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035094042,0.00078968535,0.0004891479,0.00089075876,0.0006343053,0.001884641,0.00068454567,0.00072642835,0.03942453],"category_scores_gemma":[0.00089100027,0.00039740815,0.00029897373,0.002048211,0.00092371827,0.004078419,0.0011724355,0.0020624462,0.025472159],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003621833,0.000069350936,0.0000486291,0.00039840568,0.000009088703,0.00007339785,0.0002024654,0.0015832883,0.0035398896,0.5569945,0.130258,0.3067868],"study_design_scores_gemma":[0.000010163471,0.000021656426,0.000085718195,0.00015280454,0.0000049024966,0.00026311743,0.000030901338,0.001450186,0.002453488,0.15122928,0.8442872,0.000010541744],"about_ca_topic_score_codex":0.00017637713,"about_ca_topic_score_gemma":0.00023904853,"teacher_disagreement_score":0.03942453,"about_ca_system_score_codex":0.0008951762,"about_ca_system_score_gemma":0.00058301084,"threshold_uncertainty_score":0.13188821},"labels":[],"label_agreement":null},{"id":"W4406460281","doi":"10.1109/tps-isa62245.2024.00066","title":"Simulation of Quantum Homomorphic Encryption: Demonstration and Analysis","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Homomorphic encryption; Computer science; Theoretical computer science; Encryption; Quantum; Computer security; Physics; Quantum mechanics","score_opus":0.01759869261925343,"score_gpt":0.2670834406883886,"score_spread":0.24948474806913515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406460281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64202416,0.00025406483,0.3211545,0.0017141529,0.00019015215,0.00028306176,0.0009324613,0.0032473544,0.030200016],"genre_scores_gemma":[0.9782793,0.00005495593,0.01975501,0.0000778621,0.000008403999,0.000086298416,0.00016992104,0.00011995229,0.0014483939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943596,0.00011041644,0.000020304846,0.000056237943,0.00026713172,0.0001099567],"domain_scores_gemma":[0.99832493,0.0010021987,0.00009386499,0.00024688803,0.00023415046,0.00009800897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068419805,0.00037241945,0.0004898527,0.00028039966,0.0004936906,0.0005411341,0.0012151385,0.001069836,0.0057700532],"category_scores_gemma":[0.0038076455,0.00022210866,0.00041763636,0.00028437775,0.0010405023,0.0010188969,0.0011955776,0.0011877245,0.0003709688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004298031,0.0003415534,0.004383678,0.00023515963,0.000060981838,0.00052737846,0.00027399606,0.80468255,0.022790939,0.14911278,0.0043072207,0.012853904],"study_design_scores_gemma":[0.00002731657,0.00002884385,0.00014040226,0.000003559185,0.0000020189814,0.000024560108,0.000009639521,0.9893036,0.0041165836,0.005966955,0.00037203042,0.000004585477],"about_ca_topic_score_codex":0.0032949473,"about_ca_topic_score_gemma":0.0018859439,"teacher_disagreement_score":0.0057700532,"about_ca_system_score_codex":0.00063307537,"about_ca_system_score_gemma":0.0009884279,"threshold_uncertainty_score":0.019302785},"labels":[],"label_agreement":null},{"id":"W4406562693","doi":"10.1016/j.iot.2025.101499","title":"Secure and Efficient Lightweight Authentication Protocol (SELAP) for multi-sector IoT applications","year":2025,"lang":"en","type":"article","venue":"Internet of Things","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vanier College; Université du Québec à Montréal","funders":"Shahid Rajaee Teacher Training University","keywords":"Computer science; Authentication protocol; Protocol (science); Internet of Things; Authentication (law); Computer security; Computer network; Embedded system; Medicine","score_opus":0.016838475709022704,"score_gpt":0.30222279058945983,"score_spread":0.28538431488043714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406562693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12532674,0.0016399479,0.85318804,0.0010043524,0.0005883926,0.00044940377,0.00035516795,0.0056428993,0.011805046],"genre_scores_gemma":[0.9443648,0.00038148175,0.046150185,0.0001931511,0.00009119141,0.00021134826,0.00033705786,0.00009080125,0.008180065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990269,0.00023484776,0.000108889355,0.00009008084,0.00033349608,0.00020583892],"domain_scores_gemma":[0.9986168,0.00021964569,0.00019524909,0.000503866,0.0003767629,0.00008763163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011705228,0.00054175255,0.0004487701,0.0008428303,0.0010380766,0.001466441,0.00088948564,0.00071612827,0.0033951502],"category_scores_gemma":[0.0016846282,0.00026583765,0.00039887585,0.00071133947,0.0005843109,0.0032040454,0.0030617001,0.0012553296,0.0018310734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028231665,0.00045095576,0.005522265,0.0009506867,0.00018135799,0.0019588375,0.00073508365,0.029547205,0.28165305,0.1416773,0.02476199,0.5097381],"study_design_scores_gemma":[0.0002525052,0.001645289,0.0036030272,0.00019679863,0.00027792415,0.003187594,0.00077266706,0.55598146,0.25620148,0.101003684,0.076661356,0.00021615833],"about_ca_topic_score_codex":0.00029381315,"about_ca_topic_score_gemma":0.00040337615,"teacher_disagreement_score":0.0033951502,"about_ca_system_score_codex":0.00045124913,"about_ca_system_score_gemma":0.0012748489,"threshold_uncertainty_score":0.0113579035},"labels":[],"label_agreement":null},{"id":"W4407605941","doi":"10.1007/978-3-031-78679-2_10","title":"Subset-Optimized BLS Multi-signature with Key Aggregation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nicolet Chartrand Knoll (Canada)","funders":"Vlaamse regering; KU Leuven","keywords":"Computer science; Signature (topology); Key (lock); Computer security; Mathematics","score_opus":0.012269784931294757,"score_gpt":0.23535015857275624,"score_spread":0.22308037364146147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407605941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05584886,0.00060902117,0.9172482,0.00047444025,0.00039965674,0.0002908066,0.00091125513,0.008471685,0.015746128],"genre_scores_gemma":[0.62514853,0.00020324293,0.35342288,0.0002712009,0.0001658248,0.00019569538,0.0017168563,0.0005416473,0.018334173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735546,0.00043503984,0.00024445055,0.00040045445,0.0010897296,0.0004748254],"domain_scores_gemma":[0.9976344,0.00023347003,0.00017254219,0.0013991699,0.00044962586,0.00011068234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088039314,0.0008533709,0.0014767178,0.0010050179,0.0009392089,0.0019177739,0.0014792483,0.00071581994,0.007985879],"category_scores_gemma":[0.0020528545,0.00042659242,0.0007642647,0.0017755614,0.00062919135,0.0028846723,0.0036339662,0.0012677152,0.0043718633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003208036,0.000370836,0.0009989281,0.00041667145,0.00015677996,0.00024890082,0.0002622826,0.05118967,0.11774198,0.08122046,0.022041272,0.72214425],"study_design_scores_gemma":[0.00036731205,0.0009182658,0.0012509255,0.000073323405,0.00015550213,0.0010298556,0.00035406128,0.67591876,0.1402445,0.14221446,0.037328888,0.000144133],"about_ca_topic_score_codex":0.000736238,"about_ca_topic_score_gemma":0.0014225303,"teacher_disagreement_score":0.007985879,"about_ca_system_score_codex":0.00108641,"about_ca_system_score_gemma":0.002030844,"threshold_uncertainty_score":0.026715457},"labels":[],"label_agreement":null},{"id":"W4407900371","doi":"10.1109/jiot.2025.3544071","title":"Efficient and Privacy-Preserving Weighted Nearby-Fit Spatial Keyword Query in Cloud","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China; National Foundation for Science and Technology Development","keywords":"Computer science; Cloud computing; Information privacy; Web search query; Privacy protection; Data mining; Information retrieval; Computer security; Search engine","score_opus":0.01178776353657656,"score_gpt":0.25442079883079216,"score_spread":0.2426330352942156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407900371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11732587,0.0013659302,0.87118596,0.0009935249,0.00012357096,0.00040568708,0.0019048247,0.0018643816,0.004830298],"genre_scores_gemma":[0.8091614,0.0006663464,0.18441664,0.00036592424,0.00007626287,0.00017802439,0.0013909477,0.00012492844,0.003619568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960188,0.00054202584,0.0004677693,0.0007161957,0.0015992676,0.00065594265],"domain_scores_gemma":[0.9961163,0.00094010093,0.00035999002,0.0016876948,0.00069511833,0.00020071922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014457131,0.0006108811,0.0018756086,0.00080719433,0.0015456701,0.001986074,0.0022830477,0.0012947028,0.0017922958],"category_scores_gemma":[0.0058597885,0.00040400386,0.0008543859,0.003262809,0.0009779739,0.0070617357,0.004573235,0.0013159058,0.0008884091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041761394,0.0005336921,0.00811111,0.00090251205,0.0002589197,0.0019566284,0.0030790044,0.19473627,0.12848933,0.18005845,0.021307651,0.45639035],"study_design_scores_gemma":[0.00020399895,0.00037444368,0.0012897226,0.000051555948,0.00010311854,0.0016947539,0.0011391193,0.8591599,0.042643603,0.078311644,0.014878256,0.00014985597],"about_ca_topic_score_codex":0.005185515,"about_ca_topic_score_gemma":0.004580223,"teacher_disagreement_score":0.005185515,"about_ca_system_score_codex":0.0015791707,"about_ca_system_score_gemma":0.0024130864,"threshold_uncertainty_score":0.011457682},"labels":[],"label_agreement":null},{"id":"W4407946271","doi":"10.1109/jiot.2025.3545574","title":"FAA-CLIP: Federated Adversarial Adaptation of CLIP","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Specific Research Project of Guangxi for Research Bases and Talents; National Natural Science Foundation of China","keywords":"Computer science; Adversarial system; Adaptation (eye); Computer security; Computer network; Artificial intelligence","score_opus":0.014987912551973355,"score_gpt":0.2580977536005691,"score_spread":0.24310984104859573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407946271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010112451,0.00019506773,0.9841765,0.00027603382,0.000105902254,0.00009041668,0.00013531715,0.0032662137,0.0016420343],"genre_scores_gemma":[0.61687267,0.0002589707,0.36702687,0.0016050517,0.00025834746,0.00049338693,0.0013885656,0.0005927974,0.011503295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993186,0.00016734906,0.000026473292,0.00021172281,0.00017981179,0.000096166776],"domain_scores_gemma":[0.99873227,0.00054868223,0.00009254626,0.00030846224,0.00023249334,0.000085533364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013544313,0.0012373138,0.000933658,0.0003780316,0.00042242912,0.000761226,0.0023472803,0.0013710781,0.0033917993],"category_scores_gemma":[0.0039466214,0.00043636933,0.00080203015,0.00040896138,0.00089493446,0.0013447009,0.0023073151,0.0029720315,0.0011846455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018769504,0.00016151648,0.0010110032,0.00007217563,0.00013704837,0.00020347192,0.000090379195,0.76142067,0.007096272,0.0078275,0.015997818,0.20579448],"study_design_scores_gemma":[0.0000052260066,0.000022586264,0.00006460273,0.0000026514563,0.0000041854964,0.000024155432,0.000004744517,0.99628687,0.0011403328,0.001832705,0.00060627627,0.0000057095695],"about_ca_topic_score_codex":0.0051776054,"about_ca_topic_score_gemma":0.0052448437,"teacher_disagreement_score":0.0051776054,"about_ca_system_score_codex":0.00075811136,"about_ca_system_score_gemma":0.0011614221,"threshold_uncertainty_score":0.011346698},"labels":[],"label_agreement":null},{"id":"W4408040452","doi":"10.1007/978-3-031-81824-0_16","title":"Ursa Minor: The Implementation Framework for Polaris","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Minor (academic); Operating system; Humanities; Art","score_opus":0.01505837408913735,"score_gpt":0.29469637401079607,"score_spread":0.2796379999216587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408040452","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002950175,0.0005375989,0.70135754,0.0003525656,0.00050249463,0.0002508586,0.0025257345,0.24140978,0.050113227],"genre_scores_gemma":[0.11920144,0.0017906076,0.5569092,0.0017167813,0.00042501907,0.0014024968,0.018034197,0.15142614,0.14909413],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894696,0.00019007947,0.00008553225,0.00019997722,0.00037803798,0.00019946047],"domain_scores_gemma":[0.9991843,0.00016359986,0.00004642784,0.00032928723,0.00020650432,0.00006977651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011172035,0.0015547563,0.0008597756,0.0010816993,0.0008631455,0.0031637314,0.002922081,0.0011771931,0.0772957],"category_scores_gemma":[0.0030651707,0.0013347008,0.001399949,0.0009605176,0.00083952997,0.0037421538,0.0030605756,0.0024187234,0.06300188],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014245679,0.00020722764,0.0013608218,0.0009198031,0.00012698959,0.00031835854,0.00060857425,0.0044582095,0.020863215,0.1623206,0.39169177,0.4156999],"study_design_scores_gemma":[0.00029901692,0.00015373866,0.0005033743,0.0002551819,0.00008454518,0.0005571341,0.00016389573,0.03605318,0.052462045,0.066366926,0.8429811,0.000119815406],"about_ca_topic_score_codex":0.00231067,"about_ca_topic_score_gemma":0.0023077817,"teacher_disagreement_score":0.0772957,"about_ca_system_score_codex":0.0009187887,"about_ca_system_score_gemma":0.0015771346,"threshold_uncertainty_score":0.25857985},"labels":[],"label_agreement":null},{"id":"W4408107987","doi":"10.1016/j.suscom.2025.101107","title":"Secured user authentication and data sharing for mobile cloud computing using 2C-Cubehash and PWCC","year":2025,"lang":"en","type":"article","venue":"Sustainable Computing Informatics and Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PotashCorp (Canada)","funders":"","keywords":"Computer science; Cloud computing; Authentication (law); Data sharing; Mobile cloud computing; Computer network; Computer security; Operating system","score_opus":0.02831750202727509,"score_gpt":0.31018741919642046,"score_spread":0.2818699171691454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408107987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08394993,0.000777134,0.8954156,0.00075558823,0.00037238488,0.00033790644,0.00030561266,0.001528201,0.01655755],"genre_scores_gemma":[0.8408033,0.00027431318,0.15259182,0.00021380612,0.00013555175,0.00016623487,0.0003034541,0.000052495532,0.0054591163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984377,0.0003240823,0.00008593569,0.0002804423,0.0005723156,0.00029959224],"domain_scores_gemma":[0.99883944,0.00024664425,0.00009083561,0.00036888197,0.00036221909,0.00009195089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070659147,0.000364642,0.00078565243,0.0009809457,0.0015540465,0.0014274496,0.0008838725,0.000748795,0.003983057],"category_scores_gemma":[0.0019921863,0.00018105417,0.00062996784,0.0013889868,0.0010599388,0.001965187,0.0018309357,0.0009336121,0.0011628667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020040402,0.0004282016,0.002306747,0.00035821318,0.00010619281,0.000986322,0.0006033504,0.08894308,0.087512255,0.33957446,0.015735654,0.46144146],"study_design_scores_gemma":[0.000074976444,0.00044506817,0.00097433745,0.000041478484,0.000036952468,0.0009035613,0.0002663637,0.875622,0.03074026,0.07593771,0.014831596,0.00012574297],"about_ca_topic_score_codex":0.003145387,"about_ca_topic_score_gemma":0.003611748,"teacher_disagreement_score":0.003983057,"about_ca_system_score_codex":0.0010811265,"about_ca_system_score_gemma":0.0027215327,"threshold_uncertainty_score":0.013324618},"labels":[],"label_agreement":null},{"id":"W4409014625","doi":"10.1109/mcom.001.2400062","title":"SGAN-RA: Reconstruction Attack for Big Model in Asynchronous Federated Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"National Natural Science Foundation of China","keywords":"Computer science; Asynchronous communication; Asynchronous learning; Computer network; Distributed computing; Computer security; Synchronous learning; Teaching method","score_opus":0.0471964505767372,"score_gpt":0.3094164440443137,"score_spread":0.26221999346757646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409014625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035588376,0.00014797962,0.96073514,0.0006358242,0.00006490832,0.00007466607,0.000060275343,0.0009982182,0.0016945775],"genre_scores_gemma":[0.93316317,0.00009476304,0.06449322,0.00037641145,0.000040204788,0.00009849447,0.00010421787,0.000054112403,0.001575505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971414,0.001241337,0.00011843987,0.00047611407,0.0007219373,0.00030087432],"domain_scores_gemma":[0.9955147,0.0018471822,0.00038097243,0.0018035294,0.0002713653,0.00018220257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035698933,0.0007382161,0.0009108407,0.00048883696,0.0008614193,0.0010295847,0.0016508404,0.0016364659,0.0012511612],"category_scores_gemma":[0.008587791,0.00028064143,0.0008587046,0.00045035486,0.0017845196,0.003206108,0.0042827446,0.002610438,0.00030353662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096352457,0.00022131085,0.004348499,0.00015475726,0.00019454276,0.0005887324,0.00046455194,0.6106366,0.01575399,0.2116654,0.008394775,0.14661333],"study_design_scores_gemma":[0.000018824745,0.00005980044,0.00014490388,0.000007895523,0.0000074532636,0.00012472471,0.00002543631,0.95929205,0.0039869226,0.03544199,0.00087946665,0.000010461544],"about_ca_topic_score_codex":0.00067270664,"about_ca_topic_score_gemma":0.0006949267,"teacher_disagreement_score":0.0035698933,"about_ca_system_score_codex":0.0009972716,"about_ca_system_score_gemma":0.0010908357,"threshold_uncertainty_score":0.018879592},"labels":[],"label_agreement":null},{"id":"W4409238752","doi":"10.1007/s13389-025-00373-9","title":"Evaluation of encrypted matching criteria using homomorphic encryption based FSM","year":2025,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphic encryption; Encryption; Computer science; Matching (statistics); Theoretical computer science; Cryptography; Algorithm; Mathematics; Computer security; Statistics","score_opus":0.024797880886992283,"score_gpt":0.2977358301225645,"score_spread":0.2729379492355722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409238752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65461177,0.0003853355,0.33853453,0.00015736627,0.000069964386,0.00015638932,0.00016400985,0.00038115328,0.0055394704],"genre_scores_gemma":[0.9673585,0.000052134925,0.031701155,0.000011185946,0.0000071190807,0.000014549735,0.000093152004,0.000013105837,0.000749008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974329,0.00066584896,0.00017902818,0.00020500878,0.001306766,0.00021050023],"domain_scores_gemma":[0.9950525,0.0023264217,0.00034210668,0.0006040909,0.0015362212,0.00013862285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022396403,0.00028206958,0.00060111674,0.0011459909,0.0003642168,0.0012720568,0.0006281814,0.0005474855,0.0022732767],"category_scores_gemma":[0.007992178,0.00009158697,0.00039220566,0.0006810124,0.00044512848,0.0015691321,0.0005668244,0.00027063006,0.00021446486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030919437,0.0006527981,0.014455157,0.00045447765,0.00023630133,0.0004695164,0.00024377991,0.40681309,0.08108828,0.09905272,0.002162425,0.39127952],"study_design_scores_gemma":[0.000044970584,0.000549889,0.0023091931,0.000017114253,0.000039034694,0.0002166584,0.00007134442,0.96029437,0.026523229,0.009145291,0.0007706021,0.000018351182],"about_ca_topic_score_codex":0.0012330883,"about_ca_topic_score_gemma":0.00081534806,"teacher_disagreement_score":0.0022732767,"about_ca_system_score_codex":0.0012077797,"about_ca_system_score_gemma":0.0010674425,"threshold_uncertainty_score":0.011844516},"labels":[],"label_agreement":null},{"id":"W4409506133","doi":"10.1007/s11036-025-02451-y","title":"MAC-UAE: Multi-Level Access Control Based on Updateable Attribute Encryption of Secure Data in Mobile Cloud Center","year":2025,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Encryption; Access control; Computer security; Attribute-based encryption; Computer network; Cloud computing; Center (category theory); Public-key cryptography; Operating system","score_opus":0.02688534914784102,"score_gpt":0.3065482712479824,"score_spread":0.2796629221001414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409506133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12210698,0.002089579,0.8529715,0.00073862425,0.00070980855,0.0005445225,0.00044584292,0.011797449,0.00859567],"genre_scores_gemma":[0.93030196,0.00025050878,0.06377999,0.00020283822,0.000094005234,0.000095128846,0.00028702462,0.000113784634,0.0048747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861014,0.0002658367,0.00013851453,0.00020500895,0.00043705117,0.00034336894],"domain_scores_gemma":[0.99906045,0.00011106382,0.000086657674,0.0003506993,0.00029558214,0.00009543997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011185936,0.00045255737,0.0009197403,0.00080035126,0.0009027188,0.0016841432,0.0013708377,0.0004570625,0.0027053403],"category_scores_gemma":[0.0015776174,0.0001629311,0.00043385787,0.00063497183,0.00060287875,0.0020909929,0.0014806244,0.0010245284,0.00060318626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045645735,0.0009852537,0.0061775674,0.00070192333,0.00032030954,0.0011664837,0.0005940291,0.043838106,0.20581369,0.18317659,0.03560937,0.51705205],"study_design_scores_gemma":[0.00021493378,0.00083651015,0.0022514358,0.000048324026,0.00012678193,0.0013855099,0.00014238496,0.7751592,0.17415786,0.012422083,0.03313508,0.00012004821],"about_ca_topic_score_codex":0.0012208156,"about_ca_topic_score_gemma":0.00093090616,"teacher_disagreement_score":0.0027053403,"about_ca_system_score_codex":0.00070798304,"about_ca_system_score_gemma":0.0010820992,"threshold_uncertainty_score":0.00905025},"labels":[],"label_agreement":null},{"id":"W4409795719","doi":"10.61091/jcmcc127b-372","title":"Security Analysis and Signature Algorithm Design of Gegami’s Identity-Based Chameleon Signature Scheme under Quantum Attack Resistance","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Signature (topology); Merkle signature scheme; Digital Signature Algorithm; Scheme (mathematics); Identity (music); Ring signature; Algorithm; ElGamal signature scheme; Computer science; Schnorr signature; Blind signature; Digital signature; Computer security; Mathematics; Physics; Hash function","score_opus":0.012463662024244714,"score_gpt":0.26915101938875874,"score_spread":0.25668735736451403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409795719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04800358,0.00029562105,0.9461414,0.00040985405,0.000045058972,0.00011480278,0.000043920583,0.00018837057,0.0047573675],"genre_scores_gemma":[0.87973624,0.0004296761,0.11703894,0.00012512041,0.000051865092,0.00015465668,0.00010056554,0.00003558987,0.0023273758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972824,0.00086465554,0.00013785849,0.0004257461,0.0009979506,0.00029139395],"domain_scores_gemma":[0.9985989,0.0005938995,0.00017170112,0.0002859398,0.0002752417,0.000074451986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016218108,0.00047020116,0.0008029485,0.00073504064,0.00072566763,0.0016104432,0.0010833812,0.0011155716,0.0018364612],"category_scores_gemma":[0.0039387397,0.0003433491,0.0008323427,0.00091833837,0.0016704703,0.0026168372,0.0010794855,0.0014037056,0.0004336003],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004604094,0.00010621143,0.0016202432,0.00022801702,0.00008010962,0.00022452755,0.00034062858,0.29532617,0.024027228,0.60309476,0.0018529583,0.07263872],"study_design_scores_gemma":[0.000061446444,0.00014700339,0.00018482792,0.000013229624,0.000020435684,0.00020365343,0.00004082464,0.90179724,0.008772635,0.08655649,0.0021604155,0.000041786272],"about_ca_topic_score_codex":0.0010022073,"about_ca_topic_score_gemma":0.000422156,"teacher_disagreement_score":0.0018364612,"about_ca_system_score_codex":0.0015884875,"about_ca_system_score_gemma":0.0028165192,"threshold_uncertainty_score":0.0115253925},"labels":[],"label_agreement":null},{"id":"W4409846373","doi":"10.1007/978-3-031-91134-7_3","title":"Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Hash function; Zero-knowledge proof; Hash table; Theoretical computer science; Programming language; Algorithm; Cryptography","score_opus":0.011576468564169025,"score_gpt":0.25327885652960985,"score_spread":0.24170238796544083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409846373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0361205,0.0008217923,0.9263345,0.0009939885,0.00023363053,0.00014072997,0.00034367052,0.0024395955,0.032571625],"genre_scores_gemma":[0.8683442,0.00066638784,0.102433905,0.00034117966,0.00019879057,0.00020382427,0.0004575212,0.000393181,0.02696103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683505,0.0006870569,0.0001228608,0.00050503376,0.0011775716,0.00067233853],"domain_scores_gemma":[0.99548596,0.002403495,0.0002064076,0.0014804422,0.00029129683,0.00013238814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016096851,0.0008334185,0.0015664711,0.00074120495,0.0011858704,0.0032972565,0.002234035,0.001987184,0.01216923],"category_scores_gemma":[0.0058339867,0.0008969397,0.0010646188,0.001146355,0.0033570984,0.008313644,0.007216412,0.003944682,0.0036915988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013810489,0.00017865053,0.0004543611,0.0003891614,0.0000972857,0.00033334893,0.00044446252,0.042491112,0.014833945,0.7965311,0.010072932,0.13279262],"study_design_scores_gemma":[0.000081378654,0.00009722609,0.00015150315,0.00006423348,0.000039084578,0.00029630502,0.00005665542,0.1594482,0.014024685,0.8204033,0.0052771154,0.000060279828],"about_ca_topic_score_codex":0.00042442736,"about_ca_topic_score_gemma":0.00038265815,"teacher_disagreement_score":0.01216923,"about_ca_system_score_codex":0.0012314944,"about_ca_system_score_gemma":0.0018102893,"threshold_uncertainty_score":0.04071015},"labels":[],"label_agreement":null},{"id":"W4409851657","doi":"10.1007/978-3-031-91092-0_8","title":"Simultaneous-Message and Succinct Secure Computation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computation; Theoretical computer science; Distributed computing; Computer network; Programming language","score_opus":0.007545865467892893,"score_gpt":0.23756283075323828,"score_spread":0.23001696528534538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409851657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026761612,0.0013196699,0.8649031,0.0019788868,0.0005452479,0.00023886884,0.0007214401,0.0024320257,0.10109918],"genre_scores_gemma":[0.6220479,0.0019284078,0.2272586,0.0008373134,0.0006640278,0.00054921524,0.0014400649,0.0013653003,0.14390922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726653,0.0006026021,0.00016689858,0.00035053224,0.0012640427,0.00034938054],"domain_scores_gemma":[0.9961571,0.001615207,0.00015209467,0.0016519934,0.0003147288,0.00010889367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013831503,0.0014062471,0.0010996824,0.0010294557,0.0013087909,0.0034832337,0.0019261754,0.0015416419,0.018294528],"category_scores_gemma":[0.0058616833,0.00095038355,0.0012353025,0.0022737256,0.0033337576,0.011440348,0.0049553984,0.004552132,0.005659669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020319226,0.000036867707,0.000089255125,0.00014748517,0.000013474763,0.00006575633,0.00015294128,0.0074949455,0.0022659393,0.94013476,0.0063295206,0.043065842],"study_design_scores_gemma":[0.000025307507,0.00002969203,0.0000529306,0.0000334633,0.000015575599,0.00010315604,0.000021930266,0.022966389,0.004492514,0.9602172,0.01202627,0.000015613597],"about_ca_topic_score_codex":0.00046691392,"about_ca_topic_score_gemma":0.0008700134,"teacher_disagreement_score":0.018294528,"about_ca_system_score_codex":0.0018270209,"about_ca_system_score_gemma":0.0017753933,"threshold_uncertainty_score":0.061201334},"labels":[],"label_agreement":null},{"id":"W4410019661","doi":"10.1007/978-981-96-4734-7_1","title":"Extended Policy-Based Sanitizable Signatures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.010024344992909546,"score_gpt":0.2488410271255935,"score_spread":0.23881668213268395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410019661","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026410265,0.0005509368,0.9188502,0.0010203162,0.0006186385,0.00025212183,0.00034579381,0.004410272,0.047541447],"genre_scores_gemma":[0.6476424,0.00079117634,0.28052363,0.0007037005,0.0004262455,0.00040292233,0.00085221254,0.0010179324,0.067639835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577314,0.0008669997,0.00036897455,0.00061168533,0.0018097557,0.0005694461],"domain_scores_gemma":[0.99193656,0.0022943683,0.00035910602,0.0041639456,0.0009826139,0.00026340043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029101255,0.0007745609,0.001079157,0.0008939242,0.0010043412,0.003423057,0.0020239237,0.0015961645,0.009026462],"category_scores_gemma":[0.0066485815,0.00067390146,0.0008120098,0.001248236,0.0028570993,0.0073733805,0.004159557,0.005018816,0.0049693133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007045922,0.00023177301,0.00026928197,0.00022696608,0.000036160818,0.00014240552,0.00039254985,0.02201203,0.011616822,0.79068416,0.00890058,0.16478266],"study_design_scores_gemma":[0.00013404165,0.00020074003,0.0001508362,0.00007813273,0.000043562297,0.0003427378,0.00006434444,0.11752769,0.024331309,0.80869055,0.04837128,0.00006481398],"about_ca_topic_score_codex":0.00028559635,"about_ca_topic_score_gemma":0.00025031966,"teacher_disagreement_score":0.009026462,"about_ca_system_score_codex":0.0015546209,"about_ca_system_score_gemma":0.0019700206,"threshold_uncertainty_score":0.030196548},"labels":[],"label_agreement":null},{"id":"W4410035522","doi":"10.1007/978-3-031-87499-4_26","title":"RouterORAM: An O(1)-Latency and Client-Work ORAM","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Latency (audio); Operating system; Telecommunications","score_opus":0.013707615903691257,"score_gpt":0.24759211449352936,"score_spread":0.2338844985898381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410035522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013271811,0.0016182844,0.73612434,0.00069169916,0.0012588275,0.0008053833,0.0010747752,0.18487614,0.060278766],"genre_scores_gemma":[0.15500823,0.0010226836,0.6417562,0.0014320851,0.0006835114,0.0009472002,0.0032844094,0.022255503,0.17361024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682236,0.0005035567,0.00017971038,0.0005023873,0.0013537292,0.0006382969],"domain_scores_gemma":[0.9973036,0.00038242253,0.00012024086,0.0016083354,0.0003304832,0.0002548613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014443761,0.0028880304,0.002069994,0.0021511242,0.0017925416,0.0048492993,0.010285796,0.0024409413,0.09119383],"category_scores_gemma":[0.004314139,0.0020375184,0.00164903,0.002456414,0.0012601647,0.0073982226,0.008842092,0.0029841636,0.027029477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028543985,0.0007509308,0.001287239,0.0007596428,0.00021621054,0.00030900337,0.00031950526,0.006714826,0.027182233,0.07115112,0.1877044,0.70075047],"study_design_scores_gemma":[0.0010715073,0.001003969,0.0014606289,0.00038625416,0.00051336526,0.0010948116,0.00040925888,0.3813076,0.09723627,0.08295175,0.43214345,0.00042113697],"about_ca_topic_score_codex":0.0033027504,"about_ca_topic_score_gemma":0.0055800155,"teacher_disagreement_score":0.09119383,"about_ca_system_score_codex":0.0020850443,"about_ca_system_score_gemma":0.0020862294,"threshold_uncertainty_score":0.30507374},"labels":[],"label_agreement":null},{"id":"W4410134390","doi":"10.1007/978-3-031-91826-1_8","title":"Dazzle: Improved Adaptive Threshold Signatures from DDH","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision","score_opus":0.012471583490385437,"score_gpt":0.23240417905388475,"score_spread":0.2199325955634993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410134390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023651063,0.0014633066,0.942289,0.0008260109,0.001154562,0.00024989143,0.0007633821,0.011926447,0.017676357],"genre_scores_gemma":[0.3991015,0.0009827686,0.5320165,0.0012071511,0.0007708346,0.00039389875,0.0023454344,0.0017132699,0.06146861],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832505,0.00021701277,0.000103685874,0.00027787822,0.00089314947,0.00018325301],"domain_scores_gemma":[0.9988626,0.00021525302,0.0000676033,0.00059178186,0.00018552714,0.00007716167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007841865,0.00079708075,0.0012832597,0.0009631013,0.00073092186,0.0017400956,0.0017548676,0.0010541084,0.011062693],"category_scores_gemma":[0.0024153085,0.00044243122,0.00051428186,0.0013442374,0.00086937944,0.002923543,0.0039308006,0.0024578609,0.0056134234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014426318,0.00023675285,0.0004450969,0.0004168323,0.000083372106,0.00019334191,0.00021506552,0.017138068,0.064594075,0.1506896,0.03792211,0.72662306],"study_design_scores_gemma":[0.0004960516,0.00084666134,0.0009373331,0.00013913757,0.00012130033,0.0016589025,0.00012406716,0.32001418,0.16024266,0.3253677,0.18982272,0.0002292322],"about_ca_topic_score_codex":0.00029923866,"about_ca_topic_score_gemma":0.00036070883,"teacher_disagreement_score":0.011062693,"about_ca_system_score_codex":0.00080902857,"about_ca_system_score_gemma":0.00096128753,"threshold_uncertainty_score":0.037008345},"labels":[],"label_agreement":null},{"id":"W4410134433","doi":"10.1007/978-3-031-91826-1_11","title":"Faster SCALLOP from Non-prime Conductor Suborders in Medium Sized Quadratic Fields","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Agence Nationale de la Recherche","keywords":"Conductor; Prime (order theory); Scallop; Computer science; Quadratic equation; Geometry; Mathematics; Combinatorics; Fishery","score_opus":0.011822030881131144,"score_gpt":0.24469022439970387,"score_spread":0.2328681935185727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410134433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17933674,0.0021467025,0.66774607,0.0019681202,0.0012466508,0.00022521579,0.0011988729,0.017963508,0.12816814],"genre_scores_gemma":[0.66856813,0.0009077358,0.24778403,0.0009690473,0.0006154067,0.00026591858,0.0021024328,0.00564086,0.073146366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892247,0.00014036035,0.00005565139,0.00014313788,0.0005186179,0.00021981142],"domain_scores_gemma":[0.9975049,0.0010259616,0.0000939691,0.000917703,0.0003246787,0.00013294729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010977837,0.0010433412,0.0011211829,0.0011000669,0.0012282799,0.0020371007,0.0013238746,0.0005801368,0.029073354],"category_scores_gemma":[0.0046464615,0.0005009221,0.00094770116,0.0016582357,0.0014826631,0.005417881,0.0034247702,0.0020901572,0.0065929913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018949965,0.00026288527,0.0016253119,0.00090401253,0.00009779289,0.00042611366,0.0007751087,0.038334873,0.022988314,0.42979032,0.09293363,0.4099666],"study_design_scores_gemma":[0.00025273144,0.00026503915,0.0006485368,0.00016071713,0.000071517214,0.0002691503,0.00022277259,0.14588581,0.02835398,0.7818176,0.041983355,0.00006874707],"about_ca_topic_score_codex":0.0014341432,"about_ca_topic_score_gemma":0.0028382447,"teacher_disagreement_score":0.029073354,"about_ca_system_score_codex":0.0014390773,"about_ca_system_score_gemma":0.0011790954,"threshold_uncertainty_score":0.09726006},"labels":[],"label_agreement":null},{"id":"W4410183472","doi":"10.1007/978-3-031-91832-2_8","title":"Arctic: Lightweight and Stateless Threshold Schnorr Signatures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Drive & Gear (Canada); University of Waterloo","funders":"","keywords":"Stateless protocol; Computer science; Computer network","score_opus":0.009335041738585457,"score_gpt":0.23189141602712102,"score_spread":0.22255637428853556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410183472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022023372,0.0019533334,0.86534697,0.0011691828,0.00082543073,0.00017398244,0.0010290365,0.018959176,0.08851949],"genre_scores_gemma":[0.45533472,0.0024457362,0.34843144,0.0009801673,0.0006603592,0.00031795682,0.0025992382,0.0037759154,0.18545443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820244,0.00026611568,0.00009179248,0.00024307388,0.000949507,0.00024711588],"domain_scores_gemma":[0.99884427,0.00031163092,0.00007664278,0.0004703436,0.00022407649,0.00007290144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090539,0.000824602,0.0008926491,0.0011628052,0.001172364,0.0032482322,0.00151209,0.0010947911,0.014761456],"category_scores_gemma":[0.0032808587,0.0007311531,0.00060983683,0.0016008843,0.0014169033,0.006585865,0.0037691342,0.0022339914,0.011471879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011286379,0.00012322368,0.00025177925,0.00032358136,0.000046612895,0.00015411028,0.0004028401,0.012043595,0.022940645,0.57924896,0.048389032,0.33494696],"study_design_scores_gemma":[0.000102153404,0.00018768219,0.000272104,0.00012909166,0.00006869278,0.00047999693,0.0001507117,0.069291696,0.047641423,0.7070726,0.17447503,0.00012872381],"about_ca_topic_score_codex":0.0009204482,"about_ca_topic_score_gemma":0.0013230167,"teacher_disagreement_score":0.014761456,"about_ca_system_score_codex":0.0013063268,"about_ca_system_score_gemma":0.0017942608,"threshold_uncertainty_score":0.04938197},"labels":[],"label_agreement":null},{"id":"W4410334640","doi":"10.21203/rs.3.rs-6606890/v1","title":"Federated k-Core Decomposition: A Secure Distributed Approach","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Trent University","funders":"","keywords":"Core (optical fiber); Decomposition; Computer science; Distributed computing; Telecommunications; Chemistry","score_opus":0.07323888538053194,"score_gpt":0.402324795870774,"score_spread":0.32908591049024205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410334640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037971977,0.00033317675,0.95416355,0.0003451895,0.00010803491,0.00013705691,0.0001303187,0.0013987351,0.0054119322],"genre_scores_gemma":[0.5652222,0.00021255373,0.42483717,0.00021504918,0.00006038331,0.00014850915,0.00032350386,0.00022588795,0.0087547405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850804,0.00036037428,0.000112650916,0.0003040293,0.00041111046,0.0003037818],"domain_scores_gemma":[0.99786335,0.00025470712,0.00009530607,0.0012623757,0.00037381687,0.00015036952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016117448,0.0006446375,0.0011371537,0.00086655834,0.0013073736,0.0022607946,0.0018219097,0.0011566333,0.004601589],"category_scores_gemma":[0.0023462868,0.00043890707,0.0008214935,0.0010817209,0.0011600339,0.0033397723,0.00399018,0.0016789392,0.0015568822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036813722,0.00067219563,0.0015074271,0.0005083223,0.00027568798,0.0004626933,0.00081432116,0.15127711,0.072636835,0.31171495,0.018248783,0.43820027],"study_design_scores_gemma":[0.00016148979,0.00021358655,0.00041984214,0.00006527373,0.00008908274,0.00039357215,0.00026362162,0.68143636,0.027295385,0.27666667,0.012945156,0.000050035935],"about_ca_topic_score_codex":0.000857236,"about_ca_topic_score_gemma":0.001615902,"teacher_disagreement_score":0.004601589,"about_ca_system_score_codex":0.001010103,"about_ca_system_score_gemma":0.0014521948,"threshold_uncertainty_score":0.015393853},"labels":[],"label_agreement":null},{"id":"W4410955891","doi":"10.3390/cryptography9020037","title":"Enhancing Security for Resource-Constrained Smart Cities IoT Applications: Optimizing Cryptographic Techniques with Effective Field Multipliers","year":2025,"lang":"en","type":"article","venue":"Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Cryptography; Software deployment; Computer security; Distributed computing; Encryption; Resource efficiency; Reconfigurability; Embedded system; Telecommunications","score_opus":0.0044277253413651,"score_gpt":0.23604647635287082,"score_spread":0.23161875101150572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410955891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105872124,0.0024821127,0.8785282,0.0004474892,0.00012024475,0.000108113876,0.000030422561,0.0004076346,0.012003693],"genre_scores_gemma":[0.72949827,0.0018708226,0.26590514,0.00011235357,0.000058224643,0.00007464573,0.00005335392,0.000053563355,0.0023735627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998387,0.000037211426,0.000012256301,0.000021473175,0.00006880242,0.000021514417],"domain_scores_gemma":[0.9996567,0.00012688249,0.000090721995,0.000047442736,0.0000654583,0.000012939569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003582308,0.00057577505,0.00022111047,0.00045399685,0.00022781902,0.0007063107,0.00056366756,0.00035974898,0.0014918597],"category_scores_gemma":[0.0011877493,0.00019355651,0.00021358105,0.00037923467,0.00042152547,0.0014378101,0.00057393685,0.00051650486,0.00059635355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038941923,0.0002258277,0.0018218273,0.0005500002,0.00007480476,0.0002566312,0.00019144814,0.2353812,0.31335357,0.11722164,0.002169035,0.32836458],"study_design_scores_gemma":[0.00007059027,0.00075507635,0.00058599695,0.00014981447,0.00005244318,0.00047343664,0.00009621055,0.82026625,0.13758454,0.021115048,0.018807814,0.00004273949],"about_ca_topic_score_codex":0.00017821266,"about_ca_topic_score_gemma":0.0003576637,"teacher_disagreement_score":0.0014918597,"about_ca_system_score_codex":0.00032025887,"about_ca_system_score_gemma":0.0004813023,"threshold_uncertainty_score":0.004990816},"labels":[],"label_agreement":null},{"id":"W4411010576","doi":"10.1145/3714393.3726492","title":"<scp>Laminator:</scp> Verifiable ML Property Cards using Hardware-assisted Attestations","year":2024,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universitas Brawijaya; Government of Ontario","keywords":"Verifiable secret sharing; Computer science; Property (philosophy); Embedded system; Computer hardware; Computer security; Programming language","score_opus":0.030556539581995116,"score_gpt":0.26958116531027704,"score_spread":0.23902462572828193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411010576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005711022,0.0010218715,0.41291896,0.031931195,0.004931448,0.000939643,0.012627066,0.13173246,0.39818636],"genre_scores_gemma":[0.25634596,0.0018715693,0.15066138,0.029597016,0.004112159,0.0017415738,0.020388829,0.036839075,0.49844238],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933268,0.0015391042,0.0004543192,0.0006912797,0.003315138,0.0006733341],"domain_scores_gemma":[0.97453046,0.005442413,0.0010636285,0.0132645555,0.0050299615,0.0006689381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006794516,0.0009903739,0.0006501064,0.001852696,0.002465913,0.007212724,0.003300329,0.0058217696,0.13247831],"category_scores_gemma":[0.023825487,0.0010346244,0.00079889357,0.0018125777,0.0033986515,0.014094802,0.005709834,0.0063590254,0.09313866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002730764,0.00006404762,0.0005681911,0.0001569551,0.00002154582,0.00030876714,0.00019516748,0.0008645408,0.00447629,0.12682852,0.8097755,0.05646738],"study_design_scores_gemma":[0.000092285896,0.00007003875,0.00065374223,0.00017231217,0.000018755847,0.0006727989,0.000077749726,0.012787079,0.027639352,0.062797114,0.8949282,0.00009058555],"about_ca_topic_score_codex":0.0024083492,"about_ca_topic_score_gemma":0.0033384375,"teacher_disagreement_score":0.13247831,"about_ca_system_score_codex":0.0027308592,"about_ca_system_score_gemma":0.002248057,"threshold_uncertainty_score":0.44318408},"labels":[],"label_agreement":null},{"id":"W4411120192","doi":"10.18653/v1/2025.naacl-long.302","title":"Stronger Universal and Transferable Attacks by Suppressing Refusals","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tamkeen; Army Research Office; King Abdulaziz City for Science and Technology; York University; New York University Abu Dhabi; U.S. Department of Homeland Security; Open Philanthropy Project; Noyce Foundation; National Science Foundation","keywords":"Computer science; Computer security","score_opus":0.003495829172001487,"score_gpt":0.22446696424499007,"score_spread":0.2209711350729886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411120192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14958222,0.0020620076,0.72027487,0.015261212,0.0022229608,0.0007187038,0.0008299705,0.0105508,0.098497234],"genre_scores_gemma":[0.9158571,0.00073230866,0.05935998,0.003705473,0.0017238089,0.00037098094,0.00047680346,0.0015860714,0.01618744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9742955,0.009158534,0.0017614964,0.003715602,0.0073871166,0.0036818804],"domain_scores_gemma":[0.8923731,0.058638368,0.0042049605,0.037619613,0.005354705,0.0018092814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014740326,0.0021378684,0.003972491,0.0028289277,0.004018562,0.0058286875,0.004711133,0.004990396,0.013322854],"category_scores_gemma":[0.073279604,0.0020058565,0.0026619378,0.0024852054,0.009084033,0.023403242,0.017607449,0.0103047155,0.0049372446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012124854,0.00047877387,0.0015680061,0.00058811164,0.00026863898,0.0005897896,0.0020492366,0.01718948,0.015882896,0.818717,0.026106955,0.11534854],"study_design_scores_gemma":[0.00020936217,0.00012823341,0.00022007125,0.000090638394,0.0001462243,0.00031115243,0.0001864174,0.054847255,0.009506416,0.92157024,0.012699657,0.00008439987],"about_ca_topic_score_codex":0.0007243152,"about_ca_topic_score_gemma":0.0009171003,"teacher_disagreement_score":0.014740326,"about_ca_system_score_codex":0.002024074,"about_ca_system_score_gemma":0.0029891063,"threshold_uncertainty_score":0.077955246},"labels":[],"label_agreement":null},{"id":"W4411128495","doi":"10.21203/rs.3.rs-6556636/v1","title":"Secure and Efficient Fully Dynamic Lattice-based Group Signature Scheme","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Group signature; Revocation; Computer science; Cryptography; Accumulator (cryptography); Scheme (mathematics); Computer security; Signature (topology); Group (periodic table); Ring signature; Lattice (music); Theoretical computer science; Digital signature; Merkle tree; Flexibility (engineering); Hash function; Public-key cryptography; Algorithm; Mathematics; Encryption; Cryptographic hash function; Statistics; Operating system","score_opus":0.024760030190201062,"score_gpt":0.3494353440478149,"score_spread":0.32467531385761383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411128495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11011906,0.0010593849,0.84682417,0.0018621339,0.0005747937,0.000520471,0.0022118741,0.004049578,0.032778546],"genre_scores_gemma":[0.8163952,0.00036283582,0.16234644,0.00040793602,0.00018172692,0.00032092512,0.0015470568,0.0001325949,0.018305287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964186,0.00066809816,0.0002388809,0.00055648515,0.0014837298,0.00063422],"domain_scores_gemma":[0.99804914,0.0003277436,0.00022708393,0.00073306705,0.00042077154,0.00024211558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009726102,0.00063224445,0.001438436,0.0008670094,0.0016295367,0.0025764387,0.0016356098,0.0011447322,0.005448939],"category_scores_gemma":[0.0017676314,0.00039955974,0.00066072197,0.001435755,0.0011512762,0.004168215,0.004671626,0.0024301577,0.0030732872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038517509,0.0007460966,0.0013317872,0.0006567999,0.00015079408,0.00057679974,0.00066600955,0.063133165,0.10743036,0.5730173,0.021958973,0.22648014],"study_design_scores_gemma":[0.0010447003,0.00090561726,0.0006575942,0.00009705436,0.00012122161,0.0014133297,0.0003485655,0.44407707,0.08807035,0.402628,0.060278166,0.00035824842],"about_ca_topic_score_codex":0.00091834407,"about_ca_topic_score_gemma":0.0008763913,"teacher_disagreement_score":0.005448939,"about_ca_system_score_codex":0.0015611374,"about_ca_system_score_gemma":0.0041074865,"threshold_uncertainty_score":0.01822853},"labels":[],"label_agreement":null},{"id":"W4411320003","doi":"10.1145/3717823.3718313","title":"Improved PIR Schemes using Matching Vectors and Derivatives","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Matching (statistics); Algorithm; Mathematics; Statistics","score_opus":0.012901656455341087,"score_gpt":0.2686517694769213,"score_spread":0.25575011302158024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411320003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029854337,0.0009161583,0.95439595,0.00035985044,0.0002680304,0.00013373437,0.00011104429,0.0014884288,0.012472526],"genre_scores_gemma":[0.5956119,0.00081144104,0.38551483,0.0003174965,0.00022012692,0.00012944927,0.00030968298,0.00026721586,0.016817871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747926,0.0007191839,0.0001834099,0.00033098238,0.0010399042,0.0002473408],"domain_scores_gemma":[0.99758613,0.00059354026,0.00024489584,0.0011423513,0.00033585244,0.000097306256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018594034,0.001092331,0.0013542713,0.001226171,0.00073982566,0.0018483696,0.0013930531,0.0015070962,0.0060894443],"category_scores_gemma":[0.0049963407,0.0005205034,0.00070946885,0.0020875372,0.0013006415,0.004993738,0.0028618467,0.0021819386,0.0027357931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012024168,0.0003048927,0.0006488508,0.00036502522,0.00010665087,0.0003221458,0.00022058233,0.04781758,0.070872664,0.4993586,0.006034125,0.3727464],"study_design_scores_gemma":[0.00021926545,0.00066371245,0.0005934992,0.00010128994,0.00012353246,0.0015109339,0.00007611362,0.66414785,0.07317141,0.23755863,0.021657757,0.00017597886],"about_ca_topic_score_codex":0.00028478418,"about_ca_topic_score_gemma":0.0002692303,"teacher_disagreement_score":0.0060894443,"about_ca_system_score_codex":0.00072023034,"about_ca_system_score_gemma":0.0009404997,"threshold_uncertainty_score":0.020371258},"labels":[],"label_agreement":null},{"id":"W4411436151","doi":"10.1007/978-3-031-87496-3_2","title":"An Innovative DSSE Framework: Ensuring Data Privacy and Query Verification in Untrusted Cloud Environments","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Computer science; Cloud computing; Privacy protection; Computer security; Database; Operating system","score_opus":0.02566004787841346,"score_gpt":0.27727122616510785,"score_spread":0.2516111782866944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411436151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025241808,0.00034187763,0.9906121,0.00083161204,0.00014548379,0.00017840012,0.00013920687,0.0023268794,0.0029003255],"genre_scores_gemma":[0.20463973,0.00073687104,0.77910614,0.001045413,0.00034049462,0.00030621453,0.00062022544,0.0006481127,0.012556776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9852829,0.0031304932,0.0009327019,0.0018005625,0.0074493894,0.001404003],"domain_scores_gemma":[0.98791003,0.0028222676,0.0005065636,0.0066872207,0.001640016,0.00043387956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009537884,0.0009784395,0.0018786427,0.0015288965,0.0016987401,0.007147968,0.0056909667,0.003158705,0.005112439],"category_scores_gemma":[0.014574974,0.0011314093,0.0017461617,0.0020273179,0.0044489815,0.011509376,0.010757858,0.006100568,0.0024678726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060526637,0.00036023452,0.0010886205,0.0004262351,0.00014231697,0.0004983623,0.000574305,0.027570277,0.017128253,0.68539345,0.024673697,0.24153893],"study_design_scores_gemma":[0.000120635435,0.00015890868,0.0003215074,0.00013152287,0.000085595646,0.00093095156,0.00026573936,0.5195374,0.030239126,0.3785186,0.06957768,0.00011234073],"about_ca_topic_score_codex":0.0020183416,"about_ca_topic_score_gemma":0.0023000983,"teacher_disagreement_score":0.009537884,"about_ca_system_score_codex":0.0019039984,"about_ca_system_score_gemma":0.0045013917,"threshold_uncertainty_score":0.0504418},"labels":[],"label_agreement":null},{"id":"W4411544687","doi":"10.1007/s12083-025-02040-6","title":"Secure and efficient fully dynamic group signature based on RSIS and RLWE","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Ministry of Electronics and Information technology","keywords":"Signature (topology); Group (periodic table); Group signature; Computer science; Physics; Computer security; Mathematics; Public-key cryptography; Quantum mechanics","score_opus":0.004619057860414322,"score_gpt":0.24349643036536295,"score_spread":0.23887737250494862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411544687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055921108,0.0013432414,0.92680043,0.00046996202,0.0004017897,0.00035659215,0.00036043546,0.003916994,0.010429542],"genre_scores_gemma":[0.8607214,0.00045943455,0.12818019,0.00017930401,0.00016391653,0.00020530564,0.0006471498,0.00010619856,0.009337051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968065,0.00059325097,0.00025807912,0.00052067335,0.001307236,0.00051425386],"domain_scores_gemma":[0.9980527,0.00035736625,0.00022485884,0.0008250551,0.00043993242,0.00010001277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096382335,0.00077468087,0.0016588664,0.0010218769,0.0010157499,0.0017441798,0.0015734484,0.0007688902,0.0021579764],"category_scores_gemma":[0.0024183712,0.0003990021,0.0006680087,0.0011575343,0.00074517995,0.0037521075,0.0027785709,0.0011457212,0.0013101764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030220833,0.0004246268,0.0023669184,0.0007390507,0.00037320366,0.0007040865,0.0005087815,0.09197555,0.18151174,0.19030055,0.014520471,0.5135529],"study_design_scores_gemma":[0.0002761934,0.00080619566,0.0010293283,0.00006358491,0.00023326366,0.0014650982,0.00026144987,0.7781039,0.12562633,0.06040067,0.031524234,0.00020976488],"about_ca_topic_score_codex":0.0008669503,"about_ca_topic_score_gemma":0.0009576579,"teacher_disagreement_score":0.0021579764,"about_ca_system_score_codex":0.00068837183,"about_ca_system_score_gemma":0.0024961578,"threshold_uncertainty_score":0.0072191954},"labels":[],"label_agreement":null},{"id":"W4412075142","doi":"10.62056/ah893z10k","title":"Round-Efficient Adaptively Secure Threshold Signatures with Rewinding","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer security","score_opus":0.024398160659318092,"score_gpt":0.3039376615718625,"score_spread":0.2795395009125444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412075142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088688165,0.0005527996,0.8869892,0.0008149508,0.0002205993,0.00031795815,0.00035848006,0.006555021,0.0155028],"genre_scores_gemma":[0.79404324,0.00033025673,0.1896077,0.0003439187,0.00010260307,0.00018011591,0.0004755704,0.00047833912,0.014438228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99402183,0.0008197247,0.00056068576,0.0013149527,0.0023112632,0.0009714931],"domain_scores_gemma":[0.99100834,0.001634183,0.0008955561,0.005412757,0.0006935068,0.00035562276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023245777,0.0008817422,0.0010873579,0.00086238503,0.0010357497,0.0026801494,0.0025692119,0.0017502477,0.005137807],"category_scores_gemma":[0.0075566256,0.00092074863,0.0014902083,0.0013497003,0.0023692169,0.0071571316,0.0054175598,0.0031400197,0.002892238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023334918,0.00025807484,0.0015857986,0.00038922118,0.00017291825,0.000772301,0.0010643827,0.10084683,0.10263212,0.5922226,0.0061355443,0.1915867],"study_design_scores_gemma":[0.0003238176,0.00063661183,0.0005967522,0.0001084014,0.00015475642,0.0010475954,0.00024177649,0.33860007,0.19751745,0.43163133,0.028867662,0.0002737647],"about_ca_topic_score_codex":0.0013960773,"about_ca_topic_score_gemma":0.00093740347,"teacher_disagreement_score":0.005137807,"about_ca_system_score_codex":0.0017266867,"about_ca_system_score_gemma":0.0027657424,"threshold_uncertainty_score":0.017187655},"labels":[],"label_agreement":null},{"id":"W4412075148","doi":"10.62056/ae0zo-3y","title":"Circular Insecure Encryption: from Long Cycles to Short Cycles","year":2025,"lang":"lv","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Encryption; Computer security; Computer science","score_opus":0.0448877442252007,"score_gpt":0.34536950307060293,"score_spread":0.30048175884540224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412075148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2200174,0.002351581,0.71601665,0.0047530923,0.0004238907,0.00032520175,0.0008609517,0.0015235598,0.053727712],"genre_scores_gemma":[0.9320763,0.0009854609,0.0496418,0.00071901,0.00029020171,0.00021665859,0.00045476845,0.0003179201,0.0152979465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582916,0.0010298154,0.00033880162,0.000902244,0.0011604693,0.0007396076],"domain_scores_gemma":[0.9875695,0.0052544237,0.00104493,0.0044580065,0.0011021331,0.0005709644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002709469,0.0007533722,0.0007743295,0.0013490809,0.0019014231,0.004266725,0.0014301975,0.00198992,0.0072845314],"category_scores_gemma":[0.0141442595,0.0008063198,0.001098494,0.0012234965,0.004728706,0.011513022,0.006739711,0.0048902114,0.0017649092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064460037,0.00005432269,0.0010032731,0.00011264632,0.000026215004,0.00031418327,0.0005217035,0.018808696,0.002711153,0.9410123,0.0037077337,0.031083165],"study_design_scores_gemma":[0.00006676864,0.00010930112,0.000323143,0.00007871058,0.000032104574,0.00033368374,0.000111280904,0.06404438,0.004335152,0.9218284,0.008676026,0.000060990693],"about_ca_topic_score_codex":0.0013408861,"about_ca_topic_score_gemma":0.00086947635,"teacher_disagreement_score":0.0072845314,"about_ca_system_score_codex":0.0027644273,"about_ca_system_score_gemma":0.0018039854,"threshold_uncertainty_score":0.02436918},"labels":[],"label_agreement":null},{"id":"W4412917335","doi":"10.1007/s10479-025-06682-w","title":"Improved block rearrangement algorithm","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Theory of computation; Computer science; Block (permutation group theory); Algorithm; Mathematics; Combinatorics","score_opus":0.12811141626620398,"score_gpt":0.4464913557260017,"score_spread":0.3183799394597977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412917335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040003706,0.0007281852,0.9307714,0.00058155844,0.00047798656,0.00028679313,0.00061836117,0.0028838431,0.023648083],"genre_scores_gemma":[0.17846137,0.00045798137,0.77571094,0.000351322,0.00027883713,0.00038960148,0.0020763264,0.00059866277,0.04167494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904376,0.00019853617,0.000057611483,0.0002139563,0.00034136605,0.00014475931],"domain_scores_gemma":[0.99919957,0.00012915467,0.00004927027,0.00036230698,0.00021414341,0.000045465844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053201726,0.000697219,0.0010442989,0.0011469923,0.0009673587,0.0011167102,0.001594356,0.00090211135,0.0222989],"category_scores_gemma":[0.0017027534,0.00040285487,0.0007869457,0.001939652,0.00058862055,0.0016765513,0.0015504652,0.0012083799,0.008219448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000938595,0.0003403174,0.0008267501,0.0002068159,0.00009031593,0.0001585791,0.00014385188,0.04959256,0.042551313,0.099390656,0.032733366,0.77302694],"study_design_scores_gemma":[0.00049819937,0.0007033276,0.0017670713,0.00006376651,0.00016234149,0.0006787758,0.00013794626,0.7265446,0.057213176,0.10877855,0.10334751,0.00010479935],"about_ca_topic_score_codex":0.0021372633,"about_ca_topic_score_gemma":0.0029169258,"teacher_disagreement_score":0.0222989,"about_ca_system_score_codex":0.0006936944,"about_ca_system_score_gemma":0.001715493,"threshold_uncertainty_score":0.07459724},"labels":[],"label_agreement":null},{"id":"W4412982922","doi":"10.1016/j.jisa.2025.104173","title":"Verifiable keyword searchable encryption with enhanced security using aggregate key in blockchain-based smart healthcare","year":2025,"lang":"en","type":"article","venue":"Journal of Information Security and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Guangzhou Science and Technology Program key projects; National Natural Science Foundation of China; Royal Society of Canada","keywords":"Blockchain; Computer security; Verifiable secret sharing; Encryption; Key (lock); Computer science; Internet privacy","score_opus":0.007967028778350198,"score_gpt":0.25495411887388875,"score_spread":0.24698709009553854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412982922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24822475,0.0010716149,0.73849475,0.0015760764,0.00022578397,0.0003809329,0.00067397574,0.0012166437,0.008135455],"genre_scores_gemma":[0.9857422,0.00014125193,0.01220855,0.00006010167,0.000021853786,0.00004493438,0.00012628097,0.000013709689,0.0016409993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974962,0.0008258416,0.00021614302,0.00032432802,0.00070471776,0.00043274532],"domain_scores_gemma":[0.9965827,0.0014773431,0.00031313841,0.000854666,0.00057011103,0.00020203028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002129217,0.00031107664,0.0011914388,0.00051128713,0.0007361727,0.0013883892,0.0012309373,0.0011781759,0.0043720147],"category_scores_gemma":[0.00404781,0.00024018328,0.00045059194,0.00081569934,0.0010324321,0.0034956082,0.0021799672,0.00096904166,0.00067328423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054060263,0.00070171664,0.0059276503,0.00086197787,0.00024668587,0.0027518747,0.00105285,0.3958504,0.08314787,0.28470773,0.008540087,0.21080512],"study_design_scores_gemma":[0.0002116182,0.00040059545,0.0005714329,0.00003988402,0.000059931728,0.00059679267,0.00012594504,0.90033436,0.019171972,0.07521563,0.0032215728,0.00005030612],"about_ca_topic_score_codex":0.001393365,"about_ca_topic_score_gemma":0.0015341947,"teacher_disagreement_score":0.0043720147,"about_ca_system_score_codex":0.0007990196,"about_ca_system_score_gemma":0.0024527363,"threshold_uncertainty_score":0.014625788},"labels":[],"label_agreement":null},{"id":"W4413157189","doi":"10.1109/cvpr52734.2025.02399","title":"NoT: Federated Unlearning via Weight Negation","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Negation; Computer science; Programming language; Natural language processing; Artificial intelligence","score_opus":0.006909984337206653,"score_gpt":0.23296085017650847,"score_spread":0.2260508658393018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413157189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034929078,0.0003991404,0.95797735,0.00061552465,0.00011174453,0.00011309193,0.00012063777,0.0034983482,0.00223509],"genre_scores_gemma":[0.7736607,0.00021114375,0.21876636,0.0010662433,0.00008385842,0.00023402665,0.00071877183,0.00038530762,0.0048735403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987074,0.00039833703,0.00007934766,0.00035769804,0.00027380802,0.00018342324],"domain_scores_gemma":[0.99750394,0.0010997123,0.00019886885,0.0007439046,0.00033765656,0.000115923416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024851202,0.0014310034,0.0012062972,0.00052507356,0.0006773195,0.0014707344,0.0024256825,0.0018347829,0.0025419341],"category_scores_gemma":[0.009310382,0.00043742967,0.000780001,0.000474524,0.0015914578,0.004268435,0.0030644147,0.00273234,0.00064684445],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061010616,0.00036141733,0.0032072077,0.00021447276,0.0001534577,0.00026448426,0.00027170317,0.5021836,0.009593366,0.026775261,0.0077692936,0.44859558],"study_design_scores_gemma":[0.000026595184,0.00007560138,0.00014121894,0.000017730086,0.0000155156,0.00006107056,0.000032646534,0.9725584,0.0041450234,0.021760492,0.0011533559,0.0000122988895],"about_ca_topic_score_codex":0.0030314617,"about_ca_topic_score_gemma":0.0038797653,"teacher_disagreement_score":0.0030314617,"about_ca_system_score_codex":0.0010554342,"about_ca_system_score_gemma":0.0019143041,"threshold_uncertainty_score":0.013142765},"labels":[],"label_agreement":null},{"id":"W4413265641","doi":"10.2139/ssrn.5360529","title":"Selective-Disclosure in Decentralised Identity: A Comparative Evaluation of BBS+ and SD-JWT","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Identity (music); Business; Art","score_opus":0.03143827264686939,"score_gpt":0.33498976582788764,"score_spread":0.30355149318101826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413265641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9393639,0.0045879055,0.014689183,0.002251001,0.00020407606,0.0005805579,0.000528145,0.00042934547,0.037365936],"genre_scores_gemma":[0.99495846,0.0006452099,0.00288711,0.00011297279,0.00005463153,0.00005824116,0.00009607281,0.000017144077,0.0011700694],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97482556,0.017505454,0.001102507,0.00072963466,0.0046313675,0.0012055563],"domain_scores_gemma":[0.81416184,0.15052786,0.011890362,0.014771105,0.0051754005,0.0034734716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031904083,0.00041166262,0.0016082429,0.0012819861,0.0011576203,0.0031830587,0.0020246461,0.0016133892,0.009735777],"category_scores_gemma":[0.08722487,0.00027525812,0.0008091454,0.002021682,0.0031478023,0.0062580444,0.0032451905,0.0016776929,0.00073313183],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.06795599,0.006367547,0.043662064,0.0061277053,0.0012536871,0.0002914526,0.0032707846,0.08896089,0.0019180753,0.17413191,0.00976595,0.5962939],"study_design_scores_gemma":[0.027414944,0.09587732,0.10838481,0.0032674193,0.005077973,0.0022425407,0.01588874,0.44616506,0.012971966,0.23328058,0.048877712,0.0005509917],"about_ca_topic_score_codex":0.0042939247,"about_ca_topic_score_gemma":0.0037939511,"teacher_disagreement_score":0.031904083,"about_ca_system_score_codex":0.0027073554,"about_ca_system_score_gemma":0.005835303,"threshold_uncertainty_score":0.16872698},"labels":[],"label_agreement":null},{"id":"W4413332413","doi":"10.1016/j.procs.2025.07.186","title":"Defending federated learning systems against untargeted sybil attacks in non-IID environments","year":2025,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Sybil attack; Computer security; Artificial intelligence; Computer network; Wireless sensor network","score_opus":0.0071075854289720615,"score_gpt":0.23253562677648074,"score_spread":0.22542804134750868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413332413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06849665,0.0002392766,0.9278714,0.0002620664,0.000059168204,0.000055396897,0.000030891173,0.0018395862,0.0011456521],"genre_scores_gemma":[0.9538395,0.000055825472,0.044661213,0.0001096775,0.000024247964,0.000034606706,0.000044148404,0.000054303153,0.0011766751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781054,0.00066289125,0.0001354148,0.0005347711,0.0005500446,0.00030643845],"domain_scores_gemma":[0.9928725,0.0025600358,0.0009247146,0.0021990736,0.0010968074,0.00034678486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039828033,0.0009775441,0.001450135,0.0009081323,0.00093789876,0.0021653087,0.0018645587,0.0014127977,0.00092996605],"category_scores_gemma":[0.014328366,0.0004193446,0.0006622706,0.0005403215,0.0014853015,0.0031417948,0.0036209403,0.0017949397,0.00051282044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038613158,0.00016519739,0.0045715785,0.000079699705,0.00013585981,0.0001890392,0.00021889189,0.8190072,0.008510403,0.017029729,0.0019751496,0.147731],"study_design_scores_gemma":[0.0000066718912,0.000039032635,0.00016885054,0.0000045972365,0.0000064526284,0.00004100678,0.000014601978,0.9911873,0.0020782049,0.0061996505,0.0002470131,0.0000067262013],"about_ca_topic_score_codex":0.0015123838,"about_ca_topic_score_gemma":0.0014383798,"teacher_disagreement_score":0.0039828033,"about_ca_system_score_codex":0.0011884521,"about_ca_system_score_gemma":0.0015124666,"threshold_uncertainty_score":0.021063268},"labels":[],"label_agreement":null},{"id":"W4413459658","doi":"10.1007/978-3-032-01881-6_18","title":"Hybrid Obfuscated Key Exchange and KEMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Computer security","score_opus":0.012132077991706092,"score_gpt":0.22859877018379746,"score_spread":0.21646669219209136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413459658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057329215,0.0020117348,0.8928698,0.0008503258,0.00060113857,0.00020522795,0.0004123987,0.003242641,0.04247753],"genre_scores_gemma":[0.75517094,0.0011837597,0.20291047,0.0002921156,0.00024067188,0.00018307728,0.00052424043,0.0005194667,0.03897528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979938,0.00042608334,0.00017142648,0.0003254962,0.00067759963,0.00040548507],"domain_scores_gemma":[0.9959908,0.0012715973,0.00018885733,0.002212232,0.00025364864,0.0000828646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016895458,0.0008124576,0.001100046,0.0010159372,0.0010641646,0.0021469207,0.0018721493,0.0015924817,0.012781166],"category_scores_gemma":[0.0044306787,0.00062112336,0.0009725745,0.0015637997,0.0019819434,0.006900521,0.00558696,0.002438169,0.0051194504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000983086,0.0001353222,0.00038279453,0.00046225384,0.00008385392,0.00045306626,0.00043909755,0.023284124,0.01680854,0.76034886,0.007129028,0.18949],"study_design_scores_gemma":[0.000105427454,0.00019398032,0.0002550796,0.00020125166,0.00010640563,0.0014643242,0.00013972251,0.10366149,0.049752485,0.8143278,0.029697336,0.00009480073],"about_ca_topic_score_codex":0.00013587947,"about_ca_topic_score_gemma":0.00016981296,"teacher_disagreement_score":0.012781166,"about_ca_system_score_codex":0.00072992616,"about_ca_system_score_gemma":0.0007581761,"threshold_uncertainty_score":0.042757273},"labels":[],"label_agreement":null},{"id":"W4413460024","doi":"10.1007/978-3-032-01881-6_16","title":"A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Computer science; Encryption; Witness; Computer security; Theoretical computer science; Programming language","score_opus":0.013119819387331134,"score_gpt":0.2583726171571709,"score_spread":0.24525279776983977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413460024","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062840893,0.0007626531,0.9664502,0.0008730549,0.00024726917,0.00014042133,0.00021593277,0.0011532533,0.023873042],"genre_scores_gemma":[0.4118525,0.0030605542,0.5347489,0.0011365304,0.00089943054,0.0008164439,0.0011511475,0.0010110312,0.04532348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973773,0.0006470006,0.0002107486,0.00046224214,0.0009855896,0.0003172056],"domain_scores_gemma":[0.997147,0.0013606108,0.0001534611,0.00089335645,0.00033503934,0.00011051291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024714977,0.0012317355,0.0013941329,0.0015873505,0.0018155678,0.0055395076,0.0031234242,0.0022629662,0.01136277],"category_scores_gemma":[0.006866961,0.0010327273,0.0020855763,0.0023369375,0.0039917757,0.012686869,0.006539132,0.006891838,0.0034555837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018170154,0.000014348055,0.000030362839,0.000040959843,0.00000630568,0.00004644666,0.000066512985,0.0018066723,0.00046775094,0.9859898,0.0014235881,0.010089064],"study_design_scores_gemma":[0.000011146915,0.000013793263,0.000021527838,0.000023260767,0.00000964319,0.000061530685,0.000023130033,0.017058197,0.0007810408,0.9758823,0.006100226,0.000014235357],"about_ca_topic_score_codex":0.0009240166,"about_ca_topic_score_gemma":0.00088375836,"teacher_disagreement_score":0.01136277,"about_ca_system_score_codex":0.0023826372,"about_ca_system_score_gemma":0.0015938332,"threshold_uncertainty_score":0.038012207},"labels":[],"label_agreement":null},{"id":"W4413460085","doi":"10.1007/978-3-032-01881-6_17","title":"Verifiable Decapsulation: Recognizing Faulty Implementations of Post-quantum KEMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Verifiable secret sharing; Computer science; Implementation; Programming language","score_opus":0.020224230014072368,"score_gpt":0.27755377546448856,"score_spread":0.2573295454504162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413460085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2406176,0.00037402695,0.7449436,0.0010431465,0.00029373614,0.00012851978,0.00036321004,0.0025095576,0.009726621],"genre_scores_gemma":[0.91905564,0.00016967846,0.0756662,0.00017652453,0.00007165301,0.00007049869,0.0003836617,0.00021705643,0.0041889925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967505,0.0006287151,0.00027120902,0.00062178005,0.0011226592,0.00060532027],"domain_scores_gemma":[0.98261744,0.008419167,0.0012680469,0.005678585,0.0017054334,0.00031143523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027680392,0.00071520824,0.0009716354,0.00073469576,0.0008992866,0.003494155,0.0024370956,0.0022733372,0.0038406628],"category_scores_gemma":[0.017371284,0.0007807803,0.0007927967,0.0007403106,0.0033392867,0.0077234255,0.004469776,0.0035953647,0.001269891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014503022,0.00019955743,0.005723537,0.0003742505,0.00013175093,0.000834201,0.0013036354,0.07926855,0.030726867,0.7166688,0.0064367787,0.15688184],"study_design_scores_gemma":[0.000059820843,0.00012996317,0.00045247652,0.00006806029,0.000040855204,0.0003235476,0.00026113237,0.26276374,0.037918903,0.6947578,0.0031659321,0.00005778229],"about_ca_topic_score_codex":0.00052992936,"about_ca_topic_score_gemma":0.00054665544,"teacher_disagreement_score":0.0038406628,"about_ca_system_score_codex":0.0010427186,"about_ca_system_score_gemma":0.0014773732,"threshold_uncertainty_score":0.01463896},"labels":[],"label_agreement":null},{"id":"W4414003971","doi":"10.14778/3749646.3749707","title":"OasisDB: An Oblivious and Scalable System for Relational Data","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalability; Computer science; Relational database; Database","score_opus":0.02953292981573211,"score_gpt":0.26023942873683936,"score_spread":0.23070649892110726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414003971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039210696,0.0033772318,0.7296429,0.0018008624,0.00050722633,0.0011468995,0.0042346166,0.20314828,0.016931279],"genre_scores_gemma":[0.39330852,0.0022710015,0.55639577,0.0016191845,0.0004035536,0.0012587488,0.019346807,0.00776568,0.0176307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423367,0.0007195132,0.0005883259,0.0006833029,0.0032821458,0.0004931127],"domain_scores_gemma":[0.9909071,0.0009833274,0.00047289397,0.0062653525,0.0008738449,0.0004974756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038151336,0.0010955976,0.0010383461,0.0020994092,0.0015922535,0.004769771,0.00573646,0.0011516968,0.00863201],"category_scores_gemma":[0.0112034,0.0013222791,0.0010971292,0.0027513076,0.0022063702,0.0127484165,0.010866208,0.0029473605,0.005518394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002730276,0.00067828555,0.010984435,0.0017894107,0.000724992,0.0006802458,0.0016462822,0.027774105,0.07945528,0.2088656,0.24985205,0.41481897],"study_design_scores_gemma":[0.0009262885,0.0008332031,0.00388684,0.0002608258,0.00026154442,0.0014570286,0.00057805784,0.34193394,0.11366032,0.12681651,0.40894687,0.00043852231],"about_ca_topic_score_codex":0.0048283124,"about_ca_topic_score_gemma":0.003608294,"teacher_disagreement_score":0.00863201,"about_ca_system_score_codex":0.0018892364,"about_ca_system_score_gemma":0.0041403766,"threshold_uncertainty_score":0.02887696},"labels":[],"label_agreement":null},{"id":"W4414101765","doi":"10.1007/978-3-032-05036-6_3","title":"Revisiting Silent Coercion","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Credential; Adversary; Mathematical proof; Voting; Coercion (linguistics); Adversarial system; Cryptography; Protocol (science)","score_opus":0.013496904202560906,"score_gpt":0.24862193775053684,"score_spread":0.23512503354797593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414101765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059447825,0.0028745283,0.721781,0.01042662,0.001922237,0.00035709984,0.00019657759,0.0012270549,0.20176707],"genre_scores_gemma":[0.9037889,0.0012911006,0.05808206,0.002753266,0.00074215874,0.0003270197,0.00011841236,0.00048147966,0.032415684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9858387,0.0062959776,0.0006549197,0.0019914904,0.004086974,0.0011318513],"domain_scores_gemma":[0.9818255,0.008435221,0.0008367115,0.006781262,0.001632267,0.00048899034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008466468,0.0006815422,0.0009095953,0.0007940245,0.0025761742,0.005396274,0.0030123245,0.0029700454,0.008113626],"category_scores_gemma":[0.021704506,0.0006087933,0.0011706533,0.0006567107,0.014409981,0.013159294,0.007955328,0.009201437,0.002464656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039254668,0.000017358658,0.00014130786,0.00007341148,0.000008678761,0.0001089816,0.00063594355,0.00094995263,0.0013446436,0.98504585,0.0013436727,0.01029091],"study_design_scores_gemma":[0.000053464795,0.000092924056,0.00016800637,0.00025086003,0.000034497283,0.0003861835,0.00029829625,0.018812306,0.011176941,0.8880841,0.08057655,0.00006579964],"about_ca_topic_score_codex":0.00099844,"about_ca_topic_score_gemma":0.00041669465,"teacher_disagreement_score":0.008466468,"about_ca_system_score_codex":0.0018334534,"about_ca_system_score_gemma":0.002037052,"threshold_uncertainty_score":0.044775486},"labels":[],"label_agreement":null},{"id":"W4414538568","doi":"10.1109/icc52391.2025.11161833","title":"Integration Gain Maximization in ISAC Systems Through Adaptive Unified Resource Allocation","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Resource allocation; Maximization; Bandwidth (computing); Scheme (mathematics); Metric (unit); Performance metric; Resource (disambiguation); Data integration","score_opus":0.019454303503776478,"score_gpt":0.2526968911755266,"score_spread":0.2332425876717501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414538568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061667074,0.00033449513,0.93257684,0.0002109759,0.000024569314,0.0000715659,0.000019469244,0.00040425267,0.004690686],"genre_scores_gemma":[0.9429557,0.00007936287,0.05585439,0.00006735247,0.000018129538,0.000050689257,0.000020843421,0.000027749158,0.0009258871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834144,0.00039600255,0.000055637855,0.000250359,0.00059283234,0.00036382096],"domain_scores_gemma":[0.99856526,0.00061157864,0.00022231553,0.00018006047,0.00030395424,0.000116854346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021069862,0.00087131176,0.0011446353,0.0009117746,0.0009642922,0.0017254287,0.00126385,0.00078668067,0.0010221092],"category_scores_gemma":[0.004204012,0.00035735455,0.00038546507,0.0012351783,0.001578274,0.0015983057,0.0021808033,0.001111557,0.00021704844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014246801,0.000074884876,0.0008502778,0.000040483097,0.00004094198,0.00010262711,0.00013472865,0.907394,0.009310189,0.03312265,0.0009488194,0.047837995],"study_design_scores_gemma":[0.0000041327403,0.000028564411,0.000082597915,0.0000022514193,0.000004988194,0.000020944639,0.000010772074,0.9950954,0.0009100809,0.0036125474,0.0002227026,0.000005053997],"about_ca_topic_score_codex":0.0051973057,"about_ca_topic_score_gemma":0.0043116407,"teacher_disagreement_score":0.0051973057,"about_ca_system_score_codex":0.0018413644,"about_ca_system_score_gemma":0.0019765114,"threshold_uncertainty_score":0.013360083},"labels":[],"label_agreement":null},{"id":"W4414539178","doi":"10.1109/icc52391.2025.11161185","title":"An Efficient Private Set Frequency Query Scheme Under Local Differential Privacy","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Queen's University","funders":"National Research Council Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Differential privacy; Set (abstract data type); Scheme (mathematics); Bloom filter; Crowdsourcing; Query optimization; Filter (signal processing); Information privacy; Query expansion","score_opus":0.012559502185557658,"score_gpt":0.2705958176043476,"score_spread":0.2580363154187899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414539178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03466885,0.00038598225,0.95866257,0.0005964457,0.00008366915,0.00036323306,0.00042698963,0.00089970906,0.0039125234],"genre_scores_gemma":[0.81479603,0.00030812103,0.17778412,0.0004207938,0.00016219208,0.00043264712,0.0005141046,0.00005574641,0.0055262055],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940309,0.0012701758,0.00037962216,0.0009879505,0.0025999309,0.0007313865],"domain_scores_gemma":[0.99453306,0.001735023,0.00055277307,0.0020199593,0.00089857174,0.00026071342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027723282,0.00065810385,0.0017450276,0.0012806338,0.0018425235,0.0016604917,0.0028381299,0.0017955216,0.0022267068],"category_scores_gemma":[0.007839112,0.00037988383,0.00083335256,0.0027354574,0.0012578795,0.005155877,0.005354487,0.0015776092,0.0007989138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030029211,0.0006074354,0.0046317205,0.00057350623,0.00023517497,0.00088788266,0.0017400684,0.12314628,0.110676296,0.27794966,0.0155437,0.4610053],"study_design_scores_gemma":[0.00037172085,0.00046576862,0.0011708657,0.000036285324,0.00009779423,0.0012362013,0.00031733414,0.83873516,0.03145578,0.11078121,0.01514648,0.00018543894],"about_ca_topic_score_codex":0.0016841447,"about_ca_topic_score_gemma":0.0011562548,"teacher_disagreement_score":0.0028381299,"about_ca_system_score_codex":0.0021008493,"about_ca_system_score_gemma":0.0022885338,"threshold_uncertainty_score":0.015242815},"labels":[],"label_agreement":null},{"id":"W4414621284","doi":"","title":"Private Rate-Constrained Optimization with Applications to Fair Learning","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canada Research Chairs; University of Toronto","funders":"","keywords":"Differential privacy; Convergence (economics); Empirical risk minimization; Constraint (computer-aided design); Minification; Dual (grammatical number); Optimization problem; Rate of convergence","score_opus":0.021345866748638608,"score_gpt":0.25967081592479413,"score_spread":0.23832494917615551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414621284","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006095314,0.00066169904,0.98370343,0.0016278167,0.00015345246,0.00005812629,0.000082582286,0.00013828454,0.0074793315],"genre_scores_gemma":[0.6145707,0.002768299,0.34614277,0.0007853392,0.0011319239,0.000497595,0.00023566448,0.00043710295,0.033430733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749714,0.001349206,0.00007390512,0.00036024096,0.0004843274,0.00023507993],"domain_scores_gemma":[0.9871863,0.010479239,0.00048382414,0.0008183027,0.0006551492,0.0003771695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073281527,0.0016714314,0.0020808121,0.0012414148,0.0011564988,0.0030717885,0.0022707777,0.0025207177,0.008638361],"category_scores_gemma":[0.0279451,0.0006839034,0.0009150203,0.0021852457,0.0040176306,0.0045545828,0.004346138,0.0053303214,0.0010812192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011442914,0.00009946821,0.000215326,0.000103056715,0.000034734887,0.000065240434,0.00008461488,0.29926547,0.00058497244,0.6625975,0.0044233,0.032411966],"study_design_scores_gemma":[0.000016998307,0.000014801393,0.000027866601,0.00001415953,0.000005147954,0.000014536774,0.000007962214,0.6393115,0.00019895154,0.35938165,0.0009961771,0.00001035156],"about_ca_topic_score_codex":0.0024095317,"about_ca_topic_score_gemma":0.0020839383,"teacher_disagreement_score":0.008638361,"about_ca_system_score_codex":0.003455444,"about_ca_system_score_gemma":0.0029664792,"threshold_uncertainty_score":0.038755417},"labels":[],"label_agreement":null},{"id":"W4414633451","doi":"10.1007/s10586-025-05507-6","title":"Lattice-based cryptographic technique to preserve data confidentiality in edge computing","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Digital signature; Cryptography; Edge device; Scheme (mathematics); Confidentiality; Edge computing; Public-key cryptography; Signature (topology)","score_opus":0.032135735017686275,"score_gpt":0.3170454700273678,"score_spread":0.28490973500968153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414633451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048131395,0.00083646324,0.93610287,0.0008842791,0.00044215427,0.00013473324,0.00016124442,0.00069378514,0.012613125],"genre_scores_gemma":[0.76471794,0.00062626024,0.22719622,0.00035785572,0.0002129443,0.000120741235,0.00016929864,0.000092923845,0.006505701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982242,0.00048814146,0.000108376444,0.0001719721,0.00075204275,0.00025520413],"domain_scores_gemma":[0.99754095,0.0005730174,0.00021218066,0.0008400436,0.00064236345,0.00019152279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013532282,0.00036853552,0.00078623067,0.0011056557,0.0022030177,0.0019552435,0.0015274254,0.00074725243,0.0032400708],"category_scores_gemma":[0.0033878027,0.00024331753,0.0006742548,0.0018493861,0.00169721,0.0030046755,0.0022554714,0.0025545862,0.0010902757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011004885,0.00028942252,0.00085582875,0.0002788663,0.000087193526,0.0002870894,0.00038309104,0.043163527,0.0641213,0.7671012,0.009120156,0.113211885],"study_design_scores_gemma":[0.00020093138,0.00053670583,0.00039868618,0.00008079588,0.000085438835,0.001016736,0.00035649305,0.5661567,0.08998421,0.31517065,0.025831323,0.00018143914],"about_ca_topic_score_codex":0.00073989085,"about_ca_topic_score_gemma":0.001021276,"teacher_disagreement_score":0.0032400708,"about_ca_system_score_codex":0.0010235714,"about_ca_system_score_gemma":0.0021711984,"threshold_uncertainty_score":0.010839164},"labels":[],"label_agreement":null},{"id":"W4414869299","doi":"10.62056/a0l2i888","title":"A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Hash function; Function (biology); Multiplicative function; Modulo; Boolean function; Perfect hash function; Discrete logarithm","score_opus":0.03638623541572816,"score_gpt":0.30153110558733637,"score_spread":0.2651448701716082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15358232,0.026019176,0.6049064,0.028813282,0.0015696855,0.0007564498,0.0046584844,0.009922941,0.16977131],"genre_scores_gemma":[0.8284376,0.008929799,0.11612824,0.008120035,0.00297447,0.0012114571,0.003418586,0.0029434746,0.027836232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99154925,0.0011701284,0.00036079477,0.0016732774,0.0028281729,0.0024183146],"domain_scores_gemma":[0.9662774,0.02329535,0.0011093499,0.005862126,0.0020265856,0.0014291095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045902305,0.0036798841,0.003917303,0.0031146796,0.0031458251,0.008896929,0.0059026773,0.0041794744,0.024149692],"category_scores_gemma":[0.037229337,0.0015012302,0.004467453,0.003628473,0.005517476,0.024623586,0.011131746,0.018653268,0.009682823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00432937,0.001009614,0.0077348542,0.0025583145,0.0004494182,0.0013135633,0.00129774,0.12033553,0.02865545,0.5896496,0.07702372,0.16564286],"study_design_scores_gemma":[0.00034712988,0.0004380816,0.0017391142,0.0007176166,0.0003677979,0.0013269692,0.00032479462,0.31949756,0.017398797,0.62396544,0.03366307,0.0002135263],"about_ca_topic_score_codex":0.0025967332,"about_ca_topic_score_gemma":0.0024137064,"teacher_disagreement_score":0.024149692,"about_ca_system_score_codex":0.0063148374,"about_ca_system_score_gemma":0.0043359012,"threshold_uncertainty_score":0.08078873},"labels":[],"label_agreement":null},{"id":"W4414869309","doi":"10.62056/ayivom2hd","title":"FrodoKEM: A CCA-Secure Learning With Errors Key Encapsulation Mechanism","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Cryptography; Exploit; NIST; Key encapsulation; Encapsulation (networking); Cryptographic protocol; Cryptographic primitive; Implementation; Encryption","score_opus":0.018278735053761125,"score_gpt":0.2922145365439903,"score_spread":0.2739358014902292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033765372,0.00021691632,0.9549988,0.000852608,0.00010631734,0.00022091127,0.00012001166,0.0022788912,0.0074401544],"genre_scores_gemma":[0.75905144,0.00023792412,0.22960669,0.00048111932,0.00008418238,0.00038674084,0.00018778208,0.0001744692,0.009789617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977481,0.00055174145,0.00009419912,0.00037783713,0.0009090357,0.00031902365],"domain_scores_gemma":[0.99791676,0.0005456533,0.00028901623,0.00091355515,0.0001947484,0.00014021891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002578513,0.00047289862,0.00061532843,0.0006816107,0.0010773891,0.0013051622,0.0027566077,0.0015599977,0.0022677525],"category_scores_gemma":[0.0050161285,0.00032080067,0.00065730966,0.0005680185,0.002813925,0.00390635,0.0049588983,0.0025320891,0.0010429636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006252084,0.00024213057,0.001207186,0.0001801032,0.0000665121,0.00032688174,0.0004725881,0.05758707,0.031439543,0.7535904,0.006581192,0.14768125],"study_design_scores_gemma":[0.00030435526,0.00039522254,0.0004619003,0.00006149151,0.00004922761,0.0005308263,0.00009821818,0.5033152,0.07049524,0.38674283,0.03733895,0.00020660611],"about_ca_topic_score_codex":0.00061581837,"about_ca_topic_score_gemma":0.0004976566,"teacher_disagreement_score":0.0027566077,"about_ca_system_score_codex":0.0009058719,"about_ca_system_score_gemma":0.0022556763,"threshold_uncertainty_score":0.013636649},"labels":[],"label_agreement":null},{"id":"W4414869544","doi":"10.62056/abe0zo-3y","title":"Access-Controlled Inner Product Function-Revealing Encryption","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Functional encryption; Encryption; Access control; Construct (python library); Scheme (mathematics); Bilinear interpolation; Protocol (science)","score_opus":0.038720755449041445,"score_gpt":0.35614175278181415,"score_spread":0.3174209973327727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027396426,0.00039517743,0.95289564,0.00083631143,0.00013634401,0.00015552528,0.00036045472,0.0006933993,0.017130785],"genre_scores_gemma":[0.8390823,0.0006225787,0.1457431,0.00072133046,0.00021664074,0.00027871548,0.000405128,0.00018705685,0.012743196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971221,0.00069182436,0.00022419973,0.0005246084,0.00097295415,0.00046436524],"domain_scores_gemma":[0.9954456,0.0009812006,0.0003612859,0.0025524346,0.00050992105,0.00014951274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020732651,0.000714936,0.00090251624,0.00051038194,0.00065141753,0.0020653992,0.0017394711,0.0010306662,0.004160821],"category_scores_gemma":[0.0052542384,0.00033295166,0.0010149828,0.00087615533,0.0024567458,0.0061591123,0.0041156695,0.003304366,0.0016459799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017962341,0.00009956967,0.00042621497,0.0001732146,0.000024157525,0.00025326223,0.0005069977,0.018752435,0.008807103,0.9318466,0.003369965,0.035560872],"study_design_scores_gemma":[0.000090226364,0.00033196725,0.0004374826,0.00009117176,0.000060447343,0.0012264677,0.00012466968,0.23055185,0.029060751,0.7001378,0.037779845,0.00010736114],"about_ca_topic_score_codex":0.00044111855,"about_ca_topic_score_gemma":0.00031555002,"teacher_disagreement_score":0.004160821,"about_ca_system_score_codex":0.0010418305,"about_ca_system_score_gemma":0.00135807,"threshold_uncertainty_score":0.0139193535},"labels":[],"label_agreement":null},{"id":"W4414869624","doi":"10.62056/angy11fgx","title":"zkMaP: Zero-Knowledge Succinct Non-Interactive Matrix Multiplication Proofs","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Matrix multiplication; Reduction (mathematics); Multiplication (music); Scalability; Matrix (chemical analysis); Speedup; Pairing","score_opus":0.020463009067450372,"score_gpt":0.3656531668869679,"score_spread":0.34519015781951756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414869624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00670358,0.00014863594,0.9808772,0.0003414912,0.00009819927,0.00025527176,0.00044161742,0.006512655,0.004621343],"genre_scores_gemma":[0.50260836,0.0005738078,0.48104373,0.0004866144,0.0001643635,0.00065910944,0.001710438,0.0014122783,0.011341352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535817,0.0012692158,0.00030268315,0.0005629904,0.0020261651,0.0004807963],"domain_scores_gemma":[0.99143934,0.0035272741,0.00067975983,0.0031967033,0.00087323313,0.0002837452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036076114,0.0008991868,0.0007445939,0.000868876,0.0010409128,0.0033224514,0.00389167,0.00118447,0.016606597],"category_scores_gemma":[0.012146574,0.0010596698,0.0009919462,0.0008237895,0.0020436875,0.007921811,0.007614361,0.0034447317,0.004898983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011923487,0.0003311069,0.0012605829,0.001435874,0.00016678787,0.0008760588,0.0009310295,0.045311388,0.05281619,0.6037438,0.02675971,0.2651752],"study_design_scores_gemma":[0.00037647007,0.00045976602,0.00054028723,0.00020245444,0.000091934875,0.00091046357,0.00018507423,0.41988626,0.17815849,0.33068022,0.06832583,0.00018273044],"about_ca_topic_score_codex":0.00061929127,"about_ca_topic_score_gemma":0.0008611513,"teacher_disagreement_score":0.016606597,"about_ca_system_score_codex":0.0009081941,"about_ca_system_score_gemma":0.003240425,"threshold_uncertainty_score":0.05555463},"labels":[],"label_agreement":null},{"id":"W4415006871","doi":"10.1145/3763110","title":"Tabby: A Synthesis-Aided Compiler for High-Performance Zero-Knowledge Proof Circuits","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Defense Advanced Research Projects Agency; Ethereum Foundation; Google; National Science Foundation","keywords":"Correctness; Compiler; Formal equivalence checking; Construct (python library); Equivalence (formal languages); Implementation; Proof assistant; Process (computing); High-level synthesis; Compiler construction","score_opus":0.015843559994084332,"score_gpt":0.2696909591242602,"score_spread":0.2538473991301759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415006871","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010411415,0.00025283688,0.9512922,0.00020651933,0.00009832281,0.00014031993,0.00074288546,0.031832747,0.0050226734],"genre_scores_gemma":[0.16165763,0.00038190978,0.82346916,0.00029526703,0.000044890516,0.00040598676,0.002138001,0.0068833004,0.00472375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999146,0.00020390058,0.00007901723,0.00010784812,0.0003476453,0.000115603776],"domain_scores_gemma":[0.9977748,0.0012606552,0.00013663321,0.0003970181,0.0003825023,0.000048353653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011265224,0.0008656827,0.00054297573,0.0007754501,0.00043407278,0.0014954887,0.0013913296,0.0007742735,0.010149349],"category_scores_gemma":[0.0051282616,0.0007433447,0.000825477,0.0005889744,0.0007600873,0.00189225,0.0014437168,0.0013089883,0.0031378847],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010230449,0.00025305443,0.0022724955,0.0016930195,0.0001460636,0.00068981317,0.000575214,0.19855848,0.09030319,0.18295252,0.07070917,0.450824],"study_design_scores_gemma":[0.00039292526,0.0002726902,0.00043267763,0.00021806396,0.000082859355,0.00045614655,0.00012474836,0.73063403,0.1109247,0.07828672,0.078095324,0.00007909821],"about_ca_topic_score_codex":0.0009866247,"about_ca_topic_score_gemma":0.0016838498,"teacher_disagreement_score":0.010149349,"about_ca_system_score_codex":0.0007113327,"about_ca_system_score_gemma":0.0024857537,"threshold_uncertainty_score":0.03395301},"labels":[],"label_agreement":null},{"id":"W4415322956","doi":"10.1145/3772274","title":"A Survey of Threshold Signatures: NIST Standards, Post-Quantum Cryptography, Exotic Techniques, and Real-World Applications","year":2025,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"NIST; Digital signature; Signature (topology); Cryptography; Digital forensics","score_opus":0.044247764465547235,"score_gpt":0.34467282039064495,"score_spread":0.3004250559250977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415322956","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017966353,0.96206284,0.012618547,0.0026294396,0.00055279786,0.00004320431,0.00007991159,0.000106681924,0.020109937],"genre_scores_gemma":[0.015089204,0.9701085,0.007635607,0.001315359,0.0008754596,0.00005671915,0.00017819232,0.000045004046,0.00469603],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839395,0.00028432696,0.00012660107,0.00024023377,0.0008339808,0.00012081856],"domain_scores_gemma":[0.99644864,0.0019600221,0.0002711931,0.00030420395,0.0008682856,0.0001476407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002431039,0.0007373228,0.0011491664,0.004319993,0.00082904275,0.0021987485,0.0012661705,0.0016174089,0.004176564],"category_scores_gemma":[0.0047013434,0.00054525456,0.00049849384,0.007157802,0.0015313142,0.0061352337,0.0013825268,0.0024058712,0.003195753],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053649386,0.00009461324,0.0007316834,0.0061492906,0.000034404373,0.00010676336,0.00018438646,0.0013681473,0.0018001752,0.13007088,0.0316852,0.8277207],"study_design_scores_gemma":[0.000009970472,0.0001540382,0.0007649885,0.0024299114,0.0000339035,0.0009790704,0.00019066891,0.0011116768,0.0016869889,0.03868551,0.95390457,0.000048731265],"about_ca_topic_score_codex":0.00074637105,"about_ca_topic_score_gemma":0.0009368641,"teacher_disagreement_score":0.004319993,"about_ca_system_score_codex":0.0014315057,"about_ca_system_score_gemma":0.0026180234,"threshold_uncertainty_score":0.013971984},"labels":[],"label_agreement":null},{"id":"W4415688386","doi":"10.1007/978-3-032-08124-7_29","title":"Efficient Dynamic Group Signatures with Forward Security","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Revocation; Group signature; Traceability; Forward secrecy; Scheme (mathematics); Signature (topology); Key (lock)","score_opus":0.004572619815887189,"score_gpt":0.21835797903848256,"score_spread":0.21378535922259537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415688386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021918496,0.0011077299,0.9143485,0.0012482092,0.00051404705,0.00020557737,0.00046202398,0.0026521524,0.057543263],"genre_scores_gemma":[0.46483055,0.0014879759,0.41956657,0.00061246805,0.0005110939,0.00036789163,0.001552712,0.00088419084,0.110186554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817634,0.00026824957,0.00008331551,0.00021430614,0.0009549316,0.0003028745],"domain_scores_gemma":[0.9986891,0.0003429268,0.00005886822,0.00069369376,0.00016889133,0.000046558118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008369835,0.0010475727,0.0011226941,0.0009922062,0.001104788,0.002339153,0.0014148733,0.0013035598,0.014211659],"category_scores_gemma":[0.0019955349,0.0006316903,0.0007095896,0.0016577021,0.0013294695,0.0061014933,0.0047966144,0.0024717213,0.0075515066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006251044,0.00022104548,0.00018472644,0.00025838855,0.0000398994,0.00015636258,0.00018972562,0.020775167,0.0268501,0.5301211,0.023235397,0.39734307],"study_design_scores_gemma":[0.00014147417,0.00017430636,0.00012621708,0.000071891576,0.000044817476,0.0005308376,0.000095893054,0.08043097,0.0500468,0.7890477,0.07923744,0.000051663472],"about_ca_topic_score_codex":0.00022510964,"about_ca_topic_score_gemma":0.00032517005,"teacher_disagreement_score":0.014211659,"about_ca_system_score_codex":0.0012212982,"about_ca_system_score_gemma":0.0013062714,"threshold_uncertainty_score":0.04754275},"labels":[],"label_agreement":null},{"id":"W4416233545","doi":"10.1109/wisee57913.2025.11229847","title":"Privacy-Preserving Spatial Range Query for Encrypted 3D Object Data","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Research and Productivity Council; University of New Brunswick","funders":"HORIZON EUROPE Health","keywords":"Search engine indexing; Encryption; Spatial analysis; Spatial query; Spatial database; Robustness (evolution); Range query (database); Query optimization; Octree; Data security","score_opus":0.03508987541057289,"score_gpt":0.30142875694527815,"score_spread":0.26633888153470525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416233545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10306366,0.00076482596,0.89035845,0.000547309,0.00007417473,0.00014888245,0.00034255584,0.0006946637,0.0040056016],"genre_scores_gemma":[0.905993,0.0005059713,0.090161085,0.00017234271,0.000053243708,0.00009262977,0.00035171444,0.00004356135,0.002626417],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973556,0.00043183638,0.00023457632,0.00023900249,0.0013754384,0.0003635213],"domain_scores_gemma":[0.9962022,0.0010514507,0.0004173258,0.0017823424,0.00043865672,0.000108010856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444718,0.00031665238,0.00091068447,0.000653246,0.00072216644,0.0014274401,0.001119606,0.00087609614,0.0013841676],"category_scores_gemma":[0.0042944183,0.00023943334,0.00068357406,0.0013173398,0.0010225042,0.0042116684,0.003551581,0.00092959794,0.0005237048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023000063,0.00038961397,0.006311184,0.0006107746,0.00021703882,0.002327453,0.0017865961,0.18539122,0.21923979,0.20532112,0.009780128,0.36632505],"study_design_scores_gemma":[0.00010461448,0.00036666883,0.001548651,0.00004301632,0.00006108455,0.0026836467,0.0005735165,0.8103248,0.12050155,0.05218013,0.0115160365,0.000096313255],"about_ca_topic_score_codex":0.0008618683,"about_ca_topic_score_gemma":0.0006281664,"teacher_disagreement_score":0.001444718,"about_ca_system_score_codex":0.00079770194,"about_ca_system_score_gemma":0.0008027752,"threshold_uncertainty_score":0.007640481},"labels":[],"label_agreement":null},{"id":"W4416252010","doi":"10.1109/bcca66705.2025.11229769","title":"SoK: The Role of Zero-Knowledge Proofs in Building Confidential and Trustworthy AI","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Confidentiality; Trustworthiness; Software deployment; Key (lock); Mathematical proof; Information privacy; Cryptography; Federated learning","score_opus":0.00521924070007497,"score_gpt":0.2629192734030914,"score_spread":0.25770003270301645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416252010","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011578754,0.0019141573,0.96025497,0.0074737025,0.00045479924,0.00019431599,0.00022032225,0.0013867571,0.016522106],"genre_scores_gemma":[0.6467546,0.0044648475,0.33634016,0.0019401746,0.0007782333,0.00043138704,0.00044269444,0.00065862905,0.008189275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9854624,0.0064391093,0.00097189774,0.0018761746,0.004270392,0.0009800367],"domain_scores_gemma":[0.92892694,0.038086448,0.00337204,0.024316795,0.0038823641,0.0014154788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018693043,0.00073883537,0.0013018895,0.0019610324,0.0029979781,0.009000796,0.0033406962,0.002848815,0.007294283],"category_scores_gemma":[0.064511016,0.00095315796,0.0015165912,0.0018983062,0.011969041,0.028070187,0.010206158,0.007295733,0.002121085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008374968,0.00002843573,0.00033944444,0.00026915976,0.000031098338,0.000082705235,0.0003238078,0.009579622,0.0010697899,0.9537818,0.0023117722,0.0320987],"study_design_scores_gemma":[0.000025430727,0.00003782571,0.000065718596,0.00013680248,0.000016667478,0.00010658995,0.00007984475,0.036061022,0.0024853286,0.9456461,0.0153099345,0.000028649827],"about_ca_topic_score_codex":0.001127233,"about_ca_topic_score_gemma":0.00078728097,"teacher_disagreement_score":0.018693043,"about_ca_system_score_codex":0.0027418153,"about_ca_system_score_gemma":0.0054815793,"threshold_uncertainty_score":0.09885943},"labels":[],"label_agreement":null},{"id":"W4416303658","doi":"10.1186/s42400-025-00356-7","title":"Communication-efficient public key encryption with (fine-grained delegated) equality test","year":2025,"lang":"en","type":"article","venue":"Cybersecurity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute on Governance","funders":"Science and Technology Commission of Shanghai Municipality; Shanghai Municipal Education Commission","keywords":"Encryption; Learning with errors; Key (lock); Attribute-based encryption; Delegation; Cloud computing; Rounding; Public-key cryptography; Probabilistic encryption","score_opus":0.013168887374636777,"score_gpt":0.24888833918816064,"score_spread":0.23571945181352386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416303658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048358295,0.00015400418,0.9428941,0.0006220976,0.000116028255,0.00011911671,0.00015063724,0.0005830767,0.0070026643],"genre_scores_gemma":[0.9268204,0.00007035696,0.06976287,0.00019803282,0.00006519744,0.00008123221,0.000111815796,0.000043605545,0.0028464585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99330986,0.0023314836,0.00046340717,0.0008020512,0.0021306912,0.0009624876],"domain_scores_gemma":[0.9915782,0.0025587317,0.0007920699,0.0038624483,0.0009151172,0.0002933651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026265564,0.0003554747,0.0010043781,0.0005013628,0.00074209296,0.0020217742,0.0013623962,0.0010438085,0.003285148],"category_scores_gemma":[0.009057883,0.00022217623,0.00067270023,0.00095155,0.002077581,0.0043620463,0.004338281,0.0024477353,0.000833295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008130275,0.00028769855,0.0011841796,0.00019122701,0.00006525745,0.000466888,0.0003654091,0.10301659,0.021734856,0.7600816,0.004924053,0.1068692],"study_design_scores_gemma":[0.00012693989,0.00019045235,0.00032655892,0.00003250016,0.000023656234,0.000359083,0.00007943855,0.6394547,0.032425538,0.32112616,0.0057879346,0.00006707322],"about_ca_topic_score_codex":0.00040307958,"about_ca_topic_score_gemma":0.0002638489,"teacher_disagreement_score":0.003285148,"about_ca_system_score_codex":0.00094984856,"about_ca_system_score_gemma":0.0011183172,"threshold_uncertainty_score":0.013890684},"labels":[],"label_agreement":null},{"id":"W4416385762","doi":"10.48550/arxiv.2510.08473","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission; Universiteit van Amsterdam; Canadian Institute for Advanced Research; Advanced Scientific Computing Research; Deutsche Forschungsgemeinschaft; U.S. Department of Energy","keywords":"Lattice problem; Lattice (music); Quantum; Dimension (graph theory); Quantum algorithm; Exponential function; Heuristic; Quantum computer; Lattice reduction","score_opus":0.037381484441433556,"score_gpt":0.30411065307364094,"score_spread":0.26672916863220736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416385762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032684274,0.00023285844,0.9499638,0.00045562827,0.00016808367,0.00022977297,0.0002278201,0.005328587,0.0107091535],"genre_scores_gemma":[0.17439513,0.00012689822,0.81788725,0.0002809975,0.000055826935,0.00027419688,0.0005456594,0.00040872366,0.006025315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984113,0.00021376417,0.00011155961,0.00024889264,0.00075036247,0.0002640456],"domain_scores_gemma":[0.9992225,0.0002233136,0.000046889676,0.00026750087,0.00017971668,0.00005996017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250967,0.00080409786,0.0014673029,0.001017918,0.0009501074,0.0013335636,0.0016189028,0.0013215799,0.009590162],"category_scores_gemma":[0.0023691987,0.00044454433,0.0011488141,0.0013130689,0.0010806862,0.001976121,0.0032066521,0.0019377051,0.0038548964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006339231,0.0004048886,0.0012964486,0.0002875872,0.00008893077,0.00042810338,0.0004823856,0.11371352,0.045491595,0.18142514,0.018718075,0.6370294],"study_design_scores_gemma":[0.00025631188,0.00021021764,0.0003565203,0.000034713925,0.000026029249,0.0003197751,0.000082355386,0.8683661,0.020026088,0.0954286,0.014807538,0.000085693566],"about_ca_topic_score_codex":0.0020252813,"about_ca_topic_score_gemma":0.0023229127,"teacher_disagreement_score":0.009590162,"about_ca_system_score_codex":0.0009507798,"about_ca_system_score_gemma":0.0026443666,"threshold_uncertainty_score":0.03208226},"labels":[],"label_agreement":null},{"id":"W4416549279","doi":"10.1145/3719027.3765075","title":"Peekaboo, I See Your Queries: Passive Attacks Against DSSE Via Intermittent Observations","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Encryption; Padding; Inverted index; Information leakage; Leakage (economics); Symmetric-key algorithm; Brute-force attack; Cryptography","score_opus":0.031359738869893565,"score_gpt":0.28482014239276376,"score_spread":0.2534604035228702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416549279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31564417,0.0009698293,0.6600944,0.0018215961,0.00009928694,0.00038416855,0.0004764364,0.011546443,0.008963697],"genre_scores_gemma":[0.95838106,0.00011634538,0.039504517,0.00026753478,0.0000201694,0.00007486976,0.00016185617,0.00010579918,0.0013677794],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971316,0.0006977958,0.0002125508,0.00050598156,0.0009813199,0.0004706864],"domain_scores_gemma":[0.99019486,0.0026007583,0.00081401225,0.005613027,0.00049996405,0.0002772872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020544338,0.0005638008,0.0007947633,0.00071791856,0.0006582415,0.0012845485,0.0014102336,0.0009841992,0.0010468997],"category_scores_gemma":[0.009509318,0.0004228254,0.0005299301,0.0006007055,0.0018083344,0.0048202514,0.0032567482,0.0021384596,0.00057930965],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003928473,0.00069796207,0.039539415,0.0005595642,0.00041337113,0.0009838132,0.0019100348,0.08216082,0.18595397,0.1565711,0.01846012,0.50882125],"study_design_scores_gemma":[0.00018199922,0.0007754984,0.0052477145,0.00006889253,0.0001201986,0.0019649619,0.0003302193,0.7631137,0.14222942,0.06742139,0.018429471,0.00011651537],"about_ca_topic_score_codex":0.0008880511,"about_ca_topic_score_gemma":0.00095825485,"teacher_disagreement_score":0.0020544338,"about_ca_system_score_codex":0.0007455599,"about_ca_system_score_gemma":0.0012391219,"threshold_uncertainty_score":0.010865033},"labels":[],"label_agreement":null},{"id":"W4416549569","doi":"10.1145/3719027.3765054","title":"Pool: A Practical OT-based OPRF from Learning with Rounding","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Rounding; Pseudorandom number generator; Oracle; Pseudorandom function family; Computation; Random oracle; Random number generation; Thread (computing); Set (abstract data type)","score_opus":0.01822384200655646,"score_gpt":0.28986853696682635,"score_spread":0.2716446949602699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416549569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02020496,0.00025202413,0.9613727,0.00047355358,0.00014436535,0.00045969678,0.0002999212,0.004819389,0.011973344],"genre_scores_gemma":[0.63265985,0.00027103483,0.35105306,0.0005923853,0.00015006399,0.0011006042,0.00066187343,0.00057896745,0.012932147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971111,0.00073142844,0.00016696425,0.0004761493,0.0010511692,0.0004631843],"domain_scores_gemma":[0.9973442,0.00065292337,0.00024360137,0.001381402,0.00022071763,0.00015724862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022475638,0.00065375236,0.0011210527,0.0005132217,0.0010787962,0.0018687476,0.0030511476,0.0013743024,0.009294242],"category_scores_gemma":[0.0051152236,0.00059031555,0.0009314633,0.0006582823,0.0018953606,0.0042328173,0.0051964205,0.0024911691,0.0034144612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028469628,0.00040736195,0.0020008355,0.00090605376,0.00016690565,0.00064333016,0.0006292673,0.08622196,0.07909684,0.5023782,0.025033504,0.2996687],"study_design_scores_gemma":[0.0005519612,0.0012631331,0.0007327677,0.00017081025,0.00016661237,0.00094254257,0.00015293367,0.62965184,0.10757723,0.19792613,0.060628947,0.00023501579],"about_ca_topic_score_codex":0.00047907958,"about_ca_topic_score_gemma":0.0004677115,"teacher_disagreement_score":0.009294242,"about_ca_system_score_codex":0.0008138558,"about_ca_system_score_gemma":0.0021138317,"threshold_uncertainty_score":0.031092346},"labels":[],"label_agreement":null},{"id":"W4416551819","doi":"10.23977/jeis.2025.100212","title":"An Efficient Identity Authentication Mechanism Based on Algebraic Curves and Zero-Knowledge Proofs","year":2025,"lang":"","type":"article","venue":"Journal of Electronics and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Authentication (law); Mathematical proof; Overhead (engineering); Scalability; Identity (music); Authentication protocol; Gas meter prover; Identity management","score_opus":0.006394486685064627,"score_gpt":0.27868799080833145,"score_spread":0.2722935041232668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416551819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026398685,0.00038014597,0.9678514,0.0002391419,0.000099954974,0.00018807592,0.00005221116,0.001147485,0.0036429076],"genre_scores_gemma":[0.76153505,0.00051162543,0.23371744,0.00010716395,0.00010610401,0.00019651905,0.00013284711,0.000077153956,0.003616068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668735,0.00085543667,0.00029217062,0.00053387927,0.0012529038,0.0003782439],"domain_scores_gemma":[0.9948945,0.0015192841,0.0008038998,0.0017670109,0.000817402,0.00019801389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023324192,0.00060007296,0.0009252531,0.0014761939,0.001345979,0.0023006517,0.0024084991,0.0010685408,0.0026636159],"category_scores_gemma":[0.0068832496,0.0004103667,0.0008680616,0.0014385991,0.0018630071,0.0058446773,0.0033020615,0.0017086945,0.0011555969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007407978,0.00025500762,0.0018464967,0.0004863405,0.00012386033,0.0004853707,0.0006269419,0.05349659,0.054882918,0.65714896,0.0032437544,0.22666308],"study_design_scores_gemma":[0.00034743172,0.0010697232,0.0007476786,0.00010417456,0.00015774732,0.001985383,0.00018173477,0.6745609,0.100448444,0.18003799,0.040108826,0.00024995315],"about_ca_topic_score_codex":0.0005704742,"about_ca_topic_score_gemma":0.00026121497,"teacher_disagreement_score":0.0026636159,"about_ca_system_score_codex":0.00091024337,"about_ca_system_score_gemma":0.0024732007,"threshold_uncertainty_score":0.012335181},"labels":[],"label_agreement":null},{"id":"W4416554282","doi":"10.1007/978-3-032-01887-8_5","title":"Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Glycemic Index Laboratories","funders":"","keywords":"Random oracle; Digital signature; Hash function; Schnorr signature; Cryptographic hash function; Cryptography; Merkle signature scheme; Pseudorandom number generator; Signature (topology); Block cipher","score_opus":0.01398291984168661,"score_gpt":0.2617194819523254,"score_spread":0.2477365621106388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416554282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010789864,0.00077012024,0.93954664,0.0018121297,0.0012317599,0.00023775616,0.0012922282,0.016626835,0.0276927],"genre_scores_gemma":[0.20739192,0.00070404174,0.69013846,0.0022272468,0.0009910648,0.00045358654,0.0030183573,0.018275356,0.076799996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909121,0.0019406497,0.0006648852,0.001845986,0.0031495725,0.0014867039],"domain_scores_gemma":[0.98919594,0.0028348812,0.00044086622,0.005307374,0.0018697706,0.00035111213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038174377,0.0022384566,0.0023003882,0.0035545758,0.0027871311,0.005357751,0.0045181406,0.002652015,0.048807103],"category_scores_gemma":[0.020728057,0.0018443237,0.0035179283,0.004932056,0.003387643,0.0154423835,0.007174381,0.008430721,0.02287589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012412238,0.00026640462,0.0012094019,0.0005581569,0.00013948084,0.00025756826,0.00068214437,0.01805078,0.017575344,0.4162033,0.11039414,0.43342212],"study_design_scores_gemma":[0.0001432153,0.00020899778,0.00088807795,0.000175457,0.00022553353,0.000454791,0.00031946573,0.11225706,0.03910183,0.7389282,0.10703933,0.00025802097],"about_ca_topic_score_codex":0.0036438412,"about_ca_topic_score_gemma":0.004900713,"teacher_disagreement_score":0.048807103,"about_ca_system_score_codex":0.0033243673,"about_ca_system_score_gemma":0.0035248369,"threshold_uncertainty_score":0.16327608},"labels":[],"label_agreement":null},{"id":"W4416728576","doi":"10.1109/mwscas53549.2025.11244511","title":"Efficient and Secure Neural Network Inference with Homomorphic Encryption","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Homomorphic encryption; MNIST database; Speedup; Inference; Artificial neural network; Cloud computing; Latency (audio); Computation","score_opus":0.008553379776621541,"score_gpt":0.23207997198178215,"score_spread":0.2235265922051606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416728576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048098307,0.00029711335,0.9426009,0.0005393958,0.000078841855,0.00010783744,0.00034179015,0.0035579232,0.004377773],"genre_scores_gemma":[0.6991373,0.00035798876,0.29269955,0.00021076426,0.00009882185,0.00018442942,0.0009470256,0.00021382865,0.0061503337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861646,0.00028843855,0.000097854696,0.00024129817,0.00055764406,0.00019830104],"domain_scores_gemma":[0.99758756,0.00051953195,0.00019457818,0.0014204853,0.0002242261,0.000053650077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011747847,0.0007780953,0.00088861695,0.0005939509,0.00066717237,0.0014503973,0.0017685917,0.0008485088,0.0033717346],"category_scores_gemma":[0.003818279,0.0005273213,0.00084004726,0.00071906415,0.0009117637,0.0040209694,0.002449353,0.002029617,0.0016463617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009616492,0.00037064592,0.0026326757,0.00019205746,0.0002157201,0.0005016748,0.00022690842,0.3795332,0.034925368,0.1098006,0.013250178,0.45738932],"study_design_scores_gemma":[0.00004119494,0.000036191304,0.00025112068,0.000009714178,0.000015444846,0.00010672476,0.00003293267,0.94563913,0.018707851,0.033868697,0.0012786108,0.000012355748],"about_ca_topic_score_codex":0.0026462122,"about_ca_topic_score_gemma":0.0052657826,"teacher_disagreement_score":0.0033717346,"about_ca_system_score_codex":0.0012427866,"about_ca_system_score_gemma":0.0023166786,"threshold_uncertainty_score":0.011279583},"labels":[],"label_agreement":null},{"id":"W4416866370","doi":"10.1007/978-3-032-12287-2_12","title":"Linear Prover IOPs in Log Star Rounds","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Gas meter prover; Oracle; Cryptography; Boolean function; Mathematical proof; Iterated function; Time complexity; Random oracle; Boolean circuit","score_opus":0.012729413396243373,"score_gpt":0.24546707933597225,"score_spread":0.2327376659397289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416866370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03218312,0.0012521456,0.6565745,0.005492511,0.0009995474,0.00033342864,0.001491668,0.010981871,0.2906912],"genre_scores_gemma":[0.57949674,0.001423946,0.16347536,0.0021208683,0.00093325815,0.0005496318,0.002076654,0.004107323,0.24581616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653864,0.0009686497,0.00016958175,0.00045197285,0.001129483,0.0007416858],"domain_scores_gemma":[0.9940402,0.0031730747,0.00017093634,0.0019146183,0.000444217,0.0002568213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024678563,0.0011899547,0.0016058573,0.0011876668,0.0022281331,0.0040197093,0.0018276419,0.0011587914,0.041271932],"category_scores_gemma":[0.0075250543,0.0012319661,0.0014232228,0.0020972206,0.0023051975,0.008500172,0.004852496,0.0056699696,0.015899861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007254775,0.00017063475,0.00040510742,0.00034783906,0.00003606935,0.00012231673,0.00038745068,0.006139768,0.0022250523,0.852897,0.04446043,0.092082895],"study_design_scores_gemma":[0.00009614778,0.000092143644,0.00016459796,0.00006101031,0.000032115116,0.00015427581,0.00008877726,0.025978707,0.0051242765,0.9370028,0.031179149,0.000026039257],"about_ca_topic_score_codex":0.0005972306,"about_ca_topic_score_gemma":0.0009561687,"teacher_disagreement_score":0.041271932,"about_ca_system_score_codex":0.0019560338,"about_ca_system_score_gemma":0.0024712957,"threshold_uncertainty_score":0.13806832},"labels":[],"label_agreement":null},{"id":"W4416884788","doi":"10.1007/978-3-032-12293-3_7","title":"Obfuscating Pseudorandom Functions is Post-quantum Complete","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ethereum Foundation; Fondazione Cariplo; Cisco Systems; National Science Foundation","keywords":"Homomorphic encryption; Class (philosophy); Obfuscation; Pseudorandom number generator; Pseudorandom function family; Encryption; Cryptography; Computation","score_opus":0.016334465133424545,"score_gpt":0.24105000517364336,"score_spread":0.22471554004021882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416884788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0808557,0.001443442,0.7154289,0.00561896,0.00070662494,0.00028610736,0.0008842217,0.0015839183,0.19319218],"genre_scores_gemma":[0.80480444,0.0024985275,0.09276088,0.0014760256,0.0010195528,0.00042975915,0.00093166326,0.0008735247,0.09520557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971794,0.000460789,0.00012376836,0.00039127693,0.0014139934,0.00043080954],"domain_scores_gemma":[0.994686,0.002907447,0.00025860735,0.0015526937,0.00043975996,0.00015541048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001951226,0.0013509941,0.0016469494,0.0012224527,0.0015091434,0.0033680305,0.001296789,0.001825061,0.010053005],"category_scores_gemma":[0.00497128,0.00094076054,0.0017261083,0.0013541295,0.004947324,0.0076596774,0.0040202113,0.0054930816,0.0032885722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006293336,0.000038888546,0.00009446677,0.000102235324,0.000020501657,0.000046953744,0.000106870044,0.0041627726,0.0018326507,0.9719149,0.0028967296,0.01872014],"study_design_scores_gemma":[0.000014344375,0.00003543353,0.0001374042,0.000030951807,0.000014679627,0.00009644885,0.00002048595,0.010292588,0.0039038418,0.979297,0.006139526,0.00001723633],"about_ca_topic_score_codex":0.00037667935,"about_ca_topic_score_gemma":0.00045589352,"teacher_disagreement_score":0.010053005,"about_ca_system_score_codex":0.0014607796,"about_ca_system_score_gemma":0.001998265,"threshold_uncertainty_score":0.03363067},"labels":[],"label_agreement":null},{"id":"W4417003690","doi":"10.1109/blockchain67634.2025.00022","title":"Vwe2psTS: Supporting Oracle-Based Conditional Payments from Joint Addresses","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Payment; Verifiable secret sharing; Cryptography; Outcome (game theory); Joint (building); Encryption; Database transaction; Oracle","score_opus":0.02641684021124251,"score_gpt":0.29371303396125825,"score_spread":0.26729619375001573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417003690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1263886,0.00032240298,0.8451609,0.000838588,0.00016833805,0.00054514833,0.00095880753,0.009536938,0.01608026],"genre_scores_gemma":[0.9019427,0.00020515246,0.089197375,0.00017449546,0.00005461602,0.00019880173,0.0011080353,0.0002908467,0.00682797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99696606,0.0006170683,0.00034695564,0.00040747353,0.0010938558,0.0005686321],"domain_scores_gemma":[0.9937961,0.001586448,0.00053322385,0.0031616958,0.00057619467,0.00034630793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025892942,0.00070438476,0.00097295444,0.00077259267,0.00078927574,0.0034514351,0.0021561608,0.0014672274,0.009859906],"category_scores_gemma":[0.009088073,0.00051403564,0.00087086676,0.0014134127,0.0016946113,0.007946944,0.0067272065,0.0028415136,0.0027711568],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029645963,0.0005082008,0.005779147,0.000627004,0.00014171595,0.0010202001,0.0007021577,0.09306635,0.042966865,0.5635202,0.013341135,0.27536243],"study_design_scores_gemma":[0.0004518181,0.00049455644,0.0010404291,0.0000879828,0.000072625735,0.0009576376,0.00019762515,0.6668022,0.06311297,0.23488034,0.031778276,0.00012355584],"about_ca_topic_score_codex":0.0008787518,"about_ca_topic_score_gemma":0.0006982168,"teacher_disagreement_score":0.009859906,"about_ca_system_score_codex":0.0010277188,"about_ca_system_score_gemma":0.0021300563,"threshold_uncertainty_score":0.032984734},"labels":[],"label_agreement":null},{"id":"W4417003986","doi":"10.1109/blockchain67634.2025.00028","title":"RzkFL: a Verifiable, Fast and Privacy-Preserving Framework for Federated Learning Inference Using Recursive Zero-Knowledge Proofs and on-Chain Verification","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"TD Bank Group; École de Technologie Supérieure","funders":"","keywords":"Mathematical proof; Verifiable secret sharing; Delegate; Proof of concept; Formal proof; Inference; Scheme (mathematics); Cryptography","score_opus":0.03536823710981656,"score_gpt":0.32429967316867514,"score_spread":0.28893143605885857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417003986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019817208,0.00018206115,0.98826677,0.000455464,0.000069730864,0.00016678804,0.00025029614,0.006696832,0.0019303171],"genre_scores_gemma":[0.30201462,0.00063446886,0.6824096,0.0014612586,0.000261044,0.0006993359,0.0017710866,0.0021016183,0.008646936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98226327,0.005437435,0.0014226421,0.0034079321,0.005693972,0.0017748412],"domain_scores_gemma":[0.96854097,0.0150922155,0.0019086973,0.01113087,0.0026676448,0.0006596109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013117801,0.0017280221,0.001828485,0.0021390142,0.0021146638,0.0072741834,0.008440325,0.0035174214,0.012745182],"category_scores_gemma":[0.04291215,0.0019612135,0.003975282,0.0016320841,0.005969492,0.014242636,0.01163307,0.008256384,0.005615205],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006529427,0.00027508795,0.001244111,0.0007933776,0.00020642135,0.0007922204,0.00068101473,0.13464676,0.0095531,0.6535708,0.01430731,0.18327695],"study_design_scores_gemma":[0.0001313439,0.000108519285,0.000125838,0.00014393151,0.00007181947,0.00025621837,0.00005942579,0.47095993,0.0128560355,0.4990957,0.016092684,0.00009858598],"about_ca_topic_score_codex":0.0035093285,"about_ca_topic_score_gemma":0.0036276644,"teacher_disagreement_score":0.013117801,"about_ca_system_score_codex":0.0040800655,"about_ca_system_score_gemma":0.007969086,"threshold_uncertainty_score":0.06937444},"labels":[],"label_agreement":null},{"id":"W4417090922","doi":"10.1007/978-981-95-5125-5_11","title":"Signatures From Pseudorandom States via $$\\bot $$-PRFs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"European Commission","keywords":"Pseudorandomness; Pseudorandom function family; Pseudorandom number generator; Correctness; Digital signature; Construct (python library); Cryptography; Pseudorandom generator theorem; Pseudorandom generator; Discrete logarithm","score_opus":0.007799615261388213,"score_gpt":0.22809440012909377,"score_spread":0.22029478486770554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417090922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018625934,0.00035424926,0.92883015,0.0011490626,0.00047642045,0.00031808438,0.0004794853,0.0086901495,0.041076496],"genre_scores_gemma":[0.6807118,0.00075639103,0.2397618,0.0011583179,0.0004777562,0.00081099174,0.0010105696,0.002173233,0.07313917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958988,0.0010380204,0.0002341524,0.00064403855,0.0016727071,0.0005123942],"domain_scores_gemma":[0.9952766,0.001868093,0.00024781204,0.0021170762,0.00037606643,0.00011431387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001954568,0.0010872817,0.0011814107,0.001168024,0.0011441475,0.0030261583,0.0017614547,0.0018188623,0.018784182],"category_scores_gemma":[0.008209623,0.00072044006,0.0011158511,0.0013542959,0.0027185266,0.0069295033,0.0045778127,0.0033367772,0.008638447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003496831,0.000084589585,0.00016226887,0.00015276013,0.000022985381,0.000093878014,0.00016018043,0.009535016,0.0047323448,0.8453186,0.0107661765,0.12862155],"study_design_scores_gemma":[0.00008727533,0.00011329673,0.00011394819,0.000069492104,0.000029989655,0.00031739025,0.000043228367,0.07949063,0.01939391,0.8693087,0.030972028,0.00006012389],"about_ca_topic_score_codex":0.00034029502,"about_ca_topic_score_gemma":0.00039907862,"teacher_disagreement_score":0.018784182,"about_ca_system_score_codex":0.0013878504,"about_ca_system_score_gemma":0.001385664,"threshold_uncertainty_score":0.06283939},"labels":[],"label_agreement":null},{"id":"W4417092013","doi":"10.1109/trustcom66490.2025.00073","title":"OUF: Oblivious Universal Function with domain specific optimizations","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Homomorphic encryption; Encryption; Scalability; Function (biology); Cryptography; Functional encryption; Secure multi-party computation; Outsourcing; Confidentiality","score_opus":0.004611536185779309,"score_gpt":0.18733867224447354,"score_spread":0.18272713605869423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417092013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039039917,0.0005021077,0.9425082,0.00069919124,0.000095883515,0.00023406273,0.00020310003,0.0051777274,0.011539725],"genre_scores_gemma":[0.8105051,0.0003859182,0.17680241,0.00051264855,0.00009042784,0.0004825558,0.00033083375,0.0007234824,0.010166664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982198,0.0004135012,0.000115264884,0.00022294487,0.00052919745,0.000499229],"domain_scores_gemma":[0.9975574,0.000561667,0.00018767898,0.0014468703,0.0001530264,0.000093321905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017890953,0.000569907,0.0008998725,0.0007618048,0.0011336214,0.0015532589,0.0017635815,0.000903349,0.0035749513],"category_scores_gemma":[0.0046563693,0.00039878802,0.000828561,0.0008997773,0.002790753,0.004730953,0.0039010341,0.0022683407,0.0011262643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007777574,0.00018389731,0.0014223031,0.0003304364,0.000078624944,0.000366217,0.0006615346,0.08558131,0.018345473,0.7549465,0.010928388,0.12637763],"study_design_scores_gemma":[0.0001522107,0.0002112098,0.0004737609,0.00009588042,0.00008033717,0.00036332704,0.000107652195,0.41065508,0.033764746,0.5207707,0.03322868,0.00009643487],"about_ca_topic_score_codex":0.0011522515,"about_ca_topic_score_gemma":0.0011279017,"teacher_disagreement_score":0.0035749513,"about_ca_system_score_codex":0.0017541886,"about_ca_system_score_gemma":0.0018990582,"threshold_uncertainty_score":0.012727618},"labels":[],"label_agreement":null},{"id":"W4417435634","doi":"10.1016/j.csi.2025.104114","title":"Assessing the quantum readiness of cryptographic standards: Recommendations toward quantum-era compliance","year":2025,"lang":"en","type":"article","venue":"Computer Standards & Interfaces","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Cryptographic primitive; Cryptography; Digital signature; Key exchange; Quantum cryptography; Cryptographic protocol; Hash function; Security of cryptographic hash functions","score_opus":0.04392067849776685,"score_gpt":0.37137682146845447,"score_spread":0.3274561429706876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417435634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1479445,0.005647234,0.49975812,0.22201166,0.0024881538,0.0032220003,0.0016178454,0.0038303055,0.11348017],"genre_scores_gemma":[0.52388453,0.0028076437,0.45629525,0.009168641,0.0002516994,0.0012952064,0.0009862902,0.00030066728,0.005010051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.964521,0.01609879,0.0038165238,0.0025691565,0.011116606,0.0018779732],"domain_scores_gemma":[0.81188166,0.057371873,0.014099225,0.023235166,0.08726298,0.0061491807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05878848,0.0015018407,0.0013206023,0.005791166,0.0034728912,0.009701318,0.005476378,0.006218955,0.009897998],"category_scores_gemma":[0.18207273,0.0007392615,0.0012972307,0.004309639,0.0055712983,0.020080775,0.0057615545,0.0058151665,0.0025977485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041811157,0.0018311813,0.072112456,0.0019043006,0.00026052646,0.00029667048,0.0025045804,0.012748444,0.011207572,0.5177296,0.04610834,0.33287817],"study_design_scores_gemma":[0.00026014185,0.0013475281,0.03227663,0.005110313,0.00034100868,0.00041811727,0.014454933,0.047762584,0.03324406,0.76290494,0.1014486,0.00043116417],"about_ca_topic_score_codex":0.007412411,"about_ca_topic_score_gemma":0.012966474,"teacher_disagreement_score":0.05878848,"about_ca_system_score_codex":0.004187196,"about_ca_system_score_gemma":0.01877834,"threshold_uncertainty_score":0.3109069},"labels":[],"label_agreement":null},{"id":"W4417469957","doi":"10.1109/tnse.2025.3645991","title":"Subversion-Resistant Autonomous Path Proxy Re-Encryption With Secure Deduplication for IoMT","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Data deduplication; Plaintext; Server; Cryptography; Cloud computing; Encryption; Delegate; The Internet; Homomorphic encryption; Information sensitivity","score_opus":0.005978692494523218,"score_gpt":0.20994368591357399,"score_spread":0.20396499341905078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417469957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14480457,0.0024375492,0.8435418,0.00059305475,0.0002821422,0.0003531944,0.00020847873,0.0016325898,0.0061465986],"genre_scores_gemma":[0.94993293,0.00028459053,0.047797818,0.00011580393,0.000053086245,0.00007162868,0.00012968894,0.00004229346,0.001572146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980292,0.00054191635,0.0002486899,0.0002655921,0.00064840965,0.00026623142],"domain_scores_gemma":[0.9962979,0.00072937773,0.00045838478,0.0019735983,0.0004141691,0.00012668032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948274,0.0004279681,0.0007664081,0.00060768833,0.0006815903,0.0010619442,0.0012509718,0.00061019324,0.0011088395],"category_scores_gemma":[0.0038721103,0.00020518016,0.0005558454,0.000829911,0.0008134112,0.002968909,0.0020405196,0.0009601914,0.00045055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002349444,0.00048495285,0.0059409873,0.0010814648,0.00033326316,0.0035359503,0.0016791334,0.12269624,0.19395997,0.20473386,0.011102844,0.45210192],"study_design_scores_gemma":[0.00025301886,0.0012832995,0.0021548977,0.00013121525,0.00016203849,0.0067372792,0.00042262103,0.72295606,0.17844598,0.05999855,0.027261771,0.0001932744],"about_ca_topic_score_codex":0.00024976252,"about_ca_topic_score_gemma":0.00025869143,"teacher_disagreement_score":0.0013948274,"about_ca_system_score_codex":0.000519729,"about_ca_system_score_gemma":0.00082531216,"threshold_uncertainty_score":0.007376611},"labels":[],"label_agreement":null},{"id":"W580506822","doi":"10.1007/978-3-319-05302-8","title":"Foundations and Practice of Security 6th International Symposium, FPS 2013, La Rochelle, France, October 21-22, 2013, Revised Selected Papers","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Political science; Library science; Computer science","score_opus":0.007534682171022398,"score_gpt":0.2377787725487107,"score_spread":0.23024409037768828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W580506822","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009093408,0.11695328,0.55425334,0.08468085,0.00794564,0.00018848859,0.00085830217,0.001931086,0.22409567],"genre_scores_gemma":[0.40563422,0.102527305,0.32050082,0.0047130194,0.0099556325,0.0006296659,0.0016921203,0.0010492177,0.15329804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99311125,0.0026400704,0.00056436774,0.0012910033,0.0018644885,0.00052885263],"domain_scores_gemma":[0.9909101,0.0038062301,0.00032416836,0.0027415259,0.0017514552,0.0004666048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00987371,0.0013060533,0.001067131,0.0034283004,0.0031608618,0.013957687,0.0017182196,0.0035466854,0.020559283],"category_scores_gemma":[0.013228312,0.0013003468,0.0012891993,0.0031322588,0.010633606,0.012203361,0.0046162107,0.007128158,0.00637818],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041523028,0.000039205977,0.0005685468,0.00022408424,0.000023186592,0.00010861457,0.0007983027,0.0009961488,0.000518807,0.8460123,0.053746056,0.096923165],"study_design_scores_gemma":[0.00002658952,0.000040670348,0.00079757883,0.0008262155,0.000029877989,0.0005220994,0.00052591553,0.0038671962,0.0010197025,0.5688267,0.42347807,0.000039292307],"about_ca_topic_score_codex":0.0055095116,"about_ca_topic_score_gemma":0.0034450563,"teacher_disagreement_score":0.020559283,"about_ca_system_score_codex":0.008572167,"about_ca_system_score_gemma":0.005025888,"threshold_uncertainty_score":0.06877762},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02381885422453816,"score_gpt":0.2427579886217169,"score_spread":0.21893913439717874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65414435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028217787,0.0005039634,0.9531846,0.00070853834,0.00013299572,0.00011522879,0.00007764677,0.0004997903,0.016559536],"genre_scores_gemma":[0.88884085,0.0004852158,0.09830495,0.00023256344,0.00015480234,0.00023785113,0.000104645456,0.00014286011,0.011496214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956351,0.0015118589,0.00025679905,0.00046346494,0.001496437,0.0006363446],"domain_scores_gemma":[0.9946089,0.0027074714,0.00028474894,0.0019569062,0.00030099816,0.00014091148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304237,0.0010882703,0.0014320933,0.00083507877,0.001304867,0.0028413301,0.0016800129,0.0018948601,0.0050895945],"category_scores_gemma":[0.007018306,0.0006641608,0.0015040918,0.0011661641,0.0030606322,0.0071629616,0.0063898186,0.0041358788,0.0015644826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002598924,0.00005266044,0.00014611866,0.00014413112,0.000040509574,0.0002203275,0.00017708624,0.025450896,0.00608233,0.9344099,0.0018669241,0.031149236],"study_design_scores_gemma":[0.00004913423,0.00008558764,0.0000922656,0.000038514365,0.000025979947,0.00031111873,0.000027869759,0.21362181,0.008340146,0.77447027,0.0029014738,0.00003586238],"about_ca_topic_score_codex":0.00016204288,"about_ca_topic_score_gemma":0.000151858,"teacher_disagreement_score":0.0050895945,"about_ca_system_score_codex":0.0012745715,"about_ca_system_score_gemma":0.00078660005,"threshold_uncertainty_score":0.017026365},"labels":[],"label_agreement":null},{"id":"W6891668506","doi":"10.4230/lipics.ccc.2025.34","title":"Witness Encryption and NP-Hardness of Learning","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Encryption; Witness; Reduction (mathematics); Complement (music); Probabilistic encryption; 40-bit encryption","score_opus":0.006939146569976057,"score_gpt":0.24628382860903614,"score_spread":0.2393446820390601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891668506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27182963,0.0011292977,0.66903293,0.020080926,0.00020338711,0.00029820198,0.0015648825,0.0011170957,0.034743708],"genre_scores_gemma":[0.9120369,0.0007225753,0.073173985,0.0017134652,0.0003659297,0.0002753225,0.0012112261,0.00021952087,0.010281135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967811,0.0009533886,0.00014475979,0.0008385676,0.0007408884,0.00054132805],"domain_scores_gemma":[0.9742406,0.02127632,0.0009816507,0.0024892958,0.00052024616,0.0004919092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023674604,0.00090046163,0.0011312977,0.000660001,0.0012265181,0.0034746744,0.0027062343,0.0022017048,0.008146503],"category_scores_gemma":[0.016549645,0.0006362874,0.0023499103,0.0010061982,0.0037396941,0.013077794,0.0050534466,0.009091835,0.0007226181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037404153,0.0004644003,0.0026881108,0.00048203446,0.00012252232,0.00039113458,0.0009724256,0.074528605,0.0032261715,0.8791152,0.006618039,0.03101738],"study_design_scores_gemma":[0.0000668708,0.00006427199,0.00047095472,0.000034390636,0.00003294943,0.00018221923,0.0001602783,0.13447852,0.0025858246,0.8590756,0.0028243598,0.00002374286],"about_ca_topic_score_codex":0.0009667391,"about_ca_topic_score_gemma":0.00095463893,"teacher_disagreement_score":0.008146503,"about_ca_system_score_codex":0.0029857943,"about_ca_system_score_gemma":0.0014215958,"threshold_uncertainty_score":0.027252734},"labels":[],"label_agreement":null},{"id":"W6902013192","doi":"10.6084/m9.figshare.26560733.v1","title":"Additional file 2 of Sequre: a high-performance framework for secure multiparty computation enables biomedical data sharing","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Secure multi-party computation; Data sharing; Data access; Computation; File sharing; SSH File Transfer Protocol","score_opus":0.06586538541730082,"score_gpt":0.2996291609663601,"score_spread":0.2337637755490593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6902013192","genre_codex":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019344647,0.0015017514,0.0043131253,0.003944496,0.0010145381,0.0005504621,0.97504413,0.002666035,0.010772079],"genre_scores_gemma":[0.018226167,0.0072202766,0.023822084,0.013568864,0.0038065836,0.005952367,0.8351361,0.0064863483,0.085781224],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975212,0.0006840928,0.00039670436,0.000406811,0.00079306524,0.00019810206],"domain_scores_gemma":[0.9409632,0.04496495,0.002732923,0.0040130834,0.0056665647,0.0016592013],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0058840527,0.000984209,0.001626992,0.002954149,0.0010032371,0.0027390185,0.0032797048,0.0021854057,0.88877916],"category_scores_gemma":[0.071031936,0.0007472393,0.001734809,0.0041601732,0.00063108496,0.0038116265,0.0020348576,0.0019537776,0.2381427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021225546,0.000015384638,0.0002073364,0.00400209,0.000034739158,0.00004898763,0.000026214864,0.00013117837,0.00006418769,0.0020998407,0.97809154,0.01506624],"study_design_scores_gemma":[0.0011265315,0.00010858369,0.0019492127,0.004261731,0.00013393357,0.00045659457,0.00007380385,0.00049633585,0.00056266657,0.0137410415,0.9770173,0.000072184455],"about_ca_topic_score_codex":0.0028995643,"about_ca_topic_score_gemma":0.004425507,"teacher_disagreement_score":0.88877916,"about_ca_system_score_codex":0.0020895833,"about_ca_system_score_gemma":0.0035368456,"threshold_uncertainty_score":0.15864295},"labels":[],"label_agreement":null},{"id":"W6910320367","doi":"10.4230/lipics.icalp.2023.28","title":"Nondeterministic Interactive Refutations for Nearest Boolean Vector","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; European Commission","keywords":"Nondeterministic algorithm; Boolean function; Cube (algebra); Randomness; Maximum satisfiability problem; Linear subspace; Matrix (chemical analysis); Two-element Boolean algebra","score_opus":0.0219407974307442,"score_gpt":0.29767691246184613,"score_spread":0.27573611503110196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910320367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30683056,0.00046961248,0.669156,0.0031184445,0.00026126378,0.00032784732,0.0006745659,0.007676159,0.01148562],"genre_scores_gemma":[0.87360895,0.00010385843,0.12002844,0.00040368031,0.00006424152,0.00017217846,0.00068495603,0.00060609856,0.0043275133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947976,0.0014471001,0.00040923952,0.0012499398,0.0012039719,0.0008921802],"domain_scores_gemma":[0.95837224,0.028420104,0.0016677683,0.008747056,0.0019923053,0.0008004998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037144523,0.00076509686,0.0014287471,0.0007858602,0.0021567713,0.0023819606,0.004115241,0.00205334,0.0077711698],"category_scores_gemma":[0.032547858,0.0006418628,0.0017528322,0.0010602818,0.003371084,0.0055210353,0.007284672,0.0037865543,0.0014888162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026394625,0.0006777181,0.013693423,0.0009060498,0.00022788311,0.00091103057,0.0026858428,0.17009531,0.0207077,0.38895357,0.017516602,0.38098544],"study_design_scores_gemma":[0.00020349686,0.00017605242,0.00076412957,0.000068245194,0.00007880064,0.00034403446,0.0003264972,0.5719965,0.02460945,0.39699653,0.00434348,0.00009276806],"about_ca_topic_score_codex":0.002555724,"about_ca_topic_score_gemma":0.005213931,"teacher_disagreement_score":0.0077711698,"about_ca_system_score_codex":0.002190487,"about_ca_system_score_gemma":0.0031783534,"threshold_uncertainty_score":0.025997162},"labels":[],"label_agreement":null},{"id":"W6925448007","doi":"10.17605/osf.io/my8pc","title":"Exact integer linear programming solvers outperform simulated annealing for solving conservation planning problems","year":2019,"lang":"en","type":"article","venue":"OSF Preprints (OSF Preprints)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Solver; Integer programming; Simulated annealing; Linear programming; Integer (computer science); Sensitivity (control systems)","score_opus":0.023604260065178444,"score_gpt":0.2713938446204197,"score_spread":0.24778958455524128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925448007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1532486,0.0028743646,0.7722902,0.0020874485,0.0003651679,0.00031444294,0.0010575764,0.0041666455,0.06359559],"genre_scores_gemma":[0.42312953,0.0006175515,0.5704269,0.0003037097,0.00006117516,0.0002580414,0.00088044896,0.0005946628,0.0037279048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982054,0.00091607583,0.00010770982,0.00022856033,0.00038948853,0.00015282193],"domain_scores_gemma":[0.9896638,0.008641686,0.00051088596,0.00046304293,0.00059143524,0.0001291703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030484188,0.001396046,0.0007818688,0.0009697261,0.00067926163,0.002008378,0.0009774971,0.0012517172,0.008371138],"category_scores_gemma":[0.010480108,0.0007884732,0.0010003304,0.0015064455,0.0006708947,0.0015802062,0.0009072363,0.0018894506,0.0010149074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006461437,0.00006826799,0.00057114474,0.00016199682,0.000055082957,0.000023658284,0.000041245712,0.963456,0.0004362144,0.00779729,0.0016627262,0.025661772],"study_design_scores_gemma":[0.000027249047,0.00003263076,0.00010723567,0.00002248172,0.0000129356395,0.000008690311,0.000037874226,0.9915524,0.0007292015,0.005910939,0.0015534711,0.000004785612],"about_ca_topic_score_codex":0.015308898,"about_ca_topic_score_gemma":0.020200403,"teacher_disagreement_score":0.015308898,"about_ca_system_score_codex":0.0017364632,"about_ca_system_score_gemma":0.0028903985,"threshold_uncertainty_score":0.030439556},"labels":[],"label_agreement":null},{"id":"W6931881153","doi":"10.5683/sp3/1zer9c","title":"UNI-CEN Boundaries (CBF-Harmonized Shorelines) - Census Subdivision (CSD) - 1931 - Esri Shapefile format (WGS84 / EPSG:4326)","year":2022,"lang":"en","type":"dataset","venue":"Borealis","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Shapefile; North American Datum of 1927; File format; Documentation; Census; Boundary (topology); Data file; Geocoding","score_opus":0.02129419818873965,"score_gpt":0.25915276050582914,"score_spread":0.2378585623170895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931881153","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008774305,0.00001583697,0.0000629004,0.000022872164,0.000009990641,0.0000074754553,0.99856,0.00019646362,0.0010367844],"genre_scores_gemma":[0.00028915974,0.000023480949,0.00022840872,0.000016522155,0.0000024688911,0.000047384536,0.99865985,0.00006977927,0.00066285435],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872607,0.00017383124,0.00017472741,0.00030119272,0.00036629484,0.00025772137],"domain_scores_gemma":[0.99693465,0.00035017575,0.00031510182,0.00080461655,0.0013417484,0.00025374038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013483396,0.0015020816,0.0011287433,0.004420256,0.0007792019,0.0022327674,0.0027790335,0.001006191,0.076598294],"category_scores_gemma":[0.0063401563,0.0007568441,0.0007364804,0.010283146,0.0003768187,0.0015314318,0.0020043545,0.0017963398,0.12794276],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026646967,0.000008189208,0.00085557875,0.00021456748,0.000009944944,0.000009055891,0.000021991034,0.00008919681,0.00006570803,0.0006862493,0.9965725,0.0014404109],"study_design_scores_gemma":[0.000063129875,0.000004171136,0.0041776453,0.00013234677,0.0000071363297,0.000024049306,0.000087684275,0.0001048267,0.00022357571,0.0005144811,0.9946484,0.000012596329],"about_ca_topic_score_codex":0.07117055,"about_ca_topic_score_gemma":0.09804662,"teacher_disagreement_score":0.92882943,"about_ca_system_score_codex":0.0024735713,"about_ca_system_score_gemma":0.0041114287,"threshold_uncertainty_score":0.2562468},"labels":[],"label_agreement":null},{"id":"W6939362921","doi":"10.60692/sq2nk-nj093","title":"Improved Dynamic Multi-Party Quantum Private Comparison for Next-Generation Mobile Network","year":2019,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; Toronto Metropolitan University","funders":"","keywords":"Protocol (science); Collusion; Wireless network; Private network; Wireless; Private information retrieval; Cryptographic protocol; Property (philosophy)","score_opus":0.04741781680279491,"score_gpt":0.24623922167563178,"score_spread":0.19882140487283687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939362921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06393454,0.00046854687,0.92148584,0.0012229923,0.00017179831,0.00034847087,0.00010518538,0.00029639844,0.011966242],"genre_scores_gemma":[0.8957385,0.00025170285,0.09818913,0.00025443727,0.000071701244,0.00022856578,0.00007626983,0.000051807645,0.0051380023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994787,0.002127658,0.0002330289,0.000705167,0.0015685539,0.00057864457],"domain_scores_gemma":[0.9966511,0.0016445369,0.0003446872,0.0007516945,0.0004411228,0.0001668925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004521421,0.000467529,0.000912505,0.0007782933,0.0015357864,0.0016460331,0.0024173085,0.0014960928,0.003958303],"category_scores_gemma":[0.007104558,0.0003912236,0.00091166125,0.0010567241,0.0026348436,0.005227738,0.0037593315,0.002799811,0.00045446472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005667636,0.00018852137,0.0006739444,0.00017938692,0.00010449595,0.00038207503,0.0004992169,0.054559108,0.02364447,0.87687325,0.002207221,0.040121607],"study_design_scores_gemma":[0.00023586908,0.00038889202,0.00041381392,0.00004606069,0.00009227001,0.0005004967,0.00011031949,0.6615154,0.026767377,0.29778826,0.0119895525,0.0001517016],"about_ca_topic_score_codex":0.0006857282,"about_ca_topic_score_gemma":0.0005568582,"teacher_disagreement_score":0.004521421,"about_ca_system_score_codex":0.0019171953,"about_ca_system_score_gemma":0.0022638922,"threshold_uncertainty_score":0.023911834},"labels":[],"label_agreement":null},{"id":"W6946763809","doi":"10.34989/swp-2023-33","title":"Privacy-Preserving Post-Quantum Credentials for Digital Payments","year":2023,"lang":"en","type":"article","venue":"Econstor (Econstor)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Credential; Homomorphic encryption; Payment; Encryption; Protocol (science); Random oracle; Service provider; Trusted third party; Scheme (mathematics); Digital signature","score_opus":0.02168822695022257,"score_gpt":0.2627502327004467,"score_spread":0.2410620057502241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946763809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13433795,0.0006980003,0.8402203,0.0013238053,0.00026076596,0.00027435677,0.0001825612,0.0011047424,0.021597518],"genre_scores_gemma":[0.9275232,0.0002554755,0.06674047,0.00015557608,0.00007072607,0.00011226605,0.00009015248,0.000053287757,0.004998866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974214,0.0008245229,0.00013376583,0.0002491707,0.0009935577,0.00037760643],"domain_scores_gemma":[0.9969723,0.0010366341,0.0002620664,0.0013029048,0.0002595966,0.00016654286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022397554,0.00027313904,0.00047939547,0.0004854507,0.0014337937,0.0022866651,0.0012777513,0.0012966681,0.0050208615],"category_scores_gemma":[0.006214168,0.00031264534,0.0005555069,0.00071684935,0.0025644433,0.0046992376,0.0028017475,0.0025921687,0.0011038418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004335717,0.00015144191,0.0005695188,0.0002122366,0.000019782805,0.00018892347,0.0003014486,0.021532614,0.016822247,0.9002569,0.0024139646,0.05709748],"study_design_scores_gemma":[0.00018230305,0.0005194383,0.00085121044,0.000111818175,0.000054112024,0.0007039299,0.00013618702,0.29280898,0.081279054,0.5861043,0.037130356,0.000118413904],"about_ca_topic_score_codex":0.00032778207,"about_ca_topic_score_gemma":0.00028068264,"teacher_disagreement_score":0.0050208615,"about_ca_system_score_codex":0.001189315,"about_ca_system_score_gemma":0.0022677018,"threshold_uncertainty_score":0.01679641},"labels":[],"label_agreement":null},{"id":"W6965564889","doi":"10.34989/swp-2023-50","title":"Anonymous Credentials: Secret-Free and Quantum-Safe","year":2023,"lang":"en","type":"article","venue":"Econstor (Econstor)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Credential; Construct (python library); Homomorphic encryption; Merkle tree; Guard (computer science); Hash function; Scheme (mathematics); Argument (complex analysis); Commitment scheme; Random oracle","score_opus":0.017192501709957595,"score_gpt":0.2424102500821065,"score_spread":0.22521774837214892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6965564889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06061163,0.00045759827,0.9008807,0.0025205738,0.00027096446,0.00027890003,0.000245407,0.0009916356,0.0337427],"genre_scores_gemma":[0.86575395,0.00032341894,0.11981899,0.0004857534,0.00017809506,0.00026825545,0.00015686407,0.0001642298,0.012850408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99235475,0.0018801137,0.000415501,0.00086172135,0.0034308971,0.0010570417],"domain_scores_gemma":[0.98817235,0.003808846,0.0011593293,0.0049492274,0.0011468624,0.00076324097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057567223,0.0004135979,0.0008701046,0.0013345693,0.003019904,0.0060168677,0.0019285777,0.002702258,0.0052426374],"category_scores_gemma":[0.014601275,0.00067194796,0.0011803567,0.0014475674,0.008571717,0.012382087,0.008837263,0.004191174,0.0019675181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060881182,0.000033737317,0.00014590174,0.000033664932,0.000008043665,0.000075492986,0.00026463773,0.0016882145,0.0016614065,0.9856609,0.0008258579,0.009541293],"study_design_scores_gemma":[0.00007437802,0.000052624902,0.0001443844,0.000057898604,0.00002410435,0.0002806331,0.00010320075,0.025701474,0.0086643575,0.94570315,0.019126493,0.00006734095],"about_ca_topic_score_codex":0.00066920184,"about_ca_topic_score_gemma":0.00040813454,"teacher_disagreement_score":0.0060168677,"about_ca_system_score_codex":0.0018734452,"about_ca_system_score_gemma":0.0033556677,"threshold_uncertainty_score":0.0304448},"labels":[],"label_agreement":null},{"id":"W6966867884","doi":"10.4230/lipics.itcs.2023.23","title":"On Low-End Obfuscation and Learning","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Obfuscation; Multilinear map; Cryptography; Class (philosophy); Simple (philosophy); Representation (politics); Context (archaeology); Learning with errors","score_opus":0.009901839214712521,"score_gpt":0.2411788112378562,"score_spread":0.23127697202314368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966867884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018075282,0.0039722486,0.9396573,0.0038773504,0.00021369156,0.00010153509,0.00018059998,0.0005860263,0.033336047],"genre_scores_gemma":[0.6376238,0.010361633,0.31816143,0.0035633235,0.0014754565,0.0007566298,0.00086443924,0.0005724372,0.026620852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343735,0.002016697,0.00033981528,0.0014302761,0.0020479984,0.0007278931],"domain_scores_gemma":[0.9759127,0.017364215,0.0008456349,0.004680149,0.0008828511,0.0003144005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053154817,0.0021083641,0.001512638,0.0017944742,0.0018131532,0.0040804744,0.0021284362,0.0028720282,0.005972347],"category_scores_gemma":[0.015679045,0.00081715843,0.0018756337,0.0017075114,0.013596641,0.015446807,0.0070106937,0.012762166,0.001989223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010074675,0.000081489845,0.00035429795,0.00029798484,0.000029512621,0.00007707082,0.00015916549,0.015426326,0.0017182702,0.9428644,0.0016045539,0.037286133],"study_design_scores_gemma":[0.000014022624,0.00006176278,0.00014773848,0.000097477125,0.000016023185,0.00009660646,0.00002173804,0.031003004,0.003543104,0.96074057,0.0042336388,0.000024294935],"about_ca_topic_score_codex":0.00075115927,"about_ca_topic_score_gemma":0.00042037183,"teacher_disagreement_score":0.005972347,"about_ca_system_score_codex":0.0036780615,"about_ca_system_score_gemma":0.0016193034,"threshold_uncertainty_score":0.028111279},"labels":[],"label_agreement":null},{"id":"W6977173756","doi":"10.6084/m9.figshare.26560730","title":"Additional file 1 of Sequre: a high-performance framework for secure multiparty computation enables biomedical data sharing","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Usability; Data sharing; Secure multi-party computation; Data access; Computation; File sharing; Key (lock)","score_opus":0.06814706885143448,"score_gpt":0.3002322127625701,"score_spread":0.23208514391113563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977173756","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031745882,0.00008878844,0.008159738,0.0004693118,0.00014326481,0.00018158603,0.97948533,0.0060981396,0.0050565335],"genre_scores_gemma":[0.021954428,0.00040350662,0.024582991,0.0019450297,0.00039055682,0.0024203956,0.91079223,0.0136189405,0.0238919],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871635,0.00030729402,0.00012396491,0.00029061237,0.00041488075,0.00014696678],"domain_scores_gemma":[0.9830461,0.012704526,0.00054727664,0.0019137807,0.0013429208,0.00044530185],"candidate_categories":["metaresearch","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002845402,0.0012092319,0.00109456,0.0012711636,0.00088152505,0.002151298,0.0028130435,0.0016181661,0.86444837],"category_scores_gemma":[0.03278215,0.00087582227,0.0009204364,0.002142871,0.0005389757,0.0026532034,0.0018537926,0.0017650174,0.2509749],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003515775,0.000056884335,0.0004631993,0.0013818879,0.00003012959,0.00007214414,0.00003922248,0.00087051874,0.0002599403,0.0037931828,0.9810192,0.011662128],"study_design_scores_gemma":[0.0032513686,0.00029042462,0.0037063693,0.0012479691,0.00010992202,0.00070693257,0.00017650996,0.008757586,0.0038508158,0.05808514,0.91963553,0.00018153712],"about_ca_topic_score_codex":0.0030287476,"about_ca_topic_score_gemma":0.0046913624,"teacher_disagreement_score":0.99718696,"about_ca_system_score_codex":0.001326767,"about_ca_system_score_gemma":0.001685051,"threshold_uncertainty_score":0.19334793},"labels":[],"label_agreement":null},{"id":"W6979897189","doi":"","title":"Analysis and Applications of Two Group-Theoretic Problems in Post-Quantum Cryptography","year":2023,"lang":"en","type":"dissertation","venue":"White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Semidirect product; Discrete logarithm; Cryptography; Cryptosystem; Cryptanalysis; Context (archaeology); Post-quantum cryptography; Computational complexity theory; Key (lock); Computational problem","score_opus":0.009233397151881829,"score_gpt":0.2101453217764255,"score_spread":0.2009119246245437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979897189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15096141,0.00557026,0.6151627,0.026497547,0.00082809455,0.00033894627,0.00029978127,0.00014686433,0.20019448],"genre_scores_gemma":[0.83079404,0.004154518,0.12045598,0.0012992444,0.0020615172,0.000411364,0.00022917918,0.00010983455,0.040484283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967765,0.0012757983,0.00012792248,0.0003819941,0.0010658584,0.00037180888],"domain_scores_gemma":[0.9909576,0.006398947,0.00067820214,0.0009823726,0.0006462674,0.00033661188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036835542,0.0007442506,0.0008213182,0.0020935247,0.0022207322,0.004690494,0.0016450916,0.0024137683,0.008623151],"category_scores_gemma":[0.009539393,0.0004111079,0.0016624373,0.0017584321,0.0073176366,0.010217813,0.0043976963,0.0050589517,0.0009417417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063551715,0.000016242417,0.00008177703,0.000019377769,0.0000024839715,0.0000150150345,0.00008523748,0.0019979747,0.000062936364,0.99546534,0.0003849258,0.0018623411],"study_design_scores_gemma":[0.000005583571,0.000011715487,0.00010323378,0.000017013646,0.000002357096,0.000030873292,0.000058769194,0.013584859,0.00023164556,0.98264873,0.0032968044,0.000008379006],"about_ca_topic_score_codex":0.00085635914,"about_ca_topic_score_gemma":0.0005010809,"teacher_disagreement_score":0.008623151,"about_ca_system_score_codex":0.0042703995,"about_ca_system_score_gemma":0.0020902217,"threshold_uncertainty_score":0.030984104},"labels":[],"label_agreement":null},{"id":"W6992350610","doi":"","title":"La mutualisation, un levier de résilience pour le système alimentaire alternatif montréalais?","year":2024,"lang":"fr","type":"other","venue":"Archipelago (University of Quebec in Montreal)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sugar industry; Context (archaeology); Food supply","score_opus":0.010609610740384107,"score_gpt":0.21001040660209852,"score_spread":0.1994007958617144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992350610","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7905499,0.004226019,0.030534063,0.020655645,0.00017644135,0.0003634254,0.0010426025,0.0002951354,0.15215683],"genre_scores_gemma":[0.9828833,0.00079620257,0.0040878975,0.00028465167,0.0000136824865,0.00007284327,0.00013903901,0.00003209807,0.011690263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979323,0.00057924254,0.0000643655,0.00033975314,0.0005342687,0.0005501215],"domain_scores_gemma":[0.9969652,0.00084639207,0.0005635832,0.0002636355,0.00088197965,0.0004791965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020905838,0.00048033867,0.0004196849,0.0013338246,0.0053445892,0.005501257,0.0012574189,0.00094810943,0.00968227],"category_scores_gemma":[0.005816109,0.00030986074,0.0005552544,0.0024405606,0.0076914574,0.0041806553,0.003897502,0.0010694778,0.0004544452],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004057408,0.00012241748,0.16638884,0.0019349225,0.00036032381,0.003151262,0.21600279,0.01434292,0.021187982,0.39224344,0.011874725,0.17198455],"study_design_scores_gemma":[0.00004047417,0.00028913008,0.23916402,0.0011645511,0.00023748074,0.0006648807,0.23304644,0.007742628,0.0052622184,0.054880694,0.45721063,0.00029685546],"about_ca_topic_score_codex":0.5873548,"about_ca_topic_score_gemma":0.69862884,"teacher_disagreement_score":0.5873548,"about_ca_system_score_codex":0.027019085,"about_ca_system_score_gemma":0.02575044,"threshold_uncertainty_score":0.8301507},"labels":[],"label_agreement":null},{"id":"W6996280136","doi":"","title":"Reshaping the landscape: considering COVID-19’s uncertain impacts on Canadian and U.S. international higher education","year":2021,"lang":"en","type":"article","venue":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Higher education; International education; Internationalization; Plan (archaeology); Pandemic; Study abroad; Coronavirus disease 2019 (COVID-19)","score_opus":0.03757667325213432,"score_gpt":0.29229804781705093,"score_spread":0.2547213745649166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996280136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46448863,0.0064164307,0.0058718817,0.20310235,0.00065392186,0.00014606354,0.0021664533,0.00009473452,0.31705952],"genre_scores_gemma":[0.987468,0.0024630716,0.0013921703,0.0033387595,0.000066861816,0.000018344492,0.00028299398,0.00002911654,0.004940573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9956468,0.00063782086,0.00005263548,0.00018616549,0.0010003773,0.0024763085],"domain_scores_gemma":[0.9939913,0.0009299731,0.0005250286,0.00018756444,0.0028777767,0.0014883281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003474887,0.00036652264,0.00045759283,0.003210941,0.014184884,0.013005028,0.0022174455,0.0019067978,0.0057790326],"category_scores_gemma":[0.009979264,0.00022574993,0.0006597526,0.0053501106,0.006623285,0.0058433088,0.0048411028,0.0036225663,0.00027736774],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019132264,0.00018229673,0.19065252,0.0003439236,0.00015137444,0.0041571166,0.03680063,0.024423331,0.0010508121,0.5276929,0.09102504,0.12332869],"study_design_scores_gemma":[0.00002198757,0.00012875415,0.2140931,0.0010666752,0.00016552987,0.0006246642,0.36693117,0.023035433,0.0010275083,0.095953144,0.2966782,0.00027383567],"about_ca_topic_score_codex":0.9676082,"about_ca_topic_score_gemma":0.986034,"teacher_disagreement_score":0.9075599,"about_ca_system_score_codex":0.09244013,"about_ca_system_score_gemma":0.073786214,"threshold_uncertainty_score":0.6707032},"labels":[],"label_agreement":null},{"id":"W7009370340","doi":"","title":"Equality Operators for Constant-weight Codewords with Applications in (Keyword) PIR","year":2021,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Homomorphic encryption; Multiplicative function; Overhead (engineering); Encryption; Domain (mathematical analysis); Task (project management); Hamming weight; Hamming distance; Computation","score_opus":0.010589180945369966,"score_gpt":0.22178974119422218,"score_spread":0.2112005602488522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7009370340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031659078,0.0006217407,0.9528823,0.00045743774,0.00021652064,0.0002599145,0.00007698959,0.0017084138,0.012117668],"genre_scores_gemma":[0.4394105,0.00048724294,0.5476306,0.00062691525,0.00024793498,0.00029496953,0.00017990738,0.0004611544,0.010660811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485934,0.0010557512,0.0004922865,0.00088532676,0.0022101877,0.00049711776],"domain_scores_gemma":[0.99391186,0.002234123,0.00071178714,0.0020175325,0.0009487712,0.00017600351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026581453,0.0005703858,0.00056710455,0.001128902,0.0011105657,0.002526972,0.0022627607,0.001249544,0.0074717314],"category_scores_gemma":[0.012154971,0.00040098224,0.00079230574,0.001647089,0.0028914558,0.0074603437,0.0044533573,0.0025337997,0.0017369617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004996769,0.00019565035,0.00079874875,0.00039114198,0.00003742912,0.0002638109,0.0004947523,0.014117429,0.03359768,0.65862733,0.0037955982,0.28718075],"study_design_scores_gemma":[0.00014015014,0.001106771,0.000724061,0.00017469232,0.00012943943,0.0012867494,0.00033461073,0.21660157,0.12724316,0.59315306,0.05895877,0.00014697303],"about_ca_topic_score_codex":0.00085215364,"about_ca_topic_score_gemma":0.000927921,"teacher_disagreement_score":0.0074717314,"about_ca_system_score_codex":0.0016554474,"about_ca_system_score_gemma":0.0014317341,"threshold_uncertainty_score":0.024995446},"labels":[],"label_agreement":null},{"id":"W7024100439","doi":"","title":"Professor Lawrence \"RW\" Lessig's \"The Withering of the Net\"","year":2006,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Presentation (obstetrics); Assertion; State (computer science); Quarter (Canadian coin); Period (music)","score_opus":0.0056242987739754885,"score_gpt":0.17949717428428544,"score_spread":0.17387287551030994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024100439","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031861514,0.014003667,0.0019586282,0.2561863,0.017985268,0.00006723061,0.00037528222,0.0013653473,0.704872],"genre_scores_gemma":[0.009494798,0.0018356396,0.00025393974,0.0084637385,0.00080794067,0.000009596299,0.000053677464,0.00013944536,0.9789412],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990307,0.00016086696,0.000018505478,0.00019529257,0.00038700763,0.00020760375],"domain_scores_gemma":[0.9993333,0.00008533796,0.00003335327,0.00003957978,0.00017156558,0.00033685708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089481,0.00044119993,0.00027549232,0.000799221,0.004516303,0.0031441376,0.0005530108,0.0021751039,0.1210246],"category_scores_gemma":[0.001732153,0.0001700917,0.00020747201,0.00048413026,0.0011126095,0.0022954163,0.0019209068,0.0027213646,0.040072225],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009597233,0.000004829152,0.00003270753,0.000010845396,3.6494424e-7,0.000022494782,0.00009101668,0.000011144638,0.00012952187,0.0066679562,0.9810862,0.011933203],"study_design_scores_gemma":[9.627871e-7,0.000004488058,0.000065942535,0.00001680756,3.3848326e-7,0.000033413267,0.000083724226,0.00001492898,0.00011951952,0.00055285054,0.99910516,0.000001902131],"about_ca_topic_score_codex":0.009401392,"about_ca_topic_score_gemma":0.020735184,"teacher_disagreement_score":0.1210246,"about_ca_system_score_codex":0.00417092,"about_ca_system_score_gemma":0.0018356049,"threshold_uncertainty_score":0.40486765},"labels":[],"label_agreement":null},{"id":"W7029738615","doi":"","title":"Laconic Evaluation of Branching Programs from the Diffie-Hellman Assumption","year":2024,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Communication source; Oblivious transfer; Cryptography; Secure multi-party computation; Protocol (science); Branching (polymer chemistry); Cryptographic primitive; Computation; Intersection (aeronautics)","score_opus":0.020230832863874493,"score_gpt":0.23301674860310756,"score_spread":0.21278591573923306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029738615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11349108,0.00053473224,0.8270132,0.00222165,0.00014031628,0.00029651602,0.0006599442,0.0027151247,0.052927434],"genre_scores_gemma":[0.8436804,0.00033351814,0.13747528,0.0009554083,0.00014573873,0.00048293645,0.0009319271,0.0005111638,0.015483569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959687,0.0010289451,0.0002236288,0.0006902982,0.0013414299,0.00074697],"domain_scores_gemma":[0.9918969,0.0049952576,0.00041462466,0.0014215523,0.0008645543,0.00040703887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004028261,0.0007969885,0.0010047905,0.0009932976,0.0014159502,0.003946428,0.0017674548,0.001357435,0.008661505],"category_scores_gemma":[0.01772605,0.00048699175,0.0014752967,0.0012198961,0.004738793,0.0074994355,0.005970703,0.0043468024,0.0010698355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019609486,0.00003920465,0.00044514067,0.00008481888,0.000014531046,0.00011522722,0.00030325894,0.017011577,0.0014956424,0.96209794,0.0014949429,0.016701512],"study_design_scores_gemma":[0.000039595685,0.000033532964,0.000104528764,0.000032501946,0.000019501138,0.000042042237,0.0000361554,0.0729097,0.002848374,0.9209479,0.002966427,0.000019715157],"about_ca_topic_score_codex":0.002388368,"about_ca_topic_score_gemma":0.0020818422,"teacher_disagreement_score":0.008661505,"about_ca_system_score_codex":0.00453067,"about_ca_system_score_gemma":0.002912213,"threshold_uncertainty_score":0.03287244},"labels":[],"label_agreement":null},{"id":"W7035789424","doi":"","title":"AMSC Announces Preliminary Third Quarter Fiscal 2016 Results","year":2017,"lang":"en","type":"other","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Government (linguistics); Fiscal year; Work (physics)","score_opus":0.013836543796634229,"score_gpt":0.2510424859539052,"score_spread":0.23720594215727098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035789424","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019551085,0.000718815,0.0025874071,0.044871304,0.015512004,0.00021591067,0.012709752,0.002601576,0.91882807],"genre_scores_gemma":[0.009197822,0.00031196026,0.0008684326,0.0062074405,0.001609918,0.00010720934,0.005169509,0.00074582367,0.9757819],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937396,0.00050532277,0.00013899928,0.00035050552,0.003588497,0.001677169],"domain_scores_gemma":[0.9882627,0.001483712,0.0002613811,0.0013808439,0.0059949933,0.0026162937],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0062138676,0.0014196545,0.0014571478,0.0029539904,0.006640723,0.014815576,0.0026852936,0.0071837143,0.36401942],"category_scores_gemma":[0.018140519,0.0005555088,0.0015772961,0.002174123,0.0018532719,0.005222771,0.0044264235,0.0071401116,0.28315854],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008017382,0.00006539267,0.00013388142,0.000023980252,0.000004239136,0.00003189401,0.000012863558,0.00010799964,0.00008040192,0.0131459925,0.97977406,0.0065391525],"study_design_scores_gemma":[0.00005688939,0.000039192168,0.00074362283,0.000059109647,0.000011579935,0.00003823145,0.0001021365,0.0008369057,0.0010680081,0.019475743,0.97753966,0.000028920023],"about_ca_topic_score_codex":0.028086416,"about_ca_topic_score_gemma":0.061250515,"teacher_disagreement_score":0.36401942,"about_ca_system_score_codex":0.008679498,"about_ca_system_score_gemma":0.012727805,"threshold_uncertainty_score":0.9071491},"labels":[],"label_agreement":null},{"id":"W7037135689","doi":"","title":"Distinguished Ornithologist Jon McCracken","year":2024,"lang":"en","type":"article","venue":"Digital Commons - University of South Florida (University of South Florida)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Durvalumab","score_opus":0.017005655069165654,"score_gpt":0.19407291752555467,"score_spread":0.177067262456389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037135689","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009652999,0.055057585,0.0051779225,0.53048635,0.07151089,0.00007540427,0.0002686842,0.0006576555,0.3271126],"genre_scores_gemma":[0.055332247,0.018559914,0.0033131833,0.10636833,0.009411623,0.000056658402,0.00022726906,0.00032873484,0.80640197],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979892,0.00026825705,0.000060716506,0.0003542924,0.0009966827,0.00033085136],"domain_scores_gemma":[0.99445385,0.00050066406,0.00025577963,0.00019417293,0.0013943968,0.0032011662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016010519,0.0004133894,0.0003058798,0.0011948085,0.0038397815,0.0038852827,0.00091447076,0.0017413094,0.036715478],"category_scores_gemma":[0.0043980516,0.00034033266,0.00021915244,0.00054109795,0.0017608964,0.002816064,0.002385484,0.004781222,0.012415299],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017253575,0.000016267482,0.0010941059,0.000035939756,0.000002591458,0.0001439482,0.0002947002,0.000036732054,0.00031282066,0.0058014146,0.96462905,0.027615162],"study_design_scores_gemma":[0.0000026510688,0.000009761648,0.0008386977,0.000048124686,0.000001452796,0.00052069646,0.0006592007,0.00004349714,0.000094509734,0.000650586,0.997124,0.000006715599],"about_ca_topic_score_codex":0.013941807,"about_ca_topic_score_gemma":0.033627115,"teacher_disagreement_score":0.036715478,"about_ca_system_score_codex":0.003041669,"about_ca_system_score_gemma":0.0050129807,"threshold_uncertainty_score":0.1228255},"labels":[],"label_agreement":null},{"id":"W7071915221","doi":"","title":"On thorough land drainage, and the results of actual operations in Canada.","year":2014,"lang":"en","type":"article","venue":"QSpace (Queen's University Library)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Composition (language); Order (exchange); Crop; Moisture; Similarity (geometry); Plague (disease); Power (physics)","score_opus":0.004256808330517612,"score_gpt":0.16514656454337948,"score_spread":0.16088975621286186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071915221","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038483087,0.0033784644,0.00090944703,0.010800457,0.002007569,0.00022301692,0.021724395,0.00057273597,0.9219009],"genre_scores_gemma":[0.0401722,0.001274536,0.0012489072,0.0009400942,0.00006354825,0.000031035343,0.004122253,0.00019614135,0.95195127],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9990777,0.000032149383,0.000019797559,0.00010342331,0.0005013901,0.000265525],"domain_scores_gemma":[0.99904186,0.000024118293,0.000022753156,0.000046637673,0.0006399079,0.00022467035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032296166,0.00043837645,0.00024854956,0.0016773975,0.006939739,0.0034383424,0.0007514918,0.0007086651,0.18980472],"category_scores_gemma":[0.0009971068,0.0002182818,0.00023314985,0.0039904527,0.0013507593,0.0011911937,0.001852951,0.00121455,0.033041112],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013093746,0.00013198896,0.031633515,0.00023675976,0.000021809426,0.00069835637,0.0024992784,0.0003980726,0.0016426181,0.024983201,0.6938298,0.2437937],"study_design_scores_gemma":[0.0000026766747,0.0000058495407,0.019614743,0.00006276775,0.0000030665817,0.000054875178,0.0027082255,0.000060562896,0.00019315087,0.0003761085,0.97690886,0.000009045079],"about_ca_topic_score_codex":0.89288604,"about_ca_topic_score_gemma":0.9764798,"teacher_disagreement_score":0.18980472,"about_ca_system_score_codex":0.017926216,"about_ca_system_score_gemma":0.03476034,"threshold_uncertainty_score":0.63496006},"labels":[],"label_agreement":null},{"id":"W7083013421","doi":"10.1016/j.clnesp.2025.07.119","title":"Resting energy expenditure of individuals with advanced osteoarthritis and BMI≥35kg/m2: Agreement between indirect calorimetry and predictive equations","year":2025,"lang":"en","type":"article","venue":"Clinical Nutrition ESPEN","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Resting energy expenditure; Energy expenditure; Calorimetry; Osteoarthritis; Limits of agreement","score_opus":0.026914604389733355,"score_gpt":0.31852145667368836,"score_spread":0.291606852283955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083013421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978751,0.00028439853,0.0009938228,0.00003404897,0.000018211167,0.000007074126,0.00022850363,0.00001470621,0.0005441713],"genre_scores_gemma":[0.9991053,0.000052023053,0.0003915329,0.000018508395,0.0000049454875,0.0000037663563,0.0002771232,0.0000035596865,0.00014313076],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99917775,0.00033780086,0.000105324645,0.00017345899,0.00013646358,0.00006913567],"domain_scores_gemma":[0.99701154,0.0017104133,0.00042885853,0.00032211738,0.0004211872,0.00010589715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024851747,0.00049032824,0.0005448125,0.0005406649,0.00021281489,0.0009117146,0.0004967921,0.0006127534,0.0006773304],"category_scores_gemma":[0.007831493,0.00033636898,0.0006222836,0.00045196654,0.00023230622,0.0005499916,0.00068724994,0.0006125389,0.00030830692],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000584904,0.00003874184,0.99362975,0.000020255942,0.00019898961,0.000030673782,0.00016315668,0.0004002628,0.00037281317,0.000041842162,0.0001066195,0.004412029],"study_design_scores_gemma":[0.000014815376,0.00012365561,0.995402,0.000016748265,0.00009172056,0.00012476231,0.00020752524,0.0035914024,0.0001821128,0.0000704651,0.00016755432,0.000007129623],"about_ca_topic_score_codex":0.006797126,"about_ca_topic_score_gemma":0.009284644,"teacher_disagreement_score":0.006797126,"about_ca_system_score_codex":0.00019758854,"about_ca_system_score_gemma":0.00017546795,"threshold_uncertainty_score":0.013515115},"labels":[],"label_agreement":null},{"id":"W70870466","doi":"10.1007/978-3-319-11659-4_9","title":"Transcript Secure Signatures Based on Modular Lattices","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"NTRU; Modular design; Computer science; Lattice problem; Enumeration; Lattice reduction; Theoretical computer science; Lattice (music); Digital signature; Concrete security; Lattice-based cryptography; Algorithm; Cryptography; Discrete mathematics; Mathematics; Programming language; Physics; Quantum; Quantum mechanics; Computer network; Cryptosystem","score_opus":0.011705950085405665,"score_gpt":0.22569229699476273,"score_spread":0.21398634690935706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70870466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0402694,0.0006685856,0.9134776,0.001187749,0.0005505314,0.0002882904,0.0005391969,0.0037462127,0.039272454],"genre_scores_gemma":[0.7069029,0.0009979144,0.24675739,0.0005465645,0.0006505466,0.0005589713,0.0011779326,0.00085770705,0.041550007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995656,0.0010840636,0.00024606273,0.0006254752,0.0017848113,0.00060365367],"domain_scores_gemma":[0.99610656,0.001750384,0.00028827746,0.0012255625,0.00043074926,0.00019831055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017041845,0.001025589,0.0015760453,0.0012883156,0.0014824197,0.0039856094,0.001953706,0.0014232689,0.010410447],"category_scores_gemma":[0.005740819,0.00069789944,0.0012671062,0.001662815,0.003370381,0.006498125,0.0051016067,0.004249998,0.0057700286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044793315,0.00007142102,0.00013286175,0.00014661811,0.00002126088,0.00012949322,0.0002216525,0.014690259,0.006894224,0.9142366,0.0052573155,0.057750408],"study_design_scores_gemma":[0.00010059022,0.00013127197,0.00006796681,0.00005668608,0.000022908138,0.00023010404,0.00005479813,0.07190856,0.01321745,0.9007414,0.013403553,0.00006462816],"about_ca_topic_score_codex":0.00027528097,"about_ca_topic_score_gemma":0.00030368712,"teacher_disagreement_score":0.010410447,"about_ca_system_score_codex":0.0017694767,"about_ca_system_score_gemma":0.001814285,"threshold_uncertainty_score":0.034826458},"labels":[],"label_agreement":null},{"id":"W7092295697","doi":"10.5281/zenodo.17381316","title":"Towards Practical Zero-Knowledge Proof for PSPACE","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PSPACE; Code (set theory); Cryptographic protocol; Key (lock); Source code","score_opus":0.040879061069237416,"score_gpt":0.30100783489069716,"score_spread":0.2601287738214597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092295697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023716365,0.00075370487,0.8842839,0.0047655925,0.0008755933,0.00038388243,0.0020466496,0.013881207,0.090637915],"genre_scores_gemma":[0.1367245,0.0035092647,0.7300605,0.0038458128,0.0013994533,0.0012213758,0.015830096,0.013787761,0.09362125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932656,0.0012459034,0.00033386427,0.00071956747,0.0038404206,0.00059455994],"domain_scores_gemma":[0.98538786,0.00620321,0.00030062188,0.003980269,0.0036539545,0.00047410562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005054403,0.0013327694,0.001176055,0.002220654,0.00155866,0.0047882,0.003653313,0.001847587,0.07260303],"category_scores_gemma":[0.018101413,0.0012079926,0.0014754772,0.002966983,0.0028197973,0.008452562,0.0075699403,0.007299201,0.04183917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025033683,0.00015780953,0.00015316195,0.00069498003,0.000037709036,0.00014052705,0.00020793284,0.012867254,0.0050210557,0.7000907,0.1387424,0.14163606],"study_design_scores_gemma":[0.00016974693,0.00006477262,0.00009481896,0.00023528312,0.000029890622,0.00026227784,0.000050288047,0.063371725,0.011215522,0.715865,0.20858145,0.00005928743],"about_ca_topic_score_codex":0.0016597394,"about_ca_topic_score_gemma":0.0020778852,"teacher_disagreement_score":0.07260303,"about_ca_system_score_codex":0.0026657828,"about_ca_system_score_gemma":0.0041145068,"threshold_uncertainty_score":0.24288136},"labels":[],"label_agreement":null},{"id":"W7096065934","doi":"","title":"Date","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Key (lock); Encryption; Control (management); Term (time); Phone; Presentation (obstetrics)","score_opus":0.00906229674428799,"score_gpt":0.24397766472905424,"score_spread":0.23491536798476625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096065934","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007193211,0.0005100685,0.007917692,0.0025719816,0.019764045,0.0005527076,0.033747196,0.006450748,0.9277662],"genre_scores_gemma":[0.003622529,0.000670098,0.003991101,0.0011214856,0.0015397775,0.00028774992,0.032143086,0.0024131178,0.95421106],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974347,0.00021789712,0.00022933545,0.00038972002,0.001419858,0.0003084845],"domain_scores_gemma":[0.99368554,0.00038482103,0.00019148306,0.0016964339,0.0034261327,0.0006156338],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025007296,0.001204221,0.0009849111,0.0040246565,0.0021148801,0.009338158,0.0018158728,0.0020860557,0.6155363],"category_scores_gemma":[0.0072917035,0.0008281948,0.0010820425,0.0022426227,0.000624692,0.0046580406,0.0036104356,0.0025025667,0.65176636],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007194788,0.00003872774,0.00026903948,0.00017164783,0.0000064815176,0.00006231594,0.00004534109,0.00013402745,0.0007818046,0.015682284,0.9258666,0.056869652],"study_design_scores_gemma":[0.000005916118,0.00000929543,0.00017560628,0.000028212113,0.0000018297643,0.000021989203,0.000014543195,0.000028275734,0.00031623032,0.0006310837,0.9987614,0.00000567532],"about_ca_topic_score_codex":0.0051461225,"about_ca_topic_score_gemma":0.005744873,"teacher_disagreement_score":0.38446373,"about_ca_system_score_codex":0.002329493,"about_ca_system_score_gemma":0.003316074,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7100269157","doi":"","title":"Revision 0 – Initial document.","year":2007,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Key (lock); Encryption; Term (time); Phone; Control (management); Key management","score_opus":0.013059303079672898,"score_gpt":0.29674514194549423,"score_spread":0.2836858388658213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100269157","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017749763,0.0008307618,0.0071938485,0.011117229,0.053106476,0.0012891447,0.01577682,0.009381496,0.8995293],"genre_scores_gemma":[0.007821687,0.00036919152,0.0047088866,0.0063658943,0.003676426,0.00063472043,0.01846342,0.0039926358,0.9539673],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9768877,0.0026896682,0.0018758968,0.0021527354,0.014594063,0.0018000032],"domain_scores_gemma":[0.9241621,0.003883199,0.001465931,0.00880026,0.06008248,0.0016060874],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.010488141,0.0012579323,0.0009911305,0.0051786145,0.003206704,0.013650799,0.004471115,0.006117276,0.34408614],"category_scores_gemma":[0.044389017,0.0012136879,0.0016774685,0.0025459249,0.0018981103,0.0059020678,0.0034964439,0.0055893157,0.47800532],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006138072,0.00005034923,0.00010012786,0.00009868474,0.0000055015,0.00004889975,0.00006974557,0.000039635288,0.00046076806,0.0045858077,0.9814471,0.013031984],"study_design_scores_gemma":[0.000017555283,0.000025430882,0.0004220495,0.00008907057,0.000006779528,0.000058829337,0.00004924078,0.000036096106,0.00054519786,0.0008060831,0.99792767,0.000015903786],"about_ca_topic_score_codex":0.01978298,"about_ca_topic_score_gemma":0.015304486,"teacher_disagreement_score":0.65591383,"about_ca_system_score_codex":0.005580333,"about_ca_system_score_gemma":0.008627551,"threshold_uncertainty_score":0.9355815},"labels":[],"label_agreement":null},{"id":"W7110023578","doi":"10.4230/lipics.icdt.2025.25","title":"Optimal Oblivious Algorithms for Multi-Way Joins","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Cloud computing; Matching (statistics); Upload; Logarithm; Cryptography; Join (topology); Computational complexity theory; Computation","score_opus":0.030582534926643958,"score_gpt":0.3035335577761135,"score_spread":0.27295102284946954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110023578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044167083,0.00028748607,0.94809735,0.00060820504,0.000048327827,0.00016642273,0.00012283021,0.0021042551,0.0043978947],"genre_scores_gemma":[0.60683167,0.00030516987,0.3861155,0.0004184808,0.000102052385,0.00039918677,0.00039313405,0.0005041908,0.0049306178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948756,0.0011270067,0.00038641543,0.0009063089,0.001999496,0.00070521235],"domain_scores_gemma":[0.99150616,0.0038874804,0.0007047855,0.0032595384,0.0003976746,0.000244338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034069684,0.00072161714,0.0011609736,0.00082535075,0.001812708,0.003215671,0.0026652517,0.0015298876,0.0038717205],"category_scores_gemma":[0.009886434,0.0007617497,0.0013779872,0.001359812,0.0030643912,0.007799535,0.0052782013,0.0039477292,0.0014868412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022087,0.00052187144,0.001725988,0.00051840313,0.00016581094,0.00017464923,0.0010121949,0.19846565,0.042036224,0.5726723,0.007350168,0.17314807],"study_design_scores_gemma":[0.00019537439,0.00019244742,0.00019349954,0.00003466848,0.00004982743,0.00014347557,0.00009726502,0.5066649,0.029166231,0.45858142,0.004635865,0.000045049903],"about_ca_topic_score_codex":0.00050740724,"about_ca_topic_score_gemma":0.00076395634,"teacher_disagreement_score":0.0038717205,"about_ca_system_score_codex":0.0021073623,"about_ca_system_score_gemma":0.002686682,"threshold_uncertainty_score":0.018018007},"labels":[],"label_agreement":null},{"id":"W7110032274","doi":"10.4230/lipics.itc.2025.2","title":"Powerful Primitives in the Bounded Quantum Storage Model","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Learning with errors; Encryption; Construct (python library); Bounded function; Quantum; Key (lock); Transmission (telecommunications); Quantum computer; Quantum cryptography","score_opus":0.013171682550288534,"score_gpt":0.27099156165774485,"score_spread":0.2578198791074563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110032274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08990511,0.00044562167,0.8806049,0.0030705289,0.00012498525,0.00014861856,0.00039138453,0.0010267559,0.02428216],"genre_scores_gemma":[0.9095372,0.00040610557,0.07907204,0.00038870823,0.00016545689,0.00034040908,0.00017918328,0.00016502322,0.0097458875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975343,0.00070040626,0.00011445863,0.00037541316,0.00088239805,0.0003929755],"domain_scores_gemma":[0.99384046,0.0029949162,0.00045305086,0.0021574947,0.00032533857,0.00022870046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022080222,0.00054383604,0.00093441806,0.0007259799,0.0013240745,0.0028397904,0.002149974,0.0016927505,0.005631264],"category_scores_gemma":[0.006014102,0.0005416173,0.0009766681,0.0009370352,0.0053193937,0.0103596365,0.0054088878,0.0039545977,0.0009174944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073505165,0.000016221227,0.000053686723,0.000037629903,0.000006251396,0.000053854823,0.00011601941,0.010130479,0.0021515475,0.98385197,0.00052171486,0.0029872502],"study_design_scores_gemma":[0.00005280741,0.00006172239,0.000055317418,0.000022484386,0.00001402985,0.00009726663,0.000041296076,0.10926311,0.005160514,0.88056904,0.004634843,0.000027496477],"about_ca_topic_score_codex":0.00075406965,"about_ca_topic_score_gemma":0.0004439737,"teacher_disagreement_score":0.005631264,"about_ca_system_score_codex":0.0018401097,"about_ca_system_score_gemma":0.0016825132,"threshold_uncertainty_score":0.018838465},"labels":[],"label_agreement":null},{"id":"W7110324624","doi":"10.4230/lipics.disc.2025.9","title":"Distributed Download from an External Data Source in Byzantine Majority Settings","year":2025,"lang":"en","type":"article","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Indian Institute of Technology Madras","keywords":"Protocol (science); Set (abstract data type); Byzantine fault tolerance; Range query (database); Communication complexity; Dissemination; Discrete logarithm; Fraction (chemistry); Server","score_opus":0.011012132446440928,"score_gpt":0.28510970721122203,"score_spread":0.2740975747647811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110324624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29163185,0.0013949395,0.6826249,0.0070012226,0.00009995721,0.00060702465,0.0009066629,0.00075684977,0.014976551],"genre_scores_gemma":[0.92735904,0.00051092514,0.06322567,0.00045239695,0.00014610331,0.00047615467,0.0003722347,0.00013134502,0.007326168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904738,0.0043397835,0.000358377,0.0021252623,0.001651583,0.0010512131],"domain_scores_gemma":[0.9671153,0.022646446,0.002607268,0.00569015,0.0009403251,0.0010005643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00797153,0.0012121149,0.0033941953,0.0011305043,0.0032947594,0.0038930874,0.004255086,0.004343873,0.0048301066],"category_scores_gemma":[0.028214121,0.00083518773,0.0013882325,0.0017496378,0.0046472684,0.018224075,0.007976746,0.003999522,0.0009680539],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002851875,0.00054147653,0.0027095473,0.0006356637,0.00021213628,0.0013774665,0.0013853764,0.36379108,0.00964782,0.571901,0.0069603124,0.037986163],"study_design_scores_gemma":[0.00038980242,0.00019280615,0.00042791583,0.000034494442,0.000052261585,0.00043168024,0.00026990153,0.65990984,0.005609131,0.32801783,0.0046083382,0.000055991175],"about_ca_topic_score_codex":0.0016937628,"about_ca_topic_score_gemma":0.0012723488,"teacher_disagreement_score":0.00797153,"about_ca_system_score_codex":0.0036130648,"about_ca_system_score_gemma":0.0016631539,"threshold_uncertainty_score":0.042157948},"labels":[],"label_agreement":null},{"id":"W7114821142","doi":"","title":"Labeled Delegated PSI and its Applications in the Public Sector","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Payload (computing); Software deployment; Encryption; Private sector; Public sector; Protocol (science); Set (abstract data type); Data breach","score_opus":0.03792296736854268,"score_gpt":0.27215865917854964,"score_spread":0.23423569181000697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114821142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01998268,0.0005558516,0.9602548,0.0026681742,0.00013704092,0.00023477928,0.00013243819,0.0008683558,0.015165922],"genre_scores_gemma":[0.71782035,0.0011026318,0.26908648,0.0009138414,0.00023411456,0.00047305343,0.00026968043,0.00023740027,0.009862436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98793113,0.0064945742,0.0007628844,0.0012872834,0.0027509488,0.0007730616],"domain_scores_gemma":[0.9833582,0.006515935,0.0011222763,0.007183339,0.0012810255,0.00053914415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012165408,0.00050192344,0.00077493413,0.001047636,0.0019311154,0.00437862,0.0016126275,0.0019034541,0.0039996286],"category_scores_gemma":[0.01382672,0.0005994353,0.0011011998,0.0017107201,0.004826214,0.008545502,0.0077277822,0.004088491,0.001461556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002538058,0.00016767828,0.0011571678,0.00016484867,0.000032675805,0.00027952043,0.0008577693,0.020019043,0.005158096,0.89794886,0.00340009,0.07056051],"study_design_scores_gemma":[0.00008081522,0.0002910154,0.0004871407,0.000147461,0.000045569985,0.0006509428,0.0004658238,0.2622573,0.017307967,0.6690445,0.04912824,0.00009319657],"about_ca_topic_score_codex":0.0010020708,"about_ca_topic_score_gemma":0.0005102922,"teacher_disagreement_score":0.012165408,"about_ca_system_score_codex":0.003822335,"about_ca_system_score_gemma":0.0032365215,"threshold_uncertainty_score":0.06433761},"labels":[],"label_agreement":null},{"id":"W7115038259","doi":"","title":"On the necessity of one-way functions in quantum cryptography","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Cryptography; Quantum cryptography; Boolean function; Quantum; Scheme (mathematics); Function (biology)","score_opus":0.02000099485870188,"score_gpt":0.23785898662230892,"score_spread":0.21785799176360704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115038259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2274339,0.018579988,0.48969147,0.023916565,0.0016664581,0.000105413324,0.00030957503,0.0003064644,0.23799014],"genre_scores_gemma":[0.94599414,0.005843279,0.028726896,0.0014592945,0.00089512265,0.00007849524,0.00006551746,0.00012841185,0.016808795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997468,0.0008633394,0.00013505561,0.00042978404,0.00065686565,0.0004469735],"domain_scores_gemma":[0.9896007,0.007478069,0.0004959975,0.0015265096,0.00065853994,0.0002402397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004411127,0.00048682565,0.00080490735,0.0012795659,0.0025499566,0.0037432327,0.0011970026,0.002356541,0.0048390585],"category_scores_gemma":[0.013708195,0.0005632843,0.0011564728,0.0011387955,0.010036017,0.014976461,0.0036452126,0.0049195453,0.00082716945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015232818,0.0000029979442,0.000069459005,0.000022019789,0.0000019253912,0.000022642416,0.00012329662,0.00040398346,0.00020339171,0.9967513,0.00023120278,0.0021525484],"study_design_scores_gemma":[0.000008356995,0.00002838801,0.00011006954,0.000041000938,0.000006443464,0.00007178425,0.00008718542,0.0025051474,0.0006508733,0.98967,0.0068031144,0.000017675939],"about_ca_topic_score_codex":0.0008039786,"about_ca_topic_score_gemma":0.00049097976,"teacher_disagreement_score":0.0048390585,"about_ca_system_score_codex":0.002009506,"about_ca_system_score_gemma":0.0012833256,"threshold_uncertainty_score":0.023328543},"labels":[],"label_agreement":null},{"id":"W7115164231","doi":"10.18280/isi.301012","title":"Deterministic RSA on Hyperledger Fabric: Secure, High-Performance Electronic Health Records","year":2025,"lang":"","type":"article","venue":"Ingénierie des systèmes d information","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Health records; Cryptography; Confidentiality; Electronic health record; Key (lock)","score_opus":0.010187666225608023,"score_gpt":0.24248664265563577,"score_spread":0.23229897643002775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115164231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5358516,0.0024770952,0.41384366,0.0019799657,0.0008344108,0.00036632564,0.0008398499,0.0126351975,0.03117191],"genre_scores_gemma":[0.95772433,0.00028894658,0.03194115,0.00019741443,0.000099800614,0.00004564184,0.00027491603,0.00014885855,0.009278926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877816,0.00036549915,0.000117068135,0.0001754646,0.00032513283,0.00023865984],"domain_scores_gemma":[0.998005,0.0003918405,0.00021181244,0.0010834639,0.00021226337,0.00009570471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114649,0.00039108898,0.0004056061,0.00041543992,0.00050693855,0.00186366,0.0010466769,0.00047562824,0.007457043],"category_scores_gemma":[0.0021139886,0.0002862061,0.00022242928,0.00053235336,0.00056931854,0.0023221946,0.0014633134,0.0004803034,0.0016792974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010755367,0.0006452589,0.0074996073,0.0008608245,0.00025711054,0.0016944853,0.0007437874,0.054272898,0.22081092,0.15710743,0.04162016,0.5037321],"study_design_scores_gemma":[0.0010399112,0.00275775,0.0062638996,0.00020568162,0.00033629767,0.0018780681,0.00044551227,0.45242134,0.38179794,0.06406325,0.08856564,0.0002248158],"about_ca_topic_score_codex":0.00044771857,"about_ca_topic_score_gemma":0.000638229,"teacher_disagreement_score":0.007457043,"about_ca_system_score_codex":0.00081164547,"about_ca_system_score_gemma":0.00083064556,"threshold_uncertainty_score":0.024946332},"labels":[],"label_agreement":null},{"id":"W7115569216","doi":"10.23977/acss.2025.090405","title":"Research on Privacy-Preserving Identity Authentication Algorithm Based on Elliptic Curves and Zero-Knowledge Proofs","year":2025,"lang":"","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Authentication (law); Elliptic Curve Digital Signature Algorithm; Mathematical proof; Identity (music); Data Authentication Algorithm; Authentication protocol; Plaintext; Cryptography; Challenge–response authentication","score_opus":0.04667466709676082,"score_gpt":0.3765791875760797,"score_spread":0.3299045204793189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115569216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012252116,0.004132731,0.9772884,0.00048335164,0.00017425418,0.0000872442,0.00002992934,0.00043232925,0.0051196744],"genre_scores_gemma":[0.6259861,0.009910953,0.35602912,0.0003110856,0.0004939985,0.0001611374,0.00020660268,0.00010125013,0.006799756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645966,0.0008556463,0.00030305077,0.0007248937,0.0013989132,0.00025785033],"domain_scores_gemma":[0.9958197,0.0015133424,0.00046039288,0.0011746861,0.00092322845,0.000108636086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024913242,0.000740015,0.0010986651,0.0016630223,0.001032653,0.0019183551,0.0017033784,0.0011333067,0.0019189854],"category_scores_gemma":[0.0053566587,0.0003894919,0.0010301184,0.002236663,0.0016860507,0.007498055,0.0015065547,0.002115357,0.00093010516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037019534,0.00016661834,0.0016005918,0.00088247366,0.00016025355,0.0003018897,0.00040022508,0.048971727,0.027049424,0.45902386,0.0031269465,0.4579457],"study_design_scores_gemma":[0.0001752214,0.0006370435,0.0009394067,0.00022624376,0.00016354903,0.0024457714,0.0002412352,0.6019091,0.074172504,0.2458464,0.07304247,0.00020104602],"about_ca_topic_score_codex":0.0005286169,"about_ca_topic_score_gemma":0.00018077868,"teacher_disagreement_score":0.0024913242,"about_ca_system_score_codex":0.0010267069,"about_ca_system_score_gemma":0.0021071506,"threshold_uncertainty_score":0.013175547},"labels":[],"label_agreement":null},{"id":"W7115907317","doi":"10.1109/tdsc.2025.3645856","title":"Two-Server Offline/Online Private Information Retrieval With Small Client Storage","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Server; Outsourcing; Private information retrieval; Task (project management); File server; Scheme (mathematics); Secret sharing; Sublinear function; Computational complexity theory","score_opus":0.013743955289987881,"score_gpt":0.23959824611586086,"score_spread":0.225854290825873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115907317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027713386,0.0012436423,0.9488639,0.00072068843,0.00016333735,0.00076092436,0.0003151122,0.008760942,0.011458009],"genre_scores_gemma":[0.65550977,0.00077800354,0.3226971,0.000649567,0.00022783078,0.00083142385,0.0007820686,0.00038528128,0.01813884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636334,0.00057893177,0.00027945242,0.0005971498,0.0016190386,0.00056203676],"domain_scores_gemma":[0.99590164,0.0005527111,0.00028584487,0.0026713603,0.00040325162,0.00018509416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015536937,0.00096182985,0.0021245093,0.00087308313,0.0012539368,0.0024327673,0.004770801,0.0016916429,0.011829074],"category_scores_gemma":[0.0034848712,0.00075619644,0.0010091629,0.00164586,0.0016933026,0.009569283,0.0062970137,0.0025826797,0.007913313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036567184,0.0009934698,0.0018069152,0.0015544886,0.00023768403,0.0012980435,0.0010444482,0.048802756,0.1892757,0.24088724,0.02838442,0.48205808],"study_design_scores_gemma":[0.00064066413,0.0008788406,0.0006952553,0.000110170295,0.00015147087,0.0029510912,0.00041806523,0.7272417,0.14090705,0.07833513,0.047325432,0.0003450943],"about_ca_topic_score_codex":0.0008558754,"about_ca_topic_score_gemma":0.0005772215,"teacher_disagreement_score":0.011829074,"about_ca_system_score_codex":0.0013964556,"about_ca_system_score_gemma":0.0019268896,"threshold_uncertainty_score":0.03957218},"labels":[],"label_agreement":null},{"id":"W7116888641","doi":"10.1109/tdsc.2025.3647497","title":"TCKKS: An Efficient TEE-Assistance CKKS Scheme Without Bootstrapping","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Homomorphic encryption; Overhead (engineering); Encryption; Scheme (mathematics); Protocol (science); Computation; Multiplication (music); Ciphertext","score_opus":0.01495754377834254,"score_gpt":0.26976911521880276,"score_spread":0.25481157144046024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116888641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15687206,0.0013029837,0.81553394,0.0012046241,0.00050191884,0.0009958714,0.00069104135,0.0030184337,0.019879108],"genre_scores_gemma":[0.9090655,0.0003661312,0.08285937,0.0001753839,0.000066927365,0.0002455085,0.00045677842,0.00008354344,0.0066808057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981495,0.0003774132,0.00017285795,0.0002522972,0.0006303332,0.00041761174],"domain_scores_gemma":[0.998018,0.00033557802,0.00029781758,0.00085777923,0.00032850285,0.00016233622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082642725,0.00054060103,0.0009572898,0.00067079917,0.0011193575,0.0012502994,0.0013447233,0.0009625504,0.003183402],"category_scores_gemma":[0.003226334,0.00029292316,0.0006617842,0.0010358795,0.001166384,0.0041275597,0.0038939517,0.0015972522,0.0010297622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028736782,0.0004475243,0.0024745928,0.0010120592,0.00021042213,0.0014261281,0.0012131034,0.15701407,0.12801772,0.39587277,0.021598855,0.28783908],"study_design_scores_gemma":[0.00055845804,0.00052230695,0.0011374654,0.000110132845,0.00014209769,0.0016979618,0.00041335972,0.80422616,0.056802228,0.091363356,0.042696536,0.00032987545],"about_ca_topic_score_codex":0.0014643283,"about_ca_topic_score_gemma":0.0012169367,"teacher_disagreement_score":0.003183402,"about_ca_system_score_codex":0.0010886105,"about_ca_system_score_gemma":0.002643137,"threshold_uncertainty_score":0.010649502},"labels":[],"label_agreement":null},{"id":"W7116988931","doi":"10.2139/ssrn.5958498","title":"Privacy Preserving Semantic Search over Encrypted Cloud Email Archives using Bidirectional Encoder Representations from Transformer","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Marriott International (Canada)","funders":"","keywords":"Encryption; Cloud computing; Cryptography; Encoder; Embedding; Confidentiality; Cloud storage; Public-key cryptography; Discrete cosine transform","score_opus":0.02447954522190493,"score_gpt":0.30374211292508446,"score_spread":0.27926256770317953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116988931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06792258,0.00061282003,0.91958493,0.0007651471,0.000097682074,0.00011519896,0.001778777,0.00323317,0.0058898004],"genre_scores_gemma":[0.8306525,0.00073169905,0.15742975,0.00025625378,0.000117655436,0.0001094285,0.002958832,0.00045978115,0.0072841113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983853,0.0003583595,0.0001299356,0.00028956257,0.000574147,0.00026265043],"domain_scores_gemma":[0.9975668,0.0008918666,0.00016877669,0.00092276506,0.00037119703,0.00007869171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010348507,0.00054716575,0.0012139156,0.001452286,0.00067027385,0.00246369,0.0010445004,0.0012163984,0.003881942],"category_scores_gemma":[0.005516743,0.00036769398,0.0011091331,0.0025220516,0.00090547494,0.0057033324,0.002651271,0.0013635552,0.0015885601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014929234,0.00042597842,0.0021078065,0.00057357596,0.00015906832,0.0008385922,0.0006153625,0.14173336,0.02836793,0.38977155,0.02202237,0.41189152],"study_design_scores_gemma":[0.000039851493,0.000089106485,0.0002912503,0.000046312693,0.00006771021,0.0003226037,0.00014545936,0.7579656,0.017932931,0.2184253,0.0046387794,0.000035052897],"about_ca_topic_score_codex":0.003619346,"about_ca_topic_score_gemma":0.0034274438,"teacher_disagreement_score":0.003881942,"about_ca_system_score_codex":0.0011148655,"about_ca_system_score_gemma":0.0019137037,"threshold_uncertainty_score":0.012986362},"labels":[],"label_agreement":null},{"id":"W7117111774","doi":"10.3390/jcp6010002","title":"Using Secure Multi-Party Computation to Create Clinical Trial Cohorts","year":2025,"lang":"en","type":"article","venue":"Journal of Cybersecurity and Privacy","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Global Health Research","funders":"","keywords":"Interoperability; Cryptography; Health care; Key (lock); Secure multi-party computation; Clinical trial; Python (programming language); Data integrity; Data anonymization","score_opus":0.10264790214441318,"score_gpt":0.413843831321857,"score_spread":0.3111959291774438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117111774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038731083,0.00015450823,0.953777,0.00078944856,0.000096184514,0.00072631624,0.00041620422,0.0011195837,0.004189692],"genre_scores_gemma":[0.67492414,0.00018158655,0.32035425,0.00032554552,0.00007896586,0.0008342239,0.000555595,0.00015483827,0.0025908467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905533,0.005034322,0.0005541378,0.0011220804,0.0021651965,0.00057092105],"domain_scores_gemma":[0.973421,0.0110666435,0.0021225088,0.011006056,0.0013542626,0.0010295212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012281996,0.0003998429,0.00058155623,0.0008362051,0.0008701635,0.0021626563,0.0012845907,0.00073021586,0.005992213],"category_scores_gemma":[0.037022408,0.00043667728,0.0008917685,0.00096542237,0.001399423,0.002804484,0.0047280504,0.0015290857,0.0014929296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002788822,0.0004550272,0.016614683,0.0005089205,0.00034254155,0.0010602152,0.0011923976,0.2630991,0.02726265,0.31424385,0.0075191054,0.36491266],"study_design_scores_gemma":[0.00039766723,0.00058082596,0.001949603,0.00008473633,0.00007482121,0.0005109914,0.00016305466,0.62900364,0.03694068,0.30450323,0.025730595,0.000060112157],"about_ca_topic_score_codex":0.0005356447,"about_ca_topic_score_gemma":0.0006608202,"teacher_disagreement_score":0.012281996,"about_ca_system_score_codex":0.0009280656,"about_ca_system_score_gemma":0.0047333287,"threshold_uncertainty_score":0.06495422},"labels":[],"label_agreement":null},{"id":"W7125606402","doi":"10.1109/cascon66301.2025.00104","title":"BI-MQTT: Broker-Independent Integrity for Publish–Subscribe Messaging with Ring Signatures","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"MQTT; Message queue; Anonymity; Ring signature; Message authentication code; Authentication (law); Cryptographic protocol; Data integrity; Protocol (science)","score_opus":0.0167804092515117,"score_gpt":0.266013183258849,"score_spread":0.2492327740073373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125606402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013521757,0.00028033578,0.966858,0.0003304483,0.00021549508,0.00043081306,0.00018772276,0.014531014,0.0036444128],"genre_scores_gemma":[0.5652109,0.00043532866,0.41634214,0.0005755835,0.00039437268,0.0006313574,0.0013116597,0.0014782659,0.013620385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99315566,0.0015166235,0.00097199983,0.0006942731,0.0031074078,0.0005540296],"domain_scores_gemma":[0.9878627,0.0019132736,0.00119699,0.0064817066,0.0020296716,0.00051573745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073199538,0.0007127601,0.0011715613,0.0010896003,0.0014464394,0.0033949325,0.003384285,0.0017215689,0.00451166],"category_scores_gemma":[0.013787077,0.0006571737,0.0009307518,0.0010043575,0.0014176104,0.005551112,0.005137269,0.002811888,0.0033482062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041355696,0.0006847781,0.0047963173,0.0011627558,0.00033053124,0.0011778204,0.0016396798,0.047259033,0.23842882,0.24882764,0.03471465,0.4168423],"study_design_scores_gemma":[0.0005559236,0.0010562675,0.0009133626,0.000086024884,0.00017153703,0.00096147426,0.0001443425,0.6457706,0.18864007,0.059869144,0.101537056,0.00029417084],"about_ca_topic_score_codex":0.0011988721,"about_ca_topic_score_gemma":0.0007677806,"teacher_disagreement_score":0.0073199538,"about_ca_system_score_codex":0.0011519514,"about_ca_system_score_gemma":0.0027383037,"threshold_uncertainty_score":0.038712084},"labels":[],"label_agreement":null},{"id":"W7128864138","doi":"","title":"Shechi: A Secure Distributed Computation Compiler Based on Multiparty Homomorphic Encryption.","year":2025,"lang":"en","type":"article","venue":"PubMed","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Homomorphic encryption; Compiler; Secure multi-party computation; Cryptography; Code (set theory); Computation; Encryption; Distributed database","score_opus":0.014662897976910977,"score_gpt":0.22427021784504475,"score_spread":0.20960731986813377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128864138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059430804,0.0002334545,0.9327167,0.0003681169,0.0001539621,0.00024068463,0.00075884623,0.055187568,0.0043976153],"genre_scores_gemma":[0.18399248,0.00055654923,0.77945805,0.0010468466,0.0001421748,0.001109792,0.0043301256,0.016202718,0.013161264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971756,0.0006698592,0.00026513805,0.00038491972,0.001188042,0.00031655672],"domain_scores_gemma":[0.9959188,0.0014082909,0.000284237,0.0017113085,0.0005008479,0.00017645968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030070592,0.00082925847,0.0006483717,0.0007221014,0.0007454541,0.0021918411,0.002070281,0.000854692,0.0073436676],"category_scores_gemma":[0.009584244,0.0009236742,0.0014809881,0.00077379774,0.0016175653,0.004108308,0.0042303377,0.002970363,0.0044892775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001770766,0.000497966,0.0068877195,0.0016536581,0.0004667165,0.0011080548,0.001354818,0.06515532,0.04320664,0.32754928,0.15044194,0.39990705],"study_design_scores_gemma":[0.00046903957,0.00030426725,0.00185282,0.0002510436,0.00009918334,0.001028478,0.00020419998,0.47099444,0.085900955,0.23365736,0.2050565,0.00018165543],"about_ca_topic_score_codex":0.0008600516,"about_ca_topic_score_gemma":0.0014661965,"teacher_disagreement_score":0.0073436676,"about_ca_system_score_codex":0.00088240835,"about_ca_system_score_gemma":0.003495882,"threshold_uncertainty_score":0.024567068},"labels":[],"label_agreement":null},{"id":"W7129388309","doi":"10.1145/3733820.3767144","title":"Post-Quantum Hybrid Encryption from Correlated Randomness: QKEM and Biometric KEMs","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encryption; Cryptography; Public-key cryptography; Key (lock); Key encapsulation","score_opus":0.007027262366254853,"score_gpt":0.2278621231090145,"score_spread":0.22083486074275963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7129388309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087617256,0.0018409905,0.87350285,0.0017525055,0.0003266073,0.00013109576,0.0002615199,0.00036620934,0.034200985],"genre_scores_gemma":[0.9305537,0.00076990435,0.05812834,0.0005095841,0.0001905759,0.00014697351,0.000107348096,0.00009031042,0.009503348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981026,0.0007679383,0.00009054916,0.00027770078,0.0005241566,0.00023711771],"domain_scores_gemma":[0.9978405,0.0008931984,0.00024509546,0.0007280413,0.00019810651,0.000095083196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021622858,0.00044406913,0.00092801434,0.0004913742,0.0007897467,0.001814886,0.0012715777,0.0020298015,0.0041601514],"category_scores_gemma":[0.00457162,0.00035861952,0.00080191926,0.0007632377,0.0031098258,0.004337956,0.0037019677,0.0023041375,0.0015084608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011664918,0.000023911323,0.00016330782,0.000059089958,0.000015095043,0.0001961644,0.000118680655,0.010833362,0.0033417272,0.97642034,0.00097185915,0.007739951],"study_design_scores_gemma":[0.000055387904,0.000094626266,0.00028821878,0.000062476065,0.000017116417,0.0008086399,0.00007430454,0.1595984,0.0071836957,0.8262225,0.0055220476,0.00007255746],"about_ca_topic_score_codex":0.00014050692,"about_ca_topic_score_gemma":0.000108359825,"teacher_disagreement_score":0.0041601514,"about_ca_system_score_codex":0.00072823046,"about_ca_system_score_gemma":0.00069348514,"threshold_uncertainty_score":0.013917148},"labels":[],"label_agreement":null},{"id":"W7130596471","doi":"10.1109/ictc66702.2025.11387875","title":"A Brief Survey of Two Recent Polynomial Commitment Schemes from Lattices","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multilinear map; Gas meter prover; Correctness; Polynomial; Mathematical proof; Scheme (mathematics); Commit","score_opus":0.03915964975032346,"score_gpt":0.31302239654009584,"score_spread":0.2738627467897724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7130596471","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013627545,0.46174702,0.4148576,0.006856763,0.0017959357,0.00042575927,0.0006763337,0.0009745894,0.09903844],"genre_scores_gemma":[0.23428929,0.47344133,0.24868466,0.004582094,0.0046445853,0.0010004116,0.0013475186,0.00055422593,0.031455804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975547,0.0005828495,0.0002232811,0.00044399415,0.0009519449,0.000243256],"domain_scores_gemma":[0.9981433,0.0010735487,0.00016694324,0.00032980324,0.00018947208,0.00009700323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022658857,0.0009660292,0.0010245397,0.0027140083,0.0013240334,0.0032444012,0.0017404567,0.0016415993,0.007891805],"category_scores_gemma":[0.0046285535,0.0010435828,0.0011870504,0.005102047,0.002343876,0.008859456,0.0036305597,0.004684118,0.00293557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012695215,0.0001424136,0.00039589131,0.0041104085,0.00004541133,0.00012872674,0.00043764646,0.0047966605,0.0029023008,0.67914826,0.012952879,0.29481256],"study_design_scores_gemma":[0.00005593161,0.00026036846,0.0007297184,0.0011596729,0.000051142404,0.0015381839,0.00018832486,0.012969506,0.005688961,0.23720638,0.7399976,0.0001540864],"about_ca_topic_score_codex":0.0005438464,"about_ca_topic_score_gemma":0.00036155505,"teacher_disagreement_score":0.007891805,"about_ca_system_score_codex":0.0023078497,"about_ca_system_score_gemma":0.0015594147,"threshold_uncertainty_score":0.026400685},"labels":[],"label_agreement":null},{"id":"W7131318419","doi":"10.1109/acsac67867.2025.00083","title":"PIM-ORAM: Towards Oblivious RAM Primitives in Commodity Processing-In-Memory","year":2025,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; Ministry of Science and ICT, South Korea; New York University","keywords":"Testbed; Cloud computing; Parallelizable manifold; Computation; Latency (audio); Scheme (mathematics); Memory management; Random access memory","score_opus":0.014137272851415273,"score_gpt":0.2748200578029051,"score_spread":0.26068278495148983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131318419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08429408,0.0017209244,0.8855275,0.00079842075,0.00030155672,0.00043411372,0.00020089828,0.006352857,0.020369612],"genre_scores_gemma":[0.74818206,0.0006744615,0.24278264,0.00051691255,0.000112615075,0.0004104227,0.00021667207,0.0004094332,0.0066948244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988959,0.00026112742,0.00007124285,0.00014316928,0.00040154505,0.0002270292],"domain_scores_gemma":[0.99870265,0.00024209997,0.00016154334,0.0007013764,0.00013077813,0.00006160977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011171529,0.00069444877,0.0005898915,0.0006340351,0.000774026,0.001522866,0.0026420273,0.00059424713,0.0045477585],"category_scores_gemma":[0.0024650136,0.0004692938,0.00063334935,0.0008189322,0.0014762292,0.0035459138,0.0028513463,0.0020179534,0.001035841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021809076,0.0003687628,0.0027606958,0.0015064251,0.00019897323,0.0006507204,0.0007829262,0.090856664,0.10396184,0.56714135,0.022962768,0.20662801],"study_design_scores_gemma":[0.00028009058,0.0010745814,0.00070140377,0.00021333768,0.00016628426,0.0005999553,0.00023447648,0.62845623,0.15576783,0.1437924,0.06860834,0.000105077204],"about_ca_topic_score_codex":0.00044510045,"about_ca_topic_score_gemma":0.00056955084,"teacher_disagreement_score":0.0045477585,"about_ca_system_score_codex":0.00093538716,"about_ca_system_score_gemma":0.001319617,"threshold_uncertainty_score":0.015213728},"labels":[],"label_agreement":null},{"id":"W7131348262","doi":"10.4213/rm10272e","title":"Defending against Byzantine attacks by trust-based weighting of agents","year":2025,"lang":"en","type":"article","venue":"Russian Mathematical Surveys","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada); Federated Co-operatives (Canada)","funders":"Ministry of Education and Science of the Russian Federation","keywords":"Weighting; Byzantine architecture; Byzantine fault tolerance; Cryptography","score_opus":0.01345717784938089,"score_gpt":0.2698849596835884,"score_spread":0.2564277818342075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131348262","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09387761,0.00045234786,0.8983261,0.0007896611,0.0000932969,0.00015571526,0.000051657506,0.00037512547,0.0058784406],"genre_scores_gemma":[0.9275316,0.00026015742,0.06864613,0.000110965564,0.00006671081,0.000114223294,0.000054003867,0.000042955646,0.0031732873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99455994,0.0025505007,0.0002842428,0.0007626496,0.0012574936,0.00058525364],"domain_scores_gemma":[0.9891958,0.0040767137,0.0015417045,0.0032164382,0.0014297842,0.0005394877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043369755,0.00112645,0.0018676165,0.0011870232,0.0012677617,0.0029132366,0.0018458817,0.0017198356,0.0016664063],"category_scores_gemma":[0.019759081,0.0005030737,0.0008991795,0.0011333461,0.001976599,0.0066174236,0.0046914984,0.0024089818,0.00056011276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017294324,0.00039071604,0.0053217406,0.00053002447,0.00049689936,0.0003644629,0.0013489393,0.25378487,0.034142602,0.4624663,0.0054795784,0.23394449],"study_design_scores_gemma":[0.00006828548,0.0002600045,0.0004990646,0.000032311746,0.000073299525,0.00016548767,0.00014266676,0.8422263,0.004394039,0.14896607,0.0031419378,0.000030567302],"about_ca_topic_score_codex":0.0010955762,"about_ca_topic_score_gemma":0.0010178679,"teacher_disagreement_score":0.0043369755,"about_ca_system_score_codex":0.0013038992,"about_ca_system_score_gemma":0.0016554829,"threshold_uncertainty_score":0.022936344},"labels":[],"label_agreement":null},{"id":"W7132905842","doi":"","title":"A Hardware Accelerator for Fully Homomorphic Encryption based Machine Learning Applications","year":2021,"lang":"","type":"dissertation","venue":"TSpace","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Application-specific integrated circuit; Encryption; Cryptography; Verilog; Computation; Scheme (mathematics)","score_opus":0.030159923304707306,"score_gpt":0.3219153277803912,"score_spread":0.29175540447568393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132905842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2356289,0.0015442648,0.7132936,0.0010438911,0.00047418784,0.0003378084,0.000531725,0.0064802454,0.040665347],"genre_scores_gemma":[0.83753365,0.00056799524,0.14438803,0.00021365231,0.00004540555,0.000091347676,0.00038985547,0.00010626987,0.016663838],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998568,0.000020110272,0.000009943977,0.000019219833,0.00007371306,0.000020275676],"domain_scores_gemma":[0.9997043,0.000090577094,0.000030510195,0.000066540306,0.00009537488,0.000012748658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023382751,0.00022927248,0.00015314828,0.00021394099,0.00025142185,0.00048773972,0.0005883729,0.0002648091,0.006277218],"category_scores_gemma":[0.00060357706,0.00014871733,0.00019384982,0.00019512228,0.00016061167,0.0007820674,0.00021461092,0.00045841403,0.0012029604],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064063957,0.00031198421,0.0026336052,0.00070242025,0.00006798964,0.00059526716,0.00023525854,0.10404405,0.3831139,0.13539322,0.01973737,0.35252434],"study_design_scores_gemma":[0.00013648381,0.0010094516,0.0014543396,0.000097705735,0.000052304993,0.0005877857,0.000055822784,0.64495856,0.26752624,0.014029189,0.07005409,0.00003804344],"about_ca_topic_score_codex":0.00056272786,"about_ca_topic_score_gemma":0.0010018937,"teacher_disagreement_score":0.006277218,"about_ca_system_score_codex":0.0005267928,"about_ca_system_score_gemma":0.0008936104,"threshold_uncertainty_score":0.020999312},"labels":[],"label_agreement":null},{"id":"W7134184719","doi":"10.1109/bigdata66926.2025.11401805","title":"MASER: Efficient Privacy-Preserving Cross-Silo Federated Learning with Multi-Key Homomorphic Encryption","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Homomorphic encryption; Encryption; Key (lock); Cryptography; Scheme (mathematics)","score_opus":0.017247068016278677,"score_gpt":0.2759224381434369,"score_spread":0.25867537012715824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7134184719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03025081,0.0002851099,0.9628057,0.0002331493,0.00007351511,0.00011462016,0.00021267858,0.0038288645,0.0021955022],"genre_scores_gemma":[0.7729914,0.0001637356,0.22024643,0.00026251603,0.000051755807,0.00013974974,0.00045852427,0.00014240202,0.0055433954],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99783957,0.00056325365,0.00012447467,0.00035335188,0.0007032239,0.00041613868],"domain_scores_gemma":[0.99822956,0.00040711387,0.00014214001,0.0009324952,0.00019325012,0.00009550476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019048586,0.0005634691,0.0014644202,0.0006918638,0.00080652384,0.0014919697,0.0018644806,0.0011558529,0.0028878246],"category_scores_gemma":[0.0031310457,0.00033292818,0.0007875188,0.0008025667,0.00091159734,0.0037617825,0.0047105937,0.0016711074,0.0011666645],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025212823,0.0010376349,0.0021139237,0.00029839895,0.00028779148,0.00052024017,0.00030268083,0.1730992,0.03251166,0.16765958,0.018818948,0.6008287],"study_design_scores_gemma":[0.00008496286,0.00027247582,0.0003224524,0.000022820386,0.000025654372,0.00036815403,0.00005452438,0.8974057,0.018975021,0.07867977,0.0037546803,0.00003387217],"about_ca_topic_score_codex":0.00040549837,"about_ca_topic_score_gemma":0.00057114934,"teacher_disagreement_score":0.0028878246,"about_ca_system_score_codex":0.0006238216,"about_ca_system_score_gemma":0.0015581643,"threshold_uncertainty_score":0.01007396},"labels":[],"label_agreement":null},{"id":"W7134192432","doi":"10.1109/bigdata66926.2025.11401896","title":"H_SIG: Privacy-Preserving Auction for Big Data Based on Homomorphic Signcryption","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Big data; Homomorphic encryption; Scheme (mathematics); Signcryption; Construct (python library)","score_opus":0.09885901064957744,"score_gpt":0.3103855981629035,"score_spread":0.21152658751332606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7134192432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04072455,0.00035163097,0.9319961,0.0009173187,0.00044521465,0.0004413613,0.0008676477,0.0120109925,0.012245249],"genre_scores_gemma":[0.7789825,0.00022604493,0.19999939,0.000666014,0.00018699848,0.00023652463,0.0009953479,0.00068712374,0.01801991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811685,0.0004997291,0.00010256818,0.00023064243,0.00068120746,0.00036903017],"domain_scores_gemma":[0.9973072,0.00052041723,0.00012685968,0.0014724216,0.00031532388,0.00025785982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002449544,0.00056422735,0.0012248281,0.00071654166,0.0009946912,0.0027910238,0.0019647635,0.0012731525,0.0075067114],"category_scores_gemma":[0.0032414924,0.00045712633,0.0007995833,0.0010502433,0.0017981251,0.0032864395,0.004117161,0.002164878,0.0023663086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004945704,0.00097258826,0.0024845565,0.0005088041,0.00032741769,0.0006803813,0.00030989974,0.044377863,0.031609803,0.50464034,0.071567275,0.33757535],"study_design_scores_gemma":[0.00088994787,0.00079897145,0.0009773801,0.00004240876,0.00009292955,0.00083442446,0.00012377265,0.4865594,0.04837195,0.43054235,0.030574601,0.00019188614],"about_ca_topic_score_codex":0.0008986279,"about_ca_topic_score_gemma":0.0009539179,"teacher_disagreement_score":0.0075067114,"about_ca_system_score_codex":0.00077304855,"about_ca_system_score_gemma":0.0025758261,"threshold_uncertainty_score":0.02511239},"labels":[],"label_agreement":null},{"id":"W7144040931","doi":"10.47363/jaicc/icaic2025/2025(4)26","title":"Trust Without Transmission: How RDH Uses Entanglement Emulation to Protect Digital Banking from AI and Quantum Threats","year":2025,"lang":"","type":"article","venue":"Journal of Artificial Intelligence & Cloud Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Association for Co-operative Education","funders":"","keywords":"Encryption; Handshake; Malware; Spoofing attack; Cryptography; Emulation; Backdoor; Software; USable; Firmware","score_opus":0.04193829232731398,"score_gpt":0.32039958692667225,"score_spread":0.27846129459935826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7144040931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04650438,0.0011652202,0.80257404,0.008265474,0.00096447376,0.0003528898,0.00018388925,0.0032642633,0.13672543],"genre_scores_gemma":[0.86349875,0.00070826494,0.09396894,0.0020360823,0.00024223699,0.00029144133,0.00015245922,0.00095261756,0.03814923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971855,0.0008833802,0.00013343916,0.0005011844,0.00082781404,0.00046850063],"domain_scores_gemma":[0.9950883,0.0016977581,0.00032066804,0.0020981927,0.00050971325,0.0002854124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028590453,0.00068637356,0.00062063406,0.00085549953,0.0018846644,0.0053079864,0.002219941,0.0029267038,0.013329331],"category_scores_gemma":[0.012691487,0.00061184214,0.0008634364,0.00043444886,0.0067072455,0.011088013,0.006771659,0.0033188707,0.00412148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001467867,0.000108763816,0.0008172315,0.000108992455,0.00004342314,0.0006203899,0.0013005194,0.016352676,0.0071114386,0.92394036,0.006487283,0.04296215],"study_design_scores_gemma":[0.000077579425,0.00017110507,0.00027206165,0.00016898235,0.00004717832,0.00074541377,0.00052486116,0.14069062,0.01568402,0.7744624,0.06702663,0.00012921898],"about_ca_topic_score_codex":0.0014879254,"about_ca_topic_score_gemma":0.0008728182,"teacher_disagreement_score":0.013329331,"about_ca_system_score_codex":0.0015739572,"about_ca_system_score_gemma":0.0016211686,"threshold_uncertainty_score":0.04459107},"labels":[],"label_agreement":null},{"id":"W7148458500","doi":"10.1109/wifs66636.2025.00038","title":"Trust-Based Framework for Securing Decentralized Federated Learning against Malicious Clients","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Key (lock); Government (linguistics); Information privacy; Field (mathematics); Feature (linguistics); Federated learning","score_opus":0.014704484490991427,"score_gpt":0.28877619817213096,"score_spread":0.27407171368113953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7148458500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02212751,0.00016518883,0.97515726,0.00028610282,0.000027413178,0.00005324903,0.000037057962,0.001380966,0.00076518365],"genre_scores_gemma":[0.8956856,0.0000749782,0.102834985,0.000114733106,0.000029797597,0.000070129056,0.00008637503,0.000046318535,0.0010571281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967225,0.00085666776,0.00021166031,0.0006627136,0.0011775229,0.0003690492],"domain_scores_gemma":[0.9942953,0.0014136885,0.00082880526,0.0017520501,0.0013379812,0.00037219204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004154971,0.00074934255,0.001251182,0.0008759187,0.0010401119,0.0016446563,0.0027176233,0.0015714503,0.0008069701],"category_scores_gemma":[0.011548435,0.00043652745,0.0006615959,0.00076095335,0.001661545,0.0032755565,0.0032904607,0.001769182,0.00033800164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042998427,0.00023287185,0.003895677,0.00009627691,0.00012623672,0.0003717754,0.0003681249,0.79590327,0.006819114,0.0373167,0.00340748,0.15103254],"study_design_scores_gemma":[0.000008622733,0.000024224948,0.0000848644,0.000003381319,0.000005572753,0.00003734445,0.000015287653,0.99100715,0.0011570709,0.0072660754,0.0003843715,0.000005980299],"about_ca_topic_score_codex":0.003536009,"about_ca_topic_score_gemma":0.003198598,"teacher_disagreement_score":0.004154971,"about_ca_system_score_codex":0.0017782808,"about_ca_system_score_gemma":0.0027046262,"threshold_uncertainty_score":0.021973848},"labels":[],"label_agreement":null},{"id":"W7150758369","doi":"10.47363/jbrr/fintech2025/2025(2)3","title":"How RDH Uses Entanglement Emulation to Protect Smart Cards, POS Terminals and Digital Banking from AI and Quantum Threats","year":2025,"lang":"","type":"article","venue":"Journal of Business Research and Reports","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Handshake; Encryption; Spoofing attack; Cryptography; Emulation; Malware; Smart card; Payment; Authentication (law); Credit card","score_opus":0.04938982153047587,"score_gpt":0.3471659103641357,"score_spread":0.2977760888336598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7150758369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04443819,0.0020274424,0.6567346,0.013471523,0.002202891,0.0003018087,0.00028705806,0.0031021647,0.27743438],"genre_scores_gemma":[0.8185315,0.0016360685,0.093710355,0.0036243408,0.0004018741,0.00022794558,0.00021989006,0.00071239495,0.08093556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990864,0.00022522228,0.000034740304,0.00016019554,0.0003125429,0.00018089147],"domain_scores_gemma":[0.99908197,0.00027266488,0.000058656748,0.00038882287,0.00012486962,0.0000730463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009314518,0.00047223238,0.00035242585,0.00060972525,0.0015047917,0.0031422535,0.0009607579,0.00261186,0.0134606],"category_scores_gemma":[0.0030958196,0.0004261502,0.00065212254,0.0003331803,0.003681068,0.0064539337,0.0034670872,0.0022717176,0.004239946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008127383,0.00006728212,0.0005945176,0.0000790528,0.000031149782,0.00037529494,0.00042765547,0.0096904645,0.011177518,0.92796934,0.009087128,0.04041924],"study_design_scores_gemma":[0.000069080306,0.00016392661,0.00043253828,0.00016593645,0.000037782378,0.0013576568,0.00033107706,0.0771605,0.02971681,0.7654944,0.12495193,0.00011832564],"about_ca_topic_score_codex":0.0009087572,"about_ca_topic_score_gemma":0.000620278,"teacher_disagreement_score":0.0134606,"about_ca_system_score_codex":0.00090250897,"about_ca_system_score_gemma":0.0011758074,"threshold_uncertainty_score":0.045030236},"labels":[],"label_agreement":null},{"id":"W7154594284","doi":"10.1109/iceteg66194.2025.11473203","title":"Encrypted Vector Operations for Privacy-Preserving Machine Learning and Data Retrieval","year":2025,"lang":"","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Data retrieval; Support vector machine; Encryption; Key (lock); Pattern recognition (psychology); Relevance (law)","score_opus":0.0374423243990644,"score_gpt":0.3252879695289174,"score_spread":0.287845645129853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7154594284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03995335,0.0013504055,0.95250016,0.00059574214,0.00014094445,0.00012824697,0.00021466882,0.000459753,0.004656627],"genre_scores_gemma":[0.7104952,0.0019015402,0.2789142,0.00032654358,0.00024295069,0.00020954749,0.0006989907,0.0001314466,0.007079691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970462,0.0010112663,0.0003478277,0.0003056322,0.0010978798,0.00019128874],"domain_scores_gemma":[0.9956957,0.0012937422,0.0004072152,0.0020955896,0.0004377076,0.00007000831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001681622,0.00037704493,0.00064341543,0.00073264784,0.0006074353,0.0018018478,0.00072681304,0.0006372189,0.0029171698],"category_scores_gemma":[0.0057772356,0.00028074795,0.0004904012,0.0014880975,0.0012314961,0.00512264,0.0016107077,0.0013416922,0.0014407542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072653545,0.0002889042,0.0012284846,0.0004712325,0.00011019183,0.00053082884,0.00041332873,0.056923322,0.044372234,0.56250924,0.006720559,0.3257051],"study_design_scores_gemma":[0.00011277696,0.0004851636,0.00074482645,0.00011002778,0.00007336368,0.0021983783,0.00019806738,0.4860869,0.11539273,0.36032802,0.034184624,0.00008505954],"about_ca_topic_score_codex":0.00030069373,"about_ca_topic_score_gemma":0.00020098998,"teacher_disagreement_score":0.0029171698,"about_ca_system_score_codex":0.0006670246,"about_ca_system_score_gemma":0.0010745795,"threshold_uncertainty_score":0.00975889},"labels":[],"label_agreement":null},{"id":"W7162204272","doi":"10.65521/ijeecs.v14i2.2106","title":"A Systematic Review of Graph-Theoretic Approaches to Post-Quantum Cryptographic Protocols: Methods, Architectures, and Future Research Directions","year":2025,"lang":"","type":"article","venue":"International Journal of Electrical Electronics and Computer Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cryptography; Scalability; Cryptographic primitive; Key exchange; Identification (biology); Key (lock); Cryptosystem","score_opus":0.042669887141404426,"score_gpt":0.35878661292240477,"score_spread":0.31611672578100036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162204272","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029385157,0.993808,0.003273974,0.00083521486,0.00024473784,0.000031046246,0.000070271526,0.000021554117,0.0014213988],"genre_scores_gemma":[0.0019691405,0.9946365,0.002400695,0.00042955443,0.00015609371,0.000044484583,0.00007713607,0.000009914253,0.00027653223],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99848783,0.0004933169,0.00028686007,0.00021256648,0.0004559808,0.000063428946],"domain_scores_gemma":[0.99015534,0.00784541,0.00066046265,0.00029781624,0.0009357134,0.000105386986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027014266,0.0012480292,0.0018924356,0.0063319327,0.0005993453,0.0017685251,0.0012981045,0.0012799907,0.0049259127],"category_scores_gemma":[0.009635581,0.0006931485,0.0016424427,0.0064055566,0.0013267556,0.0036016414,0.001030622,0.0018683608,0.0010649957],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007808139,0.00007805615,0.0005563909,0.1661389,0.00048384492,0.00023628061,0.00046528343,0.0027031754,0.0012045238,0.06170921,0.025287084,0.7410592],"study_design_scores_gemma":[0.00003411778,0.00021154786,0.0012532212,0.08284559,0.0011421738,0.0011202092,0.00046876346,0.001153422,0.0009923103,0.04233171,0.86835974,0.00008724502],"about_ca_topic_score_codex":0.0022800984,"about_ca_topic_score_gemma":0.004462612,"teacher_disagreement_score":0.0063319327,"about_ca_system_score_codex":0.0015181248,"about_ca_system_score_gemma":0.006385358,"threshold_uncertainty_score":0.016478777},"labels":[],"label_agreement":null},{"id":"W78374920","doi":"10.1007/978-3-319-11203-9_7","title":"Verifiable Delegation of Computations with Storage-Verification Trade-off","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Verifiable secret sharing; Delegation; Computation; Parallel computing; Operating system; Theoretical computer science; Programming language","score_opus":0.011283028827802483,"score_gpt":0.22348491436792617,"score_spread":0.21220188554012367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78374920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036841836,0.00079703704,0.93825704,0.001928735,0.00041104396,0.00022511111,0.00023350597,0.0033634913,0.017942196],"genre_scores_gemma":[0.8632342,0.00042596858,0.11488318,0.000465218,0.00040307362,0.0003760456,0.0002876119,0.0008462854,0.019078499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98509383,0.0041914424,0.0009208605,0.0022998934,0.0049232636,0.00257074],"domain_scores_gemma":[0.9450188,0.022064047,0.001506464,0.028623031,0.0019638478,0.0008238234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009723722,0.0014710026,0.0025041467,0.00083382835,0.0022568237,0.0062272535,0.0047708754,0.004106533,0.011378266],"category_scores_gemma":[0.036727015,0.0016230288,0.002138825,0.0015165637,0.0058062496,0.015778726,0.011816918,0.008012979,0.0033710438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018498636,0.0002928005,0.0007333957,0.0004439349,0.00012864076,0.00036496023,0.00055931567,0.052204423,0.015281712,0.794909,0.008730546,0.12450149],"study_design_scores_gemma":[0.00015255422,0.000107086846,0.00019680288,0.00007906963,0.000075336604,0.00021029347,0.0000484774,0.19321205,0.025227293,0.77512425,0.0055085695,0.0000581192],"about_ca_topic_score_codex":0.0006169101,"about_ca_topic_score_gemma":0.0006964198,"teacher_disagreement_score":0.011378266,"about_ca_system_score_codex":0.0033002603,"about_ca_system_score_gemma":0.003768243,"threshold_uncertainty_score":0.051424563},"labels":[],"label_agreement":null},{"id":"W813457708","doi":"10.1007/s10623-015-0092-4","title":"Batch verifiable computation of outsourced functions","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Delegate; Verifiable secret sharing; Correctness; Computer science; Cloud computing; Computation; Delegation; Function (biology); Cloud storage; Theoretical computer science; Distributed computing; Algorithm; Operating system; Programming language","score_opus":0.045978153996709806,"score_gpt":0.25644332041693846,"score_spread":0.21046516642022867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W813457708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15668586,0.00066966616,0.8260715,0.0011967563,0.0003357801,0.00021823063,0.0010053326,0.002519402,0.011297498],"genre_scores_gemma":[0.9225292,0.0002243203,0.06539659,0.00028192395,0.00022409986,0.00018498424,0.0005670667,0.00027920443,0.01031263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928456,0.0014846756,0.0004021764,0.0010921487,0.0026160125,0.0015593352],"domain_scores_gemma":[0.9766517,0.007042448,0.001172491,0.012821105,0.0016729042,0.0006393409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049358304,0.0011582192,0.0022191342,0.0007831175,0.00113017,0.004514905,0.0030507299,0.0017942088,0.00867645],"category_scores_gemma":[0.0134549085,0.0010061887,0.0013128439,0.0013805532,0.003062185,0.0077781146,0.004442393,0.004213835,0.0017150743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007962736,0.00035124543,0.0022847662,0.00044705256,0.00023127865,0.00055556156,0.00061606884,0.16359997,0.038633354,0.66454464,0.010631962,0.11014137],"study_design_scores_gemma":[0.0003068505,0.00032399117,0.0006455613,0.000076721546,0.000089169574,0.00014904964,0.000073634845,0.49650708,0.045838196,0.45155582,0.004335301,0.00009864187],"about_ca_topic_score_codex":0.0025387844,"about_ca_topic_score_gemma":0.002635483,"teacher_disagreement_score":0.00867645,"about_ca_system_score_codex":0.0039970553,"about_ca_system_score_gemma":0.004601294,"threshold_uncertainty_score":0.029025555},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03038591141236432,"score_gpt":0.2513953581725988,"score_spread":0.22100944676023446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W813596860","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4008714,0.41854978,0.059971783,0.05750433,0.0016017628,0.0003964293,0.0032160806,0.0002477774,0.057640713],"genre_scores_gemma":[0.7574966,0.21813647,0.008592085,0.0061247894,0.0013692055,0.00015417305,0.00146066,0.00019458284,0.0064715007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957832,0.002220057,0.0003430238,0.0004793759,0.0008537311,0.00032059342],"domain_scores_gemma":[0.9252061,0.052554347,0.007278346,0.007305823,0.006099757,0.0015556078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014548837,0.00050146604,0.00068477803,0.001896846,0.0007542795,0.0024871281,0.0015462015,0.0014005703,0.0039218063],"category_scores_gemma":[0.049782258,0.00057425525,0.000612301,0.002719587,0.0035509465,0.007785235,0.0020000478,0.0037368042,0.0009283826],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020955615,0.0014030694,0.13669904,0.0017224472,0.0005514746,0.0013802357,0.0021045005,0.010421368,0.0010844505,0.34286374,0.033041038,0.46663308],"study_design_scores_gemma":[0.000256665,0.0033773822,0.119911395,0.005524486,0.0011099825,0.010511148,0.004148958,0.026488803,0.0076480443,0.20506702,0.6155486,0.000407536],"about_ca_topic_score_codex":0.0036660067,"about_ca_topic_score_gemma":0.00242564,"teacher_disagreement_score":0.014548837,"about_ca_system_score_codex":0.0024138545,"about_ca_system_score_gemma":0.0026290521,"threshold_uncertainty_score":0.0769425},"labels":[],"label_agreement":null},{"id":"W824459562","doi":"","title":"Practical Private Information Retrieval","year":2011,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"The Internet; Computer science; Private information retrieval; Internet privacy; World Wide Web; Information privacy; Privacy policy; Confidentiality; Service provider; Information retrieval; Service (business); Computer security; Business","score_opus":0.014852447242269634,"score_gpt":0.21891578842659123,"score_spread":0.2040633411843216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W824459562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015974922,0.009319673,0.8426862,0.010300218,0.0007617104,0.0004405689,0.00048595777,0.0007755177,0.11925521],"genre_scores_gemma":[0.56662863,0.011014406,0.33202493,0.003739144,0.0028427765,0.0008074698,0.0019644615,0.00047220552,0.080505975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9897747,0.0032673746,0.00075629697,0.0019958818,0.0033127267,0.00089305197],"domain_scores_gemma":[0.9770493,0.012622937,0.0010145755,0.0070094164,0.0020350805,0.00026875245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006025355,0.0011274236,0.0018718417,0.0022812462,0.0026359854,0.007017684,0.0025290113,0.0040717637,0.019004395],"category_scores_gemma":[0.03445711,0.000843021,0.0016200807,0.003994268,0.005244752,0.01763934,0.00741187,0.004514492,0.007875652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000982952,0.00006364191,0.000241629,0.0003711009,0.000030331656,0.000072401024,0.0004149252,0.007603978,0.0013147119,0.89864784,0.0110695055,0.08007167],"study_design_scores_gemma":[0.00006124068,0.00006637236,0.0000956538,0.000102820406,0.000023614955,0.000322674,0.0001669685,0.05206839,0.0023152614,0.9009734,0.04376432,0.0000393707],"about_ca_topic_score_codex":0.0011326807,"about_ca_topic_score_gemma":0.0007585779,"teacher_disagreement_score":0.019004395,"about_ca_system_score_codex":0.0048389668,"about_ca_system_score_gemma":0.0029696457,"threshold_uncertainty_score":0.06357604},"labels":[],"label_agreement":null},{"id":"W84418456","doi":"10.15837/ijccc.2008.4.2407","title":"McCLS: Certificateless Signature Scheme for Emergency Mobile Wireless Cyber-Physical Systems","year":2008,"lang":"en","type":"article","venue":"International Journal of Computers Communications & Control","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Key escrow; Public-key cryptography; Computer network; Cryptography; Computer security; Wireless network; Wireless ad hoc network; Wireless; Encryption; Telecommunications","score_opus":0.02866674431746898,"score_gpt":0.2986214412892169,"score_spread":0.26995469697174795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84418456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11301481,0.002811159,0.8526988,0.0019991882,0.0007990418,0.00077254325,0.00060845463,0.0030145445,0.024281466],"genre_scores_gemma":[0.9042261,0.0007298784,0.083721794,0.00030082598,0.00019036765,0.00025284805,0.00059796957,0.00004250618,0.009937631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841356,0.00044761147,0.00014875096,0.00017470939,0.000626124,0.00018920212],"domain_scores_gemma":[0.99857545,0.0002523642,0.00026068863,0.00035461734,0.00041244118,0.00014438653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009807574,0.00043979575,0.00044432,0.0008956962,0.00071499153,0.0010324282,0.001032533,0.0007849341,0.0023212424],"category_scores_gemma":[0.0024700817,0.00013782196,0.0004585751,0.001291241,0.00082110683,0.0019173714,0.0015361821,0.0012064046,0.0006811069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014725522,0.00040660813,0.00248852,0.0010328133,0.000098066885,0.00080011046,0.0010038018,0.091591276,0.11123299,0.3621963,0.023098398,0.40457848],"study_design_scores_gemma":[0.00050162873,0.0020574215,0.0017405397,0.00017696116,0.00009410111,0.002203688,0.00032786647,0.6452678,0.105011895,0.082900725,0.15950082,0.00021668266],"about_ca_topic_score_codex":0.00091661274,"about_ca_topic_score_gemma":0.00050090515,"teacher_disagreement_score":0.0023212424,"about_ca_system_score_codex":0.0013532869,"about_ca_system_score_gemma":0.0020972705,"threshold_uncertainty_score":0.009818852},"labels":[],"label_agreement":null},{"id":"W84835382","doi":"10.1007/978-3-642-38348-9_33","title":"How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Permutation (music); Generalization; Computer science; Function (biology); Task (project management); Topology (electrical circuits); Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Combinatorics","score_opus":0.03125573763231845,"score_gpt":0.2744590740325687,"score_spread":0.24320333640025024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84835382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009965734,0.0003955002,0.9700834,0.00083704595,0.000108761415,0.00007880014,0.00014682936,0.0014433432,0.016940486],"genre_scores_gemma":[0.47738037,0.00086600066,0.48967817,0.0004843853,0.0002269017,0.00026917557,0.00035819993,0.0011648813,0.029572044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984125,0.00030731448,0.00007926184,0.0002307453,0.0007159437,0.00025425493],"domain_scores_gemma":[0.99875665,0.00042049037,0.000042230604,0.0006060191,0.0001280134,0.000046604888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012067213,0.00080279016,0.0010171516,0.0005858687,0.0010124366,0.0025933625,0.0016311279,0.001183017,0.009548507],"category_scores_gemma":[0.0037215247,0.0007479281,0.0013194751,0.0008845975,0.002122754,0.0061719976,0.00291909,0.0049548387,0.001960938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008434301,0.000038553964,0.00009248192,0.00009523251,0.0000217243,0.000041849133,0.00010241853,0.023008587,0.0032934397,0.9205762,0.0034653596,0.04917988],"study_design_scores_gemma":[0.00002958148,0.000029377652,0.00007987404,0.000029756366,0.00003135803,0.00005262587,0.000020155701,0.11336018,0.0064130607,0.86651707,0.013413174,0.000023794833],"about_ca_topic_score_codex":0.001206838,"about_ca_topic_score_gemma":0.0013081097,"teacher_disagreement_score":0.009548507,"about_ca_system_score_codex":0.0013933677,"about_ca_system_score_gemma":0.0011361467,"threshold_uncertainty_score":0.031942964},"labels":[],"label_agreement":null},{"id":"W86108416","doi":"10.1007/978-1-4615-0895-3_18","title":"Lattices and Cryptography","year":2002,"lang":"en","type":"book-chapter","venue":"Kluwer international series in engineering and computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Lattice-based cryptography; Cryptography; Computer science; Neural cryptography; Theoretical computer science; Decoding methods; Lattice (music); Strong cryptography; Encryption; Public-key cryptography; Mathematics; Algorithm; Computer security; Quantum cryptography; Physics; Quantum; Quantum mechanics","score_opus":0.008289274035778183,"score_gpt":0.19864882702546519,"score_spread":0.19035955298968701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86108416","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034624885,0.07619521,0.028161125,0.009071453,0.0030523532,0.000044787208,0.00022259675,0.00043002338,0.87935996],"genre_scores_gemma":[0.16727468,0.055353303,0.018930292,0.0031684975,0.0070928656,0.00021392184,0.00041206193,0.00051293545,0.7470414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931204,0.0002115759,0.000027313881,0.0000866034,0.00030649477,0.000056028624],"domain_scores_gemma":[0.9995963,0.00015292923,0.000031584445,0.00010973265,0.000068944544,0.00004051676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006865001,0.0011418185,0.0010384565,0.002439928,0.0017373875,0.0049617933,0.0006602407,0.0012102033,0.025138365],"category_scores_gemma":[0.0016925144,0.0005250648,0.0003365634,0.0032743178,0.0043197772,0.005262552,0.0015729241,0.0033443181,0.011537222],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008459976,0.000011266879,0.000029496134,0.000055232777,0.0000037243512,0.000012914706,0.00012227894,0.0003552622,0.00012460627,0.91837054,0.04876311,0.032143045],"study_design_scores_gemma":[0.000009250814,0.000008579757,0.000063144085,0.00006125635,0.0000031681104,0.00007357762,0.00005193041,0.00070871896,0.00015069601,0.7440903,0.25477278,0.000006606708],"about_ca_topic_score_codex":0.001162298,"about_ca_topic_score_gemma":0.0013867432,"teacher_disagreement_score":0.025138365,"about_ca_system_score_codex":0.0025698778,"about_ca_system_score_gemma":0.0011055972,"threshold_uncertainty_score":0.08409625},"labels":[],"label_agreement":null},{"id":"W88088745","doi":"10.1007/978-3-662-43936-4_6","title":"Secure and Privacy-Preserving Querying of Personal Health Records in the Cloud","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Paillier cryptosystem; Homomorphic encryption; Computer science; Encryption; Cloud computing; Outsourcing; Protocol (science); Computer security; Cryptosystem; Internet privacy; Hybrid cryptosystem; Medicine; Business","score_opus":0.019499260651934292,"score_gpt":0.25794056563181145,"score_spread":0.23844130497987714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88088745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09379592,0.0033241885,0.88377374,0.0043062135,0.00034119704,0.0003604594,0.0018925815,0.0029529424,0.009252792],"genre_scores_gemma":[0.888538,0.0019626757,0.100806676,0.0006453868,0.0003169001,0.000115682895,0.0017349994,0.00014826098,0.005731467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944759,0.0010541374,0.0005508842,0.0006669317,0.0024022516,0.0008499556],"domain_scores_gemma":[0.9924544,0.002026947,0.0005516151,0.004167027,0.00055754173,0.00024237929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038058807,0.00044159064,0.001469217,0.0008133662,0.0012343692,0.0046024956,0.002577798,0.00144783,0.002046431],"category_scores_gemma":[0.008178359,0.0005385702,0.0010317316,0.0026684783,0.0014800057,0.005936402,0.0053380835,0.0016902447,0.001292309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004258272,0.00069453346,0.014163791,0.0008153161,0.0004421294,0.0022311653,0.002806866,0.07645229,0.06570739,0.31202132,0.040931042,0.47947595],"study_design_scores_gemma":[0.0002527225,0.00034915024,0.0044161147,0.00016209198,0.0002073801,0.0038744095,0.0014982704,0.60617846,0.0687765,0.27889925,0.03527679,0.00010886825],"about_ca_topic_score_codex":0.0022582158,"about_ca_topic_score_gemma":0.0017631046,"teacher_disagreement_score":0.0046024956,"about_ca_system_score_codex":0.001109697,"about_ca_system_score_gemma":0.0026536183,"threshold_uncertainty_score":0.020127654},"labels":[],"label_agreement":null}]}