{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006336742,0.00015637437,0.9830821,0.00029732814,0.004367368,0.00056281313,0.000016120435,0.00019615897,0.010688023],"genre_scores_gemma":[0.06858962,0.00030094173,0.9247309,0.0016588855,0.0030321428,0.00014173241,0.00005091616,0.00012132921,0.001373538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516064,0.00010678119,0.0009465501,0.0020016648,0.0008666656,0.0009176769],"domain_scores_gemma":[0.99696434,0.0005499006,0.00043326904,0.001659597,0.00019824764,0.00019466908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008732709,0.0004897203,0.0006094587,0.0013381283,0.00033011023,0.00058185955,0.0031492393,0.00025475232,0.00001543471],"category_scores_gemma":[0.00017149869,0.0005517306,0.00022781637,0.0007615809,0.00049270684,0.0011064024,0.0019521153,0.00070379704,0.000015407766],"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.0000304618,0.000047276204,0.00087603275,0.0002601075,0.000009679142,0.000021607146,0.00049203617,0.0007708128,0.00004142658,0.76301855,0.00029572737,0.23413625],"study_design_scores_gemma":[0.0015288034,0.00026192502,0.019769931,0.0023139257,0.000017773698,0.00005849528,0.000007228038,0.6016105,0.00029365905,0.14322184,0.2281368,0.0027791155],"about_ca_topic_score_codex":0.00016215468,"about_ca_topic_score_gemma":0.0004082486,"teacher_disagreement_score":0.61979675,"about_ca_system_score_codex":0.00030445104,"about_ca_system_score_gemma":0.00031791796,"threshold_uncertainty_score":0.9996934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026570904,0.000273262,0.96841246,0.00017895852,0.0032586332,0.00041864888,0.00010297618,0.00030227305,0.026787061],"genre_scores_gemma":[0.033086162,0.00028303594,0.9587384,0.004009476,0.0016755816,0.000021445294,0.00024184777,0.0001166094,0.0018274498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932263,0.000063880245,0.0007870668,0.0032984877,0.0017241752,0.000900075],"domain_scores_gemma":[0.9925395,0.00043953312,0.00043857112,0.005898627,0.0003027786,0.00038095747],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024686796,0.00069325865,0.0007285155,0.001083721,0.00037018623,0.0005671779,0.009311648,0.00033063252,0.00011339106],"category_scores_gemma":[0.000105211715,0.00069834787,0.00016027503,0.00070172735,0.0014825268,0.0019882368,0.011963415,0.0010389986,0.00018285867],"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.0000100230345,0.000045360546,0.00011434782,0.000028239876,0.000021579623,0.00009511653,0.00016334072,0.000085569314,0.00006123655,0.9428761,0.0013615894,0.055137515],"study_design_scores_gemma":[0.001297185,0.00024536796,0.0062352177,0.00079567835,0.00002828059,0.000099398574,0.00000155629,0.595846,0.00020183236,0.09604409,0.2968556,0.002349769],"about_ca_topic_score_codex":0.00013749575,"about_ca_topic_score_gemma":0.000117740405,"teacher_disagreement_score":0.846832,"about_ca_system_score_codex":0.00019680732,"about_ca_system_score_gemma":0.0007902021,"threshold_uncertainty_score":0.99954677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41734982,0.0034527,0.55548507,0.0009221347,0.0002340717,0.0007159674,0.000022044818,0.00015896895,0.021659225],"genre_scores_gemma":[0.9870136,0.00020742712,0.012593385,0.0001104627,0.000016586115,0.000016413893,0.0000025377872,0.000003222284,0.000036375095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989866,0.00012160965,0.00021652889,0.0002738477,0.00022501672,0.00017639954],"domain_scores_gemma":[0.9990221,0.00013616092,0.00007457697,0.0006300029,0.00007485048,0.00006225483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040912416,0.00012466748,0.00021910157,0.00005243273,0.00029223657,0.000056237808,0.0006428017,0.0000334961,0.000018145132],"category_scores_gemma":[0.000019313287,0.000076162185,0.000076561744,0.00025864207,0.000894936,0.00033563728,0.00050474424,0.00012486057,0.0000066273983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033909684,0.00021165745,0.0058798213,0.0000243734,0.00002906728,0.0000027041963,0.0022200032,9.209135e-7,0.00004214307,0.987337,0.001045093,0.0031732868],"study_design_scores_gemma":[0.022010073,0.0011676706,0.13285145,0.00017623995,0.00010011345,0.0004989193,0.00084185775,0.04397144,0.033378653,0.6658093,0.09736636,0.0018279218],"about_ca_topic_score_codex":0.00012292682,"about_ca_topic_score_gemma":0.00019931499,"teacher_disagreement_score":0.56966376,"about_ca_system_score_codex":0.000015144504,"about_ca_system_score_gemma":0.00004694421,"threshold_uncertainty_score":0.3297429},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0314675,0.00020386477,0.9669074,0.00033226164,0.0007248172,0.00020349605,0.000002304088,0.00013232935,0.000026029016],"genre_scores_gemma":[0.5220114,0.0000038159865,0.47731608,0.0006050099,0.00005568391,0.0000031545603,9.4676506e-7,0.0000037524178,1.6565082e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722165,0.00006407329,0.00036357463,0.0009716143,0.0005020299,0.000877034],"domain_scores_gemma":[0.9982475,0.000559577,0.00008817939,0.00086016057,0.000080923746,0.00016365017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659318,0.00022063772,0.0002088249,0.0008260604,0.00018390412,0.0003381147,0.0022919998,0.00010919316,0.0000062762647],"category_scores_gemma":[0.0002514161,0.00020549363,0.00005610784,0.004121172,0.00030248714,0.0009973407,0.001020173,0.0004607559,0.000011192691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013089028,0.00030907866,0.031462394,0.000052715804,0.000003408791,0.00034498924,0.008538375,0.022423668,0.0013365012,0.00665233,0.00001801519,0.9288454],"study_design_scores_gemma":[0.0007956627,0.00011967482,0.067350775,0.00012494529,0.0000015749026,0.00006008724,0.0000042382253,0.91544527,0.005132502,0.010126143,0.0003228727,0.0005162682],"about_ca_topic_score_codex":0.00012874068,"about_ca_topic_score_gemma":0.0009801076,"teacher_disagreement_score":0.92832917,"about_ca_system_score_codex":0.000115217495,"about_ca_system_score_gemma":0.000118399075,"threshold_uncertainty_score":0.8379787},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8153131,0.00021183491,0.18168087,0.0008215451,0.0002957523,0.00091735116,0.00017206147,0.00007198445,0.00051552913],"genre_scores_gemma":[0.922718,0.00062838156,0.07104444,0.00006062734,0.000015155652,0.0000027667002,0.004816436,0.000012530856,0.0007016603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899447,0.00008075972,0.0003004464,0.00013050156,0.0003295503,0.00016429392],"domain_scores_gemma":[0.9978746,0.00037339574,0.00078858127,0.00047663593,0.00043491487,0.000051863575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006259646,0.00014986507,0.00023789103,0.00029794197,0.00060729706,0.00014026601,0.0009859185,0.00013606399,0.0000029488958],"category_scores_gemma":[0.000076454584,0.000146308,0.00009947579,0.00034720392,0.00024644256,0.0017843448,0.00017355745,0.00016747986,0.000005155848],"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.00034557894,0.00006072195,0.0003047211,0.00074125896,0.00007550041,1.1197732e-7,0.124291256,0.00051604107,0.000024739535,0.8606395,0.0005106514,0.01248991],"study_design_scores_gemma":[0.009462779,0.002036962,0.027273858,0.0022198833,0.0005812004,0.000012432437,0.23385127,0.4679772,0.0011784596,0.22710021,0.026214538,0.0020912183],"about_ca_topic_score_codex":0.00094771595,"about_ca_topic_score_gemma":0.00086727133,"teacher_disagreement_score":0.6335393,"about_ca_system_score_codex":0.000022911512,"about_ca_system_score_gemma":0.00007209079,"threshold_uncertainty_score":0.5966267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001456926,0.00013444696,0.9957624,0.0002221996,0.0018872704,0.00035081012,0.000016572336,0.00022502008,0.0012555771],"genre_scores_gemma":[0.05308165,0.00007627399,0.94332737,0.002941345,0.00040766216,0.0000056091285,0.000064108666,0.00002761945,0.000068340305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966211,0.00003490364,0.0006011681,0.0010101661,0.0010777209,0.0006549843],"domain_scores_gemma":[0.9969548,0.00021960527,0.00036021887,0.0020078828,0.00025364987,0.00020383466],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012228428,0.00048413832,0.00045354263,0.0008991043,0.00030212448,0.0010399797,0.0039030975,0.00038288007,0.000030285815],"category_scores_gemma":[0.00015099558,0.00045158798,0.00015861039,0.00088869705,0.00051743723,0.002398946,0.0017547385,0.0008313581,0.00017413346],"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.00002971356,0.000049844093,0.00016764629,0.00015746725,0.000021975506,0.000031648193,0.0012642392,0.010093551,0.000099445846,0.5187298,0.0001576914,0.469197],"study_design_scores_gemma":[0.0008737429,0.0002573435,0.0006472916,0.00039143162,0.000011591669,0.000052478797,1.2359031e-7,0.71798754,0.0019445478,0.21041462,0.06611581,0.0013034766],"about_ca_topic_score_codex":0.00002460692,"about_ca_topic_score_gemma":0.000030147217,"teacher_disagreement_score":0.70789397,"about_ca_system_score_codex":0.0001597669,"about_ca_system_score_gemma":0.00029790698,"threshold_uncertainty_score":0.999997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015882363,0.0009195271,0.9925204,0.00031638428,0.0009675754,0.00042124648,0.000017589258,0.00025627622,0.00442218],"genre_scores_gemma":[0.27298275,0.000037087473,0.7251889,0.001104673,0.0005315618,0.000012951649,0.000021576747,0.000055904486,0.00006457521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524856,0.00003292035,0.0004605636,0.0019096618,0.001530938,0.0008173503],"domain_scores_gemma":[0.9966437,0.00032544328,0.00027470302,0.0020282883,0.00037197053,0.00035588635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001069147,0.0006268267,0.0005652862,0.000959743,0.0002769651,0.00068987114,0.0037994008,0.00028605867,0.0000196253],"category_scores_gemma":[0.000060249473,0.0005074628,0.00013340282,0.0010534312,0.00096139417,0.000541793,0.0014646822,0.0009501014,0.000047120535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032795542,0.00014932035,0.000120195225,0.0000993798,0.00004366586,0.00048564613,0.0024280113,0.18664774,0.00008865943,0.21940032,0.00015481688,0.59034944],"study_design_scores_gemma":[0.0009194565,0.0005009214,0.00017461779,0.0009057793,0.000022416501,0.00026621934,6.642278e-7,0.8378066,0.00050823187,0.14354692,0.013650723,0.0016974878],"about_ca_topic_score_codex":0.00004069369,"about_ca_topic_score_gemma":0.00012370046,"teacher_disagreement_score":0.6511588,"about_ca_system_score_codex":0.00022266185,"about_ca_system_score_gemma":0.00077918684,"threshold_uncertainty_score":0.9997377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02107894,0.0008489304,0.9758571,0.0005804704,0.0014042611,0.0001611585,0.000043718774,0.000011280502,0.000014177126],"genre_scores_gemma":[0.6800183,0.000058261525,0.31873417,0.00025647169,0.00089210406,0.0000035210528,0.000027344382,0.0000068001877,0.0000029889884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900085,0.00005199729,0.0002897122,0.00014218279,0.00029768012,0.00021759109],"domain_scores_gemma":[0.99858654,0.00024655592,0.00036543925,0.0005775819,0.00007177627,0.00015209243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011678215,0.000086905646,0.00013669764,0.000075464784,0.000073072064,0.000058221474,0.0012729414,0.000045991008,0.000004725782],"category_scores_gemma":[0.0002229313,0.000074771946,0.00004177469,0.00021145598,0.000016765096,0.0026732162,0.00023500762,0.00013729346,0.000013208242],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083217764,0.006224658,0.06467367,0.0013471618,0.0009346791,0.000058662503,0.046235003,0.0013917551,0.07381936,0.013742154,0.15564246,0.6350982],"study_design_scores_gemma":[0.004663672,0.00031476282,0.08476716,0.00031206058,0.00015023827,0.00021203823,0.00036849975,0.47663662,0.0072555174,0.0011534615,0.42344064,0.0007253252],"about_ca_topic_score_codex":0.0000067675614,"about_ca_topic_score_gemma":0.0000064871747,"teacher_disagreement_score":0.65893936,"about_ca_system_score_codex":0.000029997884,"about_ca_system_score_gemma":0.000055981156,"threshold_uncertainty_score":0.30491114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022870104,0.00019996069,0.9917486,0.00035254753,0.0013447634,0.00053293834,0.00008754501,0.00011366071,0.0033329788],"genre_scores_gemma":[0.77884895,0.00003114472,0.2197945,0.0008597207,0.00033503943,0.000016911114,0.00005360425,0.000035902358,0.000024225159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956152,0.00007188486,0.0006554347,0.0016647832,0.0013442443,0.00064848945],"domain_scores_gemma":[0.996292,0.0008103932,0.0005471961,0.0013907553,0.00073748484,0.00022218018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055290724,0.0006154942,0.0007725176,0.0010184182,0.00027568536,0.00037187888,0.0034057735,0.00042900705,0.000089370165],"category_scores_gemma":[0.000055532986,0.0005839249,0.00023980127,0.0010140477,0.0018056576,0.0013841459,0.0017474318,0.0010616924,0.000053983422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019074485,0.00018276143,0.000090736175,0.00009657415,0.00008102031,0.000031263793,0.0048284074,0.038858708,0.00005423988,0.82166433,0.000099337616,0.13399357],"study_design_scores_gemma":[0.0003128778,0.00013452218,0.0009438411,0.00020449015,0.000012264891,0.00005697466,0.0000016388974,0.12650846,0.0005982326,0.8703923,0.00022432057,0.00061008445],"about_ca_topic_score_codex":0.00012029262,"about_ca_topic_score_gemma":0.000089125126,"teacher_disagreement_score":0.7765619,"about_ca_system_score_codex":0.0002441614,"about_ca_system_score_gemma":0.0007850579,"threshold_uncertainty_score":0.9996612},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002977411,0.00009961881,0.99522674,0.0013057619,0.00056802994,0.0005348942,0.000078050565,0.00041408069,0.0014750874],"genre_scores_gemma":[0.5773229,0.000023334693,0.4192625,0.0025706661,0.0006129759,0.000014249846,0.00008183545,0.000049629965,0.000061898885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482596,0.000116229945,0.0005291459,0.0022174902,0.0012796288,0.0010315507],"domain_scores_gemma":[0.9957085,0.00047836537,0.00038769946,0.0026685079,0.00040319999,0.000353726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015182992,0.00074115733,0.0006947822,0.0012420632,0.00047706283,0.00060191896,0.0037450353,0.00046485872,0.00006689177],"category_scores_gemma":[0.00010890559,0.000640587,0.00022852342,0.0017726474,0.0010916963,0.0008739311,0.0011978159,0.0010637356,0.000045137407],"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.000111898466,0.00038237512,0.0022403845,0.00025490424,0.00004525203,0.00020286159,0.0024914471,0.030191308,0.000068373876,0.54681367,0.00022379143,0.41697374],"study_design_scores_gemma":[0.0026594535,0.0012823871,0.0031819849,0.00081091915,0.00004723738,0.000090740796,0.0000018975784,0.7102957,0.00067044055,0.25749606,0.02079103,0.0026721384],"about_ca_topic_score_codex":0.00005655243,"about_ca_topic_score_gemma":0.0006041192,"teacher_disagreement_score":0.6801044,"about_ca_system_score_codex":0.00043498905,"about_ca_system_score_gemma":0.0012866734,"threshold_uncertainty_score":0.9996045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034172346,0.0010811534,0.9892892,0.00047434593,0.0016611737,0.0009360738,0.000026814247,0.00034355265,0.0027704488],"genre_scores_gemma":[0.87807983,0.00008642537,0.11931205,0.0017498159,0.00058121764,0.000032408912,0.000057880647,0.00006947637,0.000030902203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99382055,0.000085055995,0.0008509349,0.0026422746,0.0015003061,0.0011008538],"domain_scores_gemma":[0.9963748,0.0005889395,0.0005496007,0.0015849407,0.00047450676,0.00042721062],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011688218,0.00091678806,0.0008853381,0.0012118835,0.0006111476,0.0015257123,0.002829384,0.00046555293,0.00004108698],"category_scores_gemma":[0.000098124845,0.00086632353,0.00020747467,0.0012549363,0.001067703,0.0009563412,0.0017816065,0.0012835307,0.00004911906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070213223,0.00015187003,0.00021013075,0.000257585,0.00005878416,0.00016877922,0.0060366658,0.065519884,0.0008250661,0.10964126,0.00013352408,0.8169894],"study_design_scores_gemma":[0.0010049817,0.0001561452,0.0009442429,0.00069760106,0.000029022225,0.00018544482,0.0000017609203,0.8792142,0.00060607796,0.114985764,0.0008526273,0.0013221052],"about_ca_topic_score_codex":0.000056938356,"about_ca_topic_score_gemma":0.000052707106,"teacher_disagreement_score":0.8746626,"about_ca_system_score_codex":0.000241891,"about_ca_system_score_gemma":0.00044715824,"threshold_uncertainty_score":0.9995108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018764958,0.0004970133,0.99639034,0.00022895794,0.0011818076,0.000334147,0.000011388296,0.00020306928,0.0009656299],"genre_scores_gemma":[0.07267574,0.000093372364,0.92570096,0.0010480111,0.0004025303,0.0000039945717,0.0000127882595,0.00004022641,0.000022374694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956723,0.00006106955,0.0005876568,0.0018201398,0.0011058507,0.0007530148],"domain_scores_gemma":[0.9970605,0.00028454664,0.00029670316,0.0019405237,0.0001271468,0.00029061822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011241435,0.0006136968,0.00060818903,0.000820967,0.0003929565,0.0006628506,0.0038400951,0.00037319548,0.00003251504],"category_scores_gemma":[0.00003487173,0.0005305591,0.00024493443,0.000732805,0.0006694683,0.0006890731,0.00140383,0.0009062147,0.00001943839],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006281703,0.000030779418,0.000028299846,0.00007021721,0.000008937772,0.00006945028,0.000754166,0.005195646,0.00072539144,0.12596712,0.0000128366655,0.8671309],"study_design_scores_gemma":[0.00028098296,0.00012881328,0.000080128026,0.0006834032,0.000012464152,0.0000728773,7.01731e-8,0.6936186,0.0016938342,0.29103222,0.011533957,0.00086262583],"about_ca_topic_score_codex":0.000025405861,"about_ca_topic_score_gemma":0.000017582403,"teacher_disagreement_score":0.8662683,"about_ca_system_score_codex":0.00015096542,"about_ca_system_score_gemma":0.00028040257,"threshold_uncertainty_score":0.9997146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07089183,0.004065804,0.9175326,0.002827195,0.00021432171,0.0010602603,0.00004779466,0.0022502723,0.0011098855],"genre_scores_gemma":[0.9083903,0.00028405638,0.088974915,0.0013631473,0.00017201701,0.0005758628,0.000039726754,0.00004641426,0.00015360539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963994,0.00018296781,0.00057199056,0.00082620775,0.0005237201,0.0014956915],"domain_scores_gemma":[0.9969106,0.000121800374,0.00024951354,0.002025476,0.0002148155,0.00047781796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007478404,0.00045290258,0.00045100274,0.000473826,0.0003987727,0.00075628015,0.0020145131,0.00034765922,0.000072561204],"category_scores_gemma":[0.00006387381,0.00043783998,0.0003066999,0.0014002019,0.00008425333,0.001735286,0.0005882064,0.0007363961,0.000215672],"study_design_candidate":"theoretical_or_conceptual","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.000016427815,0.00022057316,0.004761154,0.000077416,0.00007274509,0.000056842207,0.00024423987,0.0003725032,0.0017216887,0.96144074,0.011054079,0.019961601],"study_design_scores_gemma":[0.0012875433,0.0005533726,0.018748099,0.00016949789,0.00006657565,0.0008849792,0.0003023873,0.8769286,0.009228574,0.04519386,0.04503797,0.0015985433],"about_ca_topic_score_codex":0.0109447595,"about_ca_topic_score_gemma":0.00269818,"teacher_disagreement_score":0.9162469,"about_ca_system_score_codex":0.0005079691,"about_ca_system_score_gemma":0.00034730305,"threshold_uncertainty_score":0.99980736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003190177,0.004011016,0.9892633,0.0006695049,0.0012685048,0.0005281362,0.000032844353,0.00027680577,0.0036308588],"genre_scores_gemma":[0.3192072,0.00064874557,0.6772496,0.0016229729,0.0010602976,0.000016845985,0.00006006688,0.00007141977,0.000062862106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99420035,0.00007649165,0.0006826187,0.0021436885,0.0016584803,0.0012383849],"domain_scores_gemma":[0.9964404,0.00040335424,0.0002067518,0.0022028845,0.00021397976,0.00053264294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013722389,0.00087242766,0.0007996399,0.000814367,0.00057603826,0.0008905203,0.0047098924,0.0006729486,0.00019308929],"category_scores_gemma":[0.0000314961,0.0008026195,0.000333139,0.0009839984,0.0008705192,0.002379395,0.0015101817,0.0016518706,0.000044724737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023769904,0.00019332852,0.00010303883,0.00011410274,0.000037937327,0.00012220145,0.0025387427,0.0028735322,0.0010940868,0.054408386,0.00008397032,0.9384069],"study_design_scores_gemma":[0.0022462131,0.0020250462,0.002615226,0.0036811682,0.00025904144,0.0010778845,0.000003206455,0.40465924,0.012761761,0.32544407,0.2361129,0.009114241],"about_ca_topic_score_codex":0.000032604486,"about_ca_topic_score_gemma":0.000054345248,"teacher_disagreement_score":0.9292927,"about_ca_system_score_codex":0.00020725303,"about_ca_system_score_gemma":0.00044466363,"threshold_uncertainty_score":0.99944246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000272798,0.0007512076,0.9893477,0.0006228167,0.0018181407,0.00055400433,0.00003430363,0.00017063905,0.006428413],"genre_scores_gemma":[0.3320442,0.00042036248,0.66375077,0.0026932207,0.0007546423,0.00009668055,0.00015437062,0.000042918597,0.00004279036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970305,0.00007818202,0.0004137028,0.001304661,0.00075367803,0.0004192871],"domain_scores_gemma":[0.99744344,0.000456431,0.00022178888,0.001141865,0.00054624944,0.00019021623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092953345,0.00040495957,0.00033623909,0.00091039983,0.0005656876,0.0008365658,0.0010778434,0.0003164698,0.00019409912],"category_scores_gemma":[0.00010803434,0.00038774157,0.00009845176,0.00088529056,0.0010176179,0.0012123045,0.00070568745,0.0007081505,0.00006662865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034253198,0.000022721675,0.000046413676,0.000020287469,0.000017765742,0.000006811566,0.00032246576,0.0012412777,0.000050187326,0.65265197,0.00015879885,0.3454579],"study_design_scores_gemma":[0.00032083344,0.00011347373,0.0006702782,0.00013328306,0.000033771525,0.000113799455,6.2357515e-7,0.21393907,0.000058625927,0.7808688,0.0032832688,0.0004641412],"about_ca_topic_score_codex":0.000025420908,"about_ca_topic_score_gemma":0.00010998778,"teacher_disagreement_score":0.34499377,"about_ca_system_score_codex":0.000113750335,"about_ca_system_score_gemma":0.0004488033,"threshold_uncertainty_score":0.9998574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007958322,0.0031316932,0.9844202,0.00021564058,0.00210535,0.00041861925,0.000021442516,0.00013981145,0.009467677],"genre_scores_gemma":[0.33293125,0.000057292727,0.6659016,0.0001782035,0.0007207449,0.000014523776,0.000020237612,0.00005238771,0.00012377842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957859,0.00005299318,0.00067890115,0.0015975783,0.0011540141,0.0007306369],"domain_scores_gemma":[0.9955578,0.0005646952,0.00043266857,0.002680294,0.0004897524,0.00027481097],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001633333,0.0005478568,0.00068553654,0.0009962249,0.00025304206,0.00048849196,0.0076485723,0.0003056333,0.000020805097],"category_scores_gemma":[0.00034994903,0.0005050107,0.00018845338,0.0012691508,0.00095358136,0.0012497739,0.0051396466,0.000845295,0.000013827445],"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.00001385355,0.00010872374,0.00020449338,0.00025901955,0.000022394459,0.000060219543,0.0045266384,0.002427115,0.00008914332,0.35661355,0.00031036482,0.6353645],"study_design_scores_gemma":[0.00031748577,0.00017442924,0.00005661668,0.0009396178,0.000010961806,0.00003500925,3.4658623e-7,0.18229789,0.0017856521,0.78932285,0.024265507,0.00079362636],"about_ca_topic_score_codex":0.00002066308,"about_ca_topic_score_gemma":0.00014275292,"teacher_disagreement_score":0.63457084,"about_ca_system_score_codex":0.00026280186,"about_ca_system_score_gemma":0.00091262127,"threshold_uncertainty_score":0.9997401},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009509018,0.0030152104,0.99139553,0.00094981014,0.00051139673,0.0005728802,0.000036073467,0.00022235117,0.0032872579],"genre_scores_gemma":[0.050719876,0.00078896707,0.94520795,0.0014592119,0.0013158132,0.000117998636,0.00015529321,0.00006259788,0.00017230249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611884,0.00003548556,0.000442787,0.0021216872,0.0008319909,0.000449217],"domain_scores_gemma":[0.9961603,0.0001690041,0.00023351461,0.002689605,0.00046112662,0.00028639613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011909654,0.00039970584,0.0003774105,0.0008488272,0.000411788,0.0006966307,0.0022655523,0.00031773635,0.000015184797],"category_scores_gemma":[0.00009822269,0.0003944902,0.00008714281,0.0013471665,0.000778757,0.000952111,0.0013344839,0.00062523497,0.000028770755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002095641,0.000041764266,0.00011578631,0.000051188046,0.000011623271,0.000021477363,0.0008446988,0.0016671928,0.000080788304,0.7786463,0.0002252006,0.21829191],"study_design_scores_gemma":[0.00019871435,0.000084465224,0.00010670781,0.00014201521,0.000014264605,0.00013306784,3.940391e-7,0.04851482,0.00008733501,0.8901867,0.059908863,0.00062264624],"about_ca_topic_score_codex":0.000034736917,"about_ca_topic_score_gemma":0.000092053415,"teacher_disagreement_score":0.21766926,"about_ca_system_score_codex":0.00013001048,"about_ca_system_score_gemma":0.00052967394,"threshold_uncertainty_score":0.9998507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021106444,0.00019965119,0.97603416,0.0001572334,0.00029901837,0.00048366783,0.000010763078,0.00010269711,0.001606377],"genre_scores_gemma":[0.9356072,0.00002099473,0.0637908,0.00037471668,0.00014254823,0.000016347914,0.0000061271207,0.000027708575,0.0000135738655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657935,0.000024418414,0.00043233682,0.001592063,0.00084302714,0.00052880886],"domain_scores_gemma":[0.99726313,0.00052814715,0.00036321252,0.0015154863,0.00020028577,0.00012975659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097023253,0.00046944403,0.0004181549,0.0005716706,0.00048464653,0.0007627291,0.0029834388,0.00021472997,0.000041569274],"category_scores_gemma":[0.00010663776,0.00032083367,0.00008583325,0.00084028457,0.0006556335,0.0007211024,0.0018602675,0.00093584147,0.0000059114823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059275757,0.00012481505,0.0023311647,0.0005453607,0.000077413824,0.00007287945,0.008452821,0.08353139,0.001367183,0.4786199,0.000019055791,0.42479876],"study_design_scores_gemma":[0.0002208409,0.00037259376,0.00051614176,0.0011053227,0.000010303051,0.00006309925,0.0000019245024,0.89135325,0.0022325907,0.10356487,0.00003610571,0.0005229432],"about_ca_topic_score_codex":0.000109147186,"about_ca_topic_score_gemma":0.00018686148,"teacher_disagreement_score":0.9145007,"about_ca_system_score_codex":0.00008876375,"about_ca_system_score_gemma":0.00010704675,"threshold_uncertainty_score":0.99992436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022241846,0.0012663316,0.99377733,0.00026054363,0.0016401592,0.00031642788,0.0000149581865,0.0003160203,0.002185785],"genre_scores_gemma":[0.10182179,0.00025754847,0.8965805,0.0010016125,0.00018925323,0.000011011376,0.000016602964,0.000043392356,0.00007827484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956174,0.000021126309,0.00054584706,0.001993533,0.00095153396,0.00087058224],"domain_scores_gemma":[0.99692494,0.00021989307,0.0002490999,0.0022001213,0.00016319093,0.00024276305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007181351,0.0006550235,0.00057922694,0.0011909938,0.00033125016,0.00081940123,0.004929831,0.0003707387,0.000033016964],"category_scores_gemma":[0.00005242023,0.00062464894,0.00023581981,0.0010057616,0.0007571019,0.0011246352,0.002547516,0.0010466464,0.000051451738],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083727255,0.0001010574,0.00020710209,0.0000768503,0.000033115866,0.00039737383,0.00068277883,0.005512332,0.0005107694,0.10301225,0.000021214288,0.8894368],"study_design_scores_gemma":[0.0004137661,0.00012863925,0.00018740557,0.0003845918,0.000011081657,0.00015907713,1.542966e-7,0.8443297,0.00062620227,0.14266782,0.009984451,0.0011071042],"about_ca_topic_score_codex":0.000021463791,"about_ca_topic_score_gemma":0.00018843806,"teacher_disagreement_score":0.8883297,"about_ca_system_score_codex":0.00020466335,"about_ca_system_score_gemma":0.00026804436,"threshold_uncertainty_score":0.9996205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065325835,0.001005591,0.99452144,0.00040031463,0.0016095574,0.00035854796,0.000015884629,0.00023915463,0.001196236],"genre_scores_gemma":[0.5456834,0.00009679683,0.45285943,0.0004388006,0.0008275246,0.000010351196,0.000027639273,0.000034863107,0.000021221937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960915,0.00004068768,0.0003735272,0.0015525592,0.0010803414,0.0008614243],"domain_scores_gemma":[0.99753535,0.0001419868,0.00024770992,0.0015933242,0.00020455854,0.00027704344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000770358,0.0005976616,0.0004657047,0.00083108555,0.00033485994,0.0005912388,0.0029039448,0.00040246372,0.00002726187],"category_scores_gemma":[0.000017675344,0.00047235837,0.00013876539,0.00074387994,0.0010536833,0.0016307657,0.0010977038,0.0012317661,0.000026815735],"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.00008905791,0.00020634441,0.00015423012,0.00014643997,0.0000742294,0.00019402444,0.008194928,0.02972629,0.00052843115,0.26307693,0.00024071289,0.6973684],"study_design_scores_gemma":[0.0018429684,0.0016848663,0.0007572335,0.0015192068,0.00011636188,0.0014458229,0.0000035156613,0.21628983,0.01803859,0.72586983,0.026576899,0.0058548786],"about_ca_topic_score_codex":0.000029834768,"about_ca_topic_score_gemma":0.00002587673,"teacher_disagreement_score":0.6915135,"about_ca_system_score_codex":0.0001635958,"about_ca_system_score_gemma":0.00028922452,"threshold_uncertainty_score":0.9997728},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013653353,0.0005204177,0.9909504,0.00063942774,0.0014019138,0.00037761327,0.000010170215,0.00027702074,0.0056864917],"genre_scores_gemma":[0.20202124,0.00006721109,0.79460263,0.0021707688,0.0010194847,0.000004233418,0.00003310696,0.00003543918,0.000045897563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955378,0.00003460028,0.0006339572,0.0016874709,0.0013305101,0.00077561615],"domain_scores_gemma":[0.99708146,0.00038461518,0.00036172476,0.0017171707,0.00025050377,0.00020453069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015021813,0.00055367,0.0005015491,0.0010636938,0.00042724088,0.0008000867,0.0038554408,0.00035186525,0.000030677744],"category_scores_gemma":[0.00007606965,0.0005069907,0.00020374537,0.00090681174,0.0005417196,0.0013379109,0.001826495,0.0009180612,0.00008139092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024871224,0.000025230964,0.000045344692,0.000017592367,0.000006887782,0.000019644747,0.00058987906,0.008220252,0.000024788023,0.23336406,0.000023254966,0.75766057],"study_design_scores_gemma":[0.00025203783,0.00010681823,0.00027895314,0.0002136439,0.000007370028,0.000060020735,1.3671307e-7,0.5055139,0.00033543856,0.48867205,0.003921551,0.0006380899],"about_ca_topic_score_codex":0.000020234354,"about_ca_topic_score_gemma":0.00011833941,"teacher_disagreement_score":0.7570225,"about_ca_system_score_codex":0.00026113697,"about_ca_system_score_gemma":0.00043541784,"threshold_uncertainty_score":0.99973816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002700242,0.0019412125,0.9873751,0.00041144862,0.00116478,0.00036526614,0.000077049735,0.00029408612,0.008344084],"genre_scores_gemma":[0.104229696,0.00030355575,0.8878582,0.0059050294,0.0012203472,0.000019306,0.00021215678,0.000076150325,0.00017553981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550045,0.000042100546,0.0005502868,0.0020017487,0.0011856401,0.00071976654],"domain_scores_gemma":[0.9965829,0.00032239247,0.00035029143,0.0020708302,0.000409449,0.00026409441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007453153,0.00068423786,0.00059554615,0.0011173674,0.00033438555,0.0005755486,0.0051241373,0.00063334825,0.00021713911],"category_scores_gemma":[0.000087921595,0.0006232602,0.00022121298,0.0011284066,0.00083670265,0.001220025,0.0018364214,0.0015551809,0.000093045026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009212855,0.000054458807,0.00006661365,0.00006882728,0.000028165057,0.00017199246,0.0006127603,0.00024738596,0.00011405573,0.8430332,0.00050930283,0.15508406],"study_design_scores_gemma":[0.0002719505,0.00018429081,0.0002474924,0.00053358974,0.000014556792,0.00009437174,6.865794e-8,0.0118236765,0.0007059472,0.95727164,0.027857706,0.0009947347],"about_ca_topic_score_codex":0.000011077162,"about_ca_topic_score_gemma":0.000044460765,"teacher_disagreement_score":0.15408933,"about_ca_system_score_codex":0.00013406338,"about_ca_system_score_gemma":0.00055701967,"threshold_uncertainty_score":0.99962187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1996722,0.000068109985,0.7909465,0.0002177451,0.00012121048,0.000078611745,0.0000024471815,0.00011016706,0.008783006],"genre_scores_gemma":[0.92978954,0.000007849571,0.06990291,0.00025131486,0.000018255256,0.0000015580301,0.000009031929,0.0000018790992,0.000017673126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993399,0.000038276135,0.0000792298,0.00019504537,0.00022298293,0.00012458673],"domain_scores_gemma":[0.9995982,0.00003072271,0.000014311285,0.00017158654,0.00005330548,0.0001318928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023011731,0.000054688553,0.000056121335,0.000070520284,0.0000454019,0.00017763776,0.00019980287,0.000024813375,0.00001280441],"category_scores_gemma":[0.000009769877,0.000046622557,0.000013733381,0.0002573304,0.000030026333,0.00067827065,0.00023265953,0.000052767064,0.000039475206],"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.00002141234,0.00014678332,0.023463586,0.000016494892,0.000027031485,0.000017035749,0.0035903237,0.0000760758,0.00030199692,0.884386,0.026936062,0.061017197],"study_design_scores_gemma":[0.0047436054,0.0005419314,0.1327154,0.000027855975,0.000013018157,0.00005630263,0.0004988115,0.5010032,0.002090709,0.32096714,0.03652359,0.00081843324],"about_ca_topic_score_codex":0.00016867182,"about_ca_topic_score_gemma":0.000014036231,"teacher_disagreement_score":0.7301173,"about_ca_system_score_codex":0.000009069099,"about_ca_system_score_gemma":0.000025184916,"threshold_uncertainty_score":0.19012128},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013562512,0.00012252528,0.9868825,0.0033345295,0.00018911457,0.004887021,0.000016706092,0.000028662924,0.003182661],"genre_scores_gemma":[0.85511994,0.000056050005,0.13583387,0.0069255014,0.0004273442,0.0015262647,0.000042462998,0.00003622278,0.000032320953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968237,0.00012708397,0.00054671615,0.00095095555,0.0011354036,0.00041611274],"domain_scores_gemma":[0.9968514,0.0008997995,0.00039663358,0.0016543912,0.00014237594,0.00005541008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002804329,0.0003387402,0.00031259915,0.00046902624,0.00021788637,0.0006434584,0.0034356774,0.0001571129,0.000012614406],"category_scores_gemma":[0.00013238622,0.00020256608,0.00008516746,0.0008877746,0.0007285137,0.00053532585,0.0007663562,0.0006274566,0.0000034247246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007472343,0.00011774653,0.0020672362,0.000058520247,0.000007044399,0.000021787198,0.0016744242,0.0013110463,0.000030875213,0.92304194,0.00034077698,0.07132114],"study_design_scores_gemma":[0.00044708097,0.00039915158,0.005624457,0.00057321094,0.0000058143924,0.00002635645,0.0000014315114,0.042719018,0.0008210904,0.9439051,0.004917335,0.00055993634],"about_ca_topic_score_codex":0.00004633267,"about_ca_topic_score_gemma":0.00035412202,"teacher_disagreement_score":0.8537637,"about_ca_system_score_codex":0.00007197098,"about_ca_system_score_gemma":0.00020133556,"threshold_uncertainty_score":0.8260405},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04546443,0.0001303047,0.95147765,0.00032268307,0.0003010531,0.00008043604,0.000020521024,0.00037222722,0.0018306733],"genre_scores_gemma":[0.507787,0.000013363002,0.49166518,0.00040215507,0.0000875943,0.000004276218,0.0000214956,0.0000071569216,0.000011775933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906486,0.000050113682,0.00014418754,0.00029454177,0.00023231225,0.00021398788],"domain_scores_gemma":[0.99864906,0.000037460428,0.000038289956,0.00097253674,0.00008113942,0.00022153182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003191994,0.00009427091,0.0000913697,0.00012686584,0.000110563065,0.00016618766,0.0007824659,0.000033778317,0.000037729686],"category_scores_gemma":[0.00006574202,0.00008459775,0.00004657862,0.00058508146,0.000051086263,0.0013998577,0.00058880495,0.00010454426,0.00013679141],"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.000003672454,0.00015833654,0.0017871297,0.0000073032124,0.00001078958,0.000033593875,0.00064704305,0.000029645886,0.0013381027,0.9810721,0.012994484,0.0019177893],"study_design_scores_gemma":[0.0028241451,0.00026675483,0.0043529524,0.00010427218,0.000060366623,0.0005665865,0.00068626425,0.4407924,0.005854475,0.28941792,0.25323287,0.0018409794],"about_ca_topic_score_codex":0.00038739934,"about_ca_topic_score_gemma":0.00004231045,"teacher_disagreement_score":0.6916542,"about_ca_system_score_codex":0.000021026191,"about_ca_system_score_gemma":0.00014270564,"threshold_uncertainty_score":0.3449796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0183021,0.0009800034,0.95479107,0.0069813435,0.00032688922,0.00019684026,0.000009152789,0.00040103737,0.018011542],"genre_scores_gemma":[0.9351106,0.00007902521,0.059868783,0.004148525,0.0005198664,0.000016754091,0.0000057886264,0.000008193902,0.00024245218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999143,0.000035179124,0.000115317576,0.00027128606,0.00018586026,0.0002493682],"domain_scores_gemma":[0.9990439,0.000060093273,0.00003908141,0.0007624723,0.000025416035,0.00006906977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023560695,0.00010101045,0.00007256267,0.00004743227,0.00020298401,0.0002072646,0.0010668015,0.000042492404,0.00015792664],"category_scores_gemma":[0.000012825089,0.00006174877,0.000071391376,0.00030172136,0.00004099616,0.0005789091,0.00044062344,0.00014419206,0.00011803502],"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.0000029275718,0.000088073626,0.0002451289,0.000014953313,0.000011133283,0.0000044153767,0.0035428805,0.0000053198432,0.0005870897,0.67252904,0.028011052,0.294958],"study_design_scores_gemma":[0.00046345455,0.000073464435,0.003267541,0.000008868595,0.000009587257,0.000026099173,0.00018532516,0.06707045,0.0031331046,0.008527049,0.916834,0.00040104886],"about_ca_topic_score_codex":0.00008359191,"about_ca_topic_score_gemma":0.00039520915,"teacher_disagreement_score":0.9168085,"about_ca_system_score_codex":0.000009980371,"about_ca_system_score_gemma":0.000014714603,"threshold_uncertainty_score":0.25180417},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8032751,0.00026933843,0.16540256,0.0014197996,0.0005432644,0.00040296905,0.000016074953,0.00038322818,0.028287672],"genre_scores_gemma":[0.97269136,0.000018114215,0.026504952,0.0006668882,0.000045762674,0.000016451488,0.000010322426,0.0000062585386,0.00003990232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984123,0.00007714444,0.00026687607,0.0004677408,0.00036870284,0.00040722586],"domain_scores_gemma":[0.9987657,0.000037627506,0.000052690546,0.0008151113,0.00006835665,0.00026048766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007665003,0.00014823915,0.0001819271,0.000202604,0.000049959457,0.00019893546,0.0009456491,0.00008388287,0.000041819356],"category_scores_gemma":[0.000047368434,0.000129529,0.00006131757,0.001026368,0.000053420838,0.00077806704,0.00060176634,0.00019638936,0.00018335346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047071895,0.0005838623,0.029519469,0.000019149431,0.000012389942,0.000058198424,0.0032390545,0.000073904004,0.00007842074,0.950323,0.013755911,0.002289565],"study_design_scores_gemma":[0.006673522,0.00047261358,0.014564546,0.00006606043,0.000011727121,0.00007741215,0.0003092622,0.13005558,0.004239649,0.59873694,0.24358858,0.0012041314],"about_ca_topic_score_codex":0.00037763757,"about_ca_topic_score_gemma":0.00038882042,"teacher_disagreement_score":0.35158607,"about_ca_system_score_codex":0.000042614574,"about_ca_system_score_gemma":0.00007266645,"threshold_uncertainty_score":0.5282039},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43331194,0.004346256,0.36452717,0.033588205,0.0058006174,0.0057673664,0.0023512086,0.00062247866,0.14968477],"genre_scores_gemma":[0.99451923,0.000021309403,0.00020856931,0.00061182445,0.000030690248,0.000030393157,0.000009488332,0.000004847355,0.004563637],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992415,0.000042595417,0.00020375973,0.00016642062,0.00017863448,0.00016712447],"domain_scores_gemma":[0.9990066,0.00022033683,0.00007010332,0.00064297195,0.00002576644,0.00003421772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000215029,0.000085786996,0.00010592716,0.0000331476,0.00007345454,0.000213793,0.0010616829,0.000010086062,0.00002576993],"category_scores_gemma":[0.000010565685,0.00004603739,0.00011016052,0.00031615826,0.00008829857,0.00023345358,0.00017358629,0.00008549453,0.000032106447],"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.00006252243,0.00023119185,0.009334625,0.00006927547,0.00009674805,0.0000022756064,0.0019181663,0.0004399916,0.00003341641,0.19305353,0.6804501,0.11430821],"study_design_scores_gemma":[0.00019692341,0.00002943323,0.0032305897,0.00004587009,0.000004986552,0.0000027811038,0.00001629213,0.013328165,0.00008987673,0.002985556,0.9799904,0.00007913144],"about_ca_topic_score_codex":0.000032824406,"about_ca_topic_score_gemma":0.00016378817,"teacher_disagreement_score":0.5612073,"about_ca_system_score_codex":0.0000113316855,"about_ca_system_score_gemma":0.00002163979,"threshold_uncertainty_score":0.20616108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004454875,0.000014797276,0.98382074,0.00020626803,0.00086375483,0.012488448,0.00009844753,0.00020060694,0.0023024809],"genre_scores_gemma":[0.035549298,0.0000055260593,0.9562012,0.0039748824,0.0012151028,0.0024481446,0.0005182988,0.0000700889,0.00001747987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950286,0.00008100213,0.0005013447,0.0024547225,0.0013125476,0.0006217512],"domain_scores_gemma":[0.9939295,0.00047478132,0.00039640858,0.004768062,0.00019245879,0.00023878728],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017259408,0.00055513484,0.00039910327,0.0013707156,0.00028612275,0.0008897512,0.0073311706,0.0003006617,0.0000586316],"category_scores_gemma":[0.00008242672,0.00049476704,0.00009837155,0.00078487536,0.00045674498,0.0026986005,0.0019502642,0.00094636803,0.000029350125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001143198,0.00022484403,0.000069927766,0.00010031375,0.000012105073,0.0001263662,0.00091673114,0.0051637967,0.00007382543,0.020265754,0.00009208752,0.97283995],"study_design_scores_gemma":[0.00051164546,0.0005476034,0.00025551967,0.00042498406,0.000006392433,0.0000113626265,2.245503e-7,0.95112485,0.00069234584,0.03795918,0.007771584,0.00069432956],"about_ca_topic_score_codex":0.000039763654,"about_ca_topic_score_gemma":0.00024329625,"teacher_disagreement_score":0.9721456,"about_ca_system_score_codex":0.00018810145,"about_ca_system_score_gemma":0.00033379812,"threshold_uncertainty_score":0.9997504},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005503493,0.0005755293,0.39387235,0.00014111928,0.00039515426,0.00012997675,0.000021078851,0.00032291148,0.60453635],"genre_scores_gemma":[0.020904914,0.007318595,0.46570984,0.0032449183,0.0020071515,0.00008757928,0.001116827,0.00025821687,0.49935198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809426,0.000019945406,0.00035219936,0.00077014905,0.000411786,0.00035167794],"domain_scores_gemma":[0.9978816,0.00005256764,0.0002011746,0.0014839662,0.00017303496,0.00020767585],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027965204,0.0003798815,0.0003134199,0.00037244317,0.00012643365,0.00033673,0.0016193517,0.0003935017,0.0024719147],"category_scores_gemma":[0.000018343393,0.00034300628,0.0002727807,0.000102572616,0.0001263086,0.0011105584,0.0006449903,0.00043466923,0.0016780928],"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.0000018196995,0.000024467103,0.000015380032,0.000018998253,0.000038334096,0.000008752511,0.000114213566,1.646223e-8,0.0000054184025,0.9770752,0.006722999,0.01597441],"study_design_scores_gemma":[0.00007615552,0.000041065166,0.000021850305,0.000025897521,0.000010264404,0.000009083268,0.0000016044122,0.00009592503,0.00004282379,0.38630548,0.61304224,0.00032760433],"about_ca_topic_score_codex":0.00003274729,"about_ca_topic_score_gemma":0.00005161848,"teacher_disagreement_score":0.60631925,"about_ca_system_score_codex":0.000029084697,"about_ca_system_score_gemma":0.000101943966,"threshold_uncertainty_score":0.9999022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030952314,0.002373239,0.99313927,0.0015505226,0.0006257719,0.0010403423,0.00023424735,0.00028303303,0.00044404253],"genre_scores_gemma":[0.2802506,0.00030051547,0.71606696,0.0020421355,0.0008180702,0.000119544275,0.0002669715,0.000088058725,0.000047143207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955446,0.000016602547,0.00055405044,0.002233535,0.0007177807,0.0009334131],"domain_scores_gemma":[0.99700147,0.0004565302,0.00029873196,0.0016449192,0.00032794153,0.00027039598],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006753583,0.0007130967,0.0006474246,0.00075022347,0.00050561345,0.0011183467,0.0032966372,0.0005829471,0.000010943952],"category_scores_gemma":[0.00010981842,0.0006285494,0.0002002816,0.0009782261,0.00091723324,0.0009045979,0.0015160226,0.0010081542,0.0000052189453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007306454,0.00015284159,0.00040318866,0.00032275653,0.00007250156,0.00011410096,0.00090075034,0.0020236436,0.0019162602,0.6660663,0.0009862158,0.3269684],"study_design_scores_gemma":[0.0005909367,0.00031571873,0.00021074254,0.00035987567,0.0000206699,0.000098279896,5.4678986e-7,0.28731823,0.0017680819,0.6888916,0.019259263,0.0011660341],"about_ca_topic_score_codex":0.000020258849,"about_ca_topic_score_gemma":0.00010038603,"teacher_disagreement_score":0.32580236,"about_ca_system_score_codex":0.00010963859,"about_ca_system_score_gemma":0.00028853683,"threshold_uncertainty_score":0.9999186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009917246,0.0005096651,0.98814654,0.00010383272,0.00050500064,0.0006625979,0.000016101332,0.000055260665,0.000083748964],"genre_scores_gemma":[0.3378931,0.000025023368,0.66180104,0.00007701939,0.00016919525,0.000005278128,0.00001234996,0.000013708881,0.0000033011015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997205,0.00005060795,0.0005232217,0.0010622346,0.00081847433,0.000340416],"domain_scores_gemma":[0.9978004,0.00025694908,0.0004408074,0.001057758,0.00033279532,0.00011125172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012131413,0.0003261202,0.00037708046,0.00071871554,0.00017925061,0.0002981651,0.0013181621,0.00024162722,0.000011097169],"category_scores_gemma":[0.00011317331,0.00031064593,0.00008482812,0.000429198,0.00049690343,0.0008139616,0.0010378899,0.00038188067,0.000006278934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001396367,0.000051579747,0.0005819346,0.00012384611,0.0000191281,0.000004440773,0.0025613524,0.04128929,0.0064139175,0.014457376,0.0000106092175,0.93447256],"study_design_scores_gemma":[0.00034728824,0.00005053157,0.00055775,0.00019701273,0.000014817571,0.000018641531,3.2174117e-7,0.96361727,0.0025851245,0.032142073,0.00015553208,0.00031363746],"about_ca_topic_score_codex":0.00010013539,"about_ca_topic_score_gemma":0.00002250802,"teacher_disagreement_score":0.9341589,"about_ca_system_score_codex":0.00012460505,"about_ca_system_score_gemma":0.00022350594,"threshold_uncertainty_score":0.99993455},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004553014,0.0009572499,0.9828461,0.0002851861,0.0027609228,0.00034241748,0.000020192538,0.00027615466,0.012466255],"genre_scores_gemma":[0.059639085,0.00016882132,0.93518746,0.0034055274,0.0012966923,0.0000078086205,0.000027567516,0.000056824298,0.00021023105],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949626,0.000033050113,0.0006382707,0.0019650704,0.0014344896,0.00096654205],"domain_scores_gemma":[0.99637556,0.0004544671,0.00030769277,0.0023067594,0.00025617096,0.00029934695],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015902577,0.0006231943,0.0006035611,0.001536295,0.00034824788,0.0009871668,0.005394429,0.00048190998,0.000091126996],"category_scores_gemma":[0.00008251807,0.00059069693,0.00024873967,0.0011185423,0.0009614276,0.0010007895,0.002175306,0.0009896569,0.00010670776],"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.000008043752,0.000054745648,0.000053449916,0.000038233233,0.000016247357,0.00033524222,0.0005491603,0.0011001587,0.00013505014,0.20627932,0.00015515638,0.7912752],"study_design_scores_gemma":[0.00061776454,0.00036944626,0.00036147557,0.0005031951,0.000024272562,0.00035078044,2.6417015e-7,0.09380897,0.004005126,0.86398685,0.0338296,0.0021422305],"about_ca_topic_score_codex":0.000043485656,"about_ca_topic_score_gemma":0.0002551109,"teacher_disagreement_score":0.78913295,"about_ca_system_score_codex":0.00017012647,"about_ca_system_score_gemma":0.00044590485,"threshold_uncertainty_score":0.9999869},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.179341e-8,0.00008177361,0.93603253,0.0019145985,0.0004180887,0.05853892,0.000010791385,0.00015988135,0.0028433322],"genre_scores_gemma":[0.00009473202,0.000004599768,0.9850426,0.0017510209,0.00082179636,0.012079076,0.0000043948553,0.000024884572,0.0001769082],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963519,0.000022318782,0.00049116596,0.0015150933,0.00087833096,0.0007411775],"domain_scores_gemma":[0.9966677,0.0006698337,0.00029247126,0.0019619653,0.00019589534,0.00021215739],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009432608,0.0005255236,0.00040826382,0.00043361523,0.0005226971,0.0011643061,0.005563546,0.0002788986,0.000026931797],"category_scores_gemma":[0.0000557976,0.00036106832,0.0002366654,0.00079120125,0.00046470595,0.0007249402,0.0010561679,0.00075488066,0.000016235357],"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.00001439086,0.000020770087,0.0000030803635,0.000031745047,0.000006979556,0.000008831956,0.00048319463,0.00122074,0.000008635279,0.18929541,0.0007538571,0.8081524],"study_design_scores_gemma":[0.0005407251,0.0003274142,0.000030937546,0.00023538893,0.0000069912303,0.00003562648,8.4560384e-8,0.08761281,0.00023789557,0.6808641,0.2296151,0.00049293163],"about_ca_topic_score_codex":0.00003831948,"about_ca_topic_score_gemma":0.0001286799,"teacher_disagreement_score":0.80765945,"about_ca_system_score_codex":0.00009734103,"about_ca_system_score_gemma":0.00093264336,"threshold_uncertainty_score":0.9998841},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008343577,0.00018144945,0.9888165,0.00022144492,0.0014289638,0.00057804433,0.00008670525,0.0002456481,0.007606893],"genre_scores_gemma":[0.37729266,0.000051629933,0.6193177,0.0014310976,0.0015602229,0.000034813766,0.000195798,0.00008172406,0.00003431863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99506503,0.000030075129,0.00045050326,0.00220707,0.0014991229,0.000748203],"domain_scores_gemma":[0.9972915,0.00024224959,0.00029097847,0.0016385232,0.0002824508,0.00025430767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044226993,0.0007228815,0.0005845653,0.0008236659,0.00044891314,0.00096673815,0.0041677016,0.00042513837,0.00013061418],"category_scores_gemma":[0.00002691773,0.0006106954,0.00015116899,0.00090437976,0.0009925326,0.0013855686,0.0011899327,0.001423617,0.000018292109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053832107,0.000047918384,0.00012842452,0.00003634118,0.00005573576,0.00015967534,0.0010052681,0.0028334383,0.000024756,0.94790995,0.00003336509,0.047711276],"study_design_scores_gemma":[0.00065141,0.00035943306,0.00030859857,0.0002460646,0.0000134852635,0.00013760632,2.7684646e-7,0.030219272,0.00043985754,0.96522707,0.0015258379,0.00087109394],"about_ca_topic_score_codex":0.0000339191,"about_ca_topic_score_gemma":0.00011220984,"teacher_disagreement_score":0.37645832,"about_ca_system_score_codex":0.00021836824,"about_ca_system_score_gemma":0.00078472745,"threshold_uncertainty_score":0.99963444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033454728,0.00008199573,0.9918225,0.00056644855,0.0014778449,0.005157889,0.000053065258,0.0002174054,0.00028830502],"genre_scores_gemma":[0.016875947,0.000008787803,0.9809749,0.0009113203,0.0006819211,0.00044722576,0.000049872935,0.00003786469,0.000012150093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952849,0.000044456534,0.00067246205,0.0018173119,0.001433857,0.00074697984],"domain_scores_gemma":[0.99656194,0.00031888852,0.00048642277,0.0019657619,0.00038294093,0.00028402195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000903026,0.0006785303,0.00056222844,0.0009243557,0.0006455337,0.0008249454,0.0034924163,0.0005371382,0.00007443622],"category_scores_gemma":[0.000066484594,0.0006435225,0.00023390769,0.00074386,0.00084719405,0.0011271988,0.0018292844,0.0016471732,0.000035458943],"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.00015780878,0.0017706207,0.0011735255,0.0011331951,0.00025639182,0.00061340816,0.008372486,0.096902266,0.012149473,0.65036213,0.00020770688,0.22690096],"study_design_scores_gemma":[0.0009105627,0.00030219494,0.0004596001,0.001010835,0.000015980762,0.00024172539,3.1240165e-7,0.6842503,0.0026152977,0.27976373,0.029044345,0.0013851325],"about_ca_topic_score_codex":0.00006261855,"about_ca_topic_score_gemma":0.0002862599,"teacher_disagreement_score":0.58734804,"about_ca_system_score_codex":0.00040610094,"about_ca_system_score_gemma":0.0006086844,"threshold_uncertainty_score":0.9996016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3016743,0.00020850812,0.69656247,0.00006124504,0.00041147176,0.00042519424,0.000052289182,0.00014038233,0.00046413287],"genre_scores_gemma":[0.95874774,0.0000031929092,0.040947553,0.000088815956,0.00012284059,0.0000353818,0.000031712058,0.000006942457,0.000015829228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986345,0.000104220046,0.00017522032,0.00048277227,0.00029775786,0.00030548414],"domain_scores_gemma":[0.9986091,0.00011320371,0.00004307542,0.00058409985,0.00026795515,0.00038255984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009095139,0.00013628256,0.00017821918,0.00012399559,0.00013671319,0.00032110553,0.00049560814,0.00006232384,0.000004870258],"category_scores_gemma":[0.00004126277,0.00011341888,0.000039297956,0.00036009972,0.00009210618,0.00039717276,0.00017053213,0.00010195262,0.000009483824],"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.00020904512,0.00079764216,0.00023495803,0.000054812186,0.000038981503,0.00001357098,0.003995091,0.00053108705,0.0013299563,0.9845787,0.0047723926,0.0034437522],"study_design_scores_gemma":[0.003163713,0.0009804966,0.000083099476,0.00001327353,0.0000071143904,0.000014170287,0.0011772648,0.98287225,0.0008002169,0.0011769825,0.009459603,0.00025183478],"about_ca_topic_score_codex":0.00013456795,"about_ca_topic_score_gemma":0.000008031854,"teacher_disagreement_score":0.9834017,"about_ca_system_score_codex":0.00002926552,"about_ca_system_score_gemma":0.00009560143,"threshold_uncertainty_score":0.46250877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003477586,0.00024664917,0.9862501,0.00027372054,0.0023993782,0.0007951831,0.000040810457,0.00026630334,0.009693057],"genre_scores_gemma":[0.02756742,0.000040288185,0.969255,0.0022864,0.00051284896,0.00006998524,0.000060827628,0.000051093346,0.00015617324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955019,0.000016752503,0.00050932664,0.0022552363,0.00079566386,0.0009211348],"domain_scores_gemma":[0.99648446,0.0002261139,0.00027100177,0.0025506264,0.00022405169,0.0002437646],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012700655,0.000567993,0.0004902673,0.0010851787,0.0003867863,0.0010744431,0.0062348316,0.00029740998,0.000052619063],"category_scores_gemma":[0.000035276626,0.00055251975,0.00024778701,0.0008005814,0.00046052752,0.0009627889,0.002159154,0.00054986996,0.000027968072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022093536,0.00006270075,0.000099360375,0.00018914984,0.000027910266,0.0000505756,0.0003783034,0.0028046842,0.000010933508,0.7867125,0.00025004233,0.2093917],"study_design_scores_gemma":[0.0005547028,0.00020786317,0.00007767652,0.00032315496,0.000017100827,0.000011912226,1.5564804e-7,0.27911127,0.0006355753,0.6820097,0.036208857,0.0008420225],"about_ca_topic_score_codex":0.000053693067,"about_ca_topic_score_gemma":0.00009455784,"teacher_disagreement_score":0.27630657,"about_ca_system_score_codex":0.00016608839,"about_ca_system_score_gemma":0.0002499937,"threshold_uncertainty_score":0.9999625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009211749,0.0007887184,0.994993,0.00053109636,0.0015510984,0.00040272495,0.000025987063,0.0001402634,0.001475034],"genre_scores_gemma":[0.11051861,0.00019793946,0.8862134,0.0019270111,0.000925474,0.000032257667,0.000026339949,0.000054331143,0.000104631035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674106,0.000024168181,0.00043005304,0.0016014377,0.0005386078,0.0006646688],"domain_scores_gemma":[0.9976544,0.00055359595,0.00020606042,0.001187295,0.00016468803,0.0002339556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080650795,0.000468299,0.0005055304,0.0006604563,0.00039995107,0.0006815077,0.0024069876,0.00035260044,0.000012699344],"category_scores_gemma":[0.000062745945,0.00042049328,0.00015440046,0.0004099506,0.0011465581,0.00075352256,0.0013479585,0.0006272995,0.000009630919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010172197,0.000025942596,0.000028801609,0.000052399868,0.000009908964,0.000022067474,0.00069448765,0.00003454925,0.000043361208,0.6826011,0.00011632247,0.31636092],"study_design_scores_gemma":[0.00031577182,0.00025047516,0.0001247478,0.0002293992,0.000010525691,0.00008930485,1.1537309e-7,0.18313934,0.00028942607,0.7925609,0.02236327,0.00062673626],"about_ca_topic_score_codex":0.000017803723,"about_ca_topic_score_gemma":0.000094898016,"teacher_disagreement_score":0.31573418,"about_ca_system_score_codex":0.000077957455,"about_ca_system_score_gemma":0.00031663818,"threshold_uncertainty_score":0.9998247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10061042,0.004766011,0.87554556,0.0035392179,0.00061607314,0.0010039733,0.00057164807,0.00027935317,0.013067728],"genre_scores_gemma":[0.995077,0.00017615674,0.0040493594,0.00064018695,0.000031609517,0.0000127999865,0.0000030610915,0.00000686866,0.000002958851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987404,0.000108041546,0.00019437037,0.00033986848,0.0003621575,0.00025516475],"domain_scores_gemma":[0.99855393,0.00037596453,0.00010888543,0.0008289295,0.000054903678,0.00007736521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021621252,0.00019149845,0.00016846159,0.00011196107,0.00034262933,0.0002872546,0.0010621236,0.0000919165,0.0000429981],"category_scores_gemma":[0.00003281839,0.00010234349,0.00025872793,0.0011485525,0.0003512545,0.0002854261,0.00022968459,0.0003043425,0.000004069637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005054101,0.00018823425,0.00068905955,0.000010912394,0.00004935967,0.0000032053329,0.0010322774,0.000002385842,0.00011035825,0.9525443,0.010031776,0.035333134],"study_design_scores_gemma":[0.0008018138,0.0005369643,0.0063062194,0.00012115464,0.000048458238,0.00004237737,0.0003546203,0.02886317,0.0030851287,0.9256269,0.03350898,0.000704226],"about_ca_topic_score_codex":0.000008030219,"about_ca_topic_score_gemma":0.0000030485783,"teacher_disagreement_score":0.8944666,"about_ca_system_score_codex":0.0000031701286,"about_ca_system_score_gemma":0.000007252676,"threshold_uncertainty_score":0.41734463},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09066278,0.4160518,0.003696308,0.41922864,0.0005947574,0.00072657433,0.0012711651,0.0003486829,0.067419305],"genre_scores_gemma":[0.5605496,0.34496546,0.090393774,0.0014863051,0.00015127547,0.00005045272,0.00010285097,0.00002567964,0.0022745926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983797,0.00034404927,0.00044091354,0.0003199419,0.0001675381,0.00034785355],"domain_scores_gemma":[0.99703383,0.00032797403,0.00012136848,0.0020486542,0.00028079428,0.00018735886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045736166,0.00018317184,0.0002703797,0.00015803608,0.000540019,0.00018952362,0.0011825889,0.00013311292,0.000871628],"category_scores_gemma":[0.00011239698,0.0002144291,0.00015184865,0.0009149198,0.0006953842,0.0010195412,0.00042145196,0.0003549058,0.00011078681],"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.0000095955365,0.0012701091,0.0008145202,0.00006684406,0.0001337877,0.000002078273,0.0074862638,0.000013430951,0.000028818662,0.4282668,0.031010484,0.53089726],"study_design_scores_gemma":[0.00015907353,0.000100776364,0.012710189,0.00012512684,0.000034582394,0.00003447575,0.00015864165,0.0055099055,0.00043903763,0.047522813,0.9329688,0.00023658348],"about_ca_topic_score_codex":0.002572649,"about_ca_topic_score_gemma":0.00092554087,"teacher_disagreement_score":0.9019583,"about_ca_system_score_codex":0.000005366427,"about_ca_system_score_gemma":0.00005755022,"threshold_uncertainty_score":0.9543715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007895581,0.00014389314,0.97871137,0.00014466516,0.0009092724,0.015436166,0.000025542677,0.00036390615,0.0041862573],"genre_scores_gemma":[0.043109003,0.000057684578,0.946672,0.0020505816,0.0013414951,0.0065301815,0.00004238845,0.00010797179,0.00008868931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99421334,0.000044692595,0.00068433845,0.0023982734,0.0016021355,0.0010571916],"domain_scores_gemma":[0.99566793,0.0002373234,0.00039444547,0.0029526511,0.00031708248,0.00043056018],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010134416,0.0007547574,0.0006230531,0.0011545314,0.0005717574,0.00084165146,0.005692757,0.00046135494,0.00009537481],"category_scores_gemma":[0.000046719386,0.0006874181,0.00021177578,0.001011463,0.0009898881,0.0010540566,0.0014003735,0.0011149616,0.000087546716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057355217,0.00069111644,0.00005548822,0.0002872458,0.00002693725,0.00082876446,0.004909005,0.037691835,0.0002906567,0.045699157,0.00053985824,0.90892255],"study_design_scores_gemma":[0.0017796345,0.0011878079,0.0015505936,0.00085004856,0.000016817121,0.0005714563,5.282289e-7,0.7860016,0.0035608753,0.12069534,0.080545835,0.003239452],"about_ca_topic_score_codex":0.00005901775,"about_ca_topic_score_gemma":0.00011991073,"teacher_disagreement_score":0.9056831,"about_ca_system_score_codex":0.00022777078,"about_ca_system_score_gemma":0.00069898064,"threshold_uncertainty_score":0.9996869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052255593,0.0005087866,0.9901675,0.00016424381,0.0033480802,0.00034504072,0.0000680052,0.00021676249,0.0051293327],"genre_scores_gemma":[0.64194685,0.00022497938,0.35063222,0.0038908531,0.0026011884,0.000028669803,0.0003732682,0.0001035724,0.00019839044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959957,0.000031579282,0.00049150747,0.0015298764,0.0012485321,0.0007027951],"domain_scores_gemma":[0.9969713,0.0005689279,0.0002538561,0.0017808008,0.00020574448,0.00021934969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012713713,0.0004925263,0.00043834109,0.0007303281,0.00029774656,0.0007688274,0.0031979885,0.00039291795,0.000010947519],"category_scores_gemma":[0.00008775543,0.00044328367,0.00015237043,0.0008708426,0.00055682106,0.00057108805,0.00090805424,0.000924586,0.000088507964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000756668,0.000033462336,0.000013610771,0.000028583561,0.0000062425156,0.00008935714,0.0001608273,0.005578273,0.000007765055,0.81971514,0.0001355693,0.17422362],"study_design_scores_gemma":[0.00042120228,0.00047748743,0.00023629448,0.0008606384,0.000010845358,0.00013144777,1.6593665e-7,0.36693072,0.0004026583,0.6029498,0.026253788,0.0013249435],"about_ca_topic_score_codex":0.0000402885,"about_ca_topic_score_gemma":0.000046484904,"teacher_disagreement_score":0.64189464,"about_ca_system_score_codex":0.00029999774,"about_ca_system_score_gemma":0.00024457087,"threshold_uncertainty_score":0.9998019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016345724,0.0002875131,0.9941265,0.00083213876,0.0024391066,0.0003867931,0.000032473396,0.00030894045,0.0014230809],"genre_scores_gemma":[0.22208975,0.000036082107,0.7739437,0.0029669001,0.000810737,0.000016259983,0.0000649493,0.00004516712,0.000026412827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955986,0.000025435069,0.0005140413,0.0018643317,0.001214293,0.00078328385],"domain_scores_gemma":[0.9963298,0.00039986058,0.00028907333,0.0024434135,0.00027472677,0.0002631183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011060792,0.0006060458,0.00051714526,0.001103757,0.000402919,0.0008386754,0.0046541886,0.00064350857,0.00006728172],"category_scores_gemma":[0.000068272886,0.000565796,0.00024268593,0.00093278295,0.0010041272,0.000894539,0.0012097813,0.0017463225,0.000083407394],"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.000024977353,0.0001850527,0.00054070697,0.00011678456,0.000023795048,0.0002703188,0.0005796808,0.010410912,0.0033163878,0.46766067,0.00012995563,0.5167408],"study_design_scores_gemma":[0.0006108099,0.00029073333,0.00044746953,0.000328081,0.00001493784,0.00005084027,6.327869e-8,0.30685064,0.010034088,0.6693547,0.010606593,0.0014110872],"about_ca_topic_score_codex":0.000020577167,"about_ca_topic_score_gemma":0.00017779936,"teacher_disagreement_score":0.5153297,"about_ca_system_score_codex":0.00014518706,"about_ca_system_score_gemma":0.00066497567,"threshold_uncertainty_score":0.9996793},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074770255,0.000740048,0.99033666,0.0019645216,0.0012116975,0.00076089974,0.0000868535,0.00024720017,0.0039043953],"genre_scores_gemma":[0.07713414,0.0001108574,0.913584,0.0073966673,0.0013034915,0.000019723582,0.0000832469,0.0000664097,0.000301494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933122,0.0000520266,0.0006958656,0.0029238367,0.0019135516,0.0011025146],"domain_scores_gemma":[0.99549466,0.0003570308,0.0003581407,0.0029387858,0.00034100004,0.0005104086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006842424,0.0009734763,0.00085035415,0.0009910017,0.0003661693,0.0009922903,0.0053797043,0.0003952851,0.00010710815],"category_scores_gemma":[0.000050526156,0.0008199803,0.0001896056,0.0016615562,0.00047227164,0.0010822205,0.0018951166,0.0010158836,0.00017411039],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000653195,0.0001578988,0.00027582483,0.000035853576,0.000052935884,0.00042143275,0.0016237596,0.005412642,0.00026770262,0.019774934,0.0009579178,0.97095376],"study_design_scores_gemma":[0.0045151175,0.005548126,0.0088744145,0.007034416,0.00017302234,0.00047074546,0.0000040947934,0.14227356,0.010009805,0.55603147,0.25488758,0.010177636],"about_ca_topic_score_codex":0.00026059494,"about_ca_topic_score_gemma":0.00082998973,"teacher_disagreement_score":0.96077615,"about_ca_system_score_codex":0.00017648608,"about_ca_system_score_gemma":0.00054617086,"threshold_uncertainty_score":0.9996919},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002996581,0.00025440173,0.99057794,0.0020768568,0.0018362921,0.00040225097,0.00055242423,0.00021970247,0.004050155],"genre_scores_gemma":[0.12604654,0.00024530975,0.85336244,0.016869962,0.0017942337,0.000024346155,0.0011666275,0.00012836228,0.0003621853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482757,0.00005768677,0.0006778544,0.0021707811,0.0014708916,0.0007952308],"domain_scores_gemma":[0.99664783,0.00059899804,0.00016258124,0.0019596438,0.00022624199,0.00040468227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074416667,0.00071663153,0.00056340767,0.00089660764,0.00033486393,0.00070060324,0.0035820042,0.0004890473,0.000059098355],"category_scores_gemma":[0.000105757455,0.0006591347,0.0002648066,0.0012312799,0.00047802113,0.00071187573,0.00044170037,0.0012655563,0.000068256726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006735236,0.00012068984,0.000015388361,0.000037174625,0.00003847773,0.0003269925,0.00088826055,0.013421086,0.00004005074,0.7590229,0.004789143,0.2212325],"study_design_scores_gemma":[0.0015342544,0.00066746405,0.00030518018,0.00058185705,0.000020440079,0.00014816195,1.7948649e-7,0.018413661,0.0009509249,0.921963,0.05385612,0.0015587633],"about_ca_topic_score_codex":0.00003161705,"about_ca_topic_score_gemma":0.00020649651,"teacher_disagreement_score":0.21967374,"about_ca_system_score_codex":0.00022984933,"about_ca_system_score_gemma":0.00081021665,"threshold_uncertainty_score":0.999586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25853467,0.000006156709,0.74070716,0.00017091147,0.000098995195,0.0002254521,0.00004041174,0.000016017577,0.00020024188],"genre_scores_gemma":[0.7565341,0.000011116267,0.24341232,0.000014097844,0.000008612914,0.000010146868,0.0000064541205,0.000002626203,5.0595855e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846625,0.000058663172,0.0004301377,0.0003098293,0.00048312664,0.00025198798],"domain_scores_gemma":[0.9983921,0.00032618918,0.0002008682,0.00075475156,0.0002633119,0.000062782805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095172174,0.00011192984,0.0002106177,0.00007367864,0.00022317815,0.00003949737,0.0015676046,0.000040781873,0.0000070115375],"category_scores_gemma":[0.00022068816,0.00007909417,0.000113618065,0.0013849565,0.0024173376,0.00043765063,0.0004473734,0.000099400306,0.0000017219483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004352984,0.00010541794,0.0007175927,0.000053371677,0.0000029497423,2.8536368e-7,0.0015652855,0.000024875864,0.00032410002,0.99641347,0.000020801665,0.00076749123],"study_design_scores_gemma":[0.00028781677,0.00005036082,0.005887743,0.00013985106,0.000007832261,0.0000174014,0.00008105328,0.2704294,0.009339438,0.71355754,0.000052608855,0.00014893798],"about_ca_topic_score_codex":0.0000048857364,"about_ca_topic_score_gemma":0.0000011110382,"teacher_disagreement_score":0.49799946,"about_ca_system_score_codex":0.000027022994,"about_ca_system_score_gemma":0.000112127986,"threshold_uncertainty_score":0.8906781},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005458982,0.0005152735,0.9891175,0.0005198932,0.0013313914,0.00036681985,0.000016938138,0.00008739419,0.007498884],"genre_scores_gemma":[0.717142,0.00028940322,0.27468535,0.0067179324,0.0009039573,0.000013167221,0.000019901596,0.00007592509,0.00015237993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961746,0.000054885983,0.00056657544,0.0012722242,0.001291762,0.00064000307],"domain_scores_gemma":[0.99509025,0.0018559357,0.00036453872,0.0023369922,0.00020303679,0.00014925364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015648268,0.00050009246,0.00048326163,0.00093024445,0.00026648317,0.00028602887,0.005143004,0.00029764025,0.0000449778],"category_scores_gemma":[0.0001399454,0.00034818775,0.00022692398,0.0011300321,0.0012451349,0.0003444057,0.0013139689,0.0010398438,0.000053093496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009051979,0.00006778716,0.000058881422,0.000035622295,0.000012919718,0.00004235548,0.00070139096,0.0019331988,0.0000668187,0.7867328,0.000089624446,0.21024956],"study_design_scores_gemma":[0.00029179186,0.00045766003,0.00048970006,0.0006284282,0.000013324304,0.000036858062,3.3778787e-7,0.10686913,0.0038619922,0.8813553,0.0051402743,0.0008552245],"about_ca_topic_score_codex":0.000021738246,"about_ca_topic_score_gemma":0.00009579879,"teacher_disagreement_score":0.71659607,"about_ca_system_score_codex":0.00008533469,"about_ca_system_score_gemma":0.00022839686,"threshold_uncertainty_score":0.999897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46096858,0.00006734686,0.5373709,0.000011246373,0.0001255312,0.00005993227,0.0000010609226,0.00017445737,0.0012208989],"genre_scores_gemma":[0.744587,0.000002281398,0.25525627,0.00012199298,0.00002630046,6.364801e-7,7.6806873e-7,0.000004531559,2.384487e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980654,0.00036820184,0.00047840437,0.00041941946,0.00025875113,0.00040983525],"domain_scores_gemma":[0.9978964,0.00047896436,0.00029260435,0.0010991673,0.00011126787,0.000121644334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025138075,0.00017561259,0.00028975162,0.00020524331,0.00021145817,0.000039007708,0.0023315132,0.000051949668,0.000008409],"category_scores_gemma":[0.000085927786,0.00016738384,0.00016121531,0.0007044252,0.00023866004,0.00079631107,0.0010042267,0.0001668896,0.0000024024332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037726662,0.00014188817,0.0036609443,0.00001913595,0.000023982058,0.0000080364025,0.027133064,0.000013298908,0.000714602,0.9149528,0.0000035014857,0.053290978],"study_design_scores_gemma":[0.0004325393,0.00018330323,0.08251051,0.000052846546,0.000008578004,0.000027827027,0.00058565487,0.0067511555,0.026774088,0.88242394,0.000013175353,0.00023637546],"about_ca_topic_score_codex":0.000041865656,"about_ca_topic_score_gemma":0.0000024801848,"teacher_disagreement_score":0.2836184,"about_ca_system_score_codex":0.0000059068916,"about_ca_system_score_gemma":0.000028848464,"threshold_uncertainty_score":0.68257153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115060866,0.00008783363,0.8831799,0.00018858699,0.00019036408,0.0003623648,0.000016097909,0.000068433365,0.000845568],"genre_scores_gemma":[0.9949425,0.000014619318,0.004607986,0.00034864622,0.00001896024,0.000010935815,0.000054103326,0.0000015706212,7.122149e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917215,0.000037160273,0.00030755217,0.00014842056,0.00020140968,0.00013330144],"domain_scores_gemma":[0.99944943,0.000044401928,0.00020054921,0.00011703382,0.00011729882,0.000071260336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019261907,0.000116102165,0.00011639031,0.00017351544,0.00015466564,0.00045701422,0.00011434886,0.00003176612,0.0000012568158],"category_scores_gemma":[0.000009974627,0.0001060345,0.00002293623,0.00022193228,0.000027101005,0.003518048,0.000058066133,0.00008427701,0.0000071876525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013826876,0.00007968467,0.00014458294,0.000060458762,0.000027725493,0.000002385811,0.010809829,0.0007033224,0.00013019145,0.80416614,0.0006817077,0.1830557],"study_design_scores_gemma":[0.00091548846,0.00044828138,0.010902107,0.000048276015,0.000007289435,0.000013285524,0.0012095483,0.9687996,0.0001426285,0.016379328,0.0009556821,0.00017848288],"about_ca_topic_score_codex":0.000056501092,"about_ca_topic_score_gemma":0.000004836559,"teacher_disagreement_score":0.96809626,"about_ca_system_score_codex":0.000026663944,"about_ca_system_score_gemma":0.000022267697,"threshold_uncertainty_score":0.44069988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002006356,0.00019524913,0.9935179,0.00030764425,0.0016704097,0.00033954205,0.00005743765,0.00021936723,0.0016861204],"genre_scores_gemma":[0.40914387,0.000015268075,0.5897964,0.00019888827,0.0007651435,0.0000041805365,0.00002801941,0.00003237438,0.000015849035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596936,0.00005070074,0.00059681013,0.0017414427,0.0008846392,0.00075702806],"domain_scores_gemma":[0.9976052,0.0004620225,0.00023997325,0.0012898725,0.0002047817,0.00019816738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006382355,0.0005878959,0.00058509747,0.001453488,0.00054173335,0.0010022002,0.0030893097,0.0003551366,0.000012650264],"category_scores_gemma":[0.00003895181,0.00059709244,0.00026523325,0.0011176086,0.0009346371,0.0018124754,0.0008855346,0.0013670333,0.0000108491895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016812843,0.00012398437,0.0003018169,0.000070510585,0.00009053656,0.00021255962,0.004276278,0.26359743,0.00057282863,0.032069318,0.00014338897,0.69852453],"study_design_scores_gemma":[0.00075571204,0.000490645,0.0008449837,0.0012241909,0.00010368519,0.00035026253,0.0000023211421,0.7522577,0.0034809883,0.23492722,0.0028687525,0.002693556],"about_ca_topic_score_codex":0.00020546971,"about_ca_topic_score_gemma":0.000101252364,"teacher_disagreement_score":0.695831,"about_ca_system_score_codex":0.00035516298,"about_ca_system_score_gemma":0.0004738257,"threshold_uncertainty_score":0.99964803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024415203,0.00017049373,0.9966032,0.00022470942,0.0009140148,0.0008790215,0.000068103036,0.00017142134,0.0007249125],"genre_scores_gemma":[0.800207,0.000012326517,0.19904722,0.00032163502,0.00031811438,0.000032854343,0.000032076383,0.000022555621,0.0000061609417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961566,0.000036984184,0.0007275869,0.001618892,0.0009642323,0.00049570616],"domain_scores_gemma":[0.9959428,0.00044480356,0.00053170376,0.0024472766,0.00038170852,0.00025174159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000904662,0.00046568693,0.0005655505,0.0011087563,0.00014809698,0.00046684864,0.0042833188,0.0002750588,0.0000069490807],"category_scores_gemma":[0.00006857994,0.00043777557,0.00011901962,0.00085615506,0.00036342096,0.0013828467,0.00088853826,0.00062511675,0.000029233497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002650271,0.00020772869,0.000026218004,0.00010605835,0.000017406483,0.000018007562,0.0017974238,0.060436156,0.00054281723,0.1946137,0.000019870919,0.7421881],"study_design_scores_gemma":[0.00018062785,0.0003359129,0.0006222217,0.0003519396,0.0000073432598,0.000025750945,6.2062406e-7,0.93529683,0.0014185086,0.059216917,0.0020122558,0.00053109514],"about_ca_topic_score_codex":0.00011538942,"about_ca_topic_score_gemma":0.000115135976,"teacher_disagreement_score":0.87486064,"about_ca_system_score_codex":0.00017013916,"about_ca_system_score_gemma":0.0003158278,"threshold_uncertainty_score":0.9998074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015548132,0.00007410474,0.97326887,0.00018999014,0.0018450142,0.011943501,0.000022880697,0.00017325573,0.01246683],"genre_scores_gemma":[0.011840999,0.0000055367527,0.979907,0.0017430043,0.0006065952,0.0054042335,0.000025438658,0.00006813776,0.00039906986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960666,0.000045354755,0.0007763813,0.0015099437,0.0010178908,0.0005838724],"domain_scores_gemma":[0.9965807,0.00033974543,0.00044092519,0.0019929062,0.00041904746,0.00022666696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064328924,0.000518305,0.0005915467,0.0026468884,0.00012371644,0.00024997612,0.0037356724,0.0002518218,0.000065138884],"category_scores_gemma":[0.00008001869,0.00050640595,0.0002575613,0.0015219394,0.00078616996,0.0010227946,0.0013419942,0.00085529813,0.00001612182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089339665,0.00057152245,0.00036301214,0.00044602202,0.00005544223,0.000115508665,0.0033097595,0.020420024,0.0011146279,0.24096908,0.014390913,0.7181547],"study_design_scores_gemma":[0.0014160426,0.0010544347,0.002274092,0.0018636177,0.000036843627,0.00012932986,6.207163e-7,0.106606625,0.0016204377,0.3758319,0.50639206,0.0027739913],"about_ca_topic_score_codex":0.00019586184,"about_ca_topic_score_gemma":0.00055285764,"teacher_disagreement_score":0.7153808,"about_ca_system_score_codex":0.0005594984,"about_ca_system_score_gemma":0.00091662846,"threshold_uncertainty_score":0.99973875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012423152,0.0061370376,0.99112827,0.00018845976,0.0012013894,0.00088348944,0.000022327229,0.00013275146,0.0001820448],"genre_scores_gemma":[0.04096072,0.00030702262,0.9567338,0.001260331,0.00044906014,0.00011696691,0.0001236821,0.00003551823,0.000012860703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996497,0.000035477555,0.00058532145,0.0015330225,0.0006981517,0.00065103936],"domain_scores_gemma":[0.9974337,0.0005204752,0.00029679798,0.0014042645,0.00023475746,0.00011000364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012058868,0.00044904056,0.0004695624,0.0010730077,0.00023025731,0.00068228523,0.003060064,0.00037991174,0.0000072320145],"category_scores_gemma":[0.00005997763,0.00045659134,0.00019302448,0.0012012112,0.00045666678,0.0012940877,0.00064575765,0.00064544776,0.0000070582228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002393951,0.00012727696,0.00018692082,0.0001377763,0.000008047242,0.000030848452,0.00039423455,0.22158009,0.000040036623,0.12831062,0.00022147429,0.6489387],"study_design_scores_gemma":[0.0005128832,0.0001891953,0.00021806774,0.00040219384,0.0000070327214,0.000006423104,1.6922452e-7,0.7102231,0.00021948258,0.26864287,0.01894205,0.00063656585],"about_ca_topic_score_codex":0.00001969981,"about_ca_topic_score_gemma":0.00068633974,"teacher_disagreement_score":0.64830214,"about_ca_system_score_codex":0.00021034679,"about_ca_system_score_gemma":0.0003793209,"threshold_uncertainty_score":0.9997886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008240019,0.00016366228,0.9936676,0.0010437221,0.001728243,0.00036289665,0.0012912181,0.00024708177,0.001413194],"genre_scores_gemma":[0.6515327,0.0003311463,0.33204892,0.0069765975,0.0018047072,0.00005418229,0.0069659315,0.00013211288,0.00015368983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953527,0.000048861086,0.00054753444,0.001860575,0.0013971515,0.0007931765],"domain_scores_gemma":[0.9970139,0.0004787826,0.0003241645,0.0016244304,0.00027214855,0.0002865706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005085797,0.0006669628,0.00049834495,0.0005627325,0.0004460523,0.0007270001,0.0033311357,0.0004185204,0.000114594055],"category_scores_gemma":[0.000111849906,0.00063011626,0.00025595343,0.0010038178,0.00075747474,0.0008396365,0.0009852392,0.0011540808,0.00009903096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020621601,0.00017875331,0.00006961117,0.00004801735,0.000031332984,0.00021781882,0.00029341743,0.049876194,0.000013141078,0.89240164,0.002571603,0.054277826],"study_design_scores_gemma":[0.0007446227,0.00042959966,0.00078267086,0.00070294534,0.00001923866,0.000109145054,1.7996689e-7,0.31963712,0.00022247212,0.662638,0.013305764,0.001408263],"about_ca_topic_score_codex":0.00001537772,"about_ca_topic_score_gemma":0.000050120572,"teacher_disagreement_score":0.66161865,"about_ca_system_score_codex":0.00046381177,"about_ca_system_score_gemma":0.00022896014,"threshold_uncertainty_score":0.999615},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05047813,0.0020510005,0.9431865,0.002039474,0.00024708235,0.0014288914,0.00015744702,0.00037008084,0.00004139686],"genre_scores_gemma":[0.7162997,0.000031153235,0.28312394,0.00023059647,0.000109038854,0.00008921425,0.000055428834,0.000014409911,0.000046520614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972373,0.0002638397,0.00052845094,0.0009825453,0.00040692274,0.0005808923],"domain_scores_gemma":[0.99730587,0.00022996792,0.00018519632,0.0010148822,0.00050352764,0.0007605667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001590871,0.00029474244,0.00039160726,0.00022772221,0.0005714318,0.00054603233,0.0009824232,0.00018994781,0.0000025008205],"category_scores_gemma":[0.0002900646,0.00029129596,0.0000530102,0.0010231172,0.000044648044,0.000884201,0.0010252604,0.0003062146,0.000017551693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031685995,0.0044529233,0.33756992,0.00801552,0.0002795653,0.00006258492,0.036946002,0.015915927,0.007698979,0.49828982,0.035177212,0.055274684],"study_design_scores_gemma":[0.0020555549,0.00015557236,0.022622496,0.00019620782,0.00001947903,0.000024423192,0.0008845316,0.96466196,0.0005066534,0.00038916434,0.0078836,0.0006003648],"about_ca_topic_score_codex":0.000910439,"about_ca_topic_score_gemma":0.0002810227,"teacher_disagreement_score":0.948746,"about_ca_system_score_codex":0.00010167454,"about_ca_system_score_gemma":0.00015490547,"threshold_uncertainty_score":0.9999539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008563199,0.00030047732,0.99543005,0.0004836276,0.00084140734,0.00030596563,0.000049376482,0.00015598933,0.0015767604],"genre_scores_gemma":[0.87408847,0.000036011625,0.12379339,0.001720201,0.00030118864,0.0000030050649,0.000028083472,0.000022614362,0.000007016979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644613,0.00003499457,0.00047271344,0.0015704348,0.00088268623,0.00059301365],"domain_scores_gemma":[0.9981542,0.0004915974,0.00011238075,0.00090462784,0.00012681511,0.00021032787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006505312,0.0005249671,0.0004891261,0.00085865636,0.00033719977,0.000674405,0.0020240247,0.00026950781,0.00003350734],"category_scores_gemma":[0.000033129476,0.00049411313,0.00015037472,0.00043207212,0.0009574289,0.0006166409,0.0008120234,0.0009538942,0.00001911308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075162243,0.000049642196,0.0000491931,0.000042514104,0.00001546895,0.000090312285,0.0009153342,0.010190431,0.000027422087,0.7660505,0.000011507367,0.22255015],"study_design_scores_gemma":[0.0008037727,0.00054378866,0.0011042807,0.0010169012,0.00001294445,0.00015694022,4.1843938e-7,0.120490335,0.0006009179,0.8736416,0.0006154809,0.0010126142],"about_ca_topic_score_codex":0.000022334905,"about_ca_topic_score_gemma":0.000052476178,"teacher_disagreement_score":0.8732322,"about_ca_system_score_codex":0.00017409962,"about_ca_system_score_gemma":0.000315653,"threshold_uncertainty_score":0.99975103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019764308,0.00042469575,0.99349326,0.00023803642,0.0010097101,0.0010386112,0.000016246355,0.00010586919,0.003653837],"genre_scores_gemma":[0.063261986,0.00002290213,0.93531346,0.0010245345,0.00031944222,0.000016487096,0.000004919272,0.000024272309,0.000011981699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957392,0.00009100252,0.00068937667,0.0014420935,0.0013284391,0.0007098696],"domain_scores_gemma":[0.99598134,0.0006685041,0.00036166355,0.0025223338,0.00025491265,0.00021123941],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029634282,0.0005021483,0.00058974006,0.000990452,0.00026035187,0.0004199986,0.0067402828,0.0002950944,0.0000045441698],"category_scores_gemma":[0.000109408706,0.0003570679,0.00017180316,0.0016531023,0.00057622476,0.00041612095,0.0019073325,0.0007164347,0.00002317774],"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.000030125773,0.00010532465,0.00003110589,0.00011117238,0.000032006184,0.00002726699,0.0039299247,0.10607707,0.0002660717,0.6703098,0.00014630618,0.21893382],"study_design_scores_gemma":[0.00047276678,0.00046557302,0.00019598525,0.00061323465,0.000017948916,0.00013480482,0.0000010479969,0.7205825,0.00270463,0.2579468,0.015579184,0.0012855355],"about_ca_topic_score_codex":0.000036245532,"about_ca_topic_score_gemma":0.000029836656,"teacher_disagreement_score":0.6145054,"about_ca_system_score_codex":0.0001046216,"about_ca_system_score_gemma":0.00031548613,"threshold_uncertainty_score":0.9998881},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014454017,0.00051551434,0.993318,0.00039354878,0.0013425933,0.0002787478,0.000024497316,0.00013689479,0.003845648],"genre_scores_gemma":[0.12308282,0.00014263518,0.87313205,0.0029326174,0.0005755098,0.000004127451,0.000022680279,0.000045707126,0.00006184343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956692,0.000029689234,0.000718498,0.001487093,0.0013569036,0.00073862],"domain_scores_gemma":[0.99650115,0.0006729626,0.0004321167,0.0019502543,0.00022105323,0.000222455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001431177,0.0005397909,0.00064189575,0.0011691916,0.0001745878,0.00033530197,0.0045613283,0.00043711858,0.000047464975],"category_scores_gemma":[0.00010288513,0.0004381865,0.00022484674,0.0010205418,0.0009471883,0.00089620694,0.0019103537,0.0009931352,0.000013281699],"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.00004465688,0.00009133138,0.00024255492,0.00018561675,0.000046713514,0.00036796517,0.005400093,0.002622814,0.00022128073,0.26586434,0.000063529566,0.7248491],"study_design_scores_gemma":[0.0011536661,0.0008210882,0.0011724324,0.0020951284,0.000053321222,0.00039294348,0.0000015657868,0.2054495,0.006777337,0.7438471,0.035373695,0.0028622393],"about_ca_topic_score_codex":0.00005990191,"about_ca_topic_score_gemma":0.00024137468,"teacher_disagreement_score":0.72198683,"about_ca_system_score_codex":0.000110527384,"about_ca_system_score_gemma":0.00047137123,"threshold_uncertainty_score":0.999807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33718216,0.00009272808,0.6616385,0.00008044201,0.00011204686,0.000070294474,0.00008600178,0.0001937723,0.00054406794],"genre_scores_gemma":[0.58388555,0.0000053418767,0.41557506,0.00014464145,0.0001602724,2.1845497e-7,0.00021406278,0.0000079561805,0.0000068775435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847656,0.000047459496,0.00020357138,0.0006412313,0.00031118284,0.00031997266],"domain_scores_gemma":[0.99801797,0.00002583819,0.000018367195,0.0017844677,0.000049171285,0.00010416541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033010464,0.00014568136,0.00013202794,0.00009983891,0.00015965741,0.0003322747,0.00201281,0.00008693412,0.00007948929],"category_scores_gemma":[0.000007753512,0.0001331157,0.000047908157,0.0006514033,0.00006059345,0.0025185025,0.00042530752,0.00016092749,0.000012002479],"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.00006112806,0.0010131336,0.002144421,0.000032070046,0.000038100356,0.00011260527,0.0005499186,0.0006353571,0.021850005,0.9670921,0.0048810327,0.0015901192],"study_design_scores_gemma":[0.0009891959,0.00017603548,0.0022788206,0.000017690689,0.000025943036,0.00012633011,0.00007056412,0.9597481,0.009754094,0.0073752287,0.018667893,0.0007700871],"about_ca_topic_score_codex":0.00039750364,"about_ca_topic_score_gemma":0.00012876395,"teacher_disagreement_score":0.95971686,"about_ca_system_score_codex":0.000011075422,"about_ca_system_score_gemma":0.00006492357,"threshold_uncertainty_score":0.54283005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022335052,0.0001426313,0.97977585,0.013396288,0.00016811179,0.0004366342,0.00008502366,0.00051386654,0.0032480774],"genre_scores_gemma":[0.9509401,0.0000019865631,0.044458706,0.0042880946,0.00018522305,0.000045179226,0.000028974833,0.000012244384,0.00003951949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980793,0.00017305253,0.00026650185,0.0005156528,0.0004645499,0.0005009488],"domain_scores_gemma":[0.9983577,0.00008438902,0.00016493961,0.00067827647,0.00020663314,0.000508045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007049698,0.00020975401,0.00033838165,0.00023718095,0.00017391209,0.0003821514,0.0010807194,0.00006228713,0.00001439673],"category_scores_gemma":[0.0000406977,0.00015271359,0.00008466641,0.001157889,0.00005619621,0.0007593962,0.00013132222,0.0001681949,0.000022524224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005296006,0.00033302148,0.010202157,0.00047119087,0.000100738944,0.000073965355,0.0023417766,0.00024319266,0.000009769571,0.8601346,0.117341004,0.008218958],"study_design_scores_gemma":[0.017604545,0.0033669686,0.0031772822,0.0006102366,0.000035527726,0.00022371649,0.0012635546,0.87389004,0.000118200376,0.0051797596,0.0929665,0.0015636906],"about_ca_topic_score_codex":0.00497624,"about_ca_topic_score_gemma":0.0019043788,"teacher_disagreement_score":0.94870657,"about_ca_system_score_codex":0.00014632427,"about_ca_system_score_gemma":0.0014900742,"threshold_uncertainty_score":0.75226194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008442632,0.00008821121,0.99648744,0.0007429355,0.00038298327,0.00029889104,0.00003084735,0.000074609175,0.0010498449],"genre_scores_gemma":[0.4065205,0.000025749023,0.5893321,0.003644052,0.0003401224,0.000009602214,0.00009191916,0.000020774087,0.000015175989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971353,0.00004352254,0.00073953706,0.00069991994,0.000936142,0.00044559868],"domain_scores_gemma":[0.997904,0.00040786047,0.00036518768,0.0010068663,0.00018066072,0.00013543348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093497493,0.00033443252,0.0004381371,0.001510426,0.000092491464,0.0002753367,0.0023988069,0.00029143694,0.000046403897],"category_scores_gemma":[0.00012400936,0.00033056719,0.00013862234,0.0007953513,0.00085290516,0.001434865,0.0007082943,0.0008009805,0.000040951145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005036508,0.000102600075,0.0000888117,0.00014057603,0.000008826849,0.000046466517,0.0017854677,0.049751643,0.0001750075,0.067714,0.00011585207,0.8800204],"study_design_scores_gemma":[0.0007030271,0.00016047772,0.00023618145,0.00047208995,0.0000056672447,0.000024182924,1.5935312e-7,0.92563635,0.0014523874,0.06645615,0.004321279,0.0005320291],"about_ca_topic_score_codex":0.000039455517,"about_ca_topic_score_gemma":0.000057580175,"teacher_disagreement_score":0.87948835,"about_ca_system_score_codex":0.000113611866,"about_ca_system_score_gemma":0.00060307543,"threshold_uncertainty_score":0.99991465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000114384435,0.00050466874,0.9836693,0.0009851765,0.0044133104,0.00040368518,0.00002558851,0.00038555212,0.009498378],"genre_scores_gemma":[0.25246313,0.00051706366,0.7302588,0.010410282,0.0052203718,0.000037032696,0.00030576324,0.00015017786,0.0006373362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483496,0.000041260133,0.0006606185,0.0019171576,0.0015199041,0.0010260991],"domain_scores_gemma":[0.9962477,0.00052909285,0.00036946803,0.0019673686,0.0004628282,0.00042350419],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001144985,0.0006445606,0.0005105608,0.0018889992,0.0006438584,0.0017054401,0.0037600554,0.0005858165,0.00016026363],"category_scores_gemma":[0.00028903762,0.0006231419,0.0002052736,0.0017225192,0.0007238481,0.0035476894,0.0015172716,0.0012886112,0.00036931774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062130794,0.00007177324,0.00009316788,0.000019983865,0.000016118744,0.00005970031,0.00043595483,0.0007831446,0.000095695556,0.7853652,0.000121826444,0.21293119],"study_design_scores_gemma":[0.00030791637,0.00029015835,0.00016481229,0.00015216513,0.000012527386,0.00013233296,7.192468e-7,0.025996538,0.00079308706,0.8970911,0.07403311,0.0010255399],"about_ca_topic_score_codex":0.00013856546,"about_ca_topic_score_gemma":0.00012450309,"teacher_disagreement_score":0.25341043,"about_ca_system_score_codex":0.00032248785,"about_ca_system_score_gemma":0.0010149735,"threshold_uncertainty_score":0.999622},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036005832,0.00015942892,0.9916505,0.0015536014,0.0005976417,0.00041235366,0.0011235287,0.00034195356,0.00056036393],"genre_scores_gemma":[0.92280287,0.00012786037,0.076572224,0.00007356398,0.000025583684,0.000113192895,0.000211655,0.000008190268,0.000064838845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988019,0.000010703068,0.0002618276,0.0005942303,0.00010404301,0.0002272957],"domain_scores_gemma":[0.9987562,0.00011264164,0.0000969295,0.0004989949,0.0004769102,0.000058370508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015823159,0.00016054686,0.00016146699,0.0004886396,0.00013168354,0.00011023756,0.0020946965,0.00020913154,0.00008163976],"category_scores_gemma":[0.0001410937,0.0001583973,0.00005423587,0.00041523372,0.00021241079,0.0008648237,0.00011420485,0.00019541866,0.0000029556193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016246927,0.00016265774,0.00013172202,0.000037871454,0.00015484767,0.0000019012504,0.00089183566,2.6085374e-7,0.00030903777,0.9850902,0.0003533402,0.012703843],"study_design_scores_gemma":[0.00215571,0.0010502001,0.00033008086,0.000119336735,0.00011498823,0.00018944048,0.00053588866,0.07284413,0.01759362,0.83716345,0.06725791,0.0006452649],"about_ca_topic_score_codex":0.000026080257,"about_ca_topic_score_gemma":0.00027533877,"teacher_disagreement_score":0.9192023,"about_ca_system_score_codex":0.000012980024,"about_ca_system_score_gemma":0.00010639005,"threshold_uncertainty_score":0.64592546},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000838819,0.00044088005,0.98782057,0.00025881827,0.00080980576,0.00031424704,0.000027970855,0.00024518094,0.009243718],"genre_scores_gemma":[0.5306907,0.00007349989,0.46746656,0.0010638825,0.0004852147,0.00001177341,0.00013747269,0.000035421035,0.000035470697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590456,0.0000411301,0.000607093,0.0017274567,0.000996078,0.00072370237],"domain_scores_gemma":[0.99777347,0.00040787688,0.00031024672,0.0010840456,0.00019583062,0.00022853026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067879964,0.0005904537,0.00061908836,0.001258835,0.0004609712,0.0008108263,0.0022719316,0.0003300825,0.000029450763],"category_scores_gemma":[0.000046470886,0.0006018377,0.00013919207,0.00094347587,0.0012184707,0.0009974146,0.0015229171,0.00091783877,0.000022989583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018254046,0.0001336319,0.0046479423,0.0002006687,0.000073402836,0.0003910063,0.0020761504,0.014852682,0.00037818606,0.76583177,0.00081407663,0.21058226],"study_design_scores_gemma":[0.0006325861,0.00008273322,0.0038178007,0.0004355005,0.000012551781,0.00020748666,4.979968e-7,0.45206827,0.00023134283,0.53504205,0.006299306,0.0011699031],"about_ca_topic_score_codex":0.0001490501,"about_ca_topic_score_gemma":0.00018491218,"teacher_disagreement_score":0.5298519,"about_ca_system_score_codex":0.0001574454,"about_ca_system_score_gemma":0.0002848506,"threshold_uncertainty_score":0.9996433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014917332,0.000069481255,0.98750013,0.00021399722,0.00040714047,0.008953264,0.000014707021,0.00014413617,0.0012054282],"genre_scores_gemma":[0.78987616,0.000008773081,0.20861359,0.00046691086,0.0002451409,0.00068173045,0.000015686011,0.00003585692,0.000056181256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481726,0.00008754252,0.00096611213,0.0018993913,0.0015440227,0.0006856916],"domain_scores_gemma":[0.99579704,0.00020851016,0.0005648061,0.0028720417,0.00035032313,0.00020728562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012103711,0.00059648283,0.0007894591,0.0010105021,0.00023686874,0.00047842338,0.005320347,0.00020836889,0.000027854132],"category_scores_gemma":[0.00004059293,0.0005166749,0.00017009386,0.0012611483,0.0005934942,0.000568518,0.0015024925,0.0007298799,0.00002295584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039511175,0.001613814,0.00033682413,0.00010516086,0.00005218478,0.00018640321,0.008110478,0.0030374213,0.00042113362,0.07129092,0.000035654983,0.9147705],"study_design_scores_gemma":[0.0041134534,0.0045847995,0.0024516399,0.001608576,0.00007666065,0.00010195074,0.0000053535246,0.20791075,0.010706943,0.761999,0.0036746757,0.0027662178],"about_ca_topic_score_codex":0.000050920993,"about_ca_topic_score_gemma":0.00020004703,"teacher_disagreement_score":0.9120043,"about_ca_system_score_codex":0.00012656087,"about_ca_system_score_gemma":0.00034055673,"threshold_uncertainty_score":0.9997285},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.5635654e-8,0.000031468167,0.090610415,0.00023767509,0.000103589766,0.023593375,0.0000235246,0.0002170174,0.8851829],"genre_scores_gemma":[0.000014172483,0.00007898459,0.08834624,0.0028261791,0.00026174472,0.04377277,0.00004494485,0.000032096847,0.8646229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988947,0.000008316098,0.00020842231,0.0005371501,0.00019556523,0.00015584397],"domain_scores_gemma":[0.9988393,0.000054823173,0.000073037016,0.00088969455,0.00005284903,0.00009026315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001123911,0.00023171036,0.00021868912,0.0001906381,0.00008100415,0.00018940051,0.00077235897,0.00020375158,0.0002948381],"category_scores_gemma":[0.000008221311,0.00019638195,0.00011088181,0.000054642096,0.000060363953,0.00023470017,0.00080121116,0.0002797765,0.00007937654],"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.000003056907,0.000008174256,0.0000026358464,0.000056592402,0.000015468639,0.000009004035,0.000018013538,2.1933404e-8,3.291939e-7,0.9072191,0.037151262,0.05551636],"study_design_scores_gemma":[0.00013188261,0.000021313794,0.000010309417,0.00006156167,0.0000049628607,0.0000039681595,3.7030907e-7,0.00012762105,0.000014223621,0.29928112,0.7001764,0.00016624539],"about_ca_topic_score_codex":0.000013805197,"about_ca_topic_score_gemma":0.000021993701,"teacher_disagreement_score":0.66302514,"about_ca_system_score_codex":0.000010594477,"about_ca_system_score_gemma":0.0000886002,"threshold_uncertainty_score":0.8008224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048030756,0.0022540474,0.9768388,0.00007551216,0.0014653156,0.0005598294,0.000020557374,0.000075013246,0.018230585],"genre_scores_gemma":[0.73919314,0.00014397362,0.25939804,0.00039332962,0.00056239346,0.000014075332,0.000016265036,0.000059755257,0.00021904499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996222,0.000037799844,0.0006897598,0.0017508374,0.0005985659,0.000701018],"domain_scores_gemma":[0.9965605,0.0007374049,0.0004124836,0.0015343687,0.000486654,0.00026859835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011060659,0.00063688634,0.0007893183,0.001223751,0.00021444491,0.00027524898,0.0030047917,0.0004144818,0.00001934956],"category_scores_gemma":[0.00006597886,0.0005814171,0.00019338471,0.001068372,0.0013328978,0.00094028143,0.002483535,0.0009879048,0.000025375886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027796359,0.00021343688,0.00023336487,0.00022581755,0.000040523504,0.000045073633,0.006751815,0.0003477467,0.00014117846,0.021607725,0.00020856386,0.97015697],"study_design_scores_gemma":[0.0022942598,0.001666809,0.0041023963,0.004011803,0.00007650869,0.00031295556,0.0000026430373,0.6003383,0.019299438,0.3309738,0.033261433,0.0036596993],"about_ca_topic_score_codex":0.000024317793,"about_ca_topic_score_gemma":0.00029195976,"teacher_disagreement_score":0.96649724,"about_ca_system_score_codex":0.00015084662,"about_ca_system_score_gemma":0.00047841715,"threshold_uncertainty_score":0.9996637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013200734,0.00026934242,0.9906398,0.003363685,0.002255919,0.00056093896,0.00008103093,0.00026310163,0.002434172],"genre_scores_gemma":[0.05475781,0.000055868994,0.9385161,0.0050569135,0.00125703,0.000016977574,0.00009469854,0.000053081258,0.0001915607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461716,0.000040260828,0.00040850218,0.0028433432,0.0012636589,0.0008270903],"domain_scores_gemma":[0.9932101,0.00048999133,0.00021882985,0.0055261217,0.0001839035,0.00037109022],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00078612444,0.00068946835,0.00056198816,0.0012644139,0.00033887126,0.0022859892,0.011887818,0.00029679533,0.000038814687],"category_scores_gemma":[0.0002152574,0.0005882962,0.00011343046,0.0010044284,0.00040107506,0.0018379171,0.006718883,0.0010002981,0.00015921915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007304899,0.00004421931,0.000031710413,0.000037723737,0.000015108957,0.000077299504,0.00045342598,0.0017003245,0.00015330754,0.09864315,0.00078686734,0.8980496],"study_design_scores_gemma":[0.0004932536,0.00052689825,0.000617491,0.00093590096,0.000017302214,0.000098100594,3.422224e-7,0.5622832,0.0014137406,0.37168807,0.059653133,0.00227258],"about_ca_topic_score_codex":0.0000655767,"about_ca_topic_score_gemma":0.00015310285,"teacher_disagreement_score":0.895777,"about_ca_system_score_codex":0.00011529418,"about_ca_system_score_gemma":0.00023377266,"threshold_uncertainty_score":0.99965686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025861435,0.000115517956,0.9652297,0.003936274,0.0005332583,0.00012280178,0.0000037100453,0.00032858952,0.0038687258],"genre_scores_gemma":[0.98206514,0.0000071613263,0.015282397,0.0025401155,0.00006431801,0.000010852099,0.0000059315407,0.0000052650944,0.000018799748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911296,0.00007072919,0.00011401851,0.00023145485,0.00029228147,0.00017854062],"domain_scores_gemma":[0.99901795,0.00008336826,0.000037495025,0.0006984918,0.000050857572,0.00011186227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004952702,0.00009176065,0.00007428448,0.00007684266,0.000091559974,0.00024160184,0.00080934935,0.00004320097,0.000084376654],"category_scores_gemma":[0.00003865076,0.000056429708,0.00006861544,0.00046575637,0.00008018313,0.00071993924,0.00016206194,0.00012641406,0.00016564145],"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.000010182388,0.000087580716,0.0018365514,0.000004058783,0.000009179848,0.0000068425325,0.0007061676,0.00004291114,0.000099791454,0.9442822,0.046335727,0.0065788347],"study_design_scores_gemma":[0.0025664289,0.00042876438,0.029945543,0.00004436265,0.000028679344,0.000036053443,0.0007367355,0.35088614,0.0036573622,0.32298842,0.2877544,0.00092710473],"about_ca_topic_score_codex":0.00011097165,"about_ca_topic_score_gemma":0.000058855756,"teacher_disagreement_score":0.9562037,"about_ca_system_score_codex":0.000020669544,"about_ca_system_score_gemma":0.000078478246,"threshold_uncertainty_score":0.23297721},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028143998,0.0010053375,0.98805326,0.0005899272,0.0015754622,0.00036388767,0.000023829001,0.00024385334,0.007862988],"genre_scores_gemma":[0.04246098,0.00026033,0.94639415,0.008091163,0.0016066068,0.000020010082,0.00003668714,0.00009263137,0.0010374595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540615,0.000039076116,0.00055209815,0.0020792969,0.001030594,0.0008927808],"domain_scores_gemma":[0.9966044,0.00030201706,0.00029501552,0.002415431,0.00015154706,0.00023158127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071069936,0.0006686532,0.0005530302,0.0009108356,0.00035581752,0.0005640717,0.005075601,0.0004231385,0.00016243917],"category_scores_gemma":[0.00003657107,0.0006193286,0.00024051011,0.00065023167,0.0008245339,0.0007400949,0.0031706048,0.00078428455,0.0002691478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018528171,0.00010826655,0.0003236936,0.000046848687,0.000026961334,0.0001871947,0.0013756253,0.0025660088,0.00032727167,0.0660439,0.0003552385,0.92862046],"study_design_scores_gemma":[0.0018581913,0.0005939777,0.0014344625,0.0011452109,0.00004359667,0.0004639282,3.590486e-7,0.24521168,0.0075887023,0.5064078,0.23069613,0.0045559835],"about_ca_topic_score_codex":0.00003083516,"about_ca_topic_score_gemma":0.00043870512,"teacher_disagreement_score":0.92406446,"about_ca_system_score_codex":0.000354315,"about_ca_system_score_gemma":0.00028855968,"threshold_uncertainty_score":0.9996258},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068223214,0.00058977935,0.9942604,0.00036555974,0.0008695794,0.00017242608,0.000022627408,0.00009738154,0.0029400247],"genre_scores_gemma":[0.068335794,0.00010664308,0.93041825,0.00058308576,0.00046166568,0.0000033145727,0.000013974359,0.000018884624,0.000058357375],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970077,0.000028602937,0.00051501027,0.00095673505,0.0010199806,0.0004719148],"domain_scores_gemma":[0.99755,0.00051184517,0.00055292033,0.0010826683,0.0002024168,0.00010011673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008424819,0.0003298455,0.00044646725,0.0007438981,0.0001378542,0.00026535336,0.0027275013,0.0003086319,0.000021032942],"category_scores_gemma":[0.00013575025,0.00031919437,0.00015102561,0.00054270576,0.00029054336,0.0007407688,0.0011149815,0.0004756299,0.00001876563],"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.0000045411116,0.00004631689,0.00071537,0.000046592533,0.000022627857,0.0000173465,0.0015656523,0.0026175752,0.0001627859,0.22409639,0.00006171877,0.7706431],"study_design_scores_gemma":[0.0006939343,0.00031200887,0.0026338433,0.0009863208,0.000030723517,0.000038113365,4.3335982e-7,0.2651629,0.005262067,0.7040021,0.01930508,0.0015725084],"about_ca_topic_score_codex":0.0000105709,"about_ca_topic_score_gemma":0.000045244255,"teacher_disagreement_score":0.76907057,"about_ca_system_score_codex":0.00022546193,"about_ca_system_score_gemma":0.00023341132,"threshold_uncertainty_score":0.99992603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013485395,0.00020081496,0.97492343,0.0020755064,0.0014738725,0.00039803464,0.00066035707,0.00067667116,0.0061058896],"genre_scores_gemma":[0.8661009,0.000040293035,0.13041049,0.0011867018,0.0009299117,0.000015527734,0.0006428731,0.00002616128,0.00064714573],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976114,0.00013393705,0.00022894013,0.00087339693,0.000669107,0.00048321392],"domain_scores_gemma":[0.99638253,0.000063219864,0.000049520535,0.0028981043,0.0001479272,0.00045871554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011999839,0.00019871324,0.00022441095,0.00011763839,0.00014692055,0.00046626705,0.0038069503,0.00012137838,0.00018230086],"category_scores_gemma":[0.00013122788,0.00014695374,0.0000493877,0.000910161,0.00006476156,0.0020951368,0.0035212887,0.00032440718,0.00015990775],"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.00024786158,0.00047540572,0.005343005,0.00006199073,0.00007992904,0.00010567242,0.005488181,0.000013213472,0.000030192581,0.39012486,0.59091824,0.00711143],"study_design_scores_gemma":[0.00390789,0.0006272145,0.008685335,0.00008357277,0.000039488674,0.00012615857,0.0011964089,0.56835663,0.00044757134,0.07332144,0.34163636,0.0015719325],"about_ca_topic_score_codex":0.00055744324,"about_ca_topic_score_gemma":0.00063134404,"teacher_disagreement_score":0.8526155,"about_ca_system_score_codex":0.000026236637,"about_ca_system_score_gemma":0.00027038512,"threshold_uncertainty_score":0.7074324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019050964,0.00021180957,0.9942922,0.0019256595,0.0013199957,0.0010346688,0.000115472736,0.00013188494,0.0009492578],"genre_scores_gemma":[0.7645483,0.000031346022,0.23033485,0.0041015386,0.0007009435,0.00008464985,0.00007431547,0.00004993636,0.00007412403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962799,0.000029592982,0.00056355214,0.0015142807,0.0009011538,0.00071149814],"domain_scores_gemma":[0.99699605,0.0006431628,0.00029740544,0.0016334718,0.00029119206,0.00013872453],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00086297974,0.0005440658,0.0004907686,0.00052304036,0.00069204124,0.0014088044,0.006267527,0.00030592154,0.0000062098366],"category_scores_gemma":[0.000022645301,0.00040512555,0.00025757312,0.0006424525,0.0007151442,0.0010241081,0.00073645584,0.00061224116,0.00000494593],"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.000009109727,0.000034746507,0.000028423656,0.00003370288,0.000014645571,0.0000039125866,0.00023689451,0.5982273,0.000023442099,0.3683009,0.00025612177,0.03283078],"study_design_scores_gemma":[0.00030702478,0.000047792604,0.00012640042,0.000071124734,0.000013851819,0.000004794166,7.0146186e-8,0.61602277,0.00010100178,0.38246182,0.0005135374,0.00032981823],"about_ca_topic_score_codex":0.000046725654,"about_ca_topic_score_gemma":0.00029109357,"teacher_disagreement_score":0.7645292,"about_ca_system_score_codex":0.00013306187,"about_ca_system_score_gemma":0.000502171,"threshold_uncertainty_score":0.9998401},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027738238,0.0032833656,0.9922414,0.00050094305,0.0014367315,0.00060254853,0.000082356164,0.00015282992,0.0014224674],"genre_scores_gemma":[0.05232922,0.0013617162,0.94427145,0.0012273008,0.00063041423,0.00002870291,0.0000767598,0.00004102387,0.000033397704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968116,0.000038587503,0.00046968725,0.0013676774,0.00059893087,0.0007135004],"domain_scores_gemma":[0.9978206,0.00040872328,0.00022476497,0.0010467978,0.00016800244,0.00033110843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007260491,0.00054152036,0.0005369834,0.00070211967,0.00065056013,0.00060670497,0.0017056926,0.0004226304,0.0000185627],"category_scores_gemma":[0.000027633683,0.00049491477,0.00021081224,0.000490107,0.0011433793,0.0012371691,0.0006338056,0.00061940216,0.0000035979715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015654812,0.00003505186,0.000047747424,0.00009033391,0.000022832097,0.000013795724,0.0010249545,0.00036561038,0.00031247633,0.13501227,0.000078212215,0.8629811],"study_design_scores_gemma":[0.0020561356,0.00031250346,0.00023775714,0.00063342,0.000078696285,0.00027417688,0.0000015964135,0.22930002,0.0013243821,0.59182477,0.17189105,0.0020655023],"about_ca_topic_score_codex":0.0000143481775,"about_ca_topic_score_gemma":0.00003754267,"teacher_disagreement_score":0.86091554,"about_ca_system_score_codex":0.00010614429,"about_ca_system_score_gemma":0.00034095527,"threshold_uncertainty_score":0.99975026},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.1642596e-8,0.000023480789,0.35312524,0.00015521196,0.0001595342,0.018501977,0.00001484677,0.00022721308,0.6277924],"genre_scores_gemma":[0.000042125856,0.000031083917,0.08642759,0.00068592915,0.00039672802,0.057851646,0.000304261,0.000051040388,0.8542096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986758,0.000009821469,0.0002876969,0.0005820448,0.0003120731,0.00013254728],"domain_scores_gemma":[0.9982273,0.000021441758,0.00015069029,0.0013942735,0.00013932804,0.000066969595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015391067,0.00018486776,0.00016617401,0.00014476715,0.00008618205,0.00038983606,0.00095583877,0.00020174011,0.00090485223],"category_scores_gemma":[0.000009676563,0.00017541597,0.00015162698,0.000080369944,0.000041696465,0.00039764997,0.0004502763,0.00023986933,0.00044538904],"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":[8.978487e-7,0.000013528564,0.0000013399814,0.000035493533,0.000011680205,0.00001196539,0.000014932491,8.0227316e-8,0.000022964607,0.97010154,0.010615059,0.019170504],"study_design_scores_gemma":[0.00008885211,0.000012550691,0.00001779319,0.000044362634,0.0000046166438,0.000008498006,0.0000011869408,0.00014353824,0.00031572077,0.19810568,0.8010475,0.00020968133],"about_ca_topic_score_codex":0.000005749467,"about_ca_topic_score_gemma":0.000021657766,"teacher_disagreement_score":0.79043245,"about_ca_system_score_codex":0.000017927801,"about_ca_system_score_gemma":0.00009399614,"threshold_uncertainty_score":0.9907497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2667517,0.0000967031,0.7310079,0.0012808997,0.000041871826,0.00023268037,0.00003599328,0.00019593695,0.00035634747],"genre_scores_gemma":[0.8961702,0.000001546001,0.10012423,0.0036379814,0.00003198689,0.0000148470035,0.000011150468,0.000005296137,0.0000027401973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862564,0.000038879974,0.0001900736,0.00055057486,0.0002723011,0.00032255586],"domain_scores_gemma":[0.9987866,0.00010867521,0.000042925418,0.0005899733,0.00007254652,0.0003992705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042377837,0.00015631392,0.00017347932,0.00074325764,0.00013977705,0.00063397404,0.00067737326,0.00005663916,0.00006694497],"category_scores_gemma":[0.000026584605,0.00013472998,0.000036971527,0.0015614337,0.00006150658,0.0005528866,0.00014670342,0.00007295907,0.000014683599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006327271,0.0043814615,0.15804498,0.0001789034,0.00010117957,0.0000492955,0.00089535804,0.013429117,0.029927231,0.24002674,0.006663711,0.5456693],"study_design_scores_gemma":[0.0031669699,0.00071928516,0.027696887,0.000010593796,0.000012365228,0.0000051124457,0.000017507102,0.92021835,0.028373536,0.00025832685,0.019065116,0.00045597958],"about_ca_topic_score_codex":0.00007651256,"about_ca_topic_score_gemma":0.000039084065,"teacher_disagreement_score":0.9067892,"about_ca_system_score_codex":0.0000146045,"about_ca_system_score_gemma":0.00007330992,"threshold_uncertainty_score":0.6113426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039282157,0.0001244459,0.89727545,0.0019527428,0.00058681535,0.00015094447,0.000006645495,0.000119288015,0.09585544],"genre_scores_gemma":[0.99153936,0.000007924736,0.0053120838,0.0015072675,0.000059759892,0.00002289957,0.0000015753615,0.0000035641553,0.0015455954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994762,0.0000186493,0.00008075886,0.00019893749,0.000072658426,0.00015280585],"domain_scores_gemma":[0.99921674,0.00020517857,0.000017201291,0.00049541367,0.000027922562,0.00003752882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015247923,0.00007041409,0.000054882436,0.000037208305,0.00008167298,0.00017620382,0.0007643102,0.00002705921,0.00034929387],"category_scores_gemma":[0.0000249778,0.000041229054,0.00008000441,0.0001794409,0.00003803728,0.00017218193,0.00014002538,0.00006516057,0.00030455043],"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.0000018274005,0.00008356845,0.000017227832,0.0000014996316,0.000004119883,3.5087416e-7,0.00032285033,1.4170523e-7,0.0000047648177,0.694962,0.2970308,0.0075708367],"study_design_scores_gemma":[0.00019774922,0.00020800157,0.00013081082,0.000008396009,0.0000023203236,0.0000022939998,0.000010275655,0.046145033,0.0006392439,0.05375481,0.8987788,0.00012226394],"about_ca_topic_score_codex":0.00000676025,"about_ca_topic_score_gemma":0.000023866154,"teacher_disagreement_score":0.9876111,"about_ca_system_score_codex":0.0000066053744,"about_ca_system_score_gemma":0.0000037593243,"threshold_uncertainty_score":0.3914481},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000305063,0.0006363117,0.99311715,0.00045085076,0.0026508141,0.00062422367,0.000037378286,0.000398537,0.001779638],"genre_scores_gemma":[0.4549656,0.00005853937,0.5424459,0.0016506849,0.0007044413,0.00001875915,0.00007302676,0.00005714411,0.000025911399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942856,0.000094330084,0.00080898934,0.002347318,0.0014429768,0.0010207959],"domain_scores_gemma":[0.99615365,0.0006973344,0.00050835503,0.0019312714,0.000364914,0.00034447204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013207888,0.0008242064,0.0008033042,0.0010684235,0.0005435432,0.00088525563,0.0037535017,0.00051779597,0.000029303677],"category_scores_gemma":[0.000098555916,0.00076677615,0.0002735107,0.0009852394,0.0011997111,0.00048301453,0.0018279718,0.0011268482,0.000111905276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016583183,0.00010001429,0.00008073814,0.00012401813,0.000025852994,0.000081318365,0.002959682,0.16451246,0.00007736353,0.18670969,0.00016727268,0.645145],"study_design_scores_gemma":[0.00051370973,0.00028975675,0.00020933479,0.00037272568,0.00001353468,0.00008043339,6.498003e-7,0.8954042,0.00039627324,0.09591518,0.005704556,0.0010996402],"about_ca_topic_score_codex":0.00008717478,"about_ca_topic_score_gemma":0.00027458524,"teacher_disagreement_score":0.73089176,"about_ca_system_score_codex":0.00032944098,"about_ca_system_score_gemma":0.00058266503,"threshold_uncertainty_score":0.99947834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007381708,0.0006127195,0.9958699,0.0001906053,0.0016489677,0.00071177864,0.000053159692,0.00025066014,0.00058841193],"genre_scores_gemma":[0.0236467,0.00014466672,0.9737024,0.0019062826,0.00043322577,0.000033246484,0.00007567431,0.000042537395,0.000015271624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623054,0.000035082718,0.00056561513,0.0016773229,0.0007879218,0.00070349796],"domain_scores_gemma":[0.9972831,0.00033177718,0.00031934952,0.0014944717,0.0003686288,0.00020269913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054624415,0.00055890705,0.0005170281,0.0012264643,0.00046719774,0.0005446553,0.002828696,0.00040004888,0.000014540564],"category_scores_gemma":[0.00009636604,0.0005421709,0.00032645816,0.0011619135,0.00080665,0.0011604745,0.0008967268,0.00047898703,0.000013399418],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043856373,0.00048135084,0.00030121717,0.00021537254,0.00006137653,0.000121667814,0.0039032258,0.0050067734,0.00033354055,0.26935187,0.00078883924,0.7193909],"study_design_scores_gemma":[0.0018465001,0.0007750822,0.0004111686,0.0005256365,0.00003117995,0.00015911621,3.8629173e-7,0.5780678,0.0044849454,0.36368707,0.047754396,0.0022567133],"about_ca_topic_score_codex":0.000019457308,"about_ca_topic_score_gemma":0.00017538414,"teacher_disagreement_score":0.7171342,"about_ca_system_score_codex":0.00011414111,"about_ca_system_score_gemma":0.00032777071,"threshold_uncertainty_score":0.999703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024719622,0.0007547989,0.99292237,0.0020838839,0.000992555,0.0004582785,0.00006422357,0.00012731468,0.00012461504],"genre_scores_gemma":[0.5945928,0.00003429158,0.40397295,0.0010533399,0.00022551071,0.000013137446,0.000085885775,0.000018322708,0.000003745102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964505,0.000067409645,0.00040450686,0.001502085,0.00080807315,0.0007674673],"domain_scores_gemma":[0.99782455,0.00045311952,0.0002137452,0.00096003735,0.00019900262,0.00034957018],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008913164,0.0004840298,0.00049558416,0.0012524525,0.00021598808,0.0015973842,0.0017217619,0.00036339022,0.0000098226365],"category_scores_gemma":[0.00010336265,0.0004869559,0.00008190979,0.0011717725,0.00035574683,0.0019564237,0.0009758844,0.00069943833,0.000018515371],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032464355,0.00013502344,0.002219638,0.00007502569,0.000019956498,0.00006725722,0.001379781,0.0123140365,0.0007914454,0.063383564,0.000087199056,0.9194946],"study_design_scores_gemma":[0.0012605418,0.00037401734,0.008705291,0.00056865363,0.000018766901,0.000021931048,0.0000010174138,0.75928366,0.0022386545,0.21167363,0.014094511,0.0017593026],"about_ca_topic_score_codex":0.00018323079,"about_ca_topic_score_gemma":0.00044692087,"teacher_disagreement_score":0.91773534,"about_ca_system_score_codex":0.00024301998,"about_ca_system_score_gemma":0.0003186471,"threshold_uncertainty_score":0.9997582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036861448,0.0015972166,0.9946021,0.00032853603,0.0020048588,0.00043032656,0.000033837292,0.000108585125,0.0005259494],"genre_scores_gemma":[0.017859157,0.0001791779,0.9802051,0.00076389004,0.00091492815,0.000015545256,0.000016859532,0.000020526586,0.000024800303],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974233,0.00001932558,0.00034363408,0.001154844,0.00046478424,0.000594147],"domain_scores_gemma":[0.99820983,0.00031877885,0.0001975417,0.0009173016,0.00015399457,0.00020255445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006674136,0.00039350922,0.00038470942,0.00057017343,0.00032453437,0.0005828923,0.0014051317,0.0002852298,0.000010522024],"category_scores_gemma":[0.00003999741,0.00036763542,0.00011732009,0.00034708134,0.0009512524,0.0009924026,0.00086470786,0.00042172574,0.000005985849],"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.000005587138,0.000013521748,0.000102579404,0.000035046272,0.0000080840955,0.0000045368542,0.0002974659,0.000100226236,0.00007957393,0.37574005,0.000028097966,0.6235852],"study_design_scores_gemma":[0.0005235336,0.00018830101,0.00036600078,0.00015313245,0.0000208822,0.00027784207,2.2649313e-7,0.11037086,0.00067182013,0.8632162,0.023334162,0.0008770406],"about_ca_topic_score_codex":0.000020532709,"about_ca_topic_score_gemma":0.00005674077,"teacher_disagreement_score":0.6227082,"about_ca_system_score_codex":0.00008680317,"about_ca_system_score_gemma":0.00020041206,"threshold_uncertainty_score":0.9998776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004934128,0.000054573135,0.99151117,0.0008359323,0.0012281345,0.00041757416,0.000026025851,0.00007229483,0.0053608892],"genre_scores_gemma":[0.7710382,0.000016728694,0.22630876,0.00224538,0.0003142754,0.000015193029,0.000008133659,0.000024862333,0.000028502365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969047,0.000055207358,0.00048358564,0.0011311718,0.0009914521,0.000433924],"domain_scores_gemma":[0.995174,0.0015561804,0.00033474094,0.0026604,0.00016744083,0.00010723136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016446541,0.00038297434,0.0004101541,0.00040193993,0.00024321796,0.00029047995,0.0050440375,0.0002896331,0.000043145472],"category_scores_gemma":[0.0002769527,0.0002495394,0.00017270495,0.0005848788,0.001735603,0.00029471182,0.0013582503,0.0012574521,0.000019108396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004914153,0.000044613298,0.000018687719,0.00003398035,0.0000053830945,0.000008065128,0.00047295378,0.0004978336,0.00018878566,0.9099829,0.000012979475,0.08872888],"study_design_scores_gemma":[0.00009829006,0.0001547475,0.00017535478,0.0001916157,0.000004719651,0.000013586475,5.249045e-8,0.026665641,0.0019341494,0.9694401,0.0009951397,0.00032658587],"about_ca_topic_score_codex":0.000025124638,"about_ca_topic_score_gemma":0.00012684181,"teacher_disagreement_score":0.77054477,"about_ca_system_score_codex":0.000055683202,"about_ca_system_score_gemma":0.00027586086,"threshold_uncertainty_score":0.9999957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084604224,0.0009830993,0.9901159,0.0010647491,0.0013278314,0.00048965384,0.000031955376,0.00035689885,0.005545322],"genre_scores_gemma":[0.17627394,0.0003268262,0.8185599,0.003250628,0.0011113351,0.000038254246,0.000039214494,0.000097101394,0.00030283353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947839,0.000032886943,0.0006429901,0.0023675552,0.0011774447,0.0009952505],"domain_scores_gemma":[0.99612117,0.00025990707,0.00033517374,0.0027310974,0.00026139544,0.0002912867],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00066634885,0.00073455524,0.0006360933,0.0010501683,0.0003941192,0.0010380844,0.00563344,0.00047791848,0.000074155694],"category_scores_gemma":[0.00006532922,0.000667861,0.0002550423,0.001213192,0.0008710997,0.0011222374,0.0020334555,0.0012575038,0.00015194567],"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.000006370238,0.00007741107,0.00006421258,0.00008050351,0.000023884913,0.00013705395,0.0008741344,0.0006856885,0.00028393482,0.33428997,0.00031407105,0.66316277],"study_design_scores_gemma":[0.00046199714,0.00027806804,0.00018041012,0.00047537443,0.000020024732,0.00020701601,2.033913e-7,0.23866062,0.0032870923,0.68748724,0.06706401,0.0018779733],"about_ca_topic_score_codex":0.00002068057,"about_ca_topic_score_gemma":0.000038064187,"teacher_disagreement_score":0.6612848,"about_ca_system_score_codex":0.00016465603,"about_ca_system_score_gemma":0.00027674824,"threshold_uncertainty_score":0.9999989},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008856103,0.00081317517,0.987171,0.00030759154,0.0016874789,0.0009035059,0.00005316158,0.0001322138,0.00007575495],"genre_scores_gemma":[0.49230257,0.00004149317,0.50689316,0.00030802382,0.00032969355,0.000031686184,0.00005991722,0.000028714487,0.0000047369404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614567,0.00008650958,0.0006199029,0.0016952886,0.00058481767,0.0008678091],"domain_scores_gemma":[0.9969222,0.001094329,0.00028567846,0.0011816055,0.00019305335,0.00032311762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016147596,0.00058607856,0.0006746257,0.00108496,0.00042866362,0.0006876985,0.0024261114,0.00037562888,0.0000063459643],"category_scores_gemma":[0.00010687616,0.0005812454,0.00011231387,0.0008534637,0.00069752266,0.0020532375,0.0009048363,0.0007585366,0.0000016342349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003893614,0.00028894795,0.0035215118,0.0002586399,0.000015593529,0.000046133082,0.0068483218,0.03612656,0.00007413531,0.086798124,0.000029456389,0.8659536],"study_design_scores_gemma":[0.0006994093,0.00013470437,0.0029428347,0.00021467822,0.0000114237055,0.000072689065,0.0000016186981,0.87534565,0.00014502775,0.11914657,0.000510653,0.00077472616],"about_ca_topic_score_codex":0.0000929081,"about_ca_topic_score_gemma":0.0006433701,"teacher_disagreement_score":0.86517894,"about_ca_system_score_codex":0.00016892505,"about_ca_system_score_gemma":0.00028944528,"threshold_uncertainty_score":0.9996639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030224994,0.0005409393,0.99467516,0.000330809,0.0014181595,0.00043743663,0.000090519694,0.00013461895,0.0020700847],"genre_scores_gemma":[0.29073313,0.00018643023,0.7067041,0.001234789,0.0006388696,0.000012731227,0.00032654672,0.000051752806,0.00011169004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551773,0.00007533506,0.0007736254,0.0018297767,0.0012425252,0.00056103244],"domain_scores_gemma":[0.9935004,0.00043202526,0.0005441294,0.0050102053,0.0003380765,0.00017513185],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013917969,0.000462105,0.0006092577,0.00086157484,0.00020412487,0.00058785186,0.01010201,0.0003407789,0.00011570202],"category_scores_gemma":[0.00016098323,0.00044226812,0.00013407563,0.0007336522,0.00083191384,0.001913852,0.007914353,0.00074497785,0.00003401302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003266198,0.00025943274,0.00036810385,0.00053266715,0.00014085423,0.00008964204,0.003748785,0.0068145073,0.003133954,0.3091575,0.0017192868,0.67400265],"study_design_scores_gemma":[0.0005022886,0.00014115921,0.00046604837,0.00085314305,0.000028621997,0.000037825816,0.0000012550069,0.7049876,0.0025930821,0.28423712,0.0051752008,0.0009766824],"about_ca_topic_score_codex":0.00053770625,"about_ca_topic_score_gemma":0.00022224925,"teacher_disagreement_score":0.69817305,"about_ca_system_score_codex":0.00008217207,"about_ca_system_score_gemma":0.00033328423,"threshold_uncertainty_score":0.9998029},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052687456,0.00016242688,0.9894083,0.00021096565,0.0018511763,0.00043809725,0.00004206774,0.00032701532,0.007033077],"genre_scores_gemma":[0.44820082,0.000092630995,0.5470699,0.003642624,0.0008219957,0.0000114278255,0.0001088905,0.00003812699,0.000013578336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578714,0.000053289274,0.0007379965,0.0011336267,0.0014200967,0.0008678581],"domain_scores_gemma":[0.9960013,0.0003104417,0.00038754282,0.0024825484,0.00040903655,0.00040910978],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020576299,0.0006455296,0.0005661841,0.0013958234,0.00042832253,0.0012055218,0.004832955,0.00051071215,0.000045758345],"category_scores_gemma":[0.00010209267,0.0006102955,0.0001700032,0.0011100218,0.0013809035,0.0041712555,0.0015145924,0.0013061577,0.00009932321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015841279,0.000068728186,0.00039282098,0.00007943159,0.000009934007,0.000044254917,0.004106372,0.00063506444,0.0000061014907,0.6881014,0.000025990887,0.30651405],"study_design_scores_gemma":[0.00037092497,0.00023671679,0.00044683082,0.00018476351,0.0000113652195,0.00013083853,9.2789816e-7,0.13718686,0.00030399975,0.85354,0.0065588662,0.0010278878],"about_ca_topic_score_codex":0.0000855505,"about_ca_topic_score_gemma":0.00034949352,"teacher_disagreement_score":0.44767395,"about_ca_system_score_codex":0.00019032271,"about_ca_system_score_gemma":0.0005025524,"threshold_uncertainty_score":0.9998313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015698226,0.00030995128,0.9961428,0.0013044698,0.0005942527,0.00028932022,0.000022667193,0.00006126416,0.0011183019],"genre_scores_gemma":[0.35848063,0.000054992608,0.63956213,0.0012797867,0.000567116,0.0000023588404,0.00003969854,0.000010911242,0.0000023802859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717516,0.000068675625,0.0006893969,0.0004781666,0.0011868126,0.00040178755],"domain_scores_gemma":[0.99657935,0.0011823189,0.00067750283,0.0010843806,0.00037079322,0.00010563129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025301175,0.0002801051,0.0003317317,0.00039104966,0.00026995258,0.00039849343,0.002345142,0.00018637728,0.000018249346],"category_scores_gemma":[0.000380507,0.00020926239,0.00012832526,0.00077576196,0.00077511446,0.0024394207,0.0013092571,0.00075304543,0.000021698648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010548025,0.000012547925,0.00014303367,0.00006747281,0.000010370125,0.000002370814,0.0009836268,0.0055867075,0.000012119959,0.5675813,0.000007786882,0.4255821],"study_design_scores_gemma":[0.00026611038,0.00007134051,0.0031941694,0.00034073973,0.000018993922,0.000077406796,5.496325e-7,0.31427053,0.00046397364,0.6715335,0.009228351,0.0005342984],"about_ca_topic_score_codex":0.000009564857,"about_ca_topic_score_gemma":0.0000016131306,"teacher_disagreement_score":0.4250478,"about_ca_system_score_codex":0.000091216236,"about_ca_system_score_gemma":0.00030345187,"threshold_uncertainty_score":0.8533473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022253438,0.0002688953,0.99442166,0.0004935445,0.0030460602,0.00080234243,0.00028856276,0.00031309974,0.00014327893],"genre_scores_gemma":[0.011020989,0.000020011663,0.98673517,0.0014365457,0.00053703657,0.00004055834,0.00016884,0.000040356157,4.7225268e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512607,0.000035473542,0.0006719545,0.0020475665,0.0011658747,0.00095305085],"domain_scores_gemma":[0.9959195,0.0005509512,0.00040562765,0.0023510165,0.00042952856,0.00034337532],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011793174,0.00073438673,0.00065185496,0.0014688374,0.00063770835,0.0014322472,0.0056247944,0.0006496898,0.000023813096],"category_scores_gemma":[0.0001433982,0.00070223486,0.00046685187,0.001649811,0.0011833278,0.0013819932,0.0011634032,0.0011940803,0.000016002406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012255488,0.00006675381,0.000153934,0.00007027156,0.00001817456,0.00002593785,0.00012827413,0.001652794,0.0006228006,0.9435955,0.000046878635,0.053606376],"study_design_scores_gemma":[0.0005418551,0.00018809142,0.00012368646,0.0001474037,0.00001860322,0.000012569037,5.2115563e-8,0.07253417,0.009117499,0.90242517,0.013959534,0.0009313627],"about_ca_topic_score_codex":0.000012943286,"about_ca_topic_score_gemma":0.0002421503,"teacher_disagreement_score":0.070881374,"about_ca_system_score_codex":0.00011062983,"about_ca_system_score_gemma":0.00055544736,"threshold_uncertainty_score":0.99975526},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009621798,0.0017219764,0.9797105,0.00024563074,0.001512679,0.00031948238,0.0000308213,0.0001296339,0.016233029],"genre_scores_gemma":[0.16761918,0.00015877205,0.83101577,0.0004984398,0.00053362525,0.000011770548,0.00001534291,0.00003939122,0.00010772544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961395,0.00003178258,0.0005905739,0.0013600664,0.0013192239,0.0005588201],"domain_scores_gemma":[0.9969015,0.00023719622,0.00041614368,0.0018152802,0.00042656917,0.00020328074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011814492,0.00046088552,0.00060533965,0.0009118214,0.00014298326,0.00030172852,0.004563793,0.000281816,0.000013784227],"category_scores_gemma":[0.00010013496,0.00040727717,0.00015218132,0.0010406729,0.0011053826,0.0010061909,0.0017482704,0.00068578916,0.00001826492],"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.000012300886,0.000063803636,0.00014173321,0.00010018713,0.000016434404,0.00003955438,0.0008999436,0.0026527152,0.000097933465,0.47149286,0.00015959344,0.5243229],"study_design_scores_gemma":[0.00046116175,0.00037777162,0.00018150899,0.00063775165,0.000011501779,0.000056736644,5.3793514e-7,0.07645628,0.0015503833,0.8925651,0.026790183,0.00091109896],"about_ca_topic_score_codex":0.000036475358,"about_ca_topic_score_gemma":0.00021306431,"teacher_disagreement_score":0.5234118,"about_ca_system_score_codex":0.00012659193,"about_ca_system_score_gemma":0.00079265167,"threshold_uncertainty_score":0.99983793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007188957,0.0005506617,0.994981,0.00085745467,0.0010798529,0.00027870145,0.00002416222,0.00009848657,0.0014107792],"genre_scores_gemma":[0.21882154,0.000068125846,0.7786127,0.0015894964,0.0007507007,0.00000738118,0.000069796035,0.000024786748,0.000055500837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967931,0.00003070785,0.0004922636,0.0013976184,0.00077361346,0.0005127259],"domain_scores_gemma":[0.9984442,0.0003438114,0.00020421794,0.00067541306,0.0001126187,0.00021971737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056802266,0.00044618794,0.0004262821,0.0010334308,0.00019805547,0.00069429,0.0014289233,0.00023298198,0.000037597245],"category_scores_gemma":[0.000028702005,0.0004403183,0.00009314685,0.0007323568,0.00052917824,0.0012925115,0.00089714665,0.00068338733,0.000020231259],"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.000015313706,0.000058277703,0.00049352215,0.00002312558,0.00000998192,0.00009281291,0.00086636713,0.026807513,0.000030815543,0.19725221,0.00019292002,0.77415717],"study_design_scores_gemma":[0.0007210445,0.00012658215,0.002393303,0.00021804961,0.0000054651737,0.00008835763,1.7504748e-7,0.29154962,0.000101410384,0.70049846,0.0036434901,0.0006540091],"about_ca_topic_score_codex":0.000115153154,"about_ca_topic_score_gemma":0.00092525565,"teacher_disagreement_score":0.7735031,"about_ca_system_score_codex":0.00016455511,"about_ca_system_score_gemma":0.0005457021,"threshold_uncertainty_score":0.99980485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50219786,0.00058727583,0.032150045,0.006504981,0.0082315095,0.0012821654,0.000022173708,0.0007526559,0.44827133],"genre_scores_gemma":[0.99744296,0.000009765781,0.001532014,0.00092279207,0.0000028317625,0.000019088884,0.0000016680958,0.0000056946233,0.000063212865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989757,0.00013779766,0.00012299813,0.000274001,0.00025651915,0.0002329844],"domain_scores_gemma":[0.9987483,0.00025842877,0.000047687285,0.0008396167,0.000040101422,0.00006588135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040747697,0.00011364133,0.00009177092,0.00004474052,0.00021553361,0.00015523772,0.00078352744,0.000046474794,0.00011747238],"category_scores_gemma":[0.00008321314,0.00007619301,0.000067320645,0.00048733712,0.000048406124,0.00026301676,0.000097622615,0.00018045225,0.0003906572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017807297,0.00009932165,0.00016533564,0.0000021332814,0.00000817677,0.0000043580126,0.00015623476,0.000001813467,0.000021184956,0.9642193,0.035154875,0.00016551679],"study_design_scores_gemma":[0.00024670703,0.00006535032,0.0002680016,0.0000073487454,0.000002157224,0.0000036065712,0.0000057015013,0.000109324435,0.0009632665,0.9120745,0.08614722,0.000106812324],"about_ca_topic_score_codex":0.0000067871024,"about_ca_topic_score_gemma":0.0000010476816,"teacher_disagreement_score":0.49524507,"about_ca_system_score_codex":0.000015992875,"about_ca_system_score_gemma":0.000040288378,"threshold_uncertainty_score":0.50212383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015584126,0.0023489438,0.99267864,0.00042552743,0.0017960162,0.0005129829,0.00003377277,0.00024897288,0.0017992816],"genre_scores_gemma":[0.28898284,0.00019843793,0.7086861,0.0013160775,0.00061675574,0.000021317244,0.000028003187,0.000064155814,0.00008631301],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956448,0.00003631385,0.0004185083,0.0017511236,0.0011562675,0.0009929717],"domain_scores_gemma":[0.9966235,0.00022825904,0.00035235408,0.002304624,0.0002027271,0.00028851387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075960666,0.00068712333,0.0005718669,0.0006700889,0.00031699432,0.0005520156,0.004156682,0.00036032117,0.000024981542],"category_scores_gemma":[0.000026635287,0.000554599,0.00014060386,0.0009821154,0.00097322965,0.0013739046,0.0014095149,0.0012359029,0.00004855489],"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.00002909949,0.00012706137,0.00014805805,0.00015130077,0.000033442957,0.00024066628,0.0023972176,0.0051442506,0.00009213749,0.3570938,0.0000949765,0.634448],"study_design_scores_gemma":[0.0011376953,0.0008950859,0.00092619174,0.0015608657,0.000047412945,0.00060132175,7.2767835e-7,0.38493648,0.0006028919,0.56724805,0.038592346,0.0034509478],"about_ca_topic_score_codex":0.00001728182,"about_ca_topic_score_gemma":0.0001759086,"teacher_disagreement_score":0.630997,"about_ca_system_score_codex":0.00023474407,"about_ca_system_score_gemma":0.00050360133,"threshold_uncertainty_score":0.99969053},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29477912,0.0022272996,0.0037776742,0.0010457503,0.0016413656,0.0010883802,0.00004930212,0.0007638774,0.6946272],"genre_scores_gemma":[0.9852411,0.00144269,0.0014329329,0.000019030389,0.00042716917,0.0000075699445,0.0007120885,0.000041933097,0.010675488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958191,0.00097307476,0.00030872945,0.0010164963,0.0010775218,0.00080508995],"domain_scores_gemma":[0.99622947,0.0003118843,0.00024404658,0.002506164,0.00034320305,0.00036520822],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00080513576,0.00034674007,0.00037558537,0.0016963504,0.0014048057,0.00058344926,0.004635993,0.0005188735,0.0000510178],"category_scores_gemma":[0.000044576584,0.00041563658,0.00030772062,0.0025166273,0.00024616456,0.0014668629,0.00073642714,0.0020803695,0.00009233351],"study_design_candidate":"theoretical_or_conceptual","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.00025191932,0.00035409548,0.0030137547,0.00016934506,0.0001933698,0.000562846,0.0019959067,0.0000036297888,0.0013331715,0.975785,0.010714773,0.005622195],"study_design_scores_gemma":[0.0015094193,0.0006506686,0.09349749,0.00044794736,0.00009740965,0.00007346344,0.004749803,0.0009094774,0.00915292,0.02273163,0.8645228,0.001656946],"about_ca_topic_score_codex":0.0058115823,"about_ca_topic_score_gemma":0.04864383,"teacher_disagreement_score":0.95305336,"about_ca_system_score_codex":0.00051225815,"about_ca_system_score_gemma":0.000649725,"threshold_uncertainty_score":0.9998952},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029774348,0.00096312736,0.9885467,0.0003012497,0.0037266251,0.00042901374,0.00012991663,0.00029107064,0.005314544],"genre_scores_gemma":[0.6603533,0.00052412425,0.3326747,0.0047863424,0.0013660985,0.000026404865,0.00007982036,0.00009631191,0.00009291635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517095,0.00006961854,0.00065326283,0.0023107901,0.0008725912,0.00092281005],"domain_scores_gemma":[0.9964107,0.00056681107,0.00016466924,0.0022920484,0.00023241692,0.00033331866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086835056,0.00077182136,0.0007514952,0.00096121,0.00032041865,0.00080764474,0.0052158246,0.0005141247,0.00015960506],"category_scores_gemma":[0.00004225549,0.0007098547,0.0002719384,0.0008336744,0.0012934674,0.0011078282,0.0011838936,0.0011151264,0.00013155748],"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.00003137352,0.00011986184,0.00008575338,0.000042409723,0.000057885758,0.00046508294,0.004901445,0.0009337938,0.0003747463,0.46605444,0.000107407046,0.5268258],"study_design_scores_gemma":[0.0004973414,0.00022534282,0.00013693435,0.00039989885,0.000021952426,0.00004934834,2.3133988e-7,0.03739433,0.0026494842,0.9522655,0.005082663,0.0012769633],"about_ca_topic_score_codex":0.00022971578,"about_ca_topic_score_gemma":0.00030333086,"teacher_disagreement_score":0.6600555,"about_ca_system_score_codex":0.000111045105,"about_ca_system_score_gemma":0.0004852046,"threshold_uncertainty_score":0.99953526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1674164,0.00007777897,0.82907647,0.00059279846,0.0018312978,0.00022213257,0.000023099732,0.00024636748,0.0005136322],"genre_scores_gemma":[0.95944417,0.000015476466,0.039921105,0.00039325244,0.00018199607,0.000008288304,0.000013719476,0.000013388439,0.000008580756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764705,0.00018543011,0.00039306463,0.0007585432,0.00054299156,0.00047293553],"domain_scores_gemma":[0.99778634,0.00020265962,0.000065611115,0.0016177451,0.0001403606,0.00018727504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011417082,0.00020134321,0.00021142642,0.00034912679,0.00027285801,0.00016870345,0.0020049943,0.00009345812,0.000015725835],"category_scores_gemma":[0.000018162627,0.00021848943,0.000058770594,0.0016766243,0.000043303662,0.00032777482,0.00008994134,0.0006021628,0.00005701525],"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.000038218346,0.0008847757,0.00017372004,0.00007749955,0.00005091402,0.00006987153,0.015886735,0.8092186,0.000119484874,0.012839496,0.00038243647,0.16025823],"study_design_scores_gemma":[0.000617289,0.00009008877,0.000047133333,0.00008388238,0.000007759363,0.000023837842,0.00056705595,0.99099296,0.0011112184,0.0008183407,0.005377046,0.000263404],"about_ca_topic_score_codex":0.0008998063,"about_ca_topic_score_gemma":0.0002688424,"teacher_disagreement_score":0.7920278,"about_ca_system_score_codex":0.00009094739,"about_ca_system_score_gemma":0.00017325516,"threshold_uncertainty_score":0.890974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008673082,0.011345844,0.97642195,0.00262836,0.00019538043,0.00034054552,0.000020092564,0.00017562578,0.00019914679],"genre_scores_gemma":[0.94042325,0.0013807126,0.055898678,0.0012471607,0.00068961235,0.000031157964,0.00031239394,0.000012668252,0.0000043394098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872696,0.00018748463,0.00025547334,0.0002459757,0.0001221552,0.00046191926],"domain_scores_gemma":[0.9984156,0.00028618812,0.00014486673,0.0008898169,0.000049937047,0.00021359176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122136,0.00018264045,0.00020722834,0.000060327297,0.00062179624,0.00017545631,0.00109681,0.00020688375,0.0000063576344],"category_scores_gemma":[0.000023279745,0.00018081158,0.000116065065,0.00039117396,0.00011547886,0.0005536122,0.00070031954,0.0005103371,9.656767e-7],"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.000049731676,0.00026399788,0.0011702899,0.000019726052,0.00004641998,1.6957445e-7,0.0051549114,0.0004891811,0.0000024939316,0.8545277,0.008677875,0.12959751],"study_design_scores_gemma":[0.0016659873,0.000119225,0.012043469,0.00007431705,0.00006545757,0.000027241904,0.00019900968,0.36025593,0.000010945405,0.28231078,0.34244072,0.00078690593],"about_ca_topic_score_codex":0.000038252503,"about_ca_topic_score_gemma":0.00018312417,"teacher_disagreement_score":0.9317502,"about_ca_system_score_codex":0.000013678106,"about_ca_system_score_gemma":0.000021947757,"threshold_uncertainty_score":0.7373282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008272017,0.00013181446,0.9959228,0.0004161062,0.00035577588,0.0003342518,0.0000070085785,0.00012710295,0.0018779308],"genre_scores_gemma":[0.26385838,0.0000067429596,0.73440707,0.001395118,0.00014565821,0.000076077486,0.000073300835,0.000007182187,0.00003045375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991625,0.000031553474,0.00013966447,0.00029738343,0.00016700359,0.00020191305],"domain_scores_gemma":[0.9991264,0.000053547647,0.000050357612,0.00050179113,0.00012773603,0.00014018566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062020734,0.00008649266,0.00010477355,0.00006522525,0.0001060806,0.00079148257,0.0015603598,0.000051766652,0.000020191528],"category_scores_gemma":[0.000043161675,0.000077785284,0.0000607991,0.00038510488,0.000027785218,0.0023763585,0.00049082015,0.000059970655,0.0000239898],"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.000019327303,0.000070360125,0.00062402966,0.000005459629,0.0000062618974,0.0000010118273,0.00005684773,0.00015398006,0.00001549834,0.96101886,0.020392852,0.017635506],"study_design_scores_gemma":[0.0019405631,0.00021058595,0.00049290893,0.000017691314,0.0000094628695,0.0000033541774,0.0000555579,0.5557149,0.0007006728,0.1540031,0.28652024,0.00033098928],"about_ca_topic_score_codex":0.00011055628,"about_ca_topic_score_gemma":0.00008885504,"teacher_disagreement_score":0.8070158,"about_ca_system_score_codex":0.000016018532,"about_ca_system_score_gemma":0.000078588724,"threshold_uncertainty_score":0.7632285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023320727,0.0010259735,0.9923014,0.0005507331,0.00089303125,0.0006201345,0.00001683439,0.00017614558,0.0020836936],"genre_scores_gemma":[0.5583382,0.00012589192,0.43939415,0.0011414293,0.0008297019,0.000017707127,0.00009395469,0.000038255625,0.00002068152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528325,0.00006447801,0.0005635992,0.0019947917,0.0014908131,0.00060308],"domain_scores_gemma":[0.99764085,0.00027201872,0.0003548382,0.0011294754,0.00038155494,0.0002212443],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021042735,0.0005298711,0.00048546848,0.00084545166,0.00041890203,0.0012535304,0.0019614412,0.00028754008,0.000034721652],"category_scores_gemma":[0.00006499545,0.00053915207,0.000108992135,0.00070260256,0.0005663401,0.0016504051,0.0015803084,0.00083693146,0.00002027269],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010652438,0.000049173716,0.00026727072,0.00006516411,0.00002445371,0.000021049167,0.0017694428,0.05694831,0.0000761896,0.10734416,0.00002249007,0.8334016],"study_design_scores_gemma":[0.00039913665,0.00007217915,0.00034204448,0.00021030712,0.000017999982,0.00004146537,2.1849358e-7,0.66458,0.00008701949,0.33335865,0.0004460247,0.0004449889],"about_ca_topic_score_codex":0.000045450546,"about_ca_topic_score_gemma":0.00042659664,"teacher_disagreement_score":0.8329567,"about_ca_system_score_codex":0.00025976045,"about_ca_system_score_gemma":0.00034392302,"threshold_uncertainty_score":0.9997833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036985584,0.00036225948,0.9855194,0.0004930842,0.00106964,0.00048612588,0.00002069189,0.00026591512,0.011745904],"genre_scores_gemma":[0.19514018,0.00006562882,0.79321104,0.010121719,0.0011149757,0.000021555392,0.000023634548,0.00008478444,0.00021649312],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952896,0.000030602096,0.00050873955,0.0018793226,0.0013352302,0.0009564689],"domain_scores_gemma":[0.9965459,0.00046592555,0.00030636415,0.002095697,0.00029528758,0.00029082317],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010586082,0.0006517187,0.00061451475,0.0013201456,0.00029814485,0.0014857518,0.0060826372,0.0003532011,0.00006263396],"category_scores_gemma":[0.000028157117,0.00051841955,0.00015042248,0.001206854,0.0010184891,0.0018005269,0.0015484515,0.0010275437,0.00005066003],"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.000079883954,0.00009275807,0.0010572838,0.00008587052,0.00004836583,0.0004683862,0.0006139762,0.0086956285,0.000035633046,0.20555013,0.00011628969,0.7831558],"study_design_scores_gemma":[0.0035148286,0.001273591,0.0025529466,0.0014380153,0.00006560871,0.0005287447,4.332966e-7,0.24145503,0.003977525,0.70822084,0.032975197,0.003997251],"about_ca_topic_score_codex":0.000041252653,"about_ca_topic_score_gemma":0.00024156549,"teacher_disagreement_score":0.77915853,"about_ca_system_score_codex":0.00013794935,"about_ca_system_score_gemma":0.00046230186,"threshold_uncertainty_score":0.9997267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033511613,0.00012105325,0.90663993,0.00088569766,0.00010120194,0.00013472489,0.000004792114,0.0003466628,0.05825432],"genre_scores_gemma":[0.9575653,0.000040910858,0.041262753,0.000842596,0.000026188338,0.000008556252,0.0000018462381,0.000005491072,0.0002463528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914247,0.000026454589,0.000094549534,0.00030601572,0.00021328445,0.00021721546],"domain_scores_gemma":[0.9992973,0.00003095959,0.000008810697,0.00053521886,0.000034940786,0.00009273767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076258395,0.00010415558,0.00009745025,0.00008035696,0.00009978563,0.00015625458,0.00052596873,0.000037750026,0.0007895108],"category_scores_gemma":[0.0000030327938,0.00007451936,0.000048377697,0.0005355594,0.000058491074,0.00059907895,0.000040206,0.00009577107,0.00016097295],"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.000025477053,0.00048399135,0.00079457834,0.000015455573,0.00006363865,0.00011121361,0.0055104513,0.0000064319397,0.00024783803,0.88536566,0.02336054,0.0840147],"study_design_scores_gemma":[0.020800715,0.004884268,0.031113869,0.00024150404,0.00020855373,0.0015679166,0.0010905104,0.16620421,0.042215392,0.1456678,0.578917,0.007088235],"about_ca_topic_score_codex":0.000062317515,"about_ca_topic_score_gemma":0.00017562488,"teacher_disagreement_score":0.92405367,"about_ca_system_score_codex":0.0000074459226,"about_ca_system_score_gemma":0.000008607425,"threshold_uncertainty_score":0.8644589},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10850943,0.00030911074,0.8860016,0.0004583211,0.001986308,0.00009588204,0.000015170711,0.00007638791,0.0025477766],"genre_scores_gemma":[0.8318058,0.00004259128,0.16685118,0.00058965606,0.00067827967,0.0000063698635,0.000015364138,0.00001044478,2.7772984e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767417,0.00004679207,0.0006071892,0.00021189934,0.0010777035,0.00038223344],"domain_scores_gemma":[0.99816346,0.00013198635,0.0006237193,0.0003324755,0.00047748166,0.000270846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092841696,0.00021051044,0.0002552679,0.00095147145,0.00010633882,0.00026246492,0.0016992913,0.00010083174,0.000054541753],"category_scores_gemma":[0.000032425014,0.0001900566,0.00037851854,0.0006840051,0.000094538016,0.0012812146,0.00015866685,0.00037459785,0.000024670984],"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.00025120238,0.0005891706,0.06736135,0.000010945404,0.0003332917,0.00001760619,0.0011269944,0.00018801191,0.0072870073,0.90596795,0.0019100443,0.014956397],"study_design_scores_gemma":[0.014451516,0.00092614786,0.26645744,0.00049881806,0.000314318,0.0007437977,0.0009141929,0.004764247,0.1018065,0.25478226,0.35147586,0.002864918],"about_ca_topic_score_codex":0.000005703361,"about_ca_topic_score_gemma":0.0000014150592,"teacher_disagreement_score":0.7232964,"about_ca_system_score_codex":0.000052049756,"about_ca_system_score_gemma":0.00007893205,"threshold_uncertainty_score":0.7750283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04924405,0.000054805376,0.9262826,0.0013257491,0.00004764975,0.005723184,0.0000054755856,0.00021370171,0.017102798],"genre_scores_gemma":[0.927682,0.000010734411,0.07096639,0.00038555195,0.000004866248,0.00091984175,0.000025288507,0.00000147995,0.000003856689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994535,0.00005969316,0.00017122149,0.00009093978,0.00012847011,0.0000961752],"domain_scores_gemma":[0.9992959,0.000023835944,0.00004848228,0.0005047694,0.00005755835,0.00006947197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059151626,0.00005332646,0.00006644335,0.00008925412,0.000040464904,0.0001757003,0.00037964553,0.00003607002,0.0000028729773],"category_scores_gemma":[0.000041205796,0.000047737947,0.000011454141,0.00028907668,0.00003194171,0.002254199,0.0002491127,0.000083367086,0.000022314358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012496498,0.000071466195,0.011596776,0.000012739919,0.000001918152,4.834746e-7,0.0026956168,0.000013071709,0.00001066412,0.9154637,0.0028697175,0.06725134],"study_design_scores_gemma":[0.0037559832,0.00028919542,0.12464422,0.000100863384,0.000002929609,0.000021491589,0.0005084192,0.11214797,0.0010991062,0.63520885,0.121663645,0.000557327],"about_ca_topic_score_codex":0.00018617633,"about_ca_topic_score_gemma":0.00023235769,"teacher_disagreement_score":0.87843794,"about_ca_system_score_codex":0.0000138611,"about_ca_system_score_gemma":0.000033303022,"threshold_uncertainty_score":0.1946697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077401,0.0000092327955,0.91774005,0.0033661334,0.000104055696,0.000834172,0.0000030429162,0.00013119294,0.00041113206],"genre_scores_gemma":[0.6369223,0.00000199495,0.3609009,0.0014447906,0.00006817474,0.00060398516,0.000016295826,0.0000073850338,0.000034161792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934983,0.000022062273,0.00011438765,0.00024880946,0.000087580185,0.00017733933],"domain_scores_gemma":[0.9994556,0.00002892412,0.000027575825,0.00036918992,0.00007326581,0.00004549515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099779456,0.000072972645,0.000068752306,0.000106502914,0.000051086303,0.00008310367,0.00039141302,0.00004299719,0.00003568479],"category_scores_gemma":[0.000025217209,0.000058719368,0.000031955075,0.00067645864,0.000007972661,0.00047884608,0.00013834589,0.00009187991,0.00003350701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005145648,0.0005009863,0.0021296034,0.00023777445,0.000023178995,0.0000020837724,0.007227826,0.00012752475,0.009893206,0.69979817,0.005195396,0.27481282],"study_design_scores_gemma":[0.0027580895,0.0004133518,0.054263845,0.00007162017,0.0000058069454,0.00002428828,0.00020901153,0.21835376,0.011357346,0.49322557,0.2185399,0.0007774068],"about_ca_topic_score_codex":0.0007248566,"about_ca_topic_score_gemma":0.0003552833,"teacher_disagreement_score":0.5595213,"about_ca_system_score_codex":0.000009777136,"about_ca_system_score_gemma":0.000016630866,"threshold_uncertainty_score":0.23945063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27686697,0.00010021244,0.7219043,0.00021402072,0.00008549621,0.00028379878,0.000022194687,0.0001519025,0.00037110536],"genre_scores_gemma":[0.9206948,0.00002064003,0.079121724,0.00007188481,0.000050793602,0.000022718836,0.000010750664,0.0000040569785,0.0000026314867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915844,0.000025658033,0.00011432339,0.00037899872,0.0001343542,0.00018820904],"domain_scores_gemma":[0.9992601,0.000037185702,0.000032414337,0.0005276166,0.000010029953,0.00013260478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109052875,0.000107431886,0.00010937407,0.000043862405,0.00020005654,0.000055575965,0.00041997022,0.000044951998,0.0000037464865],"category_scores_gemma":[0.000005179623,0.00008849203,0.00004878194,0.00006699612,0.00006655023,0.00035808314,0.00022285202,0.00006977645,0.000004169425],"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.000022484113,0.00042862317,0.0038063908,0.0001319589,0.00003188278,0.00002415634,0.013049268,0.00001923519,0.00021783037,0.96877646,0.002661616,0.010830064],"study_design_scores_gemma":[0.0076351464,0.0074123926,0.08887452,0.00009502199,0.00007684938,0.0014603663,0.002324051,0.1472011,0.008436676,0.26734924,0.46521962,0.003915026],"about_ca_topic_score_codex":0.000025454485,"about_ca_topic_score_gemma":0.0000053821022,"teacher_disagreement_score":0.7014273,"about_ca_system_score_codex":0.0000115955945,"about_ca_system_score_gemma":0.0000113312635,"threshold_uncertainty_score":0.36086002},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067465074,0.000007883169,0.9174828,0.0005834655,0.0008072237,0.00044588707,0.00020230722,0.00027960856,0.0127257705],"genre_scores_gemma":[0.99559784,0.000003737093,0.002935021,0.00095355196,0.00006282621,0.000026818638,0.00040799094,0.0000059570775,0.00000627501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998032,0.000055020744,0.00060032273,0.00029876546,0.000656437,0.00035746355],"domain_scores_gemma":[0.9979922,0.00024033713,0.00034741845,0.00089635863,0.00034156814,0.00018208474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013113196,0.00021775307,0.00017746241,0.0005437205,0.0004402177,0.00041223114,0.00058234396,0.00008298175,0.000040644965],"category_scores_gemma":[0.000119962635,0.00021148157,0.0001511065,0.0008268392,0.00005767956,0.004419172,0.00014358989,0.00032840448,0.00031957726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048023034,0.0046131015,0.00085383275,0.0006256486,0.00028600605,0.0000916357,0.08283973,0.008483034,0.0021317299,0.694355,0.1194937,0.0814243],"study_design_scores_gemma":[0.0035720568,0.0005876859,0.017299367,0.00020582069,0.00004197638,0.00001919377,0.0013910217,0.8631788,0.026389986,0.031117056,0.05523402,0.0009630251],"about_ca_topic_score_codex":0.00009654767,"about_ca_topic_score_gemma":0.000056372406,"teacher_disagreement_score":0.9281328,"about_ca_system_score_codex":0.00013014651,"about_ca_system_score_gemma":0.0000840561,"threshold_uncertainty_score":0.86239684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08195637,0.00003616473,0.9008971,0.00012142609,0.000036069057,0.00003641254,2.0144014e-7,0.000103587154,0.016812658],"genre_scores_gemma":[0.9696539,0.000005169431,0.030194417,0.000051720373,0.000020322475,0.0000027573737,0.000008982203,0.0000015152134,0.00006120696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99952894,0.000025947033,0.000085009946,0.00015896853,0.00009316701,0.00010794844],"domain_scores_gemma":[0.99979115,0.000021308562,0.000020488967,0.0001369353,0.000015595175,0.000014527169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095340576,0.000042085834,0.00004347572,0.00007783079,0.00003954537,0.000065997374,0.00022484899,0.000021019046,0.000042824653],"category_scores_gemma":[0.00001287845,0.00003985447,0.000019713703,0.00042805634,0.0000089566165,0.00039256897,0.000072365365,0.000057870962,0.000018838777],"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.000001620656,0.00005419487,0.012006283,0.000005630528,8.090805e-7,0.0000024584704,0.0006850744,0.00014306823,0.0038222424,0.97799116,0.00044038938,0.0048470604],"study_design_scores_gemma":[0.0020879896,0.00016622643,0.3318215,0.00007004025,0.0000044403837,0.000012107601,0.00035407874,0.26431516,0.05679417,0.27200702,0.07138762,0.0009796573],"about_ca_topic_score_codex":0.00015075243,"about_ca_topic_score_gemma":0.00008778604,"teacher_disagreement_score":0.8876975,"about_ca_system_score_codex":0.000008768409,"about_ca_system_score_gemma":0.000010074204,"threshold_uncertainty_score":0.16252181},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12872703,0.00004433224,0.8604853,0.00006866577,0.00027512427,0.00011565121,6.249157e-7,0.00027634538,0.010006919],"genre_scores_gemma":[0.70648116,0.000006962977,0.2932617,0.00020758217,0.000021892109,0.0000012686737,0.0000026595774,0.000004007997,0.000012766908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99892163,0.000036068526,0.00024720948,0.0003378667,0.00018067159,0.0002765458],"domain_scores_gemma":[0.9994242,0.00002638709,0.000057237317,0.0003472517,0.000030257848,0.000114629045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029990898,0.00011262201,0.000114656454,0.000238822,0.000067977046,0.0000767675,0.0007144255,0.000059795526,0.00008678614],"category_scores_gemma":[0.000014637152,0.00010747744,0.000037280195,0.00076668634,0.000020920814,0.00061969773,0.00030962838,0.00012624227,0.00016482407],"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.000012682846,0.00023085017,0.054480623,0.000010959424,0.000013324206,0.000045251894,0.006669156,0.000003824989,0.00021353702,0.81460834,0.0015969623,0.122114524],"study_design_scores_gemma":[0.002064886,0.00016104862,0.8560905,0.000093266666,0.000006380415,0.00005660096,0.0002246408,0.009974006,0.005163374,0.1186605,0.006642922,0.0008619059],"about_ca_topic_score_codex":0.0005746963,"about_ca_topic_score_gemma":0.00030901397,"teacher_disagreement_score":0.8016099,"about_ca_system_score_codex":0.000019720666,"about_ca_system_score_gemma":0.000105582905,"threshold_uncertainty_score":0.43828028},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006749591,0.000015479765,0.67570937,0.000083662955,0.000121467325,0.000020549123,6.690232e-7,0.00013562677,0.31716356],"genre_scores_gemma":[0.8895081,0.0000016340427,0.10974428,0.00070462684,0.000009210626,9.70567e-7,4.5647695e-7,8.48425e-7,0.000029821196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975467,0.0000057719994,0.000035989884,0.00009245599,0.000041669948,0.00006947363],"domain_scores_gemma":[0.99966943,0.0000047175486,0.0000063066195,0.00027972777,0.00000962938,0.000030211837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004101428,0.000025250549,0.000022311868,0.00002454031,0.000019295692,0.000021176575,0.00034296612,0.000011168724,0.00025362242],"category_scores_gemma":[0.0000016552472,0.000019234842,0.000019830151,0.00010120542,0.00000984228,0.0003095515,0.00011397031,0.0000210534,0.00018150348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.132673e-7,0.000019054703,0.0016570735,4.7738024e-7,0.0000013391891,0.0000027510087,0.0004640798,1.0841249e-9,0.000030738298,0.9906601,0.0018862028,0.0052776183],"study_design_scores_gemma":[0.0004542583,0.00020885067,0.24396205,0.000005857711,0.000004406618,0.000050303348,0.000052636628,0.00068212714,0.0383945,0.63266146,0.083040506,0.00048306087],"about_ca_topic_score_codex":0.000032181295,"about_ca_topic_score_gemma":0.000008005268,"teacher_disagreement_score":0.88275856,"about_ca_system_score_codex":7.767758e-7,"about_ca_system_score_gemma":0.0000035849189,"threshold_uncertainty_score":0.27769879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06373426,0.0001688168,0.9314685,0.00021119323,0.00020433152,0.0002001128,0.000023606537,0.00028962412,0.003699564],"genre_scores_gemma":[0.9149965,0.00004907675,0.08393685,0.0008367032,0.000072220224,0.00004520349,0.000041021598,0.000018286773,0.0000041219037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978554,0.00011794513,0.00029393713,0.00086582336,0.00031246562,0.0005543878],"domain_scores_gemma":[0.9982522,0.00019669949,0.00013106383,0.0010062823,0.00011066223,0.00030307643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007480258,0.00031034712,0.00032170006,0.00050317484,0.00040495518,0.000974725,0.0010211287,0.00011909602,0.00005315057],"category_scores_gemma":[0.000039006252,0.00028981562,0.00022466242,0.0011750088,0.00015701137,0.0011099031,0.00026086852,0.00025724125,0.000013778089],"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.00008394043,0.0004066045,0.05771164,0.00014217454,0.0001562186,0.000018495379,0.0008333901,0.00010786882,0.004526821,0.8906439,0.005898429,0.039470494],"study_design_scores_gemma":[0.0040427344,0.0015762184,0.053418808,0.00028788394,0.000103469465,0.000044075376,0.00031808298,0.49597114,0.011429571,0.25440425,0.1758593,0.0025444562],"about_ca_topic_score_codex":0.00016472979,"about_ca_topic_score_gemma":0.0000330152,"teacher_disagreement_score":0.8512623,"about_ca_system_score_codex":0.000010346039,"about_ca_system_score_gemma":0.000034958648,"threshold_uncertainty_score":0.9999554},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24398598,0.0012789828,0.75194484,0.00005908283,0.0004231839,0.001038742,0.00014258061,0.0003013062,0.00082532864],"genre_scores_gemma":[0.9728279,0.0000093430635,0.026852394,0.00020225758,0.000034299766,0.00004774974,0.00001869039,0.000006761743,5.9097545e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986791,0.00006361685,0.00021966745,0.00049315766,0.00019384029,0.00035058966],"domain_scores_gemma":[0.9988742,0.00004536183,0.00009949752,0.0005585996,0.00017346366,0.00024888446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017453257,0.00014794071,0.00018416194,0.00012454638,0.0002361841,0.00020177446,0.0006851969,0.00006830032,0.0000066910497],"category_scores_gemma":[0.000011251896,0.00011975822,0.000058860132,0.00031035583,0.000033368047,0.0005021739,0.00020211634,0.00008255975,0.000002891891],"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.00011389547,0.00035322818,0.010948129,0.00073381636,0.000032619235,0.000011601986,0.0138871595,0.000018547842,0.000021107486,0.95533466,0.0009903912,0.01755487],"study_design_scores_gemma":[0.01455138,0.0041673966,0.038779028,0.0003105135,0.00013945487,0.00012671197,0.01717948,0.899003,0.0024661813,0.0023571374,0.018518582,0.0024010947],"about_ca_topic_score_codex":0.00015241983,"about_ca_topic_score_gemma":0.000051254316,"teacher_disagreement_score":0.9529775,"about_ca_system_score_codex":0.000032014148,"about_ca_system_score_gemma":0.000058093457,"threshold_uncertainty_score":0.48835984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3273478,0.0000503877,0.6705692,0.000060416918,0.00041433258,0.000042989275,4.309078e-7,0.00009422322,0.0014202812],"genre_scores_gemma":[0.9683068,6.840576e-7,0.03075067,0.00020847397,0.00071949605,3.0294308e-7,0.0000035393239,0.0000040439218,0.0000060327793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991256,0.000027128548,0.00016181917,0.00021559752,0.00013545771,0.00033437245],"domain_scores_gemma":[0.99963343,0.000023244911,0.000047948037,0.00019318503,0.0000121854355,0.0000900284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037465498,0.00008645395,0.00010196956,0.00011217245,0.00015330064,0.00013117085,0.0003286062,0.00005649372,0.0000368908],"category_scores_gemma":[0.000009143215,0.000087145614,0.000051294308,0.000563138,0.000014059061,0.0009547887,0.000360842,0.00013676738,0.000012284649],"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.000011472798,0.00008208368,0.12635271,0.000013119913,0.0000105734,0.0000017421154,0.0050534834,0.00007252999,0.00041159417,0.8442406,0.0012428573,0.0225072],"study_design_scores_gemma":[0.0017280527,0.00006490091,0.24846873,0.00005880792,0.00002434269,0.00003827201,0.00072973344,0.67640764,0.00052290614,0.05896465,0.012111232,0.0008807153],"about_ca_topic_score_codex":0.0005101036,"about_ca_topic_score_gemma":0.000054614073,"teacher_disagreement_score":0.785276,"about_ca_system_score_codex":0.000033126453,"about_ca_system_score_gemma":0.000025813128,"threshold_uncertainty_score":0.35536948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17176315,0.00012342063,0.8229183,0.00075740064,0.00065071206,0.0012149429,0.00046160773,0.0003551379,0.0017553457],"genre_scores_gemma":[0.9885493,0.000037477457,0.009595314,0.00094049284,0.00015964193,0.00014846644,0.00056220766,0.000004774132,0.0000023334183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984765,0.000057102665,0.000466336,0.00018015351,0.00037486348,0.0004450218],"domain_scores_gemma":[0.9984358,0.00013692197,0.00026563302,0.0006352728,0.00032339865,0.0002029544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083856704,0.00017963182,0.00016926839,0.00019344293,0.00033708903,0.00043267992,0.0007279527,0.00012662972,0.000055167122],"category_scores_gemma":[0.00016039367,0.00017682038,0.00015642925,0.0004804117,0.00005602398,0.0127599845,0.00021060444,0.00015171577,0.00035086577],"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.00003214595,0.00031413697,0.0076172557,0.00042217626,0.000045687382,1.7777467e-7,0.059229113,0.000051541276,0.000012694714,0.9035443,0.013100792,0.015629988],"study_design_scores_gemma":[0.0015906125,0.00008538214,0.042916883,0.00007184306,0.000057098358,0.000021830836,0.0018681128,0.15288043,0.0022447666,0.02619411,0.7712057,0.0008631948],"about_ca_topic_score_codex":0.00004812789,"about_ca_topic_score_gemma":0.000017524902,"teacher_disagreement_score":0.8773502,"about_ca_system_score_codex":0.000051602437,"about_ca_system_score_gemma":0.00005743575,"threshold_uncertainty_score":0.9250681},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010668735,0.00009372918,0.98671824,0.00019293789,0.00023087533,0.00029166852,0.000008530367,0.00012194584,0.0016733235],"genre_scores_gemma":[0.6712596,0.0000070951046,0.3283521,0.000306012,0.000043297037,0.000016570266,0.0000049509326,0.0000049908126,0.0000054101256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865294,0.000020801144,0.000289308,0.0003758815,0.00021152152,0.00044955133],"domain_scores_gemma":[0.9990516,0.00025817295,0.00005588432,0.00046687084,0.00004633323,0.000121173456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010441076,0.00012210451,0.00012863071,0.00037139805,0.00009300383,0.00011918577,0.0006076978,0.00006526064,0.000009054579],"category_scores_gemma":[0.000066399,0.00011227609,0.00009217194,0.0007601932,0.00004453331,0.00032357813,0.00019291184,0.00013034599,0.000003812275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021041506,0.00016430143,0.004425486,0.000031676995,0.0000059732815,0.000014681065,0.00040885506,0.0000063308985,0.0008836585,0.9425283,0.00038678863,0.051122922],"study_design_scores_gemma":[0.00519197,0.0011824503,0.09062042,0.000073822084,0.000027729526,0.000034329732,0.00049455534,0.09458766,0.01115309,0.71135056,0.08348267,0.0018007569],"about_ca_topic_score_codex":0.00009232502,"about_ca_topic_score_gemma":0.00033299281,"teacher_disagreement_score":0.6605908,"about_ca_system_score_codex":0.00002640033,"about_ca_system_score_gemma":0.000035118053,"threshold_uncertainty_score":0.4578486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010604287,0.00088144856,0.9958289,0.0004031757,0.0005571748,0.0004886357,0.000008956039,0.00018200814,0.0005892654],"genre_scores_gemma":[0.6230999,0.000093807765,0.37617567,0.00041663664,0.00011740548,0.000008622464,0.000063873034,0.000020591788,0.0000034624134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971299,0.000065891865,0.0005006945,0.0010882847,0.00073785824,0.00047738053],"domain_scores_gemma":[0.99746156,0.00051955803,0.00044524367,0.0010201612,0.00035334966,0.00020011471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007995254,0.00048541956,0.00042805972,0.000726583,0.00046115,0.00067909865,0.0013676337,0.00025121702,0.000007892635],"category_scores_gemma":[0.000021080743,0.00042695494,0.000071004906,0.0006282575,0.0008483222,0.0020989869,0.0009574237,0.00084503985,0.000017434886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032448377,0.00011819826,0.0007128031,0.00009227944,0.000029424593,0.0000138488085,0.00277218,0.04828728,0.000082627506,0.021141255,0.00004127438,0.9266764],"study_design_scores_gemma":[0.0005237772,0.00017399751,0.0014717204,0.00045293456,0.000019089452,0.00015101246,0.0000010759808,0.87906545,0.00036732847,0.11672209,0.0003729731,0.00067852344],"about_ca_topic_score_codex":0.000057675035,"about_ca_topic_score_gemma":0.00024415465,"teacher_disagreement_score":0.92599785,"about_ca_system_score_codex":0.00015549696,"about_ca_system_score_gemma":0.00014278405,"threshold_uncertainty_score":0.9998182},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5634069,0.009647445,0.42593017,0.00010352757,0.00076146587,0.00009446568,0.0000025203474,0.000015470654,0.000038034246],"genre_scores_gemma":[0.9863546,0.0026145303,0.0104428865,0.00028069475,0.00029023548,0.0000023243144,0.000006455364,0.0000074521354,8.371839e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980257,0.000101408994,0.00078201696,0.00025574717,0.00049132964,0.00034379456],"domain_scores_gemma":[0.99872553,0.00037966264,0.0003971663,0.00016596363,0.00020776286,0.00012391781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023683582,0.0001596332,0.0002647484,0.0005430838,0.00006869189,0.0003483248,0.00095672475,0.0001472866,0.000017952489],"category_scores_gemma":[0.000083945444,0.00014729447,0.00012118135,0.0006593731,0.00007726468,0.0018036438,0.00026297013,0.00072174007,4.0260085e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040318486,0.0029027415,0.28892413,0.0001243487,0.00040273857,0.005151521,0.011585566,0.049184076,0.00018207892,0.052540217,0.00059082254,0.5843799],"study_design_scores_gemma":[0.011314189,0.0009864301,0.12930247,0.0037178732,0.00005046039,0.0008207672,0.0014388706,0.78315157,0.0006057159,0.04265435,0.024629345,0.0013279488],"about_ca_topic_score_codex":0.000018560444,"about_ca_topic_score_gemma":0.001599732,"teacher_disagreement_score":0.7339675,"about_ca_system_score_codex":0.000071889976,"about_ca_system_score_gemma":0.000070272115,"threshold_uncertainty_score":0.6006494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07067063,0.00038323452,0.9267623,0.000011880109,0.0002513432,0.00067023106,0.000017891663,0.00033939842,0.0008930848],"genre_scores_gemma":[0.95949525,3.5679406e-7,0.040158752,0.00011033448,0.000087462984,0.00012177898,0.0000125728575,0.000011647256,0.000001862556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983613,0.0001695077,0.0002577127,0.00038426087,0.00035809443,0.00046914938],"domain_scores_gemma":[0.9986388,0.000086452346,0.00014805525,0.0007353133,0.00017644811,0.00021490215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000630849,0.00021080891,0.00024085677,0.00025127016,0.00023372525,0.00053153123,0.00096838607,0.00008450015,0.000020376114],"category_scores_gemma":[0.000008926687,0.00016461196,0.00010245752,0.000887933,0.00006376298,0.0036687057,0.0001299375,0.00013007424,0.000029285648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004547719,0.003596636,0.13868481,0.0015936359,0.00019489607,0.000026376561,0.0019877127,0.011994268,0.011074323,0.8193855,0.00056881254,0.010438238],"study_design_scores_gemma":[0.0040525496,0.00037627065,0.0035245116,0.00028048365,0.00010339515,0.00002425115,0.00012760809,0.9698502,0.017927242,0.00096292625,0.002041019,0.0007295576],"about_ca_topic_score_codex":0.00014460931,"about_ca_topic_score_gemma":0.00007335228,"teacher_disagreement_score":0.95785594,"about_ca_system_score_codex":0.00009367625,"about_ca_system_score_gemma":0.00017692754,"threshold_uncertainty_score":0.6712681},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008072258,0.00009730799,0.9838777,0.002262671,0.002946035,0.00021837864,0.00016192792,0.000031400356,0.0023322806],"genre_scores_gemma":[0.99517584,0.000029697094,0.003128376,0.0012331076,0.00040032546,0.0000059091763,0.000017015533,0.0000017268802,0.000008029255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825877,0.000026979109,0.00081259804,0.000061404295,0.00070359814,0.00013665707],"domain_scores_gemma":[0.99745953,0.00008627429,0.00088101905,0.00015677912,0.0013344743,0.00008194072],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006472607,0.00009698425,0.0001725207,0.0004962331,0.00006332906,0.0012672313,0.0016269748,0.000049084545,0.0000038351122],"category_scores_gemma":[0.00012281275,0.000080367,0.00014332798,0.00016696764,0.000015439447,0.00894215,0.000058486487,0.00009733481,0.000016595031],"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.00024371299,0.00014783292,0.0024698055,0.000045551507,0.00036074623,0.000007373871,0.0019500806,0.0020966497,0.00055686606,0.92167103,0.040904075,0.02954625],"study_design_scores_gemma":[0.010515653,0.000567515,0.018006776,0.00043171525,0.00003741443,0.0008924422,0.0005309395,0.07400728,0.0013771588,0.015948482,0.87713444,0.0005501578],"about_ca_topic_score_codex":0.000017463526,"about_ca_topic_score_gemma":0.0000010935179,"teacher_disagreement_score":0.9871036,"about_ca_system_score_codex":0.00006842788,"about_ca_system_score_gemma":0.00012041383,"threshold_uncertainty_score":0.99976957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6780592,0.000021696738,0.2663783,0.003736356,0.002472414,0.0005353342,0.0008196308,0.0013126207,0.04666442],"genre_scores_gemma":[0.98325455,0.0000036007523,0.014484598,0.0014031774,0.00024466726,0.000022501441,0.0005794325,0.0000046460527,0.0000028051466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985496,0.00002066639,0.00039824608,0.0002267505,0.00049855857,0.00030619078],"domain_scores_gemma":[0.99886715,0.000040534545,0.00020309763,0.00050892076,0.00024631864,0.00013397544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514315,0.00017202919,0.00014878636,0.0001906055,0.0004328073,0.00060578017,0.001079519,0.0001950123,0.0003097503],"category_scores_gemma":[0.00006688173,0.00017903159,0.00012841201,0.00055811583,0.00008184307,0.007149098,0.00042118205,0.00062599865,0.00030507726],"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.0000056090557,0.000033626406,0.0007000915,0.000028245886,0.000012369416,0.0000012523706,0.00578939,0.0000011630133,0.00014572455,0.98263115,0.009586235,0.0010651655],"study_design_scores_gemma":[0.0011771249,0.000050441904,0.02112862,0.00001538266,0.000009619722,0.00006250907,0.00031899664,0.029323153,0.0010741194,0.46646714,0.47962576,0.0007471474],"about_ca_topic_score_codex":0.00003159231,"about_ca_topic_score_gemma":0.000078291756,"teacher_disagreement_score":0.516164,"about_ca_system_score_codex":0.000020053842,"about_ca_system_score_gemma":0.00009161466,"threshold_uncertainty_score":0.73006964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007253077,0.0023335791,0.98671436,0.0010251603,0.00061561016,0.00039576882,0.000012046658,0.000026744921,0.0016236342],"genre_scores_gemma":[0.7483921,0.00019758812,0.25103524,0.0000900937,0.00017037275,0.00010229681,0.0000052312357,0.0000035178848,0.0000035492267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981933,0.00015974884,0.00062959624,0.0002252761,0.00056306605,0.00022900604],"domain_scores_gemma":[0.99713314,0.00070073555,0.00041118634,0.0006507991,0.000975513,0.00012865337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026644242,0.00011811988,0.00022371816,0.00031512056,0.00037351262,0.00028445254,0.004337571,0.00007438886,0.000003757007],"category_scores_gemma":[0.00009120277,0.00010134658,0.00010705756,0.00091207115,0.00019824447,0.0006053282,0.0005219055,0.00026142746,0.0000017853636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017576045,0.00012113328,0.0019099093,0.0000069613393,0.000032611108,0.0000014276761,0.004272883,0.0016453223,0.000008679365,0.9858033,0.00037164456,0.005808573],"study_design_scores_gemma":[0.0013952904,0.0009589614,0.005676277,0.0013583013,0.00006252699,0.00016699612,0.012226317,0.19535269,0.0003021715,0.65983146,0.121761225,0.0009077667],"about_ca_topic_score_codex":0.000027550084,"about_ca_topic_score_gemma":0.00005967055,"teacher_disagreement_score":0.741139,"about_ca_system_score_codex":0.00004309316,"about_ca_system_score_gemma":0.00008453648,"threshold_uncertainty_score":0.8060358},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010436497,0.0022869462,0.985948,0.000047447134,0.00034333547,0.00036092612,0.000008636108,0.00022605943,0.00034211625],"genre_scores_gemma":[0.48942745,0.00017748123,0.5099155,0.00031252048,0.00008078864,0.000051197436,0.000021895803,0.000006074667,0.000007116013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901015,0.000036529374,0.00014829297,0.00030495026,0.00010276785,0.00039734034],"domain_scores_gemma":[0.99915063,0.00009597245,0.0000468837,0.0005004595,0.000033476357,0.00017254805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038411544,0.00013273445,0.00011713008,0.000060579405,0.00016968767,0.00022442492,0.000444001,0.00009843981,0.000025032052],"category_scores_gemma":[0.000008025588,0.00010888442,0.00004620768,0.00035104438,0.000030009642,0.00084280706,0.00021539384,0.0001535676,0.000003342712],"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.000010623633,0.00010105809,0.0016850053,0.0000149968555,0.00002154383,8.448043e-7,0.0011794519,0.000045724835,0.0000020720756,0.8338897,0.0010943162,0.16195466],"study_design_scores_gemma":[0.0010470657,0.00067473284,0.011581749,0.0001543007,0.00006432451,0.000017062277,0.0034881015,0.42464426,0.00015770146,0.10189408,0.45518225,0.0010943799],"about_ca_topic_score_codex":0.0000044305552,"about_ca_topic_score_gemma":0.000011520865,"teacher_disagreement_score":0.73199564,"about_ca_system_score_codex":0.000010138256,"about_ca_system_score_gemma":0.0000045333886,"threshold_uncertainty_score":0.44401777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012650585,0.000020806427,0.9845871,0.0012672468,0.00016772615,0.0004177363,0.0000021294034,0.00005304995,0.0008336323],"genre_scores_gemma":[0.95674473,0.0000065917343,0.042952254,0.00005323706,0.000026875972,0.00017188901,9.1599327e-7,0.000001577421,0.000041911833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996305,0.000018538994,0.00009164447,0.00010144606,0.00006999174,0.0000878873],"domain_scores_gemma":[0.9994588,0.00007655669,0.00003601789,0.000303791,0.00010544579,0.000019399793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022592412,0.000035625613,0.00004320292,0.000019868821,0.00011147442,0.00008236327,0.0004009244,0.000023227749,0.0000097370275],"category_scores_gemma":[0.000039843013,0.000019849025,0.00004441577,0.00015750539,0.00003699784,0.00034661143,0.000079409576,0.00005880427,0.000008095459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033558347,0.000026121043,0.00007866244,0.000010310591,0.0000047147237,1.3806072e-8,0.00009937667,3.259323e-7,0.0009023414,0.8910835,0.0024833763,0.10530794],"study_design_scores_gemma":[0.00040313418,0.00023384044,0.013357393,0.000014411676,0.0000043513705,0.0000035760902,0.00020262103,0.07589723,0.037911102,0.80930066,0.062491223,0.00018043065],"about_ca_topic_score_codex":0.00038676677,"about_ca_topic_score_gemma":0.000074263044,"teacher_disagreement_score":0.9440942,"about_ca_system_score_codex":0.0000030131255,"about_ca_system_score_gemma":0.000012254037,"threshold_uncertainty_score":0.08573824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059089497,0.00028165214,0.9387706,0.0007668365,0.0004940495,0.00017294484,0.000016417252,0.000037007492,0.00037101228],"genre_scores_gemma":[0.8745748,0.000009448376,0.12451431,0.00070864544,0.00016631627,0.000005390696,0.000018559373,0.0000022282177,3.149788e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987763,0.000032652046,0.0005735514,0.0000483948,0.00035723468,0.00021184231],"domain_scores_gemma":[0.9979149,0.00013994396,0.00070552825,0.00031086316,0.00077773357,0.00015104993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011803351,0.00009271842,0.00013798033,0.0002432709,0.00012804533,0.0002393837,0.00085410295,0.00006054054,0.000015094085],"category_scores_gemma":[0.00015510884,0.00007974715,0.00011381103,0.00041869216,0.000015613805,0.012227866,0.00010907289,0.0001458248,0.000011847646],"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.0003048932,0.0009478256,0.046645045,0.0029915096,0.00018652898,0.0000011319138,0.06406531,0.0008311014,0.00024901817,0.83766204,0.025889305,0.020226268],"study_design_scores_gemma":[0.0037337637,0.00035807936,0.0435293,0.00035228283,0.00004663699,0.00007804611,0.0012058914,0.30649948,0.006781261,0.037514113,0.5992534,0.00064772525],"about_ca_topic_score_codex":0.0000086994,"about_ca_topic_score_gemma":0.0000018566593,"teacher_disagreement_score":0.8154853,"about_ca_system_score_codex":0.000031906442,"about_ca_system_score_gemma":0.000110599765,"threshold_uncertainty_score":0.88649076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15090549,0.00010992432,0.8378451,0.000092417395,0.0003720188,0.0000902254,0.000032340493,0.00042229815,0.010130201],"genre_scores_gemma":[0.86829233,0.000010006474,0.13143218,0.00019866804,0.00004228404,0.0000058849414,0.000007607875,0.000005334013,0.000005737562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989099,0.0000423596,0.00017081916,0.0003821137,0.00027109004,0.0002237401],"domain_scores_gemma":[0.9990301,0.00003599969,0.000049877188,0.0007085367,0.000062467145,0.000113016395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020553273,0.0001151299,0.00011777024,0.000096990254,0.00011347344,0.00009454007,0.0007051155,0.000057936424,0.0006722798],"category_scores_gemma":[0.00001351823,0.00009746656,0.0000809998,0.00036577552,0.000057731104,0.00019484758,0.0002337914,0.000101626036,0.00031636943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035229546,0.00019493264,0.001460902,0.0000043398604,0.000020213416,0.000028211312,0.0026205978,0.000010759324,0.0008143242,0.9769872,0.0026925227,0.015130764],"study_design_scores_gemma":[0.0033434636,0.0011220155,0.15984574,0.0000952971,0.000072257615,0.00005341444,0.00064423966,0.10143181,0.040687248,0.6445257,0.04610537,0.0020734684],"about_ca_topic_score_codex":0.0004208897,"about_ca_topic_score_gemma":0.00006645958,"teacher_disagreement_score":0.71738684,"about_ca_system_score_codex":0.000015124925,"about_ca_system_score_gemma":0.000033690212,"threshold_uncertainty_score":0.73609924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015087974,0.000026114107,0.9833685,0.000033178043,0.00006276976,0.00020040733,0.0000010134682,0.00016774329,0.0010522591],"genre_scores_gemma":[0.969315,0.000007970366,0.030334057,0.0002546128,0.000012048137,0.00006038415,0.000006807477,0.0000073516894,0.0000017882791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987717,0.000043801352,0.00023608422,0.00044560182,0.00020709838,0.00029567556],"domain_scores_gemma":[0.99950325,0.00005672405,0.0000886082,0.0002671177,0.000016158814,0.000068131165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028118826,0.00014550216,0.00011687974,0.00018433963,0.00010482844,0.000039353545,0.0005788691,0.000082969425,0.00008749074],"category_scores_gemma":[0.000016272008,0.00015730514,0.000032326636,0.00091889664,0.00004124789,0.0003164676,0.00013568487,0.00026224233,0.0002595017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020746337,0.0014761925,0.0026029882,0.00007894197,0.000037031437,0.0000142114,0.012778003,0.034786914,0.024588823,0.76429266,0.00014701151,0.15898977],"study_design_scores_gemma":[0.00022079702,0.00015029036,0.007426455,0.000037140737,0.000008623758,0.000008042558,0.00024084601,0.9240405,0.04040926,0.026242428,0.0007721307,0.0004434621],"about_ca_topic_score_codex":0.00029756283,"about_ca_topic_score_gemma":0.00016743044,"teacher_disagreement_score":0.95422703,"about_ca_system_score_codex":0.000054703472,"about_ca_system_score_gemma":0.000032760676,"threshold_uncertainty_score":0.64147174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50126034,0.0005109484,0.48662457,0.0001598637,0.00002864305,0.00037287408,0.000016801321,0.0002554093,0.010770566],"genre_scores_gemma":[0.7402384,0.00002310005,0.2596717,0.00002458096,0.000014970625,0.000013115486,0.0000019480447,0.000010016981,0.0000021288092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990424,0.000004250489,0.00033608437,0.00024251975,0.00018649729,0.00018825167],"domain_scores_gemma":[0.9992133,0.000045755864,0.00014149993,0.00051195157,0.000030103258,0.000057408666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495551,0.00013811505,0.00024084609,0.000057075442,0.00007993125,0.00008811062,0.00046012708,0.00004985501,0.000015950951],"category_scores_gemma":[0.000029214963,0.000113028356,0.00004554288,0.00015440476,0.0002465161,0.00027849988,0.00037842224,0.00010074736,0.0000052149994],"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.0000029658609,0.000055365566,0.00009413334,0.0001981863,0.000023972481,4.1170765e-7,0.004136958,0.0000040511004,0.019047396,0.9653332,0.000007639554,0.011095723],"study_design_scores_gemma":[0.0025830774,0.00016237391,0.0013008467,0.000944026,0.000115225615,0.00008572802,0.0049045435,0.21155123,0.49590793,0.2788791,0.001957388,0.0016085359],"about_ca_topic_score_codex":0.0000026715109,"about_ca_topic_score_gemma":0.000003926532,"teacher_disagreement_score":0.6864541,"about_ca_system_score_codex":0.000007518433,"about_ca_system_score_gemma":0.000015192264,"threshold_uncertainty_score":0.46091625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15031481,0.00004302346,0.847944,0.00010180902,0.000109954686,0.00006188539,0.000007523757,0.0001350576,0.0012819053],"genre_scores_gemma":[0.708363,0.000015637526,0.29130277,0.00025688187,0.000025985839,0.0000018887288,0.000028984223,0.000002060734,0.000002795869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99934936,0.000029448227,0.00013262169,0.00023171546,0.00014400251,0.00011282843],"domain_scores_gemma":[0.99951714,0.00002055859,0.000042311905,0.0003074863,0.000048226488,0.00006428029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017721855,0.000073277675,0.0000658171,0.000114486225,0.00007251019,0.00007979426,0.00026740434,0.000042163745,0.00009146458],"category_scores_gemma":[0.000016629807,0.00006578828,0.000031600106,0.00028521696,0.000033731663,0.0013136576,0.000096933916,0.00005983725,0.00001909181],"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.000005903926,0.00013559658,0.0062826476,0.000009732271,0.0000039277434,0.0000027123187,0.00043221028,0.0000023288112,0.00073672464,0.98479104,0.00012113795,0.007476019],"study_design_scores_gemma":[0.0009877211,0.00020475184,0.48441452,0.000024393305,0.000017738223,0.000010820174,0.00006834634,0.15196417,0.004670972,0.35432544,0.0028788024,0.000432322],"about_ca_topic_score_codex":0.00017615534,"about_ca_topic_score_gemma":0.00020811804,"teacher_disagreement_score":0.6304656,"about_ca_system_score_codex":0.0000052333207,"about_ca_system_score_gemma":0.000015939146,"threshold_uncertainty_score":0.2682768},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014273544,0.000039291925,0.9832262,0.000812473,0.00016589428,0.00022683232,0.0000018288634,0.0000539841,0.0011999812],"genre_scores_gemma":[0.83261406,0.0000017035883,0.16713694,0.00019909341,0.00002864818,0.000010185516,0.0000040699992,0.00000191128,0.0000033705544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949694,0.00004091433,0.00014936693,0.00013878518,0.000082154664,0.00009185653],"domain_scores_gemma":[0.999386,0.000107484055,0.00006632945,0.00028220168,0.00012484391,0.00003313812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014901422,0.000055234083,0.00006778144,0.000037205165,0.0000993471,0.000114883995,0.00028558448,0.000023958708,0.00008517077],"category_scores_gemma":[0.000017299177,0.000035968962,0.000034658053,0.00034189824,0.000044464694,0.00047887146,0.00012396998,0.000051326246,0.000010795583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002431035,0.00010367244,0.00035830945,0.000038970702,0.00002843265,0.00003961701,0.0021116256,0.04658098,0.000066288,0.9072901,0.009650423,0.03372912],"study_design_scores_gemma":[0.000122004494,0.00002440579,0.00014456187,0.000004441661,0.000002979661,0.00012978219,0.00012182388,0.992267,0.00048492587,0.006473455,0.00016268094,0.00006193802],"about_ca_topic_score_codex":0.00025603536,"about_ca_topic_score_gemma":0.000010668727,"teacher_disagreement_score":0.94568604,"about_ca_system_score_codex":0.0000036305548,"about_ca_system_score_gemma":0.000016506194,"threshold_uncertainty_score":0.14667717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046552066,0.00008470083,0.94277626,0.0027996297,0.00013783854,0.000112726215,0.000004322172,0.00009776038,0.0074347123],"genre_scores_gemma":[0.8810018,0.000003120891,0.118355155,0.00046150613,0.000058264257,0.000004705589,0.000027867058,0.000003341595,0.00008425853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905765,0.000028151213,0.00014602528,0.00028984298,0.0002680804,0.0002102399],"domain_scores_gemma":[0.99959195,0.00003262395,0.000021336684,0.00018415092,0.00010273727,0.00006720168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494588,0.000088431065,0.000100523896,0.00012327475,0.000057818095,0.0002189624,0.00023274081,0.000057930814,0.000013028446],"category_scores_gemma":[0.000012878754,0.00008095501,0.00002212982,0.0006758845,0.000021550215,0.00038700923,0.00018326896,0.00010154023,0.00000901238],"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.000013986877,0.00019458271,0.021111595,0.000017398448,0.0000067188575,0.00002416268,0.0008015626,0.025492363,0.00003786454,0.75461817,0.12691066,0.07077096],"study_design_scores_gemma":[0.0005576087,0.000073093455,0.15973936,0.000017098864,0.0000028036445,0.000012280436,0.00004372249,0.75167817,0.0001117736,0.060121015,0.02734809,0.00029495475],"about_ca_topic_score_codex":0.0009328388,"about_ca_topic_score_gemma":0.00075593306,"teacher_disagreement_score":0.8344497,"about_ca_system_score_codex":0.000012087358,"about_ca_system_score_gemma":0.000015361393,"threshold_uncertainty_score":0.33012497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1673475,0.00085244665,0.8301253,0.000022619328,0.0014463848,0.000060025897,0.000004739048,0.00012442996,0.00001655551],"genre_scores_gemma":[0.8881881,0.00003080927,0.11133836,0.00000535016,0.0004133888,0.000002007591,0.0000021474063,0.000014520564,0.0000052975706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988287,0.000010592831,0.0004917955,0.00016655677,0.0002700703,0.00023230007],"domain_scores_gemma":[0.9991763,0.00020873206,0.000102095335,0.00012507719,0.00026335256,0.00012441084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080939307,0.00016268526,0.00020811922,0.00074122666,0.00002108212,0.00009366299,0.00060473033,0.000069682275,8.7079343e-7],"category_scores_gemma":[0.0004582765,0.0001321979,0.000069521295,0.00039931844,0.000010658649,0.00053891743,0.00017376333,0.00039450565,0.0000013265299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025094138,0.0011631971,0.021217361,0.0012969362,0.0008630973,0.0037301243,0.011508951,0.16285054,0.022166599,0.10909264,0.00026578983,0.6655938],"study_design_scores_gemma":[0.003534497,0.0005109558,0.059640612,0.005165662,0.000029673069,0.0035973256,0.00051023136,0.89025205,0.0060565094,0.00007132188,0.029384939,0.001246216],"about_ca_topic_score_codex":0.000009812096,"about_ca_topic_score_gemma":0.0000075112603,"teacher_disagreement_score":0.7274015,"about_ca_system_score_codex":0.0001401791,"about_ca_system_score_gemma":0.000051129216,"threshold_uncertainty_score":0.5390874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35479945,0.000019885427,0.64406735,0.0002485528,0.000164836,0.000072845,0.0000018719473,0.00029583432,0.00032934765],"genre_scores_gemma":[0.83319414,0.0000085853135,0.16586888,0.00082269206,0.00008339258,0.0000032999887,0.0000066307375,0.000009484317,0.0000028757788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986956,0.00008962575,0.0002168025,0.00042661178,0.00025920273,0.00031214108],"domain_scores_gemma":[0.99887145,0.0000929409,0.000090373454,0.00074867427,0.00008581282,0.00011073726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041149452,0.00015443192,0.00015628572,0.00014975626,0.00021764253,0.00030528478,0.00075986143,0.00007363695,0.000043814325],"category_scores_gemma":[0.000032276756,0.00014213982,0.00006199465,0.0007650521,0.000026830554,0.0014516495,0.00036914466,0.00012775787,0.000092372764],"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.000007532234,0.000109712055,0.0027839667,0.00006197937,0.000023630366,0.0000054143065,0.000778573,0.00019083322,0.031758208,0.9287158,0.00013236524,0.035431944],"study_design_scores_gemma":[0.0009915717,0.00009717198,0.018289573,0.000104889674,0.000024888988,0.000052619107,0.000090817826,0.85917103,0.013767728,0.09744654,0.009226113,0.0007370311],"about_ca_topic_score_codex":0.00023070893,"about_ca_topic_score_gemma":0.000117830496,"teacher_disagreement_score":0.85898024,"about_ca_system_score_codex":0.00002331561,"about_ca_system_score_gemma":0.000028014236,"threshold_uncertainty_score":0.57962936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032282283,0.000016708193,0.69480634,0.000053868873,0.000082019054,0.000014761794,4.6823214e-7,0.00013893294,0.30165866],"genre_scores_gemma":[0.7126133,0.000004441462,0.2870483,0.00028006878,0.000015632217,9.256673e-7,4.7540905e-7,9.541164e-7,0.000035930516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997371,0.0000052074265,0.000035448353,0.000102015794,0.000044899032,0.0000753738],"domain_scores_gemma":[0.9996527,0.000004757859,0.000006907943,0.0002959943,0.0000072605612,0.000032396383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039639555,0.000027034275,0.00002471811,0.000026130061,0.000023015327,0.000019252879,0.00037271826,0.000010448772,0.00035282128],"category_scores_gemma":[0.0000020071109,0.000021268637,0.000021435671,0.00014180102,0.000010704457,0.0002532173,0.000091764705,0.000024841002,0.00017165334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5009438e-7,0.000018470331,0.0007646996,3.7885724e-7,0.0000011601047,0.0000034981604,0.00029970668,3.2917287e-9,0.00001805131,0.99204826,0.0022637597,0.0045816666],"study_design_scores_gemma":[0.00020431813,0.000090197434,0.07820366,0.0000027121007,0.0000022095048,0.000022015058,0.000055531884,0.001140879,0.01644327,0.8521885,0.051402733,0.00024392885],"about_ca_topic_score_codex":0.000050264454,"about_ca_topic_score_gemma":0.000018718241,"teacher_disagreement_score":0.70938504,"about_ca_system_score_codex":0.0000011579958,"about_ca_system_score_gemma":0.0000047916756,"threshold_uncertainty_score":0.38631457},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31583142,0.009020707,0.6120307,0.023223484,0.0020528396,0.0027345896,0.00011075946,0.0023255046,0.03267002],"genre_scores_gemma":[0.98054624,0.00030741174,0.017337875,0.0015125674,0.0000970335,0.000042801217,0.00014301714,0.000010102948,0.0000029627988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865025,0.0001484173,0.00023059607,0.00042413204,0.00026672953,0.00027990073],"domain_scores_gemma":[0.9973572,0.00019533347,0.00013919947,0.0020526142,0.000111734575,0.00014391023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068687723,0.00020718646,0.00017314547,0.000114068804,0.00050475495,0.0003507911,0.0013501189,0.0003607813,0.000033360466],"category_scores_gemma":[0.000032913587,0.00019882442,0.000085581094,0.00051653595,0.00016214863,0.0006101239,0.00039856418,0.0016419629,0.000007276819],"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.000050291397,0.00036295125,0.0011428841,0.00002714491,0.000017805572,0.0000024401265,0.0009554513,0.0002536987,0.00021862361,0.9817604,0.0032533247,0.011954975],"study_design_scores_gemma":[0.00064424553,0.000106938416,0.002987067,0.00007256748,0.000010491237,0.00000746171,0.00004287337,0.9046326,0.00011012732,0.06635299,0.024667438,0.00036517315],"about_ca_topic_score_codex":0.000019227444,"about_ca_topic_score_gemma":0.00028256493,"teacher_disagreement_score":0.9154074,"about_ca_system_score_codex":0.000010570611,"about_ca_system_score_gemma":0.000039217768,"threshold_uncertainty_score":0.81078243},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16158639,0.000044733955,0.83290887,0.0023468817,0.00039943637,0.0023742865,0.000063067266,0.000049831884,0.0002265233],"genre_scores_gemma":[0.41471756,0.00006169573,0.5819413,0.0014078179,0.0013544178,0.0003883863,0.00008783103,0.000027822534,0.0000131394345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998279,0.000055623346,0.00094259233,0.0001621267,0.00032648895,0.00023418042],"domain_scores_gemma":[0.9977031,0.000726511,0.0007060373,0.00022198696,0.00050872506,0.00013364357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015829856,0.00014268619,0.0002907434,0.00036400344,0.00018244107,0.00013235475,0.0002956245,0.00017374012,0.000006316502],"category_scores_gemma":[0.0014552062,0.0001117185,0.00009710166,0.0003518257,0.0000965998,0.0024582676,0.00006680983,0.0002984529,0.000009620681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016372006,0.00028599467,0.00008938167,0.0005539274,0.00005907671,0.0000136938315,0.00041893497,0.000012282099,0.00020154058,0.9921995,0.0023191436,0.0022093647],"study_design_scores_gemma":[0.002289629,0.0020628618,0.0019513095,0.00032417104,0.000030179088,0.0014646741,0.0002548458,0.0004106401,0.00096030615,0.9847875,0.005266846,0.00019703618],"about_ca_topic_score_codex":2.549889e-7,"about_ca_topic_score_gemma":0.0000018367417,"teacher_disagreement_score":0.25313118,"about_ca_system_score_codex":0.000042218122,"about_ca_system_score_gemma":0.00015937407,"threshold_uncertainty_score":0.45557484},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002341144,0.00025004422,0.99185956,0.001441,0.0006279355,0.00051347713,0.0028754848,0.00005656226,0.000034819717],"genre_scores_gemma":[0.9987816,0.00009257195,0.00029785442,0.00036645582,0.0002038468,0.00009869332,0.00015026817,0.0000059505433,0.000002714893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986245,0.00018652275,0.00026861925,0.0004615791,0.00016450463,0.00029426426],"domain_scores_gemma":[0.9986003,0.00030914144,0.00007998729,0.0008771214,0.00003587438,0.00009756406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316149,0.00016617101,0.00024327767,0.0001242732,0.0003503543,0.0006369625,0.000993354,0.00008846918,5.3414027e-7],"category_scores_gemma":[0.00001563682,0.00012185285,0.000042168555,0.0004331083,0.00006209921,0.0005552353,0.000013115363,0.00017462317,0.0000016659716],"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.0015366679,0.0021825416,0.002898353,0.0018966334,0.00071232964,0.000039383252,0.006266911,0.45123047,0.00045114983,0.41818684,0.03812195,0.076476745],"study_design_scores_gemma":[0.0037880782,0.00016812922,0.0007869602,0.00008520192,0.0000541833,0.00005835095,0.00036725216,0.8984629,0.000014432548,0.003995669,0.091825806,0.0003930355],"about_ca_topic_score_codex":0.000803212,"about_ca_topic_score_gemma":0.00023628793,"teacher_disagreement_score":0.99644053,"about_ca_system_score_codex":0.000013024517,"about_ca_system_score_gemma":0.000037393922,"threshold_uncertainty_score":0.6142244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040517393,0.0031013188,0.99122745,0.0006158754,0.00038029172,0.00054932456,0.000012698836,0.000047472695,0.000013809331],"genre_scores_gemma":[0.32578024,0.0004214501,0.6697734,0.0015557081,0.0022286845,0.00019908149,0.000024177476,0.000014630729,0.000002620395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988295,0.000042470183,0.0004275287,0.0002646207,0.00016229133,0.00027360528],"domain_scores_gemma":[0.9983348,0.00032694358,0.0003612995,0.00044664467,0.0002525777,0.00027770107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050895195,0.00015747176,0.00026522396,0.000086699176,0.00029257883,0.00020056235,0.0006858084,0.00013261299,0.0000066728808],"category_scores_gemma":[0.000004163077,0.00013286006,0.00018235632,0.0003434685,0.00005718194,0.0002667054,0.000091312344,0.000452362,0.0000011019016],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027501708,0.0007373806,0.0017429303,0.0000740817,0.00017141532,0.000010673787,0.0002863152,0.02388231,0.0003184297,0.18016754,0.06918584,0.72314805],"study_design_scores_gemma":[0.0010662944,0.00031188305,0.00092347525,0.00002699288,0.000023448565,0.000055356504,0.0000024178805,0.5282492,0.000008353743,0.008786667,0.46040374,0.00014219407],"about_ca_topic_score_codex":3.951936e-7,"about_ca_topic_score_gemma":0.00000719705,"teacher_disagreement_score":0.7230059,"about_ca_system_score_codex":0.000007693263,"about_ca_system_score_gemma":0.00009143787,"threshold_uncertainty_score":0.54178756},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08382814,0.0006509962,0.9082712,0.0003807747,0.0016391042,0.00049726095,0.000043429187,0.00041261507,0.0042764875],"genre_scores_gemma":[0.88111407,0.00011065217,0.11737122,0.00053565466,0.00044014488,0.000080266116,0.000059255388,0.00001697183,0.00027179092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829,0.00005648822,0.00020989351,0.00037080684,0.00032483693,0.0007479671],"domain_scores_gemma":[0.9986399,0.00020195525,0.000064763975,0.00070924364,0.00010437514,0.00027975332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084046344,0.00016537108,0.00017477252,0.00028734142,0.00027072825,0.00018181147,0.00075451133,0.00010422396,0.000085217376],"category_scores_gemma":[0.000060909377,0.00015306764,0.00013862913,0.001395675,0.000043748125,0.0018729387,0.00027635225,0.0001356601,0.00017431568],"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.0000225039,0.0002698054,0.0035356437,0.00008135358,0.000028664716,0.0000016016822,0.00052250415,0.000024528197,0.00084872474,0.9595701,0.028703427,0.006391131],"study_design_scores_gemma":[0.003964894,0.0009401927,0.015800087,0.00006848117,0.00008099578,0.00010533062,0.000784134,0.08152012,0.036403593,0.10047574,0.7577321,0.0021243622],"about_ca_topic_score_codex":0.00031938776,"about_ca_topic_score_gemma":0.000012940498,"teacher_disagreement_score":0.8590944,"about_ca_system_score_codex":0.000051073977,"about_ca_system_score_gemma":0.000055535907,"threshold_uncertainty_score":0.6241917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33449626,0.00032924995,0.6645187,0.00010296403,0.00011689381,0.00022537455,0.0000022376537,0.00010274638,0.000105569496],"genre_scores_gemma":[0.83156383,0.000005243771,0.16819625,0.00013695081,0.00007026875,0.000016131089,0.0000044891544,0.000004515535,0.0000023244431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992354,0.000019225552,0.00014744827,0.0002861721,0.00010084977,0.00021089698],"domain_scores_gemma":[0.99939656,0.00018227653,0.000050609167,0.00024116169,0.00006144462,0.00006796408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014429906,0.00008696593,0.00009465588,0.000054593973,0.00029905696,0.0003050631,0.00045088457,0.000032478692,0.00001187668],"category_scores_gemma":[0.000007036614,0.0000854814,0.000043745127,0.00014646507,0.000019082216,0.0008964757,0.00022696049,0.00006892606,0.000004013885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011132503,0.00016643113,0.013396768,0.0008936801,0.00007236513,0.000002540608,0.014603656,0.0013735753,0.0056605428,0.04701039,0.0010575312,0.9157514],"study_design_scores_gemma":[0.00038727577,0.00005475452,0.023139922,0.00009031327,0.000005461297,0.0000148450135,0.00016539574,0.95004606,0.0007277173,0.019322937,0.005838908,0.00020642718],"about_ca_topic_score_codex":0.00007586714,"about_ca_topic_score_gemma":0.00000402389,"teacher_disagreement_score":0.9486725,"about_ca_system_score_codex":0.000006790215,"about_ca_system_score_gemma":0.000011620213,"threshold_uncertainty_score":0.34858304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64739066,0.0000061674377,0.28900695,0.0008309454,0.00084802555,0.00017887758,0.000012804337,0.00043301834,0.06129256],"genre_scores_gemma":[0.8081356,0.0000017798103,0.19048864,0.0011614953,0.00009615393,0.0000088745755,0.00000774205,0.0000073182923,0.00009237136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991719,0.0000053942326,0.00009996313,0.00034785253,0.00016765387,0.00020722934],"domain_scores_gemma":[0.99902743,0.000016945192,0.000028784163,0.00081380317,0.000027885562,0.00008514164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001765479,0.000092121256,0.00006476274,0.0000654368,0.000071307324,0.00021708933,0.0008819696,0.00004386666,0.00041587203],"category_scores_gemma":[0.0000148217605,0.00007581694,0.000049694114,0.00018614787,0.000027781232,0.0005647049,0.00039603154,0.00021385349,0.00022973643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004416077,0.00010661129,0.0027926927,0.000005989712,0.000010791341,0.000006128354,0.00028183998,6.841712e-8,0.12895408,0.8545853,0.0016477678,0.01160433],"study_design_scores_gemma":[0.0037630228,0.000701163,0.05900904,0.000051515504,0.000015108739,0.000027911125,0.00020044569,0.09461764,0.3308326,0.3636082,0.14495751,0.0022158364],"about_ca_topic_score_codex":0.00005155951,"about_ca_topic_score_gemma":0.000055960838,"teacher_disagreement_score":0.49097705,"about_ca_system_score_codex":0.0000035887358,"about_ca_system_score_gemma":0.000010160485,"threshold_uncertainty_score":0.45535073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004557239,0.00021378683,0.99353456,0.00048584244,0.0005509601,0.00017292208,0.00003881704,0.00007943604,0.00036644703],"genre_scores_gemma":[0.7611955,0.000010135585,0.23725022,0.0010753177,0.0002596326,0.00000428811,0.00019277351,0.0000046751306,0.000007487579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909145,0.000029322828,0.0001477791,0.00030541825,0.00015176693,0.00027425983],"domain_scores_gemma":[0.99848074,0.00014725265,0.00006473155,0.0012032565,0.000020401527,0.00008361542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005204221,0.00008638498,0.00008058124,0.00002858497,0.00013324087,0.00007617697,0.0013628001,0.000036141206,0.00000829648],"category_scores_gemma":[0.000030123389,0.000081279744,0.000018180779,0.0002784549,0.00001430064,0.0016161281,0.00069620466,0.000051290233,0.000073704134],"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.000026924794,0.0009958864,0.027365774,0.00030197864,0.00009794514,7.4606845e-7,0.0033205168,0.0003211008,0.0015012266,0.78660065,0.055471875,0.1239954],"study_design_scores_gemma":[0.00083721254,0.000041504325,0.05458234,0.000040409774,0.000021315422,0.000010317063,0.00012697895,0.51795995,0.0017446595,0.0038523853,0.4202682,0.00051472307],"about_ca_topic_score_codex":0.000040725812,"about_ca_topic_score_gemma":0.000029407349,"teacher_disagreement_score":0.7827482,"about_ca_system_score_codex":0.000010695945,"about_ca_system_score_gemma":0.000013679838,"threshold_uncertainty_score":0.33144918},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78852516,0.00031955485,0.18811491,0.020936161,0.00045633188,0.00030130125,0.00005102657,0.000022414562,0.0012731475],"genre_scores_gemma":[0.985998,0.00003031842,0.0134534715,0.0004543272,0.000056397268,8.914648e-7,6.2809397e-7,0.00000408907,0.0000019109818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985258,0.00017637409,0.00043213513,0.0001592937,0.00051322364,0.0001931934],"domain_scores_gemma":[0.9984467,0.00017721826,0.0005173563,0.0006275059,0.00013862236,0.00009261172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073685875,0.0001394447,0.00026468816,0.00006957798,0.00029673698,0.000107165906,0.001428496,0.000041081857,0.000016256194],"category_scores_gemma":[0.0000861357,0.000069261885,0.00020534717,0.00035167034,0.001145789,0.00030206345,0.0004311622,0.00045075922,0.0000015501112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020206531,0.00014039646,0.00057866605,0.000017155182,0.000028846986,0.0000031078007,0.00064362644,0.000044922315,0.0001362639,0.9977133,0.00030441684,0.0003690451],"study_design_scores_gemma":[0.00054033834,0.00022258882,0.089991644,0.000094988216,0.000012018813,0.00009220235,0.00004288659,0.0005638499,0.00071124313,0.90668184,0.0009601164,0.00008627495],"about_ca_topic_score_codex":0.000076830736,"about_ca_topic_score_gemma":0.00014281625,"teacher_disagreement_score":0.19747281,"about_ca_system_score_codex":0.000026724303,"about_ca_system_score_gemma":0.00007000665,"threshold_uncertainty_score":0.42217073},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073087744,0.00014259541,0.9184412,0.00013752464,0.00057321304,0.00027546176,0.000048588692,0.00034776347,0.0069459304],"genre_scores_gemma":[0.75854,0.0000152564435,0.2401563,0.0011597198,0.000064986074,0.000004887591,0.000048946968,0.000006673054,0.000003248382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986241,0.000063143656,0.00022678573,0.00059675786,0.00018042658,0.00030882846],"domain_scores_gemma":[0.9979291,0.00004786062,0.000057040972,0.0018307607,0.00004431729,0.00009091376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053873996,0.00013217585,0.00014859831,0.00011317715,0.00007731411,0.00008677102,0.0030313807,0.00007176806,0.00011792394],"category_scores_gemma":[0.000009936037,0.00012129201,0.000027296224,0.0008920239,0.000015807467,0.0009210928,0.0025702445,0.0001882641,0.000086375665],"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.0000057069033,0.00021608072,0.00051259826,0.000028381479,0.00001066096,0.00003846616,0.0067575946,0.0000033496608,0.00011572909,0.98263186,0.0016065068,0.0080730375],"study_design_scores_gemma":[0.0017179473,0.0002612621,0.0052455734,0.00012320928,0.00001913033,0.000111467954,0.0020276941,0.5821951,0.004509727,0.37733686,0.025184304,0.0012677176],"about_ca_topic_score_codex":0.0009908088,"about_ca_topic_score_gemma":0.001397077,"teacher_disagreement_score":0.6854522,"about_ca_system_score_codex":0.000008672784,"about_ca_system_score_gemma":0.00003819086,"threshold_uncertainty_score":0.563311},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054566585,0.00006260079,0.93811715,0.00025696342,0.0017964822,0.0006399533,0.00001861401,0.00015636372,0.0043852846],"genre_scores_gemma":[0.9747278,0.0000060366883,0.024973651,0.00008019181,0.000060703136,0.00008773288,0.000014057826,0.0000048674374,0.000044930217],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974283,0.00006977262,0.0005798733,0.00013996987,0.001538803,0.0002432918],"domain_scores_gemma":[0.9987263,0.000011854453,0.0002920353,0.00048759207,0.0002902306,0.00019200392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016352816,0.000115324416,0.00018708008,0.00037897995,0.00013261948,0.00016429667,0.0010616365,0.00010769246,0.000020987889],"category_scores_gemma":[0.00027629052,0.00010664469,0.000060161354,0.0004932184,0.000027123317,0.0034697822,0.00036269517,0.00016461844,0.00005292136],"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.00020882588,0.00029034592,0.034969136,0.0036117125,0.00041368118,0.000028995444,0.6025872,0.000094101546,0.00013582353,0.11229726,0.13517638,0.11018652],"study_design_scores_gemma":[0.00535868,0.0004628498,0.037611626,0.001313133,0.00003792032,0.00021071627,0.022019591,0.038150765,0.008634636,0.0020201702,0.882432,0.0017479464],"about_ca_topic_score_codex":0.00049385324,"about_ca_topic_score_gemma":0.0000028075576,"teacher_disagreement_score":0.92016125,"about_ca_system_score_codex":0.000042983756,"about_ca_system_score_gemma":0.00005057752,"threshold_uncertainty_score":0.43488443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02878214,0.000018837818,0.96452,0.0014462515,0.00024358071,0.004479948,0.000006329007,0.000052915893,0.00045000552],"genre_scores_gemma":[0.9301125,0.0000024316307,0.06884186,0.00039457603,0.00018995,0.00044560808,0.000004789956,0.000007386163,9.3232404e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977298,0.0002395468,0.0009542609,0.00026235636,0.00049845217,0.00031559673],"domain_scores_gemma":[0.9980857,0.00011327667,0.00063266966,0.00059171725,0.00031616577,0.00026049704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096334,0.0001741744,0.00040253127,0.00024040276,0.00010630814,0.00018486667,0.0012989023,0.00014259631,0.00003097638],"category_scores_gemma":[0.00023957022,0.00013215003,0.00018369572,0.0003619183,0.00007028955,0.00051755144,0.00007207611,0.00040774213,0.00004820833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044083146,0.0015047994,0.000042059128,0.00006773228,0.000022303659,0.00007125477,0.0009055814,0.00014201684,0.0023369822,0.9753726,0.002296087,0.0171945],"study_design_scores_gemma":[0.0031424651,0.0023969437,0.0025764038,0.00021309844,0.0000523623,0.0011737865,0.0003849707,0.10278133,0.004338589,0.87588954,0.0064659053,0.0005846058],"about_ca_topic_score_codex":1.4440774e-7,"about_ca_topic_score_gemma":3.8795739e-7,"teacher_disagreement_score":0.90133035,"about_ca_system_score_codex":0.000029838635,"about_ca_system_score_gemma":0.00008038004,"threshold_uncertainty_score":0.5388922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049492717,0.0000027135288,0.9366901,0.0008281811,0.00032531153,0.000105143474,0.0000053694403,0.00013207838,0.012418366],"genre_scores_gemma":[0.9301061,0.000001020331,0.06708758,0.0027613959,0.000031950636,0.0000062572153,0.0000033735646,8.652542e-7,0.0000014415084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891436,0.000028693308,0.00021621338,0.00016630333,0.0004573318,0.00021711185],"domain_scores_gemma":[0.9992362,0.00020471131,0.000088007684,0.00029355046,0.00006977547,0.000107709435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008278951,0.00008002443,0.0000747134,0.00029862786,0.0003278343,0.0006584007,0.0008674991,0.000029367631,0.000007861158],"category_scores_gemma":[0.00029692677,0.00006548818,0.00003555677,0.0010284779,0.00006138275,0.003345278,0.0001281185,0.000060085564,0.00042178476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016049387,0.0000780763,0.0008955363,0.000020269412,0.0000032228602,4.9342174e-7,0.01791409,0.0093464805,0.0010349192,0.5069212,0.0024183693,0.4613513],"study_design_scores_gemma":[0.0003178659,0.00052282895,0.0026794013,0.000046443816,0.0000013671064,0.0000060549446,0.00018902603,0.68762374,0.0075650765,0.012098211,0.288634,0.00031598372],"about_ca_topic_score_codex":0.000042992302,"about_ca_topic_score_gemma":0.000030024417,"teacher_disagreement_score":0.8806134,"about_ca_system_score_codex":0.000013328633,"about_ca_system_score_gemma":0.000029475972,"threshold_uncertainty_score":0.6348973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119782,0.000036760404,0.97612506,0.00089498516,0.00010423625,0.00082653505,0.0000060238194,0.00017285495,0.009855357],"genre_scores_gemma":[0.15713736,0.000012469364,0.8420787,0.0003175269,0.00004672293,0.00028072397,0.000018904235,0.0000065744944,0.00010102759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990089,0.0000200803,0.00013632934,0.0003704911,0.00020624693,0.00025796858],"domain_scores_gemma":[0.99897027,0.00005443622,0.00006328955,0.00072247826,0.00010875789,0.00008076854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015466109,0.00011803389,0.00009728041,0.00009020755,0.0001353043,0.00024194815,0.0008754682,0.00002914786,0.00006697989],"category_scores_gemma":[0.00001312918,0.000089661415,0.000048615202,0.00032896426,0.000027361413,0.0013185767,0.0005843697,0.00005618418,0.00004160141],"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.00002971022,0.000107989246,0.0019446955,0.000056366538,0.00008191142,0.0000032501866,0.000561212,0.000010447549,0.000047846013,0.9398552,0.032263678,0.025037698],"study_design_scores_gemma":[0.0037729458,0.0010145047,0.049209926,0.00028950645,0.000052692983,0.000016758573,0.0009085344,0.5145754,0.0038966092,0.29837704,0.12654942,0.0013366041],"about_ca_topic_score_codex":0.00017674583,"about_ca_topic_score_gemma":0.00006143658,"teacher_disagreement_score":0.6414781,"about_ca_system_score_codex":0.0000148098325,"about_ca_system_score_gemma":0.000013203816,"threshold_uncertainty_score":0.36562863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23903328,0.00015660963,0.75850195,0.0018107215,0.00016900773,0.0002027225,0.00002831395,0.000020555719,0.00007681845],"genre_scores_gemma":[0.6375954,0.000010988067,0.36188072,0.00033769934,0.00014858218,0.000010624517,0.0000058520645,0.000008566427,0.0000015319172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985776,0.000028708055,0.00057427847,0.00025721896,0.0002660906,0.000296136],"domain_scores_gemma":[0.99853885,0.0003409917,0.00035169284,0.00028136378,0.00028631132,0.00020079192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003172287,0.00017511925,0.00042333532,0.00017820201,0.000119202195,0.00031811782,0.0010939095,0.00017137911,0.00017424354],"category_scores_gemma":[0.00026865795,0.0001293508,0.0001366611,0.00011737892,0.00008823586,0.0013407315,0.0004043877,0.0003480736,0.0000047039307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018184446,0.000078202705,0.0011232483,0.00016905335,0.00007226631,0.000012570381,0.00024577306,0.000021367925,0.00037895972,0.9928424,0.0038607486,0.0011772776],"study_design_scores_gemma":[0.0007287971,0.00011951505,0.00327527,0.00006346892,0.000024001483,0.00053220487,0.000062291765,0.022317449,0.00032125527,0.971854,0.0005494431,0.00015231782],"about_ca_topic_score_codex":0.000001879278,"about_ca_topic_score_gemma":0.0000033813617,"teacher_disagreement_score":0.39856216,"about_ca_system_score_codex":0.000015384614,"about_ca_system_score_gemma":0.00004786937,"threshold_uncertainty_score":0.52747726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029900143,0.024347376,0.85266596,0.0020036648,0.0001409945,0.08940489,0.000048617603,0.0007561903,0.00073214254],"genre_scores_gemma":[0.87714505,0.013667836,0.018983752,0.0005061608,0.000060406637,0.08931541,0.00028505537,0.00002572622,0.0000105889885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980987,0.0003927653,0.00046658362,0.0004927266,0.00018939884,0.00035986688],"domain_scores_gemma":[0.99666893,0.0004750315,0.00031707436,0.002145515,0.00022221699,0.00017120624],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00075490546,0.0002651598,0.00029139765,0.000092058035,0.0014368218,0.00026540103,0.0013432244,0.00027708735,0.0000062819713],"category_scores_gemma":[0.00001905233,0.00027446027,0.00008794614,0.00047623407,0.00046996467,0.0009387615,0.00086250936,0.0005207097,0.0000012304438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006068019,0.001830385,0.0030499536,0.00041841582,0.00019139127,0.0000043793875,0.034974042,0.0013445652,0.00006191336,0.6842933,0.018207302,0.25501752],"study_design_scores_gemma":[0.0025484103,0.0003208757,0.0020794878,0.00018521404,0.000033914355,0.00009158389,0.00037270854,0.7894482,0.00004375598,0.042928953,0.16125666,0.00069021387],"about_ca_topic_score_codex":0.000018322111,"about_ca_topic_score_gemma":0.00013723511,"teacher_disagreement_score":0.8472449,"about_ca_system_score_codex":0.00002506663,"about_ca_system_score_gemma":0.00004201948,"threshold_uncertainty_score":0.99997073},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03361001,0.000026339278,0.9549303,0.0037030804,0.0009941489,0.00009813907,0.00009696219,0.00007747771,0.0064635663],"genre_scores_gemma":[0.9713336,0.000009800079,0.026541553,0.001679899,0.0002316146,0.000002344699,0.00019737378,0.0000022081163,0.0000015982233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977489,0.000057483438,0.00095620385,0.000059512346,0.0010292358,0.00014867971],"domain_scores_gemma":[0.9975297,0.0001074061,0.00079987553,0.00021058646,0.0012528623,0.00009959525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064193754,0.00011808888,0.00014170645,0.0007026112,0.00007196663,0.00059000554,0.001197165,0.00007757083,0.00008027775],"category_scores_gemma":[0.00018793416,0.00010645621,0.00017795821,0.0003193167,0.000050192084,0.012148814,0.00011871717,0.00028672972,0.00019561588],"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.00029389877,0.00028224874,0.001003096,0.000028611468,0.00007285385,0.000025087455,0.0014242482,0.002399934,0.00007072976,0.9045684,0.04608004,0.043750893],"study_design_scores_gemma":[0.0043233675,0.00027151903,0.015029716,0.000115050156,0.000019717225,0.0004156481,0.000079912905,0.18763815,0.0031978788,0.15880243,0.62959754,0.000509085],"about_ca_topic_score_codex":0.000041756797,"about_ca_topic_score_gemma":0.0000025821546,"teacher_disagreement_score":0.9377236,"about_ca_system_score_codex":0.0000870424,"about_ca_system_score_gemma":0.00020249956,"threshold_uncertainty_score":0.8807597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24106532,0.00013539515,0.7273214,0.0009722683,0.001163713,0.0041187247,0.00003646926,0.0012990538,0.023887662],"genre_scores_gemma":[0.9501963,0.00002293574,0.0485194,0.0005816109,0.00003955678,0.00049004063,0.0001464318,0.0000028592494,8.6936114e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998264,0.000069370784,0.00042853158,0.00018010921,0.0007997709,0.000258215],"domain_scores_gemma":[0.99833417,0.000081049606,0.00017535605,0.00068031007,0.0005965,0.0001326054],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082378776,0.00013723588,0.00011782993,0.0002269302,0.0001784088,0.0008926995,0.0006739014,0.000102377926,0.00029128004],"category_scores_gemma":[0.0001638706,0.00012388227,0.000084232015,0.0007533882,0.000036955473,0.010874369,0.00022509595,0.00016397068,0.0014432097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041960425,0.00011383041,0.0002816449,0.000015924528,0.0000076074,2.1368257e-7,0.0028588546,0.00002692636,0.0000047335866,0.08977852,0.029743768,0.87716377],"study_design_scores_gemma":[0.0010107275,0.00018049068,0.02932376,0.000028162856,0.000011265129,0.000019435269,0.00020105237,0.48603818,0.00022261086,0.29933244,0.18323475,0.00039712092],"about_ca_topic_score_codex":0.00012393095,"about_ca_topic_score_gemma":0.000019099507,"teacher_disagreement_score":0.8767667,"about_ca_system_score_codex":0.000045963487,"about_ca_system_score_gemma":0.000072531075,"threshold_uncertainty_score":0.9993343},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83035785,0.0009019484,0.16338088,0.0036010547,0.000050130246,0.00031721545,0.0000022759805,0.00012240949,0.0012662321],"genre_scores_gemma":[0.99206626,0.00007556854,0.007485941,0.0003378125,0.000015609161,0.000010748752,0.0000015366865,0.0000054055254,0.0000010902461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999241,0.00006739537,0.00022637281,0.00016968757,0.00013484017,0.00016068334],"domain_scores_gemma":[0.99808794,0.00054996804,0.00008260521,0.0012290039,0.000020761023,0.000029742358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915097,0.000103506,0.000115283045,0.000058333007,0.00017191825,0.0000650359,0.0014043471,0.000041009553,0.000003019057],"category_scores_gemma":[0.00003909711,0.0000724139,0.000044155164,0.00053933944,0.00005677356,0.0001141449,0.0007749175,0.00032210042,0.0000025946347],"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.0000012093543,0.00006038028,0.00050963747,0.000015147099,0.0000062003473,6.6029436e-8,0.0011789054,0.005574223,0.0002578335,0.98519075,0.00011173894,0.0070939246],"study_design_scores_gemma":[0.00027402476,0.000016556454,0.009672046,0.00011974382,0.0000037041793,0.0000045416527,0.00007326214,0.9537904,0.0026001583,0.025046838,0.008221545,0.00017716446],"about_ca_topic_score_codex":0.00004037857,"about_ca_topic_score_gemma":0.00001824847,"teacher_disagreement_score":0.9601439,"about_ca_system_score_codex":0.000015259013,"about_ca_system_score_gemma":0.000008561762,"threshold_uncertainty_score":0.29529533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46225512,0.00011228079,0.5321272,0.00396833,0.000573827,0.00004176655,0.0000015065899,0.000008826893,0.00091115606],"genre_scores_gemma":[0.99116176,0.00003088917,0.008101443,0.0005877993,0.0001133035,8.931101e-7,1.8904807e-7,0.0000030118022,7.2488615e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881506,0.0003316723,0.00038018386,0.000099772304,0.0002307092,0.00014257453],"domain_scores_gemma":[0.99765974,0.0012643908,0.0004625306,0.0003835689,0.00017491379,0.000054860542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011209596,0.00008126106,0.0002885129,0.00014795757,0.00006681178,0.000031055646,0.0010219911,0.000061524835,0.000026984926],"category_scores_gemma":[0.00044307506,0.000046261543,0.00015194906,0.00023191888,0.00013050355,0.0002144212,0.00006976784,0.00023504722,0.0000075208136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014161463,0.000096297415,0.0008401479,0.0000073901156,0.000033110828,0.000008458594,0.00034973177,0.000029111585,0.00058069295,0.98351204,0.0029485477,0.011452868],"study_design_scores_gemma":[0.0057853134,0.002460188,0.04061528,0.00015472261,0.00007415371,0.00078745506,0.00020500646,0.003061648,0.044394534,0.8074575,0.09464199,0.00036222578],"about_ca_topic_score_codex":0.0000024074939,"about_ca_topic_score_gemma":0.000004753742,"teacher_disagreement_score":0.52890664,"about_ca_system_score_codex":0.000004669122,"about_ca_system_score_gemma":0.000038408754,"threshold_uncertainty_score":0.18991306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017536398,0.000064530475,0.97729677,0.00043667603,0.000020489148,0.0004972252,0.000099535726,0.000036081696,0.0040123044],"genre_scores_gemma":[0.91949105,0.000031539974,0.08001153,0.00006934507,0.000008715733,0.00032683508,0.000044952583,0.000006856674,0.000009150104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921525,0.000023873507,0.00027077194,0.00021748825,0.00016842238,0.00010417143],"domain_scores_gemma":[0.9990017,0.00013849571,0.00015348956,0.00060534343,0.0000626216,0.000038395443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028063802,0.00009617078,0.00010908091,0.000086540036,0.000105386905,0.00004086925,0.0003978752,0.00004365951,0.000044457072],"category_scores_gemma":[0.000023451983,0.000072301555,0.000039422604,0.0003972902,0.00011311755,0.00017488982,0.00007065054,0.00008853265,0.0000093455155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011069056,0.00015233243,0.000028392782,0.000017354865,0.00000746432,1.599198e-7,0.0034878068,9.3633344e-7,0.0001498258,0.99527603,0.00004895056,0.0008296208],"study_design_scores_gemma":[0.00014687488,0.00004010419,0.0067563374,0.000035543653,0.000010282152,0.0000029940045,0.00077988586,0.00946167,0.0010809943,0.98083353,0.00071339315,0.00013839432],"about_ca_topic_score_codex":0.000013365261,"about_ca_topic_score_gemma":0.0000062745085,"teacher_disagreement_score":0.90195465,"about_ca_system_score_codex":0.000008386114,"about_ca_system_score_gemma":0.000020419628,"threshold_uncertainty_score":0.29483718},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24448639,0.000514751,0.7533431,0.0008930356,0.0002549235,0.000033126205,8.8027724e-7,0.000010392052,0.00046339014],"genre_scores_gemma":[0.9171864,0.00024611945,0.08234737,0.00019290428,0.000023376952,5.997073e-7,2.845846e-7,0.0000024016506,5.670988e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992491,0.00011399394,0.00026835702,0.00011535387,0.00011805266,0.00013513549],"domain_scores_gemma":[0.9993783,0.00010303814,0.00013579414,0.00020136243,0.000090488466,0.000090987734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003850159,0.0000670814,0.00015829151,0.0001690378,0.000055550605,0.000049560207,0.0003312782,0.000058247482,0.000014209432],"category_scores_gemma":[0.00009912674,0.000056661895,0.000059235856,0.00020719953,0.000070877686,0.00041797408,0.000019392746,0.00015697355,0.0000026317869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011401656,0.00006037545,0.002736391,0.0000066346647,0.000018010558,0.000020556097,0.0007052248,0.0000021420276,0.001291535,0.9828989,0.0005708127,0.011678029],"study_design_scores_gemma":[0.0020702211,0.0010986422,0.052409716,0.000026197578,0.000046120476,0.0044733193,0.00015526748,0.00023570679,0.0044988897,0.7976079,0.13705635,0.00032167445],"about_ca_topic_score_codex":0.0000014291318,"about_ca_topic_score_gemma":0.0000018096788,"teacher_disagreement_score":0.6727,"about_ca_system_score_codex":0.000008072797,"about_ca_system_score_gemma":0.000054990007,"threshold_uncertainty_score":0.23106049},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7272694,0.000022875096,0.26479742,0.0004974632,0.00072972075,0.00007050935,0.00003870373,0.00021292474,0.006360968],"genre_scores_gemma":[0.8857685,0.000007850748,0.11363017,0.00049884705,0.000059309787,0.0000044517083,0.000028182514,8.441471e-7,0.0000018613268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990618,0.000008725015,0.00021952191,0.00016784742,0.00036963765,0.00017246258],"domain_scores_gemma":[0.99931526,0.00007434468,0.00010616282,0.00036158122,0.0000698631,0.00007279843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622792,0.00007612912,0.00007259646,0.00018372119,0.00036121352,0.00068649556,0.001427226,0.00004767665,0.00008350731],"category_scores_gemma":[0.00009356567,0.000061903236,0.00003628894,0.0007257088,0.00020163014,0.00853361,0.00036281688,0.00015039089,0.00017841296],"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.0000046023015,0.000032839667,0.022680368,0.000011734803,0.00000855174,0.0000014138155,0.005412986,0.00010802547,0.003695873,0.92011607,0.0016647049,0.04626284],"study_design_scores_gemma":[0.0003236251,0.0000835237,0.029139819,0.00002448428,0.0000036003637,0.000010053501,0.00059234374,0.6837985,0.010502272,0.06276425,0.21234086,0.0004166811],"about_ca_topic_score_codex":0.0001752767,"about_ca_topic_score_gemma":0.000043030785,"teacher_disagreement_score":0.8573518,"about_ca_system_score_codex":0.0000033545634,"about_ca_system_score_gemma":0.000060538176,"threshold_uncertainty_score":0.6619893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69158953,0.0015878838,0.2958617,0.0018662768,0.0024879642,0.00007135939,0.0000037131588,0.000045229557,0.0064863325],"genre_scores_gemma":[0.94347894,0.00046038916,0.055249866,0.00044870353,0.0003437778,0.0000016749716,8.9642003e-7,0.00000604818,0.0000097085385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885935,0.0001234839,0.00040489266,0.00014956358,0.00022778272,0.00023492952],"domain_scores_gemma":[0.9989977,0.00022756982,0.00020570769,0.00032839042,0.00012654549,0.00011409746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035999744,0.00010567431,0.0003148697,0.00013502696,0.00007962939,0.00005844958,0.00097338133,0.00008450331,0.00044719342],"category_scores_gemma":[0.000044598677,0.000086480286,0.00017319337,0.0002718778,0.00009408937,0.0006478357,0.00004519524,0.00026810542,0.000073637886],"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.003997525,0.00051859923,0.0011445115,0.000029407896,0.00021567065,0.00064643455,0.0018791788,0.0008937623,0.0006744471,0.60688776,0.016746873,0.36636582],"study_design_scores_gemma":[0.032770526,0.0018821168,0.011245521,0.00007166917,0.000085812346,0.0030075856,0.00009409389,0.004618721,0.0018555509,0.13856521,0.80508447,0.00071872125],"about_ca_topic_score_codex":0.000003867465,"about_ca_topic_score_gemma":0.000005682203,"teacher_disagreement_score":0.7883376,"about_ca_system_score_codex":0.00001265636,"about_ca_system_score_gemma":0.00006704759,"threshold_uncertainty_score":0.48964542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003063835,0.000047666643,0.8898106,0.00059123227,0.00019779129,0.000018261755,5.9433654e-7,0.00017936272,0.10609066],"genre_scores_gemma":[0.80837053,0.0000017642404,0.19006966,0.0014286825,0.00006454764,0.0000018746634,0.0000021520925,0.0000015062158,0.00005927207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970245,0.0000058745177,0.000035627894,0.000094688985,0.00008951485,0.00007183001],"domain_scores_gemma":[0.99962074,0.000006858008,0.0000067663523,0.00027823067,0.000025872749,0.00006156268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010231929,0.000026250022,0.000026688218,0.000026599319,0.0000147964165,0.00006145195,0.00035090913,0.00001196055,0.000016209922],"category_scores_gemma":[0.000010378721,0.000020807262,0.000015173474,0.00018532561,0.00000958809,0.0003810904,0.00013477886,0.000024876137,0.00021632852],"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":[3.587194e-7,0.00001035677,0.00034351627,3.4651325e-7,6.995575e-7,0.0000019143442,0.000093948,4.797466e-7,0.0000056619247,0.9586677,0.037259936,0.0036150631],"study_design_scores_gemma":[0.00026346804,0.000040113795,0.0012512676,0.0000011764522,8.233693e-7,0.000013806255,0.000044869277,0.0071547087,0.0006349494,0.37479347,0.6156736,0.00012772628],"about_ca_topic_score_codex":0.00002996183,"about_ca_topic_score_gemma":0.00001165565,"teacher_disagreement_score":0.8053067,"about_ca_system_score_codex":0.0000027911005,"about_ca_system_score_gemma":0.000017836259,"threshold_uncertainty_score":0.27805376},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03810719,0.000031943207,0.95803785,0.00027805052,0.00016872553,0.0029593778,0.0000016345134,0.000031264062,0.00038393892],"genre_scores_gemma":[0.6839525,0.0000013074089,0.31555486,0.00007274046,0.00014634256,0.00026150869,8.2709914e-7,0.000008556333,0.0000013778181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828905,0.00014231469,0.0007853471,0.00022515039,0.00027850643,0.00027962498],"domain_scores_gemma":[0.99843204,0.00022850752,0.0004093724,0.00041310381,0.00025984205,0.00025715772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024290758,0.0001383828,0.00031198194,0.00026013085,0.00010244059,0.0001221218,0.00066854677,0.000109970475,0.000017264576],"category_scores_gemma":[0.00019152183,0.000105009,0.00009446571,0.0003080628,0.000097308686,0.00037613147,0.00012157427,0.00030101257,0.00002299572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007863055,0.0010402787,0.00021733936,0.00013983516,0.000025133799,0.00006481859,0.0020503292,0.0000425465,0.0021511528,0.98070556,0.000500826,0.0129835345],"study_design_scores_gemma":[0.002497255,0.00096009014,0.003928626,0.00011694665,0.00004616702,0.00263715,0.00035958432,0.07734446,0.0043783975,0.9049109,0.002461969,0.0003584253],"about_ca_topic_score_codex":3.896293e-7,"about_ca_topic_score_gemma":0.0000028106392,"teacher_disagreement_score":0.6458453,"about_ca_system_score_codex":0.00002242084,"about_ca_system_score_gemma":0.000052889827,"threshold_uncertainty_score":0.42821425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010755361,0.00007371091,0.9719949,0.000051354196,0.0001490368,0.00019704721,0.0000043656114,0.00029788064,0.026156174],"genre_scores_gemma":[0.06687796,0.000003366069,0.9327793,0.00023581111,0.00006368336,0.000017939812,0.0000026011676,0.000005625581,0.0000136861045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906826,0.000014462701,0.00014298977,0.0003661838,0.000112628164,0.00029547568],"domain_scores_gemma":[0.99926865,0.000069401736,0.000050967865,0.00038183716,0.000086431144,0.0001427403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014997333,0.00011594655,0.0001098729,0.00015700211,0.00013023488,0.00007963089,0.00063379447,0.000048991893,0.000053944183],"category_scores_gemma":[0.000034118584,0.00010441661,0.00014212278,0.00078453997,0.000022433684,0.0006258409,0.00014900786,0.000081606115,0.000016270642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014877982,0.000047679885,0.002087704,0.0000065969875,0.000025704041,0.0000010623108,0.001283975,6.0716005e-8,0.0003162262,0.9515844,0.015002651,0.029629055],"study_design_scores_gemma":[0.0016254898,0.0006236437,0.01395274,0.000029141453,0.000021458038,0.000026282009,0.00017695525,0.0076336814,0.032799777,0.9041264,0.038178556,0.00080585456],"about_ca_topic_score_codex":0.00020735637,"about_ca_topic_score_gemma":0.000039183375,"teacher_disagreement_score":0.065802425,"about_ca_system_score_codex":0.000005495364,"about_ca_system_score_gemma":0.000056887227,"threshold_uncertainty_score":0.4257986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110892534,0.0019936827,0.8793658,0.0005935184,0.00019748797,0.00024992597,0.00003331511,0.00045456825,0.0062191435],"genre_scores_gemma":[0.8913442,0.0004926417,0.10577557,0.0022595203,0.000085169915,0.000012002699,0.000016184224,0.000010596813,0.000004152124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820375,0.000065723674,0.0002759438,0.0006321879,0.00032688896,0.00049548637],"domain_scores_gemma":[0.99878657,0.000091465285,0.00009534963,0.0007095248,0.00005868623,0.0002584073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003191418,0.00028635992,0.0002802729,0.00040251436,0.00033542464,0.00050321565,0.0007214269,0.0001196867,0.000034222336],"category_scores_gemma":[0.000012086962,0.00026096747,0.00021436796,0.001156169,0.00014158848,0.00085077644,0.00012755409,0.00020488752,0.000010322786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017640323,0.00013427954,0.0034125654,0.000011441364,0.000029665682,0.000023248367,0.00051003514,0.0000015902014,0.0020152018,0.95132166,0.0037644666,0.0387582],"study_design_scores_gemma":[0.0013244707,0.00074299035,0.12382324,0.000053156946,0.000049896047,0.00008013084,0.00009822462,0.002903406,0.0021269398,0.81315666,0.054580208,0.0010606968],"about_ca_topic_score_codex":0.00002708169,"about_ca_topic_score_gemma":0.000008443016,"teacher_disagreement_score":0.78045166,"about_ca_system_score_codex":0.0000062532745,"about_ca_system_score_gemma":0.000020597861,"threshold_uncertainty_score":0.99998426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79175556,0.00006989185,0.19924401,0.007368061,0.00066640053,0.00014396102,0.000003103969,0.000021807879,0.00072721747],"genre_scores_gemma":[0.7699774,0.000043789394,0.22926323,0.00058629806,0.00011671103,0.0000028370002,4.9377286e-7,0.000008035731,0.0000011955267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825585,0.0002043996,0.00069058756,0.00023896295,0.00029242484,0.0003177864],"domain_scores_gemma":[0.99812585,0.00066500483,0.0004353338,0.00047382974,0.00008525715,0.00021474653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012563763,0.00016855651,0.00047759284,0.00025955105,0.000063033105,0.00010889979,0.00072762056,0.00017420689,0.000017616243],"category_scores_gemma":[0.00071839895,0.00012911916,0.00009261296,0.00017967685,0.00009374683,0.00067985675,0.00027032668,0.0009438006,0.000026584434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099383746,0.00079600204,0.0004060712,0.000036671612,0.000032944303,0.00036777218,0.0005795264,0.0000037518082,0.0019023122,0.9908163,0.00017826045,0.004781028],"study_design_scores_gemma":[0.0018154255,0.0009210593,0.011502576,0.0001236791,0.000042988235,0.003465628,0.00017497742,0.0060416204,0.00094158563,0.97263944,0.0020454712,0.00028555622],"about_ca_topic_score_codex":0.0000034245954,"about_ca_topic_score_gemma":0.000012002378,"teacher_disagreement_score":0.030019226,"about_ca_system_score_codex":0.000016621963,"about_ca_system_score_gemma":0.000040609357,"threshold_uncertainty_score":0.52653265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26598877,0.00005921502,0.731574,0.00097277836,0.00014200721,0.00045803565,0.0000069682233,0.000121822166,0.0006763838],"genre_scores_gemma":[0.98956513,0.00000574071,0.007185071,0.0031811527,0.00003115199,0.000009407057,0.000019096191,0.0000028072755,4.5672488e-7],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987708,0.000041016687,0.00031174635,0.00023325707,0.00027632123,0.0003668758],"domain_scores_gemma":[0.99933344,0.000048689195,0.00016169313,0.00024730666,0.000083005485,0.00012585396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021655514,0.00012288541,0.00015832369,0.00022925639,0.00013650529,0.00067229365,0.00063964975,0.000036400346,0.00004726626],"category_scores_gemma":[0.000010016699,0.000096344054,0.000032434586,0.0007867631,0.000021052445,0.004130805,0.00027483195,0.00018271427,0.00003283907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006006624,0.00040131182,0.4226498,0.00026703902,0.000052636777,0.000009887017,0.03891284,0.0014648092,0.000005657994,0.21577942,0.01011136,0.31028515],"study_design_scores_gemma":[0.0019807406,0.00021890088,0.08994005,0.000093491755,0.0000020559457,0.00001901823,0.00079445465,0.9033537,0.000012012091,0.0016617241,0.0016183248,0.00030555457],"about_ca_topic_score_codex":0.0017360755,"about_ca_topic_score_gemma":0.0001774698,"teacher_disagreement_score":0.90188885,"about_ca_system_score_codex":0.000050341965,"about_ca_system_score_gemma":0.00007083054,"threshold_uncertainty_score":0.64829427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022407647,0.00027647958,0.944646,0.00014324069,0.0003206038,0.00013601212,0.0000050973117,0.0003961862,0.031668745],"genre_scores_gemma":[0.969211,0.0000067635565,0.030382106,0.00003700653,0.000076212214,0.000011656522,0.000019881069,0.0000036842728,0.00025171306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991696,0.000072175935,0.00014590126,0.0002507292,0.00018298876,0.00017862019],"domain_scores_gemma":[0.9994093,0.00005356286,0.000055693854,0.00032450544,0.00011416591,0.000042765485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015519679,0.000082371414,0.000095239826,0.0000770087,0.00014732401,0.00020687513,0.00038380802,0.000034843568,0.000012944878],"category_scores_gemma":[0.000021728645,0.00007003053,0.000029328468,0.00091609696,0.000027056252,0.00048453925,0.00017564099,0.000096135744,0.000050061528],"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.0000018295773,0.00003607516,0.003346622,0.0000045745037,0.0000044626845,0.0000057655193,0.00021045543,0.00017959709,0.00018073875,0.989569,0.006146729,0.00031411496],"study_design_scores_gemma":[0.00071041286,0.00017168715,0.010930559,0.000026115333,0.000006209316,0.000017161823,0.000513002,0.07970301,0.0018113075,0.009540678,0.89611816,0.00045168598],"about_ca_topic_score_codex":0.0002705892,"about_ca_topic_score_gemma":0.000020520585,"teacher_disagreement_score":0.98002833,"about_ca_system_score_codex":0.0000129703,"about_ca_system_score_gemma":0.000032322878,"threshold_uncertainty_score":0.28557622},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035209444,0.0029827422,0.97900337,0.0010314689,0.0041918876,0.00031569498,0.00001970709,0.0003366264,0.008597568],"genre_scores_gemma":[0.9924207,0.000037771995,0.007054144,0.00018666813,0.00012009445,0.00005193335,0.000010336406,0.000008376401,0.0001100177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989642,0.000025685817,0.00018674064,0.0003633951,0.00014044784,0.00031955197],"domain_scores_gemma":[0.99894863,0.00013260501,0.000055762386,0.000597063,0.0001245128,0.00014143474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019105767,0.00013764063,0.00015829377,0.00008662635,0.00020038609,0.00015656577,0.0009164997,0.000062643885,0.000018489152],"category_scores_gemma":[0.00003989336,0.00013258921,0.00013794472,0.00042745398,0.00005044705,0.00043351648,0.00025658417,0.0001131695,0.00011803551],"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.0000031831507,0.00040583254,0.00007849118,0.000011780384,0.000008954991,8.823453e-7,0.00021790968,6.800619e-7,0.000019029612,0.8588641,0.08033184,0.06005727],"study_design_scores_gemma":[0.00069841347,0.00015621886,0.0002216537,0.000008554207,0.000005997793,0.000002861619,0.0000026072023,0.0038176023,0.0004450464,0.094725534,0.89972585,0.00018964188],"about_ca_topic_score_codex":0.0000018882471,"about_ca_topic_score_gemma":0.0000026998664,"teacher_disagreement_score":0.9888997,"about_ca_system_score_codex":0.000058307865,"about_ca_system_score_gemma":0.000063759064,"threshold_uncertainty_score":0.5406831},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049225964,0.00016645124,0.9465784,0.0030139147,0.00024365273,0.00017063157,0.000060434544,0.000018929253,0.00052164483],"genre_scores_gemma":[0.68947184,0.0000512746,0.309775,0.0003242794,0.00034344554,0.000008904692,0.0000075833937,0.000009216006,0.000008474375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857086,0.000082798404,0.00050321745,0.00016816233,0.00046507423,0.00020991325],"domain_scores_gemma":[0.9983077,0.00041791968,0.00048450904,0.00042253247,0.00026746216,0.00009987788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321351,0.00014197669,0.0002238183,0.00014589418,0.00015189241,0.00009276187,0.00082084234,0.00006029901,0.000056942175],"category_scores_gemma":[0.000102266466,0.000090810645,0.00037951095,0.00036656976,0.00009740494,0.0006357999,0.00005294495,0.0002217486,0.00000929164],"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.00016984147,0.00059880223,0.00039416755,0.00003646198,0.00017117636,0.0000061170713,0.0011090243,0.0004412286,0.0029910787,0.7627799,0.0057127145,0.22558953],"study_design_scores_gemma":[0.010610297,0.0038193378,0.008211544,0.00089084875,0.00039243812,0.00027343188,0.00094091205,0.43497452,0.087506354,0.2673552,0.18350534,0.0015197868],"about_ca_topic_score_codex":0.000005566016,"about_ca_topic_score_gemma":0.0000086860755,"teacher_disagreement_score":0.64024585,"about_ca_system_score_codex":0.00003170098,"about_ca_system_score_gemma":0.00009052817,"threshold_uncertainty_score":0.37031507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06057427,0.0003868681,0.9301553,0.000047640668,0.0001564389,0.00014830056,0.00002216117,0.00027737662,0.00823165],"genre_scores_gemma":[0.8977414,0.00019104306,0.10139315,0.00059238396,0.00003602852,0.000020936492,0.000011113465,0.000011578701,0.00000241019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985929,0.00004367429,0.00021091473,0.00058867276,0.0002059067,0.00035790878],"domain_scores_gemma":[0.9988991,0.00006335888,0.0000691883,0.0007194147,0.000046809793,0.00020215553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030222442,0.00021842486,0.00019945732,0.00035030144,0.00023849389,0.0001858053,0.0007784555,0.00008363789,0.00007559709],"category_scores_gemma":[0.0000128214515,0.00019206518,0.00014680583,0.00078683224,0.00012816544,0.00042889136,0.00023538346,0.00017653606,0.00001576363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021580507,0.00012130952,0.0030020275,0.000012683335,0.0000357536,0.000020887486,0.00086402317,0.0000018737037,0.0001848327,0.98799926,0.0005231571,0.007212629],"study_design_scores_gemma":[0.0007626066,0.0008976487,0.012775652,0.00006177522,0.000028237035,0.00003486375,0.000110051034,0.0066054743,0.002608598,0.9726776,0.002776062,0.0006614178],"about_ca_topic_score_codex":0.000057917492,"about_ca_topic_score_gemma":0.000014761571,"teacher_disagreement_score":0.8371671,"about_ca_system_score_codex":0.0000034970967,"about_ca_system_score_gemma":0.000011583076,"threshold_uncertainty_score":0.7832191},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43895087,0.014760702,0.068395704,0.032182902,0.0037687635,0.019324817,0.0017886284,0.037963428,0.3828642],"genre_scores_gemma":[0.7728739,0.00018621565,0.2242304,0.0016972665,0.00017691175,0.0005774788,0.00016454459,0.000062146864,0.00003117858],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99537534,0.00016846841,0.000988338,0.0012314017,0.00086655916,0.0013699087],"domain_scores_gemma":[0.99464387,0.0007970391,0.00031345163,0.0035414125,0.00014662869,0.00055757497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016267506,0.0007311424,0.00078184827,0.0002722203,0.0008761105,0.0002604835,0.0036613576,0.00075847004,0.00004839037],"category_scores_gemma":[0.00048649337,0.0006627783,0.00061209983,0.0012041061,0.0008601772,0.0025581853,0.0015998225,0.0012219653,0.00003793494],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099426376,0.0010391038,0.00010364619,0.00006271008,0.000036629142,0.0000011634336,0.00012337348,0.000007368874,0.5241184,0.46884644,0.0022250987,0.003336636],"study_design_scores_gemma":[0.0010220344,0.0005790559,0.8812305,0.00010336801,0.00006478445,0.00012604144,0.00013585803,0.000002034612,0.00017094679,0.010498616,0.10510506,0.00096170284],"about_ca_topic_score_codex":0.00005769101,"about_ca_topic_score_gemma":0.007221615,"teacher_disagreement_score":0.8811269,"about_ca_system_score_codex":0.00021228507,"about_ca_system_score_gemma":0.000074964955,"threshold_uncertainty_score":0.99958235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048405603,0.000028455785,0.9830229,0.00009000725,0.00014425603,0.000117164804,0.00001543828,0.00015495489,0.011586214],"genre_scores_gemma":[0.9441023,0.0000013376836,0.055318072,0.00041462452,0.000054114367,0.000025875264,0.000014060761,0.000002819147,0.000066800865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995542,0.000005403594,0.00006059207,0.00017839846,0.000074939875,0.00012644661],"domain_scores_gemma":[0.99949443,0.00011725381,0.000015068029,0.00030084312,0.000023687717,0.000048712216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007873923,0.000052506857,0.00005368479,0.00003510516,0.000053928172,0.00022381109,0.00043587547,0.00002878699,0.000010528545],"category_scores_gemma":[0.00002480618,0.000041448617,0.0000597568,0.000112138485,0.000019124465,0.00057475374,0.000090994945,0.000033319462,0.000015299942],"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.000002886607,0.00003407517,0.00021132753,0.0000053014337,0.0000045897814,1.7597556e-7,0.00007290461,0.000019821684,0.00009006633,0.8927864,0.016781244,0.089991204],"study_design_scores_gemma":[0.00034916194,0.00022858512,0.0006107587,0.0000033224148,0.0000021874732,0.0000014174759,0.000025360825,0.031979162,0.0017472515,0.0893959,0.87545305,0.00020381484],"about_ca_topic_score_codex":0.0000022464674,"about_ca_topic_score_gemma":0.0000039103948,"teacher_disagreement_score":0.93926173,"about_ca_system_score_codex":0.000002158935,"about_ca_system_score_gemma":0.0000061145433,"threshold_uncertainty_score":0.21582155},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067740656,0.00028180753,0.9882086,0.00011087332,0.0004922178,0.00019843764,0.000005836427,0.00041642104,0.0035117567],"genre_scores_gemma":[0.6121951,0.000006226444,0.38693112,0.0007614949,0.000072631716,0.00002124768,0.000005001535,0.0000051659117,0.0000020537689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983449,0.00015423082,0.00022158276,0.000334802,0.00038553827,0.0005589533],"domain_scores_gemma":[0.998646,0.00020188378,0.000069937196,0.00074000884,0.00007128975,0.00027083736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005945057,0.00018011454,0.00016919522,0.00021072903,0.00017073518,0.00021117704,0.0010486603,0.00008165187,0.00027637006],"category_scores_gemma":[0.000037874303,0.00016197306,0.00016775688,0.0010581319,0.00017192872,0.0028454943,0.00018758098,0.00014055695,0.00022010421],"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.000008901911,0.00018541563,0.0009101385,0.0000049866353,0.000014744433,0.0000013782167,0.0006329403,0.000010994152,0.002675329,0.9913523,0.0021948786,0.002007991],"study_design_scores_gemma":[0.0062486334,0.0011231776,0.033737797,0.00010647778,0.00011895187,0.00003539944,0.0012292278,0.017335432,0.5522836,0.317137,0.06674353,0.0039007799],"about_ca_topic_score_codex":0.000032007476,"about_ca_topic_score_gemma":0.000011850127,"teacher_disagreement_score":0.6742153,"about_ca_system_score_codex":0.000012643569,"about_ca_system_score_gemma":0.00005339537,"threshold_uncertainty_score":0.66050696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023905708,0.0001181484,0.8983723,0.00905539,0.00028252386,0.0001712872,7.5939545e-7,0.00029828335,0.067795634],"genre_scores_gemma":[0.92568076,0.000012685986,0.06834748,0.0058362223,0.000058259324,0.000011829299,0.0000011073204,0.000002500783,0.000049129496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943787,0.000026929778,0.00007801316,0.00014834745,0.00016740983,0.00014141225],"domain_scores_gemma":[0.99926364,0.00008012241,0.000020188332,0.00057068974,0.000028311262,0.000037023827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017968017,0.000053265474,0.000043189804,0.00002738316,0.0001637665,0.0004082455,0.001068255,0.000020756528,0.00017229443],"category_scores_gemma":[0.000013753458,0.000029247067,0.000039188304,0.00023717067,0.000035343503,0.0006940017,0.0003908072,0.00008871832,0.00036683888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.3874461e-7,0.000010696563,0.00050503475,9.305679e-7,0.0000034382094,7.322765e-7,0.0007498673,0.0000010037004,0.00006420547,0.9621909,0.02643032,0.0100426935],"study_design_scores_gemma":[0.00012292068,0.000027033138,0.02596178,0.0000057898355,0.0000024293677,0.0000113441665,0.00019058066,0.008545505,0.0013445206,0.88893753,0.07468208,0.00016846336],"about_ca_topic_score_codex":0.0003363062,"about_ca_topic_score_gemma":0.000048973125,"teacher_disagreement_score":0.90177506,"about_ca_system_score_codex":0.0000030441888,"about_ca_system_score_gemma":0.000011468013,"threshold_uncertainty_score":0.4715094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5063502,0.00082314835,0.4874297,0.00023722924,0.00032653645,0.00037381414,0.00006611615,0.00025005278,0.0041431645],"genre_scores_gemma":[0.8748908,0.0002298406,0.12456966,0.00021396147,0.000039314797,0.00003105407,0.000015675692,0.000008769989,8.9849016e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99831295,0.0001008877,0.00027419836,0.00062468165,0.0002528601,0.00043442132],"domain_scores_gemma":[0.9987733,0.00024909826,0.00008317386,0.000624942,0.00006814587,0.00020138928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353629,0.00023461567,0.00026382811,0.0010157163,0.00018928658,0.00039911797,0.00073643005,0.00014703818,0.00003344337],"category_scores_gemma":[0.000065904576,0.00021834414,0.00014420632,0.0027849711,0.00020499827,0.0008339292,0.00022602093,0.00042209117,0.000006154874],"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.000021081358,0.00023795305,0.07215877,0.000025595034,0.00002341943,0.000031669173,0.0006768494,8.0053695e-7,0.0055577434,0.8963926,0.00042580412,0.024447735],"study_design_scores_gemma":[0.0015795568,0.0002937401,0.77977455,0.000049894697,0.00002238921,0.000053337855,0.00016557633,0.004169438,0.0029894917,0.19739777,0.012566217,0.00093803636],"about_ca_topic_score_codex":0.000104917475,"about_ca_topic_score_gemma":0.00025565765,"teacher_disagreement_score":0.7076158,"about_ca_system_score_codex":0.00000436566,"about_ca_system_score_gemma":0.000034273777,"threshold_uncertainty_score":0.8903815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011158002,0.0057752463,0.9475849,0.031079512,0.00045475506,0.002376683,0.00038758336,0.00029374126,0.0008895676],"genre_scores_gemma":[0.8855636,0.0005204118,0.10655647,0.0020262355,0.0021311957,0.001981639,0.0009796366,0.000040758365,0.00020005483],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783474,0.00007603616,0.00027745115,0.0008636084,0.00051198644,0.00043616307],"domain_scores_gemma":[0.9971594,0.00008738434,0.00006991482,0.0021240024,0.00008354045,0.0004757507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010838606,0.0001779224,0.00019031324,0.00013673374,0.00021160534,0.00022351758,0.0018808612,0.00007780849,0.0000059477684],"category_scores_gemma":[0.000029146922,0.00018662366,0.000024416071,0.0008148134,0.000031270392,0.00031002413,0.0027235742,0.00024104537,0.00004584521],"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.000034772744,0.0006514375,0.020947428,0.00016948873,0.000044130218,0.0000133984495,0.024335511,0.0045313505,0.000047025904,0.058435652,0.30684522,0.5839446],"study_design_scores_gemma":[0.00019685309,0.000049109498,0.0015103894,0.00003606059,0.0000055429105,0.0000051873685,0.00016991487,0.010911575,0.0000058479054,0.006291737,0.98059696,0.00022083698],"about_ca_topic_score_codex":0.0002694261,"about_ca_topic_score_gemma":0.00021296403,"teacher_disagreement_score":0.8744056,"about_ca_system_score_codex":0.00005052618,"about_ca_system_score_gemma":0.000044449127,"threshold_uncertainty_score":0.7610292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2940268,0.000013942103,0.70406854,0.00012271927,0.00058700953,0.00011407482,0.000014030975,0.00034141136,0.0007114657],"genre_scores_gemma":[0.7434774,2.2027226e-7,0.25630808,0.00011136251,0.00008590221,0.0000024940796,0.000007545278,0.0000050029344,0.0000020011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988374,0.00004053639,0.00019307522,0.00037133813,0.0002610678,0.00029654888],"domain_scores_gemma":[0.9984168,0.00007292279,0.000077192264,0.0012056759,0.00009138851,0.0001360136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025608763,0.00014171666,0.00014133393,0.000120046,0.00020850654,0.00033186306,0.0014981793,0.000110696,0.00007755093],"category_scores_gemma":[0.0000503292,0.00011877317,0.000081294995,0.00054654025,0.00003788095,0.0007596632,0.0005776914,0.00030301366,0.000011352623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011029743,0.00008940243,0.05547119,0.00026532495,0.00003184631,0.00003776096,0.00049252156,0.000528163,0.03587933,0.8980324,0.0051193805,0.0040416173],"study_design_scores_gemma":[0.00081731507,0.000045169218,0.04290771,0.000073610114,0.000016958573,0.000076047545,0.00007756646,0.90942633,0.017215624,0.0050201598,0.023734905,0.00058859785],"about_ca_topic_score_codex":0.00013649403,"about_ca_topic_score_gemma":0.000037741876,"teacher_disagreement_score":0.9088982,"about_ca_system_score_codex":0.000019973077,"about_ca_system_score_gemma":0.0000998856,"threshold_uncertainty_score":0.48434293},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028834557,0.000012738328,0.9675702,0.00027828274,0.00017993571,0.00013249929,0.000007814514,0.000082630584,0.0029013553],"genre_scores_gemma":[0.43750718,0.0000016850857,0.561273,0.0010935793,0.00010175626,0.0000042986762,0.0000106555435,0.000004327409,0.000003567746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919605,0.00007318513,0.00017890614,0.0002260779,0.00013651546,0.00018924083],"domain_scores_gemma":[0.99860877,0.0006131102,0.000067515204,0.0006043173,0.000050136536,0.00005616495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005439659,0.000088546476,0.00012005401,0.00003167139,0.0001446137,0.00007431701,0.000904807,0.00004743593,0.000018931205],"category_scores_gemma":[0.000028892457,0.000059271642,0.00008633374,0.0002440235,0.00004453215,0.00032338945,0.00019155962,0.00010433981,0.0000042823503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031928914,0.00005749595,0.00026702706,0.000008121493,0.0000075268076,3.7518578e-7,0.00018717382,7.379494e-7,0.000017556407,0.7298702,0.00054471573,0.26903588],"study_design_scores_gemma":[0.00029375218,0.000253872,0.0021660654,0.0000109410685,0.000005942993,0.000010769121,0.00008029152,0.8609757,0.0007472292,0.12982534,0.0055047944,0.00012530315],"about_ca_topic_score_codex":0.00022855007,"about_ca_topic_score_gemma":0.000075870084,"teacher_disagreement_score":0.86097497,"about_ca_system_score_codex":0.000001596745,"about_ca_system_score_gemma":0.0000127198655,"threshold_uncertainty_score":0.24170275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45383626,0.00012609811,0.51535326,0.025083454,0.0007275018,0.00058701885,0.000020722215,0.00048420893,0.0037815066],"genre_scores_gemma":[0.95470476,0.000011224406,0.041776765,0.0033660948,0.000072708244,0.00003049281,0.000018173218,0.000006890546,0.000012887252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978291,0.00026910132,0.00048044976,0.0006090754,0.00038290184,0.00042937003],"domain_scores_gemma":[0.99759626,0.00018459858,0.00012311291,0.001787313,0.00012937511,0.00017935719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013144781,0.00016676675,0.00023566217,0.00012402455,0.000115289775,0.00017843842,0.002034931,0.00009042846,0.000036112262],"category_scores_gemma":[0.00012776181,0.0001519398,0.00006784014,0.0009901447,0.00001680871,0.0006465507,0.0016225727,0.00021994545,0.000027611932],"study_design_candidate":"theoretical_or_conceptual","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.000041627176,0.00042534855,0.025250588,0.0004491363,0.000018033257,0.000003685349,0.0017510615,0.000022226912,0.0021809337,0.8220671,0.0024973575,0.14529291],"study_design_scores_gemma":[0.0029175351,0.00040473175,0.6586388,0.00016342998,0.000007519766,0.0000072761063,0.00022852942,0.09566474,0.005164603,0.1934431,0.042215884,0.0011438434],"about_ca_topic_score_codex":0.007817954,"about_ca_topic_score_gemma":0.0081680035,"teacher_disagreement_score":0.6333882,"about_ca_system_score_codex":0.000052200103,"about_ca_system_score_gemma":0.000056535016,"threshold_uncertainty_score":0.9987891},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019438479,0.00037148298,0.9776826,0.0013544989,0.00024969951,0.00012894119,0.000009272403,0.00021740938,0.018042272],"genre_scores_gemma":[0.36293098,0.00001664523,0.6352579,0.0012289382,0.0001525688,0.000053610554,0.00001797936,0.00000966035,0.00033167444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993174,0.000015362757,0.000079892,0.00023141963,0.00014320499,0.00021269529],"domain_scores_gemma":[0.9993469,0.000047593418,0.000024521996,0.0003732055,0.00008243856,0.00012530721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031759436,0.000073977324,0.00008381774,0.00006328396,0.00006971536,0.0001466792,0.00052856765,0.000034357872,0.000014120512],"category_scores_gemma":[0.000030057467,0.00006220765,0.000043638265,0.00023923756,0.000015955007,0.0005636184,0.00018784527,0.000043370626,0.000020195286],"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.000004449955,0.000027430613,0.0003087665,0.000012125674,0.000007086078,0.0000018372727,0.0011229672,0.000005174471,0.000041718587,0.90572995,0.08960484,0.0031336285],"study_design_scores_gemma":[0.00068936107,0.00009946862,0.00013088822,0.00001100549,0.000006570547,0.000011308178,0.00032169902,0.018763907,0.0029616298,0.21495958,0.7617886,0.00025595608],"about_ca_topic_score_codex":0.00003820722,"about_ca_topic_score_gemma":0.00006701621,"teacher_disagreement_score":0.6907704,"about_ca_system_score_codex":0.0000093794115,"about_ca_system_score_gemma":0.000036651014,"threshold_uncertainty_score":0.25367543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08673925,0.002451635,0.90746605,0.0013993442,0.0010172536,0.00018457268,0.00069190975,0.000030835974,0.000019164167],"genre_scores_gemma":[0.9973871,0.00019130611,0.001687119,0.00007435755,0.00033490954,0.0000074017357,0.0003085428,0.000004480907,0.00000474584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817646,0.00009120801,0.00066405296,0.00023228441,0.0005133345,0.00032266253],"domain_scores_gemma":[0.9984345,0.00011039918,0.00045432727,0.00019861704,0.0006279407,0.00017424767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006637498,0.00018100659,0.00029005454,0.00018737219,0.0000965227,0.00024752712,0.0009726048,0.00007224867,0.000006911846],"category_scores_gemma":[0.00015616958,0.00014923104,0.00022402522,0.00022351714,0.00003201802,0.00021535222,0.00007078723,0.0001904481,0.0000013304984],"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.0013974945,0.0011703992,0.013502027,0.00008549144,0.0017690355,0.00020912275,0.00076889695,0.019525127,0.0017830601,0.88901836,0.05701751,0.013753506],"study_design_scores_gemma":[0.013183984,0.0032344568,0.07180718,0.00047541247,0.00020554927,0.002576116,0.00059281173,0.19565621,0.0005973301,0.1348998,0.5749331,0.0018380687],"about_ca_topic_score_codex":0.000029770465,"about_ca_topic_score_gemma":0.000017108683,"teacher_disagreement_score":0.91064787,"about_ca_system_score_codex":0.00006987645,"about_ca_system_score_gemma":0.00011321946,"threshold_uncertainty_score":0.60854656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25830096,0.000026424026,0.73880756,0.001964577,0.00011149227,0.000362155,0.000004673079,0.000048914488,0.00037323113],"genre_scores_gemma":[0.73107415,0.000006129482,0.26857683,0.00028917997,0.000027970274,0.00001336447,0.0000040286122,0.000006386062,0.0000019222366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987624,0.000043404525,0.00033149763,0.00021129838,0.00049697654,0.00015438115],"domain_scores_gemma":[0.99838513,0.0006849308,0.00016620073,0.0006115469,0.00010226111,0.000049903458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005314372,0.000126656,0.00014011591,0.000089402965,0.00021875788,0.00014822774,0.0009117359,0.000037532816,0.000004729126],"category_scores_gemma":[0.000095525,0.000069755704,0.00008608325,0.0005278441,0.00004392878,0.00018102895,0.00023426591,0.00010477872,0.000077781275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009331057,0.00033736063,0.000013383882,0.000044993114,0.000014281603,0.0000011789225,0.008311075,0.029099425,0.00018499268,0.940645,0.002594416,0.018744566],"study_design_scores_gemma":[0.00038615346,0.00027927238,0.0014404525,0.00030661043,0.000012045182,0.000006870359,0.00037665982,0.06177528,0.0026398976,0.9307784,0.0017998284,0.00019854773],"about_ca_topic_score_codex":0.000008962942,"about_ca_topic_score_gemma":0.000020387904,"teacher_disagreement_score":0.47277322,"about_ca_system_score_codex":0.000024855548,"about_ca_system_score_gemma":0.000023498002,"threshold_uncertainty_score":0.2844555},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059837396,0.000035852707,0.9912901,0.00038081052,0.00039602703,0.00013581898,0.00015605378,0.00017404695,0.0014475688],"genre_scores_gemma":[0.45123672,0.00008061223,0.5480772,0.0005059662,0.000028423734,0.000019791518,0.0000035367689,0.000012480624,0.000035204397],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99856484,0.000047688594,0.0003236965,0.00044674167,0.00032301346,0.00029404226],"domain_scores_gemma":[0.99812627,0.000107792155,0.00010777559,0.0014226625,0.00010951892,0.00012599117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023847849,0.00017339678,0.00020175426,0.00022621299,0.00019707803,0.000040663992,0.0012728655,0.000098244345,0.00017725948],"category_scores_gemma":[0.000019027188,0.00017115465,0.0001824652,0.0007092383,0.00008909723,0.00049616024,0.000030459112,0.00026656262,0.00004530869],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004665355,0.0007926194,0.000111345966,0.000042070864,0.00012963281,0.000028584112,0.01033206,0.000015183871,0.0006466562,0.016961537,0.00027193286,0.9706217],"study_design_scores_gemma":[0.0072028236,0.00399338,0.050954025,0.0005893999,0.00049371074,0.00048163434,0.0020391282,0.064346075,0.6758584,0.119529955,0.070379175,0.00413231],"about_ca_topic_score_codex":0.0007237629,"about_ca_topic_score_gemma":0.0000756696,"teacher_disagreement_score":0.96648943,"about_ca_system_score_codex":0.000017332502,"about_ca_system_score_gemma":0.000059037127,"threshold_uncertainty_score":0.6979484},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43237534,0.0007158813,0.5666316,0.0000647716,0.000072629584,0.00002635888,9.417316e-7,0.000011159661,0.00010130079],"genre_scores_gemma":[0.9650194,0.000071445465,0.034822606,0.000043846965,0.0000380128,2.1969386e-7,0.0000015363519,0.0000026205882,2.8816532e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99896944,0.00008058579,0.00041592508,0.00016892202,0.00013693572,0.00022817824],"domain_scores_gemma":[0.99932116,0.000104156155,0.00030787912,0.000095003656,0.00006803332,0.00010376388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066441117,0.0001038744,0.00020551989,0.00013913718,0.00014173395,0.00015989984,0.00015331099,0.000048977025,0.0000013031407],"category_scores_gemma":[0.00012188796,0.00009426636,0.000044132415,0.00036165724,0.000032570155,0.00038887438,0.000078727586,0.00024867852,2.9015715e-7],"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.0001099008,0.0005882754,0.4648393,0.00015908873,0.0001230958,0.0005387138,0.0036184944,0.009731133,0.0019390326,0.39754665,0.0005046113,0.12030171],"study_design_scores_gemma":[0.007919031,0.0012541374,0.5390974,0.00050646375,0.00006329024,0.0072644553,0.0012983965,0.2680357,0.0010443544,0.16892856,0.0033826178,0.0012055639],"about_ca_topic_score_codex":0.000019850466,"about_ca_topic_score_gemma":0.00000921263,"teacher_disagreement_score":0.5326441,"about_ca_system_score_codex":0.00002473824,"about_ca_system_score_gemma":0.000042666714,"threshold_uncertainty_score":0.38440704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51067644,0.00012383319,0.48795295,0.000026704183,0.00007629215,0.00012249032,0.0000013853045,0.00007299745,0.000946908],"genre_scores_gemma":[0.964038,0.000015228546,0.035771813,0.00011580081,0.000035893136,0.000013349265,0.0000057523066,0.0000023574526,0.0000017629184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994,0.00003753401,0.00010234095,0.00023989592,0.00007836026,0.00014184452],"domain_scores_gemma":[0.99965674,0.000010432814,0.000025865558,0.00023534792,0.000023674293,0.00004792141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000218226,0.00006268361,0.00006604792,0.000060171606,0.0000715425,0.000053563315,0.00026158526,0.000058915255,0.000030110761],"category_scores_gemma":[0.0000024606895,0.0000567036,0.00001755252,0.00030832354,0.000034779965,0.00031592086,0.00010036184,0.00008791142,0.0000033087797],"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.000014264783,0.0004013241,0.01686672,0.000009974663,0.000004866034,0.0000044551757,0.010226384,0.00011931268,0.00009877352,0.95502794,0.0007394897,0.01648652],"study_design_scores_gemma":[0.0008279882,0.00024363257,0.30758762,0.000017993776,0.000005339085,0.000007656605,0.00066507305,0.6756117,0.00044755609,0.010188351,0.0039079827,0.00048911566],"about_ca_topic_score_codex":0.000077478595,"about_ca_topic_score_gemma":0.00012124477,"teacher_disagreement_score":0.94483954,"about_ca_system_score_codex":0.0000066122516,"about_ca_system_score_gemma":0.000010152347,"threshold_uncertainty_score":0.23123057},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98501176,0.00019324853,0.01432848,0.0002047087,0.00001850093,0.00008344614,0.000061050065,0.0000018587341,0.00009696936],"genre_scores_gemma":[0.9960501,0.00014778864,0.0036586325,0.00011620841,0.000021103573,1.6823853e-7,0.000004050088,0.0000013820252,5.5135575e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990458,0.00016474644,0.0004018242,0.000080352256,0.00020034659,0.00010695796],"domain_scores_gemma":[0.9987766,0.00039896803,0.00035239558,0.00022050535,0.00017254624,0.000078966856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043965102,0.00007076034,0.00028890563,0.000084858104,0.000111529494,0.000026533738,0.000211006,0.000011797353,0.0000019714487],"category_scores_gemma":[0.000027703218,0.00004414698,0.00004504602,0.00020612765,0.0007429352,0.00022452821,0.00015161143,0.000111094436,4.8358483e-8],"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.00012554928,0.0006836509,0.12470286,0.00010440964,0.00035918428,0.000022986587,0.048245996,0.000095617695,0.000098956174,0.8249395,0.00022948145,0.00039179475],"study_design_scores_gemma":[0.021868873,0.007802902,0.71112186,0.00047949437,0.00090063974,0.00047837157,0.03509288,0.06975841,0.0048094,0.11955104,0.027124079,0.0010120781],"about_ca_topic_score_codex":0.0012177344,"about_ca_topic_score_gemma":0.000011416078,"teacher_disagreement_score":0.7053885,"about_ca_system_score_codex":0.000004044094,"about_ca_system_score_gemma":0.000024561547,"threshold_uncertainty_score":0.27373758},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19130829,0.00040662734,0.8044756,0.0020575859,0.00015809052,0.000117870055,0.0000056328,0.000024536565,0.0014457759],"genre_scores_gemma":[0.8090518,0.0003054651,0.18995169,0.0004896877,0.0001423074,0.000004307011,9.974506e-7,0.00001746028,0.00003627215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984365,0.000086627275,0.0005914341,0.00022602566,0.00034446732,0.00031491826],"domain_scores_gemma":[0.9988126,0.00019867075,0.00032613473,0.00037194023,0.00010593177,0.00018470298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004469863,0.00017446517,0.00052491366,0.00015438932,0.00015898158,0.000044255197,0.0005828982,0.00012883525,0.000077898825],"category_scores_gemma":[0.00010085351,0.00012173731,0.00015523026,0.00017500661,0.00025013625,0.00036913235,0.00032538822,0.00029260467,0.000035391186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038582823,0.0009391382,0.010309614,0.00053035293,0.00031320238,0.0013938412,0.008561227,0.000019961139,0.0043994035,0.93829143,0.031469118,0.0033869112],"study_design_scores_gemma":[0.0035489423,0.0020449925,0.0074750884,0.00025129315,0.000084670326,0.017988402,0.00018749606,0.0033713735,0.0023380779,0.9426259,0.01941857,0.00066523376],"about_ca_topic_score_codex":8.712888e-7,"about_ca_topic_score_gemma":0.0000039126976,"teacher_disagreement_score":0.61774355,"about_ca_system_score_codex":0.00002754954,"about_ca_system_score_gemma":0.000047887224,"threshold_uncertainty_score":0.49643034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088767445,0.0000053217336,0.9940968,0.00036782146,0.00016976778,0.000042893127,0.00007251959,0.00017831688,0.00417888],"genre_scores_gemma":[0.94165254,0.0000016580509,0.056945734,0.00048303572,0.000034875055,0.0000011436198,0.0008750704,0.0000022486263,0.0000036925583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992417,0.000040829633,0.00009428518,0.00032731885,0.00015990314,0.00013595165],"domain_scores_gemma":[0.9988045,0.00009009571,0.000024851499,0.0009956992,0.000023428136,0.00006140456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023981431,0.00006427807,0.00006870247,0.000035639234,0.00008060179,0.00012348228,0.0009984125,0.000027734983,0.000018288272],"category_scores_gemma":[0.000028656417,0.0000546456,0.000015842723,0.00027116088,0.000032707718,0.00051950343,0.0003988814,0.00006456002,0.00012302674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055257497,0.00008615037,0.000108712156,0.0000048459715,0.0000051285356,0.0000012912426,0.000021333219,0.00072949793,0.000015041316,0.87326306,0.049601864,0.07615754],"study_design_scores_gemma":[0.00020219259,0.00006882945,0.0015172474,0.000004497413,0.0000016440331,0.0000017507035,0.000006536505,0.9039257,0.00021039121,0.019470004,0.07449562,0.00009559094],"about_ca_topic_score_codex":0.00006411557,"about_ca_topic_score_gemma":0.000016893244,"teacher_disagreement_score":0.94076484,"about_ca_system_score_codex":0.000007057669,"about_ca_system_score_gemma":0.000012577051,"threshold_uncertainty_score":0.2228383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024162607,0.000043186905,0.93959963,0.00005694394,0.00012373619,0.00003628205,0.000002234573,0.00018621335,0.059710156],"genre_scores_gemma":[0.022664662,0.000011816259,0.9768095,0.000442926,0.000020341733,0.000004555438,0.0000015586705,0.0000017896597,0.00004283531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999499,0.000013102778,0.00007366891,0.00018381132,0.00008769572,0.00014267552],"domain_scores_gemma":[0.9994565,0.000010407867,0.000015611562,0.00043201892,0.000018490307,0.00006694714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084654916,0.000054854474,0.00005235087,0.000043337554,0.000042562515,0.00003636381,0.0005828796,0.000024599316,0.0002189439],"category_scores_gemma":[0.0000029999942,0.00004418009,0.00004277782,0.00020004543,0.000022602891,0.0003988807,0.00017475455,0.00004758651,0.00018917448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0733465e-7,0.00006113176,0.00020759014,9.23436e-7,0.000004626571,0.000009824766,0.00057684304,4.2464166e-8,0.000004951313,0.912231,0.0035202599,0.083381884],"study_design_scores_gemma":[0.00083081896,0.00024265262,0.030018015,0.0000078678495,0.000007806615,0.00006119183,0.000111329835,0.044001523,0.0019475189,0.8123885,0.10974464,0.00063818373],"about_ca_topic_score_codex":0.00013154311,"about_ca_topic_score_gemma":0.000014175897,"teacher_disagreement_score":0.10622438,"about_ca_system_score_codex":0.0000021534236,"about_ca_system_score_gemma":0.000010537324,"threshold_uncertainty_score":0.24315183},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1331919,0.004187187,0.8605884,0.00026038205,0.00042841313,0.0007428382,0.000010056288,0.00008438029,0.0005064936],"genre_scores_gemma":[0.9788524,0.0062301457,0.014582752,0.000089100206,0.00002013625,0.00015274063,0.00006080617,0.000007612334,0.0000043241253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987338,0.0001336545,0.0003329727,0.0003553436,0.00016460684,0.000279594],"domain_scores_gemma":[0.99830526,0.00013670034,0.00013279375,0.0013200352,0.00001924824,0.00008595373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010013174,0.00014941317,0.00017513576,0.00017034622,0.000337243,0.00031562365,0.0012313364,0.00014382083,0.000003915773],"category_scores_gemma":[0.000010178831,0.00016552405,0.00006658715,0.0003574528,0.00012261793,0.0009415468,0.00064287183,0.000457693,0.000001985071],"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.000015080004,0.00019646584,0.002313159,0.00007318708,0.00003036495,0.000001416924,0.0013207018,0.00017358229,0.000078809615,0.9906492,0.000059911305,0.005088109],"study_design_scores_gemma":[0.0013440684,0.000057252153,0.034914654,0.00014832836,0.000030296484,0.000010936844,0.0005363949,0.74487805,0.000020101152,0.19464989,0.022895066,0.000514941],"about_ca_topic_score_codex":0.00009569324,"about_ca_topic_score_gemma":0.002167577,"teacher_disagreement_score":0.8460056,"about_ca_system_score_codex":0.000017044615,"about_ca_system_score_gemma":0.000006487715,"threshold_uncertainty_score":0.6749875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023505634,0.000010238607,0.90837085,0.000997665,0.00064936106,0.000047295576,0.0000036617025,0.0001930834,0.06622222],"genre_scores_gemma":[0.787002,0.0000037355235,0.21162416,0.0012276585,0.00007178034,0.0000040177442,0.000004617376,0.0000015634444,0.00006046467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995844,0.0000045627435,0.00005508267,0.00014676989,0.00010434666,0.00010487899],"domain_scores_gemma":[0.99945533,0.000012487851,0.000010957668,0.00044936727,0.00002132997,0.00005052244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001106839,0.00003794103,0.00003226756,0.000027378466,0.000050211565,0.000095562755,0.0004635178,0.000019750618,0.00017779227],"category_scores_gemma":[0.000007068801,0.000030773703,0.00002392429,0.00015931854,0.000021073824,0.00030562223,0.00014315396,0.000083742365,0.000071345166],"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":[3.0993525e-7,0.000026106643,0.00049975765,6.323682e-7,0.0000013200394,0.0000014169108,0.000057086396,6.484585e-8,0.0021409085,0.9762798,0.008696594,0.012296014],"study_design_scores_gemma":[0.00015622146,0.00003058695,0.0071825194,8.393412e-7,8.608341e-7,0.000009256389,0.0000066369166,0.0020658409,0.003540478,0.056657214,0.9302291,0.00012044145],"about_ca_topic_score_codex":0.000040186187,"about_ca_topic_score_gemma":0.00009211982,"teacher_disagreement_score":0.9215325,"about_ca_system_score_codex":0.000001207579,"about_ca_system_score_gemma":0.000013229405,"threshold_uncertainty_score":0.19467008},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10917895,0.000019066487,0.8871457,0.00040917227,0.00008105388,0.000070916016,0.0000012490393,0.00026832338,0.0028255377],"genre_scores_gemma":[0.88047934,0.0000039562324,0.11913555,0.00032532215,0.00002586021,0.000008274785,0.0000058272044,0.000004095394,0.000011798436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993051,0.00004343428,0.00008780149,0.00025306802,0.00017247934,0.00013811357],"domain_scores_gemma":[0.9992157,0.00002548417,0.000034387784,0.00061923394,0.000042554828,0.000062625055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019217795,0.00007219143,0.000072452254,0.00005776183,0.00008725098,0.00010382794,0.00042457285,0.000024061643,0.00002965381],"category_scores_gemma":[0.000007462527,0.000051803854,0.000025554948,0.00034827978,0.000036975194,0.00012039603,0.000063555875,0.000047064434,0.00007913714],"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.0000055123046,0.000047982918,0.0002705204,0.0000032387445,0.0000035966923,7.4805325e-7,0.0000956783,0.0001846761,0.00050384575,0.99362224,0.00064019393,0.004621767],"study_design_scores_gemma":[0.0022035148,0.00039121427,0.026135882,0.000021546335,0.000019018567,0.00004841789,0.00003082383,0.82162035,0.014173907,0.019902807,0.114742205,0.0007103215],"about_ca_topic_score_codex":0.000037901864,"about_ca_topic_score_gemma":0.00001602557,"teacher_disagreement_score":0.9737194,"about_ca_system_score_codex":0.000006153603,"about_ca_system_score_gemma":0.000014081437,"threshold_uncertainty_score":0.21124999},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7593483,0.00007099982,0.23431323,0.00055952475,0.000119363576,0.00020999693,0.000003824794,0.00019661893,0.0051781293],"genre_scores_gemma":[0.88440174,0.000014112645,0.11509894,0.0003663037,0.00004940406,0.000015195593,0.000005430125,0.000010207882,0.00003865606],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813694,0.000036614685,0.00043503157,0.0006528786,0.0002137115,0.0005248138],"domain_scores_gemma":[0.99902123,0.000085712585,0.00010247034,0.0005504673,0.000068612666,0.0001714794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006561117,0.00017647348,0.00022444922,0.00023194843,0.00018915843,0.000877305,0.0007015893,0.00007444135,0.00017569645],"category_scores_gemma":[0.000061598315,0.0001477094,0.000061349194,0.00055899343,0.00008211168,0.0023149143,0.0010458949,0.00023395766,0.000053546133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026283793,0.00038952692,0.3354762,0.0005590471,0.00006918715,0.00015224435,0.014847213,0.00006357091,0.27183217,0.1886771,0.0025632137,0.18534423],"study_design_scores_gemma":[0.0015607794,0.00008139794,0.23454082,0.000335905,0.000015131799,0.00009437536,0.0014574579,0.6764827,0.04645915,0.036093254,0.0014759669,0.0014030873],"about_ca_topic_score_codex":0.0023361668,"about_ca_topic_score_gemma":0.00043075555,"teacher_disagreement_score":0.6764191,"about_ca_system_score_codex":0.000019903451,"about_ca_system_score_gemma":0.00002301479,"threshold_uncertainty_score":0.84598726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004690714,0.0004611291,0.9937626,0.00007841051,0.0001447653,0.00070006034,0.0000016404657,0.00013236064,0.000028282137],"genre_scores_gemma":[0.5208464,0.000012763418,0.47879854,0.00012020744,0.000112332884,0.000087014785,0.000017283595,0.0000046398036,7.717562e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990947,0.00003305832,0.00018618802,0.00036998218,0.00011942535,0.00019664459],"domain_scores_gemma":[0.99927866,0.00006250204,0.00009563538,0.000430776,0.00006398773,0.000068447705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022021738,0.00012468698,0.00018041946,0.0000549131,0.00013721576,0.00023340457,0.00035141603,0.000057117322,1.804463e-7],"category_scores_gemma":[0.0000031395707,0.00009815184,0.00004162289,0.0002473936,0.00004360102,0.00038871716,0.000091996764,0.00007972638,9.118352e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038924936,0.00026272118,0.00017207178,0.003714003,0.00008601796,0.000003903877,0.002750066,0.19286752,0.000016370968,0.7894094,0.0002932292,0.010385758],"study_design_scores_gemma":[0.0006103112,0.000116482486,0.0007078587,0.00049558515,0.000017619532,0.000034717108,0.000009115252,0.99188477,0.000008347293,0.005936435,0.000029980003,0.0001487805],"about_ca_topic_score_codex":0.0000034800537,"about_ca_topic_score_gemma":0.0000019652255,"teacher_disagreement_score":0.79901725,"about_ca_system_score_codex":0.00001570635,"about_ca_system_score_gemma":0.000014906978,"threshold_uncertainty_score":0.40025157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011369461,0.000052248266,0.98618823,0.0005314604,0.00034265057,0.0004603659,0.000008325745,0.00023853887,0.00080870284],"genre_scores_gemma":[0.8118763,0.000007704867,0.1874619,0.00045601008,0.00010335844,0.000024082132,0.000042671352,0.0000074207423,0.000020535932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872917,0.000029321664,0.0002556836,0.00039701496,0.00021700346,0.0003717838],"domain_scores_gemma":[0.9989686,0.00013307885,0.00006981301,0.00060497114,0.00007680175,0.00014670624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006156128,0.00013831371,0.00015563771,0.00010429873,0.00014606345,0.00011954358,0.0007356064,0.00008922594,0.000019859954],"category_scores_gemma":[0.000016600956,0.00011394372,0.00012921615,0.00039323553,0.00006549072,0.00016048162,0.00016119737,0.00011817839,0.000004813339],"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.00007044858,0.00012460376,0.00008601758,0.000019536808,0.000019276471,0.0000018438794,0.0004609421,0.00015441363,0.00034168168,0.85302466,0.002460549,0.14323601],"study_design_scores_gemma":[0.001690978,0.00017562353,0.0040849894,0.000027005393,0.000023590725,0.000012446612,0.000067770234,0.88799393,0.006492945,0.067443624,0.031520084,0.00046702905],"about_ca_topic_score_codex":0.0000439693,"about_ca_topic_score_gemma":0.00010314604,"teacher_disagreement_score":0.8878395,"about_ca_system_score_codex":0.000018885614,"about_ca_system_score_gemma":0.000025025005,"threshold_uncertainty_score":0.46464902},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042104977,0.00017829017,0.94092566,0.0003425696,0.00032250857,0.000034814868,0.0000021910878,0.00012469251,0.05385875],"genre_scores_gemma":[0.90784436,0.000009672447,0.09085518,0.0011484611,0.000090324866,0.0000034465488,0.0000037835566,0.000001233877,0.00004350728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995695,0.000009813478,0.000053170963,0.00008620409,0.0001055578,0.00017580132],"domain_scores_gemma":[0.99957925,0.000011528925,0.000010682799,0.000309911,0.000011898648,0.00007674335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015054461,0.00003733588,0.000032677268,0.000024480694,0.000042627104,0.00004653723,0.00028797932,0.000012771199,0.00010453286],"category_scores_gemma":[0.000003806455,0.00003003258,0.00002320734,0.00016365219,0.000011381006,0.0007057173,0.00014314098,0.000028388398,0.00011783687],"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":[3.1346116e-7,0.00005128368,0.0038899025,9.683756e-7,0.000002097702,2.4889968e-7,0.00019791543,8.574066e-8,0.00006578342,0.97252,0.015035625,0.008235759],"study_design_scores_gemma":[0.00012503617,0.00002362959,0.0204952,0.0000015438552,0.000001374046,0.0000065375543,0.000020177105,0.0004610784,0.0012550671,0.009387774,0.96810174,0.000120868244],"about_ca_topic_score_codex":0.00002215371,"about_ca_topic_score_gemma":0.0000027794465,"teacher_disagreement_score":0.96313226,"about_ca_system_score_codex":0.0000045225183,"about_ca_system_score_gemma":0.000005827537,"threshold_uncertainty_score":0.15145938},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933453,0.00016996557,0.0014461185,0.0032113586,0.000247481,0.00039195956,0.000044273187,0.000080468155,0.0010630324],"genre_scores_gemma":[0.7440201,0.00005725554,0.25535375,0.00024247252,0.00022736404,0.000046333465,0.0000036722304,0.000018758456,0.000030285353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980345,1.9131825e-8,0.00057990535,0.00033866393,0.00073354883,0.0003133614],"domain_scores_gemma":[0.9980653,0.000060758477,0.00039977542,0.000110607594,0.0012850403,0.0000785349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194215,0.0002340511,0.00031130458,0.00008376448,0.0001304604,0.0001484758,0.0021253673,0.00012642659,0.0000037380123],"category_scores_gemma":[0.00029521078,0.00016064873,0.00063889805,0.00054409413,0.00027492654,0.0009681403,0.00029140234,0.00028367757,5.7320716e-7],"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.00001351903,0.00010436048,0.00008769296,0.00012374314,0.00011287203,2.8714357e-8,0.00032870987,0.000023872995,0.2840052,0.7129143,0.0012402893,0.0010454421],"study_design_scores_gemma":[0.0014610342,0.00057891454,0.004855737,0.0009310002,0.00014989244,0.000039368984,0.0012189487,0.099584855,0.8530888,0.03358292,0.0038850198,0.0006235208],"about_ca_topic_score_codex":0.000008214281,"about_ca_topic_score_gemma":8.051796e-8,"teacher_disagreement_score":0.67933136,"about_ca_system_score_codex":0.00005723793,"about_ca_system_score_gemma":0.000039013416,"threshold_uncertainty_score":0.6551065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39695555,0.0000040594173,0.6021401,0.0001312745,0.0002552079,0.00014778711,0.0000024218077,0.0000214085,0.00034219632],"genre_scores_gemma":[0.9868984,0.0000033220801,0.012892225,0.00017919177,0.00001561286,0.000007351756,0.000003238701,5.393752e-7,1.12678336e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991404,0.000014148212,0.00022916117,0.00013714506,0.0003290686,0.00015009183],"domain_scores_gemma":[0.9992186,0.000023584425,0.00012525768,0.0005201001,0.00007978346,0.00003270694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009185494,0.000057886034,0.000055977252,0.0001357382,0.0003268568,0.00026962385,0.0014854766,0.000027216796,4.737458e-7],"category_scores_gemma":[0.000013816328,0.00003500963,0.000023622079,0.0011056699,0.00020003993,0.004839621,0.00049106195,0.00013954326,0.0000019428553],"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.0000010973699,0.000011399789,0.006344166,0.000028765442,6.0209555e-7,3.9000078e-8,0.005607385,0.00006285263,0.0015099125,0.9557609,0.000012969557,0.030659929],"study_design_scores_gemma":[0.00008484251,0.000010564305,0.23370655,0.000011862371,5.777094e-7,0.000013091893,0.00008505879,0.763907,0.00018771282,0.00088718795,0.0010624182,0.000043126474],"about_ca_topic_score_codex":0.000029254945,"about_ca_topic_score_gemma":0.000012726593,"teacher_disagreement_score":0.9548737,"about_ca_system_score_codex":0.000014779091,"about_ca_system_score_gemma":0.00004231332,"threshold_uncertainty_score":0.35086086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004146498,0.000016456323,0.9911506,0.00011421713,0.0007439925,0.00022923673,0.000009811703,0.00014575578,0.0034433876],"genre_scores_gemma":[0.33263043,0.000011734044,0.66599095,0.0011278841,0.00013067429,0.00003566573,0.0000132099185,0.0000052576147,0.000054215143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991701,0.000024386842,0.00013292849,0.00031049995,0.00015946047,0.00020259149],"domain_scores_gemma":[0.9992508,0.000034506513,0.00004219815,0.00056648324,0.000039081584,0.000066923516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002536965,0.000094766176,0.00009324318,0.00009173758,0.00013139188,0.00048145844,0.0015011724,0.00003452896,0.000045955916],"category_scores_gemma":[0.000017502496,0.000078966186,0.000077171746,0.0002480616,0.000029243736,0.001377599,0.00072167517,0.000048538997,0.000013362405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031275008,0.000030277479,0.001171644,0.00002992334,0.000014857839,4.4701608e-7,0.00005857628,0.000010405346,0.000009090269,0.96396554,0.011895734,0.022810377],"study_design_scores_gemma":[0.0013470523,0.000060280647,0.13247985,0.000011448387,0.000019095922,0.0000025588638,0.000028262792,0.07073891,0.0010983627,0.6360719,0.15774788,0.00039437725],"about_ca_topic_score_codex":0.000048132857,"about_ca_topic_score_gemma":0.00012014219,"teacher_disagreement_score":0.3284839,"about_ca_system_score_codex":0.0000070296387,"about_ca_system_score_gemma":0.000004508597,"threshold_uncertainty_score":0.4642715},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28383964,0.53602964,0.025505804,0.13524269,0.0018840104,0.0024776186,0.00034474066,0.0018124413,0.012863439],"genre_scores_gemma":[0.8028034,0.18248712,0.014257248,0.00011983827,0.00007325182,0.00019143324,0.00004702995,0.000015629264,0.00000503585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756527,0.00080234784,0.00048261596,0.0004980765,0.00024923583,0.0004024478],"domain_scores_gemma":[0.99316764,0.00044246207,0.00018233244,0.0056830207,0.00022701574,0.00029753003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010599425,0.00025106504,0.00033887313,0.00032418178,0.0009328794,0.00026041974,0.0032339361,0.00019852041,0.0000014973403],"category_scores_gemma":[0.000048940783,0.00027555323,0.000060634015,0.0010975925,0.00064348825,0.0011251996,0.0024295892,0.00072481885,0.000009178693],"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.000013750939,0.001069666,0.001923614,0.000052577034,0.00005404802,0.00000267075,0.0158659,0.0000020927796,0.00009648545,0.82412195,0.0008236304,0.1559736],"study_design_scores_gemma":[0.0032137313,0.0001728524,0.041135017,0.0004278094,0.00007941902,0.00026184673,0.008330631,0.10275014,0.000074096606,0.09361056,0.7485139,0.0014300091],"about_ca_topic_score_codex":0.0006718762,"about_ca_topic_score_gemma":0.004509337,"teacher_disagreement_score":0.74769026,"about_ca_system_score_codex":0.000097183256,"about_ca_system_score_gemma":0.00017234683,"threshold_uncertainty_score":0.99996966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010693808,0.000014902665,0.92838883,0.006524107,0.00011474595,0.06348467,0.00003228295,0.00017815895,0.00019294022],"genre_scores_gemma":[0.069459,0.000012987332,0.61374557,0.005930723,0.0002499902,0.31031433,0.00006975641,0.000020714819,0.00019696564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991906,0.000020620095,0.00014847373,0.00026452116,0.00012592913,0.00024983677],"domain_scores_gemma":[0.9988671,0.00017257624,0.000039858867,0.00074157567,0.000105740626,0.00007314777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012833848,0.00008229994,0.00007117703,0.00003363383,0.00016190138,0.00016993115,0.0005835692,0.000027573076,0.00010156455],"category_scores_gemma":[0.000029941284,0.000043906926,0.00006664813,0.00020711486,0.000039036233,0.0004593769,0.00019741525,0.000070211165,0.00005559332],"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.0000581417,0.00065265055,0.00044638093,0.000060589944,0.00003207268,0.0000020194032,0.00056209945,0.000023862669,0.004092164,0.23503508,0.20011035,0.5589246],"study_design_scores_gemma":[0.0008186252,0.00018927372,0.040992327,0.0000119260385,0.0000062135173,0.000005346945,0.00009112185,0.3233582,0.0019210762,0.053274237,0.5790848,0.00024685374],"about_ca_topic_score_codex":0.00041832516,"about_ca_topic_score_gemma":0.00006488241,"teacher_disagreement_score":0.55867773,"about_ca_system_score_codex":0.000005294417,"about_ca_system_score_gemma":0.000025020923,"threshold_uncertainty_score":0.17904726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02080494,0.000036083504,0.9775295,0.00045076216,0.00013007662,0.00021208827,0.0000271117,0.0001421357,0.00066730246],"genre_scores_gemma":[0.6071501,0.00000135156,0.3923254,0.00039812044,0.000035286004,0.00002216595,0.000063843625,0.0000030164895,7.526349e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990896,0.000049783568,0.00021438992,0.000323857,0.00012236126,0.00020000272],"domain_scores_gemma":[0.9992701,0.00014342194,0.00008966536,0.00039902306,0.00004822421,0.000049606148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005900407,0.00009250238,0.00010613675,0.00012089126,0.00008444403,0.00010038867,0.0003566977,0.00003387445,0.000008275895],"category_scores_gemma":[0.00018970708,0.000082081664,0.000038605172,0.00031948183,0.000060477512,0.0006674782,0.000057669826,0.00007620096,0.0000038109408],"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.000004997044,0.00006265531,0.004799131,0.000057323414,0.0000010688283,9.069155e-7,0.000087987566,0.000028760203,0.0009574697,0.9678329,0.00025343016,0.025913373],"study_design_scores_gemma":[0.0023190742,0.00018210015,0.012551552,0.00028422973,0.000010778925,0.000007639287,0.000070624716,0.6690763,0.013434269,0.2816826,0.019663647,0.0007171519],"about_ca_topic_score_codex":0.00007824989,"about_ca_topic_score_gemma":0.0002077809,"teacher_disagreement_score":0.6861503,"about_ca_system_score_codex":0.000016173897,"about_ca_system_score_gemma":0.00009170735,"threshold_uncertainty_score":0.3347193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010483629,0.000035762037,0.98708624,0.00025874056,0.0000406425,0.0009266364,0.0000138806945,0.000075360156,0.0010791341],"genre_scores_gemma":[0.69960773,0.0000015688953,0.29986024,0.000023691766,0.00007651436,0.00041162575,0.0000060549464,0.0000017582771,0.000010807558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946004,0.000027996099,0.00014235769,0.00016415959,0.00009755847,0.000107889304],"domain_scores_gemma":[0.9990945,0.00032615964,0.00007482166,0.00042571567,0.000063110536,0.00001572784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027191074,0.000051962583,0.000059925776,0.00003167264,0.0001922196,0.000054100678,0.0007266396,0.000022816335,0.0000055737073],"category_scores_gemma":[0.000037646692,0.000031987955,0.00004681455,0.00026239702,0.000044732053,0.00019798407,0.00012049638,0.00006885926,0.0000024063136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050144126,0.00018794539,0.003158915,0.00004942218,0.000013533173,5.570942e-8,0.0009110478,0.000024614912,0.0022243874,0.9197386,0.00249499,0.07119146],"study_design_scores_gemma":[0.0011653099,0.00021702102,0.07119999,0.00003763182,0.000030424646,0.0000053866847,0.00055156945,0.057303485,0.073104,0.55525357,0.24059,0.0005416318],"about_ca_topic_score_codex":0.00020082694,"about_ca_topic_score_gemma":0.00009410308,"teacher_disagreement_score":0.6891241,"about_ca_system_score_codex":0.0000025412567,"about_ca_system_score_gemma":0.000021385722,"threshold_uncertainty_score":0.14784172},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009436085,0.000014255237,0.9839743,0.0002864224,0.0049228524,0.0002790574,0.000024758412,0.0005188957,0.0005434044],"genre_scores_gemma":[0.91915363,0.000003016841,0.07999877,0.0002816658,0.0005121339,0.000013200318,0.0000067967953,0.00001634512,0.000014435011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998411,0.00012203159,0.00031237182,0.00054122455,0.00024645674,0.00036688952],"domain_scores_gemma":[0.9986245,0.00046354576,0.00011724782,0.00056692766,0.0001026564,0.00012510318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063170877,0.0001972672,0.00020014965,0.0001798884,0.0006939283,0.00019803365,0.0006432106,0.00010790434,0.000005225549],"category_scores_gemma":[0.000016681022,0.00021018162,0.00019125563,0.0006063064,0.000040738025,0.00025578632,0.0000064239794,0.0002515019,0.000027707803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003473465,0.00029751068,0.000012807379,0.00006157164,0.000044609318,0.0000015747082,0.001248104,0.050007593,0.00072052254,0.7261441,0.0011440294,0.22028287],"study_design_scores_gemma":[0.00097527314,0.0003773595,0.00011339063,0.000062286534,0.000029856154,0.000012959795,0.00004433452,0.9494118,0.00613923,0.03165746,0.010699829,0.00047619667],"about_ca_topic_score_codex":0.000017362327,"about_ca_topic_score_gemma":0.000013151894,"teacher_disagreement_score":0.90971756,"about_ca_system_score_codex":0.00003923547,"about_ca_system_score_gemma":0.000033501747,"threshold_uncertainty_score":0.8570957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28203896,0.00018476778,0.6775051,0.0023603756,0.00030653342,0.0001462622,0.0000037667696,0.00014027198,0.037313987],"genre_scores_gemma":[0.8881034,0.000010429301,0.11110906,0.0006763412,0.00008302389,0.0000070433834,0.000002342446,0.0000033371646,0.0000050210656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989683,0.0001097214,0.00015444135,0.00017417726,0.00023204635,0.00036132376],"domain_scores_gemma":[0.9988883,0.00010068164,0.00003308572,0.0009027047,0.000014094029,0.00006113532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011376595,0.00009362049,0.000085964624,0.00006811953,0.00012228558,0.0002538265,0.002122331,0.000034574427,0.00006567073],"category_scores_gemma":[0.00004024221,0.000059962953,0.000054128403,0.00047797352,0.000025564328,0.0017490799,0.0010570444,0.00018431869,0.00004796407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043460564,0.00017175548,0.009453527,0.0000248425,0.000008383973,0.000012832423,0.021107767,0.0000026384296,0.0008578315,0.9496154,0.008074786,0.0106658805],"study_design_scores_gemma":[0.0008648062,0.00006643763,0.38694668,0.00006399181,0.0000117926265,0.0001330307,0.002143196,0.007985338,0.0034650902,0.5228194,0.07465132,0.0008489037],"about_ca_topic_score_codex":0.0005009459,"about_ca_topic_score_gemma":0.00004718349,"teacher_disagreement_score":0.60606444,"about_ca_system_score_codex":0.000009223869,"about_ca_system_score_gemma":0.000013849298,"threshold_uncertainty_score":0.39438543},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011497984,0.0000022736788,0.98452425,0.000791515,0.00040991005,0.00014084975,0.000017954591,0.00018135623,0.002433919],"genre_scores_gemma":[0.5869119,2.9402685e-7,0.41260827,0.00038246086,0.00003526623,0.000014600538,0.000016748965,0.000002088473,0.000028347396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.0000063670086,0.000088224384,0.00017965314,0.00008182131,0.00013069528],"domain_scores_gemma":[0.9994701,0.00007972425,0.000023104847,0.0003192066,0.000044443073,0.00006340235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009958817,0.000053456868,0.00005338156,0.000050540788,0.00012274746,0.000109929744,0.00044178165,0.000029547382,0.000029510533],"category_scores_gemma":[0.00001835353,0.000045385932,0.0000547843,0.00015566638,0.000022296488,0.00026043993,0.00009867894,0.00006774984,0.000028903187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012485974,0.0000536271,0.0005549016,0.0000032550067,0.0000058759624,2.9798235e-7,0.0002482783,0.000004855574,0.0008778455,0.9815041,0.0047475146,0.011998243],"study_design_scores_gemma":[0.0017021673,0.00015990563,0.022518827,0.000005706028,0.00001209959,0.000012242512,0.000101903264,0.23271964,0.005314041,0.3848662,0.35205737,0.00052987935],"about_ca_topic_score_codex":0.000014031013,"about_ca_topic_score_gemma":0.000059608366,"teacher_disagreement_score":0.59663785,"about_ca_system_score_codex":0.000001699775,"about_ca_system_score_gemma":0.000013713343,"threshold_uncertainty_score":0.18507846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.604497,0.001465027,0.37483844,0.018603753,0.00033734937,0.00010142774,0.0000011298064,0.0000106412845,0.00014524203],"genre_scores_gemma":[0.96509033,0.0005616482,0.03353094,0.0007351145,0.00007521384,0.0000024143171,7.532449e-7,0.0000026645264,9.227095e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903786,0.00027833253,0.0003019436,0.000108554595,0.00012666317,0.00014664017],"domain_scores_gemma":[0.999118,0.0002169075,0.00015064195,0.0003250244,0.00011725078,0.000072200266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288032,0.0000742008,0.00016065518,0.0002061442,0.00008523012,0.00006890048,0.0006297768,0.00007419736,0.000012270334],"category_scores_gemma":[0.00010185769,0.00004980657,0.000038098835,0.00036295402,0.00008039202,0.00041673175,0.00013938181,0.0003141037,0.0000044300514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021833052,0.0003578749,0.029096544,0.000014466762,0.00004075353,0.00014895313,0.012934928,0.0002945873,0.00061171915,0.90553784,0.003229051,0.047514975],"study_design_scores_gemma":[0.003419514,0.0012263079,0.31316698,0.00028321403,0.00004286937,0.004183744,0.0011035597,0.020304596,0.0005059644,0.4335152,0.22171396,0.0005340956],"about_ca_topic_score_codex":0.000035744044,"about_ca_topic_score_gemma":0.00021615527,"teacher_disagreement_score":0.47202262,"about_ca_system_score_codex":0.000013408697,"about_ca_system_score_gemma":0.000022330005,"threshold_uncertainty_score":0.20310532},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03011731,0.00011328438,0.96515524,0.0015605079,0.0014426805,0.00097531936,0.00048409103,0.00013014009,0.000021399535],"genre_scores_gemma":[0.96419203,0.0002555684,0.034242995,0.0008651695,0.00007856895,0.00029510132,0.000055811426,0.000012935923,0.0000018424455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982907,0.00010870112,0.00033401453,0.00066603994,0.00022287831,0.00037765424],"domain_scores_gemma":[0.9980115,0.0005204444,0.00008500478,0.0011386443,0.00008112431,0.0001632545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037674725,0.00020158303,0.00025587366,0.00022857069,0.00022814776,0.0004774858,0.0011435297,0.00015046855,0.000056043296],"category_scores_gemma":[0.000030691255,0.00019643463,0.00007955172,0.00057243835,0.00008095903,0.0025512015,0.00001686057,0.00034089593,0.000016871632],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017104958,0.0061913864,0.030666891,0.00082864944,0.0008186012,0.0000446966,0.007386138,0.0015584724,0.0010997336,0.15564896,0.04196697,0.752079],"study_design_scores_gemma":[0.009796904,0.0005134126,0.020543227,0.00038114152,0.00014941725,0.000046093868,0.00011431328,0.68642414,0.0060219225,0.24019319,0.03432999,0.0014862731],"about_ca_topic_score_codex":0.00074745517,"about_ca_topic_score_gemma":0.0008956907,"teacher_disagreement_score":0.9340747,"about_ca_system_score_codex":0.000028171218,"about_ca_system_score_gemma":0.000053616997,"threshold_uncertainty_score":0.8010372},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016694113,0.00012937273,0.99183583,0.0008655538,0.0022984585,0.0008424932,0.00025405418,0.0002136019,0.0033936743],"genre_scores_gemma":[0.108074754,0.000017333872,0.88358325,0.0070593967,0.00084933033,0.000046371297,0.0001975605,0.00005825723,0.00011376256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953425,0.000062105006,0.00057150936,0.0020174212,0.0009937944,0.0010126684],"domain_scores_gemma":[0.9961707,0.00091637915,0.00027085716,0.001972634,0.00032891563,0.00034050515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015056925,0.00071052054,0.0006193171,0.0014238493,0.0007192077,0.0006102944,0.0036143053,0.00039734322,0.000031927833],"category_scores_gemma":[0.00009322172,0.0006753037,0.00036682648,0.000829661,0.0010151487,0.00038984357,0.00085245125,0.000893261,0.000019814923],"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.00006985396,0.0005562676,0.00041917866,0.00019213298,0.00005075292,0.00006871174,0.0011796082,0.02305845,0.0001746115,0.57505375,0.001280444,0.39789623],"study_design_scores_gemma":[0.00086659304,0.0005815419,0.00046872403,0.00024291147,0.000020425636,0.000021697639,8.694585e-8,0.74349385,0.0008412353,0.23552845,0.016873207,0.0010612904],"about_ca_topic_score_codex":0.00005876875,"about_ca_topic_score_gemma":0.00081896666,"teacher_disagreement_score":0.7204354,"about_ca_system_score_codex":0.00039008213,"about_ca_system_score_gemma":0.00058329524,"threshold_uncertainty_score":0.99956983},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020034153,0.0017750112,0.99506336,0.00059546105,0.0008716464,0.00080547057,0.000052974254,0.00021047132,0.0004252785],"genre_scores_gemma":[0.88666385,0.00003705563,0.10980876,0.0027204491,0.0006422704,0.00003111832,0.000048319314,0.000028681414,0.000019517476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645525,0.00003144849,0.00043496085,0.0017559883,0.0007311044,0.0005912209],"domain_scores_gemma":[0.99741995,0.00027743343,0.0002122022,0.0015978877,0.00021266128,0.00027983525],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00072668464,0.0005522279,0.00052066764,0.00091281085,0.00033127263,0.0011350898,0.0029125996,0.00038868247,0.0000035621945],"category_scores_gemma":[0.00002858446,0.00046829722,0.00011865389,0.0008335265,0.00037671078,0.00047340777,0.00083977584,0.0006638376,0.000010543927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030678897,0.00010273846,0.000104448736,0.00010520184,0.000020337242,0.000059762388,0.00082357315,0.083198406,0.0014810257,0.13821205,0.00025199316,0.7756098],"study_design_scores_gemma":[0.0004928123,0.0005054105,0.0005842551,0.0004437541,0.00001343277,0.000059464983,4.6558756e-7,0.8612887,0.0025234849,0.12250888,0.010250001,0.001329301],"about_ca_topic_score_codex":0.00004319624,"about_ca_topic_score_gemma":0.00009317219,"teacher_disagreement_score":0.88646346,"about_ca_system_score_codex":0.000117303636,"about_ca_system_score_gemma":0.00025794256,"threshold_uncertainty_score":0.99990183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014616231,0.4522776,0.5381988,0.0020969345,0.00045679012,0.0006826663,0.00008615114,0.00018149335,0.0045579076],"genre_scores_gemma":[0.8658277,0.10564544,0.026583364,0.0017071881,0.0000638598,0.00005240823,0.000097759556,0.000016666232,0.0000056539097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998636,0.00024498496,0.00038217055,0.0002678684,0.00026294988,0.00020604506],"domain_scores_gemma":[0.99854857,0.000067865,0.00016372581,0.0009325006,0.00018204589,0.000105267725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018158656,0.00010829815,0.00034484212,0.000063996944,0.00004228605,0.000055910827,0.0009822206,0.00003564639,0.000026542133],"category_scores_gemma":[0.00029946037,0.00008816005,0.0001245171,0.0012535965,0.000041539333,0.00043568356,0.00019270348,0.00008677462,0.000073709416],"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":[8.41684e-7,0.00016830256,0.00253258,0.003349199,0.000029931683,0.0000067968667,0.00011763088,7.5445e-7,0.000027797836,0.9319524,0.0036710426,0.05814273],"study_design_scores_gemma":[0.0015271489,0.0003852482,0.11284731,0.013990084,0.00005533372,0.000106236264,0.000015005381,0.00015753518,0.00043711305,0.03621699,0.8330686,0.0011933744],"about_ca_topic_score_codex":0.00038619805,"about_ca_topic_score_gemma":0.0002454763,"teacher_disagreement_score":0.8957354,"about_ca_system_score_codex":0.000014451112,"about_ca_system_score_gemma":0.00012782827,"threshold_uncertainty_score":0.35950625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023430772,0.00026578942,0.9921741,0.00059737737,0.00089574035,0.00056019274,0.00001911594,0.000081637765,0.003063008],"genre_scores_gemma":[0.9273768,0.000052653515,0.07110368,0.0012698951,0.00014165483,0.000010915169,0.000003675437,0.000019642159,0.00002105858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966543,0.000064245985,0.00049383915,0.0012717549,0.0010108637,0.0005050285],"domain_scores_gemma":[0.9959473,0.0013039414,0.00014174545,0.0022983835,0.00018664918,0.00012196821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012398858,0.00042614437,0.00045309227,0.0005452625,0.00024923135,0.00034905854,0.0043568313,0.00023114523,0.00011577774],"category_scores_gemma":[0.000116939336,0.0002869521,0.00022997744,0.0007339705,0.0011177724,0.0005122132,0.0007419682,0.00085422606,0.000037809248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000624394,0.00005913097,0.00005277376,0.000031972977,0.000009150998,0.000012260049,0.0007050857,0.00091184693,0.00015966156,0.81782174,0.0000508149,0.18017933],"study_design_scores_gemma":[0.0001955412,0.00031043633,0.0006373861,0.00033800874,0.000007460786,0.000021570535,2.2237617e-7,0.055830393,0.0014768674,0.9403982,0.0002997699,0.00048410092],"about_ca_topic_score_codex":0.000037690206,"about_ca_topic_score_gemma":0.00004952341,"teacher_disagreement_score":0.92503375,"about_ca_system_score_codex":0.00010270018,"about_ca_system_score_gemma":0.00022392397,"threshold_uncertainty_score":0.9999583},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18691234,0.00009046235,0.8101187,0.0001251189,0.0020676043,0.0003043353,0.000021411171,0.00024633273,0.000113719325],"genre_scores_gemma":[0.88333404,0.00003723721,0.11615197,0.00017348593,0.0002505963,0.000008858166,0.000015115284,0.00001989184,0.000008790734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968982,0.0003202756,0.00056837645,0.0010448846,0.0005341043,0.0006341816],"domain_scores_gemma":[0.9972826,0.0004895974,0.0001134568,0.0019239903,0.00008036877,0.00010996585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014485582,0.00028617363,0.00032288223,0.00038258496,0.00059941545,0.00023712625,0.0019518668,0.0001398908,0.00002797839],"category_scores_gemma":[0.000028548307,0.00030735234,0.00011960665,0.001394224,0.00009257089,0.00048877095,0.00009498094,0.00088678655,0.00001542386],"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.000045772522,0.0008695341,0.0001470727,0.000083931925,0.000064750435,0.000019610488,0.0077224597,0.8629235,0.00037407398,0.0073022945,0.00007397616,0.12037301],"study_design_scores_gemma":[0.0016312461,0.00006672802,0.00017035252,0.00011687305,0.000012583883,0.000005597202,0.00015461644,0.9919617,0.0012690722,0.00026189868,0.004005456,0.00034387247],"about_ca_topic_score_codex":0.00031953224,"about_ca_topic_score_gemma":0.00012337421,"teacher_disagreement_score":0.6964217,"about_ca_system_score_codex":0.00008300923,"about_ca_system_score_gemma":0.00006237411,"threshold_uncertainty_score":0.99993783},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1253036,0.000053801567,0.86630434,0.0004704214,0.0001804245,0.00010086134,0.0000037210684,0.0003987337,0.007184103],"genre_scores_gemma":[0.9475583,0.000001566371,0.0515836,0.0007993178,0.000045148478,0.0000018780366,0.000004143996,0.0000018284901,0.0000042378138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989673,0.000042492644,0.00016363602,0.0003481915,0.00023938592,0.000239009],"domain_scores_gemma":[0.99892795,0.000017177523,0.00003186997,0.000831617,0.000045389796,0.00014601325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020384513,0.000102863814,0.000110689056,0.00008374687,0.00011194961,0.00021863058,0.0008464462,0.000040970877,0.000029909304],"category_scores_gemma":[0.0000046005093,0.00008088299,0.00006143272,0.0003815112,0.000013781804,0.00034068245,0.000049026163,0.00007267293,0.00006856877],"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.0000036843774,0.00022623177,0.000059474027,0.0000028912625,0.000002392322,0.00001174388,0.00045739897,0.0005451252,0.000891574,0.975356,0.0007989702,0.021644535],"study_design_scores_gemma":[0.0007481151,0.0006678644,0.015580824,0.000027486218,0.0000062309323,0.00005819327,0.0001647607,0.93880856,0.006271839,0.019547302,0.017504517,0.000614283],"about_ca_topic_score_codex":0.000020746518,"about_ca_topic_score_gemma":0.000007457629,"teacher_disagreement_score":0.9558087,"about_ca_system_score_codex":0.000009965777,"about_ca_system_score_gemma":0.000018461846,"threshold_uncertainty_score":0.32983127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072413914,0.00012983399,0.92432535,0.0012844801,0.00012654655,0.00027686908,0.000010441795,0.000053795706,0.0013787923],"genre_scores_gemma":[0.88193935,0.00002234884,0.11771691,0.00009946711,0.000119296164,0.00000451417,0.000009798371,0.000006330337,0.0000819819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990655,0.00004360517,0.00021062754,0.00025376084,0.00018943551,0.0002370599],"domain_scores_gemma":[0.99901956,0.00032824298,0.00010024688,0.00040507707,0.00009076449,0.000056112483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014080133,0.000095634976,0.00015902179,0.00010927906,0.00015320386,0.00008511253,0.00040682193,0.00004562767,0.000014779494],"category_scores_gemma":[0.00005197796,0.00006554131,0.00009068055,0.00032127686,0.0002596821,0.00030015438,0.00020871998,0.00006594787,0.000004398526],"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.00031092082,0.0000560066,0.0004157573,0.000034761844,0.000024472723,0.0000010880004,0.0019487297,0.000046330642,0.0037352853,0.98817337,0.0026915583,0.002561751],"study_design_scores_gemma":[0.013461339,0.0005077797,0.035800833,0.00012070329,0.00012638228,0.00006414033,0.001819949,0.7269788,0.03414307,0.13981117,0.046047386,0.0011184587],"about_ca_topic_score_codex":0.00007187829,"about_ca_topic_score_gemma":0.00007125077,"teacher_disagreement_score":0.84836215,"about_ca_system_score_codex":0.000006298819,"about_ca_system_score_gemma":0.00001577103,"threshold_uncertainty_score":0.2672697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36135268,0.0011060066,0.6260877,0.001499792,0.0001605347,0.00028757605,0.000010958029,0.00030717565,0.009187556],"genre_scores_gemma":[0.98725,0.00028646865,0.012178187,0.00013399254,0.000048720914,0.000015144929,0.000076620854,0.0000057152606,0.000005160346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991631,0.00007098316,0.00017790805,0.0002459314,0.0001611431,0.00018092577],"domain_scores_gemma":[0.9981192,0.0001560303,0.00011028705,0.001419603,0.000095869946,0.00009902532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003190446,0.000114539296,0.000111944224,0.000056897803,0.00039571334,0.00082714116,0.0012289962,0.00010176339,0.000017224997],"category_scores_gemma":[0.000031755913,0.000104428575,0.000032567368,0.00034199638,0.00013993471,0.0018755436,0.0008054243,0.00046384172,0.0000028374545],"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.000028509536,0.0001733547,0.006447659,0.000016954942,0.000035239063,0.0000020023433,0.00280274,0.000091585134,0.00007112426,0.931799,0.0008592975,0.057672556],"study_design_scores_gemma":[0.0016446839,0.00021137396,0.024246372,0.00015072487,0.00004155393,0.00013185169,0.00044462344,0.48214355,0.00034435166,0.38361523,0.10593275,0.0010929215],"about_ca_topic_score_codex":0.000036941474,"about_ca_topic_score_gemma":0.0003553631,"teacher_disagreement_score":0.6258973,"about_ca_system_score_codex":0.000004078068,"about_ca_system_score_gemma":0.000019595636,"threshold_uncertainty_score":0.79761416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033407623,0.000018772445,0.9674974,0.00044235718,0.00020304059,0.015530366,0.000010586946,0.00038062126,0.012576086],"genre_scores_gemma":[0.27171627,6.8842905e-7,0.6982014,0.00056597404,0.0012425709,0.027385764,0.000030616997,0.000029662096,0.0008270207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990418,0.00003061609,0.0001573646,0.00037170498,0.00017677985,0.00022171266],"domain_scores_gemma":[0.99922246,0.000016608374,0.000043873035,0.00061201345,0.000055926685,0.00004910193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014685202,0.00010435506,0.00008241074,0.000087921515,0.00020659655,0.00018498814,0.00039940214,0.00003393349,0.0001122656],"category_scores_gemma":[0.000006875529,0.00008791861,0.00006829155,0.0006521951,0.000035518075,0.0007243047,0.00012007376,0.000107326734,0.0000525964],"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.000013519862,0.0004652136,0.0019589935,0.00004392735,0.00001324819,0.000014359022,0.0001618836,0.00041359026,0.0056441384,0.9110484,0.07327408,0.006948615],"study_design_scores_gemma":[0.0009930307,0.00010191004,0.008508912,0.000018666218,0.000013742901,0.00010292149,0.00005487549,0.03430083,0.009319458,0.05580913,0.89013773,0.00063876976],"about_ca_topic_score_codex":0.00032454196,"about_ca_topic_score_gemma":0.00012570005,"teacher_disagreement_score":0.8552393,"about_ca_system_score_codex":0.000014204274,"about_ca_system_score_gemma":0.000045060147,"threshold_uncertainty_score":0.3585217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07875911,0.0032642633,0.90532357,0.008321378,0.0006131791,0.0008696274,0.00009359185,0.00027960812,0.0024756943],"genre_scores_gemma":[0.90148336,0.00083497254,0.097009964,0.00047320384,0.00013134339,0.000026973097,0.000029013256,0.000008193852,0.0000029953696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977363,0.00043302643,0.00066578377,0.00029633337,0.00034521736,0.0005233646],"domain_scores_gemma":[0.99625665,0.00041451788,0.00038268598,0.0023387067,0.00037083714,0.00023658112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089223945,0.00020028675,0.0002843821,0.00029045742,0.00085591513,0.0005865604,0.004620392,0.000106242995,0.0000014845649],"category_scores_gemma":[0.0003925038,0.00020061167,0.000115688425,0.0018357418,0.00004671877,0.0008640351,0.00029702633,0.00085558556,0.000003585489],"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.00019969197,0.0032077953,0.014263772,0.00012300575,0.00024334497,0.00004156364,0.0029572635,0.006106218,0.0034736611,0.85629326,0.012229218,0.10086123],"study_design_scores_gemma":[0.004336922,0.0010532001,0.08309026,0.002557051,0.000039523744,0.00047097975,0.00046061852,0.8214142,0.00018830803,0.04951473,0.035588097,0.0012861255],"about_ca_topic_score_codex":0.00004668746,"about_ca_topic_score_gemma":0.00012157495,"teacher_disagreement_score":0.8227242,"about_ca_system_score_codex":0.0003657416,"about_ca_system_score_gemma":0.0003809026,"threshold_uncertainty_score":0.8585915},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007967508,0.0020060625,0.986774,0.00038479967,0.0021273037,0.00028786613,0.000018715948,0.00021048772,0.008111077],"genre_scores_gemma":[0.13609333,0.00036475115,0.85273707,0.007019451,0.0025960624,0.000027339322,0.000046995043,0.00013078791,0.0009842071],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605876,0.00003515596,0.00043592238,0.0015450589,0.0010241577,0.0009009286],"domain_scores_gemma":[0.99680525,0.00030889022,0.0002501272,0.0022574996,0.00014417493,0.00023406146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007897515,0.0005779849,0.00050246116,0.00076708716,0.00034945138,0.00043231243,0.004221224,0.00039324348,0.00021626824],"category_scores_gemma":[0.000026364318,0.00050727243,0.00019370948,0.00066783564,0.0009408823,0.0010623978,0.0028416314,0.00068999594,0.00029538205],"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.000010807664,0.000076201664,0.0004423386,0.000058291716,0.000020446532,0.000089309506,0.0013439009,0.00063913997,0.00023786571,0.22639656,0.00034598334,0.77033913],"study_design_scores_gemma":[0.00093633874,0.0002860739,0.0013042565,0.00065880653,0.000037323574,0.00038798054,1.9111538e-7,0.07754978,0.007606354,0.70147604,0.20640098,0.0033559168],"about_ca_topic_score_codex":0.00001930286,"about_ca_topic_score_gemma":0.00012983994,"teacher_disagreement_score":0.7669832,"about_ca_system_score_codex":0.00025489277,"about_ca_system_score_gemma":0.0002466418,"threshold_uncertainty_score":0.9997379},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08204827,0.00029859392,0.9123619,0.003400884,0.00019054234,0.000058991307,0.0000017315699,0.000018345914,0.0016207416],"genre_scores_gemma":[0.7746815,0.000010394968,0.2250887,0.00016312432,0.00005249507,2.7720026e-7,3.8605953e-7,0.0000025164702,5.752548e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998274,0.00011014491,0.0008928715,0.00013398583,0.00036824742,0.00022070728],"domain_scores_gemma":[0.99844116,0.00025023177,0.0006048671,0.0003550125,0.00020988948,0.0001388452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005662395,0.00011683134,0.00064233877,0.00021237924,0.00003852174,0.000039504874,0.0009575323,0.00012709406,0.000037958733],"category_scores_gemma":[0.0002811441,0.00009493074,0.00021973468,0.00031069998,0.00007946237,0.0003681274,0.00008231144,0.00039960555,0.000014329374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003724013,0.00078798324,0.00017391097,0.000042929736,0.000041048177,0.000016112155,0.0011765301,0.0000072573025,0.0009202861,0.9878827,0.0018275965,0.0070864563],"study_design_scores_gemma":[0.00050004345,0.0011178196,0.0011899025,0.00009767796,0.00003701439,0.00027177137,0.00036351357,0.0019700578,0.0024241214,0.9912785,0.0006269237,0.00012261204],"about_ca_topic_score_codex":5.3262573e-7,"about_ca_topic_score_gemma":9.682108e-7,"teacher_disagreement_score":0.6926333,"about_ca_system_score_codex":0.000016923223,"about_ca_system_score_gemma":0.000056855504,"threshold_uncertainty_score":0.3871163},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008130847,0.002560095,0.9934684,0.00025175716,0.0022190479,0.0007075033,0.000015759244,0.00017888022,0.0005172214],"genre_scores_gemma":[0.7239325,0.0010961222,0.26818106,0.005867684,0.00070940773,0.000068813555,0.000028631168,0.00008935105,0.000026430333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532074,0.0000740009,0.00069395744,0.002127271,0.00074148533,0.0010425389],"domain_scores_gemma":[0.9966352,0.00035948743,0.0003711429,0.002168991,0.00020215286,0.0002630558],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013352251,0.0007070408,0.00078172825,0.0011847805,0.00022367625,0.00092095084,0.0072948993,0.0006270649,0.000034416025],"category_scores_gemma":[0.000056828114,0.00065562164,0.00023367612,0.001101456,0.000565014,0.0015292437,0.0024185493,0.00149648,0.000012735871],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045101337,0.00011233237,0.000092570124,0.0000509739,0.0000318764,0.00034615208,0.00083907304,0.010419559,0.00011506649,0.22354952,0.000021246597,0.7643765],"study_design_scores_gemma":[0.0006290141,0.00016656403,0.00020349276,0.00021681043,0.000009297805,0.000030777996,6.8576284e-8,0.5441257,0.00021524212,0.4528553,0.00085112604,0.0006966545],"about_ca_topic_score_codex":0.00006260838,"about_ca_topic_score_gemma":0.00057599915,"teacher_disagreement_score":0.76367986,"about_ca_system_score_codex":0.00017212203,"about_ca_system_score_gemma":0.00036897295,"threshold_uncertainty_score":0.9995895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10990197,0.0001269563,0.88876534,0.00025475436,0.00019592785,0.00015887093,0.000006328095,0.0003428406,0.00024702062],"genre_scores_gemma":[0.55263966,0.000007387176,0.44699284,0.000237932,0.000079372374,0.000012654216,0.000019799887,0.000005616681,0.000004739632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989689,0.00001611357,0.00016258577,0.00036802437,0.00012667546,0.00035770686],"domain_scores_gemma":[0.9991542,0.00004757055,0.000048577087,0.0005611344,0.000062756546,0.00012575567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024429298,0.00010764884,0.00011100219,0.000044686043,0.00021332844,0.00019992828,0.0007384131,0.000054030632,0.0000118284615],"category_scores_gemma":[0.00001279359,0.0000978518,0.00006845524,0.00047840015,0.00003753113,0.0006143452,0.00012233155,0.00007766716,0.0000147773435],"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.0000146354105,0.0001549169,0.00031463584,0.0000147049595,0.000015790507,0.0000037603872,0.0005813674,0.00017761117,0.001200295,0.95312494,0.000584304,0.04381303],"study_design_scores_gemma":[0.0035624488,0.00082355546,0.004811064,0.00012904948,0.000028221988,0.000036741756,0.00020867787,0.4784547,0.00698891,0.47639883,0.027358327,0.0011994658],"about_ca_topic_score_codex":0.000017334836,"about_ca_topic_score_gemma":0.000040742318,"teacher_disagreement_score":0.4782771,"about_ca_system_score_codex":0.0000124971375,"about_ca_system_score_gemma":0.000041958636,"threshold_uncertainty_score":0.39902806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46493995,0.0012206658,0.52906984,0.00032038675,0.0008872677,0.0011185694,0.000086691136,0.00046109624,0.0018955413],"genre_scores_gemma":[0.93881375,0.00007068776,0.060234535,0.0005044179,0.000073795665,0.000058975213,0.000023327524,0.000011858926,0.00020864367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854934,0.00017844052,0.00030279646,0.0004501265,0.00022869308,0.00029060635],"domain_scores_gemma":[0.9989663,0.0001066248,0.00010760531,0.000578332,0.000108230895,0.0001329215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024684213,0.00020009124,0.00025788465,0.000102491154,0.00028233146,0.000228035,0.00049311726,0.00007701342,0.0000115406665],"category_scores_gemma":[0.00005448635,0.00016216081,0.000055988978,0.00026308864,0.00010731991,0.0011619596,0.00045063035,0.00019176293,0.000008767764],"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.000115046685,0.0007491032,0.014582095,0.00023898893,0.0001763567,0.00010420629,0.018828472,0.000022221084,0.002004466,0.94155604,0.016138189,0.005484794],"study_design_scores_gemma":[0.010566663,0.000996863,0.01091148,0.00031182167,0.00004818889,0.0008471922,0.003245803,0.8387997,0.018720616,0.0021160454,0.11074075,0.0026948636],"about_ca_topic_score_codex":0.0012640869,"about_ca_topic_score_gemma":0.00009669431,"teacher_disagreement_score":0.93944,"about_ca_system_score_codex":0.000037312384,"about_ca_system_score_gemma":0.000072152376,"threshold_uncertainty_score":0.6612726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058887403,0.00020838203,0.9217078,0.0007978696,0.0003268295,0.0001670969,0.000015900556,0.0006196425,0.017269053],"genre_scores_gemma":[0.94261664,0.000021779608,0.05606852,0.0011239699,0.00008149859,0.000009603931,0.000013272087,0.0000066104076,0.0000580867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866265,0.000035536028,0.00023783649,0.0004241001,0.0003428262,0.00029707217],"domain_scores_gemma":[0.9986581,0.000069986774,0.00005330914,0.0009982539,0.000072604,0.00014774845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002103445,0.00015193007,0.00017370189,0.00013251416,0.00020521785,0.00007956681,0.00097171596,0.00006977484,0.00014398652],"category_scores_gemma":[0.000014832348,0.00012555423,0.00012881492,0.00061579887,0.00006287884,0.0005531258,0.00021540484,0.0001276736,0.00019649693],"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.000019559322,0.00036684223,0.010664005,0.000041317362,0.000024935236,0.00019410068,0.00037763757,0.00011174364,0.0005632189,0.93812454,0.044703223,0.004808874],"study_design_scores_gemma":[0.0042216177,0.00068752514,0.026429974,0.00010625918,0.000023650477,0.00040826332,0.00011247207,0.6292597,0.02659017,0.024530299,0.28567597,0.0019540621],"about_ca_topic_score_codex":0.000036109337,"about_ca_topic_score_gemma":0.0000453721,"teacher_disagreement_score":0.91359425,"about_ca_system_score_codex":0.000013544468,"about_ca_system_score_gemma":0.00007534739,"threshold_uncertainty_score":0.51199526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17451227,0.00008694854,0.82359767,0.00020443715,0.00018534236,0.0011745767,0.00004592136,0.00013840859,0.000054409098],"genre_scores_gemma":[0.9287745,0.000030279223,0.07052636,0.00017529217,0.000038975857,0.00042423786,0.000012702526,0.00001102018,0.000006667107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986032,0.000048247704,0.00029624056,0.0005679749,0.00015547304,0.00032880984],"domain_scores_gemma":[0.9989496,0.00034127655,0.00007385891,0.0004459637,0.00006890676,0.00012040545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028370015,0.00018791953,0.00019082338,0.00021129716,0.00047169885,0.00023423882,0.00032032523,0.0000605933,0.00001009491],"category_scores_gemma":[0.0000018614536,0.00019635374,0.00006350152,0.00046200692,0.00007003032,0.00024754956,0.000012827372,0.00020203087,0.000007740529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012649097,0.003938341,0.0031940988,0.0018038374,0.0003279751,0.000020029383,0.0047402196,0.17313974,0.0012525745,0.14407961,0.0039273365,0.66344976],"study_design_scores_gemma":[0.0024119318,0.0003271151,0.0022029115,0.00014897615,0.0000439885,0.000010838697,0.00042506808,0.9700332,0.0033794187,0.015709402,0.0046912394,0.00061588595],"about_ca_topic_score_codex":0.00008503709,"about_ca_topic_score_gemma":0.000027376747,"teacher_disagreement_score":0.7968935,"about_ca_system_score_codex":0.0000379294,"about_ca_system_score_gemma":0.000019402842,"threshold_uncertainty_score":0.8007073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087790705,0.00008918122,0.91100055,0.00022902808,0.000092818846,0.00031527976,0.000046037283,0.00016660316,0.00026979475],"genre_scores_gemma":[0.6982994,0.00000166723,0.30142736,0.00010080178,0.00006453552,0.000043297998,0.000049221257,0.000003268745,0.000010435132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912834,0.000018393372,0.0001337032,0.0003526859,0.00018252034,0.00018434656],"domain_scores_gemma":[0.9989128,0.00003185234,0.000048180755,0.0008254805,0.000089825546,0.00009182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022844119,0.00008636559,0.000082108694,0.000056233574,0.00011569868,0.00019147586,0.00053452974,0.000023716646,0.0000058983874],"category_scores_gemma":[0.0000065992385,0.00006495487,0.00002370658,0.00023727483,0.000027519704,0.0006259161,0.000044381726,0.000041969117,0.00001745639],"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.000019883277,0.00028776092,0.00012719334,0.000033413613,0.0000069204348,6.068132e-7,0.00043782618,0.0035665748,0.002186237,0.9903312,0.000707839,0.0022945656],"study_design_scores_gemma":[0.00035453457,0.00007496903,0.0001848843,0.00001770657,0.0000036591184,0.0000055929313,0.000046763904,0.9845793,0.0014633402,0.00007706892,0.013064551,0.00012762373],"about_ca_topic_score_codex":0.00003059706,"about_ca_topic_score_gemma":0.000030270094,"teacher_disagreement_score":0.9902541,"about_ca_system_score_codex":0.000012315176,"about_ca_system_score_gemma":0.000025305384,"threshold_uncertainty_score":0.26487827},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029034316,0.0030582284,0.23305961,0.00029260144,0.0013043097,0.00059878145,0.00032056763,0.00036146492,0.7609754],"genre_scores_gemma":[0.25397173,0.34777552,0.23483954,0.045189805,0.011837895,0.0037141663,0.024836738,0.00087404903,0.07696054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723077,0.00007032901,0.0010114827,0.00045580923,0.0007095986,0.0005220122],"domain_scores_gemma":[0.9971101,0.0003032915,0.0007370114,0.001470812,0.00023042098,0.00014833441],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006079015,0.000437827,0.00045980237,0.00065043586,0.00016981024,0.0003220374,0.0024716016,0.00038729934,0.000037069254],"category_scores_gemma":[0.00023712244,0.0003947772,0.0001849591,0.00039474634,0.00012793244,0.020438109,0.0013612829,0.0006937122,0.00028927613],"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.000027729915,0.000053007945,0.00004525184,0.00069928734,0.000025531901,0.000012877731,0.007346228,0.00016146184,8.760581e-7,0.85056245,0.028891284,0.11217401],"study_design_scores_gemma":[0.00035152497,0.000023579578,0.000033423978,0.00035580358,0.0000028645322,0.000004047613,0.000023423878,0.0017218202,0.000018264873,0.33261982,0.6644656,0.0003798094],"about_ca_topic_score_codex":0.000009116163,"about_ca_topic_score_gemma":0.00006524287,"teacher_disagreement_score":0.68401486,"about_ca_system_score_codex":0.00022355633,"about_ca_system_score_gemma":0.0002939767,"threshold_uncertainty_score":0.9998504},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021231372,0.00022055588,0.24159405,0.039471697,0.0004246039,0.00021478276,0.00002187509,0.0004119627,0.6964091],"genre_scores_gemma":[0.98217475,0.000026042595,0.012363619,0.004764595,0.000058705125,0.0000045535517,0.0000011414958,0.0000036013535,0.00060297095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999394,0.000034944875,0.00008804572,0.0002032144,0.0001431887,0.00013661855],"domain_scores_gemma":[0.9990451,0.00013701522,0.000021078142,0.00074471993,0.000015439542,0.000036653233],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001440403,0.000062948704,0.00004220331,0.000017201224,0.0000865056,0.00011009487,0.00064922724,0.00002553108,0.0009889207],"category_scores_gemma":[0.000026613725,0.00003412324,0.000044143588,0.0002359793,0.000026105108,0.0001659452,0.000098878125,0.000083538005,0.0006162619],"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.0000036504587,0.000060418224,0.00003944863,4.8154095e-7,0.0000051365664,0.0000035839182,0.0007440299,0.0000039088686,0.000008607177,0.7707286,0.19808,0.030322138],"study_design_scores_gemma":[0.00080914027,0.000180581,0.005723394,0.000016439606,0.0000040847026,0.000012460594,0.00021394271,0.05557276,0.0013331365,0.06289905,0.87284786,0.00038716482],"about_ca_topic_score_codex":0.000024678868,"about_ca_topic_score_gemma":0.0000811978,"teacher_disagreement_score":0.9609434,"about_ca_system_score_codex":0.0000031980487,"about_ca_system_score_gemma":0.0000025599027,"threshold_uncertainty_score":0.9999243},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00848994,0.00020470077,0.92369777,0.002893185,0.00016775867,0.000087186585,0.000007310693,0.00041679665,0.06403538],"genre_scores_gemma":[0.75112754,0.00001908275,0.24679965,0.0017654994,0.00016030816,0.0000050651165,0.0000052839205,0.0000035236365,0.00011406285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992687,0.00001942537,0.00010462293,0.0002614477,0.00015569023,0.00019009357],"domain_scores_gemma":[0.99926645,0.000028656708,0.000021994903,0.0005731917,0.000024855839,0.00008487984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001284043,0.00007821248,0.000068215886,0.00005136766,0.00007261877,0.00011241544,0.0006778002,0.00004291472,0.00023971195],"category_scores_gemma":[0.000009387398,0.00006456782,0.00005735423,0.00028750495,0.000023621164,0.0007394265,0.0002030821,0.000091982314,0.00024242426],"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.0000013690455,0.000056058885,0.00042004208,0.0000029253688,0.000005153498,0.0000022312202,0.00035768485,0.000006385757,0.00008427721,0.913096,0.027891697,0.058076143],"study_design_scores_gemma":[0.0002754872,0.00004430923,0.0041909805,0.0000053789195,0.0000031370587,0.000017190952,0.000019659661,0.021376887,0.0036358985,0.02602067,0.9441554,0.00025503384],"about_ca_topic_score_codex":0.000016305099,"about_ca_topic_score_gemma":0.0000980333,"teacher_disagreement_score":0.91626364,"about_ca_system_score_codex":0.0000088304,"about_ca_system_score_gemma":0.000018616254,"threshold_uncertainty_score":0.3115954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001447999,0.000023225948,0.98779106,0.0013663571,0.00015421036,0.00046406203,0.000019194162,0.00021548223,0.008518411],"genre_scores_gemma":[0.23805171,0.000013338123,0.76135576,0.0003824895,0.0000354378,0.00009882199,0.000014763977,0.000003863479,0.000043816883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999248,0.000006757329,0.00011700194,0.00028965503,0.00012605867,0.00021250319],"domain_scores_gemma":[0.999386,0.00002003141,0.000022511385,0.0004583477,0.000039268158,0.000073845484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010173679,0.00008548268,0.00006740829,0.000082369144,0.00014562634,0.00011693329,0.00050804636,0.00003087779,0.000019476669],"category_scores_gemma":[0.0000063394978,0.000073366136,0.000077836936,0.0002827668,0.000027199174,0.0003742169,0.00017893726,0.000048533984,0.000052681306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022004485,0.00012151702,0.000027983737,0.00001959409,0.000012638511,0.000003308849,0.00036354232,0.000035240064,0.00003214842,0.9942713,0.00093219645,0.0041783806],"study_design_scores_gemma":[0.0025689446,0.00020537345,0.0026267865,0.000041401876,0.000026445186,0.000016079077,0.00029046013,0.011642492,0.0015842963,0.79095733,0.18955432,0.000486043],"about_ca_topic_score_codex":0.0000141092905,"about_ca_topic_score_gemma":0.000028799692,"teacher_disagreement_score":0.23660372,"about_ca_system_score_codex":0.00001664612,"about_ca_system_score_gemma":0.000014422549,"threshold_uncertainty_score":0.29917842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019579232,0.0000032745077,0.97579676,0.000042797445,0.00030304963,0.00008568463,0.000004178477,0.000121133184,0.004063868],"genre_scores_gemma":[0.8378179,0.00000501234,0.16131455,0.0008406281,0.000007790273,0.0000029964845,0.000009608305,0.0000010819217,4.027811e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909014,0.0000078859575,0.00018183792,0.00021738172,0.0003216201,0.0001811472],"domain_scores_gemma":[0.999275,0.000017713839,0.00007880537,0.00040238263,0.00011857061,0.00010749322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039021057,0.00008744916,0.00006595936,0.0003922493,0.0002669311,0.00047549716,0.0007958298,0.000026955306,0.000010581171],"category_scores_gemma":[0.000019167039,0.0000767516,0.000021468526,0.00096040685,0.0001237479,0.010843588,0.00029768946,0.00007455714,0.000026553846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001049604,0.000047939906,0.005198142,0.000030554664,0.0000024893757,8.7807837e-7,0.0064733746,0.00018662991,0.00011569109,0.91146547,0.00008882027,0.07637951],"study_design_scores_gemma":[0.00015847747,0.00007618102,0.049141675,0.000014687572,5.4949174e-7,0.0000026961122,0.000010610767,0.9470603,0.00023422163,0.0021027394,0.00109066,0.00010718847],"about_ca_topic_score_codex":0.000006124747,"about_ca_topic_score_gemma":4.6478456e-7,"teacher_disagreement_score":0.94687366,"about_ca_system_score_codex":0.000020061656,"about_ca_system_score_gemma":0.000055426215,"threshold_uncertainty_score":0.786134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.542629,0.000882213,0.45559028,0.00012249663,0.000573213,0.000045894878,0.0000013475951,0.00004046363,0.00011506718],"genre_scores_gemma":[0.9304308,0.000046690042,0.069289155,0.000021637283,0.0002039115,2.3250574e-7,6.3887757e-7,0.000005150108,0.0000017799283],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998856,0.00011562888,0.00025737908,0.00016661765,0.00042864637,0.00017571331],"domain_scores_gemma":[0.9991021,0.000028300605,0.00019961152,0.00031609146,0.00020357053,0.00015032475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013093537,0.000081378756,0.00013549178,0.00024387547,0.00011832332,0.00011784516,0.00044714418,0.000033297692,0.0000112462485],"category_scores_gemma":[0.00014882124,0.00007041166,0.000073789764,0.0005695125,0.00003632741,0.00081519975,0.00014135698,0.0002463328,0.0000061729884],"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.00036804218,0.0016216167,0.06325053,0.00031928282,0.0002805494,0.0010053709,0.052661672,0.0055591892,0.39340433,0.11492174,0.027168926,0.33943874],"study_design_scores_gemma":[0.012714064,0.0027419948,0.059555445,0.0021053976,0.0002482009,0.014215909,0.0055277725,0.16319422,0.39726943,0.30710393,0.032022364,0.0033012745],"about_ca_topic_score_codex":0.000021325892,"about_ca_topic_score_gemma":0.0000018170558,"teacher_disagreement_score":0.3878018,"about_ca_system_score_codex":0.000035587185,"about_ca_system_score_gemma":0.00015006746,"threshold_uncertainty_score":0.28713042},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000385217,0.0009114771,0.99257046,0.0005664549,0.0012402281,0.0005023618,0.000021920134,0.00038870302,0.0034131694],"genre_scores_gemma":[0.9142931,0.0002263614,0.08153857,0.002947111,0.0008014389,0.000011730406,0.000027460896,0.0000872265,0.00006698992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944269,0.00009915339,0.0007612716,0.0023737717,0.0013387271,0.0010001841],"domain_scores_gemma":[0.995782,0.00074654905,0.0004365084,0.0022240714,0.00035112575,0.00045974567],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015919735,0.0008319169,0.00091896066,0.0013284286,0.0005178566,0.0013050365,0.003779342,0.0004912694,0.000052889016],"category_scores_gemma":[0.00014071711,0.00080121943,0.00020570993,0.0008540499,0.0014761484,0.00077979814,0.0011101449,0.00123697,0.00008464386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007864104,0.00008146986,0.00049718656,0.00019239291,0.00004397971,0.00016705252,0.001742781,0.0015725839,0.0005188463,0.49895257,0.00016078123,0.4960625],"study_design_scores_gemma":[0.00096698717,0.0004863787,0.0037087074,0.0008983632,0.000038427355,0.0005601907,3.8421763e-7,0.1557481,0.00046138233,0.82667536,0.008546595,0.0019091357],"about_ca_topic_score_codex":0.000049562583,"about_ca_topic_score_gemma":0.00010611469,"teacher_disagreement_score":0.9139079,"about_ca_system_score_codex":0.00017100215,"about_ca_system_score_gemma":0.00045073617,"threshold_uncertainty_score":0.9997317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031737186,0.0005729442,0.9903979,0.00019815048,0.002474411,0.00038269584,0.000020411058,0.0002443801,0.0053917626],"genre_scores_gemma":[0.49658698,0.000058598707,0.50116247,0.0013145418,0.0007194744,0.000017986968,0.000036556048,0.00004841117,0.000054959903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957532,0.000046596906,0.00054718397,0.0018251891,0.0010910319,0.00073678093],"domain_scores_gemma":[0.9969295,0.00021449623,0.00034635348,0.0020314339,0.00024036439,0.00023784637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097029976,0.0005686662,0.00047268107,0.0010049916,0.00033974135,0.00050333055,0.0036798827,0.00031077056,0.00008163166],"category_scores_gemma":[0.00004712309,0.0005234679,0.00021580768,0.00085240876,0.0006294578,0.0004741137,0.0017195585,0.0008603076,0.000114507355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012841754,0.00012296056,0.00007789587,0.000048778704,0.000020058607,0.000102340535,0.0028783216,0.018751163,0.0001650802,0.5750846,0.00008251361,0.40265346],"study_design_scores_gemma":[0.00048826545,0.00016603687,0.00027322996,0.00028516105,0.000016288413,0.00007434645,1.8526933e-7,0.44757703,0.0015459687,0.5445023,0.004003063,0.0010680929],"about_ca_topic_score_codex":0.00004479421,"about_ca_topic_score_gemma":0.00010671665,"teacher_disagreement_score":0.4962696,"about_ca_system_score_codex":0.00015621008,"about_ca_system_score_gemma":0.00034063854,"threshold_uncertainty_score":0.9997217},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031760294,0.00028426523,0.96428776,0.0008338817,0.00016396087,0.000088888875,0.0000049302657,0.0002253506,0.0023506717],"genre_scores_gemma":[0.9936337,0.0000059280837,0.005588966,0.000743381,0.000016205782,0.0000018511791,0.000005434546,0.0000011237707,0.0000033978954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993992,0.0000258085,0.00010064468,0.00021042004,0.000117864125,0.0001460561],"domain_scores_gemma":[0.9994897,0.000054285603,0.00002902261,0.00032186008,0.00002808595,0.00007701873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016780014,0.00006727968,0.00009147012,0.000068437796,0.000092710616,0.0005603565,0.00052315503,0.000029627778,0.000004004311],"category_scores_gemma":[0.000008998719,0.00005656193,0.000021740725,0.0002954938,0.00001774858,0.0006479889,0.00009568622,0.000056386685,0.0000040584614],"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.0000030759363,0.000061064544,0.0077395677,0.000011717995,0.0000037840612,0.000009600876,0.00006598074,0.000033205913,0.000087827364,0.98203635,0.0029645236,0.0069832886],"study_design_scores_gemma":[0.0035888415,0.00081725453,0.3657886,0.00016348454,0.000021673508,0.00006750448,0.0001108561,0.5407813,0.0043260576,0.048633497,0.034405522,0.0012953633],"about_ca_topic_score_codex":0.00005632227,"about_ca_topic_score_gemma":0.000004371036,"teacher_disagreement_score":0.9618734,"about_ca_system_score_codex":0.0000042874526,"about_ca_system_score_gemma":0.0000160157,"threshold_uncertainty_score":0.54035306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0908934,0.00021607259,0.8958742,0.0004001485,0.00059620704,0.000053714793,0.0000010781591,0.000064773536,0.011900395],"genre_scores_gemma":[0.9801972,0.000015754715,0.019677812,0.00006437468,0.000027466029,0.0000014862508,3.6224966e-7,9.55505e-7,0.000014621807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996229,0.00001800752,0.00007337016,0.00005594553,0.0000926083,0.00013718348],"domain_scores_gemma":[0.9995095,0.00005451605,0.000024678695,0.00036135124,0.000015125802,0.000034806566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028974202,0.000030417084,0.000036324855,0.00001512678,0.00008714643,0.00003599351,0.0004971365,0.000011455009,0.0000069989433],"category_scores_gemma":[0.000014734485,0.000017481212,0.000028911369,0.00016716393,0.00003224485,0.0004028372,0.0002005421,0.00003183526,0.000010174258],"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":[5.329408e-7,0.000013968115,0.0064170584,0.0000018124166,0.0000028976765,5.846281e-8,0.00032603872,6.180612e-8,0.00018615156,0.9836395,0.00056197547,0.008849968],"study_design_scores_gemma":[0.0003376498,0.000049966737,0.1808632,0.000018252893,0.000009094736,0.000010367887,0.0001696865,0.002172931,0.058711242,0.22993577,0.527408,0.00031381304],"about_ca_topic_score_codex":0.000008887708,"about_ca_topic_score_gemma":0.000002366922,"teacher_disagreement_score":0.88930374,"about_ca_system_score_codex":0.0000015851177,"about_ca_system_score_gemma":0.000004470778,"threshold_uncertainty_score":0.092381164},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069500855,0.000017779486,0.9824843,0.0011658074,0.00007666407,0.00010958715,0.0000022286292,0.0001263296,0.015322299],"genre_scores_gemma":[0.54458,0.000010855287,0.45409045,0.0012337929,0.000027665588,0.000020480447,0.0000037444895,0.0000033692643,0.00002965996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939626,0.000018618595,0.000079582846,0.00018552868,0.000068354864,0.0002516797],"domain_scores_gemma":[0.9994193,0.00009445633,0.0000214888,0.0003782276,0.000030437031,0.00005611781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019188956,0.00005534905,0.000059415,0.000031657113,0.00006547343,0.000037231854,0.00037974515,0.000030322512,0.000078074685],"category_scores_gemma":[0.000027322167,0.00004607877,0.000052752348,0.00014011508,0.000023210729,0.00045569421,0.00010509943,0.00008122567,0.00003779528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073233705,0.000078952195,0.00015309016,0.0000021382916,0.000005671139,6.542155e-7,0.00014013867,1.1218659e-8,0.000019547995,0.9835947,0.012610681,0.0033870668],"study_design_scores_gemma":[0.0006775881,0.00064537226,0.006103179,0.0000036005429,0.000014361425,0.00004563292,0.00006320375,0.012129585,0.0040466664,0.5719008,0.40401787,0.00035219075],"about_ca_topic_score_codex":0.000034433247,"about_ca_topic_score_gemma":0.000044499124,"teacher_disagreement_score":0.543885,"about_ca_system_score_codex":0.0000067592127,"about_ca_system_score_gemma":0.000046242098,"threshold_uncertainty_score":0.18790378},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45572683,0.0061460636,0.532769,0.002117333,0.00019407569,0.0006911284,0.0001719238,0.00028187627,0.001901754],"genre_scores_gemma":[0.6419705,0.001130575,0.35646176,0.00018876139,0.000036015183,0.000075000935,0.00012252887,0.0000116896545,0.0000031397808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998792,0.00006560382,0.00024324308,0.00046952124,0.00013520545,0.00029442413],"domain_scores_gemma":[0.9976784,0.00019392304,0.00008992492,0.0017471326,0.00007783729,0.0002127699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032582792,0.00020667516,0.00020751657,0.00022995174,0.001228466,0.0003749931,0.0015351367,0.0001749795,0.00002060033],"category_scores_gemma":[0.000016413858,0.00020036226,0.00013055159,0.00046158384,0.00035747094,0.0007843301,0.000564111,0.00050748576,4.4929538e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016599737,0.00009780324,0.0042735767,0.000056209505,0.00005476264,4.0571874e-7,0.0017629194,0.0000013515595,0.004097596,0.9718457,0.00022018906,0.0175729],"study_design_scores_gemma":[0.0014341536,0.0001826664,0.031240696,0.000058607227,0.00011622726,0.00004027836,0.00040822857,0.03145043,0.0009693001,0.8382089,0.09518395,0.00070652115],"about_ca_topic_score_codex":0.000073392635,"about_ca_topic_score_gemma":0.0002750125,"teacher_disagreement_score":0.18624367,"about_ca_system_score_codex":0.0000036265008,"about_ca_system_score_gemma":0.00004000117,"threshold_uncertainty_score":0.9448492},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28807214,0.003380074,0.67052746,0.0002411675,0.001276523,0.0007062066,0.033975277,0.0006140039,0.0012071383],"genre_scores_gemma":[0.93374604,0.00005573272,0.025490338,0.00068560016,0.0004088209,0.000033792567,0.039551653,0.00002040818,0.000007631003],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690664,0.00024920935,0.00036708757,0.0010317444,0.000942048,0.0005032686],"domain_scores_gemma":[0.99576503,0.00028515817,0.000146734,0.0035628818,0.00013620885,0.000103960716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014005326,0.00025620265,0.0002166503,0.0002458821,0.0002989895,0.00027048914,0.0019019037,0.000064829335,0.00042084337],"category_scores_gemma":[0.0002833086,0.00023819479,0.00007619454,0.00093597086,0.00006596804,0.0016135076,0.0017662675,0.0001776709,0.00010646036],"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.00005595697,0.002129859,0.0106027005,0.00009589524,0.00006763306,0.0001101634,0.00013254289,0.00091151975,0.0011887609,0.39507073,0.583452,0.0061822324],"study_design_scores_gemma":[0.0013017108,0.000046761674,0.02591831,0.000084650936,0.00008959457,0.000022468093,0.000045811586,0.62031704,0.0009976777,0.0020714304,0.34848326,0.0006212654],"about_ca_topic_score_codex":0.00079356617,"about_ca_topic_score_gemma":0.0007172869,"teacher_disagreement_score":0.6456739,"about_ca_system_score_codex":0.000039897557,"about_ca_system_score_gemma":0.00018611962,"threshold_uncertainty_score":0.97133017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057421687,0.0010664017,0.99357474,0.00064775464,0.0016384353,0.0003449645,0.000032965156,0.0002521842,0.0023851586],"genre_scores_gemma":[0.46788105,0.000036657584,0.526299,0.0048046787,0.00073086395,0.000016714845,0.00004389461,0.000070934526,0.00011620015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487597,0.00006441087,0.00059989904,0.0021035,0.0014262054,0.0009300237],"domain_scores_gemma":[0.9957148,0.00076747953,0.00034939687,0.0025960414,0.00027791935,0.00029437355],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011881109,0.0007214213,0.00068301463,0.0011914192,0.0005377856,0.0012481359,0.005527488,0.000521493,0.00005166982],"category_scores_gemma":[0.00010940722,0.0006506508,0.00028456305,0.0010092922,0.001285465,0.00047367776,0.0012212062,0.0011340843,0.00006603917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033464035,0.00007016922,0.000026203374,0.00012415889,0.00002262591,0.0001463628,0.000305418,0.031600807,0.0013636707,0.8151607,0.0003009181,0.15084551],"study_design_scores_gemma":[0.00037528225,0.0002780222,0.00006462272,0.00035191924,0.0000128512065,0.000013986364,7.520706e-8,0.4725991,0.0028712726,0.5013871,0.021072555,0.00097318646],"about_ca_topic_score_codex":0.00005915753,"about_ca_topic_score_gemma":0.00020531887,"teacher_disagreement_score":0.46782362,"about_ca_system_score_codex":0.00018913252,"about_ca_system_score_gemma":0.0008021455,"threshold_uncertainty_score":0.9998531},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5123001,0.00016494558,0.48444605,0.00037820614,0.0008349005,0.00026279982,0.000102699196,0.00004181944,0.0014685132],"genre_scores_gemma":[0.9391471,0.00019363771,0.059802365,0.0004364355,0.00034252714,0.0000041300136,0.000017119813,0.000009316629,0.00004735452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987422,0.000111657326,0.0004705244,0.00023189897,0.00026416895,0.0001795274],"domain_scores_gemma":[0.9986333,0.00016287155,0.00044033452,0.00042816423,0.00019496695,0.00014036268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009274943,0.00013152685,0.00025132947,0.0001386384,0.00016114519,0.00012953687,0.00055657496,0.00004899536,0.000052446867],"category_scores_gemma":[0.0001671522,0.000112197384,0.00017057805,0.00011428169,0.00008052305,0.001065435,0.00015236053,0.00014034429,0.0000058050755],"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.004777346,0.0022693183,0.004465257,0.0004243393,0.0010585878,0.00011550897,0.029727966,0.000007984994,0.014501715,0.6558852,0.18496019,0.10180658],"study_design_scores_gemma":[0.026839064,0.00927166,0.37172598,0.0012336235,0.0015584237,0.0010741968,0.0026293413,0.022170072,0.0892274,0.10094878,0.36914742,0.0041740444],"about_ca_topic_score_codex":0.00017360061,"about_ca_topic_score_gemma":0.000007953756,"teacher_disagreement_score":0.5549364,"about_ca_system_score_codex":0.000017752749,"about_ca_system_score_gemma":0.000079535734,"threshold_uncertainty_score":0.45752767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6312044,0.00028779652,0.3666875,0.000646489,0.00007306836,0.00014432876,0.000008042668,0.000052440428,0.0008958982],"genre_scores_gemma":[0.9268727,0.000009195421,0.07292708,0.00016821033,0.000013105698,0.0000012999421,0.0000038192857,0.0000022756985,0.0000023527703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910545,0.000026815376,0.00015770004,0.00032018623,0.0001964326,0.0001933863],"domain_scores_gemma":[0.99945134,0.000036957124,0.000035633482,0.00036837385,0.000028983426,0.000078688136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015357835,0.000095664574,0.00010171083,0.0001632526,0.00010664172,0.00013016949,0.00027034667,0.000040903742,0.000020046755],"category_scores_gemma":[0.000017009785,0.00008365419,0.000029978453,0.0006360564,0.000050879604,0.0002000131,0.00016941947,0.000124236,0.0000047708436],"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.000011178558,0.00054135895,0.009514206,0.00002529297,0.000024317424,0.000046085366,0.004037735,0.046406146,0.0093070585,0.92765915,0.000270423,0.002157061],"study_design_scores_gemma":[0.0059540546,0.00030648118,0.30876002,0.00028474853,0.000033368844,0.000112533824,0.0017324961,0.57803136,0.018487865,0.08159637,0.003324462,0.0013762488],"about_ca_topic_score_codex":0.0004257452,"about_ca_topic_score_gemma":0.00016955576,"teacher_disagreement_score":0.8460628,"about_ca_system_score_codex":0.000034114284,"about_ca_system_score_gemma":0.00004042055,"threshold_uncertainty_score":0.3411319},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18935458,0.00012835138,0.80805737,0.0011894854,0.00063045457,0.00003731683,0.00003276798,0.000022317114,0.0005473551],"genre_scores_gemma":[0.98372936,0.000021852853,0.015117431,0.00095621176,0.0001555962,4.7630743e-7,0.000013575833,0.000004607403,8.669572e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986719,0.00007170985,0.00047219638,0.00015915318,0.00034120367,0.00028386456],"domain_scores_gemma":[0.99880004,0.00041709092,0.00014452105,0.00024628895,0.00022687948,0.00016516536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070046796,0.000121658144,0.00024712764,0.0003091064,0.00008172359,0.000044208122,0.0007069391,0.00012719192,0.00009744496],"category_scores_gemma":[0.00008675046,0.00009934636,0.00018809961,0.00041241114,0.00008820678,0.00037751606,0.000037322934,0.00040791786,0.000017060132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011828117,0.00020606587,0.000586548,0.0000053201275,0.000047319674,0.0004304017,0.00020587548,0.000036718255,0.00042532475,0.9887594,0.0069757663,0.0022030035],"study_design_scores_gemma":[0.0024049233,0.0017839167,0.060769826,0.000050428538,0.000038006183,0.002696717,0.00006534407,0.00015481145,0.0027266196,0.882361,0.04660703,0.00034139564],"about_ca_topic_score_codex":0.0000017936892,"about_ca_topic_score_gemma":0.000024253308,"teacher_disagreement_score":0.7943748,"about_ca_system_score_codex":0.00003210514,"about_ca_system_score_gemma":0.00009373139,"threshold_uncertainty_score":0.4051227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90933955,0.00013374536,0.07937439,0.00004882711,0.00012845558,0.0013998296,0.00009824116,0.00033160584,0.009145382],"genre_scores_gemma":[0.9376107,0.000051480143,0.058808595,0.00028590235,0.00011698794,0.0029667518,0.0000615421,0.000095514115,0.000002539358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966261,0.00006061515,0.00087983947,0.000732115,0.0009977816,0.00070356537],"domain_scores_gemma":[0.99618334,0.00061532174,0.0008526545,0.0020558801,0.000075620075,0.00021716411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010890167,0.00046065397,0.00038312125,0.00031875388,0.0005168143,0.00037726745,0.0018748913,0.0003297248,0.000021932286],"category_scores_gemma":[0.00021001726,0.00041257107,0.00054368854,0.0014566277,0.00033280757,0.00047681908,0.00095075107,0.00056601636,0.00024102777],"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.00009055808,0.00033766736,0.00003130514,0.00047761766,0.00017255283,0.000018529228,0.0028951252,0.000024771154,0.00083634845,0.99302065,0.00011835188,0.0019765357],"study_design_scores_gemma":[0.0010477363,0.0006119347,0.0003350529,0.000768257,0.00025662893,0.0000670826,0.0010562734,0.82242876,0.019357432,0.15151247,0.0016980413,0.00086029735],"about_ca_topic_score_codex":0.000053431235,"about_ca_topic_score_gemma":0.00001441107,"teacher_disagreement_score":0.84150815,"about_ca_system_score_codex":0.000009329219,"about_ca_system_score_gemma":0.000103734455,"threshold_uncertainty_score":0.99983263},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016136741,0.000120385725,0.99314636,0.00013645286,0.0015249703,0.0004923139,0.00005623357,0.00008976272,0.0028198236],"genre_scores_gemma":[0.58919275,0.00021407865,0.40852174,0.0013621111,0.0004765438,0.000016643633,0.0000923297,0.000049539016,0.00007425381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963381,0.00003120819,0.00070490735,0.0012930208,0.0010845568,0.00054819416],"domain_scores_gemma":[0.99705976,0.00029068295,0.0006326853,0.0015117006,0.00034972714,0.00015546902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086336,0.00049907085,0.0006057159,0.0011306425,0.00016787284,0.0002764223,0.0029697097,0.00030124382,0.000029158082],"category_scores_gemma":[0.000038756072,0.00047700258,0.00017953663,0.00080144586,0.0006041915,0.0013162617,0.0013722478,0.00076414156,0.000017714101],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006378693,0.00023335201,0.0002917174,0.00013418014,0.00006025411,0.000116202194,0.003134736,0.00040092279,0.012176981,0.077633,0.000012112324,0.90574276],"study_design_scores_gemma":[0.0033988792,0.0017620132,0.005984933,0.0041363994,0.00008939347,0.00024276375,0.0000037960497,0.41957182,0.25877428,0.2794417,0.021845715,0.004748289],"about_ca_topic_score_codex":0.00002496313,"about_ca_topic_score_gemma":0.00011248391,"teacher_disagreement_score":0.9009945,"about_ca_system_score_codex":0.00020759382,"about_ca_system_score_gemma":0.00032203423,"threshold_uncertainty_score":0.99976814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5145887,0.0038932487,0.4789866,0.0005404616,0.0016566425,0.00021373914,0.000024645718,0.000017680586,0.00007828688],"genre_scores_gemma":[0.995472,0.0012401692,0.002182034,0.0006962808,0.0003986638,0.0000018771232,0.000003391476,0.0000054753727,6.962409e-8],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851924,0.00010559957,0.0005658088,0.00024689396,0.00028482528,0.0002776173],"domain_scores_gemma":[0.9985575,0.00035343785,0.00048102147,0.00011924986,0.0003195314,0.00016923307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082499377,0.00014228962,0.00026914952,0.00031075763,0.0001071218,0.00026666684,0.0007456316,0.00009957605,0.000005391262],"category_scores_gemma":[0.000078911464,0.00013232796,0.00008874847,0.00023437818,0.00007006464,0.0010724837,0.0002875051,0.00040502285,1.318819e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034144018,0.0023518836,0.21454455,0.00023942311,0.0007815828,0.0006449037,0.089014925,0.0019356386,0.000026399888,0.3538118,0.0020362844,0.33119822],"study_design_scores_gemma":[0.011152941,0.0011360273,0.027837392,0.000772664,0.00006403046,0.00085542357,0.0013629289,0.68109655,0.00017905704,0.26884705,0.0059073004,0.00078861957],"about_ca_topic_score_codex":0.00009342564,"about_ca_topic_score_gemma":0.00008237613,"teacher_disagreement_score":0.67916095,"about_ca_system_score_codex":0.000034400513,"about_ca_system_score_gemma":0.00005048877,"threshold_uncertainty_score":0.5396178},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52552044,0.000034339802,0.47346088,0.000017861092,0.00009309779,0.000060453305,0.000008473187,0.000091333684,0.0007131304],"genre_scores_gemma":[0.92717826,0.000015038016,0.072598845,0.00013986873,0.00003558059,0.0000027524377,0.000021513373,0.0000047374065,0.0000034130403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871147,0.000032045245,0.0002226524,0.00045988767,0.00029011082,0.00028380912],"domain_scores_gemma":[0.99917084,0.00003038208,0.000050576295,0.00063924864,0.000025518344,0.00008346228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027034394,0.00012377612,0.00013713192,0.00024381789,0.00014657348,0.000070869,0.0005792579,0.00003483272,0.000063514075],"category_scores_gemma":[0.000033119195,0.00011585029,0.00005980273,0.00074529153,0.000045829904,0.0005739864,0.00059734535,0.00012798072,0.000011434709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046053607,0.00070633675,0.18695784,0.00006682434,0.000026747199,0.0002874423,0.0063236738,0.0146563845,0.0112221325,0.7732841,0.0005537187,0.005868769],"study_design_scores_gemma":[0.0005538433,0.00002626617,0.07632232,0.000042880434,0.0000033570718,0.00005885837,0.000089709254,0.91842854,0.0022605108,0.0010051191,0.0008990621,0.00030952645],"about_ca_topic_score_codex":0.0014376942,"about_ca_topic_score_gemma":0.00013337527,"teacher_disagreement_score":0.9037722,"about_ca_system_score_codex":0.000044881217,"about_ca_system_score_gemma":0.000046268342,"threshold_uncertainty_score":0.4724238},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04165739,0.000097395015,0.9501777,0.0002454145,0.00016864795,0.00015334725,0.000002900898,0.0003062633,0.0071909223],"genre_scores_gemma":[0.71311176,0.000039286286,0.2862194,0.00020753748,0.00009109346,0.00001984329,0.000009854467,0.0000065510108,0.00029468202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909216,0.000034727018,0.00015346955,0.00030053788,0.00016586043,0.00025326313],"domain_scores_gemma":[0.99913615,0.00013683394,0.00004927423,0.0005379008,0.0000624618,0.000077404926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021543866,0.000086959284,0.00011206509,0.00008355094,0.00037427462,0.000114158145,0.0011408961,0.00004134936,0.00011840222],"category_scores_gemma":[0.00016107282,0.00008017213,0.00009858618,0.00026890132,0.000029508883,0.00068348524,0.0006295801,0.00008184704,0.000023914718],"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.00004063549,0.0003317171,0.012998328,0.000093815026,0.00008293265,0.00006982794,0.0052396306,0.00019845317,0.008302012,0.7735427,0.17976084,0.01933909],"study_design_scores_gemma":[0.0022372943,0.00051888864,0.013567795,0.000038786005,0.000020914387,0.00024899637,0.00017714474,0.09443876,0.0458077,0.10449694,0.73727334,0.001173441],"about_ca_topic_score_codex":0.000050194238,"about_ca_topic_score_gemma":0.000008918202,"teacher_disagreement_score":0.67145437,"about_ca_system_score_codex":0.0000061566216,"about_ca_system_score_gemma":0.000029941752,"threshold_uncertainty_score":0.32693246},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75779426,0.0013099024,0.23793806,0.0007172015,0.0017698802,0.0000694715,0.000004188782,0.00003477392,0.00036229283],"genre_scores_gemma":[0.98970276,0.00018247288,0.008499419,0.00013297438,0.0014706677,0.0000010784049,0.0000043943987,0.000005266236,9.449204e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852186,0.00009067725,0.00056497694,0.00018925026,0.00037098004,0.0002622731],"domain_scores_gemma":[0.99915665,0.00015869676,0.00032143272,0.00014165846,0.00014872492,0.00007283361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007991892,0.00012184493,0.00019362039,0.00015161789,0.000056278455,0.000266406,0.00082665053,0.0000678096,0.000009861302],"category_scores_gemma":[0.000028996737,0.0001181149,0.000097049786,0.0002734798,0.000044240518,0.0007768532,0.00025616397,0.00034986125,8.1736914e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029876883,0.00066942227,0.12616405,0.000017779897,0.00026796552,0.001755605,0.0024237253,0.2365212,0.00010381288,0.51151,0.008688422,0.11157927],"study_design_scores_gemma":[0.002005752,0.00015164573,0.13899046,0.00033890328,0.00001883832,0.00086417334,0.000058807134,0.7518064,0.000049366427,0.09775009,0.007507472,0.00045809388],"about_ca_topic_score_codex":0.000055829227,"about_ca_topic_score_gemma":0.00047559346,"teacher_disagreement_score":0.5152852,"about_ca_system_score_codex":0.000042094405,"about_ca_system_score_gemma":0.000034072447,"threshold_uncertainty_score":0.48165858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06485499,0.000004794607,0.92144,0.00074307673,0.00012078581,0.00012279929,0.000001400968,0.00023901224,0.012473158],"genre_scores_gemma":[0.9075644,0.000004004615,0.09101791,0.0013500266,0.000022769455,0.0000041338785,0.000013145143,0.0000013800532,0.000022238197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952716,0.000011461652,0.00012040303,0.00008000422,0.0001388182,0.00012215255],"domain_scores_gemma":[0.99949694,0.000017583025,0.000033359327,0.0003472716,0.00004720412,0.0000576663],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009239908,0.00004900906,0.000044831224,0.0000677046,0.000052757798,0.00029191637,0.0004227349,0.000028513246,0.00017139992],"category_scores_gemma":[0.000025071275,0.000038950056,0.000029145564,0.00029773114,0.000014125973,0.0032823419,0.00016850812,0.000052987732,0.0011349056],"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.0000020288762,0.000014250674,0.0006974055,0.000005402033,0.0000046166538,2.2384236e-7,0.00066496624,0.000002973656,0.00032117695,0.9667056,0.010564017,0.02101732],"study_design_scores_gemma":[0.001353898,0.00021033062,0.15505296,0.000016148306,0.0000063004745,0.000020750977,0.0001974465,0.1332881,0.016595723,0.2380675,0.45436642,0.00082443474],"about_ca_topic_score_codex":0.000039695704,"about_ca_topic_score_gemma":7.376268e-7,"teacher_disagreement_score":0.8427094,"about_ca_system_score_codex":0.000004953003,"about_ca_system_score_gemma":0.0000075830085,"threshold_uncertainty_score":0.99964285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026781408,0.000029679826,0.9639161,0.00016733799,0.00015881612,0.000097426724,0.00003399872,0.00012958545,0.008685648],"genre_scores_gemma":[0.9936019,0.000005024962,0.0058639892,0.0004922237,0.000013885107,0.000008259244,0.000010677987,0.0000017882393,0.0000022600977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99929446,0.00003587119,0.00014114067,0.00023051786,0.000098448836,0.00019955286],"domain_scores_gemma":[0.99937326,0.000036563528,0.000028941748,0.00046946932,0.000024708545,0.00006707712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017434428,0.00007327647,0.00009956174,0.00006954026,0.00003298594,0.00011142716,0.0012736375,0.000038722366,0.0001557801],"category_scores_gemma":[0.000016022643,0.000061034705,0.000038941493,0.0005180894,0.000028170743,0.0009061551,0.00026668923,0.00008462715,0.000027337679],"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.000021993272,0.00022586182,0.09747895,0.0000053888148,0.00001000772,0.000032222328,0.00055136526,0.0000018180829,0.000043488377,0.8924747,0.003937135,0.0052170595],"study_design_scores_gemma":[0.002267585,0.00009976362,0.7930988,0.000014198604,0.0000049697032,0.00001077441,0.00005630527,0.021902502,0.0017569369,0.16974604,0.010593041,0.00044907484],"about_ca_topic_score_codex":0.0004648335,"about_ca_topic_score_gemma":0.0002614363,"teacher_disagreement_score":0.9668205,"about_ca_system_score_codex":0.00000769354,"about_ca_system_score_gemma":0.000018428744,"threshold_uncertainty_score":0.2488923},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028106526,0.000024979387,0.969319,0.00029670217,0.0002468318,0.0004269234,0.000074878524,0.00028914688,0.0012150289],"genre_scores_gemma":[0.8530883,0.00000564248,0.14646435,0.00014935054,0.000047956815,0.000023616058,0.000019312769,0.000007960063,0.00019352023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987939,0.000011899349,0.00021296088,0.00037323762,0.00023259134,0.00037543676],"domain_scores_gemma":[0.99868387,0.0002903171,0.00005440855,0.0007596267,0.00006891856,0.00014286314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034059252,0.00012515922,0.00012565144,0.00012993185,0.00022408323,0.0009877704,0.0009854486,0.000062225816,0.00006929026],"category_scores_gemma":[0.00007078088,0.00010910782,0.00017312489,0.00034735166,0.000038020742,0.004086594,0.00015668066,0.00008332943,0.0000111105555],"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.0003949254,0.0030783468,0.03376473,0.00035226715,0.0004986135,0.00007775574,0.010481839,0.00008528066,0.0065523954,0.6798008,0.056673102,0.20823991],"study_design_scores_gemma":[0.0040109637,0.0005935481,0.038574796,0.00012042855,0.000099752404,0.00013063713,0.000835394,0.06228563,0.104825184,0.1432965,0.6430372,0.0021899515],"about_ca_topic_score_codex":0.000054449636,"about_ca_topic_score_gemma":0.000115073075,"teacher_disagreement_score":0.82498175,"about_ca_system_score_codex":0.000012607862,"about_ca_system_score_gemma":0.000028769273,"threshold_uncertainty_score":0.9525093},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47993118,0.008356111,0.51011306,0.00048257606,0.00018082697,0.00030786198,0.000006526457,0.00010104984,0.00052083144],"genre_scores_gemma":[0.99241704,0.0017041371,0.0056780465,0.00012211656,0.000044258104,0.00000515763,0.000025059848,0.0000037088078,4.4869577e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849355,0.0003364184,0.00037624576,0.0003312268,0.00018943792,0.00027311407],"domain_scores_gemma":[0.9983854,0.0001729471,0.000091645816,0.0011865298,0.00006541576,0.00009806115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010611542,0.00014572102,0.00023145544,0.00028682468,0.00031990052,0.00041176568,0.0010987922,0.00016125651,0.0000028240677],"category_scores_gemma":[0.000025781916,0.00015750033,0.000059925093,0.001730041,0.000089981644,0.0008383419,0.00028916902,0.0003920329,5.615412e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001235675,0.001801719,0.031036632,0.00017858692,0.00007280769,0.000017981669,0.0150508955,0.00640451,0.00049063057,0.7897065,0.0005339396,0.15458217],"study_design_scores_gemma":[0.00059813954,0.000083237595,0.029905967,0.00013458569,0.000013536637,0.00001884811,0.00021933767,0.9493837,0.000015777436,0.01844264,0.00084008905,0.00034414782],"about_ca_topic_score_codex":0.0003030119,"about_ca_topic_score_gemma":0.0001440087,"teacher_disagreement_score":0.94297916,"about_ca_system_score_codex":0.000039036153,"about_ca_system_score_gemma":0.000025966241,"threshold_uncertainty_score":0.6422677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44073868,0.0011181367,0.55292934,0.0021688605,0.0002490708,0.00047627685,0.000015983074,0.0003774796,0.0019261715],"genre_scores_gemma":[0.9827481,0.00027151188,0.016180346,0.00062011677,0.00005326392,0.00002873154,0.00008933427,0.000008092623,4.938854e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848855,0.0004146073,0.00021237483,0.00041477897,0.00020385956,0.00026586198],"domain_scores_gemma":[0.997631,0.0003154605,0.00012564244,0.0016240585,0.00010607648,0.00019775155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569891,0.00017435398,0.00014749402,0.0001338962,0.00070199074,0.0005651821,0.0009423535,0.00019671454,0.000016411434],"category_scores_gemma":[0.00005826756,0.00016818056,0.00004139127,0.0004015625,0.00025906527,0.0006055023,0.000327606,0.00082506996,0.0000018835281],"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.00002372184,0.00022713706,0.00058632565,0.000012828148,0.0000062268887,5.484952e-7,0.0015025226,0.00016133214,0.0001235069,0.9861546,0.00005756754,0.01114368],"study_design_scores_gemma":[0.00041765173,0.00010436203,0.0023447566,0.000036185615,0.0000062845074,0.0000067395886,0.00015667544,0.94782037,0.000042955642,0.04558684,0.0032476257,0.00022958717],"about_ca_topic_score_codex":0.000014515726,"about_ca_topic_score_gemma":0.000117328935,"teacher_disagreement_score":0.947659,"about_ca_system_score_codex":0.0000097493385,"about_ca_system_score_gemma":0.000036282272,"threshold_uncertainty_score":0.6858204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014597508,0.000085331914,0.95243305,0.0063908007,0.00014564715,0.01806816,0.00004560238,0.00026309473,0.007970801],"genre_scores_gemma":[0.71589893,0.000013102594,0.2733763,0.00080242293,0.000009425139,0.009880043,0.0000085167885,0.000008553154,0.000002716528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857837,0.0003679385,0.00036424623,0.00025216237,0.00022330761,0.00021396844],"domain_scores_gemma":[0.9951161,0.00021143995,0.00017102572,0.0043033394,0.000117114665,0.00008096912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048613924,0.00012452155,0.00019094748,0.00019708283,0.00024054603,0.000083473715,0.0026519608,0.000046210294,0.000030135125],"category_scores_gemma":[0.00008071463,0.00012476361,0.00014866778,0.0011519667,0.00027581237,0.00048239372,0.00027299314,0.00021559112,0.000026976506],"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.000014831978,0.0017708008,0.008834879,0.00012202631,0.00023347886,0.000004897243,0.0030432586,0.00020673375,0.040135644,0.9246167,0.016808188,0.004208587],"study_design_scores_gemma":[0.0049068728,0.00021592171,0.0063992594,0.00023056804,0.00021970597,0.000059649286,0.0004661027,0.09204615,0.11163469,0.060495812,0.7212209,0.0021043518],"about_ca_topic_score_codex":0.00007385963,"about_ca_topic_score_gemma":0.000050269726,"teacher_disagreement_score":0.86412084,"about_ca_system_score_codex":0.000025068879,"about_ca_system_score_gemma":0.000040379306,"threshold_uncertainty_score":0.50877124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6787015,0.00064560305,0.3115667,0.0027243323,0.0005964164,0.0006310035,0.00008230249,0.0021584174,0.00289369],"genre_scores_gemma":[0.6722247,0.000055043543,0.32622248,0.0011032339,0.0002456448,0.00001913057,0.00005680109,0.000014615586,0.000058344955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979715,0.00006372743,0.00031786435,0.0007706254,0.00045295677,0.0004233766],"domain_scores_gemma":[0.9984037,0.00010228709,0.00009192107,0.0010488533,0.00013673204,0.00021646483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020437289,0.0002499544,0.00023581504,0.00011633001,0.00027097482,0.00016782693,0.001182441,0.0002246685,0.00017071456],"category_scores_gemma":[0.00004488017,0.00020722313,0.00015692518,0.0007597453,0.00008148105,0.000934725,0.0003978782,0.0004141131,0.00016035188],"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.0006985997,0.005461995,0.047444165,0.00020350257,0.0010051937,0.001395205,0.03199331,0.00012565474,0.06261685,0.62156934,0.2095316,0.017954571],"study_design_scores_gemma":[0.009118148,0.00091876707,0.026956027,0.00011572128,0.00009698249,0.00018160175,0.00029258383,0.23675522,0.14570871,0.056291256,0.51976854,0.0037964405],"about_ca_topic_score_codex":0.0001529334,"about_ca_topic_score_gemma":0.00011875109,"teacher_disagreement_score":0.5652781,"about_ca_system_score_codex":0.000016759375,"about_ca_system_score_gemma":0.00018216684,"threshold_uncertainty_score":0.8450314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030104676,0.000025191102,0.96741366,0.00023861266,0.0001843999,0.00017100593,0.0000380201,0.00019048572,0.0016339391],"genre_scores_gemma":[0.99349326,0.0000076148276,0.0059473612,0.00046037574,0.000034375105,0.000015755615,0.00003242123,0.0000043487935,0.000004503327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988717,0.000073202085,0.00023046236,0.0003508157,0.00012687263,0.0003469426],"domain_scores_gemma":[0.9991153,0.00009510276,0.000057398967,0.0005754661,0.00004920437,0.00010753089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023121982,0.00013452274,0.00018619347,0.00010206884,0.00005787857,0.00014114732,0.0011663971,0.0000790195,0.000087726214],"category_scores_gemma":[0.00001851306,0.000113438524,0.00006901548,0.0007980095,0.000049104736,0.0007103647,0.0002604567,0.00015755677,0.0000108649365],"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.00014193771,0.0005968117,0.13985707,0.00001804808,0.00005167669,0.00018743504,0.00060496177,0.00020128854,0.000115322146,0.83474517,0.0077580716,0.015722223],"study_design_scores_gemma":[0.003110396,0.00010589065,0.27669978,0.000027843429,0.000011568758,0.00001592042,0.000037954556,0.7018379,0.00057293096,0.015259555,0.0017007799,0.000619495],"about_ca_topic_score_codex":0.00044349337,"about_ca_topic_score_gemma":0.0006416808,"teacher_disagreement_score":0.96338856,"about_ca_system_score_codex":0.000011402215,"about_ca_system_score_gemma":0.000019949886,"threshold_uncertainty_score":0.46258888},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058914527,0.00033379014,0.99497813,0.0005619904,0.001707725,0.0007885664,0.00008050837,0.00022147568,0.0012688705],"genre_scores_gemma":[0.050532047,0.00012524512,0.9457829,0.0029572318,0.00041542255,0.000054411226,0.000035811303,0.000042404496,0.000054555898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581814,0.000038283986,0.0005039728,0.0018897126,0.00096235913,0.000787557],"domain_scores_gemma":[0.9965741,0.00090034166,0.00033071727,0.0015634992,0.00041861692,0.00021272167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075569964,0.00060946157,0.00058913475,0.001038602,0.00050199166,0.00046461556,0.0039807754,0.0003921207,0.000017052445],"category_scores_gemma":[0.00014892666,0.00057067844,0.00030638502,0.00073758024,0.000807664,0.00073669263,0.0009204917,0.000612359,0.000015408108],"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.00007749289,0.00013900296,0.00004816163,0.00014052223,0.00003826526,0.00014392292,0.001289339,0.002705898,0.000113947855,0.6015465,0.000489436,0.39326748],"study_design_scores_gemma":[0.0006692977,0.0003076419,0.00003260218,0.0002604656,0.000011738509,0.000031219493,1.7461866e-7,0.50894046,0.0028801053,0.4796434,0.006378449,0.00084442215],"about_ca_topic_score_codex":0.000019807689,"about_ca_topic_score_gemma":0.00008496931,"teacher_disagreement_score":0.5062346,"about_ca_system_score_codex":0.00019555181,"about_ca_system_score_gemma":0.00078785524,"threshold_uncertainty_score":0.99967444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00881009,0.00008660131,0.9884622,0.00014385699,0.00025833125,0.00009214789,0.000002549018,0.00027541548,0.0018687737],"genre_scores_gemma":[0.13771187,0.00018054059,0.8605361,0.0005659307,0.00011374027,0.0000045817046,0.00004167999,0.0000069113885,0.0008386416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991685,0.000031312244,0.00013519543,0.0002961924,0.00018065983,0.00018813086],"domain_scores_gemma":[0.99940324,0.000013961575,0.00003926487,0.0003783171,0.000049671784,0.00011552089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007652027,0.00009777615,0.000084775915,0.0000918994,0.00017819514,0.00006994386,0.0004036037,0.00005689304,0.00029692784],"category_scores_gemma":[0.000010499127,0.000090006775,0.000054580032,0.00047700296,0.000021398992,0.0010793494,0.000100222926,0.00005797463,0.00020247523],"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.0000134890615,0.00024538234,0.006501729,0.0000123056525,0.000028294593,0.000028671851,0.0021906577,0.0010203805,0.0113525195,0.7506394,0.2066534,0.0213138],"study_design_scores_gemma":[0.0037600263,0.00026319028,0.058566466,0.0000253733,0.000019752233,0.00015133813,0.00004906113,0.5974042,0.051572792,0.033971123,0.25275034,0.0014663348],"about_ca_topic_score_codex":0.00057096145,"about_ca_topic_score_gemma":0.000055874698,"teacher_disagreement_score":0.71666825,"about_ca_system_score_codex":0.000016375629,"about_ca_system_score_gemma":0.00006343029,"threshold_uncertainty_score":0.36703697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25939536,0.0015454973,0.6948605,0.0044343458,0.0010767503,0.000597435,0.00020614376,0.001082726,0.036801234],"genre_scores_gemma":[0.9871067,0.00011423753,0.0061458643,0.0065206005,0.000048538102,0.0000094273,0.000018179,0.000009264826,0.000027200054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980969,0.00006186794,0.00023798655,0.0004921488,0.00069560815,0.0004155332],"domain_scores_gemma":[0.99901515,0.00002783886,0.000022590171,0.000693392,0.00006125839,0.00017973897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028170756,0.000195135,0.00015991801,0.00014851984,0.0001293616,0.0002689356,0.0012290545,0.00009995825,0.0004949552],"category_scores_gemma":[0.000008933753,0.0001707631,0.00013884572,0.00051733793,0.00004438073,0.00075169146,0.00014745195,0.00019034851,0.0002549424],"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.000014610186,0.001945689,0.0072859777,0.000071530936,0.0005199473,0.00009077268,0.038857643,0.000013146511,0.0017733563,0.457985,0.3917905,0.09965182],"study_design_scores_gemma":[0.008555251,0.0012551621,0.020562124,0.00016349266,0.00022556233,0.00011329985,0.0006897679,0.113931805,0.022420181,0.054002505,0.7734005,0.0046803406],"about_ca_topic_score_codex":0.000029950364,"about_ca_topic_score_gemma":0.00006188248,"teacher_disagreement_score":0.7277113,"about_ca_system_score_codex":0.0000132468795,"about_ca_system_score_gemma":0.000012722914,"threshold_uncertainty_score":0.6963517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02039967,0.00019414694,0.97300774,0.00051057985,0.00011550645,0.000037136313,8.059822e-7,0.00013155538,0.0056028706],"genre_scores_gemma":[0.9185781,0.000019940388,0.08110332,0.00025462257,0.00003677549,3.8621872e-7,4.0019287e-7,0.0000014218765,0.0000050452245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942,0.000015973708,0.00011555893,0.00021892377,0.00008656843,0.00014301573],"domain_scores_gemma":[0.99960285,0.00005980899,0.0000206508,0.00023809557,0.000014542189,0.00006403116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110614164,0.000058536505,0.000059768976,0.00005747598,0.00010877434,0.000153627,0.00030069624,0.000022826242,0.00009102837],"category_scores_gemma":[0.000012847288,0.000052516283,0.000021222686,0.00027225455,0.00005017632,0.0002666068,0.00019685694,0.00006533716,0.0000764662],"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":[2.3596643e-7,0.000023030787,0.00018471466,0.0000020270681,0.0000015504238,0.0000034334716,0.00037858228,0.0000023545583,0.000033834745,0.7258567,0.0003130103,0.2732005],"study_design_scores_gemma":[0.000034679917,0.000059889077,0.0014596395,0.000008202989,0.0000023160817,0.000040505704,0.00008365678,0.84986347,0.0014362434,0.14346905,0.0033274603,0.00021488703],"about_ca_topic_score_codex":0.000017145656,"about_ca_topic_score_gemma":0.0000111262925,"teacher_disagreement_score":0.8981784,"about_ca_system_score_codex":0.0000027189253,"about_ca_system_score_gemma":0.0000020642897,"threshold_uncertainty_score":0.21415518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108308144,0.0006431077,0.9967658,0.0007122483,0.0003502918,0.00045520393,0.000021439764,0.000042178894,0.0009014297],"genre_scores_gemma":[0.5272383,0.0001545328,0.47181442,0.00064551865,0.00006087083,0.000020288311,0.000045372093,0.000012367197,0.000008315918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801725,0.00004918449,0.0005915254,0.0004485338,0.00057277165,0.00032075803],"domain_scores_gemma":[0.995115,0.002900308,0.00048291357,0.0010700197,0.00035058678,0.00008118356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016898126,0.00026413202,0.00030991778,0.0004401036,0.0006899223,0.0005815537,0.002594616,0.00013165218,0.0000016113671],"category_scores_gemma":[0.00017566633,0.00020814301,0.00008855817,0.00042543127,0.0017345577,0.0006151262,0.00093181373,0.00036095237,0.0000032071778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006095188,0.000012142624,0.000043743938,0.000045613524,0.000005491486,1.765545e-7,0.000856728,0.009239504,0.0000013354936,0.76264894,0.000016154867,0.22712405],"study_design_scores_gemma":[0.00024828993,0.00013251977,0.00009050702,0.0001965408,0.000006232588,0.000009150164,9.412988e-7,0.49279785,0.000024092738,0.50426024,0.0020385475,0.00019507295],"about_ca_topic_score_codex":0.000016338743,"about_ca_topic_score_gemma":0.000044439555,"teacher_disagreement_score":0.52713,"about_ca_system_score_codex":0.00004535254,"about_ca_system_score_gemma":0.00020300603,"threshold_uncertainty_score":0.8487826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32757828,0.00000667203,0.67149323,0.00007794054,0.00046904286,0.00008461418,0.000014468815,0.00002770299,0.00024806565],"genre_scores_gemma":[0.84697944,0.0000038052194,0.15286157,0.00011658207,0.000031246364,0.000002178134,0.000002081813,0.000002179618,9.1088515e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927723,0.000028111657,0.00016164401,0.00016645833,0.00023262526,0.00013393053],"domain_scores_gemma":[0.9992173,0.000027496173,0.00008401737,0.0005553467,0.00008284204,0.000033004246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022051779,0.00006604176,0.00007270765,0.000059276343,0.000115120856,0.000047197995,0.0006184983,0.00003798468,0.00004461691],"category_scores_gemma":[0.00000816664,0.00004554817,0.00008479977,0.00056762353,0.000070940354,0.00033714564,0.00020382962,0.00012644536,8.6371136e-7],"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":[6.7938834e-7,0.000029303632,0.0014533078,0.0000063775956,0.000015415208,3.302905e-7,0.0007994197,0.0000020356804,0.09782638,0.8142715,0.00015828981,0.08543693],"study_design_scores_gemma":[0.0006276977,0.00005346214,0.046392024,0.000008900361,0.000024074063,0.000014111903,0.00039529917,0.033686776,0.83152,0.08500566,0.0019698008,0.00030216717],"about_ca_topic_score_codex":0.0008345354,"about_ca_topic_score_gemma":0.0006492908,"teacher_disagreement_score":0.73369366,"about_ca_system_score_codex":0.00000376371,"about_ca_system_score_gemma":0.00006228005,"threshold_uncertainty_score":0.18574005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017057882,0.000057441302,0.9940595,0.0035352265,0.0001396382,0.00010036267,0.00001581063,0.00006702146,0.00031921905],"genre_scores_gemma":[0.9579575,0.0000066762677,0.04062507,0.0012269918,0.00009181758,0.000006943558,0.000063535896,7.323354e-7,0.000020740381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967474,0.000008205257,0.00006259916,0.00011821812,0.000055616358,0.000080595026],"domain_scores_gemma":[0.99963534,0.000040629704,0.000015030837,0.000263252,0.00002628741,0.000019454666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109997745,0.00003712352,0.000030618947,0.000013004488,0.00006299724,0.00014299357,0.00038403316,0.000015487814,0.000011114623],"category_scores_gemma":[0.000014950961,0.000022067165,0.000036542504,0.00011889037,0.000008741104,0.00020549902,0.000032809352,0.00002593757,0.0000054398247],"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.0000015249096,0.000017112026,0.000020235091,3.3565584e-7,0.0000026546031,1.4538367e-7,0.000090805675,0.000007688843,0.0002681302,0.90923005,0.06558829,0.024773045],"study_design_scores_gemma":[0.0002525815,0.00012739627,0.004273719,0.0000016272111,0.0000050141316,0.0000033458475,0.000011489457,0.76071864,0.0058942996,0.043026816,0.18557404,0.00011104573],"about_ca_topic_score_codex":0.000012541741,"about_ca_topic_score_gemma":0.00002767453,"teacher_disagreement_score":0.9562517,"about_ca_system_score_codex":0.000003832733,"about_ca_system_score_gemma":0.000005811609,"threshold_uncertainty_score":0.13788903},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002914111,0.00041767303,0.85268617,0.00037781367,0.00021488,0.00004807277,0.0000012002903,0.00025453646,0.14308557],"genre_scores_gemma":[0.9667144,0.00002653608,0.032515883,0.00030678406,0.000030644962,0.000003931963,0.0000010494516,0.0000025318152,0.00039825583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944234,0.000022779212,0.00009334042,0.00019705282,0.00008604765,0.00015845586],"domain_scores_gemma":[0.99935365,0.000043884116,0.000014962123,0.0004927162,0.000022373744,0.0000724342],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007979431,0.00006505853,0.000065053355,0.000061804894,0.000074409574,0.00010633998,0.0005619782,0.000026276837,0.0004911871],"category_scores_gemma":[0.0000114777295,0.000053906333,0.000046738598,0.00039553514,0.000024732095,0.00043569633,0.00014180517,0.00005797383,0.0011975697],"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":[2.0621525e-7,0.00010644002,0.00032374947,0.000004635411,0.0000035867706,0.000003986463,0.00060179,4.284081e-7,0.000052282805,0.9168649,0.057294652,0.024743363],"study_design_scores_gemma":[0.00096060813,0.00021879608,0.0045584505,0.000022430202,0.000011238418,0.000060607865,0.000050092705,0.26004612,0.0033288968,0.26010522,0.46976712,0.0008703989],"about_ca_topic_score_codex":0.0000071459635,"about_ca_topic_score_gemma":0.000016410439,"teacher_disagreement_score":0.96380025,"about_ca_system_score_codex":0.0000047999797,"about_ca_system_score_gemma":0.000004077539,"threshold_uncertainty_score":0.9995801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09319313,0.0030315665,0.90155256,0.00047284094,0.00011282851,0.00021116972,0.000011976131,0.0005088381,0.0009051034],"genre_scores_gemma":[0.8751181,0.00009662929,0.123540945,0.0011515593,0.00005295729,0.000009844878,0.000020380654,0.000008895392,7.268578e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981247,0.000104261795,0.0002771987,0.0006590851,0.00032441758,0.0005103333],"domain_scores_gemma":[0.9987322,0.00011488366,0.00012290907,0.00069788966,0.00008408148,0.00024804065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035979613,0.0003229531,0.0003377491,0.00043521792,0.00038685557,0.00050910574,0.0008041302,0.00010983254,0.000011034509],"category_scores_gemma":[0.000014850462,0.00029550667,0.00019944686,0.0012572674,0.00014851053,0.0005778292,0.00010552651,0.000316153,0.000004782036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006679396,0.00033489842,0.017489143,0.000040822513,0.00006732478,0.000057478286,0.00032930233,0.0001637506,0.0078086145,0.92631036,0.001766701,0.045564804],"study_design_scores_gemma":[0.008410275,0.002569477,0.103627175,0.00067804405,0.00019535204,0.000104861676,0.0001873783,0.22616602,0.04013416,0.5476777,0.066208385,0.0040411754],"about_ca_topic_score_codex":0.000020376929,"about_ca_topic_score_gemma":0.000017814718,"teacher_disagreement_score":0.7819249,"about_ca_system_score_codex":0.000007426365,"about_ca_system_score_gemma":0.000031897882,"threshold_uncertainty_score":0.9999497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071550948,0.0048494227,0.98405814,0.0006652918,0.0010654379,0.0013449559,0.00013276978,0.00025075575,0.00047813766],"genre_scores_gemma":[0.92323357,0.0002870548,0.075368606,0.00022013158,0.0003851529,0.0004573895,0.000029971963,0.000017189268,9.1788536e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980515,0.00015451701,0.0003041774,0.00043455724,0.00023754011,0.0008176892],"domain_scores_gemma":[0.99854845,0.00032414796,0.00013620139,0.0006435128,0.000088660876,0.00025900736],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011990736,0.00027743084,0.0002741342,0.00018332238,0.0013137661,0.0004625963,0.0007072715,0.00013403878,0.0000054666903],"category_scores_gemma":[0.000026608406,0.00020029643,0.000324049,0.0007884273,0.00021951411,0.0008511721,0.00026392235,0.00020907789,0.0000010780018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036079204,0.00015144238,0.001296695,0.00003998103,0.000092466056,3.1988222e-7,0.0013866109,0.0000011148489,0.0010439982,0.99152356,0.0019378946,0.0024898616],"study_design_scores_gemma":[0.003612769,0.000530446,0.0034578147,0.000045614604,0.0002814211,0.00003527532,0.00044608035,0.02374452,0.0023841904,0.84221125,0.12211784,0.001132805],"about_ca_topic_score_codex":0.00016930769,"about_ca_topic_score_gemma":0.000028103013,"teacher_disagreement_score":0.9160785,"about_ca_system_score_codex":0.000014647705,"about_ca_system_score_gemma":0.00005504035,"threshold_uncertainty_score":0.9999864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030449323,0.00005638939,0.96240556,0.0002232279,0.0002646355,0.000044966215,0.0000019844233,0.00015886672,0.006395015],"genre_scores_gemma":[0.9456295,0.0000028599022,0.054127585,0.00017606444,0.00004519747,0.0000036674387,0.000004930031,0.0000014492252,0.000008741492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995052,0.000026583823,0.000081548635,0.0001211035,0.000094350646,0.00017119724],"domain_scores_gemma":[0.999353,0.000031060805,0.000021231426,0.0004837261,0.000019129324,0.00009184148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014805491,0.000048063324,0.000043183354,0.000041044023,0.00006856491,0.00006062748,0.00035969185,0.00002691661,0.00003626097],"category_scores_gemma":[0.000021329592,0.000041759507,0.000027826985,0.00021562542,0.000020577818,0.00071062485,0.00010321562,0.000045208795,0.00013043209],"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":[7.553058e-7,0.00006836495,0.008713939,0.0000028488976,0.0000018289262,2.979082e-7,0.00014111852,1.7053365e-7,0.00023276133,0.9762586,0.0005700467,0.014009262],"study_design_scores_gemma":[0.00032905038,0.0000667912,0.7218491,0.0000075217977,0.000015120032,0.00004499743,0.00007318883,0.031496182,0.012083156,0.10841055,0.12502065,0.00060371705],"about_ca_topic_score_codex":0.000021141821,"about_ca_topic_score_gemma":0.0000056713416,"teacher_disagreement_score":0.9151802,"about_ca_system_score_codex":0.0000065509194,"about_ca_system_score_gemma":0.000007933765,"threshold_uncertainty_score":0.17029034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038961776,0.000030778283,0.95799667,0.0000664007,0.00023999649,0.000096691365,0.000053517117,0.00016329443,0.0023908848],"genre_scores_gemma":[0.9977278,0.00004031368,0.0017954488,0.00039816694,0.00001244631,0.0000059742815,0.000009928183,0.0000018891758,0.000008042483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991215,0.00005108087,0.0002856123,0.00013258161,0.00022633228,0.00018291066],"domain_scores_gemma":[0.9992312,0.00018593593,0.000080928476,0.00031101124,0.00008043072,0.000110472836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010132415,0.000107632026,0.00011494628,0.0007063189,0.00025392158,0.0001365356,0.00020568541,0.0000749115,0.00007438535],"category_scores_gemma":[0.0000067768638,0.000103343475,0.000113701346,0.0012354989,0.000041003772,0.0027621672,0.0000033599645,0.00018275209,0.000073093346],"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.000104768376,0.00012440368,0.0000222571,0.000026869457,0.00029588386,0.0000028566224,0.016565869,0.0012260631,0.000046835845,0.8513578,0.00007825138,0.13014816],"study_design_scores_gemma":[0.006115261,0.0010963184,0.016591962,0.00009108944,0.0017300637,0.00020064368,0.008391244,0.38773414,0.15768495,0.36873412,0.048106212,0.0035239754],"about_ca_topic_score_codex":0.000009839948,"about_ca_topic_score_gemma":0.000033302636,"teacher_disagreement_score":0.95876604,"about_ca_system_score_codex":0.000019355713,"about_ca_system_score_gemma":0.000017598224,"threshold_uncertainty_score":0.42142245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002429319,0.00010420735,0.98003983,0.00111109,0.0000988193,0.000036560534,0.0000036754998,0.00022967748,0.015946835],"genre_scores_gemma":[0.5314363,0.0000033537624,0.4677696,0.0006257927,0.00007169963,8.0287094e-7,0.0000068010822,0.000002617092,0.00008299029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949306,0.0000018615609,0.000060412956,0.00018775128,0.00012426736,0.00013265612],"domain_scores_gemma":[0.9995246,0.000009726789,0.000012450001,0.00033492447,0.000014159277,0.00010413702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000024138944,0.000061128114,0.000048415113,0.000039657712,0.000036989586,0.00027437092,0.00051047606,0.000038622573,0.000043732725],"category_scores_gemma":[0.000009532964,0.000049511043,0.00004853469,0.00033370874,0.000011262889,0.001039266,0.00016321566,0.000085839885,0.00012633378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.358842e-7,0.000022440017,0.00009220651,0.000001010885,0.0000033329948,0.000007052754,0.00010983363,0.0000027223844,0.00012862934,0.9810608,0.0051723095,0.0133987535],"study_design_scores_gemma":[0.0009710792,0.00009851548,0.001614348,0.000014566681,0.0000017893786,0.000034930374,0.000027557131,0.0003396544,0.0039105727,0.85062337,0.14201346,0.000350148],"about_ca_topic_score_codex":0.000030142462,"about_ca_topic_score_gemma":0.000010133188,"teacher_disagreement_score":0.529007,"about_ca_system_score_codex":0.0000067355254,"about_ca_system_score_gemma":0.000060012433,"threshold_uncertainty_score":0.2645765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05268029,0.000044474968,0.91771716,0.004145108,0.0025002884,0.00024052,0.00008062704,0.00007120771,0.022520324],"genre_scores_gemma":[0.9827388,0.000014964734,0.015141318,0.0019501531,0.00013385224,0.000004517628,0.00001319562,0.0000026051696,5.7695866e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815434,0.00010131171,0.0006643054,0.000076008284,0.00086638506,0.00013766129],"domain_scores_gemma":[0.9979576,0.00011533961,0.0007191875,0.00028066066,0.0008488261,0.000078398545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012240798,0.00011198317,0.00011838533,0.00034895964,0.000096247495,0.00033340396,0.001742609,0.000051020077,0.00008913266],"category_scores_gemma":[0.00011225241,0.00007452635,0.00015804346,0.00024894706,0.000038488375,0.0031340693,0.000112575945,0.00026440975,0.00004158448],"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.00007914197,0.000113665024,0.0012963001,0.000011212653,0.00006142731,0.000011797417,0.006129684,0.00013806025,0.000025130596,0.98243964,0.0070953975,0.0025985288],"study_design_scores_gemma":[0.0050305887,0.0010860421,0.022900397,0.00074113754,0.000048429727,0.00079386,0.0020259803,0.25946423,0.016866963,0.31844723,0.3714089,0.0011862451],"about_ca_topic_score_codex":0.00004702541,"about_ca_topic_score_gemma":0.000007674533,"teacher_disagreement_score":0.93005854,"about_ca_system_score_codex":0.0000545698,"about_ca_system_score_gemma":0.000103388265,"threshold_uncertainty_score":0.323823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11894594,0.00025246397,0.87850255,0.00030197017,0.0010986357,0.000252837,0.0001314318,0.00041496317,0.00009920449],"genre_scores_gemma":[0.95002615,0.00004807885,0.049402148,0.00018780946,0.00019242882,0.000005285799,0.00009347741,0.000025301966,0.000019294639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967932,0.00021372607,0.00058293215,0.001089491,0.0005981389,0.00072247867],"domain_scores_gemma":[0.99760437,0.00042650758,0.0001668404,0.0011915194,0.00021555083,0.0003952048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014248735,0.000348983,0.00036693027,0.00038027353,0.0009712466,0.0006049813,0.0011672304,0.00018886435,0.000021215901],"category_scores_gemma":[0.000058233178,0.0003458743,0.00010614651,0.0010539006,0.00012683189,0.0013701314,0.000100567355,0.00079623447,0.000017308923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012682918,0.004674946,0.0056606196,0.0008931948,0.0016253575,0.0011409724,0.049274895,0.11504801,0.016348952,0.07485058,0.012205763,0.7170084],"study_design_scores_gemma":[0.001969133,0.00016474882,0.00024604093,0.000094036775,0.00004572557,0.00011845739,0.0007746449,0.98541796,0.00615452,0.0008123752,0.0036482161,0.00055416196],"about_ca_topic_score_codex":0.00032533339,"about_ca_topic_score_gemma":0.00044829302,"teacher_disagreement_score":0.8703699,"about_ca_system_score_codex":0.000052676805,"about_ca_system_score_gemma":0.00025137904,"threshold_uncertainty_score":0.9998993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030965354,0.00021787194,0.9675995,0.000101837184,0.0002096699,0.0004911114,0.0000100419,0.00021890347,0.00018571474],"genre_scores_gemma":[0.9931765,0.00012629415,0.0065192063,0.000028195278,0.000008982933,0.00011299161,0.0000017989364,0.000013529997,0.000012481079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986331,0.00010338035,0.00019693872,0.0004622866,0.00023854212,0.00036578174],"domain_scores_gemma":[0.99915344,0.00005143893,0.00009007853,0.00052417454,0.000081225386,0.00009962887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002296072,0.0001940162,0.00016125654,0.00017942017,0.0003798764,0.0001556262,0.00019760405,0.00009071178,0.0000064277237],"category_scores_gemma":[0.0000032110001,0.000158056,0.000054479908,0.0005728356,0.000052574243,0.00058104924,0.000001602209,0.00041525526,0.000012884449],"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.0006274993,0.0019943335,0.0012430428,0.00074234605,0.0012344508,0.000048922775,0.0035280995,0.008413901,0.011879274,0.49491262,0.00030412,0.4750714],"study_design_scores_gemma":[0.016402423,0.008265645,0.0044704843,0.0008060066,0.0009368275,0.0020603868,0.0009802276,0.39580446,0.47815225,0.0058479654,0.08088686,0.0053864685],"about_ca_topic_score_codex":0.00006605487,"about_ca_topic_score_gemma":0.0001705819,"teacher_disagreement_score":0.9622112,"about_ca_system_score_codex":0.00012248814,"about_ca_system_score_gemma":0.00020859938,"threshold_uncertainty_score":0.6445337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011470234,0.000035892026,0.9711068,0.00043298036,0.000049372964,0.00015343253,9.2058485e-7,0.000099229284,0.016651083],"genre_scores_gemma":[0.9603966,0.000052849588,0.038915284,0.00059409696,0.000004759008,0.0000036863682,0.0000143228,0.0000011326218,0.000017301732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944687,0.00002446824,0.000118364966,0.00018267131,0.000101038175,0.00012660974],"domain_scores_gemma":[0.99963677,0.000015284888,0.000018566474,0.00029330843,0.0000089166015,0.00002717643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016572664,0.0000540508,0.00006947155,0.00012644185,0.000030818723,0.00007016096,0.00032108644,0.000018500037,0.000026463056],"category_scores_gemma":[0.0000040882937,0.000047982405,0.000029188855,0.00045722348,0.000006119912,0.00035216214,0.00006405291,0.000035808473,0.0000151402755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023239012,0.000093001676,0.00022119733,0.0000034539007,0.0000038888197,0.000011551029,0.00016352108,0.00013869049,0.0000250522,0.9087765,0.000982652,0.089557245],"study_design_scores_gemma":[0.006979281,0.00007898816,0.07282721,0.000011427278,0.000006054778,0.000003569685,0.000056124132,0.41159883,0.00017524003,0.49650946,0.011439944,0.00031386357],"about_ca_topic_score_codex":0.000015160199,"about_ca_topic_score_gemma":0.00007634264,"teacher_disagreement_score":0.9489263,"about_ca_system_score_codex":0.000012282624,"about_ca_system_score_gemma":0.0000035869587,"threshold_uncertainty_score":0.19566657},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97485447,0.000108963286,0.008838059,0.00013643285,0.00078638754,0.00034740134,0.0004887238,0.00047033175,0.013969217],"genre_scores_gemma":[0.9849588,0.000049855033,0.014595277,0.0002360892,0.000068425565,0.000011977666,0.000026060186,0.000030744173,0.0000227398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970793,0.00020799717,0.0005479937,0.0009883343,0.00045925315,0.0007170999],"domain_scores_gemma":[0.9979291,0.0005192706,0.00009900196,0.00083170854,0.00016067082,0.00046024765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015655123,0.0003619785,0.00035833078,0.00047129093,0.0012463968,0.00028356074,0.000947601,0.000232979,0.000030495317],"category_scores_gemma":[0.00024178413,0.00038063846,0.0001694452,0.0011189383,0.0001367189,0.0037691342,0.0004185372,0.0010022266,0.000053156662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034741617,0.00017303419,0.0004853462,0.000022664537,0.00012488717,0.000074738535,0.00007435681,0.0000019469987,0.011651345,0.6906545,0.000005066229,0.29669735],"study_design_scores_gemma":[0.004300484,0.0009066739,0.15126698,0.0004686094,0.00035017592,0.000833122,0.0007555854,0.00032112843,0.1354275,0.5629667,0.13891502,0.0034880089],"about_ca_topic_score_codex":0.00018314959,"about_ca_topic_score_gemma":0.00032806423,"teacher_disagreement_score":0.29320934,"about_ca_system_score_codex":0.00014883719,"about_ca_system_score_gemma":0.000020144726,"threshold_uncertainty_score":0.9998646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2103823,0.00002987287,0.7805521,0.0005013479,0.004969513,0.000048429247,0.00011834466,0.000041888754,0.003356211],"genre_scores_gemma":[0.921468,0.000005388575,0.077635765,0.00038738557,0.00046872752,0.0000012485375,0.000009306962,0.000007665843,0.000016492695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985033,0.00012741,0.00034857486,0.0001777921,0.00068615424,0.00015673108],"domain_scores_gemma":[0.9984644,0.00020965378,0.00027485614,0.0003705136,0.00051892723,0.0001616588],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011033567,0.00011082781,0.00012647099,0.00017601659,0.000058972182,0.00022385005,0.0020876909,0.000064240245,0.0014983461],"category_scores_gemma":[0.00010539468,0.00009246929,0.00015671646,0.00014206624,0.00008189789,0.00067707576,0.00016348065,0.0004461352,0.00006931835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009648935,0.00084407534,0.0013554438,0.0000017787106,0.00018229679,0.00040917462,0.0018721669,0.00009143919,0.00169516,0.92058676,0.004893259,0.06797194],"study_design_scores_gemma":[0.0029131568,0.000442813,0.04553363,0.00016499411,0.00004682472,0.008140727,0.00064617733,0.017180169,0.006434564,0.82715595,0.09041172,0.00092926703],"about_ca_topic_score_codex":0.0000075006387,"about_ca_topic_score_gemma":0.0000054930765,"teacher_disagreement_score":0.71108574,"about_ca_system_score_codex":0.00002239658,"about_ca_system_score_gemma":0.00009275307,"threshold_uncertainty_score":0.99941444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007826477,0.000040992796,0.98714083,0.0013292569,0.001438689,0.00046258394,0.000015819936,0.00020119878,0.001544127],"genre_scores_gemma":[0.5388308,0.0000026258178,0.460418,0.00059658877,0.00011541412,0.000028924896,0.000001499614,0.000005181564,9.578877e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708843,0.000083680345,0.00031041662,0.0009368904,0.0008801614,0.00070041703],"domain_scores_gemma":[0.997089,0.00054799503,0.00010774399,0.001276635,0.00041321293,0.0005654135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018432542,0.0002427574,0.00027859324,0.00019710652,0.00038476818,0.0006926179,0.0033751682,0.00008042979,0.000012330219],"category_scores_gemma":[0.00026461467,0.00020097241,0.000119111995,0.0010592893,0.0017009169,0.001406483,0.0016334055,0.00030928143,0.00005583784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047544152,0.00016195972,0.000051749088,0.000006849493,0.00000915231,0.000006817855,0.0012797895,0.000020494459,0.000038743525,0.9823398,0.00031939955,0.015717726],"study_design_scores_gemma":[0.00051874784,0.00045080247,0.000106872896,0.0000543673,0.0000056580543,0.000016492393,0.000048756905,0.20060013,0.0039203884,0.79224735,0.0017588321,0.0002715718],"about_ca_topic_score_codex":0.000003845195,"about_ca_topic_score_gemma":0.0000013257174,"teacher_disagreement_score":0.5310043,"about_ca_system_score_codex":0.00012230578,"about_ca_system_score_gemma":0.00025142176,"threshold_uncertainty_score":0.8195417},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21138774,0.000010930715,0.784048,0.0030183564,0.000037427093,0.00010403394,0.0000031830757,0.00006866919,0.0013216337],"genre_scores_gemma":[0.8138178,0.000004450146,0.18556862,0.00056236744,0.000020472207,0.000004783386,0.0000021359208,0.0000018541103,0.000017512195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99943095,0.0000069760717,0.00004838264,0.00025600696,0.0001295682,0.00012809827],"domain_scores_gemma":[0.99951714,0.000014081141,0.000018808643,0.00031976242,0.000033302116,0.00009688145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090711874,0.00006836176,0.0000638616,0.00006062837,0.00007257504,0.00027320645,0.00019605704,0.00002359277,0.0000025855115],"category_scores_gemma":[0.00000938027,0.00005162557,0.000013911447,0.00034731763,0.000019976296,0.00045141485,0.000121689,0.00004332865,0.000007304866],"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.000032988715,0.0001791156,0.014805638,0.000026558353,0.000024806832,0.000040182156,0.0020325223,0.00006979394,0.0013968247,0.913069,0.0017340359,0.06658852],"study_design_scores_gemma":[0.0051888074,0.0017816939,0.80317974,0.000087847824,0.000029475172,0.00017587455,0.0004278396,0.0029800378,0.028622832,0.10945551,0.046534892,0.0015354686],"about_ca_topic_score_codex":0.00008733366,"about_ca_topic_score_gemma":0.00054283824,"teacher_disagreement_score":0.8036135,"about_ca_system_score_codex":0.000009169278,"about_ca_system_score_gemma":0.000023713148,"threshold_uncertainty_score":0.2634536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11289583,0.000045159806,0.88206494,0.0007941923,0.00015598387,0.000102291124,6.2320004e-7,0.00008091399,0.0038600583],"genre_scores_gemma":[0.96626693,0.0000070070855,0.033257313,0.00038168515,0.000019019775,0.000003854019,0.0000017994826,0.000002378623,0.000060013343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993343,0.00002005177,0.00015968508,0.00019248658,0.00009866712,0.00019483868],"domain_scores_gemma":[0.9993547,0.00009374921,0.000034098895,0.00045976765,0.000021386903,0.000036298556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074016454,0.000056868354,0.00005275211,0.0000976575,0.000059916794,0.00008623969,0.00053839246,0.000026760288,0.000021845692],"category_scores_gemma":[0.000018917643,0.00004101021,0.000033180033,0.00048720426,0.00002433181,0.00040623642,0.00014045883,0.00008839703,0.000014243955],"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.000006660255,0.0000810738,0.0118028065,0.0000043284017,0.0000051506236,0.000003039246,0.001067301,5.8736174e-7,0.0019882587,0.84576243,0.0006967559,0.1385816],"study_design_scores_gemma":[0.0014517478,0.000103356855,0.5583711,0.000037033344,0.000013358127,0.000015104387,0.0006553073,0.15282138,0.017180521,0.09816176,0.17044832,0.00074102305],"about_ca_topic_score_codex":0.00020537317,"about_ca_topic_score_gemma":0.0010210659,"teacher_disagreement_score":0.8533711,"about_ca_system_score_codex":0.00001203887,"about_ca_system_score_gemma":0.000012680739,"threshold_uncertainty_score":0.1672348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041150022,0.000053140175,0.950442,0.000454105,0.00012657042,0.0058782706,0.000016441823,0.00017447643,0.0017049458],"genre_scores_gemma":[0.98814595,0.000031467607,0.010113644,0.00009877974,0.000041747902,0.0015450728,0.000008720836,0.000009017457,0.0000055812225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983067,0.000015276879,0.00036945357,0.000520566,0.00024731245,0.00054067833],"domain_scores_gemma":[0.9989653,0.00006196766,0.00009606426,0.0001540166,0.00031837483,0.00040426946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016348695,0.00025708237,0.00032476513,0.0011041864,0.00008494857,0.00016811419,0.00062379235,0.00012570537,0.000012738235],"category_scores_gemma":[0.000054997236,0.0002616658,0.00004736965,0.0019697256,0.00006941034,0.00049777876,0.00012952718,0.00038427627,0.0000050236267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016967106,0.00013142702,0.008532162,0.00014700471,0.000019519346,0.000033721204,0.0016391596,0.00006627296,0.00009353089,0.9293328,0.0006491195,0.05933833],"study_design_scores_gemma":[0.0005395646,0.00040478475,0.04938083,0.00015415279,0.0000032703254,0.000055771117,0.0000066241028,0.94471234,0.0002922553,0.002166708,0.0019299862,0.00035373453],"about_ca_topic_score_codex":0.0028381203,"about_ca_topic_score_gemma":0.0007161444,"teacher_disagreement_score":0.946996,"about_ca_system_score_codex":0.000105976615,"about_ca_system_score_gemma":0.00032840887,"threshold_uncertainty_score":0.99998355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49329913,0.0064983815,0.41379413,0.014003241,0.0019141556,0.0032101162,0.000073474286,0.0010661816,0.06614121],"genre_scores_gemma":[0.981037,0.0017940155,0.01643654,0.00025222285,0.00015008841,0.00018610302,0.000084507345,0.000012152266,0.00004735095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983404,0.000115548966,0.00042503583,0.0005561534,0.00024693407,0.00031588052],"domain_scores_gemma":[0.9978225,0.0002229459,0.00020465223,0.0013601222,0.00025269223,0.00013708588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039859506,0.0002277664,0.00022569756,0.00023532605,0.00045921162,0.00079481717,0.002417042,0.00011106138,0.000046641373],"category_scores_gemma":[0.0000146692655,0.00023009705,0.000050393006,0.0004927658,0.00019755132,0.0004375266,0.002030301,0.0004973306,0.000029045477],"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.0000060158723,0.00021376908,0.0104650175,0.000014184554,0.000038959515,6.9024594e-7,0.0017386227,0.00022542135,0.00003646739,0.9021969,0.0013374101,0.083726555],"study_design_scores_gemma":[0.00045561147,0.000088876506,0.012693185,0.00022430957,0.0000077915565,0.00001459287,0.00038689838,0.88364726,0.000014335025,0.058044434,0.044045184,0.0003775105],"about_ca_topic_score_codex":0.0008865869,"about_ca_topic_score_gemma":0.00026810405,"teacher_disagreement_score":0.88342184,"about_ca_system_score_codex":0.000045728775,"about_ca_system_score_gemma":0.000047827838,"threshold_uncertainty_score":0.93830854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08277828,0.00046664482,0.86884654,0.004503507,0.00047632467,0.0004401894,0.000037338796,0.0015518676,0.040899284],"genre_scores_gemma":[0.55013895,0.00011607084,0.44502744,0.0039853915,0.0002631641,0.000036724265,0.000036320664,0.000023981773,0.00037195734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783695,0.00008100563,0.0003471494,0.0006936169,0.0004701064,0.0005711721],"domain_scores_gemma":[0.99790657,0.00009948514,0.00010013533,0.0014132176,0.00012646189,0.00035411117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021399502,0.00026540944,0.00023938534,0.0003287306,0.00024838626,0.00034042523,0.0015195993,0.00012417314,0.00066007645],"category_scores_gemma":[0.000032527954,0.00023725642,0.0002522972,0.0015763526,0.00010002563,0.0017110246,0.00045195766,0.0002395471,0.0007173638],"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.000022331926,0.00048486012,0.0030171212,0.00001912116,0.00005602477,0.00003368378,0.00019812972,0.000066379216,0.00043621229,0.8410438,0.09725044,0.05737195],"study_design_scores_gemma":[0.0024164403,0.00029100708,0.019766139,0.00004438017,0.000046011883,0.00007499248,0.00005897176,0.024695938,0.016612805,0.03562308,0.89889765,0.0014725587],"about_ca_topic_score_codex":0.00011596874,"about_ca_topic_score_gemma":0.00018610299,"teacher_disagreement_score":0.80542064,"about_ca_system_score_codex":0.00002417117,"about_ca_system_score_gemma":0.000068738846,"threshold_uncertainty_score":0.9675036},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24821858,0.000064004205,0.74599683,0.0023304613,0.00017529044,0.00023471733,0.000059854774,0.00007788807,0.0028423981],"genre_scores_gemma":[0.9897384,0.000002866746,0.009038934,0.0010633967,0.00006692776,0.000004491209,0.00008056685,0.0000019650972,0.0000024371948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99888825,0.00018121851,0.00010573009,0.00023308239,0.0003150976,0.00027664262],"domain_scores_gemma":[0.9979004,0.00012998878,0.000022115892,0.001865541,0.000021759906,0.000060187638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017143651,0.00007084485,0.00007332062,0.0000475136,0.00006937141,0.00019153144,0.002304184,0.000020815329,0.000061798],"category_scores_gemma":[0.000009446978,0.00003982278,0.000016354621,0.00046430554,0.00006475111,0.0011436855,0.00036330117,0.0001558368,0.000032157634],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000392627,0.0008790621,0.13871416,0.000029136801,0.000017275906,0.00001557134,0.0029793417,0.0000021918186,0.00014222397,0.8429776,0.0041485876,0.010055609],"study_design_scores_gemma":[0.0015114472,0.00015726597,0.8894038,0.00002846774,0.000016562679,0.000050141472,0.00067952025,0.02332057,0.0020453418,0.0018875441,0.08036552,0.00053379044],"about_ca_topic_score_codex":0.0006941696,"about_ca_topic_score_gemma":0.0003412763,"teacher_disagreement_score":0.84109,"about_ca_system_score_codex":0.000004682192,"about_ca_system_score_gemma":0.00004412525,"threshold_uncertainty_score":0.42817852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1806657,0.0009907547,0.8155017,0.00027310228,0.00008723386,0.00012563128,0.0000055393953,0.00006094611,0.0022894181],"genre_scores_gemma":[0.9092154,0.00010891759,0.09046896,0.00015547154,0.000011610089,0.000009910744,0.000024067802,0.00000279874,0.000002871406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990872,0.000042978463,0.00027936822,0.00023195744,0.00016898544,0.00018951308],"domain_scores_gemma":[0.9993785,0.00014496244,0.000032093376,0.0003764188,0.000038190097,0.000029826313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026339258,0.00008226126,0.00012607414,0.00024041481,0.000030505775,0.000074549534,0.0004760543,0.000058490114,0.000011724355],"category_scores_gemma":[0.00002438163,0.00008245573,0.000059818973,0.0012100999,0.00004898948,0.0009577218,0.000099020566,0.00011868012,0.0000029929388],"study_design_candidate":"theoretical_or_conceptual","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.000009129917,0.00041652957,0.09027656,0.000012400812,0.0000039430656,0.0000121569165,0.00012647476,0.004748995,0.00026279344,0.885529,0.0007179085,0.01788413],"study_design_scores_gemma":[0.0009800118,0.00008000274,0.7898764,0.000072887655,0.000006085294,0.0000014616039,0.0000862321,0.15292104,0.0010428996,0.043532502,0.011016176,0.00038432278],"about_ca_topic_score_codex":0.00024096266,"about_ca_topic_score_gemma":0.018675115,"teacher_disagreement_score":0.8419965,"about_ca_system_score_codex":0.000013651817,"about_ca_system_score_gemma":0.000034069948,"threshold_uncertainty_score":0.9992315},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056996443,0.0034970297,0.98771304,0.0022501505,0.00053394824,0.00061242445,0.000011390857,0.00015566971,0.005169324],"genre_scores_gemma":[0.32191074,0.00075317593,0.66909677,0.006801603,0.0011229811,0.000027132082,0.000023810126,0.00005682328,0.0002069609],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631745,0.00007136592,0.00046109123,0.0015355513,0.00093942403,0.0006751506],"domain_scores_gemma":[0.99715894,0.0006646418,0.00026854218,0.0016053938,0.00012578757,0.00017670626],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011962745,0.00056399906,0.000567315,0.0005383229,0.0004955802,0.0010886331,0.0038286317,0.00033148233,0.000009318914],"category_scores_gemma":[0.000049928385,0.00037985554,0.00017021853,0.0005810426,0.001771905,0.0006911321,0.0016922086,0.0012518263,0.000007662438],"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.000016569247,0.00002288874,0.000017512366,0.000023586856,0.000012241849,0.00003452753,0.000957397,0.0015460475,0.000018222607,0.46761093,0.00007930383,0.52966076],"study_design_scores_gemma":[0.00084923534,0.00017215381,0.0003569007,0.00026285785,0.00001774453,0.00006329048,3.688477e-7,0.100963354,0.00014397052,0.89014095,0.00631429,0.0007148734],"about_ca_topic_score_codex":0.00003333137,"about_ca_topic_score_gemma":0.00014315303,"teacher_disagreement_score":0.5289459,"about_ca_system_score_codex":0.00006612947,"about_ca_system_score_gemma":0.00020416084,"threshold_uncertainty_score":0.9999483},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023379184,0.00003510062,0.97217196,0.00027047336,0.000028370203,0.00012497627,0.00004237971,0.00006924762,0.003878276],"genre_scores_gemma":[0.9941505,0.00008510537,0.005586428,0.000073209696,0.0000151481145,0.000027896915,0.000040594412,9.700861e-7,0.000020112162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999555,0.000008258937,0.00007056476,0.00020085035,0.00007319736,0.000092150854],"domain_scores_gemma":[0.99959934,0.000038810445,0.000025425137,0.00020234693,0.00007382128,0.000060260125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003673874,0.00005359137,0.000054132,0.000021059477,0.00015116998,0.000046511777,0.0002230612,0.000022519154,0.000017720582],"category_scores_gemma":[0.0000073691385,0.000047756006,0.000017939114,0.00018326446,0.000035002173,0.00052046217,0.00012671329,0.00006024811,0.000040420862],"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.000002583991,0.00005552895,0.0005476943,0.000003770542,0.0000050076796,0.000002208925,0.00046249543,3.8368e-7,0.00035836073,0.9938591,0.0014174947,0.0032853738],"study_design_scores_gemma":[0.0019904855,0.0003744757,0.2583922,0.00005499709,0.000027507858,0.0005456813,0.00038721197,0.2483552,0.057221588,0.1194501,0.3116651,0.0015354563],"about_ca_topic_score_codex":0.000020718491,"about_ca_topic_score_gemma":0.000009205482,"teacher_disagreement_score":0.9707714,"about_ca_system_score_codex":0.0000063799507,"about_ca_system_score_gemma":0.000020467714,"threshold_uncertainty_score":0.19474335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013586511,0.00013961272,0.9962509,0.0014371502,0.00004824761,0.00038523145,0.000067108595,0.00008637052,0.00022669093],"genre_scores_gemma":[0.19740632,0.000018601386,0.80202305,0.00043612762,0.000014863671,0.00006751262,0.000019354015,0.000003387552,0.000010769096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900705,0.000060757764,0.00019910972,0.0003500761,0.00012670476,0.00025628923],"domain_scores_gemma":[0.99863625,0.00067577214,0.000049642942,0.0005520799,0.000044438373,0.000041791707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066961884,0.00011119293,0.00011634296,0.00009114342,0.00012466263,0.00011938446,0.0008144481,0.00003065082,0.0000138788955],"category_scores_gemma":[0.00009399739,0.00007235118,0.000054316795,0.0003253133,0.000027506721,0.00073914794,0.00029624536,0.00013768754,0.0000059742665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010722342,0.00012905293,0.000420389,0.000031502143,0.000009794434,0.0000011849331,0.001881851,0.00075077725,0.00035475864,0.71693146,0.00044926628,0.27902922],"study_design_scores_gemma":[0.00037832957,0.000019507428,0.00079893717,0.000027138603,0.0000033370093,0.0000039620986,0.000060174218,0.96613705,0.0004774111,0.015346676,0.016613454,0.00013402387],"about_ca_topic_score_codex":0.00022442052,"about_ca_topic_score_gemma":0.0030941688,"teacher_disagreement_score":0.9653863,"about_ca_system_score_codex":0.00001587623,"about_ca_system_score_gemma":0.000053958407,"threshold_uncertainty_score":0.29503953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25095615,0.000031046857,0.7272583,0.0005468745,0.00006718689,0.00033218839,0.000002781846,0.0002739291,0.02053151],"genre_scores_gemma":[0.8944569,0.000021047665,0.10535847,0.00009069698,0.000020937017,0.000025024003,0.0000065819895,0.0000055761575,0.00001473955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985358,0.00008241045,0.00019312036,0.00045257603,0.00034040396,0.00039564836],"domain_scores_gemma":[0.9990627,0.000035592348,0.00004455121,0.0006421253,0.00006861034,0.00014639701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060611765,0.0001239936,0.00012259807,0.0003098493,0.00009632074,0.00019755508,0.0010294279,0.00005691125,0.00010235663],"category_scores_gemma":[0.000025240566,0.00009315863,0.000034537497,0.0009834176,0.000071326926,0.0019164449,0.0003853672,0.00020932374,0.000033968492],"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.00006427719,0.000365598,0.09339942,0.000037185306,0.000017199456,0.000030627725,0.010521804,0.0000015616574,0.0002451746,0.87403685,0.00031301996,0.020967305],"study_design_scores_gemma":[0.008120418,0.0024268827,0.71999335,0.00033009218,0.000030687283,0.00018439583,0.0015181995,0.07146084,0.022979697,0.13626651,0.03420295,0.0024859728],"about_ca_topic_score_codex":0.00037758372,"about_ca_topic_score_gemma":0.00022090497,"teacher_disagreement_score":0.7377703,"about_ca_system_score_codex":0.00002271699,"about_ca_system_score_gemma":0.00010745671,"threshold_uncertainty_score":0.3798899},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014617426,0.0008687199,0.988806,0.0002253775,0.0016170099,0.00042500912,0.0000141114115,0.00011464717,0.0077829547],"genre_scores_gemma":[0.31691444,0.00009754491,0.6814039,0.0005029111,0.00083318184,0.000027450518,0.000015771997,0.000043125336,0.00016167956],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966718,0.00003808271,0.0005920534,0.0013554518,0.00074368523,0.0005989248],"domain_scores_gemma":[0.99698347,0.00035328683,0.00031152958,0.001828603,0.000330638,0.00019246858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007096091,0.0004562462,0.0005697576,0.0007402542,0.00015321307,0.00031978876,0.0041012163,0.00032205664,0.00008662325],"category_scores_gemma":[0.00006297379,0.0004017763,0.00019139425,0.0008233013,0.0009820606,0.0008196517,0.0019323644,0.00066907215,0.00010711527],"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.0000043508567,0.00008691515,0.00006970482,0.00008937507,0.000013249359,0.00001768174,0.0013150759,0.00054246566,0.00013454654,0.27282223,0.00017477879,0.72472966],"study_design_scores_gemma":[0.0004933844,0.00041474614,0.00042773294,0.0006345776,0.000016513608,0.000052584826,2.1978039e-7,0.28852326,0.0065396014,0.68347746,0.01821533,0.0012046174],"about_ca_topic_score_codex":0.000036333724,"about_ca_topic_score_gemma":0.00005658634,"teacher_disagreement_score":0.723525,"about_ca_system_score_codex":0.00007961448,"about_ca_system_score_gemma":0.00053243915,"threshold_uncertainty_score":0.9998434},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14231984,0.000029834771,0.8332714,0.0018690171,0.0015137179,0.00029182457,0.000041026473,0.0006084403,0.020054897],"genre_scores_gemma":[0.844752,0.000002535679,0.1535996,0.0012952668,0.00024637923,0.000024907855,0.000009050779,0.000009117758,0.000061105675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984297,0.000035581474,0.00023054874,0.00055935624,0.00034565147,0.00039914175],"domain_scores_gemma":[0.9981083,0.00007085749,0.000046997615,0.001323336,0.000101883146,0.00034862096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036996746,0.00017565863,0.00017882277,0.00019407664,0.00015659197,0.0003594752,0.0015334226,0.000068425,0.00025602663],"category_scores_gemma":[0.000051081955,0.00014882615,0.000109668246,0.0006850853,0.000031597494,0.0006213822,0.00055402337,0.0002968367,0.0005209524],"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.0000071096065,0.00007572479,0.0005905241,0.000020207623,0.000011840276,0.000027491038,0.00042062363,0.0000019172758,0.0048797717,0.92798144,0.060214654,0.0057687005],"study_design_scores_gemma":[0.00090168306,0.00028988314,0.003890654,0.000045686727,0.000014066582,0.00027672912,0.00013044092,0.009209615,0.03444904,0.051016245,0.8987319,0.0010440495],"about_ca_topic_score_codex":0.00010110831,"about_ca_topic_score_gemma":0.00029872486,"teacher_disagreement_score":0.87696517,"about_ca_system_score_codex":0.000008220172,"about_ca_system_score_gemma":0.00005724422,"threshold_uncertainty_score":0.66959625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052642792,0.000100836914,0.9459989,0.00011931268,0.00006025889,0.0002399036,0.00014450311,0.00018751978,0.0005059609],"genre_scores_gemma":[0.51827693,0.000013191501,0.4812286,0.00028668257,0.000023192379,0.000019628553,0.00014784456,0.0000029362463,0.0000010252116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990745,0.000022095102,0.00012470093,0.0004658047,0.0001093329,0.00020352172],"domain_scores_gemma":[0.9991343,0.000023986204,0.000028554046,0.000617725,0.00006147057,0.000133991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002289315,0.00011618319,0.00011639599,0.00005867624,0.00012787334,0.00018621466,0.00054015237,0.000046887733,0.000003981221],"category_scores_gemma":[0.000016807437,0.000095057185,0.000033603403,0.0003092599,0.000061129744,0.0012074567,0.000107901076,0.000099578196,0.0000013891105],"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.000027399336,0.0004245306,0.00017371919,0.000047498208,0.00000910995,0.0000030127019,0.0013704033,0.00015166716,0.00091910554,0.9890548,0.00055834005,0.0072603924],"study_design_scores_gemma":[0.0048296396,0.00063882535,0.00091143575,0.000042044456,0.000021108055,0.00007695488,0.00097255525,0.78859115,0.014931739,0.16519558,0.022687418,0.0011015678],"about_ca_topic_score_codex":0.0002252267,"about_ca_topic_score_gemma":0.000088547946,"teacher_disagreement_score":0.8238592,"about_ca_system_score_codex":0.000009063016,"about_ca_system_score_gemma":0.00003716209,"threshold_uncertainty_score":0.38763195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1498417,0.00004614142,0.846845,0.00025655335,0.0004902562,0.0008937622,0.00001556089,0.00016827538,0.0014427764],"genre_scores_gemma":[0.8653169,0.000020697877,0.13374232,0.00061291974,0.00006678291,0.00007304101,0.00014667105,0.000012304269,0.000008352937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979168,0.0000855618,0.0004902946,0.0006344563,0.00041753924,0.00045533988],"domain_scores_gemma":[0.99879605,0.000023129955,0.000058803278,0.00084858004,0.00010503912,0.00016839652],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087259634,0.00021408369,0.00018492657,0.00053256744,0.00034955994,0.0014047913,0.0010078155,0.00007291495,0.0000048579777],"category_scores_gemma":[0.0000063766015,0.00022965179,0.000030917585,0.0012046158,0.000010058553,0.0011273305,0.0003182282,0.00013662683,0.000032174372],"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.00002461768,0.00045235426,0.000203106,0.00019993258,0.000028470025,0.000026650458,0.0038389848,0.5441981,0.0001404197,0.4479521,0.000076714445,0.0028585836],"study_design_scores_gemma":[0.0030178255,0.00019065483,0.10466683,0.00024344781,0.0001088496,0.00002017997,0.015073847,0.83966076,0.0056871655,0.0042938623,0.025025528,0.002011062],"about_ca_topic_score_codex":0.00093227,"about_ca_topic_score_gemma":0.0062836446,"teacher_disagreement_score":0.7154752,"about_ca_system_score_codex":0.00015801951,"about_ca_system_score_gemma":0.000022694998,"threshold_uncertainty_score":0.9996318},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077922526,0.000054066553,0.9588399,0.00012842154,0.00023867105,0.000076147866,0.000003175555,0.0004108369,0.03245651],"genre_scores_gemma":[0.8609951,9.906897e-7,0.13879086,0.00013563278,0.000044646546,0.0000014500673,0.0000017868184,0.0000025150018,0.000027018954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917,0.000013718821,0.00013834426,0.00024085821,0.00017275718,0.0002643225],"domain_scores_gemma":[0.9992534,0.00005833738,0.00002499868,0.00049878616,0.000043267337,0.00012123963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043696832,0.000074951226,0.00008088976,0.00008186308,0.000092531656,0.00010821829,0.0005224744,0.0000459211,0.000019327987],"category_scores_gemma":[0.000009496111,0.000061027615,0.00004909781,0.00046427708,0.000023672392,0.00036552138,0.0001762773,0.000077434845,0.00016776427],"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.0000025242207,0.00003381125,0.00053594203,0.00001593462,0.0000043537198,0.000025481884,0.000179264,9.063051e-7,0.0001502355,0.99284726,0.0016314462,0.004572866],"study_design_scores_gemma":[0.004933436,0.0005749718,0.049472183,0.00035942555,0.000052093335,0.0010310354,0.004215029,0.3876228,0.049553692,0.03490303,0.4642706,0.0030116874],"about_ca_topic_score_codex":0.000062234074,"about_ca_topic_score_gemma":0.00006226719,"teacher_disagreement_score":0.9579442,"about_ca_system_score_codex":0.000016335152,"about_ca_system_score_gemma":0.00001261234,"threshold_uncertainty_score":0.24886338},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03283612,0.00031818403,0.9241783,0.00074928295,0.00025437927,0.007825261,0.00016512927,0.00076607836,0.032907274],"genre_scores_gemma":[0.48232904,0.00005723811,0.50267005,0.0024842073,0.0007168935,0.009807949,0.00052369095,0.000047192265,0.0013637475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898976,0.000045742432,0.0001678662,0.00041072082,0.0001694126,0.00021648417],"domain_scores_gemma":[0.99925107,0.000051575214,0.00004434114,0.0005281461,0.000047313857,0.0000775811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013205205,0.00013683007,0.00013707632,0.0000819741,0.00009066245,0.00030039693,0.0004954924,0.00006927341,0.00018924012],"category_scores_gemma":[0.0000073721185,0.00010737201,0.000041593987,0.00038111155,0.000058001806,0.0005524569,0.00026579003,0.00011119179,0.000037789585],"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.000043883192,0.00048123946,0.01408864,0.000050610717,0.000032703538,0.000052735682,0.0011341473,0.0000013844236,0.002765085,0.7892407,0.14265878,0.049450073],"study_design_scores_gemma":[0.001338996,0.00017558191,0.042267054,0.00007001361,0.000008567502,0.000011289656,0.00007904646,0.009845629,0.0044954238,0.170113,0.7710127,0.00058269827],"about_ca_topic_score_codex":0.0033852558,"about_ca_topic_score_gemma":0.0011375132,"teacher_disagreement_score":0.6283539,"about_ca_system_score_codex":0.000009049416,"about_ca_system_score_gemma":0.000022479875,"threshold_uncertainty_score":0.5117517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005755933,0.00009221883,0.9268221,0.0006449005,0.00016799264,0.000045064022,0.0000010240318,0.00022891726,0.066241816],"genre_scores_gemma":[0.9644045,0.000009318081,0.03487684,0.00059450686,0.00004327524,8.8207037e-7,0.000004712909,0.0000010589629,0.00006491358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951756,0.000016438977,0.000085854386,0.00017733815,0.000078477045,0.00012432809],"domain_scores_gemma":[0.99953127,0.000017245256,0.000018809707,0.00035104764,0.00002821788,0.00005338825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095380914,0.00005624567,0.00005338294,0.00006382147,0.00006686821,0.0000995134,0.00040108405,0.000029372515,0.000037817284],"category_scores_gemma":[0.000010121312,0.000048354417,0.000040222076,0.00035826347,0.000009352447,0.0005561917,0.00004790501,0.0000486418,0.00014468886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.8073926e-7,0.00007303053,0.00027295825,8.83029e-7,0.0000012335954,8.1882575e-7,0.00026754077,0.0000013469198,0.00014265142,0.9172947,0.011264706,0.070679255],"study_design_scores_gemma":[0.0007487457,0.000293689,0.12959349,0.00001108669,0.000006849526,0.000016172931,0.000031820397,0.04423438,0.0054109534,0.6721001,0.14706294,0.0004897396],"about_ca_topic_score_codex":0.0000059916993,"about_ca_topic_score_gemma":0.0000076014494,"teacher_disagreement_score":0.95864856,"about_ca_system_score_codex":0.000007725877,"about_ca_system_score_gemma":0.0000146808625,"threshold_uncertainty_score":0.19718358},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37605762,0.00043894938,0.62117535,0.00039480662,0.0005800146,0.000094545205,0.000011021708,0.00019495521,0.0010527542],"genre_scores_gemma":[0.88551426,0.0000822008,0.11363052,0.0005579493,0.0001954582,0.0000074523537,0.0000047047024,0.0000039513957,0.0000035199423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921787,0.000035839108,0.00014179338,0.00019852017,0.0001036348,0.00030232847],"domain_scores_gemma":[0.99938583,0.00005162197,0.000042729156,0.00030309605,0.000024566767,0.00019215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001813731,0.000100344834,0.00011485451,0.00008136374,0.00024153867,0.00019950152,0.00020144857,0.000037798563,0.000044460936],"category_scores_gemma":[0.000015261574,0.0000862018,0.00004114426,0.00021817177,0.000060103055,0.001345535,0.00018812987,0.000086633794,0.000019982863],"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.0000058111204,0.000052667416,0.032811828,0.000014455767,0.000021499409,0.0000016004581,0.0006802888,1.6125476e-7,0.017209807,0.9341841,0.00068315835,0.014334665],"study_design_scores_gemma":[0.013313309,0.00033836014,0.2740977,0.00013013193,0.0002120568,0.0036669045,0.00221976,0.037791047,0.12285084,0.050415173,0.49024284,0.0047218786],"about_ca_topic_score_codex":0.000014183897,"about_ca_topic_score_gemma":0.0000018358746,"teacher_disagreement_score":0.88376886,"about_ca_system_score_codex":0.000006768579,"about_ca_system_score_gemma":0.000012324337,"threshold_uncertainty_score":0.35152075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020739648,0.00008080035,0.975305,0.00010133675,0.000190124,0.0005434502,0.00039101476,0.00012580134,0.0025227736],"genre_scores_gemma":[0.9541855,0.000010468036,0.045421783,0.000271645,0.0000130508515,0.000029986764,0.000057433645,0.0000066458174,0.0000034760067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852204,0.00003434627,0.00036976498,0.00047446613,0.00025519426,0.0003441716],"domain_scores_gemma":[0.9975465,0.00011972581,0.00016632672,0.001952187,0.00011325664,0.00010201154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047463202,0.00016015797,0.00024098555,0.00028662814,0.00010762937,0.00009514925,0.0037825105,0.000052722407,0.00008753541],"category_scores_gemma":[0.0000394006,0.0001305218,0.00012649503,0.00053208903,0.0001263286,0.00036412085,0.0010427936,0.00006271994,0.0000028999411],"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.00006691759,0.0003376731,0.0015222519,0.000059578666,0.00009727881,7.432569e-7,0.0013970571,0.0001078969,0.0003252039,0.991115,0.0005253362,0.004445075],"study_design_scores_gemma":[0.0030767843,0.00043610082,0.0209778,0.000037727044,0.000086327214,0.00000484575,0.00029145146,0.93993515,0.0016684984,0.029174872,0.0037481145,0.0005623359],"about_ca_topic_score_codex":0.00070814136,"about_ca_topic_score_gemma":0.00015320844,"teacher_disagreement_score":0.9619401,"about_ca_system_score_codex":0.000008058595,"about_ca_system_score_gemma":0.000039917373,"threshold_uncertainty_score":0.7028909},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009431102,0.000017232082,0.9888892,0.00051985565,0.0004964262,0.000090200694,0.000003929584,0.00010953897,0.00044249152],"genre_scores_gemma":[0.9567579,0.000015338912,0.0430298,0.00015054429,0.00001636117,0.000009364945,0.0000026317216,0.0000051127035,0.0000129333375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903005,0.00025913614,0.0002009329,0.00019057312,0.00018902689,0.00013027045],"domain_scores_gemma":[0.9980036,0.0011463925,0.000085541215,0.00065507094,0.000069455455,0.000039943017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007850204,0.00008459967,0.00009120652,0.00009574671,0.00040434304,0.00008159564,0.00082000886,0.00003303953,0.0000068054046],"category_scores_gemma":[0.000062636,0.00006472084,0.000086905326,0.00037486883,0.000101888545,0.00026329426,0.000017507979,0.00012485778,0.000016532875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143187835,0.00004060934,0.000007500276,0.0000055827422,0.000014957552,1.4032926e-7,0.00042430576,0.0017785605,0.00007422223,0.6757676,0.000016718055,0.3218555],"study_design_scores_gemma":[0.00024595697,0.00008060332,0.00090451865,0.00001697391,0.000009708676,0.0000029643752,0.000048651527,0.023610739,0.0038226077,0.9682961,0.0028636812,0.00009748904],"about_ca_topic_score_codex":0.0000031654508,"about_ca_topic_score_gemma":0.000002889037,"teacher_disagreement_score":0.94732684,"about_ca_system_score_codex":0.0000084640915,"about_ca_system_score_gemma":0.000015741665,"threshold_uncertainty_score":0.31099206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015622281,0.000025653328,0.98172754,0.000522364,0.00052891846,0.00018903942,0.00000934531,0.0007457885,0.00062906777],"genre_scores_gemma":[0.9142057,0.000013708677,0.08512212,0.0005275188,0.00005680039,0.000026436146,0.000012081398,0.000017094353,0.000018570205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823105,0.00038597162,0.00030305103,0.00049013254,0.0003215884,0.0002681835],"domain_scores_gemma":[0.99826914,0.00057857553,0.00011815576,0.0007978698,0.00011536965,0.00012091036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008248196,0.00020315195,0.00018458383,0.00034769153,0.00045312723,0.00019448496,0.0007953363,0.00009692578,0.000059493555],"category_scores_gemma":[0.00005688853,0.00020880562,0.00014239363,0.00061780075,0.0000967446,0.0007201112,0.000018638206,0.00029223668,0.0002032975],"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.00005524816,0.00023576804,0.00004314626,0.000025339908,0.00005271967,0.000002267733,0.000935436,0.012468134,0.0007682825,0.49187315,0.000074569616,0.49346593],"study_design_scores_gemma":[0.0009919468,0.00029437756,0.0037834872,0.00006133558,0.000035830068,0.00004136889,0.00010710798,0.12461695,0.0017961701,0.8658623,0.001939923,0.00046917013],"about_ca_topic_score_codex":0.000009049087,"about_ca_topic_score_gemma":0.000006798894,"teacher_disagreement_score":0.8985834,"about_ca_system_score_codex":0.000031787647,"about_ca_system_score_gemma":0.00004476734,"threshold_uncertainty_score":0.8514846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028852917,0.00032693765,0.9682701,0.00027081725,0.00025422123,0.000032659693,0.000001176938,0.000040456725,0.0019506965],"genre_scores_gemma":[0.51370776,0.000023029905,0.48521128,0.0006728341,0.0003678105,4.9920857e-7,0.000008189654,0.0000043345844,0.0000042801694],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987783,0.000012732799,0.0005404075,0.000065500244,0.00045382424,0.00014923236],"domain_scores_gemma":[0.99845535,0.000009983441,0.00073722977,0.00015500927,0.00044067056,0.00020178079],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00054277125,0.0000906263,0.00013344939,0.00031667785,0.00011246303,0.0016990006,0.0010329519,0.00004739216,0.000006532995],"category_scores_gemma":[0.000121751254,0.00007300764,0.000053263477,0.00048503163,0.000012997319,0.021302858,0.0002482106,0.00019593658,0.0000019964796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066753295,0.000016662872,0.0050696805,0.00017626221,0.000037488466,0.000010431554,0.012375486,0.0025751158,0.00014979683,0.21754563,0.015857251,0.74611944],"study_design_scores_gemma":[0.0046801628,0.00032680406,0.012853797,0.00082035497,0.000059151895,0.0016841793,0.0026535767,0.24659917,0.015710136,0.5235295,0.18997565,0.00110746],"about_ca_topic_score_codex":0.000019805377,"about_ca_topic_score_gemma":0.0000015317596,"teacher_disagreement_score":0.745012,"about_ca_system_score_codex":0.00004023102,"about_ca_system_score_gemma":0.00040367647,"threshold_uncertainty_score":0.9993373},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055541424,0.00019531357,0.9953642,0.00047663943,0.0014800921,0.0006974625,0.000056732573,0.00036939466,0.0008047425],"genre_scores_gemma":[0.19556431,0.0000793219,0.80085725,0.0021405406,0.000957093,0.00004214764,0.00010227411,0.00007856472,0.00017850974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99433345,0.0001054545,0.0006267053,0.002493931,0.0015529048,0.00088758086],"domain_scores_gemma":[0.99612933,0.0004689049,0.00045841598,0.0021276826,0.00048459342,0.0003310702],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011281689,0.00084371696,0.0006798835,0.001131919,0.00047123793,0.0013137552,0.0029816611,0.00056282553,0.00006149401],"category_scores_gemma":[0.00009667796,0.0007034454,0.00021425688,0.0011116819,0.0010517124,0.0017494934,0.0013254753,0.0014891197,0.000053597916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029840096,0.0006729395,0.009304882,0.0006958757,0.00022292683,0.0006229453,0.010939714,0.01672077,0.00042296405,0.5459024,0.0010164202,0.41317979],"study_design_scores_gemma":[0.0016668149,0.00095402333,0.0023378918,0.0013766977,0.000047818725,0.00038537933,0.0000011698392,0.7491096,0.0009704236,0.20673494,0.033518374,0.00289682],"about_ca_topic_score_codex":0.000073257506,"about_ca_topic_score_gemma":0.0006996134,"teacher_disagreement_score":0.73238885,"about_ca_system_score_codex":0.00022350541,"about_ca_system_score_gemma":0.00047639065,"threshold_uncertainty_score":0.99972296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016092476,0.0004934059,0.97464406,0.0013862279,0.0019217528,0.001954882,0.0022943066,0.00089276244,0.00032012802],"genre_scores_gemma":[0.013053516,0.00013394015,0.9822119,0.0009519325,0.00036848482,0.0006067133,0.002618683,0.000054855587,4.0483914e-9],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936772,0.0006165801,0.0011831198,0.0024875463,0.00062072737,0.001414823],"domain_scores_gemma":[0.9943289,0.000695689,0.0008412066,0.003284455,0.00031770096,0.0005320029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009076115,0.0010836173,0.0013110742,0.0011065844,0.0005864272,0.00068044435,0.0049143597,0.00085286354,0.000041805713],"category_scores_gemma":[0.00025588763,0.001157686,0.0013787857,0.00088228064,0.0006821167,0.0005481513,0.0031681408,0.0017006521,0.000065058375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011656442,0.0005136125,0.0024764393,0.00022197417,0.00028823593,0.00007386255,0.0004258475,0.0016511118,0.00032091615,0.9881742,0.0016383857,0.0040988727],"study_design_scores_gemma":[0.0012136996,0.00029493525,0.005406538,0.00012285872,0.00011548397,0.000021485755,0.0000148124,0.01044991,0.0022824616,0.9730087,0.005918885,0.001150234],"about_ca_topic_score_codex":0.00003560592,"about_ca_topic_score_gemma":0.00020257378,"teacher_disagreement_score":0.015165482,"about_ca_system_score_codex":0.00013326299,"about_ca_system_score_gemma":0.0006125773,"threshold_uncertainty_score":0.99908733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88910633,0.00002727525,0.0010853797,0.0002171066,0.0016401146,0.0005518475,0.0003697092,0.00078117714,0.10622107],"genre_scores_gemma":[0.93959403,0.000028677108,0.059419814,0.00076028175,0.00003217491,0.00004517259,0.000059364243,0.00001673311,0.000043757544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99751586,0.00010084982,0.0004686551,0.0005581897,0.000755756,0.0006006647],"domain_scores_gemma":[0.99781513,0.00009500066,0.00019796085,0.001410673,0.00016800372,0.0003132166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009726769,0.0003114852,0.00021488097,0.00038466416,0.0010210744,0.00041676612,0.0025487617,0.00018702306,0.00019877202],"category_scores_gemma":[0.0002267294,0.00032034004,0.00019028941,0.0008875631,0.00006548476,0.0073087527,0.002183273,0.00093033747,0.00048453241],"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.000011366473,0.00007542386,0.00009175356,0.000055312703,0.000035824538,0.000016275935,0.000022693195,0.00000244598,0.0028197665,0.7882773,0.000039163613,0.20855264],"study_design_scores_gemma":[0.0011178212,0.00008572173,0.008427073,0.000058073907,0.00003255686,0.00007230211,0.00009197684,0.002910054,0.009508938,0.21178441,0.7650542,0.0008568271],"about_ca_topic_score_codex":0.00008224287,"about_ca_topic_score_gemma":0.00009351349,"teacher_disagreement_score":0.76501507,"about_ca_system_score_codex":0.000077866,"about_ca_system_score_gemma":0.000014268327,"threshold_uncertainty_score":0.99992484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26217043,0.0010375308,0.7343675,0.00039435065,0.000278953,0.00093166815,0.00028580058,0.00050639844,0.000027384312],"genre_scores_gemma":[0.3840951,0.0002138351,0.61432815,0.0003850067,0.00012409216,0.00025712745,0.00055218954,0.000029066541,0.000015412195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966079,0.00036963195,0.00072830636,0.0011246387,0.00061051175,0.00055903353],"domain_scores_gemma":[0.9969386,0.00018245644,0.000634207,0.0016937413,0.00023807886,0.000312908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009383787,0.00049939845,0.0004534576,0.0005986589,0.00044047018,0.0009912584,0.0011134559,0.00044115123,0.000055800643],"category_scores_gemma":[0.0001853462,0.00055785384,0.00019348551,0.00037254617,0.00014006974,0.0018866068,0.0034983081,0.0009022431,0.000007482156],"study_design_candidate":"simulation_or_modeling","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.00009689167,0.0010606403,0.13979061,0.0009782147,0.0004688264,0.000052497413,0.0045545194,0.042284034,0.026503848,0.76306504,0.0023761096,0.018768754],"study_design_scores_gemma":[0.0004568974,0.000021752572,0.08876874,0.00019224659,0.000059504102,0.000035230205,0.00007945121,0.89339674,0.0014147911,0.014722971,0.00027178248,0.0005799123],"about_ca_topic_score_codex":0.063028395,"about_ca_topic_score_gemma":0.0029743232,"teacher_disagreement_score":0.85111266,"about_ca_system_score_codex":0.000266731,"about_ca_system_score_gemma":0.00026362567,"threshold_uncertainty_score":0.9996873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025166078,0.0005676548,0.9699473,0.00074430375,0.00027583956,0.00009160349,0.000018852921,0.00021077151,0.0029775985],"genre_scores_gemma":[0.93864614,0.000039319213,0.06059892,0.00057608046,0.000051697887,0.00000274981,0.000037819478,0.0000056568333,0.00004159019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919003,0.000035960868,0.00010843339,0.00035281782,0.00018542656,0.00012732715],"domain_scores_gemma":[0.9986702,0.000043041717,0.000032083226,0.0010773336,0.000046285375,0.00013104446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035497855,0.00007787418,0.000081955426,0.00006525145,0.00004308279,0.00021426368,0.00080586405,0.00003798885,0.00003361216],"category_scores_gemma":[0.000067383306,0.000063738735,0.000012516007,0.0003012082,0.000058026206,0.0013244583,0.0008616458,0.00008397437,0.00005433603],"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.000011238324,0.00015574819,0.009334232,0.00001668218,0.000028940933,0.000022420509,0.0010983127,0.0000037786886,0.00005186578,0.7690669,0.094992705,0.12521721],"study_design_scores_gemma":[0.0015986465,0.00019404237,0.020248633,0.000043156255,0.00002603571,0.0001291322,0.00019143465,0.6374455,0.00023307816,0.21221806,0.12704612,0.00062614656],"about_ca_topic_score_codex":0.00017450372,"about_ca_topic_score_gemma":0.000074071395,"teacher_disagreement_score":0.9134801,"about_ca_system_score_codex":0.0000068083846,"about_ca_system_score_gemma":0.00003844068,"threshold_uncertainty_score":0.25991902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005466269,0.00035544968,0.9933574,0.00032180778,0.0023747839,0.0014433376,0.00008179245,0.00024567614,0.0012731228],"genre_scores_gemma":[0.30467686,0.000031668005,0.69253635,0.002004073,0.000502081,0.000076329336,0.00008659923,0.00005025515,0.0000358058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514717,0.000048981936,0.0007089957,0.0020891782,0.001101193,0.00090449926],"domain_scores_gemma":[0.99638903,0.0009701634,0.00040299454,0.0013995691,0.0005438438,0.00029437002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010675314,0.0006696283,0.0006850018,0.0009577405,0.00047685188,0.00093239016,0.0029035318,0.00041089236,0.000012283875],"category_scores_gemma":[0.00016135092,0.00063449604,0.00029571494,0.00082748075,0.0006984493,0.00047877253,0.0011077747,0.00074201904,0.00006755459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074107365,0.00015288281,0.00003653832,0.00014598844,0.000024610092,0.000027601855,0.0008179181,0.10466192,0.00015920977,0.06470755,0.00018891685,0.82906944],"study_design_scores_gemma":[0.000560128,0.00015016807,0.00020252085,0.00021815777,0.000010984658,0.00002044233,1.6702393e-7,0.85650223,0.0002536756,0.13984571,0.0015397861,0.0006960263],"about_ca_topic_score_codex":0.000036884714,"about_ca_topic_score_gemma":0.00004881748,"teacher_disagreement_score":0.82837343,"about_ca_system_score_codex":0.0002859582,"about_ca_system_score_gemma":0.00046765135,"threshold_uncertainty_score":0.99961066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008042909,0.0004063329,0.974268,0.0011096435,0.0013445626,0.00035581982,0.000081378916,0.00094140915,0.013449942],"genre_scores_gemma":[0.8131846,0.000073675474,0.18391778,0.0013189896,0.0008364846,0.000057507026,0.00029141194,0.000048525053,0.00027101516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723774,0.00013171237,0.00039851025,0.00113449,0.000594248,0.0005032742],"domain_scores_gemma":[0.9969506,0.00014362972,0.00025825383,0.00208188,0.00025084097,0.000314784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009795344,0.00040740825,0.00040748809,0.00022101695,0.00016445408,0.00093672884,0.0031698672,0.00043501315,0.00006066683],"category_scores_gemma":[0.00010766918,0.00038019393,0.0002425917,0.0003722798,0.000086099644,0.00040993257,0.006831082,0.0010917253,0.000092731236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001782858,0.0003047058,0.0041676373,0.00062495354,0.0001912928,0.0001121853,0.008738283,0.0005863447,0.000092222625,0.7770424,0.17772175,0.030400427],"study_design_scores_gemma":[0.0012876004,0.0001230739,0.001462652,0.0006295854,0.00008774986,0.00012195478,0.0006999074,0.2692241,0.0010181296,0.39316487,0.32895923,0.003221132],"about_ca_topic_score_codex":0.00018002122,"about_ca_topic_score_gemma":0.000047510355,"teacher_disagreement_score":0.8051417,"about_ca_system_score_codex":0.000058328562,"about_ca_system_score_gemma":0.00028387824,"threshold_uncertainty_score":0.999865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04191119,0.000044881843,0.9423219,0.00048314926,0.00008157887,0.00016543275,0.0000036850336,0.00014237333,0.014845815],"genre_scores_gemma":[0.95769083,0.000012113221,0.04149818,0.0007267734,0.000039668143,0.0000030782562,0.000018011475,0.000002444962,0.0000088786555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999203,0.0000342396,0.00012985598,0.00031806526,0.00015833063,0.00015646272],"domain_scores_gemma":[0.9995113,0.00003199059,0.00004614289,0.00028182165,0.00006475983,0.00006398558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010645618,0.00010636189,0.000100365,0.00007836943,0.00009695522,0.00060241966,0.00025733263,0.000040125757,0.0000084959265],"category_scores_gemma":[0.000012725949,0.0000925991,0.000030419484,0.00028416576,0.000043201573,0.0025109267,0.000100869234,0.00011533565,0.0000081406115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014737511,0.00015082977,0.00012446994,0.0000057711964,0.000013261327,0.0000073378965,0.0006808805,0.000026866766,0.0017995569,0.90147954,0.00014596614,0.09555076],"study_design_scores_gemma":[0.0026723733,0.0010827879,0.036923446,0.00010893579,0.000034604833,0.0000429891,0.0013024746,0.42114523,0.012410095,0.51669127,0.0063175247,0.0012682846],"about_ca_topic_score_codex":0.000030954783,"about_ca_topic_score_gemma":0.00006193631,"teacher_disagreement_score":0.91577965,"about_ca_system_score_codex":0.000013405303,"about_ca_system_score_gemma":0.000044043638,"threshold_uncertainty_score":0.5809147},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2880448,0.00025160125,0.7094863,0.000015622152,0.0007222499,0.00026384497,0.00021713423,0.00061942823,0.00037900158],"genre_scores_gemma":[0.98601496,0.00008153897,0.01355107,0.000028561775,0.00014356768,9.174213e-7,0.00014405114,0.000022692995,0.000012630278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975028,0.00023376681,0.00024790727,0.0014039255,0.00019143785,0.0004201538],"domain_scores_gemma":[0.9966547,0.0000494933,0.0003433605,0.0023084143,0.00032056667,0.00032348954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055283774,0.00040026268,0.000407699,0.0004557077,0.00023680076,0.00025956353,0.002287841,0.000367641,0.000012486736],"category_scores_gemma":[0.000030947875,0.00047063536,0.0002378885,0.001067141,0.00013538427,0.0011149078,0.003730455,0.0007509173,0.000086396634],"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.000036242353,0.00012769543,0.0011095529,0.00048422656,0.000113134534,0.00083224714,0.00034072922,0.014697861,0.00015255612,0.9812054,0.0007901834,0.000110185865],"study_design_scores_gemma":[0.0006470789,0.00003882696,0.000085056476,0.00050121377,0.0001553819,0.000053209376,0.0003179997,0.9659149,0.00012520148,0.029552292,0.001837052,0.00077179266],"about_ca_topic_score_codex":0.0004051613,"about_ca_topic_score_gemma":0.00005133031,"teacher_disagreement_score":0.95165306,"about_ca_system_score_codex":0.00033852502,"about_ca_system_score_gemma":0.00044390204,"threshold_uncertainty_score":0.9997745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003266646,0.00017441635,0.9629616,0.004569996,0.002566127,0.0031418558,0.0019850824,0.00036904277,0.020965207],"genre_scores_gemma":[0.40691748,0.0017761543,0.5359886,0.00062283274,0.00243625,0.035143632,0.00053918123,0.00034863234,0.016227208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978445,0.00006914156,0.0005931676,0.00046388796,0.00039565904,0.0006336336],"domain_scores_gemma":[0.99516994,0.0026761324,0.0008268951,0.0009840598,0.00027653668,0.00006640966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029900584,0.00030082217,0.00046979677,0.00014365328,0.00031681862,0.0005760068,0.0014712638,0.00030532927,0.000017465447],"category_scores_gemma":[0.00084231416,0.00021145701,0.00035938632,0.00032545053,0.000071122384,0.00044227738,0.0006809898,0.00025907668,0.000013421157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016250628,0.000105803636,0.0019488945,0.00040503667,0.00018177794,1.875115e-7,0.0075248517,0.000007852016,0.0000057712646,0.98696226,0.002594256,0.00024706277],"study_design_scores_gemma":[0.00042041836,0.000028575818,0.0006013826,0.000099905024,0.000022196435,7.989986e-7,0.00064792915,0.0010048401,0.00007457485,0.9738478,0.022966264,0.00028532834],"about_ca_topic_score_codex":0.000005333794,"about_ca_topic_score_gemma":0.00003137277,"teacher_disagreement_score":0.42697302,"about_ca_system_score_codex":0.00035162005,"about_ca_system_score_gemma":0.00010184603,"threshold_uncertainty_score":0.86229664},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036056715,0.0006559172,0.45867193,0.000277089,0.0002843572,0.022422494,0.00022149821,0.00067986874,0.51318115],"genre_scores_gemma":[0.25519523,0.00017692127,0.64844793,0.001043465,0.0022558032,0.02464152,0.00042219379,0.0012716479,0.0665453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721104,0.00007657539,0.0005824281,0.0007473149,0.0008092557,0.00057341054],"domain_scores_gemma":[0.99730027,0.00039428487,0.00040590027,0.0015576021,0.00009355575,0.00024839368],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.001325558,0.00063493056,0.0007451276,0.0003246388,0.00017382244,0.00022878055,0.0012056939,0.0014902661,0.0003710569],"category_scores_gemma":[0.000034560024,0.00051026186,0.00016879797,0.00027045552,0.00017704765,0.00024713474,0.0003354697,0.0026501745,0.00004974568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048620495,0.0008538029,0.00015511751,0.0013130534,0.00008427473,0.00010037564,0.0033299702,0.00018170557,0.00003603879,0.98547375,0.0007250815,0.0076981946],"study_design_scores_gemma":[0.006169379,0.0016418626,0.0004796162,0.026498748,0.0003769711,0.0010353242,0.00052515476,0.0297971,0.005264878,0.59510356,0.3261503,0.006957125],"about_ca_topic_score_codex":0.000008999611,"about_ca_topic_score_gemma":0.00000922596,"teacher_disagreement_score":0.44663587,"about_ca_system_score_codex":0.00013188299,"about_ca_system_score_gemma":0.00021627787,"threshold_uncertainty_score":0.999806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47392207,0.000043723117,0.5249979,0.00006430335,0.0002038017,0.000055772947,0.0000011994434,0.00017162341,0.0005396024],"genre_scores_gemma":[0.8263651,0.0000013717814,0.17315044,0.00028657445,0.00018962662,4.5826388e-7,0.0000010436765,0.0000049322066,4.2043925e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795973,0.00037336888,0.00045565056,0.0004575292,0.000313871,0.0004398271],"domain_scores_gemma":[0.9974715,0.0007503068,0.00027286302,0.0011533306,0.00023607336,0.0001159025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028630022,0.00017092733,0.00027879144,0.00020380526,0.00038708028,0.000091591,0.002234714,0.000051838026,0.0000061116057],"category_scores_gemma":[0.00014770309,0.0001627168,0.0001327778,0.00094463385,0.0005979726,0.0007130589,0.0011419099,0.00014013522,0.0000056430335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003291906,0.000071436734,0.0014148251,0.000013785097,0.000019919325,0.0000025898275,0.009180604,0.000016341388,0.0026528533,0.90859306,0.000017141538,0.07798452],"study_design_scores_gemma":[0.0005937858,0.00043535288,0.032567292,0.00008126636,0.0000081396565,0.00003202088,0.00038440537,0.032680728,0.045492228,0.8873002,0.00014119159,0.00028340972],"about_ca_topic_score_codex":0.000016010576,"about_ca_topic_score_gemma":0.000004398711,"teacher_disagreement_score":0.35244307,"about_ca_system_score_codex":0.00000780298,"about_ca_system_score_gemma":0.000036904985,"threshold_uncertainty_score":0.6635398},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03205124,0.00081302616,0.9459915,0.0005212774,0.0026575902,0.0040891524,0.0032142533,0.0004625041,0.01019941],"genre_scores_gemma":[0.9113667,0.00014567023,0.08341916,0.0013268075,0.0003145268,0.0006812984,0.0025578926,0.000091722664,0.00009619303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99364316,0.00018610699,0.0022102143,0.00082346395,0.0015099067,0.0016271338],"domain_scores_gemma":[0.99444664,0.00032309073,0.0012387696,0.00314325,0.0005749766,0.0002732508],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036248595,0.0010215557,0.0012175555,0.0007780462,0.0005872214,0.0024433339,0.0064633456,0.00091317703,0.00001580131],"category_scores_gemma":[0.0002176769,0.00080500316,0.0008091473,0.0007893808,0.0002310788,0.0033060967,0.0036837307,0.0025325133,0.0000491328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001285893,0.001951065,0.0013552221,0.00464575,0.000723007,0.000065208864,0.0756811,0.19683437,0.000028498967,0.62696165,0.085035786,0.00543243],"study_design_scores_gemma":[0.0043772613,0.00013615904,0.00006513242,0.0004532152,0.000079137775,0.000029649635,0.0019040381,0.9056359,0.000045123088,0.062354725,0.023925805,0.0009938884],"about_ca_topic_score_codex":0.0001289927,"about_ca_topic_score_gemma":0.00014261862,"teacher_disagreement_score":0.8793155,"about_ca_system_score_codex":0.00023930891,"about_ca_system_score_gemma":0.0006022671,"threshold_uncertainty_score":0.9997687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013454073,0.00075634656,0.99570423,0.0004739038,0.0004334728,0.00043892092,0.0000052792307,0.00014961757,0.0006928185],"genre_scores_gemma":[0.6028166,0.00012760091,0.39649534,0.0002895994,0.00019084717,0.000012286363,0.000027254575,0.000017257964,0.000023239469],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972881,0.0000364354,0.0003631304,0.0011972538,0.00068953435,0.00042552667],"domain_scores_gemma":[0.99772686,0.0002251408,0.00034173718,0.0013005274,0.0002500334,0.00015571299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074625196,0.00035797345,0.00030015604,0.00059118215,0.00026594102,0.00048560396,0.0012981178,0.00020812116,0.000009584078],"category_scores_gemma":[0.00006818189,0.0003105984,0.000047935773,0.00062786735,0.000538632,0.0015013758,0.0006174213,0.00043649419,0.000014503218],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015007627,0.00004614586,0.00012503855,0.00007146613,0.0000108829045,0.0000074235554,0.004539253,0.00053192663,0.00066541624,0.09297696,0.000008330787,0.90100217],"study_design_scores_gemma":[0.0010458184,0.0007104805,0.00985025,0.0010844683,0.00007355934,0.0002812783,0.0000019562078,0.22875997,0.008678274,0.7446186,0.0027938404,0.0021015012],"about_ca_topic_score_codex":0.0000150886035,"about_ca_topic_score_gemma":0.000041042036,"teacher_disagreement_score":0.8989006,"about_ca_system_score_codex":0.00011632591,"about_ca_system_score_gemma":0.00022504244,"threshold_uncertainty_score":0.9999346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011810416,0.00015961613,0.9696844,0.0000625544,0.000101843514,0.00045287027,0.0011046105,0.000086687134,0.027166365],"genre_scores_gemma":[0.3311152,0.00019934725,0.66271275,0.0009080335,0.00036294383,0.000024455505,0.001979757,0.00010573856,0.0025917522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982513,0.000036659043,0.00065149623,0.0005241861,0.00031223678,0.00022412527],"domain_scores_gemma":[0.99730515,0.00048564016,0.00047210528,0.0014881699,0.000156903,0.00009200243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004208137,0.00029904526,0.0007794545,0.0005852764,0.00016798296,0.00008443517,0.0013224867,0.00018427598,0.00007583964],"category_scores_gemma":[0.0000054220413,0.00021560473,0.0006251269,0.00047969952,0.00019900572,0.00022226204,0.00034040396,0.0002078183,0.000001783457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009534367,0.00010909499,0.00006602731,0.000032497097,0.001029156,0.000053195523,0.00064833416,0.000097515825,0.0000016209643,0.42969355,0.00010749807,0.56815195],"study_design_scores_gemma":[0.00065636355,0.0006298436,0.0005190487,0.00014257731,0.0023694825,0.00013440661,0.000040095765,0.87293214,0.0002304385,0.108521365,0.012960858,0.0008633667],"about_ca_topic_score_codex":0.00044973995,"about_ca_topic_score_gemma":0.0006805462,"teacher_disagreement_score":0.8728346,"about_ca_system_score_codex":0.0000109543735,"about_ca_system_score_gemma":0.000033203112,"threshold_uncertainty_score":0.87921053},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014176208,0.00006737197,0.9954125,0.00014648533,0.00029635755,0.00044172956,0.00006508011,0.0002919718,0.0018608267],"genre_scores_gemma":[0.9972336,0.000005868545,0.0024661832,0.000073010895,0.00001637409,0.00010609283,0.00008150219,0.0000034222542,0.000013892321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990072,0.00004844363,0.00028410178,0.00016441812,0.00035630877,0.00013951735],"domain_scores_gemma":[0.9990206,0.000031332733,0.00014525806,0.00045141994,0.00020806534,0.00014336752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040008768,0.000115151306,0.0001145359,0.0002226413,0.00021234344,0.0004293532,0.00024411744,0.00007699657,0.0000010864959],"category_scores_gemma":[0.0000033190381,0.000092201044,0.000022888573,0.00055295316,0.000027727594,0.0024023743,0.0000048160564,0.00012762628,0.000088722525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010431861,0.00015365126,0.00006800364,0.00040732493,0.000052528947,0.0000010370296,0.0077922633,0.031590383,0.000080100326,0.9361232,0.0010114072,0.022615807],"study_design_scores_gemma":[0.0010504217,0.0001830993,0.00018978342,0.000099192854,0.000023366472,0.000097053744,0.0049725757,0.9394189,0.00016108001,0.000079898244,0.05345659,0.0002680548],"about_ca_topic_score_codex":0.00012892694,"about_ca_topic_score_gemma":0.000010613057,"teacher_disagreement_score":0.99581605,"about_ca_system_score_codex":0.00005635633,"about_ca_system_score_gemma":0.000055035605,"threshold_uncertainty_score":0.4140263},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07802316,0.00021821832,0.9106597,0.009533767,0.0013951677,0.00009462491,0.000011151722,0.00001396596,0.0000502787],"genre_scores_gemma":[0.9433931,0.00000405281,0.055681612,0.00065194,0.00025985495,0.0000015500099,9.369517e-7,0.0000030220006,0.0000039351157],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934196,0.000048941947,0.00017847876,0.00006816899,0.00025614907,0.00010630473],"domain_scores_gemma":[0.998499,0.00012006538,0.00023067194,0.000817195,0.00024838222,0.00008472279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512335,0.000049065875,0.00009044555,0.000059376867,0.00006247117,0.0000748842,0.002620029,0.00002956667,0.0000016557899],"category_scores_gemma":[0.0011168943,0.000030299925,0.00015860844,0.00022570549,0.000019583333,0.00037733917,0.00024699248,0.00010333202,0.0000030744116],"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.00020208636,0.00078115694,0.029579157,0.000082398474,0.00016917537,0.00003107044,0.002727402,0.0013608795,0.009369564,0.15897456,0.7295909,0.067131646],"study_design_scores_gemma":[0.0042039566,0.0008518373,0.03223532,0.00012214085,0.00006599839,0.00020246503,0.000099085395,0.00702972,0.01742309,0.76850474,0.16895984,0.00030181307],"about_ca_topic_score_codex":0.0000020622415,"about_ca_topic_score_gemma":0.0000018453519,"teacher_disagreement_score":0.8653699,"about_ca_system_score_codex":0.000029047702,"about_ca_system_score_gemma":0.0001391917,"threshold_uncertainty_score":0.4868709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06437904,0.00005354479,0.9336951,0.00054218573,0.00025568425,0.0003539631,0.000047883605,0.0000758874,0.0005967566],"genre_scores_gemma":[0.9992003,0.00001779621,0.00049909187,0.0001594904,0.0000348158,0.00004292891,0.000036208698,0.0000030599288,0.0000063309653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999012,0.000061733124,0.00039262223,0.00015734693,0.0002139995,0.00016231074],"domain_scores_gemma":[0.9993335,0.000062478844,0.0001494677,0.0002001648,0.00014396595,0.00011044626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005191355,0.00012226023,0.00015778243,0.000534634,0.00008201082,0.0006322313,0.00020502073,0.00005416126,0.0000014959561],"category_scores_gemma":[0.000024877252,0.00010082028,0.00002090294,0.00058676314,0.000033428394,0.0031382104,0.000013141031,0.00013551398,0.000006651172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012006478,0.00060268614,0.02058513,0.0012977899,0.00031680692,0.000011367589,0.07807243,0.18419692,0.0000831837,0.58433205,0.0019150918,0.1273859],"study_design_scores_gemma":[0.005458228,0.0004814136,0.0066409307,0.00050489965,0.000020592408,0.00012498266,0.0025301937,0.96572906,0.00035552678,0.00015916215,0.017531784,0.00046320062],"about_ca_topic_score_codex":0.0009884681,"about_ca_topic_score_gemma":0.00011270065,"teacher_disagreement_score":0.93482125,"about_ca_system_score_codex":0.000056090823,"about_ca_system_score_gemma":0.00005988374,"threshold_uncertainty_score":0.6096621},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78241473,0.0004252947,0.18319444,0.014888656,0.0005150986,0.00065765507,0.0000069626954,0.013804511,0.004092638],"genre_scores_gemma":[0.8490686,0.000056781628,0.1503679,0.0003725933,0.00003066203,0.00007980085,0.0000015722334,0.000014967216,0.000007136558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976604,0.000008653754,0.00033095205,0.0008347205,0.0005673296,0.00059797114],"domain_scores_gemma":[0.9983069,0.00008798388,0.0002058094,0.0009078324,0.0003718237,0.000119679455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006115472,0.00030152267,0.00026903785,0.00040925446,0.00017726264,0.00043089807,0.0040978254,0.00021517513,0.000001834827],"category_scores_gemma":[0.00211671,0.00026648326,0.00006327577,0.0021083625,0.00011274981,0.0016647797,0.002774641,0.00048885756,0.000121292745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003836792,0.00017372429,0.0021678577,0.000120152254,0.0000255842,0.000012140486,0.003100718,0.0000056277563,0.012196878,0.948724,0.0069767283,0.02645823],"study_design_scores_gemma":[0.00059215794,0.00042096674,0.00038465083,0.00025536574,0.000010297003,0.00004707377,0.0014230857,0.0049232733,0.41905862,0.52856153,0.043622985,0.000699954],"about_ca_topic_score_codex":0.000018712653,"about_ca_topic_score_gemma":0.0000045848037,"teacher_disagreement_score":0.42016244,"about_ca_system_score_codex":0.00007595603,"about_ca_system_score_gemma":0.00006852681,"threshold_uncertainty_score":0.9999787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14201002,0.00002776788,0.85500735,0.0007147301,0.00035861105,0.0003858169,0.00011652014,0.00028053694,0.0010986244],"genre_scores_gemma":[0.76967293,0.0000020850412,0.22713733,0.0027836328,0.00016977945,0.000047894682,0.0001452556,0.000013384335,0.000027691956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848723,0.00006793756,0.00017246595,0.0004840006,0.00041957616,0.0003687605],"domain_scores_gemma":[0.9984788,0.0001621928,0.00004447387,0.0008452174,0.00016098071,0.0003083649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969847,0.0001632843,0.00015734909,0.00018089844,0.0001159585,0.00023955091,0.0010482155,0.00006900416,0.000053816744],"category_scores_gemma":[0.000026224563,0.00014017527,0.0001047373,0.00054426584,0.00004244951,0.0004911734,0.00016505878,0.00012750785,0.000052305884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003116963,0.012601,0.0020168438,0.0012468752,0.00026844686,0.00023406891,0.012349523,0.0028128412,0.014172592,0.75763,0.13023032,0.06332051],"study_design_scores_gemma":[0.004750733,0.000918114,0.000046067988,0.00003961534,0.0000064304704,0.0000020482005,0.0001738449,0.96300066,0.011066174,0.0021158883,0.017578572,0.00030184665],"about_ca_topic_score_codex":0.00009389002,"about_ca_topic_score_gemma":0.000036452297,"teacher_disagreement_score":0.96018785,"about_ca_system_score_codex":0.000025740492,"about_ca_system_score_gemma":0.00012227352,"threshold_uncertainty_score":0.57161814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70442605,0.0021945797,0.18371788,0.077241905,0.0027216764,0.002100193,0.00019082293,0.004316439,0.02309047],"genre_scores_gemma":[0.8544756,0.0000699758,0.14400877,0.0010921836,0.00006152868,0.0001300962,0.000035008652,0.000028489447,0.00009829939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970613,0.000048912,0.00054604653,0.00095766824,0.00061137916,0.00077466446],"domain_scores_gemma":[0.9964556,0.000067742745,0.00036603736,0.00255476,0.0003257488,0.00023007383],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026653663,0.00047086412,0.00055334513,0.0011917809,0.00029757185,0.00019625129,0.0031867558,0.0007256161,0.0002148713],"category_scores_gemma":[0.00038392752,0.00044448717,0.00026268137,0.0026147943,0.00089285435,0.0017095729,0.0008078404,0.0007806366,0.00086140895],"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.000018631048,0.00047088906,0.0048472625,0.00010402135,0.00016723097,0.000119311226,0.0002596676,0.00004915601,0.0038717377,0.9368595,0.017834524,0.03539806],"study_design_scores_gemma":[0.0021220685,0.00068431126,0.0024633969,0.00023605766,0.000082621904,0.000114384544,0.00015439621,0.0036092226,0.049251072,0.18857868,0.7514943,0.0012095233],"about_ca_topic_score_codex":0.0003710797,"about_ca_topic_score_gemma":0.000114107,"teacher_disagreement_score":0.7482808,"about_ca_system_score_codex":0.00006846393,"about_ca_system_score_gemma":0.00032641023,"threshold_uncertainty_score":0.99991655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033691706,0.0003746558,0.9914152,0.000712575,0.000871057,0.00055152236,0.00010426502,0.0002736327,0.0053601954],"genre_scores_gemma":[0.10764728,0.000056213023,0.88724256,0.0035217786,0.00095390837,0.000051622454,0.00014990085,0.00008372485,0.00029299795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946024,0.000025815993,0.0005472615,0.0024854206,0.00143617,0.0009029251],"domain_scores_gemma":[0.9960082,0.0006567275,0.0003633947,0.0022026994,0.0004244407,0.00034450143],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005459565,0.00078266236,0.0006300009,0.00068714767,0.0004183212,0.0014336577,0.0056287837,0.00043069242,0.00053687237],"category_scores_gemma":[0.0000807447,0.00065601507,0.00018251242,0.000985941,0.00084319495,0.001806901,0.0023236268,0.0012373022,0.00012429917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005411199,0.0002308626,0.001236572,0.00044271132,0.00016492764,0.0009432933,0.0037920538,0.050607182,0.00018646895,0.7795075,0.0020923575,0.16074193],"study_design_scores_gemma":[0.0009565694,0.0005317203,0.0015937485,0.0016581031,0.00003118259,0.00037131133,0.000001138369,0.3093588,0.00031326033,0.67632926,0.006434974,0.0024199286],"about_ca_topic_score_codex":0.00005491373,"about_ca_topic_score_gemma":0.00032817473,"teacher_disagreement_score":0.25875163,"about_ca_system_score_codex":0.0001900273,"about_ca_system_score_gemma":0.0005486056,"threshold_uncertainty_score":0.99975127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021833414,0.00010276305,0.99404657,0.00041278862,0.00035686727,0.00009475253,0.00017435047,0.000022105227,0.0026064753],"genre_scores_gemma":[0.37987676,0.001985991,0.6162204,0.0010117615,0.00015595072,0.0000010389712,0.00073876325,0.000005167505,0.000004138874],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986688,0.000058784193,0.00062379957,0.000120098564,0.00042407372,0.000104483785],"domain_scores_gemma":[0.9976922,0.000048811427,0.0005630754,0.0015003162,0.000121637335,0.0000739271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001892315,0.00008548562,0.00016762833,0.000270446,0.00006361647,0.0002120815,0.0026946499,0.000025098332,0.000009254821],"category_scores_gemma":[0.00017316223,0.00006567953,0.000026182512,0.00024149251,0.000042353953,0.008005624,0.002516172,0.0000863023,0.0000048437537],"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.000053773416,0.00011535215,0.00033049233,0.00027399673,0.00015269955,0.0000030773092,0.0012093276,0.000053437816,0.000008133835,0.310766,0.048909564,0.63812417],"study_design_scores_gemma":[0.002701395,0.00031467428,0.01928184,0.00022036444,0.000112115624,0.000047998852,0.0011838827,0.21532708,0.0001518578,0.01549107,0.74485683,0.0003108805],"about_ca_topic_score_codex":0.000019048668,"about_ca_topic_score_gemma":0.0000021532821,"teacher_disagreement_score":0.6959473,"about_ca_system_score_codex":0.0000071170066,"about_ca_system_score_gemma":0.000024318302,"threshold_uncertainty_score":0.58038837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06394266,0.00004335316,0.9322001,0.0005629846,0.0007123887,0.00020532528,0.000015006436,0.00022211693,0.0020960914],"genre_scores_gemma":[0.24259275,0.000007846398,0.7550336,0.002094168,0.00015005605,0.000049963608,0.000048666592,0.000008137595,0.000014793778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992272,0.000016929764,0.00012582703,0.0002789034,0.0001585024,0.00019261944],"domain_scores_gemma":[0.9992263,0.000038447317,0.000043615684,0.0004117942,0.00014501356,0.00013488151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018084668,0.00010109864,0.0000999387,0.00006927751,0.00006622114,0.00011711654,0.00051539845,0.000048133476,0.000015741876],"category_scores_gemma":[0.000045328485,0.00008766407,0.0000481617,0.00037330194,0.000010041341,0.0009738222,0.0002104147,0.000064510896,0.000027496408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014594813,0.00008376264,0.00058573077,0.00010628144,0.000045353925,0.0000068413256,0.0040367036,0.00074065436,0.009075109,0.85443014,0.016263267,0.11448019],"study_design_scores_gemma":[0.002473464,0.0005347711,0.0034350448,0.00003410123,0.000018167613,0.00006630103,0.0005262805,0.050825577,0.010551,0.5794651,0.35139725,0.00067296624],"about_ca_topic_score_codex":0.00007015256,"about_ca_topic_score_gemma":0.00007614434,"teacher_disagreement_score":0.33513397,"about_ca_system_score_codex":0.000018397152,"about_ca_system_score_gemma":0.000049531107,"threshold_uncertainty_score":0.35748369},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109530315,0.00033562724,0.98007774,0.00045272257,0.00015679414,0.00017630857,0.000018893887,0.00012988284,0.007698971],"genre_scores_gemma":[0.96900237,0.000032668442,0.030048393,0.000729053,0.00012322262,0.00003949842,0.000013371018,0.0000024255473,0.0000090102185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995513,0.000021094054,0.00007288714,0.00012843017,0.0000601363,0.00016613223],"domain_scores_gemma":[0.9994502,0.00004659857,0.00001927939,0.00036016162,0.000011576623,0.00011219859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001323465,0.00006421966,0.000058047463,0.000032159627,0.000088857225,0.00006452125,0.0003062495,0.000025937237,0.00002526389],"category_scores_gemma":[0.0000023359512,0.000046929068,0.000024415724,0.00012044456,0.000032858432,0.00051295507,0.00022406416,0.000046139703,0.000036798767],"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.0000011627905,0.00011176801,0.0027755923,0.00000263508,0.000015097654,6.530098e-8,0.00056494883,3.027977e-8,0.00022642259,0.9707174,0.0027636096,0.022821277],"study_design_scores_gemma":[0.000530349,0.00003400434,0.016390648,0.0000027931164,0.000010225098,0.000018215382,0.00017258,0.00088060973,0.0032857987,0.065802,0.91256624,0.00030655623],"about_ca_topic_score_codex":0.000035381134,"about_ca_topic_score_gemma":0.0000065255294,"teacher_disagreement_score":0.9580493,"about_ca_system_score_codex":0.0000036316792,"about_ca_system_score_gemma":0.0000047979447,"threshold_uncertainty_score":0.19137119},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060089163,0.00027059377,0.9370512,0.00089664455,0.0010312856,0.00028070877,0.000024845733,0.000022885257,0.00033268752],"genre_scores_gemma":[0.29863447,0.000016632892,0.7010592,0.00006316578,0.00020809037,0.0000041296034,0.0000017588798,0.000010586607,0.0000019054905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665046,0.00032967393,0.0016993803,0.0004065701,0.00059568096,0.00031823793],"domain_scores_gemma":[0.9953213,0.00041693577,0.0018538495,0.0013045168,0.0009062568,0.00019718883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022184807,0.0002845469,0.0012211638,0.00030035333,0.000041475483,0.00006134636,0.002399079,0.000560845,0.00008890754],"category_scores_gemma":[0.002082991,0.00021424759,0.00058624544,0.00028185456,0.0003371816,0.00026276667,0.0018130715,0.0011308743,0.00001376258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005498419,0.007449652,0.002626715,0.0069883107,0.001025322,0.00024813233,0.004860306,0.00003206728,0.0017650415,0.9519231,0.014049364,0.0084821945],"study_design_scores_gemma":[0.00068086415,0.0006042341,0.0011646713,0.00034325029,0.000091920854,0.00031781182,0.000052097454,0.0065564024,0.004820596,0.98468536,0.00042627065,0.00025650373],"about_ca_topic_score_codex":0.000002041493,"about_ca_topic_score_gemma":0.0000023930716,"teacher_disagreement_score":0.23854531,"about_ca_system_score_codex":0.000046811645,"about_ca_system_score_gemma":0.00034374866,"threshold_uncertainty_score":0.8736763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011606021,0.000025328305,0.98575926,0.00040984098,0.0014959087,0.00019038813,0.00014797882,0.0002449431,0.00012033652],"genre_scores_gemma":[0.9202713,0.000020277834,0.079392575,0.00023222252,0.000029916962,0.000009772021,0.000029834953,0.00001106236,0.0000030650688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842566,0.00009896077,0.00032837057,0.0004838054,0.0004066822,0.0002565225],"domain_scores_gemma":[0.9982064,0.00011500368,0.00011455653,0.0012687228,0.00009775915,0.00019759315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037517922,0.00016069683,0.00019816721,0.00029976945,0.00011814416,0.00010223127,0.0013533736,0.00006691597,0.000029844732],"category_scores_gemma":[0.0000024655722,0.0001648491,0.00008121057,0.0008429846,0.000091915295,0.0010795562,0.000018747982,0.0001881741,0.00003703152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020321591,0.0018149418,0.00053193583,0.0001245557,0.00062307506,0.000063140986,0.008894189,0.0292716,0.0020128028,0.04532223,0.06430594,0.8468324],"study_design_scores_gemma":[0.009716361,0.0024182391,0.0014527654,0.00021901268,0.0002508123,0.00013324067,0.002961091,0.86837333,0.07750753,0.009447302,0.025530731,0.0019895523],"about_ca_topic_score_codex":0.00035379996,"about_ca_topic_score_gemma":0.000151122,"teacher_disagreement_score":0.90866524,"about_ca_system_score_codex":0.00004074266,"about_ca_system_score_gemma":0.00016184043,"threshold_uncertainty_score":0.67223513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030947082,0.00265278,0.5090064,0.41152507,0.0006560909,0.0005351013,0.00006027089,0.00040105442,0.04421617],"genre_scores_gemma":[0.79057723,0.00008144557,0.20920786,0.00011443278,0.0000041453222,0.0000064013034,0.0000030478086,0.0000016633494,0.000003785743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994565,0.00013971032,0.00014669313,0.00009688708,0.00008628163,0.00007387901],"domain_scores_gemma":[0.95098925,0.0001948504,0.000070457936,0.048682444,0.000041393025,0.00002161429],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0002640726,0.000043457003,0.000063791376,0.000031355845,0.00019121477,0.000025218298,0.057513688,0.000020399266,0.0000035111325],"category_scores_gemma":[0.0012331747,0.00003143145,0.0000733634,0.00035675752,0.00016265587,0.00015204547,0.011095201,0.00009655801,0.000012616316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.762494e-7,0.0000827402,0.001371715,0.000005551221,0.000006841495,6.8203847e-9,0.00054375886,0.000004824317,0.0010378147,0.9823889,0.006073149,0.00848393],"study_design_scores_gemma":[0.00009834464,0.00001205469,0.02454773,0.000016758137,0.000007940271,0.0000011596188,0.000012223435,0.0034414118,0.0028332844,0.8972592,0.07169763,0.000072312956],"about_ca_topic_score_codex":0.000029367162,"about_ca_topic_score_gemma":0.00003335762,"teacher_disagreement_score":0.75963014,"about_ca_system_score_codex":0.0000033255665,"about_ca_system_score_gemma":0.000012548936,"threshold_uncertainty_score":0.9969029},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017953631,0.0028597137,0.9070265,0.00019087653,0.001540771,0.00064661045,0.00019959339,0.0002596352,0.087274484],"genre_scores_gemma":[0.62236047,0.008716002,0.0713104,0.020129979,0.043928687,0.0023323593,0.007175165,0.0016552914,0.22239165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979891,0.000022695425,0.0003841358,0.00077044935,0.0003548922,0.0004787315],"domain_scores_gemma":[0.99766797,0.00024595295,0.00030912066,0.001244847,0.0002759826,0.00025612072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004152975,0.00042697965,0.000594747,0.00014207997,0.00015287429,0.00047298684,0.0025803002,0.0005943635,0.000044720906],"category_scores_gemma":[0.000009895748,0.00041237683,0.00032683174,0.00008502232,0.00010858306,0.00054014754,0.0005172937,0.0005038236,0.000024954472],"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.00003528829,0.000014980259,0.000009890053,0.000024661898,0.000075585966,0.000012271959,0.00002248435,0.00043590312,1.4257253e-7,0.86305195,0.09071923,0.045597605],"study_design_scores_gemma":[0.0010608375,0.00008392772,0.000013716552,0.0001284766,0.000057093574,0.0000086619,8.3407105e-7,0.14635791,8.669919e-7,0.22391988,0.6277719,0.00059589377],"about_ca_topic_score_codex":0.000011520097,"about_ca_topic_score_gemma":0.000053003543,"teacher_disagreement_score":0.8357161,"about_ca_system_score_codex":0.00004500282,"about_ca_system_score_gemma":0.00012305663,"threshold_uncertainty_score":0.9998328},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001783596,0.00012734633,0.052311774,0.000029771747,0.00060272095,0.000252181,0.00046934944,0.00047304243,0.94571596],"genre_scores_gemma":[0.000317999,0.00015824084,0.0018402898,0.00013468954,0.000119296186,2.4874322e-7,0.00019901722,0.000019259165,0.997211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878705,0.000014019635,0.00020048642,0.00040958208,0.00035425992,0.0002346299],"domain_scores_gemma":[0.99861616,0.000036498925,0.00016012818,0.00092026277,0.000115752344,0.00015118836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012111972,0.0002934378,0.00024115085,0.0003722953,0.00014992102,0.00030985495,0.0013169047,0.00031546672,0.0000024391475],"category_scores_gemma":[0.000006048974,0.00033809268,0.00023513808,0.000030388383,0.0001270986,0.0009380964,0.0013320633,0.00055459864,0.00013439494],"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.000025654988,0.000002602746,1.5962702e-7,0.00009972778,0.00006342905,0.00011552367,0.00007784868,4.6878137e-7,0.000004900882,0.970941,0.027379742,0.0012889515],"study_design_scores_gemma":[0.00019889553,0.00003603818,0.000004438718,0.000119293094,0.00006683025,0.00001737123,0.0000046494483,0.00046175468,0.00014677257,0.0011636248,0.99741644,0.0003638936],"about_ca_topic_score_codex":0.00002328637,"about_ca_topic_score_gemma":4.0367016e-7,"teacher_disagreement_score":0.9700367,"about_ca_system_score_codex":0.000104297666,"about_ca_system_score_gemma":0.00008397343,"threshold_uncertainty_score":0.99990714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031843663,0.00009681103,0.99312586,0.0016438498,0.000027066933,0.00081689534,0.00004821015,0.00053380674,0.0005231408],"genre_scores_gemma":[0.082646504,0.00001145194,0.91363394,0.002932839,0.00022355177,0.00039767564,0.000112281654,0.000018605077,0.000023123413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838805,0.000034299017,0.0002516047,0.0007303826,0.0002598567,0.00033579214],"domain_scores_gemma":[0.99848455,0.0000910848,0.000090497175,0.0010538462,0.00012438465,0.00015561505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012983372,0.00023289352,0.00018086476,0.000209404,0.00042890952,0.0001081438,0.0012947859,0.00013715563,0.000015185699],"category_scores_gemma":[0.0000012163837,0.00021945333,0.00016902763,0.000999917,0.00009406223,0.00028264284,0.000249265,0.000352386,0.00017793918],"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.000065803586,0.0044529685,0.008987013,0.00031497708,0.00015615541,0.000083578714,0.0037526551,0.0017767504,0.020974353,0.58670413,0.21815197,0.15457961],"study_design_scores_gemma":[0.00052294164,0.00008334922,0.0016261047,0.000021244114,0.000005474484,0.000032607106,0.0000041100284,0.09429187,0.0050661215,0.003398443,0.894566,0.00038172244],"about_ca_topic_score_codex":0.000006367494,"about_ca_topic_score_gemma":0.0000020593484,"teacher_disagreement_score":0.676414,"about_ca_system_score_codex":0.000029994671,"about_ca_system_score_gemma":0.00010638534,"threshold_uncertainty_score":0.89490473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002084705,0.00008387647,0.9946125,0.0009636633,0.000018821325,0.00040145224,0.00002329031,0.00046784634,0.0013438521],"genre_scores_gemma":[0.10873498,0.0000013773446,0.889464,0.0012638047,0.00024376898,0.00018903946,0.00007654836,0.000011993614,0.000014484848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987633,0.00002327996,0.00021003751,0.0005652124,0.0001726479,0.00026548377],"domain_scores_gemma":[0.99892294,0.00008620261,0.0000678455,0.00078629365,0.00006600888,0.000070682945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001282725,0.00016897646,0.00012207267,0.0001887266,0.00023368874,0.00020940673,0.0009472522,0.00008413794,0.000009600478],"category_scores_gemma":[4.3226973e-7,0.00016636733,0.00011350097,0.0007928358,0.00004323791,0.00020214815,0.00018972567,0.00022156285,0.00012238862],"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.000009189168,0.0011589369,0.001648311,0.00006636487,0.000019534535,0.000009034534,0.00013842962,0.0024078705,0.024927644,0.8411263,0.02462628,0.103862084],"study_design_scores_gemma":[0.00046573312,0.000035786008,0.0038496538,0.000022698274,0.000004901026,0.000006366012,0.0000020184812,0.16395636,0.0079535125,0.011777843,0.81158084,0.00034430064],"about_ca_topic_score_codex":0.00003140309,"about_ca_topic_score_gemma":0.000008462543,"teacher_disagreement_score":0.8293485,"about_ca_system_score_codex":0.000025658632,"about_ca_system_score_gemma":0.00003891822,"threshold_uncertainty_score":0.6784263},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22815305,0.00020753003,0.7682899,0.0000837714,0.000029833094,0.000046594465,0.0000037291195,0.000034218792,0.0031513614],"genre_scores_gemma":[0.936963,0.000012433446,0.06283134,0.00016939949,0.000009998594,5.215552e-7,0.0000036130434,0.0000010245191,0.000008670468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993771,0.0000028565519,0.0001348172,0.00019880824,0.00015542166,0.00013104365],"domain_scores_gemma":[0.9994836,0.000029664347,0.000041418636,0.00034982848,0.00003761351,0.00005789731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033863212,0.000058820835,0.00010585283,0.00020057574,0.00003336454,0.00003227,0.00026534614,0.000040316634,0.00003053939],"category_scores_gemma":[0.000004596842,0.00004617554,0.00007053504,0.0009855423,0.000031694606,0.00020634997,0.00018595619,0.000065767985,7.498641e-7],"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.0000135714545,0.00015938604,0.07976967,0.000029504816,0.0003956213,0.000009600617,0.0005608193,0.000002854319,0.05949221,0.7823441,0.00050158537,0.07672109],"study_design_scores_gemma":[0.0012113402,0.00046644488,0.47561625,0.000019072582,0.00029725366,0.000003673101,0.00041336755,0.027307969,0.45014405,0.03943816,0.004316621,0.00076580077],"about_ca_topic_score_codex":0.000061023788,"about_ca_topic_score_gemma":0.00014422547,"teacher_disagreement_score":0.7429059,"about_ca_system_score_codex":0.0000034805387,"about_ca_system_score_gemma":0.0000063494726,"threshold_uncertainty_score":0.18829839},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20905133,0.0003506096,0.78764766,0.0002749692,0.0003243068,0.0001389829,0.000003459312,0.00033122618,0.0018774405],"genre_scores_gemma":[0.82145894,0.00003374283,0.17807154,0.00024391185,0.00012784045,0.000017183967,0.000015334423,0.0000059361264,0.000025565454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988613,0.000092439506,0.0001993359,0.00026014645,0.00022277118,0.00036397262],"domain_scores_gemma":[0.9990763,0.000048095982,0.000061697676,0.000595024,0.000049497863,0.00016938779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047176093,0.00013093752,0.00016612188,0.00009203823,0.00013438657,0.00016153822,0.00054942863,0.00006472137,0.00014909127],"category_scores_gemma":[0.000020868396,0.00010334904,0.000089834,0.00035985847,0.0000472649,0.0013630429,0.00016331853,0.000091074,0.00020063146],"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.000063528016,0.00021910483,0.0148615455,0.000013350149,0.00002672882,0.0000012104164,0.0005987799,0.0000032562045,0.027421348,0.9403008,0.0034138595,0.013076495],"study_design_scores_gemma":[0.018131983,0.00021745409,0.077034235,0.00007448577,0.000097569944,0.00013578581,0.0004065124,0.10844486,0.32990557,0.08424148,0.37777716,0.0035329198],"about_ca_topic_score_codex":0.00006092916,"about_ca_topic_score_gemma":0.000009781583,"teacher_disagreement_score":0.8560593,"about_ca_system_score_codex":0.000011830799,"about_ca_system_score_gemma":0.00001615794,"threshold_uncertainty_score":0.42144516},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4372319,0.00040281756,0.54786396,0.0030609593,0.004297266,0.000534737,0.000031757558,0.0012914478,0.005285168],"genre_scores_gemma":[0.8657478,0.000008526926,0.13303578,0.00041802158,0.00060676096,0.000011205088,0.000030551128,0.000020785423,0.00012053188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975493,0.000050794253,0.0003902269,0.0008479266,0.000522157,0.00063958473],"domain_scores_gemma":[0.99751794,0.000121697136,0.00015765987,0.0016073475,0.00012780575,0.0004675491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044692928,0.0003127613,0.0002884137,0.00022471357,0.0003407057,0.0006382187,0.0021058077,0.0003461436,0.00030516466],"category_scores_gemma":[0.000098564204,0.0002917043,0.0002044376,0.0010313912,0.0000942298,0.0010674258,0.00048130317,0.0010474853,0.0003223693],"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.00007369547,0.00030086396,0.004867713,0.000037256534,0.00007448912,0.00009589805,0.0011975806,0.000011506073,0.12043235,0.78248304,0.03598852,0.05443707],"study_design_scores_gemma":[0.0035190382,0.00023778797,0.026576899,0.00008443395,0.00006048624,0.00014215054,0.00007593925,0.016430108,0.122564375,0.10528571,0.7227294,0.0022936692],"about_ca_topic_score_codex":0.00017758709,"about_ca_topic_score_gemma":0.0004999028,"teacher_disagreement_score":0.6867409,"about_ca_system_score_codex":0.000014171097,"about_ca_system_score_gemma":0.00017562316,"threshold_uncertainty_score":0.9999535},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18382715,0.00028525596,0.80829453,0.0062465873,0.0011729007,0.00010070791,0.000010291658,0.000032985223,0.000029561292],"genre_scores_gemma":[0.8095243,0.0012949351,0.18638115,0.002183972,0.0005964666,8.303055e-7,0.0000097841485,0.000008153693,4.3332685e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706405,0.000060765607,0.001326958,0.000095306445,0.0011322106,0.00032071615],"domain_scores_gemma":[0.9969591,0.000054245727,0.0016704,0.0002632319,0.0002713235,0.00078171276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025691434,0.00014554386,0.0003732139,0.00026966762,0.00070135924,0.00037671748,0.0008029374,0.000198055,0.00001539553],"category_scores_gemma":[0.00014801414,0.00011189764,0.000076725206,0.00022328802,0.00031625023,0.0016634541,0.00016087005,0.0005940357,0.0000047110275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002185774,0.0015605454,0.0066752285,0.0041648513,0.00043930282,0.00041816663,0.033274196,0.00009672561,0.0009175359,0.069785036,0.047772333,0.8346775],"study_design_scores_gemma":[0.0037805252,0.0012235424,0.009831077,0.0012743435,0.000025370253,0.0024481658,0.00050628674,0.95151573,0.000097048855,0.01188663,0.016984936,0.00042632097],"about_ca_topic_score_codex":0.000044228804,"about_ca_topic_score_gemma":0.000009470962,"teacher_disagreement_score":0.95141906,"about_ca_system_score_codex":0.00005295392,"about_ca_system_score_gemma":0.0007803108,"threshold_uncertainty_score":0.5394359},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035544464,0.0027062276,0.9853127,0.001001319,0.0037007285,0.0007640428,0.00012714292,0.00071035844,0.0053220475],"genre_scores_gemma":[0.39776513,0.0002553979,0.5981,0.0016726502,0.0018518815,0.000049272818,0.00012380067,0.00011420757,0.00006765218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99253416,0.00014821427,0.00096767925,0.002950216,0.0021774848,0.0012222618],"domain_scores_gemma":[0.9943623,0.0007664821,0.00024506781,0.0033023471,0.00064319454,0.00068058964],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021237766,0.000976155,0.0011509658,0.001466158,0.0004217743,0.0020216976,0.00718189,0.0006918598,0.00008362651],"category_scores_gemma":[0.000116609786,0.0008795719,0.00038196318,0.0015507811,0.0006785072,0.0020602178,0.0015655386,0.0013535352,0.00014951738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010082468,0.00046096437,0.00024684402,0.00019093641,0.00025190637,0.00047861744,0.010295266,0.0036236702,0.0004164677,0.5500344,0.001681713,0.43221837],"study_design_scores_gemma":[0.0033881045,0.00047575153,0.00010430819,0.0007740577,0.00007514208,0.00018102156,0.0000019304691,0.19190718,0.001187636,0.7253141,0.073777184,0.002813626],"about_ca_topic_score_codex":0.00019025593,"about_ca_topic_score_gemma":0.00044017183,"teacher_disagreement_score":0.42940477,"about_ca_system_score_codex":0.00038452444,"about_ca_system_score_gemma":0.0015627814,"threshold_uncertainty_score":0.9993655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01059831,0.0010678135,0.8930498,0.0012533485,0.0004603607,0.0007427988,0.000030249555,0.0007724249,0.09202494],"genre_scores_gemma":[0.6860765,0.00004893879,0.31313238,0.000555195,0.000057508278,0.000025565494,0.000009809996,0.000010683317,0.000083420695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984506,0.000099771394,0.00022864123,0.0004916713,0.0003092766,0.00042006487],"domain_scores_gemma":[0.9985617,0.00009018767,0.00008382763,0.001073116,0.00007558692,0.000115577226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004557908,0.00019707045,0.00015264144,0.00008337504,0.0002599047,0.00022119998,0.0016576655,0.00010389421,0.00018455413],"category_scores_gemma":[0.000022570764,0.00011938804,0.00012670712,0.00065115886,0.00013441016,0.000829657,0.0006141728,0.00039976495,0.00007568353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008481381,0.00006287527,0.0008217953,0.000014003096,0.000027383716,0.000012871168,0.0025150187,1.9806393e-7,0.0002068529,0.98986363,0.0021868665,0.0042800372],"study_design_scores_gemma":[0.0021526532,0.00063438126,0.023224397,0.0001973075,0.00008572319,0.00015047609,0.0034430262,0.04454436,0.010558576,0.8170879,0.09562256,0.0022986222],"about_ca_topic_score_codex":0.00015198086,"about_ca_topic_score_gemma":0.00011670676,"teacher_disagreement_score":0.67547816,"about_ca_system_score_codex":0.000011827967,"about_ca_system_score_gemma":0.000050523955,"threshold_uncertainty_score":0.4868503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028993234,0.00021120993,0.9242247,0.0005918322,0.00021236125,0.00021077161,0.000019852314,0.00018561512,0.045350425],"genre_scores_gemma":[0.9031876,0.000027787906,0.09667825,0.000073750285,0.000003971852,0.0000048706106,0.00000959396,0.0000015359085,0.000012679668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99937266,0.00010212782,0.00018268502,0.000118543656,0.00011732698,0.00010664237],"domain_scores_gemma":[0.99844366,0.00013984783,0.00008408076,0.0012005805,0.00009520266,0.00003660471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003341927,0.0000568067,0.000075686854,0.000030303478,0.00030592125,0.000034235345,0.0010947456,0.000023255034,0.000050037877],"category_scores_gemma":[0.000016408581,0.000037133057,0.000056766803,0.0002522959,0.00036508677,0.0002783156,0.00031995622,0.000082040206,0.000024751696],"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.0000113054075,0.00012510316,0.0021868171,0.0000026206367,0.000008827314,9.908338e-8,0.00076091825,4.3810576e-7,0.00015150182,0.9899907,0.0024046355,0.004357039],"study_design_scores_gemma":[0.0012938515,0.00022633083,0.50556743,0.000021723286,0.000020995516,0.000010094367,0.0009122089,0.051039424,0.0140928915,0.36869004,0.057705555,0.00041945072],"about_ca_topic_score_codex":0.0005298468,"about_ca_topic_score_gemma":0.000548135,"teacher_disagreement_score":0.8741943,"about_ca_system_score_codex":0.000004420114,"about_ca_system_score_gemma":0.000013686824,"threshold_uncertainty_score":0.23529299},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033388656,0.000117092495,0.94569194,0.008373205,0.003529808,0.001005656,0.0011875065,0.0008924993,0.0058136396],"genre_scores_gemma":[0.09144355,0.00006981788,0.8948423,0.0070806704,0.0008933582,0.00020276046,0.005374784,0.000092171955,5.5853343e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921775,0.00055475434,0.001128067,0.0037969297,0.0009377313,0.0014050204],"domain_scores_gemma":[0.9804455,0.0016988423,0.0008785289,0.016108967,0.00029601317,0.0005721383],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017871036,0.001070944,0.0012470898,0.00088387245,0.00045913146,0.00093598315,0.025464041,0.0008373735,0.00016631595],"category_scores_gemma":[0.0011252606,0.0010436347,0.00039544838,0.00070080324,0.00038733133,0.0010831691,0.05097663,0.003571174,0.0004883869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016352498,0.0003726203,0.001626437,0.00038793238,0.00020937691,0.000091325244,0.0012887251,0.0016669116,0.00005785359,0.9681309,0.02229734,0.0037070517],"study_design_scores_gemma":[0.0008769117,0.00011019325,0.003964103,0.00028463046,0.000053242828,0.000027525715,0.00003184022,0.16764091,0.00023936943,0.79030085,0.035498746,0.00097167474],"about_ca_topic_score_codex":0.0004050013,"about_ca_topic_score_gemma":0.00082724146,"teacher_disagreement_score":0.17783004,"about_ca_system_score_codex":0.000090193666,"about_ca_system_score_gemma":0.0007227382,"threshold_uncertainty_score":0.9992014},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05954093,0.00016838813,0.9333706,0.00060757005,0.0009082266,0.0007527257,0.000087007975,0.0006019495,0.0039626127],"genre_scores_gemma":[0.1571694,0.000076439144,0.8418033,0.00025983568,0.00013913708,0.00013625037,0.00037948147,0.000035738336,4.1891485e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600583,0.0004871048,0.00064941245,0.0017047129,0.00041286825,0.0007400605],"domain_scores_gemma":[0.9966558,0.00032150233,0.00061759306,0.0018841405,0.00021990052,0.00030102488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004260853,0.00065562647,0.00084664946,0.00055548694,0.00021712415,0.00023803966,0.0023994239,0.00046523006,0.0000771828],"category_scores_gemma":[0.000057178124,0.0005825297,0.000327237,0.0005501574,0.00061005366,0.00029231375,0.0039594932,0.0019297494,0.00017997691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026606803,0.00024015536,0.0068928646,0.00008642066,0.00025647765,0.00018919793,0.0046181586,0.00054648565,0.000024198836,0.9806398,0.0012690001,0.0049711517],"study_design_scores_gemma":[0.00088312867,0.00015847235,0.020831646,0.00014819737,0.00006493813,0.00008608328,0.000049543953,0.0046109837,0.0002066747,0.97093755,0.0012676645,0.00075511105],"about_ca_topic_score_codex":0.000116945455,"about_ca_topic_score_gemma":0.00021382722,"teacher_disagreement_score":0.09762847,"about_ca_system_score_codex":0.000041150906,"about_ca_system_score_gemma":0.00032801714,"threshold_uncertainty_score":0.99966264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10960911,0.00029391111,0.87743056,0.0026078874,0.00040644783,0.0009830343,0.000034000095,0.00085648097,0.0077785756],"genre_scores_gemma":[0.4455883,0.00007674489,0.55264145,0.001411033,0.00006152076,0.000049890503,0.00000697476,0.000016023987,0.00014803745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982758,0.000057701196,0.00026401712,0.0006636646,0.00028233443,0.00045644704],"domain_scores_gemma":[0.9983783,0.00021395549,0.000090843016,0.0008884118,0.00014884204,0.00027965842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022291606,0.00024868792,0.00026383853,0.00008182505,0.00016308024,0.00034951163,0.00066782255,0.00011164513,0.00020619843],"category_scores_gemma":[0.000050030787,0.00020220719,0.000041245123,0.00053726736,0.00012241576,0.001221288,0.00044175005,0.00022124036,0.000064302345],"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.0003088513,0.00519066,0.04356209,0.0006226982,0.0012246664,0.000108690576,0.008333794,0.00011900846,0.0127212955,0.5825916,0.06466909,0.28054756],"study_design_scores_gemma":[0.016302792,0.0047125174,0.40833995,0.00048694038,0.00025043022,0.0006282652,0.00054794375,0.18612894,0.009489939,0.07555024,0.29093048,0.006631558],"about_ca_topic_score_codex":0.0026304547,"about_ca_topic_score_gemma":0.00057793705,"teacher_disagreement_score":0.5070414,"about_ca_system_score_codex":0.000015314552,"about_ca_system_score_gemma":0.000056093555,"threshold_uncertainty_score":0.824577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022730784,0.00050191785,0.9614832,0.00038574688,0.00037493464,0.0020281451,0.00018136596,0.00027755473,0.012036367],"genre_scores_gemma":[0.18926023,0.00059441425,0.8069315,0.0002884567,0.00006829178,0.002504404,0.00032285496,0.000028925984,9.3251816e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962903,0.00033200745,0.0006583707,0.0017619618,0.0002931788,0.00066417066],"domain_scores_gemma":[0.9968637,0.00023789876,0.00031778275,0.0022526411,0.00008098659,0.0002469895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005569724,0.0005415723,0.00065845734,0.00072014163,0.0002108585,0.0001554021,0.0021047995,0.00041199807,0.00009310846],"category_scores_gemma":[0.000021770124,0.00055994204,0.0002285936,0.0004721544,0.0005043529,0.00017720966,0.0043987795,0.0012494555,0.000069561975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035125486,0.00037053236,0.006859096,0.00030777292,0.00008376834,0.0000472113,0.0031700772,0.0004451507,0.00001618391,0.979642,0.00031747358,0.008705622],"study_design_scores_gemma":[0.00057015073,0.00007526681,0.023452332,0.000120286146,0.00004194366,0.000006383408,0.00030172383,0.005453621,0.00019764237,0.96255547,0.006655233,0.0005699428],"about_ca_topic_score_codex":0.00033619034,"about_ca_topic_score_gemma":0.00061786233,"teacher_disagreement_score":0.16652945,"about_ca_system_score_codex":0.000073019335,"about_ca_system_score_gemma":0.00018207371,"threshold_uncertainty_score":0.9996852},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116663024,0.00006931783,0.86842257,0.0011820379,0.0013565955,0.001110156,0.0016048664,0.0005398065,0.009051614],"genre_scores_gemma":[0.9233751,0.00015073035,0.07412464,0.0014741954,0.00022789511,0.00015397015,0.00016899875,0.000042764885,0.0002816862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970231,0.000032702217,0.0009698511,0.00041762186,0.00055364356,0.0010030958],"domain_scores_gemma":[0.9971842,0.00027087424,0.00036543162,0.0015453863,0.00028239182,0.00035167474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065247883,0.000436375,0.00046540072,0.00032827927,0.0004327678,0.0005213923,0.0021673033,0.0002287728,0.00005070573],"category_scores_gemma":[0.000106458945,0.00030558606,0.0003454992,0.00048246433,0.0001947117,0.0035200368,0.0008391965,0.00025351532,0.00046300222],"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.00050847715,0.002375433,0.02426371,0.0015728495,0.0008920575,0.000058039328,0.02359949,0.00006889638,0.0030458733,0.5695245,0.22241282,0.15167782],"study_design_scores_gemma":[0.01013744,0.0008919029,0.0034128528,0.000681118,0.000079796184,0.00019647325,0.00081963703,0.029246496,0.009930702,0.021728413,0.9206794,0.0021957625],"about_ca_topic_score_codex":0.000020583462,"about_ca_topic_score_gemma":0.000021862961,"teacher_disagreement_score":0.8067121,"about_ca_system_score_codex":0.00007706209,"about_ca_system_score_gemma":0.00009868969,"threshold_uncertainty_score":0.9999396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26068318,0.0003180831,0.7365228,0.00017717778,0.00047562068,0.00034687537,0.00010354674,0.00010703862,0.0012656979],"genre_scores_gemma":[0.37725678,0.00012120275,0.62237483,0.000072490766,0.000059590766,0.000037270813,0.00006505554,0.000012693444,8.830783e-8],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974792,0.00028906713,0.00056418264,0.0010382556,0.00024077654,0.00038849673],"domain_scores_gemma":[0.99757665,0.00026875696,0.0004694717,0.0013804461,0.0001354989,0.00016914659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041143098,0.0003661928,0.0005860603,0.00039832588,0.00012329208,0.00003953362,0.0013037674,0.00035897174,0.00003160966],"category_scores_gemma":[0.00009868882,0.00035965184,0.00021812989,0.00019819483,0.00054478954,0.0000686497,0.0043646116,0.00093177415,0.000024943263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037755657,0.00015713941,0.0016516403,0.00015063064,0.00009423614,0.000019112242,0.0066541703,0.00039126797,0.00028961356,0.98702604,0.000090363545,0.0034380571],"study_design_scores_gemma":[0.00030681133,0.000093325405,0.0109750405,0.00009344944,0.00003790253,0.000040540803,0.000054616346,0.032495033,0.0017499579,0.9535046,0.0003067304,0.00034200153],"about_ca_topic_score_codex":0.00013012861,"about_ca_topic_score_gemma":0.00007878294,"teacher_disagreement_score":0.11657359,"about_ca_system_score_codex":0.000015723876,"about_ca_system_score_gemma":0.00015342225,"threshold_uncertainty_score":0.99988556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006765306,0.004672136,0.98509306,0.00031900065,0.004344104,0.0016191131,0.000045592635,0.00020159959,0.003698612],"genre_scores_gemma":[0.046060905,0.00010382873,0.9482283,0.00077892595,0.003001346,0.00017270115,0.00008798628,0.00013617147,0.0014298614],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957083,0.000051435683,0.00065056153,0.0019449048,0.00083900045,0.00080580614],"domain_scores_gemma":[0.99582076,0.00082047546,0.00043675196,0.0017210772,0.0007781321,0.0004227855],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014421237,0.0006559323,0.00072372623,0.0009061547,0.00024653986,0.0010795761,0.004348959,0.00039843048,0.000005766562],"category_scores_gemma":[0.00018970482,0.00058336445,0.0002054046,0.0008209842,0.00046126667,0.0014370427,0.0016733346,0.00084662356,0.000039970757],"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.000039196162,0.00015920807,0.000021639695,0.00042985685,0.00006392374,0.000031394346,0.006286728,0.016584026,0.000031033214,0.42096823,0.0035745064,0.55181026],"study_design_scores_gemma":[0.00056099374,0.000402775,0.0000057808325,0.0008359335,0.000018878032,0.000085586435,4.5553412e-7,0.36270565,0.0001632482,0.5702755,0.06416001,0.0007852199],"about_ca_topic_score_codex":0.000083299,"about_ca_topic_score_gemma":0.00015591267,"teacher_disagreement_score":0.55102503,"about_ca_system_score_codex":0.00035829117,"about_ca_system_score_gemma":0.001520475,"threshold_uncertainty_score":0.9999574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022345454,0.00009592219,0.97464526,0.000601805,0.0018225821,0.0003086471,0.000013862128,0.00011825698,0.000048186193],"genre_scores_gemma":[0.56307524,0.0000015702184,0.43598986,0.0007868854,0.00012639834,0.000012285658,0.0000058730407,0.0000018465796,3.1054576e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982551,0.00003241618,0.00027268176,0.00035079615,0.00040894188,0.00068009325],"domain_scores_gemma":[0.9986124,0.00024217599,0.00009901072,0.000753431,0.00012488622,0.0001680804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010239548,0.00016431307,0.00016230169,0.00032850413,0.00034043042,0.0005849807,0.0015084646,0.000060827206,0.0000046726454],"category_scores_gemma":[0.00015376577,0.00014102652,0.000078070494,0.0017138465,0.0003891175,0.005688289,0.0005831882,0.00016200275,0.000015909147],"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.000024108032,0.00027033017,0.009299791,0.000051701467,0.0000065742215,0.0000013975999,0.0059275315,0.0009397236,0.000172962,0.3525353,0.00010821485,0.6306623],"study_design_scores_gemma":[0.000735973,0.00022778299,0.03901602,0.00004869878,0.0000046847804,0.000039702416,0.0000020771765,0.635114,0.0033131244,0.31361622,0.0072868443,0.0005948877],"about_ca_topic_score_codex":0.00004403007,"about_ca_topic_score_gemma":0.000043411506,"teacher_disagreement_score":0.6341743,"about_ca_system_score_codex":0.0000649738,"about_ca_system_score_gemma":0.00010586571,"threshold_uncertainty_score":0.57508945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012857473,0.00048212396,0.9780603,0.0019524255,0.0057767634,0.00045756597,0.00003907292,0.00030655868,0.00006769855],"genre_scores_gemma":[0.72712374,0.000058658923,0.27195743,0.0003154711,0.00047776746,0.000026373811,0.000023990242,0.000015954785,6.210109e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442106,0.00017066493,0.0005267705,0.002715991,0.0011705408,0.000994991],"domain_scores_gemma":[0.9950661,0.00029273034,0.00051124574,0.0036916637,0.00018412442,0.00025411908],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019044939,0.00061472633,0.0005582066,0.000731872,0.00095107727,0.003004637,0.0071985493,0.0003861535,0.0000049026257],"category_scores_gemma":[0.00031242677,0.0005671033,0.00023122682,0.0009510305,0.00087103015,0.0013713602,0.006788014,0.0018935286,0.000015296975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029738643,0.0003057589,0.0017401911,0.0001900007,0.000037950835,0.000110447094,0.0050954535,0.086152345,0.0019085235,0.005258464,0.00056174956,0.8986094],"study_design_scores_gemma":[0.00035596438,0.00021065831,0.002048893,0.00095152436,0.000009780474,0.00006456725,0.0000010799679,0.8493553,0.011045868,0.13444972,0.00042413472,0.0010825032],"about_ca_topic_score_codex":0.00043329375,"about_ca_topic_score_gemma":0.000103047794,"teacher_disagreement_score":0.89752686,"about_ca_system_score_codex":0.0002803726,"about_ca_system_score_gemma":0.000440018,"threshold_uncertainty_score":0.999678},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19017717,0.00041364672,0.80042183,0.0031580657,0.0018496173,0.000999296,0.0007123926,0.0010306006,0.00123735],"genre_scores_gemma":[0.21339834,0.0004783325,0.7824112,0.00081773906,0.00053819397,0.00033342597,0.0019310471,0.00008871725,0.0000029818254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919642,0.0010402808,0.0013350451,0.0032962183,0.0008815749,0.0014826867],"domain_scores_gemma":[0.99231845,0.00086108193,0.00095717405,0.0046757837,0.00037139666,0.0008161399],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006490599,0.001149281,0.0013595606,0.0010024913,0.0004933143,0.0006911971,0.004984591,0.0010854026,0.0004034744],"category_scores_gemma":[0.00059286004,0.0011957603,0.0008669739,0.00078489253,0.00084006885,0.0008561672,0.0092568,0.0031229253,0.0010551425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001244185,0.0007594853,0.006568126,0.00015410194,0.00043182287,0.0004479541,0.0017586587,0.0015181759,0.00059776043,0.97760814,0.0017428236,0.008288519],"study_design_scores_gemma":[0.0014480577,0.00015406359,0.021914935,0.00024236453,0.00010083572,0.00006464587,0.00006123704,0.011521901,0.0013477155,0.95236874,0.009479538,0.001295966],"about_ca_topic_score_codex":0.0016064608,"about_ca_topic_score_gemma":0.0012640093,"teacher_disagreement_score":0.025239414,"about_ca_system_score_codex":0.00030357917,"about_ca_system_score_gemma":0.0013838791,"threshold_uncertainty_score":0.99972266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.467495,0.001111873,0.5224262,0.001980268,0.0015504896,0.00046011485,0.00036027134,0.0018899953,0.0027258082],"genre_scores_gemma":[0.79588246,0.000074212774,0.20383738,0.00008266844,0.000042149004,0.000033386495,0.000021017513,0.00002043366,0.0000062990975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972912,0.000045719058,0.00056684355,0.0009286093,0.0005693145,0.00059831113],"domain_scores_gemma":[0.9970134,0.000030676503,0.0003881003,0.0021738047,0.00023646781,0.00015754445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033884184,0.00039478214,0.0005373564,0.0010756868,0.00026444363,0.00006787165,0.002466648,0.0005425224,0.000087466855],"category_scores_gemma":[0.00016044985,0.00038404507,0.00022641539,0.0020617468,0.00088232564,0.0005416502,0.00085504836,0.0005616078,0.000110107765],"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.00012802186,0.0007714287,0.011221526,0.000057756482,0.00028146326,0.00023562768,0.0018715825,0.00009064266,0.0092495,0.9228632,0.0031351692,0.050094083],"study_design_scores_gemma":[0.0067377724,0.0021356363,0.03272213,0.00074685086,0.00037862934,0.000192517,0.00065921823,0.011477741,0.17721152,0.3288154,0.43541613,0.003506446],"about_ca_topic_score_codex":0.00022543258,"about_ca_topic_score_gemma":0.00015608277,"teacher_disagreement_score":0.5940478,"about_ca_system_score_codex":0.00008324962,"about_ca_system_score_gemma":0.00016375667,"threshold_uncertainty_score":0.9998611},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137543585,0.000013403665,0.97061133,0.0007842796,0.000019535431,0.0026276489,0.0000023102223,0.00011898792,0.012068115],"genre_scores_gemma":[0.9215798,0.000011262308,0.07687641,0.00064150547,0.000005164418,0.00086537685,0.000015396394,0.0000014414333,0.0000036465815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942845,0.00007577126,0.00018378031,0.00010296107,0.00010304214,0.00010600655],"domain_scores_gemma":[0.99918395,0.000059874466,0.000050454666,0.0006275111,0.000034065866,0.00004413643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005620415,0.00005794198,0.00007518649,0.00008873467,0.000075363525,0.00018787084,0.0004625761,0.000035582892,0.000008370649],"category_scores_gemma":[0.000043196243,0.000051522355,0.000015390719,0.00025502036,0.000038782768,0.0016228167,0.00024797005,0.00009088995,0.000024679754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002694587,0.00003001839,0.005046858,0.000010684917,9.930293e-7,6.239675e-8,0.00047862876,0.0000049709497,0.000009785676,0.92623496,0.0006644226,0.0675159],"study_design_scores_gemma":[0.0017917923,0.00015162164,0.21310388,0.000081645805,0.0000019748657,0.0000088110855,0.00007197696,0.14589417,0.0007814138,0.47245243,0.16525194,0.0004083377],"about_ca_topic_score_codex":0.00010597313,"about_ca_topic_score_gemma":0.00018125414,"teacher_disagreement_score":0.9078254,"about_ca_system_score_codex":0.0000064115493,"about_ca_system_score_gemma":0.000012049669,"threshold_uncertainty_score":0.21010207},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36104667,0.0001765509,0.6334644,0.0013086118,0.0007689618,0.0006506607,0.000060113278,0.00020504107,0.0023189576],"genre_scores_gemma":[0.3154096,0.000995526,0.68061054,0.0019578168,0.00036036025,0.00036117993,0.00025200268,0.000052340645,6.6121123e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530643,0.0013040749,0.00054426026,0.0017574904,0.00039745693,0.00069029216],"domain_scores_gemma":[0.99580085,0.0007992069,0.00038687163,0.0026216041,0.00010380715,0.00028766473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011163172,0.00063688454,0.0005745146,0.00036834084,0.00051318447,0.00038365272,0.0018910699,0.0004950127,0.00010401686],"category_scores_gemma":[0.00025217579,0.00050379935,0.00027777674,0.0002724597,0.00065938925,0.0003554402,0.0023172058,0.0019432139,0.00014738624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056211127,0.00017512345,0.0019082527,0.000043529115,0.00008830825,0.000023983353,0.0017536384,0.00006855007,0.0009858861,0.9891764,0.0009371381,0.004782987],"study_design_scores_gemma":[0.0003952784,0.00028228317,0.017257296,0.000088212495,0.000033236236,0.00008447172,0.00010068762,0.008977366,0.00062666734,0.9674201,0.004124715,0.00060968776],"about_ca_topic_score_codex":0.000054026485,"about_ca_topic_score_gemma":0.00012048248,"teacher_disagreement_score":0.04714609,"about_ca_system_score_codex":0.00006104449,"about_ca_system_score_gemma":0.00017300127,"threshold_uncertainty_score":0.9997414},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014935131,0.00004561169,0.95676583,0.0006275919,0.0012721134,0.031482175,0.00022177909,0.00084315,0.007248247],"genre_scores_gemma":[0.005734931,0.000018435743,0.9101332,0.00060159265,0.00021688553,0.08293184,0.00030085785,0.0000610896,0.000001200263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943736,0.00086565147,0.0009293497,0.0021866134,0.0005786124,0.0010661526],"domain_scores_gemma":[0.9944993,0.00030501818,0.0007404726,0.0038001246,0.00023180975,0.00042326003],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00092386163,0.00081847503,0.00094353146,0.000884257,0.00031016584,0.0003753693,0.0055396846,0.0006811055,0.00058216066],"category_scores_gemma":[0.00017583228,0.00082556927,0.0006566613,0.00052774086,0.0008075627,0.00052671775,0.008479163,0.0020878795,0.0007553566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011547484,0.00056839327,0.0013742115,0.00049037515,0.00016432063,0.00017069039,0.0033392634,0.00001778306,0.0001513899,0.9885595,0.0016416507,0.0034069808],"study_design_scores_gemma":[0.0009633108,0.00013742398,0.005820801,0.00017146535,0.000055402983,0.000028656299,0.00001850738,0.004370368,0.0011104373,0.97044295,0.01604607,0.00083460344],"about_ca_topic_score_codex":0.000250983,"about_ca_topic_score_gemma":0.00043292364,"teacher_disagreement_score":0.051449668,"about_ca_system_score_codex":0.000071266295,"about_ca_system_score_gemma":0.00052333734,"threshold_uncertainty_score":0.9998408},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04387192,0.00011955525,0.9548003,0.00029189422,0.00032377307,0.00013649158,0.00012612679,0.00029327517,0.000036676927],"genre_scores_gemma":[0.9702815,0.0000074683107,0.029329669,0.00012636573,0.000069454465,0.000003008991,0.00017506401,0.0000069672114,5.114977e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982815,0.00013183919,0.00035151714,0.00049557775,0.00018405527,0.00055550964],"domain_scores_gemma":[0.9990442,0.00022958181,0.0001343539,0.00040242338,0.000079807156,0.000109624474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005037061,0.00017470987,0.0002001437,0.000115776355,0.00017210278,0.00013484564,0.0006627989,0.00010429951,0.000007115772],"category_scores_gemma":[0.000056862864,0.00013827208,0.00008373925,0.0009502076,0.000035337,0.000420818,0.00033869874,0.00018998163,0.00001857906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048127604,0.0014752146,0.30867952,0.0000611869,0.000086143846,0.00023323117,0.0018583976,0.03485807,0.0007228006,0.37595004,0.0066275755,0.2693997],"study_design_scores_gemma":[0.0013972712,0.000025187755,0.08621931,0.00009203745,0.0000026685173,0.000007935441,0.000030065112,0.90894467,0.00009119186,0.0017659172,0.0011728775,0.00025085916],"about_ca_topic_score_codex":0.000015774935,"about_ca_topic_score_gemma":0.000038748953,"teacher_disagreement_score":0.92640954,"about_ca_system_score_codex":0.000058222104,"about_ca_system_score_gemma":0.000027608652,"threshold_uncertainty_score":0.5638572},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08807197,0.00024050924,0.8998316,0.0024001077,0.0029188944,0.00072994473,0.00038015467,0.00058252685,0.0048443205],"genre_scores_gemma":[0.13013785,0.00012650226,0.86568457,0.0015159299,0.0013912795,0.000087772205,0.00097505096,0.00007817669,0.0000028989557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940199,0.00049629796,0.0008750672,0.0027119461,0.0007419308,0.0011548351],"domain_scores_gemma":[0.9942357,0.00030714256,0.0005239383,0.0034196973,0.00017511021,0.0013384427],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.00055051333,0.00086530176,0.0010790456,0.00074271037,0.00025961906,0.0010191349,0.009033997,0.0008062059,0.00039018568],"category_scores_gemma":[0.00048373808,0.00087285263,0.0005214538,0.000454404,0.0005939729,0.0006680752,0.030257858,0.0036591678,0.00018757282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000124589,0.000081789214,0.0031646623,0.00008863204,0.0002520383,0.00031411508,0.0033408378,0.0005599327,0.00022439614,0.98086125,0.0063339695,0.004653797],"study_design_scores_gemma":[0.0007364281,0.00009568612,0.0022934533,0.00010403747,0.000057081008,0.00031533014,0.000022389511,0.007653381,0.00043993845,0.9804946,0.006931659,0.00085601024],"about_ca_topic_score_codex":0.000945304,"about_ca_topic_score_gemma":0.00071079284,"teacher_disagreement_score":0.04206587,"about_ca_system_score_codex":0.00012654929,"about_ca_system_score_gemma":0.0022469738,"threshold_uncertainty_score":0.99937224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028139405,0.00025753563,0.9534226,0.006283413,0.002462943,0.0015362654,0.0002575194,0.00064831553,0.0069920104],"genre_scores_gemma":[0.12311304,0.00014901235,0.87382585,0.0014917925,0.0003869323,0.00073505496,0.00023395897,0.00005875169,0.000005597471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944178,0.00060954853,0.00067918544,0.0024591389,0.0005585951,0.0012757605],"domain_scores_gemma":[0.99363315,0.0006137158,0.00044462772,0.004318409,0.00026554085,0.00072452636],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.00044784532,0.00086344994,0.0011945502,0.0007637542,0.0002885442,0.0009843647,0.006291837,0.0005932022,0.00014171927],"category_scores_gemma":[0.00024466595,0.0008761941,0.0005212736,0.00045293328,0.0004254957,0.00045035238,0.013546551,0.0020923465,0.00077939505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015569818,0.00018606527,0.0010671935,0.00012746008,0.00019997104,0.00009360367,0.0024552548,0.00026281938,0.000956188,0.972994,0.011092762,0.010549111],"study_design_scores_gemma":[0.00044929783,0.00010522335,0.008653664,0.00012942197,0.000037228343,0.00006441697,0.00007290495,0.004020838,0.0008784106,0.9528,0.031784408,0.0010041989],"about_ca_topic_score_codex":0.00022111041,"about_ca_topic_score_gemma":0.00016037906,"teacher_disagreement_score":0.09497364,"about_ca_system_score_codex":0.00007705317,"about_ca_system_score_gemma":0.00026468295,"threshold_uncertainty_score":0.9999986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81846046,0.00040337956,0.17250523,0.0014239508,0.00042938392,0.0008525998,0.000010052876,0.0055265524,0.00038840657],"genre_scores_gemma":[0.8699218,0.00002435811,0.12947945,0.00009160841,0.00003470396,0.00042118,0.0000028152322,0.00001608772,0.000008020236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979184,0.000005073645,0.00033747955,0.0007698859,0.0004089775,0.0005601366],"domain_scores_gemma":[0.99856406,0.00011833769,0.00019840033,0.00066100154,0.00036879446,0.000089422305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007133971,0.0002819993,0.00029603142,0.00040522465,0.00021319852,0.00029997333,0.0023551271,0.00020336175,0.0000012365036],"category_scores_gemma":[0.0015128293,0.0002459915,0.00012031574,0.001050994,0.00012090216,0.00041436794,0.0012575424,0.00026416255,0.00003400755],"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.00015505902,0.0007480552,0.0011861064,0.00036795254,0.00006828481,0.000006898856,0.006878321,0.00023696701,0.027085833,0.87314117,0.016476331,0.073649],"study_design_scores_gemma":[0.0010639838,0.0011124249,0.00008991148,0.00016838044,0.000015948886,0.000019270143,0.0035858855,0.01822933,0.71712905,0.2377819,0.020123485,0.0006804135],"about_ca_topic_score_codex":0.000008261208,"about_ca_topic_score_gemma":0.0000019370893,"teacher_disagreement_score":0.6900432,"about_ca_system_score_codex":0.000093520095,"about_ca_system_score_gemma":0.00006404189,"threshold_uncertainty_score":0.9999992},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06446802,0.0000032673936,0.9323178,0.001081904,0.00039219865,0.00019055018,0.00007749574,0.00017900048,0.0012897716],"genre_scores_gemma":[0.992377,0.000029916453,0.0070699984,0.00047039468,0.000023131262,0.000009185895,0.000010265294,0.0000051454194,0.0000049835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998808,0.00004556674,0.0003678353,0.00021088264,0.0003364371,0.00023124482],"domain_scores_gemma":[0.9989456,0.00015386945,0.00014301823,0.0005101177,0.00011766486,0.00012975113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029255814,0.00016824219,0.00013846399,0.00021829392,0.00039057242,0.00021735857,0.0002934768,0.000101189486,0.000023891542],"category_scores_gemma":[0.000027356944,0.00012927079,0.00009932774,0.00030104246,0.00006123038,0.0028835072,0.000012956997,0.0001821728,0.00004324512],"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.00020444629,0.00020189649,0.00028926998,0.00013496392,0.000110536195,0.0000034443165,0.02880591,0.0027699713,0.00047209096,0.42365852,0.0034211208,0.53992784],"study_design_scores_gemma":[0.0085259145,0.0012963532,0.00528109,0.00082701084,0.00009588326,0.00009330405,0.0013663985,0.5921584,0.053439595,0.27696168,0.057352018,0.0026023951],"about_ca_topic_score_codex":0.0000686055,"about_ca_topic_score_gemma":0.00003361626,"teacher_disagreement_score":0.92790896,"about_ca_system_score_codex":0.000048307455,"about_ca_system_score_gemma":0.0000237897,"threshold_uncertainty_score":0.5271509},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16264208,0.00002731291,0.8364439,0.00012600976,0.00005443315,0.000193581,0.000020949119,0.000055777444,0.00043595082],"genre_scores_gemma":[0.91968614,0.0000061758437,0.08015311,0.00007367996,0.0000046800046,0.000025332834,0.000028262477,0.000005544633,0.000017104501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989463,0.00002580034,0.000282094,0.00028560782,0.00032342304,0.00013676075],"domain_scores_gemma":[0.9991618,0.000032409298,0.00007495467,0.00041069448,0.00024077784,0.00007935552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023955085,0.00009274262,0.00013760722,0.00009771492,0.000077869554,0.00005692374,0.00019939663,0.000023556055,0.0000036474764],"category_scores_gemma":[0.000026093321,0.00008459758,0.000033195534,0.0008580898,0.000060946753,0.0003465557,0.000029188484,0.00004534519,0.0000033660665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044274857,0.00016677426,0.0075776246,0.000041626503,0.000026661683,0.00012521111,0.001591141,0.007270025,0.00036471282,0.9809802,0.00038938088,0.0014223695],"study_design_scores_gemma":[0.0019782097,0.002037406,0.18832786,0.000092187525,0.00007321366,0.0072207903,0.0006098399,0.02248902,0.028883798,0.52132434,0.22497979,0.001983549],"about_ca_topic_score_codex":0.000054671076,"about_ca_topic_score_gemma":0.000066540866,"teacher_disagreement_score":0.757044,"about_ca_system_score_codex":0.000010861231,"about_ca_system_score_gemma":0.00014845644,"threshold_uncertainty_score":0.34497893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037159382,0.000008503311,0.97588706,0.0039566588,0.00008979598,0.000013200166,0.0000013169686,0.00010925617,0.016218249],"genre_scores_gemma":[0.93905306,0.000006188054,0.05903428,0.0017152042,0.000034014163,0.0000020002472,2.2563286e-7,0.000001205653,0.00015381831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997178,0.000006033112,0.00003502039,0.00010899226,0.00005398512,0.00007816858],"domain_scores_gemma":[0.9996384,0.000024982492,0.0000059270446,0.000292661,0.00000849687,0.000029582387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000454117,0.000025283278,0.000022468574,0.000022518763,0.00001824007,0.000029266792,0.00032550778,0.000010342926,0.00027940085],"category_scores_gemma":[0.0000040310206,0.00001259523,0.000019941537,0.000078732155,0.00001271386,0.0003821126,0.000107034415,0.000009898265,0.00041368825],"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":[2.677881e-7,0.000007069012,0.0019960634,3.051236e-7,0.0000010764123,0.0000012109404,0.000018471319,2.5351594e-9,0.0006849369,0.91555285,0.018010406,0.06372736],"study_design_scores_gemma":[0.00047452367,0.00004806183,0.032806493,0.000012006752,0.0000012535721,0.000013263022,0.00000439406,0.00019543576,0.019776484,0.33816928,0.6082474,0.0002514108],"about_ca_topic_score_codex":0.0000035287503,"about_ca_topic_score_gemma":0.0000030510644,"teacher_disagreement_score":0.9353371,"about_ca_system_score_codex":0.0000017932215,"about_ca_system_score_gemma":0.0000037725376,"threshold_uncertainty_score":0.53172636},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071986124,0.00046746398,0.912453,0.014063206,0.00020060386,0.00037113385,0.0000067274464,0.00003377271,0.00041795874],"genre_scores_gemma":[0.99915165,0.00005218356,0.00021103825,0.00054875907,0.000017634731,0.000014948122,3.9676948e-7,7.767303e-7,0.000002598164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993568,0.00015111241,0.00014372663,0.0001445323,0.00008883275,0.00011501422],"domain_scores_gemma":[0.99947506,0.00017576359,0.00003775065,0.0002784331,0.000008916929,0.000024052575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008696523,0.000037158843,0.00006499843,0.00006991871,0.000027783395,0.00013627748,0.0004919127,0.0000170544,0.0000023144592],"category_scores_gemma":[0.000017793289,0.000017887725,0.000008381529,0.00023211616,0.000022017843,0.0004258526,0.000056452354,0.000034527642,0.000003373743],"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.0000026500652,0.00003072741,0.01675093,0.000013445929,9.3865015e-7,7.767208e-7,0.0007439216,5.77785e-7,0.000030731917,0.9731967,0.0003728923,0.008855749],"study_design_scores_gemma":[0.0030776162,0.00011378588,0.83897704,0.00020057145,0.0000021346218,0.000019168332,0.00038275946,0.042610966,0.000027449663,0.09314536,0.021194324,0.00024881115],"about_ca_topic_score_codex":0.0007623457,"about_ca_topic_score_gemma":0.0004038123,"teacher_disagreement_score":0.92716557,"about_ca_system_score_codex":0.000009966962,"about_ca_system_score_gemma":0.000018462968,"threshold_uncertainty_score":0.13141268},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11592777,0.0000067749893,0.8815681,0.00014992425,0.000095590476,0.0004340012,0.000020209369,0.00032305915,0.0014745744],"genre_scores_gemma":[0.5002042,0.0000048716865,0.49964085,0.000035175053,0.000053581305,0.000039913222,0.000003449885,0.000015581867,0.0000023719408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852556,0.000028157066,0.00030562427,0.0004732384,0.00035670193,0.00031070333],"domain_scores_gemma":[0.99755424,0.0000955925,0.000169686,0.002000653,0.000046875593,0.00013292658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004502028,0.00020884491,0.00019970068,0.0001552714,0.00018147656,0.000114723916,0.0011186646,0.00010224598,0.000012651607],"category_scores_gemma":[0.000040871833,0.00014460737,0.000068954054,0.00040566514,0.00009255125,0.00022154607,0.00024947285,0.000118927404,0.0000419493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011900942,0.00024191891,0.0000018200585,0.000031829946,0.000010685479,0.0000027622225,0.0009072581,0.00013522133,0.1551238,0.8418904,0.00008473008,0.0015576767],"study_design_scores_gemma":[0.0009714976,0.00027710147,0.00007052292,0.00038065464,0.00007430834,0.00010883551,0.00040839668,0.06640412,0.38698396,0.54224056,0.001027104,0.0010529656],"about_ca_topic_score_codex":0.0000028853285,"about_ca_topic_score_gemma":6.821322e-7,"teacher_disagreement_score":0.38427642,"about_ca_system_score_codex":0.000047831418,"about_ca_system_score_gemma":0.000031442793,"threshold_uncertainty_score":0.58969176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011081938,0.00018580136,0.92648125,0.0016784322,0.00025491067,0.00006601836,0.000007130663,0.00020467251,0.07001362],"genre_scores_gemma":[0.7769211,0.000044756005,0.22136682,0.0009923077,0.00022674726,0.0000017463201,0.000016504664,0.0000057384173,0.0004242682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991967,0.00003192693,0.00011859671,0.00020480376,0.00020240007,0.00024557774],"domain_scores_gemma":[0.9991673,0.00005410777,0.000024207107,0.0004861994,0.000010096745,0.0002580597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023026354,0.000088334826,0.00007129292,0.000059331356,0.000071234244,0.00005894336,0.00045850835,0.00005404336,0.00011454782],"category_scores_gemma":[0.000009081046,0.0000644921,0.00005851464,0.00028790729,0.000008210859,0.0006621079,0.00006260564,0.000107965025,0.00012234059],"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.00002766989,0.00008717583,0.00006803393,0.0000037435848,0.000004274392,0.0000019608979,0.0014526629,0.0000012304037,0.00020820819,0.75371563,0.10825637,0.13617305],"study_design_scores_gemma":[0.00082370185,0.00011783384,0.004962589,0.00002430551,0.000004193839,0.000007261008,0.00002537572,0.00076700223,0.010154858,0.013997173,0.9688702,0.0002454811],"about_ca_topic_score_codex":0.00004190356,"about_ca_topic_score_gemma":0.0000040512323,"teacher_disagreement_score":0.8606139,"about_ca_system_score_codex":0.0000055878563,"about_ca_system_score_gemma":0.000019021485,"threshold_uncertainty_score":0.26299116},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004128343,0.004712789,0.9698146,0.020321047,0.00007657346,0.0006171202,0.00008669765,0.00012391656,0.00011894438],"genre_scores_gemma":[0.9869283,0.003773561,0.005848543,0.003238046,0.000031922908,0.00009338607,0.00008070429,0.0000046486152,8.8548825e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998896,0.00024376958,0.0002898272,0.00019993058,0.000117550815,0.0002529437],"domain_scores_gemma":[0.99766046,0.0008355849,0.00023859846,0.001005214,0.000120369696,0.00013978477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008138469,0.00013043132,0.00018173651,0.00009131621,0.00048231723,0.00038562057,0.0010956048,0.00009872111,0.000007115602],"category_scores_gemma":[0.00009995169,0.00010564768,0.000042734966,0.00019863441,0.00012802333,0.0020860713,0.00070298,0.00014039731,6.831275e-7],"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.00023145207,0.00017610045,0.0058455607,0.0005495052,0.00007033973,3.7625432e-7,0.007081195,0.00008032898,0.000008393101,0.6659828,0.025114063,0.2948599],"study_design_scores_gemma":[0.0070935534,0.0002962916,0.009206379,0.00059931003,0.000025221312,0.000011141931,0.000216216,0.6478849,0.00003490407,0.15709208,0.17690393,0.0006360544],"about_ca_topic_score_codex":0.00009789753,"about_ca_topic_score_gemma":0.00031547257,"teacher_disagreement_score":0.98279995,"about_ca_system_score_codex":0.000019228242,"about_ca_system_score_gemma":0.00006500167,"threshold_uncertainty_score":0.43081877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53874135,0.0002886308,0.4502499,0.006214266,0.00028631993,0.00072396605,0.000012882504,0.0031925554,0.000290093],"genre_scores_gemma":[0.96254635,0.00015560401,0.03683903,0.00012546853,0.000040407587,0.0002529811,0.0000014928542,0.000022239125,0.000016414568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750346,0.000007574545,0.00046377696,0.0009903362,0.0003074901,0.000727349],"domain_scores_gemma":[0.9984892,0.00040532986,0.00023455654,0.00063683017,0.00017618395,0.00005790334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007557359,0.00032158665,0.00038556667,0.0010472372,0.00023265422,0.00024209495,0.0019953148,0.00019527019,0.0000028575494],"category_scores_gemma":[0.0028885023,0.00023031328,0.00014160194,0.0013537313,0.00012061718,0.0013388908,0.0009703045,0.00028128686,0.000013623142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059927526,0.00011886561,0.0041494276,0.00012787677,0.000014768089,0.0000034888014,0.00053385284,3.213038e-7,0.12304111,0.71430457,0.0010626743,0.15658313],"study_design_scores_gemma":[0.0011180972,0.00050277484,0.0024174177,0.001387754,0.000010481531,0.000011528776,0.00044613925,0.0013390855,0.38886386,0.5935531,0.0096920775,0.00065767445],"about_ca_topic_score_codex":0.000007811552,"about_ca_topic_score_gemma":0.0000317849,"teacher_disagreement_score":0.423805,"about_ca_system_score_codex":0.00012716069,"about_ca_system_score_gemma":0.00004089248,"threshold_uncertainty_score":0.9391903},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09686528,0.00025216822,0.8916301,0.0011847182,0.00019547266,0.007095553,0.00024399953,0.00029696635,0.0022357262],"genre_scores_gemma":[0.17886794,0.000095919044,0.81728965,0.00017967325,0.00014059493,0.0032969355,0.00009773937,0.00003142057,1.4878106e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99502134,0.0008661614,0.001087819,0.0018686189,0.00047064293,0.00068542606],"domain_scores_gemma":[0.9949312,0.0007402444,0.0007541953,0.0030883458,0.00017394993,0.00031204196],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010148634,0.00065670547,0.001211937,0.0006486514,0.00020104805,0.00014440756,0.002985859,0.0005561398,0.000038240585],"category_scores_gemma":[0.00016142179,0.0006560269,0.0004681949,0.00045091382,0.0019053619,0.00023865666,0.008395399,0.0017494103,0.000012191344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012099808,0.00044088118,0.025705958,0.00052041176,0.0001385014,0.00001969486,0.0028471618,0.000109755565,0.00036318338,0.95772874,0.00024031368,0.01176441],"study_design_scores_gemma":[0.0006735462,0.00015779647,0.06729713,0.00024520396,0.000035029865,0.000059164257,0.00007763201,0.0026244868,0.0007607819,0.919165,0.008302209,0.00060198596],"about_ca_topic_score_codex":0.000113645634,"about_ca_topic_score_gemma":0.00017242489,"teacher_disagreement_score":0.082002655,"about_ca_system_score_codex":0.000031541895,"about_ca_system_score_gemma":0.00023390075,"threshold_uncertainty_score":0.9996245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047618,0.00014578295,0.9945412,0.0014775173,0.0009565477,0.0003737349,0.000010357244,0.000080271624,0.0019383774],"genre_scores_gemma":[0.7905572,0.0000611894,0.20631516,0.0019234405,0.0009902259,0.00004020311,0.000021731767,0.000024473067,0.00006640349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971198,0.00007330551,0.00033607607,0.0010272472,0.0010689097,0.00037466624],"domain_scores_gemma":[0.9980805,0.00040668063,0.0002045545,0.0010784069,0.00016684752,0.00006303432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723072,0.0003017329,0.00023531112,0.0006240744,0.00037610502,0.0010163956,0.0024358649,0.00017025629,0.00001580553],"category_scores_gemma":[0.000051273415,0.00018910681,0.00007426526,0.00086569664,0.0005259717,0.0015234146,0.00041574612,0.00048678383,0.000024860721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019478672,0.00009131123,0.00041606906,0.000025156884,0.000010724728,0.000053362324,0.0023612324,0.00071869575,0.00014824864,0.79453015,0.000041426654,0.20158416],"study_design_scores_gemma":[0.0005126096,0.00023871036,0.0041635027,0.00039302825,0.000010867658,0.0002019708,8.1980863e-7,0.051909536,0.0003773458,0.93911064,0.0023990653,0.0006818802],"about_ca_topic_score_codex":0.00004041625,"about_ca_topic_score_gemma":0.0012968461,"teacher_disagreement_score":0.790081,"about_ca_system_score_codex":0.00015105426,"about_ca_system_score_gemma":0.0003299505,"threshold_uncertainty_score":0.9801127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013154282,0.0009843952,0.9961258,0.0007506164,0.00017270292,0.00039510845,0.00013578011,0.000017269731,0.0012867744],"genre_scores_gemma":[0.028036315,0.00031865173,0.97141427,0.000118005126,0.00005959336,0.000009632713,0.000033607685,0.0000058474466,0.0000040643786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904025,0.000013017558,0.00044082786,0.0001487163,0.00021635731,0.00014081554],"domain_scores_gemma":[0.998383,0.00022834049,0.00033131597,0.0009721903,0.00006635261,0.00001880294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063119346,0.00016351619,0.00023067229,0.00016899097,0.00037930935,0.00016065664,0.0035468081,0.00009475474,1.8322557e-7],"category_scores_gemma":[0.000024503117,0.00009996353,0.000058006943,0.00026260645,0.00038003866,0.00050730514,0.0018640141,0.00021246675,5.4988607e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025144066,0.00002484217,0.000011382335,0.00079428474,0.00008245229,2.0555838e-7,0.005860495,0.013916588,0.000003438441,0.84562296,0.0000873859,0.13359343],"study_design_scores_gemma":[0.0006883568,0.00010829285,0.00036869163,0.0013750175,0.000120422796,0.000028779948,0.00004186006,0.8686308,0.000039761046,0.035799023,0.09219271,0.0006062471],"about_ca_topic_score_codex":0.000010710412,"about_ca_topic_score_gemma":0.000062929925,"teacher_disagreement_score":0.8547143,"about_ca_system_score_codex":0.000011954179,"about_ca_system_score_gemma":0.000056751895,"threshold_uncertainty_score":0.6590911},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025894344,0.0037446013,0.96297526,0.00044038452,0.0028606856,0.0015718404,0.00057863735,0.00058715814,0.0013471041],"genre_scores_gemma":[0.7930609,0.0010250801,0.20441972,0.00019279605,0.00050922664,0.00050670526,0.00024372137,0.000039698596,0.000002167677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670756,0.00010975945,0.0005203467,0.0016399143,0.00041710353,0.0006053302],"domain_scores_gemma":[0.9955123,0.00028710236,0.0004611416,0.003158286,0.00029403562,0.00028710565],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012620189,0.00058967614,0.000776406,0.00036252238,0.00092435186,0.0016013915,0.0024770761,0.00058917893,0.000007003342],"category_scores_gemma":[0.00012786375,0.0005655413,0.00083791744,0.00023770373,0.0005309208,0.0005110737,0.0019388013,0.00065296097,0.0000015456108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008179538,0.0002320955,0.005014166,0.00038979703,0.00018767643,0.0000070155334,0.00026223535,0.0000029828566,0.00008042718,0.9836149,0.0034747743,0.006652105],"study_design_scores_gemma":[0.0009567206,0.00023931875,0.0020270396,0.0001345468,0.00008841293,0.000005393779,0.000019368123,0.0039666453,0.0004822583,0.9595834,0.031731613,0.00076526357],"about_ca_topic_score_codex":0.00007504256,"about_ca_topic_score_gemma":0.000021993006,"teacher_disagreement_score":0.76716655,"about_ca_system_score_codex":0.000017295646,"about_ca_system_score_gemma":0.0001594968,"threshold_uncertainty_score":0.9996796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029053012,0.000011969919,0.96878606,0.0006843219,0.00036978567,0.0001103955,0.0000054144357,0.00015635071,0.00082269264],"genre_scores_gemma":[0.7037679,0.000005275711,0.29576504,0.00026359293,0.00016964282,0.0000037986417,0.0000025809775,0.0000027012375,0.000019459887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994279,0.0000134288675,0.00010524288,0.00021177814,0.00008118322,0.00016043491],"domain_scores_gemma":[0.9994013,0.00017782497,0.00003218216,0.0002919864,0.000045146768,0.000051595358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022334444,0.000054983524,0.00005778068,0.000050103125,0.00008980941,0.00006400651,0.00036927388,0.000029945046,0.000023402772],"category_scores_gemma":[0.00003233546,0.00003414958,0.000055961933,0.00014157589,0.000020343015,0.0003364063,0.000120619334,0.00001915758,0.000055007586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006861247,0.000019502566,0.00025045502,0.0000028899676,0.000003401054,2.6017645e-7,0.000059150578,3.6115696e-7,0.00072368584,0.89016926,0.003735676,0.10502847],"study_design_scores_gemma":[0.0046619317,0.00031031008,0.006436648,0.00007083253,0.000010596649,0.000018418074,0.000040810446,0.034179453,0.017641507,0.6543462,0.28166136,0.0006219214],"about_ca_topic_score_codex":0.000004563891,"about_ca_topic_score_gemma":0.000007788604,"teacher_disagreement_score":0.67471486,"about_ca_system_score_codex":0.000007446688,"about_ca_system_score_gemma":0.000013002126,"threshold_uncertainty_score":0.13925795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09224412,0.000023314582,0.9056911,0.00053443626,0.00027674745,0.0003589708,0.00003698402,0.00037248895,0.00046183058],"genre_scores_gemma":[0.94337624,6.9318577e-7,0.05637576,0.00006589501,0.000103040686,0.00005355673,0.000005345865,0.000006305031,0.000013169163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989247,0.000029301884,0.00019405915,0.00042554724,0.0001593555,0.0002670457],"domain_scores_gemma":[0.99899334,0.00018727352,0.00007264997,0.0006137119,0.000039960833,0.00009306199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020719982,0.00012225276,0.00011817787,0.00011710778,0.00013808608,0.00008146262,0.00055893004,0.000062858715,0.000005893783],"category_scores_gemma":[0.000035713416,0.00007506808,0.00010175772,0.00024290776,0.000033220374,0.00010985924,0.00013553572,0.000044197273,0.000022714594],"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.00009771142,0.00012716514,0.0005535252,0.00007189634,0.000035993104,0.0000018737496,0.000558532,0.00021757965,0.06745038,0.81993634,0.0019211005,0.10902792],"study_design_scores_gemma":[0.0105034625,0.00039780964,0.032347172,0.0003645502,0.000050997103,0.0000744111,0.00011278521,0.8057555,0.08363482,0.008387079,0.05670927,0.0016621713],"about_ca_topic_score_codex":0.00003866102,"about_ca_topic_score_gemma":0.000014564331,"teacher_disagreement_score":0.8511321,"about_ca_system_score_codex":0.0000508901,"about_ca_system_score_gemma":0.000026923142,"threshold_uncertainty_score":0.30611873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029402624,0.00001613599,0.97272664,0.0017565335,0.00010594925,0.00001335792,0.0000017382906,0.00013706001,0.022302324],"genre_scores_gemma":[0.89206284,0.000013468302,0.1071808,0.00054527685,0.00003533549,0.0000016126952,2.6633649e-7,0.0000012419202,0.0001591814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997131,0.000007014659,0.000036282585,0.000111040914,0.00005669051,0.00007585691],"domain_scores_gemma":[0.9996039,0.00003111374,0.0000067435612,0.00031569455,0.000009623084,0.000032909582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005384762,0.00002500936,0.000024447414,0.000022489083,0.00002096375,0.000025296116,0.000346343,0.000010827045,0.00016929732],"category_scores_gemma":[0.000008466648,0.000012720445,0.00002033064,0.00009404762,0.0000132250125,0.0003342131,0.000105815736,0.000010112418,0.0003199855],"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":[2.798946e-7,0.0000065421136,0.0005524624,2.1613303e-7,9.1264593e-7,8.95501e-7,0.000015346044,3.4079393e-9,0.00063584425,0.9192648,0.00960029,0.069922395],"study_design_scores_gemma":[0.00039816662,0.000041308984,0.016176417,0.000008090131,9.999104e-7,0.000007798966,0.0000047055187,0.00018212716,0.013884625,0.44536436,0.5237473,0.00018407813],"about_ca_topic_score_codex":0.0000065568643,"about_ca_topic_score_gemma":0.0000053084273,"teacher_disagreement_score":0.88912255,"about_ca_system_score_codex":0.0000018921163,"about_ca_system_score_gemma":0.0000051410657,"threshold_uncertainty_score":0.4112873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042447777,0.00022228119,0.99313223,0.0014555601,0.0022097926,0.000782138,0.000059992526,0.0002464859,0.0018490456],"genre_scores_gemma":[0.14413723,0.000040000956,0.85311675,0.001579215,0.000980865,0.00002540765,0.0000437951,0.000050022718,0.000026734164],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995519,0.000050163926,0.000638267,0.0019343517,0.0010133655,0.00084486895],"domain_scores_gemma":[0.9958131,0.0018394606,0.00042234853,0.0011938589,0.00047045178,0.00026078435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011372351,0.00059162313,0.00060409907,0.000809196,0.0004310328,0.0007367202,0.0023325079,0.00043813736,0.000010988342],"category_scores_gemma":[0.0002227927,0.0005054399,0.00023023962,0.0005768882,0.00070087437,0.0013071328,0.0009714216,0.0007336313,0.000036467995],"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.000010576514,0.000057377245,0.00003566836,0.00009791892,0.000018506367,0.00004968841,0.0004286336,0.0021971646,0.00011485963,0.391629,0.00010599628,0.6052546],"study_design_scores_gemma":[0.0006012819,0.00022005694,0.00009187927,0.0005578212,0.0000139100275,0.00011094583,1.950397e-7,0.31344327,0.00061616494,0.6814905,0.0020682255,0.0007857271],"about_ca_topic_score_codex":0.0000039662127,"about_ca_topic_score_gemma":0.00007779595,"teacher_disagreement_score":0.6044689,"about_ca_system_score_codex":0.00021375,"about_ca_system_score_gemma":0.00090030313,"threshold_uncertainty_score":0.9997397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038715668,0.000019666568,0.9320621,0.02040986,0.0011983528,0.00027817092,0.00037762008,0.000405856,0.0065327217],"genre_scores_gemma":[0.94660115,0.000020698166,0.040693864,0.012226242,0.00016911392,0.000020876829,0.00025414018,0.0000051319525,0.000008754397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974975,0.000032700864,0.0004777244,0.0004266379,0.0011059835,0.00045947163],"domain_scores_gemma":[0.99658924,0.00052924216,0.0002836738,0.0021799197,0.00024784438,0.00017005733],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0022029697,0.00017254088,0.00014544665,0.00040931208,0.00055510143,0.0016896909,0.008652589,0.00007618445,0.000108648004],"category_scores_gemma":[0.0009772843,0.000104780534,0.000044635286,0.0023309179,0.00015280844,0.036424816,0.0022510735,0.00011816352,0.00040494028],"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.00006026259,0.00016935491,0.010041303,0.00010781423,0.000025930442,0.000003774877,0.0036053897,0.00038094126,0.0001615654,0.59654546,0.20301977,0.18587846],"study_design_scores_gemma":[0.0016339885,0.00026082125,0.014571584,0.00025151452,0.000007791695,0.000013245036,0.00043846254,0.2566127,0.0021290507,0.03470694,0.68855053,0.00082338706],"about_ca_topic_score_codex":0.00011030342,"about_ca_topic_score_gemma":0.00007404737,"teacher_disagreement_score":0.9078855,"about_ca_system_score_codex":0.000032796524,"about_ca_system_score_gemma":0.00025294741,"threshold_uncertainty_score":0.9993467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03878812,0.000025772002,0.9563734,0.0017312668,0.0010042123,0.00019565421,0.00000398003,0.00026228465,0.0016153003],"genre_scores_gemma":[0.9583718,0.0000053627077,0.040840767,0.0006215589,0.00014155284,0.000011332208,0.0000018815305,0.000004444816,0.0000012971439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728453,0.00026373615,0.00022748439,0.0008077673,0.0009334772,0.00048303054],"domain_scores_gemma":[0.9978913,0.00031420315,0.00006722424,0.0010648487,0.0004185873,0.000243801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037371288,0.00016041387,0.0001336674,0.00024224463,0.00038856725,0.0003629153,0.0018044106,0.000059414775,0.00018250904],"category_scores_gemma":[0.00020082884,0.00009997579,0.0000688672,0.0016629023,0.0016694362,0.0016938053,0.0007184684,0.00010881646,0.00018445106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011731106,0.00003515334,0.00005610258,0.000001623177,0.000002760704,0.0000014570332,0.000092895745,0.000006603592,0.0024747956,0.8543782,0.00017210472,0.14276655],"study_design_scores_gemma":[0.0004898956,0.00023664291,0.006347395,0.000029859193,0.000010070261,0.000012779083,0.0000026911373,0.2334867,0.0039076507,0.7544604,0.0007861909,0.0002297404],"about_ca_topic_score_codex":0.0000013634183,"about_ca_topic_score_gemma":8.907965e-7,"teacher_disagreement_score":0.9195837,"about_ca_system_score_codex":0.000063873646,"about_ca_system_score_gemma":0.0001446594,"threshold_uncertainty_score":0.6151107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032174939,0.000013832534,0.97117054,0.0016867872,0.000094330535,0.000013467586,0.0000013089983,0.00013640668,0.023665851],"genre_scores_gemma":[0.9184628,0.000013385887,0.08081512,0.00051927887,0.0000301346,0.0000017383773,2.0530331e-7,0.0000011091045,0.00015621807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997186,0.0000063657376,0.000035655543,0.00010510929,0.00005648088,0.00007779723],"domain_scores_gemma":[0.99962264,0.000028459903,0.0000065283944,0.0002998006,0.000009644188,0.0000329047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052605603,0.000024550262,0.0000230758,0.000022422291,0.00002094533,0.000024623341,0.00033733467,0.000010436414,0.000103250415],"category_scores_gemma":[0.000007320899,0.0000124766575,0.000019839013,0.00010002252,0.000013187997,0.00033357312,0.000101051584,0.0000098287255,0.00026990226],"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":[2.3569203e-7,0.000006327712,0.00058407715,2.2807039e-7,8.025853e-7,8.797715e-7,0.000013184383,3.0588059e-9,0.00050659344,0.92197335,0.006647455,0.07026689],"study_design_scores_gemma":[0.0003774619,0.00004782208,0.01468686,0.00000823292,9.639523e-7,0.000010088742,0.000004537399,0.0001945913,0.012488531,0.41729102,0.55470175,0.00018815116],"about_ca_topic_score_codex":0.0000062965064,"about_ca_topic_score_gemma":0.000006985567,"teacher_disagreement_score":0.9152453,"about_ca_system_score_codex":0.000001970168,"about_ca_system_score_gemma":0.0000056114645,"threshold_uncertainty_score":0.34691375},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055626663,0.00001126617,0.9590205,0.002951696,0.00010481294,0.000015961528,0.000001651303,0.00011739085,0.03221406],"genre_scores_gemma":[0.9769594,0.0000045767756,0.022075608,0.0008006939,0.000020211168,0.0000010531617,1.7417595e-7,8.863063e-7,0.00013741695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997348,0.000006332751,0.00003442357,0.000099679186,0.000051321935,0.00007341124],"domain_scores_gemma":[0.999647,0.000024384435,0.0000058951405,0.00028278466,0.000010128698,0.000029777051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042987867,0.000024083158,0.000021474309,0.000021855276,0.000016889275,0.000027344984,0.00029641422,0.000010219199,0.00013967732],"category_scores_gemma":[0.0000047092617,0.000011872179,0.000019234383,0.00007558743,0.000011446276,0.00036824573,0.00011038784,0.000008931503,0.00030010642],"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":[4.5446382e-7,0.0000074166223,0.0011835222,2.9053098e-7,0.00000106293,0.0000013107775,0.000023538454,8.7810614e-10,0.0011403322,0.9372841,0.006140609,0.05421735],"study_design_scores_gemma":[0.00074837863,0.000107565116,0.056851678,0.000016551527,0.0000018395979,0.000029653213,0.0000052401388,0.00008289069,0.04707638,0.39198864,0.5027437,0.0003474637],"about_ca_topic_score_codex":0.000003390768,"about_ca_topic_score_gemma":0.000003893913,"teacher_disagreement_score":0.9713967,"about_ca_system_score_codex":0.000001692947,"about_ca_system_score_gemma":0.0000042231927,"threshold_uncertainty_score":0.3857361},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7368493,0.0023006594,0.24575873,0.00009677331,0.0015540296,0.0005701188,0.000010532273,0.0004781051,0.012381776],"genre_scores_gemma":[0.9660395,0.00061658403,0.032370318,0.0006750057,0.000098699056,0.00013317307,0.000019644142,0.000008992062,0.00003810976],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988247,0.000030493951,0.00021322172,0.0004203993,0.00015728014,0.0003538746],"domain_scores_gemma":[0.9988073,0.00008407284,0.000040970303,0.0009078126,0.000033849075,0.00012596567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031011202,0.00013402202,0.00014456379,0.000121483194,0.00007613534,0.00015481166,0.0009827733,0.00012655697,0.0001512392],"category_scores_gemma":[0.0000092955115,0.00011863293,0.00007763043,0.00065873726,0.000063458196,0.00057907193,0.0003686659,0.00043937267,0.000071218965],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015086146,0.000559234,0.008216437,0.000013395982,0.000013312945,0.00005615875,0.0011296651,0.0013061769,0.0015006213,0.076257996,0.013620157,0.89731175],"study_design_scores_gemma":[0.0008250907,0.00021712921,0.0076411767,0.000016876877,0.0000028643067,0.000012281761,0.00013557996,0.11989362,0.00074547436,0.004249143,0.8656591,0.00060162874],"about_ca_topic_score_codex":0.000011379916,"about_ca_topic_score_gemma":0.00084349664,"teacher_disagreement_score":0.8967101,"about_ca_system_score_codex":0.000008154749,"about_ca_system_score_gemma":0.00002860309,"threshold_uncertainty_score":0.48377106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5036541,0.0000033852125,0.49427047,0.000088800494,0.00006440374,0.000063219224,0.000008296992,0.000101910955,0.0017453912],"genre_scores_gemma":[0.9594437,0.0000051620605,0.040282466,0.00019866538,0.000007592933,0.0000016127311,0.00005809177,0.0000015235521,0.0000011906263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902856,0.0000309479,0.0002482002,0.00013259306,0.00043702006,0.00012267052],"domain_scores_gemma":[0.9990248,0.000032677624,0.00013236966,0.0005565396,0.0001713693,0.000082231585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055524596,0.000079958896,0.0001414472,0.0006261608,0.00004159212,0.000062965024,0.0004083564,0.000047917172,0.000024020423],"category_scores_gemma":[0.00006417633,0.000068376394,0.0000844035,0.0027174964,0.00003334757,0.0015980055,0.000074462616,0.000074835705,0.000042538137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064033037,0.00063454313,0.19676475,0.00014686778,0.00046301069,0.000002869059,0.0027397398,0.02828019,0.0015876703,0.743305,0.002264632,0.023170361],"study_design_scores_gemma":[0.0003295681,0.00017054874,0.048047923,0.0000071593618,0.000033180197,2.9262992e-7,0.000012659297,0.94725186,0.0027121224,0.00029797168,0.001043009,0.00009372264],"about_ca_topic_score_codex":0.000016255097,"about_ca_topic_score_gemma":0.00000269609,"teacher_disagreement_score":0.91897166,"about_ca_system_score_codex":0.000022741548,"about_ca_system_score_gemma":0.00005269855,"threshold_uncertainty_score":0.27883086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10665256,0.00021354378,0.8872735,0.00023316612,0.0007237858,0.0002107628,0.00008190763,0.00028710734,0.004323652],"genre_scores_gemma":[0.6389767,0.000033339606,0.3600268,0.0002966319,0.00020002431,0.000016615539,0.0004040929,0.0000088042325,0.000036989666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998487,0.00006793516,0.00026668268,0.00039499535,0.0003281682,0.00045519992],"domain_scores_gemma":[0.99815863,0.00008013085,0.00011114964,0.0013201273,0.000049222836,0.00028071663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007886715,0.00017395406,0.00017241562,0.0001687523,0.00025838404,0.00025338243,0.00083041395,0.00005058104,0.00015616918],"category_scores_gemma":[0.000017061191,0.00015497164,0.000061422536,0.0005741409,0.000047317586,0.004691054,0.0006502575,0.0002314463,0.00022888418],"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.00020767997,0.0007224395,0.054161273,0.00005470646,0.00004225655,0.0000058618175,0.0016841763,0.000010454183,0.0011711451,0.89794654,0.03523086,0.0087626],"study_design_scores_gemma":[0.03409584,0.000410858,0.036177725,0.0007180669,0.00032023285,0.00049679057,0.0032987082,0.1271923,0.065041706,0.02346227,0.7026451,0.0061403774],"about_ca_topic_score_codex":0.0011845226,"about_ca_topic_score_gemma":0.0005126136,"teacher_disagreement_score":0.8744843,"about_ca_system_score_codex":0.00001922357,"about_ca_system_score_gemma":0.000042177166,"threshold_uncertainty_score":0.631956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16413592,0.000021473641,0.8333496,0.0018557266,0.00040666162,0.000114768576,0.0000063978796,0.00003982485,0.00006961796],"genre_scores_gemma":[0.96891814,0.0000281026,0.028820368,0.0021657,0.00006010623,0.0000041395574,0.0000024635747,8.8961576e-7,8.198559e-8],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988471,0.000059571914,0.00026427576,0.00018977567,0.0003858554,0.00025341244],"domain_scores_gemma":[0.9992141,0.00010590707,0.00009915678,0.0003809619,0.00012791413,0.0000719716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487486,0.000084343395,0.00007770068,0.00033860205,0.00033538087,0.00047823493,0.0008606663,0.000030020545,0.0000017850512],"category_scores_gemma":[0.00003224098,0.000049708422,0.000024633242,0.001302839,0.00017895822,0.009740853,0.00021790768,0.00007961014,0.000008056333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012456906,0.00004003486,0.014904617,0.00006186747,0.0000017576201,0.0000024267922,0.0081552025,0.00019247078,0.00029190557,0.5571022,0.00036913998,0.41886592],"study_design_scores_gemma":[0.0013675657,0.00024043772,0.18022983,0.00025924284,0.0000025848356,0.000072567134,0.00021886366,0.7823334,0.0010790037,0.009439948,0.024291404,0.0004651718],"about_ca_topic_score_codex":0.000047056856,"about_ca_topic_score_gemma":0.00000804825,"teacher_disagreement_score":0.8047822,"about_ca_system_score_codex":0.000047231464,"about_ca_system_score_gemma":0.0001323514,"threshold_uncertainty_score":0.70618826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039117873,0.000008618625,0.9582005,0.0004546906,0.00103518,0.00027057392,0.00037924128,0.00028499236,0.00024831228],"genre_scores_gemma":[0.99416316,0.0000035030782,0.005367811,0.00029869168,0.00013035072,0.000008352979,0.000012762449,0.0000141543605,0.000001226191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698627,0.0004189478,0.0006070165,0.0009915853,0.00063664117,0.00035955332],"domain_scores_gemma":[0.9951132,0.0018950738,0.00031888235,0.0023937414,0.00014491784,0.00013418605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010358467,0.00026273052,0.00046270902,0.0005242082,0.00024136738,0.00018840095,0.0021992733,0.00011535834,0.000032969994],"category_scores_gemma":[0.00003711006,0.00019934833,0.0002927573,0.0017860435,0.0001762574,0.00041766412,0.000020663323,0.00026275296,0.000019025541],"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.00080236024,0.0014707383,0.00039209038,0.00018908683,0.00088585203,0.000039626946,0.00051420386,0.41033944,0.0006708805,0.36970156,0.00017086987,0.21482329],"study_design_scores_gemma":[0.0013049981,0.00026111538,0.0009886437,0.0003375776,0.00022434861,0.0000030021333,0.000027124373,0.9923644,0.0031768167,0.0010005572,0.000046396304,0.00026503645],"about_ca_topic_score_codex":0.000027761533,"about_ca_topic_score_gemma":0.000015041579,"teacher_disagreement_score":0.9550453,"about_ca_system_score_codex":0.00008603165,"about_ca_system_score_gemma":0.00006893565,"threshold_uncertainty_score":0.8129189},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060990728,0.00084834656,0.97949815,0.0013385261,0.0019168179,0.008732201,0.0001819119,0.00006049583,0.0013244748],"genre_scores_gemma":[0.96428186,0.000120252946,0.032904953,0.000036476817,0.00022442159,0.002297762,0.00010960866,0.000015577501,0.00000906213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995684,0.00079278316,0.0015265874,0.00026419916,0.0015974672,0.00013492821],"domain_scores_gemma":[0.9872641,0.00016598382,0.005633601,0.003252717,0.0035511516,0.00013246942],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002740479,0.00022176211,0.0005779156,0.0009812976,0.00013454459,0.0013587325,0.0137751065,0.00021060431,0.00002809388],"category_scores_gemma":[0.00023145464,0.00020637507,0.00045492145,0.00019792856,0.00014653867,0.0020059212,0.0019795035,0.00063081156,0.0000058697287],"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.001312856,0.008267588,0.008927489,0.0016328659,0.008527945,0.0002812668,0.016844084,0.029061714,0.002123197,0.8616302,0.005727172,0.05566362],"study_design_scores_gemma":[0.0064500365,0.0005165195,0.012082551,0.0076601095,0.0005084717,0.00024780474,0.0004555575,0.7337733,0.002435894,0.13617922,0.098253936,0.0014365762],"about_ca_topic_score_codex":0.00046216912,"about_ca_topic_score_gemma":0.00007733975,"teacher_disagreement_score":0.9581828,"about_ca_system_score_codex":0.00012460515,"about_ca_system_score_gemma":0.00038354727,"threshold_uncertainty_score":0.99967796},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33930677,0.000067407724,0.6517471,0.005346146,0.0026888805,0.00023041294,0.00002154604,0.00013765652,0.00045407956],"genre_scores_gemma":[0.98470056,0.000008965196,0.011704335,0.0018943954,0.0016690783,0.0000044014178,0.0000049354758,0.000010531238,0.000002801747],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748045,0.00026982476,0.00038484955,0.0008484492,0.00044815167,0.0005682911],"domain_scores_gemma":[0.9946078,0.0009347894,0.00012097409,0.004166771,0.000054146396,0.00011552838],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0019257953,0.0001933445,0.00020044245,0.00016803903,0.00025250646,0.000699012,0.016045026,0.000060906023,0.000005125927],"category_scores_gemma":[0.00036643443,0.00012005168,0.000055481956,0.0013710413,0.00004859228,0.0008496707,0.008049024,0.00022205756,0.000051647654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039783106,0.00039770835,0.040243566,0.00008862929,0.00005254629,0.000182488,0.0101531325,0.00032024225,0.0021374535,0.06280135,0.11657255,0.76701057],"study_design_scores_gemma":[0.0044765966,0.00041794762,0.22809125,0.0022045912,0.000046721263,0.00025062478,0.0006094139,0.18157347,0.0058457204,0.13480128,0.43823886,0.0034435187],"about_ca_topic_score_codex":0.00019929135,"about_ca_topic_score_gemma":0.00016982688,"teacher_disagreement_score":0.76356703,"about_ca_system_score_codex":0.000028190469,"about_ca_system_score_gemma":0.00006042342,"threshold_uncertainty_score":0.9999737},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050240813,0.00035523876,0.99547523,0.00026498342,0.0014704446,0.00022474982,0.000023043007,0.00011183388,0.0015720818],"genre_scores_gemma":[0.14448501,0.00012878861,0.8547409,0.00021501188,0.00037138147,0.0000068170557,0.000009907447,0.000022468275,0.00001966555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698704,0.00003209489,0.00054747507,0.0012300246,0.0007655854,0.00043778805],"domain_scores_gemma":[0.9975097,0.00021901628,0.00042541476,0.0014409305,0.0002801779,0.00012477016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005707543,0.00037147853,0.000445251,0.00087164907,0.00015057065,0.00018626754,0.0023850678,0.0003011505,0.000034468936],"category_scores_gemma":[0.0000400861,0.0003069277,0.00015255202,0.00070334214,0.0012607577,0.00074938964,0.0008051167,0.00038383124,0.000026620244],"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.000006098831,0.00001828722,0.00007142498,0.00003565537,0.0000080227865,0.000009691401,0.00013533773,0.0002052421,0.0033325988,0.3454397,0.0000066236526,0.6507313],"study_design_scores_gemma":[0.0004172692,0.00024222623,0.0002846834,0.00053684413,0.0000114080585,0.00010755737,2.3209112e-7,0.06973482,0.023570837,0.90175444,0.0024234424,0.0009162224],"about_ca_topic_score_codex":0.000009030616,"about_ca_topic_score_gemma":0.0000144833475,"teacher_disagreement_score":0.6498151,"about_ca_system_score_codex":0.00012207837,"about_ca_system_score_gemma":0.00031817472,"threshold_uncertainty_score":0.9999383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014580113,0.0003693917,0.97338206,0.010526653,0.0002069676,0.000062063096,0.0000125879515,0.000039489285,0.0008206977],"genre_scores_gemma":[0.65258414,0.000059452675,0.34630302,0.00076438434,0.00026570112,0.0000023359833,0.000001698551,0.00000923455,0.000010030581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850607,0.00012432283,0.00056879537,0.00017936123,0.0003815008,0.00023993042],"domain_scores_gemma":[0.9982869,0.0004888403,0.0003801273,0.00036150235,0.00031437154,0.00016826388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005730817,0.00013845439,0.00038061425,0.0001973164,0.00005588263,0.000048424958,0.0009510654,0.00016651543,0.00028148835],"category_scores_gemma":[0.0006471693,0.00007656834,0.00018010568,0.0002825846,0.000078918965,0.00062204374,0.00015872827,0.00026467568,0.00008897304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020030204,0.00012964621,0.0001264025,0.000032692064,0.00005053329,0.00009455434,0.0000776841,1.4982633e-7,0.003789798,0.9802401,0.01353357,0.00190485],"study_design_scores_gemma":[0.0006328703,0.00025163702,0.0004739671,0.00016259823,0.000020315008,0.0010781471,0.000018730396,0.00004315711,0.0011003,0.98273927,0.013348084,0.00013091983],"about_ca_topic_score_codex":5.8487892e-8,"about_ca_topic_score_gemma":2.3967104e-7,"teacher_disagreement_score":0.638004,"about_ca_system_score_codex":0.000021950056,"about_ca_system_score_gemma":0.00008247386,"threshold_uncertainty_score":0.31223664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43224925,0.000063736035,0.567108,0.00007804656,0.00032604084,0.000034804852,0.00010692555,0.000011773163,0.00002146364],"genre_scores_gemma":[0.65111667,0.00009371396,0.34845617,0.00022651633,0.000084270796,4.6999673e-7,0.000018555626,0.0000034250538,2.2603795e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982002,0.00013047093,0.0010864493,0.00011099092,0.00029437686,0.00017753654],"domain_scores_gemma":[0.9973768,0.00013185425,0.0011623658,0.00097080745,0.00026931657,0.000088870955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010279872,0.000110526475,0.00020722138,0.00017745861,0.000111109555,0.00012393703,0.0013793766,0.00010617787,0.0000053897165],"category_scores_gemma":[0.00014361642,0.00007549994,0.000061854626,0.00018802575,0.00006825384,0.0049436376,0.0006250502,0.00019698964,0.000004798841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013573712,0.0010761704,0.004242111,0.00020412746,0.00050991593,0.0009189241,0.160368,0.014955165,0.16337965,0.24880569,0.011046544,0.39435798],"study_design_scores_gemma":[0.00058206025,0.0001284884,0.00020936542,0.000109642766,0.000039551323,0.000783703,0.0005825229,0.8790599,0.003778774,0.113994665,0.000506033,0.00022531083],"about_ca_topic_score_codex":0.000007540663,"about_ca_topic_score_gemma":0.0000042047645,"teacher_disagreement_score":0.8641047,"about_ca_system_score_codex":0.000039531318,"about_ca_system_score_gemma":0.000117517906,"threshold_uncertainty_score":0.35840178},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026167886,0.000021784565,0.9706956,0.0009773661,0.0005076591,0.0002701276,0.000010195933,0.00024561572,0.0011037459],"genre_scores_gemma":[0.8915392,0.000008508884,0.10785878,0.00016285702,0.0001390989,0.00008825024,0.0000072134876,0.0000062009944,0.00018985049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999103,0.0000123279815,0.00013063452,0.00032916173,0.00014313648,0.00028172796],"domain_scores_gemma":[0.99923366,0.000046033983,0.000032737742,0.0005436192,0.000049302096,0.00009462002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015816922,0.00009354621,0.0000903297,0.000052655017,0.000093783136,0.00017150553,0.0005867675,0.00004502482,0.00006109711],"category_scores_gemma":[0.00001279707,0.000057411777,0.00011283994,0.00016569592,0.00005971063,0.00063465704,0.00017286812,0.000026440248,0.000048935977],"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.000030975913,0.00023502274,0.0006973148,0.0000062767776,0.000016330334,0.0000026905616,0.000099512494,4.8818457e-8,0.0023720178,0.7468096,0.005860731,0.2438695],"study_design_scores_gemma":[0.0025917357,0.0009006715,0.0026549625,0.000041779716,0.000014278842,0.000014082148,0.000023737295,0.0023298936,0.017727578,0.19998203,0.77305186,0.00066741224],"about_ca_topic_score_codex":0.000023556882,"about_ca_topic_score_gemma":0.000037010574,"teacher_disagreement_score":0.86537135,"about_ca_system_score_codex":0.000008781159,"about_ca_system_score_gemma":0.000021462609,"threshold_uncertainty_score":0.23411843},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10591956,0.008958712,0.7864799,0.07706241,0.00049612665,0.0037687768,0.0001755426,0.001023894,0.016115062],"genre_scores_gemma":[0.08490902,0.0059829843,0.8976899,0.010099651,0.00025523442,0.00022509521,0.00002712317,0.000120462515,0.00069054053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637866,0.00024469892,0.000940566,0.00069418317,0.0009865101,0.0007553577],"domain_scores_gemma":[0.9971499,0.00069673883,0.00024481482,0.0016301657,0.0000948245,0.00018359191],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012678376,0.00047565493,0.00078519544,0.000040032202,0.00029105542,0.00015150166,0.0022305183,0.00034332127,0.0026914857],"category_scores_gemma":[0.00017406307,0.00033181332,0.0016831162,0.0011607269,0.000783811,0.00020230911,0.00058409694,0.00078653137,0.0002243418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011207522,0.0032839994,0.00072929694,0.0069891224,0.00040107928,0.000013707742,0.012259256,0.0002113662,0.0011915168,0.7378375,0.22672904,0.010242027],"study_design_scores_gemma":[0.0017442701,0.00020554475,0.001358666,0.0021146946,0.0001497429,0.00011670803,0.00021297179,0.010781868,0.0037839257,0.87236905,0.10607392,0.00108865],"about_ca_topic_score_codex":0.000023036764,"about_ca_topic_score_gemma":0.000004372745,"teacher_disagreement_score":0.13453151,"about_ca_system_score_codex":0.00004852057,"about_ca_system_score_gemma":0.000062638,"threshold_uncertainty_score":0.9999134},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027079593,0.000022155758,0.96876585,0.0005338996,0.00045749985,0.00011912285,0.0000253007,0.00023325607,0.0027633272],"genre_scores_gemma":[0.9264883,0.000007643978,0.07145968,0.0017296175,0.00020728857,0.000025611751,0.0000018984837,0.000007123091,0.00007285149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992348,0.00002034875,0.000104943545,0.0002837846,0.00012625557,0.00022989171],"domain_scores_gemma":[0.9991379,0.00025103203,0.00003427136,0.00046414256,0.000034710414,0.000077979574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015976786,0.000084605,0.000081585604,0.00008077609,0.00010453528,0.00007115643,0.00052819046,0.00003445627,0.000055449753],"category_scores_gemma":[0.00006409451,0.000051240062,0.00006754817,0.00017776857,0.000030668707,0.00039214795,0.000105084575,0.000031377494,0.0000495406],"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.000016902053,0.00003918851,0.0002660793,0.0000035667163,0.0000072827233,0.0000017613195,0.00012871379,0.000001498481,0.0027534624,0.9486007,0.018196408,0.029984448],"study_design_scores_gemma":[0.002606961,0.00090358965,0.008791797,0.00014977751,0.000011912289,0.000007846579,0.000061015246,0.004645239,0.074049346,0.17812663,0.7297658,0.0008801169],"about_ca_topic_score_codex":0.000016907261,"about_ca_topic_score_gemma":0.000013129022,"teacher_disagreement_score":0.8994087,"about_ca_system_score_codex":0.000014106634,"about_ca_system_score_gemma":0.000022093021,"threshold_uncertainty_score":0.2089509},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010338271,0.00009699683,0.98494595,0.0005373993,0.0023417226,0.00078901206,0.00010577907,0.0005471654,0.0002976775],"genre_scores_gemma":[0.9004795,0.000015698113,0.09898095,0.00018402169,0.0001877349,0.0000357618,0.00005361607,0.000027640765,0.00003508772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977283,0.00012223328,0.0005869043,0.0007101453,0.00037123536,0.0004811788],"domain_scores_gemma":[0.9955955,0.0005766526,0.0005206641,0.0028463507,0.0003052464,0.00015558925],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073762715,0.00031352264,0.00039412378,0.0002374006,0.0017512118,0.0012575762,0.0023952385,0.0001648978,0.0000031025236],"category_scores_gemma":[0.00027419662,0.00031834122,0.00023229311,0.0002560755,0.00007926863,0.0010994497,0.00006924571,0.00033282908,0.00001465878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023403576,0.0013120262,0.00030296607,0.0010188712,0.0006629589,0.000046188197,0.014480582,0.30640024,0.0011747519,0.39441496,0.0020603344,0.2778921],"study_design_scores_gemma":[0.0017830911,0.00035370886,0.00030842732,0.00048607492,0.00004108822,0.0000613865,0.00042767136,0.99116,0.00051097665,0.0026479508,0.0017026738,0.0005169788],"about_ca_topic_score_codex":0.00015886105,"about_ca_topic_score_gemma":0.00007290563,"teacher_disagreement_score":0.89014125,"about_ca_system_score_codex":0.00008251196,"about_ca_system_score_gemma":0.00011961398,"threshold_uncertainty_score":0.99992687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017500686,0.000011955662,0.9777915,0.0024058712,0.00003094444,0.00065949175,0.00024108625,0.000067734174,0.0012907599],"genre_scores_gemma":[0.98970914,0.00006589533,0.009011864,0.0005253729,0.000029863744,0.00057435717,0.000056838042,0.0000047622066,0.000021933198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908096,0.00004207948,0.00029952388,0.00022641258,0.00024653782,0.000104462866],"domain_scores_gemma":[0.9987022,0.00043258563,0.00017440926,0.00035080285,0.00024003162,0.00009994247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040211188,0.0001172722,0.00009805696,0.00020752593,0.00017154985,0.00012006195,0.00039381586,0.00004563873,0.000014597362],"category_scores_gemma":[0.000056253164,0.000082919665,0.000024711635,0.0002392624,0.00006050788,0.001112755,0.00009777094,0.000060662747,0.000048340975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073331656,0.00007685623,0.000023705923,0.000013211622,0.000024452982,6.840521e-8,0.00070078607,0.000106710155,0.0031909228,0.97708577,0.000015418822,0.01868874],"study_design_scores_gemma":[0.0031449439,0.00085516856,0.0050898083,0.00045169558,0.00006990406,0.000073045376,0.00039209667,0.02928484,0.037499335,0.80061793,0.12152973,0.0009914741],"about_ca_topic_score_codex":0.0000039174015,"about_ca_topic_score_gemma":0.0000014762147,"teacher_disagreement_score":0.97220844,"about_ca_system_score_codex":0.000024045246,"about_ca_system_score_gemma":0.000019568592,"threshold_uncertainty_score":0.33813658},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34953472,0.000084201216,0.64925116,0.00068436516,0.00008279926,0.00009116276,0.0000060530165,0.0000983509,0.00016718206],"genre_scores_gemma":[0.8228664,0.00002121155,0.17696819,0.00011048789,0.000020634443,0.0000034335721,0.0000049872046,0.0000033121753,0.0000013428058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989838,0.00013186774,0.00018409429,0.0002938338,0.00022584294,0.00018054938],"domain_scores_gemma":[0.998439,0.00018068228,0.000079615835,0.0011419322,0.00007760391,0.000081129045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006216295,0.00009678047,0.00009438628,0.00011841206,0.00024671186,0.00021917606,0.0009536707,0.00004878404,0.000048420763],"category_scores_gemma":[0.00009083621,0.00006945339,0.00004417835,0.00031804448,0.00007283578,0.0008877341,0.001052096,0.000066239816,0.000012440034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004580633,0.00049084047,0.029285759,0.0000884,0.000039607043,0.0000059470995,0.00093650224,0.0006651796,0.114077084,0.8127449,0.0015139843,0.040105984],"study_design_scores_gemma":[0.0011689054,0.00005648546,0.049080014,0.00017850556,0.000016666396,0.000008429747,0.000030755647,0.9086571,0.006941725,0.0312514,0.0021947052,0.00041534245],"about_ca_topic_score_codex":0.0002186656,"about_ca_topic_score_gemma":0.00007508019,"teacher_disagreement_score":0.9079919,"about_ca_system_score_codex":0.000032725708,"about_ca_system_score_gemma":0.00002955423,"threshold_uncertainty_score":0.2832227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35849643,0.000098777906,0.6406529,0.00007442602,0.00028519184,0.00009461826,0.0000054529114,0.000013447094,0.00027879854],"genre_scores_gemma":[0.89860445,0.000038672373,0.10112837,0.000099577774,0.00011519371,5.6816845e-7,0.0000012808026,0.000006671549,0.000005224133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981358,0.00007379099,0.00076977356,0.00033114545,0.00040745127,0.0002820559],"domain_scores_gemma":[0.9973191,0.00015356089,0.0011264917,0.0008775575,0.00033555168,0.00018774475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013022189,0.0001778016,0.00043748875,0.00025683682,0.00040608883,0.00039786825,0.0017745707,0.000039865685,0.0000063679395],"category_scores_gemma":[0.00037800416,0.00014778334,0.00016432643,0.00014823522,0.00021791933,0.00059205835,0.0009780006,0.00027495925,0.00000257405],"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.00015533695,0.00056702126,0.0013684237,0.00018149914,0.00011343124,0.000022306775,0.010656851,0.00026157105,0.004940146,0.90893364,0.00013303885,0.07266671],"study_design_scores_gemma":[0.004715308,0.0056980685,0.047607057,0.003247806,0.0005439705,0.00084654265,0.006283195,0.4725606,0.22314054,0.2254009,0.0070277406,0.0029282684],"about_ca_topic_score_codex":0.000049950286,"about_ca_topic_score_gemma":0.0000036876104,"teacher_disagreement_score":0.6835328,"about_ca_system_score_codex":0.000018138524,"about_ca_system_score_gemma":0.00004493854,"threshold_uncertainty_score":0.60264295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08964639,0.000054039556,0.8846296,0.0009755317,0.0004275063,0.00046715577,0.000104615785,0.0001840185,0.023511147],"genre_scores_gemma":[0.9719867,0.00021818104,0.026459794,0.0007495046,0.000060584043,0.00005509913,0.00043890433,0.00000638584,0.000024837596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972185,0.000029953591,0.00096216646,0.00009343659,0.0013764992,0.00031943063],"domain_scores_gemma":[0.99803185,0.00006191777,0.0006864979,0.0007443205,0.0002304285,0.0002449853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009599736,0.00016027175,0.00025000388,0.0001701948,0.00046650195,0.00065823743,0.0016393978,0.00023038952,0.00014394453],"category_scores_gemma":[0.0002490346,0.00015226868,0.000104512095,0.00021391122,0.00020132562,0.011672296,0.00026079462,0.00033217765,0.00007607079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006530483,0.00063952967,0.0016361418,0.0023218936,0.0001564863,0.0000034234627,0.07002494,0.00002860011,0.00043370068,0.65592915,0.050197303,0.21856351],"study_design_scores_gemma":[0.008012275,0.000521797,0.01961974,0.0024208804,0.00009039392,0.00009298379,0.006556523,0.69717,0.015414423,0.029947292,0.21834037,0.001813294],"about_ca_topic_score_codex":0.000089033034,"about_ca_topic_score_gemma":0.000009121675,"teacher_disagreement_score":0.8823403,"about_ca_system_score_codex":0.00003857763,"about_ca_system_score_gemma":0.00018026489,"threshold_uncertainty_score":0.8462133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08819508,0.00012249548,0.9062921,0.0015727358,0.0020735068,0.0000943992,0.0001439326,0.000048529862,0.0014572648],"genre_scores_gemma":[0.5969025,0.00041151422,0.3926686,0.007683614,0.0021938013,8.739682e-7,0.00012051056,0.0000132772075,0.0000052965997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793744,0.00003583849,0.00089110323,0.00009051726,0.00080398703,0.00024112086],"domain_scores_gemma":[0.99787444,0.0001351453,0.0005655012,0.0009225243,0.00020805489,0.00029434712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012805786,0.00012064493,0.0002257288,0.00030840313,0.00010657343,0.00017172184,0.0026910633,0.00011420846,0.000060940994],"category_scores_gemma":[0.00019258443,0.00008502105,0.00007253498,0.00051309384,0.00027469476,0.0014789817,0.0006694079,0.000390094,0.000109358916],"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.00016632568,0.0008927046,0.0002744317,0.00018947024,0.0003190229,0.00013638334,0.013105798,0.000005467643,0.0007205499,0.09634254,0.7130566,0.17479068],"study_design_scores_gemma":[0.0013850541,0.0018921229,0.0017369194,0.00022334862,0.000037051905,0.00061421026,0.0005504765,0.08348096,0.0003071262,0.00971284,0.899726,0.0003338977],"about_ca_topic_score_codex":0.0000036592576,"about_ca_topic_score_gemma":0.0000018856524,"teacher_disagreement_score":0.5136235,"about_ca_system_score_codex":0.000038343773,"about_ca_system_score_gemma":0.0002518854,"threshold_uncertainty_score":0.500071},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030136396,0.0002430316,0.39129078,0.00010532548,0.0001789722,0.00020497915,0.000035327696,0.00015346226,0.6077851],"genre_scores_gemma":[0.009934487,0.0004036483,0.9590185,0.0021491877,0.00051766314,0.00009518521,0.0005673681,0.00014261894,0.027171334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978145,0.00002379873,0.00036422283,0.00095660466,0.00045037476,0.00039054628],"domain_scores_gemma":[0.99670774,0.000091401176,0.00025452045,0.0027139874,0.00006835502,0.00016400972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036658737,0.0004408821,0.00047459314,0.0008039886,0.00017149436,0.00045223188,0.002748171,0.00045042293,0.00016659283],"category_scores_gemma":[0.000010802894,0.00040867925,0.00040540614,0.00008297273,0.00020655438,0.0004939588,0.00045382546,0.0006358826,0.00010306473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000575456,0.00006590964,0.00012322214,0.00004876103,0.000023081844,0.000029089593,0.000054700908,0.000003308728,7.8688686e-7,0.9917925,0.0021856336,0.0056672804],"study_design_scores_gemma":[0.0008538578,0.000087088636,0.00076308154,0.00016943304,0.000028085531,0.000007875506,0.000003643392,0.0062680487,0.00001538878,0.6123432,0.37839732,0.0010630077],"about_ca_topic_score_codex":0.0000728808,"about_ca_topic_score_gemma":0.00014352295,"teacher_disagreement_score":0.58061373,"about_ca_system_score_codex":0.000022539176,"about_ca_system_score_gemma":0.00013176726,"threshold_uncertainty_score":0.9998365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13986956,0.000013485724,0.85620224,0.0009650464,0.0025005124,0.00034488435,0.000054078526,0.000029050969,0.000021133097],"genre_scores_gemma":[0.96966875,0.0000043653667,0.03008046,0.00016110229,0.000036347075,0.00003790322,9.725181e-7,0.0000056937974,0.0000044170483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884325,0.000039967115,0.00028293653,0.00033709643,0.0002778194,0.00021892866],"domain_scores_gemma":[0.9984878,0.00023125882,0.00015105851,0.0010087598,0.00006153295,0.000059638678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027879947,0.0001324307,0.00019090818,0.000114484115,0.0004177245,0.00018337589,0.0012462506,0.00006343902,0.0000032105102],"category_scores_gemma":[0.0000052302225,0.00010149896,0.00017686277,0.00013888697,0.00013359761,0.00039695948,0.000018006818,0.00016489463,0.0000024032033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003263933,0.0035031664,0.0009146973,0.0003295984,0.00039993675,0.000016006972,0.001438154,0.06084582,0.007495724,0.25218087,0.0014625383,0.6710871],"study_design_scores_gemma":[0.005951056,0.0012341145,0.015804954,0.00056288653,0.00007967381,0.000020874599,0.00004772316,0.8840715,0.07168407,0.016972337,0.0027509185,0.0008198338],"about_ca_topic_score_codex":0.0002719731,"about_ca_topic_score_gemma":0.00026710797,"teacher_disagreement_score":0.8297992,"about_ca_system_score_codex":0.000034225704,"about_ca_system_score_gemma":0.00005238207,"threshold_uncertainty_score":0.41390076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14091358,0.00007997817,0.82365036,0.014696276,0.001334984,0.00042434531,0.000023256724,0.0006354951,0.018241744],"genre_scores_gemma":[0.86473817,0.00006857577,0.13324648,0.0017215816,0.00012447042,0.0000116315905,0.000008215164,0.000011313498,0.00006956687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980936,0.000091623704,0.00025620885,0.0006310276,0.00042674254,0.0005008061],"domain_scores_gemma":[0.99721056,0.000086167645,0.00025209802,0.0021573263,0.00005746269,0.00023639154],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007505047,0.00019470998,0.00022427215,0.00014094157,0.0013649389,0.00085446594,0.0034559246,0.000074847056,0.00012758694],"category_scores_gemma":[0.00023737446,0.00017296136,0.00011664224,0.00014584947,0.00004764442,0.00134902,0.0017937652,0.00027528257,0.00006414264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001560481,0.00010181424,0.0014860351,0.000031981835,0.00001917913,0.000015511157,0.0014739891,5.485222e-7,0.00041761808,0.9544897,0.0049962783,0.036951713],"study_design_scores_gemma":[0.002497923,0.0016426748,0.103851154,0.000640918,0.000014109403,0.000083329556,0.0004266748,0.14192112,0.013212138,0.6796372,0.05393541,0.002137377],"about_ca_topic_score_codex":0.0014567387,"about_ca_topic_score_gemma":0.00027333686,"teacher_disagreement_score":0.72382456,"about_ca_system_score_codex":0.0000496871,"about_ca_system_score_gemma":0.00012912766,"threshold_uncertainty_score":0.99993515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008363255,0.00074856234,0.9345826,0.00036243323,0.00034314048,0.00022352194,0.000041121988,0.000095769174,0.0635192],"genre_scores_gemma":[0.8825873,0.000570088,0.114253014,0.000741167,0.00044146122,0.000038988284,0.00080383045,0.00007504555,0.0004891069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810225,0.000011459929,0.0007611019,0.0003090437,0.00053829653,0.00027787033],"domain_scores_gemma":[0.9968482,0.000100902995,0.0012853994,0.0012131286,0.00051068974,0.000041646148],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00030299366,0.00036551311,0.0004521134,0.00065752305,0.00026246748,0.0012753329,0.0019322709,0.00040387642,0.000018442377],"category_scores_gemma":[0.00042349653,0.00033595276,0.000099722274,0.00024999896,0.00016478248,0.012724278,0.0009112333,0.0004900069,0.0000071664012],"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.000053437405,0.000038512113,0.00036878773,0.0037276493,0.000040805022,0.000010197828,0.005479167,0.0019193774,0.000027285747,0.22246297,0.00008654929,0.7657853],"study_design_scores_gemma":[0.001693019,0.00007619914,0.0062280577,0.009648564,0.000104526356,0.00006283982,0.000016564394,0.049775727,0.0018981618,0.7435551,0.18450819,0.0024330479],"about_ca_topic_score_codex":0.000039334696,"about_ca_topic_score_gemma":0.0000332156,"teacher_disagreement_score":0.8825037,"about_ca_system_score_codex":0.000050807615,"about_ca_system_score_gemma":0.0003744386,"threshold_uncertainty_score":0.9999092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75407207,0.0005649341,0.23702788,0.00095320336,0.0005738811,0.001024399,0.0026918561,0.00036916285,0.0027226068],"genre_scores_gemma":[0.9525664,0.000054888194,0.042962234,0.00030498914,0.0002558828,0.0000051430106,0.0001856687,0.000033114393,0.003631696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980562,0.00010683415,0.00018262962,0.0005959497,0.00029860134,0.00075984024],"domain_scores_gemma":[0.99776936,0.00024869174,0.00021374365,0.001377817,0.000098834535,0.00029158336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035061958,0.00027519962,0.0003374672,0.00032088996,0.0006540583,0.00015727899,0.0023872613,0.00014168529,0.000064589585],"category_scores_gemma":[0.00006826483,0.00031957912,0.00023721093,0.00081265654,0.000091585294,0.0060341572,0.0019851709,0.00019051168,0.0002086183],"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.0006066824,0.0015479757,0.03753876,0.0003037451,0.00039469506,0.00019122483,0.00398616,0.00004235033,0.015798284,0.79165184,0.14583986,0.002098401],"study_design_scores_gemma":[0.007542924,0.00054505916,0.39145774,0.00020313213,0.00033101492,0.00016518011,0.0022003925,0.030616987,0.0025339432,0.014028817,0.5471879,0.0031869235],"about_ca_topic_score_codex":0.00010970354,"about_ca_topic_score_gemma":0.00006823203,"teacher_disagreement_score":0.77762306,"about_ca_system_score_codex":0.00018882616,"about_ca_system_score_gemma":0.00013218712,"threshold_uncertainty_score":0.9999256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13774073,0.0001287134,0.6148935,0.0067844363,0.0029216032,0.00024348234,0.000058360976,0.00068162405,0.23654759],"genre_scores_gemma":[0.9701748,0.000035076035,0.028611034,0.0008040757,0.00023090075,0.0000039422252,0.000007830088,0.0000040981295,0.00012828037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993044,0.000006097075,0.00009614641,0.00025005377,0.00016486831,0.00017842103],"domain_scores_gemma":[0.9983857,0.0000316678,0.00006392055,0.0014170075,0.000026652047,0.00007499924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013946142,0.0000945845,0.00009265205,0.000040777213,0.00048168065,0.00047807946,0.0013511432,0.00004941559,0.00007474437],"category_scores_gemma":[0.0000416435,0.00007218539,0.000059286856,0.000054385866,0.000077037635,0.0009318549,0.00039024075,0.000113236245,0.00011761962],"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.000006931829,0.000033786488,0.0004272209,0.0000033663057,0.00000496852,0.000007805919,0.00019459396,5.4910043e-7,0.000013597859,0.97831225,0.00995398,0.011040952],"study_design_scores_gemma":[0.0007834784,0.00032040043,0.020649226,0.0000350887,0.000005479247,0.000018087614,0.000080943115,0.0044711144,0.006373866,0.3127011,0.6540484,0.0005128146],"about_ca_topic_score_codex":0.00009510249,"about_ca_topic_score_gemma":0.00020253968,"teacher_disagreement_score":0.83243406,"about_ca_system_score_codex":0.000005731301,"about_ca_system_score_gemma":0.0000181094,"threshold_uncertainty_score":0.4610131},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052342013,0.000050214003,0.93691427,0.0051328405,0.002105399,0.0012658731,0.000016607637,0.00006194619,0.0021108442],"genre_scores_gemma":[0.9882705,0.000013081655,0.010779796,0.0006133229,0.00019892139,0.00010559065,0.000013115491,0.0000039330253,0.0000017095425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976611,0.000077693294,0.00094432227,0.000086899796,0.0010553134,0.00017466431],"domain_scores_gemma":[0.9980198,0.00007798572,0.00065336714,0.00020334903,0.0008866315,0.00015883008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755861,0.0001168564,0.00017951628,0.0015187518,0.000025840176,0.000409014,0.0013747821,0.000056347224,0.000010823603],"category_scores_gemma":[0.00026862987,0.00010043947,0.0001316197,0.00079145294,0.00004898082,0.006965187,0.00015620048,0.0003343607,0.00003758076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021697873,0.00018921177,0.0050571747,0.000009943956,0.000033723383,0.000037988095,0.0017143862,0.00040956397,0.000027202314,0.97390735,0.005994432,0.012402047],"study_design_scores_gemma":[0.0054466818,0.0006691153,0.03139108,0.0004384283,0.0000084257035,0.0005005792,0.0005035025,0.32007214,0.00032015028,0.34153432,0.29867682,0.00043873215],"about_ca_topic_score_codex":0.000022403945,"about_ca_topic_score_gemma":0.000025605548,"teacher_disagreement_score":0.9359285,"about_ca_system_score_codex":0.000107728476,"about_ca_system_score_gemma":0.0002467755,"threshold_uncertainty_score":0.5049592},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113291465,0.00002203377,0.8815969,0.00041230654,0.0035178172,0.0003672622,0.00009509042,0.00032593572,0.00037116618],"genre_scores_gemma":[0.961084,0.000008747651,0.038210947,0.00017023993,0.0004584662,0.000016106607,0.0000046909213,0.000020746327,0.000026047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790424,0.00009480193,0.00033143806,0.00071475893,0.00036948238,0.000585257],"domain_scores_gemma":[0.99740696,0.0003618196,0.00016641969,0.0017038266,0.00014858537,0.00021237355],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00067540567,0.0002603343,0.00027138807,0.00018998577,0.0027594834,0.00076380343,0.001959599,0.00012405413,0.000019235777],"category_scores_gemma":[0.000017685557,0.00027334946,0.0002901334,0.0002614167,0.00014960862,0.00049731584,0.000026128218,0.00046882642,0.00004907338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035461452,0.0016450818,0.00020285051,0.00030420415,0.00039661585,0.00011640944,0.011661104,0.06537944,0.005345284,0.13609721,0.0032845929,0.7752126],"study_design_scores_gemma":[0.003092578,0.0005534181,0.00075862743,0.00019610015,0.00005844497,0.000052673313,0.00038378438,0.9431228,0.042506058,0.0037793398,0.004437391,0.0010587703],"about_ca_topic_score_codex":0.00012227579,"about_ca_topic_score_gemma":0.000044958368,"teacher_disagreement_score":0.87774336,"about_ca_system_score_codex":0.000054717682,"about_ca_system_score_gemma":0.000087885324,"threshold_uncertainty_score":0.99997187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049507942,0.000039926912,0.94785535,0.0009613889,0.00016264072,0.0008075763,0.0000036800325,0.000050908217,0.0006105635],"genre_scores_gemma":[0.9558717,0.000026223584,0.043889783,0.0000061440783,0.00009451554,0.00006991097,0.000012699014,0.000008253286,0.000020750558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976867,0.00018606018,0.0004321299,0.00045068198,0.00071464205,0.0005297754],"domain_scores_gemma":[0.997398,0.0005267266,0.000220785,0.000918681,0.0008170297,0.00011877731],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029083146,0.00011484114,0.00017583865,0.00022886178,0.0013560232,0.0006298257,0.0020965454,0.00007999054,0.000020175185],"category_scores_gemma":[0.002007409,0.00010774568,0.00010313353,0.0003200365,0.00033539376,0.0010500961,0.0012091546,0.00038326622,0.000025190926],"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.0001320288,0.00019364282,0.00080939004,0.00017999053,0.000029001436,0.0000048127495,0.0054266374,0.009102288,0.008422754,0.7959164,0.000369255,0.17941384],"study_design_scores_gemma":[0.000053859298,0.00033932834,0.00032818972,0.000064479456,0.0000026446203,0.0000010567844,0.0003718655,0.6866179,0.099421695,0.21160702,0.001069183,0.00012275316],"about_ca_topic_score_codex":0.00043724047,"about_ca_topic_score_gemma":0.00012895353,"teacher_disagreement_score":0.9063638,"about_ca_system_score_codex":0.00003286796,"about_ca_system_score_gemma":0.00019197584,"threshold_uncertainty_score":0.9999441},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15714306,0.00007990918,0.8256434,0.0005149203,0.00040086315,0.00014282012,0.000018563163,0.00006201102,0.015994465],"genre_scores_gemma":[0.98005164,0.0000085870715,0.019218115,0.00062027836,0.00007376141,0.0000029445575,0.0000047958597,0.0000029478294,0.000016915514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916244,0.00011438174,0.000106804044,0.00024358578,0.0001639883,0.00020878456],"domain_scores_gemma":[0.9976217,0.00010295816,0.000060867063,0.0021638984,0.000013836349,0.000036721325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011147824,0.00007908619,0.000081361584,0.00004815801,0.00031651682,0.0005845791,0.0023936892,0.000028012104,0.000033619297],"category_scores_gemma":[0.00009198868,0.000051347743,0.000041349707,0.00011767996,0.00009386929,0.000946484,0.0005472206,0.00013315683,0.000022784861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078602425,0.000050560055,0.0011373992,0.000004535239,0.0000035941835,0.000020885143,0.0011351217,0.000017062684,0.00026811945,0.99452966,0.00055087375,0.002274329],"study_design_scores_gemma":[0.0030650422,0.0001422273,0.0409516,0.00015137342,0.00003593897,0.0001238238,0.002402469,0.32188496,0.0046003335,0.4728573,0.15243246,0.0013525076],"about_ca_topic_score_codex":0.00048305007,"about_ca_topic_score_gemma":0.00008545066,"teacher_disagreement_score":0.8229086,"about_ca_system_score_codex":0.000006356989,"about_ca_system_score_gemma":0.00002501742,"threshold_uncertainty_score":0.563711},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13714172,0.00078117213,0.7554749,0.011283497,0.0024654218,0.0013365492,0.001753109,0.0011869373,0.08857668],"genre_scores_gemma":[0.9105199,0.00010519163,0.08732172,0.001198515,0.00044003595,0.000035156645,0.00010583054,0.000040845225,0.0002328141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99744743,0.00008290062,0.00053224695,0.00075097586,0.00066026306,0.00052616646],"domain_scores_gemma":[0.99812347,0.00012366034,0.00025626493,0.0012337253,0.00012732725,0.00013553798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038012658,0.00029724377,0.00034221853,0.00022108782,0.00018979705,0.00016569193,0.001192805,0.00012726868,0.000025450601],"category_scores_gemma":[0.000016286764,0.00027246447,0.00024364256,0.00074826204,0.00013150524,0.00052556815,0.00034050568,0.00024122033,0.00004054515],"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.00013882085,0.00089705596,0.0030369638,0.000243328,0.00018598772,0.00018941036,0.0039240746,0.00045367458,0.0452769,0.888578,0.019208975,0.037866823],"study_design_scores_gemma":[0.007106573,0.0032252679,0.042753283,0.0008676931,0.00025076183,0.00023870054,0.00040073754,0.20517589,0.45976225,0.076544344,0.198811,0.004863496],"about_ca_topic_score_codex":0.0011736489,"about_ca_topic_score_gemma":0.000057645906,"teacher_disagreement_score":0.81203365,"about_ca_system_score_codex":0.000033359942,"about_ca_system_score_gemma":0.0000741454,"threshold_uncertainty_score":0.99997276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016836885,0.000021266853,0.9587273,0.017728237,0.00036580072,0.00022207943,0.0000110759265,0.00012288317,0.0059644575],"genre_scores_gemma":[0.95821,0.0000022973134,0.04084189,0.0007970692,0.00011170435,0.000014526277,0.000003550129,0.0000022947006,0.000016685994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924076,0.000036053203,0.00008571432,0.00025033802,0.00020304392,0.00018411913],"domain_scores_gemma":[0.99853957,0.000014540694,0.000048373073,0.0012627091,0.000048182374,0.00008661902],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00031878654,0.0000645126,0.000053081545,0.00003162278,0.0013840015,0.0006943809,0.0018527629,0.000027305767,0.000011743933],"category_scores_gemma":[0.000020012329,0.00004123375,0.00004525839,0.000100333215,0.00006542144,0.00032878565,0.00037808975,0.000057021472,0.000076302545],"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.000003044768,0.0000862413,0.00024324947,0.0000022477836,0.000003508612,0.0000012162751,0.0011051575,0.00010783327,0.00020975544,0.9579803,0.015003386,0.02525411],"study_design_scores_gemma":[0.0008327497,0.00039865696,0.30452198,0.00004102396,0.000017177292,0.000015541074,0.00022374808,0.2802714,0.0024281584,0.10342572,0.306912,0.00091181236],"about_ca_topic_score_codex":0.00056625844,"about_ca_topic_score_gemma":0.0008370433,"teacher_disagreement_score":0.9413731,"about_ca_system_score_codex":0.000011809899,"about_ca_system_score_gemma":0.000028594986,"threshold_uncertainty_score":0.9999161},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10714347,0.0043418263,0.7476383,0.041807313,0.0021282735,0.0012194391,0.00038186612,0.0009504961,0.09438901],"genre_scores_gemma":[0.6731589,0.0025350468,0.3147961,0.0006046294,0.00015232635,0.00020781858,0.0012139948,0.00010425949,0.0072269584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9840643,0.010352908,0.0012178003,0.0021130212,0.00096978823,0.0012821923],"domain_scores_gemma":[0.98559284,0.002386908,0.0011087616,0.006466526,0.0036492962,0.00079567713],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0077460227,0.0008784755,0.00084145356,0.0002917139,0.0011566067,0.0023083047,0.0057876226,0.0007127159,0.0012804621],"category_scores_gemma":[0.0012841793,0.0009829077,0.00063898123,0.0012467082,0.0011240653,0.0011435698,0.0064353994,0.0013911355,0.0013400378],"study_design_candidate":"theoretical_or_conceptual","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.00000597417,0.0008136029,0.0021333033,0.00016649369,0.00013838445,0.000017834407,0.01595043,0.000036442136,0.00052938896,0.8695595,0.0032501284,0.10739847],"study_design_scores_gemma":[0.0025528509,0.0000025284023,0.061452746,0.0059537995,0.00024509404,0.0001568394,0.00031802515,0.26602402,0.059564177,0.16918895,0.43135554,0.0031854354],"about_ca_topic_score_codex":0.015508986,"about_ca_topic_score_gemma":0.0023838033,"teacher_disagreement_score":0.7003706,"about_ca_system_score_codex":0.00029895172,"about_ca_system_score_gemma":0.0009580857,"threshold_uncertainty_score":0.9996325},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7728833,0.000130652,0.22315668,0.0028225968,0.000377055,0.00016104171,0.000008045498,0.000115763,0.00034485638],"genre_scores_gemma":[0.98610294,0.000027270287,0.013075712,0.0005468237,0.00022271104,0.0000054551497,0.000009237233,0.000008367169,0.0000014779841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981907,0.000076665456,0.00030455226,0.00050202536,0.0005128579,0.00041318894],"domain_scores_gemma":[0.99918664,0.00013092111,0.0001337222,0.00025907755,0.00006684323,0.00022281568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089927827,0.00017703674,0.0002243051,0.00018128744,0.00086120685,0.0005709585,0.0006518054,0.0000824346,0.000015245284],"category_scores_gemma":[0.00008629988,0.0001759424,0.00006035209,0.00016136984,0.00007900905,0.0004179223,0.00087769504,0.00025832144,0.000008876123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007594553,0.00030504647,0.13776293,0.0003129289,0.00006818364,0.00029492236,0.046192896,0.00014254404,0.0006603833,0.23631866,0.0020544522,0.5758111],"study_design_scores_gemma":[0.0013172346,0.0002897798,0.39284012,0.00044588817,0.000011012917,0.00017217213,0.0018580521,0.5898825,0.000120074605,0.009723189,0.0027106917,0.00062931125],"about_ca_topic_score_codex":0.00048629398,"about_ca_topic_score_gemma":0.00061935786,"teacher_disagreement_score":0.5897399,"about_ca_system_score_codex":0.000035432553,"about_ca_system_score_gemma":0.00007636896,"threshold_uncertainty_score":0.7174723},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17362763,0.00037983456,0.8245892,0.00023896957,0.0005334707,0.00015964913,0.000006073571,0.00017652455,0.00028866637],"genre_scores_gemma":[0.21946338,0.00007428121,0.7796433,0.00036489544,0.00040873134,0.000010719011,0.0000066530356,0.000017021028,0.000011002202],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997826,0.000092824645,0.0003560181,0.0006402075,0.0006335572,0.00045139118],"domain_scores_gemma":[0.9956805,0.00057461427,0.00023064039,0.0029773728,0.000102182654,0.0004346617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075970544,0.00018478672,0.00022525602,0.00006420576,0.0007426492,0.00046002198,0.0050009764,0.00017451063,0.00006422154],"category_scores_gemma":[0.00791804,0.00017148125,0.00010009794,0.00012179928,0.00017458109,0.00045514855,0.004744006,0.00032102485,0.00006453113],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003821367,0.00028025845,0.12889856,0.0003697857,0.00004459091,0.00039469378,0.0010328128,0.00017952238,0.0022631122,0.004584993,0.006089419,0.85582405],"study_design_scores_gemma":[0.0011997588,0.00013628804,0.47416943,0.00027707018,0.000030563213,0.00022003523,0.000018694067,0.4536349,0.0005066326,0.052907936,0.016153438,0.00074524526],"about_ca_topic_score_codex":0.00013677962,"about_ca_topic_score_gemma":0.00010104391,"teacher_disagreement_score":0.8550788,"about_ca_system_score_codex":0.000028536524,"about_ca_system_score_gemma":0.0003541469,"threshold_uncertainty_score":0.9479206},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007149315,0.0000465276,0.94969547,0.0043941597,0.0009926037,0.00014615321,0.00006938401,0.00028958812,0.037216794],"genre_scores_gemma":[0.732844,0.000066588545,0.2653856,0.0010893844,0.00045783242,0.00000770317,0.00006022143,0.000010792012,0.00007789127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984178,0.00004555231,0.00018276981,0.00068736525,0.00034928048,0.0003172569],"domain_scores_gemma":[0.9925223,0.00013778669,0.0001338718,0.006976972,0.000052346695,0.00017674542],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004470657,0.0001399972,0.00014763219,0.000075497665,0.00052017864,0.001297157,0.0047075874,0.00008298988,0.00012526163],"category_scores_gemma":[0.0005861819,0.00011516925,0.000054925815,0.00013461136,0.00014532509,0.003396047,0.004267189,0.0002078317,0.00016815086],"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.000012484808,0.00019480445,0.0034526687,0.000007042301,0.000030495059,0.00007737341,0.00010388031,1.0380632e-7,0.00020237772,0.8467812,0.096774474,0.0523631],"study_design_scores_gemma":[0.0013185209,0.00011418306,0.12696181,0.000025393072,0.000031103325,0.00008945744,0.000031704807,0.056031827,0.00085320225,0.08354882,0.7302476,0.00074637943],"about_ca_topic_score_codex":0.00039982513,"about_ca_topic_score_gemma":0.0002470488,"teacher_disagreement_score":0.76323235,"about_ca_system_score_codex":0.000007311735,"about_ca_system_score_gemma":0.00009438511,"threshold_uncertainty_score":0.9997396},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002546521,0.0011195746,0.98576134,0.0027135878,0.0017070035,0.00045382397,0.00001923571,0.00016596352,0.007804826],"genre_scores_gemma":[0.064556606,0.00056801236,0.929848,0.003200582,0.0011823573,0.000035317913,0.000029292381,0.00009254815,0.0004872516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948051,0.0000698016,0.00061516126,0.0022721686,0.0012720278,0.000965715],"domain_scores_gemma":[0.99535495,0.0004656409,0.000447864,0.003326258,0.00019102384,0.00021427924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00121913,0.00071539794,0.0007696555,0.0015305078,0.0007800234,0.0009922374,0.0050705797,0.0005621601,0.00010989011],"category_scores_gemma":[0.00014850384,0.0006449425,0.00025841026,0.0006003034,0.001832388,0.0017571992,0.004250925,0.0012082212,0.00007426841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007928667,0.0004397648,0.0030777992,0.00015211564,0.00005755595,0.001310239,0.0048159882,0.0009901073,0.00030420983,0.5878212,0.0015726463,0.3993791],"study_design_scores_gemma":[0.00097392855,0.00043374964,0.0020914713,0.000934512,0.000019265557,0.00023783192,3.9508927e-7,0.047050454,0.0020165485,0.81532997,0.12881394,0.002097957],"about_ca_topic_score_codex":0.00010427326,"about_ca_topic_score_gemma":0.0011051949,"teacher_disagreement_score":0.39728117,"about_ca_system_score_codex":0.00020042692,"about_ca_system_score_gemma":0.00043837682,"threshold_uncertainty_score":0.9996002},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16719052,0.00001311171,0.82397336,0.0005493833,0.0001204691,0.00013011316,0.00001715077,0.00023902254,0.0077668442],"genre_scores_gemma":[0.8939792,0.0000030889635,0.105805814,0.00012930467,0.00005229951,0.0000058836745,0.000009726385,0.0000038027918,0.000010895259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99882096,0.000033549615,0.00013148047,0.00046260486,0.00030343182,0.00024794886],"domain_scores_gemma":[0.9974666,0.000044347893,0.00011942961,0.002126273,0.00008908599,0.00015425596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041667168,0.00012761308,0.00011302737,0.00005175997,0.0006007332,0.0007439462,0.001541542,0.000057292604,0.000047013527],"category_scores_gemma":[0.000053008673,0.00008227061,0.0000424927,0.00012691252,0.00012970238,0.0010307763,0.0002543601,0.00012518847,0.00004567491],"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.00001162665,0.00044658754,0.027388027,0.000013561138,0.000007667047,0.0000094687,0.00053118134,0.000023003004,0.0011882496,0.9649056,0.00027184465,0.0052031633],"study_design_scores_gemma":[0.0023362883,0.0015013474,0.5955419,0.00009785097,0.000023759161,0.000054883778,0.00030166024,0.34445912,0.009394678,0.026675168,0.018134965,0.0014783507],"about_ca_topic_score_codex":0.0002146231,"about_ca_topic_score_gemma":0.00020383361,"teacher_disagreement_score":0.93823045,"about_ca_system_score_codex":0.000012629384,"about_ca_system_score_gemma":0.000042369342,"threshold_uncertainty_score":0.717389},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20422584,0.00014088959,0.71838355,0.019744975,0.0012267095,0.00065578753,0.0011136981,0.00080238795,0.053706158],"genre_scores_gemma":[0.94205743,0.000074524716,0.05552879,0.002118826,0.000077255085,0.000003011438,0.00010488883,0.000007072116,0.00002822217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982122,0.000066337896,0.00015431785,0.0008388105,0.0003673237,0.00036098363],"domain_scores_gemma":[0.9923334,0.00008297413,0.00007363224,0.0072894637,0.000059056216,0.00016144541],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00070135924,0.0001504332,0.00014346471,0.00007812422,0.0007982176,0.0009351568,0.008824764,0.00007301108,0.00010422125],"category_scores_gemma":[0.00011246662,0.00012987395,0.000046537385,0.00012671793,0.00017111562,0.0017832835,0.004024499,0.000329547,0.00020923236],"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.000020216832,0.00016841506,0.0053343377,0.000017304124,0.000030513986,0.00008948105,0.00033975637,0.000010769122,0.0022707987,0.9301458,0.034056924,0.02751568],"study_design_scores_gemma":[0.002035254,0.0004774746,0.20388909,0.00009693806,0.000025821924,0.000081387385,0.00010601267,0.36035264,0.009041906,0.096407436,0.325662,0.0018240822],"about_ca_topic_score_codex":0.0004778217,"about_ca_topic_score_gemma":0.00021035025,"teacher_disagreement_score":0.8337384,"about_ca_system_score_codex":0.000020962418,"about_ca_system_score_gemma":0.00010600004,"threshold_uncertainty_score":0.996538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015463138,0.00017301964,0.97895175,0.004005444,0.00007970975,0.0006014215,0.000026965101,0.00016810664,0.0005304259],"genre_scores_gemma":[0.69645435,0.00073623616,0.30256665,0.000034709392,0.00003055665,0.00014206,0.000018299566,0.0000091927,0.000007951837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865586,0.00008608856,0.00035142154,0.0004907718,0.00016766544,0.00024819342],"domain_scores_gemma":[0.99344236,0.0002947481,0.00020201592,0.005895769,0.00003908968,0.0001259963],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00035258825,0.00018033224,0.00017527664,0.00024291055,0.002175702,0.00033281007,0.003111263,0.000089806184,0.000007996971],"category_scores_gemma":[0.000024790996,0.00020235137,0.000075532356,0.00022299579,0.00031939038,0.00045831676,0.0003350964,0.00046388942,0.000038523078],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005353257,0.0006529364,0.00067452766,0.000013450523,0.000025069006,8.2442006e-7,0.0016138797,0.00064061454,0.0014258833,0.012743514,0.000012379349,0.98219156],"study_design_scores_gemma":[0.0036013566,0.00018694442,0.067968756,0.00027748392,0.00010092888,0.00011964071,0.0011932524,0.8226688,0.0052217366,0.038401026,0.05861255,0.001647531],"about_ca_topic_score_codex":0.00022406882,"about_ca_topic_score_gemma":0.00006944557,"teacher_disagreement_score":0.98054403,"about_ca_system_score_codex":0.000053258635,"about_ca_system_score_gemma":0.000026234147,"threshold_uncertainty_score":0.99912333},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7783303,0.030791447,0.17564243,0.0061282953,0.00019992278,0.001007953,0.00022548408,0.00024181651,0.0074323183],"genre_scores_gemma":[0.920273,0.0020070786,0.07760405,0.000078558456,0.000004868557,0.000022310698,0.000005503306,0.0000037947773,8.437426e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991176,0.00012002358,0.00023768275,0.00025503043,0.00009724588,0.000172415],"domain_scores_gemma":[0.9968278,0.00021684842,0.0001930736,0.002620061,0.000063642714,0.00007860295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411185,0.000119991106,0.0001803133,0.00023308111,0.00069952384,0.00024415163,0.0019317736,0.00008825435,0.0000024413712],"category_scores_gemma":[0.000082192084,0.000118746335,0.0000704582,0.0002692731,0.0006673874,0.00069461577,0.0014158463,0.00028509102,2.9959816e-7],"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.0000054007974,0.00023005356,0.10768931,0.000038114114,0.000026208458,0.0000011830232,0.0035245775,0.0000010468567,0.0003423787,0.8785597,0.00010107175,0.009480921],"study_design_scores_gemma":[0.0013387168,0.00006849961,0.81852543,0.00019463293,0.000025518058,0.0000058108963,0.0007106149,0.006130642,0.00061675,0.16287623,0.009102767,0.0004043695],"about_ca_topic_score_codex":0.00020707116,"about_ca_topic_score_gemma":0.0006339765,"teacher_disagreement_score":0.7156835,"about_ca_system_score_codex":0.0000023940977,"about_ca_system_score_gemma":0.000018438948,"threshold_uncertainty_score":0.53802425},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016721198,0.00014298173,0.9936522,0.0011685287,0.0010530493,0.00073709124,0.000020619838,0.00017079587,0.0013825734],"genre_scores_gemma":[0.55907387,0.000010563164,0.43969023,0.0007892896,0.00030898055,0.00006532158,0.000012606218,0.000027392365,0.000021752401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612164,0.000027474423,0.0004907868,0.0019182308,0.000789927,0.0006519416],"domain_scores_gemma":[0.9962816,0.00021313725,0.0002966081,0.0028132698,0.0001642892,0.00023109652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009739448,0.00046527354,0.0004394184,0.0015829714,0.0004884581,0.00071342586,0.004506896,0.00026702014,0.00000763907],"category_scores_gemma":[0.00012745587,0.0004680981,0.00013818365,0.0007265563,0.00059461966,0.00035114854,0.0014324859,0.0007876266,0.000059397287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022543927,0.0002051424,0.00040136275,0.00008803559,0.000011542115,0.00005414343,0.0012139907,0.30241108,0.001332343,0.13497083,0.000052890708,0.5592361],"study_design_scores_gemma":[0.00035529092,0.000087887696,0.0015056212,0.00045920667,0.0000066292905,0.000024665092,2.0518274e-7,0.91882735,0.0020314571,0.06715413,0.008746667,0.00080087583],"about_ca_topic_score_codex":0.00012037697,"about_ca_topic_score_gemma":0.0002674417,"teacher_disagreement_score":0.6164163,"about_ca_system_score_codex":0.0003070299,"about_ca_system_score_gemma":0.000438396,"threshold_uncertainty_score":0.9997771},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05031809,0.08895038,0.6397745,0.034708284,0.18014559,0.0026064126,0.0000885279,0.0004841286,0.0029240886],"genre_scores_gemma":[0.2969201,0.011122396,0.08598861,0.00048196616,0.6048983,0.00019867688,0.00020140508,0.00007200751,0.000116571035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948543,0.0014300084,0.00057474955,0.001069912,0.0012412439,0.00082981],"domain_scores_gemma":[0.9966373,0.00020358525,0.00023200996,0.0018994464,0.0007689145,0.00025877776],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0052464893,0.0002929832,0.0004149846,0.0008026833,0.0027791115,0.0040081847,0.0021232984,0.00028806386,0.000004151767],"category_scores_gemma":[0.000024889958,0.0002648096,0.00007477557,0.00063204224,0.00026944675,0.0022203329,0.0013981736,0.0009786759,0.000011337771],"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.00001907237,0.00010261906,0.0014612119,0.0002791294,0.000029035271,0.00014145431,0.0056632147,0.00009642151,0.000082836355,0.6071896,0.15490782,0.23002757],"study_design_scores_gemma":[0.0006029902,0.00018337641,0.004123563,0.000102801576,0.0000022037896,0.000087510154,0.0020090104,0.09640134,0.000044445027,0.00049272506,0.8956055,0.0003445243],"about_ca_topic_score_codex":0.00021589994,"about_ca_topic_score_gemma":0.00063873327,"teacher_disagreement_score":0.7406977,"about_ca_system_score_codex":0.000079504214,"about_ca_system_score_gemma":0.00018646473,"threshold_uncertainty_score":0.9999804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029112665,0.0005313559,0.9630447,0.00057694764,0.0040672366,0.0013899024,0.0009875012,0.00028384494,0.000005814267],"genre_scores_gemma":[0.50987333,0.000014911847,0.4890101,0.00047974518,0.00028166405,0.000017099068,0.0003076519,0.00001539829,1.2294525e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993299,0.00019605069,0.0005398946,0.0036094745,0.0011802486,0.0011753239],"domain_scores_gemma":[0.9902707,0.0006868124,0.00028092743,0.008077587,0.0004054172,0.00027857753],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021454142,0.0006032475,0.0006657887,0.00090206077,0.0004434333,0.002185868,0.017737672,0.00043856146,0.000012210554],"category_scores_gemma":[0.00030820986,0.00054242555,0.00012924008,0.0023218717,0.00077434676,0.0021731118,0.011827273,0.0012298446,0.000006229798],"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.0001009202,0.0004696894,0.0059877858,0.000847674,0.00005044569,0.000040812047,0.007111445,0.5109394,0.0024495837,0.0145895975,0.00030292512,0.45710966],"study_design_scores_gemma":[0.0004412848,0.00019957632,0.0018689606,0.00014927654,0.000008905966,0.000015304591,0.0000014918228,0.9241544,0.0024306076,0.069614634,0.00046392294,0.0006516491],"about_ca_topic_score_codex":0.00026225141,"about_ca_topic_score_gemma":0.00048145698,"teacher_disagreement_score":0.48076063,"about_ca_system_score_codex":0.00013271389,"about_ca_system_score_gemma":0.0012692352,"threshold_uncertainty_score":0.99970275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20683993,0.000076477,0.7916754,0.00014462665,0.00021038909,0.00010258123,0.00026591035,0.000037727506,0.00064698374],"genre_scores_gemma":[0.92469853,0.000013308199,0.07493086,0.00006632482,0.00003275279,5.8150385e-7,0.0002543135,0.0000024542057,9.012425e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989475,0.00004259615,0.00023634691,0.00042197196,0.00018435356,0.00016721897],"domain_scores_gemma":[0.9970696,0.00007147581,0.0002206576,0.002564491,0.000026412534,0.00004735209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077163865,0.00007998399,0.00012050665,0.00005888429,0.00017755831,0.00021535192,0.0029009935,0.00003198084,0.000011275627],"category_scores_gemma":[0.00009605596,0.00007848345,0.000018875018,0.000111053196,0.00006406655,0.0029355958,0.0027570555,0.00011663298,0.0000029551384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000461603,0.0011342487,0.10205789,0.00040461624,0.000046932728,0.000040080748,0.004069685,0.00001541529,0.023518555,0.50863755,0.03297997,0.3270489],"study_design_scores_gemma":[0.0018575088,0.00006770511,0.0143033,0.00010254274,0.000010867381,0.000005719894,0.00030484147,0.95561475,0.014738849,0.01020172,0.0023224638,0.00046973236],"about_ca_topic_score_codex":0.003564891,"about_ca_topic_score_gemma":0.00059309334,"teacher_disagreement_score":0.9555993,"about_ca_system_score_codex":0.00000809944,"about_ca_system_score_gemma":0.000027618327,"threshold_uncertainty_score":0.5390816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2535844,0.0005103355,0.73073196,0.009208618,0.0013209735,0.00072053407,0.00058181136,0.0013017126,0.0020396418],"genre_scores_gemma":[0.8673343,0.0000875952,0.13229775,0.00009505011,0.000031093823,0.000019565492,0.00011181544,0.000016022233,0.0000068134295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997543,0.000059442795,0.00064313144,0.00079650973,0.00047773507,0.00048017513],"domain_scores_gemma":[0.9959334,0.00005740578,0.0005282033,0.0031988558,0.000177059,0.00010507635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065641967,0.0002833264,0.0005113696,0.0010383809,0.00017158863,0.000056007746,0.0036234898,0.0003584829,0.00004124717],"category_scores_gemma":[0.00022935377,0.00028227016,0.00010962322,0.0022727528,0.00074722356,0.0015774913,0.0013379909,0.00037663005,0.000020771702],"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.000019490726,0.00027561004,0.024074076,0.00015305835,0.00022119188,0.000013526797,0.0003471988,0.00002693845,0.012334388,0.82429653,0.0103512565,0.12788671],"study_design_scores_gemma":[0.0049616653,0.00111429,0.013813697,0.00031461462,0.00026821322,0.00007301886,0.0009729177,0.014664955,0.14823118,0.07566076,0.73832726,0.0015974276],"about_ca_topic_score_codex":0.00023229585,"about_ca_topic_score_gemma":0.00043133806,"teacher_disagreement_score":0.74863577,"about_ca_system_score_codex":0.000035296223,"about_ca_system_score_gemma":0.0001698369,"threshold_uncertainty_score":0.9999629},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020127764,0.00015062059,0.97343963,0.0037369218,0.00063662545,0.0017043967,0.0000059790354,0.00007334506,0.00012472221],"genre_scores_gemma":[0.95575595,0.0000055472806,0.042561747,0.00093767623,0.0006074255,0.00011640246,0.0000027240949,0.000009642476,0.000002875188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860966,0.00015064857,0.00023291784,0.00033201082,0.00042749592,0.00024725555],"domain_scores_gemma":[0.99795115,0.00011675138,0.0003512946,0.0013416777,0.00009189803,0.00014720256],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011126413,0.00016881253,0.00014330214,0.00011749899,0.0017171152,0.0023365542,0.0026888999,0.00008815099,0.0000067275264],"category_scores_gemma":[0.000058101134,0.00010984487,0.000086692155,0.00011506859,0.00011853382,0.0003939859,0.00068340113,0.0007964049,0.0000058829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039050722,0.0015960733,0.0032401844,0.00023939298,0.00021387948,0.00035022167,0.003039522,0.016457994,0.014636095,0.37122,0.027171548,0.5614446],"study_design_scores_gemma":[0.0009734719,0.00021929521,0.047852885,0.00025701188,0.000011333909,0.00012362856,0.000006720087,0.93000126,0.0008628369,0.015094882,0.00433303,0.00026361897],"about_ca_topic_score_codex":0.0000015971037,"about_ca_topic_score_gemma":9.405743e-7,"teacher_disagreement_score":0.9356282,"about_ca_system_score_codex":0.000019494366,"about_ca_system_score_gemma":0.00003843857,"threshold_uncertainty_score":0.9995825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030537099,0.0002474256,0.96335804,0.0022933555,0.0017199126,0.0012545042,0.000112339934,0.0003323783,0.00014494976],"genre_scores_gemma":[0.9695628,0.0000053997887,0.02891564,0.000742875,0.000458796,0.00023124939,0.0000633317,0.000016744743,0.0000031119084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977827,0.00010739816,0.00039069718,0.00083816494,0.0003311389,0.0005498757],"domain_scores_gemma":[0.99532795,0.0006063437,0.00040758407,0.003037062,0.00038316398,0.00023789916],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00064851384,0.00030301514,0.00038200952,0.0001397996,0.0011597708,0.0019895057,0.006734409,0.0001243421,0.00001351748],"category_scores_gemma":[0.0003129423,0.00030547634,0.00025042403,0.00025543506,0.00017699317,0.0019070626,0.0012917958,0.0002247569,0.000009600251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007247956,0.0031398656,0.045003433,0.0021051813,0.00056410173,0.00008952329,0.007702374,0.011065266,0.00037584023,0.59799623,0.2388183,0.092415094],"study_design_scores_gemma":[0.0040308307,0.00023538082,0.016355641,0.00012236908,0.000033528722,0.0000038822063,0.000007961374,0.8607052,0.0006790521,0.06829601,0.04889564,0.00063452224],"about_ca_topic_score_codex":0.00018705464,"about_ca_topic_score_gemma":0.00010572081,"teacher_disagreement_score":0.93902576,"about_ca_system_score_codex":0.000042304597,"about_ca_system_score_gemma":0.00018509844,"threshold_uncertainty_score":0.99993974},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79546714,0.00058197184,0.18835488,0.005141878,0.00047928136,0.00027901932,0.000014857581,0.00011340854,0.009567546],"genre_scores_gemma":[0.9805856,0.00007437047,0.01903874,0.00022744469,0.000049404778,0.0000058787837,0.0000036845533,0.0000025246463,0.0000124015905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991634,0.000026299855,0.00011974607,0.00032165862,0.00016756434,0.00020133595],"domain_scores_gemma":[0.99844944,0.000021184125,0.000056559096,0.0013788855,0.000023833047,0.00007007326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032139895,0.0000879434,0.00010053107,0.000055535347,0.00025136996,0.00051208376,0.0015538164,0.000043272965,0.000016125783],"category_scores_gemma":[0.00006391719,0.00007564656,0.00002663384,0.00008153485,0.0000510385,0.0009243027,0.0020273481,0.000109766006,0.0000064381206],"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.000011821566,0.0001674505,0.10376088,0.00006262569,0.000023473049,0.00010645566,0.0031390747,0.000012214251,0.0012052311,0.86725116,0.011514167,0.012745455],"study_design_scores_gemma":[0.0020974712,0.00016985036,0.43110588,0.00014567649,0.000009757998,0.00002662642,0.000193744,0.08631525,0.0013043074,0.21639168,0.26143584,0.0008039141],"about_ca_topic_score_codex":0.00034542434,"about_ca_topic_score_gemma":0.0002663444,"teacher_disagreement_score":0.6508595,"about_ca_system_score_codex":0.000008951101,"about_ca_system_score_gemma":0.000017134696,"threshold_uncertainty_score":0.49380353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86553234,0.00016072791,0.05559715,0.017178224,0.0009610214,0.00031644868,0.000018128021,0.00021533447,0.06002065],"genre_scores_gemma":[0.99597824,0.000018342189,0.0030500991,0.0008742861,0.0000636701,0.0000039905576,0.0000018465829,0.00000120246,0.000008327839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994488,0.00003102893,0.000075533666,0.00017545778,0.00013531449,0.0001338779],"domain_scores_gemma":[0.9983386,0.000036966663,0.00004302572,0.0015435476,0.000013827291,0.00002403296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002751046,0.000055980858,0.00005374492,0.00002989754,0.00027150667,0.00062997214,0.003623389,0.00002499689,0.000019733852],"category_scores_gemma":[0.00000858052,0.000033531953,0.00003250588,0.000091912065,0.000031712258,0.0007609979,0.0005724821,0.00008447357,0.000044300737],"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.00000259212,0.00008500213,0.039412748,0.000020408861,0.0000042226575,0.000022092283,0.003417884,5.383498e-7,0.00003976246,0.9437682,0.0034470728,0.009779454],"study_design_scores_gemma":[0.00079819496,0.000062324645,0.4993769,0.0000458065,0.0000044891426,0.000020599271,0.00064537965,0.031076878,0.00028509364,0.13927804,0.32804686,0.00035941292],"about_ca_topic_score_codex":0.00034297234,"about_ca_topic_score_gemma":0.0010729206,"teacher_disagreement_score":0.8044902,"about_ca_system_score_codex":0.0000023712942,"about_ca_system_score_gemma":0.000015197214,"threshold_uncertainty_score":0.67332184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5469682,0.0004072199,0.4408471,0.0055486206,0.00021141225,0.0003703105,0.00022099583,0.0005581907,0.004867908],"genre_scores_gemma":[0.8942758,0.000039443268,0.1051316,0.0003223228,0.000103450555,0.000008105643,0.00008904953,0.000009572505,0.000020689007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885136,0.000053408112,0.00014883983,0.00038374023,0.00029732945,0.00026533724],"domain_scores_gemma":[0.9972231,0.00007017606,0.000096040836,0.0022644524,0.00016279116,0.00018348699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010324911,0.00016458635,0.00014383317,0.00012081137,0.00080805144,0.00047976992,0.005358309,0.000065366265,0.0001079477],"category_scores_gemma":[0.000010642144,0.00014611457,0.000059795817,0.0008530376,0.00033539,0.0012900648,0.0026946494,0.0003493033,0.000022249633],"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.000036578465,0.000105105464,0.022695754,0.000016795226,0.00009894155,0.0000047512203,0.010399329,0.0000010876123,0.00067178975,0.9475399,0.003788286,0.014641632],"study_design_scores_gemma":[0.0075400025,0.0013634401,0.19769654,0.00081880525,0.0002601161,0.0005402035,0.005708594,0.4482693,0.0039662845,0.16234693,0.16666624,0.004823522],"about_ca_topic_score_codex":0.00065130304,"about_ca_topic_score_gemma":0.0027536296,"teacher_disagreement_score":0.785193,"about_ca_system_score_codex":0.00002917751,"about_ca_system_score_gemma":0.00015247236,"threshold_uncertainty_score":0.9957161},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47874022,0.00014453204,0.5148813,0.0012072976,0.0005748954,0.00021191452,0.000002711629,0.00022782668,0.004009263],"genre_scores_gemma":[0.80768013,0.000014320804,0.19200203,0.00015564944,0.00010777501,0.0000035722023,0.0000026203832,0.000007833893,0.000026055888],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980107,0.00008739781,0.00033596976,0.0008007328,0.00026446016,0.00050075055],"domain_scores_gemma":[0.99620146,0.00011725119,0.00020486143,0.0032929596,0.000067176,0.000116309275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076794904,0.00020518976,0.00026037355,0.00017466518,0.0006172989,0.00082716317,0.0046388297,0.0000657291,0.000025409665],"category_scores_gemma":[0.0006348754,0.00019073916,0.000100445235,0.00025702323,0.00009189683,0.0012252358,0.0042311284,0.00031989635,0.00003440622],"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.00007408432,0.0014163963,0.36594072,0.000373225,0.00010587534,0.00017235131,0.011801099,0.0006552214,0.06572554,0.21556947,0.005820423,0.3323456],"study_design_scores_gemma":[0.0016948651,0.000064669046,0.8462298,0.0002611422,0.0000066090965,0.000012833018,0.000104718056,0.12347861,0.0176494,0.0069444473,0.0026769466,0.0008759504],"about_ca_topic_score_codex":0.0012361218,"about_ca_topic_score_gemma":0.00095744204,"teacher_disagreement_score":0.4802891,"about_ca_system_score_codex":0.000026907288,"about_ca_system_score_gemma":0.000047014903,"threshold_uncertainty_score":0.86201763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5067423,0.00005574284,0.48958126,0.000058013768,0.0022743077,0.00011570454,0.00009813199,0.00025646688,0.0008180747],"genre_scores_gemma":[0.9862091,0.0000050119957,0.01193441,0.0009796872,0.00072521967,0.0000011679192,0.000118046104,0.000016206772,0.000011151043],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753433,0.00025788692,0.00040103498,0.0009903723,0.00033607776,0.00048028948],"domain_scores_gemma":[0.9971672,0.00042922725,0.0001887795,0.0019111396,0.00017072631,0.00013287454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135139,0.00025303348,0.0002588313,0.00017631827,0.0001537504,0.00043641814,0.0035275656,0.000101021775,0.000031623815],"category_scores_gemma":[0.00011118151,0.00024334202,0.000066065855,0.00050050515,0.00014353816,0.00050699257,0.0014265165,0.0003466566,0.00041236973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051469204,0.001524241,0.081154846,0.00017198073,0.0007601342,0.00039990584,0.021142421,0.00042209701,0.0045149266,0.17927976,0.5467013,0.1634137],"study_design_scores_gemma":[0.0009135534,0.0006274505,0.08271598,0.00027649268,0.000015476184,0.00009089689,0.000046363624,0.86975336,0.0033533485,0.002338369,0.03889594,0.00097279466],"about_ca_topic_score_codex":0.0012968166,"about_ca_topic_score_gemma":0.00097504817,"teacher_disagreement_score":0.86933124,"about_ca_system_score_codex":0.00005730827,"about_ca_system_score_gemma":0.000079442034,"threshold_uncertainty_score":0.99231994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33588985,0.00030958926,0.6483761,0.0047122263,0.0004139219,0.0009896696,0.000021803513,0.008150198,0.001136639],"genre_scores_gemma":[0.80993277,0.000034807268,0.18964991,0.0000782213,0.000064398446,0.00019145024,0.0000039039155,0.000022784601,0.000021754535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976595,0.0000055762907,0.00033783892,0.00093427,0.00027278785,0.0007899938],"domain_scores_gemma":[0.9984646,0.00010908733,0.00024975467,0.000694652,0.00041790155,0.0000640283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054160843,0.00033458468,0.00031103683,0.00049434387,0.00049836986,0.0004865852,0.0026140881,0.00025631158,0.0000057903053],"category_scores_gemma":[0.0010789961,0.00030046309,0.00010880465,0.0010714912,0.00025595684,0.0010131043,0.0012738877,0.00032972536,0.000016839602],"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.00009968504,0.0002144475,0.00050630403,0.00030937974,0.00009777241,0.0000019076213,0.004673905,3.1204962e-7,0.17070717,0.77482295,0.0062224213,0.04234376],"study_design_scores_gemma":[0.00053016364,0.00073051703,0.00007370577,0.00017888921,0.000023428709,0.0000086236,0.0012435927,0.014871409,0.83057463,0.13469252,0.01657623,0.00049627625],"about_ca_topic_score_codex":0.000008584868,"about_ca_topic_score_gemma":0.000008297888,"teacher_disagreement_score":0.65986747,"about_ca_system_score_codex":0.00006879053,"about_ca_system_score_gemma":0.000044156193,"threshold_uncertainty_score":0.99994475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.373914,0.00005578655,0.6255485,0.00017001053,0.00006112515,0.00013824036,0.000009671285,0.000052882766,0.000049785158],"genre_scores_gemma":[0.66785204,0.000004491387,0.33203492,0.00006582216,0.000013208849,0.0000063606935,0.000019855326,0.0000029112362,3.924827e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930364,0.00004196299,0.0001178627,0.0002565078,0.00013632377,0.00014371982],"domain_scores_gemma":[0.9982838,0.000044842425,0.00011307169,0.0013947058,0.00008933331,0.00007424812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051039,0.000082941355,0.0000894824,0.00007579485,0.0009412329,0.0009488246,0.00097101246,0.000052845513,0.0000041079466],"category_scores_gemma":[0.000025787831,0.000080110935,0.00004224976,0.000074505355,0.00009320893,0.0014979742,0.00022100589,0.00006531589,0.0000021007475],"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.000016993108,0.00016277134,0.004253256,0.00004165204,0.000008300082,5.6927905e-7,0.00028424166,0.0002131566,0.00818468,0.98462063,0.00007213558,0.0021415884],"study_design_scores_gemma":[0.00058873114,0.000065440014,0.012517646,0.000022596905,0.000007890044,0.0000018072415,0.000030035517,0.96029806,0.0014810057,0.024350356,0.00047377357,0.00016266578],"about_ca_topic_score_codex":0.00016026502,"about_ca_topic_score_gemma":0.00015578474,"teacher_disagreement_score":0.9602703,"about_ca_system_score_codex":0.000013924793,"about_ca_system_score_gemma":0.000028592509,"threshold_uncertainty_score":0.91495377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47432286,0.00010522684,0.51048636,0.0007697022,0.000036850088,0.00011488212,5.572757e-7,0.000059305232,0.014104274],"genre_scores_gemma":[0.8926219,0.000024827585,0.107257895,0.00007196619,0.0000034480163,0.0000037627149,0.0000023040338,0.0000032312132,0.000010679003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991552,0.000067144494,0.00020531139,0.00023297075,0.00017916634,0.00016017746],"domain_scores_gemma":[0.9970746,0.000106559506,0.00021452841,0.0025180907,0.000049647042,0.00003659185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062699465,0.00008800249,0.00014141327,0.000120746095,0.00014979723,0.0002712318,0.0043336498,0.00003936135,0.000012077598],"category_scores_gemma":[0.00016079424,0.000069580994,0.000033498247,0.0001623402,0.000119450466,0.0022293867,0.002501476,0.00017467838,0.0000023710716],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034200035,0.00030968143,0.2570834,0.0000869436,0.000018261979,0.000007687945,0.01221409,0.000017470767,0.00082670443,0.709136,0.00042342473,0.019842144],"study_design_scores_gemma":[0.0016328782,0.00032920353,0.67598736,0.0012459606,0.000013090232,0.000021857422,0.0004711913,0.27218202,0.009398287,0.036072712,0.0019115527,0.0007338573],"about_ca_topic_score_codex":0.0031703685,"about_ca_topic_score_gemma":0.00043135104,"teacher_disagreement_score":0.6730633,"about_ca_system_score_codex":0.000012395941,"about_ca_system_score_gemma":0.000029909796,"threshold_uncertainty_score":0.80530715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81379896,0.009293822,0.173284,0.0012662094,0.00009393747,0.0005036454,0.000045795186,0.00023104352,0.0014826187],"genre_scores_gemma":[0.8306728,0.001992438,0.16706637,0.00011218623,0.000020576274,0.000016537519,0.00011088052,0.000006739316,0.0000014639102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869996,0.00021552849,0.00031317357,0.00042704953,0.000109949324,0.00023435635],"domain_scores_gemma":[0.9945293,0.0003128342,0.00011423666,0.004857609,0.000101106634,0.000084880274],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009076704,0.00013468436,0.00018571761,0.00014209496,0.0007128017,0.00028331732,0.003171948,0.00007338079,0.0000028622887],"category_scores_gemma":[0.000026954125,0.00014158362,0.000016928852,0.0006262096,0.0004206987,0.00075339794,0.008102821,0.0003033473,0.000004116033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010510449,0.0005010994,0.048003938,0.000080798694,0.00003990627,0.0000018153847,0.008300744,0.000007740332,0.00062333,0.43810585,0.0008849569,0.5034393],"study_design_scores_gemma":[0.0004544102,0.00006909067,0.008400548,0.00017137114,0.0000058942796,0.000023485978,0.0003777494,0.9518899,0.00004592088,0.0029618551,0.035356693,0.00024308043],"about_ca_topic_score_codex":0.0003641013,"about_ca_topic_score_gemma":0.00074315345,"teacher_disagreement_score":0.9518822,"about_ca_system_score_codex":0.000014457466,"about_ca_system_score_gemma":0.000041180636,"threshold_uncertainty_score":0.9999195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33603224,0.0001796386,0.6617858,0.0015644734,0.00023657588,0.000095220355,0.0000032810658,0.00001668468,0.00008606455],"genre_scores_gemma":[0.87421507,0.00007352588,0.12485682,0.00046253222,0.0003836395,0.0000011371521,5.5393247e-7,0.000006239519,4.9772876e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983445,0.00016202818,0.000419371,0.00030090744,0.00048624934,0.00028697218],"domain_scores_gemma":[0.9988291,0.0001447162,0.00030820226,0.00039579344,0.000106847074,0.00021531408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067831477,0.00018215805,0.0003269915,0.00024465285,0.00007929509,0.00015457635,0.0005110048,0.0000943591,0.000015450702],"category_scores_gemma":[0.000016292946,0.00014030369,0.000073867115,0.00029535376,0.0002018475,0.0010792637,0.0003859271,0.0005332416,0.0000060231773],"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.002159671,0.00558951,0.2717707,0.0003040511,0.00081117393,0.00762153,0.055645674,0.0003208167,0.00023486654,0.54127276,0.020356938,0.09391235],"study_design_scores_gemma":[0.010649036,0.008987917,0.46246052,0.0006107428,0.00011342463,0.013061999,0.00028511637,0.1775575,0.0008413464,0.19337767,0.13031714,0.0017375979],"about_ca_topic_score_codex":0.000017538365,"about_ca_topic_score_gemma":0.00005659469,"teacher_disagreement_score":0.5381828,"about_ca_system_score_codex":0.00003794712,"about_ca_system_score_gemma":0.00011271554,"threshold_uncertainty_score":0.5721418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001818131,0.00031937283,0.994897,0.00042768606,0.0004113898,0.00077164924,0.000015299276,0.0001287106,0.0012107558],"genre_scores_gemma":[0.74286556,0.000006673503,0.2562757,0.0006446474,0.00013902993,0.000021050762,0.0000068748113,0.000023305336,0.000017122666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964589,0.000022088963,0.0005035291,0.0014819468,0.0010049772,0.0005285428],"domain_scores_gemma":[0.9968192,0.000086843786,0.00031404794,0.0020818708,0.0004969482,0.00020108925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059033,0.00049783813,0.00057786505,0.0007845598,0.00018425229,0.0003126427,0.0036220562,0.00025289037,0.00002305881],"category_scores_gemma":[0.000024238288,0.00037333005,0.0001075827,0.0010736622,0.0011388719,0.00061389315,0.0014349269,0.0006008266,0.000044413002],"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.00043085194,0.00087780744,0.0031801604,0.0005606903,0.00021363886,0.00007807499,0.03756924,0.015401001,0.011563739,0.75302494,0.0017482588,0.1753516],"study_design_scores_gemma":[0.0019266766,0.0051878565,0.0024082244,0.0058888937,0.0001053787,0.00028019544,0.000012097128,0.50255865,0.12352249,0.31738004,0.034649726,0.006079778],"about_ca_topic_score_codex":0.00003758094,"about_ca_topic_score_gemma":0.00027081592,"teacher_disagreement_score":0.74104744,"about_ca_system_score_codex":0.00010184907,"about_ca_system_score_gemma":0.0003630053,"threshold_uncertainty_score":0.99987185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080608666,0.015429063,0.8576781,0.0020576513,0.00018015146,0.0002430509,0.0002322549,0.0002857508,0.043285277],"genre_scores_gemma":[0.8984308,0.0012440344,0.10010885,0.00014307763,0.0000128714255,0.000015737267,0.000040022413,0.000003154173,0.0000014155445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99901474,0.000121794576,0.00028437393,0.00025549976,0.00015112964,0.00017249603],"domain_scores_gemma":[0.9967883,0.00018317712,0.00015016874,0.0026351847,0.00015178732,0.00009136097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549448,0.000115115734,0.0002329527,0.0007925073,0.0004612994,0.000089173045,0.0019752919,0.000064100495,0.000025734318],"category_scores_gemma":[0.000018084416,0.00010982024,0.00019365922,0.0048885825,0.0010190309,0.00044397198,0.00061349233,0.00013588049,0.0000030864128],"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.0000048163984,0.00014021274,0.016931234,0.00000503397,0.0003787989,8.801709e-8,0.0014899594,2.7799746e-7,0.0001352421,0.9619247,0.00021950783,0.018770158],"study_design_scores_gemma":[0.0008743436,0.00048523257,0.53561753,0.000077051576,0.0013783242,0.0000064152164,0.002609814,0.019233126,0.0012906244,0.22106074,0.2164278,0.0009389648],"about_ca_topic_score_codex":0.00011447314,"about_ca_topic_score_gemma":0.0007344985,"teacher_disagreement_score":0.81782216,"about_ca_system_score_codex":0.0000029501941,"about_ca_system_score_gemma":0.000024302439,"threshold_uncertainty_score":0.44783393},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88032824,0.000428691,0.07958185,0.015190432,0.0003777623,0.0005317765,0.0000046772616,0.014717372,0.008839179],"genre_scores_gemma":[0.90191287,0.00012478516,0.09706999,0.00069568324,0.000084406456,0.0000553576,0.0000033101635,0.000029103494,0.000024512296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971521,0.000015412896,0.00041928526,0.0010769108,0.00054768816,0.00078861235],"domain_scores_gemma":[0.99793637,0.00013975245,0.00029904538,0.0010750399,0.00045974448,0.000090047135],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006668227,0.00040305854,0.000341463,0.0006226062,0.00070208206,0.0006087666,0.005592371,0.0002801659,0.00003054336],"category_scores_gemma":[0.003605132,0.00036958785,0.00009878235,0.002469159,0.00018362046,0.0016087523,0.0061900304,0.0008991635,0.00031313265],"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.00013488013,0.00036455135,0.010484854,0.00043442886,0.00012070195,0.000026463238,0.011441658,0.00000430767,0.11969533,0.758559,0.005328249,0.09340557],"study_design_scores_gemma":[0.00051321427,0.0009348616,0.00048975635,0.00040384012,0.000016635298,0.000049831626,0.0011242591,0.017412651,0.6089785,0.31758225,0.051672485,0.00082168763],"about_ca_topic_score_codex":0.00009913662,"about_ca_topic_score_gemma":0.000021510003,"teacher_disagreement_score":0.4892832,"about_ca_system_score_codex":0.00007476731,"about_ca_system_score_gemma":0.00005432676,"threshold_uncertainty_score":0.9998756},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013361331,0.000031390828,0.9841853,0.0006870196,0.0002707239,0.0003976868,0.0000034656643,0.0001680787,0.00089504203],"genre_scores_gemma":[0.87775296,0.00002465083,0.11944716,0.0025139523,0.00016916316,0.000058877155,0.000026026126,0.0000058525243,0.0000013867228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997924,0.00014758954,0.0003362378,0.00014309461,0.0012466226,0.00020248281],"domain_scores_gemma":[0.998702,0.00026686248,0.00013500331,0.00048667626,0.00016645459,0.00024300552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578264,0.000130943,0.00013189221,0.00014180543,0.00019000507,0.00012726185,0.00047051362,0.00017261611,0.00019874811],"category_scores_gemma":[0.00029148196,0.000094676376,0.000032110976,0.00039665043,0.00027446842,0.00050826854,0.00013502342,0.00024399023,0.0001049474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022727883,0.0007340004,0.00048689553,0.00048356657,0.00004040034,0.00004240918,0.019297697,0.00027594547,0.000048278,0.2561085,0.09616396,0.62609106],"study_design_scores_gemma":[0.00068064686,0.00040910937,0.0007113006,0.0001866493,0.00000783454,0.000017072967,0.000075030795,0.98531234,0.00007701844,0.009444594,0.002947939,0.00013044098],"about_ca_topic_score_codex":0.0000014777447,"about_ca_topic_score_gemma":0.0000010984322,"teacher_disagreement_score":0.98503643,"about_ca_system_score_codex":0.0000250184,"about_ca_system_score_gemma":0.00019325194,"threshold_uncertainty_score":0.38607904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003462731,0.00028137516,0.86040217,0.0004331023,0.0006074834,0.00021138231,0.000033299384,0.00011374308,0.13788284],"genre_scores_gemma":[0.14020625,0.012712877,0.84090734,0.002153642,0.00046309238,0.0001319802,0.0008040409,0.00003416087,0.0025866453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827856,0.000025261917,0.00064804207,0.0003400055,0.0005034066,0.00020471646],"domain_scores_gemma":[0.9966236,0.00018029993,0.00036465618,0.002298332,0.00043737362,0.000095741336],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012775887,0.00018469845,0.00017499502,0.0010436666,0.0008078308,0.0012524263,0.0033502528,0.00010542121,0.00002371194],"category_scores_gemma":[0.000054479642,0.00019528354,0.000050256225,0.00064252847,0.001300999,0.011170053,0.002007965,0.00031624708,0.000117075884],"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.000001114994,0.000009759133,0.000029433852,0.000011512639,0.0000029531607,9.982106e-8,0.0011642604,0.000005568694,0.000002894302,0.9244624,0.0005533918,0.07375663],"study_design_scores_gemma":[0.00019103884,0.00003389831,0.0019919982,0.00016161615,0.0000052752125,0.0000242473,0.00001882412,0.12686388,0.000023185588,0.14735243,0.72294986,0.00038376357],"about_ca_topic_score_codex":0.000006898992,"about_ca_topic_score_gemma":0.000020934549,"teacher_disagreement_score":0.77711,"about_ca_system_score_codex":0.00013794696,"about_ca_system_score_gemma":0.00019768387,"threshold_uncertainty_score":0.99978435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010802965,0.0006507462,0.9861723,0.000097429205,0.0007115857,0.00011343609,0.0010742289,0.00021994085,0.00015735005],"genre_scores_gemma":[0.97821707,0.00032169672,0.021090755,0.000053166885,0.00013234529,0.000006455839,0.00015640569,0.000014589703,0.0000075264775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871176,0.000022609976,0.00017350184,0.0007312957,0.00012749726,0.00023334668],"domain_scores_gemma":[0.99756473,0.00014294923,0.000024047113,0.0020772445,0.00005100508,0.00014001435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002694349,0.00019441487,0.00015718755,0.00020342963,0.00023404953,0.00015235398,0.0010672646,0.000070432514,0.00001367119],"category_scores_gemma":[0.000017543583,0.00018114662,0.00001594622,0.0004954873,0.000089075686,0.0006743341,0.00009002592,0.00022624277,0.000026203674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036950005,0.0031725548,0.00007025102,0.00094475166,0.0006581213,0.00008471085,0.01237388,0.0070393397,0.010007941,0.12172872,0.02039197,0.82315826],"study_design_scores_gemma":[0.00049131276,0.0002286566,0.00027891967,0.00011284873,0.000032199678,0.000028757515,0.000034327582,0.936373,0.0031119976,0.00006824882,0.05889122,0.00034854232],"about_ca_topic_score_codex":0.00001616767,"about_ca_topic_score_gemma":0.0000831423,"teacher_disagreement_score":0.9674141,"about_ca_system_score_codex":0.000009107695,"about_ca_system_score_gemma":0.00002923531,"threshold_uncertainty_score":0.7386945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020580979,0.0009409647,0.993297,0.00029332147,0.0022998815,0.00037149026,0.000019109635,0.00026489617,0.0023075638],"genre_scores_gemma":[0.14363717,0.00002614198,0.85484916,0.0008465315,0.0005343022,0.000008204237,0.000039697275,0.000035298868,0.000023507528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955304,0.000052983625,0.0005642672,0.0017137508,0.0014367123,0.00070183526],"domain_scores_gemma":[0.9973292,0.00029235383,0.00030823098,0.0013416492,0.00041925936,0.00030934843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001422234,0.00054347777,0.0005117544,0.0009899504,0.00030388084,0.0006705321,0.0028495085,0.00030586723,0.000012002661],"category_scores_gemma":[0.00008388363,0.0005070398,0.00016268581,0.00089431484,0.00061580696,0.0005413692,0.0016871564,0.000740165,0.000065500084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007140612,0.00006669354,0.000035258676,0.000035365232,0.000012331895,0.00009239978,0.0012879656,0.3773041,0.000115927054,0.1161688,0.00022476818,0.5046493],"study_design_scores_gemma":[0.00031439684,0.00008839414,0.000053984706,0.00014641102,0.000006300994,0.00004506578,1.5243313e-7,0.823315,0.00029230397,0.1723556,0.0027932988,0.0005890898],"about_ca_topic_score_codex":0.000044363675,"about_ca_topic_score_gemma":0.000068492554,"teacher_disagreement_score":0.50406015,"about_ca_system_score_codex":0.00029873863,"about_ca_system_score_gemma":0.0005276374,"threshold_uncertainty_score":0.9997381},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19408262,0.0043012667,0.785317,0.009060739,0.0014156266,0.0014404502,0.0008325629,0.0003085452,0.0032411986],"genre_scores_gemma":[0.8736171,0.00033127668,0.12495109,0.0006548345,0.00018073265,0.000010018654,0.00022752762,0.000013797439,0.000013611326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713355,0.0002646273,0.0006394116,0.0011901996,0.00038652163,0.00038569767],"domain_scores_gemma":[0.9945598,0.0001413685,0.00038836812,0.004635699,0.00008760438,0.00018711972],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0019733955,0.000267909,0.00058381347,0.00027087156,0.000061257255,0.00021739196,0.005535509,0.00020654831,0.00004010424],"category_scores_gemma":[0.00028703158,0.0002292786,0.00006409643,0.00033600582,0.00015983034,0.00033434667,0.022045318,0.00051786564,0.0000030267615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0002033534,0.0012183874,0.08416735,0.0065260353,0.00037650808,0.0000336867,0.06254701,0.000034377696,0.000057348956,0.42021132,0.093400344,0.3312243],"study_design_scores_gemma":[0.0053422926,0.0010399229,0.26906395,0.0048750825,0.0000682572,0.000044652723,0.002112595,0.29513383,0.0011615516,0.30544552,0.11208436,0.0036279748],"about_ca_topic_score_codex":0.007916758,"about_ca_topic_score_gemma":0.0019408426,"teacher_disagreement_score":0.6795345,"about_ca_system_score_codex":0.000031570566,"about_ca_system_score_gemma":0.00042766705,"threshold_uncertainty_score":0.999845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009986727,0.00040726273,0.96941686,0.001376355,0.001739273,0.0005924541,0.00027776096,0.0010078477,0.015195444],"genre_scores_gemma":[0.45036846,0.00007015633,0.5456425,0.002465205,0.0008063181,0.00012674737,0.0003491393,0.00004978168,0.000121709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962755,0.00017526119,0.0005486843,0.0016551437,0.00070404046,0.0006413878],"domain_scores_gemma":[0.99510676,0.00017223148,0.00030261045,0.0038112076,0.00028712588,0.0003200435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006799307,0.0005672887,0.0005519422,0.0003742715,0.00020941602,0.0009266721,0.0038312732,0.00059176807,0.0005161539],"category_scores_gemma":[0.000070645794,0.0005130511,0.00047619667,0.0005591215,0.00021165359,0.00047967574,0.0036735656,0.0008202309,0.00026912306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007040959,0.0011572567,0.0011213865,0.0009626672,0.00034718527,0.00014652954,0.0017454686,0.0006668756,0.00017499813,0.82144964,0.16282424,0.009333318],"study_design_scores_gemma":[0.0014468282,0.00029753635,0.0020712349,0.00049355987,0.00010583439,0.000023481301,0.0000311204,0.2852329,0.0030548943,0.5323022,0.17248744,0.002452974],"about_ca_topic_score_codex":0.000248377,"about_ca_topic_score_gemma":0.00011764268,"teacher_disagreement_score":0.44038174,"about_ca_system_score_codex":0.000059901693,"about_ca_system_score_gemma":0.00039128182,"threshold_uncertainty_score":0.99973214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078029215,0.00016529222,0.91172963,0.0013556202,0.0002452137,0.0003573391,0.000010170169,0.00031779995,0.007789715],"genre_scores_gemma":[0.6808127,0.000011663463,0.31855127,0.00044703818,0.00008425646,0.000040361163,0.000011409486,0.000007662137,0.000033588407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986101,0.000082855186,0.00027996828,0.0004391951,0.00021795995,0.00036995404],"domain_scores_gemma":[0.9968172,0.0003841388,0.000112167196,0.0023477664,0.00023272772,0.000106050844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006557344,0.00014952492,0.00016516085,0.000126756,0.0005674739,0.00027613709,0.0029944875,0.000068208064,0.00007035833],"category_scores_gemma":[0.0002606501,0.00013609588,0.00011622934,0.00052054663,0.00012519176,0.0003762266,0.0018729282,0.00012746561,0.00003682402],"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.000035976318,0.0003465783,0.00050167757,0.00006191947,0.000046258516,5.854305e-7,0.0046620364,0.00008154619,0.007808488,0.9380372,0.018857537,0.029560193],"study_design_scores_gemma":[0.0022576442,0.00062298303,0.017083477,0.00031975892,0.000038290364,0.000012366351,0.00075486634,0.6303419,0.08653231,0.11166209,0.14878893,0.0015854053],"about_ca_topic_score_codex":0.00009733537,"about_ca_topic_score_gemma":0.00014443522,"teacher_disagreement_score":0.8263751,"about_ca_system_score_codex":0.000026391725,"about_ca_system_score_gemma":0.000056297322,"threshold_uncertainty_score":0.55645525},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020488065,0.0033047076,0.97441965,0.0006502711,0.00066133594,0.00026355844,0.000033380365,0.00011930632,0.0000597389],"genre_scores_gemma":[0.021709358,0.0002372036,0.9765832,0.000674173,0.00063736195,0.000008135359,0.00013859398,0.000009245564,0.0000027173169],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979266,0.00030187858,0.00031115566,0.00087087456,0.00017956235,0.00040993566],"domain_scores_gemma":[0.99823916,0.00014397022,0.00008052732,0.001264521,0.0000563393,0.00021549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028861335,0.00020651853,0.00033802315,0.00025443744,0.00014679832,0.00018971325,0.001055121,0.00011329818,0.000009729626],"category_scores_gemma":[0.000018718707,0.00016423293,0.000023786139,0.0009300088,0.00046326997,0.0004942074,0.0022069344,0.00022485593,0.0000018852728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013418204,0.00016267765,0.0034083184,0.00008001002,0.000023344213,0.000030520572,0.003400606,5.7238946e-8,0.00023178926,0.00895261,0.00065839256,0.98303825],"study_design_scores_gemma":[0.002091587,0.0014308002,0.03869617,0.00018963637,0.00002975388,0.00019969216,0.00019475997,0.20439361,0.00004185411,0.020561216,0.7315715,0.0005994226],"about_ca_topic_score_codex":0.000053625652,"about_ca_topic_score_gemma":0.000074271,"teacher_disagreement_score":0.9824388,"about_ca_system_score_codex":0.000008386586,"about_ca_system_score_gemma":0.000023004985,"threshold_uncertainty_score":0.66972244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3250247,0.00046604875,0.6384325,0.0025317906,0.00063494465,0.00097220275,0.00028411922,0.008208973,0.023444727],"genre_scores_gemma":[0.9039052,0.00041880755,0.0946532,0.00020763681,0.00013177861,0.000009590371,0.000214038,0.000038113492,0.0004216294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99706453,0.00006646037,0.00020867381,0.0016637319,0.00039378458,0.0006027968],"domain_scores_gemma":[0.99702907,0.00006986938,0.0002335832,0.0023347463,0.00015309591,0.00017961813],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00024414156,0.00047370922,0.0004693679,0.0010052273,0.00037052922,0.00028662066,0.006396867,0.0009782027,0.0001052206],"category_scores_gemma":[0.000045073597,0.0004102908,0.00022519268,0.0018360034,0.00077297515,0.0005310517,0.013482843,0.0013535576,0.00007366142],"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.00008852863,0.00030814478,0.0055260216,0.0001235114,0.00016270274,0.002059353,0.00013534208,0.00003476647,0.00014825455,0.9811079,0.0039855107,0.0063200025],"study_design_scores_gemma":[0.0021309943,0.0018953722,0.011000052,0.0016118328,0.00025330245,0.00015380578,0.00061351515,0.02116375,0.0023663638,0.38227198,0.5722641,0.0042749704],"about_ca_topic_score_codex":0.00007281997,"about_ca_topic_score_gemma":0.000045166318,"teacher_disagreement_score":0.5988359,"about_ca_system_score_codex":0.00013894877,"about_ca_system_score_gemma":0.000100551784,"threshold_uncertainty_score":0.9998349},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19262129,0.00007761825,0.80217963,0.0016053633,0.00032124642,0.00022777237,0.00007715786,0.00023135256,0.002658549],"genre_scores_gemma":[0.9716126,0.0000135572855,0.027244272,0.0008284124,0.00021964252,0.0000028069592,0.00005949079,0.0000063949037,0.000012835361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983784,0.000072255345,0.00016254555,0.0006956636,0.00036462795,0.00032648718],"domain_scores_gemma":[0.9980235,0.0001614443,0.000029789446,0.001568711,0.000076317665,0.00014020863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068906625,0.0001331835,0.00012854939,0.00017660302,0.0002372359,0.00024750698,0.0013222372,0.000046159632,0.000103638864],"category_scores_gemma":[0.00009223485,0.00010648357,0.000026259351,0.0005336813,0.00015438393,0.00028247244,0.0013542152,0.00014011911,0.000081666294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038593178,0.0010635564,0.0038840317,0.00008407003,0.000107839645,0.000069326925,0.0054034083,0.00004848647,0.006231482,0.58187705,0.060674462,0.34017032],"study_design_scores_gemma":[0.0026509464,0.0009504794,0.010381881,0.00007215997,0.000015738115,0.000017311213,0.00010774407,0.9147736,0.0112843225,0.0022731007,0.05676033,0.00071239023],"about_ca_topic_score_codex":0.00047557653,"about_ca_topic_score_gemma":0.0003085035,"teacher_disagreement_score":0.9147251,"about_ca_system_score_codex":0.000007959872,"about_ca_system_score_gemma":0.000038569655,"threshold_uncertainty_score":0.43422738},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016690275,0.000007218753,0.9695199,0.0064768256,0.00010415586,0.00066314626,0.000018972567,0.000056626755,0.006462851],"genre_scores_gemma":[0.96106446,0.00000209886,0.03493288,0.0037447982,0.00009218329,0.00013817765,0.000005940458,0.0000032818878,0.000016193846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926007,0.00004027023,0.00015459086,0.00022504313,0.00018736398,0.00013269314],"domain_scores_gemma":[0.9987931,0.00023897935,0.00006578052,0.00072814914,0.00012712438,0.00004682905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032349944,0.00007019891,0.000065341905,0.000046655736,0.00022770575,0.00007775555,0.00076046755,0.000021639655,0.000017777107],"category_scores_gemma":[0.000027591948,0.000037394137,0.000044612316,0.00066667405,0.00013098468,0.000107020314,0.00023246638,0.00007391144,0.00016866575],"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.000008875559,0.00009856515,0.00010582966,0.0000029945288,0.000010104225,7.355777e-8,0.0006197269,0.000007720931,0.0030426453,0.9370575,0.009028611,0.050017357],"study_design_scores_gemma":[0.0014911649,0.0016620882,0.0640727,0.00006346359,0.000034447687,0.00001016955,0.0009474574,0.14641696,0.15726204,0.18393546,0.44324237,0.0008616897],"about_ca_topic_score_codex":0.00009014691,"about_ca_topic_score_gemma":0.00010036213,"teacher_disagreement_score":0.94437414,"about_ca_system_score_codex":0.00000876628,"about_ca_system_score_gemma":0.00002453415,"threshold_uncertainty_score":0.21679133},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08317904,0.00003695144,0.91258,0.0013438101,0.000442971,0.00056857476,0.00014348289,0.00030070424,0.0014044279],"genre_scores_gemma":[0.9961659,0.00000598881,0.003122228,0.00016427544,0.00039050862,0.00006171616,0.00006775222,0.000017464266,0.0000041673725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979979,0.0002886019,0.00026166986,0.00064213376,0.0004537934,0.00035590673],"domain_scores_gemma":[0.99646306,0.000444541,0.00011953155,0.0028055133,0.000076667806,0.000090682144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035030776,0.00022346436,0.0002823899,0.00015962785,0.0006211138,0.00026113717,0.002396043,0.00009260145,0.000005538824],"category_scores_gemma":[0.000012503806,0.00019769237,0.00007908378,0.0010196327,0.00016941525,0.0007398324,0.00007415535,0.00046628693,0.000037631147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026461235,0.018719904,0.0060926504,0.00083763996,0.0010942987,0.00016658736,0.06106046,0.05459791,0.0014914304,0.32038793,0.0045105917,0.52839446],"study_design_scores_gemma":[0.002206165,0.00087097357,0.0068301195,0.00080738845,0.000058228703,0.000011721785,0.00066513434,0.9751721,0.00045899974,0.0023259902,0.009761612,0.0008315549],"about_ca_topic_score_codex":0.00069083634,"about_ca_topic_score_gemma":0.0007450614,"teacher_disagreement_score":0.9205742,"about_ca_system_score_codex":0.000083072024,"about_ca_system_score_gemma":0.000065566936,"threshold_uncertainty_score":0.8061661},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034726053,0.00012306609,0.9373946,0.009104996,0.0006187377,0.00011633276,0.0000071288723,0.0003569149,0.017552178],"genre_scores_gemma":[0.5843715,0.000043403455,0.40948913,0.005456731,0.00046123704,0.0000057851466,0.000007345785,0.000007740752,0.00015710772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989462,0.00005211521,0.00015050347,0.00034438033,0.00019919826,0.00030758572],"domain_scores_gemma":[0.9990115,0.0000416503,0.00005015035,0.00068713294,0.00005694666,0.0001526126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033838354,0.000086342276,0.000102750826,0.00007784232,0.00024129332,0.00014977911,0.0012308519,0.00002989241,0.0004469443],"category_scores_gemma":[0.00003795515,0.0000747088,0.00005612325,0.00041024009,0.000058105823,0.0006196564,0.0008525482,0.00009517282,0.0001669682],"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.000013909687,0.00014116563,0.0081653185,0.00003372945,0.000020373465,0.0000051333564,0.006637325,5.9480723e-8,0.00014337964,0.43220222,0.3294324,0.22320499],"study_design_scores_gemma":[0.00060194096,0.0008082271,0.027977057,0.000054424887,0.000002716843,0.00003340875,0.0002363489,0.052129295,0.00068507134,0.07820201,0.8387348,0.0005346658],"about_ca_topic_score_codex":0.0004957843,"about_ca_topic_score_gemma":0.0003416471,"teacher_disagreement_score":0.5496455,"about_ca_system_score_codex":0.000017526829,"about_ca_system_score_gemma":0.000081306614,"threshold_uncertainty_score":0.48937264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13553202,0.00016469216,0.86105746,0.001787726,0.0010061254,0.000062926694,0.0003711609,0.000012799517,0.000005059815],"genre_scores_gemma":[0.56903493,0.00014324038,0.42910454,0.00065379316,0.0009719296,6.48842e-7,0.00008307656,0.000007190042,6.601307e-7],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986313,0.0002596311,0.0003808334,0.00026769206,0.00033408304,0.0001264809],"domain_scores_gemma":[0.9954427,0.0025384205,0.00047334618,0.0010981573,0.00040672216,0.000040660016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002925618,0.00009082051,0.00014172799,0.00015044626,0.00021989402,0.00033989057,0.0038993682,0.000037641796,0.000004461756],"category_scores_gemma":[0.0011806055,0.000052893487,0.000035474503,0.00012947683,0.00018395926,0.0026809843,0.00094169204,0.00014463268,3.4108277e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048050244,0.00021901193,0.00091841066,0.000016097521,0.00043028453,0.000018238912,0.0073666763,0.00019158411,0.004037202,0.051764216,0.009375149,0.92518264],"study_design_scores_gemma":[0.0024904953,0.0024405879,0.0028376286,0.0011077311,0.00029080096,0.0011919705,0.0043047466,0.359586,0.0072441646,0.018918406,0.5989185,0.0006689761],"about_ca_topic_score_codex":0.00005611709,"about_ca_topic_score_gemma":0.00004587971,"teacher_disagreement_score":0.92451364,"about_ca_system_score_codex":0.000010082972,"about_ca_system_score_gemma":0.000080620885,"threshold_uncertainty_score":0.72460616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008148779,0.0000018747807,0.9813778,0.00015983576,0.000072036666,0.005230889,0.0000029766056,0.00010438981,0.012235311],"genre_scores_gemma":[0.3293425,7.0603267e-7,0.6666749,0.0004956594,0.00003364077,0.0030554659,0.000007825464,0.000005959612,0.00038332632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993207,0.00001254843,0.00016903949,0.00022888987,0.00012311306,0.0001457527],"domain_scores_gemma":[0.99935323,0.000022730857,0.000060750488,0.00044223017,0.000083314444,0.00003772933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023990558,0.00006683587,0.000086886466,0.00007980448,0.000032241154,0.000069676076,0.0008275041,0.000025186224,0.000069146365],"category_scores_gemma":[0.000008746722,0.00005328481,0.000056774606,0.00022583756,0.00007072539,0.00034541913,0.0003362962,0.000026734422,0.000026157943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017054592,0.00008773015,0.00007362565,0.00005573054,0.000021948836,4.1999218e-7,0.001209022,1.28069795e-8,0.00012900768,0.97767955,0.0077188886,0.013006981],"study_design_scores_gemma":[0.0020558238,0.0013236521,0.002206133,0.00020172348,0.000028326192,0.000004368873,0.00013130579,0.110061854,0.09150334,0.41195038,0.38005903,0.00047404776],"about_ca_topic_score_codex":0.00002485346,"about_ca_topic_score_gemma":0.000003843649,"teacher_disagreement_score":0.5657292,"about_ca_system_score_codex":0.0000047280423,"about_ca_system_score_gemma":0.0000064910573,"threshold_uncertainty_score":0.21728915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3114803,0.0002657405,0.66952133,0.003664963,0.0007218535,0.0002900883,0.000107592175,0.00045408434,0.013494064],"genre_scores_gemma":[0.87179905,0.000006582601,0.12673521,0.001147708,0.00014515987,0.0000018123003,0.000011911327,0.000007916583,0.00014466667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991138,0.000022861735,0.00010896008,0.00032357537,0.00019387432,0.00023691646],"domain_scores_gemma":[0.9983208,0.000031170388,0.00008187836,0.0014009569,0.00007423548,0.00009091875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015717375,0.00010791882,0.00012291229,0.00006504097,0.000453762,0.0006486398,0.0014983835,0.00008296484,0.0002837398],"category_scores_gemma":[0.000042998006,0.00009220703,0.000082909304,0.000078198784,0.00006592372,0.0011590647,0.0006521064,0.00015268486,0.0001671336],"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.000033558783,0.000492205,0.0011138037,0.000034053977,0.00010482044,0.00011613831,0.0008941599,0.000008027682,0.15074955,0.81905186,0.011783988,0.015617849],"study_design_scores_gemma":[0.0026772644,0.0005637044,0.057971843,0.00022445348,0.00009969646,0.00015814659,0.000051911717,0.65317136,0.04854328,0.19375183,0.040456392,0.002330113],"about_ca_topic_score_codex":0.00015387907,"about_ca_topic_score_gemma":0.000015913847,"teacher_disagreement_score":0.6531633,"about_ca_system_score_codex":0.0000063032508,"about_ca_system_score_gemma":0.00003141124,"threshold_uncertainty_score":0.6254848},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16969141,0.00023530485,0.8242758,0.00379506,0.00022234915,0.00080298865,0.00028276752,0.00021134452,0.0004829876],"genre_scores_gemma":[0.95239747,0.000027756483,0.046047937,0.00064016465,0.00054898433,0.000101064805,0.00019352106,0.000012429745,0.000030670024],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99771863,0.0000642697,0.0002662014,0.0009819668,0.00048807182,0.00048084802],"domain_scores_gemma":[0.9976867,0.00022339147,0.00004534192,0.0015250758,0.00020669724,0.00031281362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011619118,0.0001863624,0.00019889718,0.00020531405,0.0004901757,0.0003435703,0.0011334145,0.0000925319,0.000008499574],"category_scores_gemma":[0.000056572935,0.00018982946,0.000021710193,0.001672264,0.00014597471,0.00018754079,0.0017158327,0.00026573916,0.000025909236],"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.00014425164,0.0013395327,0.09786145,0.00012058669,0.000100699355,0.000014378402,0.008381338,0.0035375622,0.000994149,0.39765912,0.06905018,0.42079675],"study_design_scores_gemma":[0.00076621317,0.00010593337,0.094834745,0.00006207945,0.000017458082,0.000009958084,0.00008706691,0.3473282,0.00024313977,0.008014152,0.5479876,0.0005435041],"about_ca_topic_score_codex":0.0005751206,"about_ca_topic_score_gemma":0.00044955034,"teacher_disagreement_score":0.7827061,"about_ca_system_score_codex":0.000022625849,"about_ca_system_score_gemma":0.00004173537,"threshold_uncertainty_score":0.77410203},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014721819,0.023453938,0.9679641,0.0030520984,0.00014431728,0.00068057416,0.0000176334,0.0008502942,0.0023648727],"genre_scores_gemma":[0.8713026,0.01445132,0.109242424,0.0046276306,0.00019689953,0.000116822535,0.000014463617,0.00003282072,0.0000149959105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982232,0.000094393865,0.00030189165,0.00054490345,0.00043023628,0.0004053669],"domain_scores_gemma":[0.9982398,0.000082701845,0.00013116458,0.0012262834,0.00015255378,0.00016745739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095945044,0.00019368126,0.0003208609,0.00007062025,0.00016866827,0.00007353053,0.0010236682,0.00007916311,0.00013089273],"category_scores_gemma":[0.00015102173,0.00013798352,0.0001406457,0.0011592606,0.00019836925,0.00013569924,0.00036940383,0.00026657528,0.00062288553],"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.00002415913,0.00039261542,0.00006637172,0.00079923484,0.000021149788,0.00004713282,0.00006489558,0.0000014876631,0.0007741924,0.92907095,0.028899241,0.03983854],"study_design_scores_gemma":[0.00061054225,0.0011500824,0.0016442391,0.005438121,0.00007838058,0.00027765898,0.000005267604,0.0027347729,0.00034681996,0.0049099163,0.9821237,0.0006805372],"about_ca_topic_score_codex":0.0000065233535,"about_ca_topic_score_gemma":0.00003460207,"teacher_disagreement_score":0.9532244,"about_ca_system_score_codex":0.000031890428,"about_ca_system_score_gemma":0.000056540823,"threshold_uncertainty_score":0.80061406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42595148,0.0026366445,0.5609478,0.0033922323,0.0023466097,0.00019278812,0.0011041842,0.0008244306,0.0026038713],"genre_scores_gemma":[0.9462123,0.00035991185,0.051178645,0.0010090289,0.00041333755,0.000024498922,0.0006664155,0.00003628602,0.00009958506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978404,0.00015027769,0.00032013337,0.00072738394,0.0005113497,0.00045044106],"domain_scores_gemma":[0.99807936,0.00014002195,0.00009604605,0.0012913438,0.00019980248,0.00019342087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002194201,0.0002276657,0.000356976,0.000084165324,0.00021405183,0.0004683037,0.0010812163,0.00010590411,0.00047020311],"category_scores_gemma":[0.00009590337,0.00023089828,0.00016588384,0.00069141865,0.00009435957,0.00086732453,0.00063345366,0.00024307804,0.00044148348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002823665,0.00036463994,0.0004985274,0.000043362288,0.00012327406,0.00040474394,0.002762641,0.000006086276,0.0047924384,0.9593438,0.01474465,0.016887616],"study_design_scores_gemma":[0.0011722995,0.00019588352,0.014382587,0.0001515219,0.00005878273,0.000038476897,0.0007555123,0.045083344,0.06843293,0.71828765,0.15019149,0.0012495401],"about_ca_topic_score_codex":0.0003384906,"about_ca_topic_score_gemma":0.00008311575,"teacher_disagreement_score":0.5202608,"about_ca_system_score_codex":0.000027062815,"about_ca_system_score_gemma":0.00024762863,"threshold_uncertainty_score":0.9415758},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13786876,0.00020871653,0.7944074,0.004679745,0.0018805121,0.00027127506,0.000012217813,0.00078635704,0.05988497],"genre_scores_gemma":[0.93303627,0.0000050400563,0.06524198,0.0009879895,0.0005520994,0.0000013307355,0.000004504059,0.000003972573,0.00016680121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911803,0.000025661757,0.00010646695,0.0003600216,0.00018644432,0.00020336827],"domain_scores_gemma":[0.9990095,0.00001709472,0.000025554393,0.0007702424,0.000106479936,0.00007115607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022443106,0.00008061394,0.00007322198,0.00006780819,0.00011084774,0.00012507476,0.00068232504,0.000033710472,0.00022166566],"category_scores_gemma":[0.00004593396,0.000062499435,0.00004002779,0.0007211354,0.00008566003,0.00053319405,0.00028693798,0.00008862845,0.00025604785],"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.000013449465,0.00006574691,0.001556627,0.000006242249,0.0000100252555,0.000005477288,0.00074432243,9.152769e-8,0.0011661389,0.914583,0.07201565,0.009833175],"study_design_scores_gemma":[0.0004695838,0.00036364203,0.011046364,0.000012914989,0.0000072566686,0.000046475103,0.00003958332,0.0026301777,0.095310844,0.08474925,0.80480015,0.0005237574],"about_ca_topic_score_codex":0.000023577588,"about_ca_topic_score_gemma":0.000027915079,"teacher_disagreement_score":0.8298338,"about_ca_system_score_codex":0.0000059356557,"about_ca_system_score_gemma":0.000032351,"threshold_uncertainty_score":0.32910624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103600085,0.000021408812,0.89472324,0.00017580246,0.0005798422,0.00010442328,0.000009795466,0.00014065625,0.0006447232],"genre_scores_gemma":[0.70736593,0.000001524161,0.29242864,0.000093099276,0.00010430599,6.096877e-7,0.0000019621377,0.0000035571397,3.789429e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799275,0.000101628604,0.00026982697,0.0006337498,0.00057234266,0.00042967638],"domain_scores_gemma":[0.9986463,0.000105488114,0.000100166595,0.00061274675,0.00031580223,0.00021949262],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00087106216,0.00016843819,0.00020306137,0.0002488502,0.00039587956,0.00019500533,0.0019953868,0.000055207747,0.000034378754],"category_scores_gemma":[0.00004189805,0.00014316967,0.00007926801,0.0013792778,0.0043360107,0.00087970257,0.0012258686,0.00018056852,0.000028680579],"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.000016704926,0.0001022289,0.00019466759,0.0000092183345,0.000004587823,0.000005077749,0.0013857653,0.00004901764,0.0010025527,0.98403263,0.000026243397,0.013171286],"study_design_scores_gemma":[0.0004991085,0.0003567057,0.0032237282,0.000031717158,0.000005593144,0.000023260884,0.000012425092,0.9203191,0.008370429,0.06686977,0.00007920522,0.00020895974],"about_ca_topic_score_codex":0.000017075385,"about_ca_topic_score_gemma":0.0000066414573,"teacher_disagreement_score":0.9202701,"about_ca_system_score_codex":0.000030026846,"about_ca_system_score_gemma":0.000100543206,"threshold_uncertainty_score":0.9983736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17310798,0.000027058595,0.82080626,0.00032307478,0.00034483755,0.000121047444,0.0000037068103,0.00033760056,0.004928411],"genre_scores_gemma":[0.78352433,0.000011483895,0.21591528,0.0003248643,0.0001290007,0.0000035838805,0.000041650204,0.000005870999,0.000043934542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839586,0.00015161445,0.00022228822,0.00047757215,0.00043603324,0.00031663582],"domain_scores_gemma":[0.9988823,0.00010980186,0.000055414184,0.0005674451,0.00023072271,0.00015433214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045304507,0.0001390092,0.00012926236,0.00020141529,0.0003612395,0.0002512861,0.00064601906,0.00009230342,0.00024760657],"category_scores_gemma":[0.00003066591,0.00011017326,0.00006365683,0.0009279617,0.00011044441,0.001005741,0.0004663349,0.0001564748,0.0006329491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001015106,0.0007514427,0.014193151,0.000089247216,0.000052151827,0.000021141479,0.0071735247,0.00008352842,0.04215497,0.3521577,0.0668109,0.5164107],"study_design_scores_gemma":[0.0034111107,0.0010881908,0.10628243,0.0003558488,0.000034663408,0.00011413286,0.0007050751,0.5318987,0.08599084,0.13120037,0.13680775,0.002110917],"about_ca_topic_score_codex":0.00010935691,"about_ca_topic_score_gemma":0.00009729352,"teacher_disagreement_score":0.61041635,"about_ca_system_score_codex":0.000022180539,"about_ca_system_score_gemma":0.00006443001,"threshold_uncertainty_score":0.81354916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2345798,0.00003509659,0.72473687,0.00038425304,0.000120075296,0.00007389191,0.0000037932487,0.00037408425,0.039692145],"genre_scores_gemma":[0.7913048,0.00000217213,0.20818241,0.00039995226,0.00006343845,0.0000026815696,0.0000036646434,0.0000032858104,0.00003756373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930686,0.000006872521,0.00006876038,0.0002948465,0.00014483044,0.00017785796],"domain_scores_gemma":[0.9992683,0.000013691508,0.000021778973,0.0005756564,0.000049709903,0.000070877926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010001222,0.000073366115,0.00006373609,0.000053042666,0.00010575426,0.00017177248,0.0007135389,0.00002511083,0.0001601637],"category_scores_gemma":[0.000005383868,0.000052613592,0.000021127978,0.00033015606,0.00006814597,0.00060232484,0.0003494581,0.000056809145,0.00010752351],"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.000007310773,0.000027797763,0.012480775,0.00000613616,0.000016178812,0.000008491537,0.00057467277,6.241325e-8,0.0001586497,0.9691654,0.0037453105,0.01380922],"study_design_scores_gemma":[0.0029961655,0.0018543983,0.08019636,0.0001939675,0.000037277594,0.0002708491,0.00045510137,0.08853218,0.07062995,0.3354893,0.41696927,0.0023751797],"about_ca_topic_score_codex":0.00004541758,"about_ca_topic_score_gemma":0.00009719045,"teacher_disagreement_score":0.6336761,"about_ca_system_score_codex":0.000004390565,"about_ca_system_score_gemma":0.000018216377,"threshold_uncertainty_score":0.214552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035289716,0.000618229,0.9564083,0.0035850524,0.0037518712,0.000086639404,0.000106257976,0.00002058522,0.00013334169],"genre_scores_gemma":[0.99275583,0.00012021467,0.0061599207,0.00011385099,0.00080310117,0.000003919822,0.000020350684,0.0000036581928,0.000019144978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860704,0.00005706327,0.0003981682,0.0001840734,0.0005798658,0.0001737842],"domain_scores_gemma":[0.99840426,0.0000326102,0.00027864223,0.0001906027,0.00085344946,0.00024041231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035270856,0.00012023398,0.00018256222,0.00025832362,0.00007615036,0.0004632876,0.0010017542,0.00004519975,0.000013493808],"category_scores_gemma":[0.00009116565,0.00009743904,0.00011831349,0.00029703003,0.00004826179,0.0006170362,0.00018763705,0.00009422704,0.000009909672],"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.00035556985,0.00038969048,0.015146563,0.000031238742,0.00090124214,0.00028176804,0.0019956084,0.00048486676,0.0029826195,0.7649761,0.20587608,0.0065786354],"study_design_scores_gemma":[0.0027091054,0.0011755484,0.016082456,0.00026014136,0.00004974907,0.0010708326,0.0010861637,0.010746912,0.00046159103,0.02032793,0.94532406,0.0007054778],"about_ca_topic_score_codex":0.00003646239,"about_ca_topic_score_gemma":0.000015268237,"teacher_disagreement_score":0.9574661,"about_ca_system_score_codex":0.00002599087,"about_ca_system_score_gemma":0.00003904801,"threshold_uncertainty_score":0.4467493},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35217413,0.00044530307,0.630957,0.011225396,0.0040866253,0.00030461553,0.00040442185,0.000058159392,0.00034431816],"genre_scores_gemma":[0.7055618,0.00305372,0.25455126,0.03440714,0.0022545576,0.0000012558774,0.0001521408,0.000015485417,0.0000026059786],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997964,0.000044014407,0.001044993,0.00009860629,0.00056636933,0.00028202092],"domain_scores_gemma":[0.99808544,0.00006997555,0.00069861556,0.00048396838,0.00015850752,0.0005035032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014141618,0.000115575946,0.00025863963,0.00025246612,0.00019898177,0.000089797555,0.0010966655,0.000088435154,0.000011829484],"category_scores_gemma":[0.000060947095,0.00008113327,0.000038087597,0.0003013756,0.0001966301,0.0008834535,0.00027818824,0.00033703187,0.0000169826],"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.00014439707,0.00097122334,0.0029414492,0.00068881747,0.00012363393,0.00001942072,0.014947885,0.0000019007068,0.000022161064,0.013623023,0.47090223,0.49561384],"study_design_scores_gemma":[0.0044585518,0.009175302,0.037720826,0.000713241,0.00002937756,0.00022728751,0.00045524415,0.05366557,0.000059656315,0.0109046865,0.88205934,0.0005309023],"about_ca_topic_score_codex":0.000008987961,"about_ca_topic_score_gemma":0.0000044304234,"teacher_disagreement_score":0.49508294,"about_ca_system_score_codex":0.00003277489,"about_ca_system_score_gemma":0.00030920721,"threshold_uncertainty_score":0.33085188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085080497,0.000549231,0.8712426,0.00013707198,0.0015099803,0.00057792134,0.0017653332,0.0004052879,0.122961774],"genre_scores_gemma":[0.018104885,0.0005120724,0.9453869,0.002426087,0.0037458765,0.000010697838,0.02438478,0.00016184608,0.00526687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969971,0.000040937215,0.0005958627,0.0014771582,0.00050144875,0.00038749987],"domain_scores_gemma":[0.99568033,0.00014503849,0.0003316614,0.003614708,0.00009399224,0.00013425475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010812837,0.0003895782,0.00036077952,0.0003379704,0.00015750765,0.00033854795,0.0034484663,0.0002622883,0.00045059202],"category_scores_gemma":[0.000053950476,0.0004054854,0.00007554732,0.00017147425,0.0001324264,0.0017340904,0.005685298,0.0006561144,0.00017506447],"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.000010495893,0.00006441475,0.000077276905,0.00015234223,0.000034158034,0.00005458631,0.00058102177,6.9858163e-7,0.00004874238,0.9617064,0.024862071,0.012407814],"study_design_scores_gemma":[0.0018521615,0.00017598268,0.00010691136,0.0009255936,0.00006323268,0.000053566673,0.00014428631,0.37234086,0.00022802493,0.23232368,0.3893262,0.0024594748],"about_ca_topic_score_codex":0.00027153653,"about_ca_topic_score_gemma":0.0010325771,"teacher_disagreement_score":0.7293827,"about_ca_system_score_codex":0.000059230406,"about_ca_system_score_gemma":0.0001399135,"threshold_uncertainty_score":0.9998397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06414972,0.0004357963,0.9323136,0.00017236247,0.0008821434,0.0003388622,0.0013292076,0.00027550088,0.00010277833],"genre_scores_gemma":[0.9977772,0.00013214943,0.0017048186,0.00004792418,0.00007995658,0.000093608855,0.00014250974,0.000011120511,0.00001069719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772185,0.00022321237,0.00052497274,0.00066258886,0.0003513386,0.000516019],"domain_scores_gemma":[0.9986728,0.00017723355,0.00012558227,0.00066107675,0.00014417862,0.00021916023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037672563,0.00031024675,0.00038704797,0.00028872283,0.00049011735,0.00036035676,0.0005203162,0.00019266093,0.000014610718],"category_scores_gemma":[0.000018551995,0.00028522502,0.00009742384,0.0013164997,0.00022159505,0.0007014666,0.000010611221,0.00031399343,0.0000307079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024337228,0.0062278085,0.011927085,0.0012129927,0.0012028969,0.0005651814,0.021171622,0.3641956,0.0073205945,0.55090594,0.0148364995,0.018000072],"study_design_scores_gemma":[0.012147185,0.0027775252,0.02780837,0.0012069951,0.00022140262,0.0004958676,0.0072923996,0.853414,0.005461415,0.0124324355,0.07216166,0.0045807743],"about_ca_topic_score_codex":0.00081556273,"about_ca_topic_score_gemma":0.00040212157,"teacher_disagreement_score":0.9336275,"about_ca_system_score_codex":0.00007736809,"about_ca_system_score_gemma":0.00007172973,"threshold_uncertainty_score":0.99996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23595233,0.0002900051,0.7624764,0.0002499078,0.00032348672,0.00015321502,0.000008703381,0.000019461948,0.00052650203],"genre_scores_gemma":[0.925711,0.000059190184,0.073986284,0.00017413267,0.00002795596,0.000001786766,0.000014674944,0.000006329686,0.000018688183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857855,0.0000640259,0.00054095156,0.0003287286,0.00031360466,0.00017411627],"domain_scores_gemma":[0.9987461,0.00011373451,0.00046442784,0.00046275192,0.00013298528,0.00007998423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088246976,0.00012369303,0.00026504835,0.00027941214,0.000019110004,0.00017598683,0.0017899629,0.00007819838,0.000026822425],"category_scores_gemma":[0.000028580715,0.00011377859,0.000057329053,0.00029480024,0.0000786965,0.0024970255,0.000619581,0.00043229363,0.000008461053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006041725,0.002491231,0.12728634,0.0024452487,0.0008485813,0.00010839892,0.18094857,0.0008101313,0.028700652,0.27936772,0.054646023,0.3217429],"study_design_scores_gemma":[0.0022429738,0.0005336642,0.005141847,0.0012400475,0.00004374324,0.00074834557,0.0005905713,0.895026,0.012451957,0.0740763,0.007354172,0.00055032765],"about_ca_topic_score_codex":0.00038254345,"about_ca_topic_score_gemma":0.0000076431525,"teacher_disagreement_score":0.89421594,"about_ca_system_score_codex":0.000022680262,"about_ca_system_score_gemma":0.000045535235,"threshold_uncertainty_score":0.4639756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56396145,0.00011236588,0.4248889,0.0052159443,0.00030754047,0.00064239063,0.00003352342,0.0040272637,0.00081058935],"genre_scores_gemma":[0.8389885,0.00004961449,0.16012655,0.0006348043,0.00011309689,0.000045438177,0.000018556204,0.000019815192,0.000003657454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969893,0.000011738815,0.0004744011,0.001393735,0.00046649112,0.000664306],"domain_scores_gemma":[0.9978451,0.00015202742,0.0002699041,0.0013659594,0.0002707173,0.000096306714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008990978,0.00035837633,0.00038187593,0.0006209976,0.0005086847,0.0005677854,0.0051059355,0.00021133159,0.0000032401233],"category_scores_gemma":[0.0012193811,0.0003246183,0.000063921325,0.0012363798,0.00019768716,0.0011356847,0.0036822655,0.00045638226,0.00023446973],"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.00032701567,0.0004622785,0.0013117227,0.00015975103,0.00016137613,0.00001450766,0.006490601,0.00008203616,0.25536785,0.59075266,0.010812414,0.13405778],"study_design_scores_gemma":[0.00220527,0.0041031833,0.0049177897,0.00062845316,0.000069878784,0.00004575153,0.0020390993,0.06473328,0.5000496,0.37470832,0.044127,0.0023723529],"about_ca_topic_score_codex":0.000014053186,"about_ca_topic_score_gemma":0.000009847444,"teacher_disagreement_score":0.27502698,"about_ca_system_score_codex":0.000110285495,"about_ca_system_score_gemma":0.00006658246,"threshold_uncertainty_score":0.9999206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04260921,0.0006971655,0.95182294,0.0008191063,0.0009184218,0.0015496315,0.0002721052,0.00039688428,0.0009145249],"genre_scores_gemma":[0.18486688,0.00013801582,0.813667,0.00007956054,0.00015898113,0.00034008332,0.000712495,0.00003540789,0.0000015758654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962436,0.0003876289,0.0005499767,0.0017096268,0.00028742463,0.0008217405],"domain_scores_gemma":[0.9968334,0.00066463597,0.00074001396,0.001288277,0.0001990418,0.00027462177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094087335,0.0005710804,0.0007960285,0.0003727208,0.0010021174,0.00068328634,0.0016710169,0.0003435829,0.000009230802],"category_scores_gemma":[0.00030652233,0.0005679144,0.00031031342,0.00013705798,0.0006398862,0.00021604564,0.0046228734,0.0015693983,0.000022104614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011472698,0.00020521598,0.007100722,0.0003411405,0.00017065898,0.00003183691,0.002311439,0.01225545,0.000119834396,0.94267285,0.00030538903,0.034370743],"study_design_scores_gemma":[0.0009452646,0.00012839184,0.0017973991,0.000098648015,0.000046517795,0.000051324438,0.000022980419,0.41392496,0.00011760392,0.57670796,0.0057281284,0.00043083855],"about_ca_topic_score_codex":0.00019789065,"about_ca_topic_score_gemma":0.0002819451,"teacher_disagreement_score":0.4016695,"about_ca_system_score_codex":0.000037040467,"about_ca_system_score_gemma":0.00019179173,"threshold_uncertainty_score":0.99967724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393943,0.00009805192,0.2586279,0.00018335349,0.00016355122,0.000350082,0.0000030019928,0.00095073093,0.00022902984],"genre_scores_gemma":[0.7723152,0.0000377802,0.22756168,0.000020782942,0.000032619682,0.000021236856,0.0000011410585,0.00000920395,3.3366553e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977439,0.000012906873,0.0004295743,0.0006011149,0.0008579708,0.00035452875],"domain_scores_gemma":[0.9979409,0.0001054491,0.00034567303,0.0006706727,0.0009018799,0.00003545005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001628924,0.00021250534,0.00025351715,0.00067142927,0.00022381934,0.0001787065,0.0018879981,0.00018638774,0.000007556626],"category_scores_gemma":[0.0031619614,0.00018615591,0.000076323064,0.0016701074,0.0002753994,0.0010739107,0.0011287396,0.0002203368,0.000013673127],"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.000085197746,0.00024174788,0.005308668,0.000061692124,0.000039764887,0.0000013270807,0.0012376579,0.000018249128,0.20331603,0.30551296,0.0005252651,0.48365143],"study_design_scores_gemma":[0.00041281775,0.00028077562,0.0010355652,0.00023868843,0.00002226993,0.000008887767,0.00021181579,0.06780454,0.7724692,0.15645216,0.00084136496,0.00022188573],"about_ca_topic_score_codex":0.000009004032,"about_ca_topic_score_gemma":0.000005377679,"teacher_disagreement_score":0.5691532,"about_ca_system_score_codex":0.000097569515,"about_ca_system_score_gemma":0.000068839596,"threshold_uncertainty_score":0.7591218},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44995338,0.00047372677,0.48842722,0.0025164688,0.00093870016,0.0010368106,0.000013041116,0.0005714544,0.056069206],"genre_scores_gemma":[0.9901117,0.000028627004,0.008165665,0.0015357785,0.000109189874,0.00002543489,0.0000049614523,0.000006563754,0.000012081192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860454,0.000046500354,0.0001912997,0.0005464806,0.00022752135,0.0003836793],"domain_scores_gemma":[0.9990704,0.00003825001,0.00008109367,0.0005776439,0.00008828147,0.00014431015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003786131,0.0001867487,0.00017559169,0.00010975392,0.00037726294,0.00029996858,0.00043839085,0.000047580008,0.00001022986],"category_scores_gemma":[0.0000015041949,0.00016629466,0.000024871317,0.0005523662,0.00006462384,0.00003686739,0.0004211865,0.00008502786,0.00001732466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025815327,0.000053611202,0.00044535816,0.00027707388,0.000029356072,0.000030505467,0.00037886816,0.001817715,0.000004113502,0.97549593,0.00033271193,0.021108963],"study_design_scores_gemma":[0.0004954762,0.00015833304,0.003346975,0.00035350188,0.000023733946,0.0000043363734,0.00028441526,0.98700225,0.000014230962,0.0017560796,0.006312395,0.0002482528],"about_ca_topic_score_codex":0.000058825004,"about_ca_topic_score_gemma":0.00014192371,"teacher_disagreement_score":0.98518455,"about_ca_system_score_codex":0.000015305248,"about_ca_system_score_gemma":0.000020491914,"threshold_uncertainty_score":0.67813},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039027716,0.0022907439,0.9878455,0.0003259073,0.0025094799,0.00021798121,0.000010875382,0.00023594349,0.0065245475],"genre_scores_gemma":[0.14730099,0.00017353498,0.8490532,0.0019263399,0.0014178444,0.000006962456,0.000020551013,0.000043440836,0.000057120786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962526,0.000034542678,0.00045423175,0.0014013096,0.00096996373,0.00088738004],"domain_scores_gemma":[0.99703217,0.0003312837,0.000247625,0.0019426793,0.00015624653,0.00029001973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010457654,0.0005269151,0.00047572292,0.0009181731,0.00034595613,0.00077964325,0.0040556067,0.00035613822,0.000058635105],"category_scores_gemma":[0.00005156865,0.00048776605,0.00017915877,0.0007913543,0.00072223076,0.0015461063,0.0020898168,0.00095917174,0.000103481834],"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.0000019805088,0.000025763924,0.00007729034,0.000024843435,0.0000063611296,0.000034371213,0.0006580338,0.00032959622,0.000066170716,0.21431391,0.000026460124,0.7844352],"study_design_scores_gemma":[0.0002813051,0.000104461025,0.00037166648,0.0004668532,0.000014156185,0.00014712916,1.4812281e-7,0.0777561,0.0011533317,0.89851016,0.01991466,0.0012800526],"about_ca_topic_score_codex":0.000022401498,"about_ca_topic_score_gemma":0.00004696699,"teacher_disagreement_score":0.78315514,"about_ca_system_score_codex":0.00015713734,"about_ca_system_score_gemma":0.00035149447,"threshold_uncertainty_score":0.9997574},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75451183,0.00073153834,0.022488616,0.008864042,0.0030235134,0.001333294,0.000027491657,0.00062808004,0.2083916],"genre_scores_gemma":[0.984395,0.000013897258,0.015170202,0.00027192803,0.00010613642,0.00001110032,1.7274368e-7,0.0000035403837,0.00002800481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991575,0.0000028300801,0.00015213763,0.00022249842,0.00027719545,0.00018786646],"domain_scores_gemma":[0.9994425,0.0000126185405,0.000110515066,0.00023666375,0.00014938884,0.00004831002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016531638,0.000086816646,0.00009195426,0.000056648714,0.00012661956,0.00007293649,0.0014435889,0.000026516975,0.000019853873],"category_scores_gemma":[0.000030182578,0.000056833363,0.000087750566,0.00045230673,0.00013709461,0.00034876485,0.00071863085,0.00007202637,0.00002033605],"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.000007355646,0.00008117831,0.0026106327,0.000021449327,0.00001791259,1.0477616e-7,0.0012552453,8.587849e-8,0.016582156,0.965081,0.009414755,0.0049281707],"study_design_scores_gemma":[0.0005931985,0.00030126813,0.011721106,0.00008362894,0.000019148718,0.000020651598,0.0002080869,0.000725446,0.7085136,0.20112479,0.07641447,0.0002745895],"about_ca_topic_score_codex":0.000021237694,"about_ca_topic_score_gemma":0.0000022737497,"teacher_disagreement_score":0.7639562,"about_ca_system_score_codex":0.000013388009,"about_ca_system_score_gemma":0.00001303417,"threshold_uncertainty_score":0.26825714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78537226,0.00021896749,0.21181141,0.0003173124,0.00079031766,0.000112471505,0.0000029184291,0.000048784616,0.0013255837],"genre_scores_gemma":[0.98181707,0.000034781846,0.01763315,0.00028894562,0.0001486466,0.0000021352396,0.0000018544451,0.000014907496,0.00005852472],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979453,0.0001204522,0.00057020894,0.0003608508,0.0005882354,0.00041494696],"domain_scores_gemma":[0.9984927,0.00017889499,0.00044387073,0.00057829265,0.00017617358,0.00013004961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095135963,0.00022034343,0.00035696957,0.0004483961,0.000057681325,0.00044718068,0.0022476201,0.00010481178,0.00012517844],"category_scores_gemma":[0.00009193061,0.0001809823,0.00013822367,0.00035641866,0.000072494935,0.0022682545,0.0005854864,0.0008771661,0.000013628528],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013337613,0.00089624367,0.7188465,0.0009942803,0.0006319522,0.0011503827,0.15556212,0.0015859697,0.019005233,0.0543915,0.014442196,0.031159874],"study_design_scores_gemma":[0.019268207,0.008018242,0.101823054,0.021729548,0.00020541452,0.010438788,0.01541184,0.40822428,0.23595776,0.114642724,0.057907477,0.0063726646],"about_ca_topic_score_codex":0.001332587,"about_ca_topic_score_gemma":0.000184458,"teacher_disagreement_score":0.6170234,"about_ca_system_score_codex":0.00005573685,"about_ca_system_score_gemma":0.00012039284,"threshold_uncertainty_score":0.7380244},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11567532,0.000014147459,0.8820529,0.00019884348,0.0007201681,0.00053015305,0.00017419197,0.0001735172,0.0004607832],"genre_scores_gemma":[0.94832426,0.00007600379,0.05117591,0.0003044978,0.000026697686,0.000038905477,0.00004001834,0.000008218156,0.000005493559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987995,0.000025459243,0.0003927612,0.0002493653,0.00024181703,0.00029108571],"domain_scores_gemma":[0.99890405,0.0001345673,0.00015508424,0.00056548044,0.00012888479,0.00011196206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035254285,0.00019151614,0.00020043853,0.00021858315,0.00036451954,0.00044039128,0.00044981146,0.00012987398,0.000019448986],"category_scores_gemma":[0.0000070510073,0.0001890259,0.00013279587,0.00031018603,0.000029831343,0.0035843302,0.000021443844,0.0003208371,0.000018051913],"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.00018789808,0.00016222184,0.00018022586,0.0012333349,0.00013451187,0.0000013923599,0.029942328,0.003534168,0.00018347349,0.7263915,0.0010487082,0.23700026],"study_design_scores_gemma":[0.0022594982,0.00037601282,0.00020483708,0.00018508737,0.00003402986,0.000022474824,0.0009826501,0.61638504,0.0043330425,0.3405405,0.03388702,0.00078980345],"about_ca_topic_score_codex":0.00004886264,"about_ca_topic_score_gemma":0.000026811118,"teacher_disagreement_score":0.83264893,"about_ca_system_score_codex":0.000026953037,"about_ca_system_score_gemma":0.000031790194,"threshold_uncertainty_score":0.77082527},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42193457,0.005477165,0.5626268,0.006910121,0.0025629557,0.00037667842,0.000033453514,0.000029729912,0.000048540955],"genre_scores_gemma":[0.9938438,0.000117011914,0.005297856,0.00016874951,0.00054960593,0.0000023507744,0.0000076337665,0.0000081167445,0.000004876223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972859,0.00018949457,0.0006698897,0.00029894177,0.0012776672,0.0002781248],"domain_scores_gemma":[0.9973654,0.0006108679,0.00044837268,0.0009982946,0.00013968538,0.0004373352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048855143,0.000112957925,0.0003742623,0.0001347094,0.000099739525,0.0002397251,0.0033684745,0.00013758626,0.000010038555],"category_scores_gemma":[0.0010699054,0.00008153685,0.000079583486,0.00019815967,0.00003378189,0.0004494177,0.0015781099,0.00038678132,0.0000031760471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008198699,0.0019502761,0.24343295,0.022889322,0.0013926392,0.000786579,0.025384216,0.001968905,0.002846591,0.32873383,0.15353268,0.21626213],"study_design_scores_gemma":[0.0032778285,0.0006180222,0.009928523,0.0037148206,0.00004286118,0.0011336047,0.0013834728,0.8292568,0.000018081582,0.0005011644,0.14971101,0.00041386113],"about_ca_topic_score_codex":0.00009512805,"about_ca_topic_score_gemma":0.00000595763,"teacher_disagreement_score":0.82728785,"about_ca_system_score_codex":0.000026785036,"about_ca_system_score_gemma":0.00018574308,"threshold_uncertainty_score":0.625952},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012634044,0.00009381753,0.9814714,0.00027510498,0.0005153172,0.00012862071,0.0000058406454,0.00019702887,0.0046788133],"genre_scores_gemma":[0.97739685,0.000014551657,0.021662023,0.0006324635,0.00006637117,0.0000021924423,0.00020652328,0.000003904572,0.000015117682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989663,0.000040336916,0.0001420491,0.00047983948,0.00017269255,0.0001988221],"domain_scores_gemma":[0.9975478,0.000068504945,0.000049876602,0.002239463,0.00002759125,0.00006676183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019405237,0.00008729176,0.000084916974,0.000054293218,0.000053360625,0.0001852825,0.0019009991,0.00005626766,0.00025412647],"category_scores_gemma":[0.00001176919,0.00007416061,0.000030299314,0.00043078695,0.000021585181,0.001474086,0.00074309984,0.00012271115,0.00010903689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009351236,0.000085609994,0.023131464,0.000006999943,0.000015985977,0.0000026728944,0.000101985774,0.00041896544,0.00025109164,0.8983475,0.009490803,0.06813759],"study_design_scores_gemma":[0.00015183548,0.000016370801,0.05323,0.0000013643526,0.0000022846589,0.0000025640584,0.00001072725,0.9389955,0.0000074007094,0.0013821309,0.0060950755,0.000104784536],"about_ca_topic_score_codex":0.000041059357,"about_ca_topic_score_gemma":0.000044197335,"teacher_disagreement_score":0.9647628,"about_ca_system_score_codex":0.00000654419,"about_ca_system_score_gemma":0.000009459931,"threshold_uncertainty_score":0.3532561},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008475892,0.000007987544,0.988885,0.00029522492,0.0006642387,0.00020004324,0.00003454368,0.00013360237,0.0013034957],"genre_scores_gemma":[0.60696834,0.000011607075,0.38707274,0.0058196504,0.000043604858,0.0000036694548,0.000072458555,0.0000034711395,0.000004463669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985165,0.000023651986,0.0002590263,0.0004142714,0.000508308,0.00027822517],"domain_scores_gemma":[0.99811286,0.00006837362,0.00010164324,0.0014419674,0.00013202816,0.00014313549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008080113,0.00013449269,0.00011795682,0.00039303026,0.00026428132,0.00091701804,0.0023118253,0.000041665142,0.000016041982],"category_scores_gemma":[0.000029302693,0.000114654336,0.000024160598,0.0010710965,0.00013866306,0.01087579,0.0013734435,0.00014084064,0.00013662911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000667601,0.00032542011,0.013890522,0.00030546507,0.000021132504,0.0000062675513,0.010705217,0.04467188,0.0005299993,0.5092902,0.00813585,0.41205123],"study_design_scores_gemma":[0.0004745006,0.0000727885,0.0121017555,0.00003112586,9.899398e-7,0.0000053889275,0.000021774407,0.9409535,0.000072971554,0.000052863677,0.046054758,0.00015761127],"about_ca_topic_score_codex":0.0000116389265,"about_ca_topic_score_gemma":0.0000054346788,"teacher_disagreement_score":0.8962816,"about_ca_system_score_codex":0.000018118892,"about_ca_system_score_gemma":0.000102933576,"threshold_uncertainty_score":0.8842826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2172607,0.0001311567,0.7692862,0.0071120397,0.0003273053,0.0014349563,0.00004526892,0.00010050881,0.004301845],"genre_scores_gemma":[0.95638406,0.0000070565693,0.043193385,0.00030902855,0.000013899262,0.00003880071,0.000011194718,0.0000027275332,0.000039832194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993609,0.000041742507,0.00016985204,0.00018787174,0.00012637752,0.000113231676],"domain_scores_gemma":[0.9981525,0.00020399637,0.00007779499,0.0014103028,0.00011900532,0.00003641374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043558184,0.00006132832,0.00008621611,0.00004955042,0.00007925301,0.000056641595,0.0011740145,0.0000341536,0.000028598342],"category_scores_gemma":[0.000029557203,0.00004063231,0.00006654778,0.00028093442,0.0000265594,0.0001842916,0.00028313417,0.000055130018,0.00003129379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007545766,0.000058202033,0.00022894992,0.000016937405,0.000007849349,7.734096e-9,0.0019555027,0.0000010726485,0.0035502205,0.9891776,0.0016283306,0.003367821],"study_design_scores_gemma":[0.0010649043,0.0005195547,0.01328229,0.000047954003,0.00003197736,0.000002045775,0.00042412666,0.09032135,0.13897182,0.5787192,0.17616646,0.00044833167],"about_ca_topic_score_codex":0.00005848922,"about_ca_topic_score_gemma":0.00004249394,"teacher_disagreement_score":0.73912334,"about_ca_system_score_codex":0.000008123911,"about_ca_system_score_gemma":0.000019333675,"threshold_uncertainty_score":0.21816307},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004918158,0.0008674031,0.99407804,0.00016610754,0.0020538378,0.00065301755,0.000036125428,0.00021326367,0.001440365],"genre_scores_gemma":[0.5910258,0.00007733356,0.40772775,0.0005745699,0.0004296845,0.000010039723,0.000012244015,0.00007030114,0.00007222876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543405,0.000047089263,0.0008551002,0.0017841611,0.0011423661,0.0007372078],"domain_scores_gemma":[0.9955226,0.00052009395,0.0006025216,0.0027369044,0.0004280318,0.00018982096],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011946479,0.00060165895,0.00087338686,0.0012553631,0.00016711252,0.00040997204,0.005392669,0.00043258662,0.000021734186],"category_scores_gemma":[0.000095363335,0.00053990725,0.0002992376,0.001291154,0.00083336915,0.000735819,0.0018570347,0.0009016455,0.000055326986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004761928,0.00031845953,0.00036160668,0.00086713635,0.00007065213,0.00014409452,0.0031868555,0.006549667,0.0048911474,0.53597534,0.00005621837,0.4475312],"study_design_scores_gemma":[0.0009782586,0.0010311585,0.00018365268,0.0012397455,0.000026522694,0.00013145016,5.5394946e-7,0.87263274,0.007189535,0.113112606,0.0019167155,0.0015570493],"about_ca_topic_score_codex":0.00005631362,"about_ca_topic_score_gemma":0.00006408337,"teacher_disagreement_score":0.8660831,"about_ca_system_score_codex":0.0001236214,"about_ca_system_score_gemma":0.0010298718,"threshold_uncertainty_score":0.9999886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42476445,0.002770079,0.5070218,0.008289019,0.0032848793,0.0014260066,0.00003859155,0.00076883193,0.051636335],"genre_scores_gemma":[0.9844335,0.00059920416,0.013913945,0.0005866649,0.00022243203,0.000013331176,0.00015749065,0.00001625734,0.00005720279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977114,0.00031322826,0.0005493114,0.0006415398,0.0004092309,0.0003752644],"domain_scores_gemma":[0.99727494,0.0004676817,0.0003524892,0.0016171857,0.00018375341,0.000103945844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008671562,0.00027025232,0.0002960413,0.0003328363,0.00023874198,0.0005624212,0.003158947,0.00013331999,0.00002755326],"category_scores_gemma":[0.000019005522,0.00029024924,0.00009159878,0.0005313877,0.00011816612,0.0003290931,0.0017617566,0.00074416643,0.00007078928],"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.000025638821,0.00023376239,0.0033867748,0.000019920222,0.000043780376,0.000002752469,0.005702498,0.0054404046,0.00006676866,0.9405785,0.0008497639,0.04364944],"study_design_scores_gemma":[0.0007263058,0.00012297079,0.004499759,0.0005956126,0.0000067516166,0.000029592624,0.0006602208,0.9053812,0.000010846405,0.025245722,0.062285695,0.00043530975],"about_ca_topic_score_codex":0.00016165283,"about_ca_topic_score_gemma":0.00006021395,"teacher_disagreement_score":0.9153328,"about_ca_system_score_codex":0.00008623623,"about_ca_system_score_gemma":0.000084048275,"threshold_uncertainty_score":0.99995494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13236798,0.00008588008,0.85723454,0.000043155374,0.00006195004,0.00038971376,0.0000061575524,0.00006850235,0.009742132],"genre_scores_gemma":[0.95218384,0.000008634578,0.047612045,0.00012113473,0.000008210639,0.000057953774,0.0000021581354,0.0000040580694,0.000001975119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807715,0.00001114112,0.00026687025,0.0006800909,0.00058483274,0.0003798824],"domain_scores_gemma":[0.99846196,0.00006447132,0.00010498383,0.0012021714,0.000062067804,0.00010433684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073567405,0.00012007816,0.00018132522,0.00096479605,0.00009698366,0.000097545635,0.0023445273,0.00004808034,0.000020353602],"category_scores_gemma":[0.000007896643,0.00011781614,0.000058274123,0.0060965037,0.00038925066,0.0005835949,0.00049496116,0.00015212694,0.000062715866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034102623,0.000112613314,0.005984645,0.000018483648,0.0000019421489,2.8520608e-7,0.0005149378,0.00004863947,0.096531875,0.8664713,0.0000126118275,0.030299278],"study_design_scores_gemma":[0.0008311576,0.000064905355,0.056489095,0.000023941706,0.0000041155436,0.000004603072,0.00014024817,0.095759556,0.025398182,0.81822735,0.0025074854,0.0005493705],"about_ca_topic_score_codex":0.000022509661,"about_ca_topic_score_gemma":0.000009799336,"teacher_disagreement_score":0.8198159,"about_ca_system_score_codex":0.000021452306,"about_ca_system_score_gemma":0.000116697614,"threshold_uncertainty_score":0.4804403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14055738,0.0002010982,0.85676736,0.0013202631,0.0002263435,0.00026532038,0.00011301427,0.00018795238,0.00036124658],"genre_scores_gemma":[0.5493665,0.000010614171,0.4498446,0.0005050064,0.00017338488,0.0000075677763,0.0000830983,0.000005531803,0.0000036986687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870014,0.00003814609,0.00015798847,0.00065594283,0.000160085,0.00028770333],"domain_scores_gemma":[0.99683887,0.00008648963,0.00004396856,0.0027469017,0.00010992684,0.00017382315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005478915,0.000101567646,0.00010728497,0.00007520092,0.00027407616,0.00024998363,0.0026067593,0.00005139946,0.000018881448],"category_scores_gemma":[0.00010177701,0.00008736146,0.000020129282,0.00025002292,0.00008227534,0.000887198,0.0023533094,0.00006884668,0.000006024724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057739773,0.00036523113,0.009695922,0.00024032377,0.00003249626,0.000004462039,0.0030551117,0.0000034060747,0.0016853019,0.8875158,0.034663647,0.06268057],"study_design_scores_gemma":[0.00046398776,0.00031703606,0.0075146947,0.000030745967,0.0000049675377,0.000009250863,0.00016530298,0.92511505,0.0009914039,0.011030223,0.05406798,0.0002893616],"about_ca_topic_score_codex":0.00021155585,"about_ca_topic_score_gemma":0.00026926975,"teacher_disagreement_score":0.92511165,"about_ca_system_score_codex":0.000006679278,"about_ca_system_score_gemma":0.000051595813,"threshold_uncertainty_score":0.48440507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06249198,0.00005675826,0.9288173,0.0032790757,0.0005790199,0.0010455105,0.0007003198,0.0009090244,0.0021210439],"genre_scores_gemma":[0.48463205,0.000040500734,0.5135936,0.0006584801,0.00024709225,0.0001516734,0.000634017,0.000041740794,8.2663206e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934288,0.0013523633,0.000791948,0.0024929922,0.00061959616,0.001314301],"domain_scores_gemma":[0.9938334,0.00070431136,0.0007141153,0.0039219367,0.00030944,0.00051680097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011749169,0.0009364136,0.0011680231,0.00086787133,0.00044293544,0.0002504892,0.0032778727,0.0007342087,0.00017842994],"category_scores_gemma":[0.00025396023,0.00088070775,0.00057601556,0.00077239267,0.00089501287,0.00037896947,0.004477647,0.0022714315,0.0001913115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024311345,0.0006664142,0.01858204,0.00022185444,0.00016314289,0.000098041644,0.0025700901,0.0022324582,0.00006156943,0.97182244,0.0008696528,0.0024691946],"study_design_scores_gemma":[0.0023464654,0.00041973728,0.050514765,0.00019106729,0.00010324496,0.000054920092,0.00020357048,0.038755447,0.00026194705,0.8968191,0.009012548,0.0013171603],"about_ca_topic_score_codex":0.0001872952,"about_ca_topic_score_gemma":0.00094998,"teacher_disagreement_score":0.42214006,"about_ca_system_score_codex":0.00023818258,"about_ca_system_score_gemma":0.0012137546,"threshold_uncertainty_score":0.9993644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011782565,0.002306011,0.9654485,0.0031846813,0.0002331655,0.0011838867,0.00035577474,0.0005777999,0.014927601],"genre_scores_gemma":[0.8140705,0.0003526611,0.18433116,0.00014682872,0.00007649637,0.00014561704,0.0005834223,0.0000399364,0.00025336086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99446803,0.0024048768,0.0007050442,0.0013087365,0.0006429933,0.00047031342],"domain_scores_gemma":[0.9899134,0.002970401,0.0006713979,0.0033494243,0.0026577488,0.00043760744],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004296102,0.00048661957,0.0005352101,0.0002646987,0.00065595156,0.0012228176,0.0023710583,0.00038713444,0.000044123415],"category_scores_gemma":[0.0010407243,0.0005181144,0.00019165067,0.000701538,0.000441372,0.00058525417,0.0027770489,0.00091720436,0.00003744648],"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.00001808919,0.00069088436,0.0028592148,0.00034901916,0.00014606642,0.0000073062592,0.014146427,0.0012196199,0.0002142375,0.95835775,0.001342569,0.020648832],"study_design_scores_gemma":[0.0019116551,0.000002585013,0.0023362557,0.0018436571,0.00014206124,0.000043576452,0.00027950646,0.5150971,0.0025265033,0.35485795,0.119153604,0.0018055924],"about_ca_topic_score_codex":0.000296011,"about_ca_topic_score_gemma":0.0007541029,"teacher_disagreement_score":0.80228794,"about_ca_system_score_codex":0.00011426443,"about_ca_system_score_gemma":0.0005016463,"threshold_uncertainty_score":0.99981403},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06953553,0.00024723297,0.9257852,0.00082486175,0.0011414982,0.0009809497,0.00024638145,0.0004678591,0.0007704749],"genre_scores_gemma":[0.21482399,0.000073415176,0.7820935,0.00012240175,0.00047354685,0.00072715647,0.0016467691,0.000037742513,0.0000014690439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961297,0.00036225075,0.0005296021,0.0020126856,0.00034435443,0.00062144006],"domain_scores_gemma":[0.99701023,0.00053398864,0.00055538927,0.001461722,0.00023893353,0.0001997592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047906235,0.0005532291,0.0006305281,0.00039402826,0.00033155442,0.00013200345,0.001546796,0.00032947838,0.00014334008],"category_scores_gemma":[0.00022365016,0.00048596578,0.00029058172,0.00020670601,0.0005278627,0.00032343814,0.0024094975,0.0016380858,0.00008764261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037341838,0.00023086544,0.014695899,0.00009291062,0.00037079625,0.000016446837,0.0032384275,0.00070537336,0.00059587334,0.9726555,0.0013957795,0.0056287353],"study_design_scores_gemma":[0.000648859,0.00020906366,0.043770682,0.00011439363,0.000089445726,0.000028867678,0.00005854689,0.006773027,0.0016147484,0.9419556,0.0041435375,0.0005932136],"about_ca_topic_score_codex":0.0002934342,"about_ca_topic_score_gemma":0.00024811682,"teacher_disagreement_score":0.14528847,"about_ca_system_score_codex":0.00004163121,"about_ca_system_score_gemma":0.00032354594,"threshold_uncertainty_score":0.9997592},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47022244,0.000056979974,0.5209483,0.000023088576,0.00047741935,0.00054767885,0.000046378434,0.00012587618,0.007551845],"genre_scores_gemma":[0.996727,0.00018954735,0.0025782587,0.00009397257,0.000036229863,0.0000036798722,0.00010532233,0.00002250482,0.00024348428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673855,0.000088094755,0.00035391861,0.001984038,0.00017720627,0.00065818307],"domain_scores_gemma":[0.9968599,0.00007810349,0.0002628536,0.0024976293,0.000077807985,0.00022371802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004069029,0.00048006544,0.0006302707,0.0006175656,0.00013930298,0.00025544883,0.003612564,0.00034432116,0.000054626707],"category_scores_gemma":[0.000007189004,0.0005775559,0.00034700523,0.000942905,0.00009279901,0.0011758074,0.0056929095,0.00085072784,0.00015536523],"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.00007730032,0.00030387664,0.009775131,0.00017553226,0.000084297506,0.00033385228,0.0008116253,0.7954734,0.000048042806,0.19226784,0.0005752851,0.00007384821],"study_design_scores_gemma":[0.0012388346,0.000043705706,0.0021426657,0.00020823641,0.00002854526,0.0000025169506,0.00011646933,0.90711683,0.000113531125,0.08818673,0.00020726862,0.0005946583],"about_ca_topic_score_codex":0.0011286036,"about_ca_topic_score_gemma":0.00033781322,"teacher_disagreement_score":0.5265046,"about_ca_system_score_codex":0.00027759833,"about_ca_system_score_gemma":0.00015828367,"threshold_uncertainty_score":0.9996676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037444297,0.000073878124,0.9478679,0.0018512078,0.002180976,0.0010225902,0.00083901105,0.00046091597,0.008259249],"genre_scores_gemma":[0.64868605,0.000020881545,0.34873015,0.00045599925,0.00022748222,0.00040709955,0.001420255,0.000048127593,0.0000039635083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463964,0.0008458129,0.00087230816,0.0022356345,0.0006480506,0.00075856404],"domain_scores_gemma":[0.99453855,0.0011549274,0.0007648034,0.0030475333,0.00024832494,0.00024586977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007234199,0.000747234,0.00078047253,0.0010380662,0.0005057471,0.00035986744,0.0021736552,0.00030472814,0.00006382483],"category_scores_gemma":[0.00020665639,0.0007534568,0.0006016145,0.00038539528,0.0004452753,0.00030981173,0.002594271,0.0019061221,0.00029486802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071383046,0.0012286645,0.00034318407,0.000119036835,0.0001878291,0.00025356747,0.0012494206,0.015964486,0.000852032,0.9669768,0.006988085,0.005123069],"study_design_scores_gemma":[0.0010657943,0.00024018512,0.009617042,0.00031717698,0.00008494859,0.000024857505,0.00004614939,0.19262248,0.002827853,0.7902459,0.0021328987,0.0007747222],"about_ca_topic_score_codex":0.00037243252,"about_ca_topic_score_gemma":0.00029129785,"teacher_disagreement_score":0.61124176,"about_ca_system_score_codex":0.00021347549,"about_ca_system_score_gemma":0.0003857593,"threshold_uncertainty_score":0.99949163},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19066215,0.0017350013,0.79081416,0.000981708,0.0018057206,0.0010587167,0.0009986993,0.001037381,0.010906443],"genre_scores_gemma":[0.8946056,0.0007889941,0.102966435,0.00019196562,0.0001852654,0.0000016807705,0.0006370812,0.0000501511,0.00057283154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972893,0.00012156375,0.00031149204,0.0011902971,0.0006409905,0.0004463383],"domain_scores_gemma":[0.9964718,0.00007193599,0.00045158446,0.0022961542,0.00031893037,0.0003895825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004912835,0.0004091975,0.00063411164,0.00044499373,0.00017168469,0.0001253774,0.0045159548,0.0004912406,0.00013205636],"category_scores_gemma":[0.000043872657,0.00050581835,0.0004074616,0.00045554945,0.00033753592,0.0005894955,0.0068447175,0.0007213034,0.00010852666],"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.0018764507,0.004359801,0.060243048,0.0042406493,0.0018331321,0.0027584506,0.029966367,0.0070729777,0.0011939431,0.56792694,0.23069656,0.0878317],"study_design_scores_gemma":[0.016154218,0.0010382585,0.06933787,0.0017679356,0.00071065273,0.00008225905,0.002355858,0.19651918,0.0015791963,0.14135277,0.562508,0.0065937988],"about_ca_topic_score_codex":0.003559731,"about_ca_topic_score_gemma":0.00077865674,"teacher_disagreement_score":0.70394343,"about_ca_system_score_codex":0.00016126907,"about_ca_system_score_gemma":0.0003931677,"threshold_uncertainty_score":0.99973935},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15740345,0.00019076669,0.8369392,0.0030670755,0.00073428056,0.00068031414,0.00041201108,0.00021526427,0.0003576284],"genre_scores_gemma":[0.41471547,0.000053543914,0.5840886,0.00038643627,0.000062637664,0.00015979604,0.0005157431,0.000017611044,1.3612764e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960655,0.00055030955,0.0005437695,0.0017875723,0.00030904484,0.0007438293],"domain_scores_gemma":[0.9972561,0.00050916686,0.00032543062,0.0013547392,0.00015328235,0.00040125856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049130234,0.0005367593,0.0007551792,0.0008593818,0.00017235782,0.00059940456,0.0016706845,0.00047353128,0.000028466788],"category_scores_gemma":[0.00021659811,0.0005864503,0.00017818717,0.00047732526,0.00031273067,0.0005089639,0.0035262026,0.0012787954,0.000064077794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010002352,0.00023029589,0.013761828,0.00007056502,0.000101114725,0.000095169926,0.0023747885,0.00067622634,0.0005247531,0.97462004,0.000588019,0.006857169],"study_design_scores_gemma":[0.00083551713,0.000119619595,0.06687182,0.00010846824,0.000022834318,0.000009016509,0.00006155798,0.021926876,0.0007527796,0.90547985,0.0031555507,0.0006560848],"about_ca_topic_score_codex":0.001030236,"about_ca_topic_score_gemma":0.0010950613,"teacher_disagreement_score":0.257312,"about_ca_system_score_codex":0.000088240515,"about_ca_system_score_gemma":0.00033127717,"threshold_uncertainty_score":0.9996587},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030667344,0.00056305114,0.9490552,0.0053023775,0.00050736807,0.00093614345,0.0001840027,0.00068251777,0.012102012],"genre_scores_gemma":[0.109551094,0.0008707994,0.8877031,0.00059643126,0.0004971151,0.00020070461,0.0005290813,0.000050032173,0.0000016019666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99383384,0.0009033393,0.0007930359,0.0023706954,0.00080156134,0.0012974987],"domain_scores_gemma":[0.9946384,0.00048610463,0.00044884547,0.0035419262,0.00035377016,0.0005309449],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010363543,0.00080505817,0.0009627301,0.0010807442,0.0003906498,0.0006292858,0.004188031,0.00059475494,0.00023891566],"category_scores_gemma":[0.00013289515,0.0007322154,0.00041597936,0.0007759833,0.0007870997,0.0006741165,0.007060301,0.003039049,0.0004914151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007879356,0.0002531763,0.006218746,0.00012739982,0.00021051012,0.0001335421,0.0025283007,0.00023119301,0.00012400236,0.9626275,0.0011210159,0.026345849],"study_design_scores_gemma":[0.0008151866,0.00025518992,0.021222709,0.0002662884,0.000058751324,0.00028443235,0.000081155,0.007546072,0.00028599516,0.93999493,0.027984928,0.0012043578],"about_ca_topic_score_codex":0.00008959617,"about_ca_topic_score_gemma":0.00030410435,"teacher_disagreement_score":0.07888375,"about_ca_system_score_codex":0.00013453038,"about_ca_system_score_gemma":0.000634835,"threshold_uncertainty_score":0.9995129},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37608907,0.000030811778,0.6202872,0.00037061935,0.0018344156,0.00057630043,0.000034994984,0.00045314612,0.00032342473],"genre_scores_gemma":[0.9283776,0.000008616462,0.07073307,0.00036432088,0.00036850103,0.000027545982,0.000022253369,0.00004869274,0.000049376165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627334,0.00025898052,0.00058301754,0.0011733727,0.00073509867,0.0009761757],"domain_scores_gemma":[0.997203,0.00064282486,0.00024171862,0.0012494411,0.0003647013,0.00029832067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010568979,0.00046261188,0.00047266224,0.0005195774,0.0011317752,0.00073339755,0.0011974743,0.00022183698,0.000024799629],"category_scores_gemma":[0.000009982425,0.00044749057,0.0003200667,0.0016582637,0.00012448234,0.00047524663,0.00002734094,0.000809011,0.00006130704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007334706,0.0025173912,0.0008428892,0.00064920407,0.00066975615,0.000068725574,0.011529962,0.27809873,0.009606881,0.047174904,0.0010079704,0.6471001],"study_design_scores_gemma":[0.0035944546,0.00096010487,0.0010472743,0.0005010246,0.00005949424,0.00007410727,0.000687887,0.9800184,0.0061310013,0.0005069415,0.0051494096,0.0012698959],"about_ca_topic_score_codex":0.00006036372,"about_ca_topic_score_gemma":0.00007846847,"teacher_disagreement_score":0.7019197,"about_ca_system_score_codex":0.0001895466,"about_ca_system_score_gemma":0.00021719804,"threshold_uncertainty_score":0.9997977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5032675,0.00012721434,0.48676014,0.003973049,0.00054109824,0.00042142541,0.00012934247,0.00088034966,0.0038998716],"genre_scores_gemma":[0.9319414,0.0002726428,0.06753675,0.00007357923,0.000032174674,0.0000014672275,0.000042407795,0.000015732026,0.00008382965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736965,0.00013781471,0.00031463173,0.0012786905,0.00037346318,0.0005257756],"domain_scores_gemma":[0.99661946,0.00011283915,0.00042832262,0.0025159274,0.00014624925,0.00017721539],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038013374,0.00044010548,0.0007795567,0.0010315279,0.00026734968,0.0000831497,0.004262947,0.00107292,0.000076446],"category_scores_gemma":[0.00008050049,0.00049090653,0.00033363455,0.00047792008,0.00075605867,0.00017870478,0.006643854,0.0015407285,0.00011392754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034575438,0.0011954255,0.05754375,0.0012686041,0.00089113833,0.0022825361,0.0028765958,0.00033936297,0.0007902448,0.7385677,0.009627677,0.18427122],"study_design_scores_gemma":[0.0042779385,0.000656074,0.11357894,0.0013793184,0.00035825805,0.00023324681,0.00044556387,0.035036147,0.004097503,0.57991993,0.25652686,0.0034902242],"about_ca_topic_score_codex":0.0002365591,"about_ca_topic_score_gemma":0.00017749898,"teacher_disagreement_score":0.42867392,"about_ca_system_score_codex":0.00006494853,"about_ca_system_score_gemma":0.0001870142,"threshold_uncertainty_score":0.99975425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005475182,0.000036671838,0.96740645,0.0031814943,0.00029558365,0.019889401,0.0003216882,0.0000398746,0.0033536355],"genre_scores_gemma":[0.7416419,0.000056488465,0.23980646,0.0005919131,0.00021795122,0.01754982,0.00009227324,0.0000243933,0.000018792305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953314,0.00023966558,0.0010347605,0.0005358395,0.002153507,0.0007048056],"domain_scores_gemma":[0.9903458,0.0055107977,0.0006430087,0.001391978,0.0019826535,0.00012577407],"candidate_categories":["sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.018887134,0.00033619456,0.0004418769,0.0005308606,0.0016126229,0.0009720882,0.0067246016,0.00016829559,0.0000051813563],"category_scores_gemma":[0.0023736246,0.0001725974,0.00022989331,0.0013564479,0.0038464284,0.0007882948,0.0023632336,0.0010119108,0.000007287282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055153825,0.0003785813,0.000011087261,0.00033692023,0.000035113975,1.4609829e-7,0.017442208,0.0007366692,0.0000050158087,0.97499996,0.0030078453,0.002991286],"study_design_scores_gemma":[0.00042718963,0.00014994756,0.0001676178,0.0002712357,0.0000060336433,0.000004446696,0.00012455306,0.44701588,0.0000759043,0.5495881,0.0020450356,0.0001240713],"about_ca_topic_score_codex":0.000027077998,"about_ca_topic_score_gemma":0.00004791982,"teacher_disagreement_score":0.7361667,"about_ca_system_score_codex":0.00018729347,"about_ca_system_score_gemma":0.0012313836,"threshold_uncertainty_score":0.99968714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11688646,0.0002574005,0.87724173,0.00057512795,0.0018492774,0.00046998536,0.00013786917,0.00042566494,0.002156494],"genre_scores_gemma":[0.22205853,0.000067448265,0.7768511,0.00052688277,0.0003286554,0.000018479182,0.00011359708,0.000035132693,1.6390779e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558985,0.00067723874,0.00073410105,0.0016862258,0.00041647567,0.00089612725],"domain_scores_gemma":[0.9950877,0.0007146442,0.00062932144,0.0030636026,0.00012164836,0.00038308415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006626676,0.00067925354,0.0010194196,0.00055170635,0.00029727753,0.00034759162,0.0037529622,0.0005274829,0.00008817449],"category_scores_gemma":[0.00011626297,0.00068639644,0.000549529,0.00027602533,0.0005228712,0.00029904908,0.0058950135,0.0018917307,0.00022555694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025931648,0.00013005144,0.00613466,0.00011889832,0.00018270648,0.00005978105,0.0011908861,0.0029969339,0.0003234657,0.9862693,0.000987905,0.001579475],"study_design_scores_gemma":[0.0004023728,0.000047025842,0.011311787,0.000121881676,0.000060349008,0.00008442115,0.000019482468,0.11016584,0.00032224588,0.86472213,0.012018046,0.00072439405],"about_ca_topic_score_codex":0.00024090224,"about_ca_topic_score_gemma":0.000087746695,"teacher_disagreement_score":0.121547155,"about_ca_system_score_codex":0.00007654996,"about_ca_system_score_gemma":0.00032271296,"threshold_uncertainty_score":0.99955875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08823033,0.000661635,0.90015686,0.001427046,0.0023978609,0.0006289921,0.0028054125,0.00075054966,0.002941327],"genre_scores_gemma":[0.039842386,0.00032495402,0.9561011,0.0004296568,0.00058490137,0.00020914336,0.0024371077,0.00006896218,0.0000017587998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943732,0.0008224949,0.00087768456,0.0022584472,0.00068583,0.0009823274],"domain_scores_gemma":[0.9941754,0.00075327733,0.0005976987,0.0036022668,0.0003331295,0.0005382263],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006707918,0.0008174566,0.0013751659,0.00046476314,0.0002517933,0.0004346346,0.0047877626,0.00061801093,0.00024194478],"category_scores_gemma":[0.00025795773,0.00085520436,0.00046417557,0.00030200635,0.0007884577,0.00043592727,0.011525373,0.0021332717,0.0011290433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011575351,0.00027989107,0.0012071495,0.00007443704,0.00041769544,0.00022332637,0.007910566,0.00018561343,0.00031685413,0.97703665,0.007821454,0.004410575],"study_design_scores_gemma":[0.0005572041,0.00008967927,0.0037938852,0.00013584783,0.00006886178,0.000021973112,0.00015765248,0.008932947,0.0008545281,0.975093,0.009394907,0.000899488],"about_ca_topic_score_codex":0.00061988033,"about_ca_topic_score_gemma":0.00036065292,"teacher_disagreement_score":0.05594428,"about_ca_system_score_codex":0.00010278542,"about_ca_system_score_gemma":0.00074638275,"threshold_uncertainty_score":0.9996487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40507627,0.000026537737,0.59229726,0.00009722248,0.00015971067,0.00042886267,0.00010430608,0.00018183,0.0016280209],"genre_scores_gemma":[0.9941379,0.00004740401,0.0055818865,0.00008651137,0.000023796447,0.000002372826,0.000040302322,0.0000107771775,0.00006908126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984252,0.00007534432,0.00012774406,0.0010107823,0.0001074205,0.0002535375],"domain_scores_gemma":[0.9979579,0.00017526837,0.00030693389,0.0012493209,0.0001320512,0.00017855654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013208634,0.00027874584,0.0002765828,0.00023694884,0.00040744105,0.00028077926,0.0012978471,0.00013190678,0.000002912142],"category_scores_gemma":[0.000038929105,0.000273449,0.000065022956,0.00022121823,0.0002702877,0.00042869497,0.00097482844,0.0004243174,0.000015914391],"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.0004875491,0.0011599936,0.006808025,0.0022758245,0.00051495177,0.0037815124,0.0056447997,0.14302202,0.000007478402,0.8221593,0.0005750387,0.013563523],"study_design_scores_gemma":[0.001585837,0.0005601186,0.0108804265,0.0007540784,0.00018920662,0.00003779718,0.00017944179,0.8189807,0.000026790718,0.16546237,0.00038640344,0.0009568059],"about_ca_topic_score_codex":0.000072366114,"about_ca_topic_score_gemma":0.00012472249,"teacher_disagreement_score":0.6759587,"about_ca_system_score_codex":0.000038321406,"about_ca_system_score_gemma":0.00023006037,"threshold_uncertainty_score":0.99997175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084910296,0.000051149735,0.9059654,0.0008634954,0.0012641795,0.0006589238,0.00028553396,0.0006565085,0.005344524],"genre_scores_gemma":[0.29396543,0.0001553662,0.70434356,0.0006052659,0.00023271226,0.00010483101,0.00057031424,0.000022419674,1.228944e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958077,0.0006599691,0.0009810019,0.0010917601,0.00056121923,0.0008983476],"domain_scores_gemma":[0.9957332,0.00039952848,0.0006257808,0.0024679916,0.00028834163,0.00048515378],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006821282,0.0007023413,0.0008568278,0.0005601454,0.00048470823,0.00039758653,0.0037012496,0.0006661432,0.00005557399],"category_scores_gemma":[0.0003119293,0.0007105675,0.0003878605,0.00033961574,0.0010653452,0.0012757159,0.0058242264,0.0025684906,0.00029855428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052163177,0.00017349768,0.009822451,0.0001045463,0.000092641865,0.00006094224,0.010740073,0.00026915292,0.00002362425,0.9735948,0.0004118252,0.004654299],"study_design_scores_gemma":[0.000495314,0.00012014951,0.015769247,0.00008779899,0.000032134772,0.00033208466,0.00014867082,0.025329689,0.00011509231,0.9528927,0.0038412332,0.0008358856],"about_ca_topic_score_codex":0.00012984025,"about_ca_topic_score_gemma":0.00016122258,"teacher_disagreement_score":0.20905513,"about_ca_system_score_codex":0.000058079146,"about_ca_system_score_gemma":0.00048133064,"threshold_uncertainty_score":0.9997326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101995304,0.00011954907,0.8922824,0.0022659372,0.00060813787,0.0011481156,0.00035331625,0.0007232676,0.0005039267],"genre_scores_gemma":[0.25425065,0.000069623,0.743514,0.0009151692,0.00018603964,0.00023795184,0.0007889505,0.00003735259,2.5216013e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99417114,0.0007220377,0.0008297501,0.0024897046,0.00071290106,0.0010744797],"domain_scores_gemma":[0.9937452,0.0006153101,0.0006327816,0.004305545,0.00033013077,0.00037102736],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007797859,0.0009277575,0.0010620654,0.0006385276,0.0003379454,0.00040055646,0.004166444,0.00069100776,0.000107063235],"category_scores_gemma":[0.000120700584,0.0008392014,0.0004933944,0.000562963,0.0006684114,0.0005026244,0.0036900858,0.0023339586,0.00015335882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002645657,0.0006626093,0.034600828,0.00020912579,0.00017011227,0.00015354746,0.0016024105,0.0012533031,0.00014401978,0.95375574,0.0011765944,0.006007131],"study_design_scores_gemma":[0.0012383499,0.00038977983,0.102003776,0.0002732549,0.00008732132,0.000074613046,0.000058216912,0.007439231,0.000863796,0.8788161,0.007528916,0.001226592],"about_ca_topic_score_codex":0.00016353985,"about_ca_topic_score_gemma":0.0003921035,"teacher_disagreement_score":0.15225536,"about_ca_system_score_codex":0.00017111601,"about_ca_system_score_gemma":0.00082130515,"threshold_uncertainty_score":0.9999677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27528542,0.003250553,0.4320167,0.052068077,0.008433505,0.008153139,0.0021049175,0.0051464215,0.21354128],"genre_scores_gemma":[0.97007686,0.00062033243,0.028046083,0.00013543043,0.00049778377,0.00020141159,0.0003070842,0.000043199776,0.00007180006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944568,0.00069940224,0.00046110645,0.0013170297,0.00199251,0.0010731316],"domain_scores_gemma":[0.9958215,0.0003242565,0.00018229987,0.002536939,0.00055918784,0.0005758125],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0037516456,0.00032527564,0.00038413142,0.0006861848,0.00034749397,0.00061609875,0.0023759485,0.0005001155,0.0006383957],"category_scores_gemma":[0.0005644916,0.00031723955,0.00025397516,0.00077742425,0.000520189,0.0005774948,0.0052702064,0.0036389346,0.00023430397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033293847,0.0005068706,0.0006253796,0.00015902301,0.00009008273,0.0014557721,0.0015114486,0.0000018005344,0.00015735939,0.935064,0.057099562,0.003295415],"study_design_scores_gemma":[0.00076604285,0.000686237,0.012156634,0.00032683765,0.000051352083,0.00060252525,0.0004503561,0.0043268474,0.0018376082,0.93607944,0.04113086,0.0015852475],"about_ca_topic_score_codex":0.0021807454,"about_ca_topic_score_gemma":0.00068957673,"teacher_disagreement_score":0.69479144,"about_ca_system_score_codex":0.00006274643,"about_ca_system_score_gemma":0.001540954,"threshold_uncertainty_score":0.999928},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3528297,0.00040939718,0.6176966,0.00006663153,0.0009834719,0.00038006413,0.00015792968,0.00031086974,0.02716534],"genre_scores_gemma":[0.994931,0.000199237,0.0046728263,0.000022281838,0.000047405094,6.2165253e-7,0.000021376545,0.000008448394,0.00009683748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983437,0.00010025113,0.00022129618,0.0009117354,0.00014006841,0.0002829471],"domain_scores_gemma":[0.9975871,0.000051906834,0.0003360436,0.0015829033,0.0002703043,0.00017176206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035613685,0.00025700527,0.00036334406,0.00031359628,0.00007818386,0.000079582605,0.002567033,0.00023101862,0.000011787526],"category_scores_gemma":[0.000034783377,0.00028541774,0.0002064093,0.00086430286,0.00019442715,0.0006067379,0.00264574,0.00045669448,0.00002455207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037784393,0.00017041489,0.004414467,0.00016749004,0.00008399737,0.000079665806,0.00037659297,0.0075299535,0.000022657441,0.9849918,0.0012897841,0.0008353865],"study_design_scores_gemma":[0.0013186751,0.00021722182,0.0035165667,0.0003593782,0.000121484205,0.000007824602,0.00036252744,0.1473762,0.00066764484,0.82496893,0.019902838,0.0011807091],"about_ca_topic_score_codex":0.00021017635,"about_ca_topic_score_gemma":0.0001720375,"teacher_disagreement_score":0.6421013,"about_ca_system_score_codex":0.00007405642,"about_ca_system_score_gemma":0.0003261512,"threshold_uncertainty_score":0.9999598},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25768518,0.00008318712,0.7343799,0.0031708635,0.00063588074,0.0012213993,0.00009103806,0.0004111979,0.0023213213],"genre_scores_gemma":[0.44999975,0.00017691511,0.54890144,0.00014768353,0.00016522108,0.0003374955,0.00023349641,0.000037565886,4.0882193e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937613,0.0008215374,0.0008937124,0.0023871416,0.0007637073,0.0013725931],"domain_scores_gemma":[0.99519795,0.0005566378,0.0005121817,0.0030305085,0.0002091006,0.00049364765],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014933591,0.00077273895,0.00094872474,0.0014118939,0.00030258409,0.0005753658,0.004583856,0.0007720465,0.00007239784],"category_scores_gemma":[0.00029437532,0.0007027105,0.00029013611,0.00074516825,0.00091786624,0.00082739943,0.008081534,0.005217759,0.00009599973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017093655,0.00038852534,0.027943231,0.00020024118,0.00012019028,0.00020235438,0.00870032,0.00017457856,0.0007738106,0.95091945,0.00013285688,0.010273519],"study_design_scores_gemma":[0.0014609771,0.00023222523,0.044719204,0.00028912164,0.000032228018,0.000167195,0.000120970464,0.0150861,0.0008204115,0.9301715,0.0058988957,0.0010011587],"about_ca_topic_score_codex":0.0003270929,"about_ca_topic_score_gemma":0.0015107681,"teacher_disagreement_score":0.19231457,"about_ca_system_score_codex":0.00011005623,"about_ca_system_score_gemma":0.0010103177,"threshold_uncertainty_score":0.99994093},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029805742,0.0001571268,0.9579253,0.0044822134,0.0070142974,0.00026813734,0.00012476597,0.00007841531,0.00014398666],"genre_scores_gemma":[0.487817,0.000055805995,0.5113705,0.0002513313,0.00046327786,0.0000047074345,0.000027535649,0.0000087044455,0.0000011693894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943525,0.00015399724,0.0015663264,0.00081180315,0.0027563348,0.0003590386],"domain_scores_gemma":[0.99120647,0.00026287316,0.0021821395,0.00088217127,0.00510814,0.00035822214],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014052369,0.00039632194,0.0006430807,0.0014297508,0.00027434863,0.0018237304,0.009589424,0.00015583131,0.000022051698],"category_scores_gemma":[0.0004041361,0.00037578022,0.0005273055,0.0011959951,0.00089787185,0.0032386805,0.004059445,0.0009969063,0.000014716803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002490843,0.0023184048,0.0034481885,0.00023164539,0.0015749009,0.00028606254,0.022722567,0.29566503,0.0015755516,0.41211993,0.004361519,0.25544712],"study_design_scores_gemma":[0.0015043352,0.00037500734,0.012597739,0.0006217058,0.00007114956,0.00038254666,0.000075856435,0.92721707,0.001040458,0.049107835,0.0063645486,0.0006417369],"about_ca_topic_score_codex":0.00009797258,"about_ca_topic_score_gemma":0.000015424783,"teacher_disagreement_score":0.63155204,"about_ca_system_score_codex":0.00025797833,"about_ca_system_score_gemma":0.0027995117,"threshold_uncertainty_score":0.9998694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09297805,0.0014672279,0.88523567,0.0027652744,0.0042346283,0.0015992498,0.0012928869,0.0016178389,0.0088091865],"genre_scores_gemma":[0.30903283,0.0005765505,0.6872545,0.0005332542,0.0007950577,0.00060953124,0.0010943228,0.0001029355,0.0000010519547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99028295,0.0019336131,0.0015808296,0.0034920385,0.001055556,0.0016550068],"domain_scores_gemma":[0.99155223,0.0012151113,0.00047306,0.0051411367,0.0005330884,0.0010853742],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0017586799,0.001318651,0.0020962094,0.0010986786,0.00041056811,0.000960295,0.0066998512,0.0011730848,0.00022790981],"category_scores_gemma":[0.00032584643,0.0013007872,0.0010484987,0.00072202785,0.00058846397,0.0007958488,0.0063353344,0.0030686117,0.00074407127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020827068,0.0006858441,0.002073442,0.00015806769,0.00096373184,0.00022028112,0.011603573,0.00013918796,0.0004395642,0.973675,0.0075511932,0.0022818102],"study_design_scores_gemma":[0.0030695675,0.00015146018,0.0015518031,0.00018109515,0.00018068185,0.00009539624,0.00024057957,0.006148422,0.0005671203,0.9574037,0.028992187,0.0014179511],"about_ca_topic_score_codex":0.0008801445,"about_ca_topic_score_gemma":0.0009500711,"teacher_disagreement_score":0.21605478,"about_ca_system_score_codex":0.00021025995,"about_ca_system_score_gemma":0.0016385247,"threshold_uncertainty_score":0.9999565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04067031,0.0010157052,0.9498984,0.0017351408,0.0012520961,0.00070702593,0.00008887089,0.0010281237,0.003604312],"genre_scores_gemma":[0.3470126,0.00006673658,0.6513694,0.0009720558,0.00021064909,0.00007791971,0.00025943658,0.00003097985,2.1192345e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99452937,0.00064969796,0.00084188255,0.002263272,0.0005559599,0.0011597923],"domain_scores_gemma":[0.9949353,0.00049941597,0.0006855775,0.0032926614,0.00016712982,0.00041994124],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007332854,0.0009228086,0.0012085519,0.0007497762,0.00034825542,0.00038311613,0.004736417,0.0006119425,0.000050704057],"category_scores_gemma":[0.00014998409,0.0009596382,0.00061615545,0.00046939673,0.00054958626,0.00027520326,0.00550187,0.0038066574,0.00015891259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007529254,0.0003044972,0.0052116276,0.0001280818,0.00015307576,0.00028783316,0.00061604084,0.0049857004,0.00047914774,0.9776065,0.0011181291,0.009034127],"study_design_scores_gemma":[0.0010873644,0.000108624525,0.007996787,0.00034502364,0.00005020029,0.000043767606,0.0000113521655,0.08175288,0.001990881,0.8991159,0.0065041385,0.0009930488],"about_ca_topic_score_codex":0.00008937262,"about_ca_topic_score_gemma":0.0002671346,"teacher_disagreement_score":0.3063423,"about_ca_system_score_codex":0.00009596323,"about_ca_system_score_gemma":0.00045565597,"threshold_uncertainty_score":0.9992854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29081675,0.00019345412,0.7035141,0.000116371135,0.0005918571,0.0002557902,0.000021197811,0.00038377065,0.0041066897],"genre_scores_gemma":[0.9927429,0.0004178152,0.0065240283,0.00014800744,0.00009609606,8.924525e-7,0.00002190543,0.000023487612,0.000024845114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685013,0.00026783472,0.00028228946,0.0018145264,0.00015467794,0.0006305158],"domain_scores_gemma":[0.99714226,0.0001653547,0.00031453007,0.0017160174,0.000091847076,0.0005699683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049109355,0.00052894675,0.00047767523,0.0011323324,0.00045698587,0.0004662231,0.0021773924,0.0004055031,0.00005424269],"category_scores_gemma":[0.000055061508,0.000606494,0.00039423796,0.0013657111,0.00016547258,0.0010559286,0.0021116587,0.0012935918,0.000040198913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032872475,0.0000965268,0.002528154,0.00007071743,0.000108021115,0.00014234669,0.00072588003,0.00037169544,0.000027699198,0.9935262,0.00040894977,0.001960925],"study_design_scores_gemma":[0.0008724567,0.00022305937,0.0054700044,0.00027835765,0.00009643777,0.0000129137525,0.00021671409,0.04970967,0.00022521646,0.94048375,0.001253136,0.0011582916],"about_ca_topic_score_codex":0.0007235764,"about_ca_topic_score_gemma":0.00014027332,"teacher_disagreement_score":0.7019262,"about_ca_system_score_codex":0.00006285129,"about_ca_system_score_gemma":0.00023769357,"threshold_uncertainty_score":0.9996386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0181351,0.0002602267,0.9614786,0.010804949,0.001377009,0.0032441367,0.00040007845,0.00010713353,0.0041927896],"genre_scores_gemma":[0.7589411,0.0003321526,0.23759358,0.0014875041,0.0007358198,0.00070815545,0.00014736224,0.0000330349,0.000021295793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99160516,0.00021624542,0.0010606175,0.0008576325,0.0049495064,0.0013108345],"domain_scores_gemma":[0.99274033,0.0022731998,0.00066546025,0.0023366667,0.001687575,0.00029674472],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.022108262,0.0005214621,0.0005700591,0.0009290801,0.003006183,0.006460909,0.011664174,0.00030387958,0.0000066413895],"category_scores_gemma":[0.0017943603,0.00031811846,0.00027526077,0.0012083529,0.002985789,0.0022513757,0.004280936,0.0017168608,0.00001448717],"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.000039135582,0.00043555137,0.000041032916,0.00090737775,0.00006275562,0.000007761007,0.013478042,0.0076522036,0.0000069575694,0.9595891,0.005177445,0.012602593],"study_design_scores_gemma":[0.0005236939,0.000098879726,0.00017956048,0.00035921694,0.000010620388,0.000028849905,0.000105423416,0.60370153,0.00002156167,0.38241014,0.012298893,0.00026160415],"about_ca_topic_score_codex":0.00006236551,"about_ca_topic_score_gemma":0.000091095375,"teacher_disagreement_score":0.740806,"about_ca_system_score_codex":0.00032441068,"about_ca_system_score_gemma":0.0024395334,"threshold_uncertainty_score":0.9999271},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103769846,0.00032013148,0.88886416,0.0020137676,0.002424891,0.0007706316,0.00019727863,0.00090186275,0.00073746085],"genre_scores_gemma":[0.29134288,0.0002777011,0.7066639,0.00052405865,0.0006121949,0.00010951297,0.0003955141,0.000074045645,1.7991843e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933224,0.0010631589,0.0011763178,0.00217372,0.0011953401,0.0010690917],"domain_scores_gemma":[0.9958058,0.0005955342,0.00085458526,0.001726607,0.0004076583,0.0006097982],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011136447,0.00087205943,0.0010668759,0.00082376704,0.00043466565,0.00030886516,0.002988243,0.0012729078,0.00029072087],"category_scores_gemma":[0.00036922077,0.00080079545,0.0004887618,0.0005819806,0.00088495214,0.00052278506,0.0056163226,0.0025444909,0.00025904522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007203789,0.0002490383,0.001939662,0.00016665838,0.00025825357,0.00029516462,0.0017935133,0.00023332432,0.0029271604,0.98493713,0.00095456373,0.006173516],"study_design_scores_gemma":[0.00096887664,0.000082252714,0.0021870213,0.00049190683,0.00004675567,0.00032314187,0.000047594684,0.1257899,0.00066723773,0.8674484,0.0010688511,0.0008780805],"about_ca_topic_score_codex":0.00010032838,"about_ca_topic_score_gemma":0.00015558992,"teacher_disagreement_score":0.18757303,"about_ca_system_score_codex":0.0001722712,"about_ca_system_score_gemma":0.001123722,"threshold_uncertainty_score":0.9997567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027848378,0.00044148945,0.96018344,0.0025085101,0.0019402393,0.0024868003,0.0022042603,0.0005355671,0.0018513121],"genre_scores_gemma":[0.057514984,0.00010282034,0.9384854,0.001064535,0.00019383793,0.0012347416,0.0013563827,0.000046772286,5.685602e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951455,0.00048787193,0.0008826291,0.0020959629,0.00043523597,0.00095282466],"domain_scores_gemma":[0.9946793,0.0009106969,0.0005628359,0.0033266356,0.00021777312,0.0003027757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063216884,0.00078656536,0.001072555,0.00058718363,0.00048339198,0.00022340984,0.002805721,0.00042942417,0.00003670854],"category_scores_gemma":[0.00036023353,0.00075788045,0.00065804675,0.00029422878,0.0009000023,0.00008456358,0.004570498,0.0013750433,0.00007437379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002862046,0.0005932066,0.00017243584,0.00034246602,0.00021756583,0.00007169831,0.0017957351,0.0042437464,0.00026899588,0.989054,0.001196141,0.001757754],"study_design_scores_gemma":[0.0017815742,0.0002762316,0.0011749149,0.00030898603,0.00008437931,0.000051636434,0.00004374352,0.019933831,0.0011141617,0.9700682,0.004317694,0.00084461045],"about_ca_topic_score_codex":0.00016714858,"about_ca_topic_score_gemma":0.00026515927,"teacher_disagreement_score":0.029666608,"about_ca_system_score_codex":0.00012341367,"about_ca_system_score_gemma":0.00079333485,"threshold_uncertainty_score":0.9994872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051788677,0.000022255628,0.9312201,0.0027066835,0.00082134904,0.0068987263,0.003085767,0.0001159922,0.0033404422],"genre_scores_gemma":[0.6295519,0.000015007635,0.36668277,0.00061647384,0.00026969184,0.002144431,0.00068998896,0.000029210669,5.5647024e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971487,0.00040512314,0.00049855834,0.0010423121,0.0004780278,0.00042731385],"domain_scores_gemma":[0.9943864,0.0008117653,0.00087782386,0.003660651,0.00014479707,0.00011858998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033482796,0.00043811943,0.0005938488,0.00024338003,0.0003965577,0.00018429257,0.0051163035,0.00023340555,0.00023737473],"category_scores_gemma":[0.00034968072,0.00031792832,0.0003968092,0.00007728926,0.001020737,0.00014163424,0.00483254,0.0017355066,0.000047804137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005903218,0.000114711234,0.00062945124,0.00008462151,0.00013938098,0.00004040676,0.0005333024,0.0001693619,0.00034530394,0.99176216,0.004797804,0.0013244428],"study_design_scores_gemma":[0.00029368096,0.000104635175,0.008395855,0.00018913845,0.00001533091,0.000050631734,0.000009733482,0.00085125095,0.004822057,0.9825437,0.0024224992,0.00030150803],"about_ca_topic_score_codex":0.000046315847,"about_ca_topic_score_gemma":0.000071816554,"teacher_disagreement_score":0.5777632,"about_ca_system_score_codex":0.000028213832,"about_ca_system_score_gemma":0.00040498257,"threshold_uncertainty_score":0.9999273},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070991437,0.0006985256,0.98403984,0.0015917851,0.00044726662,0.0015404196,0.00009149638,0.00036494245,0.0041265963],"genre_scores_gemma":[0.20855081,0.00083356316,0.7882886,0.00067550613,0.00024229728,0.001215897,0.00016544087,0.000027500391,4.0996716e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962731,0.0008444082,0.0006769591,0.0015080578,0.00018001735,0.0005174463],"domain_scores_gemma":[0.995031,0.0021360186,0.00049036916,0.0019998143,0.000099107194,0.00024370886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013776543,0.0005591271,0.0013450575,0.0004142554,0.00025871943,0.00023773623,0.0021254981,0.00037225633,0.000028131195],"category_scores_gemma":[0.00019117144,0.00045769333,0.00047195097,0.00017671587,0.0010405674,0.00014770518,0.0056365603,0.0012111817,0.00006950658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059564604,0.00006210883,0.00028992572,0.00009893748,0.00015498021,0.0000051115653,0.0021191344,0.000017361874,0.00008303718,0.98258185,0.00028842746,0.013703476],"study_design_scores_gemma":[0.0089087635,0.000022769675,0.00045811108,0.000047473117,0.00003715359,0.000058632402,0.000032127005,0.011446799,0.00022492783,0.9699261,0.008382077,0.00045505905],"about_ca_topic_score_codex":0.00007613753,"about_ca_topic_score_gemma":0.000045414978,"teacher_disagreement_score":0.20145167,"about_ca_system_score_codex":0.000022413913,"about_ca_system_score_gemma":0.00012331294,"threshold_uncertainty_score":0.9997875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035191804,0.0013990916,0.9439979,0.010273212,0.0032720643,0.0022657954,0.0014334604,0.0018173177,0.00034933657],"genre_scores_gemma":[0.6523323,0.00018831935,0.34514767,0.00028124874,0.00017009595,0.001063127,0.0007371464,0.00005458279,0.000025505504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957383,0.000053370983,0.0009480499,0.0017312407,0.0006224034,0.00090660236],"domain_scores_gemma":[0.99398947,0.00010043583,0.0010384052,0.00398883,0.00069107773,0.00019176275],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00055158616,0.0007912462,0.001118152,0.0020946595,0.0003009295,0.0002538509,0.005012814,0.0021106882,0.000023467612],"category_scores_gemma":[0.00047784238,0.00082542695,0.00067388214,0.0015600354,0.0008366881,0.0008865351,0.002326635,0.0014049704,0.00004493448],"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.000029602208,0.00090997387,0.0049550743,0.0016509399,0.00060334546,0.000040769934,0.00025166836,0.0009154258,0.0042165928,0.8531472,0.030245956,0.10303343],"study_design_scores_gemma":[0.0035429494,0.00067626353,0.002546704,0.0012222398,0.00032900015,0.000028393062,0.000052618652,0.02352092,0.0373269,0.29550087,0.6324816,0.0027715394],"about_ca_topic_score_codex":0.00010652423,"about_ca_topic_score_gemma":0.0000710135,"teacher_disagreement_score":0.61714053,"about_ca_system_score_codex":0.00019524497,"about_ca_system_score_gemma":0.0006561375,"threshold_uncertainty_score":0.9994196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33553982,0.000093324954,0.66075104,0.00034165077,0.0015779714,0.00040283907,0.000088733104,0.00025607162,0.00094852806],"genre_scores_gemma":[0.45332095,0.00004426818,0.5458544,0.00026172164,0.00032329772,0.000038979182,0.000113655406,0.00004248814,2.8511272e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435073,0.0009835954,0.0008113218,0.0020492272,0.00057734264,0.0012277905],"domain_scores_gemma":[0.9951685,0.0011374941,0.0003893745,0.0027576017,0.00015643725,0.00039056691],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011149257,0.0007337718,0.00097519904,0.0008389436,0.00043201764,0.0004284842,0.0035665592,0.00058000983,0.00008440893],"category_scores_gemma":[0.00019094981,0.000757368,0.00050725735,0.00041724162,0.00062234537,0.00032671817,0.009323128,0.0026665945,0.000229281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031476742,0.00013623333,0.012126086,0.00014193008,0.00017857632,0.00016339439,0.0034064583,0.002568228,0.0006299015,0.9785105,0.00018977735,0.0019174523],"study_design_scores_gemma":[0.00035551764,0.00009576629,0.012694878,0.00023285655,0.00007195598,0.00019480521,0.0001115239,0.21660317,0.0006072485,0.76674074,0.0013457955,0.00094573206],"about_ca_topic_score_codex":0.00026062236,"about_ca_topic_score_gemma":0.0001208473,"teacher_disagreement_score":0.21403494,"about_ca_system_score_codex":0.00010303566,"about_ca_system_score_gemma":0.00036134676,"threshold_uncertainty_score":0.99963427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035099413,0.0002787902,0.9487982,0.0014418548,0.0022236914,0.00074256584,0.0003021523,0.0007323667,0.010380986],"genre_scores_gemma":[0.10321625,0.00014145262,0.8949948,0.00057904574,0.00044548247,0.0001676354,0.00040984515,0.000044434317,0.0000010529391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952473,0.0004150479,0.0007069769,0.0021259396,0.00053546816,0.0009692909],"domain_scores_gemma":[0.9947617,0.0005933218,0.00028783336,0.0037873627,0.00015396462,0.00041581356],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006389043,0.00073278963,0.000990559,0.000606752,0.00027266797,0.00030550006,0.005311203,0.0012466662,0.00024844785],"category_scores_gemma":[0.00017869558,0.0007671962,0.0006217782,0.00029511141,0.0007465832,0.00026801025,0.010635348,0.0054653636,0.00067127537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033615623,0.00027114892,0.00063482556,0.000059342427,0.00020503456,0.00012501754,0.0010527287,0.000095349795,0.004164887,0.97792655,0.0022767999,0.013154675],"study_design_scores_gemma":[0.0002209866,0.00005712224,0.012428382,0.00006818147,0.000050709416,0.000050416853,0.0000075486078,0.0051923757,0.001620014,0.9701157,0.0093633095,0.0008252352],"about_ca_topic_score_codex":0.000056753615,"about_ca_topic_score_gemma":0.00016048034,"teacher_disagreement_score":0.068116836,"about_ca_system_score_codex":0.00003995101,"about_ca_system_score_gemma":0.0003119687,"threshold_uncertainty_score":0.9994779},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5563389,0.00032199503,0.43457434,0.00009164337,0.0014745265,0.0010907938,0.0000633041,0.0003186177,0.005725851],"genre_scores_gemma":[0.9980832,0.00023535818,0.0012803545,0.000052419855,0.00007952685,0.0000087559665,0.000039147544,0.000017321949,0.00020397075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723095,0.00033832103,0.000310017,0.0014487243,0.00012965979,0.0005423548],"domain_scores_gemma":[0.99737984,0.00023327522,0.0003631787,0.0016228397,0.00021540592,0.00018545543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035405144,0.0004180769,0.0005001246,0.00055183313,0.00014294434,0.00046854393,0.002579711,0.00035548152,0.000033027765],"category_scores_gemma":[0.000050071165,0.0004498073,0.00022667611,0.0007769855,0.00012828123,0.0015727322,0.0032686666,0.0010532907,0.000112695394],"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.0000321528,0.00015004791,0.0028821456,0.00015852034,0.00008319309,0.00036470726,0.0016957807,0.03613706,0.000016901691,0.95776975,0.00048432747,0.0002253885],"study_design_scores_gemma":[0.0009904669,0.00009130332,0.003218943,0.0006552832,0.00005863315,0.000015772453,0.0017319038,0.73088396,0.00008587091,0.2589955,0.002089502,0.0011828555],"about_ca_topic_score_codex":0.0037675449,"about_ca_topic_score_gemma":0.00021362126,"teacher_disagreement_score":0.6987743,"about_ca_system_score_codex":0.00030608507,"about_ca_system_score_gemma":0.0002204394,"threshold_uncertainty_score":0.9997954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039219804,0.00010849934,0.9547978,0.0012598333,0.00082642643,0.0009002201,0.00013327108,0.0007757273,0.0019783846],"genre_scores_gemma":[0.24990864,0.000101752456,0.74868983,0.0006155905,0.00017010867,0.00020340901,0.0002647376,0.000045611803,3.0025757e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951227,0.0005031327,0.00073275313,0.0021023063,0.00045467718,0.0010844464],"domain_scores_gemma":[0.99532264,0.0006165594,0.0006681635,0.0027470172,0.00018305531,0.000462576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053983164,0.0008133545,0.0009515518,0.0005566768,0.00044435626,0.0002116615,0.00280158,0.00051882816,0.00002484152],"category_scores_gemma":[0.00020042567,0.0007428891,0.0005054892,0.00039198113,0.0006396928,0.00026194385,0.0039675464,0.002273578,0.00006333792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024494933,0.00033049745,0.010479154,0.00017330027,0.00027889377,0.00032428172,0.0028192713,0.0029453626,0.00034460585,0.9722705,0.00048776396,0.0093014585],"study_design_scores_gemma":[0.0018530313,0.0005131718,0.010936779,0.00037892567,0.00008015351,0.00026645366,0.00008785818,0.19474103,0.0024297314,0.7838189,0.0032837426,0.0016102244],"about_ca_topic_score_codex":0.00025874897,"about_ca_topic_score_gemma":0.00042350494,"teacher_disagreement_score":0.21068883,"about_ca_system_score_codex":0.00010163157,"about_ca_system_score_gemma":0.0009750649,"threshold_uncertainty_score":0.99950224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089057274,0.00051510707,0.8997099,0.00011083759,0.0006215164,0.0006664406,0.00011573369,0.00024765029,0.00895555],"genre_scores_gemma":[0.9956091,0.00011136067,0.0038098167,0.0001305475,0.000067220724,0.0000039627816,0.000068841735,0.000019266263,0.0001798592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971357,0.00029469514,0.00036242523,0.0012228382,0.0002870745,0.00069728686],"domain_scores_gemma":[0.9970365,0.00017151349,0.00033940226,0.002093902,0.00020317751,0.00015550367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012826714,0.00045444895,0.00052300165,0.00048828893,0.00027565425,0.00044775903,0.004294359,0.000429482,0.000016645314],"category_scores_gemma":[0.00006008039,0.00042958508,0.00035740822,0.001146415,0.00015835206,0.0011792538,0.002469809,0.0012682246,0.000028379836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107750406,0.00013040277,0.00028645532,0.000056725672,0.00003728361,0.00016451985,0.00074360863,0.49011737,0.000006403766,0.50660217,0.0016782678,0.00006905084],"study_design_scores_gemma":[0.0011172424,0.000032150652,0.00006963844,0.00007953357,0.000043975782,0.0000034831537,0.00032389682,0.74281293,0.000011582579,0.2542459,0.0008670163,0.0003926345],"about_ca_topic_score_codex":0.00046375245,"about_ca_topic_score_gemma":0.00035612026,"teacher_disagreement_score":0.90655184,"about_ca_system_score_codex":0.00015688354,"about_ca_system_score_gemma":0.00042432992,"threshold_uncertainty_score":0.9998156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077617457,0.00001352952,0.9884694,0.00047004083,0.00025774312,0.00055971014,0.00010030314,0.00009077454,0.0022767321],"genre_scores_gemma":[0.66890496,0.000006532051,0.3286644,0.0015061763,0.00017076047,0.00021905288,0.00050122716,0.0000034204434,0.000023471312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989435,0.00000648001,0.00019221143,0.00030794065,0.00038231295,0.00016757331],"domain_scores_gemma":[0.9988718,0.000065189044,0.00010315007,0.0007696207,0.00012140285,0.00006881329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008000285,0.000071312534,0.000064992215,0.00020990265,0.00031776508,0.00064422307,0.0017718569,0.000022992075,0.00003323076],"category_scores_gemma":[0.000023369023,0.00005694289,0.000017737228,0.0009837315,0.000051364907,0.007941814,0.00043038116,0.000045733406,0.00028833296],"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.000024681736,0.000033292006,0.0018038382,0.00003221184,0.0000096621525,5.560086e-8,0.001266043,0.00432833,0.0001482127,0.8855678,0.010200182,0.096585706],"study_design_scores_gemma":[0.00052664906,0.0002539689,0.010952779,0.000027807295,0.000006280606,0.000013372364,0.0005047447,0.38345936,0.00019237069,0.008495307,0.59523743,0.00032994137],"about_ca_topic_score_codex":0.000021156746,"about_ca_topic_score_gemma":0.000011459252,"teacher_disagreement_score":0.87707245,"about_ca_system_score_codex":0.000015807182,"about_ca_system_score_gemma":0.00008586588,"threshold_uncertainty_score":0.6212258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22755747,0.000085317486,0.76794213,0.00018513316,0.00235426,0.0005124694,0.00007286502,0.00015885182,0.0011315346],"genre_scores_gemma":[0.9995164,0.000050782437,0.00012269108,0.000052178373,0.00014422905,0.000002485231,0.000025221001,0.000016732172,0.00006923314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724895,0.00048892293,0.000364771,0.0012109922,0.00025338313,0.00043300563],"domain_scores_gemma":[0.99613464,0.00035237553,0.00055786915,0.0026093079,0.0001799675,0.00016583386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008329394,0.00038306302,0.00056018966,0.00031818735,0.00027766195,0.00021011343,0.0036054794,0.00038109208,0.0000068812005],"category_scores_gemma":[0.000072323804,0.00031798662,0.00038237515,0.0007561919,0.00031753542,0.00030675012,0.002147306,0.0010022605,0.00003397],"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.000046710335,0.000150478,0.0011276851,0.00022444414,0.000085467866,0.000054409553,0.00026001522,0.019791871,0.000013176449,0.9764944,0.001663783,0.000087609995],"study_design_scores_gemma":[0.0003694618,0.00016080911,0.0009867413,0.00043409728,0.00007635503,0.0000060462435,0.0001479463,0.9283023,0.00011583726,0.064117275,0.0048235883,0.0004595774],"about_ca_topic_score_codex":0.00016171791,"about_ca_topic_score_gemma":0.000013532782,"teacher_disagreement_score":0.91237706,"about_ca_system_score_codex":0.00010011714,"about_ca_system_score_gemma":0.0001651194,"threshold_uncertainty_score":0.9999272},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31668082,0.00013166081,0.6805517,0.000068364185,0.0008092375,0.0004647436,0.00008375679,0.0004129351,0.00079678564],"genre_scores_gemma":[0.9890293,0.00012864378,0.010396486,0.00011538313,0.0000943258,0.000003560779,0.00017658362,0.000020795733,0.00003492805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997098,0.000229056,0.00032461638,0.0015948483,0.00018742391,0.00056600507],"domain_scores_gemma":[0.9973175,0.00015448534,0.00038948233,0.0015567694,0.00027498067,0.00030679998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027896365,0.0004880737,0.00045796798,0.00036913736,0.00032455547,0.00034528683,0.0020869933,0.00044082224,0.00006558132],"category_scores_gemma":[0.000027018656,0.0005462451,0.00033888273,0.0008205963,0.00023912787,0.00052517175,0.0027955764,0.00079451693,0.0002947856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029840887,0.00038337748,0.0014321567,0.00018238316,0.0001336373,0.00017240408,0.0020078702,0.4936948,0.000028061206,0.49774852,0.0022377698,0.0019491526],"study_design_scores_gemma":[0.0006170326,0.00007792179,0.0022357116,0.000099107085,0.000051366456,0.000006952448,0.00021933265,0.9520002,0.00007061909,0.04249134,0.0013974896,0.00073292514],"about_ca_topic_score_codex":0.0009864762,"about_ca_topic_score_gemma":0.00016312138,"teacher_disagreement_score":0.67234844,"about_ca_system_score_codex":0.00022271895,"about_ca_system_score_gemma":0.0002532821,"threshold_uncertainty_score":0.9996989},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3968035,0.0001866332,0.58318764,0.0009490257,0.00039622298,0.00048434988,0.00024930236,0.00058096997,0.017162351],"genre_scores_gemma":[0.95573616,0.0000142222625,0.043403953,0.0005271598,0.000042195472,0.0000029826135,0.00022790494,0.000007747525,0.000037660273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985024,0.000039282375,0.0001528902,0.00067128695,0.00035272152,0.00028143515],"domain_scores_gemma":[0.9966562,0.000057010413,0.000051778028,0.0030788088,0.000045243778,0.00011100778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025837892,0.00015208595,0.00017025978,0.00008957518,0.00006895047,0.00017136136,0.0021224539,0.0000538633,0.0005962458],"category_scores_gemma":[0.0000127379635,0.00011027381,0.00003742892,0.0006185134,0.000045271277,0.0015891073,0.0010640236,0.0001671261,0.00020928905],"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.000031999287,0.00024928397,0.040049918,0.00003776028,0.000039739738,0.000033269356,0.00035316226,0.000003066982,0.0003979066,0.93385667,0.022562325,0.0023849062],"study_design_scores_gemma":[0.005474058,0.0008733663,0.10821171,0.000107920045,0.000059212372,0.00012546223,0.00009847219,0.1999628,0.0032230245,0.085780814,0.5941131,0.0019700448],"about_ca_topic_score_codex":0.00017619423,"about_ca_topic_score_gemma":0.00048149523,"teacher_disagreement_score":0.84807587,"about_ca_system_score_codex":0.0000070791225,"about_ca_system_score_gemma":0.000052275933,"threshold_uncertainty_score":0.65284735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5683144,0.000068238915,0.43103254,0.000012799215,0.00012855565,0.00034419083,0.000028110262,0.000047647798,0.000023554754],"genre_scores_gemma":[0.9638913,0.0000674194,0.035921045,0.000008714003,0.000048349993,0.0000010222122,0.0000475063,0.000009004895,0.000005612585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984694,0.00016553789,0.000245962,0.00079354894,0.00012796425,0.0001975685],"domain_scores_gemma":[0.99818367,0.000076410186,0.00041435804,0.000978322,0.0002458083,0.000101452235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047769683,0.00021026314,0.00025558803,0.00031168963,0.000118713804,0.000095744654,0.0007650611,0.00022464163,0.000009736786],"category_scores_gemma":[0.00005274756,0.0002482897,0.000118736694,0.00036866474,0.000108275795,0.00055106205,0.0015315895,0.00028037117,0.0000070600904],"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.0001916766,0.0005689786,0.06414115,0.0008991533,0.0003863011,0.00003114826,0.0053750547,0.69015545,0.013019544,0.20983334,0.00022327696,0.015174945],"study_design_scores_gemma":[0.00057987723,0.000016846727,0.0051458105,0.00006890198,0.00008263226,0.0000019623324,0.000059766902,0.98187464,0.000710134,0.01116505,0.00005924847,0.00023513552],"about_ca_topic_score_codex":0.00058912754,"about_ca_topic_score_gemma":0.000016548356,"teacher_disagreement_score":0.39557698,"about_ca_system_score_codex":0.000091248825,"about_ca_system_score_gemma":0.0000981905,"threshold_uncertainty_score":0.99999696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002790567,0.000120753524,0.98930705,0.00094852585,0.0023545546,0.0011151527,0.00030651392,0.0007001032,0.0023567919],"genre_scores_gemma":[0.36275446,0.0000056219947,0.63598406,0.00043395057,0.00019557378,0.00022247343,0.0003769603,0.000026659427,2.2482791e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523073,0.0008301057,0.00080496335,0.0019455702,0.0005010575,0.00068759674],"domain_scores_gemma":[0.9949415,0.0007369251,0.00061383477,0.0029691064,0.00043442176,0.00030425302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006510305,0.00067484705,0.0007743247,0.0007133337,0.00043798075,0.00025587005,0.0028688235,0.0005266521,0.000036452584],"category_scores_gemma":[0.00016721926,0.000669731,0.00037967938,0.0005287829,0.00062784867,0.000174655,0.002628359,0.0014659159,0.00049293815],"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.00005502667,0.00039741115,0.001318377,0.000535205,0.00011038985,0.000060603226,0.0013462756,0.017474271,0.0000139119375,0.9756595,0.0018068741,0.0012221596],"study_design_scores_gemma":[0.0007680599,0.0001507504,0.0067112306,0.0005301964,0.000040306953,0.000030765874,0.0000748864,0.66669285,0.000301321,0.3227671,0.0012990362,0.0006334712],"about_ca_topic_score_codex":0.000085823696,"about_ca_topic_score_gemma":0.00015472708,"teacher_disagreement_score":0.6528924,"about_ca_system_score_codex":0.0001442872,"about_ca_system_score_gemma":0.0007523138,"threshold_uncertainty_score":0.9995754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029748892,0.000021333415,0.9393056,0.0003146736,0.0007154407,0.026007423,0.0007195608,0.00035440482,0.002812656],"genre_scores_gemma":[0.033689793,0.000012595045,0.94110346,0.00018057562,0.00019923209,0.024200281,0.00057628605,0.000037663933,1.3646371e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99424815,0.0010330848,0.0013223976,0.001863742,0.0007686548,0.00076396525],"domain_scores_gemma":[0.9953545,0.0004762506,0.0013604662,0.002192075,0.00036847376,0.00024827942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007109877,0.00076656835,0.0011044069,0.0010125078,0.00027095314,0.00018913293,0.002587655,0.000445266,0.00004307436],"category_scores_gemma":[0.00013324502,0.00080734043,0.00075821753,0.0005363164,0.0015461593,0.00056478375,0.003311269,0.002271068,0.000047816484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027884785,0.0004838091,0.0026696278,0.00046744352,0.00015713237,0.00011906085,0.0005644995,0.002308015,0.00055466435,0.9824699,0.00040049115,0.009526472],"study_design_scores_gemma":[0.0012995487,0.00023634193,0.0042051952,0.0003505675,0.000049681934,0.00006433175,0.000037579768,0.03172436,0.0035381361,0.9562491,0.0015327267,0.00071242993],"about_ca_topic_score_codex":0.00017836444,"about_ca_topic_score_gemma":0.000279659,"teacher_disagreement_score":0.029416343,"about_ca_system_score_codex":0.00011801496,"about_ca_system_score_gemma":0.0007397617,"threshold_uncertainty_score":0.99943775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017347218,0.000054873133,0.97454953,0.00037120265,0.0034028937,0.0023378907,0.00079831836,0.00051104586,0.00062703755],"genre_scores_gemma":[0.97873694,0.000014104815,0.019948682,0.00042323826,0.00016556833,0.00041628105,0.00015935807,0.00004024956,0.00009556167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968672,0.00029413594,0.0007383978,0.00094945275,0.00060210563,0.000548699],"domain_scores_gemma":[0.9971329,0.0006088483,0.00030945824,0.001382519,0.00031999155,0.00024627772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007250784,0.0004522478,0.0005245042,0.0008156427,0.00051885215,0.00056444627,0.0008030182,0.00030060147,0.00007002998],"category_scores_gemma":[0.000015416115,0.0004155508,0.00063486444,0.000874128,0.0000632966,0.0011546417,0.000003342539,0.0005034633,0.00029612036],"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.012556649,0.018226419,0.0011597732,0.0016276467,0.0016605728,0.0000166227,0.006851999,0.6371203,0.06504135,0.15936866,0.047449403,0.048920587],"study_design_scores_gemma":[0.0074148597,0.0011076595,0.00042025011,0.0004501579,0.0000853384,0.000009000726,0.00042373917,0.92435396,0.050827056,0.00025488558,0.013750154,0.0009029206],"about_ca_topic_score_codex":0.00013213849,"about_ca_topic_score_gemma":0.000084544896,"teacher_disagreement_score":0.9613897,"about_ca_system_score_codex":0.00018887328,"about_ca_system_score_gemma":0.00014154533,"threshold_uncertainty_score":0.99982965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040703084,0.00016044275,0.9893992,0.006314399,0.001313356,0.00058932794,0.00003363302,0.00007012819,0.0017124951],"genre_scores_gemma":[0.9563928,0.000027117485,0.039473727,0.0038803515,0.00019404695,0.000007340313,0.0000021007393,0.000017471462,0.000005018623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966391,0.0001321331,0.0005093706,0.0011607831,0.0011726026,0.00038603865],"domain_scores_gemma":[0.99509776,0.0016162862,0.0003636823,0.0026503874,0.0001722352,0.00009963047],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0013923098,0.0003913502,0.00047611707,0.00020481461,0.00037280368,0.00028617852,0.0063694855,0.00019234829,0.000016635151],"category_scores_gemma":[0.00043982972,0.0002155957,0.00030697836,0.0012161941,0.0015932105,0.00031528485,0.0022543035,0.0011117196,0.000014926525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050524653,0.0000640184,0.000090524874,0.00005139176,0.000014117638,0.000014532069,0.0016618848,0.0020633014,0.00016959522,0.86512756,0.00007322305,0.13061933],"study_design_scores_gemma":[0.00046254703,0.00019306825,0.00048268624,0.00031915397,0.000011426103,0.00001181492,3.7339206e-7,0.25785282,0.003156517,0.7328741,0.004215784,0.0004196904],"about_ca_topic_score_codex":0.00003162557,"about_ca_topic_score_gemma":0.00008046668,"teacher_disagreement_score":0.9559858,"about_ca_system_score_codex":0.00007579878,"about_ca_system_score_gemma":0.00048475078,"threshold_uncertainty_score":0.9990065},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6255798,0.00011696457,0.3732065,0.00006517783,0.00048537354,0.00018422712,0.000051728013,0.00008243679,0.00022780187],"genre_scores_gemma":[0.99236506,0.000041480787,0.0072692935,0.00027652102,0.000022845583,0.0000022951433,0.000011727295,0.000008353672,0.0000024330413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847305,0.00008850558,0.00023804454,0.0007115891,0.00020764906,0.00028113846],"domain_scores_gemma":[0.99870664,0.00024987996,0.00008078693,0.0008404196,0.000037089667,0.00008518857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035351247,0.00018767532,0.00022606524,0.00019246401,0.00020589127,0.00025032522,0.00062175165,0.00007623274,0.0000101749965],"category_scores_gemma":[0.0000012324269,0.00018630327,0.000026648931,0.00055974483,0.00006177076,0.00070965197,0.00006518622,0.0002838914,0.000011731217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020720325,0.0044098934,0.050912593,0.0040548216,0.00095542934,0.00015445011,0.10751264,0.269694,0.015095295,0.16794895,0.00017106444,0.37701884],"study_design_scores_gemma":[0.0012989136,0.00018020051,0.011461141,0.00020247723,0.000017042847,0.000018549872,0.00089813257,0.98330766,0.000635938,0.0010647151,0.0005391519,0.0003760759],"about_ca_topic_score_codex":0.0006900667,"about_ca_topic_score_gemma":0.00040466074,"teacher_disagreement_score":0.7136137,"about_ca_system_score_codex":0.000018255012,"about_ca_system_score_gemma":0.000027115362,"threshold_uncertainty_score":0.7597227},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2653129,0.000040660023,0.72012424,0.00017527865,0.00014509607,0.0000858588,0.0000049948508,0.00018777081,0.013923214],"genre_scores_gemma":[0.86479354,0.0000049640435,0.13460998,0.0003685564,0.00001847356,0.0000012981858,0.000011989768,0.000003940255,0.00018728076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993694,0.000010471252,0.00007093061,0.0002399108,0.00014745217,0.00016182808],"domain_scores_gemma":[0.9993524,0.000020693837,0.000020360025,0.00052725204,0.000029993045,0.000049296068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059930368,0.000068514906,0.00008051801,0.000045745997,0.00003983979,0.00009018405,0.00043829277,0.00002227645,0.00012219671],"category_scores_gemma":[0.0000022548877,0.000049113278,0.000022775856,0.00035247047,0.000015840815,0.0007210556,0.00012897134,0.00006393199,0.00009699534],"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.000021656295,0.00028338912,0.020391602,0.000034788645,0.000021338643,0.000015892052,0.00030574625,0.00014340159,0.00080850726,0.9571947,0.0014606124,0.019318363],"study_design_scores_gemma":[0.0070534986,0.0019088761,0.19557875,0.00041058284,0.000036684563,0.00024802572,0.001128161,0.28948516,0.023486728,0.06213262,0.41553238,0.0029985358],"about_ca_topic_score_codex":0.000093463765,"about_ca_topic_score_gemma":0.000048252106,"teacher_disagreement_score":0.8950621,"about_ca_system_score_codex":0.000006099064,"about_ca_system_score_gemma":0.000026983069,"threshold_uncertainty_score":0.20027813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8613027,0.0005350147,0.13695648,0.00005125024,0.00012853372,0.00018628965,0.0000012702226,0.000056929395,0.00078154117],"genre_scores_gemma":[0.98271203,0.00007421503,0.01713162,0.00006122988,0.000004564372,0.000005782149,0.0000026874357,0.0000020903256,0.000005805623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932736,0.000025307978,0.00011727189,0.00025951603,0.00013570045,0.00013484096],"domain_scores_gemma":[0.99959594,0.000024068926,0.000031070445,0.00029345346,0.000014099313,0.000041392104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017280983,0.00006448264,0.00007932985,0.0000976302,0.000032436277,0.000075768956,0.00020358773,0.00003573359,0.00002386376],"category_scores_gemma":[0.000008152092,0.00005219408,0.000020207464,0.00027423367,0.000013842,0.00033130485,0.00026383213,0.000064828586,0.000014563353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023219527,0.00014119374,0.011733756,0.000056917517,0.000003863729,0.000005502078,0.0021325764,0.0004090744,0.009212485,0.07900226,0.00008325726,0.8971959],"study_design_scores_gemma":[0.0020776135,0.00039926707,0.21935338,0.00036355224,0.0000045339502,0.000024732955,0.00016921443,0.70066786,0.04372116,0.015113602,0.01750372,0.000601392],"about_ca_topic_score_codex":0.000031758907,"about_ca_topic_score_gemma":0.000010860226,"teacher_disagreement_score":0.8965945,"about_ca_system_score_codex":0.000012306984,"about_ca_system_score_gemma":0.000011940194,"threshold_uncertainty_score":0.21284129},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65189344,0.00015982249,0.34661207,0.00045508775,0.000114453775,0.00010666608,0.000053148244,0.00012173363,0.0004835678],"genre_scores_gemma":[0.9810407,0.000015410773,0.018558096,0.00025772754,0.000030630723,0.0000014637808,0.00008294419,0.0000051093753,0.0000079271895],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853903,0.000052231935,0.00019328277,0.0006301035,0.00028040312,0.00030492965],"domain_scores_gemma":[0.9972903,0.00021782878,0.000042878877,0.0022887776,0.000028444467,0.00013176282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039209533,0.00013049645,0.00015193279,0.00006420821,0.00011592783,0.00041813464,0.00238966,0.000053406275,0.000106431806],"category_scores_gemma":[0.00016025321,0.00010645121,0.00003357134,0.00032454505,0.00004571582,0.0008218028,0.006653064,0.00014218484,0.000029822193],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055682995,0.00047373708,0.5650204,0.00021504055,0.00010878326,0.000026418214,0.0015517024,0.00028696537,0.006196301,0.4050583,0.008530285,0.012476406],"study_design_scores_gemma":[0.0007298997,0.00008112396,0.4827371,0.000079156365,0.00001792704,0.0000123976715,0.00010476255,0.48855588,0.0004595419,0.0021409811,0.024580237,0.00050100934],"about_ca_topic_score_codex":0.00009463625,"about_ca_topic_score_gemma":0.000016935663,"teacher_disagreement_score":0.4882689,"about_ca_system_score_codex":0.00000935991,"about_ca_system_score_gemma":0.000028567547,"threshold_uncertainty_score":0.82925683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28307512,0.00006321401,0.71292806,0.00024076943,0.00023823293,0.0006100107,0.00012863002,0.0002463383,0.0024696167],"genre_scores_gemma":[0.7590941,0.00015695345,0.24028552,0.00029375262,0.000036273526,0.000013746709,0.00010076335,0.0000090940175,0.000009784961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830383,0.00007472978,0.00035455613,0.0005074356,0.00044422378,0.0003152272],"domain_scores_gemma":[0.99815947,0.00019752653,0.00028840685,0.0010943714,0.00012505721,0.00013517361],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00056262617,0.00032474412,0.00037307353,0.0001552801,0.00015057524,0.0011379328,0.0009698089,0.00023847522,0.00002235235],"category_scores_gemma":[0.00009160169,0.00026122233,0.000072863804,0.00029074083,0.0001336092,0.0022668347,0.0021282,0.00070122315,0.000021303304],"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.0007865024,0.00031756272,0.032375008,0.0031354758,0.0006193728,0.000034134442,0.014792268,0.00571166,0.0008106888,0.91900814,0.0019917046,0.020417508],"study_design_scores_gemma":[0.010025414,0.0019411938,0.37361798,0.003448041,0.000446248,0.0004867834,0.0009926,0.47322136,0.013509131,0.029964587,0.08299936,0.009347315],"about_ca_topic_score_codex":0.000097100674,"about_ca_topic_score_gemma":0.000015144824,"teacher_disagreement_score":0.8890435,"about_ca_system_score_codex":0.000034718894,"about_ca_system_score_gemma":0.00010363638,"threshold_uncertainty_score":0.999984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99241185,0.00016891203,0.00042564736,0.0018527597,0.00019799874,0.0007943133,0.000003871965,0.0002598038,0.0038848622],"genre_scores_gemma":[0.95594585,0.00000337729,0.0437535,0.00017807432,0.000031363805,0.000030923693,0.0000016112645,0.0000063005214,0.00004901659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989978,0.000007924514,0.00016892106,0.00031477152,0.000298026,0.00021255988],"domain_scores_gemma":[0.99891603,0.0000688515,0.00017717842,0.0006844981,0.00011741892,0.00003599357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003287,0.00011987401,0.00013756192,0.0000739193,0.00007354709,0.0001637168,0.002494729,0.000052447387,0.00000827292],"category_scores_gemma":[0.00060610595,0.00007764614,0.000100139434,0.0005335487,0.000055915545,0.0003630727,0.000803832,0.00014021824,0.000024025541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000244404,0.00021783971,0.0107781,0.0002505957,0.000023961065,6.462399e-7,0.001991287,0.0000061964174,0.00823951,0.94285995,0.0010205661,0.034586903],"study_design_scores_gemma":[0.0022538016,0.0025494571,0.04723751,0.0009804828,0.00011191091,0.000094001196,0.0030420674,0.002859447,0.14715025,0.75717795,0.03495364,0.0015895092],"about_ca_topic_score_codex":0.0000123640975,"about_ca_topic_score_gemma":0.0000017653956,"teacher_disagreement_score":0.18568203,"about_ca_system_score_codex":0.000015750964,"about_ca_system_score_gemma":0.000015022476,"threshold_uncertainty_score":0.46358684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9152225,0.0001423756,0.070282206,0.0023123643,0.00024622917,0.0008637709,0.000024814819,0.0070441007,0.0038616173],"genre_scores_gemma":[0.8641335,0.00011852201,0.13531871,0.00024943548,0.000020645994,0.00008760019,0.000014102657,0.000025693827,0.000031812833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969325,0.000009417977,0.00041434585,0.0011954977,0.000618794,0.00082940893],"domain_scores_gemma":[0.99793583,0.000113707014,0.00030216,0.0013119928,0.00023595098,0.00010034819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063344097,0.00040155702,0.00041847085,0.0006323338,0.00022583752,0.00038871617,0.0029392368,0.00023045235,0.00003400315],"category_scores_gemma":[0.00041981455,0.00032365997,0.000078072044,0.0017687761,0.0001640173,0.0020980993,0.0017265567,0.00070334505,0.00026315896],"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.00036202703,0.00059847103,0.019843468,0.0008824995,0.00010613815,0.000052604748,0.0018030715,0.0000051087018,0.12708426,0.80622166,0.010233642,0.032807056],"study_design_scores_gemma":[0.0023393822,0.004500642,0.0014292467,0.0011946792,0.000044225184,0.00025251476,0.0036421819,0.0037314252,0.88202834,0.06016472,0.03858637,0.0020862734],"about_ca_topic_score_codex":0.000027390053,"about_ca_topic_score_gemma":0.00001040299,"teacher_disagreement_score":0.7549441,"about_ca_system_score_codex":0.00009029474,"about_ca_system_score_gemma":0.00014124023,"threshold_uncertainty_score":0.99992156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7960555,0.005492573,0.19220349,0.00019760418,0.0014300692,0.0009840722,0.00015615494,0.00008998187,0.0033905706],"genre_scores_gemma":[0.98025244,0.00049263256,0.018856332,0.00017827639,0.00015842587,0.000014968407,0.0000055334513,0.000017931585,0.000023425288],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99678993,0.0003033128,0.0009797898,0.0006876887,0.000828911,0.0004103521],"domain_scores_gemma":[0.9961146,0.0002881418,0.0009530771,0.0015789771,0.00079621235,0.000268952],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002336037,0.00027971892,0.0006796294,0.00059297343,0.00024073881,0.00093214354,0.007245257,0.00013141746,0.0024664928],"category_scores_gemma":[0.0006595263,0.00024460952,0.0002610352,0.0022891674,0.0005039835,0.0050670533,0.002935874,0.00036151052,0.000011740606],"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.0004396563,0.0022223147,0.74983287,0.0003359395,0.0002960198,0.000025863237,0.0014164094,0.000013101361,0.12679066,0.005985094,0.04547214,0.06716993],"study_design_scores_gemma":[0.0007771889,0.000052780055,0.73627365,0.00021610897,0.000035126246,0.000009355556,0.000027627844,0.0015688293,0.21887219,0.031002183,0.010706373,0.00045858693],"about_ca_topic_score_codex":0.0005876331,"about_ca_topic_score_gemma":0.00011943216,"teacher_disagreement_score":0.184197,"about_ca_system_score_codex":0.000046859375,"about_ca_system_score_gemma":0.00019364432,"threshold_uncertainty_score":0.9984454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08179524,0.0001271163,0.90952516,0.00016892055,0.0014810893,0.0009789284,0.002074143,0.00032541287,0.0035240236],"genre_scores_gemma":[0.83992314,0.00002639055,0.15835443,0.0004886107,0.000113609276,0.000044846114,0.0009689749,0.000038406957,0.000041583484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968859,0.00007218241,0.0010551189,0.00052836223,0.0005130681,0.00094538],"domain_scores_gemma":[0.9974182,0.00047111587,0.00035733072,0.0010766876,0.00027482642,0.0004018263],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00085950625,0.00047782567,0.0006145989,0.00027008884,0.0004765337,0.001041318,0.0014596916,0.00020969429,0.0000375665],"category_scores_gemma":[0.00019083674,0.00044110458,0.0001818063,0.0004226703,0.00030535532,0.0022185605,0.0014128115,0.0005630223,0.00023149772],"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.00006269093,0.0004420251,0.012620908,0.0009783288,0.00011471391,0.000009064243,0.009646056,0.000009088418,0.000024544588,0.9494124,0.010499995,0.016180202],"study_design_scores_gemma":[0.00544861,0.0007884934,0.015000123,0.00038840054,0.00007079683,0.00019650589,0.0010308112,0.6877196,0.00012019193,0.13384268,0.15372339,0.0016704417],"about_ca_topic_score_codex":0.000057406014,"about_ca_topic_score_gemma":0.000026153017,"teacher_disagreement_score":0.8155697,"about_ca_system_score_codex":0.00006891806,"about_ca_system_score_gemma":0.000085892665,"threshold_uncertainty_score":0.9999957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4432703,0.000077480814,0.54869694,0.0030967165,0.00011137201,0.0005556592,0.00000565172,0.0037878284,0.0003980706],"genre_scores_gemma":[0.88604087,0.000067595385,0.1136116,0.000115037285,0.000013125816,0.000107250395,0.0000020412615,0.000020296107,0.000022209553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976356,0.00000902308,0.00033074454,0.0008994664,0.00047945481,0.0006457134],"domain_scores_gemma":[0.9987579,0.00007403142,0.00020280309,0.00074506144,0.00015623604,0.00006396428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043230437,0.00034708774,0.0003199389,0.0005817783,0.00026710908,0.00026827215,0.001955231,0.00024186536,0.000012818747],"category_scores_gemma":[0.0001379917,0.00028775583,0.00009761896,0.0015371325,0.00015646797,0.00071395724,0.0003385386,0.00060462405,0.000066959896],"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.00018781885,0.0004381326,0.0036720228,0.000293765,0.000116130046,0.000012835588,0.002686232,0.00007814128,0.10947723,0.80283344,0.0004661799,0.07973806],"study_design_scores_gemma":[0.0017254463,0.0022607765,0.0013096781,0.000851395,0.00003958203,0.00012266195,0.0015369874,0.036958072,0.85551727,0.09215895,0.006112541,0.0014066319],"about_ca_topic_score_codex":0.000014059175,"about_ca_topic_score_gemma":0.000010231399,"teacher_disagreement_score":0.74604005,"about_ca_system_score_codex":0.00009470866,"about_ca_system_score_gemma":0.000057951762,"threshold_uncertainty_score":0.99995744},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96238345,0.0002856592,0.010306363,0.019427598,0.00028261764,0.0007166439,0.000025357154,0.0057094553,0.0008628806],"genre_scores_gemma":[0.9487091,0.0001214149,0.049590956,0.0012889447,0.000057030946,0.00013574804,0.0000058487826,0.000042924272,0.000048075544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961179,0.000008402323,0.00052056427,0.0015522899,0.00078422576,0.0010166246],"domain_scores_gemma":[0.9976538,0.00010677367,0.0003566195,0.001550147,0.00022830162,0.00010435639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004425171,0.00059405284,0.0005619548,0.0010644173,0.00028314514,0.0006486476,0.0045052567,0.0004749437,0.000026049975],"category_scores_gemma":[0.00046956338,0.0005090758,0.00026617636,0.002361934,0.00026860123,0.0016480286,0.0030819415,0.0009199504,0.00028311473],"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.00025701712,0.0011487914,0.21557094,0.0015864689,0.00048156813,0.00009026788,0.033131182,0.000003742863,0.2000843,0.3724044,0.04235329,0.13288803],"study_design_scores_gemma":[0.0012144351,0.0009271916,0.009078235,0.0010016032,0.000046414756,0.00008689115,0.004344782,0.0036478573,0.819159,0.13076854,0.027918685,0.0018064016],"about_ca_topic_score_codex":0.00005134808,"about_ca_topic_score_gemma":0.0000051575357,"teacher_disagreement_score":0.61907464,"about_ca_system_score_codex":0.00009779408,"about_ca_system_score_gemma":0.0000613036,"threshold_uncertainty_score":0.9997361},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12383049,0.00006847646,0.875268,0.000033748147,0.00033540826,0.00022062323,0.000018951006,0.000074813586,0.00014952387],"genre_scores_gemma":[0.23018779,0.000024277317,0.7693489,0.0003726581,0.000040723913,0.000008991798,0.00001193623,0.0000042864485,4.1023378e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982341,0.0000179616,0.00056456117,0.00019061526,0.00066933566,0.0003234109],"domain_scores_gemma":[0.995806,0.0030058858,0.00017325864,0.00071725354,0.00006549035,0.00023214886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088700117,0.00013804724,0.00022923092,0.00011643172,0.00015534849,0.00046752158,0.0010414195,0.0001608951,0.00009674428],"category_scores_gemma":[0.0017042157,0.000110339395,0.00008791605,0.00031499728,0.000031313048,0.00082851056,0.0015352261,0.00021860535,0.000027711423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085747786,0.00006149481,0.0024803404,0.0005915582,0.000021032802,0.0000050695976,0.0019282644,0.00032898205,0.000007237503,0.44496855,0.002128262,0.54739344],"study_design_scores_gemma":[0.00036353682,0.000044100052,0.0006675084,0.0006589007,0.0000029815578,0.00001349075,0.00014429684,0.7943343,0.000014504899,0.19899583,0.004618898,0.0001416532],"about_ca_topic_score_codex":0.0000013299597,"about_ca_topic_score_gemma":0.0000038681333,"teacher_disagreement_score":0.79400533,"about_ca_system_score_codex":0.000011658737,"about_ca_system_score_gemma":0.000077577395,"threshold_uncertainty_score":0.45083213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72353506,0.00008761047,0.2743997,0.00012160747,0.0004774024,0.0002792583,0.0000022388774,0.000084035724,0.0010130528],"genre_scores_gemma":[0.889723,0.0000070430674,0.11000761,0.00020153874,0.000044938773,0.0000093228855,0.0000021400733,0.00000312273,0.0000012549035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973272,0.000039223658,0.00027863187,0.0006482835,0.0013476381,0.00035900652],"domain_scores_gemma":[0.9981358,0.00007894467,0.00017967499,0.0007094805,0.000782926,0.000113159076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002108084,0.0001482317,0.00017646185,0.0002751312,0.00015273131,0.00020822986,0.0019352584,0.000042073818,0.000027406331],"category_scores_gemma":[0.00003725953,0.00013136218,0.000051060626,0.0017874733,0.0004142218,0.0024781853,0.0005772967,0.00010925987,0.00004912949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001699109,0.000342048,0.09666809,0.00031263384,0.00003626019,0.0000010619449,0.002957,0.003650282,0.015999764,0.41344607,0.00018701685,0.46638277],"study_design_scores_gemma":[0.0004599934,0.00012923931,0.06700039,0.00007392646,0.000007710921,0.000012758466,0.000020948177,0.91671324,0.012210972,0.0029725325,0.00018567262,0.00021264247],"about_ca_topic_score_codex":0.000004849278,"about_ca_topic_score_gemma":0.000002640988,"teacher_disagreement_score":0.91306293,"about_ca_system_score_codex":0.000037388672,"about_ca_system_score_gemma":0.00072579435,"threshold_uncertainty_score":0.5356794},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06270252,0.0005016247,0.9323659,0.0001420162,0.00059617066,0.00048262472,0.0028752433,0.00026346117,0.00007047106],"genre_scores_gemma":[0.9975164,0.00030227785,0.0014822801,0.00005651805,0.000021531947,0.00008182538,0.0005180592,0.000011269935,0.000009826193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976352,0.00018045794,0.00055390876,0.00074951374,0.00036794582,0.000513009],"domain_scores_gemma":[0.9984665,0.00023682232,0.00012538381,0.00085770374,0.00008524704,0.00022833946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034888514,0.000319621,0.00043518798,0.0003532015,0.00024103245,0.0003193667,0.0005142692,0.0001411745,0.000024824747],"category_scores_gemma":[0.000011037755,0.0002958547,0.00013586553,0.001291944,0.00010914167,0.0009073781,0.00001343329,0.00039581992,0.000035383884],"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.0017977634,0.0054666824,0.05616819,0.0018215647,0.00094705226,0.0005305224,0.0030531802,0.48597586,0.0070742792,0.42166305,0.0028015154,0.012700325],"study_design_scores_gemma":[0.02126265,0.002371645,0.072951294,0.0026924112,0.00028957843,0.0006804801,0.008169919,0.784205,0.002067577,0.008321778,0.08996223,0.0070253876],"about_ca_topic_score_codex":0.0008988211,"about_ca_topic_score_gemma":0.00025808555,"teacher_disagreement_score":0.9348139,"about_ca_system_score_codex":0.000039331106,"about_ca_system_score_gemma":0.000058850655,"threshold_uncertainty_score":0.99994934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27679557,0.00017339842,0.7187115,0.0001584551,0.0018473607,0.0011621334,0.00013073217,0.00023501289,0.00078583154],"genre_scores_gemma":[0.9980533,0.000008220199,0.0010815447,0.0005195949,0.00014858707,0.00015494709,0.000015746522,0.000013258552,0.0000048158468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793696,0.000092244125,0.00035067394,0.00080150896,0.00031762113,0.0005009954],"domain_scores_gemma":[0.9980098,0.0004134447,0.00020511077,0.0010146563,0.00019371453,0.00016330235],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064517546,0.0002417405,0.00039833924,0.00017685606,0.00023759688,0.0010499337,0.0024182086,0.000116046744,0.000013166002],"category_scores_gemma":[0.000041012503,0.00021957196,0.00013218228,0.00061590684,0.00006485474,0.0022255788,0.0002602434,0.00015595459,0.000019295765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035341163,0.0043747136,0.19237156,0.024211721,0.0008767961,0.00013819782,0.0054271566,0.011842615,0.037883196,0.6308707,0.054235756,0.034233466],"study_design_scores_gemma":[0.016936295,0.0010041078,0.013738937,0.0007968269,0.0001554908,0.000031646436,0.00014067133,0.7813154,0.152834,0.016356297,0.014223018,0.0024673287],"about_ca_topic_score_codex":0.00016813968,"about_ca_topic_score_gemma":0.000056102952,"teacher_disagreement_score":0.7694728,"about_ca_system_score_codex":0.00003844741,"about_ca_system_score_gemma":0.00010622048,"threshold_uncertainty_score":0.99998707},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40686867,0.0013867785,0.58830667,0.00015633651,0.00050672324,0.0010090331,0.00030325007,0.00009141584,0.0013711392],"genre_scores_gemma":[0.8745385,0.00014146636,0.12502225,0.000026568032,0.00007879917,0.00008441191,0.000061259256,0.000044144224,0.0000025980441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995583,0.00061587075,0.0010556573,0.0016172626,0.00043662326,0.00069157884],"domain_scores_gemma":[0.9946291,0.0008501865,0.0014919816,0.0024598106,0.00033213105,0.00023677608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006936823,0.00070942467,0.0018644347,0.00067997613,0.00012996249,0.00007176013,0.0021859652,0.0005254514,0.00007586767],"category_scores_gemma":[0.0001258819,0.0006344993,0.00036180727,0.000397643,0.0012856398,0.00012655456,0.004372007,0.0009995985,0.000055733053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015287765,0.0025940866,0.040423114,0.0027848117,0.0016955903,0.0000352921,0.011281039,0.0038235276,0.012224369,0.91455644,0.00043617905,0.008616782],"study_design_scores_gemma":[0.0045767515,0.0018484929,0.2168787,0.0032360037,0.0006859215,0.00010334817,0.00029568103,0.00928211,0.070488356,0.68855625,0.0012304406,0.0028179386],"about_ca_topic_score_codex":0.0002675771,"about_ca_topic_score_gemma":0.0002352404,"teacher_disagreement_score":0.46766984,"about_ca_system_score_codex":0.000051129377,"about_ca_system_score_gemma":0.0004975502,"threshold_uncertainty_score":0.9996106},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09232398,0.0007315384,0.8952467,0.000101097074,0.0010395298,0.000562924,0.00005782162,0.00022456901,0.009711834],"genre_scores_gemma":[0.99488497,0.00004708811,0.0046199276,0.00005799968,0.00015979217,0.000013294674,0.00017892933,0.000007139696,0.000030886393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853975,0.00007356045,0.00045350599,0.00032433282,0.00031654435,0.0002922915],"domain_scores_gemma":[0.9971989,0.00013421566,0.00023378628,0.0021518944,0.00014558282,0.00013563815],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004135686,0.00019662523,0.00026138042,0.00021744397,0.00019915683,0.0010863433,0.00204514,0.00011794416,0.000027474583],"category_scores_gemma":[0.000077790864,0.00015180508,0.000032601944,0.00046402003,0.000030250098,0.010533462,0.0022810048,0.00023738593,0.0003073127],"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.000114564915,0.00022540092,0.057217207,0.002911763,0.00024628613,0.0000038198314,0.07570581,0.00014712762,0.000117425705,0.79240763,0.018262306,0.05264065],"study_design_scores_gemma":[0.0014949905,0.00017670632,0.017024104,0.00091598416,0.000025624411,0.00006054724,0.0010046583,0.3987034,0.00007452847,0.0009527934,0.57887304,0.00069364463],"about_ca_topic_score_codex":0.000040176343,"about_ca_topic_score_gemma":0.000004146417,"teacher_disagreement_score":0.90256095,"about_ca_system_score_codex":0.000018925573,"about_ca_system_score_gemma":0.000062232095,"threshold_uncertainty_score":0.99995065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49540928,0.00013861049,0.50297576,0.0007563891,0.00022602156,0.00006548196,0.000003381663,0.000009359292,0.00041570837],"genre_scores_gemma":[0.7975557,0.00001752115,0.20233224,0.000030922758,0.00005100554,8.1248817e-7,8.7506083e-7,0.0000039037905,0.000007007671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998969,0.000072428964,0.0004910299,0.00011781847,0.00019915705,0.00015056731],"domain_scores_gemma":[0.99887824,0.00024033691,0.00033781605,0.00032923982,0.0001302603,0.00008413006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004892157,0.00008036567,0.000315379,0.0001727479,0.000037103662,0.000040797688,0.00050914416,0.000082667495,0.000091411806],"category_scores_gemma":[0.00025471652,0.00006436867,0.00009141199,0.00020163642,0.000040255592,0.0005677425,0.0002635829,0.00018327453,0.000017259108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014788061,0.000405801,0.005059743,0.00041419026,0.00012168502,0.00001743879,0.0013757548,0.000056138157,0.009761756,0.9725208,0.007908535,0.0022102718],"study_design_scores_gemma":[0.0034975803,0.001889103,0.0094101885,0.0003051151,0.0001372783,0.002177001,0.0011603911,0.04255714,0.0055119595,0.92433316,0.00855409,0.00046698842],"about_ca_topic_score_codex":0.000004195228,"about_ca_topic_score_gemma":9.357419e-7,"teacher_disagreement_score":0.3021464,"about_ca_system_score_codex":0.000010642493,"about_ca_system_score_gemma":0.000054316642,"threshold_uncertainty_score":0.26248783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74344856,0.00032104476,0.14623849,0.002070947,0.00050166796,0.000400539,0.000016495633,0.00027744495,0.106724806],"genre_scores_gemma":[0.9893231,0.0000104018845,0.010263705,0.00023351445,0.000024973551,0.0000015554283,0.0000020129235,0.000002751834,0.00013799829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931586,0.000034225228,0.00012941948,0.00018531669,0.00019338659,0.00014177123],"domain_scores_gemma":[0.9989685,0.000097206736,0.000051186715,0.0008200286,0.000031430824,0.000031678246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002829441,0.00006257401,0.00009790942,0.000038531165,0.000041074818,0.00005523454,0.0009113214,0.00003159227,0.00027864243],"category_scores_gemma":[0.000010053384,0.000040211406,0.00006686103,0.0003119394,0.000033634897,0.00032618653,0.0003376158,0.00009305807,0.00017583747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062981967,0.000076596414,0.003723272,0.000026292677,0.000026683401,0.0000011180496,0.0013281374,0.0000049114715,0.009097488,0.97647536,0.0027176936,0.006516127],"study_design_scores_gemma":[0.0028146745,0.000884733,0.1016076,0.00026092803,0.00005844822,0.00005962806,0.000561856,0.14934912,0.2161202,0.34621203,0.18032585,0.0017449512],"about_ca_topic_score_codex":0.000042647636,"about_ca_topic_score_gemma":0.000007725611,"teacher_disagreement_score":0.6302634,"about_ca_system_score_codex":0.000003940716,"about_ca_system_score_gemma":0.000017124792,"threshold_uncertainty_score":0.3050939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007217563,0.0000064201736,0.9746188,0.0005592649,0.00023422133,0.0003331505,0.00007774038,0.0002687945,0.016684042],"genre_scores_gemma":[0.5012334,0.0000037119273,0.49777228,0.00083360367,0.00002849586,0.000013780409,0.00003147037,0.000007234878,0.000076009776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987392,0.00001881291,0.00018516743,0.00046391843,0.00030729835,0.0002856189],"domain_scores_gemma":[0.9987222,0.00029857366,0.00006351234,0.0007111653,0.00008804175,0.00011652203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027063032,0.00013000681,0.00014624078,0.00007684164,0.00007286786,0.00068035093,0.00059119705,0.000081849015,0.00006998408],"category_scores_gemma":[0.00008753587,0.00011711075,0.00017316465,0.00021036789,0.000015765765,0.005390746,0.00024895472,0.00010957991,0.00019893341],"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.000033718774,0.00024996803,0.0003197504,0.000026599737,0.000019162831,0.0000024580102,0.000053465206,0.00022864206,0.000021539394,0.9889667,0.009240609,0.00083736103],"study_design_scores_gemma":[0.0004882595,0.00009329752,0.00010599486,0.000004758189,0.000005494476,0.0000042927913,0.000007186786,0.83735013,0.000095994634,0.15796335,0.003704585,0.00017667298],"about_ca_topic_score_codex":0.000007444996,"about_ca_topic_score_gemma":0.00001062013,"teacher_disagreement_score":0.8371215,"about_ca_system_score_codex":0.000027442919,"about_ca_system_score_gemma":0.00015701834,"threshold_uncertainty_score":0.656064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9462669,0.00070696254,0.0323743,0.0019234956,0.0027486633,0.0013259329,0.000074724696,0.00023415798,0.014344852],"genre_scores_gemma":[0.99162585,0.000021556858,0.007922166,0.00017439114,0.00004970656,0.000021643944,0.0000019358788,0.0000060513735,0.00017669832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985757,0.000005622492,0.0002147404,0.00036658364,0.0006025831,0.00023475658],"domain_scores_gemma":[0.99930865,0.000026955155,0.00016989568,0.00028356613,0.00015644316,0.000054480326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023205073,0.00014106485,0.00014683144,0.00006909713,0.0000985036,0.00014233073,0.0010779978,0.000049105372,0.000041857165],"category_scores_gemma":[0.00003647935,0.00009349541,0.0001701739,0.00036442876,0.000045545854,0.0012161209,0.00073642255,0.00016853584,0.000035891953],"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.000035043948,0.00039911212,0.04581522,0.0001313767,0.000067424895,4.1899366e-7,0.0010683502,0.000019186853,0.038305793,0.9073943,0.0055686072,0.0011951939],"study_design_scores_gemma":[0.0068962476,0.0006783251,0.24380673,0.00051928614,0.00013342647,0.00013761464,0.0018640017,0.012834312,0.45563507,0.23080285,0.04493492,0.0017572122],"about_ca_topic_score_codex":0.000027193893,"about_ca_topic_score_gemma":0.000005476553,"teacher_disagreement_score":0.67659146,"about_ca_system_score_codex":0.00004106265,"about_ca_system_score_gemma":0.000041869713,"threshold_uncertainty_score":0.3812632},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32425046,0.00019428301,0.6656477,0.002670807,0.001266001,0.00034978762,0.0001373411,0.00032230737,0.0051613315],"genre_scores_gemma":[0.99032426,0.0000931222,0.0032260078,0.006053196,0.00020715695,0.000008227767,0.00007893162,0.0000070259753,0.000002055102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981794,0.00028958058,0.0006547126,0.00015338811,0.0004527745,0.00027016844],"domain_scores_gemma":[0.99866825,0.00026466022,0.00035309524,0.00030613254,0.00016539276,0.00024247337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063893525,0.00018035312,0.00021519263,0.00032677007,0.00020944302,0.0004612117,0.0008611595,0.000092711525,0.00014738124],"category_scores_gemma":[0.00018565157,0.00015616171,0.00008323181,0.001184503,0.000030121018,0.0037019418,0.00006925673,0.000698178,0.00021754326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013109612,0.00053380587,0.012172787,0.00005369989,0.00020769492,0.00010720644,0.020133248,0.0027785068,0.000532922,0.83249915,0.08632907,0.04334097],"study_design_scores_gemma":[0.008342291,0.0018656397,0.039622318,0.00049278914,0.000044750046,0.00023404279,0.0024113336,0.19074824,0.012886073,0.5788125,0.16271907,0.0018209463],"about_ca_topic_score_codex":0.000017398439,"about_ca_topic_score_gemma":0.0000024656488,"teacher_disagreement_score":0.6660738,"about_ca_system_score_codex":0.00007642392,"about_ca_system_score_gemma":0.0001606012,"threshold_uncertainty_score":0.636809},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26531827,0.000030093375,0.72442824,0.000034414265,0.00040411743,0.000077294964,0.0000013683612,0.00008700997,0.009619213],"genre_scores_gemma":[0.8624335,0.0000014855126,0.13723744,0.00028874713,0.00001721162,5.080676e-7,0.000005020598,0.000001988451,0.0000140754955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946296,0.000019852178,0.0000859023,0.00015037465,0.00011871287,0.00016221988],"domain_scores_gemma":[0.9996161,0.000043028907,0.000030015433,0.00022847489,0.000028949671,0.00005345675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014821395,0.000053276348,0.00007067476,0.000049117018,0.000044393277,0.00010991237,0.00020030378,0.000026723761,0.000044027638],"category_scores_gemma":[0.000006201852,0.00004893357,0.000029731773,0.00022288114,0.000009051504,0.0009557958,0.000079797974,0.000047407088,0.00014806741],"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.000008288524,0.0001493761,0.024273735,0.000018927145,0.000019560468,0.0000033260499,0.00041121256,0.00108977,0.00602983,0.9587144,0.0028827125,0.0063988394],"study_design_scores_gemma":[0.0007139092,0.00007043978,0.01803774,0.000018658444,0.000004792991,0.000021780406,0.00005647845,0.9399224,0.003976029,0.013875422,0.022988712,0.00031361874],"about_ca_topic_score_codex":0.000109097055,"about_ca_topic_score_gemma":0.0000029249575,"teacher_disagreement_score":0.944839,"about_ca_system_score_codex":0.00001006754,"about_ca_system_score_gemma":0.000021184393,"threshold_uncertainty_score":0.19954531},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97269267,0.00042159096,0.007386136,0.00016653465,0.00015563308,0.000068946545,0.000008515464,0.00005236022,0.019047637],"genre_scores_gemma":[0.99686533,0.000014846929,0.0029335597,0.00005407863,0.00001080334,4.3857892e-7,7.4062666e-7,0.0000015043131,0.000118671334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9996578,0.0000126257855,0.00006487758,0.00012978021,0.000065281856,0.0000696089],"domain_scores_gemma":[0.9995955,0.000039852668,0.00003408383,0.0002861025,0.000017698414,0.000026709962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000067871944,0.000042655196,0.0000798584,0.000035978206,0.000014541756,0.00002522814,0.00023735603,0.000024297966,0.00034731033],"category_scores_gemma":[0.0000063807724,0.00003190172,0.000025531755,0.000119803066,0.000020361886,0.00016774336,0.00012069032,0.000027919508,0.000060897997],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017040931,0.00007616698,0.12904872,0.000056244477,0.000031619995,0.0000019344782,0.0005728835,0.000003829231,0.0028987029,0.85098314,0.0061873095,0.010122386],"study_design_scores_gemma":[0.0014961117,0.00049264677,0.77922267,0.00010231437,0.000020819658,0.000014059914,0.0005260765,0.0059269927,0.043745276,0.035212047,0.13246147,0.00077951717],"about_ca_topic_score_codex":0.0000752466,"about_ca_topic_score_gemma":0.000026246873,"teacher_disagreement_score":0.8157711,"about_ca_system_score_codex":0.0000014742675,"about_ca_system_score_gemma":0.000008723821,"threshold_uncertainty_score":0.38028044},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03547297,0.000023497729,0.861498,0.0003032471,0.00025708298,0.000043507243,0.0000012276882,0.00015510517,0.102245376],"genre_scores_gemma":[0.88522303,0.0000032178227,0.113874026,0.00075436715,0.00001480507,8.591998e-7,0.0000017254868,0.0000010774678,0.00012686673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997079,0.0000054965294,0.00003484874,0.00011428435,0.00006334064,0.00007414904],"domain_scores_gemma":[0.9995817,0.00001843973,0.0000067089527,0.00035957582,0.0000083773375,0.000025175428],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005155501,0.000025587718,0.000029827808,0.000023963881,0.000013658754,0.000046943165,0.0003502173,0.000011551862,0.0002976277],"category_scores_gemma":[0.000002232765,0.000020268266,0.000021925336,0.00014347803,0.000004701916,0.00027568385,0.000110315676,0.00002581164,0.0009376199],"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":[2.4810177e-7,0.000007729455,0.0026816726,0.0000010353232,9.70124e-7,3.2822328e-7,0.000036827652,3.3082586e-7,0.00011490082,0.98916507,0.0025391465,0.005451743],"study_design_scores_gemma":[0.00042180734,0.00009473454,0.04502262,0.0000053552067,0.0000012753744,0.000011724278,0.00003244468,0.009508165,0.0028031247,0.22846197,0.7133413,0.0002954801],"about_ca_topic_score_codex":0.000017562163,"about_ca_topic_score_gemma":0.000003993334,"teacher_disagreement_score":0.8497501,"about_ca_system_score_codex":0.0000014916341,"about_ca_system_score_gemma":0.0000060034704,"threshold_uncertainty_score":0.99984026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01952079,0.00014360524,0.97830755,0.0004029527,0.00075255,0.00030206513,0.000014091093,0.000037208687,0.0005191962],"genre_scores_gemma":[0.93947315,0.000020050265,0.05971826,0.00057253236,0.00013153932,0.0000064419364,0.0000021889941,0.000008422853,0.00006738802],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998938,0.00003321505,0.00034450763,0.0002458156,0.00023528839,0.0002031531],"domain_scores_gemma":[0.9986893,0.0001555671,0.00039173735,0.00036834457,0.00029325284,0.00010178038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004121578,0.00011721968,0.00020408459,0.00015787489,0.000066633394,0.00034578037,0.0020450116,0.00006655775,0.000038057373],"category_scores_gemma":[0.000018960152,0.00010328461,0.00020427982,0.0001815418,0.00004839971,0.0013216577,0.00019480495,0.00030207608,0.000021409196],"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.00040881263,0.0003647453,0.0015089642,0.00018560981,0.00045576165,0.000015259518,0.008332237,0.00014374206,0.003996489,0.43630704,0.034030594,0.51425076],"study_design_scores_gemma":[0.0037417135,0.0014651906,0.0012194914,0.00086698786,0.00008347862,0.0007529814,0.0007110915,0.32828158,0.06040665,0.45679307,0.14466074,0.0010170183],"about_ca_topic_score_codex":0.00010082634,"about_ca_topic_score_gemma":0.000010726154,"teacher_disagreement_score":0.9199524,"about_ca_system_score_codex":0.000030201641,"about_ca_system_score_gemma":0.00008007968,"threshold_uncertainty_score":0.42118242},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038146757,0.000035636815,0.9595893,0.00044405536,0.00026509922,0.0005124774,0.000006528844,0.0001343826,0.00086574093],"genre_scores_gemma":[0.9402124,0.00009571432,0.05859657,0.001023438,0.00002501703,0.000027325077,0.000004700005,0.000009724117,0.0000050807357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876004,0.00007835083,0.00021083013,0.0004257917,0.0002760168,0.00024895786],"domain_scores_gemma":[0.9988796,0.00009840567,0.00010033688,0.0007575213,0.00007417713,0.00008995598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002110545,0.00016151872,0.00020185925,0.00013708876,0.00016857214,0.00021244936,0.0008546744,0.000057181733,0.00003158964],"category_scores_gemma":[2.3599017e-7,0.00014395406,0.000041726584,0.0009012336,0.000020670985,0.00085071364,0.000020539928,0.00016346472,0.00000617421],"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.00037326833,0.00055271044,0.0008194309,0.00045585303,0.00028246033,0.0000071994345,0.00094889884,0.8734154,0.00003003536,0.042903487,0.00010490001,0.08010636],"study_design_scores_gemma":[0.0023843537,0.0007397295,0.023252271,0.0004150242,0.00013798247,0.0000052567125,0.0002708263,0.94220555,0.00026959128,0.028809866,0.0010110493,0.00049848267],"about_ca_topic_score_codex":0.00006771048,"about_ca_topic_score_gemma":0.000061528255,"teacher_disagreement_score":0.9020657,"about_ca_system_score_codex":0.000010864285,"about_ca_system_score_gemma":0.000012473336,"threshold_uncertainty_score":0.58702767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7632464,0.00023035235,0.23422068,0.00011332577,0.0012265133,0.00025393695,0.000010881593,0.00011421957,0.0005836565],"genre_scores_gemma":[0.9938864,0.00002653588,0.005533376,0.00040798553,0.000107508844,0.000009542487,0.0000032857647,0.000010335872,0.000014992009],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984789,0.00008454281,0.00020993901,0.0006095873,0.00027529738,0.000341753],"domain_scores_gemma":[0.99844646,0.00022155783,0.00011540478,0.0010294981,0.00006517689,0.00012190719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033071396,0.00018226667,0.00021188753,0.0001413497,0.0001525379,0.000616728,0.0019475669,0.00007667765,0.00004153746],"category_scores_gemma":[0.00006207738,0.00016439048,0.00007095019,0.0004637014,0.000059604823,0.001361877,0.0018809555,0.00022935671,0.000034529377],"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.00021684186,0.0011497648,0.8138572,0.00060342776,0.00027287324,0.00009672867,0.011434615,0.0026324498,0.018294953,0.11454877,0.008973848,0.027918536],"study_design_scores_gemma":[0.003281305,0.00016366687,0.7213414,0.00031684246,0.000035356385,0.000025929447,0.00015168665,0.2518121,0.006897785,0.0048789494,0.009826533,0.0012685113],"about_ca_topic_score_codex":0.00028891474,"about_ca_topic_score_gemma":0.000040366205,"teacher_disagreement_score":0.24917963,"about_ca_system_score_codex":0.000022771173,"about_ca_system_score_gemma":0.000034342924,"threshold_uncertainty_score":0.670365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10273101,0.0003045951,0.89305055,0.0013299886,0.0018211019,0.000120509205,0.0000019368733,0.00007928726,0.00056099857],"genre_scores_gemma":[0.70557827,0.000025182626,0.29196125,0.0014085008,0.0009900529,0.0000014069966,0.0000016263176,0.000010267548,0.000023448943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998807,0.00013104058,0.00021107742,0.00023573163,0.00030973103,0.00030539164],"domain_scores_gemma":[0.9989099,0.00012486236,0.00013593673,0.00063135714,0.00008392276,0.000114038594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070511445,0.00013868161,0.00014458179,0.00010896798,0.00028239866,0.0006230705,0.0018622999,0.000061003797,0.000054236167],"category_scores_gemma":[0.000007071414,0.000087030254,0.00014093409,0.00035848957,0.000030447343,0.0007091353,0.00062768854,0.00079747336,0.00016079083],"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.00015047878,0.00038767606,0.004252293,0.000042014202,0.00038731773,0.00021534032,0.00882574,0.0024126272,0.007101443,0.80130136,0.018094568,0.15682912],"study_design_scores_gemma":[0.00404327,0.00028100904,0.019835385,0.00014942439,0.000019129904,0.0017265199,0.000045555033,0.83919007,0.00065829547,0.0858232,0.04757096,0.00065716007],"about_ca_topic_score_codex":0.000004339794,"about_ca_topic_score_gemma":9.1306504e-7,"teacher_disagreement_score":0.83677745,"about_ca_system_score_codex":0.000016438862,"about_ca_system_score_gemma":0.00004345897,"threshold_uncertainty_score":0.60082835},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98321027,0.00062381197,0.012184782,0.0010542388,0.0002871353,0.00037675461,0.000008436028,0.000010332012,0.0022442683],"genre_scores_gemma":[0.89006567,0.000083336214,0.109603174,0.000039044302,0.000086928565,0.0000025350698,5.1901185e-7,0.000010024036,0.00010874682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723035,0.0002496265,0.0004870054,0.00013516255,0.0016040339,0.0002938231],"domain_scores_gemma":[0.9975279,0.00035149412,0.00036434972,0.0008270748,0.00083781086,0.00009139658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042772423,0.00009052769,0.00027821478,0.00023566664,0.00009539119,0.00012366204,0.0023071747,0.00009631887,0.00019979903],"category_scores_gemma":[0.0003587895,0.000053067488,0.00021870006,0.0009368044,0.00011125836,0.0004347862,0.00065191474,0.00093762693,0.000020566797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044953435,0.0010296339,0.00203917,0.0007692719,0.00012261297,0.000017526194,0.0050440785,0.000036279213,0.05556807,0.91841334,0.016398843,0.0005162406],"study_design_scores_gemma":[0.0024228997,0.0007514378,0.0014200124,0.00061750493,0.000021426033,0.00029301507,0.0010713069,0.039008945,0.09545901,0.8393355,0.01926458,0.00033434323],"about_ca_topic_score_codex":0.000007412999,"about_ca_topic_score_gemma":0.0000033661804,"teacher_disagreement_score":0.09741839,"about_ca_system_score_codex":0.000029941037,"about_ca_system_score_gemma":0.0002636536,"threshold_uncertainty_score":0.4287343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030642588,0.000079295874,0.96619946,0.00041544074,0.00020162611,0.0009139862,0.00003579062,0.00003970716,0.0014720956],"genre_scores_gemma":[0.9973816,0.000008240934,0.0021075793,0.00042913883,0.000011013985,0.000032046053,0.000025172028,0.0000022142515,0.0000029600562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986279,0.000052693482,0.0002849347,0.0004034808,0.00047089966,0.00016010739],"domain_scores_gemma":[0.9983295,0.00006338131,0.000066930465,0.0014177815,0.000028019,0.000094352356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047874905,0.00006781789,0.00014180124,0.00020978026,0.000012497343,0.000059548398,0.0025699362,0.000038022812,0.000024137775],"category_scores_gemma":[0.00001312808,0.00005759375,0.000016136213,0.0008385116,0.000009862753,0.00023003352,0.0012967958,0.00005475614,0.000040758292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033900917,0.00054063,0.053065512,0.00021504331,0.00003999563,0.000013804043,0.00025178678,0.0008598111,0.000042850308,0.79783773,0.004113255,0.14298566],"study_design_scores_gemma":[0.001165325,0.000059076097,0.009604232,0.00005319994,0.0000054681277,0.0000028412273,0.000088599125,0.9721007,0.000033503842,0.00061630475,0.016113706,0.00015709353],"about_ca_topic_score_codex":0.00040102997,"about_ca_topic_score_gemma":0.000055447428,"teacher_disagreement_score":0.9712408,"about_ca_system_score_codex":0.00001264175,"about_ca_system_score_gemma":0.000016738673,"threshold_uncertainty_score":0.47756237},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027523385,0.00084851356,0.9922955,0.0013989192,0.0020391287,0.00047050818,0.00003448992,0.00022761436,0.002410062],"genre_scores_gemma":[0.30789274,0.00022095353,0.68373835,0.006989561,0.0010075306,0.000019772031,0.0000610903,0.00006577029,0.0000042617853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994362,0.00006821702,0.00080640404,0.0025090775,0.001278444,0.0009758813],"domain_scores_gemma":[0.9967492,0.00055497617,0.0003367367,0.0018042001,0.00021858688,0.00033627063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009899067,0.0007585678,0.00078632304,0.002202378,0.00026917108,0.00086939574,0.0053494764,0.00044405187,0.000042044416],"category_scores_gemma":[0.00011052252,0.00074617006,0.00033099626,0.0025843207,0.0008343838,0.0012042108,0.0025173598,0.0016424585,0.000043773685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020675216,0.000081026184,0.0006727543,0.000097118595,0.000020147269,0.0005049741,0.0019588617,0.0022886351,0.0002369262,0.54604834,0.00007716833,0.44799334],"study_design_scores_gemma":[0.00050839136,0.00044203125,0.0017881964,0.00068798836,0.000010633204,0.00007057405,6.499267e-7,0.2647743,0.0003404267,0.7250178,0.004931111,0.0014279193],"about_ca_topic_score_codex":0.00008463196,"about_ca_topic_score_gemma":0.0002886524,"teacher_disagreement_score":0.44656542,"about_ca_system_score_codex":0.00014695482,"about_ca_system_score_gemma":0.00050278567,"threshold_uncertainty_score":0.9994989},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46507642,0.00026302156,0.53240526,0.00087365723,0.00017220763,0.00031668192,0.000024253439,0.00006141826,0.00080706977],"genre_scores_gemma":[0.97823244,0.00004189444,0.021285333,0.0002897239,0.00009127521,0.000009556178,0.00003272822,0.0000045173074,0.000012557813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989198,0.000029190473,0.00015992658,0.0005779086,0.00012492137,0.00018825117],"domain_scores_gemma":[0.99801886,0.000075900054,0.000039377363,0.0017747931,0.00001619338,0.000074895535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039708868,0.0000846314,0.000105548155,0.000082084734,0.000044863336,0.0001273324,0.0022995647,0.00003326575,0.000011673179],"category_scores_gemma":[0.000046825902,0.00008227492,0.000011007479,0.00036986006,0.000007281095,0.001125598,0.00402291,0.000097827935,0.00006114698],"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.000032848828,0.00013705264,0.1500025,0.00018439737,0.000014006258,0.0000033621454,0.0019026848,0.00012637262,0.031227615,0.7824063,0.006376504,0.027586391],"study_design_scores_gemma":[0.00092303875,0.00008847088,0.34113625,0.00015490018,0.0000075039716,0.000010921017,0.0002085794,0.43264738,0.0011398059,0.0142134335,0.20851384,0.0009558967],"about_ca_topic_score_codex":0.00011574534,"about_ca_topic_score_gemma":0.000276302,"teacher_disagreement_score":0.7681928,"about_ca_system_score_codex":0.000016540225,"about_ca_system_score_gemma":0.000018902503,"threshold_uncertainty_score":0.50142694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06281376,0.00003061028,0.9329304,0.0019951437,0.00080338476,0.00037081554,0.0002978628,0.0005768334,0.00018117345],"genre_scores_gemma":[0.9825802,0.000010425149,0.014293264,0.0026783396,0.00038677483,0.000004419921,0.000022164366,0.000023153236,0.000001292618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968777,0.00025231624,0.00040333127,0.0011922325,0.0006869324,0.0005874975],"domain_scores_gemma":[0.99717313,0.0005048231,0.000119665085,0.0017068908,0.00012758412,0.00036793354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052871526,0.0003276373,0.0003733011,0.00013730154,0.0006652643,0.0006418169,0.003716215,0.00012193049,0.00006256616],"category_scores_gemma":[0.000014766236,0.00030335257,0.000120009434,0.0015190656,0.00013368196,0.0010745412,0.00008290261,0.0008968529,0.000034805184],"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.0037270766,0.005802453,0.0061834315,0.0010862291,0.0030151336,0.0010673573,0.01964058,0.47851413,0.0068313205,0.062359754,0.022892142,0.3888804],"study_design_scores_gemma":[0.002375593,0.00033854647,0.0010552466,0.00006867604,0.00006376933,0.000024945888,0.00006644255,0.98927,0.0038190773,0.00031086526,0.00205249,0.00055434863],"about_ca_topic_score_codex":0.00016446802,"about_ca_topic_score_gemma":0.00007289504,"teacher_disagreement_score":0.9197664,"about_ca_system_score_codex":0.000036164085,"about_ca_system_score_gemma":0.00016231883,"threshold_uncertainty_score":0.9999419},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001986,0.00066050375,0.9913954,0.0052141766,0.0011841852,0.0003783788,0.00005569444,0.00026610942,0.00064691185],"genre_scores_gemma":[0.33323517,0.000110468834,0.6502781,0.015138898,0.0010683357,0.000031131112,0.00004092375,0.00006254132,0.000034423396],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950961,0.000033330783,0.0005491525,0.002285022,0.0013301414,0.0007062628],"domain_scores_gemma":[0.9970283,0.00021084164,0.00026791447,0.001886022,0.00024605682,0.0003608964],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042985324,0.0006930517,0.00058645,0.00080249924,0.00025695446,0.0011079953,0.004581252,0.0004726791,0.00010233714],"category_scores_gemma":[0.000044982626,0.0006468607,0.00027543062,0.0012123283,0.00079873746,0.0014979208,0.0023152295,0.0011799957,0.00013076702],"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.00007734146,0.000115924864,0.0010880246,0.0002878738,0.000061673265,0.00087484077,0.0077712373,0.0014405448,0.0001816371,0.15218955,0.0012397539,0.8346716],"study_design_scores_gemma":[0.00086003926,0.00052774575,0.002244168,0.0009843931,0.00004540785,0.00019426046,8.5301366e-7,0.23440424,0.002647396,0.71092033,0.044159357,0.003011824],"about_ca_topic_score_codex":0.000026949054,"about_ca_topic_score_gemma":0.00012730157,"teacher_disagreement_score":0.8316598,"about_ca_system_score_codex":0.0001428746,"about_ca_system_score_gemma":0.00039920933,"threshold_uncertainty_score":0.99992895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028136669,0.012139002,0.9562965,0.00063384406,0.0008622861,0.0006304889,0.00039317177,0.00057011656,0.00033793907],"genre_scores_gemma":[0.7433694,0.0010195803,0.2522094,0.0020160927,0.00015138727,0.00016962571,0.0010098566,0.00005285289,0.0000018176216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955095,0.00038924956,0.0005867396,0.0019574738,0.00071388157,0.0008431544],"domain_scores_gemma":[0.9963943,0.00029381778,0.00032630895,0.0021206744,0.00040892,0.00045598048],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006790876,0.00083165267,0.00087695394,0.00089223194,0.0005033207,0.002257915,0.0019203634,0.00086015364,0.00007329553],"category_scores_gemma":[0.000046263896,0.00080440793,0.0008660302,0.001644966,0.00036196428,0.0005873763,0.0015972995,0.0014634415,0.0000051932825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002449951,0.002102989,0.0054587503,0.0016886805,0.00096802565,0.0007693623,0.0022644035,0.00037620403,0.013130838,0.92767096,0.010865241,0.03445956],"study_design_scores_gemma":[0.0082631735,0.003333545,0.04061707,0.0048473724,0.0012975482,0.00028302948,0.0018425472,0.25974113,0.0133251995,0.5960629,0.05730881,0.013077687],"about_ca_topic_score_codex":0.0002626884,"about_ca_topic_score_gemma":0.00011889399,"teacher_disagreement_score":0.71523273,"about_ca_system_score_codex":0.000022006036,"about_ca_system_score_gemma":0.00027119165,"threshold_uncertainty_score":0.99944067},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.432901,0.00038083747,0.5515755,0.011665338,0.0020409073,0.00025422056,0.000043229582,0.00045026434,0.00068874384],"genre_scores_gemma":[0.94980043,0.00006742638,0.049890053,0.00018174993,0.00004157354,0.000003093034,0.000009041393,0.000005162937,0.0000014970803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981661,0.00004647811,0.0005383292,0.00024292346,0.0008008038,0.00020536194],"domain_scores_gemma":[0.9982025,0.00016917962,0.0005396633,0.00038222296,0.0006628554,0.000043563985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005349256,0.00015336389,0.00022048848,0.0005343023,0.000050247832,0.00025177049,0.0027744607,0.00011246153,0.00004061989],"category_scores_gemma":[0.00022190012,0.00013638598,0.00017324097,0.00030194884,0.00012157874,0.0009847515,0.0006697516,0.00039043638,0.000021816182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030143058,0.0014383525,0.09851572,0.00012533706,0.00065333286,0.00038024274,0.0019599022,0.0011852519,0.0032743595,0.78139716,0.015017,0.09575192],"study_design_scores_gemma":[0.0059579522,0.001986746,0.011454114,0.000737788,0.000045269535,0.00057138747,0.0019575066,0.11075702,0.040357243,0.71494347,0.11020244,0.0010290786],"about_ca_topic_score_codex":0.000013001751,"about_ca_topic_score_gemma":0.0000064109586,"teacher_disagreement_score":0.5168994,"about_ca_system_score_codex":0.00008640987,"about_ca_system_score_gemma":0.00014111793,"threshold_uncertainty_score":0.5561659},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8992649,0.00074101915,0.08765648,0.007494526,0.003185362,0.00016604939,0.000020862954,0.0007177682,0.0007530817],"genre_scores_gemma":[0.98559314,0.00040473914,0.013767143,0.00013348642,0.0000830198,0.0000028433517,0.0000025169325,0.000008018604,0.000005082447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982638,0.00003740364,0.00047481895,0.0002469888,0.00076862203,0.00020840121],"domain_scores_gemma":[0.9982877,0.00008379647,0.000474845,0.00047499218,0.0006327772,0.000045933073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049316225,0.00015969951,0.00024677516,0.0006510888,0.00005149505,0.0002405826,0.002910341,0.00015672197,0.000038794406],"category_scores_gemma":[0.00018821163,0.00013774876,0.00019407333,0.00036443892,0.00012760816,0.0015580037,0.0006251889,0.00050547946,0.00010494904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024271567,0.0005837543,0.13167854,0.000037999776,0.0003854402,0.00028454914,0.0013945346,0.000041061194,0.009590026,0.8054004,0.0042361245,0.0461249],"study_design_scores_gemma":[0.0030726397,0.0012937163,0.022725381,0.0004072713,0.000040431936,0.0021145467,0.0014777484,0.0048433472,0.029680582,0.8175054,0.11599313,0.0008457662],"about_ca_topic_score_codex":0.000013640855,"about_ca_topic_score_gemma":0.000012763138,"teacher_disagreement_score":0.111757,"about_ca_system_score_codex":0.000071687646,"about_ca_system_score_gemma":0.000083844105,"threshold_uncertainty_score":0.5617232},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25025547,0.00004239342,0.7477751,0.0006947397,0.00058384135,0.00015894994,0.00007802467,0.0003053993,0.00010607811],"genre_scores_gemma":[0.9861861,0.000010606837,0.012612018,0.0010065247,0.00016117092,0.0000028294985,0.000007805909,0.000011394503,0.0000015685866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802107,0.00019327232,0.00030594904,0.0006955677,0.00043911985,0.00034502742],"domain_scores_gemma":[0.99891853,0.00021418586,0.00007164794,0.00046502406,0.00007143027,0.00025918896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004417113,0.00021468491,0.00022796118,0.00010656526,0.00050014094,0.00019863881,0.00040988246,0.000065295375,0.000030493518],"category_scores_gemma":[0.000012304044,0.00021417791,0.00011826183,0.00072469236,0.000093519775,0.00019482002,0.0000305322,0.0004832929,0.000020450725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060037995,0.0017383539,0.00066335546,0.0007307754,0.0004349896,0.000083660234,0.041593187,0.35942274,0.008342837,0.15317371,0.0016790179,0.43153697],"study_design_scores_gemma":[0.00093190715,0.00021659516,0.0008672535,0.000053192365,0.000026659744,0.000017577486,0.00030751177,0.9856078,0.009635838,0.00013221703,0.0018288023,0.00037461426],"about_ca_topic_score_codex":0.00017174591,"about_ca_topic_score_gemma":0.00001380864,"teacher_disagreement_score":0.7359306,"about_ca_system_score_codex":0.000031469346,"about_ca_system_score_gemma":0.000056767054,"threshold_uncertainty_score":0.87339216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40802398,0.00033419704,0.5822644,0.008315655,0.00065914606,0.0000778967,0.000013038293,0.00028113177,0.00003053156],"genre_scores_gemma":[0.7554926,0.000033175613,0.24344864,0.00063880894,0.00037620126,6.146275e-7,0.000001876273,0.000007959226,5.977866e-8],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978418,0.00005245374,0.0006138676,0.0003751977,0.00083055365,0.00028613524],"domain_scores_gemma":[0.9982573,0.00012842655,0.0005120176,0.00035269096,0.0005917488,0.00015781977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004673835,0.00020291124,0.00028981466,0.00047180825,0.0001629031,0.0006395621,0.003981023,0.00018171812,0.0000124892695],"category_scores_gemma":[0.00077598164,0.0001908253,0.00013702555,0.0008137006,0.00014649534,0.0015827988,0.0011724883,0.00079072325,0.0000053887907],"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.00067892135,0.0010479026,0.020391144,0.00011859215,0.00045820684,0.0010489866,0.04002214,0.0018719434,0.015105818,0.40704173,0.0013214037,0.5108932],"study_design_scores_gemma":[0.0031749168,0.00276296,0.003420824,0.0017320882,0.00009830054,0.0017634808,0.008517768,0.24319668,0.097823136,0.5626498,0.07286791,0.0019921695],"about_ca_topic_score_codex":0.000013879143,"about_ca_topic_score_gemma":0.000004177175,"teacher_disagreement_score":0.50890106,"about_ca_system_score_codex":0.00007437864,"about_ca_system_score_gemma":0.00014450212,"threshold_uncertainty_score":0.778163},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33416414,0.000119263146,0.65816575,0.0021962204,0.00048421157,0.0002462716,0.000011845306,0.00041050275,0.0042017684],"genre_scores_gemma":[0.97710633,0.000010610787,0.022296887,0.00045679475,0.00006914023,0.000017093778,0.00003144201,0.0000035721741,0.000008124692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988524,0.00012629971,0.00016398037,0.00035916662,0.0002527852,0.0002454153],"domain_scores_gemma":[0.99868643,0.00017455217,0.000055778313,0.0009518044,0.000049503535,0.00008191982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026283355,0.000109251996,0.000120386896,0.000039168135,0.00012385695,0.0004586857,0.0011665584,0.00006697091,0.00010714663],"category_scores_gemma":[0.000014852974,0.000066918874,0.00010039469,0.0003617044,0.000036001762,0.0006693139,0.00031740466,0.0001251806,0.0005374025],"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.0000049098776,0.00004463335,0.0152722355,0.000007052299,0.00002644014,0.000002604532,0.00057306426,0.0000025998143,0.00053646986,0.9744545,0.0015673876,0.007508094],"study_design_scores_gemma":[0.0025277543,0.0003136422,0.64358115,0.000102206,0.000035766094,0.00005257247,0.0030281846,0.1729415,0.0009413325,0.06257361,0.11270354,0.0011987132],"about_ca_topic_score_codex":0.00032001655,"about_ca_topic_score_gemma":0.00024865216,"teacher_disagreement_score":0.9118809,"about_ca_system_score_codex":0.000017540493,"about_ca_system_score_gemma":0.000031219526,"threshold_uncertainty_score":0.69074017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11216431,0.00042990156,0.87977296,0.006469716,0.00010949693,0.0003688752,0.00008010866,0.00059375603,0.000010873254],"genre_scores_gemma":[0.924425,0.00017189242,0.07427192,0.0009665523,0.000023400919,0.00011399496,0.000007418917,0.000018522778,0.0000013233653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857205,0.000019030602,0.00020238203,0.00068229024,0.0001491075,0.00037515574],"domain_scores_gemma":[0.9989743,0.000053604428,0.00006091449,0.0007360959,0.00005658195,0.00011849395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091276415,0.00020323554,0.00023545118,0.0002634766,0.00030769577,0.0001448981,0.0014295888,0.00023551981,0.0000100891375],"category_scores_gemma":[0.000009072566,0.00019905428,0.00010389346,0.00086940033,0.00007937218,0.0003546902,0.000049139402,0.0004041164,0.000005895883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010749361,0.0016264569,0.004061463,0.004219963,0.0019404085,0.00032638057,0.016477004,0.04043343,0.17983153,0.22551805,0.0014671574,0.52302325],"study_design_scores_gemma":[0.005159127,0.001041456,0.00024676614,0.00030649564,0.00026475824,0.00028748633,0.0007469527,0.5054404,0.21736145,0.1042908,0.1631919,0.0016624059],"about_ca_topic_score_codex":0.000037485086,"about_ca_topic_score_gemma":0.000093128445,"teacher_disagreement_score":0.8122607,"about_ca_system_score_codex":0.000016451206,"about_ca_system_score_gemma":0.000021189615,"threshold_uncertainty_score":0.81171983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87630403,0.0018999901,0.052926395,0.037392586,0.001502849,0.0025127556,0.00030603286,0.0009421207,0.026213221],"genre_scores_gemma":[0.98523706,0.000020952997,0.013631336,0.0010056688,0.00007690041,0.000016642929,0.0000015225152,0.0000061169285,0.0000037695481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987121,0.000005685035,0.00022907105,0.00036294252,0.0004515557,0.00023864432],"domain_scores_gemma":[0.99932647,0.000023267046,0.00015758397,0.00025835377,0.000095517265,0.00013881734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015926598,0.00013206522,0.00014922538,0.00005084594,0.00011889574,0.000094481446,0.0016184011,0.00002575462,0.000013089121],"category_scores_gemma":[0.00009399932,0.00009102941,0.0001259619,0.00071475154,0.000067986985,0.0001794327,0.0013247725,0.00014446386,0.0000170787],"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.000039832896,0.00049525127,0.0022440092,0.00026117655,0.00006296401,0.0000029111795,0.007021662,0.00010565055,0.088558435,0.87391037,0.022689942,0.0046077757],"study_design_scores_gemma":[0.003615983,0.0008608748,0.0075136167,0.0003936267,0.00014810938,0.00006566576,0.0016246196,0.12884152,0.757386,0.020047856,0.07814152,0.0013605917],"about_ca_topic_score_codex":0.000023482695,"about_ca_topic_score_gemma":8.417359e-7,"teacher_disagreement_score":0.8538625,"about_ca_system_score_codex":0.000018319797,"about_ca_system_score_gemma":0.000025217676,"threshold_uncertainty_score":0.37120715},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29717955,0.000050487535,0.7004459,0.00039659903,0.00014976348,0.00021655345,0.00005409461,0.00016441474,0.0013426292],"genre_scores_gemma":[0.70682544,8.189928e-7,0.29294926,0.00012097503,0.000028389612,0.000007650662,0.00006241352,0.000004511587,5.8290016e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827886,0.00005518282,0.00042719813,0.00046348767,0.0005250819,0.000250168],"domain_scores_gemma":[0.9986708,0.0001200063,0.00018546655,0.00062071846,0.00027939913,0.0001235679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036550034,0.0001742021,0.00026599847,0.00013432925,0.00021274699,0.00009784849,0.0009883967,0.00005811503,0.000026720114],"category_scores_gemma":[0.000044178847,0.00017528195,0.00015390459,0.00070291816,0.00040115323,0.0005834254,0.00038262378,0.0001616496,0.000034014185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009710867,0.00038899577,0.004531005,0.0000552047,0.000021687236,0.0000034441491,0.00048089077,0.005660404,0.000040306684,0.98712033,0.00021135046,0.0014766463],"study_design_scores_gemma":[0.00048485937,0.000070107926,0.26507682,0.000018070768,0.0000025406725,0.00001180262,0.00000684521,0.034948338,0.00031266414,0.69874394,0.00018550176,0.00013849745],"about_ca_topic_score_codex":0.00013854825,"about_ca_topic_score_gemma":0.000080219834,"teacher_disagreement_score":0.40964586,"about_ca_system_score_codex":0.00006857554,"about_ca_system_score_gemma":0.00026514693,"threshold_uncertainty_score":0.7147791},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028049616,0.0009239771,0.88750273,0.08035889,0.00022386623,0.00058322557,0.000019552615,0.00006459968,0.0022735184],"genre_scores_gemma":[0.97895235,0.0002281348,0.019410612,0.0012884063,0.00007312653,0.000016714079,0.000025748883,0.0000031283844,0.0000017907507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998935,0.00019213387,0.0002610933,0.00031593165,0.00020235882,0.00009348465],"domain_scores_gemma":[0.9988565,0.00019393799,0.00014842677,0.00072401995,0.00005233239,0.000024779758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091811473,0.000105900384,0.00013151226,0.000069544185,0.000087246,0.00021787113,0.0010782258,0.00014666043,0.0000046198984],"category_scores_gemma":[0.00009827211,0.00006137901,0.000050554383,0.00037606465,0.00007814506,0.0001428929,0.00063397526,0.0005849221,9.4285275e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074993086,0.000064271444,0.0018729455,0.00020232215,0.000019338024,0.00000252216,0.023549296,0.00007721327,0.0001818501,0.9102229,0.003617433,0.060182426],"study_design_scores_gemma":[0.00033942057,0.00004436993,0.03802422,0.00019856569,0.000025854288,0.000010606707,0.0012158495,0.3913954,0.00048282178,0.5574622,0.010474384,0.00032628945],"about_ca_topic_score_codex":0.00016250921,"about_ca_topic_score_gemma":0.000118038806,"teacher_disagreement_score":0.9509027,"about_ca_system_score_codex":0.0000071720906,"about_ca_system_score_gemma":0.00010123919,"threshold_uncertainty_score":0.2541228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27715293,0.00016028537,0.7198349,0.0016377849,0.0008383145,0.00016495577,0.000011516203,0.000030947373,0.00016836464],"genre_scores_gemma":[0.97709775,0.000022282657,0.021927183,0.0007284104,0.00020145571,0.0000028820289,0.000003797938,0.0000091276415,0.0000071019213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984156,0.00006998292,0.000634206,0.0003068143,0.00036853252,0.00020488321],"domain_scores_gemma":[0.998526,0.00015362044,0.0007121128,0.00020477576,0.00021923268,0.00018425292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007232696,0.00015832513,0.00030377146,0.0001433565,0.000044104036,0.00019970267,0.0010910999,0.0001361123,0.000013482376],"category_scores_gemma":[0.00019915344,0.00013815553,0.00018647203,0.0002315997,0.000116942356,0.0007890596,0.00021151554,0.00051851606,0.000001682792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025723458,0.0011667865,0.005716903,0.00085148984,0.0008862657,0.00005320743,0.22841372,0.00021513451,0.12087673,0.31779626,0.18877035,0.13268083],"study_design_scores_gemma":[0.005303957,0.0026621919,0.0005416446,0.000913346,0.00014124379,0.00037258028,0.0009275386,0.77974117,0.16780886,0.014091048,0.026781404,0.0007150171],"about_ca_topic_score_codex":0.00004427676,"about_ca_topic_score_gemma":7.6573355e-7,"teacher_disagreement_score":0.77952605,"about_ca_system_score_codex":0.000021643027,"about_ca_system_score_gemma":0.000061121296,"threshold_uncertainty_score":0.5633819},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029131938,0.00055627077,0.96134454,0.0039608465,0.00069775805,0.00038037956,0.000062205894,0.0011546373,0.0027114062],"genre_scores_gemma":[0.9064985,0.0005817001,0.091458306,0.0010660826,0.00018603375,0.0000353264,0.00014385466,0.000018546154,0.000011630184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982205,0.0000854749,0.00027123324,0.0009233839,0.00026450036,0.00023492404],"domain_scores_gemma":[0.9986795,0.00004997581,0.00012224085,0.0008547793,0.00009601077,0.0001974944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020672205,0.00026915604,0.00028966396,0.0001456262,0.000113467235,0.0007685332,0.0011311192,0.00025490695,0.00009632789],"category_scores_gemma":[0.00003088708,0.0002529452,0.00009917652,0.0004028869,0.00006937342,0.00040715782,0.0029867669,0.0006207732,0.00008229317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003381531,0.00017150893,0.0010703767,0.00037396626,0.00013259254,0.00011763134,0.0018681906,0.00003176597,0.0025760843,0.92932796,0.02301737,0.04127871],"study_design_scores_gemma":[0.0013055915,0.00033699058,0.03524398,0.00021999351,0.0000879927,0.00009757091,0.00010095981,0.13534686,0.003310536,0.7816774,0.040023006,0.0022491205],"about_ca_topic_score_codex":0.00015047289,"about_ca_topic_score_gemma":0.000036827794,"teacher_disagreement_score":0.8773666,"about_ca_system_score_codex":0.000015197282,"about_ca_system_score_gemma":0.00010974754,"threshold_uncertainty_score":0.99999225},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27020672,0.00002206924,0.7273841,0.001512591,0.00020462288,0.0002114094,0.000011414087,0.00032965417,0.000117425756],"genre_scores_gemma":[0.95556414,0.000020874839,0.042597584,0.0016045829,0.00017790904,0.00000533461,0.0000061063215,0.000022130616,0.0000013290543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973414,0.00023021035,0.0003221514,0.0007868922,0.000764076,0.0005552631],"domain_scores_gemma":[0.9984043,0.0004320147,0.00011135862,0.0005991713,0.00012501815,0.0003280863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004246954,0.00026222243,0.0002594335,0.00030240414,0.0005766058,0.0005057887,0.0008985041,0.000097148884,0.000042845917],"category_scores_gemma":[0.000004375285,0.00024109078,0.00011865003,0.0023963894,0.00004872778,0.0012548872,0.00004323718,0.00083541987,0.00009924698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078245864,0.0031022227,0.01563923,0.0030502325,0.0008510875,0.00051514053,0.056729924,0.13012928,0.007304709,0.020289509,0.00027155547,0.76133466],"study_design_scores_gemma":[0.0010149193,0.0006488778,0.004572054,0.00019053195,0.000039707695,0.000057906498,0.00044522504,0.9884185,0.0032339017,0.00009353925,0.0007887185,0.0004961277],"about_ca_topic_score_codex":0.0002500697,"about_ca_topic_score_gemma":0.000041900577,"teacher_disagreement_score":0.8582892,"about_ca_system_score_codex":0.0000479851,"about_ca_system_score_gemma":0.00008536835,"threshold_uncertainty_score":0.98313963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007458524,0.00025254968,0.9919775,0.0026968655,0.0015319558,0.00037573316,0.00010638797,0.00033945782,0.0026449605],"genre_scores_gemma":[0.25012392,0.00011446401,0.7372415,0.010702195,0.0014512996,0.0000090011945,0.00024799415,0.00008908859,0.000020518562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940261,0.000064099804,0.00060877827,0.0030751952,0.0014793868,0.00074643915],"domain_scores_gemma":[0.99228156,0.00068745314,0.00033370967,0.0062640673,0.00011789769,0.0003153442],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00096764945,0.0006795879,0.0006135291,0.0007457814,0.00037043836,0.0012290691,0.019130802,0.00030858055,0.000048880655],"category_scores_gemma":[0.00021925772,0.0006348005,0.0001346244,0.0009115448,0.00040199776,0.0016583097,0.016473694,0.0015738991,0.00011362053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001223594,0.00006378488,0.00009800723,0.00011739126,0.000030767733,0.00038213242,0.0018876898,0.0031421683,0.00013273879,0.06352705,0.00046519144,0.93014085],"study_design_scores_gemma":[0.0003185458,0.00019084621,0.0002100444,0.0007233049,0.000011716248,0.000043993692,3.163003e-7,0.54450345,0.0003185976,0.4451931,0.0074442676,0.0010417955],"about_ca_topic_score_codex":0.000076832606,"about_ca_topic_score_gemma":0.00010865415,"teacher_disagreement_score":0.929099,"about_ca_system_score_codex":0.000119173426,"about_ca_system_score_gemma":0.0003683073,"threshold_uncertainty_score":0.9998078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6415536,0.0066852164,0.07799696,0.02753834,0.011462723,0.012518363,0.0039933682,0.003156765,0.21509466],"genre_scores_gemma":[0.9900951,0.00028400702,0.0066122455,0.0012572946,0.00079779595,0.00013137984,0.0005463533,0.0000386265,0.00023723353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9933582,0.00045919596,0.00110555,0.0018099266,0.0019630203,0.0013041134],"domain_scores_gemma":[0.9968825,0.00026157396,0.00063119235,0.0010921531,0.00043384294,0.0006987296],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016341389,0.00087883585,0.00079103454,0.0008448534,0.0014686955,0.0012373043,0.0036842406,0.00020134755,0.0026873543],"category_scores_gemma":[0.00023855653,0.0007941172,0.00026593605,0.0019347522,0.00057157374,0.0026776353,0.0011665638,0.00062393816,0.00035740552],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102561775,0.003410674,0.112466455,0.00010601524,0.00024716675,0.000033359276,0.005093214,0.000078017576,0.0016334956,0.84845036,0.02290702,0.005471657],"study_design_scores_gemma":[0.0018807134,0.0009246159,0.8156149,0.00028133873,0.000050819297,0.00007768117,0.0007426135,0.0758924,0.000048789097,0.0033891548,0.09968653,0.0014104404],"about_ca_topic_score_codex":0.00013293118,"about_ca_topic_score_gemma":0.0001403831,"teacher_disagreement_score":0.8450612,"about_ca_system_score_codex":0.00014129034,"about_ca_system_score_gemma":0.00021470452,"threshold_uncertainty_score":0.99983126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044596087,0.00019428239,0.9399059,0.00088937214,0.002611051,0.0027347414,0.006161914,0.00053618394,0.0023705119],"genre_scores_gemma":[0.86375433,0.00014072112,0.13061447,0.0012598124,0.00034413577,0.0003545152,0.0034368492,0.00008147888,0.000013708711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952937,0.00007329324,0.00211679,0.0007093874,0.0009326423,0.0008742078],"domain_scores_gemma":[0.99496394,0.00020344133,0.0014190316,0.0024773576,0.0005577845,0.00037844767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070912694,0.00077800907,0.0011930744,0.00045673724,0.00022984357,0.0006377449,0.004474314,0.0006460601,0.00003001425],"category_scores_gemma":[0.0001660947,0.0007302937,0.0008419467,0.0006343258,0.00022765737,0.0015888049,0.0051194136,0.0013064614,0.000065994405],"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.00048358412,0.0018498388,0.0058932574,0.020897917,0.0015202101,0.000035997793,0.05757065,0.0005507689,0.00019787636,0.8279033,0.044723168,0.038373463],"study_design_scores_gemma":[0.008531822,0.0013553563,0.004914807,0.0022332142,0.0004086888,0.00011603947,0.0021784399,0.42936698,0.0065001342,0.23878002,0.30061698,0.0049975156],"about_ca_topic_score_codex":0.00004590594,"about_ca_topic_score_gemma":0.000018938605,"teacher_disagreement_score":0.8191582,"about_ca_system_score_codex":0.00007618155,"about_ca_system_score_gemma":0.00033119286,"threshold_uncertainty_score":0.9995148},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42691958,0.0024480165,0.56693083,0.00060871453,0.00031892766,0.001007971,0.0005310863,0.00026781458,0.0009670467],"genre_scores_gemma":[0.5677475,0.0026206314,0.4278783,0.0002272445,0.00020824817,0.0000029876282,0.00091624947,0.000057946978,0.00034094296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728674,0.00010921699,0.0003166103,0.0013303147,0.00044116666,0.0005159642],"domain_scores_gemma":[0.9980212,0.000082550505,0.00035545407,0.0010985626,0.0001259281,0.00031634653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003906795,0.00048262387,0.00069657405,0.00039031848,0.00046475173,0.0001697867,0.001999672,0.0006272789,0.000089587724],"category_scores_gemma":[0.000011833125,0.0005706264,0.00039130508,0.00026246684,0.00019658261,0.0007931393,0.0014270733,0.0007276728,0.000002052893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003887312,0.002053488,0.013792261,0.010669806,0.001908133,0.000642031,0.027561177,0.0062025855,0.010533495,0.7383138,0.01746005,0.16697584],"study_design_scores_gemma":[0.017596327,0.0021346374,0.09100902,0.0021306535,0.001542248,0.0001335438,0.0016341707,0.23270716,0.004533172,0.47099835,0.16946633,0.0061143716],"about_ca_topic_score_codex":0.00095771806,"about_ca_topic_score_gemma":0.00045751577,"teacher_disagreement_score":0.26731548,"about_ca_system_score_codex":0.000111496796,"about_ca_system_score_gemma":0.0002727225,"threshold_uncertainty_score":0.9996745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03420344,0.0007680682,0.95934594,0.0012375843,0.0014260253,0.0008366861,0.00031533587,0.0004067123,0.001460215],"genre_scores_gemma":[0.17327942,0.000023440334,0.82532394,0.0006405632,0.00012072053,0.00019139028,0.00038628755,0.000034006058,2.3736725e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459743,0.00091136264,0.0009209709,0.0020237393,0.0004947443,0.0010517258],"domain_scores_gemma":[0.9957386,0.00073224417,0.00053655123,0.0023815262,0.00019781628,0.00041321124],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011936704,0.0007428923,0.0010162636,0.00089211215,0.00016237605,0.00022244947,0.0035961028,0.00081276614,0.000047863206],"category_scores_gemma":[0.00051181467,0.0007812112,0.00042878446,0.00049373123,0.0006171476,0.00024913714,0.005165418,0.0035497698,0.00010958475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097151526,0.00080176006,0.031746134,0.0002562168,0.00013820596,0.00067811995,0.00628124,0.025098879,0.00054861035,0.927677,0.0026743794,0.00400232],"study_design_scores_gemma":[0.0013965693,0.00006874208,0.011960577,0.0002391323,0.000016070151,0.000015536223,0.00007432537,0.18215102,0.00088787044,0.80034447,0.002014648,0.00083103986],"about_ca_topic_score_codex":0.0002532076,"about_ca_topic_score_gemma":0.00087965274,"teacher_disagreement_score":0.15705213,"about_ca_system_score_codex":0.00013880333,"about_ca_system_score_gemma":0.0008824097,"threshold_uncertainty_score":0.99946386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10325809,0.0024597812,0.8895112,0.00024537556,0.0014596324,0.00066558673,0.0014980064,0.00028239065,0.00061991136],"genre_scores_gemma":[0.3173756,0.00028547246,0.68151265,0.0002460493,0.00012244153,0.000018138388,0.00040917622,0.000030333998,1.1566486e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951339,0.0007210337,0.0008436918,0.001795465,0.0007906936,0.00071522425],"domain_scores_gemma":[0.9955158,0.0013751318,0.00085287465,0.0015778953,0.0003555486,0.00032274824],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0007649247,0.000767279,0.0011327603,0.0011468341,0.00026872993,0.00023167199,0.0022419582,0.0013734889,0.00011267429],"category_scores_gemma":[0.00019811759,0.00079490594,0.0004398517,0.00050345034,0.0018083842,0.000525462,0.0027977421,0.0030467976,0.000006767845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064934744,0.00012861114,0.0019134872,0.00015561217,0.00040739853,0.0002180003,0.0012923504,0.0023678825,0.0065351897,0.98094803,0.0005752816,0.004808791],"study_design_scores_gemma":[0.0012773963,0.0001930164,0.009711461,0.0002471068,0.00014893498,0.000011601777,0.00017217807,0.0049501127,0.014540216,0.96676314,0.0011818814,0.00080293673],"about_ca_topic_score_codex":0.00045842503,"about_ca_topic_score_gemma":0.00051056745,"teacher_disagreement_score":0.21411751,"about_ca_system_score_codex":0.000096934,"about_ca_system_score_gemma":0.0005851213,"threshold_uncertainty_score":0.99992293},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003631364,0.000044460623,0.91195476,0.0003375975,0.00072697486,0.01676174,0.000072208364,0.0011708457,0.06530008],"genre_scores_gemma":[0.4721838,0.00014731659,0.46106896,0.0037206253,0.0007836377,0.06143412,0.00048511912,0.000099736004,0.00007670302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752814,0.00013414242,0.0003710875,0.0011370312,0.0004429806,0.00038662864],"domain_scores_gemma":[0.99692714,0.000050745148,0.00015673635,0.0025645623,0.00012233725,0.0001784928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035607844,0.0004004203,0.000341536,0.00047317913,0.00014744737,0.0004752491,0.0024362647,0.00042689883,0.00022207398],"category_scores_gemma":[0.000014200127,0.00035132025,0.00037472043,0.00043913213,0.00008971302,0.0003936415,0.0018586268,0.0008627887,0.0001948713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026427233,0.00039095865,0.00045871144,0.00011821058,0.00004158947,0.000014790881,0.00035586,0.0000071438885,0.00006400973,0.98813605,0.004995599,0.005390635],"study_design_scores_gemma":[0.00066782004,0.00067756703,0.010379945,0.00069541455,0.000026043166,0.000016278975,0.000014276918,0.002037635,0.0048005227,0.95795935,0.021328567,0.00139657],"about_ca_topic_score_codex":0.00013493552,"about_ca_topic_score_gemma":0.00003223149,"teacher_disagreement_score":0.4685524,"about_ca_system_score_codex":0.000023382136,"about_ca_system_score_gemma":0.00009737175,"threshold_uncertainty_score":0.9998939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14665897,0.00010932378,0.84206814,0.005522667,0.0010914102,0.0021282814,0.00012679555,0.0007133022,0.0015811209],"genre_scores_gemma":[0.3131548,0.000032017157,0.6846742,0.00080832955,0.00026900342,0.00071943086,0.00028091157,0.000059596296,0.0000017509191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932249,0.0009088372,0.00063140027,0.0028564602,0.00092172634,0.0014566404],"domain_scores_gemma":[0.9939827,0.00037857372,0.0005410832,0.0040350244,0.00034534308,0.0007173065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010974589,0.001010555,0.0012240349,0.0007478039,0.00032395255,0.0010191266,0.0046476354,0.00051271927,0.000018745855],"category_scores_gemma":[0.00018462152,0.0008748693,0.00046165724,0.00066352997,0.0006945601,0.0002271027,0.007928518,0.0020330676,0.00018121333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018054708,0.00046595006,0.0022123975,0.00020802791,0.00027131854,0.00018714016,0.0064648325,0.0015886747,0.00007385565,0.96626914,0.00115916,0.020918945],"study_design_scores_gemma":[0.0011310078,0.0010690762,0.0026510113,0.00032542733,0.00012201483,0.00025247864,0.0001459839,0.01989995,0.00040170952,0.9429048,0.029581448,0.001515095],"about_ca_topic_score_codex":0.00010482708,"about_ca_topic_score_gemma":0.0005966768,"teacher_disagreement_score":0.16649581,"about_ca_system_score_codex":0.000092568764,"about_ca_system_score_gemma":0.0003927076,"threshold_uncertainty_score":0.9993702},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26370972,0.0019123673,0.7273632,0.0035790456,0.00015323116,0.0014340119,0.0014706574,0.00019337588,0.000184325],"genre_scores_gemma":[0.9801359,0.00029474805,0.018735295,0.000051450534,0.00013996275,0.000003422227,0.00059045065,0.000012349057,0.000036395413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969271,0.0003338665,0.00022079312,0.0010811511,0.0008923974,0.00054469047],"domain_scores_gemma":[0.9968796,0.00022604212,0.00017403367,0.0015983075,0.00072807726,0.00039398725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013834526,0.00028453703,0.0005103773,0.0011116551,0.00042933182,0.0002616997,0.0029770837,0.00044256315,0.000009537578],"category_scores_gemma":[0.000058434518,0.00031266414,0.00020173937,0.0012485941,0.00027662833,0.00030303944,0.0032279855,0.0012408919,0.000007412268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003133024,0.011892869,0.0092012705,0.008020309,0.0018425225,0.001068854,0.01936354,0.05926734,0.036668856,0.43751937,0.14084543,0.27117664],"study_design_scores_gemma":[0.004399876,0.0021574625,0.09420309,0.0018748208,0.00013233646,0.000029118828,0.0049654306,0.8039237,0.0017288671,0.030282997,0.053464618,0.0028376642],"about_ca_topic_score_codex":0.001930039,"about_ca_topic_score_gemma":0.0009646588,"teacher_disagreement_score":0.7446564,"about_ca_system_score_codex":0.00011224465,"about_ca_system_score_gemma":0.00043492223,"threshold_uncertainty_score":0.9999325},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012392946,0.0025091118,0.96857893,0.0065961885,0.0005514291,0.0012538248,0.00010324459,0.00032699818,0.00768734],"genre_scores_gemma":[0.20922084,0.00127856,0.7875781,0.0012152905,0.00030750508,0.00023400916,0.00013268628,0.000031698288,0.0000012827544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573857,0.00091576047,0.000630284,0.0015581216,0.00038552497,0.00077174156],"domain_scores_gemma":[0.9961494,0.0009212852,0.0004498713,0.002173683,0.00007915924,0.00022655926],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008892289,0.0006378414,0.00087910355,0.00032465905,0.00041337713,0.00039611265,0.0030865758,0.00047335372,0.000022150296],"category_scores_gemma":[0.00010983461,0.00046204875,0.0003966593,0.00020994476,0.0013762013,0.000203112,0.006531292,0.0025648603,0.000028865887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121120924,0.00010776119,0.00052360754,0.00006834777,0.00015642813,0.00005135172,0.0034041558,0.00023361755,0.000057637742,0.9824568,0.001408476,0.0114106955],"study_design_scores_gemma":[0.0011195127,0.0000764989,0.011181031,0.000089304085,0.000059374353,0.0000559891,0.00006947449,0.004496004,0.000080836944,0.97890216,0.003368947,0.0005008656],"about_ca_topic_score_codex":0.0001234619,"about_ca_topic_score_gemma":0.00025534857,"teacher_disagreement_score":0.19682789,"about_ca_system_score_codex":0.00002740102,"about_ca_system_score_gemma":0.000159848,"threshold_uncertainty_score":0.9997831},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019490964,0.002501975,0.97961795,0.0008678979,0.0047886367,0.0034943498,0.00045950423,0.00044912662,0.005871458],"genre_scores_gemma":[0.02821959,0.0001540453,0.96819055,0.00017143949,0.00091835076,0.0016900464,0.0005538904,0.000086946915,0.000015124017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501324,0.00062369986,0.0009548481,0.0020941175,0.00034062215,0.0009735002],"domain_scores_gemma":[0.9943985,0.001195442,0.0007922182,0.0024224534,0.0005902387,0.00060118776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001052541,0.00078975066,0.0011946553,0.00059506134,0.00020927248,0.00043226997,0.003653654,0.00060089584,0.000011732034],"category_scores_gemma":[0.00046655274,0.000770392,0.0005092987,0.00032528784,0.00034116858,0.00047601154,0.0067032874,0.001757091,0.00017045626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012948115,0.00034638325,0.00027880742,0.00061118294,0.00037722787,0.000020797574,0.011954372,0.000928424,0.000036768837,0.9527219,0.026749698,0.005844978],"study_design_scores_gemma":[0.0009679133,0.00024338027,0.00016766605,0.0003925726,0.00008782246,0.00010448507,0.00011998287,0.032926813,0.00015148442,0.91075,0.05334241,0.00074549863],"about_ca_topic_score_codex":0.0003094512,"about_ca_topic_score_gemma":0.00028087737,"teacher_disagreement_score":0.041971903,"about_ca_system_score_codex":0.00017990299,"about_ca_system_score_gemma":0.0014787026,"threshold_uncertainty_score":0.9994747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19978541,0.00019213294,0.7937192,0.0005256964,0.0015871209,0.0006226663,0.00080832985,0.00017827428,0.0025811847],"genre_scores_gemma":[0.6995782,0.000050460934,0.2994311,0.00017828571,0.00020126037,0.000102292564,0.00043097182,0.000027237964,1.5286905e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954434,0.00081425946,0.00084291276,0.0014449218,0.00060819695,0.0008462906],"domain_scores_gemma":[0.99550873,0.0010941133,0.0009189846,0.0017473376,0.00040097814,0.00032986843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052859215,0.00068455515,0.0011499438,0.00058718456,0.00023473648,0.00009320209,0.0025548693,0.0005989488,0.00010884907],"category_scores_gemma":[0.00010150011,0.0007157554,0.0005611166,0.0004218484,0.0013098215,0.0004879988,0.0063562063,0.0020271654,0.00010212311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009190416,0.00060198375,0.0032144943,0.0001491264,0.00051846454,0.000017401067,0.014423568,0.0022497103,0.000080584,0.97698635,0.00030305708,0.0013633574],"study_design_scores_gemma":[0.00051826955,0.000056668156,0.054485567,0.000085350104,0.00007794003,0.00008828093,0.0003646806,0.0035373326,0.00060206425,0.9393116,0.00025285504,0.0006193848],"about_ca_topic_score_codex":0.00022344258,"about_ca_topic_score_gemma":0.0001301831,"teacher_disagreement_score":0.49979284,"about_ca_system_score_codex":0.00012224383,"about_ca_system_score_gemma":0.0005893328,"threshold_uncertainty_score":0.99952936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18902342,0.000119137236,0.8026514,0.0023629372,0.00210549,0.003259716,0.00012353635,0.00020175295,0.00015263176],"genre_scores_gemma":[0.27922517,0.00001604908,0.71763366,0.00049183064,0.00023813448,0.0021162336,0.0002500379,0.000028608738,2.43638e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501306,0.0007424475,0.00064468366,0.002135115,0.00058715936,0.00087750866],"domain_scores_gemma":[0.9954223,0.0008481768,0.0004149418,0.0026075132,0.00033030214,0.00037678878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014905592,0.00056001986,0.0007051551,0.0009340375,0.00020886757,0.0005219015,0.0024024774,0.0005803674,0.000042383446],"category_scores_gemma":[0.0010119647,0.00058488076,0.00029849037,0.00050803507,0.00018389359,0.0003254852,0.002858058,0.0013442576,0.000086634005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005095528,0.00028103677,0.0012153636,0.00007971335,0.00006536895,0.0000059913327,0.003438924,0.010027559,0.0002348238,0.9461951,0.00025910485,0.038146056],"study_design_scores_gemma":[0.0004777506,0.0002169601,0.032134566,0.00014010003,0.000039794737,0.000007838824,0.00009625682,0.0893257,0.00018081522,0.8751409,0.001694788,0.0005445178],"about_ca_topic_score_codex":0.00006444352,"about_ca_topic_score_gemma":0.00018373954,"teacher_disagreement_score":0.09020176,"about_ca_system_score_codex":0.00016352705,"about_ca_system_score_gemma":0.00030869583,"threshold_uncertainty_score":0.99966025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02118683,0.00021250472,0.96641445,0.0029728482,0.0010784934,0.00069022935,0.000083189494,0.00037675552,0.006984723],"genre_scores_gemma":[0.096777596,0.0002840463,0.9019844,0.00054036285,0.00017839675,0.000116042356,0.00009212876,0.000026648513,4.09226e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961238,0.00055154884,0.00056016515,0.0017507228,0.0002974373,0.0007163496],"domain_scores_gemma":[0.99669254,0.00048875326,0.00045201328,0.0018408075,0.000111273985,0.00041463287],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006644577,0.0005451334,0.00067334523,0.00032735203,0.00024083427,0.00023734312,0.0011856351,0.0005829861,0.000051115596],"category_scores_gemma":[0.0004670964,0.0005267624,0.00024228153,0.00018230091,0.0006276892,0.00035375654,0.008451744,0.0023760549,0.000098178316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005945979,0.00020118176,0.0022376822,0.00009620148,0.00012170355,0.0002083154,0.0050948877,0.0000034143604,0.00008529968,0.98613954,0.0014223743,0.0043299217],"study_design_scores_gemma":[0.0003385627,0.00013319179,0.007712229,0.00009376209,0.00004765579,0.0004524958,0.000077241064,0.0028713336,0.00029321358,0.98289824,0.0045248605,0.0005572141],"about_ca_topic_score_codex":0.00013704652,"about_ca_topic_score_gemma":0.00012952385,"teacher_disagreement_score":0.07559076,"about_ca_system_score_codex":0.00003205649,"about_ca_system_score_gemma":0.00046940218,"threshold_uncertainty_score":0.9999255},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040570997,0.0008732125,0.9450613,0.0010908719,0.0015099822,0.0010852198,0.0008709697,0.0009452558,0.007992187],"genre_scores_gemma":[0.17846681,0.0023453156,0.81792396,0.00041427888,0.0001676278,0.00021150993,0.000408953,0.000059998278,0.0000015099345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99284786,0.0006219902,0.001245715,0.0028175723,0.0010407036,0.001426134],"domain_scores_gemma":[0.99414235,0.0005987023,0.00076990906,0.0037000282,0.0003787945,0.00041021899],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006384176,0.0010646112,0.0013550698,0.0011632016,0.00066257565,0.00029112468,0.0049838717,0.0009145793,0.00007034875],"category_scores_gemma":[0.00034644984,0.0010607779,0.00084296335,0.0014889789,0.0011858114,0.0005353744,0.0076946532,0.0030044054,0.00028530858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089801026,0.00042607676,0.00036895613,0.00012915145,0.00020614653,0.00017338702,0.008928109,0.0070654266,0.00010944741,0.97743374,0.002701246,0.0023685046],"study_design_scores_gemma":[0.00070041354,0.00013537999,0.00061659905,0.00009540725,0.00006825112,0.00015072688,0.000056828092,0.18326458,0.00043451256,0.8112494,0.0023280531,0.00089988636],"about_ca_topic_score_codex":0.000091290436,"about_ca_topic_score_gemma":0.000030321813,"teacher_disagreement_score":0.17619915,"about_ca_system_score_codex":0.00018597544,"about_ca_system_score_gemma":0.0009792756,"threshold_uncertainty_score":0.9992957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019597583,0.0015419568,0.9674532,0.0005786732,0.0007334645,0.0010416207,0.00017345088,0.00038557537,0.008494513],"genre_scores_gemma":[0.45824715,0.0010036649,0.5387382,0.0004381759,0.00046747606,0.00087539013,0.0001980783,0.00003146814,4.071326e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964856,0.00036113363,0.0005640115,0.001532181,0.00027923263,0.0007778607],"domain_scores_gemma":[0.9963495,0.00044148666,0.00039953308,0.0022990245,0.00010288779,0.000407564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004710177,0.00055743044,0.0006979006,0.00029277767,0.0002796796,0.0001917011,0.0020529476,0.0005024331,0.00008166997],"category_scores_gemma":[0.00005461503,0.00057767227,0.00025050621,0.00025546327,0.0006387467,0.00031507653,0.0067723393,0.0016012205,0.00022172095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018752167,0.00020262238,0.0008059306,0.00013509268,0.00010409019,0.0000068100276,0.004226096,0.000007815541,0.00039766572,0.96231693,0.00027791155,0.031500276],"study_design_scores_gemma":[0.00032258264,0.000028256805,0.0068742293,0.00004200619,0.000040804603,0.00004588594,0.00007233256,0.00087965577,0.0009845308,0.97566634,0.014446407,0.0005969411],"about_ca_topic_score_codex":0.000069719244,"about_ca_topic_score_gemma":0.00011699876,"teacher_disagreement_score":0.43864956,"about_ca_system_score_codex":0.00004176647,"about_ca_system_score_gemma":0.00015013796,"threshold_uncertainty_score":0.99966747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006002364,0.00034797055,0.98257554,0.0029348838,0.002408454,0.0022208088,0.00055030105,0.00039879142,0.002560869],"genre_scores_gemma":[0.060574286,0.00036347212,0.9365086,0.0011144447,0.00033150747,0.00084647676,0.00022214981,0.000038382863,6.783396e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949885,0.00038715283,0.00090222404,0.0021909254,0.0004710452,0.0010601629],"domain_scores_gemma":[0.9941249,0.0014980203,0.00077577354,0.0030310617,0.000231579,0.00033866015],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00062968326,0.0008570174,0.0011831222,0.00052148825,0.00035902314,0.0003343046,0.0038833953,0.0007139173,0.000044452172],"category_scores_gemma":[0.00030525023,0.0008714305,0.0008004267,0.0002500181,0.00038083646,0.00036484253,0.0051043457,0.0026685994,0.000103826074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026198773,0.00055278454,0.0005124748,0.00012526954,0.00038660096,0.00007106285,0.0035611484,0.000114459406,0.000087569344,0.9741309,0.0015612947,0.01863444],"study_design_scores_gemma":[0.0008430699,0.00030267896,0.0021907971,0.00041136716,0.000064591215,0.000036432633,0.00014618531,0.0052601527,0.0015068935,0.9777856,0.0106205605,0.0008316619],"about_ca_topic_score_codex":0.00003924752,"about_ca_topic_score_gemma":0.00012592736,"teacher_disagreement_score":0.05457192,"about_ca_system_score_codex":0.00018383475,"about_ca_system_score_gemma":0.0003924192,"threshold_uncertainty_score":0.9996323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12968618,0.00031949012,0.86530197,0.0016337687,0.0007449686,0.00077777554,0.0009178228,0.00022775035,0.00039025655],"genre_scores_gemma":[0.4811022,0.00020772572,0.5179818,0.00020946031,0.00008210537,0.00017982903,0.00019876183,0.00003678267,0.0000012958075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504954,0.00059140386,0.0009775154,0.00180566,0.00057146937,0.001004416],"domain_scores_gemma":[0.99568194,0.00071792986,0.000542222,0.0023775673,0.00024329308,0.00043705586],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010366902,0.0005861948,0.00090449094,0.00088318554,0.0002742247,0.00013828254,0.0030430108,0.0005188762,0.000053528736],"category_scores_gemma":[0.0002971033,0.0005464685,0.0004194894,0.00050704955,0.00066342036,0.00031202505,0.008040562,0.001299348,0.00010330335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008997797,0.00026005274,0.0024400158,0.0003527789,0.00017185423,0.000025307607,0.002800021,0.00044861942,0.04044114,0.9120154,0.00083161687,0.040123258],"study_design_scores_gemma":[0.00044638646,0.00014616759,0.003310288,0.00040432427,0.00003662907,0.000026771717,0.00010647924,0.013244583,0.0068729855,0.97341466,0.0012651747,0.0007255207],"about_ca_topic_score_codex":0.0004699397,"about_ca_topic_score_gemma":0.00023371655,"teacher_disagreement_score":0.351416,"about_ca_system_score_codex":0.000136465,"about_ca_system_score_gemma":0.00038741317,"threshold_uncertainty_score":0.99998224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031518925,0.00030448605,0.95243543,0.0020316208,0.0033305124,0.00057621615,0.000119599026,0.0007285424,0.008954653],"genre_scores_gemma":[0.12472906,0.00042516968,0.8729626,0.000651744,0.0007680267,0.00018462421,0.0002442064,0.000033206918,0.0000013528793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580467,0.0004729808,0.0007492803,0.0017836391,0.0004390634,0.00075034716],"domain_scores_gemma":[0.99628717,0.0003475796,0.0004716274,0.0024574657,0.00014387952,0.00029225534],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005261557,0.00062167255,0.0006795082,0.0007373928,0.0003538064,0.00024768073,0.00293429,0.000582933,0.00029521808],"category_scores_gemma":[0.000123609,0.0006428377,0.0005797851,0.0003202922,0.00040363264,0.00041257715,0.008753246,0.0020449136,0.0006247833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004092629,0.0002095247,0.0007787294,0.00005251108,0.00011506896,0.00006170567,0.0030073745,0.0005788977,0.0004888176,0.9702716,0.0029171242,0.021477716],"study_design_scores_gemma":[0.00037926214,0.00007960547,0.007630041,0.00010089515,0.00003248672,0.00014472255,0.00007342752,0.013135832,0.00044387742,0.9610807,0.016246492,0.00065268076],"about_ca_topic_score_codex":0.00013293285,"about_ca_topic_score_gemma":0.0003502309,"teacher_disagreement_score":0.09321014,"about_ca_system_score_codex":0.00014720034,"about_ca_system_score_gemma":0.00027032327,"threshold_uncertainty_score":0.9996023},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042882552,0.0004868076,0.91767573,0.0006765257,0.0031259453,0.0003066216,0.00009004544,0.0008536139,0.072496474],"genre_scores_gemma":[0.9502648,0.00031800164,0.046210792,0.0019502764,0.00029264615,0.00024783105,0.0003989006,0.00003384184,0.00028287794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980969,0.000105937135,0.00024869156,0.00083113264,0.0004293504,0.00028798945],"domain_scores_gemma":[0.99764085,0.000071156144,0.000114632756,0.0020214962,0.00004143535,0.00011044339],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038401393,0.00021414118,0.00024482445,0.00020008272,0.00016406421,0.00032907055,0.0030782882,0.00012663103,0.0014003594],"category_scores_gemma":[0.000021514112,0.00021315037,0.0002219107,0.00037626663,0.000028598773,0.00019645687,0.0073398477,0.0007891903,0.000062654144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.3358225e-7,0.00007613757,0.00017675776,0.000038643993,0.000024238996,0.000026001828,0.00030379812,0.000044720557,0.000016648608,0.98338854,0.012399705,0.0035039498],"study_design_scores_gemma":[0.000326044,0.000076185155,0.003917862,0.000029642684,0.000019779027,0.000018606683,0.00007388765,0.028470013,0.00014009119,0.7218813,0.24407715,0.000969454],"about_ca_topic_score_codex":0.00018465641,"about_ca_topic_score_gemma":0.000018145642,"teacher_disagreement_score":0.94597656,"about_ca_system_score_codex":0.00003553096,"about_ca_system_score_gemma":0.00023034768,"threshold_uncertainty_score":0.9995125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054746077,0.0012350156,0.9937271,0.0011963648,0.0004592648,0.00077629567,0.00011900267,0.00037793303,0.0020543174],"genre_scores_gemma":[0.5537948,0.000053105352,0.44160143,0.00415171,0.00023781284,0.00002038287,0.00006981258,0.00006017135,0.0000107732385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427634,0.00008400732,0.00055063353,0.0026800209,0.0015650576,0.0008439384],"domain_scores_gemma":[0.9962135,0.0005803265,0.00044552705,0.0020575442,0.0003082229,0.00039486054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006899143,0.00091707293,0.00088428456,0.00096850056,0.00039881747,0.0008243509,0.004835255,0.00048440875,0.000027590315],"category_scores_gemma":[0.000077394325,0.0007603727,0.000269989,0.0017410927,0.0011956673,0.000990211,0.0013755094,0.0019303563,0.00002289898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039278588,0.00033056305,0.00019193953,0.0006077042,0.0002160919,0.002337774,0.0052825143,0.043003473,0.00025748703,0.51034194,0.00047357648,0.43656415],"study_design_scores_gemma":[0.0006873793,0.00073491014,0.00013525778,0.00091696874,0.00003305004,0.000039797975,6.1831224e-7,0.74246734,0.0004318624,0.2505918,0.0026146125,0.0013464147],"about_ca_topic_score_codex":0.000031356587,"about_ca_topic_score_gemma":0.00028042664,"teacher_disagreement_score":0.69946384,"about_ca_system_score_codex":0.00023965456,"about_ca_system_score_gemma":0.0008185898,"threshold_uncertainty_score":0.9994847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008261198,0.0026298391,0.66513646,0.0008146886,0.0010324126,0.0003244453,0.00007074684,0.0005432942,0.32943988],"genre_scores_gemma":[0.55994105,0.035273455,0.10897724,0.02994771,0.040720243,0.00027523236,0.00665851,0.0018814334,0.21632513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99742544,0.000042385167,0.0003807847,0.0010565331,0.00058081147,0.00051404064],"domain_scores_gemma":[0.9979086,0.00012686115,0.00015934784,0.0013454347,0.000102545404,0.00035723494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020042181,0.000501062,0.00055356004,0.00014115403,0.00019856231,0.00033822612,0.0022305485,0.00067422626,0.00018716518],"category_scores_gemma":[0.0000036567858,0.0005088807,0.0003465394,0.0002158039,0.0001491738,0.0002875516,0.0012334683,0.0016637793,0.00026410416],"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.00001215697,0.000012108195,0.0000080104355,0.00003682728,0.000066175206,0.00015688305,0.0001584478,0.00017239162,7.4891625e-7,0.9147557,0.029215477,0.055405065],"study_design_scores_gemma":[0.00036974772,0.00012469565,0.000027913422,0.0003077478,0.000039900777,0.00003246248,0.000006381067,0.15105468,0.0000069155963,0.074394345,0.77255315,0.0010820671],"about_ca_topic_score_codex":0.00001207066,"about_ca_topic_score_gemma":0.00003199483,"teacher_disagreement_score":0.84036136,"about_ca_system_score_codex":0.00003723992,"about_ca_system_score_gemma":0.00010899238,"threshold_uncertainty_score":0.9997363},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.547983e-7,0.0016426694,0.9327946,0.00081367476,0.0006825503,0.0007867071,0.0009013595,0.00083304057,0.06154459],"genre_scores_gemma":[0.12064928,0.026436742,0.7037669,0.0257366,0.03790612,0.0011326729,0.06542635,0.0016411226,0.017304214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972896,0.000026468919,0.00045191753,0.0014785096,0.00033248833,0.00042103633],"domain_scores_gemma":[0.9958147,0.0002239268,0.00030742906,0.003325914,0.000105317966,0.0002227398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038128492,0.00049852196,0.0006107135,0.00011203458,0.00019549925,0.0003033795,0.004919097,0.0006369237,0.00003343798],"category_scores_gemma":[0.000015147173,0.0005143263,0.0002485932,0.00012615965,0.00013397013,0.00058511615,0.0027105417,0.00084697624,0.000020283054],"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.000015997504,0.000016134063,0.000002982976,0.000069534595,0.00005698835,0.000019956798,0.000040303417,0.0000017002201,6.638717e-7,0.81663316,0.083392546,0.099750005],"study_design_scores_gemma":[0.00014502053,0.00007276469,0.0000016210441,0.00016431656,0.000043592034,0.000007875633,0.0000011580836,0.14909591,0.000011615395,0.21116559,0.63876134,0.00052918715],"about_ca_topic_score_codex":0.000017204995,"about_ca_topic_score_gemma":0.00006236022,"teacher_disagreement_score":0.6054676,"about_ca_system_score_codex":0.00002821235,"about_ca_system_score_gemma":0.0001014509,"threshold_uncertainty_score":0.9997308},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33051592,0.00014939977,0.6633608,0.0009650416,0.000127698,0.00039010282,0.00036994458,0.0005625598,0.0035585333],"genre_scores_gemma":[0.9605682,0.00002051654,0.03836262,0.0006684809,0.000042483498,0.000009150031,0.00032352304,0.000004385976,6.4325747e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989754,0.000025219304,0.0002932786,0.00028786904,0.00021968373,0.00019857081],"domain_scores_gemma":[0.99879885,0.00006243112,0.00015299392,0.0007271118,0.000108264,0.0001503496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029322103,0.00014109237,0.00015339903,0.00006152727,0.00020064862,0.00080157723,0.0011681073,0.000064169166,0.000019500567],"category_scores_gemma":[0.00035351035,0.00012025643,0.000018707397,0.00053202483,0.00008184627,0.010400426,0.0010485918,0.0002202003,0.00001797661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004673473,0.00010508125,0.03629283,0.0033767798,0.0002967998,0.00004850996,0.15581252,0.0001218096,0.0012310712,0.421289,0.010633243,0.370325],"study_design_scores_gemma":[0.003379064,0.0010195524,0.12641613,0.0010644955,0.00008658091,0.00037873135,0.0068015647,0.77090675,0.0025932416,0.042069677,0.043123305,0.0021609063],"about_ca_topic_score_codex":0.00007855554,"about_ca_topic_score_gemma":0.000018072882,"teacher_disagreement_score":0.7707849,"about_ca_system_score_codex":0.000026349355,"about_ca_system_score_gemma":0.000059764432,"threshold_uncertainty_score":0.7729628},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2945006,0.000074581396,0.696869,0.00072261126,0.00049265666,0.0014372863,0.0005481251,0.00033410266,0.00502102],"genre_scores_gemma":[0.96022135,0.00003587083,0.036230672,0.00269575,0.000085420295,0.00012434197,0.0005692843,0.000029289646,0.000008037837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968185,0.00003044859,0.0011894014,0.0005349007,0.0005586651,0.0008681059],"domain_scores_gemma":[0.998134,0.000071962124,0.00031103502,0.00097613555,0.00010024873,0.00040662926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004573976,0.000437916,0.0005695229,0.0002916724,0.00024098465,0.00059850013,0.002248343,0.00016953758,0.000031116346],"category_scores_gemma":[0.000035558376,0.00042498478,0.0003067767,0.00081583206,0.00009127887,0.0036428454,0.001278572,0.0004892638,0.000107619795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012009064,0.0026025022,0.04542636,0.0035185684,0.0006187884,0.00013547459,0.2013653,0.015581158,0.00081087684,0.67525536,0.034584686,0.018899998],"study_design_scores_gemma":[0.004741658,0.00023255477,0.0012188266,0.000120631885,0.000017401659,0.000016949756,0.00102339,0.96996045,0.0007668696,0.0070111854,0.014236014,0.0006540456],"about_ca_topic_score_codex":0.00004717683,"about_ca_topic_score_gemma":0.00003878049,"teacher_disagreement_score":0.9543793,"about_ca_system_score_codex":0.00009813463,"about_ca_system_score_gemma":0.00005315573,"threshold_uncertainty_score":0.9998202},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3348744,0.00023053407,0.6635036,0.00072630553,0.00013639711,0.00017544997,0.000115123665,0.00017777583,0.000060409708],"genre_scores_gemma":[0.9783232,0.000088762295,0.020965952,0.0005103069,0.000070656424,0.0000015725213,0.000022593384,0.000015810578,0.0000011071152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975082,0.00018811283,0.00032785823,0.001074116,0.00042043498,0.00048124214],"domain_scores_gemma":[0.9980577,0.00041006703,0.00007718689,0.0010523056,0.000056634428,0.00034607245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006250126,0.00027341073,0.00029943473,0.0001487238,0.0008442547,0.0005468583,0.0014239263,0.00012084651,0.000034198314],"category_scores_gemma":[0.00003525455,0.00027008128,0.00006436367,0.0007030146,0.00007580026,0.00076556054,0.00028911952,0.0007532323,0.0000051813445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090692914,0.002476534,0.0109755155,0.0034863616,0.0014037673,0.0009667328,0.101305395,0.2633151,0.026408916,0.01924602,0.006256895,0.56325185],"study_design_scores_gemma":[0.0006206185,0.00011495575,0.0011008173,0.00008160327,0.00002893279,0.000038341404,0.00019435026,0.99486834,0.0013665911,0.000101630576,0.0011541817,0.000329634],"about_ca_topic_score_codex":0.00014772818,"about_ca_topic_score_gemma":0.000035606976,"teacher_disagreement_score":0.73155326,"about_ca_system_score_codex":0.00001717867,"about_ca_system_score_gemma":0.00006112406,"threshold_uncertainty_score":0.99997514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002512765,0.00009814755,0.95416933,0.041495323,0.00072726066,0.0001665417,0.00024601564,0.000051555493,0.00053304073],"genre_scores_gemma":[0.85273176,0.00004147844,0.13801186,0.008700782,0.0003692579,0.000008479442,0.00013188622,0.0000042470883,2.3274609e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984378,0.000061320294,0.00069247646,0.00008965924,0.00058476103,0.00013396314],"domain_scores_gemma":[0.9972988,0.00023243077,0.0006976494,0.00035986464,0.0012444617,0.00016681045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044226518,0.000120883786,0.00016853686,0.00024937015,0.0001018196,0.00034645404,0.0029345914,0.00007111055,0.000019774361],"category_scores_gemma":[0.00040245635,0.00010925111,0.00025365397,0.00030410598,0.000060702405,0.0023515401,0.00026862434,0.00035136438,0.0000141318005],"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.00042227196,0.00022799007,0.00030146126,0.00008649142,0.0002404917,0.000010045431,0.017473059,0.0012839572,0.00011040642,0.9077721,0.03611415,0.035957556],"study_design_scores_gemma":[0.002283523,0.00028061276,0.00031909492,0.000062644154,0.00001917948,0.0000954724,0.00027216127,0.09691198,0.00093440636,0.055488106,0.84309727,0.00023556084],"about_ca_topic_score_codex":0.0000058330875,"about_ca_topic_score_gemma":0.000006820301,"teacher_disagreement_score":0.852284,"about_ca_system_score_codex":0.000042051997,"about_ca_system_score_gemma":0.00019235793,"threshold_uncertainty_score":0.545325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015559367,0.00058757584,0.9775246,0.003710279,0.0015368637,0.00061124517,0.00003597385,0.0003773184,0.000056814904],"genre_scores_gemma":[0.5745627,0.00001859191,0.42337295,0.0017294605,0.0002740116,0.000017171073,0.0000131256975,0.000011894011,3.5939824e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944202,0.00015687394,0.00046816925,0.002669998,0.0013789929,0.000905766],"domain_scores_gemma":[0.9961504,0.0005232433,0.00029958508,0.0023481844,0.00029207382,0.00038655518],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00095764414,0.0006413622,0.00063818344,0.00067303446,0.00031734843,0.0016476291,0.0071020667,0.00040904834,0.0000078490975],"category_scores_gemma":[0.00019461534,0.0005273287,0.0001755475,0.00375294,0.0007948058,0.0009965622,0.0069567114,0.0024663866,0.000013615942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041886666,0.0010803498,0.006439167,0.0012985399,0.00021238705,0.001473481,0.034864984,0.33812,0.000787525,0.08486338,0.0004994544,0.52994186],"study_design_scores_gemma":[0.0005621502,0.00022950296,0.0013167049,0.00024028095,0.00001548688,0.000032432603,0.0000010098585,0.6490807,0.0028444512,0.3445712,0.000282809,0.00082326814],"about_ca_topic_score_codex":0.00012159193,"about_ca_topic_score_gemma":0.0002767135,"teacher_disagreement_score":0.5590034,"about_ca_system_score_codex":0.00011957286,"about_ca_system_score_gemma":0.0009073248,"threshold_uncertainty_score":0.99983495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118087,0.000013548169,0.8792778,0.00092154794,0.0009033422,0.00028645401,0.000102211336,0.00036113025,0.000046941703],"genre_scores_gemma":[0.97294396,0.000005572961,0.026353508,0.0002839788,0.00028151815,0.000006318751,0.00010641218,0.000017558974,0.0000011709044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976056,0.00024386398,0.00044879064,0.00094690174,0.00042626358,0.00032858527],"domain_scores_gemma":[0.9982613,0.00023097865,0.00017517275,0.0010924266,0.00007936474,0.00016078106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005016578,0.00025897846,0.00026614734,0.00019278507,0.00028607814,0.0001975949,0.001262908,0.0001364816,0.000023154887],"category_scores_gemma":[0.000038403567,0.00025729864,0.000065716304,0.0016212652,0.00006666121,0.0006554069,0.000030144934,0.0008095358,0.000016367514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002096367,0.0040008468,0.0053030755,0.00059660827,0.00045566965,0.00029242245,0.036090244,0.27038336,0.015842143,0.11435433,0.0028857652,0.54769915],"study_design_scores_gemma":[0.0010567971,0.00028695306,0.0027134186,0.00008653673,0.00002129529,0.0000075140315,0.00009201078,0.9923159,0.0022450471,0.00032967053,0.0004721577,0.00037273584],"about_ca_topic_score_codex":0.000570031,"about_ca_topic_score_gemma":0.0007271038,"teacher_disagreement_score":0.85485697,"about_ca_system_score_codex":0.00006817242,"about_ca_system_score_gemma":0.00014148626,"threshold_uncertainty_score":0.9999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48019844,0.0001087175,0.5173897,0.0020569093,0.00006335972,0.000096241056,0.0000051562474,0.000011349353,0.00007012531],"genre_scores_gemma":[0.96479845,0.000027804468,0.03398586,0.0011729538,0.000010486115,6.484114e-7,0.0000024704605,0.0000012117048,1.0177146e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867666,0.000024963187,0.00044033097,0.000110108514,0.0005600502,0.00018791652],"domain_scores_gemma":[0.9985628,0.000026165992,0.00039930802,0.00020740596,0.00058646005,0.00021782448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190025,0.00007307965,0.00012818567,0.00033074553,0.00012678052,0.00023820753,0.00073489064,0.00003559059,0.0000034538793],"category_scores_gemma":[0.00016852347,0.000058470658,0.00003782184,0.0017304986,0.0000711729,0.004453774,0.00007304685,0.00018547189,0.0000022470892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040960932,0.0002485392,0.00037490384,0.000094567076,0.000023056242,0.0000012404037,0.013100312,0.022779295,0.33634537,0.6115228,0.00044182758,0.014658459],"study_design_scores_gemma":[0.00049873313,0.0020294283,0.002116799,0.00002925815,0.000008324232,0.000009685946,0.00007121628,0.93863744,0.047957733,0.0010294514,0.0074748546,0.00013706453],"about_ca_topic_score_codex":0.000001850351,"about_ca_topic_score_gemma":4.7198978e-7,"teacher_disagreement_score":0.91585815,"about_ca_system_score_codex":0.000032365024,"about_ca_system_score_gemma":0.0004003704,"threshold_uncertainty_score":0.32288787},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016004806,0.0003426731,0.98759186,0.0013262988,0.0064913463,0.0011522535,0.00007041033,0.00026151375,0.0011631805],"genre_scores_gemma":[0.19227229,0.0005868341,0.77772254,0.023368848,0.005096471,0.0002496034,0.00019160917,0.00018276344,0.0003290276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943342,0.00011106723,0.00070339715,0.0024704842,0.0013407402,0.0010400707],"domain_scores_gemma":[0.99623656,0.00019303965,0.00037586692,0.0021556783,0.0002996019,0.0007392705],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010999438,0.00069610646,0.0006745806,0.0012958222,0.0005259228,0.0009913234,0.0065937135,0.0003093374,0.00033442586],"category_scores_gemma":[0.000053663403,0.0006405498,0.00018460095,0.0014661413,0.0003157882,0.0016502577,0.0019285416,0.0010070456,0.0001468713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023969753,0.00015727224,0.00013733048,0.0000627587,0.000014869809,0.000027810238,0.0035876748,0.0041930974,0.000017773189,0.032266017,0.0033031567,0.9562083],"study_design_scores_gemma":[0.0011709032,0.007431088,0.0043089953,0.0013193936,0.00001973413,0.00011673579,0.000004422273,0.55629086,0.00041991813,0.3417618,0.08242161,0.0047345473],"about_ca_topic_score_codex":0.00037154113,"about_ca_topic_score_gemma":0.0007455045,"teacher_disagreement_score":0.9514737,"about_ca_system_score_codex":0.00036051878,"about_ca_system_score_gemma":0.0007052425,"threshold_uncertainty_score":0.9996046},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125608025,0.006905195,0.1174363,0.036888205,0.000555505,0.004824675,0.008519187,0.0014344564,0.81087565],"genre_scores_gemma":[0.30577558,0.013794968,0.50974905,0.0012747822,0.0026274084,0.0000052230703,0.0057414104,0.0005358933,0.16049571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99629945,0.00014133313,0.00020898314,0.0010565504,0.0017426282,0.0005510822],"domain_scores_gemma":[0.996661,0.00040899828,0.0002355743,0.0013257882,0.00086157443,0.00050703634],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00068319374,0.000366049,0.00063238735,0.0008482495,0.00042775396,0.000106262916,0.0032709048,0.00049870135,0.0002467557],"category_scores_gemma":[0.00006796606,0.00039223666,0.00032521714,0.0007231453,0.00081917795,0.000722009,0.0020483616,0.002305193,0.000083654566],"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.0005992315,0.00024335716,0.00003485586,0.0003381527,0.00041550378,0.00094868965,0.0018232348,0.000007938596,0.000031209067,0.97241575,0.017364772,0.0057773245],"study_design_scores_gemma":[0.003322453,0.001952118,0.0005181281,0.00073739205,0.00018140039,0.00003599457,0.0010770456,0.005440772,0.00004717127,0.17847951,0.8068801,0.0013279205],"about_ca_topic_score_codex":0.0002829657,"about_ca_topic_score_gemma":0.0017123178,"teacher_disagreement_score":0.7939362,"about_ca_system_score_codex":0.00008454168,"about_ca_system_score_gemma":0.0005876893,"threshold_uncertainty_score":0.99999654},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022871946,0.000025882548,0.90216714,0.0620196,0.00008393847,0.00017909659,0.0000018974903,0.0001508143,0.033084404],"genre_scores_gemma":[0.95668507,0.000010459607,0.011897878,0.031338748,0.000043784745,0.0000118754015,0.000001281765,0.0000020839154,0.000008812532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994214,0.00010432695,0.00009173421,0.00016373103,0.00012894446,0.00008986322],"domain_scores_gemma":[0.99904346,0.00054824515,0.000020784788,0.00031624766,0.000012543133,0.000058684916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033642602,0.000055049186,0.00011015926,0.000013526997,0.00006449906,0.00010220931,0.0005851556,0.000013743598,0.00028719648],"category_scores_gemma":[0.0001966202,0.000026944766,0.00010944015,0.00021901823,0.000041904656,0.0001381411,0.00015580113,0.000081711085,0.0002063812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004228551,0.00000945462,0.0000011841603,7.8638345e-7,0.0000064111387,0.0000015778056,0.0004137089,0.0000014633868,0.000016187683,0.97672594,0.021798119,0.0006023348],"study_design_scores_gemma":[0.056283087,0.0001295803,0.000059390542,0.000008742174,0.000011012113,0.0000041795993,0.000100834666,0.13466747,0.0028526264,0.77835053,0.027245404,0.0002871319],"about_ca_topic_score_codex":0.000010918354,"about_ca_topic_score_gemma":0.0000014825671,"teacher_disagreement_score":0.95439786,"about_ca_system_score_codex":0.0000015185398,"about_ca_system_score_gemma":0.000008662878,"threshold_uncertainty_score":0.31446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012711076,0.00035707836,0.9508427,0.032572683,0.00007278007,0.0010122593,0.00007057358,0.0022652883,0.00009561306],"genre_scores_gemma":[0.6683488,0.00050767616,0.3300402,0.000566486,0.000012851918,0.00037008795,0.00012395358,0.000028977667,9.674558e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681395,0.0004045403,0.0008228104,0.00089738733,0.00041839975,0.00064292457],"domain_scores_gemma":[0.99485564,0.0006843485,0.00029437768,0.0037978622,0.0001954406,0.00017232807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044311528,0.0005304709,0.00048422453,0.0014824267,0.000993668,0.00023383855,0.0035697296,0.000462937,0.00004205238],"category_scores_gemma":[0.00033506012,0.0005563883,0.00023081493,0.0055079297,0.00021792596,0.000851396,0.00021069935,0.0017609397,0.000047945512],"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.00019506883,0.0008550795,0.00015425707,0.0000687203,0.000060100727,0.0000036353733,0.0013895743,0.83611625,0.0091466755,0.0150683625,0.0002108146,0.13673143],"study_design_scores_gemma":[0.0013661757,0.0004991481,0.0011218768,0.0003835158,0.000026405107,0.000002580147,0.00055362034,0.9792249,0.009947975,0.0018506483,0.00429375,0.0007293757],"about_ca_topic_score_codex":0.000048644353,"about_ca_topic_score_gemma":0.000104064704,"teacher_disagreement_score":0.65563774,"about_ca_system_score_codex":0.0003600769,"about_ca_system_score_gemma":0.00014187636,"threshold_uncertainty_score":0.99968874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008925794,0.00055929855,0.9705735,0.026849885,0.00011722816,0.00043771975,0.000093814975,0.00039203017,0.000083934676],"genre_scores_gemma":[0.3281582,0.000032776876,0.65852314,0.012700998,0.00031644883,0.000025162393,0.00022637387,0.000015087259,0.000001790425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980147,0.000038148224,0.00024863533,0.00088566594,0.00021824238,0.0005946107],"domain_scores_gemma":[0.9973144,0.00021248632,0.0001017254,0.0020937093,0.000035783316,0.00024190346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048541094,0.00014732176,0.00019674357,0.000044851855,0.0002142643,0.00030090884,0.0049477685,0.00006675402,0.000043329223],"category_scores_gemma":[0.00027700735,0.00013907428,0.00007250473,0.0006361247,0.000016331187,0.0008044757,0.0021988319,0.00032437613,0.000008726525],"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.000020972051,0.000049403374,0.00050276646,0.00014817045,0.000017809087,9.356172e-7,0.0007315832,0.00003614501,0.000011784744,0.9782369,0.01710676,0.0031367585],"study_design_scores_gemma":[0.000412671,0.00025433552,0.0001646497,0.000048971382,0.0000053564054,0.0000010734481,0.00003000078,0.69389874,0.00014988662,0.18953858,0.115261935,0.00023382831],"about_ca_topic_score_codex":0.00006695149,"about_ca_topic_score_gemma":0.000057609497,"teacher_disagreement_score":0.7886983,"about_ca_system_score_codex":0.000026245814,"about_ca_system_score_gemma":0.0003077641,"threshold_uncertainty_score":0.91942674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26751304,0.00014097778,0.72447395,0.00599473,0.0005968728,0.00044661746,0.00016382102,0.00042194527,0.00024806804],"genre_scores_gemma":[0.96894175,0.000050532373,0.030213233,0.00053807575,0.00014153261,0.000008139115,0.00008936463,0.000016380684,9.652442e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773926,0.00017133782,0.00052416645,0.0006639167,0.00051384734,0.0003874773],"domain_scores_gemma":[0.998572,0.00008536442,0.0002662433,0.0005632701,0.00014793823,0.00036522062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018455907,0.0002814017,0.0003993452,0.00012930817,0.0001292708,0.00015171422,0.001161039,0.00015849547,0.000021331252],"category_scores_gemma":[0.000055375243,0.00027658432,0.0002158265,0.0007607941,0.0001283269,0.0007305974,0.00057211734,0.00032315878,0.00003590269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028669136,0.0026335102,0.020457368,0.0016720927,0.0004936032,0.000220381,0.14782183,0.00053770846,0.15166187,0.65906936,0.009034636,0.0061109615],"study_design_scores_gemma":[0.0068867714,0.0011323406,0.013636153,0.00022629532,0.00017220431,0.00005738844,0.0003910483,0.7954959,0.10844243,0.047705356,0.023617843,0.0022362168],"about_ca_topic_score_codex":0.00005551962,"about_ca_topic_score_gemma":0.00007863991,"teacher_disagreement_score":0.79495823,"about_ca_system_score_codex":0.000017350523,"about_ca_system_score_gemma":0.00006693212,"threshold_uncertainty_score":0.99996865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024321845,0.012008645,0.95395845,0.0065466166,0.000433326,0.00043880212,0.000022900984,0.0007765455,0.001492874],"genre_scores_gemma":[0.9877593,0.00281259,0.0051488634,0.003934421,0.00019739043,0.000034740002,0.00003677321,0.00003772527,0.00003817592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970728,0.00010054446,0.00045105838,0.00082915474,0.00040631762,0.0011401131],"domain_scores_gemma":[0.99844354,0.0000936513,0.00013879918,0.00083700515,0.00013724972,0.0003497316],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030168492,0.00032716963,0.00033335612,0.00012811727,0.00015802988,0.00023937841,0.0014808528,0.00011407771,0.00008971972],"category_scores_gemma":[0.00007008341,0.0003369088,0.00018999343,0.001189478,0.00009200506,0.00049717975,0.00020582709,0.0007105237,0.0012369928],"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.00012379453,0.00030433774,0.00040039074,0.000046461635,0.00023034331,0.00005668316,0.00072655856,0.0001310384,0.04502888,0.8216276,0.032239072,0.0990848],"study_design_scores_gemma":[0.0006952477,0.000732184,0.00014771654,0.00001626194,0.00006153397,0.000045387307,0.0000096689755,0.03980691,0.052331544,0.04579574,0.85947365,0.0008841603],"about_ca_topic_score_codex":0.000008436124,"about_ca_topic_score_gemma":0.00012523447,"teacher_disagreement_score":0.9634375,"about_ca_system_score_codex":0.00009571594,"about_ca_system_score_gemma":0.00054224127,"threshold_uncertainty_score":0.99990827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30362126,0.00074110244,0.6944149,0.0003048063,0.0003353625,0.00022252541,0.000026123296,0.0002519821,0.00008189508],"genre_scores_gemma":[0.98572797,0.000116306815,0.013507761,0.00046936813,0.00014416344,0.000007333589,0.0000037189982,0.000019729086,0.0000036502527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797654,0.00011080998,0.00032350933,0.00082649954,0.00030308953,0.00045953173],"domain_scores_gemma":[0.9987606,0.00025387845,0.000105477164,0.00047735608,0.000065738284,0.00033699727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031149486,0.0002886161,0.0003053215,0.00015725534,0.0008186664,0.00045005156,0.0006637694,0.00013178504,0.000025743018],"category_scores_gemma":[0.000015707303,0.00028873168,0.000103342114,0.00072344206,0.00006448189,0.0004498067,0.00007428136,0.00061783136,0.000008581872],"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.00037247894,0.0013721626,0.00072390056,0.0019067107,0.00057747983,0.0006269467,0.10844278,0.57954544,0.0149985105,0.02730215,0.0025769016,0.26155454],"study_design_scores_gemma":[0.00085535727,0.0002659989,0.000056132765,0.00010877733,0.00003437486,0.000077009325,0.000644022,0.98624873,0.004772135,0.00046074178,0.005994901,0.00048179962],"about_ca_topic_score_codex":0.000044369925,"about_ca_topic_score_gemma":0.000014468746,"teacher_disagreement_score":0.6821067,"about_ca_system_score_codex":0.000017734894,"about_ca_system_score_gemma":0.000041643794,"threshold_uncertainty_score":0.9999565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14572315,0.000562682,0.8509044,0.00082363375,0.0007268468,0.00018338395,0.00015436583,0.000585649,0.00033590852],"genre_scores_gemma":[0.84338593,0.0000075505245,0.15541662,0.0008836814,0.00027448437,0.000005178764,0.0000111669115,0.000014691388,7.04487e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753016,0.000089702306,0.00033832627,0.0009178897,0.0006781974,0.00044574405],"domain_scores_gemma":[0.99844307,0.00005403007,0.00011550207,0.0008140282,0.00023660756,0.00033673827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004012472,0.00031688059,0.00032239416,0.0001060238,0.00022520135,0.0007965158,0.0021335941,0.000116844065,0.000049296825],"category_scores_gemma":[0.00002274535,0.00028023683,0.00011569013,0.0005486275,0.00009136108,0.0007504802,0.0010047059,0.00046404006,0.000023002736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007158851,0.0015058707,0.0025052673,0.0004762014,0.00063225976,0.00048259468,0.06553309,0.0634734,0.04717427,0.6150761,0.03654695,0.16587806],"study_design_scores_gemma":[0.00076752173,0.00054921774,0.00054833794,0.00008809317,0.000008931019,0.000008557954,0.000061053564,0.9689315,0.01288392,0.0008407267,0.01482362,0.000488529],"about_ca_topic_score_codex":0.000012721573,"about_ca_topic_score_gemma":0.00000564402,"teacher_disagreement_score":0.9054581,"about_ca_system_score_codex":0.000048881342,"about_ca_system_score_gemma":0.000088643115,"threshold_uncertainty_score":0.99996495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38591623,0.000029582407,0.61158705,0.0014016454,0.00022625011,0.00034214396,0.000056305347,0.00014748817,0.00029329536],"genre_scores_gemma":[0.998244,0.00036596126,0.00025871536,0.00089100614,0.00014917021,0.000003922787,0.000048519567,0.00002343447,0.000015296218],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965893,0.000465813,0.0003157915,0.001631051,0.00030648918,0.00069157896],"domain_scores_gemma":[0.9976029,0.00030098303,0.00020824965,0.0015585256,0.00012305164,0.00020629002],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00079989916,0.00038141114,0.00037397753,0.0004347335,0.00037641483,0.00075271126,0.004972497,0.0002553034,0.000087862674],"category_scores_gemma":[0.000037621707,0.00038548358,0.00026458796,0.001452976,0.00014298364,0.0014498455,0.008955342,0.0017143013,0.000105362735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027663645,0.0011584491,0.39549467,0.002907471,0.0006829482,0.0066554868,0.07612103,0.08862875,0.0018954469,0.27861926,0.0028801183,0.14467975],"study_design_scores_gemma":[0.0009323141,0.000083187646,0.023062829,0.0004582119,0.000045786084,0.000008222679,0.0015764163,0.9315022,0.0028870413,0.037661925,0.0007074384,0.0010744147],"about_ca_topic_score_codex":0.0029620023,"about_ca_topic_score_gemma":0.00032622583,"teacher_disagreement_score":0.84287345,"about_ca_system_score_codex":0.00019272162,"about_ca_system_score_gemma":0.00018055069,"threshold_uncertainty_score":0.9998597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64740616,0.008892694,0.29877588,0.019533277,0.012861184,0.0016253619,0.0032681038,0.0005518014,0.0070855496],"genre_scores_gemma":[0.98520935,0.0032223053,0.009029565,0.000634236,0.0009887257,0.00017468237,0.0005548766,0.000044956054,0.00014131544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939679,0.00042543362,0.0009663394,0.0026193638,0.001340446,0.00068053446],"domain_scores_gemma":[0.99645853,0.00040226112,0.00052924204,0.0014222031,0.0005438363,0.0006439321],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000495181,0.0009917032,0.0009866315,0.00050650164,0.00036488657,0.0017383443,0.0022170278,0.00078573154,0.0010212179],"category_scores_gemma":[0.00015816772,0.00096363353,0.0003796361,0.00039186655,0.000353044,0.00019837239,0.002458555,0.0021770976,0.000025632582],"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.00021408142,0.0014245625,0.0017170681,0.00024835256,0.0007468686,0.00053532375,0.006473801,0.00012866461,0.002692554,0.8648847,0.008001801,0.11293226],"study_design_scores_gemma":[0.002359957,0.00041948765,0.0027866815,0.002736731,0.00014325422,0.00009803553,0.0013806951,0.7310589,0.0007543098,0.24463733,0.010994771,0.002629837],"about_ca_topic_score_codex":0.00034639947,"about_ca_topic_score_gemma":0.0001962895,"teacher_disagreement_score":0.73093027,"about_ca_system_score_codex":0.00009956101,"about_ca_system_score_gemma":0.0006328024,"threshold_uncertainty_score":0.999892},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57779944,0.0011638737,0.4054704,0.015095449,0.00032427366,0.00010112684,0.000007994994,0.000027727723,0.000009748823],"genre_scores_gemma":[0.9934587,0.00041586556,0.004749176,0.0012636754,0.000099277866,0.0000017249197,0.0000015555655,0.000008727652,0.0000013218431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976723,0.00013044929,0.00083200075,0.00035708997,0.00070720573,0.00030091297],"domain_scores_gemma":[0.9983696,0.000116154726,0.0006026565,0.00035692917,0.00017620473,0.0003784688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091095944,0.00017865583,0.00048187523,0.00020060263,0.00004002333,0.00011075427,0.0016201294,0.0001808258,0.000019104404],"category_scores_gemma":[0.00013719751,0.00013752685,0.0001844981,0.0005235119,0.00012800464,0.00046552572,0.00043531164,0.0010353833,4.0224566e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020539488,0.0015908119,0.056824874,0.0023470384,0.0020409683,0.0030659812,0.06418436,0.002374536,0.057813454,0.023876037,0.01668576,0.76714224],"study_design_scores_gemma":[0.0028691748,0.0011517553,0.0020845332,0.0015364034,0.00007760057,0.00034049523,0.00051727664,0.93348706,0.047912147,0.009059461,0.00036227805,0.0006018175],"about_ca_topic_score_codex":0.00050208025,"about_ca_topic_score_gemma":0.00008496354,"teacher_disagreement_score":0.9311125,"about_ca_system_score_codex":0.000028447246,"about_ca_system_score_gemma":0.00007306311,"threshold_uncertainty_score":0.5608182},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18557777,0.000037418864,0.8119324,0.0008187826,0.000116424526,0.0012987289,0.000031022533,0.00017548971,0.000011994983],"genre_scores_gemma":[0.6248606,0.0000015429644,0.3744414,0.00052461866,0.000078353565,0.00007120787,0.0000151384165,0.0000071516943,3.4970093e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644583,0.00010169926,0.00035841,0.0017361373,0.0006360085,0.00072189124],"domain_scores_gemma":[0.99724925,0.00051587267,0.00012260798,0.0015067012,0.00020150791,0.00040406233],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002987659,0.00022730132,0.00025772897,0.00032248718,0.0003333289,0.0006820563,0.0059109963,0.00006800397,0.0000024378803],"category_scores_gemma":[0.00063738343,0.00021768243,0.000036932564,0.0027172233,0.00032663514,0.001847769,0.0042889104,0.0002909489,0.000001388142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005345842,0.0021881969,0.13046765,0.0030068608,0.00004858136,0.00017299509,0.04523967,0.017803919,0.20401834,0.09113172,0.0012699385,0.50411755],"study_design_scores_gemma":[0.00055020954,0.00033891763,0.014938173,0.000059462865,0.0000030778986,0.0000059721765,0.000014962013,0.96646243,0.015746556,0.0015051235,0.00010340195,0.0002716911],"about_ca_topic_score_codex":0.000041428542,"about_ca_topic_score_gemma":0.000008931665,"teacher_disagreement_score":0.9486585,"about_ca_system_score_codex":0.000042389624,"about_ca_system_score_gemma":0.0003698611,"threshold_uncertainty_score":0.9994675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004823759,0.0012248034,0.9905936,0.0021905834,0.0006075505,0.00021961764,0.000021916332,0.00018473399,0.00013344528],"genre_scores_gemma":[0.3309938,0.00015923614,0.6677504,0.000593025,0.00044907935,0.0000123216105,0.0000060807115,0.000035721132,3.0067562e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772775,0.000042701635,0.00079497515,0.00037010346,0.0005451131,0.0005193431],"domain_scores_gemma":[0.9979027,0.00030182046,0.00041762317,0.00045617152,0.00042149375,0.00050019013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066826673,0.00032521607,0.0005254652,0.0008270681,0.00013073393,0.00026314243,0.0014154441,0.00013801089,0.000013157765],"category_scores_gemma":[0.00023973234,0.00029995898,0.0007933617,0.002677452,0.00006503729,0.0010211257,0.00008901729,0.0005121084,0.0000020910907],"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.00030885305,0.00026958308,0.002324585,0.000593802,0.0005939282,0.00012167391,0.00082155364,0.033173345,0.020327106,0.92660075,0.0076731755,0.007191649],"study_design_scores_gemma":[0.007941742,0.0032274842,0.0052264845,0.00063628325,0.00028958794,0.00019049934,0.00016409125,0.61032736,0.01129642,0.03495122,0.32367334,0.0020754728],"about_ca_topic_score_codex":0.0000026356377,"about_ca_topic_score_gemma":0.0000011490831,"teacher_disagreement_score":0.89164954,"about_ca_system_score_codex":0.000014050778,"about_ca_system_score_gemma":0.00009636386,"threshold_uncertainty_score":0.9999452},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018740462,0.0003019777,0.96148646,0.009381896,0.00045089374,0.00026746385,0.0004090614,0.0009649792,0.007996837],"genre_scores_gemma":[0.955646,0.000047118894,0.02954041,0.014403389,0.00015689124,0.0000033871902,0.00019119793,0.000007994966,0.0000036405002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866515,0.0000419344,0.00015272312,0.00064014865,0.0002871336,0.00021287944],"domain_scores_gemma":[0.9981238,0.00006153226,0.000038122245,0.0015616153,0.000029075605,0.000185819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011876113,0.00012897728,0.00012424104,0.00003733508,0.00008230074,0.00016971429,0.0023626918,0.0000525249,0.00013686092],"category_scores_gemma":[0.00004226698,0.000108256485,0.0000436672,0.00038977314,0.000029047167,0.0005313173,0.0009970439,0.00014937921,0.00024968872],"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.00006284088,0.0002857676,0.000548301,0.000049078844,0.00008281835,0.00028328146,0.0016883683,0.0001246867,0.00076066336,0.7688137,0.19909833,0.028202143],"study_design_scores_gemma":[0.00092638325,0.0006581357,0.0006732943,0.000027004498,0.000018813658,0.00005785386,0.000082468534,0.32138616,0.006552755,0.010717107,0.65801674,0.0008832864],"about_ca_topic_score_codex":0.000038138303,"about_ca_topic_score_gemma":0.0000333548,"teacher_disagreement_score":0.9369055,"about_ca_system_score_codex":0.0000069790817,"about_ca_system_score_gemma":0.000038991177,"threshold_uncertainty_score":0.44145712},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084950514,0.0001727535,0.9110476,0.00034602184,0.0006836284,0.0005540636,0.00014777058,0.00070019363,0.0013974657],"genre_scores_gemma":[0.78829026,0.00024714848,0.21064785,0.00019799337,0.00015080495,0.000034242577,0.0004004102,0.000019976007,0.000011313449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703324,0.00019909689,0.0004147457,0.0012359774,0.00066820165,0.0004487563],"domain_scores_gemma":[0.99766177,0.0001782998,0.00030825986,0.0013586222,0.00026414913,0.00022892073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031117542,0.000485802,0.00048671768,0.0003026946,0.00025774623,0.0003949609,0.0014853437,0.00035777595,0.00001533904],"category_scores_gemma":[0.000028255743,0.0003925655,0.00020130706,0.0007656979,0.00014071228,0.0005619818,0.0015931472,0.0009867185,0.00004329178],"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.0003966825,0.0034462758,0.04375095,0.0012233623,0.0007162551,0.0011709714,0.010739664,0.014207711,0.000044799173,0.81008625,0.074249744,0.03996735],"study_design_scores_gemma":[0.0024844445,0.0005151635,0.0895537,0.00030529586,0.00008885066,0.0005016946,0.00016401018,0.83101094,0.0002059679,0.06010744,0.012407527,0.0026549967],"about_ca_topic_score_codex":0.0010831442,"about_ca_topic_score_gemma":0.00046396878,"teacher_disagreement_score":0.8168032,"about_ca_system_score_codex":0.000053572876,"about_ca_system_score_gemma":0.00043466888,"threshold_uncertainty_score":0.9998526},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40928957,0.00023225749,0.575125,0.010351074,0.00026022928,0.00033160346,0.000049107584,0.00018876466,0.00417242],"genre_scores_gemma":[0.9879594,0.0000037401712,0.011464353,0.0005375438,0.000026215452,0.0000025500801,0.0000014030119,0.000003226306,0.0000016086293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886507,0.00012505057,0.0002158875,0.00033646554,0.0002803829,0.00017713106],"domain_scores_gemma":[0.99895674,0.000051728828,0.000080299054,0.00067546574,0.000060656384,0.00017513632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003035088,0.00009302956,0.00013530462,0.000038835733,0.00013228299,0.00018912823,0.0009402414,0.0000364748,0.000019612573],"category_scores_gemma":[0.00005761943,0.000057070676,0.00005514394,0.0006345909,0.000072843555,0.00024762194,0.0005178881,0.00008427118,0.0000031784746],"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.000008301396,0.000052069456,0.00040747397,0.000030852363,0.0000083940095,0.0000036666854,0.0012440666,0.000009914028,0.0012577636,0.99593,0.00032944154,0.0007180234],"study_design_scores_gemma":[0.0035413024,0.001612151,0.12969509,0.00016588795,0.00007536262,0.0001276182,0.0027648164,0.7090363,0.01873858,0.032730717,0.099945486,0.0015666842],"about_ca_topic_score_codex":0.000055607437,"about_ca_topic_score_gemma":0.000046679103,"teacher_disagreement_score":0.9631993,"about_ca_system_score_codex":0.00000576922,"about_ca_system_score_gemma":0.00005518894,"threshold_uncertainty_score":0.23272745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54655325,0.000068691224,0.44961208,0.0012678935,0.00047918086,0.0002363866,0.000016870394,0.00092177675,0.00084387773],"genre_scores_gemma":[0.99579465,0.00003443417,0.0037965155,0.00017053881,0.00006295793,0.00001985005,0.00010218355,0.000009152131,0.000009740292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986132,0.000068858535,0.00017733405,0.00041558698,0.00040781594,0.0003172177],"domain_scores_gemma":[0.99914235,0.00005640075,0.00007564494,0.00054791046,0.00007621769,0.00010149586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002936381,0.00014040916,0.00013165058,0.00018504771,0.00019146019,0.00016097259,0.000539484,0.00007467742,0.000023536191],"category_scores_gemma":[0.000010589669,0.00011761286,0.000057722264,0.0010961543,0.000038562666,0.00055373233,0.00015350227,0.00016781547,0.00042579684],"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.000060032296,0.00012404434,0.0029528642,0.000049097263,0.000036679998,0.000104765044,0.0017172459,0.00016776867,0.0027362462,0.9749993,0.0076644393,0.009387483],"study_design_scores_gemma":[0.0029812525,0.0012125651,0.13079092,0.00025168317,0.00006277568,0.0001509385,0.0011697114,0.5726221,0.006086654,0.19061968,0.09234092,0.0017108106],"about_ca_topic_score_codex":0.000060475297,"about_ca_topic_score_gemma":0.00012416879,"teacher_disagreement_score":0.78437966,"about_ca_system_score_codex":0.000023013285,"about_ca_system_score_gemma":0.00004234178,"threshold_uncertainty_score":0.5472899},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074839016,0.0003201331,0.97844785,0.008497151,0.0020569232,0.0019457804,0.0013498471,0.0009234989,0.005710425],"genre_scores_gemma":[0.009447147,0.00011818403,0.9867551,0.0015019315,0.0003963754,0.00072469213,0.0009815525,0.0000745991,4.2398855e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935016,0.00056429685,0.0010605992,0.0029914933,0.0005440807,0.0013379494],"domain_scores_gemma":[0.99389696,0.0012866043,0.00070707244,0.003247944,0.0002453634,0.00061602663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007073667,0.0010305298,0.0013931647,0.0007968191,0.00048043483,0.00043821722,0.004757605,0.0007412066,0.00009400403],"category_scores_gemma":[0.00038240585,0.0010618555,0.0014629348,0.0006811318,0.0007844579,0.00032245927,0.005684289,0.0021415474,0.00012587567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020166146,0.00019009605,0.00083894026,0.0002955799,0.00029737243,0.00007799313,0.00071069173,0.00039623817,0.00041845412,0.98486596,0.007350472,0.004356515],"study_design_scores_gemma":[0.001163174,0.00025273568,0.0019817378,0.00013650123,0.00009707226,0.00002366335,0.00005301435,0.059638023,0.0008225271,0.89532477,0.03947538,0.0010313835],"about_ca_topic_score_codex":0.00010991017,"about_ca_topic_score_gemma":0.0001593384,"teacher_disagreement_score":0.0895412,"about_ca_system_score_codex":0.00006220138,"about_ca_system_score_gemma":0.00061809045,"threshold_uncertainty_score":0.9991832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074896286,0.000044093897,0.98824334,0.0012303143,0.0010321421,0.00031667604,0.00032827683,0.00036942773,0.00094611244],"genre_scores_gemma":[0.99094135,0.00004551039,0.0082116155,0.00020086777,0.00017159294,0.000004560203,0.00029248974,0.000011373014,0.00012062602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983702,0.000050148275,0.00015528848,0.0010964244,0.0000750458,0.0002529338],"domain_scores_gemma":[0.99841046,0.00018111066,0.00016324925,0.0009067715,0.00015557386,0.00018281779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011379089,0.00022527591,0.00021870772,0.00018206074,0.0003335798,0.00022428465,0.0013383158,0.00021590038,0.000053277716],"category_scores_gemma":[0.000047341528,0.00027383654,0.00034742246,0.0005504281,0.00009798182,0.00047290145,0.0010522873,0.00045106563,0.00010647791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006340988,0.00012969469,0.0005934966,0.000059711965,0.00013378599,0.000027039065,0.00010448755,0.005889853,0.000055289627,0.9789631,0.013616927,0.00036322683],"study_design_scores_gemma":[0.00043201286,0.000060322516,0.0010191052,0.000023181934,0.00008841269,0.0000026018063,0.00006542285,0.28734416,0.000117018586,0.65171534,0.05868002,0.0004524166],"about_ca_topic_score_codex":0.00007199291,"about_ca_topic_score_gemma":0.000037804533,"teacher_disagreement_score":0.9834517,"about_ca_system_score_codex":0.00007621456,"about_ca_system_score_gemma":0.00018664739,"threshold_uncertainty_score":0.9999714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11580939,0.00025956848,0.87987196,0.0013211617,0.00014830627,0.0004804489,0.0018636613,0.00021698029,0.00002851175],"genre_scores_gemma":[0.997615,0.000049462382,0.0019557807,0.00009050625,0.000028377897,0.00006231983,0.00018525003,0.000011823589,0.0000014888193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975544,0.0002613152,0.00042093222,0.0007521297,0.0005074225,0.00050378963],"domain_scores_gemma":[0.99859524,0.00017892125,0.0000849424,0.0006608046,0.00009843089,0.00038168553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003174962,0.00030371308,0.00039877638,0.0001392412,0.00034370366,0.00037356795,0.0008428679,0.00013592339,0.000009839694],"category_scores_gemma":[0.000016697195,0.00025448902,0.000088989225,0.0012609849,0.00011328425,0.00039372031,0.00003087045,0.00048970914,0.000011202167],"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.00028585098,0.00045081825,0.0015618704,0.0001902654,0.00007492805,0.00007538408,0.0015948856,0.98890996,0.00016693995,0.0058705257,0.00056539004,0.0002531614],"study_design_scores_gemma":[0.0018374949,0.00033987436,0.0047377627,0.00013475431,0.00002677293,0.000030420058,0.0007437681,0.98972183,0.00032321812,0.00013491111,0.0014928826,0.0004763257],"about_ca_topic_score_codex":0.0005620381,"about_ca_topic_score_gemma":0.00009440525,"teacher_disagreement_score":0.8818056,"about_ca_system_score_codex":0.00006207119,"about_ca_system_score_gemma":0.000082123595,"threshold_uncertainty_score":0.99999076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010667448,0.00013091943,0.97594196,0.0049061775,0.000023727878,0.000097070406,0.000002483552,0.0001777456,0.008052474],"genre_scores_gemma":[0.41738462,0.00022008104,0.5799449,0.0024187688,0.000009537369,0.0000037604073,0.0000025678773,0.0000031250934,0.000012611477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932075,0.0000140447455,0.00009318088,0.00028213175,0.00013160094,0.00015828064],"domain_scores_gemma":[0.99945325,0.000012218716,0.000017050255,0.00036400568,0.000010961272,0.00014251402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006270111,0.00007028417,0.00007249886,0.000026442562,0.000059576007,0.00015347943,0.00077672553,0.000017371469,0.000028937686],"category_scores_gemma":[0.000010209325,0.00006191857,0.00002734879,0.0002127618,0.000014407198,0.0004472117,0.001485078,0.00004659448,0.00000977074],"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.0000071209092,0.000021167669,0.00040107104,0.000037811504,0.000015939442,0.000009341682,0.0012077269,0.000117750234,0.00009847616,0.97984457,0.010922325,0.007316682],"study_design_scores_gemma":[0.00037620342,0.000013707922,0.0007537851,0.0000047895805,0.0000055609953,0.000001083765,0.000030164027,0.9370383,0.00022073773,0.04754428,0.013897069,0.00011431473],"about_ca_topic_score_codex":0.0000071369445,"about_ca_topic_score_gemma":0.0000023381153,"teacher_disagreement_score":0.9369206,"about_ca_system_score_codex":0.000002844643,"about_ca_system_score_gemma":0.000005040046,"threshold_uncertainty_score":0.25249657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0648564,0.07750526,0.70091534,0.003091163,0.0052966746,0.00045373294,0.00007608539,0.0009813496,0.14682399],"genre_scores_gemma":[0.9805648,0.000005444123,0.01870456,0.00039957894,0.00007366795,0.0000064471956,0.000021239293,0.000004514276,0.00021975025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992249,0.000046940484,0.000085633365,0.00032807948,0.00015469476,0.00015972108],"domain_scores_gemma":[0.9993006,0.000050381303,0.000024407522,0.00048770386,0.000069676484,0.000067205554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007814081,0.00009117427,0.00008912086,0.000041059244,0.00010005067,0.00010404733,0.00040713765,0.00037579585,0.000042299325],"category_scores_gemma":[0.000058177393,0.00008373629,0.000065990025,0.0005039746,0.000026853,0.0003090956,0.00028571894,0.0010234909,0.00006307153],"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.0000029553617,0.00022196911,0.00022635063,0.0000114296645,0.000011660603,0.00007399008,0.0009639788,5.838632e-7,0.0031109164,0.9681352,0.023624312,0.0036166874],"study_design_scores_gemma":[0.0013272598,0.00015987482,0.010382325,0.00010326718,0.000017724964,0.00022493495,0.00015302499,0.0033640284,0.28013018,0.22642471,0.4768707,0.00084197376],"about_ca_topic_score_codex":6.130675e-7,"about_ca_topic_score_gemma":0.000002568003,"teacher_disagreement_score":0.9157084,"about_ca_system_score_codex":0.000018589975,"about_ca_system_score_gemma":0.00006962366,"threshold_uncertainty_score":0.4446616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9366094,0.00008381928,0.060983766,0.000898044,0.0001355431,0.00013554162,0.000010194841,0.00013186652,0.0010118646],"genre_scores_gemma":[0.99027646,0.000099404024,0.009539427,0.000041748273,0.00001203346,7.1659215e-8,0.000006803746,0.00000406651,0.000020016878],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99926895,0.0000493568,0.000052001924,0.00029121988,0.00017740406,0.00016105903],"domain_scores_gemma":[0.99933594,0.000036063495,0.000079973135,0.000397563,0.00007650463,0.000073935975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014736396,0.00009192766,0.00014167957,0.00015334607,0.0001344635,0.00005452035,0.00052575057,0.000070752394,0.000018284016],"category_scores_gemma":[0.0000048515085,0.000115164024,0.000050572227,0.0003999914,0.00008186556,0.00087041286,0.00034901447,0.00011262753,0.00012096471],"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.00023363574,0.0004907376,0.46640214,0.00032774967,0.00018623378,0.00023350291,0.003401842,0.00007176037,0.03198618,0.46022454,0.014051202,0.022390485],"study_design_scores_gemma":[0.0012838605,0.00027388654,0.965372,0.0000464135,0.000024406181,0.000023396222,0.0029614384,0.009719652,0.00045923758,0.0037969619,0.01569151,0.00034722482],"about_ca_topic_score_codex":0.0005739504,"about_ca_topic_score_gemma":0.010193601,"teacher_disagreement_score":0.49896985,"about_ca_system_score_codex":0.000018276372,"about_ca_system_score_gemma":0.000026039384,"threshold_uncertainty_score":0.5688269},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028580608,0.00012581235,0.99032813,0.006929735,0.00005126607,0.0004909176,0.00006331162,0.00030207922,0.0014229508],"genre_scores_gemma":[0.89247084,0.000038333987,0.101458296,0.005250734,0.0002701251,0.00035184974,0.00012374485,0.000009149107,0.000026936632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991497,0.000015506483,0.00016321843,0.0003805596,0.00012190037,0.00016914093],"domain_scores_gemma":[0.99928105,0.00007501874,0.000048042926,0.00036878616,0.00007905211,0.00014806834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007972859,0.000097283286,0.00011195948,0.000039890514,0.00016429917,0.00012492952,0.00060474244,0.00005180397,0.00005195614],"category_scores_gemma":[0.000012689094,0.00008562268,0.00009206576,0.00039192123,0.000028535505,0.00047876214,0.00012396913,0.00006715451,0.00009055822],"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.000006973479,0.00004383166,0.00010895746,0.000022346834,0.000009807886,5.255219e-7,0.0003330416,0.0000010131283,0.0006396312,0.9520288,0.025935752,0.020869322],"study_design_scores_gemma":[0.00073658704,0.00017180905,0.00038892278,0.000007333196,0.000012244378,0.000005642114,0.00010537909,0.028835125,0.008746222,0.04940125,0.911275,0.0003144822],"about_ca_topic_score_codex":0.0000075230046,"about_ca_topic_score_gemma":0.000014844722,"teacher_disagreement_score":0.9026275,"about_ca_system_score_codex":0.0000073591304,"about_ca_system_score_gemma":0.000027891128,"threshold_uncertainty_score":0.34915915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034533344,0.0014437977,0.69416237,0.0013516826,0.00040380124,0.0001180335,0.000042821433,0.00019936034,0.26774475],"genre_scores_gemma":[0.98607916,0.0000115492,0.013652638,0.000044077813,0.000010558496,7.8334983e-7,0.0000057839834,0.0000016587855,0.00019381844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948674,0.000046272806,0.00011002511,0.00018403675,0.000073471696,0.000099431265],"domain_scores_gemma":[0.99928355,0.000116922696,0.000027285249,0.00038047376,0.0001445847,0.000047204143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008226024,0.000051224673,0.00010436045,0.000051696614,0.00004775912,0.000041846357,0.00031228122,0.000023218518,0.00011245505],"category_scores_gemma":[0.000031225303,0.000044345623,0.00006201682,0.0008366357,0.00003914352,0.00017291683,0.00011633404,0.00004687016,0.000025750882],"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.0000056645613,0.00048344783,0.0030372315,0.00001866374,0.000040295,0.000008396284,0.0023053598,0.0000032317694,0.009716537,0.9378547,0.041932378,0.0045941113],"study_design_scores_gemma":[0.0005356746,0.0001056204,0.0634665,0.000026380718,0.000011146071,0.000025180367,0.00028650445,0.010265379,0.7770453,0.11069727,0.037234772,0.00030026885],"about_ca_topic_score_codex":0.00002586422,"about_ca_topic_score_gemma":0.00005320186,"teacher_disagreement_score":0.9515458,"about_ca_system_score_codex":0.000009835016,"about_ca_system_score_gemma":0.00012782878,"threshold_uncertainty_score":0.1808362},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7050989,0.0039175632,0.2855007,0.0026346822,0.0023909784,0.00015837885,0.00008082568,0.00009207724,0.00012587199],"genre_scores_gemma":[0.97850126,0.00012599883,0.020969706,0.00023310946,0.00011647446,0.0000014820911,0.000021659856,0.000009282586,0.000021043174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794674,0.00022054347,0.0006513036,0.0004740168,0.00038900517,0.0003183888],"domain_scores_gemma":[0.99816644,0.00013485608,0.00035618318,0.0009112897,0.00024033197,0.00019091455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010109998,0.00017132633,0.00036903884,0.00022201276,0.00008533809,0.0003735766,0.0019205171,0.00010672885,0.000011281071],"category_scores_gemma":[0.00010455903,0.00016023648,0.000091499336,0.00044820068,0.000053167594,0.0015156955,0.0009180144,0.0006077585,0.0000022654392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001676503,0.0036808422,0.082175925,0.008849685,0.0017621983,0.02043197,0.103845954,0.00017845801,0.024946904,0.13299467,0.20327647,0.41618043],"study_design_scores_gemma":[0.014340934,0.0018520417,0.042356346,0.018242864,0.00024879276,0.04650921,0.007835547,0.7791507,0.027975831,0.017514031,0.04088673,0.003086921],"about_ca_topic_score_codex":0.0005899343,"about_ca_topic_score_gemma":0.00028455295,"teacher_disagreement_score":0.77897227,"about_ca_system_score_codex":0.00007306941,"about_ca_system_score_gemma":0.0002174416,"threshold_uncertainty_score":0.6534254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012342179,0.000087341155,0.98541206,0.0014453337,0.0001095245,0.000398442,0.00002786262,0.00008495906,0.000092277834],"genre_scores_gemma":[0.025673226,0.000022504662,0.97304785,0.00087706564,0.00006504385,0.00012470265,0.00017824295,0.000006697335,0.000004658396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985603,0.000024416213,0.00040974087,0.00015079434,0.00062053185,0.00023423367],"domain_scores_gemma":[0.998206,0.00091483933,0.00013845488,0.00036015955,0.00018966998,0.00019087821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043507738,0.00014125677,0.00015941175,0.000048221074,0.00034625744,0.0003027919,0.0005620128,0.00009746153,0.00001843837],"category_scores_gemma":[0.0002978078,0.00009025493,0.000031822106,0.0003642949,0.00009708371,0.00071504957,0.00050448626,0.00020783684,0.000006028111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034825614,0.0005788117,0.003224812,0.0012134777,0.00024768003,0.00006907768,0.06870404,0.00027033847,0.000010970648,0.025178384,0.02931315,0.8711544],"study_design_scores_gemma":[0.0010837038,0.00006242002,0.0020227311,0.00013722343,0.000014224478,0.00012819728,0.00092759804,0.9496767,0.00035347216,0.0012026344,0.044194464,0.00019665912],"about_ca_topic_score_codex":0.000002317134,"about_ca_topic_score_gemma":0.000008713968,"teacher_disagreement_score":0.9494063,"about_ca_system_score_codex":0.00001661436,"about_ca_system_score_gemma":0.00030724352,"threshold_uncertainty_score":0.36804894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8943652,0.000070884904,0.09716742,0.0076122335,0.00010724335,0.00012849532,0.00010700774,0.00019742156,0.00024413262],"genre_scores_gemma":[0.91042453,0.000043035016,0.0883034,0.00047598567,0.000054119813,1.3238953e-7,0.00004476592,0.000008439718,0.00064560794],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906033,0.000044508375,0.00006858911,0.0003666598,0.00023952944,0.00022037678],"domain_scores_gemma":[0.9991368,0.000026482701,0.00006884215,0.00050357066,0.00005441413,0.0002098602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010161475,0.00010558019,0.00016093478,0.000102016995,0.00015653209,0.00003295725,0.0009993938,0.00004340035,0.000076989876],"category_scores_gemma":[0.000012617998,0.00011882211,0.000103277016,0.0005383375,0.00010588258,0.0002834438,0.00071336626,0.00012013851,0.00011721363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002608101,0.0011078545,0.0050272564,0.0004434442,0.00022484917,0.0010364117,0.6092495,0.0021001948,0.033352874,0.27513912,0.052086484,0.019971212],"study_design_scores_gemma":[0.0084579885,0.0018847446,0.024941051,0.0002546266,0.0002522178,0.00006172968,0.104800515,0.77289903,0.014212385,0.0026787142,0.06669686,0.0028601277],"about_ca_topic_score_codex":0.004543268,"about_ca_topic_score_gemma":0.0010937201,"teacher_disagreement_score":0.77079886,"about_ca_system_score_codex":0.0000120602845,"about_ca_system_score_gemma":0.00003473591,"threshold_uncertainty_score":0.68680924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12135514,0.0003945386,0.85409486,0.00027795,0.0005403337,0.00008689734,0.0000032601622,0.00019468223,0.023052353],"genre_scores_gemma":[0.9890731,0.000026456904,0.010438485,0.0002582063,0.00012241746,0.0000050277663,0.000009054608,0.000002370151,0.000064913635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99933237,0.000026921956,0.000093659895,0.00017949652,0.00014655165,0.00022097274],"domain_scores_gemma":[0.9994877,0.00005017214,0.000024633358,0.00028581437,0.000029343639,0.0001223444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029440917,0.00007100077,0.00006602822,0.0000674431,0.0001171134,0.000083159575,0.00015884223,0.00003992192,0.00023632948],"category_scores_gemma":[0.000017097434,0.000061049555,0.000027454631,0.00022668972,0.000022489628,0.0012966194,0.00013283313,0.00006484221,0.00008217802],"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.0000023949976,0.00007084546,0.032759737,0.0000071380764,0.000007960967,5.7066944e-7,0.00017616274,7.739232e-7,0.001306132,0.95108014,0.006078603,0.008509547],"study_design_scores_gemma":[0.00083006796,0.00008823342,0.87180334,0.000011477523,0.000014187599,0.000109371154,0.000063581625,0.0034879234,0.0027736814,0.051937923,0.0684319,0.00044830778],"about_ca_topic_score_codex":0.000027384163,"about_ca_topic_score_gemma":0.00000765862,"teacher_disagreement_score":0.8991422,"about_ca_system_score_codex":0.000008792723,"about_ca_system_score_gemma":0.000013070249,"threshold_uncertainty_score":0.2587642},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11223183,0.00007887783,0.88118887,0.00042090664,0.00033906027,0.00016812669,0.000017065968,0.00013076085,0.0054244944],"genre_scores_gemma":[0.47628075,0.00007241219,0.523316,0.00021374776,0.000045873672,0.000035538364,0.00002935815,0.000005772909,5.0372887e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986302,0.00015533065,0.00025207043,0.0005291325,0.00016839588,0.0002648305],"domain_scores_gemma":[0.9989968,0.00016912876,0.0001166035,0.00052365253,0.00006448443,0.0001293269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283044,0.00015264846,0.00016398344,0.000207702,0.0002728637,0.000042167958,0.00038605125,0.00008571344,0.00018858313],"category_scores_gemma":[0.000063535386,0.00014619286,0.00006896436,0.00023669803,0.00027011608,0.0003753572,0.00051526295,0.00020154627,0.00009733579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009129299,0.000091701084,0.005540758,0.000008469823,0.000020702213,0.000012616025,0.0026019318,0.0000014008964,0.0033950263,0.98302746,0.0006618635,0.0045468076],"study_design_scores_gemma":[0.00026020617,0.00008807445,0.29903328,0.0000084363155,0.0000075865564,0.000029664978,0.00010310328,0.0007682487,0.00062647276,0.69771326,0.0012282804,0.0001333477],"about_ca_topic_score_codex":0.00007334626,"about_ca_topic_score_gemma":0.00018218864,"teacher_disagreement_score":0.36404893,"about_ca_system_score_codex":0.000018144223,"about_ca_system_score_gemma":0.000054999146,"threshold_uncertainty_score":0.5961572},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1662154,0.00022842667,0.8161249,0.014830148,0.00021880743,0.000477971,0.000045571356,0.00044905508,0.0014097091],"genre_scores_gemma":[0.96288615,0.000004231082,0.03280895,0.004206875,0.00005497702,0.000014052283,0.000017093125,0.000006734967,9.4193086e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979491,0.00019965007,0.00031898828,0.0007058109,0.00044296106,0.00038348837],"domain_scores_gemma":[0.99849063,0.00026114637,0.00007586537,0.0008796872,0.00005182797,0.00024086794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034625584,0.00018991862,0.00023818578,0.00013140852,0.00012082408,0.00016107391,0.0016581325,0.00008032489,0.000042085263],"category_scores_gemma":[0.0001524483,0.00016894363,0.00009556436,0.0012303878,0.000039680996,0.00020257218,0.00061182317,0.00032140556,0.000010571393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013198757,0.003493485,0.32501236,0.0021409967,0.000060723414,0.00048205064,0.026262827,0.18361992,0.0003298636,0.38781425,0.022685703,0.046777956],"study_design_scores_gemma":[0.00056859857,0.000119402444,0.08239723,0.000058853133,0.0000015081927,3.4647942e-7,0.000033262557,0.913765,0.0001265064,0.000996623,0.001729396,0.00020326176],"about_ca_topic_score_codex":0.00033494958,"about_ca_topic_score_gemma":0.00037857037,"teacher_disagreement_score":0.79667073,"about_ca_system_score_codex":0.00003867511,"about_ca_system_score_gemma":0.000085584135,"threshold_uncertainty_score":0.6889321},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059624992,0.000042259206,0.91711354,0.013054093,0.0004654008,0.00031687343,0.00004089066,0.00045527323,0.008886704],"genre_scores_gemma":[0.76176304,0.0000066663447,0.23538984,0.0024945664,0.00013846708,0.000014392949,0.000049667073,0.0000061421215,0.00013724083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902064,0.000022658547,0.00008468677,0.0004676581,0.00019151189,0.00021282551],"domain_scores_gemma":[0.99783534,0.000059526345,0.000020732332,0.0019151679,0.000031018488,0.00013820005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117653595,0.00010369228,0.000086389955,0.000106897714,0.000085971034,0.000662133,0.0022350952,0.000027987544,0.000104553386],"category_scores_gemma":[0.00005721036,0.00007759667,0.000024364972,0.00035889176,0.00001332971,0.0014512489,0.0012449326,0.00008558145,0.0003223891],"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.000005043967,0.00014453029,0.0015357425,0.000014668727,0.000021937312,0.000009227701,0.00039856698,0.000007938064,0.002607988,0.58954895,0.17420897,0.23149647],"study_design_scores_gemma":[0.0012110249,0.0005668232,0.12528543,0.00009642062,0.000015750182,0.000035355773,0.00020003418,0.23169635,0.013164157,0.09998263,0.52584577,0.0019002818],"about_ca_topic_score_codex":0.00031340044,"about_ca_topic_score_gemma":0.00007281473,"teacher_disagreement_score":0.702138,"about_ca_system_score_codex":0.000004699233,"about_ca_system_score_gemma":0.0000090112,"threshold_uncertainty_score":0.63849634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029430289,0.00046974907,0.96474046,0.0019009664,0.00011421979,0.00063759804,0.000030989828,0.00018969261,0.0024860143],"genre_scores_gemma":[0.9161871,0.0003553765,0.081737265,0.00061861606,0.000020335281,0.00013436467,0.00094006024,0.000004266141,0.000002580223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988966,0.0000953991,0.0003321655,0.0002916291,0.00024967684,0.00013454625],"domain_scores_gemma":[0.99798506,0.00006587934,0.00016962018,0.0013656716,0.00030265225,0.00011113252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003641781,0.00016760605,0.00016126377,0.00019717476,0.0001452423,0.0006578895,0.00093963195,0.00019613944,0.000024390727],"category_scores_gemma":[0.00006502855,0.00017484365,0.00005133461,0.00040770575,0.000022955175,0.0013149112,0.002244303,0.00029767177,0.00003751507],"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.0000021862409,0.000020908956,0.000057986126,0.00009973603,0.000009933637,1.0977223e-7,0.006215224,0.0003550813,0.00006255978,0.9801602,0.0002681471,0.012747964],"study_design_scores_gemma":[0.00048404612,0.000057506742,0.013101632,0.000301729,0.000047989608,0.000019773075,0.00090617116,0.57683176,0.0028177146,0.37903884,0.025206976,0.0011858251],"about_ca_topic_score_codex":0.00007093486,"about_ca_topic_score_gemma":0.00005240806,"teacher_disagreement_score":0.88675684,"about_ca_system_score_codex":0.000029796855,"about_ca_system_score_gemma":0.00007024638,"threshold_uncertainty_score":0.7129917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031788427,0.000074004216,0.9621436,0.0028198604,0.000038639148,0.00015487602,0.000005740993,0.00029691306,0.0026779252],"genre_scores_gemma":[0.79569685,0.000031802763,0.20353252,0.00068581064,0.000017254994,0.000007329846,0.000011877088,0.0000053156728,0.000011235622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887484,0.000032041542,0.00011946922,0.00039331632,0.00031628995,0.00026404756],"domain_scores_gemma":[0.9992333,0.00004940866,0.000036739097,0.00042682473,0.000056627145,0.00019711081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001351235,0.000107108426,0.000113753274,0.00014824282,0.000095285,0.00016422427,0.0007818579,0.000035325585,0.000064653126],"category_scores_gemma":[0.000033221088,0.000081741266,0.000050294726,0.0019538407,0.000034078836,0.0008180537,0.00033985122,0.00013789698,0.00014990426],"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.000058775404,0.000101322614,0.0013095835,0.00006198625,0.000032663615,0.000026559366,0.0011699644,0.00005518161,0.0013759616,0.9642601,0.0023058227,0.029242093],"study_design_scores_gemma":[0.0013598818,0.0017234349,0.008358862,0.000023712335,0.00001849628,0.000043574517,0.00016674002,0.9306709,0.0016940077,0.023686327,0.031609584,0.0006444368],"about_ca_topic_score_codex":0.00003341293,"about_ca_topic_score_gemma":0.000012500051,"teacher_disagreement_score":0.94057375,"about_ca_system_score_codex":0.000016819728,"about_ca_system_score_gemma":0.000047651265,"threshold_uncertainty_score":0.3333312},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20084421,0.00006371827,0.7976562,0.0002633771,0.00049229123,0.0002689557,0.000022049933,0.00033162415,0.000057576548],"genre_scores_gemma":[0.9194152,0.00001653868,0.080257855,0.00014335982,0.00011214611,0.00001743006,0.000007554384,0.000016881317,0.000013037945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985153,0.00006714354,0.0002330569,0.00062068546,0.00021575361,0.0003480682],"domain_scores_gemma":[0.9988777,0.00024760462,0.00009755472,0.0004966487,0.0001629222,0.00011759146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021674974,0.00020243347,0.00020793108,0.00013244645,0.0007634221,0.00031203614,0.00025052932,0.000086316955,0.000004404435],"category_scores_gemma":[0.0000111595255,0.0001982649,0.00009140478,0.0006959132,0.000053400872,0.00033899784,0.000011634646,0.0002878495,0.0000029435012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015968243,0.005553991,0.0028244595,0.0026511373,0.0026201387,0.00050482235,0.118891634,0.26598507,0.023232719,0.15958425,0.003490912,0.41306403],"study_design_scores_gemma":[0.007900536,0.0015370663,0.0006468758,0.000867622,0.00030061367,0.00064075063,0.0030753065,0.79931647,0.1617717,0.00847014,0.013565228,0.0019077129],"about_ca_topic_score_codex":0.000025881895,"about_ca_topic_score_gemma":0.0001323157,"teacher_disagreement_score":0.718571,"about_ca_system_score_codex":0.000048045484,"about_ca_system_score_gemma":0.00009663784,"threshold_uncertainty_score":0.8085008},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6799049,0.00006890628,0.31922317,0.00006777524,0.00013537766,0.00017028915,0.000027114354,0.00007645514,0.00032605228],"genre_scores_gemma":[0.99783987,0.0012150764,0.0007286963,0.000049608818,0.000023648867,0.0000011081938,0.00009900879,0.000008385996,0.000034593402],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978774,0.00026024602,0.00015886611,0.0011943673,0.00012235138,0.00038672102],"domain_scores_gemma":[0.99851614,0.00008887604,0.000074674586,0.0010196991,0.00013082426,0.00016975935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039651763,0.00021949963,0.0002619759,0.0005172039,0.00011224361,0.0005399202,0.0017072975,0.00024346636,0.000079822705],"category_scores_gemma":[0.000017420012,0.0002715665,0.00009771487,0.0011522827,0.00009199289,0.0011869915,0.0057837158,0.00077285845,0.000007676915],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007360223,0.0005620745,0.63161385,0.00080780586,0.00013666207,0.0024770233,0.0029811806,0.031739395,0.0001844866,0.32363504,0.00010251565,0.0056863464],"study_design_scores_gemma":[0.0012516553,0.00007249447,0.3255145,0.00046913972,0.000035503377,0.00001611951,0.00057524623,0.6112212,0.00052058493,0.05912995,0.00020133861,0.0009922828],"about_ca_topic_score_codex":0.0025690414,"about_ca_topic_score_gemma":0.0012349163,"teacher_disagreement_score":0.5794818,"about_ca_system_score_codex":0.00010007583,"about_ca_system_score_gemma":0.00019129245,"threshold_uncertainty_score":0.99997365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012674035,0.00004273241,0.99174786,0.005233198,0.00009057213,0.00025337384,0.00008023372,0.0002719834,0.0010126283],"genre_scores_gemma":[0.88117117,0.000004839127,0.11458045,0.00410794,0.00008473393,0.000025431375,0.00001008461,0.0000053343756,0.000010038064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904984,0.000016918531,0.00015678626,0.000388897,0.00014921786,0.00023832673],"domain_scores_gemma":[0.9992847,0.00010145673,0.00004300983,0.0003361288,0.000063441876,0.0001713042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013260124,0.00010790133,0.00015181662,0.00003866779,0.00012630284,0.0003707141,0.0011606774,0.00004755137,0.0000122888005],"category_scores_gemma":[0.000056630262,0.00009598144,0.00010208389,0.00027713153,0.00002114606,0.0011160618,0.0002726686,0.000086044856,0.0000074399222],"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.000029300914,0.000057947367,0.00058424217,0.000037692946,0.000025746836,0.0000030164938,0.0007353169,0.0010849702,0.0002654547,0.9614235,0.009357496,0.02639532],"study_design_scores_gemma":[0.0005786995,0.000041441916,0.00012185529,0.0000027814924,0.0000075538346,5.878883e-7,0.000015551033,0.96666735,0.0003086608,0.029370978,0.0027521204,0.00013241082],"about_ca_topic_score_codex":0.000023435558,"about_ca_topic_score_gemma":0.00002010743,"teacher_disagreement_score":0.9655824,"about_ca_system_score_codex":0.00000564593,"about_ca_system_score_gemma":0.00004541007,"threshold_uncertainty_score":0.39140096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09999055,0.000078337005,0.89742225,0.0008252899,0.0010467811,0.00013268765,0.000024568139,0.00019412886,0.00028542292],"genre_scores_gemma":[0.9323755,0.000053084186,0.067066945,0.00032397083,0.00011250694,0.0000062318513,0.000027527745,0.000018257793,0.000015982043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975834,0.000105061226,0.0004473869,0.00106862,0.00032734044,0.00046822752],"domain_scores_gemma":[0.9977875,0.000120130724,0.00010084761,0.0018416818,0.000068044195,0.00008182386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053675775,0.00022545789,0.00026888057,0.00038133946,0.00025517284,0.00042372383,0.0023783168,0.00009786301,0.000024152192],"category_scores_gemma":[0.000010663261,0.00023852834,0.000056550267,0.0022877003,0.000040073468,0.0011870828,0.0001672401,0.0007231154,0.0000041216767],"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.00014953414,0.0030052774,0.058438264,0.00064752763,0.00031694493,0.0015660906,0.0075771012,0.4347789,0.000597184,0.10271492,0.00075197074,0.38945627],"study_design_scores_gemma":[0.0023712986,0.00006955935,0.020235326,0.0010774642,0.000035132824,0.0001199326,0.00021542654,0.9506043,0.007825732,0.0044147884,0.011964161,0.0010668588],"about_ca_topic_score_codex":0.00021164994,"about_ca_topic_score_gemma":0.002298622,"teacher_disagreement_score":0.83238494,"about_ca_system_score_codex":0.00007288071,"about_ca_system_score_gemma":0.00011668981,"threshold_uncertainty_score":0.97269034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009305341,0.00015238435,0.92199856,0.001696787,0.0055094557,0.00052006333,0.059346266,0.0003294586,0.0011417024],"genre_scores_gemma":[0.88267344,0.00026663687,0.088737816,0.00038806204,0.00042539387,0.00017236768,0.027075037,0.000053478747,0.00020776235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777645,0.00004046359,0.00040622434,0.00079138763,0.0007075346,0.00027795066],"domain_scores_gemma":[0.99667764,0.00016436403,0.000178054,0.0027799788,0.000120238525,0.00007975599],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006246251,0.00021613331,0.00024163528,0.00028582243,0.00014363095,0.00018520064,0.0074553043,0.0000416046,0.00068307074],"category_scores_gemma":[0.0002270119,0.00023844573,0.000058991736,0.0003786502,0.00005584682,0.0019411332,0.0040615816,0.00030474996,0.000005812994],"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.0001031219,0.00016347838,0.00010128234,0.000057818183,0.00015051462,0.000012033123,0.00025595602,0.0017518186,0.0052815136,0.95980906,0.03046584,0.0018475864],"study_design_scores_gemma":[0.0005947634,0.00025750892,0.00047550874,0.000044520228,0.000017917599,0.000023298997,0.00013504874,0.7305693,0.0011173134,0.0037577674,0.26260483,0.00040220722],"about_ca_topic_score_codex":0.000082097584,"about_ca_topic_score_gemma":0.000046542897,"teacher_disagreement_score":0.9560513,"about_ca_system_score_codex":0.00005417794,"about_ca_system_score_gemma":0.00015906879,"threshold_uncertainty_score":0.99791485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032053563,0.00017534038,0.95578337,0.0005763512,0.0009247577,0.040488005,0.00002081343,0.00022024561,0.0018078985],"genre_scores_gemma":[0.0004776311,0.0000041096323,0.98232555,0.0011578951,0.001106187,0.014343561,0.0000138391615,0.000054860433,0.0005163632],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952038,0.000046409292,0.0006883699,0.002352485,0.0007952267,0.0009137184],"domain_scores_gemma":[0.9957955,0.0006892944,0.00034484468,0.002401475,0.00038819673,0.00038067484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009317667,0.00071762543,0.00070771895,0.0008351697,0.00037746245,0.0009926232,0.00535861,0.00042987085,0.00004425945],"category_scores_gemma":[0.00019416015,0.0006569903,0.00035410028,0.0011077669,0.0005122872,0.00034233602,0.002666671,0.00079158874,0.000023905732],"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.000023623374,0.0001456048,0.000023369148,0.00029152,0.000024597442,0.00005862548,0.0020515472,0.0014337555,0.000080591766,0.2463493,0.0012326435,0.7482848],"study_design_scores_gemma":[0.0013106111,0.000363246,0.000015957483,0.001074594,0.000011088394,0.00007165308,1.9263254e-7,0.2252165,0.0015496479,0.65430236,0.11495687,0.001127289],"about_ca_topic_score_codex":0.00002470984,"about_ca_topic_score_gemma":0.00015668834,"teacher_disagreement_score":0.7471575,"about_ca_system_score_codex":0.00018599912,"about_ca_system_score_gemma":0.002100874,"threshold_uncertainty_score":0.99958813},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39740357,0.00017118968,0.6014043,0.00028739343,0.00029668765,0.00012184904,0.0000667757,0.0001538909,0.000094333096],"genre_scores_gemma":[0.9608773,0.000050972656,0.038434584,0.00052459433,0.000050677987,0.000002627307,0.00004206194,0.000014297963,0.0000028766283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737865,0.0002326883,0.00036122283,0.0010249272,0.0005322801,0.00047022698],"domain_scores_gemma":[0.9971147,0.00041028447,0.00008931968,0.002088512,0.00010810916,0.00018904799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006532285,0.00024038443,0.00025170084,0.00017599107,0.00070288876,0.00060713635,0.0019337777,0.000083647545,0.000051053],"category_scores_gemma":[0.000005803593,0.00025198318,0.0000725443,0.0008724393,0.00004318327,0.000664896,0.00035666293,0.00044163558,0.000011808916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029632912,0.0040562693,0.009204893,0.0036398077,0.0014651547,0.0008466502,0.07342182,0.34226346,0.044844992,0.026955683,0.00043343296,0.4925715],"study_design_scores_gemma":[0.00066334696,0.000048791997,0.0034542351,0.00024141463,0.000027997923,0.000049196555,0.0007279149,0.9895982,0.003999341,0.00012809884,0.0007425863,0.00031884512],"about_ca_topic_score_codex":0.00023922433,"about_ca_topic_score_gemma":0.000170385,"teacher_disagreement_score":0.64733475,"about_ca_system_score_codex":0.000041417647,"about_ca_system_score_gemma":0.000073827345,"threshold_uncertainty_score":0.99999326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14207172,0.000106817155,0.85537314,0.0006806426,0.0012300793,0.0003117634,0.000041039144,0.000114276736,0.00007049085],"genre_scores_gemma":[0.97880507,0.000025717623,0.020201515,0.0006356132,0.00020424818,0.00008644319,0.00002790622,0.000007886817,0.000005599585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900156,0.00003912926,0.00018259151,0.00038831637,0.00016940596,0.000219],"domain_scores_gemma":[0.99896324,0.00005458151,0.00007412088,0.0005933562,0.00024525996,0.000069431684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011838988,0.00011446804,0.00011750665,0.00009492841,0.00016488225,0.0005858723,0.0010298302,0.000062821025,0.0000316996],"category_scores_gemma":[0.000102604325,0.000105388855,0.00009879486,0.0004648544,0.000026034391,0.001145417,0.0003078092,0.00014593168,0.0000070565416],"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.00014560766,0.0004682971,0.002050008,0.00042170065,0.00014991492,0.00006480779,0.0035331617,0.00039336729,0.052466128,0.46583623,0.013317901,0.46115288],"study_design_scores_gemma":[0.00056943,0.00020017568,0.020630678,0.00005011965,0.000018953742,0.00006907295,0.00005443954,0.015749175,0.48673877,0.42314938,0.05225796,0.000511852],"about_ca_topic_score_codex":0.00007471594,"about_ca_topic_score_gemma":0.000040689913,"teacher_disagreement_score":0.83673334,"about_ca_system_score_codex":0.000017718638,"about_ca_system_score_gemma":0.00009811621,"threshold_uncertainty_score":0.564958},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21146993,0.00012381609,0.7863866,0.00001537672,0.00014682993,0.00046915878,0.00011183573,0.00006539131,0.001211036],"genre_scores_gemma":[0.99549514,0.000080250116,0.004327421,0.000017035054,0.000012490985,0.0000023978992,0.000021844871,0.000009398245,0.000033995682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983503,0.000095638374,0.00027473803,0.00091865764,0.0001208546,0.0002397984],"domain_scores_gemma":[0.9969244,0.00013354943,0.00039161486,0.001868287,0.0005169231,0.00016522314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002168762,0.00025751375,0.0005120657,0.00042183357,0.00008678656,0.000032112606,0.0019522456,0.0001914849,0.000008124556],"category_scores_gemma":[0.000008553588,0.00026668762,0.00019984126,0.0013794946,0.00029824788,0.000241615,0.0019407184,0.00029909165,0.0000420892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008102752,0.00037952457,0.011981623,0.000600391,0.00012395847,0.000019942292,0.0003781283,0.012029251,0.000053855503,0.97369826,0.00022041964,0.00043363814],"study_design_scores_gemma":[0.0059408,0.0020494745,0.10486926,0.002821021,0.0019522115,0.00007117818,0.0035338223,0.3265376,0.012221853,0.520691,0.013375517,0.005936291],"about_ca_topic_score_codex":0.00039170435,"about_ca_topic_score_gemma":0.00017927028,"teacher_disagreement_score":0.78402525,"about_ca_system_score_codex":0.00005593715,"about_ca_system_score_gemma":0.00036660148,"threshold_uncertainty_score":0.99997854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37496564,0.000029667375,0.6225028,0.0014135404,0.00023786009,0.0003419896,0.000059235765,0.00014439202,0.00030487432],"genre_scores_gemma":[0.9981549,0.00040593315,0.00029792357,0.00090120715,0.00014954188,0.0000037787852,0.00004908649,0.000023180743,0.000014466658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663013,0.00045535722,0.0003156855,0.0016107032,0.0003061182,0.0006820123],"domain_scores_gemma":[0.9975975,0.00030479155,0.00020897285,0.0015570674,0.00012628084,0.00020539621],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008114917,0.00037763402,0.00037048032,0.00043191348,0.00037525612,0.0007588612,0.004972488,0.00025785848,0.00008437748],"category_scores_gemma":[0.000039531842,0.00038357096,0.0002625527,0.0014510779,0.00014328817,0.0014293558,0.008971784,0.0017390725,0.00009588105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002576582,0.0010949012,0.34669387,0.0027939547,0.00064434076,0.0061433027,0.06987569,0.09096973,0.0016821752,0.35552928,0.002902177,0.12141292],"study_design_scores_gemma":[0.0008822887,0.00007956483,0.02052838,0.00043228237,0.00004389487,0.00000768244,0.0014826669,0.93002474,0.0028439208,0.041937932,0.0007029401,0.0010337156],"about_ca_topic_score_codex":0.0026557152,"about_ca_topic_score_gemma":0.0002945568,"teacher_disagreement_score":0.839055,"about_ca_system_score_codex":0.00019873267,"about_ca_system_score_gemma":0.00018454099,"threshold_uncertainty_score":0.9998616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032740023,0.0002450206,0.9546544,0.0019414221,0.0000732867,0.008340284,0.000012911912,0.00028065452,0.0017119771],"genre_scores_gemma":[0.966703,0.00006690586,0.03196368,0.00063010375,0.00003640725,0.00048605588,0.000106381456,0.0000064217356,0.0000010758965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984604,0.00037735334,0.00039132388,0.00025646816,0.00025060461,0.0002638449],"domain_scores_gemma":[0.9978828,0.0002029192,0.00025897467,0.0012765547,0.0002540171,0.00012477343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007638034,0.00016276629,0.00019941718,0.00007238705,0.00055224594,0.0005593313,0.00078066194,0.00012865028,0.000010179393],"category_scores_gemma":[0.00004639642,0.00015056228,0.000046119363,0.0008789851,0.00014691427,0.0005606062,0.00097014935,0.00046346267,0.000003832475],"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.00018827037,0.00027001917,0.00056555885,0.00007662328,0.000052802985,0.00000827322,0.0037130227,0.007750943,0.000029857332,0.97531116,0.0002593089,0.011774172],"study_design_scores_gemma":[0.0018922949,0.00013314461,0.004515429,0.0002068203,0.000018436136,0.00008738358,0.00018589503,0.9568694,0.00022375095,0.01470375,0.020726534,0.00043711017],"about_ca_topic_score_codex":0.000021207015,"about_ca_topic_score_gemma":0.000023470118,"teacher_disagreement_score":0.9606074,"about_ca_system_score_codex":0.000023661361,"about_ca_system_score_gemma":0.000095782074,"threshold_uncertainty_score":0.61397517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2403313,0.0013012335,0.7549143,0.001368548,0.0019044856,0.000076896686,0.000010514074,0.000033830216,0.00005892686],"genre_scores_gemma":[0.8867607,0.00013197768,0.11242429,0.00042190848,0.00023470754,0.0000032252685,0.000006092939,0.00000657799,0.000010535989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989976,0.000057333957,0.0003156376,0.00022190096,0.00021365416,0.00019381529],"domain_scores_gemma":[0.99901515,0.000079732636,0.00033121769,0.00023345063,0.00021740462,0.00012304417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565323,0.000095380805,0.0001717618,0.00008929637,0.00011708985,0.00033546597,0.00048692417,0.00005258831,0.0000046064133],"category_scores_gemma":[0.000016833947,0.00009119011,0.000088991066,0.0001586574,0.000026141402,0.00078730343,0.00006358719,0.00022566476,7.634309e-7],"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.0010204106,0.0024420412,0.080133125,0.009246517,0.0010847836,0.00021612749,0.09746424,0.00091260136,0.18833092,0.29929426,0.040239092,0.27961588],"study_design_scores_gemma":[0.0044642473,0.0014034652,0.009787139,0.00391609,0.00006840285,0.00085717713,0.0023954252,0.46030903,0.39237675,0.064058736,0.059423894,0.00093963963],"about_ca_topic_score_codex":0.000075048076,"about_ca_topic_score_gemma":0.000006847921,"teacher_disagreement_score":0.64642936,"about_ca_system_score_codex":0.00003353216,"about_ca_system_score_gemma":0.00012968165,"threshold_uncertainty_score":0.37186247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020581001,0.00095238164,0.9532508,0.024534483,0.00048049778,0.00014812316,0.000037322916,0.000011693524,0.0000036886038],"genre_scores_gemma":[0.750176,0.0013434315,0.22928599,0.018777106,0.0003573031,0.000004799509,0.00004676422,0.000007118946,0.0000014624277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760395,0.00010538332,0.001431343,0.000075760225,0.00050093426,0.00028265387],"domain_scores_gemma":[0.9976691,0.00024408821,0.001188031,0.00024526744,0.00029243252,0.00036107362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003325594,0.00010055094,0.00034643314,0.00020969135,0.00019158669,0.000085198735,0.00048645664,0.00006847228,0.0000051405304],"category_scores_gemma":[0.00007266028,0.00006201815,0.00010562815,0.0005517661,0.00014644292,0.00037353026,0.00005201699,0.00024919957,5.4755833e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011352503,0.0012933975,0.00032280557,0.0027398618,0.00012030655,0.000005783039,0.031180779,0.00022612941,0.00007548516,0.0714998,0.02431628,0.8681058],"study_design_scores_gemma":[0.0028088172,0.0033915332,0.004180182,0.00065646897,0.00001914747,0.00018877872,0.0012642819,0.92208385,0.00046077135,0.005439922,0.059316244,0.00019000737],"about_ca_topic_score_codex":0.00007686864,"about_ca_topic_score_gemma":0.000004986104,"teacher_disagreement_score":0.9218577,"about_ca_system_score_codex":0.000063495994,"about_ca_system_score_gemma":0.0015656528,"threshold_uncertainty_score":0.2777401},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018714357,0.0008220724,0.9902273,0.00077989907,0.00096873345,0.0009385949,0.00007914599,0.0001285051,0.0041843294],"genre_scores_gemma":[0.8715224,0.000081100254,0.12631735,0.0016195779,0.0003495199,0.000038729664,0.000018087187,0.000041392024,0.000011807914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934911,0.00013476245,0.0008579586,0.0025295413,0.0019441533,0.0010424863],"domain_scores_gemma":[0.9955854,0.0007039591,0.00050803507,0.0025520197,0.00044805204,0.00020257784],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024300956,0.00091864186,0.0010389969,0.0009587293,0.00047136814,0.001435481,0.0059360596,0.0004899896,0.000012248958],"category_scores_gemma":[0.00010312964,0.0007227721,0.00035343153,0.0014432264,0.0007866975,0.0018199325,0.0025885943,0.0027966134,0.0000098018845],"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.00027230434,0.00044019264,0.0025902956,0.00046013258,0.00015690977,0.0013736526,0.07777041,0.11184709,0.00020753135,0.72103566,0.00037791886,0.08346793],"study_design_scores_gemma":[0.0004972147,0.0002342408,0.000118647295,0.0015309701,0.000016672033,0.000106414285,0.000016925462,0.7784066,0.00031445615,0.21731745,0.0005377204,0.00090268196],"about_ca_topic_score_codex":0.00008471193,"about_ca_topic_score_gemma":0.0010779129,"teacher_disagreement_score":0.869651,"about_ca_system_score_codex":0.00044398077,"about_ca_system_score_gemma":0.00096715044,"threshold_uncertainty_score":0.9996011},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43877956,0.00014672439,0.55967855,0.0005441912,0.0003267504,0.00015594532,0.0000187309,0.00020294929,0.00014658419],"genre_scores_gemma":[0.96208453,0.000014551858,0.037129454,0.0006820829,0.000050661733,0.000010631805,0.000007034141,0.00001829902,0.0000027457388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973906,0.00027619608,0.00043177666,0.0008549677,0.00049207814,0.0005543513],"domain_scores_gemma":[0.9979769,0.00033329404,0.00013137673,0.0012032749,0.00017735023,0.00017778133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004013696,0.00028361453,0.0003376928,0.00030845744,0.0004251545,0.0002670167,0.001125031,0.00012450204,0.00002414373],"category_scores_gemma":[0.0000040682758,0.00027793756,0.00013539898,0.0019389543,0.000035095425,0.00033345635,0.000044581688,0.0006212007,0.000011551987],"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.0004245633,0.0041485135,0.02426812,0.0029763859,0.0002751267,0.0010615551,0.043942623,0.7548437,0.0021206976,0.005905862,0.00004924746,0.1599836],"study_design_scores_gemma":[0.0014454111,0.00013821649,0.025249787,0.0006757336,0.000020050205,0.00006127238,0.0009864435,0.9666557,0.0036668612,0.0003514417,0.00020416162,0.00054493535],"about_ca_topic_score_codex":0.0010031973,"about_ca_topic_score_gemma":0.013251312,"teacher_disagreement_score":0.52330494,"about_ca_system_score_codex":0.000088974586,"about_ca_system_score_gemma":0.0001446289,"threshold_uncertainty_score":0.9999673},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029275074,0.0009361482,0.9839897,0.00070643204,0.0024828634,0.0003665614,0.000029635268,0.000320722,0.011138657],"genre_scores_gemma":[0.10500715,0.00033988274,0.8899618,0.0036521219,0.0007675125,0.00004626129,0.000090167756,0.00008093909,0.00005416038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99464285,0.000065042455,0.0006017675,0.00214384,0.0016042716,0.00094221893],"domain_scores_gemma":[0.99637234,0.00050940487,0.00028176428,0.0023696343,0.00016155075,0.00030528425],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010193045,0.00067033735,0.0006740385,0.0016742938,0.0006763125,0.000721835,0.0063188067,0.00028588905,0.00031649522],"category_scores_gemma":[0.000032086373,0.00063625205,0.0003491202,0.0020494047,0.0009350506,0.0010631658,0.0037680855,0.0016362843,0.0000541662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009071682,0.00008143305,0.00012202552,0.000028288485,0.000017576755,0.00020829003,0.00042995845,0.0044820732,0.000027149199,0.839187,0.00023565775,0.15517142],"study_design_scores_gemma":[0.0003136548,0.00027158708,0.00013822732,0.000052964817,0.000011448701,0.00015259458,1.9349389e-7,0.08603103,0.00016613754,0.8513582,0.060492877,0.001011109],"about_ca_topic_score_codex":0.00008255914,"about_ca_topic_score_gemma":0.000052865926,"teacher_disagreement_score":0.15416032,"about_ca_system_score_codex":0.0002443862,"about_ca_system_score_gemma":0.00050413125,"threshold_uncertainty_score":0.9996089},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088586356,0.0007371425,0.99578905,0.00042365724,0.0010109907,0.00024454054,0.000050631545,0.00016292626,0.0006951786],"genre_scores_gemma":[0.3476062,0.00016326772,0.65058416,0.0012608919,0.00025365077,0.000008778332,0.00008420844,0.000027962105,0.000010882898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660957,0.000051745417,0.0004527432,0.001579293,0.00082082,0.00048581779],"domain_scores_gemma":[0.9978755,0.0003224907,0.00024530574,0.0012222724,0.00017014281,0.00016427014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007647018,0.00045646465,0.0004423515,0.00071705726,0.0003394732,0.0010041033,0.0017635713,0.0002959812,0.000029787032],"category_scores_gemma":[0.000049570426,0.00046528605,0.00012071451,0.00077101204,0.0005383188,0.0009881078,0.0015005372,0.00066741183,0.0000054246852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020360952,0.000086820255,0.00022981159,0.00022188219,0.00002260632,0.00028656027,0.00070557254,0.006445875,0.0023402593,0.43642232,0.000015446652,0.5532025],"study_design_scores_gemma":[0.00051348953,0.00021660964,0.0005948042,0.00067335356,0.000013804696,0.00010317123,3.949919e-7,0.83932775,0.0009504014,0.15499121,0.001711423,0.00090359367],"about_ca_topic_score_codex":0.000017958771,"about_ca_topic_score_gemma":0.0004910837,"teacher_disagreement_score":0.83288187,"about_ca_system_score_codex":0.00014829363,"about_ca_system_score_gemma":0.00026803874,"threshold_uncertainty_score":0.9997799},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10178438,0.00006738436,0.8907453,0.00093717437,0.00043163772,0.000052897296,0.000010592976,0.00004525904,0.005925391],"genre_scores_gemma":[0.99584067,0.0000094195775,0.0034700455,0.00063507824,0.000019262305,0.0000014727972,0.0000016638182,0.0000014028899,0.000020968047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951583,0.000035383317,0.000091546186,0.0001417878,0.00012317713,0.00009228211],"domain_scores_gemma":[0.99929154,0.000045877292,0.00002845828,0.00057222205,0.000038510585,0.000023384378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086779626,0.00004035818,0.000055194232,0.000016376094,0.000049071623,0.000046717156,0.00049610547,0.000018672014,0.000063064144],"category_scores_gemma":[0.000019028419,0.00002673304,0.000070182876,0.0003372766,0.000021542959,0.00018010619,0.00041431093,0.000057353216,0.00000821459],"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.0000014038084,0.0002262895,0.06414956,0.000057736554,0.000022022346,0.000026262589,0.0011737811,0.000009572746,0.010453329,0.75517344,0.007068969,0.16163763],"study_design_scores_gemma":[0.00049804884,0.000019079816,0.12958351,0.00013162622,0.0000105636955,0.000046000125,0.00028489946,0.008287819,0.8021855,0.032225177,0.02636545,0.0003623775],"about_ca_topic_score_codex":0.00004313941,"about_ca_topic_score_gemma":0.00010564783,"teacher_disagreement_score":0.8940563,"about_ca_system_score_codex":0.0000034973345,"about_ca_system_score_gemma":0.000034375247,"threshold_uncertainty_score":0.109014176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005296695,0.0011334132,0.9933697,0.00060610555,0.0016100273,0.00039544725,0.00004998238,0.00030533838,0.0020003256],"genre_scores_gemma":[0.06417779,0.000112229114,0.93305415,0.0014109736,0.0009822533,0.00002453558,0.000108999426,0.000050639628,0.00007843149],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504715,0.000043491073,0.00055145216,0.0025254074,0.0011070783,0.00072544446],"domain_scores_gemma":[0.9961709,0.0004747341,0.00031631597,0.0025431623,0.00025943585,0.00023545322],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005233744,0.0005968834,0.00061731896,0.00066627044,0.0003341873,0.0015536798,0.0053013265,0.00042214777,0.00012199496],"category_scores_gemma":[0.00011518218,0.0005723634,0.00020179026,0.0011466043,0.00051313866,0.0010954638,0.0037582456,0.0012667777,0.000036620306],"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.000015533957,0.00009639558,0.0006409908,0.00011133753,0.00007442673,0.0008825042,0.002149569,0.0021776222,0.0006626489,0.20962705,0.0000539492,0.783508],"study_design_scores_gemma":[0.0004028137,0.00011980745,0.00076290587,0.0010257706,0.0000206285,0.0000649225,4.4607262e-7,0.28438184,0.0020918772,0.70321524,0.006569925,0.0013437951],"about_ca_topic_score_codex":0.00016575665,"about_ca_topic_score_gemma":0.00050975924,"teacher_disagreement_score":0.78216416,"about_ca_system_score_codex":0.00013922738,"about_ca_system_score_gemma":0.00044168442,"threshold_uncertainty_score":0.9996728},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015269336,0.0007927599,0.9755897,0.00077784614,0.00045403748,0.00089649664,0.00534181,0.00064809364,0.00022992239],"genre_scores_gemma":[0.9738946,0.000054072294,0.018261919,0.00021694478,0.0003543709,0.00006143463,0.007139396,0.000015261061,0.0000019868473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968153,0.00018711462,0.00071444426,0.0009830133,0.00044414555,0.000855943],"domain_scores_gemma":[0.9976674,0.0002777031,0.00033412993,0.0010954943,0.00025589368,0.00036939335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007589296,0.0004494727,0.00058540486,0.00008872246,0.0007958045,0.00060459366,0.00095398806,0.00016036032,0.0000021820777],"category_scores_gemma":[0.00006177524,0.00044220156,0.00020035503,0.0007928858,0.00008402498,0.0014688494,0.00059882825,0.00025699445,0.0000022611687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002509715,0.0003252923,0.003001473,0.00052043214,0.00010157492,0.000023164941,0.0015607524,0.05322176,0.0002209797,0.87972206,0.060352508,0.0006990249],"study_design_scores_gemma":[0.0014749959,0.00010704083,0.0009264954,0.00017822941,0.000057882422,0.00002864864,0.00011228353,0.96678746,0.00005352515,0.024696685,0.005059358,0.0005174012],"about_ca_topic_score_codex":0.00008970177,"about_ca_topic_score_gemma":0.00008126771,"teacher_disagreement_score":0.95862526,"about_ca_system_score_codex":0.000104089035,"about_ca_system_score_gemma":0.00009790736,"threshold_uncertainty_score":0.99980295},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9232805,0.013367385,0.061208434,0.0005850286,0.0003177107,0.0004906573,0.00041355842,0.00013856751,0.00019817383],"genre_scores_gemma":[0.99364775,0.00003480692,0.005720616,0.0003960238,0.00005525158,0.000037862937,0.000049478025,0.00002014083,0.00003805361],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790287,0.000070992784,0.0004560852,0.00089321233,0.00018062936,0.00049621455],"domain_scores_gemma":[0.99858546,0.0001585916,0.00019009464,0.0004986048,0.0003628183,0.0002044123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004942805,0.00030384952,0.0004331663,0.00014268867,0.00045216383,0.0007373329,0.0004104019,0.0001539504,0.0000060726766],"category_scores_gemma":[0.00005828565,0.0002675654,0.00011537802,0.00041799297,0.00012656252,0.00014918842,0.00030343773,0.00013407556,0.0000038067963],"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.00016107359,0.0004693624,0.0028291533,0.00422136,0.00023968569,0.00014683571,0.012856507,0.00001960965,0.8482122,0.11936748,0.0035057568,0.007971002],"study_design_scores_gemma":[0.008523596,0.0010271526,0.0044700406,0.002593574,0.0002124003,0.0051002554,0.018271666,0.02345757,0.19912244,0.0033685537,0.7303297,0.0035230354],"about_ca_topic_score_codex":0.00005768119,"about_ca_topic_score_gemma":0.00009606765,"teacher_disagreement_score":0.726824,"about_ca_system_score_codex":0.000018732368,"about_ca_system_score_gemma":0.00013919942,"threshold_uncertainty_score":0.99997765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010070864,0.000338219,0.9783247,0.00093754166,0.001063779,0.00015432782,0.008849569,0.000198034,0.00006296048],"genre_scores_gemma":[0.97756404,0.0001657501,0.019411866,0.001093712,0.000119781755,0.000010868186,0.0015960562,0.000022985443,0.000014946217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976444,0.00013322399,0.00025220492,0.0012355617,0.0004198329,0.0003147761],"domain_scores_gemma":[0.9934558,0.00021535835,0.00006179743,0.006027484,0.000057749436,0.00018180643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039782087,0.00022077844,0.0002153528,0.00017231535,0.0003072637,0.0003160151,0.0024226645,0.00011392585,0.00005897815],"category_scores_gemma":[0.000020354224,0.0002126214,0.000058461992,0.00079031783,0.000114532086,0.0006330253,0.00011861057,0.00035902258,0.000028213293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065087236,0.008391512,0.0009699792,0.0007196152,0.00088482734,0.0010845484,0.0035918946,0.01353427,0.0062691164,0.01200194,0.07826928,0.87363213],"study_design_scores_gemma":[0.0038359086,0.00014166413,0.0023538885,0.00019246037,0.00020543432,0.0000981932,0.00012917981,0.84361696,0.008072784,0.00041452853,0.13984743,0.0010915959],"about_ca_topic_score_codex":0.00013502793,"about_ca_topic_score_gemma":0.0007201346,"teacher_disagreement_score":0.9674932,"about_ca_system_score_codex":0.000016943506,"about_ca_system_score_gemma":0.00018222295,"threshold_uncertainty_score":0.86704487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012455845,0.0003381481,0.979706,0.0013950148,0.00008002416,0.00048665056,0.00003061592,0.00016052435,0.0053471825],"genre_scores_gemma":[0.67842716,0.000010792349,0.32029366,0.0007127929,0.00010059981,0.0002472804,0.000023289937,0.0000089188225,0.00017549445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989102,0.000027591861,0.00017039978,0.0005021046,0.00013410141,0.0002556206],"domain_scores_gemma":[0.99893486,0.00019953845,0.00004435787,0.000596888,0.000101242564,0.00012311111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025548693,0.00012068862,0.00013873236,0.000066091736,0.00025234415,0.00021750852,0.0003867479,0.00006101461,0.000025994454],"category_scores_gemma":[0.00002958434,0.0001154619,0.00007197287,0.0004268845,0.00003794577,0.00012725261,0.00026136622,0.00009371323,0.0000063964167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073668466,0.00020707787,0.00081158645,0.00011002455,0.00003659524,0.000012208742,0.0011687985,0.000024646526,0.0025252593,0.93511796,0.0021889093,0.057789553],"study_design_scores_gemma":[0.0030491194,0.0003079689,0.0029902244,0.00006726574,0.0000952584,0.00035856492,0.0010712263,0.1627279,0.05292538,0.6011951,0.1734708,0.0017411977],"about_ca_topic_score_codex":0.000024823863,"about_ca_topic_score_gemma":0.00017717737,"teacher_disagreement_score":0.66597134,"about_ca_system_score_codex":0.000009592248,"about_ca_system_score_gemma":0.000080486876,"threshold_uncertainty_score":0.47083998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003423324,0.00077823515,0.99135756,0.0010436435,0.0008708247,0.004275187,0.000023291923,0.00011941878,0.0014976126],"genre_scores_gemma":[0.13105765,0.0010848243,0.85480225,0.0042504673,0.0023054485,0.0045045987,0.00012403732,0.00027613423,0.0015945886],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957299,0.000100825106,0.000720113,0.0014649406,0.0012485264,0.0007356779],"domain_scores_gemma":[0.9955526,0.0005587385,0.00047623858,0.0026931907,0.0005568614,0.000162396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015258257,0.00050574343,0.0005824696,0.00044457716,0.00049227354,0.00084842596,0.0053741974,0.00028753796,0.000024073726],"category_scores_gemma":[0.00018865852,0.00030033715,0.00022885899,0.0013019267,0.0014002203,0.0005582078,0.002633378,0.0008458025,0.000012281436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022311615,0.00012700258,0.00007158467,0.00025568137,0.000035839006,0.00009949111,0.0020253314,0.00018288394,0.0003525962,0.21933126,0.00020691048,0.7772891],"study_design_scores_gemma":[0.00079950155,0.000658024,0.00035299532,0.002658111,0.000028207132,0.00012905298,0.0000015239779,0.33855534,0.006485191,0.5246057,0.124098055,0.0016283413],"about_ca_topic_score_codex":0.000033398734,"about_ca_topic_score_gemma":0.00010949712,"teacher_disagreement_score":0.77566075,"about_ca_system_score_codex":0.000088261535,"about_ca_system_score_gemma":0.0006566304,"threshold_uncertainty_score":0.99994487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015136967,0.0002788058,0.96663594,0.0010658882,0.00012336258,0.00009286949,0.000040894363,0.00045885795,0.016166393],"genre_scores_gemma":[0.52776396,0.00011805456,0.46664652,0.0030681903,0.000092674636,0.00003136215,0.0018484729,0.00002345726,0.000407298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985615,0.000093171955,0.00019233309,0.0005312816,0.00028292177,0.0003387989],"domain_scores_gemma":[0.9988879,0.000051183426,0.000054047512,0.00074058893,0.00012244371,0.00014386057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023486324,0.00015222527,0.00017170928,0.00005368184,0.00022511734,0.000358405,0.0007939171,0.00006997868,0.0002351842],"category_scores_gemma":[0.00007739096,0.00014029969,0.00007992214,0.001420877,0.000021758793,0.0005790904,0.0007807753,0.00028524833,0.00011394826],"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.000013363256,0.0003450201,0.0024331005,0.000062917825,0.00005242183,0.00008460583,0.00054085936,0.0004356372,0.001944099,0.98935926,0.0018629543,0.0028657452],"study_design_scores_gemma":[0.0015855506,0.00014961038,0.003911735,0.000032723565,0.000025661797,0.00017903854,0.00035827712,0.56934774,0.01095776,0.044678103,0.36784944,0.0009243669],"about_ca_topic_score_codex":0.00019093146,"about_ca_topic_score_gemma":0.000038654143,"teacher_disagreement_score":0.94468117,"about_ca_system_score_codex":0.000016049047,"about_ca_system_score_gemma":0.000093505,"threshold_uncertainty_score":0.5721255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08602423,0.00016026167,0.91081345,0.0017854107,0.0003291917,0.0003436877,0.0003398524,0.0001394363,0.00006448625],"genre_scores_gemma":[0.7611329,0.00011595458,0.2359669,0.0004403155,0.00017042995,0.0000095934165,0.0021528925,0.000009863661,0.0000011705273],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769396,0.00015934589,0.00038934473,0.0012130982,0.0003145645,0.00022966474],"domain_scores_gemma":[0.9972087,0.000098648175,0.00018558466,0.0023271774,0.00007096492,0.00010891558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006578058,0.00023015073,0.00029111185,0.00033525788,0.00006818388,0.0004661107,0.0022554293,0.00021210301,0.00001424524],"category_scores_gemma":[0.00016853484,0.00022882718,0.000051376996,0.000803263,0.00004451597,0.0012176739,0.008005222,0.00047630182,0.0000032372325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032308724,0.0018587031,0.6137996,0.004544091,0.00054588116,0.00033732166,0.004440451,0.010788715,0.017286604,0.15100168,0.0227713,0.1723026],"study_design_scores_gemma":[0.00036371924,0.000015616712,0.032262944,0.00009034783,0.000019378473,0.0000013565475,0.0000074240074,0.9506727,0.0001433831,0.013588084,0.0025579426,0.00027711494],"about_ca_topic_score_codex":0.00061693223,"about_ca_topic_score_gemma":0.00034503138,"teacher_disagreement_score":0.93988395,"about_ca_system_score_codex":0.00003760579,"about_ca_system_score_gemma":0.00029182225,"threshold_uncertainty_score":0.9977937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21815628,0.011260657,0.7676869,0.001057812,0.00007985583,0.0015004344,0.000029186624,0.00017191598,0.00005695532],"genre_scores_gemma":[0.97508,0.000057973393,0.023564955,0.00024059531,0.000051927123,0.000924851,0.0000519611,0.00001719608,0.000010518228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836177,0.000046030964,0.00030940314,0.00057882385,0.00014906331,0.0005549103],"domain_scores_gemma":[0.99864894,0.0005580348,0.00012477342,0.00041045973,0.00018086309,0.00007690147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056563906,0.00016581411,0.00024271787,0.00021469804,0.00019773032,0.00023829263,0.00037679594,0.00013997476,7.013027e-7],"category_scores_gemma":[0.00031374005,0.00017672282,0.00007922916,0.0009787094,0.000031067713,0.0001582999,0.000053572603,0.00019073543,2.6810227e-7],"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.0004948463,0.0009246311,0.0074244975,0.0065695453,0.0001371885,0.000010563067,0.0027848382,0.00391816,0.010874615,0.8999187,0.000945446,0.065997005],"study_design_scores_gemma":[0.005353052,0.00077668246,0.0008734323,0.00052865205,0.00005972351,0.000044385124,0.0005080674,0.8570273,0.030253598,0.025851704,0.07775017,0.00097322057],"about_ca_topic_score_codex":0.000014994157,"about_ca_topic_score_gemma":0.000337874,"teacher_disagreement_score":0.87406695,"about_ca_system_score_codex":0.00004666917,"about_ca_system_score_gemma":0.0003383406,"threshold_uncertainty_score":0.7206548},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31540224,0.045764066,0.6278592,0.00052001677,0.00042985877,0.00039280325,0.00018461779,0.00039745469,0.009049809],"genre_scores_gemma":[0.9905523,0.0042514484,0.0049547716,0.000103902334,0.000012458018,0.0000057437546,0.000114685135,0.000003735732,9.4699016e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998347,0.0007839944,0.00029610706,0.0002474666,0.00017295498,0.00015249057],"domain_scores_gemma":[0.9975773,0.00036422064,0.00016217314,0.001530164,0.00028940523,0.00007674742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011316669,0.00009951965,0.00020259363,0.000042370648,0.00019904607,0.00017123777,0.00097236334,0.0001035908,0.000015341957],"category_scores_gemma":[0.000056260866,0.000109384564,0.000057166748,0.00076231326,0.000048915525,0.0008069343,0.0009893179,0.00024065618,0.00000221613],"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.000006175594,0.00020737144,0.0098195365,0.000045300858,0.000046240457,0.000002151702,0.0011842792,0.00003323806,0.0000036980327,0.9849776,0.00038223306,0.0032921643],"study_design_scores_gemma":[0.0012174629,0.00009051616,0.26230982,0.0002246334,0.00004817013,0.000060626673,0.0004097575,0.47728062,0.00025949487,0.25040695,0.0070212507,0.0006707057],"about_ca_topic_score_codex":0.00024934646,"about_ca_topic_score_gemma":0.004437988,"teacher_disagreement_score":0.7345707,"about_ca_system_score_codex":0.000011227568,"about_ca_system_score_gemma":0.000058061876,"threshold_uncertainty_score":0.44605732},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42273805,0.0025380254,0.47630647,0.056474276,0.0038491688,0.001642356,0.00006532018,0.024560152,0.011826184],"genre_scores_gemma":[0.9246989,0.00047856636,0.07426761,0.00027146933,0.00006678382,0.00012972517,0.000022691453,0.00002766009,0.00003661189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970475,0.000025705687,0.00058604835,0.0012059498,0.00046058936,0.000674205],"domain_scores_gemma":[0.9979596,0.0001485909,0.0003636586,0.0010331601,0.00041345958,0.00008153719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007365309,0.00039384578,0.00043351814,0.0005031975,0.00038565026,0.0009332193,0.0024491178,0.0003412437,0.000014639973],"category_scores_gemma":[0.0016160064,0.0003769086,0.00013397574,0.0019020366,0.000111291316,0.0015742502,0.0024652593,0.0005259401,0.000049130624],"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.000026558853,0.0003709151,0.0030687738,0.00038344634,0.000099217774,0.000029332861,0.0016504972,0.0000048175266,0.035804067,0.8364393,0.030338097,0.091784984],"study_design_scores_gemma":[0.00071388594,0.00038009635,0.0005900044,0.0005969584,0.000034849127,0.00015541958,0.0030152996,0.0040861852,0.6140738,0.10182017,0.273387,0.001146293],"about_ca_topic_score_codex":0.000018787692,"about_ca_topic_score_gemma":0.000004383284,"teacher_disagreement_score":0.73461914,"about_ca_system_score_codex":0.00014319355,"about_ca_system_score_gemma":0.00009383918,"threshold_uncertainty_score":0.9998683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0707729,0.0001160639,0.91938883,0.0016296663,0.00095512863,0.0011993229,0.0009670513,0.00032135428,0.004649652],"genre_scores_gemma":[0.59673315,0.00007522549,0.3926626,0.0076608295,0.0001689274,0.00036554842,0.0021925473,0.000049197417,0.00009195467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763113,0.000053640906,0.00085559423,0.00036980872,0.0004147868,0.0006750374],"domain_scores_gemma":[0.9966883,0.00050573115,0.00029977778,0.0018106177,0.0004436698,0.0002518734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007565152,0.00032024021,0.0003573875,0.00028199947,0.00074318395,0.00074746006,0.0016353648,0.00018080632,0.000016354157],"category_scores_gemma":[0.00036052876,0.00032351472,0.0003394889,0.0006661611,0.00006892243,0.0019783815,0.0008129596,0.00034513496,0.00008770667],"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.0002273076,0.00083097955,0.00130426,0.0007276642,0.0002341912,0.0000068658696,0.02092843,0.00027549738,0.00020118192,0.8910442,0.041229747,0.042989664],"study_design_scores_gemma":[0.0073913317,0.0010282468,0.0020137841,0.00080457894,0.000089031426,0.00009757612,0.0033728532,0.12858945,0.007028653,0.071507215,0.77617145,0.0019058133],"about_ca_topic_score_codex":0.000013214592,"about_ca_topic_score_gemma":0.000036235495,"teacher_disagreement_score":0.819537,"about_ca_system_score_codex":0.00009858317,"about_ca_system_score_gemma":0.0001388984,"threshold_uncertainty_score":0.9999217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058954846,0.0009681454,0.9394362,0.000080796446,0.0000476714,0.00022157429,0.000061291736,0.00006124137,0.00016820848],"genre_scores_gemma":[0.84880704,0.00011506272,0.15016155,0.000031109175,0.000022648224,0.000006680761,0.00085108174,0.000003940171,8.797298e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985428,0.00017501622,0.0002169875,0.0007366078,0.0002250736,0.00010351225],"domain_scores_gemma":[0.99871296,0.00009518675,0.000098046614,0.00088587013,0.00015091021,0.00005705149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009109895,0.00011886998,0.00018069439,0.0001092922,0.0000717809,0.00033755886,0.0007574302,0.00011827479,0.0000035757703],"category_scores_gemma":[0.000025984782,0.00011391427,0.000018458299,0.00021980413,0.00014696582,0.0004750166,0.0047426578,0.00021969136,2.7241845e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030870568,0.00016892028,0.0011983182,0.0014099731,0.00006856906,0.0000044548315,0.0035445024,0.00018080759,0.002500845,0.4128339,0.00007108557,0.57798773],"study_design_scores_gemma":[0.0002564928,0.000023501489,0.008461604,0.000096891374,0.000032834694,0.000016994998,0.00032494037,0.9251381,0.0012026194,0.06412268,0.0000747536,0.00024858705],"about_ca_topic_score_codex":0.00017502351,"about_ca_topic_score_gemma":0.000033090877,"teacher_disagreement_score":0.9249573,"about_ca_system_score_codex":0.0000055128094,"about_ca_system_score_gemma":0.0001486443,"threshold_uncertainty_score":0.59113836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000971642,0.00008917221,0.99571884,0.00077344745,0.00033118483,0.00029152798,0.000012211976,0.00031325035,0.0014987527],"genre_scores_gemma":[0.3366479,0.000001103755,0.6622255,0.0009055523,0.00011671406,0.0000086629625,0.00008990994,0.000002929764,0.000001749736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877983,0.00004749603,0.0003520394,0.0002519888,0.00019348843,0.0003751591],"domain_scores_gemma":[0.99886495,0.000094352996,0.00015151653,0.0006533436,0.00013287064,0.000102972124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005885301,0.00010626008,0.00017351742,0.000052124444,0.000346141,0.0004238966,0.0007916097,0.000043201006,0.0000012220289],"category_scores_gemma":[0.000051685147,0.000099979996,0.00008876615,0.0006489794,0.000010194144,0.0013066076,0.00092230074,0.00010468862,0.0000019630113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007164406,0.00005413864,0.0004591892,0.0006545265,0.000020563915,6.459105e-7,0.001596829,0.014731767,0.000012969351,0.9596548,0.008241245,0.014566157],"study_design_scores_gemma":[0.00035631293,0.000023585506,0.0010787951,0.000033396824,0.000002139265,0.000037291167,0.0002442169,0.9950167,0.000021596094,0.0004128224,0.0026566354,0.00011650363],"about_ca_topic_score_codex":0.000048554408,"about_ca_topic_score_gemma":0.0000064867704,"teacher_disagreement_score":0.9802849,"about_ca_system_score_codex":0.00003402805,"about_ca_system_score_gemma":0.00009957099,"threshold_uncertainty_score":0.40876445},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46477586,0.0006736338,0.5313085,0.0009871535,0.0014789345,0.00018629253,0.000062042556,0.00022803206,0.0002995909],"genre_scores_gemma":[0.95192426,0.000023582481,0.04703172,0.0006883674,0.00020243016,0.000007956601,0.00010374111,0.000016462332,0.0000014652095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969437,0.0003172419,0.00057281065,0.0009370733,0.0006512553,0.0005778949],"domain_scores_gemma":[0.9966622,0.00048143577,0.00025223513,0.0020578555,0.00027389996,0.00027237946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048965705,0.0003370517,0.0004517524,0.00022557905,0.00027028352,0.00029035113,0.0020795015,0.00015555082,0.00005090235],"category_scores_gemma":[0.00009060138,0.00036772026,0.00038241124,0.0013815159,0.0001443242,0.0004303044,0.0019322314,0.00045562707,0.000014006983],"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.00040448215,0.006951959,0.029778255,0.0015559422,0.0005280215,0.0013493244,0.0150086,0.020422803,0.007093679,0.85337144,0.044754263,0.018781224],"study_design_scores_gemma":[0.0037840204,0.0004102256,0.06792841,0.0008419421,0.000091894566,0.000114803166,0.00010572422,0.8051027,0.035707608,0.0682087,0.015863482,0.0018404977],"about_ca_topic_score_codex":0.00012019401,"about_ca_topic_score_gemma":0.000042744003,"teacher_disagreement_score":0.78516275,"about_ca_system_score_codex":0.000075298165,"about_ca_system_score_gemma":0.0002687248,"threshold_uncertainty_score":0.99987745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06669416,0.00020741651,0.9311953,0.00097395846,0.00006967714,0.0006589597,0.000012423225,0.00006296073,0.00012510034],"genre_scores_gemma":[0.80453855,0.0000051732623,0.19353418,0.00018485055,0.00005095881,0.0016534427,0.000023859686,0.0000037357645,0.0000052611927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986281,0.000013797179,0.00023559437,0.00065649446,0.00018589951,0.00028013313],"domain_scores_gemma":[0.9989105,0.0004914502,0.00010272055,0.0003277103,0.0001064605,0.000061145714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328924,0.00010928115,0.00012798022,0.00015012064,0.00046291115,0.00033358874,0.0005071345,0.000069529815,0.0000026067974],"category_scores_gemma":[0.00006580728,0.00010382855,0.000039411967,0.0010380611,0.00009821222,0.00015076225,0.00010181476,0.000049181403,8.392761e-7],"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.000017662975,0.00019484264,0.00025123745,0.00006773115,0.000003503283,8.139624e-8,0.0003636242,0.0006054966,0.020077366,0.9469543,0.000048577444,0.03141555],"study_design_scores_gemma":[0.0011306002,0.00007435569,0.00062796235,0.000031692314,0.000013695792,0.0000011222895,0.0002858474,0.57369953,0.34262958,0.06382722,0.017359335,0.0003190357],"about_ca_topic_score_codex":0.00001551898,"about_ca_topic_score_gemma":0.000101439095,"teacher_disagreement_score":0.8831271,"about_ca_system_score_codex":0.00001712929,"about_ca_system_score_gemma":0.00016774525,"threshold_uncertainty_score":0.42340052},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002295936,0.000017977018,0.9801445,0.0013655662,0.00036337343,0.015513273,0.00000781774,0.00008034496,0.00021123739],"genre_scores_gemma":[0.5589322,0.000080512866,0.36888966,0.0066697365,0.00044857516,0.06476701,0.00002691954,0.000052971212,0.00013241002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988794,0.000053485106,0.00022174299,0.00046954985,0.0001247211,0.00025111507],"domain_scores_gemma":[0.9993489,0.000066166154,0.000058478672,0.00037600836,0.000068597874,0.00008189249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023992927,0.00014803407,0.00012843272,0.00006773505,0.00039378856,0.00020598511,0.00020012973,0.000037244343,0.000008339148],"category_scores_gemma":[3.838829e-7,0.00014541198,0.000053796553,0.00042011958,0.000021870512,0.00004277296,0.000027985723,0.000093627204,0.0000035977941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026488645,0.0020826773,0.000049453032,0.0025696373,0.00044796572,0.000030816915,0.0049119852,0.09337215,0.00032997163,0.13020106,0.002648068,0.7630913],"study_design_scores_gemma":[0.0023493448,0.00018724725,0.0006060216,0.00031666335,0.00007983332,0.000016765218,0.00035627862,0.93325615,0.00088186923,0.0028078894,0.058732025,0.00040990117],"about_ca_topic_score_codex":0.000007842772,"about_ca_topic_score_gemma":0.000057868823,"teacher_disagreement_score":0.839884,"about_ca_system_score_codex":0.000020818874,"about_ca_system_score_gemma":0.000014684332,"threshold_uncertainty_score":0.5929729},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31744313,0.0013959263,0.67903507,0.0004529625,0.001549085,0.000072270406,0.000002252109,0.000017523294,0.000031777276],"genre_scores_gemma":[0.889765,0.00012328013,0.10989924,0.000044905486,0.00015011287,0.0000032406683,8.75469e-7,0.0000056301737,0.000007715808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866366,0.00007865955,0.00047431793,0.00025128873,0.00033022102,0.0002018548],"domain_scores_gemma":[0.99861556,0.00023857325,0.0003993112,0.00035561735,0.0002536439,0.00013728887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010603811,0.000095420204,0.00019987734,0.00014117743,0.0001280104,0.00045055346,0.0007551171,0.00004735513,0.0000014580629],"category_scores_gemma":[0.00021761707,0.00008570403,0.00009507856,0.00017524084,0.000022542632,0.00040649937,0.00025882485,0.00021043172,6.093113e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004980034,0.0012860837,0.022703888,0.0017625742,0.00046963032,0.000121933066,0.061042286,0.0051868833,0.08512442,0.110058084,0.031921025,0.6798252],"study_design_scores_gemma":[0.0011145073,0.00030764527,0.009872183,0.0019217823,0.000015638532,0.00072301057,0.00064310886,0.9604794,0.013530132,0.008001199,0.0031457786,0.00024565906],"about_ca_topic_score_codex":0.00003953515,"about_ca_topic_score_gemma":0.0000019864096,"teacher_disagreement_score":0.95529246,"about_ca_system_score_codex":0.0000583504,"about_ca_system_score_gemma":0.00008385664,"threshold_uncertainty_score":0.43446973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14814171,0.00059531746,0.8493245,0.0008951003,0.00065733196,0.00011191434,0.000026000824,0.00013783287,0.000110253015],"genre_scores_gemma":[0.84001505,0.0001071237,0.1592735,0.0004854141,0.00008262218,0.0000033184078,0.000004900933,0.000013024882,0.000015061605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981282,0.0001706626,0.00028671898,0.0007013156,0.00033256135,0.00038053925],"domain_scores_gemma":[0.9986801,0.00039467018,0.000074722346,0.00051879516,0.00011285413,0.00021884225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037499508,0.00023132285,0.00026465996,0.00012642494,0.0006080496,0.00035837977,0.00027242623,0.00014472904,0.00005749424],"category_scores_gemma":[0.00003762677,0.00022865522,0.00010510371,0.00042343634,0.0000673063,0.0007404226,0.00007621656,0.000563239,0.000005566013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009524609,0.00962572,0.0062981653,0.0021781393,0.0021948596,0.007552232,0.034390993,0.023204854,0.025617754,0.25864992,0.013309306,0.6160256],"study_design_scores_gemma":[0.0028810957,0.00017862633,0.0035018136,0.00026835836,0.00009260771,0.0014034531,0.00028131268,0.9668876,0.013197087,0.0053136987,0.005099175,0.00089516776],"about_ca_topic_score_codex":0.00013949157,"about_ca_topic_score_gemma":0.00017823912,"teacher_disagreement_score":0.94368273,"about_ca_system_score_codex":0.00002097566,"about_ca_system_score_gemma":0.00016382552,"threshold_uncertainty_score":0.93242896},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41904712,0.00014551295,0.57918227,0.0004993907,0.00026629504,0.00016858659,0.00013575681,0.000119991026,0.00043509895],"genre_scores_gemma":[0.77378964,0.0000346261,0.22473043,0.00088724843,0.000083155304,0.000008213652,0.00044151832,0.000009397179,0.000015767691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861866,0.000019275578,0.00012957178,0.000856626,0.00017232331,0.0002035153],"domain_scores_gemma":[0.9980467,0.000076651275,0.000029280585,0.0016815123,0.000057706446,0.00010813419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038121283,0.00010287675,0.0001145864,0.000060414506,0.0002182937,0.00033020688,0.0010578418,0.000047740876,0.000022057742],"category_scores_gemma":[0.00006672694,0.00008971685,0.000028543376,0.000318529,0.000023543482,0.0004921954,0.0019370718,0.000085019565,0.000004093976],"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.000012920623,0.0003387986,0.0012221944,0.00004855501,0.000013842483,0.000018512645,0.00033426716,0.000032526495,0.0029841175,0.9861879,0.0031555241,0.005650875],"study_design_scores_gemma":[0.00094001694,0.00017266038,0.0054067983,0.00006366165,0.000010405306,0.000027438122,0.00010027187,0.9553416,0.0060293577,0.01817651,0.013369403,0.00036192063],"about_ca_topic_score_codex":0.000019836136,"about_ca_topic_score_gemma":0.00006892443,"teacher_disagreement_score":0.9680114,"about_ca_system_score_codex":0.0000063910657,"about_ca_system_score_gemma":0.000036586775,"threshold_uncertainty_score":0.3658547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0527257,0.0002565395,0.94021267,0.00092125457,0.001985459,0.0020934476,0.0002943821,0.0005082793,0.0010022954],"genre_scores_gemma":[0.1678097,0.00018765514,0.83002436,0.00038964083,0.0002580219,0.00091918017,0.00036208547,0.00004879176,5.4524884e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954207,0.0002595729,0.00081820117,0.0022039874,0.00028100514,0.0010165167],"domain_scores_gemma":[0.9959659,0.0006221299,0.00020305291,0.0026303355,0.0002238597,0.00035472424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059256476,0.000719111,0.00096802815,0.00046671747,0.00031500446,0.00026941532,0.0028922874,0.0006302259,0.000055497123],"category_scores_gemma":[0.00013718968,0.000711037,0.000769912,0.00018394517,0.00038019975,0.00033833474,0.0036195726,0.0015362122,0.000045995977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007532206,0.00014605235,0.00030703418,0.00021499803,0.00017485974,0.00002366341,0.0020779592,0.00010357709,0.006399266,0.9640544,0.00068717636,0.025735712],"study_design_scores_gemma":[0.0004907352,0.00016624911,0.0033684848,0.00011144078,0.00006038861,0.000053015843,0.000054459368,0.08637804,0.0024919615,0.9027414,0.0033055225,0.0007783062],"about_ca_topic_score_codex":0.00016183613,"about_ca_topic_score_gemma":0.00020291591,"teacher_disagreement_score":0.115084,"about_ca_system_score_codex":0.000054475735,"about_ca_system_score_gemma":0.00024223226,"threshold_uncertainty_score":0.9995341},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019543756,0.0034883143,0.9666639,0.0025256353,0.0026403766,0.00038097764,0.000078120465,0.00031332535,0.0043655927],"genre_scores_gemma":[0.13978024,0.0010978233,0.8571307,0.00037388442,0.0013474632,0.00008848419,0.00014546438,0.000031585812,0.000004353342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967764,0.0002744805,0.00043675918,0.0014664001,0.00035916743,0.00068680925],"domain_scores_gemma":[0.9972972,0.0003582813,0.00028273804,0.0014724307,0.000112493944,0.00047680328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037701396,0.0005363331,0.00056747854,0.00039487585,0.00030418643,0.00028843392,0.0011798341,0.00042349927,0.00041380082],"category_scores_gemma":[0.00010005649,0.00054116035,0.00032137276,0.00020365576,0.0007119143,0.00048387525,0.004882745,0.001508909,0.00023407492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063753934,0.00018647013,0.0029746017,0.00003793136,0.00016738017,0.000026339683,0.006329912,0.000020560086,0.00012577177,0.97787887,0.006466373,0.0057220086],"study_design_scores_gemma":[0.00042015352,0.000061821745,0.06714453,0.000042443728,0.00004528684,0.00017108284,0.00024212063,0.00038840485,0.000048761223,0.9185501,0.012337325,0.0005480122],"about_ca_topic_score_codex":0.00012208705,"about_ca_topic_score_gemma":0.000085536645,"teacher_disagreement_score":0.12023648,"about_ca_system_score_codex":0.00006512993,"about_ca_system_score_gemma":0.00039117615,"threshold_uncertainty_score":0.999704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035308834,0.0002292805,0.9474789,0.00087832945,0.002323551,0.0005554984,0.00007956691,0.00069351995,0.012452507],"genre_scores_gemma":[0.3513053,0.00014696753,0.64697176,0.0007932228,0.00039452876,0.00017288189,0.0001734202,0.00004140176,4.8606734e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510986,0.00064931845,0.00081444945,0.0020012474,0.00043809903,0.0009870484],"domain_scores_gemma":[0.99493706,0.00063715054,0.0005816668,0.0033440068,0.00013280564,0.00036729246],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007693252,0.00067845057,0.0009843147,0.000586358,0.00028481212,0.00030833893,0.004059406,0.0005522103,0.0000840835],"category_scores_gemma":[0.00024340859,0.000708864,0.0005670637,0.00029118377,0.00046370353,0.00022233784,0.008223607,0.002157214,0.00043498725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010946893,0.000110805304,0.0026637993,0.00011841584,0.0001464742,0.000116619514,0.001662321,0.00022878619,0.00042178886,0.9810186,0.0013513296,0.01215013],"study_design_scores_gemma":[0.00040127116,0.000061784536,0.012585264,0.00012139852,0.000041132782,0.0001023443,0.000023179648,0.010013034,0.0004471483,0.9677627,0.0076981215,0.00074260007],"about_ca_topic_score_codex":0.00007733094,"about_ca_topic_score_gemma":0.000114387105,"teacher_disagreement_score":0.31599647,"about_ca_system_score_codex":0.000056127363,"about_ca_system_score_gemma":0.00027428116,"threshold_uncertainty_score":0.9997977},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21021095,0.00009442943,0.7749172,0.0012559983,0.0028369676,0.001387064,0.00017327329,0.00087533623,0.008248783],"genre_scores_gemma":[0.32320988,0.00012308205,0.6738767,0.0014658227,0.00047786674,0.0005722128,0.00019555287,0.00007825891,6.345147e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929365,0.0011148698,0.0010656979,0.002816633,0.0006891767,0.0013771114],"domain_scores_gemma":[0.9928966,0.0015243874,0.000898959,0.0039109923,0.0002979203,0.00047111805],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014320094,0.0010956003,0.0012219971,0.0012828563,0.0007470133,0.0005002889,0.004746682,0.0012212939,0.00008722343],"category_scores_gemma":[0.0011390896,0.001098907,0.0009176122,0.0006072957,0.000998181,0.00030374882,0.0071571097,0.009417426,0.00032954692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008846561,0.00034849092,0.00092950277,0.00011849964,0.00020746439,0.00021081085,0.002562443,0.00021237522,0.002175336,0.97526526,0.0007845877,0.01709678],"study_design_scores_gemma":[0.0007782051,0.0002193324,0.005148725,0.0002452242,0.000035983063,0.000060345392,0.00010095078,0.0040958556,0.0016082828,0.9825978,0.003956637,0.0011526031],"about_ca_topic_score_codex":0.000108909146,"about_ca_topic_score_gemma":0.00046674913,"teacher_disagreement_score":0.11299893,"about_ca_system_score_codex":0.000049416944,"about_ca_system_score_gemma":0.00035439277,"threshold_uncertainty_score":0.9991461},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1254042,0.00044852475,0.86614287,0.0011440397,0.0021080917,0.001399406,0.0021312905,0.0011534003,0.000068198904],"genre_scores_gemma":[0.8503662,0.00014623674,0.1486847,0.000057538116,0.00009589303,0.00027131938,0.00032974142,0.000046793193,0.000001626299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572974,0.00007286034,0.0015086161,0.0014185021,0.00054910284,0.0007211607],"domain_scores_gemma":[0.99421626,0.00008156098,0.0015826246,0.0031991552,0.0007302338,0.00019016642],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012413245,0.00067526865,0.0015063988,0.0018087812,0.00024213924,0.00006928631,0.004418643,0.0017899682,0.000009316455],"category_scores_gemma":[0.0006440577,0.00069733337,0.000668557,0.0014287094,0.0020159672,0.00030453652,0.0028164838,0.0013478559,0.000028574663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030653388,0.0003429376,0.00019004269,0.0024319366,0.00013252815,0.000008207605,0.00007292893,0.00054202403,0.0035322406,0.9662427,0.0005134077,0.025960406],"study_design_scores_gemma":[0.00088449946,0.00042281213,0.00016194339,0.001099553,0.00010719595,0.000027964796,0.000019951454,0.078043416,0.027786583,0.86632174,0.024282852,0.00084150553],"about_ca_topic_score_codex":0.000076615775,"about_ca_topic_score_gemma":0.00003624932,"teacher_disagreement_score":0.72496194,"about_ca_system_score_codex":0.00009382584,"about_ca_system_score_gemma":0.00038091815,"threshold_uncertainty_score":0.9995478},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009266253,0.0005751886,0.9771486,0.0032544802,0.002992434,0.0014988744,0.0006987979,0.0009234773,0.003641931],"genre_scores_gemma":[0.061779045,0.00027378564,0.9350318,0.0009522144,0.00060958596,0.00069677294,0.0005809827,0.00007300184,0.0000028441573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99427575,0.00046839556,0.000873079,0.002516759,0.00048949587,0.0013765502],"domain_scores_gemma":[0.99235076,0.0018953157,0.00069951423,0.004417984,0.0002071943,0.00042921386],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011257477,0.0009269078,0.0013018552,0.0007655314,0.00051164976,0.00045843088,0.0060790344,0.00072483195,0.00007294596],"category_scores_gemma":[0.000486428,0.00093182,0.00093553035,0.000281734,0.0006596479,0.00034643,0.009713812,0.0016965589,0.00014965063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001098872,0.00018695125,0.0022236684,0.00032017232,0.00025832988,0.00002726509,0.0015786804,0.00052333646,0.00033363383,0.9797043,0.008162038,0.006571718],"study_design_scores_gemma":[0.00095811445,0.00017270751,0.0024324637,0.00019921685,0.00007902519,0.000054210854,0.000053905907,0.019058503,0.0040791165,0.94057685,0.031387188,0.000948676],"about_ca_topic_score_codex":0.00012115101,"about_ca_topic_score_gemma":0.0002536771,"teacher_disagreement_score":0.05251279,"about_ca_system_score_codex":0.00007190558,"about_ca_system_score_gemma":0.00032723573,"threshold_uncertainty_score":0.99931324},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039621178,0.0003498001,0.9557599,0.0014353637,0.0002818252,0.0011555179,0.000093975585,0.00031981812,0.000982637],"genre_scores_gemma":[0.15735607,0.00014190057,0.84161824,0.00043554994,0.00021620863,0.00017373252,0.00004097453,0.000017024706,2.9792463e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683183,0.0001856026,0.0005494976,0.001672186,0.00016234937,0.0005985328],"domain_scores_gemma":[0.9974169,0.00047079113,0.00027802202,0.0013336596,0.00009895035,0.0004016345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004204013,0.00045095244,0.00060721894,0.0005576486,0.0005127994,0.00031138607,0.001178987,0.00029117067,0.000006671142],"category_scores_gemma":[0.0000820543,0.00050595053,0.00014366281,0.00033652948,0.00033758074,0.00012763565,0.004611874,0.001086841,0.0000074375184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011566365,0.000090324305,0.00075209216,0.00005939782,0.00008099222,0.000009756728,0.0019980182,0.00012310357,0.002335009,0.93684006,0.00014378203,0.057555903],"study_design_scores_gemma":[0.00035374478,0.00008730462,0.012012025,0.00008721147,0.000052948348,0.00016169848,0.00007688045,0.015509155,0.00029584492,0.96674675,0.0040496015,0.000566843],"about_ca_topic_score_codex":0.0000783136,"about_ca_topic_score_gemma":0.00008559649,"teacher_disagreement_score":0.117734894,"about_ca_system_score_codex":0.000036152167,"about_ca_system_score_gemma":0.0001222121,"threshold_uncertainty_score":0.9997392},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026962827,0.0020081496,0.9859866,0.0025447637,0.0005945469,0.0012181309,0.0002925889,0.0005272654,0.004131666],"genre_scores_gemma":[0.032167308,0.0014720095,0.963248,0.0004305857,0.000468666,0.0011471345,0.0010207102,0.00004380536,0.000001741141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551696,0.00043789667,0.00067438005,0.0024320846,0.00038825104,0.0005504594],"domain_scores_gemma":[0.9945708,0.00023019721,0.00044419043,0.003979121,0.00036835132,0.00040733296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009902926,0.00050480047,0.00063347525,0.00057169463,0.0003597911,0.00033152755,0.0019994196,0.00051270414,0.000029774865],"category_scores_gemma":[0.00023584126,0.0005419371,0.00021011455,0.0006010956,0.00060660875,0.00035156598,0.0053149583,0.0013039204,0.0001172187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011317578,0.00013879056,0.0027637514,0.00012362478,0.00010076455,0.000024675002,0.0023454102,0.0001554585,0.00017340589,0.98692626,0.0028609862,0.004375564],"study_design_scores_gemma":[0.00028710492,0.000043578293,0.002709132,0.00005595557,0.00004991784,0.00014807686,0.00007843426,0.0031585838,0.000076164106,0.94936585,0.043507002,0.00052018627],"about_ca_topic_score_codex":0.00012222973,"about_ca_topic_score_gemma":0.00012250006,"teacher_disagreement_score":0.040646017,"about_ca_system_score_codex":0.00006662136,"about_ca_system_score_gemma":0.00047853173,"threshold_uncertainty_score":0.9997032},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24446966,0.00063193694,0.7481534,0.0009087145,0.0013100727,0.0012782156,0.00016658993,0.0005123365,0.0025690757],"genre_scores_gemma":[0.7532124,0.00018069756,0.24486698,0.0006478974,0.00028460496,0.00035423483,0.00038599572,0.00006644842,7.678019e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934453,0.00071671174,0.0011449995,0.0027373142,0.0006857874,0.0012699101],"domain_scores_gemma":[0.99523306,0.00086235517,0.00084747083,0.002132532,0.0003446115,0.00057994254],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00079494866,0.001031996,0.0013427029,0.0007839342,0.0005478192,0.0006328526,0.0024876662,0.0006056665,0.0000883204],"category_scores_gemma":[0.00019969535,0.0010516112,0.00045107934,0.0005312419,0.00090724207,0.00030108608,0.0063759973,0.0024266047,0.00015475093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016546353,0.00032760226,0.002890299,0.00033083395,0.000332494,0.00014829024,0.011620669,0.008354206,0.0008683727,0.9603899,0.0008242984,0.013896463],"study_design_scores_gemma":[0.0016727974,0.000086391534,0.02513047,0.0003296252,0.000106781445,0.00024701573,0.00026576253,0.17659542,0.00036743272,0.7930159,0.00089094235,0.0012914381],"about_ca_topic_score_codex":0.00017123009,"about_ca_topic_score_gemma":0.00007256646,"teacher_disagreement_score":0.50874275,"about_ca_system_score_codex":0.00010900392,"about_ca_system_score_gemma":0.00039565618,"threshold_uncertainty_score":0.99987483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45918393,0.00019196478,0.53856635,0.00046280946,0.0012183903,0.00004901762,0.0000117792215,0.000029775403,0.00028599423],"genre_scores_gemma":[0.93304783,0.00005438044,0.066179946,0.00034756167,0.00033375513,2.4611265e-7,0.00001772599,0.000010490817,0.000008034712],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970371,0.00037577533,0.0007510916,0.0005691975,0.0007966223,0.00047020297],"domain_scores_gemma":[0.99743044,0.00032040515,0.00032375756,0.0015055245,0.00024286237,0.00017701596],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0022820905,0.00019111758,0.00035573085,0.00026800387,0.00010543274,0.00059666747,0.0054368405,0.000119449775,0.00015211597],"category_scores_gemma":[0.00055416406,0.0001912453,0.00013636771,0.00061446574,0.00008127298,0.0021717027,0.0050386735,0.0013420276,0.00000527486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086808094,0.0044365544,0.43320256,0.0011339296,0.0012898679,0.008874621,0.13052875,0.002552961,0.07767225,0.043325555,0.08462732,0.21148755],"study_design_scores_gemma":[0.0019092883,0.00014652984,0.023257136,0.0010146312,0.000023751889,0.00088785373,0.00026175377,0.91928136,0.032635074,0.016268698,0.0037689677,0.0005449768],"about_ca_topic_score_codex":0.0014725986,"about_ca_topic_score_gemma":0.00020635099,"teacher_disagreement_score":0.9167284,"about_ca_system_score_codex":0.00006212838,"about_ca_system_score_gemma":0.00022502946,"threshold_uncertainty_score":0.9999442},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.719089,0.00088131573,0.09673125,0.0038003458,0.0013578248,0.0012928108,0.0054250774,0.003658545,0.16776383],"genre_scores_gemma":[0.98653585,0.000018226285,0.0111791855,0.0012924632,0.00011785037,0.000015562804,0.0004321041,0.000043430904,0.00036535476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99759495,0.000083822844,0.00040566333,0.00081424817,0.00049838214,0.00060294505],"domain_scores_gemma":[0.99792373,0.00019142691,0.00012094077,0.0013649642,0.000028857758,0.00037006577],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019381575,0.0003315897,0.00031656033,0.00020933499,0.00013432707,0.0031916737,0.0020331482,0.00014562163,0.00067883934],"category_scores_gemma":[0.000080437465,0.00029301184,0.00028705975,0.0010062726,0.00007314752,0.013600685,0.0009598522,0.00046272873,0.010821195],"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.00016849635,0.00037673686,0.30407754,0.00009755635,0.00007063064,0.00008685179,0.00008308413,0.0000045287766,0.00017206046,0.65563923,0.011928275,0.02729499],"study_design_scores_gemma":[0.0010135386,0.00021643164,0.019187655,0.00008027904,0.0000086619575,0.00002959259,0.000012988571,0.0007162833,0.0017723219,0.18332125,0.79279375,0.0008472508],"about_ca_topic_score_codex":0.0000024899643,"about_ca_topic_score_gemma":5.4349323e-7,"teacher_disagreement_score":0.7808655,"about_ca_system_score_codex":0.0000142649415,"about_ca_system_score_gemma":0.00009852418,"threshold_uncertainty_score":0.9999522},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.266073,0.0007267695,0.728707,0.00054512685,0.00063688593,0.0002650442,0.000079629375,0.00040710968,0.0025594337],"genre_scores_gemma":[0.55580974,0.00010714336,0.443273,0.00017245511,0.00013638982,0.00002633976,0.00044740402,0.000027263559,2.5307983e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553776,0.0007827528,0.00051264756,0.00193814,0.00046571274,0.0007630172],"domain_scores_gemma":[0.99627167,0.0008552288,0.0004713172,0.001975753,0.00013332635,0.00029268753],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00030455185,0.00067251467,0.0009667656,0.00037095934,0.00034055597,0.0004836792,0.002516068,0.000467127,0.00014586636],"category_scores_gemma":[0.00013816843,0.0006220239,0.00038076015,0.00032302865,0.0004496547,0.0003114693,0.00459586,0.004066842,0.000047759877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094959854,0.00019351766,0.020176826,0.000075588374,0.0005681751,0.00076450716,0.008692925,0.013003102,0.0010609095,0.95232034,0.00024836167,0.0028008088],"study_design_scores_gemma":[0.00091118604,0.00017867687,0.081246525,0.0005601769,0.00011277874,0.00009143815,0.000757643,0.04216952,0.0021263745,0.86720634,0.0032280963,0.0014112374],"about_ca_topic_score_codex":0.00081258186,"about_ca_topic_score_gemma":0.0009726599,"teacher_disagreement_score":0.28973675,"about_ca_system_score_codex":0.00005319045,"about_ca_system_score_gemma":0.00034523752,"threshold_uncertainty_score":0.9996231},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004912541,0.0006975986,0.9951996,0.00064264715,0.0020560327,0.00057896995,0.000028547225,0.000098763885,0.00020654686],"genre_scores_gemma":[0.4573582,0.00012389543,0.53998536,0.0016195782,0.00066995685,0.000039562547,0.0001332446,0.000040009618,0.00003016784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638313,0.00004751192,0.0005725952,0.0016723316,0.00060302514,0.0007214183],"domain_scores_gemma":[0.9970646,0.00076262566,0.00026947397,0.0014297027,0.00032737755,0.00014620615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013687863,0.00042949864,0.0004922092,0.0009976814,0.00026817867,0.00075186073,0.0027323633,0.00039299537,0.000013783447],"category_scores_gemma":[0.00018797448,0.00043335345,0.00019767186,0.0011098916,0.00037998657,0.00083406235,0.0011943418,0.000733736,0.000005252253],"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.0000239399,0.00010835354,0.0003562731,0.00009721096,0.000015188926,0.00008709496,0.0014823416,0.012965438,0.00022335663,0.66600126,0.000025813455,0.31861374],"study_design_scores_gemma":[0.00035744495,0.0001096439,0.0006645466,0.00035549625,0.000007525685,0.000026321766,4.732744e-7,0.73654455,0.00026206914,0.26024577,0.000879305,0.00054682454],"about_ca_topic_score_codex":0.000028205777,"about_ca_topic_score_gemma":0.00029106854,"teacher_disagreement_score":0.72357917,"about_ca_system_score_codex":0.00018781795,"about_ca_system_score_gemma":0.00044266568,"threshold_uncertainty_score":0.9998118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000161373,0.000070123024,0.993775,0.0007433298,0.0014184243,0.00041096736,0.00001915055,0.00015503608,0.0032465742],"genre_scores_gemma":[0.7168541,0.00001843004,0.27815014,0.004459258,0.0004186029,0.000011084074,0.000036079466,0.000035832913,0.00001645421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615616,0.000052240885,0.00044319232,0.0018358208,0.00096105394,0.0005515148],"domain_scores_gemma":[0.99705553,0.0009081408,0.00032808914,0.0012319307,0.00023612085,0.00024018614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075977657,0.000607125,0.0005503528,0.0011355787,0.00031123852,0.0007257607,0.0020310527,0.00032997626,0.0000137802845],"category_scores_gemma":[0.00007269386,0.0005569456,0.00015976613,0.0006107146,0.0005854182,0.000562928,0.0008358685,0.00086153345,0.000043600674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046403136,0.0000882221,0.00010387556,0.00009203461,0.000019316676,0.00009293984,0.0013149912,0.070368096,0.000034574998,0.07117706,0.00018564888,0.85647684],"study_design_scores_gemma":[0.0004099339,0.00030805275,0.000384191,0.00043213982,0.000008134269,0.000023300225,1.5601441e-7,0.87072057,0.0003367335,0.12546058,0.0013311836,0.00058501307],"about_ca_topic_score_codex":0.000023310331,"about_ca_topic_score_gemma":0.000054405617,"teacher_disagreement_score":0.8558918,"about_ca_system_score_codex":0.00015400232,"about_ca_system_score_gemma":0.00027277877,"threshold_uncertainty_score":0.9996882},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9098407,0.0006975819,0.08706158,0.0000714089,0.00029621623,0.00015426031,0.000011888683,0.00013552295,0.001730845],"genre_scores_gemma":[0.930344,0.00004027574,0.069507755,0.00004226012,0.000053213564,0.0000034391257,0.0000013570717,0.000003871081,0.000003826321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977206,0.00016476645,0.00032526313,0.00079936534,0.0005864608,0.00040355223],"domain_scores_gemma":[0.9987132,0.00013159335,0.00008875947,0.0007887486,0.00014442389,0.00013330877],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017157964,0.000149462,0.00022672683,0.00022038032,0.00036841969,0.0014039286,0.0008268117,0.00004107875,0.000009511493],"category_scores_gemma":[0.00017775642,0.0001433772,0.000041159445,0.0014982731,0.00028132362,0.0019712036,0.0014623771,0.00017796112,0.0000022333554],"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.0000046482164,0.00021503853,0.04937952,0.00017786167,0.000010475982,0.000053512307,0.0020337775,0.0004008819,0.006105359,0.94034714,0.000011737031,0.0012600586],"study_design_scores_gemma":[0.0005836623,0.000033114087,0.17534623,0.0003249627,0.000014319531,0.00021750467,0.001522944,0.76815164,0.0068120696,0.045767844,0.00059391063,0.00063178997],"about_ca_topic_score_codex":0.0011538716,"about_ca_topic_score_gemma":0.00046907537,"teacher_disagreement_score":0.8945793,"about_ca_system_score_codex":0.0000909289,"about_ca_system_score_gemma":0.00038269907,"threshold_uncertainty_score":0.9996327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035254407,0.0021163716,0.9907771,0.00086257665,0.0013874127,0.0002175528,0.000019355573,0.0001658895,0.00410124],"genre_scores_gemma":[0.08707472,0.00065819174,0.908655,0.002110912,0.0009074563,0.00002709862,0.000056542674,0.000055898876,0.00045417337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655056,0.000038738846,0.0003646068,0.0017194689,0.00072112,0.0006055149],"domain_scores_gemma":[0.9973238,0.00026489914,0.00015301892,0.0017671415,0.0002414289,0.00024971733],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006766394,0.00041147985,0.00041607025,0.00073730055,0.00056150765,0.0020727532,0.002538132,0.00027341096,0.00009752784],"category_scores_gemma":[0.000116148025,0.0004089998,0.00011622473,0.001023613,0.0007000091,0.001612791,0.0029770061,0.0008278245,0.00001061469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052599526,0.00007268675,0.0005414862,0.0001345969,0.000039764836,0.00018079068,0.0018637201,0.002400316,0.00020704554,0.52257395,0.00022417857,0.47175622],"study_design_scores_gemma":[0.0004991771,0.00021093457,0.0011108851,0.0006060895,0.000023703984,0.00045813379,0.000001936505,0.35655233,0.0007033525,0.59049493,0.047784347,0.0015541681],"about_ca_topic_score_codex":0.00011758336,"about_ca_topic_score_gemma":0.00032418992,"teacher_disagreement_score":0.47020203,"about_ca_system_score_codex":0.00009937381,"about_ca_system_score_gemma":0.0005784005,"threshold_uncertainty_score":0.9998362},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9781215,0.0019668695,0.016960122,0.0018163575,0.00041507618,0.0004520798,0.0000986341,0.000016899932,0.00015246643],"genre_scores_gemma":[0.9983256,0.00047861942,0.0008069025,0.00019116414,0.00016702262,0.000009276883,0.00001669758,0.0000041126896,6.2263155e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891216,0.00008493478,0.00039146646,0.00016735228,0.00031568305,0.00012838085],"domain_scores_gemma":[0.9987398,0.00022675622,0.00032478585,0.00017696818,0.0004121636,0.00011952391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027136473,0.000113936236,0.00022737539,0.00012748003,0.00005629811,0.0003016133,0.00051934074,0.000054282507,0.000023396975],"category_scores_gemma":[0.00005858438,0.00009225526,0.00013424485,0.00013973913,0.00010486401,0.00079591456,0.0002488815,0.00031531602,3.2301668e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003520585,0.0036850069,0.11959872,0.00015112308,0.0020202906,0.002177162,0.007224079,0.0012327868,0.0026676347,0.6863122,0.013092346,0.15831806],"study_design_scores_gemma":[0.006290237,0.005641527,0.29930755,0.002222758,0.000089597044,0.006059612,0.0004048777,0.15659238,0.014532654,0.4930132,0.014738179,0.0011074075],"about_ca_topic_score_codex":0.000028326418,"about_ca_topic_score_gemma":0.000007755233,"teacher_disagreement_score":0.19329903,"about_ca_system_score_codex":0.0000147537585,"about_ca_system_score_gemma":0.00009497785,"threshold_uncertainty_score":0.37620604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013730467,0.0009021057,0.99252564,0.0023741066,0.0012312898,0.0005376535,0.0001757649,0.00032834575,0.00055203645],"genre_scores_gemma":[0.5593046,0.00009869249,0.43500546,0.004198289,0.00066480663,0.0000414531,0.00052421575,0.000099359386,0.00006315358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936369,0.00007010682,0.00063284935,0.0026275434,0.0018486108,0.0011840041],"domain_scores_gemma":[0.99482226,0.00045622818,0.00038209907,0.0029772578,0.0009189741,0.00044314913],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008588315,0.00082619296,0.0007612383,0.0010519869,0.000500591,0.0017453188,0.005060862,0.00042305395,0.000054748918],"category_scores_gemma":[0.00015988311,0.00068662927,0.00024307128,0.002189229,0.0013386302,0.0008047337,0.0026662557,0.0012868175,0.000024497527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057103545,0.00048702952,0.00035837543,0.00023115177,0.00011959645,0.0015512112,0.0030936874,0.05051133,0.0003216393,0.5984091,0.000200124,0.34465963],"study_design_scores_gemma":[0.0013922082,0.0010543097,0.0027148074,0.0013569634,0.0000519343,0.00085633603,0.0000035940031,0.90433884,0.0015396778,0.06945002,0.01393598,0.003305361],"about_ca_topic_score_codex":0.000047758378,"about_ca_topic_score_gemma":0.00014363784,"teacher_disagreement_score":0.8538275,"about_ca_system_score_codex":0.00025722553,"about_ca_system_score_gemma":0.0014434081,"threshold_uncertainty_score":0.9995585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008962044,0.00015956562,0.9885723,0.0008800787,0.000104107196,0.00015763717,0.000051624964,0.00057159923,0.0005410205],"genre_scores_gemma":[0.93591404,0.0007450334,0.06214284,0.00041655448,0.00030390025,0.00023780185,0.00018888201,0.000015613336,0.000035305715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994102,0.000022756229,0.000088579,0.00025479074,0.000075171134,0.00014850593],"domain_scores_gemma":[0.99941397,0.00010807038,0.000025999097,0.00036723772,0.000023820823,0.000060923154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013085066,0.00007013538,0.00006814387,0.00013036985,0.00017387842,0.00009196462,0.0003020647,0.000036390586,0.00000269888],"category_scores_gemma":[0.000008722993,0.000060530205,0.000028118879,0.0010020392,0.000045022894,0.00023870562,0.00018161997,0.0000721408,0.00006955657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011372125,0.000033340857,0.00018056012,0.000008977175,0.00001609075,0.0000027700712,0.00041904056,0.0000016505255,0.00063175976,0.68145365,0.0052692043,0.31198183],"study_design_scores_gemma":[0.00035043756,0.00007972419,0.018415386,0.000011833282,0.0000085342845,0.000030441435,0.0002637675,0.06310691,0.0026475554,0.73636943,0.1783407,0.0003752859],"about_ca_topic_score_codex":0.000019423698,"about_ca_topic_score_gemma":0.000004476317,"teacher_disagreement_score":0.926952,"about_ca_system_score_codex":0.000005100287,"about_ca_system_score_gemma":0.00001379607,"threshold_uncertainty_score":0.24683501},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020089293,0.000116195595,0.96527404,0.0035644143,0.0028854317,0.0018126996,0.0020664781,0.0005694722,0.0036219745],"genre_scores_gemma":[0.056546826,0.0001609699,0.94021714,0.0009784675,0.0006141759,0.0007562631,0.00065939437,0.00006375196,0.0000030094177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556905,0.00034259944,0.0007044867,0.0020504948,0.0003688508,0.0009645399],"domain_scores_gemma":[0.99474317,0.001227456,0.00049810775,0.0030562507,0.00018381121,0.00029118275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005720084,0.0006860661,0.00090069504,0.00085892173,0.00041184726,0.00021868458,0.0029656538,0.00056617125,0.000017313661],"category_scores_gemma":[0.00024722327,0.00070256955,0.00076387543,0.00034076322,0.00033869094,0.00013325165,0.0037750043,0.0016310366,0.000078572244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009415294,0.00026364627,0.00050457945,0.00014922844,0.00026819963,0.000023829865,0.0010826157,0.0054631457,0.00030043884,0.9831698,0.006099482,0.0025809081],"study_design_scores_gemma":[0.00085353985,0.00027573906,0.0026899467,0.00018434571,0.00007723794,0.000065552405,0.000057443227,0.028394492,0.0009179641,0.9344265,0.031267878,0.00078938965],"about_ca_topic_score_codex":0.00014706135,"about_ca_topic_score_gemma":0.000278809,"teacher_disagreement_score":0.048743304,"about_ca_system_score_codex":0.00009739467,"about_ca_system_score_gemma":0.00036873855,"threshold_uncertainty_score":0.99954253},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20955305,0.00008115835,0.77661896,0.0062010107,0.004704394,0.00012320395,0.000049723694,0.00019347,0.0024750049],"genre_scores_gemma":[0.98487103,0.000019116285,0.013840169,0.001149933,0.00010500615,9.0836227e-7,0.0000113197075,0.0000017827057,7.5086894e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973598,0.000024979758,0.0004999949,0.00012044552,0.001763617,0.00023113695],"domain_scores_gemma":[0.99761134,0.000089834975,0.00037714042,0.00024501293,0.0015286807,0.00014795865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018729481,0.00009638137,0.00010867575,0.0015019451,0.0001889659,0.0008257279,0.0029688985,0.000048079663,0.000020477224],"category_scores_gemma":[0.00047221693,0.00008628193,0.00012392832,0.0020350227,0.00018102648,0.010048098,0.00028683103,0.00025601266,0.00007330412],"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.00010898018,0.00018320173,0.0027807758,0.00004661069,0.00009039095,0.00016316822,0.021944778,0.00827589,0.006861163,0.88610893,0.013113731,0.06032236],"study_design_scores_gemma":[0.0028725532,0.00032185466,0.025323195,0.00030214083,0.000016281536,0.00054618553,0.0018298831,0.68826574,0.04107639,0.07342748,0.16524138,0.00077689876],"about_ca_topic_score_codex":0.000008300572,"about_ca_topic_score_gemma":0.0000014949643,"teacher_disagreement_score":0.8126815,"about_ca_system_score_codex":0.00009508248,"about_ca_system_score_gemma":0.0004212243,"threshold_uncertainty_score":0.7962513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030635819,0.0015077491,0.96027553,0.0010570177,0.0020393494,0.00057117635,0.0002534701,0.0005593657,0.0031005132],"genre_scores_gemma":[0.1794998,0.00027413428,0.8182502,0.00085690216,0.00051879307,0.000031106894,0.000525242,0.0000431118,7.515288e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540263,0.0006613457,0.00066581543,0.0019597937,0.00046594808,0.0008444363],"domain_scores_gemma":[0.9944928,0.0005798164,0.0005244132,0.0038404148,0.00025712085,0.0003053909],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004671384,0.00072944455,0.0009715693,0.00052848563,0.00027403765,0.0003418368,0.005460032,0.0008744996,0.00028277922],"category_scores_gemma":[0.00050378183,0.00069931115,0.00033995858,0.00046794827,0.00037004324,0.0002739171,0.012649283,0.0032375357,0.00013393906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040106723,0.000053255884,0.0017010927,0.00023971665,0.00018427156,0.000058500973,0.00081392284,0.00025323543,0.0017435969,0.9837021,0.0076520983,0.003558083],"study_design_scores_gemma":[0.000254079,0.000082949315,0.003426712,0.00019626731,0.00004363653,0.000052010375,0.000013780071,0.008091892,0.00092656707,0.94535285,0.040847257,0.0007120066],"about_ca_topic_score_codex":0.000038025042,"about_ca_topic_score_gemma":0.00006443784,"teacher_disagreement_score":0.14886399,"about_ca_system_score_codex":0.000044931345,"about_ca_system_score_gemma":0.00023620832,"threshold_uncertainty_score":0.9999209},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050901793,0.00010482839,0.9401781,0.0010654333,0.0022987814,0.001762757,0.00015205775,0.0006086405,0.0029276418],"genre_scores_gemma":[0.30443394,0.00002186738,0.6938238,0.0005020957,0.00038291025,0.0005299972,0.0002613559,0.000043793927,2.5205705e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495834,0.000472858,0.00074535486,0.0022331495,0.00045855338,0.00113176],"domain_scores_gemma":[0.99505776,0.0013644478,0.0005857517,0.0025399493,0.00013266002,0.0003194001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012630809,0.0007421301,0.000975589,0.00068531715,0.00046681298,0.00040295708,0.0032146613,0.0004927702,0.000011625865],"category_scores_gemma":[0.00033659174,0.00072660594,0.0007665568,0.00026826284,0.00036030245,0.000097741075,0.0042046346,0.0017518247,0.00012325814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000914372,0.00035895503,0.0004602475,0.0002455823,0.00015041148,0.000017510625,0.0016385174,0.0031120374,0.000117311065,0.95457095,0.0006371422,0.03859988],"study_design_scores_gemma":[0.0007848516,0.00033196056,0.0013177443,0.00035483344,0.00004233705,0.000026708865,0.000033250602,0.09915838,0.0007530622,0.8860326,0.010365017,0.00079928193],"about_ca_topic_score_codex":0.000044785258,"about_ca_topic_score_gemma":0.000043599262,"teacher_disagreement_score":0.25353214,"about_ca_system_score_codex":0.00008554305,"about_ca_system_score_gemma":0.00018463834,"threshold_uncertainty_score":0.9995185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26367489,0.0001346763,0.73476976,0.0006484425,0.0003532481,0.00022509217,0.000008604867,0.00015691809,0.00002839656],"genre_scores_gemma":[0.9889031,0.00004891459,0.010675834,0.00021732676,0.00009579775,0.0000266047,0.00001668716,0.000011446977,0.0000043070004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983535,0.0001676337,0.00028483928,0.00061450276,0.0002743468,0.00030519825],"domain_scores_gemma":[0.9991308,0.00012391203,0.0000971286,0.00037233395,0.00016673378,0.000109121545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038165497,0.00016399799,0.00016789751,0.00018853239,0.00039912868,0.00013137145,0.00017700788,0.00010109214,0.0000033425963],"category_scores_gemma":[0.0000039583206,0.00017452858,0.00004477388,0.0011086746,0.0000267665,0.0004217145,0.00000838491,0.00039787203,0.000010861906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002900995,0.0012277022,0.0022281783,0.00044872353,0.000093130264,0.000055804707,0.0040124897,0.099204436,0.01008706,0.27196914,0.000040894534,0.6103423],"study_design_scores_gemma":[0.0013545394,0.0004530023,0.0068897335,0.00017834267,0.000021958216,0.00009959902,0.00024075621,0.9688083,0.011943109,0.009203691,0.0003591419,0.0004478441],"about_ca_topic_score_codex":0.00024470882,"about_ca_topic_score_gemma":0.0005110484,"teacher_disagreement_score":0.8696039,"about_ca_system_score_codex":0.00010238921,"about_ca_system_score_gemma":0.00013553264,"threshold_uncertainty_score":0.7117069},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004281654,0.00269266,0.99160975,0.00016209228,0.00026927283,0.0002186909,0.000073539086,0.000093592615,0.0005987177],"genre_scores_gemma":[0.774918,0.00023277194,0.22411814,0.0005418863,0.00007771065,0.0000036689328,0.00008099398,0.000020103435,0.000006727679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961599,0.00005169296,0.0004981795,0.0017477733,0.0010519385,0.00049048796],"domain_scores_gemma":[0.9970785,0.00036964106,0.0003824832,0.0016114821,0.00037356175,0.00018433224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006314193,0.00052652624,0.00094369176,0.0017489973,0.00019713801,0.00045488923,0.0021438804,0.0004000365,0.000028048826],"category_scores_gemma":[0.000051175335,0.00043898376,0.00018572006,0.0042626555,0.0011014548,0.0007737921,0.0015165771,0.00094752025,7.345907e-7],"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.00007304738,0.00031283425,0.003765415,0.0003580248,0.001268436,0.0005532885,0.003628504,0.006060352,0.0011620312,0.7729435,0.00003123717,0.20984331],"study_design_scores_gemma":[0.001607161,0.0012099108,0.008306474,0.0017830386,0.0009827303,0.00015808432,0.0000043018113,0.74960333,0.0055679847,0.22298637,0.004461697,0.0033289245],"about_ca_topic_score_codex":0.000057917427,"about_ca_topic_score_gemma":0.00085138535,"teacher_disagreement_score":0.7706363,"about_ca_system_score_codex":0.0000585199,"about_ca_system_score_gemma":0.00029979052,"threshold_uncertainty_score":0.99980617},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067750756,0.0013169497,0.9936215,0.0003962633,0.0024967135,0.0006914241,0.00004923505,0.000192253,0.0011679002],"genre_scores_gemma":[0.044573944,0.00006996911,0.9526991,0.0015294323,0.00081121887,0.000044838234,0.000083667146,0.000050995935,0.0001368399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957503,0.000034863093,0.0005717467,0.002029186,0.00072468707,0.000889206],"domain_scores_gemma":[0.99624264,0.00085598923,0.0002955768,0.0019979656,0.00037912314,0.00022867367],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013035787,0.00057985645,0.0007136496,0.00065740163,0.0004660091,0.0011240675,0.0035960032,0.0003664941,0.000028685441],"category_scores_gemma":[0.000248406,0.0005551515,0.00032482724,0.00082585105,0.0004854261,0.00097801,0.00158851,0.0006841191,0.0000123776845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000646233,0.00008338868,0.000034853645,0.0002824383,0.0000338894,0.00013859442,0.0007098444,0.004242129,0.0009387058,0.24278487,0.00016093563,0.7505257],"study_design_scores_gemma":[0.0022173193,0.00024106803,0.000035404086,0.00037314778,0.000028719736,0.00009329305,4.624984e-7,0.6089872,0.0054318225,0.36832353,0.012863628,0.001404421],"about_ca_topic_score_codex":0.00004408445,"about_ca_topic_score_gemma":0.00016882208,"teacher_disagreement_score":0.7491213,"about_ca_system_score_codex":0.00016934452,"about_ca_system_score_gemma":0.0008582867,"threshold_uncertainty_score":0.99991286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7867703,0.000098236735,0.20911695,0.00053979945,0.0009598825,0.0002859336,0.00006558257,0.00012603987,0.0020373124],"genre_scores_gemma":[0.9874127,0.000006058703,0.012438474,0.00006109152,0.00005529821,0.000011013295,0.000007195285,0.0000057176503,0.0000024592368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981134,0.0002721951,0.00044842568,0.00055677956,0.00031689194,0.00029229093],"domain_scores_gemma":[0.9980468,0.00026242324,0.00021702447,0.0011208957,0.0002232467,0.00012959348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062574964,0.0001749617,0.00026710462,0.00012098015,0.00028983885,0.00024960763,0.0007531794,0.00010535219,0.000013798355],"category_scores_gemma":[0.00041658376,0.00012890188,0.0001655057,0.001029566,0.00023565939,0.0003771584,0.0007901622,0.0001892946,0.000003364425],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017906454,0.00025685132,0.06985792,0.00034952097,0.000049555874,0.000015281568,0.0011890546,0.000001427201,0.0059503005,0.91897774,0.0001602983,0.003174147],"study_design_scores_gemma":[0.0011675201,0.0001256501,0.9331128,0.00016689741,0.000042788106,0.00010126698,0.0005173554,0.047516447,0.0022820083,0.013410236,0.0010888705,0.0004681424],"about_ca_topic_score_codex":0.00028086756,"about_ca_topic_score_gemma":0.00014953152,"teacher_disagreement_score":0.9055675,"about_ca_system_score_codex":0.000024012748,"about_ca_system_score_gemma":0.00017883914,"threshold_uncertainty_score":0.5256466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015720728,0.00035440264,0.9946207,0.00040504278,0.0016842891,0.0010699572,0.00025040537,0.00035077138,0.001107219],"genre_scores_gemma":[0.16033968,0.000037581816,0.8386679,0.00054596126,0.00012862963,0.00005339665,0.00017082652,0.00004062319,0.000015364258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99446857,0.00019665097,0.0011734142,0.0019398093,0.0014388724,0.0007826867],"domain_scores_gemma":[0.9951571,0.0011868429,0.000769067,0.0021051697,0.0004978363,0.00028394096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013998052,0.00073271716,0.000963989,0.0017872718,0.00080348784,0.000380452,0.004852084,0.00027824048,0.000106741165],"category_scores_gemma":[0.00007969315,0.00076007453,0.00039230954,0.0021005778,0.0014650414,0.0009861229,0.0029883129,0.0014651793,0.000020023503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016224394,0.00053743605,0.00022890537,0.00016627979,0.00007165043,0.00012887812,0.0020754419,0.29406786,0.0008218585,0.5773074,0.0001963733,0.12438171],"study_design_scores_gemma":[0.0009971936,0.00029523068,0.00041518573,0.0002620898,0.00003191011,0.00012410506,0.000001160387,0.7425513,0.0021936102,0.24826393,0.0037883134,0.0010759732],"about_ca_topic_score_codex":0.00013924624,"about_ca_topic_score_gemma":0.00032231,"teacher_disagreement_score":0.44848347,"about_ca_system_score_codex":0.00026119399,"about_ca_system_score_gemma":0.0008130446,"threshold_uncertainty_score":0.999485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007704103,0.0017728229,0.99025667,0.00023396895,0.0012495785,0.00027338692,0.000011996928,0.0002535502,0.005177636],"genre_scores_gemma":[0.14355995,0.00013486187,0.8539413,0.0013630693,0.0006963835,0.00001597948,0.000033714074,0.000058163478,0.00019656903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994793,0.0000336074,0.00061169046,0.0024593584,0.0011585233,0.0009438309],"domain_scores_gemma":[0.9963828,0.00036674822,0.00027909488,0.002467317,0.00025474146,0.0002493204],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011416172,0.00060146104,0.00061495363,0.00079788954,0.0005167942,0.0013590943,0.0044747368,0.00035860046,0.00007285607],"category_scores_gemma":[0.00017720813,0.00060082093,0.0002241004,0.0012423663,0.0005086149,0.0010759233,0.0043687494,0.0012550083,0.000025724752],"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.000010489182,0.00007804047,0.00060148904,0.00022800364,0.000040338393,0.0005054615,0.0017839273,0.0077867173,0.0018869326,0.3341023,0.00005004538,0.65292627],"study_design_scores_gemma":[0.000580477,0.00022427189,0.00027047755,0.00182174,0.000021838221,0.00022603228,0.0000015939728,0.63354397,0.022012996,0.3278521,0.011360963,0.00208354],"about_ca_topic_score_codex":0.000045806984,"about_ca_topic_score_gemma":0.0001814115,"teacher_disagreement_score":0.6508427,"about_ca_system_score_codex":0.00022855867,"about_ca_system_score_gemma":0.0004928544,"threshold_uncertainty_score":0.9996776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016857603,0.00011286818,0.9912371,0.0012738577,0.0005083599,0.00003380491,0.0000021861194,0.00005673322,0.0050893463],"genre_scores_gemma":[0.16539462,0.0005901879,0.83197147,0.0015061714,0.00035824155,0.00000203689,0.000062828636,0.000012894779,0.000101551224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912393,0.00008822651,0.00020012009,0.0001714587,0.0002768489,0.00013938683],"domain_scores_gemma":[0.99922824,0.000040626826,0.00012295226,0.00028344893,0.00023514937,0.000089603855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002459633,0.00007727735,0.000079404505,0.00011460676,0.00022310624,0.0003348931,0.0002369375,0.000051477946,0.00008932147],"category_scores_gemma":[0.00007485326,0.00006962481,0.00006295247,0.00054707367,0.000009332689,0.0011225583,0.00005823511,0.00018787486,0.000022590719],"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.000027432952,0.00018914523,0.00024815692,0.00000930374,0.000025817917,0.00011999557,0.00042906808,0.5838712,0.00012594566,0.3933729,0.0018742337,0.01970683],"study_design_scores_gemma":[0.0008092654,0.00018743389,0.0015649474,0.000071658054,0.000013587297,0.0005543433,0.000041006908,0.9552048,0.0014477753,0.022380441,0.017457554,0.00026719054],"about_ca_topic_score_codex":7.2616535e-7,"about_ca_topic_score_gemma":0.0000011707926,"teacher_disagreement_score":0.37133363,"about_ca_system_score_codex":0.00003952771,"about_ca_system_score_gemma":0.00007259242,"threshold_uncertainty_score":0.32293817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068749604,0.00031951437,0.9848393,0.0065024043,0.0024802266,0.0011718883,0.0010813666,0.0006227594,0.0022950424],"genre_scores_gemma":[0.0046226033,0.00014928805,0.9922732,0.0011863421,0.0005791887,0.0004888226,0.0006566789,0.000043209075,6.452403e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567974,0.0002909466,0.00068501476,0.0021156587,0.00035133434,0.0008772844],"domain_scores_gemma":[0.9960434,0.00078864576,0.00043198653,0.0021579277,0.00015497123,0.00042308407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040235248,0.0006710086,0.00095575675,0.00036216906,0.0003239505,0.0003436537,0.0039383364,0.00052485697,0.000048605194],"category_scores_gemma":[0.00020429505,0.0006929625,0.00075808354,0.0002988379,0.0004915186,0.00023754472,0.0070718187,0.0015766659,0.00016068658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044287077,0.00012883115,0.00026077227,0.00013866815,0.00022275015,0.000080977734,0.0015945309,0.00003924183,0.00010846379,0.9557328,0.010215506,0.03143312],"study_design_scores_gemma":[0.0005254118,0.00015073668,0.0009755972,0.00004558435,0.000049988055,0.000019040666,0.00003516448,0.038435414,0.00044147993,0.87685305,0.08182677,0.00064175884],"about_ca_topic_score_codex":0.000047298738,"about_ca_topic_score_gemma":0.00008345577,"teacher_disagreement_score":0.078879796,"about_ca_system_score_codex":0.00005457637,"about_ca_system_score_gemma":0.00042323154,"threshold_uncertainty_score":0.99955213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003929531,0.00026940278,0.97291017,0.0007977004,0.00039759377,0.00069878274,0.006469416,0.00075947144,0.013767964],"genre_scores_gemma":[0.6414311,0.00095577724,0.27376175,0.0026262647,0.0006204346,0.00006668498,0.0804026,0.000049081355,0.00008631728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99413675,0.00018995105,0.0006971828,0.003434991,0.0008387557,0.00070235267],"domain_scores_gemma":[0.9752732,0.000040504525,0.0002961353,0.023711508,0.00021098032,0.00046769943],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010458262,0.0005903932,0.00057429913,0.00036962138,0.00021947488,0.0050190045,0.035528325,0.0003661287,0.00022286791],"category_scores_gemma":[0.00009271801,0.00056792813,0.00009715693,0.00075899664,0.000061691775,0.0079586115,0.096518256,0.00084282074,0.000016455617],"study_design_candidate":"theoretical_or_conceptual","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.000014940757,0.0008075613,0.0000251495,0.00025066486,0.0003461675,0.000106874526,0.0010932736,0.0079209665,0.00003422913,0.96558714,0.010833133,0.012979925],"study_design_scores_gemma":[0.00038148442,0.000045697714,0.000051577397,0.000042412685,0.000054347172,0.00001898848,0.0001562617,0.9442365,0.0000851558,0.051294535,0.0029624787,0.000670566],"about_ca_topic_score_codex":0.022749363,"about_ca_topic_score_gemma":0.004738051,"teacher_disagreement_score":0.93631554,"about_ca_system_score_codex":0.00009279511,"about_ca_system_score_gemma":0.0044240993,"threshold_uncertainty_score":0.99967724},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17259388,0.00030425104,0.8227283,0.0011878285,0.0017286652,0.0009502742,0.00014854704,0.00016743441,0.0001908339],"genre_scores_gemma":[0.43187883,0.00016417222,0.566427,0.0002536729,0.00015127542,0.0003354301,0.0007675862,0.000021840659,1.7567149e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598616,0.000505498,0.00077911664,0.0016788751,0.00024147354,0.00080887345],"domain_scores_gemma":[0.9963206,0.0009753562,0.00044021732,0.0018667658,0.00021597237,0.00018109842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009492095,0.00046791282,0.0007415085,0.0006266401,0.00020661588,0.0003265351,0.0021361136,0.0005166957,0.00002922251],"category_scores_gemma":[0.00041306406,0.0005213629,0.0004593497,0.00042323244,0.00026275142,0.00032062805,0.004229123,0.0013114073,0.000015009996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007814928,0.0002598303,0.0069645126,0.00013186854,0.00008646003,0.000062363724,0.0042226654,0.0009956649,0.00041693044,0.9828729,0.0001012835,0.0038073945],"study_design_scores_gemma":[0.0006216573,0.00006642951,0.038903777,0.00015958892,0.000032091815,0.000030431991,0.0001943654,0.13493578,0.00025969328,0.82385427,0.000416968,0.0005249522],"about_ca_topic_score_codex":0.000121729994,"about_ca_topic_score_gemma":0.00066054694,"teacher_disagreement_score":0.25928494,"about_ca_system_score_codex":0.00008433972,"about_ca_system_score_gemma":0.0003550922,"threshold_uncertainty_score":0.9997238},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03559498,0.0006721964,0.95704275,0.00080743164,0.0026232558,0.0013838721,0.0003401324,0.00041579362,0.0011196109],"genre_scores_gemma":[0.08586972,0.0001371387,0.9118758,0.00036732169,0.000281785,0.00061774335,0.00080662395,0.000042969463,9.2096656e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537486,0.0004195003,0.0008007208,0.002074543,0.0002947872,0.0010356172],"domain_scores_gemma":[0.995028,0.0011661533,0.0005114463,0.0027289062,0.00026364822,0.00030180148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000903939,0.0006642775,0.001128562,0.00038315,0.000392514,0.0005224798,0.002916218,0.00054368225,0.00006857435],"category_scores_gemma":[0.0005727446,0.00070004945,0.0008158262,0.00030631444,0.00033986167,0.00036927158,0.006196108,0.0013748481,0.00003356042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025873323,0.00022217756,0.0005605733,0.00046170002,0.00023810077,0.00010919524,0.0026379663,0.00036314936,0.0019153141,0.98224914,0.0008211154,0.01016281],"study_design_scores_gemma":[0.0027044937,0.00009936118,0.0010427881,0.000106481406,0.00009277122,0.00007679767,0.00017756238,0.041548155,0.0032127376,0.94595593,0.0040768683,0.0009060627],"about_ca_topic_score_codex":0.00020739486,"about_ca_topic_score_gemma":0.00030600102,"teacher_disagreement_score":0.050274737,"about_ca_system_score_codex":0.000073326184,"about_ca_system_score_gemma":0.00071817153,"threshold_uncertainty_score":0.99954504},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2786635,0.0003115924,0.72023696,0.0001255202,0.00018213666,0.00013162047,0.000010592427,0.000102882004,0.00023525166],"genre_scores_gemma":[0.9644845,0.000048747446,0.03530519,0.00009489144,0.000034545228,0.0000058479645,0.0000075502307,0.00001366491,0.000005038234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833953,0.000101378195,0.000319521,0.00058922835,0.00031503427,0.00033528832],"domain_scores_gemma":[0.9986323,0.00017188049,0.00012827394,0.0006930974,0.0002490689,0.00012537613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028033246,0.00021540257,0.00026440225,0.00015859272,0.0004574939,0.000203015,0.00047888904,0.00009856215,0.000011446339],"category_scores_gemma":[0.000014521296,0.00020623088,0.000078244426,0.000983048,0.000055606954,0.00066669896,0.0000371379,0.00039707264,0.0000015160183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041363502,0.00327292,0.0022568833,0.0032364922,0.0009066495,0.00066032005,0.047404915,0.29619795,0.018690815,0.038914192,0.00033058072,0.5877146],"study_design_scores_gemma":[0.00131696,0.00027072278,0.000505323,0.0007643802,0.00005670683,0.00022741868,0.00067064614,0.7260796,0.26482552,0.0029962182,0.0015662478,0.00072024256],"about_ca_topic_score_codex":0.000043692555,"about_ca_topic_score_gemma":0.00014418153,"teacher_disagreement_score":0.68582106,"about_ca_system_score_codex":0.000023441095,"about_ca_system_score_gemma":0.00013688461,"threshold_uncertainty_score":0.8409851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34319663,0.0008642599,0.6550615,0.00035941773,0.00014843442,0.00003763118,0.0000010099861,0.000006729497,0.00032442398],"genre_scores_gemma":[0.9509643,0.00014309173,0.048339725,0.00053767115,0.0000125701035,4.814306e-7,0.0000010519858,8.825397e-7,2.2422475e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986907,0.000022076549,0.00035891053,0.00009972272,0.0005977718,0.00023076772],"domain_scores_gemma":[0.9989145,0.000035611876,0.00025171242,0.00017445075,0.00053813175,0.000085621316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001790187,0.00006287727,0.00010245172,0.00040696494,0.00014698917,0.000536532,0.0005215017,0.0000337193,0.0000053309436],"category_scores_gemma":[0.00024639905,0.000053859425,0.000035503115,0.0025308575,0.00006941422,0.0075426055,0.00014561087,0.00029627493,0.0000012821399],"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.000012469608,0.000095577634,0.0009733873,0.000020695927,0.0000036480747,0.000007776877,0.00069567317,0.0028403206,0.012519274,0.97422403,0.000031904434,0.0085752625],"study_design_scores_gemma":[0.0011863551,0.00020516102,0.028435953,0.00008148622,0.000004336694,0.00013913469,0.00013635441,0.9400161,0.011331184,0.006839839,0.011399632,0.0002244838],"about_ca_topic_score_codex":0.0000022559357,"about_ca_topic_score_gemma":0.00000994458,"teacher_disagreement_score":0.96738416,"about_ca_system_score_codex":0.000072089926,"about_ca_system_score_gemma":0.00069761195,"threshold_uncertainty_score":0.5468207},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009442334,0.003785327,0.9809178,0.00087576616,0.0040295706,0.00054196996,0.000026728763,0.00035211304,0.000028384591],"genre_scores_gemma":[0.3636517,0.000065455744,0.6347298,0.0011976968,0.00025947337,0.000032570228,0.000046632314,0.000016288595,3.935708e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99320465,0.00023408968,0.00066752656,0.003333171,0.0013350028,0.0012255448],"domain_scores_gemma":[0.99464554,0.00040734315,0.00033416713,0.0038731557,0.0003952504,0.00034452698],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016539323,0.00074107636,0.000786651,0.0008890027,0.0004386099,0.0023548247,0.008195901,0.0006804488,0.000026565715],"category_scores_gemma":[0.0003485291,0.00070779875,0.00034353838,0.0045819497,0.0006796218,0.0014750927,0.012034414,0.0027129622,0.000014030617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025353023,0.0014597786,0.0054857056,0.00068746804,0.000097386255,0.00094587007,0.009378486,0.06668444,0.009887226,0.009717566,0.0002556654,0.8953751],"study_design_scores_gemma":[0.00055039115,0.00011162013,0.0035770684,0.00064381317,0.000010882656,0.0000669085,0.000002806638,0.95789033,0.006282111,0.029311942,0.00042252577,0.0011295865],"about_ca_topic_score_codex":0.00035666444,"about_ca_topic_score_gemma":0.001136986,"teacher_disagreement_score":0.89424545,"about_ca_system_score_codex":0.00022390661,"about_ca_system_score_gemma":0.0008681044,"threshold_uncertainty_score":0.99958783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002755574,0.0013038034,0.9957896,0.0009261806,0.00031516122,0.00037691844,0.0000139008425,0.0000867589,0.00091215107],"genre_scores_gemma":[0.10186005,0.00034909384,0.89195395,0.0051478804,0.0005369871,0.00004972754,0.000017242042,0.000030683583,0.00005437384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974121,0.000024965808,0.00030012004,0.0014933965,0.00037238622,0.00039703603],"domain_scores_gemma":[0.9980629,0.00033241624,0.000107309614,0.0010950473,0.00013955949,0.00026273067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551945,0.00032618956,0.00034245744,0.0005283259,0.00032127503,0.00087169476,0.0012930899,0.00016201173,0.0000067691376],"category_scores_gemma":[0.000045056346,0.00031787122,0.000051609073,0.0007526823,0.00046703615,0.0004594121,0.0020745776,0.00044388862,0.0000072257853],"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.0000021768094,0.000017337823,0.00018136075,0.000045635334,0.000007447261,0.000041427393,0.0005955786,0.00036540715,0.00026062346,0.20732541,0.000024392557,0.7911332],"study_design_scores_gemma":[0.00070566696,0.000402924,0.0063325544,0.00096290576,0.000039271898,0.00048097695,0.0000021941194,0.103822716,0.0026915935,0.7939198,0.08790157,0.0027378194],"about_ca_topic_score_codex":0.000021421823,"about_ca_topic_score_gemma":0.0001394872,"teacher_disagreement_score":0.7883954,"about_ca_system_score_codex":0.000045349956,"about_ca_system_score_gemma":0.00018249813,"threshold_uncertainty_score":0.99992734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010055184,0.00013973628,0.94749004,0.0008066108,0.0002161294,0.000025393992,0.0000018303141,0.00018013918,0.04108494],"genre_scores_gemma":[0.5842591,0.00004446137,0.41461164,0.00085324864,0.00003724008,0.0000037061536,0.000007451704,0.0000024067524,0.0001807644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993774,0.000022294158,0.000083291256,0.00025527822,0.000120081895,0.00014159699],"domain_scores_gemma":[0.9991676,0.000030874915,0.000015123436,0.0006718168,0.00005253972,0.000062024745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006563493,0.000053838903,0.00006415212,0.000025847059,0.000058617068,0.00013539454,0.00050751417,0.00002493509,0.00023113437],"category_scores_gemma":[0.000030245328,0.000049048078,0.00004858704,0.00041569947,0.000014413236,0.00040818626,0.00041815185,0.000060649327,0.000119484896],"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":[6.6105326e-7,0.00005011564,0.00008231134,0.0000036303948,0.0000058107157,0.000023096452,0.00022943514,0.0000016032579,0.0047464087,0.9647788,0.004515346,0.02556283],"study_design_scores_gemma":[0.0008016635,0.00007088995,0.0063487994,0.00002225581,0.0000066413677,0.00010563026,0.000119358745,0.0056702415,0.4789821,0.24830039,0.25897127,0.00060078007],"about_ca_topic_score_codex":0.000006025793,"about_ca_topic_score_gemma":0.000011017364,"teacher_disagreement_score":0.71647835,"about_ca_system_score_codex":0.000004298465,"about_ca_system_score_gemma":0.0000435884,"threshold_uncertainty_score":0.25307593},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.584915,0.004455785,0.40439245,0.00026640604,0.0029350852,0.0007122818,0.00041888183,0.0018931739,0.000010917718],"genre_scores_gemma":[0.89769983,0.000499342,0.100535415,0.0005567279,0.00045072075,0.00009668579,0.000002574144,0.00015847963,2.0407089e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9938995,0.0004308997,0.000981446,0.0024734796,0.0010371706,0.0011774717],"domain_scores_gemma":[0.99383444,0.00010342553,0.0007523692,0.0033671916,0.0013497745,0.00059277366],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093383633,0.0011642963,0.0011189166,0.00074470387,0.000821658,0.0036302363,0.0023612704,0.0010092722,0.000075208394],"category_scores_gemma":[0.00014978898,0.0013308564,0.0005827617,0.0027067477,0.00035695249,0.001242626,0.0026363733,0.0017938176,0.000032005897],"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.00013371164,0.0017588508,0.024813186,0.0027855395,0.0020506617,0.0025121234,0.0004681468,0.0006114028,0.75770175,0.20390041,0.0032466804,0.000017560784],"study_design_scores_gemma":[0.0057496456,0.00066930684,0.15232158,0.0079398155,0.0014152555,0.0000030371627,0.00022312293,0.08249867,0.6562274,0.0007651616,0.0731658,0.019021232],"about_ca_topic_score_codex":0.00028960535,"about_ca_topic_score_gemma":0.000040938427,"teacher_disagreement_score":0.31278485,"about_ca_system_score_codex":0.00024020768,"about_ca_system_score_gemma":0.0016577481,"threshold_uncertainty_score":0.9989141},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16707711,0.00006135672,0.8319146,0.00038222419,0.00021402484,0.000055790042,0.000010480384,0.0000798817,0.00020450298],"genre_scores_gemma":[0.7957183,0.000008442402,0.20398961,0.00022789366,0.000013055418,0.0000016114736,0.00003104849,0.000002883522,0.000007124733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991032,0.00006465846,0.00020669602,0.00028578547,0.00018860918,0.0001510531],"domain_scores_gemma":[0.99937046,0.00003417929,0.0000694482,0.00036802707,0.00009336121,0.00006452859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000817893,0.00009211982,0.00013997595,0.000057121866,0.000054476197,0.0000793374,0.00033119187,0.000041948897,0.00003545029],"category_scores_gemma":[0.000014081134,0.00008265806,0.00008948288,0.00038419757,0.000037210673,0.00031091922,0.00027118094,0.000078835634,0.000008556465],"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.000027616168,0.0012038673,0.010041434,0.00019146707,0.000100678546,0.000058030695,0.0028879016,0.00025732222,0.032019358,0.9175119,0.0035784075,0.03212202],"study_design_scores_gemma":[0.0046960893,0.0002802659,0.23703343,0.00015070286,0.000055704997,0.00006497964,0.0002729473,0.35080197,0.33511114,0.06273831,0.007615302,0.0011791658],"about_ca_topic_score_codex":0.000022347107,"about_ca_topic_score_gemma":0.00006621395,"teacher_disagreement_score":0.8547736,"about_ca_system_score_codex":0.000006542904,"about_ca_system_score_gemma":0.00003714472,"threshold_uncertainty_score":0.33706978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8159775,0.0012298817,0.16483791,0.009382644,0.0003644838,0.00039338096,0.000009250544,0.0056939363,0.002111021],"genre_scores_gemma":[0.87794167,0.0004784128,0.12121064,0.00019934463,0.000039612205,0.00007217203,0.0000049898895,0.000028162896,0.000025018146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99664515,0.000020578384,0.0005467168,0.0014590345,0.0005293478,0.0007991451],"domain_scores_gemma":[0.9975686,0.00023024443,0.00027544115,0.0014502521,0.00035801128,0.00011745848],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053329114,0.00047808114,0.00049349666,0.00053117424,0.0004286376,0.0010514217,0.0041127685,0.00033741523,0.000013727191],"category_scores_gemma":[0.0042156377,0.0004529888,0.00013332795,0.001685549,0.00023371747,0.0021290989,0.010566732,0.0008137875,0.00002556192],"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.000050269682,0.0003989084,0.011017374,0.00067169586,0.00012665217,0.00011188581,0.007578501,0.0000017014429,0.10251078,0.73136985,0.0050035594,0.14115882],"study_design_scores_gemma":[0.0005742086,0.00022801175,0.0020525295,0.00060868124,0.00002135896,0.00016334801,0.002468409,0.0019780123,0.700123,0.26874405,0.022207702,0.0008306949],"about_ca_topic_score_codex":0.000012058066,"about_ca_topic_score_gemma":0.0000057249613,"teacher_disagreement_score":0.5976122,"about_ca_system_score_codex":0.00008679053,"about_ca_system_score_gemma":0.000087514745,"threshold_uncertainty_score":0.9999856},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38387057,0.00078212493,0.6095919,0.0015750737,0.00027590708,0.0005712581,0.000022363001,0.0025776906,0.0007331491],"genre_scores_gemma":[0.8947541,0.00008576687,0.10484485,0.00007750686,0.000019533278,0.00017896644,0.000007605711,0.000019017893,0.000012662063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976122,0.000008052374,0.00035319178,0.0010151061,0.00036054399,0.00065093813],"domain_scores_gemma":[0.99857855,0.000112330425,0.00016361517,0.0006920763,0.0003800396,0.000073376556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034470143,0.00035153152,0.0003608637,0.00031381598,0.0003539804,0.0003593836,0.0016355228,0.00017763716,0.0000031247878],"category_scores_gemma":[0.00044482874,0.0002920119,0.00013232046,0.00123947,0.00011372484,0.00042991512,0.0006198729,0.00037843524,0.000013611966],"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.00030751762,0.0023014413,0.007674101,0.0010618323,0.00031290707,0.00004942662,0.006460487,0.000062133724,0.06096615,0.8338706,0.0040073884,0.08292602],"study_design_scores_gemma":[0.0011193262,0.000650358,0.0007497185,0.00041451733,0.000041165393,0.00003924139,0.00093630695,0.0026118578,0.95374614,0.024956748,0.014117383,0.000617251],"about_ca_topic_score_codex":0.000004016354,"about_ca_topic_score_gemma":0.0000066303824,"teacher_disagreement_score":0.89277995,"about_ca_system_score_codex":0.0001031778,"about_ca_system_score_gemma":0.0001125819,"threshold_uncertainty_score":0.9999532},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12080847,0.00009549671,0.8744555,0.00021993017,0.00014698559,0.00004739111,0.0000032738615,0.000092955044,0.0041299947],"genre_scores_gemma":[0.95951617,0.000046831403,0.040075395,0.00027514974,0.000008288733,0.000005743149,0.000023011708,0.0000022532363,0.000047138863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999281,0.000044875345,0.00014372525,0.00026021944,0.00012444769,0.00014572903],"domain_scores_gemma":[0.99947804,0.00004158175,0.000020283313,0.00036738804,0.000048998038,0.00004372415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017063272,0.000064357846,0.00009899858,0.00007566429,0.000036657424,0.00007861368,0.0002682543,0.000029665429,0.00004774968],"category_scores_gemma":[0.000026228097,0.00006044161,0.00004661765,0.00041659983,0.000014097794,0.0004989448,0.00015115963,0.000102783146,0.000029388619],"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.0000254838,0.00019219742,0.001103712,0.000008778895,0.000007008679,0.0001269596,0.0004081747,0.0033801862,0.0014425165,0.97975886,0.001666445,0.011879674],"study_design_scores_gemma":[0.0012538534,0.000006099786,0.0007297135,0.000009447695,0.0000017196988,0.000024808947,0.000019742494,0.9028071,0.0029184397,0.091784395,0.00033210855,0.000112555506],"about_ca_topic_score_codex":0.000028965536,"about_ca_topic_score_gemma":0.000033483608,"teacher_disagreement_score":0.89942694,"about_ca_system_score_codex":0.000010672385,"about_ca_system_score_gemma":0.000057865655,"threshold_uncertainty_score":0.24647373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24962555,0.0049974783,0.743032,0.00038720353,0.001415557,0.0004309719,0.00006204127,0.000023920278,0.000025279749],"genre_scores_gemma":[0.9795213,0.00056442054,0.01783215,0.00031898034,0.0016972434,0.00001160842,0.000030208248,0.000021011301,0.000003124719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973101,0.0005519071,0.00055848854,0.0006462293,0.00048319067,0.00045007642],"domain_scores_gemma":[0.99572545,0.0016109651,0.00039164815,0.0013202608,0.0005843181,0.0003673766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018515514,0.0002547225,0.0005623026,0.0001543181,0.0004099026,0.0008275207,0.0014425496,0.00020517918,0.0000032207124],"category_scores_gemma":[0.0003582939,0.00020844932,0.00011568942,0.00043225166,0.000078113255,0.000493751,0.0009969836,0.0006950832,4.38364e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030957721,0.003021615,0.020600747,0.0026044566,0.002498064,0.0019500534,0.0506244,0.29279867,0.0035483008,0.33185476,0.028955348,0.25844783],"study_design_scores_gemma":[0.0017070003,0.0019125399,0.0065057958,0.0017411604,0.00009192415,0.0008129471,0.0025243103,0.974506,0.00020147928,0.0023606976,0.0071374285,0.00049869524],"about_ca_topic_score_codex":0.000047946058,"about_ca_topic_score_gemma":0.00001701792,"teacher_disagreement_score":0.7298957,"about_ca_system_score_codex":0.00003481884,"about_ca_system_score_gemma":0.00009140179,"threshold_uncertainty_score":0.8500316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007600176,0.00038693886,0.9714974,0.00027041457,0.0004045584,0.0002132212,0.000019010307,0.00020166866,0.026246728],"genre_scores_gemma":[0.7438018,0.0000037385068,0.25529912,0.00021907777,0.00009008578,0.00009522557,0.000028208377,0.000008034205,0.0004547279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924374,0.0000326351,0.00013212272,0.0003292841,0.000080762526,0.00018143207],"domain_scores_gemma":[0.9991328,0.00007701361,0.000024742892,0.00057797163,0.000112023816,0.00007546453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001617156,0.00007595359,0.00011506798,0.000039248534,0.00010008525,0.00023760724,0.00056888664,0.00003729846,0.000016302789],"category_scores_gemma":[0.000021183263,0.00006489999,0.000089303605,0.0004067284,0.000013467994,0.0005074671,0.00036329747,0.00004221902,0.000034598972],"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.00000221682,0.000069670845,0.000052986736,0.00009933511,0.000009671395,0.0000069043663,0.00020651832,6.133186e-7,0.00028414917,0.979829,0.011545537,0.007893382],"study_design_scores_gemma":[0.0022483917,0.00021867192,0.0007343218,0.00018866213,0.00002779824,0.00017695386,0.00051626685,0.059439063,0.17790274,0.0867637,0.67095864,0.0008247656],"about_ca_topic_score_codex":0.0000041301346,"about_ca_topic_score_gemma":0.000021244547,"teacher_disagreement_score":0.89306533,"about_ca_system_score_codex":0.000010982916,"about_ca_system_score_gemma":0.00010706663,"threshold_uncertainty_score":0.2646545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46187353,0.000079154655,0.5369398,0.00012788172,0.0006527506,0.00009185132,0.000062185994,0.00012481498,0.00004807416],"genre_scores_gemma":[0.9399075,0.00001505799,0.05957598,0.00036257436,0.00009018092,0.0000019474894,0.000025308751,0.000017034095,0.0000044417657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776745,0.00014015197,0.000365517,0.00095667125,0.00036558186,0.00040461883],"domain_scores_gemma":[0.99731225,0.00028746852,0.00011186923,0.0020253041,0.0001008963,0.00016223938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035431443,0.00023298043,0.00023603925,0.00013557861,0.0005711476,0.00031347625,0.0014555666,0.00009092705,0.000024700073],"category_scores_gemma":[0.000032886444,0.00025462976,0.00009401917,0.0005792931,0.00005576293,0.0002181699,0.0002612932,0.0004014669,0.000013113144],"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.00031695,0.009729483,0.022384284,0.0010894205,0.0015094209,0.00042790172,0.026412927,0.4864425,0.028733546,0.016535785,0.006820571,0.3995972],"study_design_scores_gemma":[0.00089932414,0.000045738867,0.0059532607,0.0000918136,0.000024042405,0.000013680844,0.00006762707,0.9889343,0.0019094347,0.0002543406,0.0014460456,0.00036039817],"about_ca_topic_score_codex":0.00004514917,"about_ca_topic_score_gemma":0.000021172196,"teacher_disagreement_score":0.5024918,"about_ca_system_score_codex":0.00004416484,"about_ca_system_score_gemma":0.00007567894,"threshold_uncertainty_score":0.9999906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020985366,0.00022611793,0.99616116,0.0005497575,0.00028254004,0.00015951491,0.000015127256,0.00021825665,0.00028900136],"genre_scores_gemma":[0.16017956,0.0000054042757,0.8392805,0.00036952182,0.000034424225,0.000022003496,0.00007781607,0.0000043399364,0.000026458545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912274,0.0000348757,0.00015259822,0.0003546992,0.00012744502,0.0002076345],"domain_scores_gemma":[0.99931914,0.00009926285,0.00004172108,0.00030405718,0.00016228316,0.000073525174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018908047,0.000090221445,0.000115417795,0.000045920857,0.00014806422,0.0002668726,0.00027492672,0.0000451282,0.000016929698],"category_scores_gemma":[0.000044975663,0.00008298484,0.000116452306,0.00045548088,0.00001917529,0.00050483405,0.00015566884,0.00006510662,0.000010364952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051834954,0.00031742497,0.0004687309,0.00005251271,0.00005608657,0.00001729049,0.00081660086,0.00010057543,0.0007533108,0.77021563,0.0058517857,0.22134484],"study_design_scores_gemma":[0.0015973389,0.00008569869,0.0016643765,0.0000155161,0.000030574818,0.000035320423,0.00030219727,0.82166725,0.01439986,0.04256653,0.11718613,0.0004491981],"about_ca_topic_score_codex":0.000017538923,"about_ca_topic_score_gemma":0.0001432371,"teacher_disagreement_score":0.8215667,"about_ca_system_score_codex":0.000007771875,"about_ca_system_score_gemma":0.00004566098,"threshold_uncertainty_score":0.33840236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04135397,0.0009717476,0.9522013,0.0020289582,0.00061942503,0.0010978726,0.0015675258,0.00010319393,0.000055981243],"genre_scores_gemma":[0.20753725,0.000024135097,0.78796715,0.0010112363,0.00017280548,0.0000566872,0.0031810415,0.000028890941,0.000020795826],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967905,0.0003985901,0.00064864976,0.0011138923,0.0005530139,0.0004953202],"domain_scores_gemma":[0.99325943,0.0005915002,0.0002690066,0.0054509975,0.00023652181,0.00019257107],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0027699575,0.0002221962,0.0005545032,0.00021260559,0.00023417603,0.00043330976,0.005750338,0.00010870032,0.00007772281],"category_scores_gemma":[0.0018775276,0.00022687115,0.00015481419,0.0009614046,0.00004319454,0.0013797706,0.008153806,0.00019733288,0.000006294653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004478779,0.009855837,0.0019740288,0.0035652788,0.0038087026,0.0003206994,0.01622383,0.0006864775,0.35151145,0.121979125,0.23689915,0.24869664],"study_design_scores_gemma":[0.02345813,0.00018741554,0.003121071,0.0006031157,0.0005704055,0.00002138582,0.00013703288,0.85622376,0.0253594,0.019072667,0.070107765,0.001137825],"about_ca_topic_score_codex":0.00004948455,"about_ca_topic_score_gemma":0.00035823742,"teacher_disagreement_score":0.8555373,"about_ca_system_score_codex":0.00002786458,"about_ca_system_score_gemma":0.00048622084,"threshold_uncertainty_score":0.99986804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008473305,0.00026506174,0.98293984,0.00043755164,0.0020419988,0.000603504,0.00013981233,0.00066705927,0.004431842],"genre_scores_gemma":[0.098694965,0.00007557149,0.90042615,0.0003427468,0.00013458892,0.000107154054,0.00018820814,0.000030116209,4.955048e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588394,0.00053934805,0.00075448793,0.0017366161,0.00030586793,0.00077976345],"domain_scores_gemma":[0.99663544,0.00040129657,0.0005445946,0.001952292,0.00015063322,0.00031575368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051964686,0.00061755674,0.00079953123,0.0005439128,0.0002989748,0.0002061571,0.0028989222,0.0004645553,0.00007262882],"category_scores_gemma":[0.00012553984,0.0006312649,0.0004898026,0.0002565713,0.00049882464,0.0002690744,0.0077527254,0.0018519387,0.00042227047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023624874,0.000273721,0.0037571432,0.000085289976,0.00016475254,0.00010199176,0.007679288,0.00097117515,0.00009291212,0.9777247,0.0009525205,0.008172911],"study_design_scores_gemma":[0.0005347633,0.000051704465,0.020594323,0.00008519238,0.000038226663,0.000062761035,0.00006420327,0.038039874,0.00031737037,0.93833154,0.0012012612,0.00067878095],"about_ca_topic_score_codex":0.00021938629,"about_ca_topic_score_gemma":0.00022098506,"teacher_disagreement_score":0.090221666,"about_ca_system_score_codex":0.000048722148,"about_ca_system_score_gemma":0.0002435636,"threshold_uncertainty_score":0.9996139},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13051057,0.00008708001,0.86790013,0.000023778373,0.0004051464,0.00015945308,0.00003098528,0.0006906037,0.00019222351],"genre_scores_gemma":[0.74278986,0.000005457181,0.25707912,0.000036864072,0.000030505033,0.00003085955,0.000012039484,0.000009869367,0.0000054241905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870354,0.000025783575,0.0002307885,0.00042358888,0.00023424026,0.00038205972],"domain_scores_gemma":[0.9986719,0.00010027724,0.00003525634,0.000907184,0.000116505864,0.00016885958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018149629,0.00020082894,0.00015910651,0.00018652953,0.00014025325,0.00021065163,0.0014520853,0.00008338482,0.00011386561],"category_scores_gemma":[0.00032315383,0.00020622276,0.000067746354,0.00049218617,0.00003102813,0.0003747678,0.0005773226,0.00024831865,0.00005741786],"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.0000124574835,0.00043638237,0.02181436,0.000236516,0.00013663477,0.00015658393,0.04758743,0.032052755,0.0010674715,0.8869672,0.0009577791,0.008574445],"study_design_scores_gemma":[0.000748454,0.00017751375,0.21556172,0.00028526463,0.000028257338,0.00007098436,0.000093175855,0.7679649,0.0047353394,0.0027466174,0.0061096908,0.0014781038],"about_ca_topic_score_codex":0.000095917836,"about_ca_topic_score_gemma":0.00000934025,"teacher_disagreement_score":0.88422054,"about_ca_system_score_codex":0.000023467137,"about_ca_system_score_gemma":0.000104778526,"threshold_uncertainty_score":0.840952},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448408,0.00013864132,0.9497981,0.0016788811,0.00079055474,0.0012108895,0.0001440957,0.0007607032,0.0009940679],"genre_scores_gemma":[0.14353609,0.00015570656,0.8548452,0.0003016072,0.00020914657,0.00059717597,0.00031609272,0.000038589995,3.7511253e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995527,0.00058211724,0.00063192204,0.0018695107,0.00054879277,0.00084063975],"domain_scores_gemma":[0.99629194,0.0003091324,0.00059749524,0.0022810237,0.00023935265,0.00028105584],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0004382277,0.00069599535,0.0007692473,0.0006974703,0.0005341246,0.00020944752,0.002113209,0.0005276541,0.000035014607],"category_scores_gemma":[0.0001193266,0.0006464222,0.0003763188,0.00053685514,0.0006826257,0.00031850522,0.002346815,0.0023568487,0.0001356059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002135115,0.0003359381,0.005045721,0.0001672845,0.00020271186,0.00032829522,0.0023097184,0.0055924254,0.00046323027,0.9807421,0.0006081138,0.0039909533],"study_design_scores_gemma":[0.0018290051,0.00053335965,0.02811146,0.00044811238,0.000080567195,0.00055717956,0.0000671062,0.044902366,0.003572704,0.9071845,0.011008107,0.001705525],"about_ca_topic_score_codex":0.00021405781,"about_ca_topic_score_gemma":0.00022519719,"teacher_disagreement_score":0.09905201,"about_ca_system_score_codex":0.00011698083,"about_ca_system_score_gemma":0.00068943785,"threshold_uncertainty_score":0.99994475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095528265,0.0011326711,0.9947801,0.000292346,0.0005403688,0.0009779778,0.00008094544,0.00010799351,0.001132312],"genre_scores_gemma":[0.72741,0.0004049703,0.2668288,0.00066844985,0.0010617777,0.00018825493,0.0032865813,0.00009933123,0.00005181699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602497,0.000108179986,0.0024008702,0.00038950925,0.0007188976,0.0003575532],"domain_scores_gemma":[0.9941823,0.0007468563,0.0025177244,0.00074329035,0.0017316114,0.00007820112],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0072454754,0.00035875864,0.0009122018,0.0007356918,0.00014087932,0.00047630613,0.0013122264,0.000556442,0.000025681225],"category_scores_gemma":[0.008543403,0.00033058273,0.00024415797,0.00065280375,0.0000961961,0.0032291196,0.00049029617,0.0005373639,0.0000055955193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047190636,0.000290934,0.000072536364,0.0034353707,0.00010429875,0.0000013713028,0.0019810186,0.018985655,0.0000900743,0.22836445,0.00032735927,0.745875],"study_design_scores_gemma":[0.0050706193,0.00017234063,0.00005550012,0.0015655829,0.0001282341,0.000008617996,0.000009915549,0.50946665,0.0010895302,0.44770658,0.033854682,0.00087176106],"about_ca_topic_score_codex":0.000008496478,"about_ca_topic_score_gemma":0.000011542819,"teacher_disagreement_score":0.7450033,"about_ca_system_score_codex":0.00014052965,"about_ca_system_score_gemma":0.0009632127,"threshold_uncertainty_score":0.99991465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81652075,0.028282788,0.15113656,0.0017318673,0.00024040056,0.00018162969,0.000010355816,0.00016585444,0.0017297866],"genre_scores_gemma":[0.9894524,0.0046483586,0.005417712,0.00034893097,0.000062134204,0.00000759654,0.00005381162,0.0000065451163,0.0000024839783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986193,0.0003294719,0.00024951072,0.00037791402,0.00017174007,0.0002520599],"domain_scores_gemma":[0.9976614,0.00038030834,0.00010449626,0.0016385792,0.0000841991,0.00013102149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213081,0.00014981675,0.00018579305,0.00005233889,0.00055949774,0.00046279686,0.0009510163,0.000116350435,0.000012063492],"category_scores_gemma":[0.000038283793,0.00016269552,0.000054329448,0.00044379578,0.0001444554,0.00039879122,0.003037081,0.00046410604,0.0000010648735],"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.000041971525,0.0004049686,0.008080758,0.00009568648,0.00008639778,0.000020868714,0.011660256,0.0013476829,0.000067810026,0.95758694,0.0018249623,0.0187817],"study_design_scores_gemma":[0.0010546524,0.000046701112,0.03368531,0.00022362414,0.00002999321,0.00009969602,0.00071271654,0.84659183,0.000167681,0.09720288,0.019591985,0.0005929352],"about_ca_topic_score_codex":0.00010199867,"about_ca_topic_score_gemma":0.00022765192,"teacher_disagreement_score":0.86038405,"about_ca_system_score_codex":0.00001518998,"about_ca_system_score_gemma":0.000028891274,"threshold_uncertainty_score":0.66345304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8082753,0.0017346629,0.1851685,0.0012427251,0.00027248502,0.00012363434,0.000023634519,0.00017259801,0.0029864467],"genre_scores_gemma":[0.9485351,0.00016656615,0.050246857,0.0009532751,0.000054786877,0.0000057822067,0.000008615204,0.0000057238904,0.000023302788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99856573,0.000104750376,0.00020095226,0.0005794197,0.00025134362,0.00029782063],"domain_scores_gemma":[0.99864024,0.00016586196,0.00005011814,0.0009429307,0.00006484462,0.00013598801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037328544,0.0001441893,0.0001748299,0.00007494278,0.00019608348,0.00038202282,0.00083310716,0.00006886134,0.00018631732],"category_scores_gemma":[0.00010230274,0.00012853961,0.00007934855,0.00042835964,0.00008024062,0.0004647102,0.0019030913,0.0001561118,0.000011212447],"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.000042793574,0.0007660922,0.17745247,0.0002950232,0.00017131504,0.0005892692,0.0080426745,0.0006725485,0.019230276,0.76176983,0.014735547,0.016232137],"study_design_scores_gemma":[0.0022486155,0.0001286978,0.57053006,0.00013798547,0.00005306759,0.00020548432,0.00065664767,0.27851018,0.01215356,0.08442788,0.049358044,0.0015897616],"about_ca_topic_score_codex":0.0002805704,"about_ca_topic_score_gemma":0.0002156125,"teacher_disagreement_score":0.67734194,"about_ca_system_score_codex":0.000021332326,"about_ca_system_score_gemma":0.00009001863,"threshold_uncertainty_score":0.5241693},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012779776,0.0009733915,0.983525,0.00084842334,0.000055124612,0.00018406387,0.00041074178,0.00007222198,0.0011513024],"genre_scores_gemma":[0.2575115,0.0005756662,0.7344092,0.0032837794,0.000075848446,0.00012019968,0.0039362162,0.000010465052,0.00007711451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938446,0.00002928014,0.000114813665,0.00027532753,0.000063661726,0.00013248355],"domain_scores_gemma":[0.99924016,0.000062719235,0.00001738875,0.0006108132,0.000018358158,0.000050582184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102368555,0.000070040565,0.00007795775,0.000048545193,0.00007949487,0.000056646626,0.00028364846,0.0000115279545,0.00008036528],"category_scores_gemma":[0.0000033425506,0.000057962607,0.000015831194,0.000323235,0.000023146116,0.0005409518,0.00060037913,0.00006317282,0.00001133529],"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.0000024662552,0.0005215818,0.056583267,0.000035496363,0.000024737577,0.0000121386365,0.0002930673,0.0000019716324,0.00052553153,0.9175874,0.0116751,0.012737244],"study_design_scores_gemma":[0.0007180246,0.000024468556,0.01082662,0.000022481692,0.0000058646924,0.00001224089,0.0010954145,0.0065690274,0.015335658,0.024307478,0.9407742,0.000308505],"about_ca_topic_score_codex":0.00021071259,"about_ca_topic_score_gemma":0.0007885258,"teacher_disagreement_score":0.92909914,"about_ca_system_score_codex":0.0000059629074,"about_ca_system_score_gemma":0.000023837698,"threshold_uncertainty_score":0.23636466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6894248,0.00010361468,0.30671683,0.00077962223,0.00031848802,0.00012271354,0.000014370343,0.00008862581,0.0024309272],"genre_scores_gemma":[0.9537266,0.00003831299,0.045961287,0.000223097,0.000025778007,0.0000017993366,0.000019803616,0.0000014863202,0.0000018600618],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9973049,0.000029420045,0.0003753528,0.0007561273,0.0010108551,0.00052329997],"domain_scores_gemma":[0.9983013,0.000047431124,0.00019342077,0.0011603683,0.0001428293,0.00015462277],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.003553655,0.0001468463,0.0001619547,0.00046853602,0.0009881938,0.0030641826,0.004748339,0.00003153024,0.000010531965],"category_scores_gemma":[0.00029004994,0.00011491192,0.000015846,0.0055922335,0.0010454459,0.02577206,0.004321706,0.00017775697,0.000009747052],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011369944,0.00014552794,0.25040296,0.00017483807,0.000009482874,0.000049447495,0.05134053,0.0013147647,0.00030379844,0.33423746,0.00021827746,0.36179155],"study_design_scores_gemma":[0.0005082159,0.00009782112,0.6939246,0.00018301848,0.000003490162,0.00018485702,0.0019340458,0.29576993,0.0013567826,0.005046499,0.0005595166,0.00043120116],"about_ca_topic_score_codex":0.000183845,"about_ca_topic_score_gemma":0.00013861712,"teacher_disagreement_score":0.44352165,"about_ca_system_score_codex":0.00004085383,"about_ca_system_score_gemma":0.00075769343,"threshold_uncertainty_score":0.99797076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04317788,0.017618516,0.8487091,0.062462006,0.004110052,0.01480765,0.0006893454,0.0009742453,0.007451221],"genre_scores_gemma":[0.4896096,0.0010609735,0.5010348,0.0036008658,0.0014252071,0.002541506,0.00012766423,0.000121997335,0.0004773862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761474,0.0001567024,0.0004306409,0.0007988126,0.000405386,0.00059370743],"domain_scores_gemma":[0.99721104,0.0014528651,0.0001495988,0.0009256387,0.00016103184,0.00009980889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011371694,0.00030322516,0.00035476635,0.00009132674,0.0004597002,0.0007733697,0.001007348,0.00010528059,0.000013746904],"category_scores_gemma":[0.00010639045,0.00018061684,0.00014655909,0.00086613424,0.00022642876,0.00071403844,0.00047872055,0.00039764307,0.000011650408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022538546,0.0012286921,0.0035951056,0.0004539299,0.00039588,0.0001781357,0.01254016,0.00030572014,0.00050272094,0.5174238,0.0022364946,0.460914],"study_design_scores_gemma":[0.012772171,0.0014402871,0.028659485,0.0009409084,0.00030137374,0.00042686315,0.002020859,0.7163406,0.0049770763,0.08687275,0.14283077,0.0024168387],"about_ca_topic_score_codex":0.0002055308,"about_ca_topic_score_gemma":0.00052167894,"teacher_disagreement_score":0.7160349,"about_ca_system_score_codex":0.000036422363,"about_ca_system_score_gemma":0.00013459612,"threshold_uncertainty_score":0.74576217},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11548699,0.000049367358,0.87994623,0.0015861823,0.0006527909,0.00013927846,0.00006087849,0.00016456092,0.0019137317],"genre_scores_gemma":[0.92113703,0.000019913556,0.0772105,0.001457632,0.00007232289,0.00001927618,0.00007867687,0.0000017207808,0.000002906371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837834,0.0000528219,0.00024841592,0.0002674694,0.000761648,0.00029129538],"domain_scores_gemma":[0.9990778,0.00008284027,0.00010942367,0.00041368444,0.00015800656,0.00015825144],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0011117825,0.00009472128,0.000093555485,0.00044810315,0.0011491245,0.0013137145,0.0010548778,0.000018134424,0.000074720985],"category_scores_gemma":[0.000035154895,0.00009015207,0.000031073025,0.001676123,0.00021603591,0.01823918,0.0018080809,0.00016094856,0.000031224285],"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.0000066768393,0.00004430294,0.0010649997,0.000009782131,0.0000055181454,0.0000017831571,0.007997173,0.00026281414,0.00018173616,0.8458229,0.002996384,0.14160597],"study_design_scores_gemma":[0.0005142239,0.00018208307,0.025502006,0.000005310427,0.0000021428268,0.000028404975,0.00025034722,0.7596859,0.00019175945,0.013029338,0.20034388,0.000264618],"about_ca_topic_score_codex":0.00005585964,"about_ca_topic_score_gemma":0.0000035137514,"teacher_disagreement_score":0.83279353,"about_ca_system_score_codex":0.000034943256,"about_ca_system_score_gemma":0.00015602006,"threshold_uncertainty_score":0.999723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014588888,0.0002695372,0.98036134,0.0007357346,0.000721557,0.0001885335,0.0000740379,0.00048491076,0.0025754867],"genre_scores_gemma":[0.32976645,0.00004043841,0.6684903,0.0010373095,0.00009681997,0.000042398646,0.0005026707,0.0000104747605,0.000013137779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.00009940138,0.00026529512,0.0009229729,0.00037445917,0.00026859142],"domain_scores_gemma":[0.99772656,0.000071358714,0.000116326046,0.001810061,0.00014828162,0.00012743386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031635203,0.00024509782,0.0002634421,0.00016447043,0.00008446871,0.00072464714,0.0014161171,0.00015204572,0.00029684496],"category_scores_gemma":[0.000041498188,0.0002462768,0.00026973523,0.00027984977,0.000040726492,0.00033714372,0.0020360763,0.00052997726,0.000042382824],"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.000037342932,0.001394852,0.0016247551,0.0010014789,0.00026535837,0.0006027998,0.0007106442,0.0015921525,0.0061329827,0.9079775,0.04474988,0.033910237],"study_design_scores_gemma":[0.0007230294,0.00006589277,0.0015153263,0.00029089488,0.000030044881,0.00002335599,0.000040324278,0.8963694,0.024180656,0.05173529,0.02372855,0.0012972524],"about_ca_topic_score_codex":0.00010991732,"about_ca_topic_score_gemma":0.000060229322,"teacher_disagreement_score":0.89477724,"about_ca_system_score_codex":0.000035375957,"about_ca_system_score_gemma":0.00034364167,"threshold_uncertainty_score":0.9999989},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24509849,0.0016573686,0.7484794,0.0012071078,0.0018258793,0.00035752603,0.000017900107,0.00047487917,0.00088140304],"genre_scores_gemma":[0.9809719,0.00047006007,0.017606558,0.00032157666,0.000260736,0.000046856832,0.0002024491,0.000032265198,0.000087600114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964993,0.0005867702,0.00061553315,0.0010741879,0.0005348934,0.00068929687],"domain_scores_gemma":[0.9982011,0.0002553617,0.00022963792,0.0008048949,0.00029271367,0.00021630664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068387843,0.00037552862,0.00042889977,0.00027780625,0.00044527266,0.00071820355,0.00065884826,0.0003358001,0.00035255164],"category_scores_gemma":[0.00021932057,0.0004176362,0.00020596238,0.0031553821,0.00007447237,0.0013247991,0.00030817447,0.000983594,0.00028103185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021283216,0.0023724744,0.049160916,0.00025221234,0.00029167844,0.0028643385,0.008508822,0.019770078,0.02460973,0.04507484,0.016737813,0.8301443],"study_design_scores_gemma":[0.005378949,0.00023128328,0.044881724,0.00096403604,0.000080831924,0.0004625553,0.0016000782,0.8438485,0.022608388,0.026191346,0.050945893,0.0028063806],"about_ca_topic_score_codex":0.0001484763,"about_ca_topic_score_gemma":0.0016899332,"teacher_disagreement_score":0.82733786,"about_ca_system_score_codex":0.00014277644,"about_ca_system_score_gemma":0.0001936848,"threshold_uncertainty_score":0.99982756},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014588888,0.0002695372,0.98036134,0.0007357346,0.000721557,0.0001885335,0.0000740379,0.00048491076,0.0025754867],"genre_scores_gemma":[0.32976645,0.00004043841,0.6684903,0.0010373095,0.00009681997,0.000042398646,0.0005026707,0.0000104747605,0.000013137779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.00009940138,0.00026529512,0.0009229729,0.00037445917,0.00026859142],"domain_scores_gemma":[0.99772656,0.000071358714,0.000116326046,0.001810061,0.00014828162,0.00012743386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031635203,0.00024509782,0.0002634421,0.00016447043,0.00008446871,0.00072464714,0.0014161171,0.00015204572,0.00029684496],"category_scores_gemma":[0.000041498188,0.0002462768,0.00026973523,0.00027984977,0.000040726492,0.00033714372,0.0020360763,0.00052997726,0.000042382824],"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.000037342932,0.001394852,0.0016247551,0.0010014789,0.00026535837,0.0006027998,0.0007106442,0.0015921525,0.0061329827,0.9079775,0.04474988,0.033910237],"study_design_scores_gemma":[0.0007230294,0.00006589277,0.0015153263,0.00029089488,0.000030044881,0.00002335599,0.000040324278,0.8963694,0.024180656,0.05173529,0.02372855,0.0012972524],"about_ca_topic_score_codex":0.00010991732,"about_ca_topic_score_gemma":0.000060229322,"teacher_disagreement_score":0.89477724,"about_ca_system_score_codex":0.000035375957,"about_ca_system_score_gemma":0.00034364167,"threshold_uncertainty_score":0.9999989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10330958,0.005398318,0.805569,0.053686056,0.001734612,0.00059590826,0.0008565201,0.0007583145,0.028091665],"genre_scores_gemma":[0.6658337,0.0040799975,0.328933,0.0005731993,0.00017587391,0.000037849015,0.00031340792,0.000013553383,0.00003938765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996625,0.0005229448,0.0005997527,0.00074302114,0.00095265574,0.00055662176],"domain_scores_gemma":[0.9913934,0.00023619026,0.00021104218,0.0067918804,0.00091086933,0.00045664937],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000552826,0.0003410152,0.0004365077,0.00008903103,0.0005284677,0.00051641674,0.007796117,0.00021402142,0.0003682739],"category_scores_gemma":[0.0005974185,0.0003311554,0.00016120513,0.001989397,0.00031785105,0.0010986337,0.0051557873,0.00076783897,0.00006000564],"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.00005877243,0.002878001,0.04368727,0.00013605964,0.00041458613,0.00044000687,0.0012091263,0.000069454276,0.00045700627,0.7316316,0.010880126,0.20813802],"study_design_scores_gemma":[0.008345997,0.00075590116,0.17503317,0.0050283745,0.00048343992,0.0020110502,0.0073448117,0.20552558,0.0049793185,0.10871836,0.4758815,0.0058925324],"about_ca_topic_score_codex":0.0010468917,"about_ca_topic_score_gemma":0.0035105743,"teacher_disagreement_score":0.62291324,"about_ca_system_score_codex":0.00015518746,"about_ca_system_score_gemma":0.0017251413,"threshold_uncertainty_score":0.99991405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27664188,0.000037914735,0.72144836,0.00095906836,0.00016486619,0.00032959649,0.00022995776,0.000063412575,0.00012491902],"genre_scores_gemma":[0.99769264,0.000033758253,0.0012724478,0.00091954984,0.0000052635687,0.00005942568,0.000013171196,0.0000034060122,3.1986434e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988534,0.000087254986,0.00029049668,0.00021130353,0.00033751523,0.00022003143],"domain_scores_gemma":[0.99925274,0.00009658327,0.00010521893,0.00035793707,0.00007712914,0.00011040828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040297504,0.00013715343,0.0001644213,0.00029134474,0.0006085085,0.0002688993,0.00036602753,0.00004867253,0.000012878493],"category_scores_gemma":[0.0000052672076,0.00012991247,0.000035406138,0.0005581578,0.000069639216,0.0012321749,0.00003882004,0.00046388392,5.53063e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018282396,0.0013249234,0.014512204,0.0012242375,0.00020824472,0.000053159216,0.10156291,0.32818747,0.000025321513,0.35823053,0.0013160869,0.19152668],"study_design_scores_gemma":[0.002442193,0.00035647376,0.007514477,0.000035598285,0.000015093687,0.000054994834,0.0009592002,0.9698894,0.000101839345,0.015030786,0.0032297655,0.000370189],"about_ca_topic_score_codex":0.00039109073,"about_ca_topic_score_gemma":0.0003545882,"teacher_disagreement_score":0.7210508,"about_ca_system_score_codex":0.00004933588,"about_ca_system_score_gemma":0.00006475347,"threshold_uncertainty_score":0.5297677},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035187672,0.0014638968,0.98847115,0.0025163193,0.0033600181,0.00047724522,0.00014643176,0.0003715155,0.00284152],"genre_scores_gemma":[0.24803828,0.0005066019,0.74369895,0.0057890755,0.0011584938,0.000050499646,0.0005777982,0.00011701979,0.000063265055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99342984,0.00011213309,0.0007158626,0.0024744777,0.00205069,0.0012169984],"domain_scores_gemma":[0.9958135,0.00027306387,0.0003300787,0.0027640993,0.0004637267,0.00035553408],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016835529,0.0007885661,0.000709774,0.0018094332,0.0010327516,0.001563711,0.0066276523,0.0003819792,0.00054638356],"category_scores_gemma":[0.000150127,0.0007891396,0.00034186326,0.0017524395,0.0010040908,0.0033144325,0.004673099,0.0014660397,0.00006311218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018286508,0.000120944176,0.0000836547,0.00007073332,0.00003806766,0.00017934467,0.0024641645,0.0012932005,0.00061921077,0.73647964,0.0001633558,0.2584694],"study_design_scores_gemma":[0.0005370689,0.0007173002,0.00025950937,0.00016722197,0.000030855466,0.00037908496,0.000003002178,0.21537904,0.0010724375,0.67092204,0.10857886,0.0019535937],"about_ca_topic_score_codex":0.0002746765,"about_ca_topic_score_gemma":0.00018351499,"teacher_disagreement_score":0.2565158,"about_ca_system_score_codex":0.00044327968,"about_ca_system_score_gemma":0.0010584876,"threshold_uncertainty_score":0.99947274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025748853,0.00046212575,0.990334,0.0002821492,0.00030413875,0.0005645597,0.0005192202,0.00045508935,0.004503845],"genre_scores_gemma":[0.9594498,0.0013560922,0.03209037,0.0024581423,0.0003293528,0.0017365655,0.0022147612,0.00006345355,0.00030142517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791735,0.00053677027,0.00022274884,0.00084089115,0.000294882,0.00018735802],"domain_scores_gemma":[0.9975028,0.0005543585,0.000116760944,0.0016448301,0.00007547559,0.000105785344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018865265,0.00020630467,0.00019967451,0.00020822826,0.00030557538,0.00031612246,0.0014692903,0.00011573241,0.00034562347],"category_scores_gemma":[0.00005105406,0.00019754484,0.00007978491,0.0004043599,0.00009142248,0.00011459998,0.0029586474,0.00059550564,0.000044814005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009237676,0.00009828139,0.001308619,0.00001925145,0.0000201204,0.0000017193113,0.00012396315,0.00003235307,0.0000027621327,0.9862055,0.0031985156,0.008979638],"study_design_scores_gemma":[0.0001742989,0.00008391138,0.1393455,0.000012328499,0.000012906802,0.0000053430963,0.000034103814,0.0007919898,0.000018462542,0.8093147,0.04972697,0.00047942452],"about_ca_topic_score_codex":0.0003081203,"about_ca_topic_score_gemma":0.00017122681,"teacher_disagreement_score":0.9582436,"about_ca_system_score_codex":0.000024113224,"about_ca_system_score_gemma":0.00009960826,"threshold_uncertainty_score":0.8055645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15927753,0.000031286487,0.8399159,0.00026606352,0.0001654485,0.00017411898,0.000017445616,0.0000973451,0.00005487464],"genre_scores_gemma":[0.86651194,0.0000053043077,0.13277274,0.000660409,0.000013190264,0.000016207843,0.00001824756,0.0000011265105,8.220622e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883336,0.00004357378,0.00020365613,0.00026907408,0.00046695652,0.0001833621],"domain_scores_gemma":[0.99924165,0.00004021737,0.00010013298,0.0003555649,0.00015199395,0.000110454675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009183857,0.0000907466,0.00008994087,0.00024859226,0.0009200133,0.0005940328,0.00054116274,0.000015362888,0.000011410026],"category_scores_gemma":[0.000015805339,0.000078997204,0.00001644416,0.001054102,0.0003156274,0.0072291973,0.00049879396,0.00011239206,0.0000022976226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022192766,0.00087935757,0.061931316,0.0003325165,0.000029510726,0.000012171783,0.035668734,0.013028454,0.00081025384,0.23768519,0.0033922596,0.6460083],"study_design_scores_gemma":[0.00072735274,0.00024153214,0.15742691,0.000005168023,0.0000029307034,0.000042277825,0.00009668728,0.8323706,0.00023734351,0.0001984587,0.008482044,0.00016873513],"about_ca_topic_score_codex":0.000020943444,"about_ca_topic_score_gemma":0.000002769369,"teacher_disagreement_score":0.81934214,"about_ca_system_score_codex":0.00002993847,"about_ca_system_score_gemma":0.00013152127,"threshold_uncertainty_score":0.7076092},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14415775,0.0019481875,0.843187,0.0035098812,0.000791791,0.0008370054,0.00015848101,0.00038094522,0.005028982],"genre_scores_gemma":[0.9866115,0.00005560818,0.010787028,0.002226536,0.000038631133,0.00022161892,0.000042645584,0.000013904106,0.0000025279642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755853,0.0003982518,0.00033340647,0.0005536607,0.00068379054,0.0004723698],"domain_scores_gemma":[0.9982854,0.00024882655,0.00010754902,0.0012265926,0.00004305953,0.000088586254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011040773,0.00022599555,0.00025096725,0.00051518885,0.0006418562,0.00023855356,0.0026064562,0.00005513736,0.00007794343],"category_scores_gemma":[0.00002155662,0.00017459397,0.00032083076,0.003250288,0.00012769086,0.0005131624,0.0006144668,0.0006469468,0.000011667716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007855197,0.00043797938,0.0019428022,0.000010569095,0.000020181216,0.000034115077,0.004155585,0.0011010845,0.000076595155,0.9721445,0.019070223,0.0009278134],"study_design_scores_gemma":[0.0032859847,0.00031417748,0.0036677541,0.000014512282,0.00002248797,0.000044140328,0.0009504599,0.27814642,0.000045997273,0.6307808,0.08210639,0.0006208276],"about_ca_topic_score_codex":0.000063378146,"about_ca_topic_score_gemma":0.00003888383,"teacher_disagreement_score":0.8424537,"about_ca_system_score_codex":0.000015048133,"about_ca_system_score_gemma":0.00006173149,"threshold_uncertainty_score":0.71197355},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40583274,0.00934377,0.58301187,0.0001492682,0.0011975886,0.0001353648,0.0000032848054,0.00020037068,0.00012574294],"genre_scores_gemma":[0.98397666,0.0018853379,0.014043987,0.000017924876,0.000030591524,0.000035486977,5.533147e-7,0.0000057061898,0.0000037490586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981667,0.000047985566,0.00032031775,0.00040078454,0.00050527026,0.00055896],"domain_scores_gemma":[0.99925077,0.00006695749,0.0001251187,0.00038698828,0.00005961139,0.000110532004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025957313,0.00013546509,0.0001952381,0.0041264333,0.0008110399,0.00020984153,0.0015552228,0.00005868354,0.0000017041164],"category_scores_gemma":[0.00013912344,0.00013199511,0.000031746382,0.008836967,0.00027872398,0.0024411452,0.00055249635,0.0008462921,0.0000018042098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004844146,0.000052368076,0.010522226,0.000057630463,0.000007636814,0.00012810511,0.0005748531,0.14615741,0.0048595993,0.8113166,0.000016114589,0.026302604],"study_design_scores_gemma":[0.0015762686,0.00073539576,0.0051984224,0.00030880392,0.000009072642,0.004921172,0.0018229092,0.80291504,0.0014508755,0.034294154,0.14568694,0.0010809256],"about_ca_topic_score_codex":0.0000023703758,"about_ca_topic_score_gemma":8.2370667e-7,"teacher_disagreement_score":0.7770224,"about_ca_system_score_codex":0.00016104525,"about_ca_system_score_gemma":0.00006304919,"threshold_uncertainty_score":0.6237945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94604784,0.00088145986,0.050901774,0.0010420608,0.0009276634,0.00009845423,0.0000065736594,0.000026286712,0.00006787162],"genre_scores_gemma":[0.97765076,0.00003312882,0.021874525,0.00037568674,0.000046857327,0.0000044472235,0.000001293675,0.000007454286,0.0000058636565],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980926,0.00027105052,0.00048243033,0.0002940797,0.0005697518,0.000290086],"domain_scores_gemma":[0.99898094,0.00018389328,0.0003079622,0.00032047185,0.000073937226,0.00013276866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016180645,0.00013031534,0.00022408059,0.0003960575,0.00020185347,0.00011109286,0.0012447183,0.00003868114,0.000060131435],"category_scores_gemma":[0.00011447144,0.0001256633,0.000104595965,0.00030983114,0.000048553833,0.00057235704,0.0016201921,0.0009127363,0.0000012459866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015274643,0.0032740398,0.41878185,0.0010188705,0.0004154676,0.0026563967,0.29790643,0.018235264,0.04393328,0.09123022,0.021811906,0.099208824],"study_design_scores_gemma":[0.0052894973,0.0012175217,0.10299986,0.0014553522,0.000032265874,0.005188456,0.0027350876,0.8483982,0.0044996203,0.01345882,0.013533997,0.0011913333],"about_ca_topic_score_codex":0.00045308704,"about_ca_topic_score_gemma":0.0000168162,"teacher_disagreement_score":0.83016294,"about_ca_system_score_codex":0.00008800794,"about_ca_system_score_gemma":0.000070212656,"threshold_uncertainty_score":0.51244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018096535,0.0002040839,0.97356975,0.0061224955,0.0014076012,0.0002110332,0.000041679046,0.00017032993,0.00017647965],"genre_scores_gemma":[0.17248376,0.0000636399,0.8265272,0.00041588928,0.00042424613,0.000021022894,0.00002069034,0.000038572536,0.0000049952896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966214,0.0003089426,0.0013898914,0.00047742628,0.0007447283,0.0004576552],"domain_scores_gemma":[0.9962851,0.00066072296,0.0012638599,0.001068722,0.00044382262,0.0002777937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018046107,0.00036176518,0.0010599535,0.0006610954,0.0000836213,0.0002220276,0.0023668944,0.00039805463,0.00005958336],"category_scores_gemma":[0.00092482474,0.00030260687,0.00067796704,0.0003327019,0.00011878534,0.0002710805,0.0011570518,0.0015842078,0.00022262271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009539182,0.00071654,0.00012676338,0.0009620377,0.00024794036,0.0008980282,0.00026685337,0.00035803832,0.0004974131,0.9736672,0.020759022,0.0014047634],"study_design_scores_gemma":[0.00062477874,0.00026607586,0.00014461606,0.00039946544,0.00006713115,0.0004391733,0.00003216537,0.043093808,0.0006415702,0.95284796,0.0011284635,0.00031482274],"about_ca_topic_score_codex":0.0000019724628,"about_ca_topic_score_gemma":0.0000021024264,"teacher_disagreement_score":0.15438722,"about_ca_system_score_codex":0.00007494834,"about_ca_system_score_gemma":0.00046198315,"threshold_uncertainty_score":0.9999426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003043002,0.002041206,0.80825454,0.00068883004,0.00054731226,0.0002315318,0.000031754775,0.00040988543,0.18779188],"genre_scores_gemma":[0.6318743,0.029259248,0.15617566,0.048623353,0.033412825,0.00056906336,0.011088895,0.0014490603,0.08754755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834466,0.00001738838,0.00030105474,0.00077935634,0.00029432785,0.00026319255],"domain_scores_gemma":[0.9983213,0.00006521262,0.00023449035,0.0011079123,0.00007275697,0.00019830682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009809688,0.000345631,0.00034866523,0.00008216517,0.00013040383,0.00019477552,0.0014128748,0.00050199154,0.000066692104],"category_scores_gemma":[0.0000032142063,0.00035968877,0.00021625735,0.00013219976,0.00007299888,0.0002474568,0.00051077513,0.00076896686,0.00016715235],"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.0000045330376,0.000007743844,0.0000039561196,0.0000177455,0.000031781645,0.000019548565,0.000060127306,0.0000702353,0.0000012050045,0.9183698,0.029147387,0.05226593],"study_design_scores_gemma":[0.00018067354,0.000049228784,0.000030721145,0.00013472003,0.000032094697,0.000015374739,0.0000017189399,0.12078009,0.0000058297114,0.14499067,0.7331609,0.00061797106],"about_ca_topic_score_codex":0.00000461857,"about_ca_topic_score_gemma":0.000017060358,"teacher_disagreement_score":0.77337915,"about_ca_system_score_codex":0.000028422362,"about_ca_system_score_gemma":0.000055885183,"threshold_uncertainty_score":0.9998855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003497123,0.00093562814,0.7313692,0.00006143218,0.0013182331,0.0004415135,0.00014046086,0.00039275875,0.26184362],"genre_scores_gemma":[0.41721418,0.000003931672,0.5784035,0.0018849629,0.0020997105,0.0000045155753,0.00003258053,0.00007829619,0.00027832907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962037,0.000063431864,0.0006410733,0.0015346188,0.00083027105,0.00072685897],"domain_scores_gemma":[0.9968892,0.00008438875,0.0003802114,0.0018156382,0.00029155563,0.00053905055],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00034038213,0.0006716182,0.0006762123,0.0001887074,0.00048814501,0.0015837225,0.0022229978,0.00064886,0.000033173437],"category_scores_gemma":[0.00005373415,0.0007476644,0.00028486553,0.00019924362,0.00014103267,0.00036693097,0.0016027763,0.0008233146,0.000030491605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018112833,0.00003078828,0.000020984755,0.000067945555,0.000044714943,0.00018855034,0.0010809102,0.00004728216,0.00004921158,0.92882466,0.00009100095,0.06953585],"study_design_scores_gemma":[0.0005735028,0.0002283138,0.00007464141,0.00269728,0.00012703151,0.00035211808,0.00007940294,0.008485113,0.00031896812,0.9255527,0.059432335,0.0020785704],"about_ca_topic_score_codex":0.000089413355,"about_ca_topic_score_gemma":0.000038823066,"teacher_disagreement_score":0.41371706,"about_ca_system_score_codex":0.00020314028,"about_ca_system_score_gemma":0.0006385587,"threshold_uncertainty_score":0.9994974},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009899051,0.007332382,0.04028243,0.000041540963,0.0022146066,0.0005775929,0.00239403,0.0002285466,0.94691896],"genre_scores_gemma":[0.0066682347,0.052340955,0.11443778,0.00064969243,0.009167698,0.0002457202,0.01670426,0.0004979281,0.79928774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967565,0.0000625793,0.0009895746,0.0009271381,0.0008693844,0.0003948411],"domain_scores_gemma":[0.99572223,0.00014459192,0.000728434,0.0029804343,0.00018121798,0.00024307772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055115926,0.00055125926,0.0008283887,0.0004637483,0.0001131944,0.00013850864,0.0021977057,0.00036333443,0.00011821049],"category_scores_gemma":[0.00004312497,0.0005339854,0.00027971738,0.00017868684,0.00012400628,0.0009010441,0.00065112585,0.0005496938,0.00021809305],"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.000005840159,0.000054295342,0.000021383266,0.00028069303,0.000059073525,0.000080176935,0.00013382666,0.0000011274802,0.00000822373,0.93279153,0.0514765,0.015087307],"study_design_scores_gemma":[0.00024803594,0.00013031677,0.000029456362,0.0006550621,0.000045200657,0.000038824175,0.000008057279,0.00011835663,0.000006067754,0.018061327,0.9800754,0.0005838806],"about_ca_topic_score_codex":0.00022436329,"about_ca_topic_score_gemma":0.000056057717,"teacher_disagreement_score":0.92859894,"about_ca_system_score_codex":0.000046566467,"about_ca_system_score_gemma":0.0002957525,"threshold_uncertainty_score":0.99971116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027927754,0.000016517582,0.9629422,0.007308902,0.000117017946,0.000104213344,0.000013202262,0.0004000181,0.0011701932],"genre_scores_gemma":[0.8407568,0.000007753437,0.15642759,0.002499992,0.00017354544,0.0000027104688,0.000115997755,0.000007523247,0.000008094708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990866,0.00004117518,0.00015617143,0.00031346598,0.00023163382,0.00017094114],"domain_scores_gemma":[0.99946815,0.00003816753,0.000044871435,0.00021388456,0.000042286632,0.00019266414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007064123,0.00010349076,0.00011744692,0.00004976682,0.00007044873,0.00020411906,0.00060605095,0.00004642393,0.00016526056],"category_scores_gemma":[0.000022581982,0.00008939699,0.00006244856,0.00047695285,0.00002716208,0.00048080436,0.0002665451,0.00010917679,0.00036143578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034550845,0.00020994278,0.0014139257,0.00006573887,0.00007304416,0.000046178113,0.004446919,0.00010632131,0.0067613367,0.88877326,0.04691637,0.051152416],"study_design_scores_gemma":[0.00078848307,0.00018916855,0.004808331,0.000008707466,0.0000103828515,0.000005446899,0.000015693322,0.9363472,0.0030391926,0.029962046,0.024430344,0.00039501893],"about_ca_topic_score_codex":0.00000815451,"about_ca_topic_score_gemma":0.000006562111,"teacher_disagreement_score":0.93624085,"about_ca_system_score_codex":0.0000043614,"about_ca_system_score_gemma":0.000022937338,"threshold_uncertainty_score":0.46456462},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018203954,0.0006387223,0.9701657,0.014810549,0.0005393591,0.0008918271,0.0009320027,0.0004923418,0.0097090565],"genre_scores_gemma":[0.4941369,0.00044772075,0.50364697,0.00058907346,0.0000707195,0.00029249577,0.0007844626,0.000014327426,0.000017343335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717313,0.0004246757,0.00073572237,0.00065524335,0.00041098986,0.00060022547],"domain_scores_gemma":[0.984472,0.00072953437,0.00045693922,0.013062838,0.0009859613,0.0002927377],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012810046,0.00037235353,0.0004123518,0.00015714802,0.0012537211,0.0007229958,0.015939444,0.00021126177,0.000022828319],"category_scores_gemma":[0.0006822083,0.00040784565,0.00023058482,0.0011475027,0.00048380182,0.0016325379,0.0049205394,0.00043607625,0.00010957891],"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.000014018634,0.0004282557,0.0021479721,0.000037322126,0.00006270995,1.1513453e-7,0.0004441772,0.000011535569,0.0005417923,0.95163476,0.028274272,0.016403057],"study_design_scores_gemma":[0.0013485367,0.00011765181,0.003861864,0.00016035543,0.000050282382,0.000025876634,0.00015816164,0.4976329,0.00017977826,0.0917941,0.40393645,0.0007340507],"about_ca_topic_score_codex":0.0008835022,"about_ca_topic_score_gemma":0.0027155674,"teacher_disagreement_score":0.8598407,"about_ca_system_score_codex":0.00016275352,"about_ca_system_score_gemma":0.0003328598,"threshold_uncertainty_score":0.99983734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058954846,0.0009681454,0.9394362,0.000080796446,0.0000476714,0.00022157429,0.000061291736,0.00006124137,0.00016820848],"genre_scores_gemma":[0.84880704,0.00011506272,0.15016155,0.000031109175,0.000022648224,0.000006680761,0.00085108174,0.000003940171,8.797298e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985428,0.00017501622,0.0002169875,0.0007366078,0.0002250736,0.00010351225],"domain_scores_gemma":[0.99871296,0.00009518675,0.000098046614,0.00088587013,0.00015091021,0.00005705149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009109895,0.00011886998,0.00018069439,0.0001092922,0.0000717809,0.00033755886,0.0007574302,0.00011827479,0.0000035757703],"category_scores_gemma":[0.000025984782,0.00011391427,0.000018458299,0.00021980413,0.00014696582,0.0004750166,0.0047426578,0.00021969136,2.7241845e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030870568,0.00016892028,0.0011983182,0.0014099731,0.00006856906,0.0000044548315,0.0035445024,0.00018080759,0.002500845,0.4128339,0.00007108557,0.57798773],"study_design_scores_gemma":[0.0002564928,0.000023501489,0.008461604,0.000096891374,0.000032834694,0.000016994998,0.00032494037,0.9251381,0.0012026194,0.06412268,0.0000747536,0.00024858705],"about_ca_topic_score_codex":0.00017502351,"about_ca_topic_score_gemma":0.000033090877,"teacher_disagreement_score":0.9249573,"about_ca_system_score_codex":0.0000055128094,"about_ca_system_score_gemma":0.0001486443,"threshold_uncertainty_score":0.59113836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12400249,0.0010080597,0.86560464,0.000030896357,0.001517986,0.0018666055,0.00010910333,0.0004403137,0.0054198904],"genre_scores_gemma":[0.9784608,0.00004552447,0.020608997,0.000052613817,0.00008202762,0.00028420775,0.00027765505,0.000016062606,0.00017209802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988449,0.000036477693,0.00036383705,0.00032120812,0.00023032723,0.00020324138],"domain_scores_gemma":[0.9985178,0.00013557142,0.00033041727,0.00073630107,0.00024669725,0.00003320971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004693388,0.00019878881,0.0002617295,0.0001398872,0.00013240191,0.000079999,0.0011990739,0.00021281793,0.000008800684],"category_scores_gemma":[0.000016035217,0.00013209227,0.00016759912,0.00025062216,0.000025602878,0.00025465986,0.00004055455,0.00017816456,0.0000023293455],"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.00039320733,0.00057816174,0.0005867235,0.013306884,0.0002928701,0.0000030992585,0.013448235,0.000020818195,0.030583676,0.87553716,0.011311071,0.05393811],"study_design_scores_gemma":[0.00021268154,0.00044191806,0.0003897346,0.0008093085,0.000055266148,0.0000024993753,0.0005200387,0.015344727,0.96895474,0.0016712791,0.011095134,0.000502699],"about_ca_topic_score_codex":0.00016379985,"about_ca_topic_score_gemma":0.0005828535,"teacher_disagreement_score":0.93837106,"about_ca_system_score_codex":0.0000099470335,"about_ca_system_score_gemma":0.0001535573,"threshold_uncertainty_score":0.53865665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006521031,0.0002613353,0.9617892,0.0011489941,0.00091073907,0.0010332571,0.003527273,0.00020774965,0.031056238],"genre_scores_gemma":[0.123649634,0.00021546203,0.8428408,0.026830219,0.0046326215,0.00016673237,0.00074582285,0.00020804064,0.00071068655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980552,0.00022417777,0.00037352165,0.00077601627,0.0003337128,0.00023738109],"domain_scores_gemma":[0.99488926,0.0015023517,0.00033882292,0.0030764448,0.00010953155,0.000083576226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080964365,0.00029375145,0.00036130555,0.000047011443,0.000221965,0.00022445708,0.0039084833,0.00022996256,0.0000055277715],"category_scores_gemma":[0.00023335534,0.00017791323,0.00019122014,0.00004860918,0.00021565057,0.00029352438,0.0009904413,0.00032040017,0.000008971356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006140671,0.0000103091,0.0000011269016,0.00001934198,0.00006858095,0.0000037592079,0.00018650277,0.00000859265,0.000038849565,0.9772615,0.0032890767,0.019050945],"study_design_scores_gemma":[0.00013347979,0.00025529068,0.0000060979983,0.00005651939,0.00006943697,0.000009794903,0.000018451945,0.0015343543,0.00012883745,0.70640635,0.29116943,0.00021196892],"about_ca_topic_score_codex":0.00011197523,"about_ca_topic_score_gemma":0.00013421662,"teacher_disagreement_score":0.28788036,"about_ca_system_score_codex":0.000025801372,"about_ca_system_score_gemma":0.00013517293,"threshold_uncertainty_score":0.72629994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005028975,0.00001278645,0.896153,0.00042903566,0.00023624946,0.000021308653,0.0000012577311,0.00017196224,0.09794543],"genre_scores_gemma":[0.84503466,0.000002578382,0.15387334,0.00089078426,0.000105017374,0.0000013351305,0.0000013619677,0.000001437104,0.00008952039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961704,0.000008391855,0.00004812517,0.00014367285,0.000076954464,0.00010579241],"domain_scores_gemma":[0.99951,0.000012900923,0.00000945029,0.00039594393,0.000028395334,0.000043319353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007504989,0.000035096007,0.00003215604,0.000033877346,0.00006402692,0.00006796131,0.00046568728,0.000016419834,0.00020196452],"category_scores_gemma":[0.000006226713,0.000027966316,0.00002285515,0.00023810574,0.00004500545,0.00029904113,0.00016299188,0.000026849522,0.00045416673],"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":[5.3762506e-7,0.000013428911,0.0002911142,6.110124e-7,0.0000016336743,0.0000010395487,0.000106043364,1.7657083e-8,0.00007509848,0.97321,0.012102052,0.014198473],"study_design_scores_gemma":[0.0003577979,0.00026752066,0.020882884,0.000006721226,0.0000029802868,0.000022821936,0.000034206925,0.030533988,0.007412953,0.31630674,0.62381244,0.0003589306],"about_ca_topic_score_codex":0.00003033114,"about_ca_topic_score_gemma":0.00005795307,"teacher_disagreement_score":0.84000564,"about_ca_system_score_codex":0.0000024215906,"about_ca_system_score_gemma":0.000008761684,"threshold_uncertainty_score":0.5837546},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.7778055e-8,0.00023662172,0.23504199,0.00006650345,0.00025043954,0.000075759875,0.00001425465,0.00015378086,0.7641606],"genre_scores_gemma":[0.0007239424,0.00085079664,0.14907697,0.0025829468,0.0002849775,0.000014479935,0.00010622292,0.00004404467,0.8463156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923605,0.0000043256623,0.00014017361,0.00032929622,0.00016305393,0.00012709935],"domain_scores_gemma":[0.99876744,0.000018831572,0.00006260738,0.0010400411,0.000030079611,0.000081014965],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007642684,0.0001705194,0.00015414423,0.000094548945,0.00004852994,0.000058997826,0.0009889154,0.000136017,0.0015374713],"category_scores_gemma":[9.735409e-7,0.00014433861,0.00013137623,0.000017808135,0.000041851537,0.00015089533,0.00048047374,0.0001712895,0.0009072497],"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":[6.471104e-7,0.00000965145,0.0000015274372,0.000004149692,0.000017591456,0.000010319759,0.000037194215,3.7654093e-9,1.8982236e-7,0.9538471,0.031269193,0.014802417],"study_design_scores_gemma":[0.000032359683,0.000021982843,0.000006328569,0.000008734345,0.0000037805341,0.0000032454186,2.9650238e-7,0.0000071226814,0.000009725994,0.44388574,0.55590457,0.000116084586],"about_ca_topic_score_codex":0.00003154562,"about_ca_topic_score_gemma":0.000035020093,"teacher_disagreement_score":0.5246354,"about_ca_system_score_codex":0.00001756076,"about_ca_system_score_gemma":0.00002320229,"threshold_uncertainty_score":0.99987066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.3386955e-7,0.00019843609,0.37191567,0.000056455174,0.00013619532,0.000045380602,0.0000064141664,0.00012784143,0.627513],"genre_scores_gemma":[0.00043851495,0.00028878375,0.7515721,0.002713618,0.00055158016,9.73276e-7,0.000051862844,0.000034643075,0.24434797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910116,0.0000047583144,0.00015465208,0.00037518897,0.00020963253,0.00015461762],"domain_scores_gemma":[0.99901426,0.00001830589,0.00007069574,0.00078486133,0.00003647911,0.00007540039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000783301,0.00018284726,0.00017418257,0.00014458974,0.00006879484,0.00013318443,0.000770512,0.0001728577,0.0003033601],"category_scores_gemma":[0.0000020731447,0.00016743557,0.00014423605,0.00003988199,0.000030964886,0.00026153596,0.00022500267,0.00019791619,0.00013893053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.262852e-7,0.0000046628743,5.666955e-7,0.0000030678143,0.0000073480387,0.000016913114,0.000015382766,7.4121516e-7,0.0000043368236,0.95915157,0.0029306978,0.03786427],"study_design_scores_gemma":[0.00004297876,0.000018511393,0.0000055909704,0.000024959916,0.0000065843406,0.000014937927,2.904094e-7,0.0009676996,0.000016348955,0.499874,0.49881938,0.00020870382],"about_ca_topic_score_codex":0.000014829576,"about_ca_topic_score_gemma":0.000010602063,"teacher_disagreement_score":0.49588868,"about_ca_system_score_codex":0.000015703059,"about_ca_system_score_gemma":0.00004356901,"threshold_uncertainty_score":0.6827824},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027389014,0.00019961975,0.9497611,0.000020185118,0.0008543531,0.00110714,0.00006664559,0.00021269525,0.020389264],"genre_scores_gemma":[0.38550928,0.00022501005,0.5985123,0.00064049603,0.00055882405,0.0010944414,0.010055632,0.00009969058,0.00330431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986155,0.00002152144,0.00024862256,0.0005961516,0.00024599698,0.0002722192],"domain_scores_gemma":[0.99867,0.00002852759,0.00014038585,0.0010068744,0.000046166406,0.00010806423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013063998,0.00026526596,0.00020503622,0.00017550377,0.00013373575,0.00012227347,0.001317113,0.000146685,0.00028045452],"category_scores_gemma":[0.000009700757,0.00022467293,0.00012168946,0.00012387257,0.000018714856,0.00014511928,0.000113937866,0.00011796252,0.000025669471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021265257,0.0006882269,0.000092837356,0.00047845373,0.0001288103,0.0000034623752,0.008629908,0.00007779983,0.0005123948,0.7855749,0.0032382638,0.20036231],"study_design_scores_gemma":[0.0019842896,0.0013681293,0.04181181,0.00017520192,0.00017861911,0.0000109677285,0.00048591173,0.004960769,0.02064653,0.48365158,0.4418126,0.0029135884],"about_ca_topic_score_codex":0.00020893023,"about_ca_topic_score_gemma":0.00019073988,"teacher_disagreement_score":0.43857434,"about_ca_system_score_codex":0.000014417859,"about_ca_system_score_gemma":0.00005850079,"threshold_uncertainty_score":0.9161896},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043070675,0.00040957512,0.09879176,0.00027466269,0.0007642343,0.0003844456,0.00032501374,0.0009009175,0.89810634],"genre_scores_gemma":[0.8711755,0.00012953975,0.09867584,0.011500081,0.0037877653,0.00012735903,0.00016982957,0.00035037243,0.014083671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749595,0.000030388424,0.00042831982,0.0010192886,0.000644778,0.0003812595],"domain_scores_gemma":[0.99795085,0.000025001153,0.00027857226,0.0012583447,0.00012747441,0.00035973868],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012959512,0.0005392762,0.0005220605,0.000098556324,0.00016173067,0.00034930723,0.0016204079,0.0004347555,0.000034983077],"category_scores_gemma":[0.000015805253,0.00055420335,0.00037136333,0.000067168796,0.00015283571,0.00023043342,0.00072844204,0.00051245675,0.0009641278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002298105,0.000010528669,0.000023781588,0.00003555331,0.000054790133,0.00013664975,0.000074402255,6.607731e-7,0.000032523072,0.9890367,0.0040750206,0.0064964467],"study_design_scores_gemma":[0.00035330912,0.0001585586,0.00008915727,0.0001263139,0.000058168363,0.000093072646,0.0000027078152,0.00025789056,0.000027568638,0.87486553,0.12331378,0.0006539488],"about_ca_topic_score_codex":0.000047667134,"about_ca_topic_score_gemma":0.000067980196,"teacher_disagreement_score":0.88402265,"about_ca_system_score_codex":0.000105124614,"about_ca_system_score_gemma":0.00024748297,"threshold_uncertainty_score":0.99981374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006228196,0.0005752914,0.9876985,0.0015241775,0.0002274182,0.0027077016,0.0007372113,0.00027643194,0.000025047513],"genre_scores_gemma":[0.958218,0.00014668489,0.03931738,0.0009925248,0.000077568075,0.0011680492,0.000042971642,0.000036372177,4.4965202e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719906,0.00039496247,0.0006651172,0.00092449173,0.00036687683,0.00044948887],"domain_scores_gemma":[0.9972921,0.0008930123,0.00024500597,0.00091039366,0.00024811478,0.00041139976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007824144,0.00045626008,0.00063652603,0.00050040404,0.0006323031,0.00043467968,0.0008010481,0.00020168947,0.000006605703],"category_scores_gemma":[0.00003812415,0.00033902057,0.00035896664,0.0019563844,0.00020328817,0.00039137475,0.000019640385,0.0002951606,0.0000044437747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00873596,0.0039195106,0.0032496967,0.00834122,0.005553644,0.00002290539,0.080051236,0.0689282,0.10285004,0.39498743,0.014198721,0.30916142],"study_design_scores_gemma":[0.01082598,0.0061667715,0.0017833748,0.0008074595,0.0005957274,0.0000524422,0.009253496,0.8249976,0.028331855,0.0109448945,0.10270795,0.003532433],"about_ca_topic_score_codex":0.000048359856,"about_ca_topic_score_gemma":0.000015224931,"teacher_disagreement_score":0.9519898,"about_ca_system_score_codex":0.000010142136,"about_ca_system_score_gemma":0.0000641145,"threshold_uncertainty_score":0.9999062},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008022537,0.0045468234,0.11960378,0.00013143253,0.0021013645,0.0005895473,0.0021143167,0.0002713361,0.87063336],"genre_scores_gemma":[0.015709007,0.11346169,0.2673212,0.0012847043,0.017294105,0.0004276946,0.04708036,0.0007922485,0.536629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996607,0.000081285354,0.0009603345,0.0009538905,0.000968606,0.0004289033],"domain_scores_gemma":[0.9957631,0.00014383605,0.0007742836,0.002760861,0.00027246412,0.00028545567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074452825,0.0005224403,0.00073538494,0.0006102073,0.00011636076,0.00018871858,0.001989984,0.00037821935,0.000113743125],"category_scores_gemma":[0.000078481025,0.0005111155,0.000280645,0.00020469475,0.0001105557,0.0015288783,0.00056699367,0.00051917863,0.00025984837],"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.0000043521864,0.000050286086,0.000013647333,0.00020062602,0.000047884394,0.000043226763,0.000110841465,0.0000010996271,0.000015942449,0.950414,0.03388204,0.015216034],"study_design_scores_gemma":[0.00023727733,0.00009927599,0.00002777981,0.0004309761,0.000035114892,0.00003900787,0.0000088162005,0.000243179,0.0000072654416,0.014157356,0.9841694,0.00054452795],"about_ca_topic_score_codex":0.00011265111,"about_ca_topic_score_gemma":0.00004052601,"teacher_disagreement_score":0.9502874,"about_ca_system_score_codex":0.000055440945,"about_ca_system_score_gemma":0.00025655123,"threshold_uncertainty_score":0.99973404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15719922,0.001845528,0.83826125,0.00031862254,0.00008451811,0.0002520169,0.000029988276,0.00013124476,0.0018776199],"genre_scores_gemma":[0.98946214,0.00020266342,0.0100332135,0.00011384799,0.000013864166,0.000027421645,0.00014040382,0.000005012072,0.0000014351343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991389,0.00012003678,0.00019127362,0.00024350776,0.000119970515,0.00018633748],"domain_scores_gemma":[0.99853337,0.00017746874,0.00008137691,0.001124434,0.000031095748,0.000052240357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028010926,0.00009840008,0.00012203826,0.00008694404,0.00052682444,0.00025750816,0.0010877128,0.000026906271,0.0000032804014],"category_scores_gemma":[0.0000065276395,0.000097978664,0.00003058559,0.0007320276,0.00010644814,0.0005714922,0.0016109755,0.00038586342,7.3166876e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020196105,0.0026668268,0.028386371,0.000036784855,0.000126961,0.00001938751,0.019500786,0.013515393,0.00012403006,0.6244957,0.0006189984,0.31030682],"study_design_scores_gemma":[0.0011109526,0.0001758404,0.0056545227,0.00003138094,0.000004868355,0.000024686036,0.00067559973,0.9778219,0.0000071650043,0.006487466,0.0076905168,0.00031510615],"about_ca_topic_score_codex":0.00003447692,"about_ca_topic_score_gemma":0.0001168112,"teacher_disagreement_score":0.9643065,"about_ca_system_score_codex":0.000024960826,"about_ca_system_score_gemma":0.000019188235,"threshold_uncertainty_score":0.40519607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06175157,0.0001962222,0.93301,0.0019169194,0.00035440092,0.00051647937,0.0020450503,0.00017681807,0.00003253466],"genre_scores_gemma":[0.9904816,0.000056797926,0.008718579,0.00033602346,0.000020415422,0.0002860277,0.00009092812,0.0000077902605,0.0000018465857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981344,0.00015571991,0.0002570808,0.0005708847,0.0005363849,0.0003455342],"domain_scores_gemma":[0.9983112,0.00014357107,0.000077065546,0.001239785,0.000098651566,0.00012972654],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010951554,0.00018608148,0.00021985846,0.00010336085,0.0013839123,0.00015690783,0.0011826494,0.000049823826,0.000053782842],"category_scores_gemma":[0.00006401818,0.00019506433,0.00017151989,0.00051106454,0.000053697084,0.00055178936,0.00015883344,0.00036564082,0.0000019197737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021855638,0.007141565,0.0043385513,0.0009655148,0.0014961404,0.000056755158,0.024532704,0.0024197642,0.0023432442,0.79873896,0.020420372,0.13536084],"study_design_scores_gemma":[0.0025728277,0.00067057816,0.003926977,0.000019748433,0.000110939916,0.00005284665,0.0003793313,0.0072058807,0.0040559284,0.5115235,0.46871772,0.00076375506],"about_ca_topic_score_codex":0.000098329736,"about_ca_topic_score_gemma":0.000027704395,"teacher_disagreement_score":0.92873,"about_ca_system_score_codex":0.00011662078,"about_ca_system_score_gemma":0.000068476234,"threshold_uncertainty_score":0.99991614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06927155,0.00004293765,0.9273253,0.00094181387,0.0005048887,0.0003655594,0.00049749465,0.00023447284,0.00081596273],"genre_scores_gemma":[0.9922757,0.00009724983,0.006812008,0.00064834696,0.000021013357,0.000060536146,0.000072716146,0.000008150534,0.000004282538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827325,0.0000947682,0.00040957562,0.00030030264,0.00058930006,0.0003328205],"domain_scores_gemma":[0.99869674,0.000074943906,0.00021166158,0.0006976923,0.00014376602,0.00017519719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043829984,0.0002362751,0.00022308859,0.00029820346,0.0009455109,0.00029101325,0.0006166298,0.000069119356,0.00008514447],"category_scores_gemma":[0.000007683099,0.00022706325,0.00011123436,0.00072267384,0.00010435885,0.0032867012,0.00006134695,0.0006758763,0.000007928638],"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.0013332936,0.0012146356,0.0004539616,0.0008559935,0.0005357977,0.00008975341,0.13197978,0.029214643,0.000052863277,0.691096,0.01420123,0.12897202],"study_design_scores_gemma":[0.00611905,0.002066275,0.000493619,0.0001591618,0.00015511682,0.00053326046,0.007323036,0.6618011,0.0042731785,0.14708097,0.16783212,0.002163118],"about_ca_topic_score_codex":0.00024227712,"about_ca_topic_score_gemma":0.00009603207,"teacher_disagreement_score":0.92300415,"about_ca_system_score_codex":0.00007240507,"about_ca_system_score_gemma":0.00009255575,"threshold_uncertainty_score":0.9259371},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47432306,0.0005098699,0.51853514,0.00021695568,0.0044242227,0.000785684,0.00040581077,0.00020391724,0.0005953628],"genre_scores_gemma":[0.999084,0.00006521357,0.00058421976,0.00010534406,0.000055269396,0.00006591347,0.000012322802,0.000018876857,0.000008847579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765486,0.00029209553,0.00046705213,0.0006651804,0.000622761,0.00029805666],"domain_scores_gemma":[0.9985953,0.00007933932,0.00020608932,0.0008346381,0.00012256955,0.00016208761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041810708,0.00024808644,0.00032332467,0.00068037125,0.001197238,0.00017503956,0.00044788094,0.00007114177,0.00003985562],"category_scores_gemma":[0.0000070222272,0.00025191257,0.00022920275,0.0012486927,0.00012653088,0.00044743012,0.000009225086,0.00035601493,0.0000017284015],"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.0001221998,0.0013459245,0.00016575676,0.00039769086,0.0005665322,0.000034232096,0.0044941166,0.101189464,0.38969257,0.39668134,0.0002615882,0.10504858],"study_design_scores_gemma":[0.023536395,0.019520437,0.016101189,0.00256069,0.0018794484,0.0076096803,0.039104,0.5002589,0.23814073,0.024191586,0.11377677,0.013320153],"about_ca_topic_score_codex":0.00024334188,"about_ca_topic_score_gemma":0.00001704138,"teacher_disagreement_score":0.52476096,"about_ca_system_score_codex":0.00006736638,"about_ca_system_score_gemma":0.00010624237,"threshold_uncertainty_score":0.9999933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021263314,0.00015292439,0.9624436,0.010985661,0.00007805117,0.00014623524,0.000018565288,0.00051826733,0.004393415],"genre_scores_gemma":[0.93878764,0.0000064388864,0.055855438,0.005253584,0.000068897694,0.000003363425,0.000011948019,0.0000061080027,0.0000066125026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990564,0.000026464495,0.00009687044,0.000383084,0.00022484532,0.00021231017],"domain_scores_gemma":[0.9993459,0.000036571837,0.000037382615,0.00036488735,0.000058174686,0.00015707102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076133794,0.000118327436,0.000111297624,0.000038164613,0.00009338503,0.00024324589,0.0007487444,0.000049731636,0.00005646621],"category_scores_gemma":[0.000023032431,0.00008455521,0.00004594131,0.00045744696,0.00003250808,0.0009684109,0.00022900345,0.00024282152,0.00004195828],"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.00005471527,0.0000802908,0.0006104457,0.000044943477,0.000030752344,0.00011331235,0.004749722,0.000019522944,0.0095721,0.96942323,0.0063041965,0.008996744],"study_design_scores_gemma":[0.005957423,0.0068413857,0.026572274,0.00024068629,0.000092562106,0.00022417039,0.0029049187,0.5767281,0.07704942,0.05067826,0.24823917,0.0044716448],"about_ca_topic_score_codex":0.000025789968,"about_ca_topic_score_gemma":0.000020104186,"teacher_disagreement_score":0.918745,"about_ca_system_score_codex":0.0000037678324,"about_ca_system_score_gemma":0.00003368343,"threshold_uncertainty_score":0.34480616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29092652,0.0004897124,0.70268613,0.00015349405,0.0011391814,0.0010025708,0.00074437057,0.00027348602,0.0025845524],"genre_scores_gemma":[0.9835455,0.0018033128,0.013694803,0.0002638401,0.00029595036,0.0000021586443,0.00026856843,0.00006048649,0.00006537638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99093497,0.0011472699,0.00094226794,0.004692987,0.0005419721,0.0017405371],"domain_scores_gemma":[0.99302083,0.0005992879,0.0007158925,0.0041948683,0.00036925313,0.0010998556],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.001103155,0.0012406956,0.0013584098,0.0013810023,0.00084205007,0.00064078503,0.007045616,0.0007393258,0.00046496224],"category_scores_gemma":[0.00013949019,0.0016485141,0.00069931045,0.004922031,0.0011623878,0.003017171,0.013542771,0.0032560283,0.00031291804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010316134,0.0018341924,0.019498268,0.0018922124,0.0005914806,0.009481099,0.0061878613,0.41504538,0.004932946,0.53607273,0.0007284382,0.0027037964],"study_design_scores_gemma":[0.0018900699,0.00019711987,0.0017573214,0.0008213179,0.00018116311,0.000035516856,0.0012290343,0.9486907,0.0008111817,0.041041844,0.0015891866,0.0017555084],"about_ca_topic_score_codex":0.0054184366,"about_ca_topic_score_gemma":0.00059719506,"teacher_disagreement_score":0.69261897,"about_ca_system_score_codex":0.00047103036,"about_ca_system_score_gemma":0.0013622778,"threshold_uncertainty_score":0.9990435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015905961,0.00064782077,0.9359256,0.0019802293,0.041101858,0.00063534215,0.00018300234,0.0007375926,0.002882605],"genre_scores_gemma":[0.9194873,0.0000013477965,0.077875115,0.00021778067,0.00036050446,0.000048934424,0.0005075087,0.000026172056,0.0014753107],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959088,0.00009531674,0.0005575179,0.0015038654,0.0012931003,0.0006413749],"domain_scores_gemma":[0.99699664,0.000059435602,0.00036761127,0.002035561,0.00012622964,0.00041454833],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014770296,0.00023122125,0.00022982969,0.00046543698,0.0013871798,0.0033142236,0.0014098507,0.00007164857,0.00041045004],"category_scores_gemma":[0.00014672813,0.00022632608,0.0002408855,0.002428009,0.00014461932,0.002250346,0.0018516136,0.0004731008,0.000038039012],"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.000016143393,0.0005737768,0.001057772,0.00001147328,0.0000732486,0.0027529052,0.0029320703,0.00009159732,0.0030674709,0.04504362,0.67895925,0.2654207],"study_design_scores_gemma":[0.00029322604,0.00007332311,0.00042495993,0.0000053774966,0.0000066542784,0.0008647722,0.00009848569,0.013566721,0.00044553544,0.057505764,0.92628616,0.00042903528],"about_ca_topic_score_codex":0.00014893698,"about_ca_topic_score_gemma":0.000012156704,"teacher_disagreement_score":0.9035814,"about_ca_system_score_codex":0.00008296508,"about_ca_system_score_gemma":0.000739386,"threshold_uncertainty_score":0.99991286},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13920717,0.00022583695,0.8572386,0.00007300968,0.0006592314,0.00032277196,0.0015534452,0.00015343998,0.00056649296],"genre_scores_gemma":[0.9691621,0.00050150196,0.0289439,0.000057791618,0.00006603462,0.000001493955,0.0011740542,0.000014812665,0.00007827561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784875,0.00010134784,0.0002656251,0.0013566446,0.00010979287,0.0003178318],"domain_scores_gemma":[0.9951353,0.00016284884,0.00031427515,0.0040221787,0.00024748285,0.000117934855],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00029908723,0.0002896834,0.00045486997,0.00022064493,0.000140721,0.00017740135,0.003925245,0.00026099314,0.00005376827],"category_scores_gemma":[0.00010790188,0.00034336795,0.0002487403,0.00070070307,0.00024468807,0.0016710026,0.008661109,0.00031548063,0.0000025921768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008921483,0.00018454547,0.0018102557,0.00042404313,0.00022865583,0.00010803591,0.0005065427,0.0014620655,0.00021286018,0.99282604,0.0017823537,0.0003653774],"study_design_scores_gemma":[0.003371817,0.0005459171,0.011176146,0.00093814865,0.0007376219,0.000030837607,0.0021184029,0.41177583,0.005285576,0.50171155,0.058985617,0.003322498],"about_ca_topic_score_codex":0.0003084542,"about_ca_topic_score_gemma":0.00052289985,"teacher_disagreement_score":0.829955,"about_ca_system_score_codex":0.00003869651,"about_ca_system_score_gemma":0.00038167098,"threshold_uncertainty_score":0.99990183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18749906,0.0024964856,0.39996126,0.29312554,0.009115261,0.0029596235,0.018656304,0.0023926038,0.08379387],"genre_scores_gemma":[0.9793096,0.0005047459,0.015769014,0.0018422159,0.0000988647,0.00016979981,0.0022072287,0.000019286468,0.00007920343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965818,0.0007884817,0.00052507623,0.0007665303,0.0010058937,0.00033223638],"domain_scores_gemma":[0.9904272,0.00058355904,0.00033040566,0.008255841,0.00025217017,0.00015084719],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010622797,0.0002349289,0.00023611418,0.000379268,0.0013913374,0.00044842545,0.02202892,0.00006945159,0.0010975706],"category_scores_gemma":[0.00021452518,0.00026867824,0.000116604846,0.00073029177,0.00013075046,0.0012856914,0.01593812,0.0012849212,0.000031124357],"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.00007485221,0.00091598474,0.009362814,0.000024264065,0.00018062623,0.00001688352,0.0030629428,0.000079057056,0.0011938344,0.94842947,0.02531266,0.011346596],"study_design_scores_gemma":[0.0010154864,0.00013866676,0.018119749,0.000099500554,0.000027561091,0.000029325982,0.0008870585,0.6890386,0.00004951868,0.03215601,0.25772175,0.0007168376],"about_ca_topic_score_codex":0.00078203954,"about_ca_topic_score_gemma":0.000746566,"teacher_disagreement_score":0.9162735,"about_ca_system_score_codex":0.00019648607,"about_ca_system_score_gemma":0.00026567595,"threshold_uncertainty_score":0.9999765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011826936,0.0010560672,0.70205873,0.2454786,0.0017590161,0.0019594168,0.0036762704,0.00094209146,0.031242883],"genre_scores_gemma":[0.9856082,0.00022661182,0.011115431,0.0009224607,0.00009706067,0.00097342196,0.0009911029,0.000014433167,0.00005126039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786913,0.00033949644,0.00041784646,0.00046269436,0.0004741819,0.00043664477],"domain_scores_gemma":[0.99738824,0.00041795397,0.00020791622,0.001559791,0.000233492,0.00019262757],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00059998885,0.00017430147,0.00019096832,0.00034431578,0.001489582,0.00030581388,0.0030527997,0.00003705587,0.00016823261],"category_scores_gemma":[0.00011075559,0.00020928739,0.00011773461,0.00038073809,0.000110942354,0.0004653723,0.0015136778,0.0005407135,0.000009026392],"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.000023915847,0.00018972404,0.000054333574,0.000033519635,0.00003684154,0.0000010904369,0.00056911237,0.000020743757,0.00018480612,0.9969118,0.0013755806,0.00059853785],"study_design_scores_gemma":[0.002102827,0.0011467907,0.0006634509,0.00036737224,0.00003077704,0.00026297307,0.004400191,0.4111478,0.00018599522,0.38314015,0.19573835,0.0008133242],"about_ca_topic_score_codex":0.00009516658,"about_ca_topic_score_gemma":0.00025953774,"teacher_disagreement_score":0.9737813,"about_ca_system_score_codex":0.00048213408,"about_ca_system_score_gemma":0.00041919702,"threshold_uncertainty_score":0.99981034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0498918,0.0010955111,0.9291079,0.005002236,0.0031707021,0.0007959029,0.0009138066,0.00028349328,0.009738665],"genre_scores_gemma":[0.9890743,0.0001410072,0.009883599,0.00021024053,0.00013250641,0.000053806754,0.00031876925,0.000010420194,0.00017534808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977904,0.0002657949,0.00053645176,0.00045547786,0.0007313252,0.00022054886],"domain_scores_gemma":[0.998018,0.0001470811,0.00039082987,0.0010126503,0.00028790504,0.00014351882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004833895,0.00021650433,0.0002778432,0.00034796688,0.00040036792,0.0006841461,0.002825428,0.000058121004,0.000109488545],"category_scores_gemma":[0.000014298221,0.00021999548,0.00009556476,0.00042785102,0.00008255226,0.0010521208,0.0020744842,0.0005212475,0.000010962132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008149969,0.00036416604,0.0010866033,0.000023613673,0.00013051965,0.0000046158407,0.001868009,0.00043757094,0.00012095313,0.8313318,0.0071114963,0.15743916],"study_design_scores_gemma":[0.0008333583,0.00032990723,0.0020315242,0.00006889937,0.000004629706,0.00006959113,0.0002523241,0.93724406,0.000017928569,0.0012533357,0.05762406,0.0002703546],"about_ca_topic_score_codex":0.00018860315,"about_ca_topic_score_gemma":0.0000049335745,"teacher_disagreement_score":0.9391825,"about_ca_system_score_codex":0.00007579958,"about_ca_system_score_gemma":0.00020545705,"threshold_uncertainty_score":0.8971155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14108998,0.00014839036,0.85741997,0.00016528326,0.00038381005,0.00031359537,0.0003695002,0.000071901995,0.00003757854],"genre_scores_gemma":[0.97414804,0.0000052669197,0.025708709,0.000074807234,0.000010353656,0.000027462069,0.000013637243,0.000010220054,0.0000015267074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984029,0.00012401969,0.0004777571,0.0004009583,0.0003311539,0.00026322482],"domain_scores_gemma":[0.9986358,0.00047328894,0.00025784344,0.0004231026,0.0001262764,0.00008367748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043858602,0.00017073519,0.00038373933,0.00036490895,0.0007448713,0.000036037425,0.00049967197,0.000058964757,0.00002817894],"category_scores_gemma":[0.0000062280938,0.00018792384,0.00024573746,0.0008050724,0.00008364399,0.0001721686,0.000017849168,0.00034494375,3.4512738e-7],"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.0008663104,0.009022125,0.0033441097,0.0016488913,0.00063595275,0.000028824072,0.022041405,0.6120437,0.009646621,0.27090397,0.0032890444,0.06652908],"study_design_scores_gemma":[0.0015645113,0.0009835443,0.00014822476,0.000053143707,0.000070402944,0.000023214481,0.00052478706,0.956107,0.027409293,0.011647358,0.0011537242,0.00031478997],"about_ca_topic_score_codex":0.00008551257,"about_ca_topic_score_gemma":0.000053804662,"teacher_disagreement_score":0.83305806,"about_ca_system_score_codex":0.000019715591,"about_ca_system_score_gemma":0.00008519594,"threshold_uncertainty_score":0.7663312},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37334746,0.000102031016,0.625198,0.00010605114,0.000058736594,0.00016624547,0.000016293685,0.00014734274,0.00085781614],"genre_scores_gemma":[0.94385403,0.000017305922,0.055929895,0.00010887461,0.0000061611354,0.000029719757,0.000026623215,0.0000057933325,0.000021592821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868226,0.0000878123,0.00010431756,0.0004501118,0.00039543424,0.00028007635],"domain_scores_gemma":[0.99913067,0.000048029546,0.000038440125,0.00061914785,0.000034451536,0.00012928894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044060216,0.000100609795,0.00010058936,0.0003594402,0.00045952143,0.00018833771,0.0006660856,0.00001823483,0.00008149987],"category_scores_gemma":[0.000008812688,0.00008590021,0.000023943763,0.0018347646,0.000047632668,0.0005190722,0.00054460054,0.00016593047,0.0000051719353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065489665,0.00050949986,0.0039198548,0.000036728274,0.000024077895,0.000025692518,0.0012239768,0.004270745,0.0008281237,0.967635,0.00035631255,0.021104543],"study_design_scores_gemma":[0.00063382316,0.0009260532,0.0102653075,0.0000037062716,0.0000070157844,0.00006327835,0.00026631154,0.97703934,0.00016261356,0.0052502425,0.005131249,0.00025104897],"about_ca_topic_score_codex":0.0001456347,"about_ca_topic_score_gemma":0.000010554075,"teacher_disagreement_score":0.9727686,"about_ca_system_score_codex":0.00003943153,"about_ca_system_score_gemma":0.00005262013,"threshold_uncertainty_score":0.35343137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29392645,0.000034427274,0.7046327,0.000012231035,0.0003232792,0.00018302904,0.00070773636,0.00009856645,0.00008158669],"genre_scores_gemma":[0.9649453,0.00010811151,0.033696506,0.000017383074,0.000026712898,6.094356e-7,0.0011897356,0.000011109482,0.000004539488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796605,0.00027254017,0.00031238646,0.000987875,0.00016669558,0.0002944299],"domain_scores_gemma":[0.9978934,0.0001535615,0.00045667458,0.0008821258,0.00047238302,0.00014184751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015147713,0.0003066735,0.00045142818,0.00023083253,0.00013091703,0.00016411881,0.0012670704,0.0002552203,0.000013758249],"category_scores_gemma":[0.000061388884,0.00037659568,0.00020777911,0.0010297549,0.00015448788,0.00034972295,0.0020573072,0.0005337319,0.0000050176322],"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.00004561474,0.0003707974,0.0038490563,0.0002618493,0.00026977627,0.00016018625,0.00061751646,0.082075156,0.0001333425,0.9114534,0.00025786518,0.0005054114],"study_design_scores_gemma":[0.0010076888,0.000118434116,0.040635314,0.00020918052,0.00017375588,0.0000040552104,0.00010606799,0.69077194,0.0012309782,0.26501402,0.000075137476,0.00065341115],"about_ca_topic_score_codex":0.00022919547,"about_ca_topic_score_gemma":0.000102076745,"teacher_disagreement_score":0.67101884,"about_ca_system_score_codex":0.00012453327,"about_ca_system_score_gemma":0.00029161738,"threshold_uncertainty_score":0.9998686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6407352,0.00012656518,0.35530213,0.00015400726,0.00044379517,0.00027684294,0.0001688076,0.00021394803,0.002578689],"genre_scores_gemma":[0.99231124,0.00013108809,0.007167628,0.000059735616,0.00003422094,0.0000012196552,0.0002446663,0.000016649936,0.000033532404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755955,0.0004003438,0.0003594658,0.0010554814,0.00023489574,0.00039028822],"domain_scores_gemma":[0.99498606,0.00016863101,0.0005298478,0.0036718019,0.00039464785,0.00024898516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007061215,0.00039743792,0.0005416332,0.00026964105,0.0004146064,0.00040370954,0.00391911,0.00033905782,0.000024910116],"category_scores_gemma":[0.000051288276,0.00046255183,0.00031326138,0.0008543172,0.0012507008,0.0007242719,0.00403003,0.0009123554,0.00004916149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102189515,0.00039332613,0.001205269,0.00008278019,0.00008029072,0.000031716176,0.0006511424,0.014825739,0.000004407028,0.9815868,0.00090623595,0.00013010725],"study_design_scores_gemma":[0.00062764395,0.0001622741,0.0033815927,0.00013842493,0.000058801903,0.0000046603764,0.00014936888,0.39047617,0.000039710107,0.6022293,0.0021993143,0.0005327295],"about_ca_topic_score_codex":0.001151414,"about_ca_topic_score_gemma":0.0003029764,"teacher_disagreement_score":0.3793575,"about_ca_system_score_codex":0.0002305092,"about_ca_system_score_gemma":0.00044724654,"threshold_uncertainty_score":0.9997826},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008054218,0.00007600259,0.9018616,0.0025053138,0.00021370352,0.0062580667,0.000023890298,0.00030501763,0.08070219],"genre_scores_gemma":[0.46454465,0.000010654719,0.52202785,0.00028632526,0.00003810837,0.009871819,0.00011881334,0.000036434303,0.0030653458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715614,0.0013549447,0.0004319821,0.0004724278,0.00032953327,0.0002549673],"domain_scores_gemma":[0.9961291,0.0005514487,0.0002632246,0.0017265503,0.0011942614,0.00013543548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018180631,0.00016092557,0.00019101317,0.0004258148,0.00014263076,0.00015895747,0.0013868528,0.00006448418,0.00011806616],"category_scores_gemma":[0.00034448045,0.00017241042,0.0001508991,0.0012135905,0.00015524778,0.00060911255,0.00045411,0.0002002376,0.000018373488],"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.000014049814,0.0009831373,0.0020910765,0.000055001572,0.000017277704,0.00000189154,0.0036312481,0.000016511849,0.007910313,0.9403663,0.025970817,0.018942377],"study_design_scores_gemma":[0.0012516082,0.0000026042821,0.038702033,0.00061416597,0.000019626292,0.000017742595,0.00008082626,0.008519892,0.03905686,0.023833629,0.8872858,0.0006152005],"about_ca_topic_score_codex":0.0021157148,"about_ca_topic_score_gemma":0.003351068,"teacher_disagreement_score":0.9165327,"about_ca_system_score_codex":0.00010910495,"about_ca_system_score_gemma":0.00018488911,"threshold_uncertainty_score":0.70306927},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.363621e-7,0.00008831325,0.52308136,0.000034076773,0.00025670117,0.00006428874,0.000012553726,0.00017472873,0.47628725],"genre_scores_gemma":[0.0069313985,0.0008970879,0.7422272,0.006520975,0.0010991303,0.000047761594,0.00077402656,0.0001614869,0.24134094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883914,0.000009870452,0.00020776839,0.00046573146,0.00031345297,0.00016402987],"domain_scores_gemma":[0.9986745,0.00002723934,0.00011935168,0.0010117987,0.00007309852,0.00009401171],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017332051,0.00021661898,0.00018280972,0.0002510213,0.000077909586,0.0001627527,0.0011579831,0.00023391309,0.0017505434],"category_scores_gemma":[0.0000043383397,0.0002050631,0.00020891885,0.000055076547,0.0000607694,0.00080998073,0.00026357733,0.00023541518,0.0011707398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018184453,0.000012797697,0.000003908609,0.000014572995,0.000011006604,0.000010921755,0.00002549078,1.2428391e-7,0.000004472472,0.9904722,0.0037484465,0.0056942394],"study_design_scores_gemma":[0.000082358805,0.000033134133,0.000032043863,0.000027701539,0.00001033399,0.000002470801,2.609465e-7,0.00011767465,0.000049374867,0.71852547,0.2808909,0.00022828001],"about_ca_topic_score_codex":0.000044991775,"about_ca_topic_score_gemma":0.00009344169,"teacher_disagreement_score":0.27714247,"about_ca_system_score_codex":0.000017397704,"about_ca_system_score_gemma":0.00006461813,"threshold_uncertainty_score":0.99960697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1647929,0.00030863873,0.81568795,0.016890805,0.0018202885,0.00032339615,0.0000539299,0.00007722184,0.00004489506],"genre_scores_gemma":[0.9296341,0.00001863145,0.06647787,0.0029045066,0.00086827815,0.00006684309,0.000008652761,0.000014766587,0.0000063467746],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817026,0.00028109673,0.00038944086,0.00033218195,0.00038974962,0.00043725834],"domain_scores_gemma":[0.99746835,0.0012784594,0.00021699036,0.0007882901,0.000093641516,0.00015426111],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011308059,0.00017054685,0.00019315723,0.00009609921,0.003296229,0.0013102414,0.0033684585,0.000022951133,0.000026478527],"category_scores_gemma":[0.000021798924,0.00010325537,0.00019312029,0.00042848586,0.00005888673,0.0003433021,0.0013789366,0.0004505108,0.000009616725],"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.00025903355,0.00015080061,0.0035064921,0.000010760814,0.00045958185,0.000038036353,0.019571654,0.0017959065,0.0047208504,0.32327434,0.09495129,0.55126125],"study_design_scores_gemma":[0.0014704447,0.00047930403,0.015409588,0.000034465458,0.00006114043,0.00044422995,0.0010664928,0.15448795,0.0010307191,0.6136895,0.21119429,0.0006318796],"about_ca_topic_score_codex":0.000036682857,"about_ca_topic_score_gemma":0.000012928277,"teacher_disagreement_score":0.7648412,"about_ca_system_score_codex":0.000040324165,"about_ca_system_score_gemma":0.000053607153,"threshold_uncertainty_score":0.9997265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041055307,0.000060373488,0.95358163,0.0010928863,0.00023240356,0.000067137866,0.0000055471387,0.0002658542,0.040588636],"genre_scores_gemma":[0.90627956,0.0000017539539,0.09207299,0.0014646411,0.000016422111,0.000033101212,0.0000057283837,0.0000018287569,0.00012395096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964345,0.000020023082,0.00003754095,0.00011141103,0.00011270491,0.000074847565],"domain_scores_gemma":[0.99969494,0.000010067571,0.000008895207,0.00026023225,0.00000415301,0.00002173251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101007405,0.000023056742,0.00002301783,0.00003777546,0.00015554867,0.00003545458,0.0004783397,0.0000031710963,0.00038830398],"category_scores_gemma":[0.0000013932055,0.00002134355,0.000021127325,0.0003226712,0.0000060808434,0.0001572491,0.0005379973,0.000056477842,0.00001907842],"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":[5.4761506e-7,0.000025423928,0.00023473498,5.198021e-7,0.000001126704,0.000003366337,0.00012731766,0.000010007132,0.000042391464,0.9854696,0.0074646175,0.0066203857],"study_design_scores_gemma":[0.00016755646,0.00008658202,0.0020715187,3.2730492e-7,8.8916505e-7,0.000030428382,0.00006490315,0.010850898,0.00028216964,0.12953484,0.856777,0.00013286923],"about_ca_topic_score_codex":0.000013256932,"about_ca_topic_score_gemma":0.0000023391503,"teacher_disagreement_score":0.90217406,"about_ca_system_score_codex":0.000004676374,"about_ca_system_score_gemma":0.000011198073,"threshold_uncertainty_score":0.42516562},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8247365,0.0032830555,0.029964834,0.07760451,0.0021319399,0.003936871,0.00086724607,0.001272096,0.056202997],"genre_scores_gemma":[0.98632,0.00018959156,0.012846386,0.0004983412,0.000021729093,0.00010082935,0.000007874556,0.0000067132237,0.000008492646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857336,0.00010046273,0.00028294942,0.0004113199,0.00041023226,0.0002216679],"domain_scores_gemma":[0.9974639,0.00023594873,0.0002507615,0.0016934816,0.00028100377,0.00007492554],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00053484447,0.00017384732,0.00022117197,0.0001475273,0.001178171,0.0001880656,0.007690365,0.000038843136,0.00003092561],"category_scores_gemma":[0.0000639109,0.00015217609,0.00011899445,0.0010203819,0.00024260186,0.000385082,0.012469054,0.0007406935,0.0000017502492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014661911,0.00032372418,0.0018002416,0.000022706387,0.000032328226,1.1828181e-7,0.003886922,0.000002595597,0.00039215042,0.9830682,0.0034297423,0.0070265774],"study_design_scores_gemma":[0.00078844064,0.00066531426,0.013398439,0.00006033137,0.00003780956,0.000050714334,0.0010260455,0.09673559,0.0017390328,0.8662423,0.01866479,0.00059121737],"about_ca_topic_score_codex":0.000046459074,"about_ca_topic_score_gemma":0.000011046545,"teacher_disagreement_score":0.16158359,"about_ca_system_score_codex":0.000041925396,"about_ca_system_score_gemma":0.00008140936,"threshold_uncertainty_score":0.9976785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21348755,0.00021991786,0.7851336,0.00015513728,0.00039080426,0.00026735044,0.000024779942,0.00013261088,0.00018826393],"genre_scores_gemma":[0.92322165,0.000018013334,0.07579331,0.00067708804,0.000034311535,0.0001786734,0.000060025206,0.000015506332,0.000001438862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99774456,0.00020874679,0.00032671535,0.0006423318,0.0006439555,0.00043370805],"domain_scores_gemma":[0.9987244,0.00006170991,0.00014611396,0.0009465488,0.000010810376,0.00011038719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000623717,0.00019447104,0.00017542369,0.0009278663,0.00040962914,0.00020377449,0.0015853831,0.000050399954,0.00016676701],"category_scores_gemma":[0.000019675534,0.00022809178,0.00021753098,0.0022733102,0.00007854381,0.0014782018,0.0009196451,0.00039753687,0.000021275806],"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.000079435,0.0013110633,0.15847778,0.000056179095,0.000036256915,0.00009028657,0.0014516222,0.00095781015,0.013484947,0.8064814,0.00096291065,0.01661029],"study_design_scores_gemma":[0.007054721,0.0011166708,0.4032878,0.000054095053,0.00005399945,0.000030881347,0.00058218505,0.036367904,0.004863181,0.27154914,0.27261093,0.0024284823],"about_ca_topic_score_codex":0.00012016105,"about_ca_topic_score_gemma":0.000023657942,"teacher_disagreement_score":0.7097341,"about_ca_system_score_codex":0.00006878038,"about_ca_system_score_gemma":0.000045937857,"threshold_uncertainty_score":0.93013126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2780438,0.00031557743,0.71919686,0.00070857024,0.00020455637,0.00018251725,0.00026284825,0.00027206144,0.0008132041],"genre_scores_gemma":[0.99229,0.00015871163,0.006933563,0.0003977578,0.000091282214,3.6042212e-7,0.0001137175,0.0000081613625,0.0000064353585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985363,0.000103988416,0.00012578937,0.0009449128,0.000086643704,0.0002023926],"domain_scores_gemma":[0.9987518,0.0001424996,0.00017853492,0.00070239505,0.00005857828,0.00016615019],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009430455,0.00022654135,0.0002349668,0.0002505538,0.00014231667,0.00024685136,0.0010659848,0.00025994168,0.000014881101],"category_scores_gemma":[0.000036918547,0.0002634331,0.000115716364,0.0006766143,0.00008820612,0.00052617793,0.0009954883,0.00047881022,0.0000115221665],"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.00006895178,0.00010677762,0.004413375,0.000115383504,0.00011137061,0.00017509823,0.00062767207,0.026235418,0.00024157447,0.9664077,0.00051919033,0.0009774901],"study_design_scores_gemma":[0.0006212754,0.000049248098,0.009693223,0.00007272853,0.00007287716,3.3812145e-7,0.000053430842,0.6430936,0.0004199737,0.3433317,0.0021237624,0.00046786072],"about_ca_topic_score_codex":0.0010978151,"about_ca_topic_score_gemma":0.00017153699,"teacher_disagreement_score":0.7142462,"about_ca_system_score_codex":0.000043094304,"about_ca_system_score_gemma":0.00022403534,"threshold_uncertainty_score":0.99998176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0658967,0.00012788168,0.9156703,0.00036960232,0.0005510451,0.00018456376,0.00005298252,0.00057024485,0.016576685],"genre_scores_gemma":[0.98195666,0.0000030845856,0.017655954,0.00021000174,0.000060342463,0.000035565427,0.000026881331,0.0000068127015,0.000044725228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985415,0.00015992761,0.00018577791,0.00043651197,0.0003657698,0.0003105267],"domain_scores_gemma":[0.99890536,0.00010620438,0.00006043921,0.00079969404,0.000010172269,0.000118122356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027831132,0.00012295577,0.00013333248,0.0001731838,0.0006506586,0.0002194898,0.0015336861,0.000012970452,0.000095383824],"category_scores_gemma":[0.000005448999,0.0001172461,0.00011530572,0.00045034857,0.000045970453,0.00030169118,0.0017303267,0.00026261734,0.000028111665],"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.000005693983,0.00006664046,0.0047720997,0.00005038719,0.000015441045,0.00008843985,0.0015514775,0.000037629,0.0001962528,0.98406684,0.00085680815,0.008292315],"study_design_scores_gemma":[0.0041728457,0.0015174887,0.53322494,0.0003393026,0.00009198686,0.0037466283,0.0027756225,0.2552129,0.002027508,0.10838792,0.084096044,0.004406816],"about_ca_topic_score_codex":0.00002457788,"about_ca_topic_score_gemma":0.000029340788,"teacher_disagreement_score":0.9160599,"about_ca_system_score_codex":0.00002916437,"about_ca_system_score_gemma":0.00005629775,"threshold_uncertainty_score":0.50044054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63045555,0.0011420901,0.3261209,0.020391505,0.0015278581,0.0017992774,0.00018741156,0.0009315826,0.017443769],"genre_scores_gemma":[0.9744559,0.0000029256955,0.022432636,0.0029235068,0.000016390599,0.00015146476,0.000010860045,0.0000034665882,0.0000028390134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977944,0.00012679427,0.0002489943,0.0006801159,0.000689985,0.00045973324],"domain_scores_gemma":[0.9991218,0.00015303575,0.00008459757,0.00051579723,0.000015505226,0.00010925997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013046095,0.00013012192,0.00017379769,0.00031377247,0.0007516531,0.0001768527,0.0019591812,0.00002915728,0.00010738634],"category_scores_gemma":[0.000012372509,0.00012358675,0.00005734327,0.0028386326,0.00025859333,0.00023393339,0.00059076544,0.00024723916,0.00001558211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035384826,0.00032364583,0.006837347,0.00002569135,0.0000039880583,0.000030715393,0.001558175,0.0013187263,0.0009959015,0.9732337,0.0019471715,0.01368954],"study_design_scores_gemma":[0.0076949415,0.0020518282,0.02023726,0.00009060445,0.000016563974,0.000062247076,0.0051258467,0.24190894,0.012599144,0.4388545,0.26851898,0.0028391771],"about_ca_topic_score_codex":0.00043117147,"about_ca_topic_score_gemma":0.0003344352,"teacher_disagreement_score":0.53437924,"about_ca_system_score_codex":0.000041545896,"about_ca_system_score_gemma":0.00027625958,"threshold_uncertainty_score":0.5781184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09371865,0.000021692258,0.9025495,0.0012326946,0.00047139465,0.00046683592,0.00004324126,0.00037747438,0.001118514],"genre_scores_gemma":[0.93862516,0.0000017997714,0.060344085,0.0006182384,0.00009162056,0.00025585413,0.000042213927,0.0000058523547,0.000015184751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991922,0.000041761014,0.00013439386,0.00030776288,0.00017102616,0.00015289139],"domain_scores_gemma":[0.99937725,0.00011331512,0.000060905888,0.00038185934,0.000027836977,0.000038838167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002747875,0.00007122957,0.0000658489,0.00009842819,0.0005537679,0.00011049995,0.0004970479,0.000019673002,0.00006135095],"category_scores_gemma":[0.000023493198,0.00007240097,0.00006390193,0.00028038622,0.00001113643,0.00029467142,0.00021337272,0.000103827886,0.000012920867],"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.00005863826,0.000274916,0.00037106508,0.000008971693,0.000009965312,0.0000012133138,0.0007107217,0.0004327107,0.011382743,0.884478,0.015524704,0.08674638],"study_design_scores_gemma":[0.003340202,0.0016394752,0.009842851,0.000009268481,0.000014968991,0.00003527104,0.00043599564,0.7435555,0.02216067,0.034934353,0.18315251,0.0008789613],"about_ca_topic_score_codex":0.000038626087,"about_ca_topic_score_gemma":0.000010479599,"teacher_disagreement_score":0.84954363,"about_ca_system_score_codex":0.00003629083,"about_ca_system_score_gemma":0.000025528381,"threshold_uncertainty_score":0.42591912},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047842763,0.0012574013,0.9201639,0.011353922,0.00225288,0.0023101573,0.0006278478,0.0012047009,0.012986408],"genre_scores_gemma":[0.9916622,0.0003336281,0.0066015893,0.0004196177,0.00007780479,0.0004227082,0.00041499795,0.000025645795,0.000041788437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962932,0.00053347694,0.00078997394,0.00088941737,0.0010585454,0.00043540786],"domain_scores_gemma":[0.9961381,0.00041824373,0.00046902674,0.0024092519,0.00035305647,0.0002123093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010320554,0.00036870874,0.00039679598,0.00049829285,0.0011053246,0.0009376095,0.0049500084,0.00009248754,0.00009048825],"category_scores_gemma":[0.000024589157,0.00036875176,0.00013363863,0.0007532077,0.00022609146,0.00046267494,0.0036282747,0.0009314486,0.000011571282],"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.000023738281,0.00039046432,0.0024646886,0.000021277981,0.0001285826,0.0000123089485,0.0004249986,0.0006638823,0.0002261378,0.9614292,0.0010860392,0.033128705],"study_design_scores_gemma":[0.006144227,0.003181596,0.0771053,0.000577786,0.00014872364,0.0010028847,0.0069872206,0.5367829,0.00012671045,0.024417384,0.34022307,0.0033022107],"about_ca_topic_score_codex":0.0006678181,"about_ca_topic_score_gemma":0.00020586106,"teacher_disagreement_score":0.94381946,"about_ca_system_score_codex":0.00026919032,"about_ca_system_score_gemma":0.00020038264,"threshold_uncertainty_score":0.99987644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.315934,0.000040087616,0.6816296,0.0006500443,0.000676675,0.00028777236,0.00033596807,0.00009172082,0.00035414813],"genre_scores_gemma":[0.99739397,0.00007712055,0.0019161846,0.00053623074,0.000010577199,0.00003176734,0.000028847991,0.0000035510843,0.0000017701847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988501,0.00007894109,0.0003308048,0.00020787008,0.000318315,0.00021394121],"domain_scores_gemma":[0.99927044,0.00008291186,0.00009613575,0.000403945,0.00004704267,0.00009951454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017904,0.00013756205,0.00014589936,0.000329967,0.00053470564,0.00017354306,0.0003063525,0.000053943724,0.000028066132],"category_scores_gemma":[0.000008659328,0.00014749826,0.000054835546,0.0006091773,0.00006370006,0.0011312243,0.0000543929,0.00042834246,0.0000036679255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005469729,0.0009194532,0.0013891847,0.00068895234,0.00014327867,0.000045097768,0.2056379,0.08247654,0.00007649618,0.5535257,0.0140141025,0.14053634],"study_design_scores_gemma":[0.0023706139,0.00037129465,0.0013894585,0.000052864994,0.000023366947,0.00012752808,0.0037162164,0.887188,0.0005546719,0.042835962,0.060653508,0.0007164855],"about_ca_topic_score_codex":0.00021402154,"about_ca_topic_score_gemma":0.000078428464,"teacher_disagreement_score":0.80471146,"about_ca_system_score_codex":0.000050579387,"about_ca_system_score_gemma":0.000038894497,"threshold_uncertainty_score":0.6014804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0548569,0.00014037282,0.94290715,0.00014973962,0.00060435076,0.00051807024,0.00054029387,0.0002469023,0.000036228474],"genre_scores_gemma":[0.9282238,0.00001409476,0.071307704,0.00018238788,0.0000826395,0.000028211198,0.00009976053,0.000027176822,0.000034257762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977382,0.00015273818,0.00031006776,0.0007752161,0.00050065375,0.00052315934],"domain_scores_gemma":[0.9988738,0.00028416244,0.00012741206,0.0004282256,0.00011940686,0.00016702893],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006378732,0.00026073065,0.00025730187,0.0002550122,0.0025322912,0.0003536524,0.0005917257,0.000081177146,0.00010836134],"category_scores_gemma":[0.0000031476031,0.00025490514,0.00010815499,0.00091009046,0.000027116861,0.00056255737,0.00004193866,0.0006573566,0.000002892595],"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.0015582104,0.002410707,0.0002504591,0.001120684,0.0005298657,0.00013255441,0.0418454,0.8427099,0.005514512,0.027828434,0.0016050986,0.07449416],"study_design_scores_gemma":[0.0012977725,0.0006425326,0.000057380643,0.00007967709,0.000036062356,0.00008853104,0.0017489723,0.9869973,0.0029387875,0.00029900184,0.005423744,0.0003902459],"about_ca_topic_score_codex":0.0001705815,"about_ca_topic_score_gemma":0.00017882553,"teacher_disagreement_score":0.8733669,"about_ca_system_score_codex":0.00006471459,"about_ca_system_score_gemma":0.000103330996,"threshold_uncertainty_score":0.99999034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49962038,0.0002370761,0.49959478,0.00005622003,0.000104684135,0.00020101441,0.000026688364,0.00012365558,0.0000354946],"genre_scores_gemma":[0.9924139,0.000008205162,0.007321248,0.000048558184,0.000031118587,0.00008970603,0.00006251972,0.000020103898,0.000004674638],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980959,0.00048611153,0.00024879116,0.0004426858,0.00042051566,0.00030599185],"domain_scores_gemma":[0.99847,0.00051924295,0.00027723337,0.00052746,0.00013947346,0.000066583794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011702032,0.00015627214,0.0002299873,0.00026242138,0.0006125558,0.00020428677,0.0023633798,0.000031601703,0.000048519018],"category_scores_gemma":[0.00026628075,0.00014390596,0.00007375525,0.0010442483,0.00005156117,0.00034113685,0.0011915428,0.0005095283,7.45507e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006813611,0.00031866325,0.60256916,0.00029198133,0.00014689664,0.000027235015,0.0051832604,0.32385752,0.0024233973,0.0022820986,0.0001740214,0.062044397],"study_design_scores_gemma":[0.0014081338,0.0011117567,0.31253242,0.00003833457,0.000027524631,0.000044186425,0.000086550775,0.6746892,0.0021704587,0.0053155026,0.0020511078,0.00052484835],"about_ca_topic_score_codex":0.0015172076,"about_ca_topic_score_gemma":0.0011367277,"teacher_disagreement_score":0.49279347,"about_ca_system_score_codex":0.000021238497,"about_ca_system_score_gemma":0.000051224644,"threshold_uncertainty_score":0.58683145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63906085,0.00012884292,0.35612553,0.00037575263,0.0033458825,0.0001358805,0.0002699025,0.00017841971,0.00037892425],"genre_scores_gemma":[0.99158716,0.000032086013,0.00798168,0.00006654296,0.00020968214,0.0000050150666,0.00007643677,0.000013315896,0.000028078079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823284,0.00003240041,0.00037940848,0.00048272352,0.00056925043,0.0003033896],"domain_scores_gemma":[0.9991557,0.00014567729,0.00017414233,0.0003073798,0.0000842544,0.0001328521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029917242,0.00024136345,0.00025011104,0.0003123208,0.00020934404,0.00022656038,0.0010201139,0.00005877363,0.00007003988],"category_scores_gemma":[0.0000404847,0.00025901463,0.000102549726,0.00035632987,0.000036209476,0.0004028236,0.0005222039,0.0005990247,0.0000042130846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029761376,0.00064377364,0.0013758007,0.00013907962,0.0004316783,0.00009763935,0.005512365,0.14059561,0.011466039,0.6358309,0.0067246947,0.19688484],"study_design_scores_gemma":[0.00049494184,0.00030477653,0.0019534158,0.00007202546,0.0000050531744,0.000042525247,0.000068321926,0.99318284,0.00025697882,0.00077225285,0.0025580532,0.00028879452],"about_ca_topic_score_codex":0.00008579072,"about_ca_topic_score_gemma":6.7325465e-7,"teacher_disagreement_score":0.8525872,"about_ca_system_score_codex":0.00005842419,"about_ca_system_score_gemma":0.00010379183,"threshold_uncertainty_score":0.99998623},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20260279,0.0003812572,0.7954225,0.0003028305,0.0005700665,0.00023561134,0.00016847673,0.00019008569,0.00012641658],"genre_scores_gemma":[0.9833099,0.000062229,0.01618028,0.00034331335,0.00004271375,0.000008168101,0.000025994474,0.000015049992,0.000012329364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977221,0.00020228534,0.0003106821,0.00092533836,0.0004332218,0.00040635475],"domain_scores_gemma":[0.9980629,0.00028728577,0.000111320216,0.0013361588,0.000037368052,0.00016494033],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007344755,0.00022991485,0.00023964098,0.00025099827,0.0015164553,0.00028087143,0.0013587624,0.000063307474,0.00009106056],"category_scores_gemma":[0.000014484433,0.00024251762,0.000061510094,0.0007048546,0.000059637372,0.00056358834,0.00037232327,0.0006469829,0.0000029892774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083993113,0.0055458103,0.0027047903,0.0014269007,0.0012386537,0.0013911859,0.049949087,0.31115568,0.009641166,0.07002039,0.03087278,0.5152136],"study_design_scores_gemma":[0.00082289387,0.00013791052,0.00034504646,0.00005217385,0.00003682547,0.00018667967,0.00036903546,0.98446673,0.00048259945,0.000684903,0.01201757,0.0003976279],"about_ca_topic_score_codex":0.00026438228,"about_ca_topic_score_gemma":0.000055547967,"teacher_disagreement_score":0.7807071,"about_ca_system_score_codex":0.000035782847,"about_ca_system_score_gemma":0.00006877515,"threshold_uncertainty_score":0.99978346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770721,0.0013929087,0.006883839,0.0020579854,0.0059214225,0.0007316646,0.0016516453,0.00012669007,0.004161732],"genre_scores_gemma":[0.9992428,0.00012729462,0.000049876067,0.00013138205,0.00016604192,0.00009469347,0.0000902893,0.000011586347,0.00008602677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997958,0.00015534548,0.00043672856,0.00052397733,0.0007286381,0.00019728047],"domain_scores_gemma":[0.99911046,0.000095965624,0.00026573174,0.00033510526,0.00009765017,0.00009510694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049373915,0.00017575153,0.00022822768,0.00025505075,0.00032069033,0.00020186594,0.00061994005,0.00004436666,0.000098167046],"category_scores_gemma":[0.0000055757937,0.00017127907,0.00007939937,0.0002881188,0.00003957366,0.0004309291,0.00035426582,0.00019678776,0.0000038467592],"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.000043777316,0.00042947097,0.023199446,0.00026406377,0.00034621952,0.00012550269,0.0076719215,0.00057758664,0.04431673,0.90189344,0.013003553,0.00812831],"study_design_scores_gemma":[0.012332638,0.0055992887,0.13324143,0.00073277747,0.0002453804,0.0025656957,0.016612211,0.13203716,0.01966468,0.010891096,0.6620561,0.004021546],"about_ca_topic_score_codex":0.00023524348,"about_ca_topic_score_gemma":0.000027267999,"teacher_disagreement_score":0.8910023,"about_ca_system_score_codex":0.00007022787,"about_ca_system_score_gemma":0.00003324356,"threshold_uncertainty_score":0.6984558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010658179,0.0005745848,0.99073786,0.0033983013,0.0021860958,0.0010610298,0.0008002559,0.00037243028,0.00076286786],"genre_scores_gemma":[0.070417,0.00010372382,0.92216325,0.0047890255,0.0012204166,0.00015399134,0.0009849364,0.000117898635,0.00004978133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99348044,0.00008758533,0.0007585241,0.002663993,0.0016692947,0.0013401818],"domain_scores_gemma":[0.99510854,0.0007509435,0.00048628848,0.0028391741,0.00039437017,0.00042067486],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011322757,0.0009227742,0.0008675143,0.0013904702,0.00091078295,0.001431153,0.0076166326,0.0005354098,0.00021655145],"category_scores_gemma":[0.00024332153,0.00088391843,0.0004649101,0.0019103762,0.0008600059,0.001280712,0.004194894,0.0020319952,0.000010092794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003833204,0.00011120982,0.0001558626,0.00018796865,0.00007520048,0.0000722503,0.0016954506,0.018461186,0.00006359022,0.59833616,0.000728293,0.38007453],"study_design_scores_gemma":[0.0006981827,0.00035619808,0.00038402493,0.00014097037,0.000023736982,0.00011117328,4.822309e-7,0.055559527,0.00014614087,0.7248954,0.21642251,0.0012616633],"about_ca_topic_score_codex":0.000032510772,"about_ca_topic_score_gemma":0.0002773726,"teacher_disagreement_score":0.37881285,"about_ca_system_score_codex":0.0004129406,"about_ca_system_score_gemma":0.000996187,"threshold_uncertainty_score":0.9996055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053990833,0.0002999561,0.9428875,0.001619442,0.00041593614,0.00021117285,0.0000027451642,0.00021803989,0.0003543665],"genre_scores_gemma":[0.9932769,0.0006345537,0.0054167444,0.00029278558,0.000077731296,0.000031363354,0.00023086795,0.000009758865,0.000029316396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892217,0.00009148786,0.00021074382,0.00034376077,0.00014028938,0.00029156212],"domain_scores_gemma":[0.99917686,0.0000963537,0.00007469026,0.00058340916,0.000009986704,0.00005872525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045871202,0.00010046798,0.00009720932,0.00015243993,0.00009684848,0.00009943968,0.0007256114,0.00007772571,0.000030112398],"category_scores_gemma":[0.000038642298,0.00010995671,0.000032991014,0.0011985631,0.000017584776,0.0006250627,0.0006682396,0.00017674478,0.000094024326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041874304,0.00018400313,0.018805575,0.000028980983,0.000032370855,0.000022222925,0.0038261614,0.057170145,0.00019824828,0.009138694,0.0233107,0.887241],"study_design_scores_gemma":[0.00040115448,0.00003821243,0.09336494,0.000035360572,0.000002954029,0.0000013842624,0.000063908104,0.8382963,0.00003088226,0.0053914934,0.06218204,0.00019140357],"about_ca_topic_score_codex":0.0000133856265,"about_ca_topic_score_gemma":0.00006072485,"teacher_disagreement_score":0.93928605,"about_ca_system_score_codex":0.000036864447,"about_ca_system_score_gemma":0.000010332027,"threshold_uncertainty_score":0.44839045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015527944,0.00017697131,0.99465996,0.00042144212,0.00033230754,0.00048681122,0.00037245042,0.00093122973,0.0010660286],"genre_scores_gemma":[0.9502912,0.0022945981,0.040647242,0.001804767,0.00065519544,0.0013464735,0.0022029066,0.000117013085,0.00064059126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814206,0.00032153397,0.00023249227,0.0008547001,0.0002427227,0.00020650354],"domain_scores_gemma":[0.9973401,0.0007500173,0.00010228086,0.0015775898,0.000113166854,0.000116845295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018342288,0.00021325174,0.00020726456,0.00024040346,0.00017435085,0.00038978297,0.0012244536,0.0001887359,0.000028548537],"category_scores_gemma":[0.00008862923,0.00019385036,0.00007645469,0.0004635765,0.00010512078,0.00011390552,0.0018390479,0.00042547076,0.00029566657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006104815,0.000054491516,0.0012521667,0.000028165883,0.000023228034,0.0000019590611,0.00009508201,0.000018946856,0.0000036165343,0.98510504,0.0058436967,0.0075675133],"study_design_scores_gemma":[0.00010373409,0.000034448625,0.18807805,0.00002786574,0.00000844693,0.0000021025771,0.000011630784,0.00089822616,0.000023761959,0.8052923,0.0052083097,0.00031111558],"about_ca_topic_score_codex":0.00040094706,"about_ca_topic_score_gemma":0.00050792505,"teacher_disagreement_score":0.9540127,"about_ca_system_score_codex":0.000013458856,"about_ca_system_score_gemma":0.00007848049,"threshold_uncertainty_score":0.7904988},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13089742,0.00018419778,0.8660055,0.00086317584,0.0007873144,0.00023211865,0.00067119015,0.00034958145,0.000009542488],"genre_scores_gemma":[0.7402907,0.00012663672,0.25454673,0.0002711412,0.0003505013,0.000042082796,0.0043587163,0.000010611516,0.0000028681782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831474,0.000041087824,0.00025213548,0.00081378786,0.000104968254,0.00047329068],"domain_scores_gemma":[0.998436,0.00028612555,0.00008861672,0.0010404347,0.00004713623,0.00010171348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006620186,0.00014214388,0.00020196641,0.00020429355,0.000229999,0.000079922116,0.0021045578,0.00021097786,0.000011574112],"category_scores_gemma":[0.00012430926,0.00012541699,0.000037793216,0.00090490823,0.00012116202,0.0003472991,0.0016444338,0.00017473305,0.000082324594],"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.00007055678,0.00018128585,0.0053660367,0.00027966595,0.0001570496,0.000017501252,0.001814088,0.0003974086,0.007974112,0.9010347,0.0065313787,0.0761762],"study_design_scores_gemma":[0.00094554323,0.00042296445,0.020518446,0.000040592968,0.000018991845,0.000016916976,0.000064641914,0.48390988,0.00025472924,0.35225424,0.14100857,0.0005444983],"about_ca_topic_score_codex":0.000024912715,"about_ca_topic_score_gemma":0.0000080411655,"teacher_disagreement_score":0.6114587,"about_ca_system_score_codex":0.000016788083,"about_ca_system_score_gemma":0.00005014787,"threshold_uncertainty_score":0.5114357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037621967,0.0040342514,0.9293125,0.0064145597,0.0008896521,0.001500284,0.019034835,0.00045523542,0.0007366968],"genre_scores_gemma":[0.98546076,0.00037269655,0.010966993,0.0010319746,0.00002414189,0.00034685514,0.0017794176,0.000011841091,0.0000053514254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707854,0.0005896803,0.0005275816,0.00079931715,0.00044239612,0.0005624843],"domain_scores_gemma":[0.99572194,0.00048822453,0.0003828498,0.0028673655,0.00033219066,0.00020744107],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006823107,0.00033931775,0.00042323399,0.000119550874,0.0025797675,0.00081057375,0.008117663,0.0000826999,0.0000838209],"category_scores_gemma":[0.00004691117,0.00039638186,0.00017417384,0.0014887325,0.00024528368,0.000910012,0.006095542,0.000579711,0.000005713844],"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.00014199762,0.000907604,0.015452544,0.00024288258,0.00034464907,0.0000149403395,0.0021788178,0.0011607278,0.00028663862,0.93852866,0.008475928,0.032264635],"study_design_scores_gemma":[0.0022504502,0.0002566564,0.016755208,0.000046029632,0.000102706574,0.0001068535,0.0021661853,0.8654075,0.00001189902,0.061851125,0.050225273,0.0008201037],"about_ca_topic_score_codex":0.0005028834,"about_ca_topic_score_gemma":0.0013333308,"teacher_disagreement_score":0.9478388,"about_ca_system_score_codex":0.0002591815,"about_ca_system_score_gemma":0.00027221572,"threshold_uncertainty_score":0.9998488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07618168,0.000086163935,0.91049564,0.0024778144,0.0009323967,0.00096337247,0.00005958906,0.00045834435,0.00834497],"genre_scores_gemma":[0.9989015,0.000011197989,0.0005783018,0.00035986266,0.00004151627,0.000023968736,0.00007874403,0.000002349717,0.000002561736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990769,0.000059312406,0.00025710673,0.0001061999,0.00029989387,0.00020057555],"domain_scores_gemma":[0.99940443,0.000058305395,0.00005975987,0.00040430328,0.00002311319,0.000050086874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090922846,0.00007872639,0.000082864986,0.00030713127,0.00009724013,0.000342366,0.0006592432,0.000047261477,0.0000011626485],"category_scores_gemma":[0.000052744792,0.000057936206,0.000033287713,0.0020910737,0.000020783671,0.0016500817,0.0001436351,0.000119593824,0.00021127949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025739888,0.000041105446,0.00012557577,0.00011805718,0.000008317034,0.000002188835,0.046410013,0.017294496,0.000009783765,0.8879431,0.019736972,0.028284648],"study_design_scores_gemma":[0.00029555682,0.000052290714,0.012065936,0.000028793651,0.000002407683,0.00001419498,0.0013357501,0.9155584,0.000029110779,0.002086658,0.068356715,0.00017417569],"about_ca_topic_score_codex":0.00002792906,"about_ca_topic_score_gemma":0.0000028438553,"teacher_disagreement_score":0.92271984,"about_ca_system_score_codex":0.000029477427,"about_ca_system_score_gemma":0.000029130293,"threshold_uncertainty_score":0.33014432},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019484296,0.0043200445,0.98774743,0.0002932971,0.0015709493,0.0004829472,0.000025289588,0.0002177252,0.005147458],"genre_scores_gemma":[0.66148466,0.00044266338,0.33560586,0.0015839753,0.00057948596,0.000049550952,0.000045681292,0.000068450536,0.00013969152],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960156,0.00006210877,0.0004291688,0.0019697326,0.0008621824,0.00066122593],"domain_scores_gemma":[0.9974678,0.00049205264,0.0001474212,0.0015125985,0.00014480934,0.00023532377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009121773,0.0005696392,0.0005215424,0.000984274,0.0005603683,0.0006526674,0.0036693339,0.0002962266,0.000050651764],"category_scores_gemma":[0.00005837866,0.000533124,0.00014596042,0.0008447407,0.0009048759,0.00083357404,0.0040999446,0.0014104438,0.000009685803],"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.000008931309,0.000065138476,0.000102475555,0.00006375089,0.000017786964,0.000115204646,0.0019917537,0.0014497493,0.000100639656,0.21352679,0.00012369921,0.7824341],"study_design_scores_gemma":[0.0004551285,0.0004931674,0.0009861581,0.00030431664,0.00002558903,0.00016384522,5.841956e-7,0.14544725,0.0006783983,0.79738253,0.052214246,0.0018487751],"about_ca_topic_score_codex":0.000014708827,"about_ca_topic_score_gemma":0.00007356506,"teacher_disagreement_score":0.7805853,"about_ca_system_score_codex":0.00014358143,"about_ca_system_score_gemma":0.00034736717,"threshold_uncertainty_score":0.99971205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004196063,0.0002837348,0.9932852,0.00043518498,0.00083602377,0.0005083146,0.00006958792,0.00013173452,0.0040306533],"genre_scores_gemma":[0.57003886,0.00018051568,0.4290643,0.00047752514,0.00014072043,0.00002073347,0.0000341723,0.000028335948,0.000014858736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995557,0.00006646155,0.0007954342,0.0015461353,0.0014733538,0.0005616072],"domain_scores_gemma":[0.99711144,0.00047624105,0.00032610996,0.0017233952,0.00019077222,0.00017203215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017608695,0.00047155586,0.00072092155,0.00083068927,0.00029722758,0.00019714386,0.0035827227,0.00029134072,0.00007658005],"category_scores_gemma":[0.00007858489,0.0004222919,0.00034513694,0.0010247654,0.0011977482,0.0012293903,0.0012341461,0.0011665636,0.000004572282],"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.00006662226,0.00013068583,0.00004738661,0.00008849128,0.000013499421,0.000020709025,0.0010827761,0.026070887,0.00027393358,0.5480212,0.000010269548,0.4241735],"study_design_scores_gemma":[0.00059393124,0.0001734526,0.000050736224,0.000072465366,0.0000095388095,0.000016774628,2.0022003e-7,0.50781345,0.00065966754,0.48873472,0.0014792606,0.00039581736],"about_ca_topic_score_codex":0.000026373951,"about_ca_topic_score_gemma":0.00009575207,"teacher_disagreement_score":0.56961924,"about_ca_system_score_codex":0.00021298329,"about_ca_system_score_gemma":0.000725273,"threshold_uncertainty_score":0.9998229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066588014,0.00003181817,0.969496,0.0004611675,0.00009253279,0.015807632,0.00014682191,0.0002159991,0.013681433],"genre_scores_gemma":[0.2177144,0.00048214453,0.71963215,0.0018720421,0.000112818394,0.057222992,0.0025120787,0.00007859149,0.00037277184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790066,0.000057490175,0.00078295823,0.0004300193,0.00053235074,0.0002965346],"domain_scores_gemma":[0.99673516,0.0001793124,0.0003342941,0.002532476,0.00010791298,0.000110841356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011788828,0.00025122872,0.00024670854,0.0014052091,0.00033117953,0.00047531273,0.0033234335,0.00015477861,0.0000048826414],"category_scores_gemma":[0.00003309321,0.00026114195,0.000061547085,0.0008377387,0.000802414,0.0013823943,0.0020579752,0.00043953993,0.00006177582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011319696,0.00015032924,0.00011482187,0.00010926584,0.0000072141474,0.0000016517722,0.0026000722,0.009524219,0.0000029654748,0.92320096,0.00007556928,0.0642016],"study_design_scores_gemma":[0.0005209517,0.00004817786,0.00076525786,0.000111365334,0.0000029414773,0.000009155091,0.00000978196,0.9557448,0.0000064261517,0.010709792,0.031780634,0.0002906923],"about_ca_topic_score_codex":0.000012863418,"about_ca_topic_score_gemma":0.000010699172,"teacher_disagreement_score":0.9462206,"about_ca_system_score_codex":0.00015857795,"about_ca_system_score_gemma":0.00022242995,"threshold_uncertainty_score":0.9999841},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010995089,0.00022413096,0.9630331,0.000042380118,0.000427149,0.00046496757,0.0000657815,0.00012634635,0.024621086],"genre_scores_gemma":[0.6682377,0.0005584679,0.29390335,0.00048607597,0.00026408525,0.0002879161,0.03526923,0.000041156116,0.00095205306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881256,0.00001985124,0.00041935832,0.000220752,0.00039706094,0.00013039866],"domain_scores_gemma":[0.99851173,0.000038177757,0.00030265487,0.0007626342,0.00033123963,0.000053588916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017238056,0.000133038,0.00018347909,0.0002604665,0.00007525717,0.00014169535,0.00072545715,0.00015723599,0.000051492396],"category_scores_gemma":[0.000026381771,0.00012854853,0.00012382174,0.001153013,0.00001657455,0.0004327422,0.00010146795,0.00016172261,0.000033157936],"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.0000200723,0.00010065022,0.000014502136,0.0002766394,0.000027143584,4.5231826e-7,0.0014452437,0.000039345923,0.00026511497,0.97293234,0.00060453976,0.024273973],"study_design_scores_gemma":[0.0028192473,0.00033405414,0.018707141,0.0007145921,0.00025552663,0.000024550998,0.0036332714,0.03388845,0.2175253,0.05781291,0.6612955,0.002989474],"about_ca_topic_score_codex":0.000025003681,"about_ca_topic_score_gemma":0.00001904339,"teacher_disagreement_score":0.9151194,"about_ca_system_score_codex":0.000015154962,"about_ca_system_score_gemma":0.0001435441,"threshold_uncertainty_score":0.52420574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29505974,0.00005049153,0.702107,0.0002834482,0.0003908807,0.00030490206,0.00007679885,0.00025450948,0.0014722188],"genre_scores_gemma":[0.99823105,0.00021706037,0.0011810329,0.00017921379,0.00003358468,0.0000014019364,0.00004277728,0.000014039226,0.00009981045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978025,0.00026881456,0.00020043387,0.0011501496,0.0001594442,0.00041867135],"domain_scores_gemma":[0.9975477,0.00022261696,0.00016744113,0.001898559,0.00007095816,0.000092745606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065697584,0.00030272026,0.00028513063,0.0004347695,0.00016740208,0.00027611668,0.003757494,0.00025205637,0.000006187289],"category_scores_gemma":[0.00004377776,0.00028645043,0.00025074466,0.0012071757,0.00018184753,0.0005527461,0.0024703874,0.0009210649,0.000081504346],"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.00001775183,0.00012915257,0.0007150971,0.000037096608,0.000028286848,0.00040236415,0.002047192,0.079623185,0.0000046674986,0.91615134,0.00080564356,0.000038192662],"study_design_scores_gemma":[0.00019396357,0.000018890605,0.0028863382,0.00003825783,0.000014572452,0.000001667769,0.000254058,0.5832322,0.000004393404,0.41291973,0.00019273077,0.0002431535],"about_ca_topic_score_codex":0.00026553273,"about_ca_topic_score_gemma":0.00033184758,"teacher_disagreement_score":0.7031713,"about_ca_system_score_codex":0.00009847534,"about_ca_system_score_gemma":0.00023243151,"threshold_uncertainty_score":0.99995875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0673364,0.00013386417,0.92110074,0.007677382,0.00076183944,0.00010321752,0.000003162768,0.00009962881,0.0027837767],"genre_scores_gemma":[0.83207786,0.000087233566,0.16707802,0.00049602834,0.00022868998,0.00000500231,0.0000017026094,0.000011161823,0.000014313985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983351,0.00012281991,0.00061572745,0.00016334411,0.00043565733,0.0003273105],"domain_scores_gemma":[0.9985914,0.00038675914,0.00031369846,0.0003946865,0.00013202406,0.00018140598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010421238,0.00012660972,0.00036719543,0.00034038594,0.00007206967,0.00007215199,0.0009443369,0.00009573161,0.00011556186],"category_scores_gemma":[0.00044839398,0.000095032294,0.00019550895,0.0006387497,0.00005057135,0.00038488267,0.0002492289,0.00031095406,0.0005839485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020387011,0.00017483004,0.00011395642,0.000059970847,0.000053604505,0.00030136455,0.0008789828,0.000007718216,0.00028535043,0.9771434,0.019368304,0.0015921391],"study_design_scores_gemma":[0.00060117105,0.00037312615,0.0011018008,0.000050914958,0.00002697188,0.001078162,0.00025270478,0.0032886663,0.0003268446,0.9844335,0.008315172,0.00015096551],"about_ca_topic_score_codex":6.148007e-7,"about_ca_topic_score_gemma":0.000002020658,"teacher_disagreement_score":0.7647414,"about_ca_system_score_codex":0.000021450043,"about_ca_system_score_gemma":0.000065971995,"threshold_uncertainty_score":0.7505672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6138,0.00013477544,0.38526535,0.000011337906,0.0000644825,0.000039658134,0.0000022906588,0.00003754943,0.00064454344],"genre_scores_gemma":[0.6471845,0.0000014760379,0.35275275,0.000039050366,0.0000048390734,0.0000026151881,0.0000017351638,0.0000025259283,0.000010529006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929285,0.00001570386,0.00014742486,0.00022697826,0.00018559504,0.00013145058],"domain_scores_gemma":[0.9996535,0.000012030292,0.00004585039,0.00023127646,0.000016522376,0.000040779683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024409642,0.00005686595,0.000080853766,0.00009867928,0.00027178475,0.000051349172,0.0003390548,0.000009075769,0.000060225648],"category_scores_gemma":[0.0000029259927,0.00005848085,0.00001967363,0.00034723766,0.000017895793,0.0002486101,0.0012099538,0.000066046356,6.6525996e-7],"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.000024007535,0.00021076316,0.030277906,0.00009851542,0.000093891525,0.000022458755,0.029685104,0.00048368194,0.016730726,0.8517017,0.00016558461,0.07050569],"study_design_scores_gemma":[0.0030850996,0.00033817362,0.047221985,0.00016562648,0.00006950227,0.00034841607,0.019247245,0.73852944,0.07056423,0.040910095,0.076947354,0.002572823],"about_ca_topic_score_codex":0.00009494539,"about_ca_topic_score_gemma":0.000009874187,"teacher_disagreement_score":0.81079155,"about_ca_system_score_codex":0.000023135357,"about_ca_system_score_gemma":0.00005471978,"threshold_uncertainty_score":0.23847799},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26178524,0.00013989833,0.7363454,0.0002458938,0.000649307,0.00039498642,0.00010635366,0.0003180713,0.000014871771],"genre_scores_gemma":[0.97052985,0.000038377035,0.029107077,0.00017898832,0.00007008273,0.000021381675,0.000017369046,0.000021837473,0.000015043178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789727,0.000104149316,0.00029753338,0.0007862737,0.00032406487,0.00059070386],"domain_scores_gemma":[0.9986341,0.0005161116,0.00006674923,0.00044720413,0.00010205246,0.00023375971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072156166,0.00026839986,0.00027310682,0.0003917125,0.0010177261,0.00030697166,0.00038167127,0.00013741001,0.000007091997],"category_scores_gemma":[0.0000070758388,0.00026147056,0.00013997014,0.0009366655,0.00008717357,0.00016813043,0.000023417275,0.00040666864,0.00001242837],"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.00026996617,0.0013427642,0.00023713573,0.00088880624,0.00021359128,0.00015204451,0.013740659,0.8472229,0.0029765344,0.012578954,0.0012587563,0.11911788],"study_design_scores_gemma":[0.0014317036,0.000211731,0.00020556999,0.000083951316,0.000022086913,0.000018800822,0.00026774136,0.99155873,0.00415536,0.00012614773,0.0016019662,0.00031619097],"about_ca_topic_score_codex":0.0000504044,"about_ca_topic_score_gemma":0.00006347501,"teacher_disagreement_score":0.70874465,"about_ca_system_score_codex":0.000030256584,"about_ca_system_score_gemma":0.00007111459,"threshold_uncertainty_score":0.9999837},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18482636,0.00000478175,0.8133693,0.0005496961,0.00022660899,0.00027559517,0.000075778444,0.0003828483,0.0002890401],"genre_scores_gemma":[0.9601199,0.0000015144001,0.039372258,0.00021278182,0.000050776824,0.000040825864,0.00015084552,0.000007471588,0.00004359744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990686,0.000020912632,0.00015208052,0.00034389194,0.00016064815,0.00025384373],"domain_scores_gemma":[0.9993357,0.000065382934,0.00005100892,0.0004113414,0.000057024823,0.00007953788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020462176,0.00011616898,0.00012605375,0.00017051173,0.00014212923,0.00012322947,0.00037212248,0.00003556217,0.000018270983],"category_scores_gemma":[0.000008763077,0.000085343,0.000064983346,0.00082615664,0.000036760488,0.00019818002,0.00017211815,0.00008729515,0.000043808854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053527515,0.0011736617,0.0013684232,0.00015548582,0.00015789739,0.000027914179,0.006631502,0.0034922021,0.0024031422,0.8252833,0.14527968,0.013491521],"study_design_scores_gemma":[0.002955465,0.00074769446,0.000713875,0.000031563228,0.000015468864,0.000014937695,0.00039003635,0.9301058,0.0033319758,0.001858368,0.0595493,0.00028551376],"about_ca_topic_score_codex":0.000009571437,"about_ca_topic_score_gemma":0.00006629036,"teacher_disagreement_score":0.9266136,"about_ca_system_score_codex":0.0000120260665,"about_ca_system_score_gemma":0.000017301207,"threshold_uncertainty_score":0.34801865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04376973,0.00005065613,0.951708,0.002740125,0.00019825166,0.00008466831,0.0000040408186,0.00004359643,0.001400896],"genre_scores_gemma":[0.9546459,0.0003586882,0.044266082,0.00069270603,0.000026926771,0.000002381562,0.000003643727,0.0000017798635,0.0000018913846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983209,0.00004570485,0.00033433695,0.000108032094,0.00084266847,0.0003483606],"domain_scores_gemma":[0.9986245,0.0002212622,0.00027042808,0.0002264124,0.0004958698,0.00016152875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047401497,0.0000728575,0.00010421123,0.0011880295,0.00033756558,0.000688007,0.00071649166,0.000031480136,0.000005371027],"category_scores_gemma":[0.0007090676,0.000057654914,0.000051756553,0.0031965277,0.00008452104,0.0114088,0.00011636774,0.0002366529,0.0000132341565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003209055,0.00004853625,0.00075261993,0.000019322906,0.0000053938966,0.0000019126576,0.0011456369,0.003335816,0.0017752931,0.8850908,0.0010322101,0.10676032],"study_design_scores_gemma":[0.00040574078,0.00041315955,0.0052225688,0.000013851355,0.0000015865501,0.000022684162,0.000055965756,0.9313771,0.0012323695,0.007931915,0.053238265,0.00008478283],"about_ca_topic_score_codex":0.0000032566265,"about_ca_topic_score_gemma":0.0000021155026,"teacher_disagreement_score":0.9280413,"about_ca_system_score_codex":0.00006703897,"about_ca_system_score_gemma":0.00064754573,"threshold_uncertainty_score":0.82711047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24928406,0.00022385297,0.74008274,0.00414092,0.002629068,0.00018221652,0.00011934976,0.00012247301,0.003215299],"genre_scores_gemma":[0.9935416,0.00032090975,0.005688113,0.0003093178,0.000073680916,0.0000015750816,0.00006175244,0.000002205653,8.3610206e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850446,0.0000787122,0.0007250273,0.000057554065,0.0005147688,0.000119478784],"domain_scores_gemma":[0.99768156,0.00019587897,0.00080492283,0.00028493168,0.0009704184,0.000062286344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008104485,0.0000816289,0.00015368279,0.00053275266,0.000047178422,0.00010869527,0.0014197422,0.00008213355,0.000042729134],"category_scores_gemma":[0.00020379193,0.00007462002,0.00013248636,0.00051819376,0.00007272496,0.0030172737,0.00033873218,0.00025839946,0.000021898157],"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.00011210191,0.000113259826,0.0028379466,0.000019775805,0.00016876329,0.000011170884,0.008344668,0.0018072135,0.000042984502,0.9572839,0.0157725,0.013485685],"study_design_scores_gemma":[0.0049832817,0.00040170996,0.11329219,0.00032300007,0.00004265879,0.00055264536,0.0022446394,0.58741647,0.0011744736,0.16190071,0.12709282,0.0005754003],"about_ca_topic_score_codex":0.000026542879,"about_ca_topic_score_gemma":0.00001021972,"teacher_disagreement_score":0.7953832,"about_ca_system_score_codex":0.00003309738,"about_ca_system_score_gemma":0.00006212522,"threshold_uncertainty_score":0.3042916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34254947,0.000031898893,0.6554337,0.00037962932,0.0005004134,0.00025319553,0.00046583157,0.00020525952,0.00018058959],"genre_scores_gemma":[0.99705595,0.0003749189,0.002127334,0.00027069254,0.000017250446,0.000012280158,0.00013574985,0.0000050411263,8.08796e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998524,0.000059927137,0.00041675163,0.00033922342,0.000357687,0.00030237116],"domain_scores_gemma":[0.9985094,0.00016806765,0.000098312834,0.0010174565,0.00007017472,0.00013658221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070699904,0.00018432607,0.00019172265,0.00052658067,0.00032844843,0.0003197249,0.0006431461,0.00012930584,0.000009726105],"category_scores_gemma":[0.000031158692,0.00018386598,0.000048278318,0.00128518,0.000112026806,0.0024645468,0.00010041258,0.00038230157,0.000009182103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005880039,0.001242666,0.006787846,0.0017555954,0.00036749232,0.00007296935,0.10067565,0.03315406,0.00020597446,0.57794917,0.023094703,0.2541059],"study_design_scores_gemma":[0.0011218821,0.00007286614,0.0096710175,0.00006518886,0.000016457547,0.000012643236,0.0003768555,0.9363697,0.0003123218,0.04639238,0.0052023767,0.0003862628],"about_ca_topic_score_codex":0.00028618684,"about_ca_topic_score_gemma":0.0003044121,"teacher_disagreement_score":0.9032157,"about_ca_system_score_codex":0.000020115072,"about_ca_system_score_gemma":0.00004061695,"threshold_uncertainty_score":0.7497837},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4319866,0.00006504878,0.56672466,0.0005511868,0.00020658893,0.0001630547,0.000012174362,0.0002623575,0.000028323053],"genre_scores_gemma":[0.99412626,0.0001302638,0.005489832,0.0001515244,0.000049541566,0.000024240919,0.0000076677225,0.000012569795,0.000008129245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982118,0.00010140677,0.000264863,0.000575192,0.00048883766,0.00035792575],"domain_scores_gemma":[0.99878484,0.00045924887,0.00008424695,0.00037955845,0.00007177838,0.0002203364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048903725,0.0001999898,0.0002064844,0.0002354072,0.00061263016,0.00026942528,0.00038423983,0.0001221091,0.000016384722],"category_scores_gemma":[0.000020016287,0.00016847404,0.000049456037,0.0011196162,0.00007716418,0.00031395463,0.000030452351,0.00035663333,0.000007253328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000502281,0.0018417722,0.0057853,0.00088582974,0.0005941824,0.00062819116,0.022630101,0.20320162,0.000450728,0.026425848,0.0025862975,0.73446786],"study_design_scores_gemma":[0.0009606237,0.00023420993,0.0069449134,0.000204702,0.000029105888,0.000110400746,0.00009345584,0.98845565,0.0010561942,0.00040782284,0.0012035458,0.00029934561],"about_ca_topic_score_codex":0.000093622635,"about_ca_topic_score_gemma":0.000111469715,"teacher_disagreement_score":0.78525406,"about_ca_system_score_codex":0.000015088075,"about_ca_system_score_gemma":0.00006717545,"threshold_uncertainty_score":0.6870172},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34567368,0.000029698947,0.6517971,0.0010413467,0.00070676114,0.00011731186,0.000013102457,0.00045010707,0.00017087492],"genre_scores_gemma":[0.98663276,0.00006390813,0.012725566,0.00048305714,0.00006655662,0.000006664664,0.000004791787,0.000011313403,0.0000053717727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984816,0.000119474025,0.0002736422,0.0005029243,0.0002516896,0.0003707245],"domain_scores_gemma":[0.9989413,0.00042809907,0.00007030504,0.0004102176,0.000039843897,0.00011021006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040433844,0.00018136868,0.00019082938,0.00033871282,0.0003096292,0.00024348394,0.00031020178,0.000103406506,0.000009032834],"category_scores_gemma":[0.0000028188058,0.0001873521,0.000063832296,0.0016058726,0.000047928297,0.00076181843,0.000021996111,0.00041369637,0.000050941675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005783753,0.0029749891,0.009462337,0.0031407312,0.0006097019,0.0019356105,0.15458131,0.12631273,0.0038911414,0.34113666,0.001881004,0.3534954],"study_design_scores_gemma":[0.0011664137,0.00019866491,0.007299071,0.00029308477,0.000025252904,0.00016743789,0.0024186329,0.9724875,0.002150147,0.0076764,0.0054059476,0.00071143964],"about_ca_topic_score_codex":0.00023232154,"about_ca_topic_score_gemma":0.0012368498,"teacher_disagreement_score":0.8461748,"about_ca_system_score_codex":0.000018891913,"about_ca_system_score_gemma":0.000034143122,"threshold_uncertainty_score":0.76399964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009089809,0.00030374533,0.8725289,0.10502594,0.00026848476,0.00062480516,0.00052259007,0.0014760747,0.01834049],"genre_scores_gemma":[0.97664094,0.000019056115,0.020967534,0.0019850356,0.00003131894,0.00006395865,0.00023842859,0.000011615958,0.000042091426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885255,0.000175458,0.0001941527,0.0002516071,0.00030216237,0.00022407202],"domain_scores_gemma":[0.993131,0.0015301091,0.00008176135,0.005075563,0.00007602787,0.00010552726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033844984,0.00013431402,0.000111905916,0.00014843326,0.00055148266,0.00048420302,0.0046168617,0.0000728406,0.000025692787],"category_scores_gemma":[0.00013269659,0.0001010913,0.00012989211,0.0017735832,0.0000846944,0.00031903767,0.00061381777,0.00037132055,0.00034840306],"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.000009784691,0.00019684371,0.00038691945,0.000013334236,0.000022191862,0.0000035290143,0.00062300597,0.0007604993,0.00012823379,0.80510014,0.18399473,0.008760803],"study_design_scores_gemma":[0.00047774726,0.000084217674,0.0021737327,0.00010370784,0.000010744813,0.0000017677038,0.00014326109,0.51365066,0.00021618462,0.019241681,0.46359164,0.00030468655],"about_ca_topic_score_codex":0.00002149442,"about_ca_topic_score_gemma":0.00006803257,"teacher_disagreement_score":0.97573197,"about_ca_system_score_codex":0.000020753023,"about_ca_system_score_gemma":0.00017432854,"threshold_uncertainty_score":0.8579355},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20470914,0.002646742,0.7874174,0.0020068823,0.0017161521,0.00048528492,0.00042358268,0.0005420027,0.000052805328],"genre_scores_gemma":[0.9845775,0.00043310013,0.014025173,0.0003254712,0.00043529682,0.0000996995,0.000053684682,0.000032709577,0.000017372819],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653107,0.00019529964,0.000493439,0.0008724369,0.00095750386,0.0009502309],"domain_scores_gemma":[0.9979286,0.00040380727,0.00013313923,0.00091406633,0.00032205458,0.00029833106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025593867,0.00028595474,0.00043245277,0.00027530608,0.0003959726,0.0005260751,0.0017914678,0.00017548949,0.000017315679],"category_scores_gemma":[0.0001505333,0.0002568144,0.00011473978,0.0006874271,0.00007424382,0.0002571322,0.0022132567,0.00036456197,0.000006861502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006068817,0.00075787096,0.0073972307,0.004727472,0.0007198184,0.00020160283,0.035110466,0.0059066117,0.00017516332,0.3043106,0.42908612,0.21100017],"study_design_scores_gemma":[0.00075311033,0.00046608265,0.00050208747,0.0003725037,0.000010091275,0.000029655068,0.00024846246,0.8751154,0.0001266243,0.0026579157,0.11939129,0.00032676285],"about_ca_topic_score_codex":0.000056620076,"about_ca_topic_score_gemma":0.00020334868,"teacher_disagreement_score":0.8692088,"about_ca_system_score_codex":0.00013090276,"about_ca_system_score_gemma":0.0003851977,"threshold_uncertainty_score":0.99998844},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039068822,0.0021349099,0.98850393,0.00060411124,0.004005443,0.00035298232,0.000021158403,0.00031775,0.0040206476],"genre_scores_gemma":[0.01268672,0.004018683,0.9759042,0.004570847,0.0019705512,0.000117249445,0.00012532953,0.00014406464,0.00046233297],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99484533,0.00012942428,0.0006719526,0.002220946,0.00097033853,0.0011620155],"domain_scores_gemma":[0.9964274,0.0011578407,0.00026326557,0.0018207795,0.00014044654,0.00019024913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001229063,0.0005686052,0.0007127185,0.0022708562,0.00020471451,0.00044754436,0.0059076454,0.00041320972,0.000015971164],"category_scores_gemma":[0.00026104331,0.00055218907,0.00015694504,0.005069825,0.00092054077,0.001533905,0.0025972936,0.0013244251,0.00020102756],"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.0000124172575,0.0000994765,0.00053019845,0.00014766553,0.0000066729294,0.00073431805,0.0009957545,0.014158275,0.000029952565,0.09553486,0.0010008105,0.8867496],"study_design_scores_gemma":[0.0003972535,0.00017588648,0.00092605787,0.000412716,0.0000038128653,0.00006312585,3.7567827e-7,0.12307408,0.00010844188,0.8533755,0.020600634,0.0008621505],"about_ca_topic_score_codex":0.0000293419,"about_ca_topic_score_gemma":0.0012038624,"teacher_disagreement_score":0.88588744,"about_ca_system_score_codex":0.00026673474,"about_ca_system_score_gemma":0.0010397094,"threshold_uncertainty_score":0.999693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009349803,0.00040871146,0.98907197,0.001441455,0.001698348,0.00034979035,0.00005943265,0.00063589145,0.0063250368],"genre_scores_gemma":[0.047035534,0.00020485844,0.9396821,0.010007165,0.0021031324,0.00003416434,0.000120144585,0.00014819994,0.0006646946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952323,0.00004230836,0.00050816376,0.0018980844,0.0012824637,0.0010366798],"domain_scores_gemma":[0.9962471,0.00079300284,0.00024876144,0.0021738156,0.00026254318,0.00027478908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000970067,0.0006368701,0.00057140883,0.0022800518,0.00043904452,0.00097303477,0.0051590228,0.0005171344,0.000032242475],"category_scores_gemma":[0.00018358244,0.00060285244,0.00024168247,0.002431981,0.0008373928,0.00072943146,0.0016693504,0.001212764,0.00015375382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103038565,0.000064835665,0.000031742817,0.000117205,0.000020707357,0.00027260528,0.00038358968,0.06960018,0.00014826919,0.6970469,0.000459086,0.2318446],"study_design_scores_gemma":[0.00029003515,0.00014639419,0.000063493215,0.00038077094,0.000007090068,0.000014349938,1.0665926e-7,0.31517857,0.0011204019,0.67296815,0.009029276,0.00080136623],"about_ca_topic_score_codex":0.00015334682,"about_ca_topic_score_gemma":0.00023446754,"teacher_disagreement_score":0.24557838,"about_ca_system_score_codex":0.00022135225,"about_ca_system_score_gemma":0.0016025024,"threshold_uncertainty_score":0.9996423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071996904,0.00015769711,0.9931752,0.00071089756,0.0020487586,0.00043873288,0.000037514616,0.00035743508,0.0023538033],"genre_scores_gemma":[0.45781842,0.00019482122,0.53808063,0.0026343018,0.0009041213,0.000038455317,0.000078355755,0.00010225051,0.00014865643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99511546,0.00007429843,0.0006674778,0.002259842,0.0009799554,0.0009029706],"domain_scores_gemma":[0.9960948,0.00081513426,0.00023061318,0.0025147994,0.00012490123,0.00021971391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024411206,0.000552789,0.0006012115,0.0014314196,0.00017979988,0.0005632182,0.005073624,0.00041866943,0.00003150114],"category_scores_gemma":[0.0002295279,0.0005302294,0.00017947811,0.002055541,0.0008342682,0.00091924233,0.0027909167,0.0013069869,0.00009833828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019830613,0.00008048435,0.0015125278,0.00016929519,0.000016770839,0.0005876879,0.0025724785,0.008555433,0.000049790087,0.6400813,0.00012702918,0.34622738],"study_design_scores_gemma":[0.00025752382,0.000085209715,0.0019407666,0.0003038556,0.0000035751784,0.000021666832,2.1841484e-7,0.16010399,0.0002517674,0.8352257,0.0011636912,0.00064205524],"about_ca_topic_score_codex":0.00009439181,"about_ca_topic_score_gemma":0.0010674442,"teacher_disagreement_score":0.45709845,"about_ca_system_score_codex":0.00023566533,"about_ca_system_score_gemma":0.00039590595,"threshold_uncertainty_score":0.9997149},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024041329,0.000007880791,0.96898717,0.000119635275,0.00022433251,0.0050833984,0.00033390248,0.0008149307,0.0003874514],"genre_scores_gemma":[0.98611575,0.000029885756,0.012057182,0.000046493315,0.000079168516,0.00005234212,0.0014557468,0.000025817684,0.00013760563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772906,0.0001112992,0.00016581653,0.0015676469,0.00013179782,0.0002943987],"domain_scores_gemma":[0.9951634,0.000066999266,0.00023056989,0.0043197474,0.000094511364,0.00012479915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030028922,0.00026211346,0.00027027752,0.0002771723,0.00016617871,0.0002455884,0.004401557,0.00020109008,0.000012169901],"category_scores_gemma":[0.000028136894,0.00026998203,0.00007453619,0.0011069797,0.00006843327,0.0009809757,0.0060123904,0.00045455436,0.0000661334],"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.00014916713,0.00027845887,0.059730683,0.0003692929,0.00023014718,0.00067168777,0.00023541857,0.042657718,0.0000053175413,0.89027095,0.0036816201,0.0017195564],"study_design_scores_gemma":[0.0011765328,0.00014286564,0.051617052,0.0004269461,0.000093102346,0.0000075690955,0.000058744452,0.66670454,0.000015463438,0.2737765,0.0049039023,0.0010767765],"about_ca_topic_score_codex":0.00092902576,"about_ca_topic_score_gemma":0.0008912411,"teacher_disagreement_score":0.96207446,"about_ca_system_score_codex":0.00005395616,"about_ca_system_score_gemma":0.00014533565,"threshold_uncertainty_score":0.99997526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41929176,0.000006427726,0.57996327,0.00014722279,0.0001515828,0.0001680857,0.000011191657,0.00023425433,0.000026211164],"genre_scores_gemma":[0.9811512,0.000009641751,0.018442893,0.00026514404,0.000036723926,0.00002342502,0.000043079595,0.000019283,0.000008614132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981509,0.000116105795,0.00033286557,0.00060591137,0.00037303023,0.00042121127],"domain_scores_gemma":[0.998771,0.0002492873,0.00012759316,0.0007284417,0.000029003055,0.00009466545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000291788,0.00022709873,0.00018723204,0.0004954856,0.0003320975,0.0001901681,0.00088567944,0.000092599534,0.0000148434465],"category_scores_gemma":[0.0000026381515,0.00022836427,0.00006791206,0.0014915698,0.000035181387,0.0010263287,0.000035410943,0.00032012616,0.00009896095],"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.0000766543,0.00031613212,0.003854869,0.00018383186,0.00005643946,0.00003358625,0.009345093,0.9677573,0.0025124196,0.00015121067,0.000028713468,0.015683787],"study_design_scores_gemma":[0.0009166772,0.00009160877,0.028210163,0.0002524648,0.000010788215,0.0000093370345,0.0005214118,0.96475995,0.0046172957,0.000115997835,0.00019507403,0.00029921305],"about_ca_topic_score_codex":0.0002838092,"about_ca_topic_score_gemma":0.0003857369,"teacher_disagreement_score":0.5618594,"about_ca_system_score_codex":0.000059934206,"about_ca_system_score_gemma":0.0000220826,"threshold_uncertainty_score":0.93124247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39098755,0.00008962447,0.6054774,0.00056162436,0.00054793747,0.00081118953,0.00002732694,0.00041166125,0.0010856792],"genre_scores_gemma":[0.9967123,0.000016143349,0.002850038,0.00015710287,0.00008844394,0.00009302527,0.00003799325,0.000012141851,0.00003278665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843735,0.00006944126,0.00033715615,0.00043669416,0.00040063148,0.00031873843],"domain_scores_gemma":[0.99839216,0.00017624526,0.00022754402,0.0008357509,0.00027928824,0.000088984394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003922341,0.00017628282,0.00036170273,0.00032015648,0.00013662821,0.0005225887,0.0025780417,0.00006323883,0.00001652687],"category_scores_gemma":[0.000028751445,0.00013273027,0.0000725142,0.0029707076,0.00007386001,0.002703761,0.00038991298,0.00012591826,0.000018343813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01022009,0.0061591524,0.26751798,0.0031643854,0.0017650153,0.0006070942,0.005863018,0.13236812,0.011057349,0.27249438,0.14872012,0.1400633],"study_design_scores_gemma":[0.026070096,0.0012102147,0.122218944,0.00057600025,0.00021919921,0.00006256834,0.00009432586,0.52607673,0.26329178,0.04487748,0.013030453,0.0022722261],"about_ca_topic_score_codex":0.00015695523,"about_ca_topic_score_gemma":0.00016969877,"teacher_disagreement_score":0.60572475,"about_ca_system_score_codex":0.0000141574865,"about_ca_system_score_gemma":0.00013388251,"threshold_uncertainty_score":0.54125834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9009708,0.00044801124,0.09117929,0.0023849613,0.00020700751,0.00022370754,0.000064756794,0.0005515348,0.003969934],"genre_scores_gemma":[0.99217635,0.0000622764,0.007440052,0.00019218809,0.000021340013,0.0000041165067,0.00001447741,0.0000048167635,0.000084407955],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999366,0.00001417947,0.00008364921,0.00026891165,0.00010708172,0.00016016836],"domain_scores_gemma":[0.999628,0.00008776372,0.000013230802,0.00019883964,0.000009007492,0.00006312261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014052511,0.00007533461,0.000086079606,0.00013971922,0.000039333485,0.00029904913,0.00019433482,0.00006094374,0.000005657994],"category_scores_gemma":[0.000016492548,0.00006212505,0.000016174068,0.00065284694,0.000046645764,0.0006376566,0.00029938476,0.000114357026,0.000010857404],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014291573,0.00016957136,0.18133713,0.00006835142,0.00003312341,0.00020528038,0.0057135345,0.000009683144,0.0013023609,0.30170104,0.013918098,0.49552754],"study_design_scores_gemma":[0.0032943082,0.00033158466,0.54935133,0.0000948431,0.000006982877,0.00007663128,0.0011272752,0.18759584,0.0013340006,0.20337144,0.05219025,0.0012254993],"about_ca_topic_score_codex":0.00003135471,"about_ca_topic_score_gemma":0.00008278305,"teacher_disagreement_score":0.49430203,"about_ca_system_score_codex":0.000002597229,"about_ca_system_score_gemma":0.000009799568,"threshold_uncertainty_score":0.28837377},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40596253,0.000007115936,0.59352,0.000081276085,0.00021843519,0.0000973802,0.000011433779,0.00009217903,0.000009691885],"genre_scores_gemma":[0.91578245,0.000025504984,0.084134646,0.000012082695,0.00002114333,0.000006642378,0.000010277522,0.0000064554174,8.050393e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988352,0.00008208173,0.00041009823,0.00029067087,0.00020357044,0.00017836127],"domain_scores_gemma":[0.99919194,0.00009238272,0.00014051032,0.0004746266,0.00006657237,0.000033990647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042133502,0.00009732759,0.00016371388,0.0004842137,0.00012239169,0.000021118656,0.00040241456,0.000045211287,0.000005326823],"category_scores_gemma":[0.000003872099,0.00011421317,0.00007837858,0.0011242136,0.000025972204,0.00032708346,0.000009446813,0.00014182116,0.0000011380147],"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.000011532067,0.00016829504,0.00097311,0.000082922736,0.000022278798,0.0000028860018,0.0041331276,0.82023543,0.013390181,0.0031736023,0.0000065696127,0.15780005],"study_design_scores_gemma":[0.00057945884,0.00006816442,0.009610267,0.000064926186,0.0000065595514,8.859189e-7,0.00048611755,0.9499784,0.038481634,0.0005819921,0.00002799693,0.00011359404],"about_ca_topic_score_codex":0.00020507484,"about_ca_topic_score_gemma":0.00003686953,"teacher_disagreement_score":0.5098199,"about_ca_system_score_codex":0.000025348309,"about_ca_system_score_gemma":0.00002433125,"threshold_uncertainty_score":0.4657478},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059550267,0.0000321637,0.93926084,0.00028981254,0.000264946,0.0001731304,0.000011890125,0.0002881327,0.00012884651],"genre_scores_gemma":[0.97336096,0.00009017153,0.026241586,0.00013075535,0.00001908224,0.00003691795,0.00010924551,0.000007870751,0.000003437119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889445,0.00010795876,0.00023459436,0.00029797028,0.00022420064,0.00024081349],"domain_scores_gemma":[0.9991247,0.000080496015,0.00007060277,0.00059933425,0.00006615023,0.00005869089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024984332,0.000107141226,0.00012266914,0.00026800667,0.00018046082,0.0005701286,0.0015043305,0.00005957684,0.000015033659],"category_scores_gemma":[0.000014498378,0.00010507602,0.00003728528,0.0020366127,0.000056118835,0.0006032145,0.00052733463,0.00014246156,0.00002936719],"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.000015539024,0.00052505377,0.0015824981,0.00002909326,0.000026951177,0.000039216382,0.0011188507,0.8523816,0.00012719755,0.022764126,0.0016101241,0.119779736],"study_design_scores_gemma":[0.00033791194,0.000010404721,0.008407466,0.000023336477,0.000001896064,0.0000014537396,0.000013850775,0.98825675,0.0006123126,0.0020302266,0.00017419552,0.00013022033],"about_ca_topic_score_codex":0.00017021439,"about_ca_topic_score_gemma":0.0001037231,"teacher_disagreement_score":0.9138107,"about_ca_system_score_codex":0.0000275414,"about_ca_system_score_gemma":0.000036192243,"threshold_uncertainty_score":0.5497763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15177807,0.00007871339,0.8464132,0.0007631224,0.00016919516,0.00025884746,0.000041510226,0.00040066466,0.0000967058],"genre_scores_gemma":[0.2796987,0.000025239447,0.72011805,0.00008938661,0.00001186767,0.0000063840553,0.000042357522,0.0000062250206,0.0000018019282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986882,0.00002837183,0.0005287996,0.00022980526,0.00019879555,0.00032598793],"domain_scores_gemma":[0.9991409,0.00008028769,0.00027632777,0.00036098008,0.00006412871,0.00007737075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029377366,0.00018226898,0.0003048992,0.0005215363,0.00020907023,0.00007431913,0.00048188583,0.00028300338,0.0000030711594],"category_scores_gemma":[0.000015796868,0.00016207679,0.000058764832,0.0013600863,0.00017861406,0.00031408764,0.00067663233,0.00020602412,0.000013336456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006168957,0.0009886255,0.003035975,0.0012322989,0.00042882943,0.00005766759,0.027460942,0.0012369865,0.061836958,0.4251291,0.011562037,0.46696892],"study_design_scores_gemma":[0.0007108369,0.0001955331,0.0017549718,0.000088817644,0.000014771949,0.000087402805,0.0011684548,0.92145437,0.04416571,0.004053334,0.025858566,0.00044725536],"about_ca_topic_score_codex":0.000012459049,"about_ca_topic_score_gemma":0.000016144453,"teacher_disagreement_score":0.92021734,"about_ca_system_score_codex":0.000019844185,"about_ca_system_score_gemma":0.000058047495,"threshold_uncertainty_score":0.6609299},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5305242,0.00014006745,0.4679108,0.00035398986,0.00063382747,0.00015159285,0.00008128166,0.00017893249,0.000025353751],"genre_scores_gemma":[0.99097914,0.00008509878,0.00860686,0.00020430729,0.00006719114,0.0000031135974,0.000031343054,0.000013397509,0.0000095803925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792033,0.00012049191,0.00032109293,0.00085778954,0.00034464267,0.0004356388],"domain_scores_gemma":[0.99831307,0.00040252277,0.000073322924,0.0010320602,0.000034168093,0.00014487412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079160754,0.00021734927,0.00024907233,0.00037882538,0.00046110715,0.00020909705,0.00082677347,0.000109828165,0.000020275278],"category_scores_gemma":[0.000020516716,0.00021660133,0.000046073175,0.001050193,0.000060609666,0.0005392211,0.00020419233,0.0004567523,0.000013632945],"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.00062976684,0.002890144,0.0046564196,0.0014869096,0.00061045255,0.0022286351,0.021757025,0.57143855,0.0073152687,0.055587377,0.026935717,0.3044637],"study_design_scores_gemma":[0.0008885427,0.000052733398,0.002173986,0.00017263439,0.000015736034,0.00005142897,0.000095953415,0.9934218,0.0005025471,0.0012186563,0.0010962979,0.00030968754],"about_ca_topic_score_codex":0.0005400105,"about_ca_topic_score_gemma":0.0002646889,"teacher_disagreement_score":0.46045494,"about_ca_system_score_codex":0.000022573746,"about_ca_system_score_gemma":0.00005277914,"threshold_uncertainty_score":0.88327456},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027235355,0.0000065122563,0.7557143,0.00519212,0.0006121592,0.2135588,0.0001098223,0.004213508,0.017869227],"genre_scores_gemma":[0.017346857,0.0000027104697,0.051214393,0.0013021079,0.00023325729,0.92849493,0.00009873059,0.000032081978,0.0012749502],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861574,0.000020781026,0.0001927135,0.00047193054,0.00024415378,0.00045470864],"domain_scores_gemma":[0.99889237,0.000073166295,0.000056734738,0.0007595459,0.000086197426,0.00013197011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049735105,0.00012622643,0.00012939442,0.00017680354,0.0001826715,0.00028985605,0.0007788327,0.000066999,0.00015700665],"category_scores_gemma":[0.00003406871,0.00010847668,0.00010180955,0.0012499469,0.000036247155,0.001151642,0.00035132223,0.000071562084,0.00014525282],"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.000023931027,0.00015626932,0.0019201511,0.00016530126,0.000014987249,0.000015464708,0.00038916885,0.0000054256925,0.0002452795,0.36028525,0.61551887,0.0212599],"study_design_scores_gemma":[0.00083955226,0.00013173305,0.0044899005,0.000011782334,0.0000015915933,0.0000021281398,0.00005760781,0.017891873,0.0012035472,0.025755258,0.94939846,0.00021654784],"about_ca_topic_score_codex":0.00010693263,"about_ca_topic_score_gemma":0.00008432814,"teacher_disagreement_score":0.71493614,"about_ca_system_score_codex":0.00001368394,"about_ca_system_score_gemma":0.00005369008,"threshold_uncertainty_score":0.44235504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019635456,0.000016575561,0.99631697,0.00045249812,0.000045557554,0.00065287744,0.00005550718,0.00043288994,0.00006360898],"genre_scores_gemma":[0.6210086,0.000002537388,0.3783756,0.00007740291,0.000016726788,0.000314756,0.00019353947,0.0000052965297,0.0000055677197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991897,0.000021751086,0.00021815255,0.00029432843,0.00013075602,0.00014530985],"domain_scores_gemma":[0.99910533,0.00019030113,0.00009388538,0.0004083876,0.00015175767,0.000050362327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025571868,0.00007806803,0.00009774298,0.0001807749,0.00011677442,0.000037295533,0.00039007037,0.00004400384,0.0000019799638],"category_scores_gemma":[0.000023928476,0.0000770603,0.00008745651,0.0009462184,0.00003817596,0.00019755603,0.00007258166,0.000037446658,0.000028124365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031894047,0.0010689995,0.0067880293,0.00043887066,0.000050326806,6.1860186e-7,0.00096990593,0.035675526,0.0153308,0.5517916,0.0054961257,0.38235733],"study_design_scores_gemma":[0.0005290012,0.00003356978,0.012576672,0.000007724261,0.000004354396,2.247839e-7,0.000034389304,0.9751204,0.0046591647,0.0041064136,0.0028298656,0.000098173994],"about_ca_topic_score_codex":0.000018548619,"about_ca_topic_score_gemma":0.000024291241,"teacher_disagreement_score":0.9394449,"about_ca_system_score_codex":0.0000092535165,"about_ca_system_score_gemma":0.000027644279,"threshold_uncertainty_score":0.31424278},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3015622,0.000029448473,0.69457656,0.0005418704,0.00052204524,0.00013873569,0.000005116497,0.0012747188,0.0013492827],"genre_scores_gemma":[0.91015047,0.000019337987,0.08922115,0.00042845833,0.00012374164,0.000007552126,0.000016414046,0.000011855373,0.000021005875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998775,0.000054533433,0.00020405662,0.00037515917,0.00025802056,0.00033321916],"domain_scores_gemma":[0.9992202,0.000075965734,0.000059031685,0.00050348847,0.000050845425,0.00009049179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003814703,0.00012249699,0.00011408819,0.00024071985,0.00029954925,0.00036941835,0.00061906636,0.000061749764,0.000051974384],"category_scores_gemma":[0.000031574953,0.000114793744,0.000078758036,0.0015513641,0.00003631153,0.0010448333,0.00042907786,0.00013722476,0.00019067203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002627491,0.00023111074,0.00525539,0.00015462351,0.000101414,0.00023501446,0.0065898867,0.00517053,0.04773022,0.76716363,0.025138764,0.14220312],"study_design_scores_gemma":[0.0004533497,0.00006661862,0.005913585,0.00003762734,0.000010360219,0.000045585926,0.00032798658,0.9677404,0.002988673,0.019166375,0.002791653,0.00045776917],"about_ca_topic_score_codex":0.00010281721,"about_ca_topic_score_gemma":0.000035659297,"teacher_disagreement_score":0.9625699,"about_ca_system_score_codex":0.000021838687,"about_ca_system_score_gemma":0.0000424527,"threshold_uncertainty_score":0.4681153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012292288,0.00024665295,0.9934306,0.00009476608,0.004284228,0.00080456695,0.000065886015,0.00043038858,0.0005199844],"genre_scores_gemma":[0.13691264,0.000017718212,0.86181,0.00044963942,0.00063795835,0.000027970855,0.000055605033,0.000059891252,0.000028558958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641305,0.00003576229,0.0005843657,0.0013298361,0.0007970992,0.00083987345],"domain_scores_gemma":[0.99708176,0.001044622,0.00036477004,0.0009856268,0.00031119402,0.00021203379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014516896,0.00047921092,0.000593416,0.0009482667,0.000446266,0.0007752549,0.001983713,0.0003300312,0.000001609303],"category_scores_gemma":[0.00012512598,0.00047633031,0.00020757613,0.0009286966,0.00034365166,0.0010772172,0.0007729451,0.0004603325,0.000023798613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050117407,0.00010720162,0.00012066317,0.00093109347,0.000088234534,0.00014831912,0.0021265952,0.21310894,0.00053235586,0.49765885,0.00028523777,0.2848424],"study_design_scores_gemma":[0.00038407528,0.00011329771,0.000040416846,0.00077452505,0.000015887135,0.000060204668,7.439354e-7,0.91128933,0.00052609097,0.08508711,0.0011318594,0.0005764395],"about_ca_topic_score_codex":0.00007628882,"about_ca_topic_score_gemma":0.00005075543,"teacher_disagreement_score":0.6981804,"about_ca_system_score_codex":0.00033440255,"about_ca_system_score_gemma":0.00048598944,"threshold_uncertainty_score":0.99976885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023520915,0.00019891607,0.9936772,0.0007956887,0.0030938676,0.00076945324,0.00020974831,0.0003892411,0.00063065474],"genre_scores_gemma":[0.23800617,0.00024494057,0.7540479,0.0035790256,0.0025089055,0.00013843464,0.0005171406,0.000261399,0.00069610897],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530894,0.00002098759,0.0006412273,0.0019369589,0.0011553484,0.0009365246],"domain_scores_gemma":[0.99587125,0.00091312063,0.00032629134,0.0022795328,0.00037079566,0.00023903172],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008909471,0.0005760367,0.00056932966,0.0010461672,0.00042402805,0.002781414,0.0073343534,0.00032224206,0.00001770856],"category_scores_gemma":[0.00046410528,0.000542283,0.00032011923,0.0008439283,0.0004651182,0.0024367196,0.005636275,0.00053888094,0.00007202725],"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.0000362969,0.00012223437,0.00011217529,0.00026888357,0.00007759782,0.00016427753,0.0017738509,0.0020650623,0.000312896,0.23811898,0.00074386183,0.7562039],"study_design_scores_gemma":[0.00042227635,0.00028414401,0.00021631485,0.00045301105,0.0000128535285,0.000030439856,5.140778e-7,0.17791253,0.00067697355,0.8125475,0.0065355045,0.0009079535],"about_ca_topic_score_codex":0.000022514685,"about_ca_topic_score_gemma":0.000039939383,"teacher_disagreement_score":0.75529593,"about_ca_system_score_codex":0.00011396539,"about_ca_system_score_gemma":0.00037515297,"threshold_uncertainty_score":0.9997029},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042484564,0.0004133305,0.98992825,0.0006759246,0.0043086717,0.00070951437,0.000048103866,0.0003490497,0.0035246576],"genre_scores_gemma":[0.005287066,0.00009620666,0.99053574,0.0021909927,0.0014773416,0.000016218764,0.00003643111,0.00009132374,0.00026868194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939102,0.000073266645,0.0007336046,0.002595619,0.0013096672,0.0013776486],"domain_scores_gemma":[0.9940905,0.0006683479,0.00040504168,0.00424549,0.00023851471,0.000352129],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021157798,0.00075874827,0.0008475004,0.0008069995,0.00083196006,0.0028466557,0.016683266,0.0004948889,0.000020984613],"category_scores_gemma":[0.000143905,0.0007241005,0.00023950808,0.0024988058,0.00091004855,0.0020241654,0.017578816,0.0012701089,0.000060751212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026406316,0.00008001961,0.00035465788,0.00010173129,0.000060538958,0.0004661574,0.00064809306,0.13819155,0.000051466886,0.48123336,0.0023147678,0.37647128],"study_design_scores_gemma":[0.0002946791,0.00008595367,0.00013613651,0.0005097797,0.0000119473625,0.00004983042,9.182922e-8,0.44176275,0.00006946427,0.5524933,0.0038408719,0.0007452455],"about_ca_topic_score_codex":0.00032763722,"about_ca_topic_score_gemma":0.00097089575,"teacher_disagreement_score":0.375726,"about_ca_system_score_codex":0.00022570438,"about_ca_system_score_gemma":0.00073718035,"threshold_uncertainty_score":0.999521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102876555,0.000025200541,0.98050576,0.0010898799,0.00040096923,0.00016531201,0.000105472944,0.0006815395,0.006738178],"genre_scores_gemma":[0.7636921,0.00009800611,0.23455077,0.0008921672,0.00015602767,0.000012793031,0.0004918837,0.000015613165,0.000090647365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987725,0.00003511649,0.00015425895,0.0005243575,0.00023147475,0.00028227633],"domain_scores_gemma":[0.9980457,0.00009167573,0.000048098245,0.0016690769,0.00005591718,0.0000895356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042888056,0.00010575158,0.00011606672,0.00012994141,0.0001736905,0.0002309155,0.0022515533,0.00004024376,0.00003314322],"category_scores_gemma":[0.000040162642,0.00009340384,0.000023767874,0.0025640167,0.00004331802,0.0014567948,0.002533032,0.00010387416,0.00053049484],"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.000011694137,0.00007614224,0.0017300921,0.00002329985,0.000053298714,0.00008222769,0.0023103228,0.000029246385,0.0024035173,0.80731845,0.14497638,0.04098536],"study_design_scores_gemma":[0.0009194693,0.00018817575,0.013271455,0.00004144922,0.000015066754,0.000012254938,0.0005539161,0.632924,0.0046895766,0.08618412,0.26039004,0.0008104711],"about_ca_topic_score_codex":0.000034550838,"about_ca_topic_score_gemma":0.00005619777,"teacher_disagreement_score":0.75340444,"about_ca_system_score_codex":0.000007185214,"about_ca_system_score_gemma":0.000046159395,"threshold_uncertainty_score":0.68186146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029156975,0.00013581445,0.96795547,0.00046982014,0.00031895222,0.00014355595,0.00015246902,0.0006086866,0.0010582744],"genre_scores_gemma":[0.9787952,0.00011955481,0.02029134,0.00027876475,0.00019059856,0.0000115223975,0.00016989089,0.0000106658035,0.00013248189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981602,0.000029760982,0.00026015626,0.00069889816,0.00030403293,0.00054696464],"domain_scores_gemma":[0.9986332,0.00028875782,0.000092827046,0.00069602125,0.000074631964,0.00021453299],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00031110513,0.00023615756,0.00027359332,0.0004574705,0.00027601,0.0011980927,0.00079629815,0.00016607401,0.00003972341],"category_scores_gemma":[0.00006883132,0.0002042063,0.00014845385,0.0051668365,0.00008791378,0.0026345078,0.00053136656,0.00032061167,0.000030169267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004726339,0.0005229432,0.3877136,0.000051212537,0.0012972652,0.00012353378,0.0014028284,0.0037019926,0.00025417932,0.023651643,0.028815826,0.5524177],"study_design_scores_gemma":[0.0003158173,0.000044424247,0.19630268,0.00000539249,0.000029444918,0.0000045662514,0.000010669874,0.79841834,0.000029717117,0.00017858556,0.0044053444,0.0002550445],"about_ca_topic_score_codex":0.0000827177,"about_ca_topic_score_gemma":0.000042987762,"teacher_disagreement_score":0.9496382,"about_ca_system_score_codex":0.00001773712,"about_ca_system_score_gemma":0.000040611096,"threshold_uncertainty_score":0.99983877},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061874196,0.00012970368,0.9372298,0.00014686139,0.00014729105,0.00028795298,0.000023753912,0.000093997434,0.00006645194],"genre_scores_gemma":[0.51072514,0.00015394017,0.4886446,0.000069705166,0.000184924,0.00004689175,0.00012331415,0.000012678808,0.000038793223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989951,0.000023017477,0.0002205841,0.00044668763,0.00010158626,0.00021297678],"domain_scores_gemma":[0.99939394,0.00009768555,0.00006375382,0.00030662058,0.000068887246,0.000069110385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051901455,0.0001072005,0.000118047676,0.00014719134,0.00026191366,0.00023537474,0.00019827078,0.00005951316,0.0000026092143],"category_scores_gemma":[0.00006256421,0.000109778186,0.000037429392,0.0006012308,0.000062486295,0.00044158995,0.00014995216,0.00006343903,0.0000059824333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024718935,0.00038015097,0.00066047016,0.00040679256,0.00005729915,0.0000056695553,0.010355595,0.05648651,0.22325456,0.3708563,0.001279224,0.3362327],"study_design_scores_gemma":[0.000046847483,0.000041812084,0.000047442765,0.000011228233,0.000008124491,0.00002293481,0.00022241162,0.96588916,0.029994074,0.0029032938,0.00067902,0.00013366037],"about_ca_topic_score_codex":0.000029452727,"about_ca_topic_score_gemma":0.0000031435395,"teacher_disagreement_score":0.90940267,"about_ca_system_score_codex":0.000011174769,"about_ca_system_score_gemma":0.00001772202,"threshold_uncertainty_score":0.44766244},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002712748,0.00020551943,0.8874359,0.00027112185,0.0027003428,0.0012620133,0.0017735475,0.0017909063,0.10453349],"genre_scores_gemma":[0.024981296,0.009094028,0.44584864,0.017479109,0.01216201,0.0025223482,0.024580749,0.0027252948,0.46060652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973371,0.000045173936,0.00047425544,0.0011216659,0.00053755526,0.00048426533],"domain_scores_gemma":[0.9972602,0.00076562766,0.00024503295,0.001323395,0.00023181905,0.00017388284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088620157,0.0005245207,0.00052826415,0.000850118,0.00026659013,0.00028088412,0.0013462973,0.0005912273,0.00009118484],"category_scores_gemma":[0.00013533462,0.0005047329,0.0006378499,0.00040539482,0.00012042858,0.0002562124,0.00032110937,0.0004893151,0.0005998777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044892065,0.00003256007,0.000037649534,0.000028375172,0.000037739723,0.0000096965,0.000039855844,0.0000018004381,0.0000015355281,0.9169754,0.06838322,0.014407281],"study_design_scores_gemma":[0.0005542571,0.0004896611,0.006393813,0.00022112504,0.000029712688,0.0000022541035,0.0000011552559,0.00039043825,0.0000126963705,0.8002719,0.19071253,0.0009203997],"about_ca_topic_score_codex":0.00008019477,"about_ca_topic_score_gemma":0.0009783482,"teacher_disagreement_score":0.4415873,"about_ca_system_score_codex":0.000028547249,"about_ca_system_score_gemma":0.00015199973,"threshold_uncertainty_score":0.9997404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28846073,0.000011614107,0.7098488,0.00009221054,0.0006149191,0.00029356705,0.000021957963,0.0005166444,0.00013956314],"genre_scores_gemma":[0.9571228,0.000029164263,0.04248247,0.00022827847,0.00004953849,0.000024494102,0.000017532317,0.000023098486,0.000022604696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976447,0.000108787324,0.0003354107,0.00081008766,0.0004922222,0.0006087901],"domain_scores_gemma":[0.99843204,0.0003028189,0.00016318343,0.00072566397,0.00017494132,0.00020135113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049860246,0.0002897527,0.00025827813,0.0010003701,0.00067413127,0.00033024742,0.00090166053,0.00008985557,0.000012583311],"category_scores_gemma":[0.000001559521,0.0002667402,0.00014938261,0.003897617,0.00004445327,0.00070235267,0.00003281732,0.00051746255,0.00027645615],"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.00034438018,0.002845365,0.0010067761,0.0007969605,0.0004945983,0.00026059605,0.030216824,0.7314288,0.0030821513,0.004690113,0.00009054845,0.22474286],"study_design_scores_gemma":[0.00094071653,0.00033738872,0.004263789,0.00021667263,0.00002240898,0.000019276902,0.0009203509,0.9886958,0.0037747175,0.0000980844,0.00035735758,0.0003534538],"about_ca_topic_score_codex":0.00047905598,"about_ca_topic_score_gemma":0.00042394517,"teacher_disagreement_score":0.6686621,"about_ca_system_score_codex":0.000098629775,"about_ca_system_score_gemma":0.000051728315,"threshold_uncertainty_score":0.9999785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7299012,0.00011641739,0.26395065,0.0008738719,0.00026273011,0.0004122806,0.000006499343,0.004426089,0.000050257073],"genre_scores_gemma":[0.8688836,0.000072849005,0.1308364,0.00009310151,0.000027940685,0.000052731317,0.000008527985,0.000022351356,0.0000025005193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722916,0.000015329433,0.000517942,0.0010416185,0.00043016966,0.0007657929],"domain_scores_gemma":[0.99888396,0.00018434937,0.00027068116,0.00048132555,0.00013130023,0.000048383885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006514847,0.0003832818,0.00042038914,0.0010815565,0.00027562174,0.0003990691,0.0015537917,0.00030790013,0.0000030980702],"category_scores_gemma":[0.0007456441,0.00034343905,0.00010957512,0.0032124564,0.00017325346,0.0014495589,0.0015130169,0.0005594415,0.000056461242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014948369,0.000975126,0.084209286,0.0007601266,0.00014069228,0.00013330793,0.005929647,0.0007465783,0.22600368,0.5708803,0.0022029004,0.10786888],"study_design_scores_gemma":[0.002067971,0.0004871165,0.040704712,0.00063042104,0.00002480571,0.000025553045,0.0011032533,0.21685582,0.30556294,0.43078002,0.00049926754,0.0012580933],"about_ca_topic_score_codex":0.000080856466,"about_ca_topic_score_gemma":0.00004438718,"teacher_disagreement_score":0.21610925,"about_ca_system_score_codex":0.00015088738,"about_ca_system_score_gemma":0.00004633702,"threshold_uncertainty_score":0.9999018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012805585,0.00034567184,0.9930706,0.0011013048,0.002962567,0.0008140034,0.0003809213,0.0005242269,0.0006726205],"genre_scores_gemma":[0.07058792,0.00010525074,0.9243895,0.002495777,0.0017176935,0.000045189296,0.00030542017,0.00012703799,0.0002262115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951173,0.00003431196,0.0006006767,0.0022712986,0.001070818,0.0009055744],"domain_scores_gemma":[0.99571,0.0011418471,0.0003169683,0.0023059095,0.00025230527,0.00027298316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085902144,0.0006746638,0.0007429338,0.0010810336,0.00040154307,0.00092727493,0.0051634414,0.00042627755,0.000023889908],"category_scores_gemma":[0.00012085155,0.0006266772,0.00035040878,0.0011519963,0.00064972485,0.0008999684,0.0013954228,0.000788937,0.00007821964],"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.000024889257,0.00008068725,0.000112120375,0.00007761717,0.0000590807,0.00007419712,0.0013591738,0.0073454375,0.00010476166,0.18414982,0.001093538,0.8055187],"study_design_scores_gemma":[0.00037471816,0.00016338892,0.00048437243,0.00025821815,0.000015364874,0.000009722919,2.0349326e-7,0.34256113,0.00065506186,0.6484804,0.006225407,0.0007719806],"about_ca_topic_score_codex":0.00021315833,"about_ca_topic_score_gemma":0.00054223055,"teacher_disagreement_score":0.8047467,"about_ca_system_score_codex":0.00017024636,"about_ca_system_score_gemma":0.00035435017,"threshold_uncertainty_score":0.9996185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034244065,0.0008032958,0.99145526,0.0012353837,0.0027067792,0.000607117,0.00004454756,0.0004514901,0.002353712],"genre_scores_gemma":[0.47945336,0.000536729,0.51048654,0.0061352295,0.0025847678,0.00009091738,0.00012230917,0.00024539916,0.00034475647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99392414,0.000049051927,0.0007638473,0.0025498117,0.001573166,0.0011399655],"domain_scores_gemma":[0.99530447,0.0007540148,0.00029358547,0.0032008917,0.00018025153,0.00026679],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018613884,0.00077781675,0.00076555274,0.002655616,0.00025919196,0.0008794705,0.008865793,0.00079421606,0.000022134844],"category_scores_gemma":[0.00020776362,0.0007343952,0.00026770766,0.0028586416,0.0007668393,0.0011509196,0.004907445,0.0024545828,0.00007872739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006591269,0.00020256954,0.0006034051,0.0001921826,0.000039381168,0.0015559362,0.00352479,0.021771308,0.00013922695,0.62965643,0.00074819376,0.34150064],"study_design_scores_gemma":[0.0009805481,0.00017734285,0.00049281126,0.000636595,0.0000074700374,0.000047436737,4.592483e-7,0.14834292,0.00022841431,0.8469003,0.0011530631,0.0010326656],"about_ca_topic_score_codex":0.00005240529,"about_ca_topic_score_gemma":0.0018525627,"teacher_disagreement_score":0.48096868,"about_ca_system_score_codex":0.0002051326,"about_ca_system_score_gemma":0.0004878898,"threshold_uncertainty_score":0.9998468},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005493732,0.0007748341,0.993184,0.0007681008,0.0024274893,0.00043713668,0.00018894751,0.0005122904,0.0011578649],"genre_scores_gemma":[0.4466505,0.0005908493,0.54259145,0.0058815912,0.0027330243,0.000057464644,0.00044725498,0.00021780854,0.00083003554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946959,0.00006296995,0.00061809097,0.0023782565,0.0014452981,0.0007994653],"domain_scores_gemma":[0.99556565,0.0009729242,0.00033031803,0.002530889,0.0002686673,0.0003315254],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007353204,0.0006721808,0.00064379926,0.0012824538,0.00043028037,0.0009797503,0.0055827443,0.00053089263,0.000061216946],"category_scores_gemma":[0.00018261702,0.00063273526,0.00026060443,0.0016111368,0.0008268198,0.0009414909,0.0020644045,0.0013011503,0.00019116052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013198351,0.000080156555,0.00025496713,0.00006164331,0.000060063976,0.00027962174,0.0044482886,0.0015837392,0.00022102216,0.56963,0.00031759648,0.4230497],"study_design_scores_gemma":[0.00032395526,0.00012253382,0.0025268968,0.0006219872,0.000023549524,0.000022571052,6.0294826e-7,0.22352827,0.00019071087,0.76759106,0.0040203114,0.0010275417],"about_ca_topic_score_codex":0.00013640532,"about_ca_topic_score_gemma":0.00051527616,"teacher_disagreement_score":0.4505925,"about_ca_system_score_codex":0.00016550951,"about_ca_system_score_gemma":0.0008736169,"threshold_uncertainty_score":0.9997975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025168783,0.00032580385,0.99532855,0.00071948546,0.0014999465,0.00077734195,0.00008213087,0.0006043509,0.00041069355],"genre_scores_gemma":[0.27407992,0.000012614446,0.72303116,0.0020646793,0.0005156109,0.000024056151,0.000077822406,0.00010343197,0.000090727866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938868,0.000080616875,0.00063938135,0.0024698542,0.0019117252,0.0010116055],"domain_scores_gemma":[0.9943143,0.0013693613,0.0004185878,0.0031510412,0.0004317512,0.00031493913],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001206565,0.0008779466,0.00068717427,0.0014962621,0.00053102075,0.001052153,0.0051654717,0.00049194205,0.000019235631],"category_scores_gemma":[0.00015516237,0.0007343768,0.00024101026,0.002212641,0.001034831,0.0006695922,0.0013221789,0.001476622,0.00005726858],"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.00003318638,0.00011746321,0.000051048275,0.000067774105,0.000023377854,0.00019253661,0.0006529075,0.89250696,0.000034576362,0.036155622,0.00002795995,0.070136584],"study_design_scores_gemma":[0.001446727,0.0002744937,0.0003402725,0.00043063,0.000025624331,0.000020310968,3.0463215e-7,0.94688535,0.00027182407,0.048612386,0.0007231431,0.0009689524],"about_ca_topic_score_codex":0.000039593702,"about_ca_topic_score_gemma":0.00044847454,"teacher_disagreement_score":0.2738282,"about_ca_system_score_codex":0.00022963448,"about_ca_system_score_gemma":0.0006813293,"threshold_uncertainty_score":0.99998486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034450743,0.0008021595,0.987685,0.0006058181,0.0027258643,0.00042003766,0.00004446189,0.00064800814,0.0070341765],"genre_scores_gemma":[0.19233847,0.00033684165,0.8002082,0.0044887313,0.0017843331,0.00004359164,0.000058183967,0.00015637954,0.00058526354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947633,0.000028985924,0.0005317155,0.0022600999,0.0014688587,0.0009470191],"domain_scores_gemma":[0.9963687,0.00054627,0.0002759894,0.002272422,0.00027735755,0.0002592615],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009738028,0.0007065267,0.00061312644,0.0015275918,0.000410694,0.00083457323,0.0060431655,0.0005795799,0.000021685639],"category_scores_gemma":[0.00008692598,0.0006450113,0.0002663411,0.0017117917,0.0010674755,0.0010273195,0.0030162784,0.0016936179,0.00017483927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011546607,0.00003067058,0.000025382184,0.000027286087,0.000021514437,0.00026475696,0.0005226985,0.00874848,0.000061406725,0.74486536,0.00023890325,0.24518198],"study_design_scores_gemma":[0.00022919882,0.00023592575,0.00016024137,0.00034466764,0.000009842687,0.0000311225,2.947829e-7,0.21291381,0.00044914457,0.7822505,0.002467469,0.0009077278],"about_ca_topic_score_codex":0.000030060273,"about_ca_topic_score_gemma":0.00023854448,"teacher_disagreement_score":0.24427424,"about_ca_system_score_codex":0.0001508265,"about_ca_system_score_gemma":0.00053872226,"threshold_uncertainty_score":0.9996001},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006502829,0.0003127213,0.99471366,0.00091904146,0.0021318858,0.0004706689,0.00003339061,0.0003259141,0.0004424131],"genre_scores_gemma":[0.54542565,0.00010499164,0.44705904,0.006380316,0.0006679138,0.000050655442,0.00015345377,0.00010738975,0.00005060457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956303,0.000070933755,0.00061550585,0.001775501,0.0011716601,0.0007360496],"domain_scores_gemma":[0.9971038,0.00075449917,0.00028084777,0.001470455,0.0002219879,0.00016839233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011337001,0.0005532238,0.00051080424,0.0020591477,0.00021327216,0.00055902975,0.0033293916,0.00046564292,0.000025004432],"category_scores_gemma":[0.00011052816,0.00053674704,0.00016956472,0.0015113439,0.00042627385,0.0009328958,0.0008890387,0.00119915,0.000054615008],"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.000054949323,0.00019640588,0.0003618658,0.0002211409,0.000024638743,0.0009518689,0.0021799658,0.11695968,0.002705802,0.3468246,0.00011557047,0.5294035],"study_design_scores_gemma":[0.0003993105,0.0002081588,0.0011655744,0.00043000738,0.0000057736765,0.000010201466,3.3232564e-7,0.5777139,0.0014695468,0.41756114,0.0002911843,0.00074486446],"about_ca_topic_score_codex":0.00018928286,"about_ca_topic_score_gemma":0.0009019986,"teacher_disagreement_score":0.5476546,"about_ca_system_score_codex":0.00022262886,"about_ca_system_score_gemma":0.000523952,"threshold_uncertainty_score":0.9997084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2520471,0.000017309794,0.74481153,0.0008427492,0.00021084097,0.0001709867,0.000024733783,0.00045487905,0.0014198855],"genre_scores_gemma":[0.98998195,0.0000144976075,0.009662445,0.00028216664,0.0000144247115,0.000021247326,0.000020870633,0.0000014521011,9.394415e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986609,0.000049571616,0.00026281967,0.00021243963,0.00055439124,0.0002598452],"domain_scores_gemma":[0.9990304,0.00030027842,0.00014843786,0.0003131635,0.000118484626,0.000089215304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009826055,0.00010336484,0.000092777016,0.0005487267,0.0004975427,0.0006305838,0.0009289686,0.000042140553,0.000020701404],"category_scores_gemma":[0.00030022682,0.00008792556,0.0000336319,0.0024540185,0.00025911137,0.002639143,0.00045278922,0.00008605214,0.0001970845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025267578,0.000109142435,0.010518584,0.00013620532,0.000017272869,0.000008182325,0.022996841,0.028261201,0.0010503278,0.30892208,0.0039055657,0.6240493],"study_design_scores_gemma":[0.00018858732,0.00006822683,0.042688537,0.000026934942,0.0000016493155,0.0000023766904,0.00023915495,0.9467771,0.00051318615,0.0068977945,0.0024577428,0.00013871427],"about_ca_topic_score_codex":0.00006551151,"about_ca_topic_score_gemma":0.000016450065,"teacher_disagreement_score":0.9185159,"about_ca_system_score_codex":0.000014325366,"about_ca_system_score_gemma":0.00010344508,"threshold_uncertainty_score":0.6080734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07893269,0.0015429877,0.9172334,0.00090498914,0.0008090891,0.0001879093,0.000069416965,0.0002574272,0.00006211235],"genre_scores_gemma":[0.9821515,0.006695888,0.010588234,0.00009432851,0.0002743205,0.000017270137,0.00013244186,0.00003254996,0.0000134800075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656856,0.00018731545,0.0004685265,0.00067306956,0.00050197,0.0016005355],"domain_scores_gemma":[0.99864197,0.00008957935,0.00040914593,0.0006344774,0.00009596405,0.0001288864],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025083844,0.00032780855,0.00032426883,0.00045326512,0.00037817864,0.0007244065,0.0012702927,0.0002607205,0.0000070749675],"category_scores_gemma":[0.00004257666,0.00033567683,0.00020274849,0.00041467385,0.00006447844,0.0005835166,0.0011132562,0.003629492,0.000011156578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054901735,0.000094588904,0.00083122705,0.00012635133,0.00018895019,0.000033098127,0.0002799523,0.00070497923,0.00069726334,0.9740459,0.00008098152,0.02286186],"study_design_scores_gemma":[0.00067650597,0.00025895878,0.0019576508,0.00019240382,0.000042890224,0.00022498821,0.000117145,0.08092403,0.000042726497,0.9146365,0.00044109437,0.00048511167],"about_ca_topic_score_codex":0.00008275558,"about_ca_topic_score_gemma":0.0031296117,"teacher_disagreement_score":0.9066451,"about_ca_system_score_codex":0.0005448597,"about_ca_system_score_gemma":0.0012381918,"threshold_uncertainty_score":0.9999095},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3075527,0.000036068224,0.49206713,0.0021333992,0.0016282982,0.0002660514,0.000036977242,0.004215385,0.19206399],"genre_scores_gemma":[0.9934003,0.000026143964,0.0059028254,0.00051947974,0.00002732868,0.0000067410274,0.000021603724,0.00000385795,0.00009174829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921143,0.000021082269,0.00009300339,0.00026217094,0.00018785,0.00022447854],"domain_scores_gemma":[0.9993526,0.000101782905,0.000019302875,0.00045145076,0.000014617915,0.000060291957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019658841,0.00007684463,0.000070608905,0.00029805565,0.0001234638,0.00010763689,0.0005472607,0.0000358852,0.000072205185],"category_scores_gemma":[0.000020953792,0.000062863626,0.00006455281,0.0016605466,0.00001763421,0.00024911494,0.00016825023,0.00008559403,0.00055619644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019903484,0.000018100496,0.001291521,0.0000026171138,0.00000548069,0.000014533708,0.00032025127,0.0000036476767,0.0001641259,0.9678953,0.024061117,0.0062212837],"study_design_scores_gemma":[0.0011963306,0.00042101648,0.106862105,0.00005136982,0.000007963852,0.000015690828,0.00024865815,0.051950276,0.0072412137,0.7533959,0.0777493,0.000860145],"about_ca_topic_score_codex":0.000011874086,"about_ca_topic_score_gemma":0.000008455466,"teacher_disagreement_score":0.6858476,"about_ca_system_score_codex":0.0000040964055,"about_ca_system_score_gemma":0.000010255818,"threshold_uncertainty_score":0.7148965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63688964,0.000017363964,0.35836482,0.0010360702,0.00018443758,0.0002231317,0.000016310685,0.00065673585,0.0026114967],"genre_scores_gemma":[0.9552926,0.00005768553,0.04396323,0.0005620277,0.000030421505,0.0000037812465,0.00006299016,0.000003878371,0.000023407205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99923176,0.000019937172,0.0001361393,0.00018863141,0.00022629974,0.00019721742],"domain_scores_gemma":[0.9994144,0.00004308671,0.000046181787,0.0003889812,0.00004386743,0.000063515574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000238441,0.000095803625,0.000094028546,0.0001293087,0.000116252915,0.00026066139,0.00031410225,0.000036352278,0.000016811211],"category_scores_gemma":[0.00001374755,0.000069799426,0.000019575742,0.0009679602,0.000052574185,0.0025904193,0.00030778444,0.00009042646,0.00009050669],"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.000030729112,0.000012755515,0.003063767,0.000022041997,0.000015572692,0.000007721481,0.00054279156,0.000026308218,0.000036178048,0.99104017,0.0017567811,0.003445178],"study_design_scores_gemma":[0.008263006,0.0011174816,0.5975,0.00011309958,0.000044070985,0.00014972578,0.0003509903,0.0754003,0.008336758,0.20459397,0.102524884,0.0016056898],"about_ca_topic_score_codex":0.00010837867,"about_ca_topic_score_gemma":0.000028245528,"teacher_disagreement_score":0.7864462,"about_ca_system_score_codex":0.000005697433,"about_ca_system_score_gemma":0.000028025588,"threshold_uncertainty_score":0.2846338},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.138096,0.0000024011267,0.8598024,0.00094848184,0.0003431764,0.0002951628,0.000024818675,0.0003022309,0.00018531404],"genre_scores_gemma":[0.97739494,0.000009659811,0.021535756,0.0008520344,0.000021636546,0.000057090278,0.00012585674,0.000002529573,4.801561e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908406,0.000029580919,0.00024854246,0.00017235526,0.00016203223,0.00030341482],"domain_scores_gemma":[0.99942696,0.00003336688,0.00006987542,0.00031177705,0.00005562291,0.000102393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035468,0.00007308833,0.00008895296,0.0002996407,0.00010864069,0.00021383417,0.00035283098,0.00003341085,0.000004309916],"category_scores_gemma":[0.00002755835,0.00006999003,0.000035795816,0.00075936504,0.000008742581,0.002827615,0.00012695299,0.000059672348,0.000023048186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002862399,0.000032420234,0.00001024837,0.000019231431,0.0000015656416,2.225175e-7,0.0037394895,0.000016549864,0.0001366707,0.9528113,0.0003781946,0.04285122],"study_design_scores_gemma":[0.0016737046,0.0013778614,0.0011449648,0.000041747433,0.0000013208061,0.000004109771,0.0030459194,0.4176957,0.022445863,0.54219127,0.0097721955,0.00060534297],"about_ca_topic_score_codex":0.00006403673,"about_ca_topic_score_gemma":0.00015651374,"teacher_disagreement_score":0.83929896,"about_ca_system_score_codex":0.00003090397,"about_ca_system_score_gemma":0.000061054445,"threshold_uncertainty_score":0.28541103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026525734,0.0010305222,0.97104925,0.00042437308,0.0007168608,0.00011811241,0.00009521809,0.00003152979,0.000008419653],"genre_scores_gemma":[0.86264265,0.0010676926,0.13574593,0.00007164265,0.00040167366,0.000009151435,0.000021641807,0.000018947374,0.000020685733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990573,0.000017617727,0.00032532855,0.00018607579,0.00023765115,0.00017604459],"domain_scores_gemma":[0.99939674,0.00016684918,0.00011659638,0.00009935606,0.0000997387,0.0001207113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005226179,0.00013153662,0.00017474109,0.0002712615,0.0000720546,0.00010512252,0.00041848814,0.00006723577,0.0000018374184],"category_scores_gemma":[0.00007058646,0.00012744445,0.00007674831,0.00018825918,0.00003277969,0.0002480931,0.00024558537,0.00019862597,0.0000010597032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040415465,0.0013631871,0.0013779765,0.00049301184,0.00217701,0.0006266088,0.04186481,0.016375566,0.00907977,0.15510172,0.0016094445,0.7695267],"study_design_scores_gemma":[0.0016356007,0.00011407175,0.002591441,0.00011568413,0.000014773758,0.00023252383,0.00007371019,0.9514891,0.00042543895,0.0040627825,0.03904259,0.00020228376],"about_ca_topic_score_codex":0.0000031041932,"about_ca_topic_score_gemma":0.0000036872786,"teacher_disagreement_score":0.93511355,"about_ca_system_score_codex":0.00003381158,"about_ca_system_score_gemma":0.00002344983,"threshold_uncertainty_score":0.5197034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28744435,0.000056984823,0.71083134,0.0002570037,0.00088226126,0.00032705642,0.000005530011,0.00014921399,0.000046272507],"genre_scores_gemma":[0.9282178,0.000013594029,0.07131411,0.000098215176,0.0002110038,0.00007519841,0.000005525195,0.000015766835,0.00004877976],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817854,0.00009459169,0.0004895145,0.0003204817,0.00051199994,0.00040485043],"domain_scores_gemma":[0.9984904,0.00023995053,0.0004039024,0.00036502004,0.0003528649,0.00014789584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017544327,0.00015734498,0.00023250013,0.0009966618,0.00021059296,0.00038284002,0.001152215,0.00009959216,0.000021781434],"category_scores_gemma":[0.00026091136,0.00014599969,0.00029445603,0.0016471803,0.0000568142,0.0010006671,0.00016066241,0.00047126188,0.000021706503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001649824,0.0024004162,0.006946794,0.002557157,0.0011018907,0.00024629812,0.029822538,0.0066231377,0.4888687,0.077913046,0.07360011,0.30827007],"study_design_scores_gemma":[0.0017034372,0.0010238835,0.0012131594,0.00047327438,0.00002217278,0.00017831892,0.00012552174,0.8818185,0.09020293,0.014450035,0.008436427,0.00035236005],"about_ca_topic_score_codex":0.00012593335,"about_ca_topic_score_gemma":0.000001517977,"teacher_disagreement_score":0.8751953,"about_ca_system_score_codex":0.000089244044,"about_ca_system_score_gemma":0.00012744448,"threshold_uncertainty_score":0.59536946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023162091,0.00013108115,0.9744864,0.000613093,0.00091593014,0.00021212388,0.000097012264,0.00023643013,0.00014584934],"genre_scores_gemma":[0.16643517,0.000057926503,0.8315801,0.0003824432,0.001234707,0.000011356779,0.00023477044,0.000034418474,0.000029114326],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980799,0.000117078,0.0003295848,0.0005298692,0.00041773435,0.0005258285],"domain_scores_gemma":[0.99782693,0.00018372307,0.00016591889,0.001462893,0.00012390589,0.0002365982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013476192,0.00018101624,0.00021512147,0.00032952745,0.0005002493,0.00058215705,0.002645876,0.00008602054,0.000005602752],"category_scores_gemma":[0.00013661876,0.00016253586,0.00017399124,0.00086794805,0.000056983026,0.0009343053,0.0003095181,0.0003838733,0.000021341455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017247407,0.0006841858,0.0011217393,0.00025494216,0.00036444506,0.0007354739,0.0030979982,0.1477837,0.0056933044,0.014274979,0.80439854,0.021418225],"study_design_scores_gemma":[0.00092688797,0.00006772257,0.00018491717,0.000027252607,0.000023640825,0.00019157154,0.00005841007,0.9543957,0.0015149427,0.0012944469,0.041038003,0.00027647184],"about_ca_topic_score_codex":0.0000035974615,"about_ca_topic_score_gemma":4.0334587e-7,"teacher_disagreement_score":0.806612,"about_ca_system_score_codex":0.000023909373,"about_ca_system_score_gemma":0.00012866779,"threshold_uncertainty_score":0.662802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10585804,0.00007720019,0.888877,0.00018946972,0.0013685424,0.00028999784,0.0001268248,0.0014476241,0.0017653197],"genre_scores_gemma":[0.99590975,0.00036369025,0.0028418412,0.000090071655,0.000077921104,8.3297584e-7,0.00006508458,0.000020813262,0.0006300107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772656,0.00012835157,0.0001872565,0.0013908849,0.00012850223,0.00043842438],"domain_scores_gemma":[0.99709874,0.00037388914,0.0001833716,0.002017558,0.00012403597,0.00020242257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002539334,0.0003363977,0.0003324676,0.00036247764,0.0002366073,0.00030771436,0.0030234973,0.0003371004,0.000029604553],"category_scores_gemma":[0.00008859587,0.00039930767,0.00030155168,0.0010274173,0.00015185543,0.0003952269,0.0040238076,0.00067797775,0.00034827867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002136377,0.00011664647,0.00087148667,0.0001030533,0.00014625248,0.0024850054,0.00039967752,0.0612089,0.000012769699,0.93185717,0.0020680053,0.0007096582],"study_design_scores_gemma":[0.000383068,0.00004551826,0.0006211521,0.00007983436,0.00006356985,0.000006631021,0.00007389353,0.402597,0.000066877445,0.5907132,0.004648776,0.00070048106],"about_ca_topic_score_codex":0.00029847727,"about_ca_topic_score_gemma":0.00021145419,"teacher_disagreement_score":0.89005166,"about_ca_system_score_codex":0.000091677626,"about_ca_system_score_gemma":0.00015930165,"threshold_uncertainty_score":0.99984586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103200465,0.000090024616,0.8927507,0.00050016795,0.0019792232,0.00062100164,0.0001587965,0.0006629144,0.000036740665],"genre_scores_gemma":[0.9280196,0.000058263835,0.07123524,0.0003703469,0.00017916538,0.000029163533,0.000078504294,0.00002508616,0.0000046350824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974688,0.00015946243,0.0006630204,0.00082784647,0.0003309208,0.0005499041],"domain_scores_gemma":[0.9976723,0.0010453328,0.00026113752,0.0006824712,0.00022215351,0.00011657788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009134315,0.0002909904,0.00033407452,0.00063904794,0.00061475503,0.0004453531,0.00094063464,0.00019223412,0.000003907343],"category_scores_gemma":[0.000010818708,0.00032154899,0.00016228305,0.0043219756,0.000042563963,0.0006220347,0.00002380839,0.0004936787,0.00006784567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003075537,0.0015480953,0.0019338557,0.0020580506,0.00033482333,0.00007875232,0.102774635,0.3799394,0.0029820844,0.1061517,0.00019215347,0.4016989],"study_design_scores_gemma":[0.0007233278,0.00013208858,0.0034144511,0.0004299639,0.000021298281,0.0000049564746,0.0020106798,0.97804004,0.004010971,0.009478052,0.0012745474,0.0004596242],"about_ca_topic_score_codex":0.00006382644,"about_ca_topic_score_gemma":0.00046167994,"teacher_disagreement_score":0.82481915,"about_ca_system_score_codex":0.000060028306,"about_ca_system_score_gemma":0.000058078138,"threshold_uncertainty_score":0.99992365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58741766,0.0012540423,0.3561182,0.0076600187,0.0006199233,0.0013117717,0.000018647932,0.043398716,0.002201034],"genre_scores_gemma":[0.9437766,0.00033790123,0.055575486,0.000037179787,0.000019273606,0.0002098266,0.00000882924,0.0000166187,0.000018305116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99806994,0.000021382406,0.00037601637,0.000633808,0.00039601486,0.00050280924],"domain_scores_gemma":[0.99812937,0.00024141972,0.0002614326,0.0011657503,0.00016376887,0.0000382393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014790839,0.00023531656,0.00026781927,0.0007409751,0.00063366827,0.0009538515,0.0036123318,0.00019127488,8.363328e-7],"category_scores_gemma":[0.0021983827,0.00021441748,0.00007460707,0.0027911623,0.000109007575,0.0020909724,0.0026199357,0.0006691969,0.00010435456],"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.000006251258,0.00004059421,0.00040246604,0.000116827745,0.000032363692,0.000003411663,0.000995431,0.000015542584,0.0154611375,0.9592811,0.00294048,0.020704417],"study_design_scores_gemma":[0.000641409,0.0004052431,0.0010274551,0.0009658003,0.00003504193,0.000059068567,0.010308633,0.045994334,0.5232759,0.37517676,0.04071133,0.001399005],"about_ca_topic_score_codex":0.00004382411,"about_ca_topic_score_gemma":0.0000030941555,"teacher_disagreement_score":0.58410436,"about_ca_system_score_codex":0.000059293754,"about_ca_system_score_gemma":0.000024294563,"threshold_uncertainty_score":0.91980124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41794288,0.000011151079,0.58143574,0.00024752697,0.00009073115,0.00014282201,0.000019857038,0.000089666675,0.000019618226],"genre_scores_gemma":[0.9929229,0.000003197291,0.0068185944,0.00017131871,0.000005837553,0.000023033597,0.00004313924,0.0000045787697,0.0000073812384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923795,0.000030295163,0.00020991977,0.00022987812,0.00012273477,0.00016924032],"domain_scores_gemma":[0.99943876,0.00015455298,0.000019564322,0.00030150928,0.000052655792,0.00003292729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030505803,0.00007002541,0.000103522456,0.00027547477,0.00001928879,0.000039841405,0.00042642112,0.000040557083,0.00001350646],"category_scores_gemma":[0.000031214513,0.00006519126,0.00008725237,0.00050859613,0.000020498004,0.0002207944,0.00005144742,0.000044204706,0.000009110726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015252989,0.0006030531,0.004190512,0.00035252093,0.00004934974,0.000025777965,0.011147887,0.0006399425,0.031775072,0.9208761,0.0010032225,0.029184049],"study_design_scores_gemma":[0.0006092458,0.00019744707,0.006105069,0.000036002606,0.000005577465,0.0000030406027,0.00004316704,0.9511572,0.026657922,0.014644584,0.00039087594,0.00014985783],"about_ca_topic_score_codex":0.00012681291,"about_ca_topic_score_gemma":0.000118477124,"teacher_disagreement_score":0.9505173,"about_ca_system_score_codex":0.000008715211,"about_ca_system_score_gemma":0.000026055899,"threshold_uncertainty_score":0.26584226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23828931,0.00012738215,0.76015747,0.0006514864,0.00025796544,0.00023293188,0.000051157855,0.0002048458,0.000027458906],"genre_scores_gemma":[0.9603154,0.000007006005,0.039347447,0.00024889808,0.000022622924,0.000015435888,0.00002521948,0.0000045495517,0.000013389068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926066,0.000024791518,0.00013617585,0.00024348815,0.00015230823,0.00018258733],"domain_scores_gemma":[0.99901706,0.00022246539,0.000044039192,0.0005674432,0.00010277013,0.0000462424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036826386,0.000080206235,0.000086789325,0.00008736812,0.00007252062,0.00007248621,0.0010936975,0.000049143127,0.0000100093785],"category_scores_gemma":[0.00004244457,0.00004890769,0.000090796144,0.00048777417,0.000058103924,0.00014688475,0.00022954159,0.0000889932,0.000013620556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003102847,0.00026871104,0.00060909067,0.000037159483,0.000035908397,0.0000026602531,0.0025813186,0.00029191686,0.015915751,0.9602467,0.007814647,0.012165107],"study_design_scores_gemma":[0.0002652676,0.00011764138,0.008637412,0.000008425937,0.0000036660072,0.0000010456632,0.00023048234,0.9787162,0.00752305,0.0017819272,0.0026295271,0.00008537751],"about_ca_topic_score_codex":0.000070072085,"about_ca_topic_score_gemma":0.00003229939,"teacher_disagreement_score":0.97842425,"about_ca_system_score_codex":0.000003349579,"about_ca_system_score_gemma":0.000018899014,"threshold_uncertainty_score":0.20323804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43395844,0.000008295911,0.5637356,0.000523046,0.00067712856,0.00032796292,0.000029551553,0.00025403893,0.0004859192],"genre_scores_gemma":[0.99808455,0.00004519834,0.0015704685,0.00016115187,0.000057728645,0.0000025562986,0.000049356804,0.000011274741,0.000017723605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977636,0.00039005306,0.00023880748,0.0010557773,0.00015962958,0.000392183],"domain_scores_gemma":[0.9977834,0.00041324776,0.00025648667,0.0013925256,0.000076261065,0.00007805358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010851267,0.00025604427,0.0002244138,0.00037826263,0.00017872045,0.000259853,0.0022560817,0.00020879942,0.0000065733725],"category_scores_gemma":[0.00015914447,0.00023837785,0.00018646092,0.0015143146,0.00009661623,0.000313259,0.002277668,0.0010829783,0.000078839636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008045814,0.00028132804,0.009287662,0.0001459975,0.00008376789,0.0009547767,0.004576454,0.16636007,0.000052061125,0.81649303,0.00106208,0.00062229094],"study_design_scores_gemma":[0.00056346174,0.00006871763,0.02564866,0.00020603773,0.000045215173,0.000016526488,0.00095245655,0.86823314,0.00003712466,0.10275787,0.00094374287,0.000527047],"about_ca_topic_score_codex":0.0001990902,"about_ca_topic_score_gemma":0.00017728486,"teacher_disagreement_score":0.71373516,"about_ca_system_score_codex":0.00014435002,"about_ca_system_score_gemma":0.00010436887,"threshold_uncertainty_score":0.97207665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44102538,0.0009032098,0.55117744,0.0036934721,0.002427571,0.00048869924,0.000052809384,0.00015944861,0.00007196924],"genre_scores_gemma":[0.99752164,0.00003436251,0.001998336,0.0002517599,0.00012086228,0.000019257603,0.0000032154608,0.000009754852,0.00004083646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841577,0.00010612498,0.0005670541,0.00027522974,0.00028467935,0.00035112398],"domain_scores_gemma":[0.9987398,0.00030836873,0.00035527666,0.00024699557,0.00019862827,0.00015093989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444003,0.00014539824,0.00034110394,0.00055059954,0.00008212722,0.0004501314,0.0011238412,0.00009472931,0.000002624297],"category_scores_gemma":[0.00012478307,0.00012738003,0.00012305057,0.00055868016,0.000050538783,0.00057976216,0.00015534612,0.00032773698,0.0000017340824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031913149,0.0013418439,0.10194482,0.006016186,0.0014707168,0.0012407525,0.055103306,0.004324669,0.022867188,0.45868403,0.1847645,0.15905066],"study_design_scores_gemma":[0.010220566,0.0012673715,0.023256665,0.0023000329,0.000054833552,0.0011921705,0.00058448553,0.8917921,0.0052627013,0.057633404,0.005587054,0.00084860204],"about_ca_topic_score_codex":0.00051627046,"about_ca_topic_score_gemma":0.0000750556,"teacher_disagreement_score":0.88746744,"about_ca_system_score_codex":0.0000354082,"about_ca_system_score_gemma":0.00006737006,"threshold_uncertainty_score":0.51944065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050153914,0.00016191415,0.99538714,0.0013241508,0.00061775284,0.00034683078,0.000025504858,0.00042572943,0.0016608274],"genre_scores_gemma":[0.1709061,0.00004048531,0.82448363,0.0034435918,0.00081139663,0.000025126363,0.00006422057,0.00007820972,0.00014725149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962999,0.000031263913,0.0003498487,0.0014840297,0.0011549918,0.0006799498],"domain_scores_gemma":[0.99735683,0.0005045273,0.00022907676,0.0014937189,0.00022979947,0.00018602604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006776957,0.000493581,0.0004061354,0.0016885252,0.0003201197,0.0007303808,0.0029812614,0.00033799888,0.000009662696],"category_scores_gemma":[0.00007432167,0.00040988857,0.00012249574,0.0020633992,0.0006505765,0.00079144986,0.0005603535,0.0008568237,0.00003799821],"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.000027120006,0.000057870508,0.00007302302,0.00008762543,0.000021044421,0.00019526054,0.00060363335,0.15922886,0.0001179499,0.49946958,0.00012632788,0.33999172],"study_design_scores_gemma":[0.00046900503,0.00034770562,0.00030278033,0.00044928456,0.00001070556,0.000025348612,1.5669275e-7,0.541011,0.0016086798,0.4523441,0.0025248805,0.00090640655],"about_ca_topic_score_codex":0.00009730874,"about_ca_topic_score_gemma":0.00045952428,"teacher_disagreement_score":0.38178208,"about_ca_system_score_codex":0.0001626717,"about_ca_system_score_gemma":0.0012201229,"threshold_uncertainty_score":0.9998353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002323806,0.00018209705,0.988584,0.0006494243,0.0017080536,0.000488987,0.000054576933,0.00025195346,0.0057571265],"genre_scores_gemma":[0.89383125,0.00006855704,0.10275002,0.0022357965,0.00062594004,0.000033285563,0.000018017414,0.0000926094,0.00034452352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956946,0.00004037379,0.0005929503,0.0016442275,0.0012947306,0.0007331192],"domain_scores_gemma":[0.9948483,0.0019933805,0.0003537564,0.0024739362,0.00019777556,0.00013285711],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001708854,0.00049830816,0.00050345215,0.0005372742,0.00050104724,0.0006867219,0.005416425,0.00026857277,0.00006720322],"category_scores_gemma":[0.0004969177,0.00037681274,0.00022860375,0.0013987337,0.0006632236,0.00048733113,0.0030324915,0.001120553,0.000037705217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007412488,0.00017623063,0.0005579897,0.00041754602,0.00008939833,0.00032584713,0.0064699138,0.032346707,0.0018526814,0.70703846,0.00042752997,0.25022358],"study_design_scores_gemma":[0.00041934784,0.00065518497,0.0010433596,0.002538524,0.000018737963,0.00003683356,0.0000027337283,0.40298462,0.007564533,0.58161247,0.0018167357,0.0013069335],"about_ca_topic_score_codex":0.000057283665,"about_ca_topic_score_gemma":0.00018015878,"teacher_disagreement_score":0.89150745,"about_ca_system_score_codex":0.00013907904,"about_ca_system_score_gemma":0.00026071077,"threshold_uncertainty_score":0.9999648},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5402936,0.0008276814,0.4578681,0.00010011146,0.00010013181,0.00015790157,0.00006805685,0.00025162954,0.0003328065],"genre_scores_gemma":[0.97857034,0.0018686306,0.019107241,0.00025921914,0.00005850633,0.000049108425,0.000065197055,0.0000150279475,0.0000067525743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981493,0.000049456416,0.0002444364,0.00075020787,0.0003451231,0.00046147185],"domain_scores_gemma":[0.99899036,0.00013899304,0.00007937623,0.00049561437,0.000070401606,0.00022525982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035609395,0.00027293706,0.0002707812,0.0005499882,0.00046462353,0.00058077666,0.0006293585,0.000110841625,0.000020156338],"category_scores_gemma":[0.000014580584,0.00025540203,0.00013039129,0.0013478685,0.00021945921,0.0005435128,0.00045707653,0.00021092984,0.000008935946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036193276,0.00012182519,0.17469916,0.00028637177,0.00018466194,0.00018109613,0.0034118302,0.00005311005,0.013897711,0.7922838,0.001461617,0.013382649],"study_design_scores_gemma":[0.0010676812,0.0002863122,0.38610885,0.00023098526,0.000048221384,0.000096054806,0.00073529145,0.040624186,0.00069946167,0.56704414,0.0021308132,0.00092800317],"about_ca_topic_score_codex":0.00007738168,"about_ca_topic_score_gemma":0.000029584106,"teacher_disagreement_score":0.43876085,"about_ca_system_score_codex":0.0000055118735,"about_ca_system_score_gemma":0.000027937482,"threshold_uncertainty_score":0.9999898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062062193,0.0001197925,0.894657,0.00067416835,0.041003466,0.0009366727,0.00007603701,0.0004430975,0.000027574666],"genre_scores_gemma":[0.8187837,0.000025776659,0.093155146,0.0010302635,0.081147656,0.00058489887,0.0048669255,0.00009807705,0.00030753823],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740994,0.00030818713,0.00067788386,0.0006718785,0.0005173755,0.000414716],"domain_scores_gemma":[0.99821705,0.000125558,0.00033016733,0.0008210934,0.00037007342,0.00013604447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011505175,0.00025707108,0.00037586514,0.00042103737,0.00022523178,0.00046375778,0.0008614657,0.00029434214,0.0000066606376],"category_scores_gemma":[0.000020339598,0.00024352066,0.00018295745,0.0014313894,0.000039919843,0.00040702595,0.00019993313,0.0002094372,0.00002407947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014347969,0.00025520282,0.0003784597,0.000495279,0.00019176812,0.00001306779,0.0025511174,0.042304322,0.012669403,0.10576345,0.818665,0.016569443],"study_design_scores_gemma":[0.0012022109,0.0001779398,0.00011254155,0.000078786456,0.000011063056,0.0000034961918,0.00004868339,0.896649,0.0061096284,0.00003306648,0.095325336,0.00024823923],"about_ca_topic_score_codex":0.00016368699,"about_ca_topic_score_gemma":0.000020560441,"teacher_disagreement_score":0.85434467,"about_ca_system_score_codex":0.000072389565,"about_ca_system_score_gemma":0.00016136472,"threshold_uncertainty_score":0.99304837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011667496,0.00003372702,0.97568816,0.0008395343,0.00051100575,0.00015390156,0.00001556628,0.0014184531,0.009672128],"genre_scores_gemma":[0.8239027,0.000115040886,0.17156944,0.0021209957,0.000389023,0.000057866335,0.000096011274,0.00003395772,0.0017149398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862844,0.000038425816,0.00018957596,0.00044773822,0.00028803278,0.0004077761],"domain_scores_gemma":[0.99885154,0.00016364551,0.000039435527,0.00076237397,0.00004086991,0.00014210878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032505483,0.00013970814,0.00014075865,0.0002173449,0.00020035497,0.00023042581,0.0010141386,0.00006013145,0.00023618671],"category_scores_gemma":[0.00004355352,0.00010624984,0.000085380234,0.0018697195,0.000048209557,0.00075160834,0.000623179,0.00012416852,0.0009860363],"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.000024538198,0.00014189874,0.0023909593,0.00004926204,0.00004399808,0.00020647398,0.0012812659,0.000016022246,0.0016903866,0.72087246,0.068662964,0.20461975],"study_design_scores_gemma":[0.0028701788,0.00085048686,0.06806936,0.00016313142,0.000041709325,0.00028758793,0.0011963634,0.28536743,0.016078094,0.16656372,0.4557427,0.0027692702],"about_ca_topic_score_codex":0.00021430154,"about_ca_topic_score_gemma":0.00017826697,"teacher_disagreement_score":0.81223524,"about_ca_system_score_codex":0.000010393757,"about_ca_system_score_gemma":0.0000349387,"threshold_uncertainty_score":0.9997918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38200963,0.000009423257,0.61642826,0.00008920891,0.0006486632,0.00025829734,0.000009343051,0.00024974757,0.0002974618],"genre_scores_gemma":[0.9144298,0.00002131614,0.08531853,0.00007676673,0.000062911975,0.000019642213,0.00004018213,0.000011546002,0.000019293095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980029,0.0001201899,0.0003061135,0.00055087445,0.0007178584,0.00030206656],"domain_scores_gemma":[0.9986641,0.00021234195,0.00012497033,0.0006746101,0.00023255266,0.000091439906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012316786,0.00017034922,0.00017156311,0.00046044632,0.0002504129,0.00023563695,0.00063629204,0.00008705951,0.00011436698],"category_scores_gemma":[0.00017006081,0.00015262743,0.00011610856,0.0016882349,0.000034741923,0.0015136593,0.00042412762,0.00014543203,0.00041514335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021298857,0.0003006076,0.002481765,0.000033583037,0.000119123055,0.000038346756,0.005636614,0.0027478866,0.084327444,0.08707334,0.007984178,0.8090441],"study_design_scores_gemma":[0.0009482726,0.00005709672,0.049100872,0.000051043924,0.000018183817,0.0000116425745,0.00010218578,0.9046202,0.0058204727,0.038686648,0.00034788408,0.00023551486],"about_ca_topic_score_codex":0.000094729105,"about_ca_topic_score_gemma":0.00011109551,"teacher_disagreement_score":0.9018723,"about_ca_system_score_codex":0.000085058266,"about_ca_system_score_gemma":0.000098384466,"threshold_uncertainty_score":0.6223966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020532778,0.0010780956,0.9919444,0.0032544087,0.00186482,0.0005040811,0.000023590921,0.0002862609,0.0010238221],"genre_scores_gemma":[0.028775498,0.00077261665,0.9652511,0.003941658,0.0010540193,0.000045028773,0.00002883566,0.00006448356,0.00006677864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953504,0.00020776581,0.0006227761,0.0018405049,0.0012093895,0.0007691366],"domain_scores_gemma":[0.99538755,0.0017614255,0.00028778383,0.001965532,0.0003282668,0.0002694597],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0039712386,0.00059831026,0.00070215523,0.0008946258,0.0006594232,0.0015849025,0.0041431384,0.00038054027,0.000015874273],"category_scores_gemma":[0.00024235925,0.0004146031,0.00022538261,0.0014876934,0.0025853214,0.0009492012,0.002737426,0.0010946566,0.000041394494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017223856,0.000013335584,0.000013862547,0.000030813426,0.000018910288,0.000037477,0.00069366826,0.0008364632,0.000013523656,0.55357087,0.00011974745,0.44463408],"study_design_scores_gemma":[0.0012415217,0.000060233222,0.00007693387,0.00012680299,0.000014243629,0.00009749336,5.2647647e-7,0.3158546,0.00017685286,0.6788359,0.0029529626,0.0005618712],"about_ca_topic_score_codex":0.00007141721,"about_ca_topic_score_gemma":0.0002933829,"teacher_disagreement_score":0.44407222,"about_ca_system_score_codex":0.000095233445,"about_ca_system_score_gemma":0.00047214108,"threshold_uncertainty_score":0.9998306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009655468,0.000054692406,0.99062496,0.0014214098,0.0030450285,0.00033636083,0.00004449202,0.00040518923,0.0039713257],"genre_scores_gemma":[0.3498399,0.00012514308,0.6398734,0.006635153,0.002147837,0.000074604766,0.0003091196,0.00013935879,0.0008555134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995797,0.000041891275,0.00051535637,0.0016993466,0.0013482531,0.00059816864],"domain_scores_gemma":[0.99653316,0.0007161085,0.00029735922,0.002045732,0.00021604326,0.00019160761],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010176845,0.000503179,0.00037496284,0.0013239669,0.0005149699,0.0010478942,0.0027708865,0.0003962473,0.000040352777],"category_scores_gemma":[0.00012899897,0.00048997084,0.00022055449,0.0008647431,0.0007079504,0.0007157458,0.0004841983,0.00094958226,0.00023103176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027533322,0.00019987869,0.0001014301,0.000067439636,0.000023354238,0.0002266496,0.0006288689,0.04651081,0.00015337326,0.6768349,0.00067563733,0.27455017],"study_design_scores_gemma":[0.0004265018,0.0005513585,0.00093520014,0.00057030225,0.000014743764,0.000018728273,1.5248635e-7,0.3876302,0.00043006532,0.60121804,0.007142054,0.001062643],"about_ca_topic_score_codex":0.000036058063,"about_ca_topic_score_gemma":0.00043327047,"teacher_disagreement_score":0.35075158,"about_ca_system_score_codex":0.00022312734,"about_ca_system_score_gemma":0.000642295,"threshold_uncertainty_score":0.9999891},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035104472,0.000017120232,0.9627459,0.0008425755,0.00023923739,0.000508089,0.000025884068,0.00038643478,0.00013030252],"genre_scores_gemma":[0.96787405,0.000026722735,0.03170619,0.00017193217,0.000070671194,0.000032128166,0.000026174994,0.000023365028,0.0000687853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768484,0.0000308821,0.000274488,0.0009675323,0.00038656872,0.0006556691],"domain_scores_gemma":[0.99770546,0.0005902848,0.000084869724,0.0012160353,0.00017763523,0.00022570127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280053,0.00021231963,0.00024540897,0.0003569862,0.0007252756,0.00040318051,0.0017189144,0.00008789181,0.0000085135325],"category_scores_gemma":[0.000049820635,0.00019415132,0.00006515141,0.0011515586,0.00007949899,0.0012794894,0.00015619738,0.00036115406,0.000007549092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015025036,0.0018802288,0.0019296311,0.0037732967,0.0014728835,0.0019324883,0.033214588,0.04285924,0.00021623308,0.10789751,0.011666201,0.7916552],"study_design_scores_gemma":[0.0012782089,0.00026446412,0.00040917585,0.00016041116,0.000031554464,0.000054589473,0.0018883068,0.9880516,0.00062633236,0.0026653886,0.004235645,0.00033435255],"about_ca_topic_score_codex":0.000117306416,"about_ca_topic_score_gemma":0.000032950535,"teacher_disagreement_score":0.94519234,"about_ca_system_score_codex":0.000054331736,"about_ca_system_score_gemma":0.00017544691,"threshold_uncertainty_score":0.7917261},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9550017,0.000091388225,0.039216995,0.002478269,0.00072086,0.0007140534,0.000035281264,0.0005391821,0.0012022838],"genre_scores_gemma":[0.95715874,0.000087922956,0.042246092,0.000363725,0.00009961481,0.000017597671,0.0000030863491,0.000017172888,0.0000060201764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978556,0.000025820795,0.00043451952,0.0005602592,0.00062800955,0.00049577485],"domain_scores_gemma":[0.99884516,0.00009409328,0.00033044204,0.0003608188,0.00024291564,0.00012659421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071056455,0.00023784218,0.00028310926,0.00028002198,0.0003341052,0.00024533315,0.0015174055,0.00010753896,0.0000041902767],"category_scores_gemma":[0.0001456824,0.00018032434,0.00027803352,0.002556899,0.00017133281,0.00068661565,0.0015338218,0.0003691073,0.000010140642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051618066,0.0002283395,0.009866476,0.0003330585,0.00018682935,0.000011729712,0.0057961554,0.000068198045,0.1574177,0.81615776,0.002457231,0.007424915],"study_design_scores_gemma":[0.0022305755,0.00044695585,0.022911012,0.0014616676,0.00018575031,0.0000921506,0.002507457,0.07442432,0.40301153,0.47298464,0.018108366,0.0016355714],"about_ca_topic_score_codex":0.00008277612,"about_ca_topic_score_gemma":0.0000069787834,"teacher_disagreement_score":0.34317312,"about_ca_system_score_codex":0.000045091267,"about_ca_system_score_gemma":0.00003518325,"threshold_uncertainty_score":0.7353413},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22117569,0.000022816894,0.7742186,0.0024910488,0.00022210038,0.0004721937,0.00012219785,0.00075088354,0.00052444637],"genre_scores_gemma":[0.99236256,0.000006629241,0.0063470667,0.0010927116,0.0000621161,0.00003781092,0.00006637942,0.000014581257,0.000010125832],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798167,0.000063897445,0.00023281817,0.00068205706,0.00046682497,0.0005727608],"domain_scores_gemma":[0.99761266,0.0002570227,0.00011323729,0.0016935271,0.00013763599,0.00018591364],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0002514357,0.00024545845,0.00027192585,0.00030189357,0.00026565825,0.0015080544,0.006123773,0.000098502715,0.00015715045],"category_scores_gemma":[0.000059120168,0.00018119451,0.000089957925,0.0025950226,0.00006254063,0.0027719182,0.001885388,0.00025281988,0.000027053356],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058321323,0.00052333454,0.72117347,0.0007180117,0.00059530133,0.0006326636,0.0013423125,0.021749144,0.003928284,0.093816474,0.13512163,0.019816155],"study_design_scores_gemma":[0.0047111134,0.00021524605,0.43865365,0.00009439732,0.00004041512,0.00001137353,0.000032647607,0.5199923,0.012740291,0.015443254,0.0071065184,0.00095879886],"about_ca_topic_score_codex":0.0002238505,"about_ca_topic_score_gemma":0.0003272405,"teacher_disagreement_score":0.7711869,"about_ca_system_score_codex":0.000024198633,"about_ca_system_score_gemma":0.00018018938,"threshold_uncertainty_score":0.99952847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80844235,0.00012436802,0.07918793,0.0138191385,0.0014464142,0.0078059398,0.087325685,0.0012436206,0.0006045459],"genre_scores_gemma":[0.68366504,0.00038033826,0.29988134,0.00040597087,0.000299171,0.000107219115,0.015164852,0.00006116505,0.00003489106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977684,0.000012584644,0.00036633902,0.0009848602,0.000558951,0.00030888626],"domain_scores_gemma":[0.9918916,0.000095312826,0.00041021785,0.0074413815,0.00010643881,0.00005504358],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016963949,0.00017494627,0.00021099103,0.00020977236,0.00019363195,0.00026949294,0.0461933,0.000038530663,0.0000033996005],"category_scores_gemma":[0.0004945143,0.00013523984,0.0000424672,0.0011644745,0.000055118326,0.0046496075,0.060654964,0.00016856643,0.0000019844165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002750595,0.0023888533,0.020939628,0.009096486,0.0008014905,0.000007095789,0.00083890493,0.000031195956,0.0014372506,0.119339265,0.28152898,0.5633158],"study_design_scores_gemma":[0.007925739,0.0028477784,0.22326912,0.0062429444,0.0012041996,0.000022034623,0.00782067,0.3587001,0.012557223,0.21137495,0.16476963,0.003265605],"about_ca_topic_score_codex":0.000048398088,"about_ca_topic_score_gemma":0.000023725377,"teacher_disagreement_score":0.5600502,"about_ca_system_score_codex":0.000009135771,"about_ca_system_score_gemma":0.0000132792975,"threshold_uncertainty_score":0.95896727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38855532,0.0005269762,0.49561659,0.00016741852,0.10988937,0.00060576043,0.0000031430484,0.0025210287,0.0021144042],"genre_scores_gemma":[0.9983704,0.000010206141,0.0010965123,0.000016646065,0.00022818962,0.000024284898,0.00003514404,0.000006656405,0.00021192498],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977534,0.00006894614,0.00036563884,0.0008235019,0.0005739932,0.0004145538],"domain_scores_gemma":[0.9980483,0.00004367762,0.00019374493,0.0014789075,0.000110940266,0.00012444839],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025920377,0.000108517816,0.00012678214,0.00030667815,0.0007120121,0.0011815634,0.0004008814,0.00006578516,0.0000085553775],"category_scores_gemma":[0.00007998529,0.000098445744,0.000082872284,0.003982468,0.00009093148,0.00062253204,0.00041618416,0.00011005433,0.00017108402],"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.000014663682,0.0002039669,0.011082112,0.00017495794,0.00006517877,0.004240886,0.0026932291,0.013570145,0.028654998,0.09262513,0.67785114,0.16882361],"study_design_scores_gemma":[0.00016186916,0.000077786965,0.0081046205,0.00010787796,0.000014077284,0.0010690182,0.0001073157,0.14038914,0.0043631643,0.23785205,0.6071457,0.00060731196],"about_ca_topic_score_codex":0.000058299116,"about_ca_topic_score_gemma":0.000045810684,"teacher_disagreement_score":0.6098151,"about_ca_system_score_codex":0.00002473778,"about_ca_system_score_gemma":0.000054936827,"threshold_uncertainty_score":0.9998553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9671959,0.0000669849,0.012676665,0.0032196897,0.0017451897,0.00041521556,0.00062511826,0.0020840073,0.011971177],"genre_scores_gemma":[0.99702114,0.00001658854,0.00074672804,0.001246876,0.000115300114,0.0000039844213,0.00031669837,0.000013939045,0.00051875674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981223,0.000027331384,0.00022265433,0.00066219067,0.0004911286,0.00047444788],"domain_scores_gemma":[0.9985411,0.00022169955,0.0000664203,0.0008913316,0.00008254728,0.00019686905],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014226986,0.0002324848,0.00020795691,0.00024447337,0.00019774362,0.00043926827,0.0010332038,0.0001307416,0.00022366951],"category_scores_gemma":[0.00006179156,0.00018962106,0.00016823197,0.0012342852,0.000068145644,0.0007462376,0.0007427545,0.000257529,0.0018150958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007708338,0.00030759463,0.0004042231,0.000021295436,0.00004217187,0.00029044488,0.000475344,0.000028207327,0.0030257953,0.9173922,0.070644915,0.007290713],"study_design_scores_gemma":[0.006327101,0.0058098566,0.2244428,0.00025862097,0.00007166494,0.00024219386,0.0008370357,0.089055635,0.019006131,0.3979377,0.25114146,0.004869833],"about_ca_topic_score_codex":0.00006644449,"about_ca_topic_score_gemma":0.00005167617,"teacher_disagreement_score":0.51945454,"about_ca_system_score_codex":0.000030659525,"about_ca_system_score_gemma":0.000040280363,"threshold_uncertainty_score":0.9989621},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092287794,0.00023177733,0.9045174,0.0005861968,0.0010453666,0.00020092163,0.000019841786,0.0008794758,0.00023123762],"genre_scores_gemma":[0.910868,0.000011278935,0.08857216,0.00028502767,0.0002065786,0.000013287444,0.000018242688,0.000018934174,0.0000065020035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980346,0.000096912234,0.00031582065,0.0007064687,0.0004073719,0.00043883914],"domain_scores_gemma":[0.99855644,0.0004054461,0.00008302229,0.00072592264,0.000102578924,0.00012659356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875966,0.00024301864,0.00017660017,0.00019597763,0.0006282809,0.00061396195,0.001078256,0.000090556416,0.000024277073],"category_scores_gemma":[0.0000016463837,0.0002225285,0.00012271894,0.001334165,0.00005392365,0.0011434758,0.000027742708,0.0004762302,0.000052380532],"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.00021541418,0.00073975994,0.00677589,0.001375977,0.00060311577,0.00010565828,0.0072178287,0.7597214,0.0035127718,0.08861743,0.00089690054,0.13021785],"study_design_scores_gemma":[0.00027656398,0.00007056029,0.0034113687,0.00027541613,0.00001785156,0.000033307064,0.000086614695,0.9927977,0.0002645756,0.000839206,0.001664031,0.00026282368],"about_ca_topic_score_codex":0.00011214112,"about_ca_topic_score_gemma":0.0001959363,"teacher_disagreement_score":0.8185802,"about_ca_system_score_codex":0.000050162562,"about_ca_system_score_gemma":0.00006349674,"threshold_uncertainty_score":0.9074449},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000317694,0.0007863672,0.9911849,0.00043056783,0.002457366,0.0010603298,0.00006067563,0.00031515048,0.0036728843],"genre_scores_gemma":[0.04504076,0.000053159616,0.9521943,0.0007916135,0.0008434921,0.00007612301,0.000036349204,0.00008419681,0.00088000274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564487,0.000023757057,0.0004886395,0.0022491456,0.0007774432,0.00081617077],"domain_scores_gemma":[0.9969302,0.0005738609,0.00020201766,0.0017304273,0.00031772268,0.0002457713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084903656,0.0006864699,0.00059615134,0.0009817859,0.00035161607,0.0010005214,0.003669238,0.00038347472,0.000021403928],"category_scores_gemma":[0.00006986159,0.00047411703,0.00018495123,0.0012408186,0.00062282296,0.0008713882,0.0016461745,0.0007644341,0.000052755622],"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.00013094998,0.00012922127,0.000027936709,0.00047303067,0.000053995594,0.0002532299,0.001973901,0.00082219404,0.000097578864,0.39755693,0.00058485597,0.59789616],"study_design_scores_gemma":[0.00086145086,0.0013647708,0.00008746145,0.0017993697,0.00005062579,0.00023398464,3.7577732e-7,0.27643797,0.0011063641,0.6884965,0.028123252,0.0014379144],"about_ca_topic_score_codex":0.000012763057,"about_ca_topic_score_gemma":0.00033760874,"teacher_disagreement_score":0.59645826,"about_ca_system_score_codex":0.00018972739,"about_ca_system_score_gemma":0.00091441866,"threshold_uncertainty_score":0.99977106},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11826389,0.00011998074,0.879725,0.00024899322,0.00014588842,0.00013103207,0.000010495418,0.00040966738,0.00094506034],"genre_scores_gemma":[0.983057,0.000042823864,0.01669909,0.00008701719,0.000041698317,0.000011025669,0.000055835022,0.0000034588827,0.0000020513633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934965,0.000016016802,0.00014944472,0.00010793596,0.00022474413,0.00015217814],"domain_scores_gemma":[0.9996197,0.000023536162,0.000025788953,0.00023956137,0.00004555926,0.000045814875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021814143,0.00007545542,0.00005414975,0.00020985835,0.00009402571,0.00061704876,0.00027561386,0.000041194395,0.0000131616725],"category_scores_gemma":[0.0000033463612,0.0000620184,0.00002909744,0.00047449768,0.000020957998,0.004563197,0.00008252697,0.00015360196,0.0003377955],"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.000012647745,0.000010301726,0.00027266602,0.00012375116,0.000019025685,0.000007675286,0.0067835716,0.0015424107,0.00014265932,0.92094356,0.00068905455,0.06945268],"study_design_scores_gemma":[0.0009124924,0.00035991523,0.025890324,0.00027651165,0.000022387912,0.00023933122,0.0006768289,0.82580364,0.0010395255,0.027262798,0.11682341,0.0006928226],"about_ca_topic_score_codex":0.00003573213,"about_ca_topic_score_gemma":0.000010199671,"teacher_disagreement_score":0.89368075,"about_ca_system_score_codex":0.00003329009,"about_ca_system_score_gemma":0.00006787805,"threshold_uncertainty_score":0.59502155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006994428,0.00040871886,0.9885957,0.00082036084,0.0027458363,0.0003262755,0.000035992434,0.00038467604,0.006612447],"genre_scores_gemma":[0.11314735,0.0002494241,0.8789809,0.006056203,0.0011415288,0.00001091353,0.00016687332,0.000066309425,0.00018055306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968222,0.000018395334,0.0005787553,0.0009522027,0.0010795951,0.0005488873],"domain_scores_gemma":[0.99755585,0.00024757325,0.00021738549,0.0016178038,0.00019104425,0.0001703687],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008766287,0.00045995225,0.00039208616,0.0013374683,0.00022405898,0.0014777578,0.0035697336,0.00034108464,0.000024086921],"category_scores_gemma":[0.00007288581,0.00041598498,0.00016429929,0.001409381,0.0005610947,0.0023081186,0.0022061698,0.0011369478,0.00028384142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009061338,0.000013963936,0.00001601669,0.00008920746,0.0000140717975,0.00005340669,0.0009129259,0.0009946089,0.00002895471,0.7556596,0.0001422735,0.24206592],"study_design_scores_gemma":[0.0001768273,0.00011355528,0.00008198296,0.00034263477,0.0000092355185,0.000057683814,9.913587e-8,0.20406944,0.0005622993,0.740994,0.05300122,0.00059106894],"about_ca_topic_score_codex":0.000013558387,"about_ca_topic_score_gemma":0.000021679702,"teacher_disagreement_score":0.24147485,"about_ca_system_score_codex":0.00017704541,"about_ca_system_score_gemma":0.00036800868,"threshold_uncertainty_score":0.9998292},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001656221,0.0027764996,0.9902303,0.00020565075,0.003205642,0.00037141802,0.000055660257,0.0004277481,0.002561458],"genre_scores_gemma":[0.49647743,0.000175077,0.5000651,0.0021599063,0.0008682526,0.000019815192,0.000089743626,0.000095683004,0.00004900166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939086,0.000052117928,0.00080846064,0.0026625681,0.0015070874,0.0010611907],"domain_scores_gemma":[0.9969835,0.0004006373,0.00034131628,0.0018789207,0.00013622978,0.00025934647],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017686058,0.00074042747,0.00060020055,0.002255724,0.0005020547,0.0022584144,0.005096751,0.00036894073,0.00002008723],"category_scores_gemma":[0.0000695138,0.0007064757,0.00021985683,0.0026054808,0.00042889387,0.0018338138,0.0020389415,0.0013472417,0.000058341608],"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.0000042953843,0.000056904333,0.00010079653,0.000092472816,0.000024012865,0.00016223243,0.00064168614,0.00036098904,0.0003139615,0.39723152,0.0001378334,0.6008733],"study_design_scores_gemma":[0.00021211743,0.00027897212,0.0000592717,0.0007174167,0.000021128522,0.000077829354,7.672597e-7,0.45435542,0.0003434128,0.5295515,0.013266295,0.0011158683],"about_ca_topic_score_codex":0.000035373443,"about_ca_topic_score_gemma":0.00006670313,"teacher_disagreement_score":0.59975743,"about_ca_system_score_codex":0.00029170976,"about_ca_system_score_gemma":0.00018951163,"threshold_uncertainty_score":0.99953866},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20177695,0.00008959518,0.7802694,0.01397824,0.0008975969,0.0004534786,0.00005342905,0.00090580847,0.0015755214],"genre_scores_gemma":[0.97238123,0.000010496151,0.026054308,0.001339485,0.00012506345,0.000029931376,0.000022329572,0.0000067939,0.000030354404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991581,0.000051127186,0.00011548253,0.00026505307,0.0002068776,0.00020335036],"domain_scores_gemma":[0.9991789,0.00012226791,0.000029079343,0.0005483743,0.00004174853,0.000079646794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028542275,0.000083655505,0.00007720595,0.000072693125,0.00018887142,0.00021554947,0.00084070757,0.00003252028,0.0000098736955],"category_scores_gemma":[0.000035641293,0.00005754509,0.000051621577,0.0011007318,0.000026900298,0.0002189981,0.00047810766,0.00010589769,0.000665046],"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.000004929865,0.000040469276,0.00078685215,0.000014037218,0.000013649178,0.000026266458,0.009219037,0.00059530477,0.000099717814,0.8459861,0.12156871,0.021644885],"study_design_scores_gemma":[0.0005526122,0.00013528502,0.06392787,0.000046213478,0.000008952362,0.000031752228,0.00044459687,0.20662427,0.0005551373,0.124339014,0.60282975,0.00050453003],"about_ca_topic_score_codex":0.00003504517,"about_ca_topic_score_gemma":0.000024039835,"teacher_disagreement_score":0.7706043,"about_ca_system_score_codex":0.000008435791,"about_ca_system_score_gemma":0.000026475123,"threshold_uncertainty_score":0.8548043},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032844057,0.0017216015,0.96958613,0.00073999306,0.00050532515,0.000031981202,0.0000047253047,0.0008113146,0.02331452],"genre_scores_gemma":[0.9600818,0.00003523589,0.03949674,0.00024342844,0.0000521398,0.0000022086442,0.0000030188278,0.0000028918225,0.00008250828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995268,0.00000836914,0.00006079987,0.00019907649,0.00009221498,0.00011272927],"domain_scores_gemma":[0.99963105,0.00003507157,0.000003817351,0.00028212316,0.0000060645184,0.000041900148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009688868,0.00004998208,0.000039176226,0.00008440679,0.000037935475,0.0003008312,0.0003637366,0.000016566815,0.00008806089],"category_scores_gemma":[0.0000038125463,0.000038218932,0.000043152828,0.00035627207,0.000010534883,0.00042628264,0.00018372296,0.00007659447,0.00017395588],"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":[2.5041638e-7,0.000009658333,0.00008434119,0.000010982156,0.0000051725087,0.000033670112,0.0001601301,0.000001230263,0.00009541598,0.9495862,0.004208611,0.045804344],"study_design_scores_gemma":[0.00015731415,0.000068440546,0.002596078,0.000053135238,0.000007560646,0.00012887412,0.000015902304,0.27002072,0.003782825,0.24706432,0.47570273,0.00040209366],"about_ca_topic_score_codex":0.00005260726,"about_ca_topic_score_gemma":0.000025777013,"teacher_disagreement_score":0.9567974,"about_ca_system_score_codex":0.0000045903316,"about_ca_system_score_gemma":0.000011457967,"threshold_uncertainty_score":0.2900922},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056900255,0.003794442,0.93818,0.000047501377,0.00014976408,0.00020139998,0.000005106794,0.0005355667,0.00018590874],"genre_scores_gemma":[0.8572207,0.00011909667,0.14254071,0.0000082495935,0.000051133273,0.000034759894,0.0000052740397,0.000018519706,0.0000015360911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831086,0.000030464813,0.0004750487,0.00052502024,0.00022619641,0.00043240964],"domain_scores_gemma":[0.99927515,0.00024884104,0.000029772114,0.00029869316,0.000022625629,0.00012491121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008143333,0.00023714143,0.0003167238,0.0003645175,0.00006908896,0.0004969385,0.00030981086,0.00014525549,0.000001378341],"category_scores_gemma":[0.000033304965,0.00021585792,0.000086298634,0.00076162897,0.000025020156,0.00041656705,0.00016056983,0.0005366904,0.0000028546242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.712155e-7,0.000092484464,0.000015540452,0.004140802,0.000023049522,0.000013046434,0.0048507983,0.38504946,0.00009797564,0.60543126,0.000003629033,0.00028095866],"study_design_scores_gemma":[0.000087273176,0.000019511293,0.000003560491,0.0015040946,0.0000075983535,0.000044259785,0.0001477805,0.9586573,0.000022282837,0.039174292,0.00009384878,0.00023819937],"about_ca_topic_score_codex":0.00006148471,"about_ca_topic_score_gemma":0.0000052377363,"teacher_disagreement_score":0.80032045,"about_ca_system_score_codex":0.000019922687,"about_ca_system_score_gemma":0.00001698272,"threshold_uncertainty_score":0.880243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006687243,0.009903706,0.62210476,0.003560474,0.00928154,0.0016481217,0.0037424038,0.017815795,0.33187634],"genre_scores_gemma":[0.5498847,0.13367775,0.057035152,0.0047839344,0.01231089,0.00048037118,0.05798877,0.0021750298,0.18166342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970062,0.000022515036,0.0004303181,0.0014677638,0.0005007658,0.00057246437],"domain_scores_gemma":[0.9945675,0.00017311264,0.0002754968,0.00482928,0.000053278778,0.00010129993],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00038662014,0.00051847694,0.00053457345,0.0002639056,0.0002482872,0.00039064873,0.0065967706,0.00087948923,0.00003900117],"category_scores_gemma":[0.0000133103795,0.0005215431,0.00017408695,0.00026938537,0.0003345313,0.00064863364,0.008224308,0.0013113425,0.00024460987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056355952,0.000020437139,0.000020351608,0.00003088897,0.00008890791,0.00012714992,0.000046682155,0.000015138801,3.7597096e-7,0.8734947,0.06791481,0.058234967],"study_design_scores_gemma":[0.0003039324,0.0000675142,0.00002479366,0.00037285354,0.00005280899,0.000047588783,0.000034958262,0.12654361,0.000004111025,0.43844157,0.43298787,0.0011183784],"about_ca_topic_score_codex":0.000020365003,"about_ca_topic_score_gemma":0.00019851612,"teacher_disagreement_score":0.5650696,"about_ca_system_score_codex":0.000044093118,"about_ca_system_score_gemma":0.000069214686,"threshold_uncertainty_score":0.999797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005063984,0.0011466823,0.9867252,0.0012186915,0.0058454564,0.00063915894,0.00012730698,0.00066751934,0.0035793062],"genre_scores_gemma":[0.44456127,0.00017947872,0.54067993,0.009257695,0.004151916,0.00013155001,0.00010700848,0.00025982547,0.0006713411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99488646,0.000037721486,0.00059066765,0.0024362463,0.0012519676,0.0007969381],"domain_scores_gemma":[0.99668986,0.00040657274,0.00018430501,0.0019293703,0.00038189173,0.00040802636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083891774,0.00068569626,0.0006069072,0.0017965337,0.00039695788,0.0011671786,0.0030675037,0.00042683873,0.00006510919],"category_scores_gemma":[0.00008415689,0.0006197066,0.0002589942,0.0019603446,0.0004444909,0.0008098675,0.002214897,0.0012572267,0.00067773403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015502887,0.00004809907,0.000010064369,0.000117013835,0.000037657268,0.00034311484,0.0012512413,0.0033153568,0.00027482084,0.76576495,0.001589593,0.22723258],"study_design_scores_gemma":[0.00022604327,0.0005383953,0.000180013,0.0016587784,0.000038048292,0.00024490536,9.75077e-7,0.10498876,0.00029464546,0.7982258,0.0922486,0.0013550307],"about_ca_topic_score_codex":0.000035647165,"about_ca_topic_score_gemma":0.00023070212,"teacher_disagreement_score":0.4460453,"about_ca_system_score_codex":0.00021877026,"about_ca_system_score_gemma":0.0004593236,"threshold_uncertainty_score":0.9998697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08233087,0.0002444149,0.91459656,0.0008413246,0.00027606438,0.0005001487,0.000394496,0.000488458,0.0003276621],"genre_scores_gemma":[0.6889089,0.00011087706,0.30986908,0.00021513525,0.00011101547,0.00003410166,0.0006895515,0.0000128967,0.000048459988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986892,0.000027223121,0.00013299832,0.0005768485,0.00025599945,0.00031777023],"domain_scores_gemma":[0.99861246,0.00017860655,0.000033678363,0.001004945,0.00006123138,0.00010909835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005991652,0.00010372419,0.00011194386,0.000359242,0.00019151076,0.00021974521,0.00096999784,0.000057775345,0.000014508234],"category_scores_gemma":[0.00012194074,0.00008788123,0.000031165368,0.0020981554,0.000039198956,0.0004341359,0.0012425056,0.000091519796,0.000019142502],"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.000013074697,0.000041636467,0.00042416828,0.00009600961,0.000023855268,0.0000043810346,0.00042226922,0.000044550616,0.0011569116,0.9561645,0.020844743,0.02076391],"study_design_scores_gemma":[0.00053661823,0.0000741979,0.004479536,0.000010177799,0.0000063450257,0.000008494689,0.00011082912,0.94667935,0.0005294241,0.023045702,0.02432936,0.00018998096],"about_ca_topic_score_codex":0.00003936371,"about_ca_topic_score_gemma":0.000027818458,"teacher_disagreement_score":0.94663477,"about_ca_system_score_codex":0.000009025417,"about_ca_system_score_gemma":0.00004005243,"threshold_uncertainty_score":0.35836923},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21706346,0.000048268525,0.7789832,0.0010303007,0.00014109122,0.0001666038,0.0000031638056,0.00064594933,0.0019180108],"genre_scores_gemma":[0.9575597,0.000015732194,0.042178784,0.00011375976,0.000036754183,0.000021170023,0.000017891694,0.000007242256,0.000048987495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999014,0.000035291378,0.00013627825,0.00035005884,0.00015076355,0.000313588],"domain_scores_gemma":[0.9994239,0.00017499078,0.000033529115,0.00023159572,0.000047613725,0.00008834251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005501374,0.0000956583,0.00011662676,0.00013557178,0.00040248575,0.0003886288,0.00044649933,0.00004123129,0.000012328642],"category_scores_gemma":[0.0002504929,0.00008538296,0.000047848476,0.00067315565,0.000023697856,0.00022335033,0.00069864054,0.00010370325,0.000008210263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039905757,0.00009518263,0.0017590557,0.00021750553,0.000081275444,0.00002932081,0.026757855,0.004669874,0.0047187037,0.4725921,0.013251403,0.47578785],"study_design_scores_gemma":[0.00038710728,0.00006964274,0.0042821323,0.00002061384,0.0000031840934,0.0000048863653,0.00062433723,0.97117335,0.0006931031,0.006646678,0.015926527,0.00016845392],"about_ca_topic_score_codex":0.000032738422,"about_ca_topic_score_gemma":0.000008309164,"teacher_disagreement_score":0.96650344,"about_ca_system_score_codex":0.0000065191357,"about_ca_system_score_gemma":0.00003511872,"threshold_uncertainty_score":0.37475565},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7791736,0.00019504063,0.21132293,0.0015566444,0.0006353324,0.00024485,0.00011410055,0.0010339526,0.005723547],"genre_scores_gemma":[0.9319729,0.00016132864,0.06642902,0.00076522114,0.00032606,0.000010376266,0.00022611207,0.000016094089,0.00009288714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986638,0.000046268986,0.00015781628,0.00058999954,0.00025854976,0.00028355926],"domain_scores_gemma":[0.9972338,0.00018258193,0.000034727884,0.0024114475,0.00002275842,0.000114704155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053260534,0.00010689116,0.000108419976,0.00016469111,0.00014331893,0.0002457502,0.002325322,0.000044024117,0.00010127168],"category_scores_gemma":[0.00016328534,0.000091316826,0.000025434343,0.000983459,0.00004522503,0.00048058236,0.007785873,0.00010380871,0.00008598364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016874375,0.00020213316,0.013076293,0.000100730496,0.000058731042,0.00010953833,0.002493619,0.00019183086,0.0012968925,0.61241335,0.3437602,0.026279835],"study_design_scores_gemma":[0.000330985,0.000021201266,0.049097355,0.000020194693,0.000005616495,0.0000078575395,0.000069277805,0.89915675,0.00011300154,0.014543037,0.036397167,0.00023757602],"about_ca_topic_score_codex":0.00013333905,"about_ca_topic_score_gemma":0.00004402501,"teacher_disagreement_score":0.8989649,"about_ca_system_score_codex":0.000005257457,"about_ca_system_score_gemma":0.000027249449,"threshold_uncertainty_score":0.9704533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36349794,0.000014018638,0.6348483,0.0003142728,0.0003124455,0.00008008805,0.00000669723,0.0005670748,0.00035915204],"genre_scores_gemma":[0.9893049,0.0000075920616,0.010220442,0.0002935241,0.00008730323,0.000009539646,0.00003765167,0.000007800906,0.000031258565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985675,0.000060647268,0.00017179652,0.00047658317,0.00034832596,0.00037513796],"domain_scores_gemma":[0.99883705,0.00005908533,0.000030200003,0.0008617263,0.000036273705,0.00017565637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019618166,0.0001405918,0.00013306552,0.00017954831,0.00015258924,0.00020099018,0.00095166726,0.00006934774,0.00015112293],"category_scores_gemma":[0.000010451829,0.0001168431,0.00009790211,0.0008645772,0.000086339875,0.0003521362,0.0006669592,0.0001366307,0.00031901425],"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.000015045823,0.00032401845,0.0008506087,0.000016963359,0.000020352662,0.000023156952,0.00067214377,0.00027447075,0.0008898343,0.9845844,0.0038490314,0.008479972],"study_design_scores_gemma":[0.0012498011,0.00016088282,0.08572381,0.000019193058,0.000010372223,0.000012658907,0.0002740855,0.88344234,0.0020713264,0.021318289,0.0051028035,0.0006144217],"about_ca_topic_score_codex":0.000085405634,"about_ca_topic_score_gemma":0.000038159193,"teacher_disagreement_score":0.96326613,"about_ca_system_score_codex":0.000016828108,"about_ca_system_score_gemma":0.000037546175,"threshold_uncertainty_score":0.47647232},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078298186,0.00066090724,0.98950416,0.00023996727,0.006173091,0.00032786425,0.000027327755,0.00030789262,0.0019757964],"genre_scores_gemma":[0.55269694,0.000065702385,0.44431442,0.0015946131,0.0011640561,0.000007961724,0.00002776135,0.00006280319,0.000065741195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641067,0.000029560853,0.00050032267,0.0015069889,0.00081083365,0.00074161915],"domain_scores_gemma":[0.99785894,0.00026075504,0.00021653743,0.001311849,0.00012940969,0.00022249609],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093863066,0.0005393922,0.00046148896,0.001201122,0.00024281119,0.0010617151,0.0023890354,0.00034643998,0.000015406094],"category_scores_gemma":[0.000056289315,0.0004988774,0.00021100427,0.00096730585,0.00055226265,0.0014460721,0.0018468099,0.0011389108,0.00006286093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018893214,0.0000721646,0.00019847768,0.00018413624,0.000068746296,0.00032392307,0.0033573706,0.0073341443,0.0008627688,0.75566196,0.00012527392,0.23179217],"study_design_scores_gemma":[0.00019657175,0.00013665934,0.000099917655,0.0008338858,0.000021527054,0.00027308348,4.208719e-7,0.47613034,0.0014096919,0.5081371,0.011900166,0.00086064055],"about_ca_topic_score_codex":0.000054004777,"about_ca_topic_score_gemma":0.00008730872,"teacher_disagreement_score":0.551914,"about_ca_system_score_codex":0.00033764503,"about_ca_system_score_gemma":0.0002726482,"threshold_uncertainty_score":0.99997526},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018265238,0.0010041664,0.97706985,0.0011240949,0.0007992739,0.00018427566,0.00003213566,0.00053123094,0.0009897484],"genre_scores_gemma":[0.73600113,0.00007820042,0.2636428,0.00006970823,0.00011776972,0.000026468942,0.00004883398,0.0000116578285,0.000003417755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713016,0.0010373904,0.00041995113,0.00069644046,0.00026541183,0.00045063757],"domain_scores_gemma":[0.99798137,0.0011126649,0.000069552705,0.0005843058,0.00011584684,0.00013627509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004881638,0.00018667453,0.00022472977,0.00039746056,0.00029064744,0.00078630965,0.00044960034,0.00014247072,0.000058502817],"category_scores_gemma":[0.00088519417,0.00019519888,0.00012253948,0.0023886873,0.00009913823,0.0020507902,0.0003603808,0.00064527936,0.000069142414],"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.000010488321,0.0001846735,0.003135452,0.000057198362,0.000033434404,0.00013647105,0.0024729457,0.000022326387,0.0004987175,0.9699631,0.0026382105,0.020847037],"study_design_scores_gemma":[0.0007110077,0.00016721012,0.15618548,0.00032642332,0.00006751116,0.00029849535,0.00037353334,0.624812,0.00068237394,0.190232,0.024844581,0.0012993738],"about_ca_topic_score_codex":0.00074516714,"about_ca_topic_score_gemma":0.002099085,"teacher_disagreement_score":0.77973104,"about_ca_system_score_codex":0.000105752675,"about_ca_system_score_gemma":0.0002484043,"threshold_uncertainty_score":0.7959979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010320195,0.002336203,0.9676427,0.015989732,0.0009152377,0.00009860144,0.0000019759646,0.00007635137,0.002618992],"genre_scores_gemma":[0.64066166,0.00019580603,0.3583683,0.00025085537,0.00047410684,0.000007738254,5.886178e-7,0.000015282008,0.000025631329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851686,0.00012963622,0.00057741796,0.00015377496,0.0003346889,0.00028762364],"domain_scores_gemma":[0.9985163,0.0007799987,0.00014152503,0.00034285957,0.000096501455,0.00012278798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011822279,0.00011669934,0.0002536932,0.00012086136,0.00012899956,0.0003786848,0.0011761526,0.00008354484,0.00002686625],"category_scores_gemma":[0.00017846825,0.00006234805,0.00022611368,0.00034657004,0.00010413142,0.0004905431,0.00021407692,0.00044107626,0.000104898725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009532395,0.00005562973,0.000020759153,0.000056410445,0.000050146966,0.00015060781,0.00041604476,3.374633e-7,0.00010012035,0.9757548,0.009010905,0.014374707],"study_design_scores_gemma":[0.00012368397,0.0001785791,0.00008972273,0.00006679125,0.0000207193,0.0017964229,0.00009389564,0.0021703227,0.00010025839,0.9709809,0.024298497,0.00008024236],"about_ca_topic_score_codex":5.802695e-7,"about_ca_topic_score_gemma":0.0000019686852,"teacher_disagreement_score":0.6303415,"about_ca_system_score_codex":0.000020255893,"about_ca_system_score_gemma":0.00009221123,"threshold_uncertainty_score":0.36516663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19687974,0.0006385669,0.79967284,0.00043381,0.0010490465,0.00021502453,0.00029897876,0.0006761525,0.00013585085],"genre_scores_gemma":[0.9787172,0.000068791756,0.020568473,0.0004755043,0.000099123325,0.0000042722636,0.00004271849,0.000021262193,0.00000265612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743694,0.00014953768,0.0003818149,0.001141582,0.00044488636,0.00044525316],"domain_scores_gemma":[0.99725205,0.00052100164,0.000072632385,0.0019269717,0.00005373629,0.00017359131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007299281,0.0002974938,0.00025689125,0.0003390746,0.00054320105,0.0009383724,0.0022722676,0.00012635872,0.000048098813],"category_scores_gemma":[0.00000472636,0.00029090059,0.000100147896,0.0011387275,0.00005857316,0.001151942,0.00021703822,0.0005610993,0.000026434944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003606414,0.0029699253,0.0033439174,0.011656827,0.0019916163,0.00096689374,0.08780506,0.16232942,0.006113508,0.042924363,0.0046180077,0.67491984],"study_design_scores_gemma":[0.00030126565,0.000038430702,0.001214213,0.0003585887,0.000041471416,0.0000326369,0.00012460178,0.9935854,0.00037390753,0.00080367026,0.0028018681,0.0003239615],"about_ca_topic_score_codex":0.00045811269,"about_ca_topic_score_gemma":0.00027631214,"teacher_disagreement_score":0.831256,"about_ca_system_score_codex":0.000033777444,"about_ca_system_score_gemma":0.00005403519,"threshold_uncertainty_score":0.99995434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06821641,0.0012506418,0.92800844,0.001003946,0.0006843983,0.00016278622,0.00006319878,0.0004103588,0.00019983486],"genre_scores_gemma":[0.93653405,0.00029429444,0.062839955,0.00018047598,0.0001065739,0.0000028034835,0.0000140117,0.000018808209,0.000009026236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784523,0.00013229344,0.00031173285,0.0009967056,0.00030924848,0.00040477767],"domain_scores_gemma":[0.99783653,0.0008197502,0.000053394684,0.0010654569,0.000035435707,0.00018943405],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000671089,0.0002506185,0.00023515488,0.00025725382,0.00058812276,0.0011091412,0.00078769174,0.0001335323,0.000035551333],"category_scores_gemma":[0.000036469173,0.00023591984,0.0000628732,0.0006088228,0.00007068094,0.0022365302,0.00016478219,0.00075894577,0.000009453893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015858751,0.0009096025,0.0008959547,0.0018544357,0.00091583154,0.0014259481,0.01245489,0.0019194451,0.006871047,0.17720047,0.008890017,0.7865038],"study_design_scores_gemma":[0.0003366602,0.000093156115,0.0003962513,0.00036375245,0.000067517176,0.00041753682,0.00012510103,0.9837071,0.00064706884,0.0024013014,0.011026854,0.00041771313],"about_ca_topic_score_codex":0.00012465939,"about_ca_topic_score_gemma":0.0000837683,"teacher_disagreement_score":0.9817876,"about_ca_system_score_codex":0.00001964903,"about_ca_system_score_gemma":0.00011393335,"threshold_uncertainty_score":0.9999278},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022948555,0.021793377,0.7108299,0.00095413614,0.0053443103,0.0008900916,0.00057168794,0.0008358491,0.25855115],"genre_scores_gemma":[0.56800926,0.04775365,0.05281896,0.0033980804,0.033115115,0.00019964541,0.018761534,0.0017839137,0.27415985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965714,0.000056770787,0.00050987926,0.0016101077,0.0006059144,0.0006459131],"domain_scores_gemma":[0.9938477,0.00023178417,0.000116463634,0.005562622,0.000053084554,0.00018833559],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00093019067,0.00047069762,0.0005336001,0.00038314995,0.00011449555,0.00061274605,0.0087309405,0.00058980094,0.00012370311],"category_scores_gemma":[0.000012110536,0.00048111787,0.00014362983,0.00035722498,0.00012137426,0.00072401937,0.014434123,0.002141365,0.00014105927],"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.00001212383,0.000028678161,0.00003074746,0.00015868871,0.000069151574,0.00059150124,0.00033039975,0.001147182,8.896934e-7,0.9272241,0.042483207,0.02792332],"study_design_scores_gemma":[0.00018083867,0.000024988454,0.000034142413,0.0009076845,0.000020598642,0.000017317789,0.0000068484337,0.63644165,7.6538083e-7,0.06245997,0.29932603,0.0005791331],"about_ca_topic_score_codex":0.00012960777,"about_ca_topic_score_gemma":0.00045180199,"teacher_disagreement_score":0.86476415,"about_ca_system_score_codex":0.0000774648,"about_ca_system_score_gemma":0.00013219213,"threshold_uncertainty_score":0.999764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38139972,0.002839469,0.6090039,0.0015396719,0.0034364334,0.0005413642,0.00028965282,0.0007329748,0.00021678556],"genre_scores_gemma":[0.9750351,0.000016271779,0.024018673,0.0001560284,0.000486557,0.0000032039084,0.00026815268,0.000015832507,2.122162e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967776,0.0005880431,0.00060320814,0.0011271121,0.0004381569,0.0004658817],"domain_scores_gemma":[0.9951167,0.0008516371,0.00011676168,0.003831539,0.00003178582,0.00005157029],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.004247686,0.00024023135,0.00028714252,0.00034984213,0.0002474725,0.00083745405,0.0055886065,0.000102674116,0.0000064437254],"category_scores_gemma":[0.00019827743,0.00020542029,0.00004453047,0.00236541,0.00014308719,0.0019912876,0.0033704455,0.00064559263,0.0000166956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075797594,0.0004048818,0.020807182,0.0021038167,0.0000834784,0.0023233078,0.0130429985,0.0040772036,0.0001202677,0.8633246,0.0037500907,0.08988639],"study_design_scores_gemma":[0.00025709212,0.00002923635,0.0020244916,0.00072549365,0.000013250562,0.00016204239,0.00082889816,0.98486197,0.000021837966,0.005990329,0.0048275953,0.00025775647],"about_ca_topic_score_codex":0.00064636744,"about_ca_topic_score_gemma":0.0009091435,"teacher_disagreement_score":0.9807848,"about_ca_system_score_codex":0.00011832097,"about_ca_system_score_gemma":0.00021760809,"threshold_uncertainty_score":0.9997916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34586525,0.0009887251,0.19201711,0.18031192,0.005119114,0.0014764926,0.0009850074,0.0013589985,0.27187738],"genre_scores_gemma":[0.99827623,0.0001846868,0.00034662217,0.0009505004,0.00007843931,0.00003438458,0.000064557666,0.000006007313,0.00005855978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986731,0.00006967869,0.00019871791,0.0004915875,0.00039735364,0.00016955429],"domain_scores_gemma":[0.99916893,0.00020998891,0.000041980416,0.00038854554,0.00011987306,0.00007066531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029832224,0.00016162731,0.00009812583,0.00012717782,0.00015349522,0.0008567954,0.0007901576,0.000072787356,0.00029150152],"category_scores_gemma":[0.000036736048,0.00011062339,0.000062051266,0.00021454849,0.00009492168,0.00043584825,0.00014003979,0.00035375773,0.00012803246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014764772,0.000058187077,0.00005219193,0.000011687834,0.000029214692,0.000010492685,0.001383092,0.0000022754946,0.00009614871,0.97906214,0.0065947967,0.012685014],"study_design_scores_gemma":[0.00012481443,0.000103722516,0.0008563636,0.00013844913,0.0000067143333,0.000018173228,0.000070053204,0.053718735,0.000550104,0.8915112,0.052690577,0.000211114],"about_ca_topic_score_codex":0.00008072809,"about_ca_topic_score_gemma":0.00004750425,"teacher_disagreement_score":0.652411,"about_ca_system_score_codex":0.000028114217,"about_ca_system_score_gemma":0.000052021223,"threshold_uncertainty_score":0.8262098},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01743608,0.00029695686,0.97792554,0.0006207884,0.0033720701,0.00015550962,0.0000053327335,0.000054021166,0.0001336959],"genre_scores_gemma":[0.94168967,0.00010166469,0.05774602,0.00006816178,0.0003681574,0.0000029241353,0.000009102286,0.000012111564,0.0000021947794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848366,0.00020188546,0.00041331578,0.00019003822,0.000555451,0.00015567936],"domain_scores_gemma":[0.9988235,0.00014595856,0.00026541742,0.00032072657,0.00036572525,0.00007866939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007466972,0.00014433761,0.000208397,0.00015907057,0.00012521967,0.00069375074,0.0005527163,0.00007368373,0.00002661885],"category_scores_gemma":[0.00008407785,0.0000877933,0.00013846725,0.00072016363,0.00009193451,0.0012105344,0.00009741753,0.00032355855,0.0000013330015],"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.00011084277,0.00012754448,0.0005112256,0.000042635656,0.00018826663,0.000053940625,0.0006650531,0.047217537,0.000052103675,0.94901687,0.0004495315,0.0015644606],"study_design_scores_gemma":[0.0029291278,0.0009048897,0.004672005,0.00044088915,0.00035566525,0.00041330527,0.00007424503,0.83381283,0.00067391666,0.14430694,0.010891687,0.00052448537],"about_ca_topic_score_codex":0.000007981364,"about_ca_topic_score_gemma":6.8374686e-7,"teacher_disagreement_score":0.9242536,"about_ca_system_score_codex":0.000061125465,"about_ca_system_score_gemma":0.0001648819,"threshold_uncertainty_score":0.6689854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07477573,0.00042497888,0.92272866,0.00017228682,0.0003743872,0.00016914516,0.000007733074,0.0010058846,0.00034118295],"genre_scores_gemma":[0.99016064,0.00008381836,0.009566507,0.0000740929,0.000056261022,0.000008634778,0.0000047950066,0.000026106838,0.000019162977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983554,0.00011771988,0.00021197095,0.0006747533,0.00027001966,0.00037011926],"domain_scores_gemma":[0.9993196,0.00022380994,0.000047076697,0.00019667674,0.00008797443,0.00012482944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028711616,0.000248069,0.0002039537,0.00030551216,0.0009078769,0.00085385377,0.00021226,0.000111716094,0.000019805737],"category_scores_gemma":[0.0000030842111,0.00021538796,0.00007763829,0.0011506851,0.000056406647,0.0007386187,0.000007089018,0.00081740716,0.00003458577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031208326,0.0007001911,0.0004086751,0.00068080035,0.0009375083,0.0011478288,0.015649252,0.16987886,0.005927251,0.07723765,0.0008083254,0.72631156],"study_design_scores_gemma":[0.00052070414,0.00059512357,0.00012200053,0.00034097786,0.000053300137,0.00038223193,0.0002996916,0.9834752,0.009603406,0.0017511086,0.002356709,0.00049953413],"about_ca_topic_score_codex":0.00006963041,"about_ca_topic_score_gemma":0.00011699055,"teacher_disagreement_score":0.9153849,"about_ca_system_score_codex":0.000040659223,"about_ca_system_score_gemma":0.00009092534,"threshold_uncertainty_score":0.87832665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097233085,0.0011609328,0.98521006,0.00014918245,0.00033476716,0.0033036028,0.00004024717,0.00006879566,0.000009115446],"genre_scores_gemma":[0.9582659,0.00010271539,0.040885642,0.000019979943,0.00041015953,0.0002767528,0.000020696387,0.000014862298,0.0000032630155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980002,0.00014677388,0.00077154464,0.00038935433,0.00038516134,0.0003069824],"domain_scores_gemma":[0.9987431,0.00027424307,0.00027398416,0.00038919467,0.00017427618,0.00014521155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010353352,0.00017286946,0.00041252314,0.0007213007,0.000086260006,0.0008087977,0.0009467858,0.00013938546,6.640132e-7],"category_scores_gemma":[0.00013503624,0.00013114419,0.00011296715,0.0015558174,0.000041566796,0.00082840346,0.00022862821,0.00042755104,4.8074423e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010844336,0.00545995,0.058831558,0.0071228365,0.0012651813,0.0006461449,0.0026165252,0.0006085659,0.024041416,0.23349479,0.06905975,0.59576887],"study_design_scores_gemma":[0.0009613416,0.0007157761,0.0026583315,0.00066501216,0.000046569683,0.00020625109,0.00000994166,0.9683077,0.00032051705,0.0075508757,0.018303366,0.00025437216],"about_ca_topic_score_codex":0.000027735196,"about_ca_topic_score_gemma":0.000009808779,"teacher_disagreement_score":0.96769905,"about_ca_system_score_codex":0.00005036794,"about_ca_system_score_gemma":0.00013092194,"threshold_uncertainty_score":0.7799255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047111057,0.0031640471,0.98843974,0.0015604335,0.0035817644,0.0004607533,0.000028811919,0.00036730577,0.0019260196],"genre_scores_gemma":[0.57468605,0.0006120179,0.41366813,0.0058142827,0.004528189,0.000059230068,0.0001906427,0.00013664148,0.00030484132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996041,0.00004473038,0.00046367224,0.0017905779,0.001021754,0.0006382948],"domain_scores_gemma":[0.99693257,0.0006327791,0.00019225644,0.0020073745,0.00009398197,0.00014105826],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00090681616,0.00053381175,0.00040364434,0.0003816931,0.00040238307,0.0020709492,0.0047428007,0.00031407014,0.00002829052],"category_scores_gemma":[0.00003503563,0.0003771665,0.0002518381,0.0008129892,0.00073297584,0.0007791173,0.0021175737,0.0014976693,0.00014268301],"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.0000037279394,0.000031262665,0.00012702115,0.000031707845,0.000026027068,0.000060400605,0.0016338985,0.0006918153,0.000063559266,0.17221425,0.00006564777,0.8250507],"study_design_scores_gemma":[0.0001625187,0.000095479096,0.00048307155,0.0006917128,0.000022596716,0.000028666234,3.7173646e-7,0.16966905,0.000119612574,0.8111022,0.017012738,0.00061199],"about_ca_topic_score_codex":0.00015561319,"about_ca_topic_score_gemma":0.0009541405,"teacher_disagreement_score":0.8244387,"about_ca_system_score_codex":0.00014416594,"about_ca_system_score_gemma":0.00022030777,"threshold_uncertainty_score":0.99986804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013737714,0.003472052,0.98561174,0.0009160676,0.004107165,0.00028890168,0.00008361628,0.00042102556,0.0049620545],"genre_scores_gemma":[0.28419697,0.00028364145,0.7084962,0.0038277672,0.0023960688,0.000023943248,0.00010986874,0.00013419108,0.00053134054],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99473345,0.00004302463,0.00063968165,0.002575171,0.0010810422,0.00092762196],"domain_scores_gemma":[0.9963744,0.00078129536,0.00022247687,0.0021473519,0.00017147018,0.00030295036],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010697471,0.00073886255,0.0006576607,0.0009154767,0.00035438,0.002370829,0.0050408267,0.0005363194,0.0001255979],"category_scores_gemma":[0.000053934917,0.000675128,0.0002668265,0.0010718451,0.0009496972,0.0017023816,0.002729372,0.0018590154,0.00031503747],"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.000013469831,0.000060216214,0.00003365222,0.000092115886,0.00004546146,0.000739097,0.0014981448,0.008452555,0.00034945726,0.3047323,0.0003860315,0.6835975],"study_design_scores_gemma":[0.00018100446,0.000090515205,0.00005430189,0.00059843215,0.000016834032,0.00004210341,6.2619176e-7,0.27550298,0.00077486044,0.70265174,0.019285748,0.00080083805],"about_ca_topic_score_codex":0.0002545722,"about_ca_topic_score_gemma":0.0005502298,"teacher_disagreement_score":0.68279666,"about_ca_system_score_codex":0.00026121232,"about_ca_system_score_gemma":0.0006369821,"threshold_uncertainty_score":0.99957},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029458263,0.0014727438,0.019750603,0.011442474,0.0014388284,0.00088676985,0.0007281472,0.0005008088,0.96348506],"genre_scores_gemma":[0.6253085,0.023065617,0.06551489,0.010171846,0.0009858749,0.00086440926,0.0029914817,0.00035376387,0.27074358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985676,0.00003164299,0.00043147913,0.00041758057,0.0003457855,0.00020593892],"domain_scores_gemma":[0.99155426,0.0008280883,0.00026708117,0.007130985,0.00015066228,0.00006889315],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00030246997,0.00026383193,0.0002809416,0.0001542719,0.0005903689,0.00018192336,0.0066256034,0.00030094475,0.00018071904],"category_scores_gemma":[0.00025946496,0.00021900548,0.00027106502,0.00021819684,0.00044839116,0.00030630874,0.0037844384,0.001062197,0.0001640149],"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.0000036873603,0.000043124837,0.000005422691,0.000028671895,0.000069886555,0.0000042116944,0.00036364465,0.000010692392,0.00000544987,0.9904639,0.0075820084,0.0014192861],"study_design_scores_gemma":[0.00013384347,0.00007371559,0.00007890227,0.0006728315,0.000034408884,0.0000034644063,0.000026158586,0.0010686723,0.000044999884,0.20213082,0.79539865,0.00033349876],"about_ca_topic_score_codex":0.00008184692,"about_ca_topic_score_gemma":0.00085496606,"teacher_disagreement_score":0.78833306,"about_ca_system_score_codex":0.00003129574,"about_ca_system_score_gemma":0.00013636905,"threshold_uncertainty_score":0.998749},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016632002,0.0022591972,0.9910632,0.0016622911,0.0009234157,0.0007001984,0.000037206457,0.000073928,0.0016174036],"genre_scores_gemma":[0.9165456,0.000095018026,0.081975944,0.0010595262,0.00024377818,0.000028178338,0.000007782517,0.000025227197,0.00001892088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557936,0.00016707423,0.00075533614,0.0013096222,0.001618913,0.0005697023],"domain_scores_gemma":[0.9953663,0.0018182987,0.00029099372,0.0022524414,0.00020364369,0.00006836159],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.006245197,0.00045086496,0.00053244206,0.00057730713,0.0002800615,0.00063844403,0.0060413782,0.00023510416,0.000007985895],"category_scores_gemma":[0.00021697015,0.0002650497,0.0002546706,0.0014483215,0.0011213573,0.00057390117,0.0018349745,0.0014974412,0.0000085046095],"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.000048782476,0.000095959585,0.00002385007,0.00020307249,0.000021133226,0.000056262765,0.020545503,0.11238364,0.00021632512,0.7860059,0.000067589324,0.08033198],"study_design_scores_gemma":[0.00017580221,0.00007977232,0.000012277035,0.00018723552,0.000008042671,0.000018267789,0.0000015920524,0.52779067,0.000078456025,0.47135615,0.00012334927,0.00016838757],"about_ca_topic_score_codex":0.00008911326,"about_ca_topic_score_gemma":0.0002596203,"teacher_disagreement_score":0.9148824,"about_ca_system_score_codex":0.0000848828,"about_ca_system_score_gemma":0.00054404093,"threshold_uncertainty_score":0.99998015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050430495,0.0011762055,0.9903613,0.0007678207,0.0017242533,0.0005378729,0.0000574476,0.00043969727,0.0044311145],"genre_scores_gemma":[0.44219843,0.00022806908,0.5519444,0.0036003452,0.0012786285,0.000042694148,0.000055416505,0.00016147499,0.000490544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945617,0.000046224926,0.00056446844,0.0025927827,0.0012040087,0.0010308266],"domain_scores_gemma":[0.99695146,0.00036719893,0.000110269364,0.0020254883,0.00023297503,0.00031260503],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009978402,0.0009096583,0.0007102162,0.0012424908,0.0003314198,0.001859175,0.0042581954,0.00037625327,0.00004128047],"category_scores_gemma":[0.00001548546,0.0007260477,0.00025169132,0.001534049,0.0012052587,0.0011607506,0.0011351873,0.0016738558,0.00010247196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004652167,0.000079876394,0.000045746434,0.00013917727,0.00007665365,0.0014174085,0.0028505097,0.015695969,0.00012986524,0.8659561,0.00006314588,0.113499],"study_design_scores_gemma":[0.001414287,0.0013357844,0.00012464997,0.0017656098,0.00010857825,0.0011246685,0.0000016061408,0.3457122,0.0018001241,0.63359034,0.009823331,0.00319881],"about_ca_topic_score_codex":0.00008303584,"about_ca_topic_score_gemma":0.0006382927,"teacher_disagreement_score":0.44169414,"about_ca_system_score_codex":0.00016571351,"about_ca_system_score_gemma":0.0006047549,"threshold_uncertainty_score":0.99951905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016532108,0.00054572447,0.97706383,0.0041561807,0.003588888,0.00034234155,0.00003340862,0.00023393388,0.013870384],"genre_scores_gemma":[0.6173404,0.00020355001,0.3737563,0.0067677093,0.0012889177,0.00004990512,0.0000607521,0.000086526445,0.00044595177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571586,0.000033144366,0.00054548046,0.0019629402,0.001008276,0.0007343015],"domain_scores_gemma":[0.9973423,0.0003296357,0.0000808499,0.0018825518,0.00015287905,0.00021177199],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009375168,0.00054149877,0.00044780338,0.0021263487,0.00027343733,0.0023234836,0.0039929976,0.00035242605,0.00004528375],"category_scores_gemma":[0.00008743964,0.00048848055,0.00017478364,0.001884998,0.0006494986,0.0011861257,0.0016842239,0.0014300152,0.0001850718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034424993,0.00007436042,0.000024572226,0.0000258583,0.000007449004,0.00018516995,0.00068002986,0.0070900954,0.00002107727,0.8621283,0.000085947744,0.1296737],"study_design_scores_gemma":[0.00025645443,0.0003367292,0.00015380055,0.00056126545,0.000005417636,0.000054241584,2.4355577e-7,0.34890643,0.00015264103,0.6212556,0.027425718,0.0008914813],"about_ca_topic_score_codex":0.00005981667,"about_ca_topic_score_gemma":0.0015789913,"teacher_disagreement_score":0.6171751,"about_ca_system_score_codex":0.000293609,"about_ca_system_score_gemma":0.000654229,"threshold_uncertainty_score":0.9997567},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010403117,0.00013713852,0.9862649,0.00082613307,0.0008373816,0.0003639566,0.0008540875,0.00017950653,0.0001337867],"genre_scores_gemma":[0.9914138,0.00021778994,0.007812144,0.00036996804,0.00005353778,0.000029974317,0.000093141534,0.0000060874527,0.0000035885425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989795,0.000014786518,0.00030434655,0.00033271284,0.00016132176,0.0002073266],"domain_scores_gemma":[0.9988678,0.0001410437,0.000053331354,0.00076286145,0.000074412164,0.00010053439],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047680322,0.00014108692,0.00014671055,0.00019366307,0.0003500144,0.0016922344,0.0008660529,0.00007890917,0.000007696185],"category_scores_gemma":[0.000013429774,0.00012894628,0.000049765717,0.00028708237,0.000053370506,0.007959463,0.00007004592,0.00020795244,0.0000031407696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026707913,0.00013049351,0.00030792074,0.0024370563,0.00036893642,0.0000072479197,0.016284518,0.0016194457,0.000061389095,0.6908395,0.020357141,0.26731926],"study_design_scores_gemma":[0.00054307125,0.000061854626,0.00009526259,0.0000797349,0.00003016934,0.000018272682,0.000042191303,0.88744,0.00025462353,0.0842054,0.027040794,0.00018859177],"about_ca_topic_score_codex":0.000084894054,"about_ca_topic_score_gemma":0.000046452617,"teacher_disagreement_score":0.9810107,"about_ca_system_score_codex":0.000014386563,"about_ca_system_score_gemma":0.000033297503,"threshold_uncertainty_score":0.9993441},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432232,0.00018235802,0.054355584,0.0009841798,0.00007308863,0.000113470705,0.000008351473,0.00027795194,0.0007818396],"genre_scores_gemma":[0.9659905,0.00005607593,0.033704843,0.00017321494,0.000027819817,0.000007022942,0.0000064828264,0.000005516441,0.000028553754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988326,0.00007332055,0.00020371366,0.0004467703,0.00018159593,0.0002619891],"domain_scores_gemma":[0.9992474,0.00007625909,0.000048335958,0.00049948215,0.000031921714,0.00009661241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068798574,0.000112917885,0.0001527311,0.00015365139,0.00011570081,0.0003356538,0.00056274584,0.000054313376,0.000014571548],"category_scores_gemma":[0.000110549045,0.00010126624,0.000018700357,0.00089986715,0.00008503837,0.00066341326,0.0015059559,0.000133672,0.0000076952865],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084097475,0.00054332975,0.14339744,0.0020682253,0.000029197547,0.0003304764,0.017599564,0.000024539366,0.020693982,0.56705016,0.020579066,0.22759992],"study_design_scores_gemma":[0.0008914514,0.00004751175,0.8442085,0.000086521264,0.0000034689872,0.000009332794,0.00020699542,0.0491537,0.0012707778,0.10175008,0.0019586033,0.00041306173],"about_ca_topic_score_codex":0.00040213778,"about_ca_topic_score_gemma":0.00016244485,"teacher_disagreement_score":0.700811,"about_ca_system_score_codex":0.000008483675,"about_ca_system_score_gemma":0.00002755843,"threshold_uncertainty_score":0.41295174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111356445,0.000060413622,0.88518405,0.00035543367,0.00086146884,0.000281861,0.00023381994,0.00036258087,0.0013039226],"genre_scores_gemma":[0.9942725,0.00035801894,0.0048009423,0.00039173517,0.00006904862,0.000037152364,0.000057578516,0.0000096082895,0.0000034750983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985024,0.00004061532,0.0003729707,0.00033160867,0.00044078345,0.00031162854],"domain_scores_gemma":[0.9991116,0.00009239861,0.00008285918,0.0004248232,0.00013087962,0.00015747036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024219078,0.00028265218,0.00022572755,0.00030168306,0.00041802932,0.0005534382,0.0002785015,0.00016696379,0.00003244824],"category_scores_gemma":[0.0000029014302,0.00023916183,0.00011171784,0.0005350285,0.00015937549,0.0037517836,0.000009406702,0.00061429245,0.00002765805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005081978,0.00021270665,0.00008917421,0.0009420103,0.00022271076,0.0000195262,0.020384327,0.0015896832,0.000090264846,0.06720636,0.0009086331,0.9078264],"study_design_scores_gemma":[0.0021376659,0.0013739449,0.0015732956,0.0004893378,0.00013093739,0.0001520231,0.00044909393,0.9125022,0.036369245,0.019235136,0.024168177,0.0014188949],"about_ca_topic_score_codex":0.0002253075,"about_ca_topic_score_gemma":0.00046565817,"teacher_disagreement_score":0.9109126,"about_ca_system_score_codex":0.000035578578,"about_ca_system_score_gemma":0.0001226085,"threshold_uncertainty_score":0.97527367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043932223,0.0009082308,0.9882634,0.00064459513,0.0023714488,0.0004078547,0.00008790241,0.0007637532,0.0021595554],"genre_scores_gemma":[0.72065943,0.0001838439,0.27733037,0.0007445664,0.0006758042,0.00010763557,0.00013241748,0.000032338874,0.00013362044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980145,0.000052535823,0.00036528037,0.0006822796,0.0003253326,0.00056009035],"domain_scores_gemma":[0.99881023,0.00030453657,0.000061019477,0.00056431454,0.0001159236,0.00014399909],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005949733,0.00021408465,0.0002559282,0.0002021578,0.00023553454,0.0013652759,0.0010214577,0.00012437582,0.00028520462],"category_scores_gemma":[0.00008154712,0.0001866439,0.00024213889,0.00066562986,0.000047894595,0.0017348012,0.00034860114,0.00025031425,0.00008835454],"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.000028760536,0.0001470685,0.00042737997,0.00025416454,0.00012196428,0.000041525902,0.00082887075,0.000017887314,0.005885309,0.80213827,0.12399661,0.0661122],"study_design_scores_gemma":[0.0012620839,0.00019094435,0.0003578256,0.00023591828,0.00008725609,0.00006486849,0.00020922768,0.24712487,0.019653158,0.16467467,0.56531835,0.00082084653],"about_ca_topic_score_codex":0.000536285,"about_ca_topic_score_gemma":0.00045870672,"teacher_disagreement_score":0.7162662,"about_ca_system_score_codex":0.000055291457,"about_ca_system_score_gemma":0.000113263515,"threshold_uncertainty_score":0.9996714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8183596,0.00019258246,0.14959672,0.0049875323,0.00047597132,0.0002285508,0.000015346819,0.001769628,0.024374023],"genre_scores_gemma":[0.9931422,0.00007586309,0.006360052,0.0003596219,0.000029781786,0.0000034841419,0.0000042488587,0.0000028964953,0.000021878106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993242,0.000013095596,0.00008934421,0.0002713376,0.00012510945,0.00017692383],"domain_scores_gemma":[0.9994263,0.000039655377,0.000018498815,0.00041288955,0.000018192744,0.0000844674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019483826,0.000072278315,0.000072290204,0.000110112625,0.00009268844,0.00013830133,0.00039489218,0.000032159183,0.000043701675],"category_scores_gemma":[0.00001903247,0.000061826395,0.000029946892,0.0004017409,0.000036334874,0.00051991484,0.0006398715,0.000072425704,0.00012917593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011984117,0.0000127642625,0.0025859552,0.0000073557217,0.000004800547,0.000010305601,0.0016982962,2.0411176e-7,0.000075147414,0.98127955,0.0022842959,0.012040131],"study_design_scores_gemma":[0.0005995272,0.00010290065,0.07275756,0.000018951709,0.0000054089573,0.000032251493,0.00015971754,0.03429151,0.0016440022,0.6887802,0.2010901,0.0005179069],"about_ca_topic_score_codex":0.000038064703,"about_ca_topic_score_gemma":0.00001547351,"teacher_disagreement_score":0.29249936,"about_ca_system_score_codex":0.0000022275867,"about_ca_system_score_gemma":0.000006578114,"threshold_uncertainty_score":0.2521207},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036309246,0.003377054,0.9884444,0.00060128566,0.003743891,0.00049826957,0.00007746397,0.00081675017,0.002077817],"genre_scores_gemma":[0.26263475,0.00045067703,0.7309052,0.0037362347,0.0018377362,0.00002686631,0.00007235031,0.00025450648,0.000081693084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938681,0.000051328523,0.0008077578,0.002635515,0.0015386312,0.0010986526],"domain_scores_gemma":[0.99677426,0.00030855936,0.0003322774,0.0018361551,0.00041349762,0.00033523358],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009991415,0.0010166082,0.00084017223,0.0019888235,0.0007281812,0.0030093929,0.003641244,0.0006149406,0.000057698726],"category_scores_gemma":[0.000043286003,0.00094277994,0.00039773778,0.0023906264,0.0016031468,0.0013228472,0.0021926728,0.001786054,0.00008844103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027282213,0.00009152854,0.00013043413,0.00032055334,0.00011066405,0.00088585424,0.0022144655,0.006520388,0.0005575261,0.9058378,0.00026573287,0.083037786],"study_design_scores_gemma":[0.00026214006,0.0002122338,0.000041060634,0.0010364256,0.00003866182,0.00029835358,0.0000011827839,0.3307495,0.0007470602,0.65158373,0.013627841,0.0014018016],"about_ca_topic_score_codex":0.00010517794,"about_ca_topic_score_gemma":0.0003900043,"teacher_disagreement_score":0.32422912,"about_ca_system_score_codex":0.0002700498,"about_ca_system_score_gemma":0.0008511076,"threshold_uncertainty_score":0.99930227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06223715,0.00011921279,0.9349414,0.0009824493,0.0006435228,0.000114080445,0.000021246198,0.00043797176,0.0005029685],"genre_scores_gemma":[0.8381374,0.000013954365,0.16146272,0.00030168597,0.00007049923,0.0000042200863,0.0000039909633,0.000005307034,2.4774334e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979346,0.00008042908,0.0002250411,0.0008177084,0.0005477966,0.00039446665],"domain_scores_gemma":[0.9989037,0.00022593094,0.000030649564,0.000572969,0.00006598749,0.00020076812],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013108443,0.00017103259,0.00014471223,0.0003047674,0.0003745714,0.001526677,0.0012336904,0.000053259257,0.000034278506],"category_scores_gemma":[0.000023708999,0.00014613534,0.000057512698,0.0015195173,0.0015793943,0.001521098,0.00089618034,0.00021141398,0.000022051094],"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.000006472432,0.000027359172,0.00003144093,0.000034928496,0.0000027210797,0.000022507804,0.00020863289,0.000037034726,0.0022004775,0.9683544,0.000018192926,0.029055828],"study_design_scores_gemma":[0.0001089616,0.00012459526,0.001022162,0.00007220538,0.000004172506,0.000033490414,0.0000027397364,0.7853988,0.00064915547,0.21218841,0.00022358132,0.00017176289],"about_ca_topic_score_codex":0.0000026657067,"about_ca_topic_score_gemma":0.0000035460416,"teacher_disagreement_score":0.7853617,"about_ca_system_score_codex":0.00004247223,"about_ca_system_score_gemma":0.00007294556,"threshold_uncertainty_score":0.9995098},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013841312,0.00007216341,0.9812859,0.00047908968,0.0014548121,0.00021586487,0.0019517033,0.00045129962,0.00024782497],"genre_scores_gemma":[0.9899929,0.00011008895,0.008902222,0.0004265721,0.000060677212,0.0000054363654,0.00049421744,0.000007108928,7.598757e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983764,0.00004976572,0.00047805253,0.0003922964,0.00039009622,0.00031333187],"domain_scores_gemma":[0.9986021,0.00017625392,0.00007292541,0.0008518861,0.00013008558,0.00016675766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038612453,0.00024126389,0.00021584204,0.00017239517,0.00047512152,0.0008674422,0.0005837549,0.0001636738,0.000024975921],"category_scores_gemma":[0.000015582058,0.0002265075,0.00009699073,0.000693574,0.00016353464,0.004490306,0.000045937923,0.0005546281,0.000023737843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015756188,0.0002837582,0.00003869108,0.0007482227,0.00032310202,0.000019151123,0.016625974,0.0018731456,0.00015476887,0.6490883,0.010929274,0.31975803],"study_design_scores_gemma":[0.00046039338,0.000121861565,0.00023777828,0.000099196084,0.00004884866,0.000030141771,0.00015556885,0.9176749,0.0016829423,0.044176687,0.034876112,0.00043559354],"about_ca_topic_score_codex":0.000067138826,"about_ca_topic_score_gemma":0.000101525715,"teacher_disagreement_score":0.9761516,"about_ca_system_score_codex":0.000039654304,"about_ca_system_score_gemma":0.00008009473,"threshold_uncertainty_score":0.92367077},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16856436,0.004023098,0.8209162,0.0048803,0.0012037769,0.00011650218,0.0000102806625,0.000046762798,0.00023871796],"genre_scores_gemma":[0.99650687,0.0010679462,0.001866459,0.0002637587,0.00027811012,0.0000014434069,0.0000010586903,0.000005278463,0.000009078373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847263,0.00014230215,0.0005441535,0.00022104802,0.00041463887,0.0002052505],"domain_scores_gemma":[0.99900615,0.00016804242,0.000159815,0.0004230659,0.00009534703,0.00014757836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001468345,0.00013856818,0.00020902048,0.00012138167,0.00018526061,0.00074427854,0.0009537455,0.000071212824,0.000037250215],"category_scores_gemma":[0.000037495225,0.00008848362,0.00024922434,0.00034021214,0.00014490065,0.0012800168,0.0001590631,0.0005122847,0.0000068871263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001666005,0.0002534501,0.0005255252,0.0003607649,0.0004923796,0.0004962524,0.00771776,0.000007331051,0.0035175858,0.5849704,0.005869943,0.39562201],"study_design_scores_gemma":[0.0013667623,0.00037319376,0.021567773,0.00041623256,0.00029437087,0.0027137988,0.00028480755,0.010124722,0.008296603,0.59115094,0.36281356,0.0005972212],"about_ca_topic_score_codex":0.00009719947,"about_ca_topic_score_gemma":0.00002033935,"teacher_disagreement_score":0.8279425,"about_ca_system_score_codex":0.00001576277,"about_ca_system_score_gemma":0.000116053016,"threshold_uncertainty_score":0.7177095},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8978592,0.0018584662,0.09824581,0.00175036,0.00007592396,0.0000969522,0.00002269579,0.000019534844,0.00007106288],"genre_scores_gemma":[0.9894411,0.000282428,0.010226088,0.000025649624,0.000020173638,7.4436764e-7,7.5035126e-7,0.000002404748,6.812135e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993512,0.000021618524,0.00027740604,0.00012014097,0.00012138374,0.000108251625],"domain_scores_gemma":[0.9993274,0.000013624053,0.00028494585,0.00023334847,0.00006809464,0.00007256472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015521442,0.000073010684,0.00021431233,0.0003497834,0.00006627034,0.000013661949,0.00029546954,0.000103069404,0.0000022984298],"category_scores_gemma":[0.000027193575,0.00006208265,0.00003583506,0.00037396277,0.00046877394,0.00042523042,0.00010345378,0.0002133585,1.5191516e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050717153,0.00014213928,0.004548282,0.00011168418,0.00007600585,0.0003612233,0.0021663841,7.343581e-7,0.0024209763,0.94310546,0.000105487146,0.046910882],"study_design_scores_gemma":[0.0072567244,0.007818847,0.015443979,0.0009326838,0.00011426195,0.043997504,0.0010676801,0.00022646127,0.1059408,0.77378833,0.042612612,0.0008001029],"about_ca_topic_score_codex":0.000115312556,"about_ca_topic_score_gemma":0.00004231595,"teacher_disagreement_score":0.16931714,"about_ca_system_score_codex":0.000005156575,"about_ca_system_score_gemma":0.000103242484,"threshold_uncertainty_score":0.25316566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000748351,0.00026193343,0.9950012,0.0026438662,0.00013758191,0.0005697753,0.00052791164,0.00003032271,0.00007903241],"genre_scores_gemma":[0.98095024,0.0001800211,0.018153222,0.00026160758,0.00022274232,0.00009898697,0.00012993715,0.000002918476,3.1449179e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907875,0.000028193448,0.00049715076,0.000116689516,0.00017200294,0.000107218584],"domain_scores_gemma":[0.999111,0.00018611572,0.00017945186,0.00030501385,0.00014692504,0.000071489645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080360624,0.000072781266,0.00012418453,0.00025695865,0.00009880892,0.0006919442,0.0007508895,0.00005740234,0.000004656633],"category_scores_gemma":[0.00008546759,0.00006272053,0.000032591797,0.00045142462,0.000034052748,0.0062443973,0.00015942061,0.00023990954,0.0000035646376],"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.00002761952,0.000055087625,0.000052736803,0.00022353261,0.000019832638,8.378202e-7,0.0014424053,0.000028327288,0.000011487077,0.933067,0.0033041085,0.061767016],"study_design_scores_gemma":[0.0007107067,0.000074662676,0.00079872186,0.00006384454,0.000020538833,0.00008118859,0.00012895922,0.19082123,0.00002939986,0.2185245,0.5886311,0.00011513435],"about_ca_topic_score_codex":0.000013038559,"about_ca_topic_score_gemma":0.000010793047,"teacher_disagreement_score":0.9802019,"about_ca_system_score_codex":0.00002015433,"about_ca_system_score_gemma":0.00011244968,"threshold_uncertainty_score":0.66724336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11669042,0.00082243414,0.8753284,0.0017258034,0.00036071535,0.0003513551,0.00005335956,0.0013253987,0.0033420757],"genre_scores_gemma":[0.9133554,0.000081172686,0.085859574,0.00026320916,0.0001329813,0.000026263702,0.00008355201,0.000020430769,0.000177389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834585,0.000034875648,0.00021537818,0.00065969187,0.00039370576,0.00035050928],"domain_scores_gemma":[0.99873465,0.00007395784,0.000039894367,0.0008614666,0.00012894631,0.00016111095],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016724775,0.00021579878,0.00016399176,0.00026253334,0.00019224854,0.0010405879,0.0008424144,0.0000666064,0.00024830454],"category_scores_gemma":[0.000009791201,0.0001441336,0.0000695412,0.001532009,0.0001062768,0.0016168804,0.00019915258,0.00020595656,0.0001575091],"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.00006970684,0.00046119952,0.0029981742,0.00015672889,0.00025062033,0.0003984872,0.0013284672,0.00010898699,0.0007093479,0.95587534,0.029753141,0.007889776],"study_design_scores_gemma":[0.0076898183,0.0059371414,0.044546697,0.001997176,0.00086342584,0.003383561,0.0011141662,0.450134,0.028657472,0.060262695,0.38713175,0.008282088],"about_ca_topic_score_codex":0.00019369612,"about_ca_topic_score_gemma":0.0004115306,"teacher_disagreement_score":0.89561266,"about_ca_system_score_codex":0.0000185937,"about_ca_system_score_gemma":0.00021912213,"threshold_uncertainty_score":0.9999964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013588386,0.0008526981,0.9923817,0.0006413124,0.0024180503,0.001062056,0.00021976286,0.00030905163,0.0019795033],"genre_scores_gemma":[0.47566566,0.00006918126,0.52183217,0.0012880454,0.00080039277,0.00009571711,0.000045517023,0.00008771206,0.00011559449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952933,0.000025455005,0.0005212345,0.0022650692,0.001035897,0.00085901545],"domain_scores_gemma":[0.99685764,0.0011214835,0.00011223119,0.0013583779,0.00032665225,0.00022360079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006598729,0.0006834527,0.00066716823,0.0011880208,0.00037568127,0.00073623075,0.0030553872,0.00040184575,0.000016792488],"category_scores_gemma":[0.00007754943,0.0006337968,0.00039450487,0.0009902568,0.0009272787,0.0004357572,0.0010213397,0.0009722301,0.000038997478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006694811,0.00011099339,0.0000011592581,0.00009380115,0.000069077,0.0000633442,0.004234724,0.024789548,0.00007217194,0.75879717,0.000029558876,0.21167153],"study_design_scores_gemma":[0.00036546699,0.00046274444,0.000018296954,0.0005667802,0.000040346134,0.000024923125,0.0000012203559,0.44941682,0.0017282206,0.5449088,0.0017058569,0.0007605168],"about_ca_topic_score_codex":0.00003496765,"about_ca_topic_score_gemma":0.00024348927,"teacher_disagreement_score":0.4755298,"about_ca_system_score_codex":0.000290483,"about_ca_system_score_gemma":0.0006244776,"threshold_uncertainty_score":0.9996113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028497305,0.0042692237,0.9314227,0.032366376,0.00014161224,0.0006919736,0.000720606,0.00038215428,0.001508049],"genre_scores_gemma":[0.9792117,0.00034665628,0.019158758,0.001086849,0.00001919277,0.00006215191,0.000096041935,0.000011792187,0.0000068856098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987547,0.000109240245,0.00030359233,0.00033325353,0.00021633526,0.0002829224],"domain_scores_gemma":[0.99658763,0.0004361889,0.00012985054,0.002457716,0.0002902347,0.00009836302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030826905,0.00016254355,0.00024241666,0.00027630356,0.00023747688,0.00071930286,0.0048787985,0.0000745731,0.00005409547],"category_scores_gemma":[0.000043938748,0.00013437092,0.00012410207,0.0016921738,0.00013349428,0.0018619578,0.0005717171,0.0003269929,0.0000075848357],"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.00031276513,0.0025127553,0.049663693,0.0016525333,0.0020945347,0.00006210395,0.0025353592,0.015011995,0.0032202243,0.5877191,0.2602639,0.07495108],"study_design_scores_gemma":[0.0034074325,0.0010513307,0.17676318,0.0017235917,0.00028980893,0.000061826984,0.00009169425,0.40301126,0.05828549,0.07896523,0.27413648,0.00221269],"about_ca_topic_score_codex":0.00024355942,"about_ca_topic_score_gemma":0.00038520724,"teacher_disagreement_score":0.95071435,"about_ca_system_score_codex":0.000011154566,"about_ca_system_score_gemma":0.00031797244,"threshold_uncertainty_score":0.9066103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015967633,0.009948271,0.9823595,0.0031763718,0.00033593897,0.00032759501,0.00014942898,0.0005031683,0.0016029398],"genre_scores_gemma":[0.5724991,0.0018178431,0.42499432,0.0003278731,0.000057791505,0.00018523143,0.00009410072,0.000014777429,0.000008948643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890715,0.000078051,0.000247647,0.0003985394,0.00009846474,0.00027013486],"domain_scores_gemma":[0.9975493,0.00045094223,0.000046103818,0.0017488273,0.00007388791,0.0001309303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638283,0.00016888078,0.0001547839,0.0003641854,0.00066880294,0.00066531403,0.001735557,0.00009847813,0.0000074678474],"category_scores_gemma":[0.000024067946,0.00016427247,0.00021896842,0.0010897581,0.00028413706,0.000719314,0.00065843243,0.00025720798,0.0000071357977],"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.0000056992462,0.00009592969,0.0001812644,0.00003656708,0.00006859409,7.218236e-7,0.0014139646,7.60304e-7,0.00023530438,0.9618938,0.0036695392,0.03239783],"study_design_scores_gemma":[0.0007428531,0.00014114066,0.0032331673,0.00013003049,0.00009394293,0.000027226755,0.00029939786,0.085307114,0.00022831371,0.18775405,0.7214582,0.0005846025],"about_ca_topic_score_codex":0.000040198014,"about_ca_topic_score_gemma":0.00003780686,"teacher_disagreement_score":0.77413976,"about_ca_system_score_codex":0.000008103286,"about_ca_system_score_gemma":0.00005196426,"threshold_uncertainty_score":0.66988367},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5264938,0.0008263216,0.46864864,0.00025046675,0.0006593427,0.00019594099,0.000082059196,0.0006502677,0.002193165],"genre_scores_gemma":[0.98484796,0.00019662615,0.014502141,0.00013841943,0.000103225524,0.000030843126,0.00015868545,0.000010133472,0.0000119895285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99820256,0.00006322418,0.00034089643,0.00059892883,0.00038035194,0.00041401602],"domain_scores_gemma":[0.9989787,0.00019032441,0.000042642463,0.0006223727,0.00004701678,0.00011894477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005311835,0.00019738787,0.000161934,0.000643132,0.00012110462,0.0006467328,0.000754329,0.000089108544,0.0001672316],"category_scores_gemma":[0.00005025461,0.00017077629,0.000116754796,0.0020103368,0.00013413811,0.0043286206,0.00036449125,0.00031833496,0.000048751834],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009172047,0.000101427744,0.13494481,0.000120775236,0.000026411828,0.000114166265,0.0016749795,0.000033062126,0.00037629894,0.8496689,0.0026142667,0.010315743],"study_design_scores_gemma":[0.00078897097,0.00011770217,0.8168241,0.00019364661,0.000015649639,0.000033728902,0.0002340739,0.11200717,0.0026371104,0.044403054,0.02186258,0.00088224985],"about_ca_topic_score_codex":0.0004935197,"about_ca_topic_score_gemma":0.0019322211,"teacher_disagreement_score":0.80526584,"about_ca_system_score_codex":0.000019242747,"about_ca_system_score_gemma":0.00006309712,"threshold_uncertainty_score":0.6964055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054441663,0.00037933775,0.98853844,0.002820037,0.0008657073,0.00022170797,0.00005691053,0.00039905487,0.0012746473],"genre_scores_gemma":[0.95327747,0.000029053886,0.045958415,0.00028368575,0.00018164741,0.000017694483,0.00006706481,0.000007528454,0.00017745959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902546,0.000024161649,0.00017031906,0.00042224771,0.0001701843,0.00018762451],"domain_scores_gemma":[0.9990953,0.0002733126,0.000020594767,0.00048685423,0.00006255224,0.000061385865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047308256,0.00008869998,0.00008227008,0.00011115756,0.00010915034,0.00044806697,0.00038608882,0.000054613614,0.00004460369],"category_scores_gemma":[0.00007197411,0.00007279302,0.00010373246,0.0006365435,0.000036776233,0.0004352428,0.00009881434,0.0000840102,0.000089891626],"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.0000122149795,0.00002565277,0.000013301663,0.000031330175,0.000011152783,0.0000024492956,0.00020627468,0.0000101589785,0.0013877336,0.96077603,0.02323491,0.01428878],"study_design_scores_gemma":[0.00024995473,0.00013667191,0.0006702921,0.000030933916,0.000015572023,0.000017289902,0.00006275831,0.3322602,0.005449318,0.15902314,0.5017959,0.00028800502],"about_ca_topic_score_codex":0.000036906556,"about_ca_topic_score_gemma":0.000028918892,"teacher_disagreement_score":0.9478333,"about_ca_system_score_codex":0.000017224818,"about_ca_system_score_gemma":0.00006193003,"threshold_uncertainty_score":0.432072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011139186,0.002548886,0.98916626,0.0006917781,0.0013877717,0.0003251672,0.000022874276,0.00038339882,0.005362501],"genre_scores_gemma":[0.18143982,0.00009675281,0.8144429,0.0027278948,0.0009245148,0.000016944326,0.000023547393,0.0000795961,0.0002480846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958858,0.000020203744,0.00039468746,0.0019294939,0.0010877406,0.0006820745],"domain_scores_gemma":[0.99750143,0.0004121698,0.0002106514,0.0015454382,0.00016724908,0.00016305105],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006061845,0.00060521136,0.0004757908,0.0010103395,0.00026538727,0.0012827534,0.003445956,0.00033649226,0.000021558255],"category_scores_gemma":[0.000040394443,0.0004662503,0.00014859473,0.0012127925,0.0007933937,0.00084901036,0.0015502449,0.0014273619,0.000055410826],"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.0000085346,0.000023792962,0.000021032549,0.000117651914,0.0000282603,0.00047997446,0.0012439443,0.0049395226,0.00009294037,0.4245257,0.00008368553,0.56843495],"study_design_scores_gemma":[0.00033080607,0.0004096796,0.00006880436,0.0020122533,0.000026720969,0.0001970607,5.389433e-7,0.24200925,0.0015731222,0.7416217,0.010346343,0.0014037541],"about_ca_topic_score_codex":0.00004618782,"about_ca_topic_score_gemma":0.00029765215,"teacher_disagreement_score":0.5670312,"about_ca_system_score_codex":0.00012105603,"about_ca_system_score_gemma":0.00039499512,"threshold_uncertainty_score":0.9997789},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046702445,0.00060632284,0.9480215,0.0025128669,0.0001233643,0.00036346097,0.000114815564,0.00010214421,0.0014530845],"genre_scores_gemma":[0.99015814,0.00030431457,0.008871555,0.0005021402,0.00007863047,0.000023227693,0.000057157013,0.0000039316974,9.139225e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998862,0.000028893099,0.0004622933,0.000104573024,0.00041727355,0.00012494574],"domain_scores_gemma":[0.99883705,0.00008110885,0.00022132428,0.00023525702,0.00049552217,0.00012974426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004492472,0.00011053078,0.00013881004,0.00026550685,0.00016196618,0.00051857095,0.0003726068,0.00007480007,0.00001380101],"category_scores_gemma":[0.000019642604,0.00008141418,0.00006550039,0.00073185173,0.00006927319,0.0037459817,0.00007912869,0.00031760568,0.000015344302],"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.000035296223,0.00017672994,0.001062841,0.00018472782,0.00008923053,0.000004778569,0.0051389746,0.00008896823,0.000012348085,0.9529697,0.006442696,0.033793762],"study_design_scores_gemma":[0.0017491957,0.00072702207,0.010048325,0.00032830337,0.0001227135,0.00047325867,0.00061265414,0.036153376,0.00019915763,0.17633504,0.7726967,0.00055427366],"about_ca_topic_score_codex":0.0000029891808,"about_ca_topic_score_gemma":0.0000042846077,"teacher_disagreement_score":0.9434557,"about_ca_system_score_codex":0.00002069589,"about_ca_system_score_gemma":0.00012855935,"threshold_uncertainty_score":0.5000592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077452864,0.00022601889,0.9899109,0.0005661566,0.00045700892,0.00022145633,0.00019618275,0.0005681409,0.000108869535],"genre_scores_gemma":[0.7578058,0.000025991008,0.2417125,0.00018277504,0.00009088652,0.00001601378,0.00015450236,0.000007938066,0.0000035525422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987483,0.00003448426,0.00020432836,0.00057560694,0.00018696456,0.00025034253],"domain_scores_gemma":[0.99854755,0.00025070622,0.000021079266,0.0010130265,0.00007170453,0.00009592932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036044238,0.00011582461,0.000107929816,0.00009360747,0.0001516042,0.0005112108,0.0009361093,0.00006727012,0.00005977249],"category_scores_gemma":[0.000120330806,0.000099059704,0.00005562531,0.00046106052,0.00005374587,0.0019474397,0.00048084388,0.00011312581,0.000055625198],"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.0000093661865,0.000074980555,0.00013889864,0.00008783067,0.000026613889,0.000009865519,0.00026557848,0.00005399771,0.0032997304,0.9849699,0.00398873,0.007074485],"study_design_scores_gemma":[0.00016275747,0.000041687603,0.00022787513,0.000048512626,0.000018983279,0.00000925044,0.000013294602,0.92243993,0.0006234691,0.060232136,0.016019072,0.00016304162],"about_ca_topic_score_codex":0.000039041446,"about_ca_topic_score_gemma":0.00007162073,"teacher_disagreement_score":0.9247378,"about_ca_system_score_codex":0.00001585363,"about_ca_system_score_gemma":0.0001108821,"threshold_uncertainty_score":0.4929618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069366983,0.0014090106,0.99541146,0.0013082405,0.0002545002,0.000240798,0.000026585001,0.00031830775,0.00033740283],"genre_scores_gemma":[0.1664237,0.000119063865,0.8329694,0.00029526863,0.00008197341,0.000034722678,0.000011702814,0.0000061091177,0.00005805165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992286,0.000020852849,0.00013125375,0.000344999,0.0000886586,0.00018561837],"domain_scores_gemma":[0.99926716,0.0002787973,0.000015381796,0.00032845448,0.000035594574,0.00007462086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002805466,0.00008980003,0.00009555565,0.00007989686,0.00013015117,0.00033930078,0.00035391844,0.000030608113,0.000015159242],"category_scores_gemma":[0.000030934338,0.00007608213,0.000046600773,0.0003195176,0.000037903083,0.00057100994,0.00016879207,0.00007188605,0.000017814935],"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.0000043918335,0.00003050178,0.00007846657,0.00009895189,0.000016980071,0.000005060904,0.00039468522,0.000026696047,0.00075471814,0.9613792,0.012305175,0.02490523],"study_design_scores_gemma":[0.00029722496,0.00012052733,0.0012514789,0.00013026256,0.000013388351,0.000035388864,0.000032601125,0.79230016,0.0015355437,0.105587475,0.09843254,0.00026341077],"about_ca_topic_score_codex":0.000011874495,"about_ca_topic_score_gemma":0.0000074341306,"teacher_disagreement_score":0.8557917,"about_ca_system_score_codex":0.00000893261,"about_ca_system_score_gemma":0.000034523968,"threshold_uncertainty_score":0.32718852},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015118181,0.008020776,0.47800806,0.0011828367,0.0014834905,0.00018966038,0.00004069577,0.00035395092,0.510719],"genre_scores_gemma":[0.023112386,0.0029097288,0.12956336,0.0024012432,0.006373297,0.00018719924,0.00028516984,0.00033331895,0.8348343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980664,0.000022121347,0.0002815684,0.00089545845,0.0005317787,0.00020262715],"domain_scores_gemma":[0.99882096,0.00012112807,0.00007162413,0.0006654594,0.00012335321,0.00019745975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023060558,0.0003037381,0.00035236363,0.00040384426,0.00012126263,0.0005993883,0.00064199744,0.00030880526,0.00008983653],"category_scores_gemma":[0.000011951421,0.0002700894,0.0002096753,0.00011631649,0.000121756806,0.00046171117,0.00042603092,0.00066434493,0.0001895474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043535356,0.000014951985,0.0000019072451,0.000092388385,0.000039292256,0.00010293279,0.0001271169,8.541061e-7,0.0000018784099,0.99248004,0.006880451,0.00025384725],"study_design_scores_gemma":[0.00009545897,0.00007548888,0.0000057162324,0.00009963717,0.00003336038,0.00004096247,0.00001021503,0.0024964614,6.83355e-7,0.57831067,0.41854593,0.00028541507],"about_ca_topic_score_codex":0.00021207515,"about_ca_topic_score_gemma":0.000052579217,"teacher_disagreement_score":0.41416934,"about_ca_system_score_codex":0.00032294248,"about_ca_system_score_gemma":0.000117104704,"threshold_uncertainty_score":0.99997514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09090915,0.0055531194,0.8975143,0.0016189988,0.0025283408,0.000042879867,0.00000297024,0.00006561888,0.0017646198],"genre_scores_gemma":[0.9030228,0.00061260926,0.09539661,0.00040568656,0.0005232459,0.0000026197943,0.0000021086391,0.000012154897,0.000022146749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998948,0.000059368278,0.00038890055,0.00019733324,0.00018948158,0.0002169256],"domain_scores_gemma":[0.9991769,0.00022211613,0.00012953213,0.00027411635,0.000105293424,0.000092010974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437338,0.00009970012,0.00027424103,0.0003057431,0.000064638625,0.00025397158,0.0008541423,0.000083375,0.0001150671],"category_scores_gemma":[0.00008957412,0.000078672696,0.00018944396,0.0004192481,0.000046711473,0.0011093811,0.0001758208,0.00036901352,0.000024896914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054914897,0.00004081136,0.0009949356,0.00006141517,0.00010582124,0.00035157663,0.00043556152,0.000019291694,0.0009700456,0.97266656,0.0069128703,0.017386215],"study_design_scores_gemma":[0.0014817354,0.00027226028,0.0006423198,0.0001895521,0.000040169176,0.0027099052,0.000043222662,0.009649499,0.0025439179,0.5885124,0.3936721,0.00024287708],"about_ca_topic_score_codex":0.000003668889,"about_ca_topic_score_gemma":0.0000029943224,"teacher_disagreement_score":0.81211364,"about_ca_system_score_codex":0.000020497055,"about_ca_system_score_gemma":0.00010827242,"threshold_uncertainty_score":0.32081795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3002158,0.0001458026,0.6983505,0.00007988395,0.00044309057,0.00018515081,0.000014124357,0.00055708614,0.00000854491],"genre_scores_gemma":[0.84472847,0.000013382434,0.15506403,0.00010542349,0.000047184316,0.000009333238,0.000015148317,0.000015131636,0.0000018714655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986455,0.00007641911,0.00023316515,0.00059917115,0.00017098332,0.00027479345],"domain_scores_gemma":[0.999341,0.0001727207,0.000058382,0.00024093744,0.00007809328,0.000108854285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032861414,0.00018871005,0.00014418992,0.00022541199,0.0008020957,0.00095424504,0.00030792755,0.00008971759,0.0000036586894],"category_scores_gemma":[0.0000014902844,0.00018899664,0.00008062801,0.0006261014,0.000024943927,0.00053804024,0.000007585375,0.00031854343,0.000008616632],"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.00006902452,0.00055802,0.00014734967,0.0013237739,0.00018159715,0.000020839152,0.019423261,0.51704955,0.013732051,0.021470282,0.00001010443,0.42601416],"study_design_scores_gemma":[0.00036086526,0.00012464002,0.000102925835,0.00023066366,0.000015301543,0.000012414787,0.00021154976,0.9933581,0.0046693156,0.0001948701,0.00050713617,0.0002122212],"about_ca_topic_score_codex":0.000040248837,"about_ca_topic_score_gemma":0.000068330024,"teacher_disagreement_score":0.5445127,"about_ca_system_score_codex":0.00002366991,"about_ca_system_score_gemma":0.000022977987,"threshold_uncertainty_score":0.9201807},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.42244e-8,0.0013044218,0.0788175,0.0005340459,0.0006703542,0.000086389686,0.000037141344,0.0003488974,0.9182012],"genre_scores_gemma":[0.00012707419,0.00030891655,0.023527835,0.0008370074,0.00019612367,0.0000059007766,0.00005339733,0.00002095245,0.9749228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999165,0.0000020028515,0.0001340736,0.0003839003,0.00020066119,0.00011436266],"domain_scores_gemma":[0.9990415,0.000025129242,0.000027600834,0.0008200517,0.000019270632,0.00006642429],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007209706,0.00016943278,0.00013927951,0.00012501593,0.000035441328,0.00019165337,0.0007463649,0.00012066779,0.0005936542],"category_scores_gemma":[6.565316e-7,0.00013788689,0.0001570011,0.000030915675,0.000031890297,0.000111582944,0.00060002034,0.000236962,0.0024237353],"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":[2.594519e-7,0.000004125445,1.8372654e-7,0.0000152526645,0.000026714592,0.000033665434,0.000021059395,2.81939e-8,2.7360483e-7,0.9231913,0.07081891,0.005888197],"study_design_scores_gemma":[0.000015175982,0.000012977007,4.552692e-7,0.00002252736,0.0000058684673,0.0000045794127,5.228927e-7,0.000089088004,0.0000039870874,0.46751937,0.53223073,0.000094676616],"about_ca_topic_score_codex":0.000010335638,"about_ca_topic_score_gemma":0.00002623726,"teacher_disagreement_score":0.46141186,"about_ca_system_score_codex":0.000028887729,"about_ca_system_score_gemma":0.000023370589,"threshold_uncertainty_score":0.998353},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019768834,0.00011955847,0.970657,0.00066222326,0.00014311406,0.00006046773,0.000005570155,0.0006788681,0.007904379],"genre_scores_gemma":[0.97153306,0.00000793347,0.02819791,0.00014987482,0.00002221471,0.000010387769,0.000014198181,0.0000035085516,0.00006091716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939984,0.000021081001,0.00007532878,0.00024537876,0.00011289103,0.00014545387],"domain_scores_gemma":[0.9996764,0.00007063058,0.000008386721,0.00015880303,0.000025219386,0.000060563714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088098444,0.000062361054,0.000048375055,0.00006577097,0.00016453167,0.00053741666,0.00014487548,0.000019032592,0.00008639907],"category_scores_gemma":[0.000008832361,0.000043854678,0.000029036772,0.0005579318,0.000024710838,0.00044701932,0.0000754229,0.0001035791,0.00014447252],"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.000005954578,0.00008955919,0.0036281478,0.0000231088,0.00003817928,0.000080379905,0.0006706337,0.00023103246,0.00032421597,0.96322054,0.012265628,0.01942263],"study_design_scores_gemma":[0.0003728182,0.0002241583,0.0067295986,0.00010307213,0.000012655471,0.00006110297,0.00020529891,0.67501533,0.0024064078,0.009252787,0.30522537,0.00039136573],"about_ca_topic_score_codex":0.000044654767,"about_ca_topic_score_gemma":0.00015273977,"teacher_disagreement_score":0.95396775,"about_ca_system_score_codex":0.0000071579866,"about_ca_system_score_gemma":0.00003310461,"threshold_uncertainty_score":0.51823217},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17044272,0.00023859288,0.8270079,0.00037991704,0.00070057355,0.00008530337,0.000009670138,0.00056373165,0.0005715903],"genre_scores_gemma":[0.98423404,0.000008422348,0.0153734535,0.00021244833,0.00012179362,0.0000064633973,0.00001776964,0.000007877556,0.00001775867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986814,0.00004923887,0.00016007581,0.00052217965,0.00029450946,0.0002925627],"domain_scores_gemma":[0.9990105,0.000055573804,0.000013560231,0.00073954323,0.00002605259,0.00015473987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001520069,0.00014288531,0.00011521517,0.00014430833,0.00010332446,0.0005361753,0.0008119811,0.00006778175,0.00022822325],"category_scores_gemma":[0.00000401779,0.000111735535,0.0001107679,0.0004713108,0.00009109975,0.00046686895,0.00033656234,0.00017426547,0.00013849634],"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.000006195686,0.00021047133,0.0001451382,0.000028702358,0.00001892905,0.00002302123,0.00038811995,0.000060033602,0.0008873611,0.98814225,0.0016845404,0.00840521],"study_design_scores_gemma":[0.0003757843,0.00011416393,0.0065791328,0.000039466217,0.000012544248,0.000020977302,0.000086307045,0.966603,0.002247297,0.013566602,0.009947708,0.00040700941],"about_ca_topic_score_codex":0.00007718312,"about_ca_topic_score_gemma":0.00002596345,"teacher_disagreement_score":0.9745757,"about_ca_system_score_codex":0.000023848885,"about_ca_system_score_gemma":0.00005587291,"threshold_uncertainty_score":0.5170351},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20129406,0.0011683692,0.7783877,0.014558919,0.0013128623,0.000495142,0.000021838994,0.00045283124,0.002308259],"genre_scores_gemma":[0.98381263,0.00011713189,0.014398616,0.0013848058,0.00004203292,0.000019410889,0.0000080901,0.000006724281,0.00021053023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990094,0.000041192725,0.00016552322,0.00036820036,0.00023279019,0.00018292504],"domain_scores_gemma":[0.999249,0.00006707787,0.000018711473,0.0005980359,0.000020744488,0.00004645842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042073723,0.00010315848,0.00008299863,0.00012719992,0.00010864371,0.000253988,0.00064270414,0.00007066587,0.00011184676],"category_scores_gemma":[0.000011773036,0.00006456594,0.00008617233,0.0008844249,0.000040792118,0.00074575713,0.0003901173,0.00021577354,0.00015552613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003280668,0.00055001513,0.022113945,0.00021686303,0.00008773173,0.00022269279,0.04060444,0.00013486805,0.0024209784,0.6468039,0.1524654,0.13434634],"study_design_scores_gemma":[0.00043933466,0.000049993632,0.110582195,0.00010753824,0.000009749578,0.000013851126,0.00020588082,0.8010288,0.0014610547,0.009288772,0.07651022,0.0003026032],"about_ca_topic_score_codex":0.00040569762,"about_ca_topic_score_gemma":0.0006249731,"teacher_disagreement_score":0.80089396,"about_ca_system_score_codex":0.00002660317,"about_ca_system_score_gemma":0.00003564157,"threshold_uncertainty_score":0.26329225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4696323,0.06432087,0.45504582,0.009817878,0.00019034496,0.00042787704,0.000005741199,0.00026551232,0.00029364938],"genre_scores_gemma":[0.99428827,0.0015686635,0.0037507517,0.00026890656,0.00006738798,0.000016503096,0.000017123019,0.000014461739,0.000007922935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835247,0.00020189631,0.00022960083,0.00044367064,0.00035788934,0.00041448252],"domain_scores_gemma":[0.9992053,0.00028333385,0.000085716354,0.0003469208,0.000025726038,0.000053005235],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00047842338,0.00020048438,0.00018947445,0.00020822375,0.00018074462,0.00044993768,0.00040957262,0.00041772853,0.000011653901],"category_scores_gemma":[0.000036396075,0.00014853565,0.00005781035,0.0015646706,0.000098808276,0.0005221127,0.00006864331,0.0025115446,0.0000022783195],"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.00011850432,0.00016024419,0.0018253181,0.000119210155,0.00010759739,0.00011564003,0.013689458,0.00030333796,0.0011658046,0.80969775,0.00056046486,0.17213665],"study_design_scores_gemma":[0.0028086386,0.00423974,0.025806518,0.0024026977,0.00022285063,0.0013313616,0.0025967162,0.6591492,0.011548784,0.20356749,0.08400829,0.0023176519],"about_ca_topic_score_codex":0.00002568376,"about_ca_topic_score_gemma":0.00022928709,"teacher_disagreement_score":0.6588459,"about_ca_system_score_codex":0.00004225279,"about_ca_system_score_gemma":0.00016148151,"threshold_uncertainty_score":0.9997897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01565698,0.00017163536,0.9766626,0.0006480924,0.00022816707,0.00007080821,0.0000060583247,0.00020981561,0.0063458392],"genre_scores_gemma":[0.98004156,0.000011133571,0.019399647,0.00048351553,0.000024100753,0.000004979442,0.000012224787,0.0000017350328,0.000021076305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993644,0.000023919989,0.00008320978,0.00025379518,0.00019463767,0.00008003945],"domain_scores_gemma":[0.9996232,0.00018078253,0.000009593808,0.00012169623,0.000025773552,0.00003900125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017430293,0.00006234582,0.000056727018,0.00010548225,0.000069560025,0.00035793977,0.00015202622,0.000036482215,0.000040269475],"category_scores_gemma":[0.000008457044,0.00004794248,0.000023821352,0.0002777621,0.000027661552,0.0005167074,0.000067847854,0.00008679177,0.000061018207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054881352,0.000015356785,0.000033313805,0.000008157167,0.000004951655,0.000009410348,0.00012116224,0.0002370875,0.000012734033,0.99076784,0.0023175634,0.0064669596],"study_design_scores_gemma":[0.00018777807,0.000046660618,0.00104273,0.0000115935945,0.0000017946129,0.00002216223,0.000006023251,0.23657836,0.00005988184,0.76071244,0.001252154,0.00007843318],"about_ca_topic_score_codex":0.00000871038,"about_ca_topic_score_gemma":0.000007090793,"teacher_disagreement_score":0.9643846,"about_ca_system_score_codex":0.0000052258156,"about_ca_system_score_gemma":0.000025463427,"threshold_uncertainty_score":0.34516215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038323465,0.0007042682,0.98815924,0.0025129146,0.00077794964,0.0002451624,0.000013402627,0.0015621862,0.002192547],"genre_scores_gemma":[0.6723586,0.000044637574,0.32669678,0.00044226067,0.00017566537,0.00010879603,0.000017233499,0.000020133413,0.00013591124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851596,0.000009398891,0.00019986142,0.0007331043,0.00015382287,0.00038784565],"domain_scores_gemma":[0.9991366,0.00009725143,0.000023711478,0.0006357752,0.000033343626,0.00007326435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031646117,0.00016414671,0.00016094804,0.00047134695,0.00018115116,0.0004604882,0.0011501793,0.00012678978,0.00008233031],"category_scores_gemma":[0.0000132359655,0.00014107085,0.000130416,0.0009905727,0.000030111642,0.00070848217,0.00062992395,0.00019649949,0.000059579543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020209072,0.000018365174,0.000023147873,0.000055108867,0.000025075375,0.000022934197,0.0004229896,4.762226e-7,0.0015540366,0.9851337,0.0013145129,0.011427616],"study_design_scores_gemma":[0.00018295678,0.00007611198,0.000011432609,0.000062398285,0.000010268209,0.00004578016,0.00007120608,0.11321396,0.008397604,0.7744253,0.10326214,0.00024080616],"about_ca_topic_score_codex":0.000017087965,"about_ca_topic_score_gemma":0.000016822154,"teacher_disagreement_score":0.66852623,"about_ca_system_score_codex":0.000024044408,"about_ca_system_score_gemma":0.000026191023,"threshold_uncertainty_score":0.57527024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023458257,0.0033670294,0.91651964,0.05391508,0.0005342598,0.0005959857,0.00038277303,0.0007592289,0.00046773997],"genre_scores_gemma":[0.99803644,0.000046341887,0.0007368949,0.00076689315,0.00025030918,0.000064236854,0.00007343541,0.000017034925,0.000008407378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987645,0.000031417017,0.00018911432,0.00035431824,0.00031298315,0.0003476397],"domain_scores_gemma":[0.9991754,0.00028864466,0.000040627532,0.00034375838,0.000049097896,0.00010244801],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038972654,0.0001700595,0.00012989246,0.0001252284,0.00024953703,0.0010438814,0.0009914367,0.00029442986,0.000007294666],"category_scores_gemma":[0.000031147556,0.00010242532,0.00013150615,0.00071914674,0.000108292326,0.0028516594,0.00006927767,0.0009390181,0.00003385693],"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.000029698504,0.000016191307,0.000051712872,0.000060336704,0.00005014943,0.0000057362163,0.0024604816,0.000007085764,0.000113968264,0.9074487,0.06736219,0.022393715],"study_design_scores_gemma":[0.00053022144,0.00022324968,0.00041582243,0.00006752127,0.000031827138,0.00007953777,0.00022307067,0.059155766,0.000536652,0.023685826,0.91467535,0.00037514247],"about_ca_topic_score_codex":0.0000031917896,"about_ca_topic_score_gemma":0.000005642481,"teacher_disagreement_score":0.9745782,"about_ca_system_score_codex":0.000023561563,"about_ca_system_score_gemma":0.00013515132,"threshold_uncertainty_score":0.99999315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029492758,0.0076796873,0.8830442,0.066996746,0.0014595258,0.00057724235,0.00073958485,0.0010363086,0.008973966],"genre_scores_gemma":[0.9642239,0.0010115005,0.03285728,0.000272078,0.000114650924,0.000041434516,0.00081248395,0.000058008336,0.00060865923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884471,0.007173146,0.00077570946,0.0014990433,0.0011252792,0.0009796787],"domain_scores_gemma":[0.99203384,0.0021769458,0.00018616018,0.003724958,0.0013664337,0.00051166356],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008089851,0.00054421247,0.00043081623,0.00031422428,0.00077672023,0.0025927285,0.0028943294,0.00033675518,0.0005361943],"category_scores_gemma":[0.0019351202,0.0005956344,0.00049306353,0.0022040752,0.0005396594,0.0015641256,0.0010146309,0.0010188759,0.00018246868],"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.00003881376,0.0014338999,0.0027695412,0.0004403637,0.00011143059,0.00010262936,0.004922897,0.00024215569,0.0030905872,0.8682133,0.00918204,0.10945235],"study_design_scores_gemma":[0.00079849974,0.0000061339324,0.055204876,0.0057396307,0.00016115152,0.000064153915,0.00010246096,0.5701793,0.027524717,0.03728575,0.30167097,0.001262341],"about_ca_topic_score_codex":0.0015755736,"about_ca_topic_score_gemma":0.0017738014,"teacher_disagreement_score":0.9347311,"about_ca_system_score_codex":0.0002932357,"about_ca_system_score_gemma":0.00051188143,"threshold_uncertainty_score":0.9996495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076868623,0.0011026758,0.97134846,0.016016107,0.0011417519,0.0010715122,0.00009956045,0.00024979797,0.0012832935],"genre_scores_gemma":[0.28995913,0.00024139803,0.70765185,0.0015502332,0.000051075964,0.00043887759,0.00008522491,0.000016575223,0.000005627992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983013,0.00026215927,0.0004513205,0.00048575364,0.00011569032,0.00038373107],"domain_scores_gemma":[0.9946089,0.0027653868,0.000048897535,0.0023792924,0.000098147604,0.000099387566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006186418,0.00016515024,0.00027447141,0.0006024701,0.00019205053,0.00012364762,0.002611068,0.00012947626,0.00002871426],"category_scores_gemma":[0.00039619856,0.00016199892,0.000080711914,0.0013652605,0.0001883872,0.00036969516,0.0016789844,0.00042181928,0.000112759786],"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.00006281969,0.0003760655,0.0010135998,0.000079303856,0.00003523661,0.00004203712,0.0059476322,0.00031669205,0.00018576064,0.9127308,0.0078037214,0.07140634],"study_design_scores_gemma":[0.0014009477,0.00025536603,0.008238647,0.00053492043,0.000029790066,0.00009087546,0.0005623422,0.47650617,0.000106465806,0.048644926,0.46289116,0.0007383809],"about_ca_topic_score_codex":0.00040047744,"about_ca_topic_score_gemma":0.005192378,"teacher_disagreement_score":0.86408585,"about_ca_system_score_codex":0.000095982454,"about_ca_system_score_gemma":0.00016323595,"threshold_uncertainty_score":0.6606124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105765524,0.0029654594,0.989919,0.0005511777,0.0009499954,0.0003878562,0.000011501914,0.000057416328,0.005051822],"genre_scores_gemma":[0.6505137,0.000645247,0.34684724,0.0013644989,0.00041034142,0.000041696294,0.000013578172,0.000038152393,0.0001255686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709505,0.00004964786,0.0005742791,0.0010285128,0.0007278483,0.00052465947],"domain_scores_gemma":[0.99678093,0.00097600784,0.00025941659,0.0017408319,0.00016859641,0.00007423957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001221174,0.00033792979,0.0004064467,0.00078900484,0.00022661629,0.00034207825,0.0048905914,0.00021394056,0.000003881623],"category_scores_gemma":[0.00015201706,0.00025217168,0.00013646884,0.0012365974,0.0008437603,0.0004734852,0.0018625491,0.00077852805,0.000004958893],"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.0000051926236,0.000024035988,0.00018956709,0.000020290057,0.0000039912757,0.000009813349,0.00038309203,0.00052913313,0.000032936434,0.42315137,0.000013949143,0.5756366],"study_design_scores_gemma":[0.00013955374,0.00007902557,0.00032120277,0.00033289558,0.0000029564449,0.000007315944,3.8860674e-7,0.24109119,0.0009712364,0.748135,0.008643997,0.00027527654],"about_ca_topic_score_codex":0.00008388265,"about_ca_topic_score_gemma":0.0004667948,"teacher_disagreement_score":0.6504079,"about_ca_system_score_codex":0.0000900915,"about_ca_system_score_gemma":0.0006323919,"threshold_uncertainty_score":0.999993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006539843,0.00073601113,0.99509597,0.0004804895,0.0013566276,0.0007326245,0.00018497114,0.00024572073,0.0005135799],"genre_scores_gemma":[0.6611874,0.000028072867,0.3373808,0.00018923549,0.0005495418,0.00005331033,0.00047184303,0.00005476895,0.00008501281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642706,0.000022269518,0.00055734225,0.0017226202,0.0006477096,0.00062299176],"domain_scores_gemma":[0.9980038,0.00042884107,0.00021302958,0.0009882372,0.0002136166,0.00015251907],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074801437,0.00052584964,0.0004385386,0.0010730455,0.00020979386,0.0018530905,0.0021454233,0.00044087062,0.000004744264],"category_scores_gemma":[0.0001469569,0.00046543233,0.00016963812,0.001167152,0.00043414996,0.002373639,0.0007541668,0.0009735094,0.0000073391725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014764261,0.00009637249,0.00009340981,0.00023302755,0.00001359139,0.00005502033,0.00320638,0.002216849,0.00032714105,0.103316054,0.00006897208,0.89035845],"study_design_scores_gemma":[0.00018232309,0.00023461571,0.00017455839,0.001473148,0.000009032396,0.000039259532,0.0000014752977,0.6554909,0.00041803689,0.34033495,0.0010351517,0.0006065944],"about_ca_topic_score_codex":0.00002232718,"about_ca_topic_score_gemma":0.0005196241,"teacher_disagreement_score":0.88975185,"about_ca_system_score_codex":0.00033160654,"about_ca_system_score_gemma":0.00032291803,"threshold_uncertainty_score":0.99977976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059126113,0.0001787731,0.9828681,0.00006128994,0.00017927357,0.00046332547,0.00009735831,0.0009891929,0.009250103],"genre_scores_gemma":[0.9008761,0.000008333821,0.09815777,0.000105112595,0.0001084456,0.00016794036,0.0004056746,0.000019744877,0.00015084371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983087,0.00004253301,0.00018906676,0.0008518828,0.00020693944,0.0004008345],"domain_scores_gemma":[0.9993049,0.00019910633,0.000038111986,0.00024190824,0.000113308604,0.00010265257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003676958,0.0001865885,0.00016299683,0.00018665272,0.00038256956,0.0009974168,0.00052994036,0.00007603103,0.000052177646],"category_scores_gemma":[0.00007983142,0.00016158009,0.00013030898,0.001048985,0.000031770345,0.00043114251,0.00038356823,0.00031947452,0.000025474425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033583325,0.00014210175,0.00012919656,0.00014460589,0.00016234827,0.000014271252,0.003347882,0.0029657113,0.00067460106,0.9644278,0.006085994,0.021871878],"study_design_scores_gemma":[0.00020266438,0.00011327468,0.00021722502,0.000041653497,0.0000102942295,0.000008756691,0.00014766201,0.9804688,0.0036227584,0.003104117,0.0118083125,0.0002544659],"about_ca_topic_score_codex":0.00002222843,"about_ca_topic_score_gemma":0.000004636401,"teacher_disagreement_score":0.9775031,"about_ca_system_score_codex":0.000051777166,"about_ca_system_score_gemma":0.00006093408,"threshold_uncertainty_score":0.96181136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10106581,0.00021232922,0.89594525,0.0000872027,0.0006854741,0.00025527965,0.00016663955,0.00022655743,0.00135547],"genre_scores_gemma":[0.99707186,0.00020854348,0.0024400768,0.00001811769,0.000046452777,7.203062e-7,0.000131488,0.0000098487535,0.00007287932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842244,0.000106327854,0.00023092856,0.0009022116,0.00011247912,0.00022563303],"domain_scores_gemma":[0.99844885,0.000039525177,0.00023367867,0.0010749735,0.00012562258,0.00007733617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024746364,0.00022734162,0.00027066254,0.00031153957,0.00008785648,0.00017144,0.0012608262,0.00021158555,0.000011029826],"category_scores_gemma":[0.000015593001,0.0002563412,0.0002534868,0.00089420757,0.0002634004,0.0006188513,0.0034798717,0.00044941631,0.00002879818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010962389,0.00010628028,0.0007327689,0.0004292648,0.00006216772,0.000023426737,0.00026365422,0.019287921,0.000102116945,0.97840095,0.00039507585,0.00018543242],"study_design_scores_gemma":[0.00012558232,0.000027854514,0.0009955477,0.00017044046,0.0000481259,0.0000015723641,0.000015029524,0.35398364,0.00017517725,0.64405984,0.00018067284,0.00021650904],"about_ca_topic_score_codex":0.00044999615,"about_ca_topic_score_gemma":0.00018646817,"teacher_disagreement_score":0.89600605,"about_ca_system_score_codex":0.0000910484,"about_ca_system_score_gemma":0.00015528571,"threshold_uncertainty_score":0.99998885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12783161,0.0015605371,0.85834485,0.001991013,0.00024178468,0.00015682548,0.0000027963033,0.0011156899,0.008754898],"genre_scores_gemma":[0.9899269,0.00014100235,0.009768323,0.00008567309,0.00001274974,0.00001307137,0.000019856081,0.0000062557633,0.000026182659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903035,0.00013165247,0.00018623211,0.00028686645,0.00018111995,0.00018374922],"domain_scores_gemma":[0.99942243,0.000090667796,0.000020891395,0.00037684888,0.000040480994,0.000048675254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005392369,0.0000921361,0.00009043837,0.00022243691,0.0001559042,0.0005787241,0.00046741473,0.00005317024,0.00008106199],"category_scores_gemma":[0.000032553264,0.000082317674,0.000048112197,0.001171572,0.000039733757,0.0003678654,0.00024892317,0.00031497783,0.00015631496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034054683,0.00012176876,0.0005904733,0.000028840179,0.000011026606,0.000024006717,0.0025091886,0.0013054577,0.0005167399,0.92676187,0.0010174058,0.067109816],"study_design_scores_gemma":[0.00018438694,0.000045848723,0.007464892,0.00009488677,0.000003052189,0.00001667344,0.00026500018,0.9659058,0.00057485193,0.010488154,0.014740124,0.00021631813],"about_ca_topic_score_codex":0.0002918963,"about_ca_topic_score_gemma":0.0001597521,"teacher_disagreement_score":0.9646003,"about_ca_system_score_codex":0.00003685255,"about_ca_system_score_gemma":0.00007066301,"threshold_uncertainty_score":0.55806494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06638962,0.000067775836,0.9112655,0.0015100416,0.00082642474,0.00015587105,0.000012392738,0.0032472014,0.016525166],"genre_scores_gemma":[0.9547839,0.00014089458,0.04385155,0.0006219011,0.00012687365,0.000029802355,0.000044109045,0.000013544406,0.0003874333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914527,0.000024912768,0.00011006742,0.00027527954,0.00019933528,0.00024515565],"domain_scores_gemma":[0.9992804,0.00004072878,0.000023178221,0.0005481287,0.00003336774,0.00007418691],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026589335,0.00007611951,0.00007577652,0.00015304313,0.00012711475,0.00015709293,0.00057663,0.000042832457,0.00014781531],"category_scores_gemma":[0.000018375715,0.000069239446,0.00005284071,0.0013841897,0.00002805521,0.000626502,0.000235866,0.000078251935,0.0021404328],"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.000002416035,0.000031598986,0.00051883626,0.00000950928,0.0000065157415,0.00002787738,0.00016631876,0.000021805683,0.0014995319,0.93380636,0.05624641,0.007662834],"study_design_scores_gemma":[0.000994014,0.00026604402,0.038402524,0.00003027492,0.000011465359,0.00005445385,0.0002087636,0.12949118,0.007011987,0.38013944,0.4425335,0.00085634884],"about_ca_topic_score_codex":0.00006248993,"about_ca_topic_score_gemma":0.000016610806,"teacher_disagreement_score":0.8883943,"about_ca_system_score_codex":0.000007771188,"about_ca_system_score_gemma":0.000028330755,"threshold_uncertainty_score":0.99863654},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088746764,0.033226572,0.9613258,0.002604469,0.00040287885,0.001019367,0.00006356821,0.00040862983,0.000061239996],"genre_scores_gemma":[0.26127717,0.082895294,0.63797814,0.014914169,0.0012222824,0.0013823344,0.00025295914,0.000066516506,0.000011117351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758315,0.0001251874,0.00033950963,0.0011214775,0.0005141858,0.00031651836],"domain_scores_gemma":[0.9980701,0.0004329973,0.00007232479,0.0009857262,0.00016745146,0.00027139677],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018694957,0.00020097896,0.00026730468,0.00027266616,0.0002949202,0.0010644097,0.0016304483,0.00003531192,0.000012025505],"category_scores_gemma":[0.00012604517,0.00016831138,0.00006576045,0.0037977968,0.00011014198,0.0015120457,0.0007313694,0.00016599095,0.00038310044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000142489,0.000067060246,0.000019786541,0.00077462755,0.000008975148,0.0000058149026,0.00035472054,0.000010826417,0.00018520132,0.21349369,0.0042594364,0.78081846],"study_design_scores_gemma":[0.00029390975,0.0003378044,0.011306812,0.0105246315,0.000056981364,0.00009521769,0.000005592241,0.7107608,0.0007550528,0.056422316,0.20798828,0.0014526042],"about_ca_topic_score_codex":0.000022437864,"about_ca_topic_score_gemma":0.0000042873758,"teacher_disagreement_score":0.77936584,"about_ca_system_score_codex":0.000040265244,"about_ca_system_score_gemma":0.00014846791,"threshold_uncertainty_score":0.9999726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04006319,0.00047488467,0.9544607,0.0011674294,0.00043106184,0.00021462729,0.000005779879,0.00037209506,0.002810236],"genre_scores_gemma":[0.90225595,0.00003325055,0.09709267,0.0005138107,0.000082194696,0.000011205164,0.0000016048933,0.00000769879,0.0000016195382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971431,0.000098002754,0.00023644703,0.001136774,0.0007806904,0.00060500804],"domain_scores_gemma":[0.9982051,0.00041089722,0.000033901408,0.00088168075,0.00011111711,0.00035726427],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010656138,0.00025409381,0.00022668506,0.00016706153,0.00041790574,0.0015619852,0.001797853,0.000051239946,0.000086120424],"category_scores_gemma":[0.000020690342,0.00018060526,0.00005219628,0.0015861437,0.0033661358,0.001273006,0.0011954841,0.0002972324,0.000052795353],"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.0000115543935,0.00006629392,0.000016517415,0.000034926754,0.000010180782,0.0000425585,0.001458064,0.0000067600963,0.0005274798,0.9639818,0.00019653668,0.033647336],"study_design_scores_gemma":[0.00022503868,0.0004644623,0.00026640223,0.0001248641,0.000010704344,0.00008515398,0.0000150541855,0.54634416,0.004595171,0.4455762,0.0019367157,0.00035610786],"about_ca_topic_score_codex":0.0000067705587,"about_ca_topic_score_gemma":0.0000015846431,"teacher_disagreement_score":0.86219275,"about_ca_system_score_codex":0.00003134794,"about_ca_system_score_gemma":0.00013116976,"threshold_uncertainty_score":0.99947447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029301434,0.0012524308,0.98834425,0.0006449958,0.0024938735,0.0006981426,0.000100721845,0.00018232284,0.005990225],"genre_scores_gemma":[0.8394107,0.00030214622,0.15783857,0.0014382227,0.00072029757,0.00003192005,0.000030041412,0.0000810582,0.00014700321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959043,0.000054285425,0.00067715347,0.0015060538,0.0012564807,0.000601677],"domain_scores_gemma":[0.9965558,0.00052447617,0.0003411661,0.0022217236,0.00021857263,0.00013825644],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011243578,0.0005519605,0.0006338427,0.00082809303,0.00023982077,0.00045099005,0.00584081,0.0003490416,0.000017691149],"category_scores_gemma":[0.000052980587,0.00037767008,0.0004256347,0.0017500451,0.0013974119,0.0004963528,0.0027719943,0.0012983162,0.000018804367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059157544,0.00014981361,0.00019917575,0.0006893201,0.00008762764,0.00014095915,0.0044875625,0.0020432237,0.00037401816,0.8152958,0.00031314406,0.17616019],"study_design_scores_gemma":[0.0005206107,0.00010153926,0.00011873172,0.001357272,0.000023683382,0.00008399987,2.6623582e-7,0.06552088,0.0035921584,0.92593795,0.0021762261,0.00056668324],"about_ca_topic_score_codex":0.00005663934,"about_ca_topic_score_gemma":0.0003653997,"teacher_disagreement_score":0.8391177,"about_ca_system_score_codex":0.00008186277,"about_ca_system_score_gemma":0.000453884,"threshold_uncertainty_score":0.9998675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026371522,0.0008909206,0.9645659,0.006932703,0.00044855586,0.000061272454,0.0000035218502,0.00006700846,0.0006586307],"genre_scores_gemma":[0.4891352,0.00002214545,0.5100257,0.0004322242,0.00036663335,0.0000013505214,5.4996264e-7,0.0000118586,0.0000043264345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984501,0.00012370916,0.00058611104,0.00019789534,0.0003326101,0.0003095975],"domain_scores_gemma":[0.9987666,0.00040893845,0.00019898516,0.00034487527,0.00011829504,0.00016227609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008898104,0.00014391304,0.0003954319,0.000501478,0.00007259834,0.0002312976,0.0007544266,0.00012097147,0.00005662397],"category_scores_gemma":[0.00032196153,0.00010720228,0.00023149326,0.0006720956,0.00007719867,0.00058899046,0.00012557833,0.00036839317,0.000051864616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012893243,0.0001350639,0.000052434865,0.00028254054,0.000050019848,0.0002390472,0.00031495243,0.000052006384,0.0008576502,0.9946287,0.0014533147,0.0019213645],"study_design_scores_gemma":[0.00032756335,0.00027255947,0.00005468359,0.0003991546,0.000053038446,0.0017326961,0.00007626299,0.1322916,0.0010524718,0.8567688,0.0067865555,0.0001846237],"about_ca_topic_score_codex":0.0000046598548,"about_ca_topic_score_gemma":0.0000015894486,"teacher_disagreement_score":0.4627637,"about_ca_system_score_codex":0.00004550331,"about_ca_system_score_gemma":0.0003451306,"threshold_uncertainty_score":0.4371582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090785464,0.0003114787,0.98950166,0.0027778235,0.0023882855,0.0004113875,0.000046909317,0.00014808433,0.0035065424],"genre_scores_gemma":[0.77822906,0.00008387173,0.21788064,0.002437934,0.0011522876,0.000017582688,0.00005990005,0.000051128653,0.00008758263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959572,0.000053245833,0.00055771775,0.0015883486,0.0013686843,0.00047479264],"domain_scores_gemma":[0.9966154,0.00069024984,0.00028382472,0.0020578455,0.0002456702,0.000107023494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013055743,0.0004911415,0.0004365284,0.0008023641,0.00027437703,0.00043646354,0.0031850704,0.00020172751,0.00009094454],"category_scores_gemma":[0.00013374924,0.00034738486,0.0002286111,0.0012278261,0.0027019195,0.00047578724,0.0016312515,0.0011752589,0.000113557566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011631106,0.000041167994,0.000014975196,0.000054914562,0.00001731195,0.000013048855,0.0004173509,0.003659466,0.0002209223,0.9699795,0.00022251393,0.025347145],"study_design_scores_gemma":[0.000103190316,0.00015813642,0.00034872483,0.00032044348,0.000009860913,0.000020926782,1.8986084e-7,0.0678111,0.002118944,0.9265143,0.002223325,0.00037083545],"about_ca_topic_score_codex":0.000026021024,"about_ca_topic_score_gemma":0.000061117236,"teacher_disagreement_score":0.7773212,"about_ca_system_score_codex":0.00013982151,"about_ca_system_score_gemma":0.00028553943,"threshold_uncertainty_score":0.99989784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006215532,0.00048761186,0.9905412,0.0019561092,0.0017963651,0.0005428433,0.000050142055,0.00037852264,0.004185046],"genre_scores_gemma":[0.061940566,0.00003166512,0.93316007,0.003701208,0.00068145007,0.000034300938,0.00006953928,0.00006235968,0.00031883118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959318,0.000022722896,0.0004271077,0.0019377258,0.0010485264,0.00063210964],"domain_scores_gemma":[0.9977124,0.00028507618,0.00013509451,0.0012284847,0.0002473012,0.00039167923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047682325,0.0005736484,0.0004555837,0.0012737712,0.00030631066,0.0009981085,0.0022279136,0.00027084432,0.000025324733],"category_scores_gemma":[0.00002680427,0.00047557201,0.0001416826,0.0016471768,0.0004461439,0.0007347484,0.0013080665,0.0009894524,0.0002279597],"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.000039516002,0.00009540109,0.000050510727,0.00016439777,0.000070427865,0.0004887014,0.0029838963,0.2178959,0.000052825628,0.3862876,0.0014607548,0.39041007],"study_design_scores_gemma":[0.00038166664,0.0007403124,0.00021375155,0.00096801546,0.0000377561,0.00026331245,9.858334e-7,0.38751113,0.00008570585,0.5883257,0.020035148,0.0014365545],"about_ca_topic_score_codex":0.000039271552,"about_ca_topic_score_gemma":0.00037881322,"teacher_disagreement_score":0.3889735,"about_ca_system_score_codex":0.00018014318,"about_ca_system_score_gemma":0.00054288056,"threshold_uncertainty_score":0.99976957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11135435,0.0053683585,0.8644696,0.009728058,0.001460895,0.005114031,0.0009487251,0.0002957027,0.0012603181],"genre_scores_gemma":[0.9940364,0.0000121735375,0.005471697,0.00010631487,0.00004502418,0.0002866612,0.000025526668,0.000005001227,0.000011213469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896395,0.00006046592,0.00021847698,0.0002987928,0.0002485605,0.00020974227],"domain_scores_gemma":[0.99916744,0.00024802797,0.00004055756,0.0004859134,0.000032620566,0.000025420033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060275104,0.00008848346,0.00010681852,0.000095113566,0.00004089652,0.00012929499,0.00094959076,0.000032729084,0.000014773495],"category_scores_gemma":[0.00005352503,0.000060020604,0.00008512818,0.00054084684,0.00003562186,0.00036012585,0.00015928312,0.000101603946,0.0000044845133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021660278,0.00023979765,0.0006376786,0.00039357552,0.000020261157,0.00001704752,0.009247505,0.000007460573,0.0003991299,0.95917666,0.0174736,0.012365648],"study_design_scores_gemma":[0.000787758,0.0008258086,0.0066023655,0.0005758661,0.000023125702,0.000013856156,0.0006321794,0.3696448,0.0033262172,0.4454159,0.17174949,0.00040263418],"about_ca_topic_score_codex":0.000039663944,"about_ca_topic_score_gemma":0.000083255014,"teacher_disagreement_score":0.882682,"about_ca_system_score_codex":0.000013031753,"about_ca_system_score_gemma":0.00006453243,"threshold_uncertainty_score":0.24475692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2630123,0.0006171719,0.7346629,0.00013182375,0.00067947665,0.00019870522,0.000096435724,0.00037714888,0.00022406343],"genre_scores_gemma":[0.9935238,0.00007830843,0.0061573344,0.00012234182,0.00006569388,0.000006762931,0.000020711632,0.000015564357,0.0000094976895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807465,0.000091152,0.00034306067,0.00078729197,0.00030499947,0.0003988502],"domain_scores_gemma":[0.9990169,0.00032142908,0.00006427411,0.0003430569,0.00006403512,0.0001903334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041983314,0.00029243328,0.0002445282,0.00028442754,0.00058594777,0.0007257277,0.0002729961,0.0001638634,0.000028339084],"category_scores_gemma":[0.0000052292366,0.0002765093,0.000109636356,0.00087339856,0.000108766966,0.0005565763,0.000019004758,0.0005836584,0.000008906636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024701134,0.0014081271,0.00037830794,0.0022021881,0.00097629055,0.0011354701,0.028685847,0.09089499,0.011858622,0.28098902,0.0025691653,0.57865494],"study_design_scores_gemma":[0.00059863616,0.0001299241,0.00021795864,0.000371817,0.000048887203,0.00031880816,0.00015351888,0.9879927,0.004316905,0.0033930622,0.0019948513,0.00046294762],"about_ca_topic_score_codex":0.00007860083,"about_ca_topic_score_gemma":0.00003182218,"teacher_disagreement_score":0.8970977,"about_ca_system_score_codex":0.000034017936,"about_ca_system_score_gemma":0.000073527095,"threshold_uncertainty_score":0.9999687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118564114,0.0024514433,0.8394552,0.006963278,0.00480968,0.002678533,0.00042717805,0.012037303,0.012613259],"genre_scores_gemma":[0.9895588,0.000112149646,0.009087327,0.00036288812,0.00013711026,0.00036663562,0.00027782275,0.000058150516,0.000039081966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544245,0.0003704658,0.00086496316,0.0010505286,0.0011063176,0.001165273],"domain_scores_gemma":[0.99623495,0.00034411787,0.00035149272,0.002378877,0.00021815948,0.00047237595],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016370739,0.00050013035,0.00060055155,0.0012113675,0.0005277766,0.0016975988,0.002799442,0.00022307389,0.000100060235],"category_scores_gemma":[0.0002062345,0.0004511734,0.00034110987,0.005180664,0.00018176262,0.0016934841,0.00067220477,0.00035176735,0.0017887693],"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.000009805852,0.00020788402,0.006568376,0.00088823424,0.000092552706,0.00008200893,0.0004697193,0.00015400788,0.00042163933,0.9729747,0.01674541,0.001385624],"study_design_scores_gemma":[0.004334777,0.0005174086,0.06898432,0.0011026711,0.00015572194,0.00013299518,0.0009771374,0.53883696,0.0019086857,0.16583249,0.21254915,0.004667705],"about_ca_topic_score_codex":0.000069611495,"about_ca_topic_score_gemma":0.000019792393,"teacher_disagreement_score":0.87099475,"about_ca_system_score_codex":0.000047127163,"about_ca_system_score_gemma":0.00016140137,"threshold_uncertainty_score":0.999794},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00507861,0.0026358094,0.988289,0.0023935216,0.000061114595,0.0004496121,0.000021600896,0.00004731998,0.0010234414],"genre_scores_gemma":[0.7469758,0.0001580982,0.2521361,0.0006108893,0.000028268172,0.00007072865,0.000013682253,0.00000325754,0.0000032060364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913895,0.00007886438,0.00024036787,0.0002951415,0.00006740387,0.0001793004],"domain_scores_gemma":[0.9975142,0.0006218855,0.00007568599,0.0016538616,0.00007430703,0.000060054983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046502586,0.00011398252,0.0001683092,0.0000902761,0.00052690064,0.00013065827,0.0017207564,0.000053623327,1.6468056e-7],"category_scores_gemma":[0.0000152562825,0.00009186265,0.000055995937,0.0006583291,0.0003092907,0.00007354113,0.0019472748,0.0001807697,8.95936e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013809977,0.00040525282,0.00013120499,0.00004960773,0.000040423274,6.451447e-8,0.0021104126,0.0022694408,0.000060367656,0.937014,0.0020017999,0.055903625],"study_design_scores_gemma":[0.00022153108,0.00006477308,0.0016822431,0.000066663415,0.000014362033,0.000004655686,0.00008047151,0.9764045,0.000014127847,0.0058136685,0.015521333,0.000111697846],"about_ca_topic_score_codex":0.00001839446,"about_ca_topic_score_gemma":0.000014887738,"teacher_disagreement_score":0.97413504,"about_ca_system_score_codex":0.000005458313,"about_ca_system_score_gemma":0.000033526652,"threshold_uncertainty_score":0.40525466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002899755,0.0001562247,0.7976055,0.00018920668,0.0010008344,0.0049663945,0.0018988022,0.00035632824,0.19353673],"genre_scores_gemma":[0.0015837633,0.0003049947,0.8452737,0.0011373217,0.0029941546,0.0018747632,0.0015542839,0.00028822338,0.14498883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781436,0.0000036911547,0.00065039785,0.0007594892,0.0003132079,0.00045882803],"domain_scores_gemma":[0.9980287,0.0005236481,0.0004401995,0.0007471662,0.00010396873,0.00015634419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038948128,0.00058261194,0.00078502373,0.000099109595,0.00058804627,0.0004697841,0.00086871063,0.000994602,0.0000074411637],"category_scores_gemma":[0.000019412146,0.0005292452,0.0010311829,0.000039818708,0.0002723702,0.00006240091,0.00048793052,0.00049846433,0.0000017995962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029041877,0.00003981378,2.499989e-7,0.0005163652,0.00037011778,3.3417209e-7,0.00052861567,7.522651e-8,0.00011394463,0.9642223,0.02136919,0.012809944],"study_design_scores_gemma":[0.0015752837,0.00009322574,1.6169362e-7,0.00022564303,0.00030475782,0.0000025209056,0.00003782593,0.00021783789,0.0006003879,0.7116648,0.2847488,0.0005287835],"about_ca_topic_score_codex":0.0000027404853,"about_ca_topic_score_gemma":0.0000115160765,"teacher_disagreement_score":0.2633796,"about_ca_system_score_codex":0.00003423314,"about_ca_system_score_gemma":0.00019893443,"threshold_uncertainty_score":0.9997159},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2269397e-8,0.00030151065,0.27520227,0.00035051646,0.0002901486,0.00008071334,0.000024422732,0.00014492752,0.72360545],"genre_scores_gemma":[0.00004459255,0.0002902716,0.066749364,0.0020743373,0.00007820607,0.0000060618668,0.00006537645,0.0000072048497,0.93068457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924827,0.000004502942,0.00013934897,0.00033176527,0.00016582165,0.00011027672],"domain_scores_gemma":[0.99885154,0.000046270958,0.000043230633,0.00097599317,0.000032641725,0.00005034443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007016407,0.00015661008,0.00015889198,0.0001338722,0.000056401648,0.00009329827,0.00093511346,0.00012749965,0.00040412345],"category_scores_gemma":[0.000002132125,0.00013798039,0.00013319103,0.00003304367,0.000028818667,0.00010347382,0.00059977616,0.00017611834,0.00019497814],"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":[4.171167e-7,0.000006035366,8.8600615e-7,0.000008565836,0.000018499186,0.0000062983177,0.000007709777,2.1141242e-8,1.1967353e-7,0.83288383,0.14689559,0.020171996],"study_design_scores_gemma":[0.000040933337,0.000011644618,0.0000027006977,0.000024710393,0.0000050076515,0.0000010481394,4.2247805e-7,0.00006772376,0.000006481117,0.32942313,0.6703133,0.00010285969],"about_ca_topic_score_codex":0.000015345237,"about_ca_topic_score_gemma":0.000031642427,"teacher_disagreement_score":0.5234177,"about_ca_system_score_codex":0.00002791397,"about_ca_system_score_gemma":0.000050646424,"threshold_uncertainty_score":0.56266767},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.4392514e-8,0.00023589429,0.30075583,0.0004374008,0.00028792035,0.000057126097,0.000022219509,0.00019610507,0.69800746],"genre_scores_gemma":[0.000086021464,0.00022647165,0.033518888,0.0009671716,0.000069895876,0.0000036388315,0.00004904099,0.000007974369,0.9650709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991163,0.0000041790568,0.00016384019,0.0004318148,0.00015517736,0.00012870824],"domain_scores_gemma":[0.9987249,0.00004231492,0.00005114357,0.0010842469,0.00004203988,0.000055393506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007167134,0.00016573453,0.00016217188,0.00016993219,0.00005744735,0.00012736871,0.0011084086,0.00016181981,0.00044468447],"category_scores_gemma":[0.0000041587673,0.00014716419,0.000146123,0.000049280963,0.000037438625,0.00014470305,0.00046212118,0.00020199973,0.00038214703],"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":[6.013528e-7,0.0000038197877,4.3088414e-7,0.000010473295,0.000014371838,0.0000064693145,0.000009745653,3.5219426e-8,0.0000012876826,0.8713317,0.09653375,0.032087345],"study_design_scores_gemma":[0.000023849298,0.0000056862295,0.000003302078,0.000019742612,0.0000047235885,0.0000012112005,1.7483109e-7,0.00011620669,0.000023129043,0.35997286,0.639714,0.00011508477],"about_ca_topic_score_codex":0.000009657869,"about_ca_topic_score_gemma":0.000013643132,"teacher_disagreement_score":0.5431803,"about_ca_system_score_codex":0.000010084178,"about_ca_system_score_gemma":0.000055437937,"threshold_uncertainty_score":0.60011816},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.809226e-7,0.0004965596,0.28557718,0.00031557144,0.00033440106,0.000100186975,0.000040189774,0.00025387216,0.71288157],"genre_scores_gemma":[0.00011588611,0.0009932569,0.11939442,0.0020761234,0.00018724178,0.00001300493,0.0000886365,0.000019845653,0.87711155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900496,0.0000071875716,0.00018870772,0.00044033738,0.0001984519,0.00016033776],"domain_scores_gemma":[0.99873585,0.000057695608,0.00006687614,0.001036986,0.000044495777,0.00005808344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009435576,0.00021999113,0.00023294825,0.00018336771,0.00007953907,0.00015582811,0.0010740889,0.00018808912,0.00040401323],"category_scores_gemma":[0.000008123384,0.0001939499,0.00016785703,0.000060769682,0.000071939794,0.00027601083,0.00070498034,0.0002263725,0.00014715544],"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.0000019853578,0.0000045332977,0.0000063048824,0.000027867727,0.00002277156,0.000011777759,0.00003403635,2.4657735e-8,6.685203e-7,0.9501158,0.036838796,0.012935429],"study_design_scores_gemma":[0.000058261845,0.000011613272,0.000016000344,0.000041611842,0.0000063871234,0.0000017423341,3.9998054e-7,0.000028140643,0.000015286216,0.3376703,0.661994,0.00015626679],"about_ca_topic_score_codex":0.000016108246,"about_ca_topic_score_gemma":0.00004182685,"teacher_disagreement_score":0.6251552,"about_ca_system_score_codex":0.000012311918,"about_ca_system_score_gemma":0.000059408678,"threshold_uncertainty_score":0.79090476},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.3853554e-7,0.0025200937,0.57673836,0.00079636404,0.0007332684,0.00016553438,0.000027404838,0.00017086642,0.41884744],"genre_scores_gemma":[0.010028103,0.002598412,0.25971568,0.004332449,0.0030229995,0.00017737871,0.00030882508,0.00014187321,0.7196743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820614,0.00003989771,0.00028973402,0.0008045837,0.00046233748,0.0001973293],"domain_scores_gemma":[0.9986119,0.00018952803,0.00009959728,0.0007560679,0.0001816324,0.00016126792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022589896,0.0002866754,0.00038832403,0.00042457797,0.00017062112,0.00035333756,0.00075775967,0.00032159535,0.00006758992],"category_scores_gemma":[0.000028220646,0.00027023684,0.00018590897,0.0001219765,0.00011297651,0.00043735848,0.0004254269,0.00053383934,0.000029985418],"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.000006598833,0.00002113892,0.000006503512,0.00006464929,0.00003207599,0.000032129567,0.00006507572,7.447036e-7,0.0000010978281,0.9858579,0.013236404,0.000675665],"study_design_scores_gemma":[0.0002586471,0.00009106875,0.00002791871,0.00013932835,0.000038761522,0.000018030383,0.000011386231,0.0026573166,0.0000012777422,0.4519877,0.54437226,0.000396322],"about_ca_topic_score_codex":0.0002853445,"about_ca_topic_score_gemma":0.00006074067,"teacher_disagreement_score":0.5338702,"about_ca_system_score_codex":0.0003147048,"about_ca_system_score_gemma":0.00020621318,"threshold_uncertainty_score":0.99997497},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.24076935e-8,0.000006333303,0.42000106,0.00007742788,0.000106056184,0.015645204,0.000012656307,0.00014845145,0.5640028],"genre_scores_gemma":[0.000023259987,0.00003647819,0.12718934,0.0011778167,0.0002835212,0.06272195,0.0001643212,0.00002563003,0.8083777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989709,0.000008785872,0.00021141826,0.0004472019,0.00025348944,0.00010820285],"domain_scores_gemma":[0.9986298,0.0000238169,0.00010348915,0.001112148,0.00008478142,0.000045946803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014874131,0.00016071004,0.00014583068,0.0001696565,0.000080497346,0.00023723824,0.001155122,0.00017527038,0.00037045009],"category_scores_gemma":[0.000008935429,0.00015189964,0.00012323061,0.000079753,0.000035880752,0.0007048575,0.0004099874,0.00019625256,0.00023169063],"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.0000019977476,0.000010916244,0.0000019942943,0.000049950486,0.000010430826,0.0000020673942,0.000010667648,3.9969578e-8,0.0000023612954,0.95736396,0.027451754,0.015093841],"study_design_scores_gemma":[0.00007018743,0.00001111906,0.000028330998,0.000033348537,0.0000037546013,7.7537163e-7,2.4178902e-7,0.000108218315,0.00002893744,0.37187093,0.6277282,0.000115930496],"about_ca_topic_score_codex":0.000017772114,"about_ca_topic_score_gemma":0.00004240359,"teacher_disagreement_score":0.60027647,"about_ca_system_score_codex":0.000022791068,"about_ca_system_score_gemma":0.00009690342,"threshold_uncertainty_score":0.61942875},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0517447e-8,0.000008652929,0.37343803,0.00014890432,0.00012986986,0.02110441,0.00001641106,0.00023506372,0.60491866],"genre_scores_gemma":[0.000013365527,0.0000112971065,0.04051387,0.00047918037,0.00012646778,0.042556398,0.00008912631,0.0000152506,0.91619503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880946,0.0000074018585,0.0002886714,0.00052396714,0.00024593956,0.00012458189],"domain_scores_gemma":[0.99837667,0.00002901972,0.00013581237,0.0013084299,0.000102397695,0.00004764619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015909539,0.00018374,0.00015486247,0.00026327118,0.00009223118,0.00027453728,0.0012306053,0.00020534146,0.00030702996],"category_scores_gemma":[0.000010490805,0.0001699282,0.00013139968,0.00009010253,0.00004235667,0.00034826534,0.00045188164,0.00022864713,0.00034368754],"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.0000015608862,0.000010122978,0.000001307814,0.00005139029,0.00001083154,0.0000023202817,0.000009611393,5.632152e-8,0.000004960075,0.9153847,0.047299396,0.037223727],"study_design_scores_gemma":[0.00007391554,0.000009968655,0.000011159419,0.000047447025,0.000004380578,0.0000012072361,3.559683e-7,0.00021818008,0.00009928569,0.3237388,0.6756552,0.0001401344],"about_ca_topic_score_codex":0.00000827165,"about_ca_topic_score_gemma":0.000017155622,"teacher_disagreement_score":0.62835574,"about_ca_system_score_codex":0.000019863754,"about_ca_system_score_gemma":0.00010070463,"threshold_uncertainty_score":0.6929471},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017800006,0.0007017146,0.41689262,0.00053944316,0.00044091168,0.00013549387,0.000032641994,0.00030888637,0.5809465],"genre_scores_gemma":[0.0023680802,0.0033777864,0.25756037,0.002931476,0.0007589023,0.00004693241,0.0008222047,0.000065066975,0.7320692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981178,0.000020667847,0.00035142497,0.0007779877,0.0004189024,0.0003132361],"domain_scores_gemma":[0.99801826,0.00010860748,0.00014810693,0.00140068,0.0001827092,0.00014160911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002593555,0.00035470637,0.000321269,0.000493074,0.00014268508,0.00048793075,0.0015429155,0.00037085704,0.00085667253],"category_scores_gemma":[0.00003438337,0.00033154292,0.00027727478,0.0001727282,0.000092720766,0.0008131513,0.0007777512,0.00044718967,0.00048434117],"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.0000013839992,0.00001814085,0.000010565321,0.00003722252,0.0000437606,0.0000066646016,0.000035532477,7.4664655e-8,0.00000402908,0.95039076,0.027080264,0.022371612],"study_design_scores_gemma":[0.000090408685,0.00002439301,0.000010897719,0.00005926686,0.000012799438,0.00000364165,0.0000021423398,0.0005740493,0.00003055378,0.26284212,0.73605585,0.00029385046],"about_ca_topic_score_codex":0.000018230907,"about_ca_topic_score_gemma":0.00004768979,"teacher_disagreement_score":0.7089756,"about_ca_system_score_codex":0.00004261619,"about_ca_system_score_gemma":0.00019261897,"threshold_uncertainty_score":0.99991363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058797386,0.00034185548,0.940281,0.00013827144,0.000056988243,0.00003553126,0.0000052594237,0.0001333851,0.00021033865],"genre_scores_gemma":[0.9870334,0.000026253923,0.012901109,0.000013779719,0.000011555114,0.000001148585,0.000009591934,0.0000013287441,0.0000018077528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950683,0.000022110522,0.00012862758,0.00017670862,0.000111541645,0.000054192562],"domain_scores_gemma":[0.9996082,0.00013024408,0.000020767531,0.00018132881,0.00003302899,0.000026417085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016167927,0.000044415927,0.00007527437,0.0002481056,0.00003414872,0.000115933304,0.000095975134,0.000028135766,0.000028452612],"category_scores_gemma":[0.000010791415,0.000038024045,0.00005717124,0.0012669278,0.000030953197,0.0005505844,0.00003737961,0.000035986923,0.0000046299556],"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.0000012221299,0.000014206668,0.0025307548,0.000019770705,0.00006711285,0.0000018594992,0.00022448198,0.005034426,0.00025225288,0.9824442,0.000025705593,0.009383988],"study_design_scores_gemma":[0.00002780661,0.00002183961,0.010384571,0.0000051298903,0.00005237448,9.848952e-7,0.000012025529,0.96002364,0.00015229598,0.029100232,0.00017483682,0.000044285942],"about_ca_topic_score_codex":0.000023126304,"about_ca_topic_score_gemma":0.00001787475,"teacher_disagreement_score":0.9549892,"about_ca_system_score_codex":0.0000030430524,"about_ca_system_score_gemma":0.000013915948,"threshold_uncertainty_score":0.15505756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035350577,0.000041032697,0.9781323,0.00035266668,0.0000834254,0.01756688,0.00001124056,0.00007881619,0.00019858088],"genre_scores_gemma":[0.513102,0.0000019961608,0.41945204,0.00043236575,0.000039742252,0.066710345,0.00001795132,0.000011117022,0.00023247566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921286,0.00001851623,0.00023328872,0.00031299674,0.00010107964,0.00012123238],"domain_scores_gemma":[0.9992781,0.00007812056,0.0001171983,0.00037768635,0.000109918095,0.00003896723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020297818,0.00009394116,0.00011797943,0.00014193585,0.00005669727,0.00010864034,0.00059374754,0.00006040094,0.0000060435937],"category_scores_gemma":[0.000031348394,0.00008255989,0.00006614361,0.00024303516,0.000060487168,0.00015142272,0.00023047354,0.00007875426,0.0000029277705],"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.00002935708,0.00032969395,0.00029682773,0.0003386679,0.000036431033,1.8996542e-7,0.0037852481,0.000002228679,0.002277085,0.97635204,0.0014163615,0.015135895],"study_design_scores_gemma":[0.0022244453,0.00021751113,0.0030957179,0.0003472192,0.000046456935,0.0000047739413,0.00008780455,0.55339307,0.08889924,0.04163736,0.30966803,0.00037837098],"about_ca_topic_score_codex":0.000033204025,"about_ca_topic_score_gemma":0.000005143656,"teacher_disagreement_score":0.9347147,"about_ca_system_score_codex":0.000015168577,"about_ca_system_score_gemma":0.000026719457,"threshold_uncertainty_score":0.33666947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021024716,0.0010353905,0.994192,0.0006101764,0.0012159961,0.000593697,0.000036066718,0.00028411948,0.0020115403],"genre_scores_gemma":[0.012735402,0.000114830684,0.98504263,0.0016356449,0.00020798377,0.000015669895,0.00004816379,0.000024687264,0.00017499387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957005,0.00005473287,0.0004905532,0.001996269,0.0010657691,0.00069222244],"domain_scores_gemma":[0.9965828,0.0004782604,0.00033508858,0.0020267735,0.00038245498,0.00019459554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007327075,0.0006804396,0.0006387102,0.0012283423,0.00036517717,0.00082832255,0.0039525838,0.00052110694,0.00002327069],"category_scores_gemma":[0.000087393826,0.0005576823,0.00017638395,0.0014905207,0.000769328,0.0010353039,0.0012161381,0.0013090443,0.00001692853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007714058,0.00014682914,0.00014131806,0.00014404654,0.00006735304,0.00027472712,0.0017930777,0.03293015,0.00008027961,0.18304403,0.0003010273,0.781],"study_design_scores_gemma":[0.002213858,0.0003592826,0.00028638943,0.0018115649,0.00004643392,0.000101974554,4.652785e-7,0.83744615,0.002142383,0.14638534,0.007320439,0.0018857378],"about_ca_topic_score_codex":0.000033742486,"about_ca_topic_score_gemma":0.00024557408,"teacher_disagreement_score":0.80451596,"about_ca_system_score_codex":0.00016981862,"about_ca_system_score_gemma":0.00073971564,"threshold_uncertainty_score":0.9996875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5904871,0.000327938,0.40666083,0.0006416457,0.0012028659,0.000062173436,0.0000012922172,0.000023407069,0.0005927638],"genre_scores_gemma":[0.98333466,0.000043264932,0.016213093,0.00028153704,0.00009347293,0.0000014692152,4.489303e-7,0.0000049606415,0.000027064503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984907,0.00011740197,0.00051959313,0.000287518,0.0003072364,0.00027757042],"domain_scores_gemma":[0.999024,0.00014887613,0.00023857728,0.00039050137,0.00009939642,0.00009868721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085001334,0.00014829566,0.00025459926,0.00046541032,0.000070804126,0.00031906553,0.0015369925,0.000086774045,0.000024370538],"category_scores_gemma":[0.00012305332,0.00013306948,0.00010670908,0.00042801417,0.00008392038,0.00040312915,0.0008252068,0.00060252036,0.0000023460493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019431405,0.0037087929,0.18414763,0.0012303393,0.0010633051,0.0014948077,0.10661892,0.0038114765,0.024325201,0.2411002,0.07297468,0.3575815],"study_design_scores_gemma":[0.0022292396,0.00025695644,0.014872973,0.0017960501,0.00002973831,0.00029021097,0.0001739988,0.9084722,0.0147593,0.049798083,0.006860482,0.00046081244],"about_ca_topic_score_codex":0.0007954297,"about_ca_topic_score_gemma":0.00005432653,"teacher_disagreement_score":0.9046607,"about_ca_system_score_codex":0.0000450463,"about_ca_system_score_gemma":0.000075867094,"threshold_uncertainty_score":0.5426416},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15408254,0.00013103217,0.8414902,0.0002718097,0.002385927,0.000054440254,0.000003928739,0.000027013793,0.0015531303],"genre_scores_gemma":[0.9762668,0.00003114964,0.023356536,0.00020467237,0.000075654796,7.355751e-7,0.0000021206426,0.0000033416422,0.000058994123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871325,0.00009290201,0.00055121625,0.00017669416,0.00030602416,0.00015991842],"domain_scores_gemma":[0.99889785,0.000107917884,0.00044040772,0.00020420623,0.0002901629,0.000059441336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060130144,0.00010820744,0.00022254464,0.00029648468,0.00006862093,0.00017131143,0.00088442315,0.00008190414,0.000032221156],"category_scores_gemma":[0.00010760681,0.00009851494,0.00017438456,0.000358286,0.00006909892,0.0010156162,0.00012737664,0.00033926207,0.0000036345011],"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.0018798582,0.00166755,0.009612682,0.0004537264,0.0015611558,0.00015665621,0.04581665,0.0018341723,0.070860885,0.49629748,0.11326869,0.2565905],"study_design_scores_gemma":[0.007459978,0.001770066,0.0053841467,0.0021519037,0.00018881825,0.0003818088,0.0015700841,0.5383226,0.2710891,0.15018262,0.020618763,0.0008801016],"about_ca_topic_score_codex":0.00033268033,"about_ca_topic_score_gemma":0.000020226114,"teacher_disagreement_score":0.82218426,"about_ca_system_score_codex":0.000028312994,"about_ca_system_score_gemma":0.00012242212,"threshold_uncertainty_score":0.40173224},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000102822105,0.0007365422,0.9925279,0.0029811906,0.0021061914,0.00075477845,0.000082722596,0.00010066126,0.00069972174],"genre_scores_gemma":[0.009980354,0.0000631455,0.98514336,0.004182357,0.0005133396,0.00003729321,0.000030580653,0.0000147644205,0.00003481557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971964,0.000034334735,0.00041431087,0.001178956,0.00062139565,0.00055463787],"domain_scores_gemma":[0.9965259,0.0013165853,0.00023479463,0.0016392043,0.00019536901,0.000088169836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009795635,0.00037725904,0.0003219712,0.00054075994,0.0005340317,0.0007938474,0.0040694256,0.00028070077,0.000022279004],"category_scores_gemma":[0.000098856835,0.0002884284,0.00020714224,0.00076734164,0.00045949648,0.0004951348,0.0012320183,0.0006901562,0.0000069631506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030995175,0.000009271496,0.000052019164,0.000021808872,0.000009850944,0.000002541944,0.00051354774,0.000077515724,0.000005155196,0.5910285,0.000269431,0.40800723],"study_design_scores_gemma":[0.0001792247,0.00010825663,0.00017463807,0.00017052895,0.000017110773,0.000008394129,7.776434e-7,0.026613183,0.00049228646,0.9508869,0.020972926,0.0003757465],"about_ca_topic_score_codex":0.00005973231,"about_ca_topic_score_gemma":0.00024282461,"teacher_disagreement_score":0.4076315,"about_ca_system_score_codex":0.0001229443,"about_ca_system_score_gemma":0.00048564296,"threshold_uncertainty_score":0.9999568},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31258,0.0010186344,0.6851897,0.000021892722,0.00028752146,0.0006982254,0.00001993866,0.00008289372,0.00010120373],"genre_scores_gemma":[0.95152396,0.000031698837,0.048206314,0.000063020314,0.000075523276,0.0000070223327,0.00006110456,0.000008267978,0.000023095385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825096,0.000042341944,0.000668492,0.00041481102,0.00015934049,0.00046405944],"domain_scores_gemma":[0.99823046,0.00026925,0.0002881104,0.00087095273,0.00024042957,0.000100822625],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002060339,0.00019781028,0.00032060783,0.00024997912,0.00087951095,0.0018218461,0.00079184497,0.000095259944,1.8380412e-7],"category_scores_gemma":[0.000102775186,0.00019441737,0.000026735845,0.00043188824,0.000081456084,0.0010885956,0.0029909564,0.0001415515,1.7453475e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001503104,0.000058451446,0.008650035,0.00832615,0.00011888315,0.0000045200436,0.01756638,0.0041515003,0.0000265956,0.9472345,0.00085888477,0.0129890805],"study_design_scores_gemma":[0.00053181255,0.0000374719,0.00044021633,0.0002878119,0.000030753028,0.000025677162,0.008907054,0.9811469,0.0000062469107,0.002507322,0.005873367,0.0002053708],"about_ca_topic_score_codex":0.00016029163,"about_ca_topic_score_gemma":0.000002632671,"teacher_disagreement_score":0.9769954,"about_ca_system_score_codex":0.00004191138,"about_ca_system_score_gemma":0.0000820814,"threshold_uncertainty_score":0.99921435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111391125,0.0006862142,0.9785525,0.002485765,0.0004466173,0.00034485312,0.000016899648,0.00020984003,0.0061182077],"genre_scores_gemma":[0.78711784,0.00074509677,0.2114859,0.00022085817,0.00003388029,0.00016418747,0.00008447798,0.000008831751,0.00013893747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989576,0.00013111324,0.0003330774,0.00029108505,0.00007397111,0.00021320276],"domain_scores_gemma":[0.9979467,0.00025901227,0.0000973602,0.0014910474,0.00016740017,0.000038496135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037372918,0.0001234169,0.00017109765,0.0003450303,0.00047078595,0.00017799082,0.0013501216,0.0000836469,0.00000197635],"category_scores_gemma":[0.00010424646,0.00013924862,0.000069608934,0.0011066857,0.000109556866,0.0004000669,0.0003433816,0.00032928097,0.00001949222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005594331,0.00075298606,0.0034140379,0.0001068909,0.00008290863,0.0000014347635,0.0009370603,0.025381837,0.005608111,0.23973027,0.011217593,0.7127109],"study_design_scores_gemma":[0.00066145847,0.000033131248,0.0010123504,0.000081290855,0.000009182349,0.000005795879,0.000031960324,0.9611459,0.00028842673,0.015249141,0.021316485,0.00016488113],"about_ca_topic_score_codex":0.000031738997,"about_ca_topic_score_gemma":0.0009261456,"teacher_disagreement_score":0.9357641,"about_ca_system_score_codex":0.000076205855,"about_ca_system_score_gemma":0.00015913282,"threshold_uncertainty_score":0.5678394},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35746914,0.0009167304,0.64065987,0.000064330634,0.000684792,0.00010325042,0.0000026845464,0.00005059844,0.000048583086],"genre_scores_gemma":[0.82202744,0.000041735293,0.1778183,0.000033210166,0.00006329223,0.0000031171255,0.0000013046676,0.000011501011,7.6407176e-8],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729663,0.00021663948,0.0008963846,0.0002239098,0.0011006107,0.00026580214],"domain_scores_gemma":[0.99728143,0.00019513704,0.00052070693,0.00046743182,0.0014356085,0.0000996625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00426132,0.00021482463,0.00040229125,0.0020247966,0.000091664035,0.00012824763,0.00074718025,0.00012337512,0.00002244917],"category_scores_gemma":[0.00035862028,0.00021420055,0.00030293674,0.0027670604,0.000048589747,0.0010123891,0.00009649135,0.00036306732,4.3542e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080239675,0.00047553322,0.0028462813,0.0006077365,0.0006244508,0.000034283265,0.0010524878,0.22619593,0.56608313,0.18471578,0.0001573069,0.017126827],"study_design_scores_gemma":[0.0017574637,0.0001340763,0.014120541,0.0010996962,0.00038008858,0.000056608285,0.000071831695,0.9363169,0.011527359,0.0339975,0.00022638058,0.0003115605],"about_ca_topic_score_codex":0.000019547246,"about_ca_topic_score_gemma":0.0000029743128,"teacher_disagreement_score":0.710121,"about_ca_system_score_codex":0.00007799004,"about_ca_system_score_gemma":0.00036095642,"threshold_uncertainty_score":0.8734845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029967304,0.0006571831,0.9936699,0.00014994631,0.00010486103,0.0012314562,0.0010373776,0.00005373482,0.00009876494],"genre_scores_gemma":[0.9942194,0.00034577877,0.0027877607,0.00046481693,0.00006594775,0.0011873432,0.0009152731,0.0000060868597,0.0000075976936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986672,0.000064480286,0.00032016129,0.0005822204,0.00012345616,0.00024250257],"domain_scores_gemma":[0.99824935,0.00016987366,0.00011337775,0.0013377918,0.00006487834,0.000064743836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033769934,0.00014743101,0.0002211661,0.00014362359,0.00014649743,0.000138579,0.0012804851,0.000106303836,0.000015065046],"category_scores_gemma":[0.0000062721488,0.00014039004,0.000043366123,0.00092098815,0.00007262064,0.00038368016,0.00046516577,0.00020400058,0.0000024065055],"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.00015978666,0.004664498,0.09475957,0.00028198454,0.000109715205,0.0000051720635,0.0001092363,0.54033273,0.00015774634,0.17031375,0.025478281,0.16362752],"study_design_scores_gemma":[0.00160163,0.000043361597,0.01164113,0.00007014474,0.000016029722,6.2367167e-7,0.000019647832,0.91874415,0.000046763173,0.0005983257,0.06705832,0.00015988799],"about_ca_topic_score_codex":0.00005102059,"about_ca_topic_score_gemma":0.00013946545,"teacher_disagreement_score":0.9912227,"about_ca_system_score_codex":0.000018392355,"about_ca_system_score_gemma":0.000043436594,"threshold_uncertainty_score":0.572494},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059063148,0.0025511347,0.9338001,0.00024371274,0.003909729,0.0002949306,0.000012231888,0.000046966074,0.000078049685],"genre_scores_gemma":[0.8658837,0.000109461864,0.13367574,0.000067597786,0.000240845,0.0000018345738,0.0000037482248,0.000015452022,0.0000016323993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645925,0.00034796784,0.0013475488,0.0004690653,0.0009772402,0.00039892536],"domain_scores_gemma":[0.99524784,0.0014646002,0.001496672,0.0006031378,0.000983586,0.00020417871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029570875,0.00040817255,0.0012729907,0.00090816297,0.00035482243,0.0004964384,0.0011597928,0.00037996806,0.0000030457804],"category_scores_gemma":[0.00036727253,0.00037974233,0.0003769524,0.0029117826,0.00020202306,0.0007699631,0.0004983472,0.0009399532,2.9123328e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009928533,0.00060334156,0.00015279329,0.000398884,0.0006449951,0.000020803192,0.0005322292,0.00023047416,0.00052653224,0.99605364,0.000336686,0.00040036096],"study_design_scores_gemma":[0.003007069,0.00030789574,0.00027756527,0.00046722498,0.00042444532,0.000007719756,0.00014740147,0.17877786,0.0012071832,0.81484556,0.00019721955,0.00033286228],"about_ca_topic_score_codex":0.000010828938,"about_ca_topic_score_gemma":0.0000031254094,"teacher_disagreement_score":0.8068205,"about_ca_system_score_codex":0.0000700306,"about_ca_system_score_gemma":0.0002918389,"threshold_uncertainty_score":0.9998655},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012522282,0.0006991504,0.9826409,0.00058074645,0.004372145,0.0005362219,0.00015852934,0.0002410034,0.01064604],"genre_scores_gemma":[0.404743,0.00017789849,0.5900812,0.0028184988,0.0014420983,0.00003377975,0.00011818471,0.000072510375,0.0005128145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949288,0.000064474065,0.0006808593,0.0026424294,0.00083208067,0.00085140346],"domain_scores_gemma":[0.9951695,0.0013918275,0.00032964104,0.002469274,0.00035595128,0.00028375833],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000560532,0.0008437943,0.0008709818,0.0012735392,0.00034582245,0.0010148787,0.0059628086,0.00051079434,0.00007107904],"category_scores_gemma":[0.00011692387,0.0008009513,0.00037298392,0.0012815442,0.0011534225,0.0011830666,0.0027102495,0.0014985898,0.0001529814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053183452,0.00031186416,0.00010326213,0.00012440099,0.0001328325,0.00022166033,0.008500864,0.0013377798,0.00042804363,0.09520687,0.0025972591,0.890982],"study_design_scores_gemma":[0.0010488556,0.00037092352,0.00075867434,0.0019077641,0.00005560237,0.000024192748,0.0000010945172,0.36767265,0.0062064747,0.597867,0.022035507,0.0020512803],"about_ca_topic_score_codex":0.00013546129,"about_ca_topic_score_gemma":0.0004202788,"teacher_disagreement_score":0.8889307,"about_ca_system_score_codex":0.00030485814,"about_ca_system_score_gemma":0.00097260287,"threshold_uncertainty_score":0.9994441},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010575295,0.0011238293,0.99297136,0.00063184253,0.0010991591,0.00037900306,0.000032764216,0.00021472832,0.003441558],"genre_scores_gemma":[0.35475487,0.00025924592,0.6419514,0.0024457378,0.000354778,0.00000802873,0.0000493245,0.000031989573,0.0001446323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964887,0.00004377603,0.0004637919,0.0017176706,0.00073827757,0.0005477898],"domain_scores_gemma":[0.99710166,0.0012126153,0.00021764034,0.0010661414,0.00022262121,0.00017929719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064234814,0.0005369733,0.00052522897,0.0009948559,0.00035769804,0.0007788591,0.0021126044,0.0003641772,0.00001104381],"category_scores_gemma":[0.00012567242,0.0005121064,0.00011515173,0.0008712321,0.00064446474,0.00067727396,0.0017781184,0.0008488948,0.000010377325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008604958,0.000033487086,0.00007409064,0.00011510641,0.000016928487,0.00018450888,0.0007583989,0.011270087,0.000026908689,0.13924117,0.000113114125,0.8481576],"study_design_scores_gemma":[0.00029293593,0.00011561547,0.00010772571,0.0003674173,0.000011847709,0.000059190377,2.1803812e-7,0.6657943,0.000120408586,0.32912472,0.0034184083,0.0005872289],"about_ca_topic_score_codex":0.000029791723,"about_ca_topic_score_gemma":0.00014724601,"teacher_disagreement_score":0.84757036,"about_ca_system_score_codex":0.00011698284,"about_ca_system_score_gemma":0.00038252748,"threshold_uncertainty_score":0.99973303},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004195068,0.0010770699,0.9791152,0.0014512343,0.0013334141,0.00036850738,0.000049731592,0.00031613407,0.016284553],"genre_scores_gemma":[0.05244606,0.0001077169,0.9339519,0.012164058,0.00087554357,0.000021576818,0.000052984746,0.00004187247,0.0003382618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566746,0.00004837349,0.0004943971,0.0018754671,0.0010552008,0.0008590861],"domain_scores_gemma":[0.99632794,0.0006766581,0.00022860667,0.0022619986,0.00028611685,0.00021866731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006975747,0.00063792523,0.000574832,0.0023222885,0.0003980665,0.00087155396,0.0052844854,0.0004814759,0.000038240698],"category_scores_gemma":[0.00018192572,0.00060092413,0.00025085543,0.0018507072,0.0008437073,0.00063986884,0.0016205148,0.001141326,0.000023610039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009960324,0.00006005552,0.0000108865925,0.00008420817,0.000013947175,0.00009942582,0.00016959806,0.0066010086,0.00007409175,0.5979303,0.00037577192,0.3945707],"study_design_scores_gemma":[0.00038221062,0.00014854792,0.00009440847,0.00057993975,0.000010880153,0.00001451005,8.228514e-8,0.24976785,0.002159301,0.72967756,0.016312227,0.00085246365],"about_ca_topic_score_codex":0.000090043395,"about_ca_topic_score_gemma":0.00016276847,"teacher_disagreement_score":0.39371827,"about_ca_system_score_codex":0.0002504869,"about_ca_system_score_gemma":0.0022271334,"threshold_uncertainty_score":0.9996442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003148238,0.0008748496,0.9923878,0.0005415044,0.0018021102,0.0003672418,0.000019908008,0.00024259833,0.003449194],"genre_scores_gemma":[0.105864204,0.00027463827,0.8896727,0.0033917225,0.0004967286,0.0000137956395,0.000039586615,0.000036239613,0.00021037796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576735,0.000051393352,0.0005259079,0.002171571,0.0007664123,0.0007173528],"domain_scores_gemma":[0.99677116,0.00030917715,0.00021162054,0.0022114583,0.00019260721,0.00030396195],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000813391,0.0005937928,0.00056354026,0.0010445111,0.00030624008,0.0012418606,0.0038797022,0.00041353094,0.0000140539505],"category_scores_gemma":[0.00005813463,0.0005505082,0.00012156823,0.0012539801,0.00084329763,0.0013224494,0.0025668393,0.0009290674,0.000015591155],"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.0000092147275,0.000053340616,0.0004023985,0.00004333084,0.000011014605,0.00007394993,0.0007105518,0.00045275202,0.000010916765,0.19543557,0.000098967575,0.802698],"study_design_scores_gemma":[0.0005963384,0.00049972,0.0013543747,0.0009220628,0.00002759614,0.00007870578,4.6263673e-7,0.15273051,0.00020748652,0.82938606,0.012523957,0.0016727293],"about_ca_topic_score_codex":0.000042470285,"about_ca_topic_score_gemma":0.00010321914,"teacher_disagreement_score":0.8010253,"about_ca_system_score_codex":0.000098825265,"about_ca_system_score_gemma":0.00035689864,"threshold_uncertainty_score":0.99979496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034286666,0.0023972054,0.9864585,0.00050727325,0.002831386,0.00050161965,0.0001539108,0.0002903677,0.006825466],"genre_scores_gemma":[0.12665828,0.00017386266,0.86662877,0.005166637,0.0010265277,0.000025207775,0.00008882315,0.000046516354,0.00018538153],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504846,0.00003875839,0.0005778161,0.0025484746,0.0009834917,0.0008029851],"domain_scores_gemma":[0.99576247,0.0008271058,0.00030260233,0.0026052396,0.00027535553,0.00022723016],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00058246445,0.00076651154,0.00071612996,0.0010511539,0.0003630869,0.000868863,0.006334181,0.0006413307,0.000044529967],"category_scores_gemma":[0.00008567581,0.00069761253,0.0002726993,0.0011176292,0.00087847735,0.0009593862,0.0032748117,0.0016972489,0.000021573362],"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.000036085352,0.00007784882,0.000040854084,0.00003403189,0.00006423509,0.0001404447,0.0008848173,0.002621654,0.00047161742,0.42386013,0.0006249736,0.5711433],"study_design_scores_gemma":[0.00033660466,0.00015375437,0.0001283246,0.00041049594,0.000018380271,0.000006270378,2.5700209e-7,0.3773791,0.0014376733,0.6154058,0.0038808717,0.00084250094],"about_ca_topic_score_codex":0.00017385618,"about_ca_topic_score_gemma":0.00045935035,"teacher_disagreement_score":0.5703008,"about_ca_system_score_codex":0.00018847326,"about_ca_system_score_gemma":0.0007903973,"threshold_uncertainty_score":0.9995475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007868136,0.00045357086,0.99074614,0.00222678,0.0031131587,0.00052058283,0.000040174,0.00011910294,0.0019936988],"genre_scores_gemma":[0.42492178,0.00013054618,0.5667031,0.0072479844,0.00063975237,0.00003377023,0.00008615646,0.000044848624,0.00019207501],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537253,0.00007245671,0.0007792764,0.002023387,0.0009715041,0.0007808263],"domain_scores_gemma":[0.9960884,0.0012084903,0.00025276662,0.002066544,0.00017820465,0.0002056192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074912445,0.000660142,0.0008411722,0.0012450622,0.00017526666,0.0006602188,0.0047310563,0.00060230965,0.0000999943],"category_scores_gemma":[0.00017081585,0.0006155585,0.00020276652,0.001242218,0.00070945465,0.00090100605,0.0019596864,0.0013699956,0.00003468005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012442088,0.00041256152,0.0018755274,0.00032111377,0.00016576513,0.0008109607,0.011118207,0.006125256,0.0017853837,0.061204545,0.0011834298,0.9148728],"study_design_scores_gemma":[0.0021454163,0.0002847685,0.0023721461,0.0017245673,0.000038815466,0.000018803988,0.0000022655297,0.46620625,0.004674963,0.5171278,0.0032258222,0.0021783418],"about_ca_topic_score_codex":0.00044920377,"about_ca_topic_score_gemma":0.0029821608,"teacher_disagreement_score":0.9126945,"about_ca_system_score_codex":0.00017310878,"about_ca_system_score_gemma":0.0013358322,"threshold_uncertainty_score":0.99962956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001373147,0.0034758225,0.9893066,0.0009084694,0.0014349808,0.0003609524,0.000030937274,0.00020218037,0.0041427356],"genre_scores_gemma":[0.31031105,0.0011011033,0.6825647,0.004923209,0.0006357938,0.000021828204,0.000036075675,0.000050056824,0.00035621633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960467,0.00002717442,0.00045717997,0.0019197757,0.00085954653,0.0006896124],"domain_scores_gemma":[0.99715453,0.000501576,0.00019588096,0.0016993503,0.00023400842,0.00021466092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006521154,0.0005998035,0.0005668882,0.0012464805,0.00038016852,0.0010316096,0.003523762,0.0004407315,0.000017615039],"category_scores_gemma":[0.000062030165,0.0005216613,0.00013554064,0.0009469692,0.0009967941,0.00087512436,0.002664656,0.0012816503,0.000008952037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010733071,0.000037559734,0.00017357543,0.00013692734,0.000021960557,0.0001362139,0.00053573924,0.00072612794,0.00005431383,0.5763784,0.00016940986,0.42161903],"study_design_scores_gemma":[0.000416564,0.00015475013,0.0003172149,0.0008656237,0.0000183844,0.000049427443,2.569629e-7,0.09721948,0.0013665269,0.88587576,0.012669674,0.0010463514],"about_ca_topic_score_codex":0.00003121428,"about_ca_topic_score_gemma":0.00014188178,"teacher_disagreement_score":0.42057267,"about_ca_system_score_codex":0.00010885119,"about_ca_system_score_gemma":0.00042798868,"threshold_uncertainty_score":0.9997235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003281618,0.001690205,0.97680664,0.0013780589,0.00046671397,0.0015755541,0.0037710431,0.00065585173,0.01037434],"genre_scores_gemma":[0.90940905,0.000554652,0.0718277,0.00018048176,0.0005272351,0.0009834525,0.016353322,0.00003452213,0.00012961366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948397,0.0007292411,0.00042985324,0.0015678322,0.0014847445,0.0009485749],"domain_scores_gemma":[0.9961435,0.000373642,0.000107175074,0.0018547563,0.0011803427,0.000340536],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016154007,0.00040341073,0.0004883397,0.0007602813,0.00091085036,0.0017019851,0.0028570592,0.0006325181,0.000047600457],"category_scores_gemma":[0.000182336,0.00039121177,0.00033933442,0.0027146158,0.00020492807,0.00033600713,0.007266281,0.0031045144,0.00004277867],"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.0001812982,0.0019903975,0.0020311284,0.0056966166,0.00045832436,0.00034042916,0.0021052663,0.00088886794,0.00009579453,0.802715,0.16761799,0.015878871],"study_design_scores_gemma":[0.0021534986,0.00049951964,0.011128055,0.0035937894,0.000060880262,0.00008026092,0.0008865681,0.5573456,0.0009389821,0.34214142,0.07872707,0.002444306],"about_ca_topic_score_codex":0.00024742694,"about_ca_topic_score_gemma":0.00004510333,"teacher_disagreement_score":0.9061274,"about_ca_system_score_codex":0.00023299291,"about_ca_system_score_gemma":0.0009476219,"threshold_uncertainty_score":0.99985397},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005554667,0.0010194596,0.9847624,0.00044908738,0.00012356829,0.0029207303,0.00005047163,0.001082179,0.004037469],"genre_scores_gemma":[0.3271286,0.0001046107,0.6667343,0.0013804424,0.00010674936,0.0044623613,0.000049539107,0.00003079427,0.0000026197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730515,0.00013095464,0.0004995801,0.0010714189,0.00030330283,0.0006895897],"domain_scores_gemma":[0.9967533,0.0013457624,0.00021637943,0.0012314897,0.00027969095,0.00017337935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070082734,0.00046840135,0.00049259135,0.001528411,0.0008330023,0.0004902685,0.0012314072,0.00026501957,0.000007153731],"category_scores_gemma":[0.00009159425,0.00043998755,0.00048600326,0.003430355,0.00047748332,0.0005330364,0.00027389824,0.00045666643,0.0000013682193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044923543,0.00037391458,0.004712492,0.0006505768,0.0005347993,0.0000061585547,0.0021590847,0.000018809704,0.0029697793,0.91246647,0.0025590998,0.07309957],"study_design_scores_gemma":[0.0044408957,0.0022335446,0.0023048257,0.0015021776,0.0003708181,0.0000312635,0.0041197976,0.003071339,0.21690056,0.5329408,0.22943301,0.0026509762],"about_ca_topic_score_codex":0.000050476287,"about_ca_topic_score_gemma":0.00007583682,"teacher_disagreement_score":0.3795257,"about_ca_system_score_codex":0.000031416857,"about_ca_system_score_gemma":0.000102155405,"threshold_uncertainty_score":0.9998052},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03457173,0.0008047458,0.93665075,0.0002911354,0.0012258361,0.00028515098,0.00010256003,0.0011744287,0.024893655],"genre_scores_gemma":[0.70899993,0.00006280777,0.2873505,0.00051088183,0.00017982465,0.000054721582,0.00008974793,0.00004170743,0.0027099038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845725,0.000061624494,0.00021908245,0.00056826056,0.0003297213,0.00036404261],"domain_scores_gemma":[0.99887323,0.00016294877,0.000029918723,0.0006893328,0.000108493565,0.00013607084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028017367,0.00017227679,0.00015505345,0.00020946331,0.00026117504,0.00088634604,0.0006289264,0.000073638475,0.00003820675],"category_scores_gemma":[0.00007804709,0.00012147093,0.00012259521,0.001318413,0.00006822701,0.0013288984,0.000280715,0.00018560277,0.00011009969],"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.0000018013523,0.0003231039,0.0026693929,0.00038548437,0.00019030318,0.00027705592,0.0035568958,0.00019165274,0.008852172,0.73914456,0.19729798,0.04710961],"study_design_scores_gemma":[0.00026904276,0.000086586275,0.005467639,0.0001593284,0.00005489278,0.00012652058,0.00031541058,0.32907608,0.004776503,0.009586348,0.64981663,0.0002650309],"about_ca_topic_score_codex":0.0004764781,"about_ca_topic_score_gemma":0.000054560085,"teacher_disagreement_score":0.7295582,"about_ca_system_score_codex":0.000058818754,"about_ca_system_score_gemma":0.00023765287,"threshold_uncertainty_score":0.8547055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03553837,0.00046241697,0.935781,0.0012427536,0.000111189824,0.000067110064,0.000019752453,0.00012586467,0.026651554],"genre_scores_gemma":[0.9685481,0.00008107859,0.030228825,0.0005091601,0.000010198371,0.0000021685526,0.000012228011,0.0000028896839,0.0006053456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994157,0.000029104507,0.000081077036,0.00024513656,0.00007463138,0.00015438008],"domain_scores_gemma":[0.9996135,0.00005150992,0.000008401179,0.00026213296,0.000017282533,0.00004716365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009655173,0.00007019783,0.00008277652,0.000065540466,0.00011661365,0.00017796218,0.00029448268,0.00004015034,0.000043809436],"category_scores_gemma":[0.0000032774963,0.00006335373,0.000025035179,0.00023853577,0.000046487312,0.0005850182,0.00010104371,0.000078254736,0.0000020747125],"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.000011445305,0.00007296512,0.0020165485,0.000025958072,0.00003052639,0.0000052115483,0.00034157268,0.0000027246945,0.00768972,0.8642349,0.09859014,0.026978241],"study_design_scores_gemma":[0.0026096387,0.00016191571,0.005385266,0.00010840564,0.000046464564,0.00000880734,0.00047632717,0.020731313,0.096052095,0.039041262,0.83460706,0.0007714531],"about_ca_topic_score_codex":0.000052759875,"about_ca_topic_score_gemma":0.000019814695,"teacher_disagreement_score":0.93300974,"about_ca_system_score_codex":0.000006684205,"about_ca_system_score_gemma":0.000023375438,"threshold_uncertainty_score":0.258349},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13436145,0.028281359,0.8140159,0.008719834,0.0016519096,0.004822257,0.0030446516,0.0012050779,0.0038975494],"genre_scores_gemma":[0.9240806,0.00044421924,0.07401135,0.00025616755,0.00014445034,0.00027572026,0.0006855486,0.00002952624,0.000072423536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948775,0.0006778198,0.00033649732,0.0016008108,0.0015870122,0.0009203221],"domain_scores_gemma":[0.9959723,0.00077362225,0.00010067646,0.002210442,0.00060359703,0.00033936795],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002214202,0.00040284792,0.0004184021,0.0010883324,0.00049061264,0.00093119446,0.0025139092,0.00070730207,0.00003696854],"category_scores_gemma":[0.00029154538,0.00037926433,0.0002356151,0.001682524,0.0003129001,0.00015234618,0.0056530084,0.0037214297,0.000019501018],"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.00028378057,0.0018067646,0.0022950736,0.014580067,0.00029511107,0.0005244331,0.0030230302,0.00268414,0.0008006749,0.9283123,0.011022735,0.034371864],"study_design_scores_gemma":[0.0013151313,0.00038440232,0.009402298,0.0031336478,0.0000270278,0.000007315169,0.00022571355,0.90962327,0.00021505116,0.052113764,0.022489304,0.0010630621],"about_ca_topic_score_codex":0.000117087155,"about_ca_topic_score_gemma":0.0001452471,"teacher_disagreement_score":0.90693915,"about_ca_system_score_codex":0.00017195854,"about_ca_system_score_gemma":0.0007311717,"threshold_uncertainty_score":0.99986595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3422053,0.00014646622,0.6566079,0.0001715365,0.00007651194,0.000037380658,8.685259e-7,0.00007414958,0.0006798818],"genre_scores_gemma":[0.7866331,0.000009073373,0.21308984,0.00024885757,0.000008239057,0.0000011782022,6.1701644e-7,0.0000013698235,0.000007773622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995209,0.000017682729,0.00008540581,0.00021062949,0.00004702081,0.00011836203],"domain_scores_gemma":[0.9996565,0.000055908295,0.000020628162,0.00021923533,0.000018062978,0.000029643481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008935605,0.00006840712,0.00007501209,0.000091978254,0.00013346918,0.00016867764,0.0002325513,0.000024690184,0.0000051088196],"category_scores_gemma":[0.000016029788,0.000058357462,0.000023075354,0.0003381539,0.000039209895,0.0004885729,0.00032551697,0.00005993611,3.9673031e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027822118,0.000024078427,0.0039351936,0.000026982063,0.00002154269,0.0000010877715,0.0006392497,0.0000016867581,0.032840636,0.94635564,0.00007093901,0.016080156],"study_design_scores_gemma":[0.0014807794,0.00010583213,0.07205036,0.00021837745,0.000033355624,0.000016971673,0.0011704261,0.2853894,0.15995716,0.4657109,0.012822377,0.001044059],"about_ca_topic_score_codex":0.000115137,"about_ca_topic_score_gemma":0.00001699444,"teacher_disagreement_score":0.48064476,"about_ca_system_score_codex":0.000005909984,"about_ca_system_score_gemma":0.000026055957,"threshold_uncertainty_score":0.23797482},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021595892,0.00035960457,0.99557966,0.00030915785,0.0008891153,0.00038895712,0.00006310263,0.000071770504,0.00017902213],"genre_scores_gemma":[0.32074666,0.0002144833,0.6776157,0.00096509955,0.00025057842,0.000008664025,0.00017149016,0.000019144332,0.00000816153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613494,0.00007916506,0.0005367242,0.002157545,0.00060474576,0.0004869124],"domain_scores_gemma":[0.9954965,0.00049549254,0.00026596303,0.0035552655,0.00006926297,0.00011752075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011718692,0.00042579425,0.00041350545,0.0010789882,0.00020211525,0.0005489454,0.004990365,0.0003779451,0.000005765976],"category_scores_gemma":[0.0002182817,0.00043598635,0.000027670034,0.0014991474,0.0006154969,0.001743326,0.0037560654,0.0010973718,0.0000038878625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023207653,0.00014598125,0.0022054042,0.00008214245,0.000019451136,0.00007381805,0.0031112856,0.0013488961,0.00029936802,0.24870633,0.000022245258,0.7439619],"study_design_scores_gemma":[0.00061066553,0.0001795615,0.013454087,0.0013344045,0.000012868618,0.00002797179,0.0000015542604,0.60625625,0.0010471288,0.3690352,0.0067399684,0.00130032],"about_ca_topic_score_codex":0.00007819041,"about_ca_topic_score_gemma":0.00007458476,"teacher_disagreement_score":0.74266154,"about_ca_system_score_codex":0.00015169715,"about_ca_system_score_gemma":0.00030517313,"threshold_uncertainty_score":0.9998092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011898421,0.00085029466,0.9664378,0.01866999,0.00016744241,0.0006345282,0.0000690632,0.00017261169,0.0010998342],"genre_scores_gemma":[0.9771634,0.00003085226,0.020048723,0.0023247332,0.000096978074,0.00019428975,0.000055919754,0.000008514971,0.000076601376],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985729,0.000035386944,0.00016332453,0.0006792541,0.00026954073,0.00027958912],"domain_scores_gemma":[0.9989198,0.00019620504,0.000041162362,0.00053704693,0.000103221944,0.00020257897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036977616,0.00018367473,0.00016486141,0.00023254863,0.0004814676,0.0003213091,0.0003455227,0.0000974209,0.0000017075159],"category_scores_gemma":[0.00001821324,0.00017690814,0.000036518082,0.0011398896,0.00007267312,0.000052490886,0.000266565,0.00023668102,0.0000036591562],"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.000056296096,0.00039314624,0.002670817,0.00013222273,0.00006182303,0.000004992266,0.0013608326,0.009424636,0.00046189484,0.4786229,0.02395224,0.48285818],"study_design_scores_gemma":[0.0005083041,0.00011843102,0.017768718,0.0001599751,0.0000467071,0.0000053716826,0.00006961873,0.40365452,0.000026590431,0.012066561,0.56514186,0.00043334265],"about_ca_topic_score_codex":0.000017187289,"about_ca_topic_score_gemma":0.000039794922,"teacher_disagreement_score":0.965265,"about_ca_system_score_codex":0.000018044668,"about_ca_system_score_gemma":0.000020753425,"threshold_uncertainty_score":0.72141045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031185454,0.004829442,0.9305035,0.008334835,0.0002523881,0.00041597232,0.000018853283,0.00024408998,0.024215458],"genre_scores_gemma":[0.802218,0.00014841817,0.19701588,0.00051019137,0.0000074365307,0.00007128722,0.000019230782,0.0000054425773,0.0000040898462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985139,0.00024023745,0.0003157714,0.0004302936,0.00015289451,0.00034692962],"domain_scores_gemma":[0.99615914,0.00054179144,0.0001067169,0.0030335358,0.00011111037,0.00004770842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164268,0.000175151,0.00024652493,0.00054301484,0.00039082198,0.00011840029,0.003658998,0.00016960196,0.000008588773],"category_scores_gemma":[0.000061740255,0.0001598491,0.000060059432,0.0018883826,0.00040048538,0.0002602828,0.0014410974,0.0006883499,0.000009317162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018236726,0.0002462115,0.004249255,0.000008235683,0.000028188431,0.0000069141624,0.0010563346,0.0006699678,0.00007604406,0.99135417,0.000590594,0.0016958276],"study_design_scores_gemma":[0.002967973,0.00033694436,0.05239749,0.00049179327,0.000061985,0.000078206926,0.0019078648,0.15667067,0.0006254815,0.66555417,0.11776096,0.0011464345],"about_ca_topic_score_codex":0.00007174109,"about_ca_topic_score_gemma":0.0010202156,"teacher_disagreement_score":0.7710326,"about_ca_system_score_codex":0.00007887878,"about_ca_system_score_gemma":0.00016137715,"threshold_uncertainty_score":0.679939},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20979697,0.032331564,0.7184338,0.027615976,0.0018194444,0.001146765,0.0004207413,0.00033302713,0.008101742],"genre_scores_gemma":[0.8559186,0.0044567683,0.13690792,0.0020581202,0.000082268736,0.00021321262,0.00033727038,0.000021371377,0.0000044505505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9951227,0.0013107824,0.0012099243,0.0012130038,0.00034319639,0.00080042385],"domain_scores_gemma":[0.9892914,0.0015107493,0.00017309785,0.008525234,0.0002670641,0.00023239625],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008242449,0.00050329446,0.00078422576,0.0012252458,0.0007784205,0.00038190236,0.008444846,0.00063903484,0.00013765151],"category_scores_gemma":[0.00036413153,0.0006096763,0.0002794117,0.0034817522,0.00091784453,0.00067488104,0.0054330323,0.0013091265,0.00024873624],"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.000037902693,0.0008575096,0.09021061,0.00004861321,0.00016980787,0.00003794608,0.0051298225,0.00011127029,0.0003069886,0.85247594,0.0023605896,0.048252974],"study_design_scores_gemma":[0.00097812,0.000114901966,0.45540565,0.0007687179,0.00014031297,0.000028784882,0.001513873,0.009339884,0.0003038484,0.44041106,0.08995614,0.0010387112],"about_ca_topic_score_codex":0.00172496,"about_ca_topic_score_gemma":0.014614767,"teacher_disagreement_score":0.6461216,"about_ca_system_score_codex":0.00022009664,"about_ca_system_score_gemma":0.0003981434,"threshold_uncertainty_score":0.99963546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026600242,0.0015525549,0.9241495,0.029384378,0.00028665338,0.0008631555,0.00009751804,0.000105182415,0.016960777],"genre_scores_gemma":[0.78385186,0.00120983,0.2122376,0.0010054266,0.000097599586,0.00019264218,0.00004581036,0.000008636245,0.0013505894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987642,0.00016054566,0.00020175714,0.00026173188,0.00034264734,0.00026908622],"domain_scores_gemma":[0.99822843,0.0000941763,0.00000923886,0.0007392627,0.0008682905,0.000060617942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629886,0.00005962657,0.00009723587,0.00045166415,0.00031622712,0.00020938311,0.0008429678,0.00004097431,0.000029573563],"category_scores_gemma":[0.00014281503,0.000054715198,0.000056563145,0.0015381948,0.000108923836,0.00038004084,0.00045113475,0.00018946333,0.000015984582],"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.000009915502,0.00046526303,0.00006403897,0.000034871086,0.00007540837,0.0000043749883,0.0006696849,0.000120534554,0.011699181,0.75708044,0.05560674,0.17416953],"study_design_scores_gemma":[0.0009156731,0.00063571025,0.004078365,0.00013235594,0.0000071424124,0.0000039185525,0.00045938598,0.60082644,0.17381568,0.03213925,0.18661226,0.00037378774],"about_ca_topic_score_codex":0.00042455056,"about_ca_topic_score_gemma":0.00012531776,"teacher_disagreement_score":0.7572516,"about_ca_system_score_codex":0.0000068755016,"about_ca_system_score_gemma":0.00018994046,"threshold_uncertainty_score":0.24321954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27232665,0.0002701357,0.7248381,0.0015558084,0.000054634947,0.0003920902,0.000028841268,0.000031275307,0.00050250225],"genre_scores_gemma":[0.9803142,0.0001159752,0.018964557,0.0005294821,0.000025261552,0.000032126598,0.000014796072,0.0000025617412,0.0000010246605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862814,0.00007610159,0.00061506435,0.00014361062,0.00030873247,0.00022833103],"domain_scores_gemma":[0.99856365,0.00009787368,0.00044601722,0.0003214042,0.0004485063,0.00012252243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007597428,0.00013151744,0.00022393807,0.00060968235,0.00027940408,0.00021539746,0.0003850128,0.000093003146,0.0000051467337],"category_scores_gemma":[0.000028225408,0.000119849785,0.000057172703,0.0014744038,0.00008223798,0.0011127654,0.00008091859,0.00039117268,0.0000023504745],"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.0003950737,0.0005966125,0.0034628322,0.0010941172,0.00008229709,0.0000064566025,0.018621337,0.008688276,0.0008053455,0.93726885,0.00031715556,0.028661674],"study_design_scores_gemma":[0.0072080954,0.0006736371,0.004559381,0.0017006311,0.00007641733,0.00014200201,0.00484052,0.61590606,0.018666727,0.2632083,0.08202245,0.0009957887],"about_ca_topic_score_codex":0.0001842648,"about_ca_topic_score_gemma":0.00014458848,"teacher_disagreement_score":0.70798755,"about_ca_system_score_codex":0.00008802259,"about_ca_system_score_gemma":0.00038710923,"threshold_uncertainty_score":0.48873323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052090953,0.00003044154,0.96581316,0.0014725126,0.00026792838,0.000052300667,6.5916316e-7,0.0002509012,0.026902994],"genre_scores_gemma":[0.960172,0.000007688789,0.03820477,0.0013239245,0.000020958976,0.0000038711664,0.000010499574,0.000001689459,0.00025457397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994216,0.000035908386,0.00010820585,0.0002160617,0.000095535615,0.00012268827],"domain_scores_gemma":[0.999608,0.000053542444,0.000023956398,0.00023683313,0.00004746822,0.000030200661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000127453,0.00006138698,0.00006244999,0.00010860316,0.00020044099,0.0002235155,0.00029222044,0.00003818853,0.000060695133],"category_scores_gemma":[0.00001992317,0.00005428065,0.000033116063,0.000705054,0.00001508167,0.00044744438,0.00014371099,0.00009051984,0.00005410352],"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.00000458022,0.000028811777,0.0011141109,0.0000065504532,0.000010853031,0.0000023310015,0.000112628295,0.000012847895,0.0015495319,0.9254304,0.0049490677,0.066778295],"study_design_scores_gemma":[0.0010216377,0.00007276204,0.039874423,0.00005045975,0.0000140138945,0.000006995019,0.000055187993,0.57780117,0.062214587,0.12045689,0.19794169,0.00049021456],"about_ca_topic_score_codex":0.000069447386,"about_ca_topic_score_gemma":0.00003530014,"teacher_disagreement_score":0.9549629,"about_ca_system_score_codex":0.000009704737,"about_ca_system_score_gemma":0.000029057186,"threshold_uncertainty_score":0.22135006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6756044,0.020662755,0.30090994,0.0004641674,0.000546621,0.0009053806,0.000059108654,0.00004040862,0.0008072252],"genre_scores_gemma":[0.9943272,0.004327094,0.0012121722,0.000023870938,0.0000537266,0.00002294212,0.000021468313,0.0000047381873,0.000006781777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612945,0.00077359454,0.0005589876,0.0005376858,0.00083627127,0.001164026],"domain_scores_gemma":[0.99841744,0.00009105829,0.0004702455,0.00043986744,0.00050689897,0.00007446464],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005583312,0.00026394485,0.0005057027,0.00059323903,0.00012214457,0.00022511663,0.0010720993,0.00020798275,0.0000061764995],"category_scores_gemma":[0.000096962714,0.00026195846,0.00016736586,0.0008234326,0.0000808293,0.0007587863,0.0006590808,0.0031756524,8.567678e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009794135,0.00031719496,0.01813659,0.000095639094,0.0005198064,0.0000020914306,0.0047981143,0.00095072266,0.000102375394,0.9614907,0.00013341724,0.013355415],"study_design_scores_gemma":[0.0013691339,0.00011635916,0.02131377,0.0002506621,0.000121014746,0.00003985006,0.00045068498,0.01954358,0.00018625196,0.95631915,0.000040997216,0.0002485611],"about_ca_topic_score_codex":0.00032067855,"about_ca_topic_score_gemma":0.010413747,"teacher_disagreement_score":0.3187228,"about_ca_system_score_codex":0.00085466553,"about_ca_system_score_gemma":0.006191273,"threshold_uncertainty_score":0.99998325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16202915,0.00019268812,0.8349624,0.00010501146,0.0013430064,0.00033721735,0.0000019945537,0.00017796968,0.00085053314],"genre_scores_gemma":[0.97358125,0.000043277047,0.025921242,0.00032542594,0.000059402162,0.000037574497,0.000008536123,0.000007044286,0.000016247861],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968896,0.0000832944,0.0004557884,0.0011797561,0.00061669416,0.00077485375],"domain_scores_gemma":[0.9989259,0.0001289272,0.00014553983,0.00054285885,0.00007596155,0.00018079126],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001204678,0.0002670011,0.00028819297,0.000842456,0.00069663255,0.0012054469,0.002178056,0.00008761418,0.0000015918014],"category_scores_gemma":[0.00007844635,0.00026574844,0.000060547467,0.004047515,0.0002738279,0.001814441,0.0013740092,0.00043120023,0.000033937104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007446808,0.0014780804,0.43451673,0.0008621124,0.00012551165,0.00034061685,0.011878431,0.11566073,0.043168973,0.13762502,0.0027104178,0.25155893],"study_design_scores_gemma":[0.00050539966,0.000059404563,0.025543319,0.0002155657,0.0000031421764,0.000008579159,0.000052254323,0.96902704,0.0018213391,0.00044649324,0.0019731,0.00034433982],"about_ca_topic_score_codex":0.000047290065,"about_ca_topic_score_gemma":0.000012226385,"teacher_disagreement_score":0.8533663,"about_ca_system_score_codex":0.00019418258,"about_ca_system_score_gemma":0.00027177075,"threshold_uncertainty_score":0.9999795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082243074,0.00249477,0.9873914,0.00071901834,0.0015913771,0.00033516897,0.000039241066,0.00021415608,0.0071326103],"genre_scores_gemma":[0.08826503,0.0017305566,0.900249,0.00767221,0.0010254477,0.000035686346,0.0000903008,0.00006663661,0.0008651024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652463,0.000033691853,0.00040425258,0.0017419596,0.00067818654,0.00061727985],"domain_scores_gemma":[0.99748427,0.0003949938,0.00017848721,0.0015676534,0.00017368958,0.00020091023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006925891,0.00051418686,0.0005006567,0.0011252739,0.00030321523,0.0007424147,0.0029883229,0.00023401895,0.00003635607],"category_scores_gemma":[0.00007096264,0.00048355848,0.00011709435,0.00071197544,0.000803946,0.0006993117,0.00263983,0.00075129047,0.000015926818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005255357,0.000026995353,0.00004969692,0.00009312533,0.000013677657,0.000105968415,0.00055786525,0.0001422215,0.000028019507,0.1398096,0.0003417218,0.85882586],"study_design_scores_gemma":[0.0005639204,0.00020993827,0.00037303657,0.0007144568,0.00001987447,0.00014946492,1.502456e-7,0.22168276,0.0007904031,0.7197161,0.054513313,0.0012666475],"about_ca_topic_score_codex":0.000054917316,"about_ca_topic_score_gemma":0.00008885882,"teacher_disagreement_score":0.8575592,"about_ca_system_score_codex":0.00009921448,"about_ca_system_score_gemma":0.00034248107,"threshold_uncertainty_score":0.9997616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021178486,0.0012739019,0.9959968,0.0004219592,0.0007558707,0.00078478426,0.00012968302,0.00012946512,0.0004863958],"genre_scores_gemma":[0.0077252416,0.00013309851,0.9904898,0.00091783836,0.0005232298,0.00010569516,0.00006476591,0.000013694361,0.000026629496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735683,0.000016970216,0.00034826223,0.0014737486,0.00040349376,0.00040071653],"domain_scores_gemma":[0.9970478,0.0011000164,0.00017852918,0.0013468198,0.00019804653,0.00012883462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041301304,0.000356624,0.00038548897,0.0005090132,0.00037165606,0.0006946113,0.0020392314,0.00041350632,0.000009301212],"category_scores_gemma":[0.00008306721,0.00035252827,0.0001021719,0.00066121813,0.0005582469,0.0005788033,0.0009001498,0.00060740666,0.000004718547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068460467,0.000019310433,0.000026141823,0.00003985337,0.000008884138,0.0000021817648,0.00022342341,0.00040253127,0.000023362949,0.6010782,0.00002103904,0.39814818],"study_design_scores_gemma":[0.00015961697,0.00006300419,0.00006846887,0.00028977578,0.000011890972,0.000003386104,1.8788984e-7,0.12932213,0.00020610908,0.86019427,0.009342948,0.00033824533],"about_ca_topic_score_codex":0.0000581345,"about_ca_topic_score_gemma":0.000048588216,"teacher_disagreement_score":0.39780995,"about_ca_system_score_codex":0.00007303964,"about_ca_system_score_gemma":0.000323995,"threshold_uncertainty_score":0.99989265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022598702,0.0003171797,0.9937401,0.00043228388,0.0014912145,0.00036716304,0.000078741956,0.000100419085,0.0032469013],"genre_scores_gemma":[0.17022991,0.00011730404,0.82783514,0.0012972449,0.0002521102,0.00001575902,0.00015384852,0.000023472627,0.00007519615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691826,0.00003438555,0.0006746836,0.0011520083,0.00073663174,0.00048404807],"domain_scores_gemma":[0.9971464,0.0005066998,0.00035008273,0.0013794824,0.00050369214,0.000113591705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072128925,0.00037012916,0.0004525415,0.0010661673,0.0003123038,0.0003366451,0.0024984763,0.00021372271,0.000062983214],"category_scores_gemma":[0.00011893501,0.00036947484,0.00017223413,0.0012606544,0.00042461744,0.00089433603,0.0012218407,0.0004888457,0.00001283709],"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.000009068112,0.00004976051,0.00020508964,0.000101941565,0.000026660813,0.000018071687,0.00093239074,0.0030461974,0.00040411632,0.391136,0.00012052387,0.6039502],"study_design_scores_gemma":[0.000548767,0.0002596401,0.0008486322,0.00069809455,0.00002822525,0.000028483375,0.0000017206355,0.30923563,0.0035980474,0.6780979,0.0058033066,0.00085153914],"about_ca_topic_score_codex":0.00012999006,"about_ca_topic_score_gemma":0.0001740358,"teacher_disagreement_score":0.6030987,"about_ca_system_score_codex":0.00011798465,"about_ca_system_score_gemma":0.0007228625,"threshold_uncertainty_score":0.9998757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5219597,0.0065266085,0.40090504,0.016340764,0.00404695,0.0075156335,0.0014663317,0.0011531026,0.04008581],"genre_scores_gemma":[0.9497371,0.000018329358,0.05003173,0.000094077936,0.000030675426,0.000040967447,0.000011719901,0.0000034853067,0.00003194881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991355,0.000004763172,0.00018372945,0.00035080497,0.00018330093,0.00014190208],"domain_scores_gemma":[0.9992987,0.00005624126,0.00010454225,0.000383164,0.00011763355,0.000039702398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039602423,0.00008300589,0.000114763745,0.00007966535,0.00018663016,0.000120653094,0.0013375026,0.000034024768,7.789458e-7],"category_scores_gemma":[0.000058131987,0.000060383303,0.000034189976,0.00032878894,0.000051171544,0.00076814095,0.0010899215,0.000058327907,4.3769631e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001296107,0.00006230245,0.0030727172,0.00020493724,0.000025990483,4.201893e-8,0.0001918577,0.0000016563798,0.0013335575,0.9882578,0.0037560558,0.0030800884],"study_design_scores_gemma":[0.006371885,0.0006955225,0.054660678,0.001909817,0.00043883573,0.000082969316,0.0031981738,0.23751287,0.10952001,0.46833417,0.11607564,0.0011994274],"about_ca_topic_score_codex":0.000031769043,"about_ca_topic_score_gemma":0.0000041782264,"teacher_disagreement_score":0.5199237,"about_ca_system_score_codex":0.000022930903,"about_ca_system_score_gemma":0.000032881613,"threshold_uncertainty_score":0.24854349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017376147,0.0012120507,0.98517567,0.000983247,0.00172887,0.00029427762,0.000015876452,0.00021469964,0.010357905],"genre_scores_gemma":[0.050421562,0.00036100915,0.9435874,0.0042141164,0.0011340511,0.000013205679,0.000034070774,0.000031679043,0.00020289526],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962944,0.00003903566,0.0005225036,0.0016623657,0.00086821266,0.00061348756],"domain_scores_gemma":[0.99702466,0.0005353185,0.00024046832,0.0018325853,0.00021397306,0.00015298437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010403668,0.0004760654,0.0004994748,0.0010295534,0.00033127062,0.00068667147,0.0038306657,0.00029601043,0.00002547464],"category_scores_gemma":[0.00012215831,0.0004537554,0.0001927322,0.0009802433,0.0004501231,0.0006920686,0.0023472067,0.00091482414,0.000033447966],"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.0000024412084,0.000012435055,0.000038533464,0.00006043137,0.0000062356075,0.00005176266,0.00024250027,0.00078754546,0.000026172354,0.25581333,0.000086000466,0.7428726],"study_design_scores_gemma":[0.00034297278,0.00011707326,0.00021899783,0.0020337256,0.000017803211,0.00005934006,2.1144353e-7,0.31344128,0.00091932685,0.6606396,0.021033634,0.0011760612],"about_ca_topic_score_codex":0.00002318464,"about_ca_topic_score_gemma":0.000024106603,"teacher_disagreement_score":0.74169654,"about_ca_system_score_codex":0.0001907759,"about_ca_system_score_gemma":0.00047698242,"threshold_uncertainty_score":0.99979144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014293131,0.00014175026,0.9717095,0.0007246267,0.00019137148,0.00026610564,0.00000280096,0.00013798934,0.025396578],"genre_scores_gemma":[0.96123976,0.000028296563,0.03805774,0.00041290783,0.000018120847,0.000032008273,0.00006451938,0.0000030275116,0.00014364801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902093,0.0001520307,0.00024428673,0.00030792062,0.00014195709,0.00013288582],"domain_scores_gemma":[0.999339,0.00008789845,0.000059664915,0.00041715222,0.00007726419,0.000019062816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003298527,0.00009376526,0.00010654289,0.00020422267,0.000070740396,0.00015600395,0.00038089172,0.00007541807,0.000004236633],"category_scores_gemma":[0.00004644314,0.00008590845,0.000027697566,0.0013362429,0.000025011073,0.00081314845,0.000096051066,0.00010597266,0.000007901317],"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.000012305459,0.00004428488,0.000115161136,0.000008555497,0.0000046993164,8.060565e-7,0.0008735987,0.001797599,0.0001878468,0.99107325,0.0019704087,0.003911502],"study_design_scores_gemma":[0.0005565727,0.00006112876,0.002895713,0.00015559062,0.0000064644573,0.0000017379513,0.0017733738,0.91041464,0.002629518,0.071376935,0.0099070715,0.00022127612],"about_ca_topic_score_codex":0.00077920256,"about_ca_topic_score_gemma":0.00037822034,"teacher_disagreement_score":0.95981044,"about_ca_system_score_codex":0.000062323285,"about_ca_system_score_gemma":0.000048926748,"threshold_uncertainty_score":0.35032448},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29907644,0.00004161791,0.69868845,0.00037598264,0.00035703738,0.00011764926,0.0000099889385,0.00027687263,0.001055977],"genre_scores_gemma":[0.93989706,0.0000058846504,0.05937324,0.0006259487,0.000035554986,0.000009589393,0.000032704284,0.000004955524,0.000015043966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984026,0.00008383268,0.00026265095,0.00060278777,0.00027539532,0.0003727377],"domain_scores_gemma":[0.99841976,0.000052228297,0.000045599478,0.0012847057,0.000055359207,0.0001423688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016549976,0.00018868463,0.00017312463,0.00020250943,0.000185659,0.00028164245,0.001460359,0.00009797975,0.00011842138],"category_scores_gemma":[0.000013493254,0.00015947994,0.000103241466,0.00072828884,0.00012400464,0.00042469602,0.0005878004,0.00020162667,0.000038459024],"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.0000059745366,0.0002611345,0.0014587506,0.000016227661,0.000021196793,0.000004895209,0.00014627106,0.000081941726,0.0023858813,0.9925827,0.0005974588,0.0024376079],"study_design_scores_gemma":[0.0021935974,0.0002906826,0.10476284,0.00011314238,0.000038865586,0.000014567855,0.00020618942,0.49839056,0.022824124,0.36461538,0.0053156065,0.0012344461],"about_ca_topic_score_codex":0.00011603132,"about_ca_topic_score_gemma":0.000028242654,"teacher_disagreement_score":0.6408206,"about_ca_system_score_codex":0.000039106726,"about_ca_system_score_gemma":0.000099128454,"threshold_uncertainty_score":0.6503403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023013953,0.000046621397,0.9727792,0.00096013426,0.00015529174,0.0007967022,0.000041834286,0.00049035985,0.0017159049],"genre_scores_gemma":[0.54268473,0.00007480586,0.45531243,0.0006519747,0.00012180039,0.000612946,0.00039445065,0.000017793383,0.00012907421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826705,0.000102851336,0.00027989177,0.00089666207,0.0001732283,0.00028029873],"domain_scores_gemma":[0.99824226,0.00009513436,0.00017321165,0.0011904872,0.00016313231,0.00013579836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028268818,0.00026531055,0.00025593292,0.00026727185,0.00025469737,0.0002316277,0.0012968733,0.00016370899,0.000020287267],"category_scores_gemma":[0.000054232514,0.00025479743,0.00008605873,0.00095036346,0.00006503275,0.00025202963,0.0014685028,0.00059606676,0.000042735293],"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.000046003133,0.00024323161,0.12516253,0.0003130065,0.00020118726,0.000015409763,0.0015599622,0.6512273,0.00023342925,0.20920652,0.00051438797,0.011277037],"study_design_scores_gemma":[0.00368601,0.00082295795,0.23478764,0.0023407773,0.00045026687,0.000037275684,0.00051099126,0.4926231,0.0062325336,0.028284146,0.22391126,0.006313063],"about_ca_topic_score_codex":0.000036826004,"about_ca_topic_score_gemma":0.0000168704,"teacher_disagreement_score":0.5196708,"about_ca_system_score_codex":0.000037456703,"about_ca_system_score_gemma":0.00020769052,"threshold_uncertainty_score":0.9999904},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045478653,0.00015762859,0.94993144,0.0013267125,0.00069698686,0.00093654246,0.000026896534,0.0004194061,0.0010257576],"genre_scores_gemma":[0.7683515,0.0000012915074,0.22941653,0.0020707732,0.00008248409,0.000010195423,0.00005338333,0.000011047242,0.0000028173379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964112,0.00045514287,0.0007764734,0.0013206018,0.00035157372,0.00068500615],"domain_scores_gemma":[0.995813,0.00074875605,0.00017523485,0.0029502911,0.00015051616,0.0001621761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027271,0.00030998964,0.00042448545,0.0009071252,0.0003210693,0.00060602895,0.004695394,0.00015919791,0.00000606768],"category_scores_gemma":[0.00025135608,0.00034101063,0.00011863156,0.0032153623,0.00010217616,0.0007891757,0.006168526,0.00054173806,0.000012143784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031245657,0.0028145355,0.2089551,0.0028362763,0.0003819044,0.00025459955,0.008647328,0.026088947,0.0035771057,0.535731,0.030192174,0.18020855],"study_design_scores_gemma":[0.0012105834,0.00005535186,0.026948733,0.00082053506,0.000019980927,0.0000072989865,0.000082571794,0.953775,0.00093080266,0.0097996965,0.0057820166,0.0005674668],"about_ca_topic_score_codex":0.000450746,"about_ca_topic_score_gemma":0.0004339789,"teacher_disagreement_score":0.92768604,"about_ca_system_score_codex":0.00005413013,"about_ca_system_score_gemma":0.00018038564,"threshold_uncertainty_score":0.9999042},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060460594,0.0038003563,0.73049724,0.111661926,0.0023293959,0.0010108412,0.000034086752,0.00044149772,0.089764066],"genre_scores_gemma":[0.95447475,0.00048525652,0.03871194,0.005948762,0.000030013223,0.0002724286,0.000030347868,0.000009083191,0.00003741018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820864,0.00059281115,0.0003691913,0.00038424338,0.00014441148,0.00030072188],"domain_scores_gemma":[0.9938305,0.0012906832,0.00009679786,0.0046564215,0.00008586742,0.000039754774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066457735,0.00016695571,0.00020925827,0.0003742356,0.00054833107,0.00014136435,0.0038036045,0.00015258645,0.00008149432],"category_scores_gemma":[0.00017028638,0.00013382887,0.0001149603,0.0014393515,0.0004694215,0.00027990632,0.00089314365,0.0006290711,0.00011127109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027517292,0.00030541752,0.0004364468,0.0000044168546,0.000029584242,0.0000018533585,0.00036933902,0.000010450864,0.0001022688,0.9794129,0.009821077,0.009478743],"study_design_scores_gemma":[0.00064347003,0.00013703505,0.014416335,0.000053049353,0.000020965213,0.000009110339,0.00020628017,0.0052730124,0.00018051242,0.61395806,0.3648707,0.00023144594],"about_ca_topic_score_codex":0.00005589815,"about_ca_topic_score_gemma":0.0005681381,"teacher_disagreement_score":0.8940142,"about_ca_system_score_codex":0.000058462203,"about_ca_system_score_gemma":0.0001166163,"threshold_uncertainty_score":0.70681065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024550417,0.00080719887,0.95860624,0.0066859834,0.00016194322,0.0002586242,0.0000048044753,0.00023470691,0.008690059],"genre_scores_gemma":[0.67265934,0.00021466958,0.32674107,0.00025815595,0.0000057810366,0.00006879778,0.000040611667,0.0000053269655,0.0000062493023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983279,0.00050447445,0.00034294697,0.0003975042,0.00013471821,0.0002924313],"domain_scores_gemma":[0.99678075,0.00044467024,0.0001348451,0.0024778657,0.00011661698,0.000045239925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000473735,0.00016119915,0.00023706141,0.0005330574,0.00039428563,0.000083580584,0.0025460818,0.00016809195,0.000017856097],"category_scores_gemma":[0.00013880925,0.00015940871,0.000055127115,0.001615336,0.00022952324,0.00044339098,0.0010521692,0.0006705879,0.000022079781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010687116,0.00012490217,0.006510018,0.000008741261,0.00002063973,0.000003217378,0.0016793724,0.00014300097,0.00013893546,0.9869921,0.00012417343,0.004244165],"study_design_scores_gemma":[0.0011963531,0.00013702191,0.01468445,0.00011721771,0.00002466312,0.000029708981,0.000720873,0.07126635,0.00029649684,0.86683357,0.044321883,0.0003714387],"about_ca_topic_score_codex":0.00016782369,"about_ca_topic_score_gemma":0.0015275768,"teacher_disagreement_score":0.6481089,"about_ca_system_score_codex":0.000057159323,"about_ca_system_score_gemma":0.00013274775,"threshold_uncertainty_score":0.65004987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014522792,0.0039640474,0.94732004,0.016759003,0.0009619339,0.00073823007,0.0000069484913,0.00029929142,0.015427688],"genre_scores_gemma":[0.88203746,0.0005157834,0.11582632,0.0011518436,0.000032941294,0.00036832315,0.000049164613,0.000006142096,0.000012049595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998003,0.0005172787,0.00058446365,0.00046568914,0.00012242305,0.00030713557],"domain_scores_gemma":[0.9952241,0.00070396677,0.00016234799,0.0036920197,0.00017780537,0.000039762348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008643739,0.00016651905,0.0003606381,0.00076977187,0.0003721682,0.00019637782,0.004042904,0.00012466597,0.000026524522],"category_scores_gemma":[0.00039832856,0.00016547595,0.00010935726,0.0021051497,0.00023428506,0.00092334946,0.0017706844,0.00047507047,0.000031063693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050456973,0.000232478,0.0101148905,0.000011835325,0.0000390074,9.386699e-7,0.00019762624,0.000052519314,0.00026227505,0.9710679,0.001265689,0.01670436],"study_design_scores_gemma":[0.004019616,0.00005462549,0.050737366,0.00008117045,0.00004667767,0.000011104207,0.00009287842,0.017200675,0.0002435787,0.8479449,0.07918624,0.00038116646],"about_ca_topic_score_codex":0.00016872711,"about_ca_topic_score_gemma":0.00088600355,"teacher_disagreement_score":0.86751467,"about_ca_system_score_codex":0.0000626312,"about_ca_system_score_gemma":0.00015975724,"threshold_uncertainty_score":0.7512789},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077797887,0.0019312911,0.9576731,0.008338929,0.00043209156,0.00066576153,0.000020150412,0.00022580252,0.022933125],"genre_scores_gemma":[0.8009666,0.00029180336,0.1980818,0.00025606636,0.000011564681,0.00030344556,0.000060463037,0.000006918536,0.000021335585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981519,0.0004228776,0.00051077356,0.0004976487,0.00008803787,0.00032876784],"domain_scores_gemma":[0.9939203,0.0014110643,0.00015885208,0.004237487,0.00021629734,0.000055958804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804404,0.00019058493,0.00029275476,0.00066826894,0.00032019307,0.00009770658,0.004155698,0.00018271357,0.0000110332985],"category_scores_gemma":[0.00026641478,0.00020471188,0.000102855265,0.0017204833,0.0002736531,0.0005821752,0.0021070754,0.000558825,0.00012099397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018670564,0.00064993976,0.011731949,0.000022061398,0.000032302392,0.0000015876211,0.0018440558,0.000017281889,0.00033206568,0.95793283,0.00283868,0.02457855],"study_design_scores_gemma":[0.002330313,0.000115396535,0.08696219,0.00019985178,0.000035606987,0.00003374152,0.00032727342,0.10227772,0.0015854501,0.5982274,0.20725209,0.0006529721],"about_ca_topic_score_codex":0.00017650181,"about_ca_topic_score_gemma":0.0013638943,"teacher_disagreement_score":0.7931868,"about_ca_system_score_codex":0.00013035469,"about_ca_system_score_gemma":0.00018001795,"threshold_uncertainty_score":0.8347908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98125374,0.00091648556,0.007913275,0.0028813058,0.0006154991,0.0021809167,0.00004019622,0.00052931317,0.0036692566],"genre_scores_gemma":[0.96671355,0.000010738093,0.03258069,0.00016415659,0.00004031419,0.00040126377,0.0000022416552,0.00001408485,0.00007296577],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984768,0.0000123483005,0.0003306196,0.00050144485,0.00025705903,0.00042173135],"domain_scores_gemma":[0.99820274,0.00033116038,0.0002437807,0.0008633207,0.00030464065,0.000054369706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006266906,0.000234109,0.00031411086,0.00022103173,0.00029299548,0.00022279691,0.0040294994,0.00010107986,0.0000023653986],"category_scores_gemma":[0.0014560745,0.00016855082,0.00015431146,0.0010211187,0.00014218093,0.00044042442,0.0011767677,0.00020245062,0.000003043696],"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.00006616099,0.0006515963,0.007930541,0.0014447783,0.00014626395,4.911109e-7,0.00202705,0.0000029119528,0.008695153,0.48373416,0.007932082,0.4873688],"study_design_scores_gemma":[0.0013712657,0.00057067844,0.021894611,0.0019530137,0.00014431459,0.000009595275,0.00063825294,0.00071128376,0.8908832,0.061403487,0.019688487,0.0007318189],"about_ca_topic_score_codex":0.000010690854,"about_ca_topic_score_gemma":0.000002614704,"teacher_disagreement_score":0.882188,"about_ca_system_score_codex":0.000033199256,"about_ca_system_score_gemma":0.000054832373,"threshold_uncertainty_score":0.74878794},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000045702463,0.7357958,0.25873923,0.000016947763,0.00022570265,0.0013390312,0.002774859,0.00042677904,0.00067706103],"genre_scores_gemma":[0.0008155389,0.9687714,0.028684227,0.000036158308,0.00008717229,0.00008963207,0.0014581467,0.00004889893,0.000008853394],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99326146,0.0023894235,0.0014835979,0.0015392174,0.0006953183,0.0006309592],"domain_scores_gemma":[0.9893986,0.0048990105,0.0009834856,0.003620826,0.00089648477,0.00020157585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010040595,0.00078498304,0.0023564058,0.0014955372,0.00042830786,0.00037852858,0.0043173977,0.000449997,0.0000050920694],"category_scores_gemma":[0.0006832953,0.00074080797,0.00056502124,0.0057663186,0.0003702916,0.00023023399,0.0030437254,0.00097317924,0.0000022445452],"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.0000035795451,0.00017393226,0.00087433006,0.012159734,0.00021845724,0.000020091413,0.00004636641,5.575924e-7,4.2283935e-7,0.13201591,0.0017653016,0.85272133],"study_design_scores_gemma":[0.00058959774,0.00035706346,0.012378891,0.029117314,0.0005562367,0.00006720879,0.000011685144,0.00043932925,0.000006773875,0.027599404,0.92604613,0.002830371],"about_ca_topic_score_codex":0.002492064,"about_ca_topic_score_gemma":0.0019161326,"teacher_disagreement_score":0.9242808,"about_ca_system_score_codex":0.000077885146,"about_ca_system_score_gemma":0.0010191802,"threshold_uncertainty_score":0.99950427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015388831,0.0012145628,0.9918349,0.0005581221,0.0013458979,0.0005831518,0.000050071165,0.00029594603,0.003963506],"genre_scores_gemma":[0.5039358,0.00007140433,0.4936372,0.0019744441,0.00020996766,0.000023117584,0.00004302853,0.000038386355,0.00006666984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496466,0.00004744897,0.0004922814,0.0022841427,0.0013333664,0.0008780758],"domain_scores_gemma":[0.9965283,0.00048640327,0.0002751738,0.0022296757,0.0002497998,0.00023063713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080021337,0.00074804365,0.0006645491,0.001356777,0.00041028374,0.0007121225,0.0046689454,0.00045026286,0.000016789163],"category_scores_gemma":[0.00005312944,0.0006099779,0.00021786589,0.0015056104,0.0012832701,0.00035448128,0.0020934774,0.0014546039,0.000013171686],"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.000048950234,0.00018537515,0.000048504877,0.00021576276,0.000057337136,0.0002947472,0.0013876784,0.052819155,0.000059260397,0.56928724,0.00013862964,0.37545738],"study_design_scores_gemma":[0.00039824648,0.00027719382,0.00012604086,0.000626844,0.000019636771,0.000040961186,2.769514e-7,0.6963007,0.0001241636,0.29881412,0.0023751687,0.0008966729],"about_ca_topic_score_codex":0.000033309672,"about_ca_topic_score_gemma":0.0004851691,"teacher_disagreement_score":0.64348155,"about_ca_system_score_codex":0.00026255325,"about_ca_system_score_gemma":0.00055623695,"threshold_uncertainty_score":0.99963516},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015834885,0.00021829216,0.9885172,0.0012034203,0.0005670884,0.0003722763,0.00013774085,0.00028466748,0.0071158013],"genre_scores_gemma":[0.299542,0.000059705613,0.697858,0.0016968367,0.00021320092,0.00006154362,0.00040081225,0.000011003238,0.00015689366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986209,0.000053563315,0.00022576135,0.00063103525,0.00017401167,0.00029471779],"domain_scores_gemma":[0.99651605,0.00032831135,0.000047877547,0.002976163,0.00007117439,0.000060431314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004901324,0.00013169534,0.00016733538,0.00016510529,0.00018264372,0.0002563491,0.0045132157,0.00006868133,0.00006676659],"category_scores_gemma":[0.0003545477,0.00011758316,0.00006786923,0.0005611555,0.0000337946,0.0011156315,0.004118956,0.000106139065,0.000010049058],"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.00009536742,0.0002861754,0.00605917,0.00023581902,0.0001330338,0.00001043349,0.0006881361,0.0000055969235,0.00071110344,0.5832917,0.23364276,0.17484069],"study_design_scores_gemma":[0.0021396324,0.000108745204,0.014150001,0.00010423273,0.000047470607,0.0000042221345,0.000069769616,0.5158395,0.0020543842,0.08966056,0.37522686,0.00059460494],"about_ca_topic_score_codex":0.00094624015,"about_ca_topic_score_gemma":0.00081862713,"teacher_disagreement_score":0.5158339,"about_ca_system_score_codex":0.000012332906,"about_ca_system_score_gemma":0.00012038063,"threshold_uncertainty_score":0.83867526},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29334155,0.023475284,0.65656924,0.001711653,0.0014514552,0.0011110782,0.00003372591,0.0000683051,0.022237735],"genre_scores_gemma":[0.9975893,0.00026275642,0.0017913473,0.0002326955,0.00004681046,0.000015192804,0.0000015171889,0.0000048457973,0.00005555976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978526,0.00022841118,0.00062328775,0.000644547,0.00022071454,0.00043041157],"domain_scores_gemma":[0.99856657,0.0002684887,0.00012869354,0.0008153283,0.00013884196,0.00008206827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002783,0.00024163352,0.00036883392,0.0003875,0.00025003275,0.0003895193,0.0011844069,0.00014499668,0.00006436763],"category_scores_gemma":[0.00006450309,0.00018819049,0.00013828874,0.001772021,0.0004639588,0.0006393568,0.0013778592,0.00042082323,0.0000036045174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034191016,0.00022860944,0.020299416,0.000081644444,0.000042752694,0.0000020393259,0.0026879031,0.0000104186165,0.0006984168,0.8213072,0.0004037269,0.15420373],"study_design_scores_gemma":[0.0025215263,0.00023354079,0.037610184,0.0006252919,0.00012266451,0.000017668452,0.0011816381,0.23697467,0.028995944,0.64174205,0.049299717,0.0006751139],"about_ca_topic_score_codex":0.000571869,"about_ca_topic_score_gemma":0.0009841931,"teacher_disagreement_score":0.7042477,"about_ca_system_score_codex":0.000016983551,"about_ca_system_score_gemma":0.00027713252,"threshold_uncertainty_score":0.76741856},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17936432,0.0007368794,0.7838197,0.009946832,0.00035051384,0.00074503134,0.00012020962,0.001067921,0.023848588],"genre_scores_gemma":[0.9771552,0.00003561831,0.022088474,0.0005013644,0.000021124031,0.000050228828,0.00011495955,0.0000073060696,0.000025738855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787813,0.00025525107,0.0003963448,0.0006210625,0.00039235858,0.00045687772],"domain_scores_gemma":[0.9967279,0.0004298556,0.00016957092,0.0021351622,0.0003623688,0.00017516836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089267,0.0002497471,0.00025903306,0.0002845773,0.00056175585,0.000437371,0.0017711822,0.0001316475,0.00003571054],"category_scores_gemma":[0.00031936727,0.00019890284,0.000114279355,0.002151553,0.00030007082,0.0006958313,0.0006572704,0.00041297718,0.000038778784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013391181,0.00073091354,0.0061105476,0.000032130072,0.0000341765,0.0000038264284,0.0014836853,0.000020957295,0.0000893924,0.9853033,0.0021895212,0.003988161],"study_design_scores_gemma":[0.007814234,0.0007130561,0.1751329,0.0006246996,0.00019617694,0.000068685535,0.0018765711,0.15339974,0.0042781252,0.33161497,0.32103106,0.0032497628],"about_ca_topic_score_codex":0.00039046197,"about_ca_topic_score_gemma":0.0010998809,"teacher_disagreement_score":0.7977909,"about_ca_system_score_codex":0.00009258403,"about_ca_system_score_gemma":0.0002459735,"threshold_uncertainty_score":0.8111022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04957823,0.0004314419,0.94553953,0.00038715487,0.0022248607,0.0006832459,0.0004694704,0.00045571127,0.00023034945],"genre_scores_gemma":[0.2379773,0.00028979222,0.7574865,0.0017140328,0.0010539605,0.00047539925,0.00081167946,0.000051667095,0.00013963868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997419,0.000104670435,0.00043341276,0.0013205004,0.00020067612,0.00052174105],"domain_scores_gemma":[0.99665844,0.00030018258,0.00023715643,0.0024039503,0.0002198689,0.00018038257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006698202,0.00037328075,0.00043498035,0.00021503547,0.00027499418,0.00032995443,0.0027095152,0.00034337223,0.000016395357],"category_scores_gemma":[0.0001154856,0.00039055708,0.00031505385,0.00039421243,0.00006227586,0.0006063547,0.0019339769,0.00063691003,0.000025817295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009886435,0.0023265178,0.06280283,0.002578329,0.0009342591,0.00007640892,0.0057883193,0.00021572402,0.0038618841,0.27768216,0.009571075,0.63406366],"study_design_scores_gemma":[0.00071983726,0.00017274414,0.018357519,0.00023195214,0.00010916851,0.000004446598,0.0000887531,0.90907836,0.0017468017,0.041180097,0.027294453,0.0010158769],"about_ca_topic_score_codex":0.0003791138,"about_ca_topic_score_gemma":0.00006325049,"teacher_disagreement_score":0.90886265,"about_ca_system_score_codex":0.000045220262,"about_ca_system_score_gemma":0.0002673634,"threshold_uncertainty_score":0.9998546},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03458771,0.0009202764,0.93154097,0.010502941,0.00401408,0.0007727422,0.00021851956,0.00037520914,0.017067531],"genre_scores_gemma":[0.9484895,0.0010893224,0.033825982,0.013214075,0.00031763577,0.00014450338,0.00019885025,0.000031910575,0.0026882347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99549896,0.000247141,0.001170607,0.0015352218,0.0005859796,0.00096206693],"domain_scores_gemma":[0.9957276,0.00030933946,0.00033397143,0.002537163,0.0007161606,0.00037575222],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00041128698,0.0006643831,0.00062339555,0.0005655344,0.0009776088,0.0011760432,0.0027075408,0.00033696706,0.0003339548],"category_scores_gemma":[0.00020513416,0.0006585895,0.0005889375,0.0031519404,0.00046962439,0.0021812727,0.0023439568,0.00074985233,0.00023068613],"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.000056939843,0.0011818071,0.013501985,0.00025818247,0.0004913108,0.00013335336,0.006179285,0.000093387695,0.0006604413,0.6340032,0.09079563,0.25264448],"study_design_scores_gemma":[0.0034095852,0.00064991927,0.18317819,0.0014418397,0.0003861924,0.000042481188,0.0063861483,0.25712892,0.0048652035,0.06396988,0.47531566,0.003225961],"about_ca_topic_score_codex":0.0003560443,"about_ca_topic_score_gemma":0.00064263766,"teacher_disagreement_score":0.91390175,"about_ca_system_score_codex":0.00015710005,"about_ca_system_score_gemma":0.00063564826,"threshold_uncertainty_score":0.9998608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028218452,0.00033272337,0.95409095,0.0053250836,0.00069704885,0.00027602573,0.000017078504,0.00030074443,0.010741906],"genre_scores_gemma":[0.8325658,0.000025899802,0.16553046,0.0015799605,0.000096957665,0.000012872395,0.000031000713,0.000012033843,0.00014500367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996491,0.0004051504,0.00048025997,0.0012737417,0.0006263002,0.0007235317],"domain_scores_gemma":[0.99686086,0.0013672963,0.00019816057,0.0011280291,0.00017474472,0.0002709177],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00072197366,0.00040211267,0.00042761452,0.0003666059,0.0007711439,0.0018690267,0.0009277391,0.00021235347,0.00058015744],"category_scores_gemma":[0.0003574249,0.0003484688,0.00018116154,0.0022530013,0.00025669712,0.0016802881,0.000597419,0.0011372521,0.000095895404],"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.0004604959,0.00080672425,0.032791667,0.000082299186,0.00030329407,0.00024371513,0.0009070068,0.0006829368,0.00024313055,0.92823744,0.0027888096,0.032452475],"study_design_scores_gemma":[0.003376541,0.0008307969,0.015554958,0.00082128285,0.00031014267,0.000018746012,0.0009707861,0.87009007,0.003710654,0.014005322,0.08917938,0.0011313255],"about_ca_topic_score_codex":0.0014972539,"about_ca_topic_score_gemma":0.00036446488,"teacher_disagreement_score":0.91423213,"about_ca_system_score_codex":0.00007743669,"about_ca_system_score_gemma":0.00097191165,"threshold_uncertainty_score":0.9998967},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15992436,0.0034969845,0.8338271,0.001259205,0.00062925316,0.00031331144,0.000009307571,0.000014294515,0.0005261984],"genre_scores_gemma":[0.99389756,0.002922625,0.0020988274,0.0010526746,0.000018548993,0.0000029041953,0.0000028385646,0.0000021511319,0.0000018781259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732023,0.00010697774,0.00090543984,0.00028351624,0.000952024,0.00043181918],"domain_scores_gemma":[0.9971627,0.000102857746,0.00081891334,0.00047149992,0.0011773463,0.00026671254],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0057454198,0.00019891465,0.00026055978,0.0014089402,0.0008154332,0.0017106557,0.0011444489,0.00007956545,0.000006510381],"category_scores_gemma":[0.00037153292,0.00017263442,0.00007844482,0.0027770174,0.00042521156,0.015460701,0.00020762123,0.0004290611,0.0000030807341],"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.000036940015,0.00023477363,0.00007214083,0.0001970085,0.0000082725965,3.4719807e-7,0.0012885474,0.0003286324,0.0007186472,0.96667415,0.00008151136,0.03035902],"study_design_scores_gemma":[0.0007648414,0.0011294902,0.0087243775,0.00063328963,0.000049616217,0.000025097272,0.00008415656,0.9389532,0.003787164,0.04387815,0.0017554061,0.00021521091],"about_ca_topic_score_codex":0.0000029712332,"about_ca_topic_score_gemma":0.0000034188922,"teacher_disagreement_score":0.93862456,"about_ca_system_score_codex":0.00014665778,"about_ca_system_score_gemma":0.0018753372,"threshold_uncertainty_score":0.9993257},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056276844,0.0012781292,0.9954436,0.0012422911,0.00059038075,0.00072671636,0.00008540528,0.00007385081,0.00050339155],"genre_scores_gemma":[0.14836241,0.00017694003,0.847262,0.0036287725,0.00024810512,0.00007718469,0.00012113984,0.000022618584,0.00010077694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677986,0.000051786137,0.0005259776,0.0015908341,0.00049401773,0.0005575061],"domain_scores_gemma":[0.9970203,0.0009640932,0.0001902493,0.0015373632,0.00018141905,0.00010655179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086752395,0.0004756852,0.0005917223,0.0019350643,0.00034624076,0.0009926833,0.0032334588,0.0003359305,0.0000052315286],"category_scores_gemma":[0.00006703376,0.00037644716,0.0002666837,0.0020968092,0.00049472094,0.00060241413,0.0008492197,0.00065011514,7.0817873e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034022574,0.00020712,0.0008499957,0.00018807877,0.00024182042,0.00006171074,0.0035710793,0.045617674,0.000085238855,0.18754995,0.00023831661,0.761355],"study_design_scores_gemma":[0.00038897467,0.00015344932,0.0009912588,0.00015667298,0.00010580006,0.000010187772,5.653029e-7,0.88959587,0.0000724609,0.10516609,0.00279834,0.0005603106],"about_ca_topic_score_codex":0.000048445938,"about_ca_topic_score_gemma":0.0011575068,"teacher_disagreement_score":0.8439782,"about_ca_system_score_codex":0.00006634072,"about_ca_system_score_gemma":0.00024486988,"threshold_uncertainty_score":0.99986875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30174652,0.002467297,0.69120544,0.0012229485,0.0007366799,0.0004129699,0.000013163325,0.00020836873,0.0019866123],"genre_scores_gemma":[0.9875511,0.00023436891,0.011193941,0.0008597746,0.00010238968,0.000016089538,0.0000063657762,0.000009197552,0.000026765822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730784,0.00017946416,0.00040316436,0.0010277963,0.00038672655,0.0006949888],"domain_scores_gemma":[0.9982449,0.00025523241,0.00013771777,0.0009501917,0.00019036228,0.00022162266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045508347,0.0003980456,0.00035926295,0.00022164536,0.0006343547,0.0007326834,0.0007410304,0.00017724805,0.00008819643],"category_scores_gemma":[0.000032726,0.00032462605,0.00008246831,0.0025545426,0.00046851664,0.0003421139,0.0008512206,0.0005052133,0.000016689673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021925266,0.00023944191,0.008756813,0.00014141445,0.000070295544,0.00003349105,0.0009493962,0.019398334,0.00004318887,0.94697493,0.0010921814,0.022081284],"study_design_scores_gemma":[0.0011003122,0.0008279279,0.027340798,0.00041250113,0.00009334545,0.000037297737,0.00012572178,0.95776105,0.00007370016,0.0092725875,0.002363656,0.0005910995],"about_ca_topic_score_codex":0.00013011426,"about_ca_topic_score_gemma":0.00026886354,"teacher_disagreement_score":0.9383627,"about_ca_system_score_codex":0.00002472263,"about_ca_system_score_gemma":0.00021173642,"threshold_uncertainty_score":0.9999206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001344657,0.00057729497,0.99082214,0.00071927527,0.0018729758,0.0004718698,0.000028740924,0.00015729225,0.0052159596],"genre_scores_gemma":[0.066589005,0.0001752939,0.9275976,0.0044160625,0.00070925,0.000026381365,0.000040371808,0.000040810522,0.00040526595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564177,0.000046842077,0.00062271766,0.0019612126,0.0009345157,0.0007929534],"domain_scores_gemma":[0.99696976,0.00046392676,0.00020614799,0.0020197004,0.00018415318,0.00015633977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00103769,0.00056907395,0.0005970827,0.0016031882,0.00019006048,0.0005461423,0.0045520226,0.00043202064,0.000023805027],"category_scores_gemma":[0.000114637056,0.0005373579,0.00017023053,0.001658696,0.00063575135,0.001003087,0.0024058523,0.001308013,0.000028249186],"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.000023417091,0.00014950181,0.00050876447,0.00016316473,0.000020384636,0.00031974868,0.0013291213,0.0052638156,0.000058578073,0.3893616,0.00027902986,0.60252285],"study_design_scores_gemma":[0.000594291,0.00022301912,0.0006654521,0.0007934359,0.000009118322,0.000033487257,2.6266898e-7,0.4217842,0.00043799682,0.5533381,0.020992624,0.0011279816],"about_ca_topic_score_codex":0.000118051124,"about_ca_topic_score_gemma":0.00067930133,"teacher_disagreement_score":0.6013949,"about_ca_system_score_codex":0.00027756664,"about_ca_system_score_gemma":0.00088935316,"threshold_uncertainty_score":0.9997078},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042306514,0.0008603969,0.98691773,0.0023478186,0.0029430499,0.0004496617,0.00016991899,0.0002879708,0.0059811133],"genre_scores_gemma":[0.08487606,0.00026003295,0.8901083,0.022577886,0.0012446247,0.00004710979,0.00017474258,0.000077031036,0.0006342274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954065,0.00005172853,0.0006913592,0.0020488643,0.0009995392,0.00080198323],"domain_scores_gemma":[0.99572414,0.00088783324,0.000322446,0.0023661877,0.00048477715,0.00021463385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086502294,0.00064479857,0.00067853415,0.0014017314,0.0007390164,0.0009531058,0.0043755607,0.00034734065,0.00007741938],"category_scores_gemma":[0.00014637472,0.00061368966,0.00032855035,0.0014600299,0.0007870435,0.00088765007,0.0023279176,0.001154786,0.000091428556],"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.00002835117,0.00009405759,0.00011905231,0.0001826273,0.00005714399,0.0000832668,0.0018183362,0.0016733103,0.00024896846,0.34130287,0.0016882009,0.6527038],"study_design_scores_gemma":[0.00078001426,0.00022649152,0.00017053756,0.00070783886,0.000031438438,0.000060696293,8.808684e-7,0.47599736,0.00023037271,0.4989644,0.021655181,0.0011747703],"about_ca_topic_score_codex":0.0001009987,"about_ca_topic_score_gemma":0.00011849642,"teacher_disagreement_score":0.651529,"about_ca_system_score_codex":0.00015880415,"about_ca_system_score_gemma":0.00073966477,"threshold_uncertainty_score":0.99963146},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017067946,0.0008949882,0.9640127,0.0053755324,0.0018276756,0.00045053323,0.0021136594,0.00027636712,0.007980615],"genre_scores_gemma":[0.94557166,0.000049960043,0.044266265,0.008546792,0.00016927965,0.000038658873,0.0012338872,0.000012772203,0.000110725596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956925,0.00023073606,0.0011575611,0.0013646171,0.0007646506,0.0007899727],"domain_scores_gemma":[0.9968375,0.0007765022,0.00041700734,0.0013691614,0.00031221868,0.00028758994],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006369166,0.00045616334,0.0005070775,0.0004354447,0.0006491366,0.0010595565,0.0013763189,0.00021710565,0.0077570025],"category_scores_gemma":[0.00035596782,0.0004547733,0.00037019438,0.0014394424,0.00032076283,0.0011790042,0.0009039454,0.00044080027,0.00025093867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012519707,0.0021908728,0.022448633,0.00025486186,0.00050838373,0.00017419863,0.0005668029,0.00014464353,0.0011748966,0.7898937,0.12893231,0.053585503],"study_design_scores_gemma":[0.0068410025,0.00040726413,0.1252442,0.0014158126,0.00033841433,0.000006517302,0.0007947749,0.21369013,0.07706254,0.44551393,0.12650868,0.0021767232],"about_ca_topic_score_codex":0.0009073393,"about_ca_topic_score_gemma":0.00017859913,"teacher_disagreement_score":0.9285037,"about_ca_system_score_codex":0.00008558254,"about_ca_system_score_gemma":0.00090264686,"threshold_uncertainty_score":0.9999774},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073850565,0.0020970907,0.9200224,0.0006521673,0.0006011679,0.0014702842,0.00003425119,0.00015098616,0.0011210564],"genre_scores_gemma":[0.81780136,0.00052128267,0.18116137,0.00021118308,0.00007115155,0.0000804293,0.000027978676,0.000022985283,0.00010223798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636054,0.0003774566,0.000657423,0.0015998404,0.0002558195,0.00074889045],"domain_scores_gemma":[0.996292,0.0016312707,0.00032960717,0.0009523598,0.0005393162,0.00025546335],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009894338,0.00053003116,0.0005469521,0.0004927932,0.0019754882,0.0021647385,0.00088949065,0.0004542811,0.000022087353],"category_scores_gemma":[0.002850369,0.0005593207,0.00009979479,0.0018592273,0.0003070727,0.001242462,0.0016222222,0.0008915912,0.0000034179006],"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.00038904196,0.00039277037,0.0048689055,0.0010062212,0.00016335065,0.0000036991887,0.009442552,0.0006132066,0.0011260223,0.8429154,0.00041287157,0.13866597],"study_design_scores_gemma":[0.0010643429,0.00052573025,0.0025302558,0.0022405535,0.000076933116,0.0000049990686,0.0008146447,0.8136457,0.0021643126,0.17282307,0.0034355016,0.00067391066],"about_ca_topic_score_codex":0.00013360169,"about_ca_topic_score_gemma":0.000041916734,"teacher_disagreement_score":0.8130325,"about_ca_system_score_codex":0.000093544186,"about_ca_system_score_gemma":0.00043590294,"threshold_uncertainty_score":0.9996858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004848682,0.0035787679,0.98968184,0.0007643857,0.0028747472,0.00043959526,0.00016556034,0.00028977668,0.0021568278],"genre_scores_gemma":[0.0751605,0.00062694977,0.91641235,0.0062384475,0.001053072,0.00002514163,0.00025934153,0.000054819044,0.00016936344],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492437,0.00006913763,0.00066265964,0.0023392327,0.0011810738,0.00082350714],"domain_scores_gemma":[0.9953362,0.0014556606,0.0003041919,0.0023953635,0.00026748292,0.00024113002],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007396153,0.00077160797,0.0008190439,0.0011788611,0.00039026004,0.0010152834,0.005879192,0.00053999823,0.0000832701],"category_scores_gemma":[0.00009633426,0.00068846147,0.00029158295,0.0011272457,0.0008777987,0.0009160432,0.0024839323,0.001413965,0.000041881667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004557605,0.00008577779,0.00007585652,0.000079839614,0.00006500489,0.0002063243,0.0011527915,0.011121332,0.00018361805,0.07866353,0.00094416196,0.90737617],"study_design_scores_gemma":[0.00053982984,0.00009367355,0.00007301232,0.00037239233,0.000017818107,0.000009347399,1.5646565e-7,0.31259063,0.0010372518,0.67638993,0.008113709,0.000762282],"about_ca_topic_score_codex":0.00030174747,"about_ca_topic_score_gemma":0.0004410347,"teacher_disagreement_score":0.9066139,"about_ca_system_score_codex":0.00015415814,"about_ca_system_score_gemma":0.00053441414,"threshold_uncertainty_score":0.99955666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012767583,0.000054062373,0.9386342,0.00066065043,0.00019803234,0.00008180297,0.0000035142455,0.00021312198,0.05887781],"genre_scores_gemma":[0.27543658,0.000066983834,0.7229327,0.00070556934,0.000041367704,0.000008311395,0.000036695,0.0000055945616,0.00076620106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994205,0.000024138646,0.000075842225,0.00024980202,0.0001035821,0.00012609216],"domain_scores_gemma":[0.9994257,0.000033322114,0.000019935973,0.00043186249,0.000049876035,0.000039312603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006940663,0.00007216128,0.00006245567,0.00018461006,0.00016091559,0.00014176409,0.0003324632,0.000030364448,0.000074527015],"category_scores_gemma":[0.0000013484563,0.00005897748,0.000028828817,0.0011578741,0.000043971784,0.0004778282,0.00010875541,0.00006698389,0.000019245168],"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.000011783694,0.00004640094,0.00038000985,0.0000019734155,0.000012342546,0.0000037318805,0.00008422797,0.0002898909,0.000018547682,0.9851476,0.011759517,0.002243958],"study_design_scores_gemma":[0.0018133714,0.00030589505,0.013192101,0.000041538016,0.000027550128,0.00001507609,0.00074351166,0.014083031,0.00024998974,0.1339226,0.8351242,0.00048111146],"about_ca_topic_score_codex":0.000023479144,"about_ca_topic_score_gemma":0.00006840245,"teacher_disagreement_score":0.851225,"about_ca_system_score_codex":0.000017713872,"about_ca_system_score_gemma":0.00004848136,"threshold_uncertainty_score":0.24050318},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03624411,0.002057081,0.9510498,0.005525419,0.0028351631,0.0003598356,0.0006809041,0.00028559606,0.00096208556],"genre_scores_gemma":[0.9538846,0.0003179943,0.045137536,0.0004932848,0.000090797184,0.00002925444,0.000025273412,0.000016135175,0.0000051324137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963483,0.00040942396,0.0009099726,0.0008215128,0.0009832596,0.0005274849],"domain_scores_gemma":[0.9959087,0.0006329198,0.00040749286,0.0015313493,0.0014157686,0.00010379755],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002140808,0.00040945082,0.00061918073,0.0004834639,0.00061144895,0.001366647,0.0029144362,0.00012313809,0.00005171256],"category_scores_gemma":[0.00013362142,0.000314136,0.0002555988,0.0020780165,0.0005268521,0.0015952288,0.0012016082,0.00054941035,0.0000030509188],"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.000074547905,0.00030295926,0.001782824,0.00036200773,0.00034798955,0.000010004774,0.0030048492,0.00016715247,0.000424567,0.79905003,0.059620924,0.13485214],"study_design_scores_gemma":[0.0034882403,0.0011069688,0.02255581,0.0064889994,0.00023182346,0.000066433924,0.002703689,0.2690082,0.010733523,0.23913221,0.44234794,0.0021361583],"about_ca_topic_score_codex":0.00008775108,"about_ca_topic_score_gemma":0.00005332035,"teacher_disagreement_score":0.9176405,"about_ca_system_score_codex":0.0001456941,"about_ca_system_score_gemma":0.00061986246,"threshold_uncertainty_score":0.9999311},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016709253,0.000090477864,0.9818557,0.00038799664,0.00036806986,0.00032007095,0.000007971008,0.00017772889,0.00008275752],"genre_scores_gemma":[0.93680745,0.000049258644,0.0628884,0.00011778363,0.000029453886,0.00009396553,0.0000017389038,0.0000047554813,0.0000071958284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989028,0.0000069865487,0.00013634961,0.00042527626,0.00021474068,0.00031382655],"domain_scores_gemma":[0.999327,0.00006668473,0.000032712484,0.00034752843,0.00013857984,0.00008750815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043933446,0.00012600487,0.00010327962,0.00023424497,0.0005731243,0.0002006468,0.00036690428,0.00004830093,0.0000011831609],"category_scores_gemma":[0.000006712422,0.00011182502,0.000032238728,0.0021082764,0.00008728178,0.0007048081,0.000005266547,0.00012780813,8.358588e-7],"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.00019495057,0.00023213634,0.00008866998,0.0002580208,0.00006242654,0.000004667702,0.0012264311,0.6663046,0.021030053,0.24297343,0.0013052558,0.06631937],"study_design_scores_gemma":[0.0004283851,0.00023591392,0.000968665,0.00019005884,0.000026039343,0.000005107632,0.00005729534,0.9866644,0.0049798214,0.0014478179,0.0047242544,0.00027223813],"about_ca_topic_score_codex":0.00001150375,"about_ca_topic_score_gemma":0.000016067697,"teacher_disagreement_score":0.9200982,"about_ca_system_score_codex":0.00006870601,"about_ca_system_score_gemma":0.00017740786,"threshold_uncertainty_score":0.4560092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01538936,0.002819087,0.81569934,0.036402967,0.00086532277,0.00102005,0.0003404504,0.0004905349,0.1269729],"genre_scores_gemma":[0.75085557,0.014560409,0.23104244,0.000455753,0.00008934114,0.00013086054,0.0017590264,0.000060285198,0.0010463045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9915288,0.0056071766,0.0007359909,0.001094161,0.00069536414,0.00033848066],"domain_scores_gemma":[0.9883093,0.004094225,0.0010345995,0.0025700748,0.0037656815,0.00022612402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005873658,0.00039633352,0.00047403193,0.0002686311,0.0003483795,0.00079489354,0.0025469444,0.00036851328,0.00012036616],"category_scores_gemma":[0.002818196,0.00043253004,0.00020846893,0.000809936,0.0004126478,0.00074107846,0.0025735896,0.0008821563,0.000020311309],"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.00011134303,0.0036316796,0.0049091093,0.0010282026,0.0009239583,0.000014249014,0.03342475,0.00029434016,0.00728093,0.8769144,0.035121564,0.036345508],"study_design_scores_gemma":[0.0018229034,0.0000031956733,0.0058848322,0.0023805876,0.0001974165,0.00008419227,0.00014762626,0.07267937,0.004984912,0.015987761,0.89458823,0.0012389927],"about_ca_topic_score_codex":0.0015753073,"about_ca_topic_score_gemma":0.0005974536,"teacher_disagreement_score":0.8609266,"about_ca_system_score_codex":0.000052572086,"about_ca_system_score_gemma":0.00025828063,"threshold_uncertainty_score":0.99981266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018140957,0.00037932172,0.99627244,0.00031124562,0.0016147194,0.0004896886,0.000022057098,0.00023826215,0.000490829],"genre_scores_gemma":[0.20407179,0.000034873236,0.79450846,0.0007487989,0.00045756286,0.000017481594,0.00009758119,0.000029601575,0.00003386629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961891,0.00005278653,0.0004721469,0.0013874457,0.0012046553,0.0006938671],"domain_scores_gemma":[0.9976538,0.00033889417,0.0003428914,0.0010236932,0.0003589368,0.00028178532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076043024,0.00054525206,0.00043802673,0.000897448,0.000672276,0.0005456029,0.0015125431,0.0003282374,0.00005735497],"category_scores_gemma":[0.00002776726,0.00046526207,0.00013583132,0.0010079611,0.000872588,0.0014997532,0.00092364533,0.0007998116,0.00008268577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065084554,0.00039326827,0.00062784663,0.00008346847,0.000058442773,0.00007360024,0.0019198224,0.032330714,0.0006393162,0.15470852,0.00015818924,0.8089417],"study_design_scores_gemma":[0.0012124102,0.00037754004,0.005597369,0.00032843067,0.00003707708,0.00028069748,4.9543644e-7,0.7501364,0.0005547964,0.23721768,0.0028609105,0.0013962492],"about_ca_topic_score_codex":0.000040467246,"about_ca_topic_score_gemma":0.0003185075,"teacher_disagreement_score":0.8075455,"about_ca_system_score_codex":0.0002675203,"about_ca_system_score_gemma":0.00049525074,"threshold_uncertainty_score":0.9997799},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23318578,0.00012971931,0.7626143,0.00018968048,0.0006594219,0.00045273238,0.000118582335,0.00014428255,0.002505485],"genre_scores_gemma":[0.97466457,0.00009986527,0.024620071,0.00030358738,0.000032472057,0.00004560396,0.00017010352,0.000010145117,0.000053599426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831754,0.000042555355,0.0007246441,0.00024355238,0.00028385638,0.00038783782],"domain_scores_gemma":[0.99865913,0.00013252406,0.0003076966,0.00056667253,0.00023517966,0.0000988059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907231,0.00023494306,0.00035423014,0.00038357393,0.00029109098,0.00025704963,0.00078668207,0.00015235481,0.0000075011226],"category_scores_gemma":[0.00009914035,0.00022031752,0.00014265183,0.0006119007,0.00017797024,0.0017749789,0.0005585594,0.00030751646,0.000007745281],"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.0001309217,0.00032552195,0.04297918,0.0019130021,0.00019294789,0.000002444369,0.011693177,0.000095151365,0.00041446192,0.8877453,0.0021518357,0.05235606],"study_design_scores_gemma":[0.017728519,0.0014892215,0.058465417,0.0019703093,0.0003113414,0.00017298674,0.009149742,0.3344392,0.014366279,0.12597893,0.43290222,0.0030258754],"about_ca_topic_score_codex":0.000017855025,"about_ca_topic_score_gemma":0.0000076102506,"teacher_disagreement_score":0.7617664,"about_ca_system_score_codex":0.000027910439,"about_ca_system_score_gemma":0.00006009359,"threshold_uncertainty_score":0.8984288},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010781017,0.00011584956,0.050389186,0.00007625187,0.00010883949,0.00015464674,0.9489285,0.00017657457,0.000039369457],"genre_scores_gemma":[0.0035248038,0.00000133462,0.1931125,0.000059169462,0.00020189854,0.00027750077,0.80280983,0.000008368282,0.0000046322925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987611,0.000012435639,0.00020683039,0.0005437834,0.00027110492,0.00020471326],"domain_scores_gemma":[0.9970963,0.0020642164,0.00007216809,0.0006069332,0.00008517215,0.00007518654],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000065267144,0.00011555843,0.00012659209,0.00011386719,0.00010278344,0.0001892069,0.0013000763,0.00011693487,0.7110298],"category_scores_gemma":[0.0013213749,0.0001064079,0.000052482716,0.0005851524,0.000017417842,0.0009618469,0.0008543651,0.00018726537,0.00030530163],"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.0000029657524,0.000032711443,3.540153e-7,0.0004985493,0.000019403245,0.000004513778,0.00008237581,0.000018947618,0.000002019022,0.0038498447,0.9847813,0.010707005],"study_design_scores_gemma":[0.00005396389,0.000033316446,0.0001347406,0.0028737446,0.0000027152169,0.000005044984,0.000004927077,0.36349952,0.00003131,0.0061153043,0.6271461,0.000099270685],"about_ca_topic_score_codex":0.0000023562766,"about_ca_topic_score_gemma":0.0000027697424,"teacher_disagreement_score":0.71072453,"about_ca_system_score_codex":0.0000134055645,"about_ca_system_score_gemma":0.00012952858,"threshold_uncertainty_score":0.4339188},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06589443,0.000018888553,0.9195063,0.0009115671,0.0026530987,0.002314729,0.005273005,0.0010181498,0.002409813],"genre_scores_gemma":[0.9316061,0.000026550812,0.06270233,0.0011687953,0.00030175154,0.000756881,0.00323485,0.00006068019,0.00014203088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975107,0.00003287889,0.0008843487,0.00038697428,0.00037794572,0.0008071796],"domain_scores_gemma":[0.9974382,0.0006548637,0.00036574883,0.00097195525,0.00032692077,0.00024232236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004991738,0.00035576176,0.00038020159,0.0004986357,0.00060975266,0.000731906,0.0013959834,0.00016468749,0.000019989962],"category_scores_gemma":[0.00031208966,0.00034187693,0.00036552234,0.00086733326,0.0001221073,0.0024115497,0.00051874266,0.00032065882,0.0003163065],"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.0008080756,0.0014429447,0.0032286972,0.0028675082,0.00096015015,0.000056932306,0.08425197,0.00048105256,0.000496458,0.66317284,0.15207633,0.09015707],"study_design_scores_gemma":[0.006217363,0.0013244648,0.007364783,0.00034443356,0.00011899013,0.00009000998,0.00396776,0.53316844,0.0012294985,0.026759582,0.4177812,0.0016334628],"about_ca_topic_score_codex":0.000010957701,"about_ca_topic_score_gemma":0.000028035705,"teacher_disagreement_score":0.8657117,"about_ca_system_score_codex":0.00008132413,"about_ca_system_score_gemma":0.000110363486,"threshold_uncertainty_score":0.9999033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31238627,0.0000064510427,0.6619059,0.00029716527,0.0008451613,0.0034389095,0.000041406645,0.00077273883,0.020306004],"genre_scores_gemma":[0.92240584,0.000014577341,0.07442458,0.0003206567,0.00010684381,0.00023595997,0.00024197879,0.000055273547,0.0021942758],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959677,0.00013491984,0.00069770584,0.0020700675,0.0004155996,0.0007140324],"domain_scores_gemma":[0.99554604,0.0007574655,0.0003946219,0.0027787157,0.00031619167,0.00020695283],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004088597,0.00035547183,0.00040960734,0.00026094774,0.00035522482,0.0004614103,0.0016912413,0.00024900626,0.012321134],"category_scores_gemma":[0.0012793866,0.0003857544,0.0002671445,0.00052404735,0.00007071032,0.0015927565,0.0013793013,0.00051220297,0.051589116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008379991,0.0015449239,0.40942582,0.0029332011,0.001123111,0.000052436117,0.046202052,0.30795124,0.027019855,0.04732587,0.017931834,0.13765165],"study_design_scores_gemma":[0.0015381746,0.0000108827035,0.003254154,0.0005470522,0.00004006873,0.000019456167,0.00036287645,0.8806036,0.0070869187,0.004520729,0.10123682,0.000779254],"about_ca_topic_score_codex":0.00018486365,"about_ca_topic_score_gemma":0.000017853225,"teacher_disagreement_score":0.61001956,"about_ca_system_score_codex":0.00013556708,"about_ca_system_score_gemma":0.00016115059,"threshold_uncertainty_score":0.99985945},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027947997,0.0016680078,0.003615036,0.0005518777,0.0017503063,0.0006887981,0.99080867,0.0005288328,0.00036055516],"genre_scores_gemma":[0.000035194,0.0019736022,0.0029944652,0.001069159,0.00037944832,0.00016463245,0.9933155,0.000055798464,0.000012168206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938942,0.0003925942,0.0011473107,0.0016351056,0.0017061773,0.0012246205],"domain_scores_gemma":[0.99408,0.0003357698,0.0006624816,0.0041860435,0.00024497882,0.0004907007],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010617406,0.0010074417,0.0010860921,0.0007557091,0.0018151046,0.002415093,0.0057736044,0.0005731758,0.0031755024],"category_scores_gemma":[0.0002571868,0.0009640804,0.0005965467,0.0014873657,0.0004968156,0.0013567284,0.004178177,0.0014155073,0.000051266336],"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.000108204375,0.00028027277,0.000008001516,0.00016028868,0.00009831551,0.0002391822,0.00026926142,0.0000030779472,0.0000022667614,0.012504671,0.98312205,0.0032044305],"study_design_scores_gemma":[0.0009591731,0.00020796884,0.000121610785,0.00006301808,0.00012104496,0.00009187735,0.00007413357,0.00092013396,0.00001869998,0.0038858599,0.9924208,0.0011156788],"about_ca_topic_score_codex":0.040533114,"about_ca_topic_score_gemma":0.008371172,"teacher_disagreement_score":0.03216194,"about_ca_system_score_codex":0.0001968361,"about_ca_system_score_gemma":0.00059408305,"threshold_uncertainty_score":0.99960566},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2968335,0.0000097670645,0.70047116,0.000013086433,0.0011463491,0.001140361,0.00008550768,0.000266454,0.000033838834],"genre_scores_gemma":[0.96787775,1.9580419e-7,0.03145248,0.000100481804,0.00008276989,0.00025764463,0.00021155173,0.000007981942,0.00000914417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833995,0.00006219083,0.0007253266,0.0002839449,0.00021404203,0.00037456967],"domain_scores_gemma":[0.99849313,0.000014880392,0.00044391322,0.0007919701,0.00016190343,0.00009418354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005152106,0.00021011283,0.00029555336,0.00015234035,0.00022381794,0.0006823939,0.0005508608,0.00012722432,0.00000481108],"category_scores_gemma":[0.0000072906387,0.00018169961,0.00013082352,0.00035327446,0.000016499971,0.0027837905,0.00015119251,0.000102910955,0.00028549813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000615672,0.00013882956,0.28920448,0.0051876674,0.0005670458,0.0000028718912,0.2765104,0.06992414,0.0014394115,0.33334166,0.004831172,0.018236676],"study_design_scores_gemma":[0.0010973508,0.000118867174,0.0028891412,0.000043052853,0.000009493549,0.000004539527,0.00077290257,0.99287504,0.00031190133,0.000014727143,0.0016211851,0.00024181392],"about_ca_topic_score_codex":0.000005256164,"about_ca_topic_score_gemma":0.0000013773889,"teacher_disagreement_score":0.92295086,"about_ca_system_score_codex":0.00007075062,"about_ca_system_score_gemma":0.000031213625,"threshold_uncertainty_score":0.74094945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94331795,0.00029443495,0.047299746,0.0009158897,0.0032854446,0.0007036965,0.0008555686,0.0009504015,0.0023768737],"genre_scores_gemma":[0.99248296,0.000058047357,0.005969767,0.00040735106,0.00035646104,0.00014556544,0.00030093204,0.000041317126,0.00023759934],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972364,0.00006111617,0.000597097,0.0009167089,0.00035943493,0.0008292951],"domain_scores_gemma":[0.9972571,0.00053418905,0.00024535987,0.001490623,0.00016420963,0.00030849394],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00060057297,0.0003366289,0.00041014692,0.00047843592,0.00046901827,0.0010760234,0.0023960313,0.00015321553,0.00023677165],"category_scores_gemma":[0.00052146055,0.00035215347,0.00038703452,0.0007325033,0.00018146925,0.0032036284,0.0015156725,0.00019486442,0.00074103154],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011039436,0.00061923737,0.50199556,0.00031549082,0.0005018403,0.00015546853,0.0029472809,0.000024071658,0.0025444427,0.21148191,0.26109135,0.018212965],"study_design_scores_gemma":[0.0065680626,0.0011047072,0.3324655,0.00042194832,0.0001404973,0.0002997596,0.0013402593,0.034208246,0.0064988527,0.13877627,0.47409916,0.00407675],"about_ca_topic_score_codex":0.000031986117,"about_ca_topic_score_gemma":0.000026047206,"teacher_disagreement_score":0.21300781,"about_ca_system_score_codex":0.00006865222,"about_ca_system_score_gemma":0.00021094515,"threshold_uncertainty_score":0.99996096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95622015,0.0015372423,0.026505178,0.00092445133,0.0031045568,0.00033682093,0.00027881024,0.0011039875,0.0099888155],"genre_scores_gemma":[0.9875707,0.0005474052,0.010348971,0.000672438,0.00044051852,0.00006105069,0.000066987865,0.00004185052,0.00025009035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9973199,0.00014862209,0.0005233792,0.0009510231,0.0003528288,0.0007042757],"domain_scores_gemma":[0.99716574,0.00041650937,0.00019773854,0.0017760786,0.0000797219,0.00036424003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000856531,0.0003450003,0.00043753366,0.0005411439,0.00046615434,0.00042130117,0.001726116,0.00019498331,0.00043665568],"category_scores_gemma":[0.00023993888,0.00036535002,0.00019852142,0.0009455996,0.00045147876,0.0011622055,0.0012189073,0.00031881753,0.0007468272],"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.000027143864,0.00014139694,0.28626555,0.000092393144,0.00014089611,0.00027912416,0.0015551612,0.000006804697,0.00079734606,0.5389548,0.1661478,0.0055915606],"study_design_scores_gemma":[0.005631846,0.00070927734,0.4274502,0.00025513102,0.00014262134,0.0013157458,0.0010306217,0.026878096,0.0023521953,0.2373961,0.29318056,0.0036576153],"about_ca_topic_score_codex":0.00012529232,"about_ca_topic_score_gemma":0.00021915406,"teacher_disagreement_score":0.3015587,"about_ca_system_score_codex":0.000049136033,"about_ca_system_score_gemma":0.00019656536,"threshold_uncertainty_score":0.99987984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7552587,0.000033598313,0.23743366,0.0005336526,0.00086497836,0.0007362341,0.00025115698,0.000843696,0.004044363],"genre_scores_gemma":[0.98793614,0.00009787057,0.010209727,0.0007517733,0.00008465125,0.000071205766,0.0007451235,0.000022498272,0.00008102791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982446,0.000043802487,0.0005172327,0.00028017245,0.00038952366,0.0005246629],"domain_scores_gemma":[0.9986345,0.0003014257,0.00021080051,0.00058094633,0.000106177635,0.0001661498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073163986,0.0002440725,0.00023140929,0.00040855,0.0005386042,0.0005228478,0.000672325,0.0001347943,0.000015012519],"category_scores_gemma":[0.00016322064,0.00022711405,0.0001240152,0.0007093527,0.000085301006,0.0016873425,0.0004271645,0.00042845693,0.00025825124],"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.0001494794,0.00040642585,0.010496529,0.0011047112,0.00017825323,0.000014891298,0.042042434,0.0005887262,0.00021834232,0.78993756,0.021540118,0.13332254],"study_design_scores_gemma":[0.0069754855,0.0013695568,0.042534407,0.00054854085,0.000054237527,0.00008942089,0.003951863,0.70734096,0.0014778911,0.05089668,0.18281423,0.0019467431],"about_ca_topic_score_codex":0.000010656181,"about_ca_topic_score_gemma":0.000005328333,"teacher_disagreement_score":0.73904085,"about_ca_system_score_codex":0.000032681994,"about_ca_system_score_gemma":0.00003135645,"threshold_uncertainty_score":0.92614424},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010845509,0.00011386052,0.051414542,0.000076583005,0.00010808201,0.00015477557,0.94790643,0.00017644183,0.000038428836],"genre_scores_gemma":[0.0035727252,0.0000012950737,0.19586156,0.000058973215,0.00019821797,0.000282162,0.8000121,0.000008353023,0.0000046015566],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876064,0.000012439977,0.00020673493,0.00054420304,0.00027117465,0.00020479088],"domain_scores_gemma":[0.99706453,0.0020946679,0.00007206577,0.00060814706,0.00008536932,0.00007519943],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006563598,0.00011559627,0.00012656019,0.00011394397,0.00010277569,0.00018878515,0.0013008206,0.00011693418,0.71503663],"category_scores_gemma":[0.0013379748,0.00010644371,0.000052493167,0.0005856208,0.000017418091,0.00096116954,0.00085448875,0.00018730975,0.0003086904],"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.0000029849075,0.0000327492,3.662555e-7,0.0004943465,0.000019418932,0.000004393638,0.000082371655,0.000018869756,0.0000020953232,0.0037846754,0.9851387,0.010419034],"study_design_scores_gemma":[0.00005370381,0.000033383876,0.00013731181,0.0029169824,0.0000027313642,0.000005044547,0.0000049903306,0.3659279,0.000031580985,0.0060793855,0.6247073,0.000099704215],"about_ca_topic_score_codex":0.00000233208,"about_ca_topic_score_gemma":0.000002752968,"teacher_disagreement_score":0.71472794,"about_ca_system_score_codex":0.000013401613,"about_ca_system_score_gemma":0.0001301246,"threshold_uncertainty_score":0.43406487},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8410878,0.0006526197,0.15324633,0.00066767045,0.000118174845,0.001034199,0.0014783983,0.00013832086,0.0015764608],"genre_scores_gemma":[0.9823531,0.0038741487,0.012202412,0.0000125072565,0.000015743519,6.355111e-8,0.0011675225,0.000019505287,0.00035498771],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99774146,0.00029412977,0.0003260713,0.00073023787,0.00056771684,0.00034038286],"domain_scores_gemma":[0.99657357,0.00055036286,0.0010604,0.0011146453,0.0005514283,0.00014960584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058811344,0.0003561084,0.0010333557,0.0025022195,0.00042633724,0.000016193679,0.0029209284,0.0004562667,0.0001306589],"category_scores_gemma":[0.000024969902,0.00045255976,0.0008054632,0.0045544356,0.0013120985,0.0004990213,0.0007604964,0.0006574613,0.000003192521],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.003918964,0.00694666,0.102577634,0.0075737583,0.012141813,0.00024103168,0.42141372,0.0074046864,0.00485486,0.3546771,0.0010944757,0.0771553],"study_design_scores_gemma":[0.006997392,0.0014590335,0.38580495,0.0018203066,0.007642351,0.000008883136,0.5497387,0.018060578,0.00013633337,0.021705413,0.004503798,0.002122232],"about_ca_topic_score_codex":0.01920414,"about_ca_topic_score_gemma":0.07104987,"teacher_disagreement_score":0.3329717,"about_ca_system_score_codex":0.000046543508,"about_ca_system_score_gemma":0.00018355537,"threshold_uncertainty_score":0.99979264},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2972079,0.016001033,0.38693988,0.008872993,0.0012040982,0.0015257044,0.0008970082,0.00037022177,0.28698114],"genre_scores_gemma":[0.9049845,0.001594895,0.03448958,0.00022512607,0.00017421141,0.000004098291,0.00011333966,0.0001219996,0.05829228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966809,0.00078102364,0.00039315276,0.0010283086,0.0004911616,0.0006254335],"domain_scores_gemma":[0.9979197,0.00033524964,0.00037919503,0.0010134992,0.000085869826,0.00026652787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072201126,0.00047115117,0.00065427757,0.00073824724,0.00020444077,0.00014479242,0.001997287,0.0003935665,0.0005869476],"category_scores_gemma":[0.000045524946,0.0005998028,0.00037785235,0.0008563726,0.0007648742,0.00073822215,0.00089383527,0.0006758868,0.00040348634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00005561327,0.00052750926,0.0014741591,0.00053149037,0.00026271507,0.0014318504,0.09069144,0.00023327602,0.00007853458,0.49659935,0.0094067715,0.3987073],"study_design_scores_gemma":[0.0027724002,0.0001645923,0.12511875,0.003366466,0.00037062343,0.00023577471,0.033374857,0.041681543,0.00009194977,0.7568452,0.034504503,0.0014733505],"about_ca_topic_score_codex":0.7918253,"about_ca_topic_score_gemma":0.9270217,"teacher_disagreement_score":0.6077766,"about_ca_system_score_codex":0.00037680412,"about_ca_system_score_gemma":0.0008803062,"threshold_uncertainty_score":0.99964535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7881536,0.0061894725,0.0069812657,0.18012267,0.005918181,0.00042555065,0.000120540506,0.0003792477,0.01170948],"genre_scores_gemma":[0.97978663,0.00026741353,0.0039484208,0.015413193,0.00038133378,0.000010515949,0.000059503916,0.000015462736,0.000117542804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828094,0.00020056826,0.00029849648,0.00052445306,0.00028419358,0.00041136573],"domain_scores_gemma":[0.9982514,0.00040916807,0.00012938681,0.0005647312,0.00014568745,0.0004996432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068534486,0.00020953138,0.00016545443,0.00033809853,0.000807601,0.0008667762,0.00068579795,0.00009137118,0.00006608931],"category_scores_gemma":[0.0004320003,0.0001718151,0.00008725221,0.0005349239,0.00009215276,0.00039066584,0.0001982123,0.00043642992,0.000012553896],"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.00005806738,0.00024115069,0.028863965,0.00009161258,0.0003027619,0.0006314014,0.014455258,0.00055644405,0.003928794,0.8685609,0.063023746,0.01928587],"study_design_scores_gemma":[0.0019471184,0.00020142533,0.03359427,0.0007293804,0.00008440413,0.0018175644,0.0032458422,0.008111368,0.0032493472,0.10919028,0.8363066,0.0015224409],"about_ca_topic_score_codex":0.0036908132,"about_ca_topic_score_gemma":0.007966812,"teacher_disagreement_score":0.7732828,"about_ca_system_score_codex":0.00016749096,"about_ca_system_score_gemma":0.0017211699,"threshold_uncertainty_score":0.8358343},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8536402,0.0005461834,0.14003728,0.00097237667,0.0003473344,0.0017206654,0.0008755633,0.00017211483,0.0016882541],"genre_scores_gemma":[0.43265086,0.0012718558,0.46929267,0.00022243542,0.0001880347,0.000076641925,0.019790096,0.00013493445,0.07637245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99852765,0.00007766589,0.00017058407,0.0006582479,0.00027127366,0.00029456848],"domain_scores_gemma":[0.9985147,0.000098822326,0.00021959307,0.00074805546,0.00030948754,0.0001093529],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002139635,0.00024629798,0.00045420247,0.0003146925,0.00024613686,0.00007126915,0.0009923478,0.00024281938,0.000041125302],"category_scores_gemma":[0.000007407086,0.00026302485,0.0001572461,0.0008699562,0.000115968105,0.00047614748,0.00012561795,0.00024788556,0.0000035149521],"study_design_candidate":"qualitative","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.000474269,0.0009110506,0.008418465,0.0014746985,0.00033858532,0.00007224365,0.20971066,0.000048699378,0.0010040534,0.76710236,0.0020989038,0.008345998],"study_design_scores_gemma":[0.012971022,0.0014183243,0.041399278,0.0026662373,0.0009003796,0.000023774122,0.8036489,0.0052885665,0.014956705,0.029770425,0.08121638,0.0057400162],"about_ca_topic_score_codex":0.009986945,"about_ca_topic_score_gemma":0.18162529,"teacher_disagreement_score":0.7373319,"about_ca_system_score_codex":0.0000544462,"about_ca_system_score_gemma":0.00030290143,"threshold_uncertainty_score":0.9999822},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042570697,0.00037695337,0.00007947316,0.00033723668,0.0003847348,0.00041526716,0.00009727062,0.00010764076,0.9981589],"genre_scores_gemma":[0.002249538,0.00005865017,0.0030619919,0.00020290974,0.000096796444,0.000016147245,0.000024987257,0.00003865598,0.9942503],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848276,0.00010028141,0.0005014163,0.00019122046,0.00048527608,0.00023904144],"domain_scores_gemma":[0.9979779,0.00010270339,0.00078331615,0.0009956672,0.00009921955,0.00004116615],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027866164,0.00024351002,0.0002762575,0.000045685472,0.00011485334,0.00007382597,0.0017343146,0.00021247167,0.011991926],"category_scores_gemma":[0.00003962301,0.00015712998,0.00017702114,0.000030721414,0.00026715884,5.770709e-7,0.00038644628,0.0002943209,0.00032292737],"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.000008562557,0.000030194647,0.0000075353482,0.00020021555,0.000023424389,0.0000016611406,0.00021635124,0.0000821916,4.4798142e-7,0.0019997635,0.99580723,0.0016224416],"study_design_scores_gemma":[0.00018856532,0.000035048684,0.000053104697,0.00027469627,0.000018895564,0.000019904792,0.000042238546,0.00007756272,0.000030259684,0.000116132476,0.9989619,0.00018164128],"about_ca_topic_score_codex":0.004729515,"about_ca_topic_score_gemma":0.003069962,"teacher_disagreement_score":0.011668998,"about_ca_system_score_codex":0.000013366125,"about_ca_system_score_gemma":0.000043270666,"threshold_uncertainty_score":0.9889113},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99586993,0.0011055724,0.0010329093,0.00044491395,0.00073681085,0.00043184918,0.00006714687,0.00008675969,0.00022411242],"genre_scores_gemma":[0.9883997,0.00029928394,0.00446021,0.000014440832,0.00009626655,0.0000021158291,0.0025803305,0.00002093589,0.0041267253],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9982464,0.00020114073,0.00015762275,0.0004590882,0.0007566819,0.00017908672],"domain_scores_gemma":[0.99864095,0.00007316808,0.00029974838,0.0006847917,0.00025552942,0.00004583042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006662016,0.00018932873,0.00027213234,0.00017959764,0.00016985483,0.00008923225,0.0011025155,0.00021109682,0.00007491015],"category_scores_gemma":[0.000014300501,0.00017163849,0.00025309244,0.0004260082,0.00007606438,0.0005043243,0.00016642088,0.00031591975,0.000032343796],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.00015858111,0.00038670955,0.0015083222,0.0007686552,0.00072402705,0.0000154076,0.6790805,0.000113502894,0.0071067945,0.021149307,0.0029690457,0.28601915],"study_design_scores_gemma":[0.0056545665,0.0009420286,0.22801912,0.0059266645,0.0057985927,0.000007669771,0.4162906,0.16585204,0.008124888,0.15271361,0.007871101,0.0027991042],"about_ca_topic_score_codex":0.026710972,"about_ca_topic_score_gemma":0.08329142,"teacher_disagreement_score":0.28322005,"about_ca_system_score_codex":0.000051608407,"about_ca_system_score_gemma":0.000119387856,"threshold_uncertainty_score":0.97977024},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.1836945e-7,0.0010888731,0.057539105,0.0009648225,0.0012327617,0.00019930211,0.00043464027,0.0005942315,0.93794554],"genre_scores_gemma":[0.00023552445,0.00074756605,0.04353075,0.00039860126,0.0012129659,0.000029282339,0.00029451383,0.00009649441,0.9534543],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981588,0.000062575906,0.00021878495,0.00082845206,0.0003727808,0.00035859854],"domain_scores_gemma":[0.9969119,0.0000696425,0.00029874404,0.0025617427,0.000026947646,0.00013106415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002652259,0.00031875574,0.00031408246,0.00022508479,0.0001600893,0.00041006636,0.0027386635,0.0003662946,0.00014865812],"category_scores_gemma":[0.000032568587,0.00023624794,0.00016940737,0.00010685694,0.00016689787,0.0004602196,0.0005629155,0.0002630549,0.00066174706],"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.000024107963,0.000056448214,0.0000129135715,0.00002360333,0.000029132974,0.0000311631,0.00012114185,3.5782822e-8,0.0000012031907,0.01761597,0.97807467,0.0040096324],"study_design_scores_gemma":[0.00033133317,0.00019149057,0.0003037068,0.00022614888,0.000009638132,0.000010845348,0.000011685149,0.00016192872,0.000008448083,0.002428722,0.99594575,0.0003703255],"about_ca_topic_score_codex":0.0005585413,"about_ca_topic_score_gemma":0.0004930685,"teacher_disagreement_score":0.01787108,"about_ca_system_score_codex":0.00000839499,"about_ca_system_score_gemma":0.000071237,"threshold_uncertainty_score":0.9633911},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6357586,0.00025247803,0.33785757,0.00044881206,0.0010137226,0.00032138248,0.0026363155,0.00080073305,0.020910418],"genre_scores_gemma":[0.9931567,0.000019405532,0.006255967,0.000013177935,0.0000791214,6.232329e-8,0.0001782307,0.00001842921,0.0002789149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9975343,0.00008209121,0.00026808,0.00090419943,0.00066586497,0.00054546754],"domain_scores_gemma":[0.9976581,0.00022862667,0.00028008505,0.0011968785,0.00030208647,0.00033426643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003188801,0.00038357038,0.00060028734,0.00069332204,0.0006267455,0.00025456623,0.0026980385,0.00024100699,0.00010728559],"category_scores_gemma":[0.00008147795,0.0004981779,0.00059122394,0.0017320104,0.0011288916,0.0023892259,0.0017507016,0.0005378362,0.00018392068],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001792289,0.0010480933,0.23133177,0.0021744233,0.002143287,0.005290009,0.22276528,0.00041464804,0.00033770033,0.47291747,0.019794006,0.03999102],"study_design_scores_gemma":[0.014046984,0.003487037,0.31301755,0.0031917493,0.0020212515,0.00026498895,0.2739272,0.04958394,0.0007076534,0.038865678,0.29162997,0.009256004],"about_ca_topic_score_codex":0.0002699389,"about_ca_topic_score_gemma":0.0001111434,"teacher_disagreement_score":0.43405178,"about_ca_system_score_codex":0.000093860726,"about_ca_system_score_gemma":0.00020533058,"threshold_uncertainty_score":0.999747},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68714696,0.000020761689,0.032069393,0.24038777,0.00021893864,0.0005070622,0.00028626414,0.00012803717,0.03923483],"genre_scores_gemma":[0.9961016,0.000035945675,0.0030810765,0.00032753588,0.000010556265,2.1141344e-7,0.000014768028,0.0000027522572,0.00042550825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992192,0.00020041606,0.0000841676,0.00022305525,0.0001370594,0.0001361251],"domain_scores_gemma":[0.99907774,0.000400709,0.000039504335,0.00040553138,0.000013770952,0.000062729276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097503056,0.00008371324,0.00012944745,0.0001037016,0.00012688787,0.000053949305,0.00053468917,0.000032319607,0.000006765614],"category_scores_gemma":[0.000051705232,0.000066600136,0.000026527348,0.0004333425,0.000103077255,0.00089906063,0.00030370505,0.00013455942,9.897509e-7],"study_design_candidate":"theoretical_or_conceptual","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.00019775091,0.000031429216,0.0021986754,0.000007673382,0.000010476798,0.000017827391,0.001527924,0.00029753402,5.5636247e-7,0.95893955,0.036306575,0.0004640499],"study_design_scores_gemma":[0.023854535,0.00078230945,0.30298775,0.00028958532,0.00007057671,0.0000031274553,0.003918044,0.019806013,0.0022440967,0.089527644,0.55490243,0.0016138833],"about_ca_topic_score_codex":0.7190211,"about_ca_topic_score_gemma":0.44150293,"teacher_disagreement_score":0.8694119,"about_ca_system_score_codex":0.00002265043,"about_ca_system_score_gemma":0.00023488075,"threshold_uncertainty_score":0.5686882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37695456,0.003432535,0.61554646,0.001254836,0.00026259923,0.0007536282,0.00063615054,0.000113132075,0.0010461132],"genre_scores_gemma":[0.970468,0.00048780476,0.028598102,0.00015583965,0.00009102622,0.00005223975,0.0001375969,0.0000045034385,0.0000048917427],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99827546,0.00025601455,0.0005439942,0.0005079471,0.00023659274,0.0001799652],"domain_scores_gemma":[0.99726737,0.0019219242,0.00021347309,0.00036669488,0.00010302135,0.00012750103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062347215,0.00013936494,0.00036441404,0.00021202913,0.0001634389,0.00008342813,0.0002973378,0.00014111889,0.000005840291],"category_scores_gemma":[0.00038080986,0.00012986368,0.000057319226,0.00054258545,0.00026693416,0.0004751169,0.00033330417,0.00021888089,5.843278e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029992886,0.0011383952,0.32015014,0.0002857536,0.00032988162,0.000023635885,0.0008503102,0.0000093770495,0.0003253969,0.10636018,0.0020682495,0.56815875],"study_design_scores_gemma":[0.024439646,0.007089702,0.6860578,0.0044308677,0.00045099104,0.000020654043,0.001277695,0.001839663,0.013591795,0.22177453,0.03769666,0.001329989],"about_ca_topic_score_codex":0.000023528724,"about_ca_topic_score_gemma":0.00004707611,"teacher_disagreement_score":0.5935134,"about_ca_system_score_codex":0.000011700168,"about_ca_system_score_gemma":0.000050733404,"threshold_uncertainty_score":0.52956873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054788085,0.00058721495,0.99231607,0.0011066238,0.0018384795,0.00037023833,0.00003392099,0.00027081798,0.0034218207],"genre_scores_gemma":[0.57080466,0.000034556913,0.41919863,0.009093162,0.0007230763,0.000012999484,0.000035914887,0.000054794604,0.00004223054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950956,0.00007642929,0.00047520982,0.0020945652,0.00148513,0.0007730814],"domain_scores_gemma":[0.9963077,0.00064724486,0.00024962993,0.0023500205,0.00018437322,0.0002610642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010133995,0.00072894513,0.0006238149,0.0011970755,0.0003461142,0.0007784758,0.0049720244,0.00056037935,0.00004377682],"category_scores_gemma":[0.00006953198,0.0006370325,0.0002970909,0.0008007924,0.00072204653,0.00050975336,0.00048163353,0.0014237665,0.000036933965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029925233,0.000103494735,0.000028891038,0.00014766176,0.000021789136,0.00015405241,0.0008314064,0.16546115,0.00031821078,0.4396705,0.00020193336,0.39303097],"study_design_scores_gemma":[0.00035755488,0.00034041394,0.00008857571,0.0004108343,0.000012146202,0.000009306746,6.57127e-8,0.7744615,0.0009449724,0.2089286,0.013642913,0.00080309634],"about_ca_topic_score_codex":0.000016712807,"about_ca_topic_score_gemma":0.00008158097,"teacher_disagreement_score":0.6090004,"about_ca_system_score_codex":0.00010396428,"about_ca_system_score_gemma":0.00031356697,"threshold_uncertainty_score":0.9996081},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.6155458e-7,0.0002052565,0.49647886,0.0008788006,0.0002074561,0.00058162905,0.00052773143,0.0010024607,0.5001174],"genre_scores_gemma":[0.0038780337,0.0015726623,0.29375705,0.001598808,0.0030952597,0.0000027926642,0.017536957,0.026391963,0.6521665],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978758,0.0002897316,0.00023158369,0.00080946676,0.00034068245,0.00045269876],"domain_scores_gemma":[0.9979763,0.000054291693,0.00016493499,0.0011189728,0.0004887054,0.00019678623],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00066909636,0.00025388054,0.00026350602,0.0005432286,0.0009812643,0.0012217796,0.0023761455,0.00021796257,0.0053196894],"category_scores_gemma":[0.0009596072,0.00026269554,0.00012873381,0.0008927585,0.00014966757,0.00028871867,0.0027988153,0.00039014078,0.0026789187],"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.000014397908,0.00015129849,7.622099e-8,0.0001664238,0.000046246187,0.000004499163,0.00020645098,3.655261e-7,0.000017452898,0.2324988,0.7033289,0.063565075],"study_design_scores_gemma":[0.0004126274,0.00017048496,0.0000072260978,0.00010556531,0.000022417922,0.000027807986,0.000023583987,0.0004629416,0.00008451726,0.003897611,0.994517,0.00026816878],"about_ca_topic_score_codex":0.000022225671,"about_ca_topic_score_gemma":0.000001907892,"teacher_disagreement_score":0.29118812,"about_ca_system_score_codex":0.00008282358,"about_ca_system_score_gemma":0.00003636352,"threshold_uncertainty_score":0.99998254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039005654,0.000017772709,0.8994318,0.0001390692,0.000107237516,0.000014189657,5.097247e-7,0.00012007494,0.09626876],"genre_scores_gemma":[0.7076915,0.000003828693,0.29141906,0.0008084097,0.000032423613,2.767533e-7,0.0000019012551,0.000001033726,0.000041557698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967045,0.0000031906272,0.000050131228,0.00010140849,0.000066935,0.00010790338],"domain_scores_gemma":[0.9996301,0.000021849748,0.0000077713285,0.00028791462,0.000009732013,0.000042653908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000229111,0.000025619345,0.00002336958,0.00003700671,0.000030330984,0.000038139362,0.00034989344,0.000011952993,0.00005233358],"category_scores_gemma":[0.000004210357,0.000020707024,0.000016982398,0.00020965989,0.000010066118,0.0002679861,0.000107962966,0.000028215805,0.00009054066],"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":[4.731848e-7,0.0000097721,0.00039510854,4.1982514e-7,8.582178e-7,0.0000046440814,0.0000425102,5.466377e-8,0.00011370363,0.9654404,0.0026309243,0.031361118],"study_design_scores_gemma":[0.000260921,0.00004448175,0.044439442,0.0000026891419,0.0000014562095,0.000020807041,0.00003327463,0.0018049652,0.019297339,0.100373045,0.8334895,0.00023212767],"about_ca_topic_score_codex":0.000015452833,"about_ca_topic_score_gemma":0.00003072415,"teacher_disagreement_score":0.86506736,"about_ca_system_score_codex":9.859467e-7,"about_ca_system_score_gemma":0.000003930916,"threshold_uncertainty_score":0.11637473},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071553336,0.00005315904,0.9490655,0.00020733214,0.00021512051,0.0000407681,5.6187656e-7,0.00013381011,0.04312838],"genre_scores_gemma":[0.83515143,0.000015763722,0.16383745,0.0008798552,0.000087333814,3.4419566e-7,0.0000036192139,0.0000017211164,0.000022491393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994264,0.000010948997,0.00010725628,0.00016056615,0.00014434035,0.00015046357],"domain_scores_gemma":[0.9995124,0.0000471918,0.000018710987,0.00033561126,0.000020787824,0.00006534876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044247034,0.00004621385,0.000045295754,0.00006549361,0.000056557637,0.000087275235,0.0003890153,0.000024708323,0.00013172279],"category_scores_gemma":[0.000012665548,0.00003754902,0.000035373963,0.00028412882,0.000015546406,0.00052325154,0.00017619712,0.000052075884,0.00010554464],"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.0000025415118,0.000014929434,0.0001315464,0.0000017952747,0.0000014097147,0.000011136975,0.00008182084,6.953082e-8,0.000051078983,0.84133357,0.004085994,0.15428413],"study_design_scores_gemma":[0.00052689464,0.00013751097,0.005088319,0.000018010549,0.000003332523,0.00003097063,0.000051537605,0.000397927,0.01320268,0.121236265,0.85899055,0.0003159936],"about_ca_topic_score_codex":0.000020856243,"about_ca_topic_score_gemma":0.000013909288,"teacher_disagreement_score":0.8549046,"about_ca_system_score_codex":0.00000507191,"about_ca_system_score_gemma":0.0000076212254,"threshold_uncertainty_score":0.15312047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014536503,0.000108719876,0.9776391,0.0004031538,0.0018380694,0.0018181328,0.0017932872,0.00042112483,0.0014419011],"genre_scores_gemma":[0.088635035,0.00007390134,0.9068447,0.0024078554,0.00017597091,0.00056632335,0.0010006102,0.000040944506,0.00025466256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688894,0.000033066746,0.0011569395,0.0004921961,0.0003966488,0.0010322353],"domain_scores_gemma":[0.99744165,0.0002445489,0.0003426744,0.0013213404,0.00040689568,0.00024291489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007329973,0.00048590134,0.00054958224,0.00057830854,0.0006594249,0.00083240273,0.0021343105,0.00029223075,0.000012273081],"category_scores_gemma":[0.00015147697,0.00045367266,0.0005432369,0.00080980064,0.00015862551,0.0023345542,0.0008420758,0.00040063736,0.00005267714],"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.000396568,0.0029834164,0.004261013,0.0026847804,0.0010460414,0.000016515154,0.02599262,0.0005607536,0.00017808986,0.72661805,0.085879795,0.14938238],"study_design_scores_gemma":[0.0075401515,0.00043262495,0.0015229089,0.00021229424,0.00008011321,0.000034513338,0.0009754676,0.6760442,0.0015102889,0.0045429105,0.30615696,0.0009475718],"about_ca_topic_score_codex":0.00002300167,"about_ca_topic_score_gemma":0.000030458199,"teacher_disagreement_score":0.7220751,"about_ca_system_score_codex":0.00009939408,"about_ca_system_score_gemma":0.00015196991,"threshold_uncertainty_score":0.9997915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13610138,0.00011285388,0.849028,0.0012001825,0.00063366286,0.0011047604,0.00038751686,0.00016766113,0.011264019],"genre_scores_gemma":[0.9699113,0.00005282474,0.025611417,0.0039939,0.000037350095,0.00010615101,0.00022326894,0.000014143597,0.000049682276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751705,0.0000792429,0.00088629924,0.0003326733,0.00047460457,0.00071014446],"domain_scores_gemma":[0.9979229,0.00026583378,0.00023658299,0.0013314051,0.00015149986,0.00009176937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011004156,0.00034614684,0.00036528683,0.00047365986,0.0003674874,0.00082690094,0.0025956843,0.00018228836,0.0000058228034],"category_scores_gemma":[0.00010732755,0.00026412818,0.00026057573,0.0009521247,0.00018051318,0.0023783275,0.0006046395,0.0005476159,0.00003296415],"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.000066355715,0.00045652673,0.0013807704,0.00024741347,0.000060640636,0.000005656934,0.022148011,0.00027982172,0.000019771396,0.9648063,0.0081619015,0.0023668248],"study_design_scores_gemma":[0.0029198942,0.00016584537,0.004096925,0.0001960167,0.000029011875,0.000021551867,0.003306324,0.82811385,0.00018481075,0.11049444,0.0498747,0.00059661525],"about_ca_topic_score_codex":0.000021867987,"about_ca_topic_score_gemma":0.000049515023,"teacher_disagreement_score":0.8543119,"about_ca_system_score_codex":0.000083686966,"about_ca_system_score_gemma":0.00017614946,"threshold_uncertainty_score":0.9999811},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35019484,0.00056424167,0.6351192,0.0033553245,0.00095979235,0.0007212331,0.0065318556,0.0007636502,0.0017898823],"genre_scores_gemma":[0.95791316,0.00015157844,0.025235048,0.0046204766,0.00020654194,0.000047982492,0.011778845,0.000020419795,0.000025942914],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99563974,0.00017459033,0.001341496,0.00095591723,0.00079342234,0.0010948144],"domain_scores_gemma":[0.9945401,0.00026175744,0.0004446387,0.004290182,0.00013185585,0.00033146757],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011878547,0.00055492145,0.0006376275,0.00050031097,0.0004482198,0.0012661535,0.0067772698,0.00028376983,0.00009473687],"category_scores_gemma":[0.0002691995,0.00054025784,0.00013858995,0.002030263,0.00020112115,0.007994348,0.0046675727,0.00093346817,0.00017030054],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075592595,0.0029815661,0.34891057,0.0008039146,0.0005478844,0.00024701108,0.016407352,0.00048405162,0.00091814814,0.2354459,0.11087681,0.28162086],"study_design_scores_gemma":[0.0072269966,0.00022272892,0.26499805,0.0007958309,0.00011044739,0.00006209428,0.0013048009,0.20623206,0.002602587,0.021987341,0.49225557,0.0022014808],"about_ca_topic_score_codex":0.002351514,"about_ca_topic_score_gemma":0.0006108375,"teacher_disagreement_score":0.60988414,"about_ca_system_score_codex":0.0000724042,"about_ca_system_score_gemma":0.0002279036,"threshold_uncertainty_score":0.99977064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621058,0.0045865397,0.021205314,0.009941763,0.000295567,0.0009263129,0.000057446086,0.000089711066,0.00079154875],"genre_scores_gemma":[0.9972444,0.0006097458,0.0002736562,0.0015654388,0.000061427134,0.00016615643,0.00003226835,0.000007101096,0.00003978962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9977333,0.0002957975,0.00044154457,0.0007716791,0.00023510282,0.0005225731],"domain_scores_gemma":[0.9979781,0.0004785026,0.00011637338,0.0011393077,0.00016718215,0.00012056248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007245965,0.00026211966,0.00025290347,0.0003395849,0.00055655546,0.00051148207,0.0016835554,0.00016026803,0.00004714632],"category_scores_gemma":[0.000171851,0.00018927516,0.000085553474,0.004510888,0.00016542786,0.0008668752,0.00057571434,0.00050484145,0.000055373006],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011677796,0.000587518,0.42666703,0.00010488974,0.00006699853,0.000010301645,0.0019439493,0.0000011997205,0.000786361,0.5602689,0.0012005878,0.0083506135],"study_design_scores_gemma":[0.0014171222,0.00009924522,0.8108729,0.000097991324,0.00006694278,0.000013185125,0.00052087486,0.011576177,0.0011266336,0.010413031,0.16325043,0.00054543425],"about_ca_topic_score_codex":0.000077150806,"about_ca_topic_score_gemma":0.0005223503,"teacher_disagreement_score":0.5498558,"about_ca_system_score_codex":0.000028437404,"about_ca_system_score_gemma":0.00020719209,"threshold_uncertainty_score":0.7718417},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9026854,0.0003907428,0.00013631742,0.00011811456,0.0024439688,0.0009362752,0.0019931935,0.000301635,0.090994336],"genre_scores_gemma":[0.997181,0.00020263877,0.0011981045,0.00039156748,0.00002097538,0.00016289702,0.00062421965,0.000041251315,0.00017732548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526024,0.0007000269,0.0010329363,0.001332174,0.0010114267,0.0006632037],"domain_scores_gemma":[0.9953347,0.001213503,0.00065438036,0.002242516,0.00037175813,0.00018318427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014842994,0.00067180773,0.00078208814,0.0014546558,0.0010922947,0.00017387042,0.002831574,0.00066853163,0.00012232877],"category_scores_gemma":[0.0006374743,0.00059467764,0.0006786568,0.004062791,0.00010230045,0.0010119623,0.0003796794,0.0022065544,0.00006543761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012040419,0.00060359115,0.000082740364,0.00021003625,0.00012777309,0.000010372639,0.00001919275,0.000018274346,0.001654565,0.971997,0.00004697725,0.025109045],"study_design_scores_gemma":[0.0009532481,0.0003225679,0.015353788,0.0014445134,0.0001493643,0.000003346414,0.00034403554,0.0002708295,0.018973643,0.94388735,0.017130159,0.0011671402],"about_ca_topic_score_codex":0.000674023,"about_ca_topic_score_gemma":0.0047299457,"teacher_disagreement_score":0.0944956,"about_ca_system_score_codex":0.00015118155,"about_ca_system_score_gemma":0.000101327634,"threshold_uncertainty_score":0.9996505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35589132,0.0018741428,0.6165125,0.0006855405,0.0054891063,0.0016672198,0.000240219,0.0005792775,0.017060708],"genre_scores_gemma":[0.9916861,0.0017471337,0.0028264248,0.0030872996,0.00016276789,0.000120922436,0.0002705328,0.00002008476,0.000078743535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99464554,0.0003244259,0.0019951349,0.0006745714,0.0007280575,0.0016322567],"domain_scores_gemma":[0.99641025,0.00024555597,0.0010465583,0.0015268362,0.00048107767,0.00028971286],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016218902,0.0007149085,0.0008025488,0.0013722301,0.0015925589,0.0014700085,0.0015692846,0.00036712212,0.00006658344],"category_scores_gemma":[0.0002868199,0.0007456382,0.00023438795,0.0033146883,0.0003728628,0.0072349324,0.00046393543,0.0009420844,0.0004631325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019145405,0.0001662555,0.0007565122,0.0017460544,0.00010669074,0.000003454975,0.0055834106,0.00038234532,0.0000053314293,0.24502864,0.0034528864,0.74257696],"study_design_scores_gemma":[0.0059871115,0.008898949,0.09147653,0.008072548,0.00024149731,0.00028651243,0.0014665631,0.5181862,0.0019323768,0.114094555,0.24546361,0.0038935554],"about_ca_topic_score_codex":0.00030726465,"about_ca_topic_score_gemma":0.00007551822,"teacher_disagreement_score":0.7386834,"about_ca_system_score_codex":0.0014575389,"about_ca_system_score_gemma":0.002015757,"threshold_uncertainty_score":0.9997072},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006291555,0.112259805,0.87637544,0.0005302457,0.0023085692,0.0015242501,0.0000403609,0.00006302294,0.0006067823],"genre_scores_gemma":[0.97759485,0.011709058,0.009870428,0.0002889292,0.00028674988,0.00016606992,0.000017932962,0.000019638554,0.000046357793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936441,0.0018930617,0.0010055057,0.001699682,0.0009609877,0.0007966507],"domain_scores_gemma":[0.99518466,0.002321007,0.00025773456,0.0015642241,0.0004437154,0.00022864327],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0051608593,0.00046489201,0.00071912043,0.0012229334,0.00067827257,0.0015405456,0.0017955214,0.00020666432,0.000006393122],"category_scores_gemma":[0.00013090447,0.00044212586,0.000104029146,0.0025151446,0.00039968788,0.0022821524,0.0015732698,0.00079801696,0.0000137838815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016778706,0.0024987564,0.006636753,0.014908243,0.00012549195,0.000072416995,0.0033737083,0.011573332,0.000078713405,0.26613823,0.0033043735,0.6911222],"study_design_scores_gemma":[0.0008601161,0.0006452492,0.0033842667,0.01373325,0.000018803004,0.0000047305452,0.00006170809,0.9526285,0.00008329874,0.023140697,0.005039777,0.0003995942],"about_ca_topic_score_codex":0.00009326812,"about_ca_topic_score_gemma":0.000040410345,"teacher_disagreement_score":0.9713033,"about_ca_system_score_codex":0.00010070939,"about_ca_system_score_gemma":0.00017794716,"threshold_uncertainty_score":0.99980307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27701116,0.00036530054,0.71971685,0.00038807746,0.0013810202,0.0005419724,0.00019180271,0.00018446852,0.00021932206],"genre_scores_gemma":[0.9649206,0.00030094638,0.03364172,0.00091574405,0.00009773442,0.0000042737224,0.00005845969,0.000020368117,0.000040182982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636465,0.00023080889,0.0010393371,0.00094557693,0.00058974756,0.0008298906],"domain_scores_gemma":[0.9976102,0.0003027789,0.00039137565,0.001027081,0.0003679158,0.000300655],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00080168707,0.0006424945,0.00061144395,0.000794457,0.0013913204,0.0010161009,0.00084024173,0.00029383544,0.000038235066],"category_scores_gemma":[0.000014818879,0.0006081131,0.00023268219,0.002414775,0.00019993317,0.0018358367,0.000051612915,0.0013800302,0.000018641142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032613948,0.0036105427,0.0007399499,0.0022664072,0.0013891519,0.00021144791,0.01214648,0.36645475,0.00043503588,0.0661822,0.0003315407,0.5429711],"study_design_scores_gemma":[0.0055695307,0.0010499011,0.0010009746,0.0014444145,0.00035770892,0.00012635188,0.00061848166,0.9723738,0.0051829903,0.00097520195,0.010131219,0.0011694267],"about_ca_topic_score_codex":0.00019491604,"about_ca_topic_score_gemma":0.00045891083,"teacher_disagreement_score":0.6879094,"about_ca_system_score_codex":0.000110359426,"about_ca_system_score_gemma":0.00032924308,"threshold_uncertainty_score":0.99990875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17444597,0.0018606494,0.8187677,0.00037275566,0.0024975701,0.00056099833,0.000096003416,0.00035315452,0.0010451465],"genre_scores_gemma":[0.97178954,0.00029218575,0.027098877,0.0005589766,0.00012675127,0.000014965078,0.00000867137,0.00003633124,0.0000736734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944805,0.00036333213,0.0010781443,0.0021228117,0.0006872008,0.0012680368],"domain_scores_gemma":[0.99705297,0.000344348,0.00031641682,0.0015094852,0.00028205727,0.0004946966],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001048408,0.0008335427,0.0008280599,0.00082448457,0.0028814038,0.001435025,0.0012613981,0.00045540452,0.000057156798],"category_scores_gemma":[0.000014309247,0.00091166946,0.00036344273,0.0022884924,0.00036334686,0.0009038,0.0000440452,0.001585837,0.00001937616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090270914,0.006413456,0.0013977146,0.0022201922,0.0014332306,0.000314824,0.015339681,0.27655512,0.0057194056,0.111238204,0.0005516075,0.5779138],"study_design_scores_gemma":[0.0016677902,0.00033672055,0.00055470684,0.0013272087,0.00016118308,0.000071503055,0.0007372143,0.9852391,0.0050997827,0.000775231,0.0030452472,0.0009843527],"about_ca_topic_score_codex":0.00021285132,"about_ca_topic_score_gemma":0.0003177042,"teacher_disagreement_score":0.7973436,"about_ca_system_score_codex":0.00012917063,"about_ca_system_score_gemma":0.0004103982,"threshold_uncertainty_score":0.9996016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16039605,0.0036558004,0.83227336,0.0006427371,0.0013025206,0.0002896863,0.00014616257,0.00013609939,0.001157551],"genre_scores_gemma":[0.8831564,0.019072479,0.09349854,0.000249797,0.002669346,0.00006377419,0.00039864276,0.00007997298,0.00081103307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436736,0.00058130163,0.0007691202,0.001077073,0.0008928472,0.002312321],"domain_scores_gemma":[0.9976465,0.00046889324,0.00030708354,0.0012199837,0.00016071789,0.00019681641],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012876512,0.0004644405,0.00050040626,0.0008138689,0.00079288095,0.00072834926,0.0027803434,0.00028271013,0.00011456716],"category_scores_gemma":[0.00009638449,0.00046395892,0.00060340494,0.00079432834,0.00013220521,0.0008748475,0.0012476384,0.006131635,0.000005966213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041734983,0.0012485208,0.022835845,0.0004384003,0.0054736794,0.00007685333,0.020934822,0.01875887,0.007822608,0.86995727,0.0010160141,0.051019758],"study_design_scores_gemma":[0.00080343016,0.000060404003,0.004224101,0.00041597747,0.00016717226,0.00015363382,0.00046954464,0.09866938,0.00059356535,0.89290786,0.0009361646,0.0005987974],"about_ca_topic_score_codex":0.0031083631,"about_ca_topic_score_gemma":0.0015162481,"teacher_disagreement_score":0.73877484,"about_ca_system_score_codex":0.00048201293,"about_ca_system_score_gemma":0.00697559,"threshold_uncertainty_score":0.9997812},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5119072,0.00027746012,0.48571855,0.00066030724,0.0011116492,0.0001978015,0.0000063038087,0.000018328332,0.00010234724],"genre_scores_gemma":[0.8316709,0.00014525343,0.16722624,0.00071454723,0.00023213345,0.0000011177613,0.0000020799262,0.0000042314027,0.0000035068806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801654,0.00031319607,0.00088218215,0.00028760408,0.00028500886,0.00021546528],"domain_scores_gemma":[0.9984563,0.0003360122,0.00040140032,0.0003090184,0.0002463572,0.00025093424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017869916,0.00015447049,0.0004534927,0.0002965832,0.00019707318,0.00026455914,0.0005844738,0.00013843882,0.000006401444],"category_scores_gemma":[0.00042476147,0.0001355624,0.00023431011,0.00055762235,0.0000793105,0.00081264466,0.00039203383,0.0004645722,0.0000020490268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04270015,0.009368657,0.095882446,0.0006299998,0.0022633155,0.0011005686,0.041822433,0.0015333492,0.000953037,0.4826552,0.05980156,0.2612893],"study_design_scores_gemma":[0.18963696,0.0061353063,0.15347373,0.0018699864,0.0009547027,0.0008338954,0.0009500372,0.12002915,0.0015560567,0.3010717,0.22108485,0.0024036274],"about_ca_topic_score_codex":0.00003103889,"about_ca_topic_score_gemma":0.000015006633,"teacher_disagreement_score":0.31976363,"about_ca_system_score_codex":0.000026783882,"about_ca_system_score_gemma":0.00020301496,"threshold_uncertainty_score":0.55280745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006329025,0.0029571531,0.9495051,0.005289142,0.0020892995,0.0013297638,0.00014465119,0.0004307512,0.031925093],"genre_scores_gemma":[0.9206666,0.00013008446,0.07611132,0.0021430457,0.00016428504,0.000120090976,0.00005049534,0.000028176224,0.0005859551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447083,0.00020812216,0.0008696711,0.0021098806,0.0009444473,0.0013970326],"domain_scores_gemma":[0.9958351,0.00066383934,0.00029726376,0.0020607433,0.00075003505,0.00039300823],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001871008,0.0007629224,0.0007554327,0.0010079627,0.001091362,0.0041275793,0.003419463,0.0004933635,0.00019344002],"category_scores_gemma":[0.00028244467,0.0006326835,0.00047339522,0.003035567,0.00033205305,0.003897103,0.001783622,0.0017605048,0.000010139525],"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.00025742623,0.00050926494,0.0043457896,0.0004175172,0.00038369733,0.000026038328,0.0009021935,0.00007927847,0.00024059096,0.9446982,0.016149549,0.031990465],"study_design_scores_gemma":[0.014325458,0.0016879803,0.04373961,0.0035921896,0.0010165342,0.0000776432,0.004729422,0.36218593,0.031988963,0.2602885,0.27084664,0.0055211256],"about_ca_topic_score_codex":0.00080986985,"about_ca_topic_score_gemma":0.0021218655,"teacher_disagreement_score":0.9143375,"about_ca_system_score_codex":0.000113800204,"about_ca_system_score_gemma":0.0007929197,"threshold_uncertainty_score":0.99961245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009955073,0.00005411042,0.9845979,0.0020160628,0.00061977544,0.00074016413,0.0001865455,0.0005921929,0.0012381326],"genre_scores_gemma":[0.9880231,0.0000038241515,0.009880065,0.001275159,0.00003701149,0.0005229206,0.00024402658,0.000007078832,0.000006787425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99840754,0.00013932394,0.00026111235,0.0005032574,0.00029936968,0.00038938943],"domain_scores_gemma":[0.99886084,0.00024090725,0.0000872732,0.0005769763,0.00010283924,0.0001311918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037972577,0.00018269445,0.00019196422,0.00027556054,0.000224474,0.00023322283,0.0006239979,0.00009719819,0.000008669717],"category_scores_gemma":[0.00009189711,0.00017304304,0.00011798554,0.0012643274,0.00007434382,0.00032973842,0.00014655235,0.0002368192,0.000024290934],"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.0002265831,0.0018799492,0.017200379,0.00017211687,0.00012657973,0.000051734016,0.00033166405,0.009507086,0.000043636835,0.5898837,0.074298464,0.3062781],"study_design_scores_gemma":[0.0016294593,0.000035916164,0.5437638,0.00003254503,0.000019734656,0.000002185715,0.000013217077,0.41484505,0.0002753736,0.01896557,0.020102907,0.0003142417],"about_ca_topic_score_codex":0.00001949947,"about_ca_topic_score_gemma":0.000018206612,"teacher_disagreement_score":0.97806805,"about_ca_system_score_codex":0.00006118167,"about_ca_system_score_gemma":0.000050039045,"threshold_uncertainty_score":0.705649},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38275492,0.010248322,0.6001006,0.0008366192,0.0035916301,0.0005312723,0.0003976134,0.00023396444,0.001305077],"genre_scores_gemma":[0.9913147,0.0033573834,0.0039222743,0.00092617515,0.000093196904,0.000016225447,0.00024859436,0.000012900277,0.00010855207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960192,0.00032455946,0.0009198903,0.001520759,0.0005256119,0.0006900131],"domain_scores_gemma":[0.9967381,0.0010028448,0.00025848733,0.0013035156,0.00038279913,0.00031428295],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008053462,0.00053244847,0.00069539424,0.0023472777,0.00059199537,0.0012182109,0.0012110508,0.00029015105,0.00049922965],"category_scores_gemma":[0.00035886874,0.00049903773,0.00027703427,0.0072912537,0.00038723048,0.0015753519,0.0011468901,0.0005314066,0.00015944349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014643859,0.0014555086,0.012685973,0.00022912794,0.0008087478,0.00016227041,0.0017733262,0.00001210531,0.007935144,0.4407268,0.009969292,0.5227773],"study_design_scores_gemma":[0.021361727,0.00089794217,0.08636646,0.0006968439,0.0006501942,0.00006948776,0.00090065424,0.6939114,0.0064050923,0.16614547,0.020403,0.002191729],"about_ca_topic_score_codex":0.0026989263,"about_ca_topic_score_gemma":0.00003805563,"teacher_disagreement_score":0.6938993,"about_ca_system_score_codex":0.00005675901,"about_ca_system_score_gemma":0.00024120399,"threshold_uncertainty_score":0.9998186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4321189,0.01599604,0.5100762,0.005491805,0.006974831,0.0012849607,0.0039992766,0.00022852546,0.02382945],"genre_scores_gemma":[0.9674529,0.001585504,0.029428832,0.0012038444,0.00007333389,0.000008969794,0.00019850071,0.000007618401,0.000040505085],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99651396,0.0006336383,0.0009286813,0.00094720745,0.00047971876,0.0004967913],"domain_scores_gemma":[0.99646217,0.0009727343,0.00031621716,0.0017747352,0.00028963765,0.00018449065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010313499,0.00035534802,0.0006250999,0.00025927427,0.00023164657,0.00040707842,0.0019432997,0.00014612301,0.00071944797],"category_scores_gemma":[0.00018546447,0.00034467605,0.0001956047,0.0019686224,0.00035466344,0.00061183644,0.0017209252,0.00030335487,0.000019578723],"study_design_candidate":"observational","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.0005418965,0.0031009594,0.28620058,0.00013238523,0.001077676,0.000011642917,0.0016666894,0.000008883451,0.0012865971,0.29859897,0.043084674,0.36428905],"study_design_scores_gemma":[0.0067267977,0.0004437873,0.704993,0.00042220825,0.0002440288,0.0000012251683,0.00019933771,0.032355502,0.06586909,0.009105002,0.17850155,0.001138491],"about_ca_topic_score_codex":0.05137691,"about_ca_topic_score_gemma":0.010166827,"teacher_disagreement_score":0.535334,"about_ca_system_score_codex":0.000038887327,"about_ca_system_score_gemma":0.0005088386,"threshold_uncertainty_score":0.9999005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32842827,0.0011395571,0.5606659,0.0034119673,0.0005158333,0.0005904013,0.000018705896,0.0005138272,0.10471553],"genre_scores_gemma":[0.98278445,0.000029087236,0.016191877,0.00089024263,0.000014617863,0.000023364135,0.00000733672,0.0000031645275,0.000055831664],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99866265,0.00009325005,0.00027183627,0.00046159062,0.0001892767,0.00032140984],"domain_scores_gemma":[0.9992509,0.00006414889,0.00004374874,0.0005341965,0.000051294384,0.000055728124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004563603,0.00014659768,0.00021696268,0.00039995945,0.000077241755,0.00021887496,0.0009647434,0.00008694747,0.00001648001],"category_scores_gemma":[0.000060907794,0.000135158,0.000056353234,0.001603934,0.000102719576,0.00076231937,0.00049355376,0.00027224282,0.0000083317855],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003908829,0.0014075447,0.042394098,0.00022643658,0.000010083054,0.000087703826,0.0034872738,0.000057137197,0.00010854825,0.37540436,0.0048773354,0.5719004],"study_design_scores_gemma":[0.002406946,0.00012781536,0.7967055,0.0003757409,0.000008485529,0.000010089143,0.00058451423,0.04620229,0.003023185,0.13993916,0.009862053,0.00075422967],"about_ca_topic_score_codex":0.0004964283,"about_ca_topic_score_gemma":0.0013170475,"teacher_disagreement_score":0.7543114,"about_ca_system_score_codex":0.000049489026,"about_ca_system_score_gemma":0.00023949973,"threshold_uncertainty_score":0.5511583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034892686,0.00008293757,0.9361323,0.00041007748,0.00012299692,0.00017192443,0.000057536985,0.00013694483,0.027992574],"genre_scores_gemma":[0.9367491,0.000006610144,0.06292132,0.00020336344,0.000013945485,0.000010114695,0.00004285579,0.000009649876,0.000043059852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792826,0.00039748265,0.00055341696,0.00040174508,0.00034038752,0.00037870157],"domain_scores_gemma":[0.9983451,0.0005969819,0.00016044432,0.0007370195,0.000033096356,0.0001273861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020138246,0.00019980267,0.00038076003,0.00018755365,0.00014364826,0.00011804114,0.0009286867,0.00010441107,0.00010323577],"category_scores_gemma":[0.000270917,0.00017049821,0.00017497757,0.0009863642,0.00010350071,0.00023116908,0.0002645339,0.00017900209,0.000040591698],"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.0000048874294,0.00046563733,0.008674106,0.00037909142,0.00005092427,0.000009036701,0.00011366097,0.0000068861314,0.0007204406,0.97602284,0.0028315044,0.010720996],"study_design_scores_gemma":[0.004839467,0.00024768582,0.084958136,0.0024492654,0.00013353281,0.000008375199,0.00013456066,0.5458047,0.058360685,0.2823047,0.018669669,0.0020892217],"about_ca_topic_score_codex":0.000009693359,"about_ca_topic_score_gemma":0.0000027047342,"teacher_disagreement_score":0.90185636,"about_ca_system_score_codex":0.000014992449,"about_ca_system_score_gemma":0.000053097505,"threshold_uncertainty_score":0.69527155},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007406128,0.004691368,0.9820597,0.0008399416,0.00090662227,0.0025801335,0.00042315078,0.0005160469,0.00057687104],"genre_scores_gemma":[0.6844359,0.0017685583,0.24476445,0.0011009012,0.0018139897,0.008880829,0.053727157,0.00044499044,0.0030632163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954286,0.0003141248,0.00076897175,0.0019240663,0.000743057,0.0008211602],"domain_scores_gemma":[0.9954866,0.00048218205,0.0008432829,0.0015603732,0.0012410729,0.00038647724],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006722617,0.00080657017,0.00079854083,0.0005365662,0.0016271048,0.0009308259,0.0015295786,0.0006417092,0.0008585092],"category_scores_gemma":[0.00023424353,0.00096133346,0.00073116826,0.0021685336,0.00009984489,0.00062826264,0.0002040217,0.0011848941,0.00011906561],"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.0025286602,0.0071217897,0.005197359,0.017653465,0.0017420318,0.00020444235,0.08580459,0.005206453,0.0844612,0.42276704,0.008191382,0.3591216],"study_design_scores_gemma":[0.0044239084,0.0010797359,0.003413902,0.0012433721,0.0008146482,0.00003560985,0.009102062,0.4500313,0.016708529,0.0030791257,0.50641423,0.0036535955],"about_ca_topic_score_codex":0.00033181324,"about_ca_topic_score_gemma":0.0007549919,"teacher_disagreement_score":0.73729527,"about_ca_system_score_codex":0.00011554522,"about_ca_system_score_gemma":0.0010720348,"threshold_uncertainty_score":0.99967265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32451016,0.0009120144,0.66956174,0.00063788623,0.00070951757,0.000699121,0.000018179662,0.0007158071,0.0022355733],"genre_scores_gemma":[0.949667,0.00015492621,0.048953254,0.0003628233,0.00007101257,0.00004478567,0.000049978404,0.000040835283,0.0006553958],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940238,0.0005741274,0.0010379901,0.002091025,0.00093195355,0.0013410788],"domain_scores_gemma":[0.9960919,0.00033992116,0.0004143181,0.0019490012,0.00081280846,0.00039204286],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014329139,0.00078686356,0.00066637876,0.00074224855,0.0028197328,0.004769167,0.0027016306,0.00038820886,0.00054803136],"category_scores_gemma":[0.00044703254,0.0007093663,0.0002817491,0.004347037,0.0005230567,0.0014337492,0.0033696538,0.0013866886,0.0002137801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020285097,0.008394465,0.3699269,0.0024439516,0.0013863612,0.0007090735,0.015717512,0.22717836,0.01179294,0.28332776,0.0039466964,0.073147476],"study_design_scores_gemma":[0.0031793981,0.0004132161,0.05498607,0.0006675062,0.000076026045,0.000026709598,0.00031588762,0.9305135,0.003261552,0.00053447916,0.005122645,0.00090297865],"about_ca_topic_score_codex":0.0007767054,"about_ca_topic_score_gemma":0.00035506848,"teacher_disagreement_score":0.70333517,"about_ca_system_score_codex":0.00015673904,"about_ca_system_score_gemma":0.00058313354,"threshold_uncertainty_score":0.99953574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009771109,0.00035458666,0.9804069,0.0075290226,0.006707734,0.001398416,0.00048824513,0.00043627276,0.0017017277],"genre_scores_gemma":[0.9073797,0.0001790784,0.086931355,0.002982762,0.0011742732,0.0001298792,0.0009906539,0.000041897332,0.00019040404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956484,0.00026884515,0.00073739083,0.002039234,0.0005783628,0.00072781],"domain_scores_gemma":[0.99143714,0.0008532674,0.00025144118,0.0069737504,0.00029727208,0.00018710781],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018240804,0.00045938173,0.00041746206,0.00084026734,0.0008887515,0.0010843421,0.00603592,0.0003023114,0.0001488806],"category_scores_gemma":[0.0008117016,0.00046881317,0.00024320994,0.002441502,0.00016133838,0.0018574204,0.0034568012,0.000408564,0.000054798533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088310195,0.0023661389,0.00087681325,0.0013306324,0.00022938354,0.000011593769,0.0003960567,0.0025530574,0.0022075067,0.28774837,0.23897435,0.462423],"study_design_scores_gemma":[0.0015832348,0.00037307775,0.0014745148,0.00034989355,0.00009609828,0.0000013292158,0.0000408515,0.85885036,0.0015861728,0.02885477,0.106340334,0.00044933954],"about_ca_topic_score_codex":0.0002687078,"about_ca_topic_score_gemma":0.00016718468,"teacher_disagreement_score":0.9064026,"about_ca_system_score_codex":0.000094094394,"about_ca_system_score_gemma":0.0005798459,"threshold_uncertainty_score":0.9999526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3659662,0.0013048925,0.6268971,0.0033873464,0.001905414,0.00045690546,0.000021485801,0.000034700413,0.000025924366],"genre_scores_gemma":[0.9751289,0.00015067335,0.023024784,0.0004209205,0.0012429132,0.000002252165,0.000004713825,0.000020689082,0.000004135771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950262,0.0002894308,0.0020122537,0.00092535425,0.001019353,0.00072741957],"domain_scores_gemma":[0.9967126,0.00051204656,0.0010624849,0.00057953334,0.00069578027,0.00043752464],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014915103,0.0005666028,0.0008872623,0.0006895566,0.0008510047,0.0036950158,0.0012950138,0.00021607558,0.00004196801],"category_scores_gemma":[0.00026732296,0.000533109,0.0004195044,0.0016633231,0.00021750867,0.001592927,0.000644769,0.0009958175,0.00000717465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042628142,0.00040798602,0.008119885,0.0000744669,0.00019187357,0.00007111372,0.011759419,0.0047867433,0.0014997048,0.03335033,0.0000781379,0.9392341],"study_design_scores_gemma":[0.00023906348,0.001079124,0.0020810652,0.0033301786,0.00017236687,0.000065560875,0.0024490636,0.81242007,0.021034453,0.15423067,0.0021988428,0.0006995254],"about_ca_topic_score_codex":0.00009312607,"about_ca_topic_score_gemma":0.000033684075,"teacher_disagreement_score":0.93853456,"about_ca_system_score_codex":0.00015892036,"about_ca_system_score_gemma":0.00042277624,"threshold_uncertainty_score":0.99971205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068019405,0.001092241,0.9226871,0.0012538693,0.002627935,0.0013493502,0.000068346635,0.0005615859,0.0023401838],"genre_scores_gemma":[0.8302014,0.00032409723,0.16447584,0.0044827824,0.00009993787,0.0001033057,0.00014035446,0.000034767243,0.00013752191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471164,0.00039848074,0.0011129112,0.0016563366,0.0005307324,0.0015899251],"domain_scores_gemma":[0.9966899,0.0010663226,0.00036913055,0.00106621,0.00040961397,0.00039878793],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009608569,0.00069772004,0.0007635323,0.0005829805,0.0020230012,0.002189053,0.001580849,0.0006166153,0.00019369867],"category_scores_gemma":[0.0008479631,0.00074128085,0.0006492048,0.0027417454,0.00019907791,0.00065680494,0.00057736714,0.0010616739,0.000037240876],"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.00077538134,0.001055875,0.01235273,0.0006295894,0.0003591092,0.000032048065,0.0011129112,0.003911499,0.0002828468,0.8575494,0.0022901618,0.11964842],"study_design_scores_gemma":[0.0053687906,0.00033448244,0.0013257085,0.0011014885,0.00013223379,0.0000016838774,0.00034201614,0.8754146,0.0076956637,0.03709978,0.07007046,0.001113088],"about_ca_topic_score_codex":0.00007931231,"about_ca_topic_score_gemma":0.00005849501,"teacher_disagreement_score":0.8715031,"about_ca_system_score_codex":0.00014909559,"about_ca_system_score_gemma":0.0005517501,"threshold_uncertainty_score":0.99950385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91008,0.013343796,0.06572828,0.0093789045,0.0005909534,0.00077896926,0.000051978674,0.000009717273,0.000037357728],"genre_scores_gemma":[0.9964417,0.0021550998,0.001015651,0.00006936062,0.0002552189,0.00000955808,0.00000865429,0.000009762396,0.00003498517],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99639785,0.00018612939,0.00087613834,0.0006867901,0.0013135436,0.00053957064],"domain_scores_gemma":[0.99643683,0.000261758,0.000490705,0.00050415756,0.0018898799,0.00041667826],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020246722,0.00027241764,0.0005698454,0.0010740368,0.00059653923,0.004909666,0.0002701722,0.00013641472,0.000007624125],"category_scores_gemma":[0.00069545186,0.00021520056,0.00008576521,0.0014194078,0.00034415929,0.0027238394,0.0010236334,0.0005764527,1.754349e-7],"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.0006953092,0.0006577605,0.584236,0.00081486406,0.000438206,0.0072075357,0.0027191958,0.000016638214,0.0043597785,0.0012860231,0.0015372807,0.39603135],"study_design_scores_gemma":[0.0010401956,0.0010563353,0.8965852,0.0034908582,0.00008591784,0.0026507727,0.00058854604,0.001791674,0.0016717725,0.08301815,0.0075829774,0.00043758866],"about_ca_topic_score_codex":0.0003592722,"about_ca_topic_score_gemma":0.00007845523,"teacher_disagreement_score":0.39559376,"about_ca_system_score_codex":0.00006159897,"about_ca_system_score_gemma":0.0005845903,"threshold_uncertainty_score":0.9961233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007795851,0.004957112,0.9780544,0.005479087,0.0007757674,0.0008853055,0.0006608091,0.00017985536,0.0012118086],"genre_scores_gemma":[0.68080974,0.0017163906,0.31452918,0.00067375525,0.00021184766,0.000019576471,0.0011899451,0.000022207301,0.00082738925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997005,0.00021395496,0.00056293764,0.0014248728,0.0002783358,0.0005148856],"domain_scores_gemma":[0.9962806,0.000704834,0.00008018807,0.0025164434,0.0002355309,0.00018241917],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013437213,0.00030653895,0.00035329073,0.00030256854,0.0013668971,0.0015581375,0.0036460697,0.00016392756,0.0002566785],"category_scores_gemma":[0.0028212995,0.00030264718,0.00008493588,0.0015163114,0.00015045404,0.0022082757,0.009986855,0.00048512375,0.000005653456],"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.0003682465,0.00052642514,0.008906631,0.0007494417,0.00046422944,0.000009709362,0.002753165,0.0001561482,0.005506201,0.9190543,0.015476589,0.04602886],"study_design_scores_gemma":[0.0010089426,0.00014577426,0.001655027,0.00010898152,0.000082552186,0.0000041766625,0.00010365026,0.9025183,0.000672679,0.0036187244,0.08976765,0.00031359406],"about_ca_topic_score_codex":0.00038152808,"about_ca_topic_score_gemma":0.00047271606,"teacher_disagreement_score":0.9154356,"about_ca_system_score_codex":0.000024074749,"about_ca_system_score_gemma":0.0003022808,"threshold_uncertainty_score":0.99994254},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050936337,0.42113432,0.56587553,0.0042667496,0.0013842186,0.0067182197,0.000023998122,0.000020162643,0.00006745383],"genre_scores_gemma":[0.20922633,0.65840596,0.115724005,0.0042663002,0.0063098385,0.0058192513,0.000033387496,0.0001698896,0.00004502376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"systematic_review","domain_scores_codex":[0.9903119,0.0036641846,0.0026758197,0.00082117185,0.0017236571,0.0008032382],"domain_scores_gemma":[0.992918,0.0016918697,0.0012612351,0.00073716306,0.0029801638,0.0004115244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0088358475,0.0005008714,0.0017707099,0.0032732412,0.00031879873,0.0009066079,0.0025263955,0.00026111217,0.0000032720686],"category_scores_gemma":[0.00057501195,0.00039666038,0.0005740249,0.0042479495,0.00031005562,0.00027696765,0.00071899034,0.0017583465,6.311042e-7],"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.00025152898,0.00055249064,0.000033511642,0.06668722,0.0017234967,0.000028945902,0.00046710874,0.000017911456,0.000086325985,0.8959355,0.00048119572,0.03373476],"study_design_scores_gemma":[0.0038276878,0.015143659,0.00066538533,0.50701255,0.0017034946,0.006635124,0.00030484088,0.20523779,0.00043648804,0.21101227,0.046133842,0.0018868757],"about_ca_topic_score_codex":0.000048333703,"about_ca_topic_score_gemma":0.000007941829,"teacher_disagreement_score":0.68492323,"about_ca_system_score_codex":0.00017650727,"about_ca_system_score_gemma":0.00087219896,"threshold_uncertainty_score":0.99984854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003029639,0.00023945776,0.9970106,0.00032921127,0.00049396214,0.0003494842,0.000019945319,0.00011649296,0.0011378768],"genre_scores_gemma":[0.45516652,0.000036404806,0.54425234,0.00030987727,0.0001402963,0.000008250038,0.000051337614,0.000020704154,0.000014293967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971362,0.000046524,0.00049027515,0.0010863453,0.0008711825,0.0003694762],"domain_scores_gemma":[0.9974763,0.00034051383,0.0004514021,0.0013805603,0.00022720727,0.0001240278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006725121,0.00036355824,0.00043889132,0.0007622748,0.00023333645,0.0002806953,0.0019926555,0.00021451875,0.000011322065],"category_scores_gemma":[0.00003688516,0.000328482,0.00009448027,0.0009630872,0.0007040422,0.0006940963,0.0002966559,0.0004707889,0.000008874774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015750556,0.000062262865,0.00007675479,0.00009566703,0.000019266372,0.000010984407,0.0011170056,0.12217353,0.00019864233,0.33219796,0.000053011645,0.54397917],"study_design_scores_gemma":[0.0004511389,0.00041237296,0.00108233,0.000392809,0.000019939307,0.000043742177,4.520411e-7,0.87945515,0.0014312519,0.111357525,0.0046847104,0.0006685953],"about_ca_topic_score_codex":0.000028748245,"about_ca_topic_score_gemma":0.00007709477,"teacher_disagreement_score":0.7572816,"about_ca_system_score_codex":0.000108618515,"about_ca_system_score_gemma":0.00040249602,"threshold_uncertainty_score":0.99991673},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057029136,0.0005974287,0.9401461,0.00009627329,0.00017804955,0.00012820915,0.000026655738,0.00012548006,0.0016727069],"genre_scores_gemma":[0.8889659,0.000044287914,0.11083114,0.00008524848,0.000025538247,0.000011904528,0.000026588486,0.0000065390827,0.0000028186453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988954,0.00008522238,0.00023603601,0.00031518118,0.00025424644,0.00021391132],"domain_scores_gemma":[0.99912685,0.0000689567,0.00010280782,0.00034053723,0.00016805565,0.00019276394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036230296,0.00014127561,0.0002046686,0.0002954736,0.00012873938,0.00012697668,0.000293981,0.00006783799,0.000005603484],"category_scores_gemma":[0.000019009183,0.00013301728,0.00010618506,0.0010671893,0.00013691698,0.00043169784,0.0001074798,0.00009321055,0.0000053672366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013261041,0.00057004095,0.030705003,0.000113109825,0.00021000669,0.000012063409,0.0047842157,0.00084715476,0.0035586788,0.89961874,0.019294115,0.040154263],"study_design_scores_gemma":[0.007823859,0.0035678577,0.045152146,0.00025089958,0.00026729755,0.00013138051,0.0053436332,0.15785208,0.007916292,0.689431,0.0797998,0.002463754],"about_ca_topic_score_codex":0.00011080866,"about_ca_topic_score_gemma":0.000011184595,"teacher_disagreement_score":0.8319368,"about_ca_system_score_codex":0.000005356824,"about_ca_system_score_gemma":0.00004162388,"threshold_uncertainty_score":0.54242873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011842282,0.001980803,0.98202646,0.00044554658,0.00019754753,0.00028771046,0.000030118166,0.00023113514,0.0029584104],"genre_scores_gemma":[0.9114725,0.0007729079,0.08733583,0.00026599373,0.000066442684,0.000054855183,0.000008246683,0.000015342794,0.000007892285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828637,0.0001504687,0.00023640298,0.0004893763,0.00041717725,0.00042022963],"domain_scores_gemma":[0.99852115,0.00016300978,0.00009861749,0.0007406327,0.00018660388,0.00029001656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912614,0.00021519858,0.00023670805,0.00015951159,0.000554854,0.00065141584,0.00079015055,0.00008069965,0.0000027193005],"category_scores_gemma":[0.000060142625,0.00014928576,0.00017463048,0.0009808275,0.0002910957,0.0005658966,0.000254474,0.00021103506,0.000008458135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001337579,0.00007237473,0.0053707203,0.000004830803,0.00006063741,0.0000064572496,0.0011551247,0.00004891146,0.000074953256,0.98091704,0.0071855774,0.0049696323],"study_design_scores_gemma":[0.0031661307,0.00037820503,0.003153753,0.000021037982,0.000041198222,0.000022587374,0.0006150547,0.081527986,0.00030423558,0.88936985,0.02086255,0.00053744315],"about_ca_topic_score_codex":0.000040616902,"about_ca_topic_score_gemma":0.000039920204,"teacher_disagreement_score":0.8996302,"about_ca_system_score_codex":0.000014229183,"about_ca_system_score_gemma":0.00006238616,"threshold_uncertainty_score":0.6281618},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556389,0.00004933245,0.036807083,0.0008173191,0.0012201844,0.0004861256,0.00010665523,0.00031502984,0.004559376],"genre_scores_gemma":[0.10602207,0.0014516172,0.7959437,0.0002911321,0.00022037922,0.0000013151317,0.00872178,0.000072149225,0.08727589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99895275,0.000053498912,0.00014619743,0.00026430856,0.00035699116,0.0002262624],"domain_scores_gemma":[0.99868464,0.00003105805,0.0003703639,0.0006006646,0.00020392524,0.00010931918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019427041,0.00017999655,0.00025150948,0.00035049175,0.00016665427,0.000067472094,0.000876845,0.00030355013,0.00012302533],"category_scores_gemma":[0.0000322732,0.00020992103,0.00015742278,0.0004065855,0.00006225486,0.003029382,0.0001952926,0.00032302388,0.00017913281],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010910152,0.0003212278,0.00037595612,0.000784551,0.00026529378,0.000102877835,0.36994544,0.0000018161383,0.00075499126,0.59653133,0.017488224,0.012337278],"study_design_scores_gemma":[0.012654879,0.003816204,0.13130122,0.002076165,0.0017216336,0.00016714649,0.37464264,0.009814041,0.049484365,0.11532272,0.2902743,0.008724686],"about_ca_topic_score_codex":0.0048999484,"about_ca_topic_score_gemma":0.0029798658,"teacher_disagreement_score":0.8496168,"about_ca_system_score_codex":0.000024816185,"about_ca_system_score_gemma":0.00011940709,"threshold_uncertainty_score":0.8560331},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04339377,0.0023666036,0.9484203,0.0026100597,0.0024940409,0.0004238752,0.00009988834,0.000070175774,0.000121304096],"genre_scores_gemma":[0.9575113,0.00068312266,0.041016035,0.00016987146,0.00048874377,0.00007383543,0.00003401106,0.000014155469,0.0000089453415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778694,0.00021896783,0.0008542989,0.0002507689,0.0006437461,0.0002452716],"domain_scores_gemma":[0.9952088,0.00069051,0.0007879734,0.0012991995,0.0018543836,0.00015914676],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004475506,0.00021034692,0.00041386057,0.0003597372,0.00031215863,0.00018134831,0.006862321,0.000090113805,0.000004204847],"category_scores_gemma":[0.00005125458,0.0001945518,0.00044830868,0.0003355615,0.0001595406,0.000989742,0.00043700877,0.0004540724,0.000008116971],"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.00046579904,0.00402288,0.0031359398,0.000056048455,0.0026040173,0.00010929825,0.00609995,0.0065914644,0.01102077,0.8715353,0.033680413,0.060678102],"study_design_scores_gemma":[0.0042397515,0.00042262147,0.0021215808,0.00016657244,0.000070087386,0.00072638824,0.00017319873,0.8720007,0.0003927125,0.0074260514,0.111693785,0.0005665353],"about_ca_topic_score_codex":0.000019798481,"about_ca_topic_score_gemma":0.0000040332984,"teacher_disagreement_score":0.9141175,"about_ca_system_score_codex":0.00008611301,"about_ca_system_score_gemma":0.00015590177,"threshold_uncertainty_score":0.998511},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018234749,0.00021298567,0.9921571,0.0010166619,0.002507203,0.001982273,0.00001647175,0.00012460638,0.00015924167],"genre_scores_gemma":[0.32866174,0.000007617739,0.6691443,0.0014705781,0.000507227,0.00013602387,0.00003299967,0.00002860513,0.000010919604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543554,0.00007444575,0.00045604035,0.0019936676,0.0013112534,0.0007290851],"domain_scores_gemma":[0.9967104,0.00053978997,0.000259058,0.0017843287,0.00044471867,0.0002617097],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020582785,0.0004828942,0.0004423655,0.0013502276,0.00024218117,0.0013334072,0.0026869848,0.0004178147,0.000017386854],"category_scores_gemma":[0.00040237178,0.00046177293,0.00012666291,0.0012327179,0.00022436315,0.0010631557,0.00074195664,0.000672789,0.000023037324],"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.0000083771465,0.000056812267,0.0000368861,0.000030731728,0.0000050293315,0.000003620866,0.0009098958,0.04319413,0.00011264348,0.26591262,0.000020241067,0.689709],"study_design_scores_gemma":[0.00022382007,0.00029617758,0.00079264934,0.00025658586,0.000007899655,0.000005184927,3.8675796e-7,0.49523127,0.0002536515,0.5012681,0.0012201631,0.0004441128],"about_ca_topic_score_codex":0.000020265798,"about_ca_topic_score_gemma":0.00011822951,"teacher_disagreement_score":0.6892649,"about_ca_system_score_codex":0.00034045678,"about_ca_system_score_gemma":0.00033270617,"threshold_uncertainty_score":0.9997834},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019663016,0.0031448384,0.91198003,0.0011542541,0.00520697,0.00030178396,0.000057817182,0.00048974145,0.075698264],"genre_scores_gemma":[0.17918472,0.009928038,0.8031791,0.0010666194,0.001488326,0.000048303627,0.0000405688,0.00010607608,0.004958277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983158,0.00000419979,0.0002537723,0.00070824346,0.00046094734,0.00025701371],"domain_scores_gemma":[0.999266,0.000059802365,0.00007892942,0.00037997175,0.00008689811,0.0001283499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024551287,0.0002695062,0.00021252799,0.00075152825,0.00010197897,0.0006307293,0.0012110366,0.00010047182,0.000020618596],"category_scores_gemma":[0.000011739345,0.00027513952,0.00005083946,0.00021597606,0.00037314373,0.0013575675,0.0010275458,0.00029209311,0.00000442336],"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.0000017198838,0.000009807106,0.0001253628,0.000024907578,0.00001573951,0.000029366392,0.00025959653,0.00013820533,0.000009709594,0.9840212,0.000106463915,0.015257946],"study_design_scores_gemma":[0.00055436685,0.00023006188,0.005759961,0.0007042773,0.000014641396,0.0005312476,0.0000071213367,0.47814918,0.000071672184,0.11435077,0.39815864,0.0014680638],"about_ca_topic_score_codex":0.0000075561948,"about_ca_topic_score_gemma":0.000004438473,"teacher_disagreement_score":0.8696704,"about_ca_system_score_codex":0.00002855567,"about_ca_system_score_gemma":0.000020978456,"threshold_uncertainty_score":0.9999701},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014896895,0.001460525,0.9922973,0.0031114193,0.00074294186,0.00032507445,0.0000120356035,0.000037003043,0.0005240121],"genre_scores_gemma":[0.65173084,0.00035856495,0.3418357,0.0053824335,0.0006363971,0.000008836612,0.0000110588835,0.000025931638,0.000010203258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691814,0.00013990008,0.00051922206,0.0010693412,0.0008268007,0.00052659365],"domain_scores_gemma":[0.9973336,0.0008126863,0.00035321596,0.0012974199,0.000092309965,0.00011077259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027921752,0.0003460892,0.0005047674,0.00061991176,0.00023877867,0.0003322353,0.0040291934,0.00018990008,0.0000068452428],"category_scores_gemma":[0.00013531449,0.0002650042,0.00009987719,0.00072742905,0.0005837237,0.0003996086,0.002040601,0.00093961385,0.0000013419634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015173336,0.000056367655,0.0015706053,0.00041610762,0.0000127947205,0.000038312348,0.028171506,0.0007183922,0.000030175137,0.20015575,0.0002832093,0.7685316],"study_design_scores_gemma":[0.00055051234,0.0005632526,0.0030037258,0.0019418433,0.000007772708,0.00018968238,0.000007181661,0.47670662,0.00010109195,0.5047456,0.011212835,0.00096985867],"about_ca_topic_score_codex":0.00029819,"about_ca_topic_score_gemma":0.00083299255,"teacher_disagreement_score":0.76756173,"about_ca_system_score_codex":0.00007808853,"about_ca_system_score_gemma":0.00036894818,"threshold_uncertainty_score":0.9999802},"labels":[],"label_agreement":null}]}